int:\n # Phase 1: Find the intersection point in the cycle\n tortoise = nums[0]\n hare = nums[0]\n \n # Move tortoise by 1 step and hare by 2 steps\n while True:\n tortoise = nums[tortoise] # Move 1 step\n hare = nums[nums[hare]] # Move 2 steps\n if tortoise == hare:\n break # They meet, cycle is detected\n \n # Phase 2: Find the entrance to the cycle\n tortoise = nums[0] # Reset tortoise to the start\n while tortoise != hare:\n tortoise = nums[tortoise] # Move both 1 step at a time\n hare = nums[hare]\n \n # They meet at the entrance to the cycle (the duplicate number)\n return hare\n\n","runtime":"417"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n fast = nums[0]\n slow = nums[0]\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n\n slow = nums[0]\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast]\n return slow","runtime":"423"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashmap = defaultdict(int)\n for n in nums:\n if hashmap[n]:\n return n\n hashmap[n] += 1 \n ","runtime":"423"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n return Counter(nums).most_common(1)[0][0]","runtime":"430"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n # similar to Linked List Cycle II.\n # every element can be treated as a linklist node: val is the value, next is the val-index, which means we use index to indicate the address of next node. eg. 5 is a node( val = 5, next = nums[5])\n fast, slow = 0, 0\n while True:\n fast = nums[nums[fast]]\n slow = nums[slow]\n if slow == fast:\n break\n slow2 = 0\n while True:\n slow2 = nums[slow2]\n slow = nums[slow]\n if slow2 == slow:\n return slow2\n \n","runtime":"430"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow, fast = 0, 0\n while True:\n slow = nums[slow]\n fast = nums[fast]\n fast = nums[fast]\n if slow == fast:\n break\n \n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n if slow == slow2:\n return slow","runtime":"436"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow, fast = 0, 0\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n\n if slow == fast:\n break\n\n slow2 = 0\n\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n\n if slow == slow2:\n return slow","runtime":"436"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n # idea: same as cycle linked list II\n # which find the start of the cycle\n # Since nums[i] is inclusively in [1, n] and there is a duplicate\n # ==> there is always a cycle if expressed under linked list \n\n # find intersection \n slow, fast = 0, 0\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n \n # find the start of cycle \n slow = 0\n while True:\n slow = nums[slow]\n fast = nums[fast]\n if fast == slow:\n return fast","runtime":"443"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d=dict()\n for i in range(len(nums)):\n if nums[i] in d:\n d[nums[i]]+=1\n else:\n d[nums[i]]=1\n for k,v in d.items():\n if v>1:\n return k\n ","runtime":"443"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n p1=nums[0]\n p2=nums[0]\n while True:\n p1=nums[p1]\n p2=nums[nums[p2]]\n if p1 == p2:\n break\n ptr1=nums[0]\n ptr2=p1\n while ptr1 != ptr2:\n ptr1=nums[ptr1]\n ptr2=nums[ptr2]\n return ptr1","runtime":"449"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n #Construct a num[i]->num[num[i]] map, it will form a cycle.\n #Get the begining point of the cycle.\n p1=p2=nums[0]\n while True:\n p1=nums[p1]\n p2=nums[nums[p2]]\n if p1==p2:\n break\n p1=nums[0]\n while p1!=p2:\n p1=nums[p1]\n p2=nums[p2]\n return p1","runtime":"449"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n=len(nums)\n f=[0]*(n+1)\n for i in range(n):\n if (f[nums[i]])==0:\n f[nums[i]]+=1\n else:\n return nums[i]","runtime":"455"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = 0\n fast = 0\n \n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break \n \n \n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n \n if slow == slow2:\n return slow\n","runtime":"455"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n num_count={}\n for i in nums:\n num_count[i]=num_count.get(i,0)+1\n for num,count in num_count.items():\n if count>1:\n return num ","runtime":"462"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = fast = 0\n\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n\n if slow == fast:\n break\n \n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n if slow == slow2:\n return slow","runtime":"462"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n s = set()\n for n in nums:\n if n not in s: s.add(n)\n else:\n return n","runtime":"468"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \"\"\"\n So in order to know how to solve this problem we must know the existance of\n floyds algorithm. That's the only way.\n\n So basically, we treat the list as a linked list, where the values represent the index\n of the next node. Then, as the list must has duplicates, it means that it has a cycle.\n Then we must utilize floyds algorithm to find the begining of the cycle which is\n the repeated number\n \"\"\"\n\n # We first find the intersection of a fast and a slow pointer\n slow, fast = nums[0], nums[0]\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n\n # Then we find the begining of the cycle by placing another slow\n # pointer at the begining of the list and waiting for them to colide\n slow2 = nums[0]\n while slow2 != slow:\n slow = nums[slow]\n slow2 = nums[slow2]\n\n return slow","runtime":"468"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n idx = abs(nums[i])\n if nums[idx] < 0:\n return idx\n nums[idx] = -nums[idx]\n return -1","runtime":"475"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n ind = abs(nums[i]) #得到nums[i]的数值 ([1,n])\n if nums[ind] < 0:\n return ind\n nums[ind] = -nums[ind] #将nums[ind]变成负的（说明遍历到过ind），因此如果再次访问到ind，则会发现nums[ind]是负数\n return -1","runtime":"475"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen = {}\n for n in nums:\n if n in seen:\n seen[n] += 1\n else:\n seen[n] = 1\n\n for n in seen:\n if seen[n] > 1:\n return n","runtime":"481"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n curr = 0\n while True:\n nxt = nums[curr]\n nums[curr] *= -1\n if nums[nxt] < 0:\n return nxt\n curr = nxt\n ","runtime":"481"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n idx = abs(nums[i])\n if nums[idx] < 0:\n return idx\n nums[idx] = -nums[idx]\n # TODO -> reset values\n return -1","runtime":"487"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow,fast=nums[0],nums[0]\n while True:\n slow=nums[slow]\n fast=nums[nums[fast]]\n if slow==fast:\n break\n fast=nums[0]\n while slow!=fast:\n slow=nums[slow]\n fast=nums[fast]\n return fast","runtime":"487"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n i = 0\n while i < len(nums):\n index = nums[i] - 1\n if index == i:\n i += 1\n continue\n if nums[i] == nums[index]: return nums[i]\n nums[i], nums[index] = nums[index], nums[i]","runtime":"494"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = nums[0]\n fast = nums[0]\n \n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n \n slow = nums[0]\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast] \n \n return slow\n","runtime":"494"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n res = -1\n for i in nums:\n ind = abs(i)\n if nums[ind-1] < 0:\n res = ind\n break\n # return ind\n nums[ind-1] *= -1\n for i in range(len(nums)):\n nums[i] = abs(nums[i])\n return res\n ","runtime":"500"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n tortoise = nums[0]\n hare = nums[0]\n while True:\n tortoise = nums[tortoise]\n hare = nums[nums[hare]]\n if tortoise == hare:\n break\n ptr1 = nums[0]\n ptr2 = tortoise\n while ptr1!= ptr2:\n ptr1 = nums[ptr1]\n ptr2 = nums[ptr2]\n\n return ptr1","runtime":"500"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n res = -1\n for i in nums:\n ind = abs(i)\n if nums[ind-1] < 0:\n res = ind\n break\n # return ind\n nums[ind-1] *= -1\n # for i in range(len(nums)):\n # nums[i] = abs(nums[i])\n return res\n ","runtime":"507"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(0,len(nums)):\n if nums[i] == nums[i+1]:\n return nums[i]\n ","runtime":"507"},{"code":"class Solution:\n def findDuplicate(self, a: List[int]) -> int:\n a.sort()\n for i in range(len(a)-1):\n if a[i]==a[i+1]:\n return a[i]","runtime":"513"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n ans = None\n for n in nums:\n if n < 0: n = -n\n if nums[n-1] < 0:\n ans = n\n break\n else:\n nums[n-1] = -nums[n-1]\n \n for i in range(len(nums)):\n nums[i] = abs(nums[i])\n \n return ans","runtime":"513"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i] == nums[i+1]:\n return nums[i]\n return -1","runtime":"519"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \n for i in range(len(nums)):\n cur = abs(nums[i])\n if nums[cur] < 0:\n res = cur\n break\n nums[cur] *= -1\n \n for i in range(len(nums)):\n nums[i] = abs(nums[i])\n\n return res","runtime":"519"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(1,len(nums)):\n if nums[i]==nums[i-1]:\n return nums[i]\n return -1","runtime":"526"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums1=set(nums)\n # for i in nums1:\n # if nums.count(i)>1:\n # return i\n nums.sort()\n for i in range(len(nums)-1):\n if nums[i]==nums[i+1]:\n return nums[i]","runtime":"526"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n for i in range(len(nums) - 1):\n if nums[i] == nums[i + 1]:\n return nums[i]\n ","runtime":"532"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n l =len(nums)\n for i in range(l-1):\n if nums[i]==nums[i+1]:\n return nums[i]\n ","runtime":"532"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(1,n):\n if nums[i-1] == nums[i]:\n return nums[i]\n\n ","runtime":"539"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(1,n):\n if(nums[i]==nums[i-1]):\n return nums[i]\n ","runtime":"539"},{"code":"class Solution:\n def findDuplicate(self, arr: List[int]) -> int:\n \n # nums \n # n + 1 integers \n # [1, n]\n \n for i in range(len(arr)):\n if arr[i] != i + 1:\n while arr[i] != arr[arr[i]-1]:\n temp = arr[i]\n arr[i] = arr[temp-1]\n arr[temp-1] = temp\n \n for i in range(len(arr)):\n if i + 1 != arr[i]:\n return arr[i]\n ","runtime":"545"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n # TWO POINTER\n nums.sort()\n left,right=0,1\n while left<len(nums):\n if nums[left]==nums[right]:\n return nums[left]\n left+=1\n right+=1\n \n\n \n\n ","runtime":"545"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n i, size = 0, len(nums)\n while i < size:\n j = nums[i] - 1\n if j < size and nums[i] != nums[j]:\n nums[j], nums[i] = nums[i], nums[j]\n else:\n i += 1\n \n for i in range(size):\n if nums[i] != i + 1:\n return nums[i]\n return size","runtime":"551"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n newarr=sorted(nums)\n print(newarr)\n for i in range(len(newarr)-1):\n if newarr[i]==newarr[i+1]:\n return newarr[i]\n\n\n\n\n\n\n\n\n # for i in range(len(nums)-1):\n # for j in range(i+1,len(nums)):\n # if nums[i]==nums[j]:\n # return nums[i]\n # n=len(nums)\n # expsum=n*(n-1)/2\n # actsum=0\n # for num in nums:\n # actsum+=num\n # return int(actsum-expsum)\n","runtime":"551"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n ''' #approch 1\n index=0\n while index<len(nums):\n correct=nums[index]-1\n if nums[index]!=nums[correct]:\n nums[index],nums[correct]=nums[correct],nums[index]\n else:\n if index!=correct :\n return nums[correct]\n index+=1'''\n # index=0\n # while index<len(nums):\n # correct=nums[index]-1\n # if index!=correct:\n # if nums[index]!=nums[correct]:\n # nums[index],nums[correct]=nums[correct],nums[index]\n # else:\n # return nums[index]\n # else:\n # index+=1\n\n #approch 2\n\n l=0\n while l<len(nums):\n corr=nums[l]-1\n if nums[l]!=nums[corr]:\n nums[l],nums[corr]=nums[corr],nums[l]\n else:\n l+=1\n for i in range(len(nums)):\n if i+1!=nums[i]:\n return nums[i]\n \n ","runtime":"558"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n counter = Counter(nums)\n print(counter)\n for i in (counter):\n if counter[i] > 1:\n return i","runtime":"571"},{"code":"class Solution:\n def check(self, nums, i):\n c = 0\n for n in nums:\n if n <= i:\n c += 1\n return c <= i\n\n def findDuplicate(self, nums: List[int]) -> int:\n l = 0\n r = len(nums) -1\n ans = r\n while l < r:\n m = math.floor((l + r) / 2)\n if self.check(nums, m):\n l = m + 1\n else:\n ans = min(ans, m)\n r = m\n if not self.check(nums, l):\n ans = min(ans, l)\n return ans","runtime":"571"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n i = 0\n\n while i < len(nums):\n corrected_idx = nums[i] - 1\n\n if nums[i] != nums[corrected_idx]:\n nums[i] , nums[corrected_idx] = nums[corrected_idx] , nums[i]\n\n else:\n i += 1\n\n\n for i in range(len(nums)):\n if i + 1 != nums[i]:\n return nums[i]\n ","runtime":"577"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n l, r = 0, len(nums)-1\n while l < r:\n m = (l+r)//2\n count = 0\n for n in nums:\n if n <= m:\n count += 1\n if count > m:\n r = m\n else:\n l = m+1\n return l\n ","runtime":"577"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n #seen = set()\n\n #for n in nums:\n # if n in seen:\n # return n\n # seen.add(n)\n\n # 1 3 4 2 2\n slow = fast = nums[0] # 1\n while True:\n slow = nums[slow] # 3\n fast = nums[nums[fast]] # 2\n print(slow, fast)\n if slow == fast:\n break\n \n slow = nums[0]\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast]\n\n return slow\n \n\n ","runtime":"583"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n l = 1\n r = len(nums)\n\n while l < r:\n mid = (l+r)//2\n counter = 0\n for val in nums:\n if val <= mid:\n counter += 1\n \n if counter <= mid:\n l = mid + 1\n else:\n r = mid\n \n return l\n\n \n \n\n\n ","runtime":"583"}],"string":"[\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n left, right = nums[0], nums[0]\\n while True:\\n left, right = nums[left], nums[nums[right]]\\n if left == right:\\n left = nums[0]\\n break\\n while left != right:\\n left, right = nums[left], nums[right]\\n return left\\n def solve(self):\\n f = open('user.out', 'w')\\n for nums in map(loads, stdin):\\n print(self.findDuplicate(nums), file=f)\\nsolution = Solution()\\nsolution.solve()\\n\\nexit()\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"# class Solution:\\n# def findDuplicate(self, nums: List[int]) -> int:\\n# slow = fast = nums[0]\\n\\n# while True:\\n# slow = nums[slow]\\n# fast = nums[nums[fast]]\\n# if slow == fast:\\n# break\\n\\n# slow = nums[0]\\n\\n# while slow!=fast:\\n# slow = nums[slow]\\n# fast = nums[fast]\\n \\n# return slow\\n\\nsys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n\\n \",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n\\nfrom typing import List\\n\\nclass Solution:\\n def findDuplicate(self,nums: List[int]) -> int:\\n seen = []\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n \\n \\n\\n\\nnums = []\\nsol = Solution()\\nduplicate_number = sol.findDuplicate(nums)\\nprint(duplicate_number) \",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n\\n\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n head = 0\\n slow = nums[head]\\n fast = nums[nums[head]]\\n\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n slow = head\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n \\n return slow\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"\\ndef findDuplicate(nums: List[int]) -> int:\\n \\n\\n slow, fast = 0, 0\\n\\n while True:\\n fast = nums[nums[fast]]\\n slow = nums[slow]\\n\\n if slow == fast:\\n break\\n \\n slow = 0\\n\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return slow\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{findDuplicate(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n numCount = Counter(nums)\\n maxCount = max(numCount.values())\\n for key in numCount.keys():\\n if numCount[key] == maxCount: print(key)\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n re_set=set()\\n for i in nums:\\n if i in re_set:\\n return i\\n else:\\n re_set.add(i)\\n \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n s=set()\\n for num in nums:\\n if num not in s:\\n s.add(num)\\n else:\\n return num \",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n list1 = set()\\n for i in range(len(nums)):\\n if nums[i] in list1:\\n return nums[i]\\n list1.add(nums[i])\\n \\n\\n \\n \",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n sets=set()\\n for i in nums:\\n if i in sets:\\n return i\\n else:\\n sets.add(i)\\n \\n \\n\\n \\n \\n \\n \\n \",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n \",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # Naive solution: violate constant space\\n mem_set = set()\\n for n in nums:\\n if n in mem_set:\\n return n\\n mem_set.add(n)\\n\\n\\n # # Naive solution: look through all:\\n # for i, n in enumerate(nums):\\n # for j in range(i+1,len(nums)):\\n # if n == nums[j]:\\n # return n\\n \",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"from typing import List\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n mapping = {}\\n \\n for x in nums:\\n if x in mapping:\\n return x\\n mapping[x] = 1\\n \",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n return False\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n dupDict = {}\\n for n in nums:\\n if n in dupDict:\\n return n\\n else:\\n dupDict[n] = 1\",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n found = {}\\n for n in nums:\\n if n in found:\\n return n\\n found[n] = 1\\n\\n \",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n sett = set()\\n for i in nums:\\n #print(i)\\n if i in sett:\\n return i\\n else:\\n sett.add(i)\\n return 0 \",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n dict = {}\\n temp = nums\\n for x in nums:\\n if dict.get(x): return x\\n dict[x] = 1\\n return None\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n duplicate = set()\\n for n in nums:\\n if n in duplicate:\\n return n\\n duplicate.add(n)\",\n \"runtime\": \"193\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hash=set({})\\n for i in nums:\\n if i in hash:\\n return i\\n hash.add(i)\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n visited = set()\\n for num in nums:\\n if (num in visited):\\n return num\\n visited.add(num)\\n return -1\\n \",\n \"runtime\": \"206\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n s=set()\\n for i in nums:\\n if i in s:\\n return i\\n s.add(i)\\n \",\n \"runtime\": \"212\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, a: List[int]) -> int:\\n b=set()\\n for x in a:\\n if x in b:\\n return x\\n b.add(x)\\n\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = 0\\n fast = 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n if slow == slow2:\\n return slow\",\n \"runtime\": \"225\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n arr=set()\\n for i in nums:\\n if i in arr:\\n return i\\n arr.add(i)\",\n \"runtime\": \"231\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashmap = set()\\n\\n for num in nums:\\n if num in hashmap:\\n return num\\n \\n hashmap.add(num)\\n\",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n = len(nums)\\n li = [0] * len(nums)\\n\\n for i in range(n):\\n if li[nums[i]] == 1:\\n return nums[i]\\n \\n else:\\n li[nums[i]] = 1\\n\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n freq = [0] *(len(nums)+1)\\n for i in range(len(nums)):\\n if freq[nums[i]] == 0:\\n freq[nums[i]] += 1\\n else:\\n return nums[i]\\n return 0\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n tortise = nums[0]\\n hare = nums[0]\\n while True:\\n tortise = nums[tortise]\\n hare = nums[nums[hare]]\\n if tortise == hare:\\n break\\n tortise = nums[0]\\n while tortise != hare:\\n tortise = nums[tortise]\\n hare = nums[hare]\\n return tortise\\n \",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n diction = {}\\n for num in nums:\\n if num in diction:\\n return num\\n else:\\n diction[num] = 1\\n \",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for n in nums:\\n if n in seen:\\n return n\\n else:\\n seen.add(n)\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n se=set()\\n for i in nums:\\n if i in se:\\n return i\\n se.add(i)\\n return Null\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"runtime\": \"270\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n n = len(nums) - 1\\n arr = [0] * (n+1)\\n \\n for i in range(n+1):\\n if arr[nums[i]] != 0:\\n return nums[i]\\n else:\\n arr[nums[i]] = 1\\n \\n # n = len(nums) - 1 \\n # for i in range(1, n+1):\\n # count = 0\\n # for j in range(len(nums)):\\n # if i == nums[j]:\\n # count += 1\\n # if count >= 2:\\n # return i\\n\\n\\n\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n visit = set()\\n\\n for i in nums:\\n if i in visit:\\n return i\\n visit.add(i)\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n \\n\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for item in nums:\\n if item not in seen:\\n seen.add(item)\\n else:\\n return item\\n \",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n count_arr = [0]*len(nums)\\n for i in range(len(nums)):\\n if count_arr[nums[i]] == 0:\\n count_arr[nums[i]] += 1\\n else:\\n return nums[i]\\n return 0\",\n \"runtime\": \"295\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n seen = set()\\n for i in nums:\\n if i in seen:\\n return i\\n seen.add(i)\\n \",\n \"runtime\": \"295\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # sort then check if the one after is equal to the current\\n\\n # Issue with 1, not issue because we never go back to 0\\n\\n # Is .sort() constant space?\\n # Using a set is not constant\\n fast = slow = 0\\n # Always will have a duplicate nummber\\n while True:\\n fast = nums[nums[fast]]\\n slow = nums[slow]\\n if fast == slow:\\n break\\n slow = 0\\n while True:\\n if slow == fast:\\n return slow\\n slow = nums[slow]\\n fast = nums[fast]\\n\\n \\n\\n\\n \\n\",\n \"runtime\": \"302\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n \\n return -1\",\n \"runtime\": \"302\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n found = set()\\n for n in nums:\\n if n in found: return n\\n else: found.add(n)\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n\\n s = set()\\n\\n for i in nums:\\n if i in s: \\n return i\\n s.add(i)\\n\\n \",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n fast = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return fast\",\n \"runtime\": \"315\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n s = set()\\n for i in nums:\\n if i in s:\\n return i\\n else:\\n s.add(i)\",\n \"runtime\": \"321\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n\\n # Move both slow and fast pointers\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return slow\\n\",\n \"runtime\": \"321\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen=set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num) \\n \",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n ref_set = set()\\n for i in nums:\\n if i in ref_set:\\n return i\\n else:\\n ref_set.add(i)\\n \\n \",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n s = set()\\n for i in nums:\\n if i in s:\\n return i\\n else:\\n s.add(i)\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n \\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow2 = nums[0]\\n while slow != slow2:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n return slow\\n \\n \\n \\n \",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n return Counter(nums).most_common(1)[0][0]\",\n \"runtime\": \"340\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d={}\\n for i in nums:\\n if i in d:\\n return i\\n else:\\n d[i]=1\\n \\n \\n \",\n \"runtime\": \"340\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n '''res = []\\n count = 0\\n for i in range(len(nums)):\\n if nums[i] not in res:\\n res.append(nums[i])\\n else:\\n return nums[i]'''\\n seen = set()\\n for i in nums:\\n if i in seen:\\n return i\\n seen.add(i)\\n\\n \\n \\n \",\n \"runtime\": \"347\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n exists = [False for x in nums]\\n exists.append(False) \\n for num in nums:\\n if exists[num]:\\n return num\\n exists[num] = True\\n\",\n \"runtime\": \"347\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n\\n\\n \\n \\n\\n \",\n \"runtime\": \"366\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n\\n slow = 0\\n fast = 0\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n if slow == fast:\\n slow = 0 \\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n \\n return slow\\n\\n \\n\",\n \"runtime\": \"372\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # first find a cycle\\n n = len(nums)\\n slow, fast = 0, 0\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n if slow==fast:\\n slow2=0\\n while slow2!=slow:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n return slow2\\n \",\n \"runtime\": \"372\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d = {}\\n for i in nums:\\n if i not in d:\\n d[i] = 1\\n else:\\n return i\",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n \\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow2 = nums[0]\\n while slow != slow2:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n return slow\\n \\n \\n \\n \",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = 0, 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\",\n \"runtime\": \"385\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # Brute force approach.\\n # Time complex O(n ^2)\\n # for i in range(len(nums)):\\n # for j in range(i + 1, len(nums)):\\n # if nums[i] == nums[j]:\\n # return nums[i]\\n\\n # slow, fast pointer approach\\n # Time complex O(n), space complex O(1)\\n slow, fast = 0, 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\\n \",\n \"runtime\": \"385\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n s = set()\\n for num in nums:\\n if num in s:\\n return num\\n s.add(num)\",\n \"runtime\": \"391\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n \\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow2 = nums[0]\\n while slow != slow2:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n return slow\\n \\n \\n \\n \",\n \"runtime\": \"391\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # Phase 1: Finding the intersection point of the cycle\\n slow = nums[0]\\n fast = nums[0]\\n \\n while True:\\n slow = nums[slow] # Move slow one step\\n fast = nums[nums[fast]] # Move fast two steps\\n if slow == fast:\\n break\\n \\n # Phase 2: Finding the entrance to the cycle (duplicate number)\\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n \\n return fast\\n\",\n \"runtime\": \"398\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n arr=set()\\n for i in nums:\\n if i in arr:\\n return i\\n arr.add(i)\",\n \"runtime\": \"398\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashSet = set()\\n for n in nums:\\n if n in hashSet:\\n return n\\n hashSet.add(n) \\n \",\n \"runtime\": \"404\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n \\n return slow\\n \",\n \"runtime\": \"404\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n a=b=nums[0]\\n while True:\\n a=nums[a]\\n b=nums[nums[b]]\\n if a==b:\\n break\\n\\n a=nums[0]\\n while a!=b:\\n a=nums[a]\\n b=nums[b]\\n\\n return b\",\n \"runtime\": \"411\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n fast = slow = 0\\n while True:\\n fast = nums[nums[fast]]\\n slow = nums[slow]\\n if fast == slow:\\n slow = 0\\n while fast != slow:\\n fast = nums[fast]\\n slow = nums[slow]\\n return slow\",\n \"runtime\": \"411\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n # print(\\\"Slow: \\\", slow)\\n # print(\\\"Fast: \\\", fast)\\n if slow== fast:\\n break\\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return slow\",\n \"runtime\": \"417\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # Phase 1: Find the intersection point in the cycle\\n tortoise = nums[0]\\n hare = nums[0]\\n \\n # Move tortoise by 1 step and hare by 2 steps\\n while True:\\n tortoise = nums[tortoise] # Move 1 step\\n hare = nums[nums[hare]] # Move 2 steps\\n if tortoise == hare:\\n break # They meet, cycle is detected\\n \\n # Phase 2: Find the entrance to the cycle\\n tortoise = nums[0] # Reset tortoise to the start\\n while tortoise != hare:\\n tortoise = nums[tortoise] # Move both 1 step at a time\\n hare = nums[hare]\\n \\n # They meet at the entrance to the cycle (the duplicate number)\\n return hare\\n\\n\",\n \"runtime\": \"417\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n fast = nums[0]\\n slow = nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return slow\",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashmap = defaultdict(int)\\n for n in nums:\\n if hashmap[n]:\\n return n\\n hashmap[n] += 1 \\n \",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n return Counter(nums).most_common(1)[0][0]\",\n \"runtime\": \"430\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # similar to Linked List Cycle II.\\n # every element can be treated as a linklist node: val is the value, next is the val-index, which means we use index to indicate the address of next node. eg. 5 is a node( val = 5, next = nums[5])\\n fast, slow = 0, 0\\n while True:\\n fast = nums[nums[fast]]\\n slow = nums[slow]\\n if slow == fast:\\n break\\n slow2 = 0\\n while True:\\n slow2 = nums[slow2]\\n slow = nums[slow]\\n if slow2 == slow:\\n return slow2\\n \\n\",\n \"runtime\": \"430\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = 0, 0\\n while True:\\n slow = nums[slow]\\n fast = nums[fast]\\n fast = nums[fast]\\n if slow == fast:\\n break\\n \\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\",\n \"runtime\": \"436\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = 0, 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n if slow == fast:\\n break\\n\\n slow2 = 0\\n\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n if slow == slow2:\\n return slow\",\n \"runtime\": \"436\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # idea: same as cycle linked list II\\n # which find the start of the cycle\\n # Since nums[i] is inclusively in [1, n] and there is a duplicate\\n # ==> there is always a cycle if expressed under linked list \\n\\n # find intersection \\n slow, fast = 0, 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n # find the start of cycle \\n slow = 0\\n while True:\\n slow = nums[slow]\\n fast = nums[fast]\\n if fast == slow:\\n return fast\",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d=dict()\\n for i in range(len(nums)):\\n if nums[i] in d:\\n d[nums[i]]+=1\\n else:\\n d[nums[i]]=1\\n for k,v in d.items():\\n if v>1:\\n return k\\n \",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n p1=nums[0]\\n p2=nums[0]\\n while True:\\n p1=nums[p1]\\n p2=nums[nums[p2]]\\n if p1 == p2:\\n break\\n ptr1=nums[0]\\n ptr2=p1\\n while ptr1 != ptr2:\\n ptr1=nums[ptr1]\\n ptr2=nums[ptr2]\\n return ptr1\",\n \"runtime\": \"449\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n #Construct a num[i]->num[num[i]] map, it will form a cycle.\\n #Get the begining point of the cycle.\\n p1=p2=nums[0]\\n while True:\\n p1=nums[p1]\\n p2=nums[nums[p2]]\\n if p1==p2:\\n break\\n p1=nums[0]\\n while p1!=p2:\\n p1=nums[p1]\\n p2=nums[p2]\\n return p1\",\n \"runtime\": \"449\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n=len(nums)\\n f=[0]*(n+1)\\n for i in range(n):\\n if (f[nums[i]])==0:\\n f[nums[i]]+=1\\n else:\\n return nums[i]\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = 0\\n fast = 0\\n \\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break \\n \\n \\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n \\n if slow == slow2:\\n return slow\\n\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n num_count={}\\n for i in nums:\\n num_count[i]=num_count.get(i,0)+1\\n for num,count in num_count.items():\\n if count>1:\\n return num \",\n \"runtime\": \"462\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = fast = 0\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n if slow == fast:\\n break\\n \\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\",\n \"runtime\": \"462\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n s = set()\\n for n in nums:\\n if n not in s: s.add(n)\\n else:\\n return n\",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\\"\\\"\\\"\\n So in order to know how to solve this problem we must know the existance of\\n floyds algorithm. That's the only way.\\n\\n So basically, we treat the list as a linked list, where the values represent the index\\n of the next node. Then, as the list must has duplicates, it means that it has a cycle.\\n Then we must utilize floyds algorithm to find the begining of the cycle which is\\n the repeated number\\n \\\"\\\"\\\"\\n\\n # We first find the intersection of a fast and a slow pointer\\n slow, fast = nums[0], nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n # Then we find the begining of the cycle by placing another slow\\n # pointer at the begining of the list and waiting for them to colide\\n slow2 = nums[0]\\n while slow2 != slow:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n return slow\",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n idx = abs(nums[i])\\n if nums[idx] < 0:\\n return idx\\n nums[idx] = -nums[idx]\\n return -1\",\n \"runtime\": \"475\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n ind = abs(nums[i]) #得到nums[i]的数值 ([1,n])\\n if nums[ind] < 0:\\n return ind\\n nums[ind] = -nums[ind] #将nums[ind]变成负的（说明遍历到过ind），因此如果再次访问到ind，则会发现nums[ind]是负数\\n return -1\",\n \"runtime\": \"475\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = {}\\n for n in nums:\\n if n in seen:\\n seen[n] += 1\\n else:\\n seen[n] = 1\\n\\n for n in seen:\\n if seen[n] > 1:\\n return n\",\n \"runtime\": \"481\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n curr = 0\\n while True:\\n nxt = nums[curr]\\n nums[curr] *= -1\\n if nums[nxt] < 0:\\n return nxt\\n curr = nxt\\n \",\n \"runtime\": \"481\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n idx = abs(nums[i])\\n if nums[idx] < 0:\\n return idx\\n nums[idx] = -nums[idx]\\n # TODO -> reset values\\n return -1\",\n \"runtime\": \"487\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow,fast=nums[0],nums[0]\\n while True:\\n slow=nums[slow]\\n fast=nums[nums[fast]]\\n if slow==fast:\\n break\\n fast=nums[0]\\n while slow!=fast:\\n slow=nums[slow]\\n fast=nums[fast]\\n return fast\",\n \"runtime\": \"487\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n i = 0\\n while i < len(nums):\\n index = nums[i] - 1\\n if index == i:\\n i += 1\\n continue\\n if nums[i] == nums[index]: return nums[i]\\n nums[i], nums[index] = nums[index], nums[i]\",\n \"runtime\": \"494\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n \\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast] \\n \\n return slow\\n\",\n \"runtime\": \"494\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n res = -1\\n for i in nums:\\n ind = abs(i)\\n if nums[ind-1] < 0:\\n res = ind\\n break\\n # return ind\\n nums[ind-1] *= -1\\n for i in range(len(nums)):\\n nums[i] = abs(nums[i])\\n return res\\n \",\n \"runtime\": \"500\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n tortoise = nums[0]\\n hare = nums[0]\\n while True:\\n tortoise = nums[tortoise]\\n hare = nums[nums[hare]]\\n if tortoise == hare:\\n break\\n ptr1 = nums[0]\\n ptr2 = tortoise\\n while ptr1!= ptr2:\\n ptr1 = nums[ptr1]\\n ptr2 = nums[ptr2]\\n\\n return ptr1\",\n \"runtime\": \"500\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n res = -1\\n for i in nums:\\n ind = abs(i)\\n if nums[ind-1] < 0:\\n res = ind\\n break\\n # return ind\\n nums[ind-1] *= -1\\n # for i in range(len(nums)):\\n # nums[i] = abs(nums[i])\\n return res\\n \",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(0,len(nums)):\\n if nums[i] == nums[i+1]:\\n return nums[i]\\n \",\n \"runtime\": \"507\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, a: List[int]) -> int:\\n a.sort()\\n for i in range(len(a)-1):\\n if a[i]==a[i+1]:\\n return a[i]\",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n ans = None\\n for n in nums:\\n if n < 0: n = -n\\n if nums[n-1] < 0:\\n ans = n\\n break\\n else:\\n nums[n-1] = -nums[n-1]\\n \\n for i in range(len(nums)):\\n nums[i] = abs(nums[i])\\n \\n return ans\",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i] == nums[i+1]:\\n return nums[i]\\n return -1\",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n for i in range(len(nums)):\\n cur = abs(nums[i])\\n if nums[cur] < 0:\\n res = cur\\n break\\n nums[cur] *= -1\\n \\n for i in range(len(nums)):\\n nums[i] = abs(nums[i])\\n\\n return res\",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(1,len(nums)):\\n if nums[i]==nums[i-1]:\\n return nums[i]\\n return -1\",\n \"runtime\": \"526\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums1=set(nums)\\n # for i in nums1:\\n # if nums.count(i)>1:\\n # return i\\n nums.sort()\\n for i in range(len(nums)-1):\\n if nums[i]==nums[i+1]:\\n return nums[i]\",\n \"runtime\": \"526\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n for i in range(len(nums) - 1):\\n if nums[i] == nums[i + 1]:\\n return nums[i]\\n \",\n \"runtime\": \"532\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n l =len(nums)\\n for i in range(l-1):\\n if nums[i]==nums[i+1]:\\n return nums[i]\\n \",\n \"runtime\": \"532\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n n = len(nums)\\n for i in range(1,n):\\n if nums[i-1] == nums[i]:\\n return nums[i]\\n\\n \",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n n = len(nums)\\n for i in range(1,n):\\n if(nums[i]==nums[i-1]):\\n return nums[i]\\n \",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, arr: List[int]) -> int:\\n \\n # nums \\n # n + 1 integers \\n # [1, n]\\n \\n for i in range(len(arr)):\\n if arr[i] != i + 1:\\n while arr[i] != arr[arr[i]-1]:\\n temp = arr[i]\\n arr[i] = arr[temp-1]\\n arr[temp-1] = temp\\n \\n for i in range(len(arr)):\\n if i + 1 != arr[i]:\\n return arr[i]\\n \",\n \"runtime\": \"545\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # TWO POINTER\\n nums.sort()\\n left,right=0,1\\n while left<len(nums):\\n if nums[left]==nums[right]:\\n return nums[left]\\n left+=1\\n right+=1\\n \\n\\n \\n\\n \",\n \"runtime\": \"545\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n i, size = 0, len(nums)\\n while i < size:\\n j = nums[i] - 1\\n if j < size and nums[i] != nums[j]:\\n nums[j], nums[i] = nums[i], nums[j]\\n else:\\n i += 1\\n \\n for i in range(size):\\n if nums[i] != i + 1:\\n return nums[i]\\n return size\",\n \"runtime\": \"551\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n newarr=sorted(nums)\\n print(newarr)\\n for i in range(len(newarr)-1):\\n if newarr[i]==newarr[i+1]:\\n return newarr[i]\\n\\n\\n\\n\\n\\n\\n\\n\\n # for i in range(len(nums)-1):\\n # for j in range(i+1,len(nums)):\\n # if nums[i]==nums[j]:\\n # return nums[i]\\n # n=len(nums)\\n # expsum=n*(n-1)/2\\n # actsum=0\\n # for num in nums:\\n # actsum+=num\\n # return int(actsum-expsum)\\n\",\n \"runtime\": \"551\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n ''' #approch 1\\n index=0\\n while index<len(nums):\\n correct=nums[index]-1\\n if nums[index]!=nums[correct]:\\n nums[index],nums[correct]=nums[correct],nums[index]\\n else:\\n if index!=correct :\\n return nums[correct]\\n index+=1'''\\n # index=0\\n # while index<len(nums):\\n # correct=nums[index]-1\\n # if index!=correct:\\n # if nums[index]!=nums[correct]:\\n # nums[index],nums[correct]=nums[correct],nums[index]\\n # else:\\n # return nums[index]\\n # else:\\n # index+=1\\n\\n #approch 2\\n\\n l=0\\n while l<len(nums):\\n corr=nums[l]-1\\n if nums[l]!=nums[corr]:\\n nums[l],nums[corr]=nums[corr],nums[l]\\n else:\\n l+=1\\n for i in range(len(nums)):\\n if i+1!=nums[i]:\\n return nums[i]\\n \\n \",\n \"runtime\": \"558\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n counter = Counter(nums)\\n print(counter)\\n for i in (counter):\\n if counter[i] > 1:\\n return i\",\n \"runtime\": \"571\"\n },\n {\n \"code\": \"class Solution:\\n def check(self, nums, i):\\n c = 0\\n for n in nums:\\n if n <= i:\\n c += 1\\n return c <= i\\n\\n def findDuplicate(self, nums: List[int]) -> int:\\n l = 0\\n r = len(nums) -1\\n ans = r\\n while l < r:\\n m = math.floor((l + r) / 2)\\n if self.check(nums, m):\\n l = m + 1\\n else:\\n ans = min(ans, m)\\n r = m\\n if not self.check(nums, l):\\n ans = min(ans, l)\\n return ans\",\n \"runtime\": \"571\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n i = 0\\n\\n while i < len(nums):\\n corrected_idx = nums[i] - 1\\n\\n if nums[i] != nums[corrected_idx]:\\n nums[i] , nums[corrected_idx] = nums[corrected_idx] , nums[i]\\n\\n else:\\n i += 1\\n\\n\\n for i in range(len(nums)):\\n if i + 1 != nums[i]:\\n return nums[i]\\n \",\n \"runtime\": \"577\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n l, r = 0, len(nums)-1\\n while l < r:\\n m = (l+r)//2\\n count = 0\\n for n in nums:\\n if n <= m:\\n count += 1\\n if count > m:\\n r = m\\n else:\\n l = m+1\\n return l\\n \",\n \"runtime\": \"577\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n #seen = set()\\n\\n #for n in nums:\\n # if n in seen:\\n # return n\\n # seen.add(n)\\n\\n # 1 3 4 2 2\\n slow = fast = nums[0] # 1\\n while True:\\n slow = nums[slow] # 3\\n fast = nums[nums[fast]] # 2\\n print(slow, fast)\\n if slow == fast:\\n break\\n \\n slow = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n\\n return slow\\n \\n\\n \",\n \"runtime\": \"583\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n l = 1\\n r = len(nums)\\n\\n while l < r:\\n mid = (l+r)//2\\n counter = 0\\n for val in nums:\\n if val <= mid:\\n counter += 1\\n \\n if counter <= mid:\\n l = mid + 1\\n else:\\n r = mid\\n \\n return l\\n\\n \\n \\n\\n\\n \",\n \"runtime\": \"583\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":125,"string":"125"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n left, right = nums[0], nums[0]\n while True:\n left, right = nums[left], nums[nums[right]]\n if left == right:\n left = nums[0]\n break\n while left != right:\n left, right = nums[left], nums[right]\n return left\n def solve(self):\n f = open('user.out', 'w')\n for nums in map(loads, stdin):\n print(self.findDuplicate(nums), file=f)\nsolution = Solution()\nsolution.solve()\n\nexit()","memory":"25679"},{"code":"\ndef findDuplicate(nums: List[int]) -> int:\n \n\n slow, fast = 0, 0\n\n while True:\n fast = nums[nums[fast]]\n slow = nums[slow]\n\n if slow == fast:\n break\n \n slow = 0\n\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast]\n return slow\n\nf = open('user.out', 'w')\nfor case in map(loads, stdin):\n f.write(f\"{findDuplicate(case)}\\n\")\nf.flush()\nexit(0)","memory":"25679"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nextIdx = nums[0]\n nums[0] = None\n while True:\n if not nums[nextIdx]:\n return nextIdx\n curIdx = nextIdx\n nextIdx = nums[curIdx]\n nums[curIdx] = None\n ","memory":"25838"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n pointer = nums[-1]\n\n for i in range(len(nums)):\n\n if nums[pointer - 1] == -1:\n return pointer\n \n else:\n val = pointer\n pointer = nums[pointer - 1]\n nums[val - 1] = -1","memory":"25996"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \n start = 0\n while True:\n if not nums[start]: return start\n temp = nums[start]\n nums[start] = False\n start = temp","memory":"26155"},{"code":"class Solution:\n def findDuplicate(self, nums: list[int]) -> int:\n for index in range(len(nums)):\n if nums[index] == -1:\n continue\n if nums[index] == -1:\n return nums[index] \n val = nums[index]\n nums[index] = -2\n while True:\n if nums[val] == -1:\n return val\n elif nums[val] == -2:\n nums[val] = -1\n break\n else:\n temp = nums[val]\n nums[val] = -1\n val = temp\n\n return 0\n","memory":"26155"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n i = 0\n while True:\n if nums[i] == -1:\n return i\n \n next_i = nums[i]\n nums[i] = -1\n i = next_i","memory":"26314"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n\n\n '''\n\n\n treat it as linked list where node value = nums[index]\n next pointer = nums[index]\n\n\n (1) -> (3) -> (2) -> (4)\n <-\n\n\n (3) -> (4) -> (2) \n <-\n\n\n iterate through LL\n keep a set of numbers seen\n once we see a repeated number, return as solution\n\n\n make nums[curr] = 0 to count as visited\n first number that points to a zero is the duplicate\n \n '''\n\n\n curr = nums[0]\n index = 0\n\n while nums[curr] != 0:\n if index == curr:\n return curr\n nums[index] = 0\n index = curr\n curr = nums[curr]\n\n return curr\n ","memory":"26473"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow, fast = nums[0], nums[0]\n \n # First phase of the algorithm: finding the intersection point of the two runners.\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n \n # Second phase of the algorithm: finding the entrance to the cycle.\n fast = nums[0]\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast]\n \n return slow\n","memory":"26631"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow=fast=0\n while True:\n slow=nums[slow]\n fast=nums[nums[fast]]\n if slow==fast:\n break\n slowt=0\n while True:\n slowt=nums[slowt]\n slow=nums[slow]\n if slow==slowt:\n return slow\n","memory":"26790"},{"code":"'''\n1 to n inclusive\n\ncontaining n + 1 integers\n\n\nn = 3\n\n1, 2, 3, 1\n\n'''\nclass Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = nums[0]\n fast = nums[0]\n\n while True:\n slow = nums[slow]\n fast = nums[fast]\n fast = nums[fast]\n if slow == fast:\n break\n \n slow2 = nums[0]\n while True:\n \n if slow == slow2:\n return slow\n slow = nums[slow]\n slow2 = nums[slow2]\n\n # # Step 1: Initialize the slow and fast pointers\n # slow = nums[0]\n # fast = nums[0]\n \n # # Step 2: Move slow by 1 step and fast by 2 steps to find the intersection\n # while True:\n # slow = nums[slow]\n # fast = nums[nums[fast]]\n # if slow == fast:\n # break\n \n # # Step 3: Reset one pointer to the start and move both by 1 step until they meet\n # # slow2 = nums[0]\n # # while slow != slow2:\n # # slow = nums[slow]\n # # slow2 = nums[slow2]\n\n # slow2 = nums[0]\n # while True:\n # if slow == slow2:\n # return slow\n \n # slow = nums[slow]\n # slow2 = nums[slow2]\n \n # # # The point of intersection is the duplicate number\n # # return slow\n\n","memory":"26949"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort() #N log N\n for i in range(len(nums)):\n if nums[i] == nums[i + 1]:\n return nums[i]\n return -1\n ","memory":"27108"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow, fast = 0, 0\n\n while True:\n\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n \n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n if slow == slow2:\n return slow\n \n ","memory":"27266"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = nums[0]\n fast = nums[0]\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n fast = nums[0]\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast]\n return fast","memory":"27425"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n fast = slow = 0\n\n while True:\n slow = nums[slow]\n fast = nums[fast]\n fast = nums[fast]\n if nums[fast] == nums[slow]:\n break\n\n new_slow = 0\n while nums[slow] != nums[new_slow]:\n slow = nums[slow]\n new_slow = nums[new_slow]\n return nums[new_slow]\n \n ","memory":"27584"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n = len(nums)\n nums.sort()\n for i in range(1,n):\n if nums[i-1] == nums[i]:\n return nums[i]\n return -1","memory":"27743"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n ans = None\n for n in nums:\n if n < 0: n = -n\n if nums[n-1] < 0:\n ans = n\n break\n else:\n nums[n-1] = -nums[n-1]\n \n for i in range(len(nums)):\n nums[i] = abs(nums[i])\n \n return ans","memory":"27743"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow, fast = 0, 0\n\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n\n if slow == fast:\n break\n\n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n if slow == slow2:\n return slow\n ","memory":"27901"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n x = abs(nums[i])\n if nums[x] < 0:\n return x\n nums[x] *= -1\n \n return -1","memory":"27901"},{"code":"'''\nOne approach:\n- For each number, go through the array and check if that number exists\nTime O(n^2)\n\nCoded up solution: After looking at the solution\n\n'''\n\n\nclass Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = fast = 0 # represents index\n\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n\n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n if slow == slow2:\n return slow\n ","memory":"28060"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n res = -1\n for i in nums:\n ind = abs(i)\n if nums[ind-1] < 0:\n res = ind\n break\n # return ind\n nums[ind-1] *= -1\n # for i in range(len(nums)):\n # nums[i] = abs(nums[i])\n return res\n ","memory":"28219"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums.sort()\n l =len(nums)\n for i in range(l-1):\n if nums[i]==nums[i+1]:\n return nums[i]\n ","memory":"28219"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n # EVEN MORE GENIUS, USE FLOYD'S START OF CYCLE ALGO\n\n slow = 0\n fast = 0\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n \n # Loop detection will terminate when p = c, that is distance from start\n # to beginning of loop = distance from \"termination point\" (meeting point of fast and slow)\n # to beginning of loop\n\n slow2 = 0\n while slow2 != slow:\n slow2 = nums[slow2]\n slow = nums[slow]\n \n return slow\n\n\n # Genius solution, use Floyd's cycle detection.\n # Let nums[i] be the next index to check. So each *value* in the list\n # points to next *index* to check.\n # If there were no repeat numbers, this means that each value and index would have \n # one outbound and one incoming edge, with the exception of nums[0] (no inbound).\n # However, due to duplicate values, a cycle is formed since the same value at \n # 2 different indices will point to the same next index.\n # The cycle is entered by one of the repeat values.\n # So, mark each \"node\" as having been visited by making it negative, and watch for\n # encountering a negative value, the first of which will indicate entrance into the\n # cycle via the repeated value.\n # curr = 0\n # while True:\n # nxt = nums[curr]\n # nums[curr] *= -1\n # if nums[nxt] < 0:\n # return nxt\n # curr = nxt\n ","memory":"28378"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = nums[0]\n fast = nums[0]\n \n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n \n slow2 = nums[0]\n while slow != slow2:\n slow = nums[slow]\n slow2 = nums[slow2]\n\n return slow\n \n \n \n ","memory":"28378"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow, fast = 0, 0\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n\n slow2 = 0\n while True:\n slow = nums[slow] \n slow2 = nums[slow2]\n if slow == slow2:\n return slow ","memory":"28536"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n # nums.sort()\n # n = len(nums)\n # for i in range(1,n):\n # if nums[i-1] == nums[i]:\n # return nums[i]\n slow = nums[0]\n fast = nums[0]\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n fast = nums[0]\n while slow != fast:\n slow = nums[slow]\n fast = nums[fast] \n return slow \n\n ","memory":"28536"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \"\"\"\n So in order to know how to solve this problem we must know the existance of\n floyds algorithm. That's the only way.\n\n So basically, we treat the list as a linked list, where the values represent the index\n of the next node. Then, as the list must has duplicates, it means that it has a cycle.\n Then we must utilize floyds algorithm to find the begining of the cycle which is\n the repeated number\n \"\"\"\n\n # We first find the intersection of a fast and a slow pointer\n slow, fast = nums[0], nums[0]\n while True:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n break\n\n # Then we find the begining of the cycle by placing another slow\n # pointer at the begining of the list and waiting for them to colide\n slow2 = nums[0]\n while slow2 != slow:\n slow = nums[slow]\n slow2 = nums[slow2]\n\n return slow","memory":"28695"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n=len(nums)\n # cnt=0\n # ans=0\n # for i in range(n):\n # for j in range(i+1,n):\n # if nums[i]==nums[j]:\n # return nums[i]\n # return -1\n repeat=-1\n hash=[0]*(n+1)\n for i in range(n):\n hash[nums[i]]+=1\n for i in range(1,n+1):\n if hash[i]>=2:\n repeat=i\n return repeat\n ","memory":"28695"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n=len(nums)\n for i in range(n):\n nums[nums[i]%n]+=n\n if nums[nums[i]%n]//n>1:\n return nums[i]%n\n \n # for i in range(n):\n # if nums[i]//n>1:\n # return i\n slow=nums[0]\n fast=nums[0]\n while slow!=fast:\n slow=nums[slow]\n fast=nums[nums[fast]]\n slow=nums[0]\n while slow!=fast:\n slow=nums[slow]\n fast=nums[fast]\n\n return slow\n \n ","memory":"28854"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n = len(nums)-1\n num_bits = int(math.floor(log2(n))) + 1\n counts = [0 for _ in range(num_bits)]\n\n def update(i, cnts):\n bit = 0\n while i > 0:\n if i%2:\n cnts[bit] += 1\n i >>= 1\n bit += 1\n\n # count number of each bit for sum from 1 to n (i.e. no duplicate)\n for i in range(1, n+1):\n update(i, counts)\n\n # count number of each bit for the actual array\n actual_counts = [0 for _ in range(num_bits)]\n for num in nums:\n update(num, actual_counts)\n\n # the bit(s) which has maximum count difference is how many times the duplicate\n # number has appeared in the actual array\n actual_counts = [actual_counts[b]-counts[b] for b in range(num_bits)]\n # if a bit count difference is > 0, set it to maximum count diff, otherwise set\n # it to zero. The result bitmask is equal to: duplicate number multiply how many\n # times it duplicates\n max_count = max(actual_counts)\n actual_counts = [(max_count if c > 0 else 0) for c in actual_counts]\n\n res = 0\n dup = 0\n for bit in range(num_bits):\n bcnt = actual_counts[bit]\n if bcnt > 0:\n res += bcnt*2**bit\n dup = bcnt\n\n return res // dup\n","memory":"28854"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n = len(nums)\n sorted_nums = sorted(nums)\n for i in range(n - 1):\n if sorted_nums[i] == sorted_nums[i + 1]:\n return sorted_nums[i]\n return -1\n ","memory":"29013"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \n slow = nums[0]\n fast = nums[slow]\n\n while slow != fast:\n fast = nums[nums[fast]]\n slow = nums[slow]\n print(slow, fast)\n \n slow = 0\n\n while slow != fast:\n fast = nums[fast]\n slow = nums[slow]\n \n return slow","memory":"29013"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = 0\n fast = 0\n intersectionFound = False\n repeatFound = False\n\n while not intersectionFound:\n slow = nums[slow]\n fast = nums[nums[fast]]\n if slow == fast:\n intersectionFound = True\n \n \n print(slow)\n slow2 = 0\n\n while not repeatFound:\n slow = nums[slow]\n slow2 = nums[slow2]\n\n if slow == slow2:\n repeatFound = True\n \n return slow\n\n ","memory":"29171"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n sp=0\n fp=0\n fFirst = True\n cnt = 0\n while sp!=fp or fFirst:\n fFirst = False\n sp=nums[sp]\n fp =nums[nums[fp]]\n \n \n \n sp = 0\n while sp!=fp:\n print(sp,fp)\n sp=nums[sp]\n fp = nums[fp]\n return sp\n","memory":"29330"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n newarr=sorted(nums)\n print(newarr)\n for i in range(len(newarr)-1):\n if newarr[i]==newarr[i+1]:\n return newarr[i]\n\n\n\n\n\n\n\n\n # for i in range(len(nums)-1):\n # for j in range(i+1,len(nums)):\n # if nums[i]==nums[j]:\n # return nums[i]\n # n=len(nums)\n # expsum=n*(n-1)/2\n # actsum=0\n # for num in nums:\n # actsum+=num\n # return int(actsum-expsum)\n","memory":"29330"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow = 0\n fast = 0\n while True:\n print(\"---1. slow is\", slow, \"fast is\", fast)\n slow = nums[slow]\n fast = nums[nums[fast]]\n\n if slow == fast:\n break\n slow2 = 0\n while True:\n slow = nums[slow]\n slow2 = nums[slow2]\n if slow == slow2:\n return slow\n\n\n\n\n return -1","memory":"29489"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n i = 0\n\n while i < len(nums):\n corrected_idx = nums[i] - 1\n\n if nums[i] != nums[corrected_idx]:\n nums[i] , nums[corrected_idx] = nums[corrected_idx] , nums[i]\n\n else:\n i += 1\n\n print(nums)\n\n\n for i in range(len(nums)):\n if i + 1 != nums[i]:\n return nums[i]\n ","memory":"29648"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n res=[0]*(100000)\n for i in nums:\n print(i)\n if res[i-1]==1:\n return i \n else:\n res[i-1]+=1 ","memory":"29806"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n arr = [0]*(10**5+1)\n for num in nums:\n print(num)\n arr[num]+=1\n if arr[num] > 1:\n return num\n","memory":"29965"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen = set()\n for num in nums:\n if num in seen:\n return num\n seen.add(num)","memory":"30124"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n b=set()\n for i in nums:\n if i in b:\n return i\n else:\n b.add(i)\n ","memory":"30283"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n dupl = []\n #print(dupl)\n def sort(nums):\n if len(nums) <= 1 or len(dupl) > 0:\n return nums\n pivot = nums[0]\n less = []\n equal = [nums[0]]\n larger = []\n nums.pop(0)\n for i in nums:\n if i < pivot:\n less += [i]\n if i == pivot:\n equal += [i]\n dupl.append(i)\n if i > pivot:\n larger += [i]\n return sort(less) + equal + sort(larger)\n halfsorted = sort(nums)\n return dupl[0]\n ","memory":"30441"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n visited = set()\n for num in nums:\n if num in visited: \n return num\n else:\n visited.add(num)","memory":"30600"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen=set()\n for num in nums:\n if num in seen:\n return num\n seen.add(num)","memory":"30759"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n s=set()\n for num in nums:\n if num in s:\n return num\n s.add(num)\n ","memory":"30918"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen=set()\n for num in nums:\n if num in seen:\n return num\n seen.add(num) \n ","memory":"31076"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n se=set()\n for i in nums:\n if i in se:\n return i\n se.add(i)\n return Null","memory":"31076"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen = set()\n for num in nums:\n if num in seen:\n return num\n seen.add(num)","memory":"31235"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashSet = set()\n for n in nums:\n if n in hashSet:\n return n\n hashSet.add(n) \n ","memory":"31235"},{"code":"from typing import List\n\n\nclass Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen = set()\n for num in nums:\n if num in seen:\n return num\n seen.add(num)\n \n","memory":"31394"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen = set()\n for num in nums:\n if num in seen:\n return num\n seen.add(num)","memory":"31394"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n s = set()\n for num in nums:\n if num in s:\n return num\n s.add(num)","memory":"31553"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n S = set()\n for i in nums:\n if i not in S:\n S.add(i)\n else:\n return i","memory":"31553"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n dupl = []\n #print(dupl)\n def sort(nums):\n if len(nums) <= 1 or len(dupl) > 0:\n return nums\n pivot = nums[0]\n less = []\n equal = [nums[0]]\n larger = []\n nums.pop(0)\n for i in nums:\n if i < pivot:\n less += [i]\n if i == pivot:\n equal += [i]\n dupl.append(i)\n break\n if i > pivot:\n larger += [i]\n return sort(less) + equal + sort(larger)\n halfsorted = sort(nums)\n #print(halfsorted)\n return dupl[0]\n ","memory":"31711"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n li={}\n for i in nums:\n if i in li:\n return(i)\n else:\n li[i]=True \n ","memory":"32188"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n # right, left = 0,1\n\n # while nums[right] != nums[left]:\n # while nums[right] != nums[left]:\n # left += 1\n # right += 1\n # left = right - 1\n\n # for i in range(len(nums)):\n # for j in range(len(nums) - 1, i, -1):\n # if nums[i] == nums[j]:\n # return nums[i]\n\n # add all nums 1+3+4+2+2 = 12\n\n hashmap = {}\n\n for i in range(len(nums)):\n if nums[i] in hashmap:\n return nums[i]\n else:\n hashmap[nums[i]] = 1\n\n # actualtotal = 0\n # expectedtotal = 0\n # # 12 - 1 - 2 - 3 - 4\n\n # for i in range(len(nums)):\n # expectedtotal += i\n # actualtotal += nums[i]\n\n # print(actualtotal, expectedtotal)\n\n # return actualtotal - expectedtotal\n","memory":"32346"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashmap = {}\n\n for i in nums:\n if i not in hashmap:\n hashmap[i]= 1 \n else:\n return i \n return 0 \n\n\n\n\n\n\n\n\n\n\n\n\n\n \n # HASHMAP U CAN JUST DIRECTLY ACCESS SO CONSTANT EXTRA SPACE, CAN ALSO DO WITH A SET\n hashmap = {}\n count = 1\n\n for i in nums:\n if i not in hashmap:\n hashmap[i] = count\n else:\n return i\n return 0\n\n # MEMORY LIMIT EXEEDED\n # sort = []\n # for i in nums:\n # if i not in sort:\n # nums.append(i)\n # else:\n # return i\n # return 0\n\n ","memory":"32505"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \n dic1 = defaultdict(int)\n\n for i in range(len(nums)):\n dic1[nums[i]]+=1\n if dic1[nums[i]]>1:\n return nums[i]\n\n\n","memory":"32664"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashMap=set()\n print(hashMap)\n for i in nums:\n if i not in hashMap:\n hashMap.add(i)\n else:\n return i\n\n\n ","memory":"32823"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n\n ans = set()\n n = len(nums)\n print(n)\n cnt=0\n for i in range(n):\n cnt+=1\n ans.add(nums[i])\n if len(ans)!=cnt:\n return nums[i]\n # print(nums[i])\n # return 0\n \n \n # print(ans)","memory":"32981"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n se=dict()\n for i in nums:\n if i in se:\n return i\n else:\n se[i]=1\n return 0\n ","memory":"33140"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashmap = defaultdict(int)\n for n in nums:\n if hashmap[n]:\n return n\n hashmap[n] += 1 \n ","memory":"33299"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \n hashmap = {}\n\n for i in nums:\n if i not in hashmap:\n hashmap[i] = 0\n hashmap[i] += 1\n if hashmap[i] > 1:\n return i","memory":"33299"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d = {}\n for i in nums:\n if i not in d:\n d[i] = 1\n else:\n return i","memory":"33458"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n counts = collections.defaultdict(int)\n for i in nums:\n if counts[i] == 1:\n return i\n else:\n counts[i] += 1","memory":"33458"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n counts = collections.defaultdict(int)\n for i in nums:\n if counts[i] == 1:\n return i\n else:\n counts[i] += 1","memory":"33616"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n visited = {}\n for index, val in enumerate(nums):\n if val in visited:\n return val\n else:\n visited[val] = index","memory":"33616"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n value_index = {}\n for i in range(len(nums)):\n if value_index.get(nums[i]) is not None:\n return nums[i]\n\n value_index[nums[i]] = i","memory":"33775"},{"code":"sys.stdout = open('user.out', 'w')\nfor nums in map(loads, stdin):\n print(Counter(nums).most_common(1)[0][0])\n\nexit()\n","memory":"33934"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashmap={}\n n = len(nums)\n for i in range(n):\n if nums[i] in hashmap:\n return nums[i]\n else:\n hashmap[nums[i]]=True\n \n ","memory":"34093"},{"code":"sys.stdout = open('user.out', 'w')\nfor nums in map(loads, stdin):\n print(Counter(nums).most_common(1)[0][0])\n \nclass Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n slow,fast=nums[0],nums[nums[0]]\n while slow!=fast:\n slow=nums[slow]\n fast=nums[nums[fast]]\n slow=0\n while slow!=fast:\n slow=nums[slow]\n fast=nums[fast]\n return slow\n ","memory":"34251"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n my_dict={}\n for i in range(len(nums)):\n if nums[i] in my_dict:\n return nums[i]\n my_dict[nums[i]]=i\n return -1\n ","memory":"34410"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n \n hash_map = {}\n\n for i in range(len(nums)):\n if nums[i] in hash_map:\n return nums[i]\n\n hash_map[nums[i]] = i\n\n return -1","memory":"34569"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashmap = {}\n for i in range(len(nums)):\n if nums[i] in hashmap:\n return nums[i]\n hashmap[nums[i]] = i\n return -1","memory":"34728"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n num_set = set() \n start, end = 0, len(nums) - 1\n while start <= end:\n if nums[start] in num_set: \n return nums[start] \n if nums[end] in num_set: \n return nums[end]\n\n if start != end: \n num_set.add(nums[start])\n if nums[end] in num_set: \n return nums[end]\n num_set.add(nums[end])\n else: \n if nums[start] in num_set: \n return nums[start]\n num_set.add(nums[start])\n start += 1\n end -= 1\n \n\n\n\n","memory":"34886"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n def check(num_1, num_2, tick = set()):\n if num_1 in tick:\n return num_1\n else: \n tick.add(num_1)\n if num_2 in tick:\n return num_2\n tick.add(num_2)\n return False\n\n counter_1 = 0\n counter_2 = len(nums)-1\n duplicate = check(nums[counter_1], nums[counter_2])\n \n while not duplicate:\n counter_1 += 1\n counter_2 -= 1\n duplicate = check(nums[counter_1], nums[counter_2])\n\n\n return duplicate","memory":"35045"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n def check(num_1, num_2, tick = set()):\n if num_1 in tick:\n return num_1\n else: \n tick.add(num_1)\n if num_2 in tick:\n return num_2\n tick.add(num_2)\n return False\n\n counter_1 = 0\n counter_2 = len(nums)-1\n duplicate = check(nums[counter_1], nums[counter_2])\n \n while not duplicate:\n counter_1 += 1\n counter_2 -= 1\n duplicate = check(nums[counter_1], nums[counter_2])\n\n\n return duplicate","memory":"35045"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n num_set = set() \n start, end = 0, len(nums) - 1\n while start <= end:\n if nums[start] in num_set: \n return nums[start] \n if nums[end] in num_set: \n return nums[end]\n\n if start != end: \n num_set.add(nums[start])\n if nums[end] in num_set: \n return nums[end]\n num_set.add(nums[end])\n else: \n if nums[start] in num_set: \n return nums[start]\n num_set.add(nums[start])\n start += 1\n end -= 1\n \n\n\n\n","memory":"35204"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d = {}\n for i in nums:\n d[i] = d.get(i, 0) + 1\n if d[i] >= 2:\n return i\n \n # return 1","memory":"35363"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n dic = defaultdict(int)\n for num in nums:\n dic[num] += 1\n if dic[num] == 2:\n return num","memory":"35521"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n duplicated = {}\n\n for num in nums:\n if num in duplicated:\n return num\n\n else:\n duplicated[num] = 1\n\n\n return 0","memory":"35680"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n hashMap = {}\n\n for num in nums:\n hashMap[num] = 1 + hashMap.get(num, 0)\n # print(hashMap)\n if hashMap[num] == 2:\n return num\n \n","memory":"35839"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n options = {x for x in range(1, len(nums))}\n for number in nums:\n if number in options:\n options.remove(number)\n else:\n return number \n ","memory":"35998"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n countdiff = sum(nums) - sum(set(nums))\n ind = len(nums) - len(set(nums))\n return countdiff//ind","memory":"36156"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n return (sum(nums) - sum(set(nums))) // (len(nums) - len(set(nums)))\n \n\n \n \n","memory":"36315"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n set1=set()\n num=-1\n for i in range(len(nums)):\n if nums[i] in set1:\n num=nums[i]\n else:\n set1.add(nums[i])\n return num\n","memory":"36474"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n seen = set(nums)\n sumFull = sum(nums)\n sumShort = sum(seen)\n rem = sumFull-sumShort\n numRem = len(nums) - len(seen)\n return int(rem/numRem)","memory":"36633"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n left = set()\n for x in range(10 ** 5):\n left.add(x+1)\n \n for n in nums:\n if n not in left:\n return n\n else:\n left.remove(n)","memory":"36791"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d={}\n for i in nums:\n if i in d:\n d[i]=d[i]+1\n else:\n d[i]=1\n for key,value in d.items():\n if value>1:\n return key \n \n\n \n ","memory":"36950"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d={}\n tot,exp=0,0\n exp=sum(list(range(min(nums),max(nums)+1)))\n for i in range(len(nums)):\n print(tot,' ',exp)\n tot+=nums[i]\n if nums[i] not in d:\n d[nums[i]]=0\n d[nums[i]]+=1\n if d[nums[i]]==2:\n return nums[i]\n\n print(tot-exp)\n return 0","memory":"37109"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n n = len(nums)\n if len(set(nums)) < n:\n dic = {}\n for i in range(n):\n if(nums[i] not in dic):\n dic[nums[i]] = 1\n else:\n return nums[i]\n return -1","memory":"37268"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n c = Counter(nums)\n for n, v in c.items():\n if v>1:\n return n\n \n # slow = 0\n # fast = 0\n # while slow!=fast:\n # slow = nums[slow]\n # fast = nums[nums[fast]]\n # fast = 0\n # while slow!=fast:\n # slow = nums[slow]\n # fast = nums[fast]\n # return slow","memory":"37426"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d1={}\n for i in nums:\n if i not in d1:\n d1[i]=0\n d1[i]+=1\n for i,j in d1.items():\n if j!=1:\n return i\n \n ","memory":"37585"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int: \n \"\"\"\n =============================================\n Brute Force Algorithm:\n Time: O(n^2)\n Space: O(1)\n Cons: TLE\n Pros: No modification and constant space complexity\n ###########################################\n \n n = len(nums)\n for i in range(n):\n for j in range(i+1, n):\n if nums[i] == nums[j]:\n return nums[i]\n\n ============================================\n Sorting based algorithm\n Time: O(n log n)\n Memory: O(n) or O(log n)\n Cons: Memory is not constant, modifued array\n Pros: Time improved.\n ############################################\n nums.sort()\n n = len(nums)\n for i in range(1, n):\n if nums[i] == nums[i-1]:\n return nums[i]\n\n ============================================\n Negative Marking\n Time: O(n)\n Memory: O(1)\n Pros: Linear Time Complexity, no additional space\n Cons: Modifies the given array and restores it\n #############################################\n n = len(nums)\n for i in range(n):\n curr = abs(nums[i])\n if nums[curr] < 0:\n duplicate = curr\n break\n nums[curr] *= -1\n\n for i in range(n):\n nums[i] = abs(nums[i])\n return duplicate\n\n ================================================\n Array as hashmap\n\n \"\"\"\n\n def store(nums: List[int], cur: int):\n if cur == nums[cur]:\n return cur\n nxt = nums[cur]\n nums[cur] = cur\n return store(nums, nxt)\n \n return store(nums, 0)\n \n \n \n","memory":"37744"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n def store(nums, cur):\n if cur == nums[cur]:\n return cur\n nxt = nums[cur]\n nums[cur] = cur\n return store(nums, nxt)\n return store(nums, 0)\n ","memory":"37903"},{"code":"from collections import Counter\n\nclass Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n nums_cntr = Counter(nums)\n for key, val in nums_cntr.items():\n if val > 1:\n return key","memory":"38061"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n return Counter(nums).most_common(1)[0][0]","memory":"38220"},{"code":"class Solution:\n def findDuplicate(self, nums: List[int]) -> int:\n d=dict()\n for i in range(len(nums)):\n if nums[i] in d:\n d[nums[i]]+=1\n else:\n d[nums[i]]=1\n for k,v in d.items():\n if v>1:\n return k\n ","memory":"38220"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n left, right = nums[0], nums[0]\\n while True:\\n left, right = nums[left], nums[nums[right]]\\n if left == right:\\n left = nums[0]\\n break\\n while left != right:\\n left, right = nums[left], nums[right]\\n return left\\n def solve(self):\\n f = open('user.out', 'w')\\n for nums in map(loads, stdin):\\n print(self.findDuplicate(nums), file=f)\\nsolution = Solution()\\nsolution.solve()\\n\\nexit()\",\n \"memory\": \"25679\"\n },\n {\n \"code\": \"\\ndef findDuplicate(nums: List[int]) -> int:\\n \\n\\n slow, fast = 0, 0\\n\\n while True:\\n fast = nums[nums[fast]]\\n slow = nums[slow]\\n\\n if slow == fast:\\n break\\n \\n slow = 0\\n\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return slow\\n\\nf = open('user.out', 'w')\\nfor case in map(loads, stdin):\\n f.write(f\\\"{findDuplicate(case)}\\\\n\\\")\\nf.flush()\\nexit(0)\",\n \"memory\": \"25679\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nextIdx = nums[0]\\n nums[0] = None\\n while True:\\n if not nums[nextIdx]:\\n return nextIdx\\n curIdx = nextIdx\\n nextIdx = nums[curIdx]\\n nums[curIdx] = None\\n \",\n \"memory\": \"25838\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n pointer = nums[-1]\\n\\n for i in range(len(nums)):\\n\\n if nums[pointer - 1] == -1:\\n return pointer\\n \\n else:\\n val = pointer\\n pointer = nums[pointer - 1]\\n nums[val - 1] = -1\",\n \"memory\": \"25996\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n start = 0\\n while True:\\n if not nums[start]: return start\\n temp = nums[start]\\n nums[start] = False\\n start = temp\",\n \"memory\": \"26155\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: list[int]) -> int:\\n for index in range(len(nums)):\\n if nums[index] == -1:\\n continue\\n if nums[index] == -1:\\n return nums[index] \\n val = nums[index]\\n nums[index] = -2\\n while True:\\n if nums[val] == -1:\\n return val\\n elif nums[val] == -2:\\n nums[val] = -1\\n break\\n else:\\n temp = nums[val]\\n nums[val] = -1\\n val = temp\\n\\n return 0\\n\",\n \"memory\": \"26155\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n i = 0\\n while True:\\n if nums[i] == -1:\\n return i\\n \\n next_i = nums[i]\\n nums[i] = -1\\n i = next_i\",\n \"memory\": \"26314\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n\\n\\n '''\\n\\n\\n treat it as linked list where node value = nums[index]\\n next pointer = nums[index]\\n\\n\\n (1) -> (3) -> (2) -> (4)\\n <-\\n\\n\\n (3) -> (4) -> (2) \\n <-\\n\\n\\n iterate through LL\\n keep a set of numbers seen\\n once we see a repeated number, return as solution\\n\\n\\n make nums[curr] = 0 to count as visited\\n first number that points to a zero is the duplicate\\n \\n '''\\n\\n\\n curr = nums[0]\\n index = 0\\n\\n while nums[curr] != 0:\\n if index == curr:\\n return curr\\n nums[index] = 0\\n index = curr\\n curr = nums[curr]\\n\\n return curr\\n \",\n \"memory\": \"26473\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = nums[0], nums[0]\\n \\n # First phase of the algorithm: finding the intersection point of the two runners.\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n # Second phase of the algorithm: finding the entrance to the cycle.\\n fast = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n \\n return slow\\n\",\n \"memory\": \"26631\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow=fast=0\\n while True:\\n slow=nums[slow]\\n fast=nums[nums[fast]]\\n if slow==fast:\\n break\\n slowt=0\\n while True:\\n slowt=nums[slowt]\\n slow=nums[slow]\\n if slow==slowt:\\n return slow\\n\",\n \"memory\": \"26790\"\n },\n {\n \"code\": \"'''\\n1 to n inclusive\\n\\ncontaining n + 1 integers\\n\\n\\nn = 3\\n\\n1, 2, 3, 1\\n\\n'''\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[fast]\\n fast = nums[fast]\\n if slow == fast:\\n break\\n \\n slow2 = nums[0]\\n while True:\\n \\n if slow == slow2:\\n return slow\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n # # Step 1: Initialize the slow and fast pointers\\n # slow = nums[0]\\n # fast = nums[0]\\n \\n # # Step 2: Move slow by 1 step and fast by 2 steps to find the intersection\\n # while True:\\n # slow = nums[slow]\\n # fast = nums[nums[fast]]\\n # if slow == fast:\\n # break\\n \\n # # Step 3: Reset one pointer to the start and move both by 1 step until they meet\\n # # slow2 = nums[0]\\n # # while slow != slow2:\\n # # slow = nums[slow]\\n # # slow2 = nums[slow2]\\n\\n # slow2 = nums[0]\\n # while True:\\n # if slow == slow2:\\n # return slow\\n \\n # slow = nums[slow]\\n # slow2 = nums[slow2]\\n \\n # # # The point of intersection is the duplicate number\\n # # return slow\\n\\n\",\n \"memory\": \"26949\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort() #N log N\\n for i in range(len(nums)):\\n if nums[i] == nums[i + 1]:\\n return nums[i]\\n return -1\\n \",\n \"memory\": \"27108\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = 0, 0\\n\\n while True:\\n\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\\n \\n \",\n \"memory\": \"27266\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n fast = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast]\\n return fast\",\n \"memory\": \"27425\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n fast = slow = 0\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[fast]\\n fast = nums[fast]\\n if nums[fast] == nums[slow]:\\n break\\n\\n new_slow = 0\\n while nums[slow] != nums[new_slow]:\\n slow = nums[slow]\\n new_slow = nums[new_slow]\\n return nums[new_slow]\\n \\n \",\n \"memory\": \"27584\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n = len(nums)\\n nums.sort()\\n for i in range(1,n):\\n if nums[i-1] == nums[i]:\\n return nums[i]\\n return -1\",\n \"memory\": \"27743\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n ans = None\\n for n in nums:\\n if n < 0: n = -n\\n if nums[n-1] < 0:\\n ans = n\\n break\\n else:\\n nums[n-1] = -nums[n-1]\\n \\n for i in range(len(nums)):\\n nums[i] = abs(nums[i])\\n \\n return ans\",\n \"memory\": \"27743\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = 0, 0\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n if slow == fast:\\n break\\n\\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\\n \",\n \"memory\": \"27901\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n x = abs(nums[i])\\n if nums[x] < 0:\\n return x\\n nums[x] *= -1\\n \\n return -1\",\n \"memory\": \"27901\"\n },\n {\n \"code\": \"'''\\nOne approach:\\n- For each number, go through the array and check if that number exists\\nTime O(n^2)\\n\\nCoded up solution: After looking at the solution\\n\\n'''\\n\\n\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = fast = 0 # represents index\\n\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\\n \",\n \"memory\": \"28060\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n res = -1\\n for i in nums:\\n ind = abs(i)\\n if nums[ind-1] < 0:\\n res = ind\\n break\\n # return ind\\n nums[ind-1] *= -1\\n # for i in range(len(nums)):\\n # nums[i] = abs(nums[i])\\n return res\\n \",\n \"memory\": \"28219\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums.sort()\\n l =len(nums)\\n for i in range(l-1):\\n if nums[i]==nums[i+1]:\\n return nums[i]\\n \",\n \"memory\": \"28219\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # EVEN MORE GENIUS, USE FLOYD'S START OF CYCLE ALGO\\n\\n slow = 0\\n fast = 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n # Loop detection will terminate when p = c, that is distance from start\\n # to beginning of loop = distance from \\\"termination point\\\" (meeting point of fast and slow)\\n # to beginning of loop\\n\\n slow2 = 0\\n while slow2 != slow:\\n slow2 = nums[slow2]\\n slow = nums[slow]\\n \\n return slow\\n\\n\\n # Genius solution, use Floyd's cycle detection.\\n # Let nums[i] be the next index to check. So each *value* in the list\\n # points to next *index* to check.\\n # If there were no repeat numbers, this means that each value and index would have \\n # one outbound and one incoming edge, with the exception of nums[0] (no inbound).\\n # However, due to duplicate values, a cycle is formed since the same value at \\n # 2 different indices will point to the same next index.\\n # The cycle is entered by one of the repeat values.\\n # So, mark each \\\"node\\\" as having been visited by making it negative, and watch for\\n # encountering a negative value, the first of which will indicate entrance into the\\n # cycle via the repeated value.\\n # curr = 0\\n # while True:\\n # nxt = nums[curr]\\n # nums[curr] *= -1\\n # if nums[nxt] < 0:\\n # return nxt\\n # curr = nxt\\n \",\n \"memory\": \"28378\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = nums[0]\\n fast = nums[0]\\n \\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n \\n slow2 = nums[0]\\n while slow != slow2:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n return slow\\n \\n \\n \\n \",\n \"memory\": \"28378\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow, fast = 0, 0\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n slow2 = 0\\n while True:\\n slow = nums[slow] \\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow \",\n \"memory\": \"28536\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # nums.sort()\\n # n = len(nums)\\n # for i in range(1,n):\\n # if nums[i-1] == nums[i]:\\n # return nums[i]\\n slow = nums[0]\\n fast = nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n fast = nums[0]\\n while slow != fast:\\n slow = nums[slow]\\n fast = nums[fast] \\n return slow \\n\\n \",\n \"memory\": \"28536\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\\"\\\"\\\"\\n So in order to know how to solve this problem we must know the existance of\\n floyds algorithm. That's the only way.\\n\\n So basically, we treat the list as a linked list, where the values represent the index\\n of the next node. Then, as the list must has duplicates, it means that it has a cycle.\\n Then we must utilize floyds algorithm to find the begining of the cycle which is\\n the repeated number\\n \\\"\\\"\\\"\\n\\n # We first find the intersection of a fast and a slow pointer\\n slow, fast = nums[0], nums[0]\\n while True:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n break\\n\\n # Then we find the begining of the cycle by placing another slow\\n # pointer at the begining of the list and waiting for them to colide\\n slow2 = nums[0]\\n while slow2 != slow:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n return slow\",\n \"memory\": \"28695\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n=len(nums)\\n # cnt=0\\n # ans=0\\n # for i in range(n):\\n # for j in range(i+1,n):\\n # if nums[i]==nums[j]:\\n # return nums[i]\\n # return -1\\n repeat=-1\\n hash=[0]*(n+1)\\n for i in range(n):\\n hash[nums[i]]+=1\\n for i in range(1,n+1):\\n if hash[i]>=2:\\n repeat=i\\n return repeat\\n \",\n \"memory\": \"28695\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n=len(nums)\\n for i in range(n):\\n nums[nums[i]%n]+=n\\n if nums[nums[i]%n]//n>1:\\n return nums[i]%n\\n \\n # for i in range(n):\\n # if nums[i]//n>1:\\n # return i\\n slow=nums[0]\\n fast=nums[0]\\n while slow!=fast:\\n slow=nums[slow]\\n fast=nums[nums[fast]]\\n slow=nums[0]\\n while slow!=fast:\\n slow=nums[slow]\\n fast=nums[fast]\\n\\n return slow\\n \\n \",\n \"memory\": \"28854\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n = len(nums)-1\\n num_bits = int(math.floor(log2(n))) + 1\\n counts = [0 for _ in range(num_bits)]\\n\\n def update(i, cnts):\\n bit = 0\\n while i > 0:\\n if i%2:\\n cnts[bit] += 1\\n i >>= 1\\n bit += 1\\n\\n # count number of each bit for sum from 1 to n (i.e. no duplicate)\\n for i in range(1, n+1):\\n update(i, counts)\\n\\n # count number of each bit for the actual array\\n actual_counts = [0 for _ in range(num_bits)]\\n for num in nums:\\n update(num, actual_counts)\\n\\n # the bit(s) which has maximum count difference is how many times the duplicate\\n # number has appeared in the actual array\\n actual_counts = [actual_counts[b]-counts[b] for b in range(num_bits)]\\n # if a bit count difference is > 0, set it to maximum count diff, otherwise set\\n # it to zero. The result bitmask is equal to: duplicate number multiply how many\\n # times it duplicates\\n max_count = max(actual_counts)\\n actual_counts = [(max_count if c > 0 else 0) for c in actual_counts]\\n\\n res = 0\\n dup = 0\\n for bit in range(num_bits):\\n bcnt = actual_counts[bit]\\n if bcnt > 0:\\n res += bcnt*2**bit\\n dup = bcnt\\n\\n return res // dup\\n\",\n \"memory\": \"28854\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n = len(nums)\\n sorted_nums = sorted(nums)\\n for i in range(n - 1):\\n if sorted_nums[i] == sorted_nums[i + 1]:\\n return sorted_nums[i]\\n return -1\\n \",\n \"memory\": \"29013\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n slow = nums[0]\\n fast = nums[slow]\\n\\n while slow != fast:\\n fast = nums[nums[fast]]\\n slow = nums[slow]\\n print(slow, fast)\\n \\n slow = 0\\n\\n while slow != fast:\\n fast = nums[fast]\\n slow = nums[slow]\\n \\n return slow\",\n \"memory\": \"29013\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = 0\\n fast = 0\\n intersectionFound = False\\n repeatFound = False\\n\\n while not intersectionFound:\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n if slow == fast:\\n intersectionFound = True\\n \\n \\n print(slow)\\n slow2 = 0\\n\\n while not repeatFound:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n\\n if slow == slow2:\\n repeatFound = True\\n \\n return slow\\n\\n \",\n \"memory\": \"29171\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n sp=0\\n fp=0\\n fFirst = True\\n cnt = 0\\n while sp!=fp or fFirst:\\n fFirst = False\\n sp=nums[sp]\\n fp =nums[nums[fp]]\\n \\n \\n \\n sp = 0\\n while sp!=fp:\\n print(sp,fp)\\n sp=nums[sp]\\n fp = nums[fp]\\n return sp\\n\",\n \"memory\": \"29330\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n newarr=sorted(nums)\\n print(newarr)\\n for i in range(len(newarr)-1):\\n if newarr[i]==newarr[i+1]:\\n return newarr[i]\\n\\n\\n\\n\\n\\n\\n\\n\\n # for i in range(len(nums)-1):\\n # for j in range(i+1,len(nums)):\\n # if nums[i]==nums[j]:\\n # return nums[i]\\n # n=len(nums)\\n # expsum=n*(n-1)/2\\n # actsum=0\\n # for num in nums:\\n # actsum+=num\\n # return int(actsum-expsum)\\n\",\n \"memory\": \"29330\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow = 0\\n fast = 0\\n while True:\\n print(\\\"---1. slow is\\\", slow, \\\"fast is\\\", fast)\\n slow = nums[slow]\\n fast = nums[nums[fast]]\\n\\n if slow == fast:\\n break\\n slow2 = 0\\n while True:\\n slow = nums[slow]\\n slow2 = nums[slow2]\\n if slow == slow2:\\n return slow\\n\\n\\n\\n\\n return -1\",\n \"memory\": \"29489\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n i = 0\\n\\n while i < len(nums):\\n corrected_idx = nums[i] - 1\\n\\n if nums[i] != nums[corrected_idx]:\\n nums[i] , nums[corrected_idx] = nums[corrected_idx] , nums[i]\\n\\n else:\\n i += 1\\n\\n print(nums)\\n\\n\\n for i in range(len(nums)):\\n if i + 1 != nums[i]:\\n return nums[i]\\n \",\n \"memory\": \"29648\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n res=[0]*(100000)\\n for i in nums:\\n print(i)\\n if res[i-1]==1:\\n return i \\n else:\\n res[i-1]+=1 \",\n \"memory\": \"29806\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n arr = [0]*(10**5+1)\\n for num in nums:\\n print(num)\\n arr[num]+=1\\n if arr[num] > 1:\\n return num\\n\",\n \"memory\": \"29965\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"memory\": \"30124\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n b=set()\\n for i in nums:\\n if i in b:\\n return i\\n else:\\n b.add(i)\\n \",\n \"memory\": \"30283\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n dupl = []\\n #print(dupl)\\n def sort(nums):\\n if len(nums) <= 1 or len(dupl) > 0:\\n return nums\\n pivot = nums[0]\\n less = []\\n equal = [nums[0]]\\n larger = []\\n nums.pop(0)\\n for i in nums:\\n if i < pivot:\\n less += [i]\\n if i == pivot:\\n equal += [i]\\n dupl.append(i)\\n if i > pivot:\\n larger += [i]\\n return sort(less) + equal + sort(larger)\\n halfsorted = sort(nums)\\n return dupl[0]\\n \",\n \"memory\": \"30441\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n visited = set()\\n for num in nums:\\n if num in visited: \\n return num\\n else:\\n visited.add(num)\",\n \"memory\": \"30600\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen=set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"memory\": \"30759\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n s=set()\\n for num in nums:\\n if num in s:\\n return num\\n s.add(num)\\n \",\n \"memory\": \"30918\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen=set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num) \\n \",\n \"memory\": \"31076\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n se=set()\\n for i in nums:\\n if i in se:\\n return i\\n se.add(i)\\n return Null\",\n \"memory\": \"31076\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"memory\": \"31235\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashSet = set()\\n for n in nums:\\n if n in hashSet:\\n return n\\n hashSet.add(n) \\n \",\n \"memory\": \"31235\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\\n \\n\",\n \"memory\": \"31394\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set()\\n for num in nums:\\n if num in seen:\\n return num\\n seen.add(num)\",\n \"memory\": \"31394\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n s = set()\\n for num in nums:\\n if num in s:\\n return num\\n s.add(num)\",\n \"memory\": \"31553\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n S = set()\\n for i in nums:\\n if i not in S:\\n S.add(i)\\n else:\\n return i\",\n \"memory\": \"31553\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n dupl = []\\n #print(dupl)\\n def sort(nums):\\n if len(nums) <= 1 or len(dupl) > 0:\\n return nums\\n pivot = nums[0]\\n less = []\\n equal = [nums[0]]\\n larger = []\\n nums.pop(0)\\n for i in nums:\\n if i < pivot:\\n less += [i]\\n if i == pivot:\\n equal += [i]\\n dupl.append(i)\\n break\\n if i > pivot:\\n larger += [i]\\n return sort(less) + equal + sort(larger)\\n halfsorted = sort(nums)\\n #print(halfsorted)\\n return dupl[0]\\n \",\n \"memory\": \"31711\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n li={}\\n for i in nums:\\n if i in li:\\n return(i)\\n else:\\n li[i]=True \\n \",\n \"memory\": \"32188\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n # right, left = 0,1\\n\\n # while nums[right] != nums[left]:\\n # while nums[right] != nums[left]:\\n # left += 1\\n # right += 1\\n # left = right - 1\\n\\n # for i in range(len(nums)):\\n # for j in range(len(nums) - 1, i, -1):\\n # if nums[i] == nums[j]:\\n # return nums[i]\\n\\n # add all nums 1+3+4+2+2 = 12\\n\\n hashmap = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n return nums[i]\\n else:\\n hashmap[nums[i]] = 1\\n\\n # actualtotal = 0\\n # expectedtotal = 0\\n # # 12 - 1 - 2 - 3 - 4\\n\\n # for i in range(len(nums)):\\n # expectedtotal += i\\n # actualtotal += nums[i]\\n\\n # print(actualtotal, expectedtotal)\\n\\n # return actualtotal - expectedtotal\\n\",\n \"memory\": \"32346\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashmap = {}\\n\\n for i in nums:\\n if i not in hashmap:\\n hashmap[i]= 1 \\n else:\\n return i \\n return 0 \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n # HASHMAP U CAN JUST DIRECTLY ACCESS SO CONSTANT EXTRA SPACE, CAN ALSO DO WITH A SET\\n hashmap = {}\\n count = 1\\n\\n for i in nums:\\n if i not in hashmap:\\n hashmap[i] = count\\n else:\\n return i\\n return 0\\n\\n # MEMORY LIMIT EXEEDED\\n # sort = []\\n # for i in nums:\\n # if i not in sort:\\n # nums.append(i)\\n # else:\\n # return i\\n # return 0\\n\\n \",\n \"memory\": \"32505\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n dic1 = defaultdict(int)\\n\\n for i in range(len(nums)):\\n dic1[nums[i]]+=1\\n if dic1[nums[i]]>1:\\n return nums[i]\\n\\n\\n\",\n \"memory\": \"32664\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashMap=set()\\n print(hashMap)\\n for i in nums:\\n if i not in hashMap:\\n hashMap.add(i)\\n else:\\n return i\\n\\n\\n \",\n \"memory\": \"32823\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n\\n ans = set()\\n n = len(nums)\\n print(n)\\n cnt=0\\n for i in range(n):\\n cnt+=1\\n ans.add(nums[i])\\n if len(ans)!=cnt:\\n return nums[i]\\n # print(nums[i])\\n # return 0\\n \\n \\n # print(ans)\",\n \"memory\": \"32981\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n se=dict()\\n for i in nums:\\n if i in se:\\n return i\\n else:\\n se[i]=1\\n return 0\\n \",\n \"memory\": \"33140\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashmap = defaultdict(int)\\n for n in nums:\\n if hashmap[n]:\\n return n\\n hashmap[n] += 1 \\n \",\n \"memory\": \"33299\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n hashmap = {}\\n\\n for i in nums:\\n if i not in hashmap:\\n hashmap[i] = 0\\n hashmap[i] += 1\\n if hashmap[i] > 1:\\n return i\",\n \"memory\": \"33299\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d = {}\\n for i in nums:\\n if i not in d:\\n d[i] = 1\\n else:\\n return i\",\n \"memory\": \"33458\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n counts = collections.defaultdict(int)\\n for i in nums:\\n if counts[i] == 1:\\n return i\\n else:\\n counts[i] += 1\",\n \"memory\": \"33458\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n counts = collections.defaultdict(int)\\n for i in nums:\\n if counts[i] == 1:\\n return i\\n else:\\n counts[i] += 1\",\n \"memory\": \"33616\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n visited = {}\\n for index, val in enumerate(nums):\\n if val in visited:\\n return val\\n else:\\n visited[val] = index\",\n \"memory\": \"33616\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n value_index = {}\\n for i in range(len(nums)):\\n if value_index.get(nums[i]) is not None:\\n return nums[i]\\n\\n value_index[nums[i]] = i\",\n \"memory\": \"33775\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n\\nexit()\\n\",\n \"memory\": \"33934\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashmap={}\\n n = len(nums)\\n for i in range(n):\\n if nums[i] in hashmap:\\n return nums[i]\\n else:\\n hashmap[nums[i]]=True\\n \\n \",\n \"memory\": \"34093\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(Counter(nums).most_common(1)[0][0])\\n \\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n slow,fast=nums[0],nums[nums[0]]\\n while slow!=fast:\\n slow=nums[slow]\\n fast=nums[nums[fast]]\\n slow=0\\n while slow!=fast:\\n slow=nums[slow]\\n fast=nums[fast]\\n return slow\\n \",\n \"memory\": \"34251\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n my_dict={}\\n for i in range(len(nums)):\\n if nums[i] in my_dict:\\n return nums[i]\\n my_dict[nums[i]]=i\\n return -1\\n \",\n \"memory\": \"34410\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n \\n hash_map = {}\\n\\n for i in range(len(nums)):\\n if nums[i] in hash_map:\\n return nums[i]\\n\\n hash_map[nums[i]] = i\\n\\n return -1\",\n \"memory\": \"34569\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashmap = {}\\n for i in range(len(nums)):\\n if nums[i] in hashmap:\\n return nums[i]\\n hashmap[nums[i]] = i\\n return -1\",\n \"memory\": \"34728\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n num_set = set() \\n start, end = 0, len(nums) - 1\\n while start <= end:\\n if nums[start] in num_set: \\n return nums[start] \\n if nums[end] in num_set: \\n return nums[end]\\n\\n if start != end: \\n num_set.add(nums[start])\\n if nums[end] in num_set: \\n return nums[end]\\n num_set.add(nums[end])\\n else: \\n if nums[start] in num_set: \\n return nums[start]\\n num_set.add(nums[start])\\n start += 1\\n end -= 1\\n \\n\\n\\n\\n\",\n \"memory\": \"34886\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n def check(num_1, num_2, tick = set()):\\n if num_1 in tick:\\n return num_1\\n else: \\n tick.add(num_1)\\n if num_2 in tick:\\n return num_2\\n tick.add(num_2)\\n return False\\n\\n counter_1 = 0\\n counter_2 = len(nums)-1\\n duplicate = check(nums[counter_1], nums[counter_2])\\n \\n while not duplicate:\\n counter_1 += 1\\n counter_2 -= 1\\n duplicate = check(nums[counter_1], nums[counter_2])\\n\\n\\n return duplicate\",\n \"memory\": \"35045\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n def check(num_1, num_2, tick = set()):\\n if num_1 in tick:\\n return num_1\\n else: \\n tick.add(num_1)\\n if num_2 in tick:\\n return num_2\\n tick.add(num_2)\\n return False\\n\\n counter_1 = 0\\n counter_2 = len(nums)-1\\n duplicate = check(nums[counter_1], nums[counter_2])\\n \\n while not duplicate:\\n counter_1 += 1\\n counter_2 -= 1\\n duplicate = check(nums[counter_1], nums[counter_2])\\n\\n\\n return duplicate\",\n \"memory\": \"35045\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n num_set = set() \\n start, end = 0, len(nums) - 1\\n while start <= end:\\n if nums[start] in num_set: \\n return nums[start] \\n if nums[end] in num_set: \\n return nums[end]\\n\\n if start != end: \\n num_set.add(nums[start])\\n if nums[end] in num_set: \\n return nums[end]\\n num_set.add(nums[end])\\n else: \\n if nums[start] in num_set: \\n return nums[start]\\n num_set.add(nums[start])\\n start += 1\\n end -= 1\\n \\n\\n\\n\\n\",\n \"memory\": \"35204\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d = {}\\n for i in nums:\\n d[i] = d.get(i, 0) + 1\\n if d[i] >= 2:\\n return i\\n \\n # return 1\",\n \"memory\": \"35363\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n dic = defaultdict(int)\\n for num in nums:\\n dic[num] += 1\\n if dic[num] == 2:\\n return num\",\n \"memory\": \"35521\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n duplicated = {}\\n\\n for num in nums:\\n if num in duplicated:\\n return num\\n\\n else:\\n duplicated[num] = 1\\n\\n\\n return 0\",\n \"memory\": \"35680\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n hashMap = {}\\n\\n for num in nums:\\n hashMap[num] = 1 + hashMap.get(num, 0)\\n # print(hashMap)\\n if hashMap[num] == 2:\\n return num\\n \\n\",\n \"memory\": \"35839\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n options = {x for x in range(1, len(nums))}\\n for number in nums:\\n if number in options:\\n options.remove(number)\\n else:\\n return number \\n \",\n \"memory\": \"35998\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n countdiff = sum(nums) - sum(set(nums))\\n ind = len(nums) - len(set(nums))\\n return countdiff//ind\",\n \"memory\": \"36156\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n return (sum(nums) - sum(set(nums))) // (len(nums) - len(set(nums)))\\n \\n\\n \\n \\n\",\n \"memory\": \"36315\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n set1=set()\\n num=-1\\n for i in range(len(nums)):\\n if nums[i] in set1:\\n num=nums[i]\\n else:\\n set1.add(nums[i])\\n return num\\n\",\n \"memory\": \"36474\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n seen = set(nums)\\n sumFull = sum(nums)\\n sumShort = sum(seen)\\n rem = sumFull-sumShort\\n numRem = len(nums) - len(seen)\\n return int(rem/numRem)\",\n \"memory\": \"36633\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n left = set()\\n for x in range(10 ** 5):\\n left.add(x+1)\\n \\n for n in nums:\\n if n not in left:\\n return n\\n else:\\n left.remove(n)\",\n \"memory\": \"36791\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d={}\\n for i in nums:\\n if i in d:\\n d[i]=d[i]+1\\n else:\\n d[i]=1\\n for key,value in d.items():\\n if value>1:\\n return key \\n \\n\\n \\n \",\n \"memory\": \"36950\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d={}\\n tot,exp=0,0\\n exp=sum(list(range(min(nums),max(nums)+1)))\\n for i in range(len(nums)):\\n print(tot,' ',exp)\\n tot+=nums[i]\\n if nums[i] not in d:\\n d[nums[i]]=0\\n d[nums[i]]+=1\\n if d[nums[i]]==2:\\n return nums[i]\\n\\n print(tot-exp)\\n return 0\",\n \"memory\": \"37109\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n n = len(nums)\\n if len(set(nums)) < n:\\n dic = {}\\n for i in range(n):\\n if(nums[i] not in dic):\\n dic[nums[i]] = 1\\n else:\\n return nums[i]\\n return -1\",\n \"memory\": \"37268\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n c = Counter(nums)\\n for n, v in c.items():\\n if v>1:\\n return n\\n \\n # slow = 0\\n # fast = 0\\n # while slow!=fast:\\n # slow = nums[slow]\\n # fast = nums[nums[fast]]\\n # fast = 0\\n # while slow!=fast:\\n # slow = nums[slow]\\n # fast = nums[fast]\\n # return slow\",\n \"memory\": \"37426\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d1={}\\n for i in nums:\\n if i not in d1:\\n d1[i]=0\\n d1[i]+=1\\n for i,j in d1.items():\\n if j!=1:\\n return i\\n \\n \",\n \"memory\": \"37585\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int: \\n \\\"\\\"\\\"\\n =============================================\\n Brute Force Algorithm:\\n Time: O(n^2)\\n Space: O(1)\\n Cons: TLE\\n Pros: No modification and constant space complexity\\n ###########################################\\n \\n n = len(nums)\\n for i in range(n):\\n for j in range(i+1, n):\\n if nums[i] == nums[j]:\\n return nums[i]\\n\\n ============================================\\n Sorting based algorithm\\n Time: O(n log n)\\n Memory: O(n) or O(log n)\\n Cons: Memory is not constant, modifued array\\n Pros: Time improved.\\n ############################################\\n nums.sort()\\n n = len(nums)\\n for i in range(1, n):\\n if nums[i] == nums[i-1]:\\n return nums[i]\\n\\n ============================================\\n Negative Marking\\n Time: O(n)\\n Memory: O(1)\\n Pros: Linear Time Complexity, no additional space\\n Cons: Modifies the given array and restores it\\n #############################################\\n n = len(nums)\\n for i in range(n):\\n curr = abs(nums[i])\\n if nums[curr] < 0:\\n duplicate = curr\\n break\\n nums[curr] *= -1\\n\\n for i in range(n):\\n nums[i] = abs(nums[i])\\n return duplicate\\n\\n ================================================\\n Array as hashmap\\n\\n \\\"\\\"\\\"\\n\\n def store(nums: List[int], cur: int):\\n if cur == nums[cur]:\\n return cur\\n nxt = nums[cur]\\n nums[cur] = cur\\n return store(nums, nxt)\\n \\n return store(nums, 0)\\n \\n \\n \\n\",\n \"memory\": \"37744\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n def store(nums, cur):\\n if cur == nums[cur]:\\n return cur\\n nxt = nums[cur]\\n nums[cur] = cur\\n return store(nums, nxt)\\n return store(nums, 0)\\n \",\n \"memory\": \"37903\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n nums_cntr = Counter(nums)\\n for key, val in nums_cntr.items():\\n if val > 1:\\n return key\",\n \"memory\": \"38061\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n return Counter(nums).most_common(1)[0][0]\",\n \"memory\": \"38220\"\n },\n {\n \"code\": \"class Solution:\\n def findDuplicate(self, nums: List[int]) -> int:\\n d=dict()\\n for i in range(len(nums)):\\n if nums[i] in d:\\n d[nums[i]]+=1\\n else:\\n d[nums[i]]=1\\n for k,v in d.items():\\n if v>1:\\n return k\\n \",\n \"memory\": \"38220\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":98,"string":"98"}}},{"rowIdx":248,"cells":{"question_id":{"kind":"number","value":306,"string":"306"},"name":{"kind":"string","value":"additive-number"},"content":{"kind":"string","value":"<p>An <strong>additive number</strong> is a string whose digits can form an <strong>additive sequence</strong>.</p>\n\n<p>A valid <strong>additive sequence</strong> should contain <strong>at least</strong> three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.</p>\n\n<p>Given a string containing only digits, return <code>true</code> if it is an <strong>additive number</strong> or <code>false</code> otherwise.</p>\n\n<p><strong>Note:</strong> Numbers in the additive sequence <strong>cannot</strong> have leading zeros, so sequence <code>1, 2, 03</code> or <code>1, 02, 3</code> is invalid.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> "112358"\n<strong>Output:</strong> true\n<strong>Explanation:</strong> \nThe digits can form an additive sequence: 1, 1, 2, 3, 5, 8. \n1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> "199100199"\n<strong>Output:</strong> true\n<strong>Explanation:</strong> \nThe additive sequence is: 1, 99, 100, 199. \n1 + 99 = 100, 99 + 100 = 199\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= num.length <= 35</code></li>\n\t<li><code>num</code> consists only of digits.</li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong> How would you handle overflow for very large input integers?</p>\n"},"acRate":{"kind":"number","value":31.969263880014797,"string":"31.969264"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["string","backtracking"],"string":"[\n \"string\",\n \"backtracking\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"20\", 0.2639], [\"22\", 0.5277], [\"23\", 0.5277], [\"24\", 0.5277], [\"25\", 1.1873], [\"26\", 1.9789], [\"27\", 1.847], [\"28\", 1.4512], [\"29\", 2.3747], [\"30\", 4.8813], [\"31\", 4.7493], [\"32\", 3.562], [\"33\", 5.409], [\"34\", 8.8391], [\"35\", 6.7282], [\"36\", 5.1451], [\"37\", 7.3879], [\"38\", 8.7071], [\"39\", 7.124], [\"40\", 4.6174], [\"41\", 5.6728], [\"42\", 4.7493], [\"43\", 3.8259]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16300\", 2.9024], [\"16400\", 21.8997], [\"16500\", 36.0158], [\"16600\", 32.4538]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n\n def isAdditiveNumber(self, num: str) -> bool:\n\n n = len(num)\n\n def dfs(firstNum: int, secondNum: int, s: int) -> bool:\n\n if s == len(num):\n\n return True\n\n thirdNum = firstNum + secondNum\n\n thirdNumStr = str(thirdNum)\n\n return (num.find(thirdNumStr, s) == s and\n\n dfs(secondNum, thirdNum, s + len(thirdNumStr)))\n\n # num[0..i] = firstNum\n\n for i in range(n // 2):\n\n if i > 0 and num[0] == '0':\n\n return False\n\n firstNum = int(num[:i + 1])\n\n # num[i + 1..j] = secondNum\n\n # |thirdNum| >= max(|firstNum|, |secondNum|)\n\n j = i + 1\n\n while max(i, j - i) < n - j:\n\n if j > i + 1 and num[i + 1] == '0':\n\n break\n\n secondNum = int(num[i + 1:j + 1])\n\n if dfs(firstNum, secondNum, j + 1):\n\n return True\n\n j += 1\n\n return False\n\n","runtime":"20"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n for i in range(1, len(num)):\n for j in range(i+1, len(num)):\n first = num[0:i]\n second = num[i:j]\n if int(first) + int(second) == int(num[j:j+len(str(int(first)+int(second)))]):\n k = first+second\n while len(k) < len(num):\n if first[0] == '0' and int(first) > 0:\n break\n if second[0] == '0' and int(second) > 0:\n break\n next = int(first) + int(second)\n first = second\n second = str(next)\n k += (str(next))\n if k == num:\n return True\n return False\n \n \n \n ","runtime":"22"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n for i in range(1, n//2+1):\n x = num[:i]\n if x.startswith(\"0\") and len(x) > 1: break #no leading zero \n for j in range(i+1, min(n-i, (n+i)//2)+1): #i <= n-j and j-i <= n-j\n yy = num[i:j]\n if yy.startswith(\"0\") and len(yy) > 1: break #no leading zero\n \n ii, xx = i, x\n while num.startswith(yy, ii):\n ii += len(yy)\n xx, yy = yy, str(int(xx) + int(yy))\n if ii == len(num): return True \n \n return False","runtime":"23"},{"code":"class Solution:\n\n def isAdditiveHelper(self, num, start, prevSum, memo):\n # print(prevSum)\n memoKey = (start, 0 if len(prevSum) < 2 else (prevSum[-1] + prevSum[-2]))\n if memoKey in memo:\n return memo[memoKey]\n if start == len(num):\n return len(prevSum) > 2\n result = False\n stride = 1\n if num[start] == \"0\":\n temp = False\n if len(prevSum) < 2 or (len(prevSum) >= 2 and prevSum[-1] + prevSum[-2] == 0): \n prevSum.append(0)\n temp = self.isAdditiveHelper(num, start + 1, prevSum, memo)\n del prevSum[-1]\n # memo[(start + 1, 0 if len(prevSum) < 2 else (prevSum[-1] + prevSum[-2]))] = temp\n return temp\n for x in range(start + 1, len(num) + 1, stride):\n end = x\n stride = end - start\n # print(\"Stride: \" + str(stride))\n curr = int(num[start:end])\n # print(curr)\n if len(prevSum) < 2 or (len(prevSum) >= 2 and curr == prevSum[-1] + prevSum[-2]):\n prevSum.append(curr)\n temp = self.isAdditiveHelper(num, end, prevSum, memo)\n memo[(x, 0 if len(prevSum) < 2 else (prevSum[-1] + prevSum[-2]))] = temp\n result |= temp\n if result:\n return result\n del prevSum[-1]\n return False\n\n def isAdditiveNumber(self, num: str) -> bool:\n if len(num) < 3:\n return False\n return self.isAdditiveHelper(num, 0, [], {})","runtime":"24"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def valid(first, second, remaining):\n while remaining:\n next_num = str(int(first) + int(second))\n \n if not remaining.startswith(next_num):\n return False\n \n first, second = second, next_num\n remaining = remaining[len(next_num):]\n return True\n \n for i in range(1, len(num)):\n for j in range(i + 1, len(num)):\n first = num[:i]\n second = num[i:j]\n if (len(first) > 1 and first.startswith(\"0\")) or (len(second) > 1 and second.startswith(\"0\")):\n continue\n\n if valid(first, second, num[j:]):\n return True\n \n return False\n \n \n \n ","runtime":"25"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 1:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"26"},{"code":"def isAdditiveNumber(num: str) -> bool:\n\n n = len(num)\n\n \n\n # Helper function to backtrack and check if the sequence is valid\n\n def backtrack(start, num1, num2):\n\n if start == n:\n\n return True\n\n \n\n sum_str = str(int(num1) + int(num2)) # Compute the next number in the sequence\n\n if not num.startswith(sum_str, start): # Check if the next number matches the next part of the string\n\n return False\n\n \n\n # Move forward in the string and continue with the next two numbers\n\n return backtrack(start + len(sum_str), num2, sum_str)\n\n \n\n # Try every combination of the first two numbers\n\n for i in range(1, n):\n\n for j in range(i+1, n):\n\n num1, num2 = num[:i], num[i:j]\n\n \n\n # Skip if there are leading zeros (unless the number is zero itself)\n\n if (num1.startswith('0') and len(num1) > 1) or (num2.startswith('0') and len(num2) > 1):\n\n continue\n\n \n\n if backtrack(j, num1, num2): # Start backtracking from the third number\n\n return True\n\n \n\n return False\n\nclass Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n return isAdditiveNumber(num)\n ","runtime":"27"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n\n # try every possible first two numbers.\n for i in range(1, n):\n for j in range(i + 1, n):\n num1, num2 = num[:i], num[i:j]\n \n # skip if they have leading zeroes.\n if (len(num1) > 1 and num1[0] == '0') or (len(num2) > 1 and num2[0] == '0'):\n continue\n \n while j < n:\n sum_initial_strs = str(int(num1) + int(num2))\n\n # check if next part starts with this total\n if num[j:].startswith(sum_initial_strs):\n num1 = num2\n num2 = num[j:j+len(sum_initial_strs)]\n j += len(sum_initial_strs)\n else:\n break\n \n if j == n:\n return True\n \n return False","runtime":"28"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool: \n def dfs(s,seq):\n if not s:\n if len(seq)>2:\n return True\n else:\n return False\n for i in range(len(s)):\n if s[0]=='0' and i>0:\n break\n cur = int(s[:i+1])\n if len(seq)>1 and cur!=seq[-2]+seq[-1]:\n continue\n if dfs(s[i+1:],seq+[cur]):\n return True\n return False\n return dfs(num,[])\n ","runtime":"28"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n \n for i in range(1, n):\n for j in range(i + 1, n):\n if num[0] == \"0\" and i > 1:\n break\n if num[i] == \"0\" and j > i + 1:\n break\n \n num1 = int(num[:i])\n num2 = int(num[i:j])\n k = j\n while k < n:\n num3 = num1 + num2\n if not num[k:].startswith(str(num3)):\n break\n k += len(str(num3))\n num1, num2 = num2, num3\n else:\n if k == n:\n return True\n \n return False","runtime":"29"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n if n < 3:\n return False\n\n def backtrack(start, cut1, cut2, end):\n if end - cut2 < max(cut1 - start, cut2 - cut1):\n return False\n n1 = int(num[start:cut1])\n n2 = int(num[cut1:cut2])\n n3 = int(num[cut2:end])\n\n if (num[start] == '0' and n1 != 0\n or num[cut1] == '0' and n2 != 0\n or num[cut2] == '0' and n3 != 0):\n return False\n\n if n1 + n2 == n3:\n if end == n:\n return True\n else:\n return backtrack(cut1, cut2, end, n)\n\n return backtrack(start, cut1, cut2, end - 1)\n\n for cut1 in range(1, n):\n for cut2 in range(cut1 + 1, n):\n if backtrack(0, cut1, cut2, n):\n return True\n\n return False\n","runtime":"30"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n def is_valid(num1, num2, remaining):\n if not remaining:\n return True\n \n sum_str = str(int(num1) + int(num2))\n if not remaining.startswith(sum_str):\n return False\n return is_valid(num2, sum_str, remaining[len(sum_str):])\n \n\n for i in range(1, len(num)):\n for j in range(i+1, len(num)):\n num1, num2 = num[:i], num[i:j]\n\n if (len(num1) > 1 and num1[0] == \"0\") or (len(num2) > 1 and num2[0] == \"0\"):\n continue\n\n if is_valid(num1, num2, num[j:]):\n return True\n \n return False\n # O(n^3) time and O(n) space","runtime":"30"},{"code":"class Solution:\n def isAdditiveNumber(self, num):\n for i, j in itertools.combinations(range(1, len(num)), 2):\n a, b = num[:i], num[i:j]\n if a != str(int(a)) or b != str(int(b)):\n continue\n while j < len(num):\n c = str(int(a) + int(b))\n if not num.startswith(c, j):\n break\n j += len(c)\n a, b = b, c\n if j == len(num):\n return True\n return False","runtime":"31"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 1:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n if str(int(possibleNum)) != possibleNum:\n continue\n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"32"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def dfs(a, b, num):\n if not num:\n return True\n if a + b > 0 and num[0] == '0':\n return False\n for i in range(1, len(num) + 1):\n if a + b == int(num[:i]):\n if dfs(b, a + b, num[i:]):\n return True\n return False\n\n n = len(num)\n for i in range(1, n - 1):\n for j in range(i + 1, n):\n if i > 1 and num[0] == '0':\n break\n if j - i > 1 and num[i] == '0':\n continue\n if dfs(int(num[:i]), int(num[i:j]), num[j:]):\n return True\n return False","runtime":"32"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n for i in range(n - 2):\n if i > 0 and num[0] == \"0\":\n continue\n a = int(num[: i + 1])\n for j in range(i + 1, n - 1):\n if j > i + 1 and num[i + 1] == \"0\":\n continue\n b = int(num[i + 1 : j + 1])\n if self.check(a, b, num[j + 1:]):\n return True\n return False\n \n def check(self, a: int, b: int, num: str) -> bool:\n c = a + b\n c_str = str(a + b)\n m, n = len(c_str), len(num)\n if m > n:\n return False\n elif m == n:\n return c_str == num\n if not num.startswith(c_str):\n return False\n return self.check(b, c, num[m:])\n \n","runtime":"33"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def dfs(idx,k):\n print(idx,k)\n if idx==len(num):\n return len(k)>2\n val=0\n res=False\n for i in range(idx,len(num)):\n val=val*10+int(num[i])\n if len(k)<2 or k[-1]+k[len(k)-2]==val:\n k.append(val)\n res = res or dfs(i+1,k[:])\n k.pop(-1)\n if num[idx]=='0':\n break\n return res\n\n return dfs(0,[])\n \n ","runtime":"33"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"34"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 1:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"34"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n for i in range(n-2):\n for j in range(i+1, n-1):\n first_s = num[:i+1]\n second_s = num[i+1:j+1]\n\n if (len(first_s) >= 2 and first_s[0] == \"0\") or (len(second_s) >= 2 and second_s[0] == \"0\"):\n continue\n\n first = int(first_s)\n second = int(second_s)\n\n k = j + 1\n failure = False\n while not failure and k < n:\n next_num = first + second\n next_seq = str(next_num)\n\n if k + len(next_seq) > n:\n failure = True\n break\n \n for l in range(len(next_seq)):\n if next_seq[l] != num[k + l]:\n failure = True\n break\n \n k += len(next_seq)\n first = second\n second = next_num\n\n\n if not failure:\n return True\n\n return False\n\n ","runtime":"35"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def rec(prev1, prev2, start):\n rest = num[start:]\n if not rest:\n return True\n # print(prev1, prev2, rest)\n nxt = str(prev1 + prev2)\n # print(nxt)\n return rest.startswith(nxt) and rec(prev2, prev1+prev2, start + len(nxt))\n \n\n\n for i in range(1, 2+len(num)//3):\n if i == 2 and num[0] == \"0\":\n return self.isAllZeros(num)\n start1 = int(num[0:i])\n for j in range(i+1, 1+(len(num)*2)//3):\n if j-i == 2 and num[i] == \"0\":\n break\n start2 = int(num[i:j])\n if rec(start1, start2, j):\n return True\n \n return False\n\n def isAllZeros(self, s):\n for c in s:\n if c != \"0\":\n return False\n return True","runtime":"36"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 1:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"37"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"38"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n seq = []\n \n def backtrack(num: str, cur: list[int]) -> bool:\n # Base case: if we've used up the whole string and have a valid sequence\n if not num:\n return len(cur) >= 3\n\n # Explore possible next numbers in the sequence\n for i in range(1, len(num) + 1):\n # Skip numbers with leading zeros, except for '0' itself\n if i > 1 and num[0] == \"0\":\n break\n\n # Convert the current slice to an integer\n next_num = int(num[:i])\n\n # If we have at least two numbers, check if the current number matches the sum of the last two\n if len(cur) >= 2 and next_num != cur[-1] + cur[-2]:\n continue\n\n # Add the current number to the sequence and recursively continue\n cur.append(next_num)\n if backtrack(num[i:], cur):\n return True\n cur.pop() # Backtrack by removing the last number\n\n return False\n\n return backtrack(num, seq)\n","runtime":"38"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n\n def dfs(firstNum: int, secondNum: int, s: int) -> bool:\n if s == len(num):\n return True\n\n thirdNum = firstNum + secondNum\n thirdNumStr = str(thirdNum)\n\n return (num.find(thirdNumStr, s) == s and\n dfs(secondNum, thirdNum, s + len(thirdNumStr)))\n\n # num[0..i] = firstNum\n for i in range(n // 2):\n if i > 0 and num[0] == '0':\n return False\n firstNum = int(num[:i + 1])\n # num[i + 1..j] = secondNum\n # |thirdNum| >= max(|firstNum|, |secondNum|)\n j = i + 1\n while max(i, j - i) < n - j:\n if j > i + 1 and num[i + 1] == '0':\n break\n secondNum = int(num[i + 1:j + 1])\n if dfs(firstNum, secondNum, j + 1):\n return True\n j += 1\n\n return False","runtime":"39"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"39"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def backtrack(start, sub):\n if start == len(num):\n return len(sub) >= 3\n\n for i in range(start, len(num)):\n if i > start and num[start] == '0':\n break\n curr = int(num[start:i+1])\n if len(sub) >= 2 and sub[-2] + sub[-1] != curr:\n continue\n if backtrack(i+1, sub + [curr]):\n return True\n return False\n return backtrack(0,[])\n","runtime":"40"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) < 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"41"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) <= 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"41"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) <= 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","runtime":"42"},{"code":"class Solution:\n def isAdditiveNumber(self, num):\n for i, j in itertools.combinations(range(1, len(num)), 2):\n a, b = num[:i], num[i:j]\n if(a != str(int(a)) or b != str(int(b))):\n continue\n while j < len(num):\n c = str(int(a) + int(b))\n if not num.startswith(c, j):\n break\n j += len(c)\n a, b = b, c\n if j == len(num):\n return True\n return False","runtime":"42"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n seq = []\n def backtrack(num: str, cur: List[int]):\n if not num:\n return len(cur) >= 3\n\n for i in range(1,len(num)+1):\n if i > 1 and num[0] == \"0\": break\n if len(cur) < 2 or int(num[:i]) == cur[-1] + cur[-2]:\n seq.append(int(num[:i]))\n if backtrack(num[i:],seq): return True\n seq.remove(int(num[:i]))\n\n return False\n \n return backtrack(num,[])","runtime":"43"}],"string":"[\n {\n \"code\": \"class Solution:\\n\\n def isAdditiveNumber(self, num: str) -> bool:\\n\\n n = len(num)\\n\\n def dfs(firstNum: int, secondNum: int, s: int) -> bool:\\n\\n if s == len(num):\\n\\n return True\\n\\n thirdNum = firstNum + secondNum\\n\\n thirdNumStr = str(thirdNum)\\n\\n return (num.find(thirdNumStr, s) == s and\\n\\n dfs(secondNum, thirdNum, s + len(thirdNumStr)))\\n\\n # num[0..i] = firstNum\\n\\n for i in range(n // 2):\\n\\n if i > 0 and num[0] == '0':\\n\\n return False\\n\\n firstNum = int(num[:i + 1])\\n\\n # num[i + 1..j] = secondNum\\n\\n # |thirdNum| >= max(|firstNum|, |secondNum|)\\n\\n j = i + 1\\n\\n while max(i, j - i) < n - j:\\n\\n if j > i + 1 and num[i + 1] == '0':\\n\\n break\\n\\n secondNum = int(num[i + 1:j + 1])\\n\\n if dfs(firstNum, secondNum, j + 1):\\n\\n return True\\n\\n j += 1\\n\\n return False\\n\\n\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n for i in range(1, len(num)):\\n for j in range(i+1, len(num)):\\n first = num[0:i]\\n second = num[i:j]\\n if int(first) + int(second) == int(num[j:j+len(str(int(first)+int(second)))]):\\n k = first+second\\n while len(k) < len(num):\\n if first[0] == '0' and int(first) > 0:\\n break\\n if second[0] == '0' and int(second) > 0:\\n break\\n next = int(first) + int(second)\\n first = second\\n second = str(next)\\n k += (str(next))\\n if k == num:\\n return True\\n return False\\n \\n \\n \\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n for i in range(1, n//2+1):\\n x = num[:i]\\n if x.startswith(\\\"0\\\") and len(x) > 1: break #no leading zero \\n for j in range(i+1, min(n-i, (n+i)//2)+1): #i <= n-j and j-i <= n-j\\n yy = num[i:j]\\n if yy.startswith(\\\"0\\\") and len(yy) > 1: break #no leading zero\\n \\n ii, xx = i, x\\n while num.startswith(yy, ii):\\n ii += len(yy)\\n xx, yy = yy, str(int(xx) + int(yy))\\n if ii == len(num): return True \\n \\n return False\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n\\n def isAdditiveHelper(self, num, start, prevSum, memo):\\n # print(prevSum)\\n memoKey = (start, 0 if len(prevSum) < 2 else (prevSum[-1] + prevSum[-2]))\\n if memoKey in memo:\\n return memo[memoKey]\\n if start == len(num):\\n return len(prevSum) > 2\\n result = False\\n stride = 1\\n if num[start] == \\\"0\\\":\\n temp = False\\n if len(prevSum) < 2 or (len(prevSum) >= 2 and prevSum[-1] + prevSum[-2] == 0): \\n prevSum.append(0)\\n temp = self.isAdditiveHelper(num, start + 1, prevSum, memo)\\n del prevSum[-1]\\n # memo[(start + 1, 0 if len(prevSum) < 2 else (prevSum[-1] + prevSum[-2]))] = temp\\n return temp\\n for x in range(start + 1, len(num) + 1, stride):\\n end = x\\n stride = end - start\\n # print(\\\"Stride: \\\" + str(stride))\\n curr = int(num[start:end])\\n # print(curr)\\n if len(prevSum) < 2 or (len(prevSum) >= 2 and curr == prevSum[-1] + prevSum[-2]):\\n prevSum.append(curr)\\n temp = self.isAdditiveHelper(num, end, prevSum, memo)\\n memo[(x, 0 if len(prevSum) < 2 else (prevSum[-1] + prevSum[-2]))] = temp\\n result |= temp\\n if result:\\n return result\\n del prevSum[-1]\\n return False\\n\\n def isAdditiveNumber(self, num: str) -> bool:\\n if len(num) < 3:\\n return False\\n return self.isAdditiveHelper(num, 0, [], {})\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def valid(first, second, remaining):\\n while remaining:\\n next_num = str(int(first) + int(second))\\n \\n if not remaining.startswith(next_num):\\n return False\\n \\n first, second = second, next_num\\n remaining = remaining[len(next_num):]\\n return True\\n \\n for i in range(1, len(num)):\\n for j in range(i + 1, len(num)):\\n first = num[:i]\\n second = num[i:j]\\n if (len(first) > 1 and first.startswith(\\\"0\\\")) or (len(second) > 1 and second.startswith(\\\"0\\\")):\\n continue\\n\\n if valid(first, second, num[j:]):\\n return True\\n \\n return False\\n \\n \\n \\n \",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 1:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"def isAdditiveNumber(num: str) -> bool:\\n\\n n = len(num)\\n\\n \\n\\n # Helper function to backtrack and check if the sequence is valid\\n\\n def backtrack(start, num1, num2):\\n\\n if start == n:\\n\\n return True\\n\\n \\n\\n sum_str = str(int(num1) + int(num2)) # Compute the next number in the sequence\\n\\n if not num.startswith(sum_str, start): # Check if the next number matches the next part of the string\\n\\n return False\\n\\n \\n\\n # Move forward in the string and continue with the next two numbers\\n\\n return backtrack(start + len(sum_str), num2, sum_str)\\n\\n \\n\\n # Try every combination of the first two numbers\\n\\n for i in range(1, n):\\n\\n for j in range(i+1, n):\\n\\n num1, num2 = num[:i], num[i:j]\\n\\n \\n\\n # Skip if there are leading zeros (unless the number is zero itself)\\n\\n if (num1.startswith('0') and len(num1) > 1) or (num2.startswith('0') and len(num2) > 1):\\n\\n continue\\n\\n \\n\\n if backtrack(j, num1, num2): # Start backtracking from the third number\\n\\n return True\\n\\n \\n\\n return False\\n\\nclass Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n return isAdditiveNumber(num)\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n\\n # try every possible first two numbers.\\n for i in range(1, n):\\n for j in range(i + 1, n):\\n num1, num2 = num[:i], num[i:j]\\n \\n # skip if they have leading zeroes.\\n if (len(num1) > 1 and num1[0] == '0') or (len(num2) > 1 and num2[0] == '0'):\\n continue\\n \\n while j < n:\\n sum_initial_strs = str(int(num1) + int(num2))\\n\\n # check if next part starts with this total\\n if num[j:].startswith(sum_initial_strs):\\n num1 = num2\\n num2 = num[j:j+len(sum_initial_strs)]\\n j += len(sum_initial_strs)\\n else:\\n break\\n \\n if j == n:\\n return True\\n \\n return False\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool: \\n def dfs(s,seq):\\n if not s:\\n if len(seq)>2:\\n return True\\n else:\\n return False\\n for i in range(len(s)):\\n if s[0]=='0' and i>0:\\n break\\n cur = int(s[:i+1])\\n if len(seq)>1 and cur!=seq[-2]+seq[-1]:\\n continue\\n if dfs(s[i+1:],seq+[cur]):\\n return True\\n return False\\n return dfs(num,[])\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n \\n for i in range(1, n):\\n for j in range(i + 1, n):\\n if num[0] == \\\"0\\\" and i > 1:\\n break\\n if num[i] == \\\"0\\\" and j > i + 1:\\n break\\n \\n num1 = int(num[:i])\\n num2 = int(num[i:j])\\n k = j\\n while k < n:\\n num3 = num1 + num2\\n if not num[k:].startswith(str(num3)):\\n break\\n k += len(str(num3))\\n num1, num2 = num2, num3\\n else:\\n if k == n:\\n return True\\n \\n return False\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n if n < 3:\\n return False\\n\\n def backtrack(start, cut1, cut2, end):\\n if end - cut2 < max(cut1 - start, cut2 - cut1):\\n return False\\n n1 = int(num[start:cut1])\\n n2 = int(num[cut1:cut2])\\n n3 = int(num[cut2:end])\\n\\n if (num[start] == '0' and n1 != 0\\n or num[cut1] == '0' and n2 != 0\\n or num[cut2] == '0' and n3 != 0):\\n return False\\n\\n if n1 + n2 == n3:\\n if end == n:\\n return True\\n else:\\n return backtrack(cut1, cut2, end, n)\\n\\n return backtrack(start, cut1, cut2, end - 1)\\n\\n for cut1 in range(1, n):\\n for cut2 in range(cut1 + 1, n):\\n if backtrack(0, cut1, cut2, n):\\n return True\\n\\n return False\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n def is_valid(num1, num2, remaining):\\n if not remaining:\\n return True\\n \\n sum_str = str(int(num1) + int(num2))\\n if not remaining.startswith(sum_str):\\n return False\\n return is_valid(num2, sum_str, remaining[len(sum_str):])\\n \\n\\n for i in range(1, len(num)):\\n for j in range(i+1, len(num)):\\n num1, num2 = num[:i], num[i:j]\\n\\n if (len(num1) > 1 and num1[0] == \\\"0\\\") or (len(num2) > 1 and num2[0] == \\\"0\\\"):\\n continue\\n\\n if is_valid(num1, num2, num[j:]):\\n return True\\n \\n return False\\n # O(n^3) time and O(n) space\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num):\\n for i, j in itertools.combinations(range(1, len(num)), 2):\\n a, b = num[:i], num[i:j]\\n if a != str(int(a)) or b != str(int(b)):\\n continue\\n while j < len(num):\\n c = str(int(a) + int(b))\\n if not num.startswith(c, j):\\n break\\n j += len(c)\\n a, b = b, c\\n if j == len(num):\\n return True\\n return False\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 1:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def dfs(a, b, num):\\n if not num:\\n return True\\n if a + b > 0 and num[0] == '0':\\n return False\\n for i in range(1, len(num) + 1):\\n if a + b == int(num[:i]):\\n if dfs(b, a + b, num[i:]):\\n return True\\n return False\\n\\n n = len(num)\\n for i in range(1, n - 1):\\n for j in range(i + 1, n):\\n if i > 1 and num[0] == '0':\\n break\\n if j - i > 1 and num[i] == '0':\\n continue\\n if dfs(int(num[:i]), int(num[i:j]), num[j:]):\\n return True\\n return False\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n for i in range(n - 2):\\n if i > 0 and num[0] == \\\"0\\\":\\n continue\\n a = int(num[: i + 1])\\n for j in range(i + 1, n - 1):\\n if j > i + 1 and num[i + 1] == \\\"0\\\":\\n continue\\n b = int(num[i + 1 : j + 1])\\n if self.check(a, b, num[j + 1:]):\\n return True\\n return False\\n \\n def check(self, a: int, b: int, num: str) -> bool:\\n c = a + b\\n c_str = str(a + b)\\n m, n = len(c_str), len(num)\\n if m > n:\\n return False\\n elif m == n:\\n return c_str == num\\n if not num.startswith(c_str):\\n return False\\n return self.check(b, c, num[m:])\\n \\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def dfs(idx,k):\\n print(idx,k)\\n if idx==len(num):\\n return len(k)>2\\n val=0\\n res=False\\n for i in range(idx,len(num)):\\n val=val*10+int(num[i])\\n if len(k)<2 or k[-1]+k[len(k)-2]==val:\\n k.append(val)\\n res = res or dfs(i+1,k[:])\\n k.pop(-1)\\n if num[idx]=='0':\\n break\\n return res\\n\\n return dfs(0,[])\\n \\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 1:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n for i in range(n-2):\\n for j in range(i+1, n-1):\\n first_s = num[:i+1]\\n second_s = num[i+1:j+1]\\n\\n if (len(first_s) >= 2 and first_s[0] == \\\"0\\\") or (len(second_s) >= 2 and second_s[0] == \\\"0\\\"):\\n continue\\n\\n first = int(first_s)\\n second = int(second_s)\\n\\n k = j + 1\\n failure = False\\n while not failure and k < n:\\n next_num = first + second\\n next_seq = str(next_num)\\n\\n if k + len(next_seq) > n:\\n failure = True\\n break\\n \\n for l in range(len(next_seq)):\\n if next_seq[l] != num[k + l]:\\n failure = True\\n break\\n \\n k += len(next_seq)\\n first = second\\n second = next_num\\n\\n\\n if not failure:\\n return True\\n\\n return False\\n\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def rec(prev1, prev2, start):\\n rest = num[start:]\\n if not rest:\\n return True\\n # print(prev1, prev2, rest)\\n nxt = str(prev1 + prev2)\\n # print(nxt)\\n return rest.startswith(nxt) and rec(prev2, prev1+prev2, start + len(nxt))\\n \\n\\n\\n for i in range(1, 2+len(num)//3):\\n if i == 2 and num[0] == \\\"0\\\":\\n return self.isAllZeros(num)\\n start1 = int(num[0:i])\\n for j in range(i+1, 1+(len(num)*2)//3):\\n if j-i == 2 and num[i] == \\\"0\\\":\\n break\\n start2 = int(num[i:j])\\n if rec(start1, start2, j):\\n return True\\n \\n return False\\n\\n def isAllZeros(self, s):\\n for c in s:\\n if c != \\\"0\\\":\\n return False\\n return True\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 1:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n seq = []\\n \\n def backtrack(num: str, cur: list[int]) -> bool:\\n # Base case: if we've used up the whole string and have a valid sequence\\n if not num:\\n return len(cur) >= 3\\n\\n # Explore possible next numbers in the sequence\\n for i in range(1, len(num) + 1):\\n # Skip numbers with leading zeros, except for '0' itself\\n if i > 1 and num[0] == \\\"0\\\":\\n break\\n\\n # Convert the current slice to an integer\\n next_num = int(num[:i])\\n\\n # If we have at least two numbers, check if the current number matches the sum of the last two\\n if len(cur) >= 2 and next_num != cur[-1] + cur[-2]:\\n continue\\n\\n # Add the current number to the sequence and recursively continue\\n cur.append(next_num)\\n if backtrack(num[i:], cur):\\n return True\\n cur.pop() # Backtrack by removing the last number\\n\\n return False\\n\\n return backtrack(num, seq)\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n\\n def dfs(firstNum: int, secondNum: int, s: int) -> bool:\\n if s == len(num):\\n return True\\n\\n thirdNum = firstNum + secondNum\\n thirdNumStr = str(thirdNum)\\n\\n return (num.find(thirdNumStr, s) == s and\\n dfs(secondNum, thirdNum, s + len(thirdNumStr)))\\n\\n # num[0..i] = firstNum\\n for i in range(n // 2):\\n if i > 0 and num[0] == '0':\\n return False\\n firstNum = int(num[:i + 1])\\n # num[i + 1..j] = secondNum\\n # |thirdNum| >= max(|firstNum|, |secondNum|)\\n j = i + 1\\n while max(i, j - i) < n - j:\\n if j > i + 1 and num[i + 1] == '0':\\n break\\n secondNum = int(num[i + 1:j + 1])\\n if dfs(firstNum, secondNum, j + 1):\\n return True\\n j += 1\\n\\n return False\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def backtrack(start, sub):\\n if start == len(num):\\n return len(sub) >= 3\\n\\n for i in range(start, len(num)):\\n if i > start and num[start] == '0':\\n break\\n curr = int(num[start:i+1])\\n if len(sub) >= 2 and sub[-2] + sub[-1] != curr:\\n continue\\n if backtrack(i+1, sub + [curr]):\\n return True\\n return False\\n return backtrack(0,[])\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) < 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) <= 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) <= 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num):\\n for i, j in itertools.combinations(range(1, len(num)), 2):\\n a, b = num[:i], num[i:j]\\n if(a != str(int(a)) or b != str(int(b))):\\n continue\\n while j < len(num):\\n c = str(int(a) + int(b))\\n if not num.startswith(c, j):\\n break\\n j += len(c)\\n a, b = b, c\\n if j == len(num):\\n return True\\n return False\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n seq = []\\n def backtrack(num: str, cur: List[int]):\\n if not num:\\n return len(cur) >= 3\\n\\n for i in range(1,len(num)+1):\\n if i > 1 and num[0] == \\\"0\\\": break\\n if len(cur) < 2 or int(num[:i]) == cur[-1] + cur[-2]:\\n seq.append(int(num[:i]))\\n if backtrack(num[i:],seq): return True\\n seq.remove(int(num[:i]))\\n\\n return False\\n \\n return backtrack(num,[])\",\n \"runtime\": \"43\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":32,"string":"32"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n seq = []\n def backtrack(num: str, cur: List[int]):\n if not num:\n return len(cur) >= 3\n\n for i in range(1,len(num)+1):\n if i > 1 and num[0] == \"0\": break\n if len(cur) < 2 or int(num[:i]) == cur[-1] + cur[-2]:\n seq.append(int(num[:i]))\n if backtrack(num[i:],seq): return True\n seq.remove(int(num[:i]))\n\n return False\n \n return backtrack(num,[])","memory":"16300"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) <= 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","memory":"16400"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n \n numsPath = []\n def dfs(start):\n if start >= len(num) and len(numsPath) > 2:\n return True\n if start >= len(num) and len(numsPath) <= 2:\n return False\n \n\n for i in range(start, len(num)):\n if len(numsPath) < 2:\n possibleNum = num[start : i + 1]\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n elif len(numsPath) >= 2:\n possibleNum = num[start : i + 1]\n\n # is this not a valid num that does not start with 0\n if str(int(possibleNum)) != possibleNum:\n continue\n\n # is this num a sum of the previous two nums\n n1 = int(numsPath[len(numsPath) - 2])\n n2 = int(numsPath[len(numsPath) - 1])\n n3 = n1 + n2\n\n if int(possibleNum) != n3:\n continue\n \n numsPath.append(possibleNum)\n if (dfs(i + 1)):\n return True\n\n numsPath.pop()\n \n return dfs(0)\n\n ","memory":"16400"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n for i in range(n - 2):\n if i > 0 and num[0] == \"0\":\n continue\n a = int(num[: i + 1])\n for j in range(i + 1, n - 1):\n if j > i + 1 and num[i + 1] == \"0\":\n continue\n b = int(num[i + 1 : j + 1])\n if self.check(a, b, num[j + 1:]):\n return True\n return False\n \n def check(self, a: int, b: int, num: str) -> bool:\n c = a + b\n c_str = str(a + b)\n m, n = len(c_str), len(num)\n if m > n:\n return False\n elif m == n:\n return c_str == num\n if not num.startswith(c_str):\n return False\n return self.check(b, c, num[m:])\n \n","memory":"16500"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n n = len(num)\n\n def dfs(firstNum: int, secondNum: int, s: int) -> bool:\n if s == len(num):\n return True\n\n thirdNum = firstNum + secondNum\n thirdNumStr = str(thirdNum)\n\n return (num.find(thirdNumStr, s) == s and\n dfs(secondNum, thirdNum, s + len(thirdNumStr)))\n\n # num[0..i] = firstNum\n for i in range(n // 2):\n if i > 0 and num[0] == '0':\n return False\n firstNum = int(num[:i + 1])\n # num[i + 1..j] = secondNum\n # |thirdNum| >= max(|firstNum|, |secondNum|)\n j = i + 1\n while max(i, j - i) < n - j:\n if j > i + 1 and num[i + 1] == '0':\n break\n secondNum = int(num[i + 1:j + 1])\n if dfs(firstNum, secondNum, j + 1):\n return True\n j += 1\n\n return False","memory":"16500"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def dfs(idx,k,j):\n print(idx,k,j)\n val=0\n if idx==len(num):\n return j\n res=False\n for i in range(idx,len(num)):\n val=val*10+int(num[i])\n x=k[:]\n if len(k)<2:\n x+=[val]\n res = dfs(i+1,x,False) or res\n if num[idx]=='0':\n break\n continue\n elif val!=sum(k):\n if num[idx]=='0':\n break\n continue\n x.pop(0)\n x.append(val)\n res = dfs(i+1,x,True) or res\n if num[idx]=='0':\n break\n return res\n\n\n return dfs(0,[],False)\n \n ","memory":"16600"},{"code":"class Solution:\n def isAdditiveNumber(self, num: str) -> bool:\n def dfs(idx,k):\n print(idx,k)\n if idx==len(num):\n return len(k)>2\n val=0\n res=False\n for i in range(idx,len(num)):\n val=val*10+int(num[i])\n if len(k)<2 or k[-1]+k[len(k)-2]==val:\n k.append(val)\n res = res or dfs(i+1,k[:])\n k.pop(-1)\n if num[idx]=='0':\n break\n return res\n\n return dfs(0,[])\n \n ","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n seq = []\\n def backtrack(num: str, cur: List[int]):\\n if not num:\\n return len(cur) >= 3\\n\\n for i in range(1,len(num)+1):\\n if i > 1 and num[0] == \\\"0\\\": break\\n if len(cur) < 2 or int(num[:i]) == cur[-1] + cur[-2]:\\n seq.append(int(num[:i]))\\n if backtrack(num[i:],seq): return True\\n seq.remove(int(num[:i]))\\n\\n return False\\n \\n return backtrack(num,[])\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) <= 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n \\n numsPath = []\\n def dfs(start):\\n if start >= len(num) and len(numsPath) > 2:\\n return True\\n if start >= len(num) and len(numsPath) <= 2:\\n return False\\n \\n\\n for i in range(start, len(num)):\\n if len(numsPath) < 2:\\n possibleNum = num[start : i + 1]\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n elif len(numsPath) >= 2:\\n possibleNum = num[start : i + 1]\\n\\n # is this not a valid num that does not start with 0\\n if str(int(possibleNum)) != possibleNum:\\n continue\\n\\n # is this num a sum of the previous two nums\\n n1 = int(numsPath[len(numsPath) - 2])\\n n2 = int(numsPath[len(numsPath) - 1])\\n n3 = n1 + n2\\n\\n if int(possibleNum) != n3:\\n continue\\n \\n numsPath.append(possibleNum)\\n if (dfs(i + 1)):\\n return True\\n\\n numsPath.pop()\\n \\n return dfs(0)\\n\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n for i in range(n - 2):\\n if i > 0 and num[0] == \\\"0\\\":\\n continue\\n a = int(num[: i + 1])\\n for j in range(i + 1, n - 1):\\n if j > i + 1 and num[i + 1] == \\\"0\\\":\\n continue\\n b = int(num[i + 1 : j + 1])\\n if self.check(a, b, num[j + 1:]):\\n return True\\n return False\\n \\n def check(self, a: int, b: int, num: str) -> bool:\\n c = a + b\\n c_str = str(a + b)\\n m, n = len(c_str), len(num)\\n if m > n:\\n return False\\n elif m == n:\\n return c_str == num\\n if not num.startswith(c_str):\\n return False\\n return self.check(b, c, num[m:])\\n \\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n n = len(num)\\n\\n def dfs(firstNum: int, secondNum: int, s: int) -> bool:\\n if s == len(num):\\n return True\\n\\n thirdNum = firstNum + secondNum\\n thirdNumStr = str(thirdNum)\\n\\n return (num.find(thirdNumStr, s) == s and\\n dfs(secondNum, thirdNum, s + len(thirdNumStr)))\\n\\n # num[0..i] = firstNum\\n for i in range(n // 2):\\n if i > 0 and num[0] == '0':\\n return False\\n firstNum = int(num[:i + 1])\\n # num[i + 1..j] = secondNum\\n # |thirdNum| >= max(|firstNum|, |secondNum|)\\n j = i + 1\\n while max(i, j - i) < n - j:\\n if j > i + 1 and num[i + 1] == '0':\\n break\\n secondNum = int(num[i + 1:j + 1])\\n if dfs(firstNum, secondNum, j + 1):\\n return True\\n j += 1\\n\\n return False\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def dfs(idx,k,j):\\n print(idx,k,j)\\n val=0\\n if idx==len(num):\\n return j\\n res=False\\n for i in range(idx,len(num)):\\n val=val*10+int(num[i])\\n x=k[:]\\n if len(k)<2:\\n x+=[val]\\n res = dfs(i+1,x,False) or res\\n if num[idx]=='0':\\n break\\n continue\\n elif val!=sum(k):\\n if num[idx]=='0':\\n break\\n continue\\n x.pop(0)\\n x.append(val)\\n res = dfs(i+1,x,True) or res\\n if num[idx]=='0':\\n break\\n return res\\n\\n\\n return dfs(0,[],False)\\n \\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def isAdditiveNumber(self, num: str) -> bool:\\n def dfs(idx,k):\\n print(idx,k)\\n if idx==len(num):\\n return len(k)>2\\n val=0\\n res=False\\n for i in range(idx,len(num)):\\n val=val*10+int(num[i])\\n if len(k)<2 or k[-1]+k[len(k)-2]==val:\\n k.append(val)\\n res = res or dfs(i+1,k[:])\\n k.pop(-1)\\n if num[idx]=='0':\\n break\\n return res\\n\\n return dfs(0,[])\\n \\n \",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":249,"cells":{"question_id":{"kind":"number","value":318,"string":"318"},"name":{"kind":"string","value":"maximum-product-of-word-lengths"},"content":{"kind":"string","value":"<p>Given a string array <code>words</code>, return <em>the maximum value of</em> <code>length(word[i]) * length(word[j])</code> <em>where the two words do not share common letters</em>. If no such two words exist, return <code>0</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> words = ["abcw","baz","foo","bar","xtfn","abcdef"]\n<strong>Output:</strong> 16\n<strong>Explanation:</strong> The two words can be "abcw", "xtfn".\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> words = ["a","ab","abc","d","cd","bcd","abcd"]\n<strong>Output:</strong> 4\n<strong>Explanation:</strong> The two words can be "ab", "cd".\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> words = ["a","aa","aaa","aaaa"]\n<strong>Output:</strong> 0\n<strong>Explanation:</strong> No such pair of words.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>2 <= words.length <= 1000</code></li>\n\t<li><code>1 <= words[i].length <= 1000</code></li>\n\t<li><code>words[i]</code> consists only of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":60.21154468039237,"string":"60.211545"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","string","bit-manipulation"],"string":"[\n \"array\",\n \"string\",\n \"bit-manipulation\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"172\", 3.765699999999999], [\"259\", 8.894100000000002], [\"346\", 28.846400000000024], [\"433\", 4.166299999999997], [\"521\", 2.3234], [\"608\", 0.7210000000000001], [\"695\", 1.7625000000000008], [\"782\", 8.0127], [\"869\", 5.047599999999997], [\"956\", 3.765599999999998], [\"1043\", 1.9228000000000005], [\"1130\", 1.2817000000000005], [\"1217\", 0.8813], [\"1305\", 0.4806], [\"1392\", 0.1602], [\"1479\", 0.6408], [\"1566\", 0.7210000000000001], [\"1653\", 0.7210000000000001], [\"1740\", 0.3204], [\"1827\", 0.4806], [\"1914\", 0.2403], [\"2001\", 0.2403], [\"2089\", 0.1602], [\"2176\", 0.0801], [\"2263\", 0.4005], [\"2350\", 0.0801], [\"2437\", 0.1603], [\"2524\", 0.0801], [\"2611\", 0.0801], [\"2698\", 0.0801], [\"2785\", 0.1602], [\"2873\", 0.4005], [\"2960\", 0.3204], [\"3047\", 0.1602], [\"3134\", 0.1602], [\"3221\", 0.0801], [\"3308\", 0.0801], [\"3395\", 0.2403], [\"3482\", 0.0801], [\"3569\", 0.3204], [\"3657\", 0.2403], [\"3744\", 0.2403], [\"3831\", 0.0801], [\"3918\", 0.2403], [\"4005\", 0.0801], [\"4092\", 0.4806], [\"4179\", 0.5607], [\"4266\", 0.5608], [\"4353\", 0.0801], [\"4441\", 0.2403], [\"4528\", 0.0801], [\"4615\", 0.0801], [\"4702\", 0.3204], [\"4789\", 0.2403], [\"4876\", 0.0801], [\"4963\", 0.0801], [\"5050\", 0.0801], [\"5137\", 0.0801], [\"5225\", 0.0801], [\"5312\", 0.0801], [\"5399\", 0.0801], [\"5486\", 0.0801], [\"5573\", 0.0801], [\"5660\", 0.1602], [\"5747\", 0.9612000000000003], [\"5834\", 0.4806], [\"5921\", 0.1602], [\"6009\", 0.6408], [\"6096\", 0.8010000000000002], [\"6183\", 0.4806], [\"6270\", 0.5607], [\"6357\", 0.1602], [\"6444\", 0.3205], [\"6531\", 0.4806], [\"6618\", 0.7209000000000001], [\"6705\", 0.8813000000000002], [\"6793\", 2.0029000000000003], [\"6880\", 1.6824000000000008], [\"6967\", 1.0414000000000003], [\"7054\", 0.6408]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18700\", 0.0801], [\"18900\", 0.0801], [\"19300\", 0.2404], [\"19500\", 0.3205], [\"19600\", 4.6474], [\"19700\", 32.9327], [\"19800\", 24.1987], [\"19900\", 5.8494], [\"20000\", 11.9391], [\"20100\", 12.9006]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def mask(w):\n ret = 0\n for c in set(w):\n b = ord(c)-ord('a')\n ret |= 1<<b\n return ret\n lens = defaultdict(int)\n for w in words:\n m = mask(w)\n lens[m] = max(lens[m], len(w))\n keys = list(lens.keys())\n best = 0\n for i in range(len(keys)):\n m = keys[i]\n l = lens[m]\n for j in range(i):\n m2 = keys[j]\n if m & m2 == 0: \n best = max(best, l * lens[m2])\n return best\n\n raw_words = words\n words = [tuple(set(w)) for w in words]\n charmap = defaultdict(set)\n for i, w in enumerate(words):\n for c in w:\n charmap[c].add(i)\n best = 0\n for i in range(len(words)):\n w = words[i]\n relevant = set(range(i))\n for c in w:\n relevant.difference_update(charmap[c])\n l = len(raw_words[i])\n for j in relevant:\n best = max(best, l*len(raw_words[j]))\n return best","runtime":"172"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # share NO common letters\n #forall c in w, c not in w2\n # DO share -> check dict for each letter\n # can collect a set of indices to not include O(n)*26\n # then iterate through the complement O(n)\n # track product O(1)\n # have to do that for each word O(n), so O(n^2)\n \n # bit mask solution\n # each word is a 26bit int\n # O(1) to check if 2 words share, so just do a direct comparison\n def mask(w):\n ret = 0\n for c in set(w):\n b = ord(c)-ord('a')\n ret |= 1<<b\n return ret\n lens = defaultdict(int)\n for w in words:\n m = mask(w)\n lens[m] = max(lens[m], len(w))\n# masks = [(mask(w), len(w)) for w in words]\n# for m, l in masks:\n# lens[m] = max(lens[m], l)\n keys = list(lens.keys())\n best = 0\n for i in range(len(keys)):\n m = keys[i]\n l = lens[m]\n for j in range(i):\n m2 = keys[j]\n if m & m2 == 0: #masks[i] & masks[j] == 0:\n best = max(best, l * lens[m2])\n return best\n\n raw_words = words\n words = [tuple(set(w)) for w in words]\n # print(words)\n charmap = defaultdict(set)\n for i, w in enumerate(words):\n for c in w:\n charmap[c].add(i)\n best = 0\n for i in range(len(words)):\n w = words[i]\n relevant = set(range(i))\n for c in w:\n relevant.difference_update(charmap[c])\n # print(''.join(w), [raw_words[j] for j in relevant])\n l = len(raw_words[i])\n for j in relevant:\n best = max(best, l*len(raw_words[j]))\n return best\n","runtime":"172"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n \"\"\"\n brute force is to do O(n2) + O(k2) where k is average length of string\n\n 2. O(n2) + we convert each string into set and do set intersection to find no overlap\n\n 3. O(n2) + we use bitmask to represent each string and do an & \n \"\"\"\n\n bitmasks = {}\n bit_number = lambda ch : ord(ch) - ord('a')\n for s in words:\n bits = 0\n cnt = 0\n for c in s:\n bits |= 1 << (ord(c) - ord('a'))\n cnt+=1\n if bits in bitmasks:\n bitmasks[bits] = max(bitmasks[bits], cnt)\n else:\n bitmasks[bits] = cnt\n #print(bitmasks)\n ans = 0\n for a in bitmasks:\n for b in bitmasks:\n if a &b == 0:\n ans = max(ans, bitmasks[a]*bitmasks[b])\n return ans\n\n ","runtime":"259"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # share NO common letters\n #forall c in w, c not in w2\n # DO share -> check dict for each letter\n # can collect a set of indices to not include O(n)*26\n # then iterate through the complement O(n)\n # track product O(1)\n # have to do that for each word O(n), so O(n^2)\n \n # bit mask solution\n # each word is a 26bit int\n # O(1) to check if 2 words share, so just do a direct comparison\n def mask(w):\n ret = 0\n for c in w:\n b = ord(c)-ord('a')\n ret |= 1<<b\n return ret\n lens = defaultdict(int)\n for w in words:\n m = mask(w)\n lens[m] = max(lens[m], len(w))\n# masks = [(mask(w), len(w)) for w in words]\n# for m, l in masks:\n# lens[m] = max(lens[m], l)\n keys = list(lens.keys())\n best = 0\n for i in range(len(keys)):\n m = keys[i]\n l = lens[m]\n for j in range(i):\n m2 = keys[j]\n if m & m2 == 0: #masks[i] & masks[j] == 0:\n best = max(best, l * lens[m2])\n return best\n\n raw_words = words\n words = [tuple(set(w)) for w in words]\n # print(words)\n charmap = defaultdict(set)\n for i, w in enumerate(words):\n for c in w:\n charmap[c].add(i)\n best = 0\n for i in range(len(words)):\n w = words[i]\n relevant = set(range(i))\n for c in w:\n relevant.difference_update(charmap[c])\n # print(''.join(w), [raw_words[j] for j in relevant])\n l = len(raw_words[i])\n for j in relevant:\n best = max(best, l*len(raw_words[j]))\n return best\n","runtime":"259"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n bit_mask = [0] * len(words)\n length = [0] * len(words)\n\n for i in range(len(words)):\n for j in words[i]:\n bit_mask[i] |= 1<<(ord(j)-ord('a'))\n\n length[i] = len(words[i])\n\n maxV = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n if not (bit_mask[i] & bit_mask[j]):\n maxV = max(maxV, length[i]*length[j])\n \n return maxV","runtime":"346"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n bitReps = []\n\n for word in words:\n bitRep = 0\n\n for c in word:\n bitRep |= 1 << (ord(c) - ord('a'))\n\n bitReps.append(bitRep)\n\n curMax = 0\n\n for i in range(len(bitReps)):\n for j in range(i):\n if bitReps[i] & bitReps[j] == 0:\n curMax = max(curMax, len(words[i]) * len(words[j])) \n \n return curMax","runtime":"346"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = []\n for word in words:\n bit = 0\n for char in word:\n num = ord(char) - 97\n \n bit = bit | int( 2 ** ( num ) )\n ans.append(bit)\n # print(ans)\n MaxLength = 0\n for ind in range(len(ans)-1):\n for ind1 in range(ind+1,len(ans)):\n if ans[ind] & ans[ind1] == 0:\n MaxLength = max(MaxLength,len(words[ind]) * len(words[ind1]))\n return MaxLength","runtime":"433"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n char_set = [set(words[i]) for i in range(n)] # precompute hashset for each word\n bit_mask = [0] * n\n for i in range(n):\n for char in words[i]:\n bit_mask[i] |= 1 << (ord(char) - ord('a'))\n \n max_val = 0\n for i in range(n):\n for j in range(i + 1, n):\n if not (bit_mask[i] & bit_mask[j]): # if nothing common\n max_val = max(max_val, len(words[i]) * len(words[j]))\n \n return max_val\n ","runtime":"433"},{"code":"class Solution:\n # word -> bitmask\n # bitmask and takes O(1)\n # O(N^2)\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n bitmasks = []\n for word in words:\n bitmasks.append(self._bitmask(word))\n \n max_product = 0\n for i in range(n):\n for j in range(n):\n if i == j or (bitmasks[i] & bitmasks[j]):\n continue\n max_product = max(max_product, len(words[i]) * len(words[j]))\n \n return max_product\n\n\n \n def _bitmask(self, word: str) -> int:\n bitmask = 0\n for c in word:\n bitmask = bitmask | (1 << (ord(c) - ord('a')))\n \n return bitmask","runtime":"521"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n max_product = 0\n letter_to_words = defaultdict(set)\n for word in words:\n for c in word:\n letter_to_words[c].add(word)\n for word in words:\n candidates = self._get_candidates(word, letter_to_words, words)\n for cand in candidates:\n max_product = max(max_product, len(word)*len(cand))\n return max_product\n\n def _get_candidates(self, word, letter_to_words, words):\n candidates = set(words)\n for letter in word:\n candidates = candidates - letter_to_words[letter]\n return candidates","runtime":"521"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n charBitMap = {}\n for i in range(26):\n charBitMap[chr(ord('a') + i)] = 2**i\n wordBitMap = {}\n for word in words:\n bitMap = 0\n for char in word:\n bitMap |= charBitMap[char]\n wordBitMap[word] = bitMap\n maxLenProduct = 0\n for word1 in words:\n for word2 in words:\n if wordBitMap[word1] & wordBitMap[word2] == 0:\n maxLenProduct = max(maxLenProduct, len(word1) * len(word2))\n return maxLenProduct","runtime":"608"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n bit_map = {}\n for w in words:\n bit = 0\n for c in w:\n bit |= 1 << ord(c) - ord(\"a\")\n bit_map[w] = bit\n\n result = 0\n for w1 in words:\n for w2 in words:\n if not bit_map[w1] & bit_map[w2]:\n result = max(len(w1) * len(w2), result)\n\n return result\n","runtime":"608"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n d = defaultdict(int)\n mask = defaultdict(int)\n for w in words:\n for ch in w:\n mask[w] |= 1<<(ord(ch)-97)\n\n def hasSimilar(s,t):\n if mask[s] & mask[t]:\n return True\n return False\n n = len(words)\n for i in range(n):\n w = words[i]\n N = len(w)\n for j in range(i+1,n): \n v = words[j]\n M = len(v)\n if not hasSimilar(w,v):\n d[N] = max(d[N], M)\n res = 0\n \n for i in d:\n res = max(res, i*d[i])\n return res\n","runtime":"695"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0\n temp = []\n\n for word in words:\n temp.append({\"word\": word, \"letters\": {}})\n for l in word:\n temp[-1][\"letters\"][l] = True\n \n for i in range(len(temp)):\n for y in range(i + 1, len(temp)):\n fine = True\n if len(temp[i][\"word\"]) * len(temp[y][\"word\"]) <= ans:\n continue\n for l in temp[i][\"word\"]:\n if l in temp[y][\"letters\"]:\n fine = False\n break\n if fine and len(temp[i][\"word\"]) * len(temp[y][\"word\"]) > ans:\n ans = len(temp[i][\"word\"]) * len(temp[y][\"word\"])\n \n return ans\n","runtime":"695"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n freqs = [set() for i in words]\n for i in range(len(words)):\n for c in words[i]:\n freqs[i].add(c)\n \n # print(freqs)\n max_prod = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n for c in 'abcdefghijklmnopqrstuvwxyz':\n if c in freqs[i] and c in freqs[j]:\n break\n else:\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\n return max_prod","runtime":"782"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n char_set = [set(word) for word in words]\n ret = 0\n for i in range(n):\n for j in range(i + 1, n):\n if not char_set[i] & char_set[j]:\n ret = max(ret, len(words[i]) * len(words[j]))\n return ret\n ","runtime":"782"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n \n cache = dict()\n for w in words:\n cache[w] = set(w)\n\n n = len(words)\n ans = 0\n for idx in range(n):\n for idx_2 in range(idx + 1, n):\n if not (cache[words[idx]] & cache[words[idx_2]]):\n # no common letters\n ans = max(ans, len(words[idx]) * len(words[idx_2]))\n return ans","runtime":"869"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n \n ret = 0\n word_set = []\n for i in range(len(words)):\n word_set.append((len(words[i]),set(words[i])))\n\n print(word_set)\n for i in range(len(word_set)):\n len1,word1 = word_set[i]\n for j in range(i+1,len(word_set)):\n len2,word2 = word_set[j]\n\n if not bool(word1 & word2):\n # print(len1,words[i],len2,words[j])\n ret = max(ret,len1*len2)\n\n return ret\n \n\n\n","runtime":"869"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n max_val = 0\n new_set = []\n for word in words:\n new_set.append(set(word))\n for i in range(len(new_set)-1):\n for j in range(i+1, len(new_set)):\n if len(new_set[i].intersection(new_set[j])) == 0:\n max_val = max(max_val, len(words[i])*len(words[j]))\n \n return max_val\n\n","runtime":"956"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words=[(set(words[i]),len(words[i])) for i in range(len(words))]\n count=0\n for i in range(len(words)):\n for j in range(i):\n if len(set.intersection(words[i][0],words[j][0]))==0:\n count=max(count,words[i][1]*words[j][1])\n return count\n\n ","runtime":"956"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n diff_map = {}\n\n for word in words:\n diff_map[word] = 0\n\n\n\n for word in diff_map.keys():\n \n for word2 in words:\n if word2 == word:\n continue\n \n for i in range(len(word2)):\n if word2[i] in word:\n break\n elif i == len(word2) - 1:\n diff_map[word] = max(diff_map[word], len(word2))\n\n max_len = 0\n for word, lens in diff_map.items():\n curr_len = len(word)\n if lens:\n max_len = max(max_len, curr_len * lens)\n\n return max_len\n\n\n\n","runtime":"1043"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n diff_map = {}\n\n for word in words:\n diff_map[word] = 0\n\n\n\n for word in diff_map.keys():\n \n for word2 in words:\n if word2 == word:\n continue\n \n for i in range(len(word2)):\n if word2[i] in word:\n break\n elif i == len(word2) - 1:\n diff_map[word] = max(diff_map[word], len(word2))\n\n max_len = 0\n for word, lens in diff_map.items():\n curr_len = len(word)\n if lens:\n max_len = max(max_len, curr_len * lens)\n\n return max_len\n\n\n\n","runtime":"1043"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n result = 0\n map = {}\n\n for i in range(len(words) - 1):\n for j in range(i + 1, len(words)):\n one, two = words[i], words[j]\n\n if one not in map:\n map[one] = set(one)\n if two not in map:\n map[two] = set(two)\n\n if map[one].intersection(map[two]):\n continue\n\n prod = len(one) * len(two)\n if prod > result:\n result = prod\n\n return result","runtime":"1130"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def common(chars1, chars2):\n for c1, c2 in zip(chars1, chars2):\n if c1 and c2: return True\n return False\n chars, ans = [[False]*26 for i in range(len(words))], 0\n for i, word in enumerate(words):\n for ch in word:\n chars[i][ord(ch) - ord('a')] = True\n for j in range(i):\n if not common(chars[i], chars[j]):\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans","runtime":"1130"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words_compressed = []\n for w in words:\n w_list = [False] * 26\n for char in w:\n w_list[ord(char) - 97] = True\n words_compressed.append(w_list)\n ans = 0\n for i in range(len(words) - 1):\n for j in range(i + 1, len(words)):\n is_intersect = False\n for a, b in zip(words_compressed[i], words_compressed[j]):\n if a == True and b == True:\n is_intersect = True\n break\n if not is_intersect:\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans","runtime":"1217"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def hasCommon(a, b):\n for ch in ascii_lowercase:\n if ch in a and ch in b:\n return True\n \n return False\n\n mp = {}\n\n for w in words:\n mpc = defaultdict(bool)\n for ch in w:\n mpc[ch] = True\n mp[w] = mpc\n \n\n n = len(words)\n ans = 0\n\n for i in range(n):\n for j in range(i+1, n):\n w1, w2 = words[i], words[j]\n l1, l2 = len(w1), len(w2)\n\n c1, c2 = mp[w1], mp[w2]\n\n if not hasCommon(c1, c2):\n ans = max(ans, l1 * l2)\n \n return ans\n","runtime":"1217"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def compareAlphas(a1, a2):\n for count1, count2 in zip(a1, a2):\n if count1 > 0 and count2 > 0:\n return False\n return True\n alpha = [[0] * 26 for _ in range(len(words))]\n for i, word in enumerate(words):\n for j, c in enumerate(word):\n char = ord(c) - ord('a')\n alpha[i][char] += 1\n n = len(words)\n currMax = 0\n for i in range(n):\n for j in range(i+1,n):\n if compareAlphas(alpha[i], alpha[j]):\n currMax = max(\n len(words[i]) * len(words[j]),\n currMax\n )\n return currMax","runtime":"1305"},{"code":"ALPHABET_SIZE = 26\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n res = 0\n\n words.sort(key=len, reverse=True)\n\n contains = []\n for word in words:\n contains.append([False] * ALPHABET_SIZE)\n for char in word:\n contains[-1][ord(char) - ord('a')] = True\n\n def overlap(i: int, j: int) -> bool:\n for c1, c2 in zip(contains[i], contains[j]):\n if c1 and c2:\n return True\n\n return False\n\n for i, word1 in enumerate(words):\n for j, word2 in enumerate(words):\n prod = len(word1) * len(word2)\n if prod > res and not overlap(i, j):\n res = prod\n\n\n\n return res","runtime":"1305"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words.sort(key=len, reverse=True)\n memo = {}\n\n ans = 0\n for i, w in enumerate(words):\n first_l = len(w)\n if ans >= first_l * first_l:\n break\n first = set(w)\n for j in range(i + 1, len(words)):\n product = first_l * len(words[j])\n if ans >= product:\n break\n second = set(words[j])\n if not first.intersection(second):\n ans = product\n return ans","runtime":"1392"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n wordSet = [set(word) for word in words]\n res = 0\n for i in range(len(words)):\n for j in range(len(words)):\n if not wordSet[i] & wordSet[j]:\n res = max(res, len(words[i]) * len(words[j]))\n\n return res","runtime":"1392"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n sets = {}\n max_product = 0\n\n for word in words:\n sets[word] = set(list(word))\n\n for i, word1 in enumerate(words):\n for j, word2 in enumerate(words[i + 1:]):\n if len(sets[word1].union(sets[word2])) == len(sets[word1]) + len(sets[word2]):\n max_product = max(max_product, len(word1) * len(word2))\n\n return max_product\n ","runtime":"1479"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n compressed = [\"\".join(set(x)) for x in words]\n maxProd = 0\n\n for i in range(len(words)):\n for j in range(i, len(words)):\n if set(compressed[i]).isdisjoint(set(compressed[j])):\n maxProd = max(maxProd, len(words[i]) * len(words[j]))\n\n return maxProd\n\n\n\n# Input:\n# - words: List[str]\n\n# Output:\n# - maxProd: int # product of length of two words that do not shar common letters\n\n# Example:\n# words = [\"aaadv\", \"ioqsd\", \"ionq\", \"ajpm\", \"mljqmhrtq\"]\n# [\"adv\", io\"\"]\n# maxProd = 45\n\n# result\n\n# {\n# \"a\" -> [0, 3]\n# \"d\" -> [0, 1]\n# \"v\" -> [0]\n\n# }\n\n# 0 ->\n\n\n","runtime":"1479"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words1 = [set(i) for i in words]\n res = 0\n for i in range(len(words)):\n for j in range(len(words)):\n if not words1[i] & words1[j]:\n tmp = len(words[i]) * len(words[j])\n res = max(res, tmp)\n return res\n ","runtime":"1566"},{"code":"from typing import NamedTuple\n\nclass WordStats(NamedTuple):\n length: int\n char_set: set\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n opt = 0\n stats = {\n i: WordStats(len(word), set(word)) for i, word in enumerate(words)\n }\n\n for i, (i_length, i_chars) in stats.items():\n for j, (j_length, j_chars) in stats.items():\n if not (i_chars & j_chars):\n opt = max(opt, i_length * j_length)\n \n return opt\n ","runtime":"1566"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n d={}\n res=0\n store={}\n for i in range(len(words)):\n l=set()\n for m in words[i]:\n l.add(m)\n nw=\"\"\n for tm in l:\n nw=nw+tm\n store[i]=len(words[i])\n words[i]=nw\n for i in range(97,123):\n d[chr(i)]=False\n for i in range(len(words)):\n td=copy.deepcopy(d)\n for k in words[i]:\n td[k]=True\n for j in range(i+1,len(words)):\n flag=1\n for o in words[j]:\n if td[o]==True:\n flag=0\n if flag==1:\n res=max(res,store[i]*store[j])\n return res\n \n \n \n ","runtime":"1653"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n store = []\n for word in words:\n tmp = 0\n for i in word:\n tmp |= 1 << (ord(i) - 97)\n store.append(tmp)\n res = 0\n for i in range(0, n):\n for j in range(i + 1, n):\n for k in range(0, 26):\n if (store[i] & (1 << k)) & (store[j] & (1 << k)):\n break\n else:\n res = max(res, len(words[i]) * len(words[j]))\n return res","runtime":"1653"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n lookup = collections.defaultdict(set)\n\n for word in words:\n lookup[word] = set(word)\n\n maximumFound = 0\n\n for word in words:\n for otherWord in words:\n if len(lookup[word] & lookup[otherWord]) == 0:\n maximumFound = max(maximumFound, len(word) * len(otherWord))\n \n return maximumFound\n \n","runtime":"1740"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def shared(mask1, mask2):\n for i in range(26):\n if (mask1 >> i) & 1 == (mask2 >> i) & 1 == 1:\n return True\n\n return False\n\n def toMask(word):\n mask = 0\n for char in word:\n index = ord(char) - ord('a')\n mask = mask | (1 << index)\n\n return mask\n\n n = len(words)\n masks = [0]*n\n for i, word in enumerate(words):\n masks[i] = toMask(word)\n\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n if not shared(masks[i], masks[j]):\n ans = max(ans, len(words[i])*len(words[j]))\n\n return ans","runtime":"1740"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n lookup = {}\n for w in words:\n lookup[w] = set(w)\n \n def dont_share(s,t):\n if lookup[s]&lookup[t]:\n return False\n return True\n\n mx = 0\n for i in words:\n for j in words:\n if dont_share(i,j):\n mx = max(mx,len(i)*len(j))\n \n return mx","runtime":"1827"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n hashmap=defaultdict(set)\n for word in words:\n hashmap[word]=set(word)\n def not_sharing_common_characters(i,j):\n if hashmap[i] & hashmap[j]:\n return False\n return True \n max_product=0\n for i in words:\n for j in words:\n if not_sharing_common_characters(i,j):\n max_product=max(max_product,len(i)*len(j))\n return max_product","runtime":"1827"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n counters = {}\n \n for i in range(len(words)):\n counters[i] = Counter(words[i])\n \n maxProd = 0\n \n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n elig = 1\n for letter in counters[i]:\n if(letter in counters[j]):\n elig = 0\n \n if(elig):\n maxProd = max(maxProd, len(words[i]) * len(words[j]))\n \n \n return maxProd\n \n \n ","runtime":"1914"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n counters = {}\n \n for i in range(len(words)):\n counters[i] = Counter(words[i])\n \n maxProd = 0\n \n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n elig = 1\n for letter in counters[i]:\n if(letter in counters[j]):\n elig = 0\n \n if(elig):\n maxProd = max(maxProd, len(words[i]) * len(words[j]))\n \n \n return maxProd\n \n \n ","runtime":"1914"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n alphabet = {}\n cooccurences = {}\n for word in words:\n for letter in word:\n if letter not in alphabet:\n alphabet[letter] = set()\n alphabet[letter].add(word)\n\n for letter in alphabet:\n for word in alphabet[letter]:\n if word not in cooccurences:\n cooccurences[word] = set()\n for coword in alphabet[letter]:\n cooccurences[word].add(coword)\n\n words = sorted(words, key=len, reverse=True)\n max_all = 0\n \n for i in range(len(words)):\n for j in range(len(words)):\n if i != j and words[j] not in cooccurences[words[i]] and words[i] not in cooccurences[words[j]]:\n max_now = len(words[i]) * len(words[j])\n if max_now > max_all:\n max_all = max_now\n\n return max_all","runtime":"2001"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # Could find all distinct pairs, then for each compute the product of lengths and take max.\n # Or could order by largest products, and return first two that are distinct (perhaps faster).\n n = len(words)\n words.sort(key=lambda s:len(s), reverse=True)\n # print(words)\n res = 0\n for i in range(n):\n for j in range(i+1, n):\n if not set(words[i]).intersection(set(words[j])):\n res = max(res, len(words[i]) * len(words[j]))\n break\n return res\n\n ","runtime":"2001"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n l = [(len(w), collections.Counter(w)) for w in words]\n l.sort(key=itemgetter(0), reverse=True)\n\n ret = 0\n for i, u in enumerate(l):\n for j in range(i + 1, len(l)):\n if not set(u[1].keys()).intersection(set(l[j][1].keys())):\n product = u[0] * l[j][0]\n if product <= ret:\n break\n ret = product\n return ret","runtime":"2089"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n word_length = defaultdict(list)\n for word in words:\n word_length[len(word)].append(word)\n\n num_comb = []\n for n1 in word_length:\n for n2 in word_length:\n if n2 < n1:\n continue\n heappush(num_comb, (-n1 * n2, n1, n2))\n\n while num_comb:\n _, n1, n2 = heappop(num_comb)\n words1 = word_length[n1]\n words2 = word_length[n2]\n for word1 in words1:\n for word2 in words2:\n if not self.share_letters(word1, word2):\n return n1 * n2\n return 0\n\n def share_letters(self, word1, word2):\n return len(set(word1).intersection(word2)) > 0","runtime":"2089"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n d = {word: len(word) for word in words}\n ma = 0\n l = list(d.keys())\n for i in range(len(l)):\n for j in range(i + 1, len(l)):\n if not set(l[i]) & set(l[j]):\n ma = max(ma, len(l[i]) * len(l[j]))\n return ma","runtime":"2176"},{"code":"import string\nimport heapq\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n masks = [[False] * 26 for _ in range(len(words))]\n for idx, word in enumerate(words):\n for ch in word:\n masks[idx][ord(ch) - ord('a')] = True\n\n def common(i, j):\n return any(x == True and y == True for x, y in zip(masks[i], masks[j]))\n \n result = 0\n for i, word in enumerate(words):\n for j in range(i):\n if not common(i, j):\n result = max(result, len(word) * len(words[j]))\n\n return result","runtime":"2263"},{"code":"import string\nimport heapq\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n masks = [[False] * 26 for _ in range(len(words))]\n for idx, word in enumerate(words):\n for ch in word:\n masks[idx][ord(ch) - ord('a')] = True\n\n def has_common(i, j):\n return any(x == True and y == True for x, y in zip(masks[i], masks[j]))\n \n result = 0\n for i, word in enumerate(words):\n for j in range(i):\n if not has_common(i, j):\n result = max(result, len(word) * len(words[j]))\n\n return result","runtime":"2263"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n \n bitmasks = {}\n for word in words:\n bitmask=[0]*26\n for char in word:\n index=ord(char)-ord(\"a\")\n bitmask[index]=1\n bitmasks[word]=list(bitmask)\n maxLength=0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n\n bitmask1=bitmasks[words[i]]\n bitmask2=bitmasks[words[j]]\n \n k=25\n isValid=True\n while k>=0:\n if bitmask1[k] & bitmask2[k]:\n isValid=False\n break\n k-=1\n if isValid:\n maxLength=max(maxLength, len(words[i])*len(words[j]))\n\n return maxLength","runtime":"2350"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words.sort(key=len, reverse=True)\n memo = {}\n\n ans = 0\n for gap in range(1, len(words) - 1):\n for w1, w2 in zip(words, words[gap:]):\n product = len(w1) * len(w2)\n if ans >= product:\n break\n if not memo.setdefault(w1, set(w1)).intersection(memo.setdefault(w2, set(w2))):\n ans = product\n break\n return ans","runtime":"2437"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n dics = [collections.Counter(word) for word in words]\n ans = 0\n for i in range(len(words)):\n for j in range(i, len(words)):\n if set(dics[i].keys()).intersection(set(dics[j].keys())) == set():\n ans = max(len(words[i]) * len(words[j]), ans)\n\n return ans\n ","runtime":"2524"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words.sort(key=len, reverse=True)\n\n ans = 0\n for gap in range(1, len(words) - 1):\n for w1, w2 in zip(words, words[gap:]):\n product = len(w1) * len(w2)\n if ans >= product:\n break\n if not set(w1).intersection(set(w2)):\n ans = product\n break\n return ans","runtime":"2611"},{"code":"from collections import Counter\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n mps = []\n for w in words:\n mps.append(set(Counter(w).keys()))\n print(mps)\n ans = 0\n for i in range(len(words)):\n for j in range(len(words)):\n if i != j and all(True if c not in mps[i] else False for c in mps[j]):\n ans = max(ans,len(words[i])*len(words[j]))\n\n return ans\n ","runtime":"2698"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n res = 0\n for index in range(len(words)):\n for index2 in range(index+1,len(words)):\n a,b = words[index], words[index2]\n amount = len(a) * len(b)\n if amount <= res:\n continue\n if len(set(a)) + len(set(b)) == len(set(a+b)):\n res = max(res, amount)\n return res\n","runtime":"2785"},{"code":"from collections import Counter\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n mps = []\n for w in words:\n mps.append(set(Counter(w).keys()))\n print(mps)\n ans = 0\n for i in range(len(words)):\n for j in range(len(words)):\n if i != j and all(True if c not in mps[i] else False for c in mps[j]):\n ans = max(ans,len(words[i])*len(words[j]))\n\n return ans\n ","runtime":"2785"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0\n chars = []\n for word in words:\n chars.append(set(word))\n for i in range(len(words)):\n for j in range(len(words)):\n if i != j:\n good = True\n for k in range(26):\n if chr(ord('a') + k) in chars[i] and chr(ord('a') + k) in chars[j]:\n good = False\n break\n if good:\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans","runtime":"2873"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # two words that do not share common letters\n word_options = set(words)\n letter_to_word = defaultdict(set)\n for word in words:\n for c in word:\n letter_to_word[c].add(word)\n max_len = 0\n word_used = ''\n for word in word_options:\n all_related = set()\n for c in word:\n all_related = all_related.union(letter_to_word[c])\n #print(word, all_related)\n for option in word_options:\n if option == word or option in all_related or word_used==option:\n continue\n #print(option, word)\n new_calc = len(option) * len(word)\n if new_calc > max_len:\n max_len = max(max_len, len(option)*len(word))\n word_used = word\n \n return max_len\n\n \n\n ","runtime":"2873"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n sp = []\n max_s = 0\n max_l = 0\n len_w = len(words)\n for num_1, el_1 in enumerate(words):\n word1 = set(el_1)\n len_w = len(el_1)\n for num_2, el_2 in enumerate(words):\n ex = len_w * len(el_2)\n if num_1 != num_2 and ex > max_l:\n if word1.intersection(el_2) == set() and [el_1, el_2] not in sp:\n curr = len(el_1) * len(el_2)\n if curr > max_s:\n max_s = curr\n max_l = ex\n\n sp.append([el_2, el_1])\n return max_s","runtime":"2960"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words = list(set(words))\n ans = []\n for i in range(0,len(words)-1):\n for j in range(i+1,len(words)):\n if(len(set(list(words[i])).intersection(set(list(words[j]))))==0):\n ans.append(len(list(words[i]))*len(list(words[j])))\n if(len(ans)==0):\n return 0\n ans.sort(reverse=True)\n return ans[0] ","runtime":"2960"},{"code":"class Solution:\n def maxProduct(self, w: List[str]) -> int:\n w=list(set(w))\n a=[]\n for i in range(0,len(w)-1):\n for j in range(i+1,len(w)):\n if(len(set(list(w[i]))&(set(list(w[j]))))==0):\n a.append(len(list(w[i]))*len(list(w[j])))\n if(len(a)==0):\n return 0\n return max(a)\n ","runtime":"3047"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n new = []\n for word in words:\n temp = [0] * 26\n for letter in word:\n temp[ord(letter) - ord(\"a\")] += 1\n new.append(temp)\n ans = 0\n for i in range(len(new)):\n for j in range(i, len(new)):\n bad = False\n for k in range(26):\n if new[i][k] > 0 and new[j][k] > 0:\n bad = True\n if not bad:\n ans = max(ans, sum(new[i]) * sum(new[j]))\n return ans\n\n\n\n ","runtime":"3047"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n max_product = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n common_letters = False\n for k in set(words[i]):\n if k in words[j]:\n common_letters = True\n break\n if(not common_letters):\n max_product = max(max_product, len(words[i]) * len(words[j]))\n return max_product","runtime":"3308"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n res = 0\n dp = [[0 for _ in range(26)] for _ in range(len(words))]\n for i, word in enumerate(words):\n for c in word:\n dp[i][ord(c) - ord('a')] = 1\n for i in range(len(words)):\n arr_1 = dp[i]\n for j in range(i + 1, len(words)):\n arr_2 = dp[j]\n has_common = False\n for k in range(26):\n if arr_1[k] & arr_2[k] == 1:\n has_common = True\n if not has_common:\n res = max(res, len(words[i]) * len(words[j]))\n return res","runtime":"3395"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n m=0\n for i in range(len(words)):\n a=set(words[i])\n for j in range(i+1,len(words)):\n b=set(words[j])\n if a.isdisjoint(b):\n m=max(m,len(words[i])*len(words[j]))\n return m","runtime":"3395"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0\n\n for i in range(len(words)):\n t1 = set(words[i])\n for j in range(i + 1, len(words)):\n t2 = set(words[j])\n\n if t1.isdisjoint(t2):\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans","runtime":"3482"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n l1=len(k1)\n s1=set(k1)\n j=i\n while j<m:\n k2=words[j]\n l2=len(k2)\n s2=set(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"3569"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n l1=len(k1)\n s1=set(k1)\n j=i\n while j<m:\n k2=words[j]\n l2=len(k2)\n s2=set(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"3569"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n l1=len(k1)\n s1=set(k1)\n j=i\n while j<m:\n k2=words[j]\n l2=len(k2)\n s2=set(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"3657"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n l1=len(k1)\n s1=set(k1)\n j=i\n while j<m:\n k2=words[j]\n l2=len(k2)\n s2=set(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"3657"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n l1=len(k1)\n s1=set(k1)\n j=i\n while j<m:\n k2=words[j]\n l2=len(k2)\n s2=set(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"3744"},{"code":"class UF:\n def __init__(self,n):\n self.par = [i for i in range(n)]\n self.rank = [1]*n\n \n def find(self,n):\n p = n\n while p != self.par[p]:\n self.par[p] = self.par[self.par[p]]\n p = self.par[p]\n return p\n \n def union(self,n1,n2):\n p1,p2 = self.find(n1),self.find(n2)\n if p1 == p2:\n return\n \n if self.rank[p1] > self.rank[p2]:\n self.rank[p1] += self.rank[p2]\n self.par[p2] = p1\n else:\n self.rank[p2] += self.rank[p1]\n self.par[p1] = p2\n return \nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n #make set for each character a..z\n # then for each word add its index to the set for each char\n # union together each of the indexes in each set\n\n # for each parent get group\n # get longest 2 per group\n\n n = len(words)\n uf = UF(n)\n\n char_to_indices = defaultdict(set)\n\n for i,word in enumerate(words): # O(n*c)\n for c in word:\n char_to_indices[c].add(i)\n\n #for each word, go through chars and get all matching words\n res = 0\n for w in words:\n together = set()\n for c in w:\n together |= char_to_indices[c]\n \n first = 0\n for i in range(n):\n if i not in together:\n length = len(words[i])\n if length >= first:\n first = length\n res = max(res,first*len(w))\n return res\n \n\n \n \n # for indices in char_to_indices.values():\n # indices = list(indices)\n # for i in range(len(indices)-1):\n # uf.union(indices[i],indices[i+1])\n \n\n # par_to_longest = defaultdict(int)\n # for i in range(n):\n # parent = uf.find(i)\n # length = len(words[i])\n # par_to_longest[parent] = min(par_to_longest[parent],length)\n\n # first = 0\n # second = 0\n\n # for length in par_to_longest.values():\n # if length >= first:\n # second = first\n # first = length\n # elif length > second:\n # second = length\n return first*second\n \n \n ","runtime":"3744"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n maxVal = 0\n for i in range(n-1):\n x1 = set(words[i])\n for j in range(i+1,n):\n y1 = set(words[j])\n if len(x1-y1) == len(x1):\n maxVal = max(maxVal,len(words[i])*len(words[j]))\n return maxVal","runtime":"3831"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n max_prod = 0\n for i in range(len(words)):\n letts1 = set(words[i])\n for j in range(i):\n valid = True\n for l in words[j]:\n if l in letts1:\n valid = False\n break\n if valid:\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\n return max_prod","runtime":"3918"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n maxx = 0\n \n for i in range(len(words)):\n elem = set(words[i])\n for j in range(i+1,len(words)):\n flag = 0\n for char in words[j]:\n if char in elem:\n flag = 1\n break\n if flag==0:\n lenn = len(words[i])*len(words[j])\n maxx = max(maxx,lenn)\n\n\n return maxx\n\n \n","runtime":"3918"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n max_product = 0\n iteration = len(words)\n for i in range(iteration):\n first_word_set = set(words[i])\n for j in range(i,iteration): \n second_word_set = set(words[j])\n if not first_word_set.intersection(second_word_set):\n max_product = max(max_product , len(words[i])* len(words[j]))\n \n return max_product \n\n \n ","runtime":"4005"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n maxx = 0\n \n for i in range(len(words)):\n elem = set(words[i])\n for j in range(i+1,len(words)):\n flag = 0\n for char in words[j]:\n if char in elem:\n flag = 1\n break\n if flag==0:\n lenn = len(words[i])*len(words[j])\n maxx = max(maxx,lenn)\n\n\n return maxx\n\n \n","runtime":"4092"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n a_code = ord('a')\n max_length = 0\n length = len(words)\n for first_index in range(length - 1):\n first_word_letters_set = set(words[first_index])\n for second_index in range(first_index, length):\n if first_word_letters_set.intersection(set(words[second_index])):\n continue\n max_length = max(max_length, len(words[first_index]) * len(words[second_index]))\n return max_length","runtime":"4092"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n maxVal = 0\n for i in range(len(words)):\n seti = set(words[i])\n for j in range(i,len(words)):\n setj = set(words[j])\n if not seti.intersection(setj):\n maxVal = max(maxVal,len(words[j])*len(words[i]))\n return maxVal\n","runtime":"4179"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n max_prod = 0\n for i in range(len(words)):\n letts1 = set(words[i])\n for j in range(i+1, len(words)):\n valid = True\n for l in words[j]:\n if l in letts1:\n valid = False\n break\n if valid:\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\n return max_prod","runtime":"4179"},{"code":"class Solution:\n def checkCommon(self, toCheck, currString):\n\n for char in currString:\n if char in toCheck:\n return False\n \n return True\n def maxProduct(self, words: List[str]) -> int:\n \n ans = 0\n\n for i in range(len(words)):\n curr = set()\n for char in words[i]:\n curr.add(char)\n\n for j in range(i + 1 , len(words)):\n if self.checkCommon(curr, words[j]):\n \n ans = max(ans, len(words[i])* len(words[j]))\n\n \n return ans","runtime":"4266"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0 \n for i in range(len(words)):\n s1 = set(words[i])\n for j in range(i+1,len(words)):\n s2 = set(words[j])\n inter = s1.intersection(s2)\n if len(inter) == 0:\n ans = max(ans,len(words[i]) * len(words[j]))\n return ans\n\n ","runtime":"4266"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0 \n for i in range(len(words)):\n s1 = set(words[i])\n for j in range(i+1,len(words)):\n s2 = set(words[j])\n inter = s1.intersection(s2)\n if len(inter) == 0:\n ans = max(ans,len(words[i]) * len(words[j]))\n return ans\n\n ","runtime":"4353"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n \n ans = 0\n for i in range(len(words)):\n set1 = set([char for char in words[i]])\n for j in range(i+1, len(words)):\n valid = True\n for char in words[j]:\n if char in set1:\n valid = False\n break\n if valid:\n ans = max(ans, len(words[i])*len(words[j]))\n return ans\n \n ","runtime":"4441"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n res=0\n def compare(wordset,word):\n for letter in word:\n if letter in wordset:\n return False\n return True\n for i in range(len(words)):\n word1set=set(list(words[i]))\n for j in range(i+1,len(words)):\n if compare(word1set,words[j]):\n res=max(res,len(words[i])*len(words[j]))\n return res\n","runtime":"4441"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n p=1\n flag2=0\n for i in range(len(words)):\n d={}\n for j in range(len(words[i])):\n d[words[i][j]]=1\n for j in range(i+1,len(words)):\n flag=1\n for k in words[j]:\n if k in d:\n flag=0\n break\n if flag==1:\n flag2=1\n p=max(p,len(words[i])*len(words[j]))\n if flag2==0:\n return 0\n return p","runtime":"4528"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ret = 0\n for i in range(len(words)):\n mp = {}\n for c in words[i]:\n mp[c] = True\n for j in range(i+1, len(words)):\n diff = True\n for c in words[j]:\n if c in mp:\n diff = False\n break\n if diff:\n ret = max(ret, len(words[i]) * len(words[j]))\n return ret\n ","runtime":"4615"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n word_counts=[]\n ans=0\n for w in words: \n word_count=[0 for i in range(26)]\n for i in w:\n word_count[ord(i)-ord('a')]=1\n word_counts.append(word_count)\n for i in range(len(words)):\n for j in range(i+1,len(words)):\n found=True\n for k in range(26):\n if word_counts[i][k]==word_counts[j][k] and word_counts[i][k]==1:\n found=False\n if found:\n ans=max(ans,len(words[i])*len(words[j]))\n return ans\n","runtime":"4702"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n maxProduct = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if(len([letter for letter in set(words[i]) if letter in words[j]]) == 0):\n maxProduct = max( maxProduct, len(words[i]) * len(words[j]))\n return maxProduct","runtime":"4702"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n maxProduct = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if(len([letter for letter in set(words[i]) if letter in words[j]]) == 0):\n maxProduct = max( maxProduct, len(words[i]) * len(words[j]))\n return maxProduct","runtime":"4789"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n vocab = set(words)\n max_product = 0\n\n for w in words:\n for v in vocab:\n if len(set(v).intersection(set(w))) == 0:\n max_product = max(max_product, len(w)*len(v))\n\n return max_product","runtime":"4789"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\n test_dict = {}\n for word in words:\n word_list = [0 for _ in range(26)]\n for char in word:\n word_list[alphabet.index(char)] += 1\n test_dict[word] = word_list\n\n result = 0\n for index_one in range(len(words)):\n for index_two in range(index_one+1,len(words)):\n if sum(map(lambda x, y : x * y, test_dict[words[index_one]], test_dict[words[index_two]] ))==0:\n result = max(result, len(words[index_one]) * len(words[index_two]))\n return result\n","runtime":"4876"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n cnt = []\n for word in words:\n counter = Counter(word)\n cnt.append(counter)\n\n print(cnt)\n ans = 0\n \n n = len(words)\n for i in range(n):\n for j in range(n):\n if i != j:\n cnt1 = cnt[i]\n cnt2 = cnt[j]\n\n flag = False\n for k in range(26):\n c = chr(ord('a') + k)\n if cnt1[c] and cnt2[c]:\n flag = True\n break\n if not flag:\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans","runtime":"4963"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n words.sort(key=len, reverse=True)\n res = 0\n for i in range(len(words)-1):\n temp = set(list(words[i]))\n for j in range(i+1, len(words)):\n works = True\n temp1 = set(list(words[j]))\n for char in temp1:\n if char in temp:\n works = False\n break\n if works:\n res = max(res, len(words[i]) * len(words[j]))\n return res","runtime":"5050"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # brute force\n # iterate through all the 2-combinations\n # if the 2 words do not have shared letters, calculate their lengths' product\n # return the max product\n \n # improvement\n # for all the words with the same letters, keep only the longest one\n word_lengths = {}\n for word in words:\n word_set = frozenset(word)\n if word_set in word_lengths:\n word_lengths[word_set] = max(word_lengths[word_set], len(word))\n else:\n word_lengths[word_set] = len(word)\n words = [word for word in words if len(word) == word_lengths[frozenset(word)]]\n \n max_product = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n if not set(words[i]) & set(words[j]):\n max_product = max(max_product, len(words[i]) * len(words[j]))\n return max_product","runtime":"5137"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0\n for i in range(len(words)-1):\n l1 = len(words[i])\n a = set(list(words[i]))\n for j in range(i+1,len(words)):\n l2 = len(words[j])\n b = set(list(words[j]))\n pos = True\n for k in a:\n if k in b:\n pos = False\n break\n if pos == True:\n ans = max(ans,l1*l2)\n return ans\n\n","runtime":"5225"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n k1=list(k1)\n s1=set(k1)\n l1=len(k1)\n j=i\n while j<m:\n k2=words[j]\n k2=list(k2)\n s2=set(k2)\n l2=len(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"5312"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n k1=list(k1)\n l1=len(k1)\n s1=set(k1)\n j=i\n while j<m:\n k2=words[j]\n k2=list(k2)\n l2=len(k2)\n s2=set(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"5399"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n prod = 0\n\n def getMask(word):\n mask = 0\n for char in word:\n mask = mask | 1 << ord(char) - ord('a')\n return mask\n\n masks = [getMask(word) for word in words]\n for i in range(len(words)):\n for j in range(i):\n if not (masks[i] & masks[j]):\n prod = max(prod, len(words[i] * len(words[j])))\n\n return prod","runtime":"5486"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n i=0\n n=len(words)\n m=n\n s=0\n while n>0:\n k1=words[i]\n k1=list(k1)\n s1=set(k1)\n l1=len(k1)\n j=i\n while j<m:\n k2=words[j]\n k2=list(k2)\n s2=set(k2)\n l2=len(k2)\n f=0\n for c in s1:\n if c in s2:\n f=1\n break\n if f==0:\n k=l1*l2\n if k>s:\n s=k\n j+=1\n i+=1\n n-=1\n return s\n\n\n\n \n \n ","runtime":"5573"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n res = 0\n\n def generate_mask(word):\n mask = 0\n for c in word:\n mask |= 1 << ord(c) - ord(\"a\")\n return mask\n \n masks = [generate_mask(word) for word in words]\n\n for i in range(len(words)):\n for j in range(i):\n if not (masks[i] & masks[j]):\n res = max(res, len(words[i]* len(words[j])))\n \n return res","runtime":"5660"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n prod = 0\n masks = [self.getMask(word) for word in words]\n\n for i in range(len(words)):\n for j in range(i):\n if not (masks[i] & masks[j]):\n prod = max(prod, len(words[i] * len(words[j])))\n\n return prod\n\n def getMask(self, word):\n mask = 0\n for char in word:\n mask = mask | 1 << ord(char) - ord('a')\n return mask","runtime":"5660"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n s = []\n for i in range(len(words)):\n s.append(0)\n for i in range(len(words)):\n for j in range(97,123):\n if chr(j) in words[i]:\n s[i] |= 1 << (j - 97)\n maxelen = 0\n \n print(s)\n for i in range(len(words)):\n for j in range(i+1,len(words)):\n k = s[i] & s[j]\n if k==0:\n maxelen=max(maxelen,len(words[i]*len(words[j])))\n return maxelen","runtime":"5747"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n mask = 0b00000011111111111111111111111111\n c_codes = {chr(97+i): 1<<i for i in range(26)}\n def str_to_bin(str):\n res = 0\n for c in str:\n res |= c_codes[c]\n #if res == mask:\n # return res\n return res\n str_codes = [str_to_bin(str) for str in words]\n max_len = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n if str_codes[i] & str_codes[j] == 0:\n max_len = max(max_len, len(words[i]*len(words[j])))\n return max_len","runtime":"5747"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n mask = 0b00000011111111111111111111111111\n c_codes = {chr(97+i): 1<<i for i in range(26)}\n def str_to_bin(str):\n res = 0\n for c in str:\n res |= c_codes[c]\n if res == mask:\n return res\n return res\n str_codes = [str_to_bin(str) for str in words]\n max_len = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n if str_codes[i] & str_codes[j] == 0:\n max_len = max(max_len, len(words[i]*len(words[j])))\n return max_len","runtime":"5834"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n prod = 0\n masks = [self.getMask(word) for word in words]\n\n for i in range(len(words)):\n for j in range(i):\n if not (masks[i] & masks[j]):\n prod = max(prod, len(words[i] * len(words[j])))\n\n return prod\n\n def getMask(self, word):\n mask = 0\n for char in word:\n mask = mask | 1 << ord(char) - ord('a')\n return mask","runtime":"5834"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n sortedList = sorted(words, key=len, reverse=True)\n max_product = 0\n for i in range(0, len(sortedList)):\n if (i + 1) < len(sortedList):\n possible_max_value = len(sortedList[i]) * len(sortedList[i+1])\n if possible_max_value < max_product:\n break\n for j in range(i + 1, len(sortedList)):\n if self.are_words_ok( sortedList[i], sortedList[j]):\n prod = len(sortedList[i]) * len(sortedList[j])\n if prod > max_product:\n max_product = prod\n\n return max_product\n\n def are_words_ok(self, words1, word2):\n for c in words1:\n if c in word2:\n return False\n return True","runtime":"5921"},{"code":"class Solution:\n def mapDicts(self,words):\n maps={}\n for i in range(len(words)):\n if words[i] in maps:\n maps[words[i]]=maps[words[i]]+1\n else:\n maps[words[i]]=1\n return maps\n def objectUnequal(self,dicts1, dicts2):\n for key in dicts1:\n if key in dicts2:\n return False\n return True\n def mapSets(self,words):\n return set(words)\n def maxProduct(self, words: List[str]) -> int:\n word_sets=[self.mapSets(word) for word in words]\n maxProd=0\n for i in range(len(word_sets)):\n for j in range(i+1,len(word_sets)):\n if self.objectUnequal(words[i],words[j]):\n a=len(words[j])*len(words[i])\n maxProd = max(maxProd,a)\n \n return maxProd\n ","runtime":"5921"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n L=len(words)\n D=dict()\n for i in range(L):\n for c in words[i]:\n if c not in D: D[c]={i}\n else: D[c].add(i)\n \n maxL=0\n cSet={i for i in range(L)}\n\n for i in range(L):\n v=cSet.copy()\n for c in words[i]:\n v=v-D[c]\n\n lenTgt=len(words[i])\n for i in v:\n wl=lenTgt*len(words[i])\n if wl>maxL: maxL=wl\n \n \n return maxL\n\n","runtime":"6009"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n lst=[]\n for i in words:\n lst.append(len(i))\n maxi=0\n for i in range(0,len(words)):\n pro=1\n for j in range(i+1,len(words)):\n if self.f(words[i],words[j]):\n pro=lst[i]*lst[j]\n maxi=max(maxi,pro)\n return maxi\n def f(self, str1,str2)->int:\n for i in str1:\n if i in str2:\n return 0\n return 1\n ","runtime":"6009"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n result = 0\n for i in range(len(words)):\n letter = words[i]\n for j in range(i+1, len(words)):\n val = words[j]\n # letter2 = set(words[j])\n for a in val:\n if a in letter:\n break\n else:\n result = max(result, (len(letter) * len(val)))\n return result","runtime":"6096"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def no_common_letters(s1, s2):\n for ch in s1:\n if ch in s2:\n return False\n return True\n \n n = len(words)\n max_prod = 0\n for i in range(n):\n for j in range(i + 1, n):\n if no_common_letters(words[i], words[j]):\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\n return max_prod","runtime":"6096"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n lst = []\n def share(word1,word2):\n cnt = 0\n for let in word1:\n if let in word2:\n cnt+=1\n break\n if cnt>0:\n return True\n else:\n return False \n for i in range(0,len(words)):\n for j in range(i+1,len(words)):\n if share(words[i],words[j])==False:\n k = len(words[i])*len(words[j])\n lst.append(k)\n if len(lst)!=0:\n return max(lst)\n else:\n return 0\n ","runtime":"6183"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n def bb(a,b):\n for i in a:\n if i in b:\n return False\n return True\n m=0\n for i in range(len(words)):\n for j in range(i,len(words)):\n if bb(words[i],words[j]):\n m=max(m,len(words[i])*len(words[j]))\n return m","runtime":"6183"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n maximum_length = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n w1 = words[i]\n w2 = words[j]\n match = False\n for ch in w1:\n if ch in w2:\n match = True\n break\n if match == False:\n current = len(w1)*len(w2)\n if current > maximum_length:\n maximum_length = current\n return maximum_length\n ","runtime":"6270"},{"code":"from typing import List\n\nclass Solution:\n def no_common_letters(self, word1: str, word2: str) -> bool:\n # Convert words to sets of characters\n set1 = set(word1)\n set2 = set(word2)\n # Check if intersection is empty\n return set1.isdisjoint(set2)\n\n def maxProduct(self, words: List[str]) -> int:\n max_product = 0\n n = len(words)\n for i in range(n):\n for j in range(i + 1, n):\n if self.no_common_letters(words[i], words[j]):\n product = len(words[i]) * len(words[j])\n if product > max_product:\n max_product = product\n return max_product","runtime":"6270"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words) \n max_prod = 0\n sety = [set(x) for x in words]\n for i in range(n):\n for j in range(i+1,n):\n if not(sety[i] & sety[j]):\n max_prod = max(max_prod, len(words[i] * len(words[j])))\n return max_prod\n ","runtime":"6357"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n c=0\n for i in range(len(words)):\n for j in range(i+1,len(words)):\n a=words[i]\n b=words[j]\n ans=True\n for k in a:\n if k not in b:\n continue\n else:\n ans=False\n break\n if ans==True:\n m=len(a)*len(b)\n if m>c:\n c=m\n return c","runtime":"6357"},{"code":"class Solution:\n def no_common_letters(self,word1: str, word2: str) -> bool:\n set1 = set(word1)\n set2 = set(word2)\n return set1.isdisjoint(set2)\n\n def maxProduct(self, words: List[str]) -> int:\n current=[]\n val=0\n for i in range(len(words)):\n for j in range(i+1,len(words)):\n if self.no_common_letters(words[i],words[j])==True and len(words[i])*len(words[j])>val:\n val=len(words[i])*len(words[j])\n \n return val\n\n\n \n ","runtime":"6444"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n mx = 0\n char_set = [set(words[i]) for i in range(len(words))]\n for i in range(len(words)):\n for j in range(i+1,len(words)):\n if i!=j:\n if len(char_set[i].intersection(char_set[j]))==0:\n mx = max(mx,len(words[i]*len(words[j])))\n\n\n return mx\n\n\n ","runtime":"6444"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n maxP = 0\n\n sortedW = sorted(words,key=lambda x : len(x),reverse=True)\n\n for i in range(len(sortedW)):\n for j in range(i+1, len(sortedW)):\n if maxP == 0:\n if not set(sortedW[i]).intersection(set(sortedW[j])):\n maxP = max(maxP, len(sortedW[i])*len(sortedW[j]))\n else:\n need_length = maxP//len(sortedW[i]) \n if len(sortedW[j]) < need_length:\n break\n else:\n if not set(sortedW[i]).intersection(set(sortedW[j])):\n maxP = max(maxP, len(sortedW[i])*len(sortedW[j]))\n\n return maxP","runtime":"6531"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n def helper(word):\n bits = 0\n for ch in word:\n bits |= 1 << ord(ch) - ord(\"a\")\n return bits\n\n ans = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if len(words[i]) * len(words[j]) <= ans:\n continue\n val = helper(words[i]) & helper(words[j])\n if not val:\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans","runtime":"6531"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n l = len(words)\n m = 0\n for i in range(l):\n for j in range(i+1,l):\n if set(words[i])&set(words[j])==set():\n m = max(m,len(words[i])*len(words[j]))\n return m","runtime":"6705"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n return max([len(s1) * len(s2) for s1, s2 in combinations(words, 2) if not (set(s1) & set(s2))], default=0)","runtime":"6705"},{"code":"class Solution:\n def maxProduct(self, w: List[str]) -> int:\n q=[]\n for i in range(len(w)-1):\n for j in range(i+1,len(w)):\n r=set(w[i]).intersection(set(w[j]))\n if len(r)==0:\n q.append(len(w[i])*len(w[j]))\n if q==[]:\n return 0\n return max(q)","runtime":"6793"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n \n def get_bitmask(s):\n ret = 0\n for c in s:\n ret |= 1 << (ord(c) - ord('a'))\n return ret\n \n words.sort(key=len, reverse=True)\n bitmasks = {}\n\n ans = 0\n for i, w in enumerate(words):\n if ans >= len(w) * len(w):\n break\n for j in range(i + 1, len(words)):\n product = len(w) * len(words[j])\n if ans >= product:\n break\n if not bitmasks.setdefault(w, get_bitmask(w)) & bitmasks.setdefault(words[j], get_bitmask(words[j])):\n ans = product\n break\n return ans","runtime":"6793"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n product = 0\n for i in range(n):\n for j in range(i + 1, n):\n if not set(words[i]) & set(words[j]):\n product = max(product, len(words[i]) * len(words[j]))\n\n return product\n\n ","runtime":"6880"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n m=len(words)\n if m==0:\n return 0\n max_len=0\n for i in range(m):\n j=m-1\n while j>i:\n if not bool(set(words[i]) & set(words[j])):\n max_len=max(max_len,len(words[i])*len(words[j]))\n j=j-1\n return max_len","runtime":"6880"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n large=0\n for i in range(len(words)):\n for j in range(i+1,len(words)):\n if len(set(words[i]).intersection(words[j]))!=0:\n pass\n else:\n if large<=len(words[i])*len(words[j]) and words[i]!=words[j]:\n large=len(words[i])*len(words[j])\n print(large)\n return large\n","runtime":"6967"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n ans = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n flag = True\n for k in words[i]:\n if k in words[j]:\n flag = False\n break\n if flag:\n ans = max(ans, len(words[i]) * len(words[j]))\n return ans\n","runtime":"6967"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n from collections import defaultdict\n\n ans = 0\n\n bitmap = defaultdict(str)\n for word in words:\n val = [\"0\"]* 26\n for x in range(len(word)):\n idx = ord(word[x]) - ord('a')\n val[idx] = \"1\"\n bitmap[word] = ''.join(val)\n \n print(bitmap)\n\n\n def check(bit1, bit2):\n match = True\n # print(bit1,bit2)\n for x in range(len(bit1)):\n if bit1[x] == \"1\" and bit2[x] == \"1\":\n match = False\n return match\n\n \n for word1 in words:\n for word2 in words:\n if check(bitmap[word1], bitmap[word2]) == True:\n ans = max(len(word1)*len(word2), ans)\n return ans","runtime":"7054"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n m = 0\n word = sorted(words,key = len)[::-1]\n for i in range(len(words)):\n for j in range(i,len(words)):\n if(i==j):\n continue\n if(set(words[i]).intersection(set(words[j])) == set()):\n m = max(m,len(words[i])*len(words[j]))\n \n return m","runtime":"7054"}],"string":"[\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def mask(w):\\n ret = 0\\n for c in set(w):\\n b = ord(c)-ord('a')\\n ret |= 1<<b\\n return ret\\n lens = defaultdict(int)\\n for w in words:\\n m = mask(w)\\n lens[m] = max(lens[m], len(w))\\n keys = list(lens.keys())\\n best = 0\\n for i in range(len(keys)):\\n m = keys[i]\\n l = lens[m]\\n for j in range(i):\\n m2 = keys[j]\\n if m & m2 == 0: \\n best = max(best, l * lens[m2])\\n return best\\n\\n raw_words = words\\n words = [tuple(set(w)) for w in words]\\n charmap = defaultdict(set)\\n for i, w in enumerate(words):\\n for c in w:\\n charmap[c].add(i)\\n best = 0\\n for i in range(len(words)):\\n w = words[i]\\n relevant = set(range(i))\\n for c in w:\\n relevant.difference_update(charmap[c])\\n l = len(raw_words[i])\\n for j in relevant:\\n best = max(best, l*len(raw_words[j]))\\n return best\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # share NO common letters\\n #forall c in w, c not in w2\\n # DO share -> check dict for each letter\\n # can collect a set of indices to not include O(n)*26\\n # then iterate through the complement O(n)\\n # track product O(1)\\n # have to do that for each word O(n), so O(n^2)\\n \\n # bit mask solution\\n # each word is a 26bit int\\n # O(1) to check if 2 words share, so just do a direct comparison\\n def mask(w):\\n ret = 0\\n for c in set(w):\\n b = ord(c)-ord('a')\\n ret |= 1<<b\\n return ret\\n lens = defaultdict(int)\\n for w in words:\\n m = mask(w)\\n lens[m] = max(lens[m], len(w))\\n# masks = [(mask(w), len(w)) for w in words]\\n# for m, l in masks:\\n# lens[m] = max(lens[m], l)\\n keys = list(lens.keys())\\n best = 0\\n for i in range(len(keys)):\\n m = keys[i]\\n l = lens[m]\\n for j in range(i):\\n m2 = keys[j]\\n if m & m2 == 0: #masks[i] & masks[j] == 0:\\n best = max(best, l * lens[m2])\\n return best\\n\\n raw_words = words\\n words = [tuple(set(w)) for w in words]\\n # print(words)\\n charmap = defaultdict(set)\\n for i, w in enumerate(words):\\n for c in w:\\n charmap[c].add(i)\\n best = 0\\n for i in range(len(words)):\\n w = words[i]\\n relevant = set(range(i))\\n for c in w:\\n relevant.difference_update(charmap[c])\\n # print(''.join(w), [raw_words[j] for j in relevant])\\n l = len(raw_words[i])\\n for j in relevant:\\n best = max(best, l*len(raw_words[j]))\\n return best\\n\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n \\\"\\\"\\\"\\n brute force is to do O(n2) + O(k2) where k is average length of string\\n\\n 2. O(n2) + we convert each string into set and do set intersection to find no overlap\\n\\n 3. O(n2) + we use bitmask to represent each string and do an & \\n \\\"\\\"\\\"\\n\\n bitmasks = {}\\n bit_number = lambda ch : ord(ch) - ord('a')\\n for s in words:\\n bits = 0\\n cnt = 0\\n for c in s:\\n bits |= 1 << (ord(c) - ord('a'))\\n cnt+=1\\n if bits in bitmasks:\\n bitmasks[bits] = max(bitmasks[bits], cnt)\\n else:\\n bitmasks[bits] = cnt\\n #print(bitmasks)\\n ans = 0\\n for a in bitmasks:\\n for b in bitmasks:\\n if a &b == 0:\\n ans = max(ans, bitmasks[a]*bitmasks[b])\\n return ans\\n\\n \",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # share NO common letters\\n #forall c in w, c not in w2\\n # DO share -> check dict for each letter\\n # can collect a set of indices to not include O(n)*26\\n # then iterate through the complement O(n)\\n # track product O(1)\\n # have to do that for each word O(n), so O(n^2)\\n \\n # bit mask solution\\n # each word is a 26bit int\\n # O(1) to check if 2 words share, so just do a direct comparison\\n def mask(w):\\n ret = 0\\n for c in w:\\n b = ord(c)-ord('a')\\n ret |= 1<<b\\n return ret\\n lens = defaultdict(int)\\n for w in words:\\n m = mask(w)\\n lens[m] = max(lens[m], len(w))\\n# masks = [(mask(w), len(w)) for w in words]\\n# for m, l in masks:\\n# lens[m] = max(lens[m], l)\\n keys = list(lens.keys())\\n best = 0\\n for i in range(len(keys)):\\n m = keys[i]\\n l = lens[m]\\n for j in range(i):\\n m2 = keys[j]\\n if m & m2 == 0: #masks[i] & masks[j] == 0:\\n best = max(best, l * lens[m2])\\n return best\\n\\n raw_words = words\\n words = [tuple(set(w)) for w in words]\\n # print(words)\\n charmap = defaultdict(set)\\n for i, w in enumerate(words):\\n for c in w:\\n charmap[c].add(i)\\n best = 0\\n for i in range(len(words)):\\n w = words[i]\\n relevant = set(range(i))\\n for c in w:\\n relevant.difference_update(charmap[c])\\n # print(''.join(w), [raw_words[j] for j in relevant])\\n l = len(raw_words[i])\\n for j in relevant:\\n best = max(best, l*len(raw_words[j]))\\n return best\\n\",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n bit_mask = [0] * len(words)\\n length = [0] * len(words)\\n\\n for i in range(len(words)):\\n for j in words[i]:\\n bit_mask[i] |= 1<<(ord(j)-ord('a'))\\n\\n length[i] = len(words[i])\\n\\n maxV = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n if not (bit_mask[i] & bit_mask[j]):\\n maxV = max(maxV, length[i]*length[j])\\n \\n return maxV\",\n \"runtime\": \"346\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n bitReps = []\\n\\n for word in words:\\n bitRep = 0\\n\\n for c in word:\\n bitRep |= 1 << (ord(c) - ord('a'))\\n\\n bitReps.append(bitRep)\\n\\n curMax = 0\\n\\n for i in range(len(bitReps)):\\n for j in range(i):\\n if bitReps[i] & bitReps[j] == 0:\\n curMax = max(curMax, len(words[i]) * len(words[j])) \\n \\n return curMax\",\n \"runtime\": \"346\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = []\\n for word in words:\\n bit = 0\\n for char in word:\\n num = ord(char) - 97\\n \\n bit = bit | int( 2 ** ( num ) )\\n ans.append(bit)\\n # print(ans)\\n MaxLength = 0\\n for ind in range(len(ans)-1):\\n for ind1 in range(ind+1,len(ans)):\\n if ans[ind] & ans[ind1] == 0:\\n MaxLength = max(MaxLength,len(words[ind]) * len(words[ind1]))\\n return MaxLength\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n char_set = [set(words[i]) for i in range(n)] # precompute hashset for each word\\n bit_mask = [0] * n\\n for i in range(n):\\n for char in words[i]:\\n bit_mask[i] |= 1 << (ord(char) - ord('a'))\\n \\n max_val = 0\\n for i in range(n):\\n for j in range(i + 1, n):\\n if not (bit_mask[i] & bit_mask[j]): # if nothing common\\n max_val = max(max_val, len(words[i]) * len(words[j]))\\n \\n return max_val\\n \",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class Solution:\\n # word -> bitmask\\n # bitmask and takes O(1)\\n # O(N^2)\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n bitmasks = []\\n for word in words:\\n bitmasks.append(self._bitmask(word))\\n \\n max_product = 0\\n for i in range(n):\\n for j in range(n):\\n if i == j or (bitmasks[i] & bitmasks[j]):\\n continue\\n max_product = max(max_product, len(words[i]) * len(words[j]))\\n \\n return max_product\\n\\n\\n \\n def _bitmask(self, word: str) -> int:\\n bitmask = 0\\n for c in word:\\n bitmask = bitmask | (1 << (ord(c) - ord('a')))\\n \\n return bitmask\",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n max_product = 0\\n letter_to_words = defaultdict(set)\\n for word in words:\\n for c in word:\\n letter_to_words[c].add(word)\\n for word in words:\\n candidates = self._get_candidates(word, letter_to_words, words)\\n for cand in candidates:\\n max_product = max(max_product, len(word)*len(cand))\\n return max_product\\n\\n def _get_candidates(self, word, letter_to_words, words):\\n candidates = set(words)\\n for letter in word:\\n candidates = candidates - letter_to_words[letter]\\n return candidates\",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n charBitMap = {}\\n for i in range(26):\\n charBitMap[chr(ord('a') + i)] = 2**i\\n wordBitMap = {}\\n for word in words:\\n bitMap = 0\\n for char in word:\\n bitMap |= charBitMap[char]\\n wordBitMap[word] = bitMap\\n maxLenProduct = 0\\n for word1 in words:\\n for word2 in words:\\n if wordBitMap[word1] & wordBitMap[word2] == 0:\\n maxLenProduct = max(maxLenProduct, len(word1) * len(word2))\\n return maxLenProduct\",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n bit_map = {}\\n for w in words:\\n bit = 0\\n for c in w:\\n bit |= 1 << ord(c) - ord(\\\"a\\\")\\n bit_map[w] = bit\\n\\n result = 0\\n for w1 in words:\\n for w2 in words:\\n if not bit_map[w1] & bit_map[w2]:\\n result = max(len(w1) * len(w2), result)\\n\\n return result\\n\",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n d = defaultdict(int)\\n mask = defaultdict(int)\\n for w in words:\\n for ch in w:\\n mask[w] |= 1<<(ord(ch)-97)\\n\\n def hasSimilar(s,t):\\n if mask[s] & mask[t]:\\n return True\\n return False\\n n = len(words)\\n for i in range(n):\\n w = words[i]\\n N = len(w)\\n for j in range(i+1,n): \\n v = words[j]\\n M = len(v)\\n if not hasSimilar(w,v):\\n d[N] = max(d[N], M)\\n res = 0\\n \\n for i in d:\\n res = max(res, i*d[i])\\n return res\\n\",\n \"runtime\": \"695\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0\\n temp = []\\n\\n for word in words:\\n temp.append({\\\"word\\\": word, \\\"letters\\\": {}})\\n for l in word:\\n temp[-1][\\\"letters\\\"][l] = True\\n \\n for i in range(len(temp)):\\n for y in range(i + 1, len(temp)):\\n fine = True\\n if len(temp[i][\\\"word\\\"]) * len(temp[y][\\\"word\\\"]) <= ans:\\n continue\\n for l in temp[i][\\\"word\\\"]:\\n if l in temp[y][\\\"letters\\\"]:\\n fine = False\\n break\\n if fine and len(temp[i][\\\"word\\\"]) * len(temp[y][\\\"word\\\"]) > ans:\\n ans = len(temp[i][\\\"word\\\"]) * len(temp[y][\\\"word\\\"])\\n \\n return ans\\n\",\n \"runtime\": \"695\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n freqs = [set() for i in words]\\n for i in range(len(words)):\\n for c in words[i]:\\n freqs[i].add(c)\\n \\n # print(freqs)\\n max_prod = 0\\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n for c in 'abcdefghijklmnopqrstuvwxyz':\\n if c in freqs[i] and c in freqs[j]:\\n break\\n else:\\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\\n return max_prod\",\n \"runtime\": \"782\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n char_set = [set(word) for word in words]\\n ret = 0\\n for i in range(n):\\n for j in range(i + 1, n):\\n if not char_set[i] & char_set[j]:\\n ret = max(ret, len(words[i]) * len(words[j]))\\n return ret\\n \",\n \"runtime\": \"782\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n \\n cache = dict()\\n for w in words:\\n cache[w] = set(w)\\n\\n n = len(words)\\n ans = 0\\n for idx in range(n):\\n for idx_2 in range(idx + 1, n):\\n if not (cache[words[idx]] & cache[words[idx_2]]):\\n # no common letters\\n ans = max(ans, len(words[idx]) * len(words[idx_2]))\\n return ans\",\n \"runtime\": \"869\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n \\n ret = 0\\n word_set = []\\n for i in range(len(words)):\\n word_set.append((len(words[i]),set(words[i])))\\n\\n print(word_set)\\n for i in range(len(word_set)):\\n len1,word1 = word_set[i]\\n for j in range(i+1,len(word_set)):\\n len2,word2 = word_set[j]\\n\\n if not bool(word1 & word2):\\n # print(len1,words[i],len2,words[j])\\n ret = max(ret,len1*len2)\\n\\n return ret\\n \\n\\n\\n\",\n \"runtime\": \"869\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n max_val = 0\\n new_set = []\\n for word in words:\\n new_set.append(set(word))\\n for i in range(len(new_set)-1):\\n for j in range(i+1, len(new_set)):\\n if len(new_set[i].intersection(new_set[j])) == 0:\\n max_val = max(max_val, len(words[i])*len(words[j]))\\n \\n return max_val\\n\\n\",\n \"runtime\": \"956\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words=[(set(words[i]),len(words[i])) for i in range(len(words))]\\n count=0\\n for i in range(len(words)):\\n for j in range(i):\\n if len(set.intersection(words[i][0],words[j][0]))==0:\\n count=max(count,words[i][1]*words[j][1])\\n return count\\n\\n \",\n \"runtime\": \"956\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n diff_map = {}\\n\\n for word in words:\\n diff_map[word] = 0\\n\\n\\n\\n for word in diff_map.keys():\\n \\n for word2 in words:\\n if word2 == word:\\n continue\\n \\n for i in range(len(word2)):\\n if word2[i] in word:\\n break\\n elif i == len(word2) - 1:\\n diff_map[word] = max(diff_map[word], len(word2))\\n\\n max_len = 0\\n for word, lens in diff_map.items():\\n curr_len = len(word)\\n if lens:\\n max_len = max(max_len, curr_len * lens)\\n\\n return max_len\\n\\n\\n\\n\",\n \"runtime\": \"1043\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n diff_map = {}\\n\\n for word in words:\\n diff_map[word] = 0\\n\\n\\n\\n for word in diff_map.keys():\\n \\n for word2 in words:\\n if word2 == word:\\n continue\\n \\n for i in range(len(word2)):\\n if word2[i] in word:\\n break\\n elif i == len(word2) - 1:\\n diff_map[word] = max(diff_map[word], len(word2))\\n\\n max_len = 0\\n for word, lens in diff_map.items():\\n curr_len = len(word)\\n if lens:\\n max_len = max(max_len, curr_len * lens)\\n\\n return max_len\\n\\n\\n\\n\",\n \"runtime\": \"1043\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n result = 0\\n map = {}\\n\\n for i in range(len(words) - 1):\\n for j in range(i + 1, len(words)):\\n one, two = words[i], words[j]\\n\\n if one not in map:\\n map[one] = set(one)\\n if two not in map:\\n map[two] = set(two)\\n\\n if map[one].intersection(map[two]):\\n continue\\n\\n prod = len(one) * len(two)\\n if prod > result:\\n result = prod\\n\\n return result\",\n \"runtime\": \"1130\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def common(chars1, chars2):\\n for c1, c2 in zip(chars1, chars2):\\n if c1 and c2: return True\\n return False\\n chars, ans = [[False]*26 for i in range(len(words))], 0\\n for i, word in enumerate(words):\\n for ch in word:\\n chars[i][ord(ch) - ord('a')] = True\\n for j in range(i):\\n if not common(chars[i], chars[j]):\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\",\n \"runtime\": \"1130\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words_compressed = []\\n for w in words:\\n w_list = [False] * 26\\n for char in w:\\n w_list[ord(char) - 97] = True\\n words_compressed.append(w_list)\\n ans = 0\\n for i in range(len(words) - 1):\\n for j in range(i + 1, len(words)):\\n is_intersect = False\\n for a, b in zip(words_compressed[i], words_compressed[j]):\\n if a == True and b == True:\\n is_intersect = True\\n break\\n if not is_intersect:\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\",\n \"runtime\": \"1217\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def hasCommon(a, b):\\n for ch in ascii_lowercase:\\n if ch in a and ch in b:\\n return True\\n \\n return False\\n\\n mp = {}\\n\\n for w in words:\\n mpc = defaultdict(bool)\\n for ch in w:\\n mpc[ch] = True\\n mp[w] = mpc\\n \\n\\n n = len(words)\\n ans = 0\\n\\n for i in range(n):\\n for j in range(i+1, n):\\n w1, w2 = words[i], words[j]\\n l1, l2 = len(w1), len(w2)\\n\\n c1, c2 = mp[w1], mp[w2]\\n\\n if not hasCommon(c1, c2):\\n ans = max(ans, l1 * l2)\\n \\n return ans\\n\",\n \"runtime\": \"1217\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def compareAlphas(a1, a2):\\n for count1, count2 in zip(a1, a2):\\n if count1 > 0 and count2 > 0:\\n return False\\n return True\\n alpha = [[0] * 26 for _ in range(len(words))]\\n for i, word in enumerate(words):\\n for j, c in enumerate(word):\\n char = ord(c) - ord('a')\\n alpha[i][char] += 1\\n n = len(words)\\n currMax = 0\\n for i in range(n):\\n for j in range(i+1,n):\\n if compareAlphas(alpha[i], alpha[j]):\\n currMax = max(\\n len(words[i]) * len(words[j]),\\n currMax\\n )\\n return currMax\",\n \"runtime\": \"1305\"\n },\n {\n \"code\": \"ALPHABET_SIZE = 26\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n res = 0\\n\\n words.sort(key=len, reverse=True)\\n\\n contains = []\\n for word in words:\\n contains.append([False] * ALPHABET_SIZE)\\n for char in word:\\n contains[-1][ord(char) - ord('a')] = True\\n\\n def overlap(i: int, j: int) -> bool:\\n for c1, c2 in zip(contains[i], contains[j]):\\n if c1 and c2:\\n return True\\n\\n return False\\n\\n for i, word1 in enumerate(words):\\n for j, word2 in enumerate(words):\\n prod = len(word1) * len(word2)\\n if prod > res and not overlap(i, j):\\n res = prod\\n\\n\\n\\n return res\",\n \"runtime\": \"1305\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words.sort(key=len, reverse=True)\\n memo = {}\\n\\n ans = 0\\n for i, w in enumerate(words):\\n first_l = len(w)\\n if ans >= first_l * first_l:\\n break\\n first = set(w)\\n for j in range(i + 1, len(words)):\\n product = first_l * len(words[j])\\n if ans >= product:\\n break\\n second = set(words[j])\\n if not first.intersection(second):\\n ans = product\\n return ans\",\n \"runtime\": \"1392\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n wordSet = [set(word) for word in words]\\n res = 0\\n for i in range(len(words)):\\n for j in range(len(words)):\\n if not wordSet[i] & wordSet[j]:\\n res = max(res, len(words[i]) * len(words[j]))\\n\\n return res\",\n \"runtime\": \"1392\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n sets = {}\\n max_product = 0\\n\\n for word in words:\\n sets[word] = set(list(word))\\n\\n for i, word1 in enumerate(words):\\n for j, word2 in enumerate(words[i + 1:]):\\n if len(sets[word1].union(sets[word2])) == len(sets[word1]) + len(sets[word2]):\\n max_product = max(max_product, len(word1) * len(word2))\\n\\n return max_product\\n \",\n \"runtime\": \"1479\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n compressed = [\\\"\\\".join(set(x)) for x in words]\\n maxProd = 0\\n\\n for i in range(len(words)):\\n for j in range(i, len(words)):\\n if set(compressed[i]).isdisjoint(set(compressed[j])):\\n maxProd = max(maxProd, len(words[i]) * len(words[j]))\\n\\n return maxProd\\n\\n\\n\\n# Input:\\n# - words: List[str]\\n\\n# Output:\\n# - maxProd: int # product of length of two words that do not shar common letters\\n\\n# Example:\\n# words = [\\\"aaadv\\\", \\\"ioqsd\\\", \\\"ionq\\\", \\\"ajpm\\\", \\\"mljqmhrtq\\\"]\\n# [\\\"adv\\\", io\\\"\\\"]\\n# maxProd = 45\\n\\n# result\\n\\n# {\\n# \\\"a\\\" -> [0, 3]\\n# \\\"d\\\" -> [0, 1]\\n# \\\"v\\\" -> [0]\\n\\n# }\\n\\n# 0 ->\\n\\n\\n\",\n \"runtime\": \"1479\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words1 = [set(i) for i in words]\\n res = 0\\n for i in range(len(words)):\\n for j in range(len(words)):\\n if not words1[i] & words1[j]:\\n tmp = len(words[i]) * len(words[j])\\n res = max(res, tmp)\\n return res\\n \",\n \"runtime\": \"1566\"\n },\n {\n \"code\": \"from typing import NamedTuple\\n\\nclass WordStats(NamedTuple):\\n length: int\\n char_set: set\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n opt = 0\\n stats = {\\n i: WordStats(len(word), set(word)) for i, word in enumerate(words)\\n }\\n\\n for i, (i_length, i_chars) in stats.items():\\n for j, (j_length, j_chars) in stats.items():\\n if not (i_chars & j_chars):\\n opt = max(opt, i_length * j_length)\\n \\n return opt\\n \",\n \"runtime\": \"1566\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n d={}\\n res=0\\n store={}\\n for i in range(len(words)):\\n l=set()\\n for m in words[i]:\\n l.add(m)\\n nw=\\\"\\\"\\n for tm in l:\\n nw=nw+tm\\n store[i]=len(words[i])\\n words[i]=nw\\n for i in range(97,123):\\n d[chr(i)]=False\\n for i in range(len(words)):\\n td=copy.deepcopy(d)\\n for k in words[i]:\\n td[k]=True\\n for j in range(i+1,len(words)):\\n flag=1\\n for o in words[j]:\\n if td[o]==True:\\n flag=0\\n if flag==1:\\n res=max(res,store[i]*store[j])\\n return res\\n \\n \\n \\n \",\n \"runtime\": \"1653\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n store = []\\n for word in words:\\n tmp = 0\\n for i in word:\\n tmp |= 1 << (ord(i) - 97)\\n store.append(tmp)\\n res = 0\\n for i in range(0, n):\\n for j in range(i + 1, n):\\n for k in range(0, 26):\\n if (store[i] & (1 << k)) & (store[j] & (1 << k)):\\n break\\n else:\\n res = max(res, len(words[i]) * len(words[j]))\\n return res\",\n \"runtime\": \"1653\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n lookup = collections.defaultdict(set)\\n\\n for word in words:\\n lookup[word] = set(word)\\n\\n maximumFound = 0\\n\\n for word in words:\\n for otherWord in words:\\n if len(lookup[word] & lookup[otherWord]) == 0:\\n maximumFound = max(maximumFound, len(word) * len(otherWord))\\n \\n return maximumFound\\n \\n\",\n \"runtime\": \"1740\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def shared(mask1, mask2):\\n for i in range(26):\\n if (mask1 >> i) & 1 == (mask2 >> i) & 1 == 1:\\n return True\\n\\n return False\\n\\n def toMask(word):\\n mask = 0\\n for char in word:\\n index = ord(char) - ord('a')\\n mask = mask | (1 << index)\\n\\n return mask\\n\\n n = len(words)\\n masks = [0]*n\\n for i, word in enumerate(words):\\n masks[i] = toMask(word)\\n\\n ans = 0\\n for i in range(n):\\n for j in range(i + 1, n):\\n if not shared(masks[i], masks[j]):\\n ans = max(ans, len(words[i])*len(words[j]))\\n\\n return ans\",\n \"runtime\": \"1740\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n lookup = {}\\n for w in words:\\n lookup[w] = set(w)\\n \\n def dont_share(s,t):\\n if lookup[s]&lookup[t]:\\n return False\\n return True\\n\\n mx = 0\\n for i in words:\\n for j in words:\\n if dont_share(i,j):\\n mx = max(mx,len(i)*len(j))\\n \\n return mx\",\n \"runtime\": \"1827\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n hashmap=defaultdict(set)\\n for word in words:\\n hashmap[word]=set(word)\\n def not_sharing_common_characters(i,j):\\n if hashmap[i] & hashmap[j]:\\n return False\\n return True \\n max_product=0\\n for i in words:\\n for j in words:\\n if not_sharing_common_characters(i,j):\\n max_product=max(max_product,len(i)*len(j))\\n return max_product\",\n \"runtime\": \"1827\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n counters = {}\\n \\n for i in range(len(words)):\\n counters[i] = Counter(words[i])\\n \\n maxProd = 0\\n \\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n elig = 1\\n for letter in counters[i]:\\n if(letter in counters[j]):\\n elig = 0\\n \\n if(elig):\\n maxProd = max(maxProd, len(words[i]) * len(words[j]))\\n \\n \\n return maxProd\\n \\n \\n \",\n \"runtime\": \"1914\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n counters = {}\\n \\n for i in range(len(words)):\\n counters[i] = Counter(words[i])\\n \\n maxProd = 0\\n \\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n elig = 1\\n for letter in counters[i]:\\n if(letter in counters[j]):\\n elig = 0\\n \\n if(elig):\\n maxProd = max(maxProd, len(words[i]) * len(words[j]))\\n \\n \\n return maxProd\\n \\n \\n \",\n \"runtime\": \"1914\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n alphabet = {}\\n cooccurences = {}\\n for word in words:\\n for letter in word:\\n if letter not in alphabet:\\n alphabet[letter] = set()\\n alphabet[letter].add(word)\\n\\n for letter in alphabet:\\n for word in alphabet[letter]:\\n if word not in cooccurences:\\n cooccurences[word] = set()\\n for coword in alphabet[letter]:\\n cooccurences[word].add(coword)\\n\\n words = sorted(words, key=len, reverse=True)\\n max_all = 0\\n \\n for i in range(len(words)):\\n for j in range(len(words)):\\n if i != j and words[j] not in cooccurences[words[i]] and words[i] not in cooccurences[words[j]]:\\n max_now = len(words[i]) * len(words[j])\\n if max_now > max_all:\\n max_all = max_now\\n\\n return max_all\",\n \"runtime\": \"2001\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # Could find all distinct pairs, then for each compute the product of lengths and take max.\\n # Or could order by largest products, and return first two that are distinct (perhaps faster).\\n n = len(words)\\n words.sort(key=lambda s:len(s), reverse=True)\\n # print(words)\\n res = 0\\n for i in range(n):\\n for j in range(i+1, n):\\n if not set(words[i]).intersection(set(words[j])):\\n res = max(res, len(words[i]) * len(words[j]))\\n break\\n return res\\n\\n \",\n \"runtime\": \"2001\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n l = [(len(w), collections.Counter(w)) for w in words]\\n l.sort(key=itemgetter(0), reverse=True)\\n\\n ret = 0\\n for i, u in enumerate(l):\\n for j in range(i + 1, len(l)):\\n if not set(u[1].keys()).intersection(set(l[j][1].keys())):\\n product = u[0] * l[j][0]\\n if product <= ret:\\n break\\n ret = product\\n return ret\",\n \"runtime\": \"2089\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n word_length = defaultdict(list)\\n for word in words:\\n word_length[len(word)].append(word)\\n\\n num_comb = []\\n for n1 in word_length:\\n for n2 in word_length:\\n if n2 < n1:\\n continue\\n heappush(num_comb, (-n1 * n2, n1, n2))\\n\\n while num_comb:\\n _, n1, n2 = heappop(num_comb)\\n words1 = word_length[n1]\\n words2 = word_length[n2]\\n for word1 in words1:\\n for word2 in words2:\\n if not self.share_letters(word1, word2):\\n return n1 * n2\\n return 0\\n\\n def share_letters(self, word1, word2):\\n return len(set(word1).intersection(word2)) > 0\",\n \"runtime\": \"2089\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n d = {word: len(word) for word in words}\\n ma = 0\\n l = list(d.keys())\\n for i in range(len(l)):\\n for j in range(i + 1, len(l)):\\n if not set(l[i]) & set(l[j]):\\n ma = max(ma, len(l[i]) * len(l[j]))\\n return ma\",\n \"runtime\": \"2176\"\n },\n {\n \"code\": \"import string\\nimport heapq\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n masks = [[False] * 26 for _ in range(len(words))]\\n for idx, word in enumerate(words):\\n for ch in word:\\n masks[idx][ord(ch) - ord('a')] = True\\n\\n def common(i, j):\\n return any(x == True and y == True for x, y in zip(masks[i], masks[j]))\\n \\n result = 0\\n for i, word in enumerate(words):\\n for j in range(i):\\n if not common(i, j):\\n result = max(result, len(word) * len(words[j]))\\n\\n return result\",\n \"runtime\": \"2263\"\n },\n {\n \"code\": \"import string\\nimport heapq\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n masks = [[False] * 26 for _ in range(len(words))]\\n for idx, word in enumerate(words):\\n for ch in word:\\n masks[idx][ord(ch) - ord('a')] = True\\n\\n def has_common(i, j):\\n return any(x == True and y == True for x, y in zip(masks[i], masks[j]))\\n \\n result = 0\\n for i, word in enumerate(words):\\n for j in range(i):\\n if not has_common(i, j):\\n result = max(result, len(word) * len(words[j]))\\n\\n return result\",\n \"runtime\": \"2263\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n \\n bitmasks = {}\\n for word in words:\\n bitmask=[0]*26\\n for char in word:\\n index=ord(char)-ord(\\\"a\\\")\\n bitmask[index]=1\\n bitmasks[word]=list(bitmask)\\n maxLength=0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n\\n bitmask1=bitmasks[words[i]]\\n bitmask2=bitmasks[words[j]]\\n \\n k=25\\n isValid=True\\n while k>=0:\\n if bitmask1[k] & bitmask2[k]:\\n isValid=False\\n break\\n k-=1\\n if isValid:\\n maxLength=max(maxLength, len(words[i])*len(words[j]))\\n\\n return maxLength\",\n \"runtime\": \"2350\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words.sort(key=len, reverse=True)\\n memo = {}\\n\\n ans = 0\\n for gap in range(1, len(words) - 1):\\n for w1, w2 in zip(words, words[gap:]):\\n product = len(w1) * len(w2)\\n if ans >= product:\\n break\\n if not memo.setdefault(w1, set(w1)).intersection(memo.setdefault(w2, set(w2))):\\n ans = product\\n break\\n return ans\",\n \"runtime\": \"2437\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n dics = [collections.Counter(word) for word in words]\\n ans = 0\\n for i in range(len(words)):\\n for j in range(i, len(words)):\\n if set(dics[i].keys()).intersection(set(dics[j].keys())) == set():\\n ans = max(len(words[i]) * len(words[j]), ans)\\n\\n return ans\\n \",\n \"runtime\": \"2524\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words.sort(key=len, reverse=True)\\n\\n ans = 0\\n for gap in range(1, len(words) - 1):\\n for w1, w2 in zip(words, words[gap:]):\\n product = len(w1) * len(w2)\\n if ans >= product:\\n break\\n if not set(w1).intersection(set(w2)):\\n ans = product\\n break\\n return ans\",\n \"runtime\": \"2611\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n mps = []\\n for w in words:\\n mps.append(set(Counter(w).keys()))\\n print(mps)\\n ans = 0\\n for i in range(len(words)):\\n for j in range(len(words)):\\n if i != j and all(True if c not in mps[i] else False for c in mps[j]):\\n ans = max(ans,len(words[i])*len(words[j]))\\n\\n return ans\\n \",\n \"runtime\": \"2698\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n res = 0\\n for index in range(len(words)):\\n for index2 in range(index+1,len(words)):\\n a,b = words[index], words[index2]\\n amount = len(a) * len(b)\\n if amount <= res:\\n continue\\n if len(set(a)) + len(set(b)) == len(set(a+b)):\\n res = max(res, amount)\\n return res\\n\",\n \"runtime\": \"2785\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n mps = []\\n for w in words:\\n mps.append(set(Counter(w).keys()))\\n print(mps)\\n ans = 0\\n for i in range(len(words)):\\n for j in range(len(words)):\\n if i != j and all(True if c not in mps[i] else False for c in mps[j]):\\n ans = max(ans,len(words[i])*len(words[j]))\\n\\n return ans\\n \",\n \"runtime\": \"2785\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0\\n chars = []\\n for word in words:\\n chars.append(set(word))\\n for i in range(len(words)):\\n for j in range(len(words)):\\n if i != j:\\n good = True\\n for k in range(26):\\n if chr(ord('a') + k) in chars[i] and chr(ord('a') + k) in chars[j]:\\n good = False\\n break\\n if good:\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\",\n \"runtime\": \"2873\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # two words that do not share common letters\\n word_options = set(words)\\n letter_to_word = defaultdict(set)\\n for word in words:\\n for c in word:\\n letter_to_word[c].add(word)\\n max_len = 0\\n word_used = ''\\n for word in word_options:\\n all_related = set()\\n for c in word:\\n all_related = all_related.union(letter_to_word[c])\\n #print(word, all_related)\\n for option in word_options:\\n if option == word or option in all_related or word_used==option:\\n continue\\n #print(option, word)\\n new_calc = len(option) * len(word)\\n if new_calc > max_len:\\n max_len = max(max_len, len(option)*len(word))\\n word_used = word\\n \\n return max_len\\n\\n \\n\\n \",\n \"runtime\": \"2873\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n sp = []\\n max_s = 0\\n max_l = 0\\n len_w = len(words)\\n for num_1, el_1 in enumerate(words):\\n word1 = set(el_1)\\n len_w = len(el_1)\\n for num_2, el_2 in enumerate(words):\\n ex = len_w * len(el_2)\\n if num_1 != num_2 and ex > max_l:\\n if word1.intersection(el_2) == set() and [el_1, el_2] not in sp:\\n curr = len(el_1) * len(el_2)\\n if curr > max_s:\\n max_s = curr\\n max_l = ex\\n\\n sp.append([el_2, el_1])\\n return max_s\",\n \"runtime\": \"2960\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words = list(set(words))\\n ans = []\\n for i in range(0,len(words)-1):\\n for j in range(i+1,len(words)):\\n if(len(set(list(words[i])).intersection(set(list(words[j]))))==0):\\n ans.append(len(list(words[i]))*len(list(words[j])))\\n if(len(ans)==0):\\n return 0\\n ans.sort(reverse=True)\\n return ans[0] \",\n \"runtime\": \"2960\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, w: List[str]) -> int:\\n w=list(set(w))\\n a=[]\\n for i in range(0,len(w)-1):\\n for j in range(i+1,len(w)):\\n if(len(set(list(w[i]))&(set(list(w[j]))))==0):\\n a.append(len(list(w[i]))*len(list(w[j])))\\n if(len(a)==0):\\n return 0\\n return max(a)\\n \",\n \"runtime\": \"3047\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n new = []\\n for word in words:\\n temp = [0] * 26\\n for letter in word:\\n temp[ord(letter) - ord(\\\"a\\\")] += 1\\n new.append(temp)\\n ans = 0\\n for i in range(len(new)):\\n for j in range(i, len(new)):\\n bad = False\\n for k in range(26):\\n if new[i][k] > 0 and new[j][k] > 0:\\n bad = True\\n if not bad:\\n ans = max(ans, sum(new[i]) * sum(new[j]))\\n return ans\\n\\n\\n\\n \",\n \"runtime\": \"3047\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n max_product = 0\\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n common_letters = False\\n for k in set(words[i]):\\n if k in words[j]:\\n common_letters = True\\n break\\n if(not common_letters):\\n max_product = max(max_product, len(words[i]) * len(words[j]))\\n return max_product\",\n \"runtime\": \"3308\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n res = 0\\n dp = [[0 for _ in range(26)] for _ in range(len(words))]\\n for i, word in enumerate(words):\\n for c in word:\\n dp[i][ord(c) - ord('a')] = 1\\n for i in range(len(words)):\\n arr_1 = dp[i]\\n for j in range(i + 1, len(words)):\\n arr_2 = dp[j]\\n has_common = False\\n for k in range(26):\\n if arr_1[k] & arr_2[k] == 1:\\n has_common = True\\n if not has_common:\\n res = max(res, len(words[i]) * len(words[j]))\\n return res\",\n \"runtime\": \"3395\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n m=0\\n for i in range(len(words)):\\n a=set(words[i])\\n for j in range(i+1,len(words)):\\n b=set(words[j])\\n if a.isdisjoint(b):\\n m=max(m,len(words[i])*len(words[j]))\\n return m\",\n \"runtime\": \"3395\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0\\n\\n for i in range(len(words)):\\n t1 = set(words[i])\\n for j in range(i + 1, len(words)):\\n t2 = set(words[j])\\n\\n if t1.isdisjoint(t2):\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\",\n \"runtime\": \"3482\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n l1=len(k1)\\n s1=set(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n l2=len(k2)\\n s2=set(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"3569\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n l1=len(k1)\\n s1=set(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n l2=len(k2)\\n s2=set(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"3569\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n l1=len(k1)\\n s1=set(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n l2=len(k2)\\n s2=set(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"3657\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n l1=len(k1)\\n s1=set(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n l2=len(k2)\\n s2=set(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"3657\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n l1=len(k1)\\n s1=set(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n l2=len(k2)\\n s2=set(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"3744\"\n },\n {\n \"code\": \"class UF:\\n def __init__(self,n):\\n self.par = [i for i in range(n)]\\n self.rank = [1]*n\\n \\n def find(self,n):\\n p = n\\n while p != self.par[p]:\\n self.par[p] = self.par[self.par[p]]\\n p = self.par[p]\\n return p\\n \\n def union(self,n1,n2):\\n p1,p2 = self.find(n1),self.find(n2)\\n if p1 == p2:\\n return\\n \\n if self.rank[p1] > self.rank[p2]:\\n self.rank[p1] += self.rank[p2]\\n self.par[p2] = p1\\n else:\\n self.rank[p2] += self.rank[p1]\\n self.par[p1] = p2\\n return \\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n #make set for each character a..z\\n # then for each word add its index to the set for each char\\n # union together each of the indexes in each set\\n\\n # for each parent get group\\n # get longest 2 per group\\n\\n n = len(words)\\n uf = UF(n)\\n\\n char_to_indices = defaultdict(set)\\n\\n for i,word in enumerate(words): # O(n*c)\\n for c in word:\\n char_to_indices[c].add(i)\\n\\n #for each word, go through chars and get all matching words\\n res = 0\\n for w in words:\\n together = set()\\n for c in w:\\n together |= char_to_indices[c]\\n \\n first = 0\\n for i in range(n):\\n if i not in together:\\n length = len(words[i])\\n if length >= first:\\n first = length\\n res = max(res,first*len(w))\\n return res\\n \\n\\n \\n \\n # for indices in char_to_indices.values():\\n # indices = list(indices)\\n # for i in range(len(indices)-1):\\n # uf.union(indices[i],indices[i+1])\\n \\n\\n # par_to_longest = defaultdict(int)\\n # for i in range(n):\\n # parent = uf.find(i)\\n # length = len(words[i])\\n # par_to_longest[parent] = min(par_to_longest[parent],length)\\n\\n # first = 0\\n # second = 0\\n\\n # for length in par_to_longest.values():\\n # if length >= first:\\n # second = first\\n # first = length\\n # elif length > second:\\n # second = length\\n return first*second\\n \\n \\n \",\n \"runtime\": \"3744\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n maxVal = 0\\n for i in range(n-1):\\n x1 = set(words[i])\\n for j in range(i+1,n):\\n y1 = set(words[j])\\n if len(x1-y1) == len(x1):\\n maxVal = max(maxVal,len(words[i])*len(words[j]))\\n return maxVal\",\n \"runtime\": \"3831\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n max_prod = 0\\n for i in range(len(words)):\\n letts1 = set(words[i])\\n for j in range(i):\\n valid = True\\n for l in words[j]:\\n if l in letts1:\\n valid = False\\n break\\n if valid:\\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\\n return max_prod\",\n \"runtime\": \"3918\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n maxx = 0\\n \\n for i in range(len(words)):\\n elem = set(words[i])\\n for j in range(i+1,len(words)):\\n flag = 0\\n for char in words[j]:\\n if char in elem:\\n flag = 1\\n break\\n if flag==0:\\n lenn = len(words[i])*len(words[j])\\n maxx = max(maxx,lenn)\\n\\n\\n return maxx\\n\\n \\n\",\n \"runtime\": \"3918\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n max_product = 0\\n iteration = len(words)\\n for i in range(iteration):\\n first_word_set = set(words[i])\\n for j in range(i,iteration): \\n second_word_set = set(words[j])\\n if not first_word_set.intersection(second_word_set):\\n max_product = max(max_product , len(words[i])* len(words[j]))\\n \\n return max_product \\n\\n \\n \",\n \"runtime\": \"4005\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n maxx = 0\\n \\n for i in range(len(words)):\\n elem = set(words[i])\\n for j in range(i+1,len(words)):\\n flag = 0\\n for char in words[j]:\\n if char in elem:\\n flag = 1\\n break\\n if flag==0:\\n lenn = len(words[i])*len(words[j])\\n maxx = max(maxx,lenn)\\n\\n\\n return maxx\\n\\n \\n\",\n \"runtime\": \"4092\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n a_code = ord('a')\\n max_length = 0\\n length = len(words)\\n for first_index in range(length - 1):\\n first_word_letters_set = set(words[first_index])\\n for second_index in range(first_index, length):\\n if first_word_letters_set.intersection(set(words[second_index])):\\n continue\\n max_length = max(max_length, len(words[first_index]) * len(words[second_index]))\\n return max_length\",\n \"runtime\": \"4092\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n maxVal = 0\\n for i in range(len(words)):\\n seti = set(words[i])\\n for j in range(i,len(words)):\\n setj = set(words[j])\\n if not seti.intersection(setj):\\n maxVal = max(maxVal,len(words[j])*len(words[i]))\\n return maxVal\\n\",\n \"runtime\": \"4179\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n max_prod = 0\\n for i in range(len(words)):\\n letts1 = set(words[i])\\n for j in range(i+1, len(words)):\\n valid = True\\n for l in words[j]:\\n if l in letts1:\\n valid = False\\n break\\n if valid:\\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\\n return max_prod\",\n \"runtime\": \"4179\"\n },\n {\n \"code\": \"class Solution:\\n def checkCommon(self, toCheck, currString):\\n\\n for char in currString:\\n if char in toCheck:\\n return False\\n \\n return True\\n def maxProduct(self, words: List[str]) -> int:\\n \\n ans = 0\\n\\n for i in range(len(words)):\\n curr = set()\\n for char in words[i]:\\n curr.add(char)\\n\\n for j in range(i + 1 , len(words)):\\n if self.checkCommon(curr, words[j]):\\n \\n ans = max(ans, len(words[i])* len(words[j]))\\n\\n \\n return ans\",\n \"runtime\": \"4266\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0 \\n for i in range(len(words)):\\n s1 = set(words[i])\\n for j in range(i+1,len(words)):\\n s2 = set(words[j])\\n inter = s1.intersection(s2)\\n if len(inter) == 0:\\n ans = max(ans,len(words[i]) * len(words[j]))\\n return ans\\n\\n \",\n \"runtime\": \"4266\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0 \\n for i in range(len(words)):\\n s1 = set(words[i])\\n for j in range(i+1,len(words)):\\n s2 = set(words[j])\\n inter = s1.intersection(s2)\\n if len(inter) == 0:\\n ans = max(ans,len(words[i]) * len(words[j]))\\n return ans\\n\\n \",\n \"runtime\": \"4353\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n \\n ans = 0\\n for i in range(len(words)):\\n set1 = set([char for char in words[i]])\\n for j in range(i+1, len(words)):\\n valid = True\\n for char in words[j]:\\n if char in set1:\\n valid = False\\n break\\n if valid:\\n ans = max(ans, len(words[i])*len(words[j]))\\n return ans\\n \\n \",\n \"runtime\": \"4441\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n res=0\\n def compare(wordset,word):\\n for letter in word:\\n if letter in wordset:\\n return False\\n return True\\n for i in range(len(words)):\\n word1set=set(list(words[i]))\\n for j in range(i+1,len(words)):\\n if compare(word1set,words[j]):\\n res=max(res,len(words[i])*len(words[j]))\\n return res\\n\",\n \"runtime\": \"4441\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n p=1\\n flag2=0\\n for i in range(len(words)):\\n d={}\\n for j in range(len(words[i])):\\n d[words[i][j]]=1\\n for j in range(i+1,len(words)):\\n flag=1\\n for k in words[j]:\\n if k in d:\\n flag=0\\n break\\n if flag==1:\\n flag2=1\\n p=max(p,len(words[i])*len(words[j]))\\n if flag2==0:\\n return 0\\n return p\",\n \"runtime\": \"4528\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ret = 0\\n for i in range(len(words)):\\n mp = {}\\n for c in words[i]:\\n mp[c] = True\\n for j in range(i+1, len(words)):\\n diff = True\\n for c in words[j]:\\n if c in mp:\\n diff = False\\n break\\n if diff:\\n ret = max(ret, len(words[i]) * len(words[j]))\\n return ret\\n \",\n \"runtime\": \"4615\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n word_counts=[]\\n ans=0\\n for w in words: \\n word_count=[0 for i in range(26)]\\n for i in w:\\n word_count[ord(i)-ord('a')]=1\\n word_counts.append(word_count)\\n for i in range(len(words)):\\n for j in range(i+1,len(words)):\\n found=True\\n for k in range(26):\\n if word_counts[i][k]==word_counts[j][k] and word_counts[i][k]==1:\\n found=False\\n if found:\\n ans=max(ans,len(words[i])*len(words[j]))\\n return ans\\n\",\n \"runtime\": \"4702\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n maxProduct = 0\\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n if(len([letter for letter in set(words[i]) if letter in words[j]]) == 0):\\n maxProduct = max( maxProduct, len(words[i]) * len(words[j]))\\n return maxProduct\",\n \"runtime\": \"4702\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n maxProduct = 0\\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n if(len([letter for letter in set(words[i]) if letter in words[j]]) == 0):\\n maxProduct = max( maxProduct, len(words[i]) * len(words[j]))\\n return maxProduct\",\n \"runtime\": \"4789\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n vocab = set(words)\\n max_product = 0\\n\\n for w in words:\\n for v in vocab:\\n if len(set(v).intersection(set(w))) == 0:\\n max_product = max(max_product, len(w)*len(v))\\n\\n return max_product\",\n \"runtime\": \"4789\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\\n test_dict = {}\\n for word in words:\\n word_list = [0 for _ in range(26)]\\n for char in word:\\n word_list[alphabet.index(char)] += 1\\n test_dict[word] = word_list\\n\\n result = 0\\n for index_one in range(len(words)):\\n for index_two in range(index_one+1,len(words)):\\n if sum(map(lambda x, y : x * y, test_dict[words[index_one]], test_dict[words[index_two]] ))==0:\\n result = max(result, len(words[index_one]) * len(words[index_two]))\\n return result\\n\",\n \"runtime\": \"4876\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n cnt = []\\n for word in words:\\n counter = Counter(word)\\n cnt.append(counter)\\n\\n print(cnt)\\n ans = 0\\n \\n n = len(words)\\n for i in range(n):\\n for j in range(n):\\n if i != j:\\n cnt1 = cnt[i]\\n cnt2 = cnt[j]\\n\\n flag = False\\n for k in range(26):\\n c = chr(ord('a') + k)\\n if cnt1[c] and cnt2[c]:\\n flag = True\\n break\\n if not flag:\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\",\n \"runtime\": \"4963\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n words.sort(key=len, reverse=True)\\n res = 0\\n for i in range(len(words)-1):\\n temp = set(list(words[i]))\\n for j in range(i+1, len(words)):\\n works = True\\n temp1 = set(list(words[j]))\\n for char in temp1:\\n if char in temp:\\n works = False\\n break\\n if works:\\n res = max(res, len(words[i]) * len(words[j]))\\n return res\",\n \"runtime\": \"5050\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # brute force\\n # iterate through all the 2-combinations\\n # if the 2 words do not have shared letters, calculate their lengths' product\\n # return the max product\\n \\n # improvement\\n # for all the words with the same letters, keep only the longest one\\n word_lengths = {}\\n for word in words:\\n word_set = frozenset(word)\\n if word_set in word_lengths:\\n word_lengths[word_set] = max(word_lengths[word_set], len(word))\\n else:\\n word_lengths[word_set] = len(word)\\n words = [word for word in words if len(word) == word_lengths[frozenset(word)]]\\n \\n max_product = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n if not set(words[i]) & set(words[j]):\\n max_product = max(max_product, len(words[i]) * len(words[j]))\\n return max_product\",\n \"runtime\": \"5137\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0\\n for i in range(len(words)-1):\\n l1 = len(words[i])\\n a = set(list(words[i]))\\n for j in range(i+1,len(words)):\\n l2 = len(words[j])\\n b = set(list(words[j]))\\n pos = True\\n for k in a:\\n if k in b:\\n pos = False\\n break\\n if pos == True:\\n ans = max(ans,l1*l2)\\n return ans\\n\\n\",\n \"runtime\": \"5225\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n k1=list(k1)\\n s1=set(k1)\\n l1=len(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n k2=list(k2)\\n s2=set(k2)\\n l2=len(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"5312\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n k1=list(k1)\\n l1=len(k1)\\n s1=set(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n k2=list(k2)\\n l2=len(k2)\\n s2=set(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"5399\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n prod = 0\\n\\n def getMask(word):\\n mask = 0\\n for char in word:\\n mask = mask | 1 << ord(char) - ord('a')\\n return mask\\n\\n masks = [getMask(word) for word in words]\\n for i in range(len(words)):\\n for j in range(i):\\n if not (masks[i] & masks[j]):\\n prod = max(prod, len(words[i] * len(words[j])))\\n\\n return prod\",\n \"runtime\": \"5486\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n i=0\\n n=len(words)\\n m=n\\n s=0\\n while n>0:\\n k1=words[i]\\n k1=list(k1)\\n s1=set(k1)\\n l1=len(k1)\\n j=i\\n while j<m:\\n k2=words[j]\\n k2=list(k2)\\n s2=set(k2)\\n l2=len(k2)\\n f=0\\n for c in s1:\\n if c in s2:\\n f=1\\n break\\n if f==0:\\n k=l1*l2\\n if k>s:\\n s=k\\n j+=1\\n i+=1\\n n-=1\\n return s\\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"5573\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n res = 0\\n\\n def generate_mask(word):\\n mask = 0\\n for c in word:\\n mask |= 1 << ord(c) - ord(\\\"a\\\")\\n return mask\\n \\n masks = [generate_mask(word) for word in words]\\n\\n for i in range(len(words)):\\n for j in range(i):\\n if not (masks[i] & masks[j]):\\n res = max(res, len(words[i]* len(words[j])))\\n \\n return res\",\n \"runtime\": \"5660\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n prod = 0\\n masks = [self.getMask(word) for word in words]\\n\\n for i in range(len(words)):\\n for j in range(i):\\n if not (masks[i] & masks[j]):\\n prod = max(prod, len(words[i] * len(words[j])))\\n\\n return prod\\n\\n def getMask(self, word):\\n mask = 0\\n for char in word:\\n mask = mask | 1 << ord(char) - ord('a')\\n return mask\",\n \"runtime\": \"5660\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n s = []\\n for i in range(len(words)):\\n s.append(0)\\n for i in range(len(words)):\\n for j in range(97,123):\\n if chr(j) in words[i]:\\n s[i] |= 1 << (j - 97)\\n maxelen = 0\\n \\n print(s)\\n for i in range(len(words)):\\n for j in range(i+1,len(words)):\\n k = s[i] & s[j]\\n if k==0:\\n maxelen=max(maxelen,len(words[i]*len(words[j])))\\n return maxelen\",\n \"runtime\": \"5747\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n mask = 0b00000011111111111111111111111111\\n c_codes = {chr(97+i): 1<<i for i in range(26)}\\n def str_to_bin(str):\\n res = 0\\n for c in str:\\n res |= c_codes[c]\\n #if res == mask:\\n # return res\\n return res\\n str_codes = [str_to_bin(str) for str in words]\\n max_len = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n if str_codes[i] & str_codes[j] == 0:\\n max_len = max(max_len, len(words[i]*len(words[j])))\\n return max_len\",\n \"runtime\": \"5747\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n mask = 0b00000011111111111111111111111111\\n c_codes = {chr(97+i): 1<<i for i in range(26)}\\n def str_to_bin(str):\\n res = 0\\n for c in str:\\n res |= c_codes[c]\\n if res == mask:\\n return res\\n return res\\n str_codes = [str_to_bin(str) for str in words]\\n max_len = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n if str_codes[i] & str_codes[j] == 0:\\n max_len = max(max_len, len(words[i]*len(words[j])))\\n return max_len\",\n \"runtime\": \"5834\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n prod = 0\\n masks = [self.getMask(word) for word in words]\\n\\n for i in range(len(words)):\\n for j in range(i):\\n if not (masks[i] & masks[j]):\\n prod = max(prod, len(words[i] * len(words[j])))\\n\\n return prod\\n\\n def getMask(self, word):\\n mask = 0\\n for char in word:\\n mask = mask | 1 << ord(char) - ord('a')\\n return mask\",\n \"runtime\": \"5834\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n sortedList = sorted(words, key=len, reverse=True)\\n max_product = 0\\n for i in range(0, len(sortedList)):\\n if (i + 1) < len(sortedList):\\n possible_max_value = len(sortedList[i]) * len(sortedList[i+1])\\n if possible_max_value < max_product:\\n break\\n for j in range(i + 1, len(sortedList)):\\n if self.are_words_ok( sortedList[i], sortedList[j]):\\n prod = len(sortedList[i]) * len(sortedList[j])\\n if prod > max_product:\\n max_product = prod\\n\\n return max_product\\n\\n def are_words_ok(self, words1, word2):\\n for c in words1:\\n if c in word2:\\n return False\\n return True\",\n \"runtime\": \"5921\"\n },\n {\n \"code\": \"class Solution:\\n def mapDicts(self,words):\\n maps={}\\n for i in range(len(words)):\\n if words[i] in maps:\\n maps[words[i]]=maps[words[i]]+1\\n else:\\n maps[words[i]]=1\\n return maps\\n def objectUnequal(self,dicts1, dicts2):\\n for key in dicts1:\\n if key in dicts2:\\n return False\\n return True\\n def mapSets(self,words):\\n return set(words)\\n def maxProduct(self, words: List[str]) -> int:\\n word_sets=[self.mapSets(word) for word in words]\\n maxProd=0\\n for i in range(len(word_sets)):\\n for j in range(i+1,len(word_sets)):\\n if self.objectUnequal(words[i],words[j]):\\n a=len(words[j])*len(words[i])\\n maxProd = max(maxProd,a)\\n \\n return maxProd\\n \",\n \"runtime\": \"5921\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n L=len(words)\\n D=dict()\\n for i in range(L):\\n for c in words[i]:\\n if c not in D: D[c]={i}\\n else: D[c].add(i)\\n \\n maxL=0\\n cSet={i for i in range(L)}\\n\\n for i in range(L):\\n v=cSet.copy()\\n for c in words[i]:\\n v=v-D[c]\\n\\n lenTgt=len(words[i])\\n for i in v:\\n wl=lenTgt*len(words[i])\\n if wl>maxL: maxL=wl\\n \\n \\n return maxL\\n\\n\",\n \"runtime\": \"6009\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n lst=[]\\n for i in words:\\n lst.append(len(i))\\n maxi=0\\n for i in range(0,len(words)):\\n pro=1\\n for j in range(i+1,len(words)):\\n if self.f(words[i],words[j]):\\n pro=lst[i]*lst[j]\\n maxi=max(maxi,pro)\\n return maxi\\n def f(self, str1,str2)->int:\\n for i in str1:\\n if i in str2:\\n return 0\\n return 1\\n \",\n \"runtime\": \"6009\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n result = 0\\n for i in range(len(words)):\\n letter = words[i]\\n for j in range(i+1, len(words)):\\n val = words[j]\\n # letter2 = set(words[j])\\n for a in val:\\n if a in letter:\\n break\\n else:\\n result = max(result, (len(letter) * len(val)))\\n return result\",\n \"runtime\": \"6096\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def no_common_letters(s1, s2):\\n for ch in s1:\\n if ch in s2:\\n return False\\n return True\\n \\n n = len(words)\\n max_prod = 0\\n for i in range(n):\\n for j in range(i + 1, n):\\n if no_common_letters(words[i], words[j]):\\n max_prod = max(max_prod, len(words[i]) * len(words[j]))\\n return max_prod\",\n \"runtime\": \"6096\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n lst = []\\n def share(word1,word2):\\n cnt = 0\\n for let in word1:\\n if let in word2:\\n cnt+=1\\n break\\n if cnt>0:\\n return True\\n else:\\n return False \\n for i in range(0,len(words)):\\n for j in range(i+1,len(words)):\\n if share(words[i],words[j])==False:\\n k = len(words[i])*len(words[j])\\n lst.append(k)\\n if len(lst)!=0:\\n return max(lst)\\n else:\\n return 0\\n \",\n \"runtime\": \"6183\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def bb(a,b):\\n for i in a:\\n if i in b:\\n return False\\n return True\\n m=0\\n for i in range(len(words)):\\n for j in range(i,len(words)):\\n if bb(words[i],words[j]):\\n m=max(m,len(words[i])*len(words[j]))\\n return m\",\n \"runtime\": \"6183\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n maximum_length = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n w1 = words[i]\\n w2 = words[j]\\n match = False\\n for ch in w1:\\n if ch in w2:\\n match = True\\n break\\n if match == False:\\n current = len(w1)*len(w2)\\n if current > maximum_length:\\n maximum_length = current\\n return maximum_length\\n \",\n \"runtime\": \"6270\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def no_common_letters(self, word1: str, word2: str) -> bool:\\n # Convert words to sets of characters\\n set1 = set(word1)\\n set2 = set(word2)\\n # Check if intersection is empty\\n return set1.isdisjoint(set2)\\n\\n def maxProduct(self, words: List[str]) -> int:\\n max_product = 0\\n n = len(words)\\n for i in range(n):\\n for j in range(i + 1, n):\\n if self.no_common_letters(words[i], words[j]):\\n product = len(words[i]) * len(words[j])\\n if product > max_product:\\n max_product = product\\n return max_product\",\n \"runtime\": \"6270\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words) \\n max_prod = 0\\n sety = [set(x) for x in words]\\n for i in range(n):\\n for j in range(i+1,n):\\n if not(sety[i] & sety[j]):\\n max_prod = max(max_prod, len(words[i] * len(words[j])))\\n return max_prod\\n \",\n \"runtime\": \"6357\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n c=0\\n for i in range(len(words)):\\n for j in range(i+1,len(words)):\\n a=words[i]\\n b=words[j]\\n ans=True\\n for k in a:\\n if k not in b:\\n continue\\n else:\\n ans=False\\n break\\n if ans==True:\\n m=len(a)*len(b)\\n if m>c:\\n c=m\\n return c\",\n \"runtime\": \"6357\"\n },\n {\n \"code\": \"class Solution:\\n def no_common_letters(self,word1: str, word2: str) -> bool:\\n set1 = set(word1)\\n set2 = set(word2)\\n return set1.isdisjoint(set2)\\n\\n def maxProduct(self, words: List[str]) -> int:\\n current=[]\\n val=0\\n for i in range(len(words)):\\n for j in range(i+1,len(words)):\\n if self.no_common_letters(words[i],words[j])==True and len(words[i])*len(words[j])>val:\\n val=len(words[i])*len(words[j])\\n \\n return val\\n\\n\\n \\n \",\n \"runtime\": \"6444\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n mx = 0\\n char_set = [set(words[i]) for i in range(len(words))]\\n for i in range(len(words)):\\n for j in range(i+1,len(words)):\\n if i!=j:\\n if len(char_set[i].intersection(char_set[j]))==0:\\n mx = max(mx,len(words[i]*len(words[j])))\\n\\n\\n return mx\\n\\n\\n \",\n \"runtime\": \"6444\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n maxP = 0\\n\\n sortedW = sorted(words,key=lambda x : len(x),reverse=True)\\n\\n for i in range(len(sortedW)):\\n for j in range(i+1, len(sortedW)):\\n if maxP == 0:\\n if not set(sortedW[i]).intersection(set(sortedW[j])):\\n maxP = max(maxP, len(sortedW[i])*len(sortedW[j]))\\n else:\\n need_length = maxP//len(sortedW[i]) \\n if len(sortedW[j]) < need_length:\\n break\\n else:\\n if not set(sortedW[i]).intersection(set(sortedW[j])):\\n maxP = max(maxP, len(sortedW[i])*len(sortedW[j]))\\n\\n return maxP\",\n \"runtime\": \"6531\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n def helper(word):\\n bits = 0\\n for ch in word:\\n bits |= 1 << ord(ch) - ord(\\\"a\\\")\\n return bits\\n\\n ans = 0\\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n if len(words[i]) * len(words[j]) <= ans:\\n continue\\n val = helper(words[i]) & helper(words[j])\\n if not val:\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\",\n \"runtime\": \"6531\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n l = len(words)\\n m = 0\\n for i in range(l):\\n for j in range(i+1,l):\\n if set(words[i])&set(words[j])==set():\\n m = max(m,len(words[i])*len(words[j]))\\n return m\",\n \"runtime\": \"6705\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n return max([len(s1) * len(s2) for s1, s2 in combinations(words, 2) if not (set(s1) & set(s2))], default=0)\",\n \"runtime\": \"6705\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, w: List[str]) -> int:\\n q=[]\\n for i in range(len(w)-1):\\n for j in range(i+1,len(w)):\\n r=set(w[i]).intersection(set(w[j]))\\n if len(r)==0:\\n q.append(len(w[i])*len(w[j]))\\n if q==[]:\\n return 0\\n return max(q)\",\n \"runtime\": \"6793\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n \\n def get_bitmask(s):\\n ret = 0\\n for c in s:\\n ret |= 1 << (ord(c) - ord('a'))\\n return ret\\n \\n words.sort(key=len, reverse=True)\\n bitmasks = {}\\n\\n ans = 0\\n for i, w in enumerate(words):\\n if ans >= len(w) * len(w):\\n break\\n for j in range(i + 1, len(words)):\\n product = len(w) * len(words[j])\\n if ans >= product:\\n break\\n if not bitmasks.setdefault(w, get_bitmask(w)) & bitmasks.setdefault(words[j], get_bitmask(words[j])):\\n ans = product\\n break\\n return ans\",\n \"runtime\": \"6793\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n product = 0\\n for i in range(n):\\n for j in range(i + 1, n):\\n if not set(words[i]) & set(words[j]):\\n product = max(product, len(words[i]) * len(words[j]))\\n\\n return product\\n\\n \",\n \"runtime\": \"6880\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n m=len(words)\\n if m==0:\\n return 0\\n max_len=0\\n for i in range(m):\\n j=m-1\\n while j>i:\\n if not bool(set(words[i]) & set(words[j])):\\n max_len=max(max_len,len(words[i])*len(words[j]))\\n j=j-1\\n return max_len\",\n \"runtime\": \"6880\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n large=0\\n for i in range(len(words)):\\n for j in range(i+1,len(words)):\\n if len(set(words[i]).intersection(words[j]))!=0:\\n pass\\n else:\\n if large<=len(words[i])*len(words[j]) and words[i]!=words[j]:\\n large=len(words[i])*len(words[j])\\n print(large)\\n return large\\n\",\n \"runtime\": \"6967\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n ans = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n flag = True\\n for k in words[i]:\\n if k in words[j]:\\n flag = False\\n break\\n if flag:\\n ans = max(ans, len(words[i]) * len(words[j]))\\n return ans\\n\",\n \"runtime\": \"6967\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n from collections import defaultdict\\n\\n ans = 0\\n\\n bitmap = defaultdict(str)\\n for word in words:\\n val = [\\\"0\\\"]* 26\\n for x in range(len(word)):\\n idx = ord(word[x]) - ord('a')\\n val[idx] = \\\"1\\\"\\n bitmap[word] = ''.join(val)\\n \\n print(bitmap)\\n\\n\\n def check(bit1, bit2):\\n match = True\\n # print(bit1,bit2)\\n for x in range(len(bit1)):\\n if bit1[x] == \\\"1\\\" and bit2[x] == \\\"1\\\":\\n match = False\\n return match\\n\\n \\n for word1 in words:\\n for word2 in words:\\n if check(bitmap[word1], bitmap[word2]) == True:\\n ans = max(len(word1)*len(word2), ans)\\n return ans\",\n \"runtime\": \"7054\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n m = 0\\n word = sorted(words,key = len)[::-1]\\n for i in range(len(words)):\\n for j in range(i,len(words)):\\n if(i==j):\\n continue\\n if(set(words[i]).intersection(set(words[j])) == set()):\\n m = max(m,len(words[i])*len(words[j]))\\n \\n return m\",\n \"runtime\": \"7054\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":132,"string":"132"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n \n n = len(words)\n res = 0\n for i in range(n):\n for j in range(i+1,n):\n if len(set(words[i]) & set(words[j])) == 0:\n res = max(res, len(words[i]) * len(words[j]))\n \n return res","memory":"18700"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n\n diff_map = {}\n\n for word in words:\n diff_map[word] = 0\n\n\n\n for word in diff_map.keys():\n \n for word2 in words:\n if word2 == word:\n continue\n \n for i in range(len(word2)):\n if word2[i] in word:\n break\n elif i == len(word2) - 1:\n diff_map[word] = max(diff_map[word], len(word2))\n\n max_len = 0\n for word, lens in diff_map.items():\n curr_len = len(word)\n if lens:\n max_len = max(max_len, curr_len * lens)\n\n return max_len\n\n\n\n","memory":"18900"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # letterExist = [False] * 26\n # letterExist[0] = True\n # letterExist[1] = True\n\n # letterExist1[0] == letterExist2[0]?\n # letterExist1[1] == letterExist2[1]?\n # 26 times\n \n # bit1 = 10010101010.....0101\n # bit2 = 10001010101.....0101\n\n # 1 & 1 = 1\n # 1 & 0 = 0\n # 0 & 1 = 0\n # 0 & 0 = 0\n\n # 101\n # 010\n # 0\n \n # 110\n # 100\n # 100\n\n # 00000000 .... 000\n # mask = mask | 1 < 1\n # mask = (mask) | (1 < 2)\n # mask = (mask) | (1 < 3)\n\n # mask = (mask) | (1 < 2)\n # 00101010100\n # 00000000010\n # 00101010110\n\n # 00000000....00000\n # 00000000....00001\n # 00000000....00001\n\n # 00000000....00001\n # 00000000....00010\n # 00000000....00011\n\n # 00000000....00011\n # 00000000....00100\n # 00000000....00111\n\n # 1 | 1 = 1\n # 1 | 0 = 1\n # 0 | 1 = 1\n # 0 | 0 = 0\n\n # and or xor\n\n masks = []\n maxLen = 0\n for word in words:\n mask = 0\n for c in word:\n mask |= 1 << (ord(c) - ord('a'))\n \n masks.append(mask)\n \n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if masks[i] & masks[j] == 0:\n maxLen = max(maxLen, len(words[i]) * len(words[j]))\n return maxLen","memory":"19300"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n bitReps = []\n\n for word in words:\n bitRep = 0\n\n for c in word:\n bitRep |= 1 << (ord(c) - ord('a'))\n\n bitReps.append(bitRep)\n\n curMax = 0\n\n for i in range(len(bitReps)):\n for j in range(i):\n if bitReps[i] & bitReps[j] == 0:\n curMax = max(curMax, len(words[i]) * len(words[j])) \n \n return curMax","memory":"19500"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n bitReps = []\n\n for word in words:\n bitRep = 0\n\n for c in word:\n bitRep |= 1 << (ord(c) - ord('a'))\n\n bitReps.append(bitRep)\n\n curMax = 0\n\n for i in range(len(bitReps)):\n for j in range(i):\n if bitReps[i] & bitReps[j] == 0:\n curMax = max(curMax, len(words[i]) * len(words[j])) \n \n return curMax","memory":"19500"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n m=len(words)\n if m==0:\n return 0\n max_len=0\n for i in range(m):\n j=m-1\n while j>i:\n if not bool(set(words[i]) & set(words[j])):\n max_len=max(max_len,len(words[i])*len(words[j]))\n j=j-1\n return max_len","memory":"19600"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n converted = []\n for word in words:\n num = 0\n for i in range (0, len(word)):\n num |= 1 << (ord(word[i]) - ord(\"a\"))\n converted.append(num)\n result = 0\n for i in range (0, len(words)):\n for j in range (i+1, len(words)):\n if converted[i] & converted[j] == 0:\n result = max(result, len(words[i]) * len(words[j]))\n return result\n ","memory":"19600"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n bitmasks = [0] * n\n lengths = [0] * n\n\n # Create bitmask for each word\n for i in range(n):\n bitmask = 0\n for char in words[i]:\n bitmask |= (1 << (ord(char) - ord('a')))\n bitmasks[i] = bitmask\n lengths[i] = len(words[i])\n \n result = 0\n\n # Compare all pairs of words\n for i in range(n - 1):\n for j in range(i + 1, n):\n if bitmasks[i] & bitmasks[j] == 0: # No common characters\n result = max(result, lengths[i] * lengths[j])\n\n return result\n","memory":"19700"},{"code":"class Solution:\n def maxProduct(self, words: list[str]) -> int:\n words.sort(key=lambda x: len(x), reverse=True)\n best = 0\n bitsets = [0] * len(words)\n\n for i in range(len(words)):\n bitset = 0\n wlen = len(words[i])\n\n if wlen * len(words[0]) < best:\n return best\n\n for char in words[i]:\n bitset |= (1 << (ord(char) - ord('a')))\n\n for j in range(i):\n if (bitsets[j] & bitset) == 0:\n best = max(best, wlen * len(words[j]))\n\n bitsets[i] = bitset\n\n return best","memory":"19700"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # how to see if no common letters ? \n n = len(words)\n\n bits = set()\n\n ret = 0\n for i, word in enumerate(words):\n bit_format = 0\n for c in word:\n bit_format |= (1 << (ord(c) - ord('a')))\n bits.add((bit_format, i))\n for seen_bits, idx in bits:\n if seen_bits & bit_format == 0:\n ret = max(ret, len(words[i]) * len(words[idx]))\n \n return ret","memory":"19800"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n mask=0\n mask_l=[]\n for word in words:\n mask=0\n for c in word:\n mask |=1<<(ord(c)-ord('a'))\n mask_l.append(mask)\n print(mask_l)\n maxi=0\n for i in range(len(words)):\n for j in range(i,len(words)):\n if not mask_l[i] & mask_l[j]:\n maxi=max(maxi,len(words[i])*len(words[j]))\n return maxi","memory":"19800"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n n = len(words)\n\n word_to_existence = [None] * n\n for i, word in enumerate(words):\n existence = [0] * 26\n for char in word:\n existence[ord(char) - ord('a')] = True\n word_to_existence[i] = existence\n\n max_product = 0\n for i in range(n):\n for j in range(i + 1, n):\n existence_1 = word_to_existence[i]\n existence_2 = word_to_existence[j]\n has_match = False\n for k in range(26):\n if existence_1[k] and existence_2[k]:\n has_match = True\n break\n if not has_match:\n max_product = max(max_product, len(words[i]) * len(words[j]))\n return max_product","memory":"19900"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n res = 0\n wordMap = [[0] * 26 for _ in range(len(words))]\n for i, word in enumerate(words):\n for x in set(word):\n wordMap[i][ord(x) - ord('a')] = 1\n for j in range(i):\n # if sum(wordMap[i][k] * wordMap[j][k] for k in range(26)) == 0:\n if sum(x * y for x, y in zip(wordMap[i], wordMap[j])) == 0:\n res = max(res, len(words[i]) * len(words[j]))\n return res","memory":"19900"},{"code":"from typing import List\n\nclass Solution:\n def maxProduct(self, words: List[str]) -> int:\n def getCharSet(word):\n # Convert the word into a set of characters\n return set(word)\n \n n = len(words)\n char_sets = [getCharSet(word) for word in words]\n max_product = 0\n \n # Iterate through each pair of words\n for i in range(n):\n for j in range(i + 1, n):\n # Check if the character sets of two words are disjoint\n if char_sets[i].isdisjoint(char_sets[j]):\n # Calculate the product of their lengths\n product = len(words[i]) * len(words[j])\n # Update the maximum product found\n max_product = max(max_product, product)\n \n return max_product\n","memory":"20000"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n # brute force\n # iterate through all the 2-combinations\n # if the 2 words do not have shared letters, calculate their lengths' product\n # return the max product\n \n # improvement\n # for all the words with the same letters, keep only the longest one\n word_lengths = {}\n for word in words:\n word_set = frozenset(word)\n if word_set in word_lengths:\n word_lengths[word_set] = max(word_lengths[word_set], len(word))\n else:\n word_lengths[word_set] = len(word)\n words = [word for word in words if len(word) == word_lengths[frozenset(word)]]\n \n max_product = 0\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n if not set(words[i]) & set(words[j]):\n max_product = max(max_product, len(words[i]) * len(words[j]))\n return max_product","memory":"20000"},{"code":"class Solution:\n def maxProduct(self, words: List[str]) -> int:\n word_sets = [set(word) for word in words]\n max_val = 0\n\n for i in range(len(word_sets)):\n for j in range(len(word_sets)):\n if len(word_sets[i] & word_sets[j]) == 0:\n max_val = max(max_val, len(words[i]) * len(words[j]))\n\n return max_val","memory":"20100"}],"string":"[\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n \\n n = len(words)\\n res = 0\\n for i in range(n):\\n for j in range(i+1,n):\\n if len(set(words[i]) & set(words[j])) == 0:\\n res = max(res, len(words[i]) * len(words[j]))\\n \\n return res\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n\\n diff_map = {}\\n\\n for word in words:\\n diff_map[word] = 0\\n\\n\\n\\n for word in diff_map.keys():\\n \\n for word2 in words:\\n if word2 == word:\\n continue\\n \\n for i in range(len(word2)):\\n if word2[i] in word:\\n break\\n elif i == len(word2) - 1:\\n diff_map[word] = max(diff_map[word], len(word2))\\n\\n max_len = 0\\n for word, lens in diff_map.items():\\n curr_len = len(word)\\n if lens:\\n max_len = max(max_len, curr_len * lens)\\n\\n return max_len\\n\\n\\n\\n\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # letterExist = [False] * 26\\n # letterExist[0] = True\\n # letterExist[1] = True\\n\\n # letterExist1[0] == letterExist2[0]?\\n # letterExist1[1] == letterExist2[1]?\\n # 26 times\\n \\n # bit1 = 10010101010.....0101\\n # bit2 = 10001010101.....0101\\n\\n # 1 & 1 = 1\\n # 1 & 0 = 0\\n # 0 & 1 = 0\\n # 0 & 0 = 0\\n\\n # 101\\n # 010\\n # 0\\n \\n # 110\\n # 100\\n # 100\\n\\n # 00000000 .... 000\\n # mask = mask | 1 < 1\\n # mask = (mask) | (1 < 2)\\n # mask = (mask) | (1 < 3)\\n\\n # mask = (mask) | (1 < 2)\\n # 00101010100\\n # 00000000010\\n # 00101010110\\n\\n # 00000000....00000\\n # 00000000....00001\\n # 00000000....00001\\n\\n # 00000000....00001\\n # 00000000....00010\\n # 00000000....00011\\n\\n # 00000000....00011\\n # 00000000....00100\\n # 00000000....00111\\n\\n # 1 | 1 = 1\\n # 1 | 0 = 1\\n # 0 | 1 = 1\\n # 0 | 0 = 0\\n\\n # and or xor\\n\\n masks = []\\n maxLen = 0\\n for word in words:\\n mask = 0\\n for c in word:\\n mask |= 1 << (ord(c) - ord('a'))\\n \\n masks.append(mask)\\n \\n for i in range(len(words)):\\n for j in range(i + 1, len(words)):\\n if masks[i] & masks[j] == 0:\\n maxLen = max(maxLen, len(words[i]) * len(words[j]))\\n return maxLen\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n bitReps = []\\n\\n for word in words:\\n bitRep = 0\\n\\n for c in word:\\n bitRep |= 1 << (ord(c) - ord('a'))\\n\\n bitReps.append(bitRep)\\n\\n curMax = 0\\n\\n for i in range(len(bitReps)):\\n for j in range(i):\\n if bitReps[i] & bitReps[j] == 0:\\n curMax = max(curMax, len(words[i]) * len(words[j])) \\n \\n return curMax\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n bitReps = []\\n\\n for word in words:\\n bitRep = 0\\n\\n for c in word:\\n bitRep |= 1 << (ord(c) - ord('a'))\\n\\n bitReps.append(bitRep)\\n\\n curMax = 0\\n\\n for i in range(len(bitReps)):\\n for j in range(i):\\n if bitReps[i] & bitReps[j] == 0:\\n curMax = max(curMax, len(words[i]) * len(words[j])) \\n \\n return curMax\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n m=len(words)\\n if m==0:\\n return 0\\n max_len=0\\n for i in range(m):\\n j=m-1\\n while j>i:\\n if not bool(set(words[i]) & set(words[j])):\\n max_len=max(max_len,len(words[i])*len(words[j]))\\n j=j-1\\n return max_len\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n converted = []\\n for word in words:\\n num = 0\\n for i in range (0, len(word)):\\n num |= 1 << (ord(word[i]) - ord(\\\"a\\\"))\\n converted.append(num)\\n result = 0\\n for i in range (0, len(words)):\\n for j in range (i+1, len(words)):\\n if converted[i] & converted[j] == 0:\\n result = max(result, len(words[i]) * len(words[j]))\\n return result\\n \",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n bitmasks = [0] * n\\n lengths = [0] * n\\n\\n # Create bitmask for each word\\n for i in range(n):\\n bitmask = 0\\n for char in words[i]:\\n bitmask |= (1 << (ord(char) - ord('a')))\\n bitmasks[i] = bitmask\\n lengths[i] = len(words[i])\\n \\n result = 0\\n\\n # Compare all pairs of words\\n for i in range(n - 1):\\n for j in range(i + 1, n):\\n if bitmasks[i] & bitmasks[j] == 0: # No common characters\\n result = max(result, lengths[i] * lengths[j])\\n\\n return result\\n\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: list[str]) -> int:\\n words.sort(key=lambda x: len(x), reverse=True)\\n best = 0\\n bitsets = [0] * len(words)\\n\\n for i in range(len(words)):\\n bitset = 0\\n wlen = len(words[i])\\n\\n if wlen * len(words[0]) < best:\\n return best\\n\\n for char in words[i]:\\n bitset |= (1 << (ord(char) - ord('a')))\\n\\n for j in range(i):\\n if (bitsets[j] & bitset) == 0:\\n best = max(best, wlen * len(words[j]))\\n\\n bitsets[i] = bitset\\n\\n return best\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # how to see if no common letters ? \\n n = len(words)\\n\\n bits = set()\\n\\n ret = 0\\n for i, word in enumerate(words):\\n bit_format = 0\\n for c in word:\\n bit_format |= (1 << (ord(c) - ord('a')))\\n bits.add((bit_format, i))\\n for seen_bits, idx in bits:\\n if seen_bits & bit_format == 0:\\n ret = max(ret, len(words[i]) * len(words[idx]))\\n \\n return ret\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n mask=0\\n mask_l=[]\\n for word in words:\\n mask=0\\n for c in word:\\n mask |=1<<(ord(c)-ord('a'))\\n mask_l.append(mask)\\n print(mask_l)\\n maxi=0\\n for i in range(len(words)):\\n for j in range(i,len(words)):\\n if not mask_l[i] & mask_l[j]:\\n maxi=max(maxi,len(words[i])*len(words[j]))\\n return maxi\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n n = len(words)\\n\\n word_to_existence = [None] * n\\n for i, word in enumerate(words):\\n existence = [0] * 26\\n for char in word:\\n existence[ord(char) - ord('a')] = True\\n word_to_existence[i] = existence\\n\\n max_product = 0\\n for i in range(n):\\n for j in range(i + 1, n):\\n existence_1 = word_to_existence[i]\\n existence_2 = word_to_existence[j]\\n has_match = False\\n for k in range(26):\\n if existence_1[k] and existence_2[k]:\\n has_match = True\\n break\\n if not has_match:\\n max_product = max(max_product, len(words[i]) * len(words[j]))\\n return max_product\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n res = 0\\n wordMap = [[0] * 26 for _ in range(len(words))]\\n for i, word in enumerate(words):\\n for x in set(word):\\n wordMap[i][ord(x) - ord('a')] = 1\\n for j in range(i):\\n # if sum(wordMap[i][k] * wordMap[j][k] for k in range(26)) == 0:\\n if sum(x * y for x, y in zip(wordMap[i], wordMap[j])) == 0:\\n res = max(res, len(words[i]) * len(words[j]))\\n return res\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n def getCharSet(word):\\n # Convert the word into a set of characters\\n return set(word)\\n \\n n = len(words)\\n char_sets = [getCharSet(word) for word in words]\\n max_product = 0\\n \\n # Iterate through each pair of words\\n for i in range(n):\\n for j in range(i + 1, n):\\n # Check if the character sets of two words are disjoint\\n if char_sets[i].isdisjoint(char_sets[j]):\\n # Calculate the product of their lengths\\n product = len(words[i]) * len(words[j])\\n # Update the maximum product found\\n max_product = max(max_product, product)\\n \\n return max_product\\n\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n # brute force\\n # iterate through all the 2-combinations\\n # if the 2 words do not have shared letters, calculate their lengths' product\\n # return the max product\\n \\n # improvement\\n # for all the words with the same letters, keep only the longest one\\n word_lengths = {}\\n for word in words:\\n word_set = frozenset(word)\\n if word_set in word_lengths:\\n word_lengths[word_set] = max(word_lengths[word_set], len(word))\\n else:\\n word_lengths[word_set] = len(word)\\n words = [word for word in words if len(word) == word_lengths[frozenset(word)]]\\n \\n max_product = 0\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n if not set(words[i]) & set(words[j]):\\n max_product = max(max_product, len(words[i]) * len(words[j]))\\n return max_product\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def maxProduct(self, words: List[str]) -> int:\\n word_sets = [set(word) for word in words]\\n max_val = 0\\n\\n for i in range(len(word_sets)):\\n for j in range(len(word_sets)):\\n if len(word_sets[i] & word_sets[j]) == 0:\\n max_val = max(max_val, len(words[i]) * len(words[j]))\\n\\n return max_val\",\n \"memory\": \"20100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":16,"string":"16"}}},{"rowIdx":250,"cells":{"question_id":{"kind":"number","value":319,"string":"319"},"name":{"kind":"string","value":"bulb-switcher"},"content":{"kind":"string","value":"<p>There are <code>n</code> bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb.</p>\n\n<p>On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the <code>i<sup>th</sup></code> round, you toggle every <code>i</code> bulb. For the <code>n<sup>th</sup></code> round, you only toggle the last bulb.</p>\n\n<p>Return <em>the number of bulbs that are on after <code>n</code> rounds</em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/11/05/bulb.jpg\" style=\"width: 421px; height: 321px;\" />\n<pre>\n<strong>Input:</strong> n = 3\n<strong>Output:</strong> 1\n<strong>Explanation:</strong> At first, the three bulbs are [off, off, off].\nAfter the first round, the three bulbs are [on, on, on].\nAfter the second round, the three bulbs are [on, off, on].\nAfter the third round, the three bulbs are [on, off, off]. \nSo you should return 1 because there is only one bulb is on.</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 0\n<strong>Output:</strong> 0\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 1\n<strong>Output:</strong> 1\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>0 <= n <= 10<sup>9</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":53.11480225262646,"string":"53.114802"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["math","brainteaser"],"string":"[\n \"math\",\n \"brainteaser\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16\", 0.0495], [\"17\", 0.0495], [\"18\", 0.297], [\"19\", 0.099], [\"20\", 0.297], [\"21\", 0.099], [\"22\", 0.7426], [\"23\", 0.6436], [\"24\", 1.6337], [\"25\", 1.1386], [\"26\", 3.0693], [\"27\", 1.7327], [\"28\", 3.9109], [\"29\", 3.9109], [\"30\", 4.703], [\"31\", 4.2079], [\"32\", 7.2772], [\"33\", 7.8713], [\"34\", 7.6733], [\"35\", 5.4455], [\"36\", 7.5248], [\"37\", 8.7624], [\"38\", 6.8317], [\"39\", 4.901], [\"40\", 4.4554], [\"41\", 4.3069], [\"42\", 2.5743]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.099], [\"16200\", 0.5941], [\"16300\", 11.7822], [\"16400\", 32.6238], [\"16500\", 46.6337]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))","runtime":"16"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(n**0.5)","runtime":"17"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"18"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"19"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"20"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))","runtime":"21"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(n ** 0.5)","runtime":"22"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return floor(n**0.5)","runtime":"23"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))\n","runtime":"24"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n\n return int(sqrt(n))\n \n \n\n\n","runtime":"25"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"26"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(math.sqrt(n))\n\n\n\n ","runtime":"27"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(n ** 0.5)","runtime":"28"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))","runtime":"28"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))\n ","runtime":"29"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n \n return floor(sqrt(n))","runtime":"29"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n if n < 2:\n return n\n\n return math.floor(math.sqrt(n))\n\n\n\n ","runtime":"30"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n if n==1:\n return 1\n for i in range(1, (n+4)//2):\n if i**2 >n:\n return i-1\n return -1","runtime":"30"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n if n == 0: return 0\n\n \n return int(sqrt(n))","runtime":"31"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n\n res = 0\n for i in range(1, n+1):\n if i**2 > n:\n break\n res += 1\n return res\n \n \n\n ","runtime":"31"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))","runtime":"32"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"32"},{"code":"import math\n\nclass Solution:\n def bulbSwitch(self, n: int) -> int:\n # The number of bulbs that remain on is the number of perfect squares ≤ n\n return int(math.sqrt(n))\n\n# Example usage:\n# If you're running this code as a script or in a testing environment, you can test it like this:\nif __name__ == \"__main__\":\n sol = Solution()\n print(sol.bulbSwitch(3)) # Output: 1\n print(sol.bulbSwitch(0)) # Output: 0\n print(sol.bulbSwitch(1)) # Output: 1\n","runtime":"33"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(math.sqrt(n))","runtime":"33"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n bulbs = 0\n oddNum = 3\n total = 0\n while not (total>=n):\n total += oddNum\n oddNum += 2\n bulbs += 1\n return bulbs","runtime":"34"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"34"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))\n","runtime":"35"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"35"},{"code":"import math\n\nclass Solution:\n def bulbSwitch(self, n: int) -> int:\n # The number of bulbs that are on after n rounds is the count of perfect squares ≤ n\n return int(math.sqrt(n))\n","runtime":"36"},{"code":"import math\nclass Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(math.sqrt(n))\n ","runtime":"36"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n \"\"\"\n 0- off, 1- on\n n bulbs, n rounds\n \n round 1: 1 1 1 1 1 1 1 1 1 1 1..\n round 2: 1 0 1 0 1 0 1 0 1 0 1.. toggle every 2nd\n round 3: 1 0 0 0 0 1 1 0 0 0 1... toggle every 3rd \n\n find out num of bulbs that are on after N rounds\n n = 3, res = 1\n n = 4, res = 2\n n = 5, res = 2\n\n rd1 1 1 1 1\n rd2 1 0 1 0\n rd3 1 0 0 0\n rd4 1 0 0 1\n\n n = 5, res = 2\n rd1 1 1 1 1 1\n rd2 1 0 1 0 1\n rd3 1 0 0 0 1\n rd4 1 0 0 1 1\n rd5 1 0 0 1 0\n \"\"\"\n\n return int(sqrt(n))","runtime":"37"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(math.sqrt(n))","runtime":"37"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))","runtime":"38"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n\n\n return int(sqrt(n))","runtime":"39"},{"code":"import math\nclass Solution:\n def bulbSwitch(self, n: int) -> int:\n # by the end of n rounds, any bulb is flipped number of times\n # that it contains the num of factors for\n # 4: 1, 2, 4\n # 5: 1, 5\n # 6: 1, 2, 3, 6\n # all numbers have even num of factors unless iits a perfect square, cause of the dup#\n # odd toggles: means on position\n # the only ones at the end which will be on are the p\n\n return math.floor(math.sqrt(n))","runtime":"40"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(sqrt(n))","runtime":"40"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))\n ","runtime":"41"},{"code":"import math\n\nclass Solution:\n def bulbSwitch(self, n: int) -> int:\n \"\"\"\n Determines the number of bulbs that are on after n rounds of toggling.\n\n Args:\n n (int): The number of bulbs and the number of rounds.\n\n Returns:\n int: The count of bulbs that are on after n rounds.\n \"\"\"\n # Edge Case: If n is 0, no bulbs are on\n if n <= 0:\n return 0\n \n # Compute the integer square root of n\n # math.isqrt is available from Python 3.8 onwards\n # For compatibility, we use int(math.sqrt(n)) which truncates towards zero\n return int(math.sqrt(n))\n","runtime":"41"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(math.sqrt(n))","runtime":"42"}],"string":"[\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(n**0.5)\",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(n ** 0.5)\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return floor(n**0.5)\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n\\n return int(sqrt(n))\\n \\n \\n\\n\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(math.sqrt(n))\\n\\n\\n\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(n ** 0.5)\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n \\n return floor(sqrt(n))\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n if n < 2:\\n return n\\n\\n return math.floor(math.sqrt(n))\\n\\n\\n\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n if n==1:\\n return 1\\n for i in range(1, (n+4)//2):\\n if i**2 >n:\\n return i-1\\n return -1\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n if n == 0: return 0\\n\\n \\n return int(sqrt(n))\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n\\n res = 0\\n for i in range(1, n+1):\\n if i**2 > n:\\n break\\n res += 1\\n return res\\n \\n \\n\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def bulbSwitch(self, n: int) -> int:\\n # The number of bulbs that remain on is the number of perfect squares ≤ n\\n return int(math.sqrt(n))\\n\\n# Example usage:\\n# If you're running this code as a script or in a testing environment, you can test it like this:\\nif __name__ == \\\"__main__\\\":\\n sol = Solution()\\n print(sol.bulbSwitch(3)) # Output: 1\\n print(sol.bulbSwitch(0)) # Output: 0\\n print(sol.bulbSwitch(1)) # Output: 1\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(math.sqrt(n))\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n bulbs = 0\\n oddNum = 3\\n total = 0\\n while not (total>=n):\\n total += oddNum\\n oddNum += 2\\n bulbs += 1\\n return bulbs\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def bulbSwitch(self, n: int) -> int:\\n # The number of bulbs that are on after n rounds is the count of perfect squares ≤ n\\n return int(math.sqrt(n))\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(math.sqrt(n))\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n \\\"\\\"\\\"\\n 0- off, 1- on\\n n bulbs, n rounds\\n \\n round 1: 1 1 1 1 1 1 1 1 1 1 1..\\n round 2: 1 0 1 0 1 0 1 0 1 0 1.. toggle every 2nd\\n round 3: 1 0 0 0 0 1 1 0 0 0 1... toggle every 3rd \\n\\n find out num of bulbs that are on after N rounds\\n n = 3, res = 1\\n n = 4, res = 2\\n n = 5, res = 2\\n\\n rd1 1 1 1 1\\n rd2 1 0 1 0\\n rd3 1 0 0 0\\n rd4 1 0 0 1\\n\\n n = 5, res = 2\\n rd1 1 1 1 1 1\\n rd2 1 0 1 0 1\\n rd3 1 0 0 0 1\\n rd4 1 0 0 1 1\\n rd5 1 0 0 1 0\\n \\\"\\\"\\\"\\n\\n return int(sqrt(n))\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(math.sqrt(n))\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n\\n\\n return int(sqrt(n))\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def bulbSwitch(self, n: int) -> int:\\n # by the end of n rounds, any bulb is flipped number of times\\n # that it contains the num of factors for\\n # 4: 1, 2, 4\\n # 5: 1, 5\\n # 6: 1, 2, 3, 6\\n # all numbers have even num of factors unless iits a perfect square, cause of the dup#\\n # odd toggles: means on position\\n # the only ones at the end which will be on are the p\\n\\n return math.floor(math.sqrt(n))\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(sqrt(n))\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def bulbSwitch(self, n: int) -> int:\\n \\\"\\\"\\\"\\n Determines the number of bulbs that are on after n rounds of toggling.\\n\\n Args:\\n n (int): The number of bulbs and the number of rounds.\\n\\n Returns:\\n int: The count of bulbs that are on after n rounds.\\n \\\"\\\"\\\"\\n # Edge Case: If n is 0, no bulbs are on\\n if n <= 0:\\n return 0\\n \\n # Compute the integer square root of n\\n # math.isqrt is available from Python 3.8 onwards\\n # For compatibility, we use int(math.sqrt(n)) which truncates towards zero\\n return int(math.sqrt(n))\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(math.sqrt(n))\",\n \"runtime\": \"42\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":39,"string":"39"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(math.sqrt(n))","memory":"16100"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n # bulbs = [0]*n\n # for i in range(1, n+1):\n # if i==1:\n # bulbs = [1]*n\n # else:\n # if bulbs[(i-1)%n] == 1:\n # bulbs[(i-1)%n] = 0\n # else:\n # bulbs[(i-1)%n] = 1\n # return sum(bulbs)\n return int(math.sqrt(n))\n ","memory":"16200"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return math.floor(math.sqrt(n))\n\n\n\n ","memory":"16300"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(sqrt(n))\n ","memory":"16300"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n bulbs = 0\n oddNum = 3\n total = 0\n while not (total>=n):\n total += oddNum\n oddNum += 2\n bulbs += 1\n return bulbs","memory":"16400"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n return int(n ** 0.5)","memory":"16400"},{"code":"import math\n\nclass Solution:\n def bulbSwitch(self, n: int) -> int:\n # The number of bulbs that are on after n rounds is the count of perfect squares ≤ n\n return int(math.sqrt(n))\n","memory":"16500"},{"code":"class Solution:\n def bulbSwitch(self, n: int) -> int:\n if n < 2:\n return n\n\n return math.floor(math.sqrt(n))\n\n\n\n ","memory":"16500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(math.sqrt(n))\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n # bulbs = [0]*n\\n # for i in range(1, n+1):\\n # if i==1:\\n # bulbs = [1]*n\\n # else:\\n # if bulbs[(i-1)%n] == 1:\\n # bulbs[(i-1)%n] = 0\\n # else:\\n # bulbs[(i-1)%n] = 1\\n # return sum(bulbs)\\n return int(math.sqrt(n))\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return math.floor(math.sqrt(n))\\n\\n\\n\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(sqrt(n))\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n bulbs = 0\\n oddNum = 3\\n total = 0\\n while not (total>=n):\\n total += oddNum\\n oddNum += 2\\n bulbs += 1\\n return bulbs\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n return int(n ** 0.5)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n def bulbSwitch(self, n: int) -> int:\\n # The number of bulbs that are on after n rounds is the count of perfect squares ≤ n\\n return int(math.sqrt(n))\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def bulbSwitch(self, n: int) -> int:\\n if n < 2:\\n return n\\n\\n return math.floor(math.sqrt(n))\\n\\n\\n\\n \",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":8,"string":"8"}}},{"rowIdx":251,"cells":{"question_id":{"kind":"number","value":321,"string":"321"},"name":{"kind":"string","value":"create-maximum-number"},"content":{"kind":"string","value":"<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> of lengths <code>m</code> and <code>n</code> respectively. <code>nums1</code> and <code>nums2</code> represent the digits of two numbers. You are also given an integer <code>k</code>.</p>\n\n<p>Create the maximum number of length <code>k <= m + n</code> from digits of the two numbers. The relative order of the digits from the same array must be preserved.</p>\n\n<p>Return an array of the <code>k</code> digits representing the answer.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5\n<strong>Output:</strong> [9,8,6,5,3]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums1 = [6,7], nums2 = [6,0,4], k = 5\n<strong>Output:</strong> [6,7,6,0,4]\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums1 = [3,9], nums2 = [8,9], k = 3\n<strong>Output:</strong> [9,8,9]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>m == nums1.length</code></li>\n\t<li><code>n == nums2.length</code></li>\n\t<li><code>1 <= m, n <= 500</code></li>\n\t<li><code>0 <= nums1[i], nums2[i] <= 9</code></li>\n\t<li><code>1 <= k <= m + n</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":30.773803769937167,"string":"30.773804"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","two-pointers","stack","greedy","monotonic-stack"],"string":"[\n \"array\",\n \"two-pointers\",\n \"stack\",\n \"greedy\",\n \"monotonic-stack\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"103\", 0.4866], [\"117\", 0.2433], [\"131\", 0.2433], [\"145\", 5.8392], [\"159\", 7.542400000000001], [\"173\", 18.734700000000004], [\"187\", 4.3794], [\"201\", 3.8928000000000003], [\"216\", 3.6495000000000006], [\"230\", 3.1629], [\"244\", 2.1896999999999998], [\"258\", 6.5691], [\"272\", 3.4062000000000006], [\"286\", 9.4888], [\"300\", 7.542299999999999], [\"314\", 4.3793999999999995], [\"329\", 0.4866], [\"343\", 0.7299], [\"357\", 0.4866], [\"371\", 0.7299], [\"385\", 0.2433], [\"399\", 0.2433], [\"413\", 0.2433], [\"427\", 0.2433], [\"442\", 0.2433], [\"456\", 0.2433], [\"470\", 0.2433], [\"484\", 0.2433], [\"498\", 0.4866], [\"512\", 0.2433], [\"526\", 0.2433], [\"540\", 0.4866], [\"555\", 0.2433], [\"569\", 0.4866], [\"583\", 0.2433], [\"597\", 0.2433], [\"611\", 0.2433], [\"625\", 0.2433], [\"639\", 0.2433], [\"653\", 0.4866], [\"668\", 0.2433], [\"682\", 0.2433], [\"696\", 1.2165], [\"710\", 0.2433], [\"724\", 0.2433], [\"738\", 0.2433], [\"752\", 0.2433], [\"766\", 0.2433], [\"781\", 0.2433], [\"795\", 0.2433], [\"809\", 0.2433], [\"823\", 0.2433], [\"837\", 0.2433], [\"851\", 0.2433], [\"865\", 0.2433], [\"879\", 0.2433]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16500\", 0.7299], [\"16600\", 0.9732], [\"16700\", 10.7056], [\"16800\", 25.5474], [\"16900\", 33.09], [\"17000\", 14.3552], [\"17100\", 3.8929], [\"17200\", 0.9732], [\"17300\", 0.2433], [\"18400\", 0.2433], [\"18700\", 0.7299], [\"18800\", 0.4866], [\"18900\", 0.4866], [\"19000\", 0.4866], [\"19200\", 0.2433], [\"19800\", 0.2433], [\"20300\", 0.2433], [\"20400\", 0.2433], [\"20600\", 0.2433], [\"20900\", 0.2433], [\"29400\", 0.2433], [\"32500\", 0.2433]]}"},"rt_list":{"kind":"list like","value":[{"code":"import bisect\nimport collections as cc\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n nums = [nums1, nums2]\n \n def generateMaxPos(aid: int) -> List[List[int]]:\n ret = [[] for _ in range(10)]\n for i, a in enumerate(nums[aid]):\n ret[a].append(i)\n return ret\n positions = [generateMaxPos(i) for i in range(len(nums))]\n \n def findMaxPos(aid: int, begin: int, end: int) -> Tuple[int, int]:\n assert begin < end <= len(nums[aid]), f\"{aid}, {begin}, {end}\"\n for i, v in enumerate(reversed(positions[aid])):\n i = 9 - i\n j = bisect.bisect_left(v, begin)\n if j >= len(v) or v[j] >= end:\n continue\n return i, v[j]\n assert False, \"begin/end not in range\"\n \n def getEndRange(aid: int, state: Tuple[int, int], step: int) -> int:\n return len(nums[aid]) - max(0, (k - step - 1) - (len(nums[1 - aid]) - state[1 - aid]))\n\n pendings = {(0, 0)}\n outputSeq = []\n while pendings and len(outputSeq) < k:\n bestVal = -1\n bestSeq = set()\n for state in pendings:\n for aid in range(2):\n e = getEndRange(aid, state, len(outputSeq))\n if e == state[aid]:\n continue\n digit, pos = findMaxPos(aid, state[aid], e)\n if digit > bestVal:\n bestVal = digit\n bestSeq.clear()\n if digit == bestVal:\n ns = list(state)\n ns[aid] = pos + 1\n bestSeq.add(tuple(ns))\n outputSeq.append(bestVal)\n pendings = bestSeq\n\n return outputSeq","runtime":"103"},{"code":"class Solution:\n from typing import List\n\n def maxNumber(self,nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def maxNumberFromArray(nums, k):\n stack = []\n drop = len(nums) - k\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:k]\n\n def merge(nums1, nums2):\n merged = []\n while nums1 or nums2:\n if nums1 > nums2:\n merged.append(nums1.pop(0))\n else:\n merged.append(nums2.pop(0))\n return merged\n\n best = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n part1 = maxNumberFromArray(nums1, i)\n part2 = maxNumberFromArray(nums2, k - i)\n best = max(best, merge(part1, part2))\n return best\n","runtime":"103"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n def find_num(nums, k):\n st = []\n remain = len(nums) - k\n for n in nums:\n while remain and st and st[-1] < n:\n st.pop()\n remain -= 1\n st.append(n)\n return st[:k]\n\n def merge(A,B):\n ans = []\n while A or B:\n bigger = A if A > B else B\n ans.append(bigger.pop(0))\n return ans\n\n return max(merge(find_num(nums1, i), find_num(nums2, k-i)) for i in range(k+1) if i <=len(nums1) and k-i <= len(nums2))\n\n \n ","runtime":"117"},{"code":"class Solution:\n def get_max_subsequence(self, nums: List[int], k: int) -> List[int]:\n stack = []\n drop = len(nums) - k\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:k]\n\n def merge(self, a: List[int], b: List[int]) -> List[int]:\n result = []\n while a or b:\n if a > b:\n result.append(a.pop(0))\n else:\n result.append(b.pop(0))\n return result\n\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n max_seq = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n max_seq1 = self.get_max_subsequence(nums1, i)\n max_seq2 = self.get_max_subsequence(nums2, k - i)\n candidate = self.merge(max_seq1, max_seq2)\n if candidate > max_seq:\n max_seq = candidate\n return max_seq\n","runtime":"131"},{"code":"from typing import List\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def fst(arr, size):\n stack = []\n drop = len(arr) - size\n for num in arr:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:size]\n\n def merge(nums1, nums2):\n res = []\n while nums1 or nums2:\n if nums1 > nums2:\n res.append(nums1.pop(0))\n else:\n res.append(nums2.pop(0))\n return res\n\n max_num = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n sub1 = fst(nums1, i)\n sub2 = fst(nums2, k - i)\n max_num = max(max_num, merge(sub1, sub2))\n \n return max_num\n\n \n ","runtime":"145"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def pick_max(nums, t):\n stack = []\n drop = len(nums) - t\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:t]\n\n # Helper function to merge two sequences to get the lexicographically largest result\n def merge(seq1, seq2):\n result = []\n while seq1 or seq2:\n if seq1 > seq2:\n result.append(seq1.pop(0))\n else:\n result.append(seq2.pop(0))\n return result\n\n max_combination = []\n # Try all possible combinations of picking i digits from nums1 and k - i from nums2\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n max_from_nums1 = pick_max(nums1, i)\n max_from_nums2 = pick_max(nums2, k - i)\n candidate = merge(max_from_nums1, max_from_nums2)\n max_combination = max(max_combination, candidate)\n\n return max_combination","runtime":"145"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def pick(nums, t):\n stack = []\n drop = len(nums) - t\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:t]\n def merge(subseq1, subseq2):\n result = []\n while subseq1 or subseq2:\n if subseq1 > subseq2:\n result.append(subseq1.pop(0))\n else:\n result.append(subseq2.pop(0))\n return result\n \n max_sequence = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1))+1):\n subseq1 = pick(nums1, i)\n subseq2 = pick(nums2, k - i)\n max_sequence = max(max_sequence, merge(subseq1, subseq2))\n return max_sequence","runtime":"159"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n m, n = len(nums1), len(nums2)\n \n def merge(seq1, seq2):\n ans = []\n while seq1 or seq2:\n bigger = seq1 if seq1 > seq2 else seq2\n ans.append(bigger[0])\n bigger.pop(0)\n return ans\n \n def max_from_one(nums, k):\n drop = len(nums) - k\n out = []\n for num in nums:\n while drop and out and out[-1] < num:\n out.pop()\n drop -= 1\n out.append(num)\n return out[:k]\n \n def max_number(nums1, nums2, k):\n return max(merge(max_from_one(nums1, i), max_from_one(nums2, k-i)) for i in range(max(0, k-len(nums2)), min(k, len(nums1))+1))\n \n return max_number(nums1, nums2, k)","runtime":"159"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def prep(nums, k):\n drop = len(nums) - k\n out = []\n for num in nums:\n while drop and out and out[-1] < num:\n out.pop()\n drop -= 1\n out.append(num)\n return out[:k]\n \n def merge(a, b):\n return [max(a, b).pop(0) for _ in a+b]\n \n return max(merge(prep(nums1, i), prep(nums2, k-i)) for i in range(k+1) if i <= len(nums1) and k-i <= len(nums2))\n\n# Example usage:\nsolution = Solution()\nnums1 = [3, 4, 6, 5]\nnums2 = [9, 1, 2, 5, 8, 3]\nk = 5\nprint(solution.maxNumber(nums1, nums2, k)) # Output: [9, 8, 6, 5, 3]","runtime":"173"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def prep(nums, k):\n drop = len(nums) - k\n out = []\n for num in nums:\n while drop and out and out[-1] < num:\n out.pop()\n drop -= 1\n out.append(num)\n return out[:k]\n \n def merge(a, b):\n return [max(a, b).pop(0) for _ in a + b]\n \n return max(merge(prep(nums1, i), prep(nums2, k - i))\n for i in range(k + 1)\n if i <= len(nums1) and k - i <= len(nums2))","runtime":"173"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def pick_max(nums, length):\n \"\"\"Pick the max subsequence of given length.\"\"\"\n stack = []\n drop = len(nums) - length\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:length]\n \n def merge(nums1, nums2):\n \"\"\"Merge two subsequences to form the maximum number.\"\"\"\n return [max(nums1, nums2).pop(0) for _ in range(len(nums1) + len(nums2))]\n\n max_num = []\n # i represents the number of elements we take from nums1, so k-i from nums2.\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n candidate = merge(pick_max(nums1, i), pick_max(nums2, k - i))\n max_num = max(max_num, candidate)\n \n return max_num","runtime":"187"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def maxSingle(nums: List[int], k: int) -> List[int]:\n \"\"\" Get the maximum number from single array `nums` with `k` digits. \"\"\"\n stack = []\n drop = len(nums) - k\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:k]\n\n def merge(A: List[int], B: List[int]) -> List[int]:\n \"\"\" Merge two arrays into the largest number. \"\"\"\n return [max(A, B).pop(0) for _ in range(len(A) + len(B)) if A or B]\n\n # Main function body starts here\n m, n = len(nums1), len(nums2)\n result = []\n \n for i in range(max(0, k - n), min(k, m) + 1):\n part1 = maxSingle(nums1, i)\n part2 = maxSingle(nums2, k - i)\n candidate = merge(part1, part2)\n if candidate > result:\n result = candidate\n \n return result","runtime":"187"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def getOneMax(digits: List[int], count: int) -> List[int]:\n stack = []\n for i, digit in enumerate(digits):\n while stack and digit > stack[-1] and count - len(stack) < len(digits) - i:\n stack.pop()\n stack.append(digit)\n while len(stack) > count:\n stack.pop()\n return stack\n def merge(first, second):\n f, s = 0, 0\n merged = []\n while f < len(first) and s < len(second):\n f_2, s_2 = f, s\n while f_2 < len(first) and s_2 < len(second) and first[f_2] == second[s_2]:\n f_2 += 1\n s_2 += 1\n if s_2 == len(second) or (f_2 < len(first) and s_2 < len(second) and first[f_2] > second[s_2]):\n merged.append(first[f])\n f += 1\n else:\n merged.append(second[s])\n s += 1\n if f < len(first):\n merged.extend(first[f:])\n if s < len(second):\n merged.extend(second[s:])\n return merged\n low_bound_1 = max(0, k - len(nums2))\n up_bound_1 = min(len(nums1), k)\n max_num = None\n for i in range(low_bound_1, up_bound_1 + 1):\n solve1 = getOneMax(nums1, i)\n solve2 = getOneMax(nums2, k - i)\n solution = merge(solve1, solve2)\n if max_num is None:\n max_num = solution\n continue\n for digit1, digit2 in zip(max_num, solution):\n if digit2 > digit1:\n max_num = solution\n if not digit2 == digit1:\n break\n return max_num","runtime":"201"},{"code":"def build_stack(nums, pos, stack, stack_size):\n n = len(nums)\n if n - pos <= stack_size - len(stack):\n for i in range(pos, n):\n stack.append(nums[i])\n elif stack and nums[pos] > stack[-1]:\n stack.pop()\n build_stack(nums, pos, stack, stack_size)\n else:\n if len(stack) < stack_size:\n stack.append(nums[pos])\n build_stack(nums, pos + 1, stack, stack_size)\n\n return stack\n\n\ndef merge(a, b):\n result = []\n i = j = 0\n l_a, l_b = len(a), len(b)\n while i < l_a and j < l_b:\n if a[i] > b[j]:\n result.append(a[i])\n i += 1\n elif a[i] < b[j]:\n result.append(b[j])\n j += 1\n else:\n result.append(a[i])\n u = 1\n while i + u < l_a and j + u < l_b and a[i + u] == b[j + u]:\n u += 1\n \n if i + u >= l_a:\n j += 1\n elif j + u >= l_b:\n i += 1\n elif a[i + u] > b[j + u]:\n i += 1\n else:\n j += 1\n\n if i < l_a:\n result += a[i:]\n elif j < l_b:\n result += b[j:]\n\n return result\n\n\ndef max_arr(a, b):\n for i in range(len(a)):\n if a[i] > b[i]:\n return a\n elif a[i] < b[i]:\n return b\n \n return a\n\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n m, n = len(nums1), len(nums2)\n max_num = [0] * k\n for k1 in range(max(0, k - n), min(k, m) + 1):\n k2 = k - k1\n # print(k1, k2)\n\n s1 = build_stack(nums1, 0, [], k1)\n s2 = build_stack(nums2, 0, [], k2)\n\n # print(s1, s2)\n\n num = merge(s1, s2)\n\n # tmp = num\n\n max_num = max_arr(max_num, num)\n\n # if max_num == num:\n # print('!')\n # print(num)\n\n return max_num\n","runtime":"201"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def f(nums: List[int], k: int) -> List[int]:\n n = len(nums)\n stk = [0] * k\n top = -1\n remain = n - k\n for x in nums:\n while top >= 0 and stk[top] < x and remain > 0:\n top -= 1\n remain -= 1\n if top + 1 < k:\n top += 1\n stk[top] = x\n else:\n remain -= 1\n return stk\n\n def compare(nums1: List[int], nums2: List[int], i: int, j: int) -> bool:\n if i >= len(nums1):\n return False\n if j >= len(nums2):\n return True\n if nums1[i] > nums2[j]:\n return True\n if nums1[i] < nums2[j]:\n return False\n return compare(nums1, nums2, i + 1, j + 1)\n\n def merge(nums1: List[int], nums2: List[int]) -> List[int]:\n m, n = len(nums1), len(nums2)\n i = j = 0\n ans = [0] * (m + n)\n for k in range(m + n):\n if compare(nums1, nums2, i, j):\n ans[k] = nums1[i]\n i += 1\n else:\n ans[k] = nums2[j]\n j += 1\n return ans\n\n m, n = len(nums1), len(nums2)\n l, r = max(0, k - n), min(k, m)\n ans = [0] * k\n for x in range(l, r + 1):\n arr1 = f(nums1, x)\n arr2 = f(nums2, k - x)\n arr = merge(arr1, arr2)\n if ans < arr:\n ans = arr\n return ans","runtime":"216"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def getMaxLexSubseq(lst: List[int], k: int) -> List[int]:\n stack = [] # monotonically decreasing stack\n\n for i, num in enumerate(lst):\n while len(stack) and stack[-1] < num and len(stack) - 1 + len(lst) - i >= k:\n stack.pop()\n \n if len(stack) < k:\n stack.append(num)\n\n return stack\n\n # merge a, b in a way to produce the maximum resulting array lexicographically (i.e element-by-element comparison). \n def maximalLexMerge(a: List[int], b: List[int]) -> List[int]:\n res = []\n a = deque(a)\n b = deque(b)\n while a or b:\n if a > b:\n res.append(a[0])\n a.popleft()\n else:\n res.append(b[0])\n b.popleft()\n return res\n\n\n maxNumber = []\n n = len(nums1)\n m = len(nums2)\n\n for numDigitsFrom1 in range(k + 1):\n numDigitsFrom2 = k - numDigitsFrom1\n \n if numDigitsFrom1 > n or numDigitsFrom2 > m:\n continue\n \n maxSubseq1 = getMaxLexSubseq(nums1, numDigitsFrom1)\n maxSubseq2 = getMaxLexSubseq(nums2, numDigitsFrom2)\n\n maxNumber = max(maxNumber, maximalLexMerge(maxSubseq1, maxSubseq2))\n\n\n return maxNumber\n \n\n\n\n\n \n \n\n ","runtime":"216"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def max_subsequence(nums, k):\n stack = []\n remaining = len(nums) - k\n for num in nums:\n while stack and stack[-1] < num and remaining > 0:\n stack.pop()\n remaining -= 1\n stack.append(num)\n return stack[:k]\n\n def merge(seq1, seq2):\n merged = []\n i, j = 0, 0\n while i < len(seq1) and j < len(seq2):\n if seq1[i:] > seq2[j:]:\n merged.append(seq1[i])\n i += 1\n else:\n merged.append(seq2[j])\n j += 1\n merged.extend(seq1[i:])\n merged.extend(seq2[j:])\n return merged\n\n max_num = []\n for i in range(k+1):\n if i <= len(nums1) and k-i <= len(nums2):\n seq1 = max_subsequence(nums1, i)\n seq2 = max_subsequence(nums2, k-i)\n max_num = max(max_num, merge(seq1, seq2))\n return max_num","runtime":"230"},{"code":"from typing import List\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n n = len(nums1)\n m = len(nums2)\n ans = [0] * k\n for i in range(max(0, k - m), k + 1):\n if i <= n:\n candidate = self.merge(self.maxArray(nums1, i), self.maxArray(nums2, k - i), k)\n if self.greater(candidate, 0, ans, 0):\n ans = candidate\n return ans\n\n def merge(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n ans = [0] * k\n i = j = r = 0\n while r < k:\n if self.greater(nums1, i, nums2, j):\n ans[r] = nums1[i]\n i += 1\n else:\n ans[r] = nums2[j]\n j += 1\n r += 1\n return ans\n\n def greater(self, nums1: List[int], i: int, nums2: List[int], j: int) -> bool:\n while i < len(nums1) and j < len(nums2) and nums1[i] == nums2[j]:\n i += 1\n j += 1\n return j == len(nums2) or (i < len(nums1) and nums1[i] > nums2[j])\n\n def maxArray(self, nums: List[int], k: int) -> List[int]:\n n = len(nums)\n ans = [0] * k\n j = 0\n for i in range(n):\n while n - i + j > k and j > 0 and ans[j - 1] < nums[i]:\n j -= 1\n if j < k:\n ans[j] = nums[i]\n j += 1\n return ans\n\n# Example usage\n# solution = Solution()\n# nums1 = [3, 4, 6, 5]\n# nums2 = [9, 1, 2, 5, 8, 3]\n# k = 5\n# print(solution.maxNumber(nums1, nums2, k))\n","runtime":"230"},{"code":"def build_stack(nums, pos, stack, stack_size):\n n = len(nums)\n if n - pos <= stack_size - len(stack):\n for i in range(pos, n):\n stack.append(nums[i])\n elif stack and nums[pos] > stack[-1]:\n stack.pop()\n build_stack(nums, pos, stack, stack_size)\n else:\n if len(stack) < stack_size:\n stack.append(nums[pos])\n build_stack(nums, pos + 1, stack, stack_size)\n\n return stack\n\n\ndef merge(a, b):\n result = []\n i = j = 0\n l_a, l_b = len(a), len(b)\n while i < l_a and j < l_b:\n if a[i] > b[j]:\n result.append(a[i])\n i += 1\n elif a[i] < b[j]:\n result.append(b[j])\n j += 1\n else:\n result.append(a[i])\n u = 1\n while i + u < l_a and j + u < l_b and a[i + u] == b[j + u]:\n u += 1\n \n if i + u >= l_a:\n j += 1\n elif j + u >= l_b:\n i += 1\n elif a[i + u] > b[j + u]:\n i += 1\n else:\n j += 1\n\n if i < l_a:\n result += a[i:]\n elif j < l_b:\n result += b[j:]\n\n return result\n\n\ndef max_arr(a, b):\n for i in range(len(a)):\n if a[i] > b[i]:\n return a\n elif a[i] < b[i]:\n return b\n \n return a\n\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n m, n = len(nums1), len(nums2)\n max_num = [0] * k\n for k1 in range(max(0, k - n), min(k, m) + 1):\n k2 = k - k1\n\n s1 = build_stack(nums1, 0, [], k1)\n s2 = build_stack(nums2, 0, [], k2)\n\n num = merge(s1, s2)\n max_num = max_arr(max_num, num)\n\n return max_num\n","runtime":"244"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def max_number_from_single_array(nums, k):\n stack = []\n drop = len(nums) - k\n for num in nums:\n while drop > 0 and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:k]\n\n def merge(nums1, nums2):\n merged = []\n while nums1 or nums2:\n if nums1 > nums2:\n merged.append(nums1[0])\n nums1 = nums1[1:]\n else:\n merged.append(nums2[0])\n nums2 = nums2[1:]\n return merged\n\n res = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n max1 = max_number_from_single_array(nums1, i)\n max2 = max_number_from_single_array(nums2, k - i)\n res = max(res, merge(max1, max2))\n return res\n\n# Example usage:\nsolution = Solution()\nnums1 = [3, 4, 6, 5]\nnums2 = [9, 1, 2, 5, 8, 3]\nk = 5\nprint(solution.maxNumber(nums1, nums2, k)) # Output: [9, 8, 6, 5, 3]","runtime":"244"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def max_number_from_single_array(nums, k):\n drop = len(nums) - k\n stack = []\n for num in nums:\n while drop > 0 and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:k]\n\n def merge(nums1, nums2):\n merged = []\n while nums1 or nums2:\n if nums1 > nums2:\n merged.append(nums1[0])\n nums1 = nums1[1:]\n else:\n merged.append(nums2[0])\n nums2 = nums2[1:]\n return merged\n\n max_number = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n max_from_nums1 = max_number_from_single_array(nums1, i)\n max_from_nums2 = max_number_from_single_array(nums2, k - i)\n merged = merge(max_from_nums1, max_from_nums2)\n max_number = max(max_number, merged)\n return max_number\n\n# Example usage:\nsolution = Solution()\nnums1 = [3, 4, 6, 5]\nnums2 = [9, 1, 2, 5, 8, 3]\nk = 5\nprint(solution.maxNumber(nums1, nums2, k)) # Output: [9, 8, 6, 5, 3]","runtime":"258"},{"code":"def merge(lhs, rhs):\n ans = []\n i, j = 0, 0\n while i < len(lhs) and j < len(rhs):\n if lhs[i:] > rhs[j:]:\n ans.append(lhs[i])\n i += 1\n else:\n ans.append(rhs[j])\n j += 1\n return ans + lhs[i:] + rhs[j:]\n\n\ndef maxNumber(nums, k):\n ans = [0] * k\n i, j, n = 0, 0, len(nums)\n while i < n:\n while k - j < n - i and j > 0 and ans[j-1] < nums[i]:\n j -= 1\n if j < k:\n ans[j] = nums[i]\n j += 1\n i += 1\n return ans\n\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], l: int) -> List[int]:\n ans = [0] * l\n for k in range(max(0, l - len(nums2)), min(l, len(nums1)) + 1):\n lhs = maxNumber(nums1, k)\n rhs = maxNumber(nums2, l - k)\n ans = max(ans, merge(lhs, rhs))\n return ans\n","runtime":"258"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n nums1 = list(enumerate(nums1))\n nums2 = list(enumerate(nums2))\n\n def get_max_num(nums, t):\n stack = []\n for i, x in nums:\n min_length = max(0, t - len(nums) + i) \n while stack and stack[-1] < x and len(stack) > min_length:\n stack.pop()\n stack.append(x)\n return stack[:t]\n \n def combine(arr1, arr2):\n i = j = 0\n p, q = len(arr1), len(arr2)\n res = []\n while i < p or j < q:\n if i == p:\n res.extend(arr2[j:])\n break\n elif j == q:\n res.extend(arr1[i:])\n break\n elif arr1[i] > arr2[j]:\n res.append(arr1[i])\n i += 1\n elif arr1[i] < arr2[j]:\n res.append(arr2[j])\n j += 1\n elif arr1[i:] > arr2[j:]:\n res.append(arr1[i])\n i += 1\n else:\n res.append(arr2[j])\n j += 1\n\n return res\n\n \n ans = []\n for i in range(k+1):\n if i > len(nums1) or k-i > len(nums2):\n continue\n\n m1 = get_max_num(nums1, i) if i > 0 else []\n m2 = get_max_num(nums2, k-i) if k-i > 0 else []\n ans.append(combine(m1, m2))\n \n return sorted(ans)[-1]\n\n \n ","runtime":"272"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def merge(n1, n2):\n res = []\n while (n1 or n2) :\n if n1>n2:\n res.append(n1[0])\n n1 = n1[1:]\n else:\n res.append(n2[0])\n n2 = n2[1:]\n return res\n \n def findmax(nums, length):\n l = []\n maxpop = len(nums)-length\n for i in range(len(nums)):\n while maxpop>0 and len(l) and nums[i]>l[-1]:\n l.pop()\n maxpop -= 1\n l.append(nums[i])\n return l[:length]\n \n n1 = len(nums1)\n n2 = len(nums2)\n res = [0]*k\n for i in range(k+1):\n j = k-i\n if i>n1 or j>n2: continue\n l1 = findmax(nums1, i)\n l2 = findmax(nums2, j)\n res = max(res, merge(l1,l2))\n return res","runtime":"272"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def maxNumberCount(nums, count):\n i = 0\n j = 0\n ans = []\n while i < count:\n temp = nums[j:len(nums) - count + i + 1]\n max_ele = max(temp)\n j += temp.index(max_ele) + 1\n ans.append(max_ele)\n i += 1\n return ans\n \n def createMax(x, y):\n m = []\n while len(x) > 0 and len(y) > 0:\n if x > y:\n m.append(x.pop(0))\n else:\n m.append(y.pop(0))\n while len(x) > 0:\n m.append(x.pop(0))\n\n while len(y) > 0:\n m.append(y.pop(0))\n return m\n \n max_number = []\n for i in range(min(k+1, len(nums1) + 1)):\n if k - i > len(nums2):\n continue\n p = maxNumberCount(nums1, i)\n q = maxNumberCount(nums2, k - i)\n max_number = max(max_number, createMax(p, q))\n return max_number","runtime":"286"},{"code":"from typing import List\n\nclass Solution:\n def maxNumber(self, nums1, nums2, k):\n def getMaxOrder(nums, n, total, res):\n \"\"\"\n Extract the maximum subsequence of length n from nums using a monotonic stack.\n \"\"\"\n for i, v in enumerate(nums):\n # Remove elements from the end of res if they are smaller than the current element\n # and if we can still achieve the length n with remaining elements.\n while res and len(res) + total - i > n and res[-1] < v:\n res.pop()\n # Add the current element to res if we haven't yet reached length n.\n if len(res) < n:\n res.append(v)\n return res\n\n def merge(nums1, nums2, ans):\n \"\"\"\n Merge two subsequences to form the largest lexicographical sequence.\n \"\"\"\n while nums1 or nums2:\n # Append the larger element from the front of nums1 or nums2 to ans.\n if nums1 > nums2:\n ans.append(nums1[0])\n nums1 = nums1[1:]\n else:\n ans.append(nums2[0])\n nums2 = nums2[1:]\n return ans\n\n n1, n2 = len(nums1), len(nums2)\n res = []\n\n # Iterate over all possible lengths for the subsequence from nums1.\n for i in range(max(0, k - n2), min(k, n1) + 1):\n # Get the maximum subsequences of length i from nums1 and k-i from nums2.\n maxSeq1 = getMaxOrder(nums1, i, n1, [])\n maxSeq2 = getMaxOrder(nums2, k - i, n2, [])\n # Merge the two subsequences to get the largest lexicographical result.\n ans = merge(maxSeq1, maxSeq2, [])\n # Update the result if the current merged result is larger.\n res = max(ans, res)\n \n return res\n","runtime":"286"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def getLexMax(nums, k):\n stack = []\n for idx, num in enumerate(nums):\n while stack and len(nums) - idx + len(stack) > k and stack[-1] < num:\n stack.pop()\n if len(stack) < k:\n stack.append(num)\n return stack\n\n def merge(nums1, nums2):\n merged = []\n i, j = 0, 0\n while i < len(nums1) or j < len(nums2):\n if i >= len(nums1):\n merged.append(nums2[j])\n j += 1\n elif j >= len(nums2):\n merged.append(nums1[i])\n i += 1\n elif nums1[i:] > nums2[j:]:\n merged.append(nums1[i])\n i += 1\n else:\n merged.append(nums2[j])\n j += 1\n return merged\n \n maxim = []\n for i in range(max(0, k-len(nums2)), min(len(nums1), k) + 1):\n j = k - i\n subs1 = getLexMax(nums1, i)\n subs2 = getLexMax(nums2, j)\n merged = merge(subs1, subs2)\n maxim = max(maxim, merged)\n return maxim\n\n","runtime":"300"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def get_max_subseq(nums, k):\n stack = []\n for i, num in enumerate(nums):\n while stack and len(nums) - i + len(stack) > k and stack[-1] < num:\n stack.pop()\n if len(stack) < k:\n stack.append(num)\n return stack\n \n def merge(nums1, nums2):\n merged = []\n i, j = 0, 0\n while i < len(nums1) or j < len(nums2):\n if i >= len(nums1):\n merged.append(nums2[j])\n j += 1\n elif j >= len(nums2):\n merged.append(nums1[i])\n i += 1\n elif nums1[i:] > nums2[j:]:\n merged.append(nums1[i])\n i += 1\n else:\n merged.append(nums2[j])\n j += 1\n return merged\n \n ans = []\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\n j = k - i\n subseq1 = get_max_subseq(nums1, i)\n subseq2 = get_max_subseq(nums2, j)\n merged = merge(subseq1, subseq2)\n ans = max(ans, merged)\n return ans\n","runtime":"300"},{"code":"class Solution:\n def maxNumber(self, a: List[int], b: List[int], k: int) -> List[int]:\n def g(x, k):\n s = []\n for i, n in enumerate(x):\n while s and len(x) - i + len(s) > k and s[-1] < n: s.pop()\n if len(s) < k: s.append(n)\n return s\n def m(x, y):\n z, i, j = [], 0, 0\n while i < len(x) or j < len(y):\n if i >= len(x): z.append(y[j]); j += 1\n elif j >= len(y): z.append(x[i]); i += 1\n elif x[i:] > y[j:]: z.append(x[i]); i += 1\n else: z.append(y[j]); j += 1\n return z\n \n r = []\n for i in range(max(0, k - len(b)), min(len(a), k) + 1):\n j = k - i\n s1, s2 = g(a, i), g(b, j)\n mrg = m(s1, s2)\n r = max(r, mrg)\n return r\n","runtime":"314"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n L1, L2, S, L = len(nums1), len(nums2), -1, []\n def find(n, N):\n if n==0: return []\n elif n==len(N): return N\n stack = []\n for i, v in enumerate(N):\n while stack and len(stack)+len(N)-i>n and stack[-1]<v: stack.pop()\n stack.append(v) \n return stack[:n]\n def merge(s1, s2):\n N, lst, = 0, []\n while s1 or s2:\n v1 = s1[0] if s1 else -1\n v2 = s2[0] if s2 else -1\n if v1>v2: \n lst.append(v1)\n s1.pop(0)\n elif v2>v1:\n lst.append(v2)\n s2.pop(0)\n else:\n j, f = 1, False\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j+=1\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\n elif j<len(s1): f = True\n if f: \n lst.append(v1)\n s1.pop(0)\n else:\n lst.append(v2)\n s2.pop(0)\n for v in lst: N = N*10 + v\n return N, lst \n for j in range(max(0, k-L2), min(L1, k)+1):\n s1 = find(j, nums1)\n s2 = find(k-j, nums2)\n N, lst = merge(s1.copy(), s2.copy())\n if N>S: S, L = N, lst\n return L ","runtime":"314"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n def fn(arr, k):\n \"\"\"Return largest sub-sequence of arr of size k.\"\"\"\n ans = []\n for i, x in enumerate(arr): \n while ans and ans[-1] < x and len(ans) + len(arr) - i > k: ans.pop()\n if len(ans) < k: ans.append(x)\n return ans\n \n ans = [0] * k\n for i in range(k+1): \n if k - len(nums2) <= i <= len(nums1): \n val1 = fn(nums1, i)\n val2 = fn(nums2, k-i)\n cand = []\n i1 = i2 = 0\n while i1 < len(val1) or i2 < len(val2): \n if val1[i1:] >= val2[i2:]: \n cand.append(val1[i1])\n i1 += 1\n else: \n cand.append(val2[i2])\n i2 += 1\n ans = max(ans, cand)\n return ans","runtime":"329"},{"code":"class Solution(object):\n def maxNumber(self, nums1, nums2, k):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k: int\n :rtype: List[int]\n \"\"\"\n def getMax(nums, t):\n ans = []\n size = len(nums)\n for x in range(size):\n while ans and len(ans) + size - x > t and ans[-1] < nums[x]:\n ans.pop()\n if len(ans) < t:\n ans += nums[x],\n return ans\n\n def merge(nums1, nums2):\n ans = []\n while nums1 or nums2:\n if nums1 > nums2:\n ans += nums1[0],\n nums1 = nums1[1:]\n else:\n ans += nums2[0],\n nums2 = nums2[1:]\n return ans\n \n len1, len2 = len(nums1), len(nums2)\n res = []\n for x in range(max(0, k - len2), min(k, len1) + 1):\n tmp = merge(getMax(nums1, x), getMax(nums2, k - x))\n res = max(tmp, res)\n return res\n\n \n ","runtime":"343"},{"code":"class Solution:\r\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\r\n return self.fun2(nums1, nums2, k)\r\n\r\n def fun2(self, nums1, nums2, k):\r\n if k == len(nums1) + len(nums2):\r\n return self.join(nums1, nums2)\r\n res = [0]\r\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\r\n a = self.getnums(nums1, i)\r\n b = self.getnums(nums2, k - i)\r\n ans = self.join(a, b)\r\n if ans > res:\r\n res = ans\r\n\r\n return res\r\n\r\n def fun1(self, nums1, nums2, k):\r\n ln = len(nums1)\r\n a = [(n, ln - k - 1) for k, n in enumerate(nums1)]\r\n ln = len(nums2)\r\n b = [(n, ln - k - 1) for k, n in enumerate(nums2)]\r\n a.sort()\r\n b.sort()\r\n\r\n a.insert(0, (-1, len(nums1)))\r\n b.insert(0, (-1, len(nums2)))\r\n resa = [(-1, len(nums1))]\r\n resb = [(-1, len(nums2))]\r\n while k > 0 and a and b:\r\n an, ak = a[-1] if a else (-1, 0)\r\n bn, bk = b[-1] if b else (-1, 0)\r\n if an >= bn:\r\n if ak < resa[-1][1] and ak + resb[-1][1] + 1 >= k:\r\n resa.append((an, ak))\r\n k -= 1\r\n a.pop()\r\n else:\r\n if bk < resb[-1][1] and bk + resa[-1][1] + 1 >= k:\r\n resb.append((bn, bk))\r\n k -= 1\r\n b.pop()\r\n\r\n res = []\r\n i = j = 1\r\n while i < len(resa) and j < len(resb):\r\n if resa[i] >= resb[j]:\r\n res.append(resa[i])\r\n i += 1\r\n else:\r\n res.append(resb[j])\r\n j += 1\r\n\r\n return [d[0] for d in res + resa[i:] + resb[j:]]\r\n\r\n def getnums(self, nums, k):\r\n if k <= 0 or not nums:\r\n return []\r\n if k == len(nums):\r\n return nums.copy()\r\n m = max(nums)\r\n n = nums.index(m)\r\n if len(nums) - n == k:\r\n return nums[n:]\r\n elif len(nums) - n < k:\r\n return self.getnums(nums[:n], k - len(nums) + n) + nums[n:]\r\n else:\r\n return [m] + self.getnums(nums[n + 1 :], k - 1)\r\n\r\n def join(self, nums1, nums2):\r\n return [max(nums1, nums2).pop(0) for _ in nums1 + nums2]\r\n\r\n def join2(self, nums1, nums2):\r\n res = []\r\n i = j = 0\r\n while i < len(nums1) and j < len(nums2):\r\n if nums1[i:] >= nums2[j:]:\r\n res.append(nums1[i])\r\n i += 1\r\n elif nums1[i:] < nums2[j:]:\r\n res.append(nums2[j])\r\n j += 1\r\n\r\n return res + nums1[i:] + nums2[j:]\r\n\r\n","runtime":"343"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n def fn(arr, k):\n \"\"\"Return largest sub-sequence of arr of size k.\"\"\"\n ans = []\n for i, x in enumerate(arr): \n while ans and ans[-1] < x and len(ans) + len(arr) - i > k: ans.pop()\n if len(ans) < k: ans.append(x)\n return ans\n \n ans = [0] * k\n for i in range(k+1): \n if k - len(nums2) <= i <= len(nums1): \n val1 = fn(nums1, i)\n val2 = fn(nums2, k-i)\n cand = []\n i1 = i2 = 0\n while i1 < len(val1) or i2 < len(val2): \n if val1[i1:] >= val2[i2:]: \n cand.append(val1[i1])\n i1 += 1\n else: \n cand.append(val2[i2])\n i2 += 1\n ans = max(ans, cand)\n return ans ","runtime":"357"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n ans = None\n for i in range(min(len(nums1) + 1, k + 1)):\n if k - i > len(nums2):\n continue\n\n num1 = self.max_number(nums1, i)\n num2 = self.max_number(nums2, k - i)\n\n cand = self.merge(num1, num2)\n ans = cand if ans is None else max(ans, cand)\n return ans\n\n def merge(self, num1, num2):\n ans = []\n i = 0\n j = 0\n while i < len(num1) and j < len(num2):\n if num1[i] > num2[j] or num1[i:] > num2[j:]:\n ans.append(num1[i])\n i += 1\n else:\n ans.append(num2[j])\n j += 1\n while i < len(num1):\n ans.append(num1[i])\n i += 1\n while j < len(num2):\n ans.append(num2[j])\n j += 1\n\n return ans\n\n def max_number(self, nums, k):\n h = []\n n = len(nums)\n\n cur = 0\n ans = []\n last_i = -1\n while k > 0:\n while cur <= n - k:\n heapq.heappush(h, (-nums[cur], cur))\n cur += 1\n while h[0][1] <= last_i:\n heapq.heappop(h)\n top = heapq.heappop(h)\n ans.append(-top[0]) \n last_i = top[1]\n k -= 1\n\n return ans\n \n \n","runtime":"357"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n res = []\n for select1 in range(k+1):\n select2 = k - select1\n if select2 > len(nums2) or select1 > len(nums1):\n continue\n\n top1 = self.selectMax(nums1, select1)\n top2 = self.selectMax(nums2, select2)\n\n # print(\"here\")\n # print(top1)\n # print(top2)\n cand = self.mergeNums(top1, top2)\n # print(cand)\n res = max(res, cand)\n\n return res\n\n\n def selectMax(self, nums, s):\n # select in a range such that len(nums) - len(range) = s - 1\n # len(range) = len(remaining) - s + 1\n # len(range) = len(nums) - maxISelected - s + 1\n # nums[maxISelected: len(nums) - maxISelected - s + 1] \n # repeat this equation between selectedI + 1 \n res = []\n maxISelected = 0\n sInit = s\n while len(res) < sInit:\n maxI = 0\n mx = -1\n # print(maxISelected, len(nums) - s)\n for i in range(maxISelected, len(nums) - s + 1):\n if nums[i] > mx:\n mx = nums[i]\n maxI = i\n maxISelected = maxI +1\n res.append(mx)\n s -= 1\n return res\n \n def mergeNums(self, nums1, nums2):\n res = []\n \n def compare_prefix(n1, n2):\n l1, l2 = len(n1), len(n2)\n for i in range(min(l1, l2)):\n if n1[i] != n2[i]:\n return n1[i] < n2[i]\n return l1 < l2\n \n while nums1 and nums2:\n if nums1[0] == nums2[0]:\n if compare_prefix(nums1, nums2):\n res.append(nums2.pop(0))\n else:\n res.append(nums1.pop(0))\n elif nums1[0] > nums2[0]:\n res.append(nums1.pop(0))\n else:\n res.append(nums2.pop(0))\n \n # Append the remaining items from nums1 or nums2\n res.extend(nums1 if nums1 else nums2)\n \n return res","runtime":"371"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n\n def array(arr,size):\n\n stack=[]\n\n temp=len(arr) - size\n\n for i in arr:\n while temp>0 and stack and stack[-1]<i:\n stack.pop()\n temp-=1\n \n stack.append(i)\n \n return stack[:size]\n \n def merge(arr1, arr2):\n result = []\n while arr1 or arr2:\n if arr1 > arr2:\n result.append(arr1.pop(0))\n else:\n result.append(arr2.pop(0))\n return result\n\n n = len(nums1)\n m = len(nums2)\n\n ans=[]\n for x in range(min(k+1,n+1)):\n\n arr1 = array(nums1,x)\n arr2 = array(nums2,k-x)\n\n candidate = merge(arr1,arr2)\n if len(candidate)<=k and (candidate > ans or len(candidate) > len(ans)):\n ans = candidate\n\n \n return ans\n\n ","runtime":"371"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def merge(arr1, arr2):\n res, i, j = [], 0, 0\n while i < len(arr1) and j < len(arr2):\n if arr1[i:] >= arr2[j:]:\n res.append(arr1[i])\n i += 1\n else: \n res.append(arr2[j])\n j += 1\n if i < len(arr1): res += arr1[i:]\n elif j < len(arr2): res += arr2[j:]\n return res \n \n def makeArr(arr, l):\n i, res = 0, []\n for r in range(l - 1, -1, -1):\n num, i = max(arr[i:-r] or arr[i:])\n i = -i + 1\n res.append(num)\n return res\n \n nums1, nums2, choices = [(num, -i) for i, num in enumerate(nums1)], [(num, -i) for i, num in enumerate(nums2)], []\n for m in range(k + 1):\n if m > len(nums1) or k - m > len(nums2): continue\n arr1, arr2 = makeArr(nums1, m), makeArr(nums2, k - m) \n choices.append(merge(arr1, arr2))\n return max(choices)","runtime":"385"},{"code":"class Solution:\r\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\r\n return self.fun2(nums1, nums2, k)\r\n\r\n def fun2(self, nums1, nums2, k):\r\n if k == len(nums1) + len(nums2):\r\n return self.join(nums1, nums2)\r\n res = [0]\r\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\r\n a = self.getnums(nums1, i)\r\n b = self.getnums(nums2, k - i)\r\n ans = self.join(a, b)\r\n if ans > res:\r\n res = ans\r\n\r\n return res\r\n\r\n def fun1(self, nums1, nums2, k):\r\n ln = len(nums1)\r\n a = [(n, ln - k - 1) for k, n in enumerate(nums1)]\r\n ln = len(nums2)\r\n b = [(n, ln - k - 1) for k, n in enumerate(nums2)]\r\n a.sort()\r\n b.sort()\r\n\r\n a.insert(0, (-1, len(nums1)))\r\n b.insert(0, (-1, len(nums2)))\r\n resa = [(-1, len(nums1))]\r\n resb = [(-1, len(nums2))]\r\n while k > 0 and a and b:\r\n an, ak = a[-1] if a else (-1, 0)\r\n bn, bk = b[-1] if b else (-1, 0)\r\n if an >= bn:\r\n if ak < resa[-1][1] and ak + resb[-1][1] + 1 >= k:\r\n resa.append((an, ak))\r\n k -= 1\r\n a.pop()\r\n else:\r\n if bk < resb[-1][1] and bk + resa[-1][1] + 1 >= k:\r\n resb.append((bn, bk))\r\n k -= 1\r\n b.pop()\r\n\r\n res = []\r\n i = j = 1\r\n while i < len(resa) and j < len(resb):\r\n if resa[i] >= resb[j]:\r\n res.append(resa[i])\r\n i += 1\r\n else:\r\n res.append(resb[j])\r\n j += 1\r\n\r\n return [d[0] for d in res + resa[i:] + resb[j:]]\r\n\r\n def getnums(self, nums, k):\r\n if k <= 0:\r\n return []\r\n if k == len(nums):\r\n return nums\r\n m = max(nums)\r\n n = nums.index(m)\r\n if len(nums) - n == k:\r\n return nums[n:]\r\n elif len(nums) - n < k:\r\n return self.getnums(nums[:n], k - len(nums) + n) + nums[n:]\r\n else:\r\n return [m] + self.getnums(nums[n + 1 :], k - 1)\r\n\r\n def join(self, nums1, nums2):\r\n res = []\r\n i = j = 0\r\n while i < len(nums1) and j < len(nums2):\r\n if nums1[i:] >= nums2[j:]:\r\n res.append(nums1[i])\r\n i += 1\r\n elif nums1[i:] < nums2[j:]:\r\n res.append(nums2[j])\r\n j += 1\r\n\r\n return res + nums1[i:] + nums2[j:]\r\n\r\n","runtime":"399"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def getMaxSeq(nums, kk):\n stk = []\n n = len(nums)\n for i in range(len(nums)):\n while stk and stk[-1] < nums[i] and len(stk) + n - i > kk:\n stk.pop()\n stk.append(nums[i])\n return stk[:kk]\n\n def greater(a1, a2):\n for i in range(min(len(a1), len(a2))):\n if a1[i] > a2[i]:\n return True\n elif a1[i] < a2[i]:\n return False\n return True if len(a1) > len(a2) else False\n\n # merge nums1 and nums2\n def merge(sub1, sub2):\n i1, i2 = 0, 0\n res = []\n for kk in range(k):\n if greater(sub1[i1:], sub2[i2:]):\n res.append(sub1[i1])\n i1 += 1\n else:\n res.append(sub2[i2])\n i2 += 1\n return res\n \n res = []\n for i in range(k + 1):\n if i > len(nums1) or k - i > len(nums2):\n continue\n sub1 = getMaxSeq(nums1, i)\n sub2 = getMaxSeq(nums2, k - i)\n sub = merge(sub1, sub2)\n # print(sub1, sub2, sub)\n if len(res) == 0 or greater(sub, res):\n res = sub\n return res\n \n","runtime":"413"},{"code":"def createMaxNum(L,k):\n # returns maximum number one can make of all different lengths till k\n n = len(L)\n # Let A[i][j] be max numer one can make with subsequence of A[:i+1] of length j\n # A[i][j] = 0 if i+1 < j\n # A[i][0] = 0\n A = [[0]*(k+1) for i in range(n)]\n for j in range(1,k+1):\n for i in range(j-1,n):\n prev = A[i-1][j-1]\n x = 10*prev + L[i] #if L[i] is to be included\n y = A[i-1][j] # otherwise\n A[i][j] = max(x,y)\n return A[n-1]\n\n\ndef merge(A,B):\n n,m = len(A),len(B)\n if n == 0:return B\n if m == 0:return A\n C = []\n i = 0\n j = 0\n while i < n and j < m:\n I = i\n J = j\n while I < n and J < m and A[I] == B[J]:\n I += 1\n J += 1\n if I >= n and J < m:\n C.append(B[j])\n j += 1\n elif I < n and J >= m:\n C.append(A[i])\n i += 1\n elif I >= n and J >= m:\n C.append(A[i])\n i += 1\n elif A[I] > B[J]:\n C.append(A[i])\n i += 1\n elif A[I] < B[J]:\n C.append(B[j])\n j += 1\n else:\n raise ValueError()\n C.extend(A[i:])\n C.extend(B[j:])\n return C \n\ndef solve(L1,L2,k):\n A = createMaxNum(L1,k)\n B = createMaxNum(L2,k)\n #print(A)\n #print(B)\n if len(L1)==0:\n return [int(x) for x in str(B[-1])]\n if len(L2)==0:\n return [int(x) for x in str(A[-1])]\n if L2 ==[0]*len(L2):\n return [int(x) for x in A[-1]] + L2\n if L1 ==[0]*len(L1):\n return [int(x) for x in B[-1]] + L1\n toret = [A[-1],B[-1]]\n for x in range(1,k):\n y = k - x\n if A[x]:a = list(str(A[x]))\n else: a = []\n if B[y]:b = list(str(B[y]))\n else: b = []\n c = merge(a,b)\n c = \"\".join(c)\n if c:c = int(c)\n else: c = 0\n toret.append(c)\n #print(toret)\n return max(toret)\n\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n x = solve(nums1,nums2,k)\n x = [int(y) for y in str(x)]\n return x ","runtime":"427"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n nums1_max = self.singleArraryMaxIndex(nums1)\n nums2_max = self.singleArraryMaxIndex(nums2)\n res = []\n for i in range(min(k + 1, len(nums1) + 1)):\n res1 = self.singleMaxK(nums1, nums1_max, i)\n res2 = self.singleMaxK(nums2, nums2_max, k - i)\n temp = self.constructArray(res1, res2)\n if len(res) == 0:\n res = temp[:]\n else:\n temp_n = self.arrayToInt(temp)\n res_n = self.arrayToInt(res)\n if temp_n > res_n:\n res = temp[:]\n return res\n\n def arrayToInt(self, nums: List[int]) -> int:\n res = 0\n for i in nums:\n res = res * 10 + i\n return res\n\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\n i1, i2 = 0, 0\n n1, n2 = len(nums1), len(nums2)\n res = []\n while i1 < n1 or i2 < n2:\n if i1 < n1 and i2 < n2:\n if nums1[i1] > nums2[i2]:\n res.append(nums1[i1])\n i1 += 1\n elif nums1[i1] < nums2[i2]:\n res.append(nums2[i2])\n i2 += 1\n else:\n temp_i1, temp_i2 = i1+1, i2+1\n while temp_i1 < n1 and temp_i2 < n2 and nums1[temp_i1] == nums2[temp_i2]:\n temp_i1 += 1\n temp_i2 += 1\n if temp_i1 < n1 and temp_i2 < n2:\n if nums1[temp_i1] > nums2[temp_i2]:\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n elif temp_i1 < n1:\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n elif i1 < n1:\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n return res\n\n def singleMaxK(self, nums: List[int], max_index: List[List[int]], k: int) -> List[int]:\n n = len(nums)\n res = []\n start, end = 0, n - k\n while len(res) < k and start <= end:\n res.append(nums[max_index[start][end]])\n start = max_index[start][end] + 1\n end += 1\n return res\n\n def singleArraryMaxIndex(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n res = [[0] * n for i in range(n)]\n for i in range(n):\n for j in range(i, n):\n if j == i:\n res[i][j] = i\n else:\n res[i][j] = j if nums[j] > nums[res[i][j-1]] else res[i][j-1]\n return res","runtime":"442"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n ln2=len(nums2)\n @cache\n def max2(i):\n s=[]\n ls=0\n maxpop=ln2-i\n maxi=[]\n for x in nums2:\n while maxpop>0 and s and s[-1]<x:\n s.pop()\n ls-=1\n maxpop-=1\n if ls<i:\n s.append(x)\n ls+=1\n else:\n maxpop-=1\n if maxi<s:\n maxi=s.copy()\n return maxi\n \n ln1=len(nums1)\n @cache\n def max1(i):\n s=[]\n ls=0\n maxpop=ln1-i\n maxi=[]\n for x in nums1:\n while maxpop>0 and s and s[-1]<x:\n s.pop()\n ls-=1\n maxpop-=1\n if ls<i:\n s.append(x)\n ls+=1\n else:\n maxpop-=1\n if maxi<s:\n maxi=s.copy()\n return maxi\n\n\n answer=[]\n def merge(i,j):\n nonlocal answer\n if i==0:\n if max2(j)>answer:\n answer=max2(j).copy()\n return\n if j==0:\n if max1(i)>answer:\n answer=max1(i).copy()\n return\n l1=max1(i)\n l2=max2(j)\n ii,jj=0,0\n l=[]\n \n while l1 or l2:\n if l1>l2:\n l.append(l1[0])\n l1=l1[1:]\n else:\n l.append(l2[0])\n l2=l2[1:]\n\n if l>answer:\n answer=l.copy()\n \n for i in range(ln1+1):\n if 0<=k-i<=ln2:\n merge(i,k-i)\n\n return answer\n\n \n ","runtime":"456"},{"code":"from typing import List\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def findMaxSubArray(array, n):\n drop = len(array) - n\n stack = []\n for i in range(len(array)):\n while stack and stack[-1] < array[i] and drop > 0:\n stack.pop()\n drop -= 1\n stack.append(array[i])\n return stack[:n]\n \n def merge(subsequence1, subsequence2):\n merged = []\n while subsequence1 or subsequence2:\n if subsequence1 > subsequence2:\n merged.append(subsequence1.pop(0))\n else:\n merged.append(subsequence2.pop(0))\n return merged\n \n res = [0] * k\n for i in range(k + 1):\n maxSubArray1 = findMaxSubArray(nums1, i)\n maxSubArray2 = findMaxSubArray(nums2, k - i)\n if len(maxSubArray1) + len(maxSubArray2) != k:\n continue\n res = max(res, merge(maxSubArray1[:], maxSubArray2[:]))\n \n return res\n\n","runtime":"470"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def dfs(nums,x):\n stack, n = [], len(nums)\n\n for i in range(n):\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\n stack.pop()\n\n if len(stack) < x:\n stack.append(nums[i])\n\n return stack \n\n def merge(ans1,ans2):\n if len(ans1) + len(ans2) < k:\n return []\n \n result = []\n\n while ans1 or ans2:\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\n result.append(cur)\n\n return result \n\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))","runtime":"484"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def dfs(nums,x):\n stack, n = [], len(nums)\n\n for i in range(n):\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\n stack.pop()\n\n if len(stack) < x:\n stack.append(nums[i])\n\n return stack \n\n def merge(ans1,ans2):\n if len(ans1) + len(ans2) < k:\n return []\n \n result = []\n\n while ans1 or ans2:\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\n result.append(cur)\n\n return result \n\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))","runtime":"512"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n\n def findMono(nums, x):\n stack, n = [], len(nums)\n\n for i in range(n):\n while stack and stack[-1] < nums[i] and n - i + len(stack) > x:\n stack.pop()\n if len(stack) < x:\n stack.append(nums[i])\n return stack\n\n def merge(ans1, ans2):\n res = []\n if len(ans1) + len(ans2) < k:\n return res\n while ans1 or ans2:\n res.append(ans1.pop(0) if ans1 > ans2 else ans2.pop(0))\n return res\n\n\n return max(merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1))","runtime":"526"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def dfs(nums, x):\n stack = []\n n = len(nums)\n for i in range(n):\n while stack and stack[-1] < nums[i] and n - i + len(stack) > x:\n stack.pop()\n if len(stack) < x:\n stack.append(nums[i])\n return stack\n\n def merge(ans1, ans2):\n res = []\n if len(ans1) + len(ans2) < k:\n return []\n while ans1 or ans2:\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\n res.append(cur)\n return res\n\n return max(merge(dfs(nums1, i), dfs(nums2, k-i)) for i in range(k+1))\n\n\n","runtime":"540"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def dfs(nums,x):\n stack, n = [], len(nums)\n\n for i in range(n):\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\n stack.pop()\n\n if len(stack) < x:\n stack.append(nums[i])\n\n return stack \n\n def merge(ans1,ans2):\n if len(ans1) + len(ans2) < k:\n return []\n \n result = []\n\n while ans1 or ans2:\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\n result.append(cur)\n\n return result \n\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))","runtime":"540"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def dfs(nums,x):\n stack, n = [], len(nums)\n\n for i in range(n):\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\n stack.pop()\n\n if len(stack) < x:\n stack.append(nums[i])\n\n return stack \n\n def merge(ans1,ans2):\n if len(ans1) + len(ans2) < k:\n return []\n \n result = []\n\n while ans1 or ans2:\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\n result.append(cur)\n\n return result \n\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))","runtime":"555"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def dfs(nums,x):\n stack, n = [], len(nums)\n\n for i in range(n):\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\n stack.pop()\n\n if len(stack) < x:\n stack.append(nums[i])\n\n return stack \n\n def merge(ans1,ans2):\n if len(ans1) + len(ans2) < k:\n return []\n \n result = []\n\n while ans1 or ans2:\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\n result.append(cur)\n\n return result \n\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))","runtime":"569"},{"code":"class RMQ:\n def __init__(self, nums):\n n = len(nums)\n self.N = int(log2(n)) + 1\n self.nums = nums\n\n rmq = [[0] * self.N for _ in range(n)]\n for i in range(n):\n rmq[i][0] = i\n\n j = 1\n while (1 << j) <= n:\n i = 0\n while i + (1 << j) -1 < n:\n l, r = rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]\n if nums[l] >= nums[r]:\n rmq[i][j] = l\n else:\n rmq[i][j] = r\n i += 1\n j += 1\n\n self.rmq = rmq\n\n\n def min_q(self, l, r):\n j = int(log2(r - l + 1))\n ll, rr = self.rmq[l][j], self.rmq[r-(1<<j)+1][j]\n if self.nums[ll] >= self.nums[rr]:\n return ll\n return rr\n\n\ndef get_n(nums, take, rmq) -> List[int]:\n left, n = 0, len(nums)\n if take >= n:\n return nums\n\n ans = []\n for right in range(n-take, n):\n i = rmq.min_q(left, right)\n ans.append(nums[i])\n left = i + 1\n return ans\n\n\ndef merge(a, b) -> List[int]:\n a, b = deque(a), deque(b)\n ans = []\n while a and b:\n if a > b:\n ans.append(a.popleft())\n else:\n ans.append(b.popleft())\n if a:\n ans += list(a)\n if b:\n ans += list(b)\n return ans\n\nclass Solution:\n def maxNumber(self, A: List[int], B: List[int], k: int) -> List[int]:\n rmq_a, rmq_b = RMQ(A), RMQ(B)\n ans = [-100000000] * k\n for l in range(k+1):\n r = k - l\n arr_l = get_n(A, l, rmq_a)\n arr_r = get_n(B, r, rmq_b)\n\n tmp = merge(arr_l, arr_r)\n if len(tmp) == k:\n ans = max(ans, tmp)\n\n return ans","runtime":"569"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.pop(0))\n else:\n ret.append(n2.pop(0))\n return ret\n best = []\n for i in range(0, k + 1):\n if i == 9:\n print(\"debug\")\n \n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"583"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.pop(0))\n else:\n ret.append(n2.pop(0))\n return ret\n best = []\n for i in range(0, k + 1):\n if i == 9:\n print(\"debug\")\n \n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"597"},{"code":"class Solution:\n def getBiggestK(self, nums: List[int], k: int) -> List[int]:\n if k == 0:\n return []\n stack = []\n drop = len(nums) - k # number of elements we can drop\n \n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n \n # Ensure the result has exactly k elements\n return stack[:k]\n\n def merge(self, nums1: List[int], nums2: List[int]) -> List[int]:\n merged = []\n while nums1 or nums2:\n # Compare slices to decide which element to take\n if nums1 > nums2:\n merged.append(nums1.pop(0))\n else:\n merged.append(nums2.pop(0))\n return merged\n\n\n def compare(self, nums1, nums2) -> int:\n if len(nums1) != len(nums2):\n return len(nums1) > len(nums2) \n i = 0\n j = 0\n while i<len(nums1) and j<len(nums2):\n if nums1[i] > nums2[j]:\n return True\n elif nums1[i] < nums2[j]:\n return False\n i += 1\n j += 1\n return len(nums1) >= len(nums2)\n\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n greatest = [0] * k\n for i in range(k+1):\n nums1_biggest = self.getBiggestK(nums1, i)\n nums2_biggest = self.getBiggestK(nums2, k-i)\n comb_big = self.merge(nums1_biggest, nums2_biggest)\n if self.compare(comb_big, greatest):\n greatest = comb_big\n\n return greatest\n\n ","runtime":"611"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n while drop and s1 and s1[-1] < n1[i]:\n drop -= 1\n s1.pop()\n continue\n s1.append(n1[i])\n while s1 and len(s1) > j:\n s1.pop()\n return s1\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"625"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n if i == 9:\n print(\"debug\")\n \n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"639"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n if i == 9:\n print(\"debug\")\n \n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"653"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"653"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n def max_single(arr, l):\n num = []\n \n cur = -1\n for start in range(len(arr)-l, len(arr)):\n best = -float(\"inf\")\n best_idx = None\n while start >= 0 and start > cur:\n if arr[start] >= best:\n best = arr[start]\n best_idx = start\n start -= 1\n num.append(arr[best_idx])\n cur = best_idx\n return num\n \n def mergeMax(nums1, nums2):\n ans = []\n while nums1 or nums2:\n if nums1 > nums2:\n ans += nums1[0],\n nums1 = nums1[1:]\n else:\n ans += nums2[0],\n nums2 = nums2[1:]\n return ans\n \n \n# def merge(a1, a2):\n# num = []\n \n# a1 = deque(a1)\n# a2 = deque(a2)\n \n# while a1 or a2:\n# if a1 and a2:\n# if a1[0] > a2[0]:\n# num.append(a1.popleft())\n# elif a1[0] < a2[0]:\n# num.append(a2.popleft())\n# else:\n \n# else:\n# if a1:\n# num.append(a1.popleft())\n# else:\n# num.append(a2.popleft())\n# return num\n \n def greater(n1, n2):\n for nn1, nn2 in zip(n1, n2):\n if nn1 > nn2:\n return n1\n elif nn2 > nn1:\n return n2\n return n1\n \n max_number = []\n \n for left in range(min(k, len(nums1)) + 1):\n if k - left > len(nums2):\n continue\n # print(left, k-left)\n \n l = max_single(nums1, left)\n r = max_single(nums2, k-left)\n num = mergeMax(l, r)\n # print(\"gg\")\n if max_number:\n max_number = greater(max_number, num)\n else:\n max_number = num\n return max_number\n \n \n ","runtime":"668"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n def max_single(arr, l):\n num = []\n \n cur = -1\n for start in range(len(arr)-l, len(arr)):\n best = -float(\"inf\")\n best_idx = None\n while start >= 0 and start > cur:\n if arr[start] >= best:\n best = arr[start]\n best_idx = start\n start -= 1\n num.append(arr[best_idx])\n cur = best_idx\n return num\n \n def mergeMax(nums1, nums2):\n ans = []\n while nums1 or nums2:\n if nums1 > nums2:\n ans += nums1[0],\n nums1 = nums1[1:]\n else:\n ans += nums2[0],\n nums2 = nums2[1:]\n return ans\n \n def greater(n1, n2):\n for nn1, nn2 in zip(n1, n2):\n if nn1 > nn2:\n return n1\n elif nn2 > nn1:\n return n2\n return n1\n \n max_number = []\n \n for left in range(min(k, len(nums1)) + 1):\n if k - left > len(nums2):\n continue\n\n l = max_single(nums1, left)\n r = max_single(nums2, k-left)\n num = mergeMax(l, r)\n \n if max_number:\n max_number = greater(max_number, num)\n else:\n max_number = num\n \n return max_number\n \n \n ","runtime":"682"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n m = len(nums1)\n n = len(nums2)\n dp = {}\n \n # get the max number string with \"length\" from index \"i\" in nums1 and index \"j\" in nums2\n # using number string to easy to compare\n def getMaxNumberString(i, j, length):\n if length == 0:\n return \"\"\n \n # using memoization to optimize for the overlapping subproblems\n key = (i, j, length)\n if key in dp:\n return dp[key]\n \n # greedy to find the possible max digit from nums1 and nums2\n # 1) bigger digit in the higher position of the number will get bigger number\n # 2) at the same time, we need to ensure that we still have enough digits to form a number with \"length\" digits\n \n # try to find the possible max digit from index i in nums1\n index1 = None\n for ii in range(i, m):\n if (m - ii + n - j) < length:\n break\n if index1 is None or nums1[index1] < nums1[ii]:\n index1 = ii\n \n # try to find the possible max digit from index j in nums2\n index2 = None\n for jj in range(j, n):\n if (m - i + n - jj) < length:\n break\n if index2 is None or nums2[index2] < nums2[jj]:\n index2 = jj\n \n maxNumberStr = None\n if index1 is not None and index2 is not None:\n if nums1[index1] > nums2[index2]:\n maxNumberStr = str(nums1[index1]) + getMaxNumberString(index1 + 1, j, length - 1)\n elif nums1[index1] < nums2[index2]:\n maxNumberStr = str(nums2[index2]) + getMaxNumberString(i, index2 + 1, length - 1)\n else:\n # get the same digit from nums1 and nums2, so need to try two cases and get the max one \n maxNumberStr = max(str(nums1[index1]) + getMaxNumberString(index1 + 1, j, length - 1), str(nums2[index2]) + getMaxNumberString(i, index2 + 1, length - 1))\n elif index1 is not None:\n maxNumberStr = str(nums1[index1]) + getMaxNumberString(index1 + 1, j, length - 1)\n elif index2 is not None:\n maxNumberStr = str(nums2[index2]) + getMaxNumberString(i, index2 + 1, length - 1)\n \n dp[key] = maxNumberStr\n return maxNumberStr\n\n result_str = getMaxNumberString(0, 0, k)\n \n # number string to digit array\n result = []\n for c in result_str:\n result.append(int(c))\n \n return result","runtime":"696"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n while drop and s1 and s1[-1] < n1[i]:\n drop -= 1\n s1.pop()\n continue\n s1.append(n1[i])\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","runtime":"696"},{"code":"class Solution:\n def mostCompetitive(self, nums: List[int], k: int) -> List[int]:\n stack = []\n k = len(nums) - k\n for digit in nums:\n while stack and k > 0 and digit > stack[-1]:\n stack.pop()\n k -= 1\n stack.append(digit)\n \n if k > 0:\n stack = stack[:-k]\n \n return stack\n \n def largestMerge(self, word1: List[int], word2: List[int]) -> List[int]:\n i = 0\n j = 0\n res = []\n while i < len(word1) and j < len(word2):\n if word1[i] > word2[j]:\n res.append(word1[i])\n i += 1\n elif word2[j] > word1[i]:\n res.append(word2[j])\n j += 1\n else:\n if word1[i:] > word2[j:]:\n res.append(word1[i])\n i += 1\n else:\n res.append(word2[j])\n j += 1\n \n res.extend(word1[i:])\n res.extend(word2[j:])\n return res\n\n def maxNumber(self, nums1: List[int], nums2: List[int], length: int) -> List[int]:\n mx = 0\n mx_list = []\n for k in range(min(len(nums1), length) + 1):\n print(k)\n d1 = self.mostCompetitive(nums1, k)\n d2 = self.mostCompetitive(nums2, length - k)\n \n jeff = self.largestMerge(d1, d2)\n print(jeff)\n candidate = int(\"\".join([str(x) for x in jeff]))\n if candidate > mx:\n mx = candidate\n mx_list = jeff.copy()\n \n return mx_list\n","runtime":"710"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n\n def findMono(nums, x):\n stack, n = [], len(nums)\n drop = n - x\n for i in range(n):\n while stack and stack[-1] < nums[i] and drop > 0:\n stack.pop()\n drop -= 1\n stack.append(nums[i])\n return stack[:x]\n\n def merge(ans1, ans2):\n res = []\n if len(ans1) + len(ans2) < k:\n return res\n while ans1 or ans2:\n res.append(ans1.pop(0) if ans1 > ans2 else ans2.pop(0))\n return res\n\n print([merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1)])\n return max(merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1))","runtime":"724"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n L1, L2, cache = len(nums1), len(nums2), {}\n for i in range(L1): nums1[i] = str(nums1[i])\n for i in range(L2): nums2[i] = str(nums2[i])\n def DFS(i, n, T):\n if (i, n, T) in cache: return cache[(i, n, T)]\n if T==1:\n if L1-i<n: return \"\"\n elif L1-i==n: return \"\".join(nums1[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L1:\n s = nums1[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n else:\n if L2-i<n: return \"\"\n elif L2-i==n: return \"\".join(nums2[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L2:\n s = nums2[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n cache[(i, n, T)] = S\n return S \n def merge(s1, s2):\n S = \"\"\n while s1 or s2:\n v1 = s1[0] if s1 else \"\"\n v2 = s2[0] if s2 else \"\"\n if v1>v2: \n S += v1\n s1.pop(0)\n elif v1==v2:\n j = 0\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\n elif j<len(s1): f = True\n else: f = False\n if f: \n S += v1\n s1.pop(0)\n else:\n S += v2\n s2.pop(0)\n else:\n S += v2\n s2.pop(0)\n return S\n S, lst = \"\", []\n for i in range(max(0, k-L2), min(L1, k)+1):\n s1 = DFS(0, i, 1)\n s2 = DFS(0, k-i, 2)\n S = max(S, merge(list(s1), list(s2)))\n for c in S: lst.append( int(c) )\n return lst ","runtime":"738"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def solve_one(arr, k):\n n = len(arr)\n stack = []\n for i in range(n):\n while stack and stack[-1] < arr[i] and len(stack) + n - i - 1 >= k:\n stack.pop()\n if len(stack) < k:\n stack.append(arr[i])\n return stack\n\n def merge(arr, brr):\n return [max(arr, brr).pop(0) for _ in range(len(arr) + len(brr))]\n\n ans = [0 for _ in range(k)]\n for x in range(k + 1):\n left, right = solve_one(nums1, x), solve_one(nums2, k - x)\n temp = merge(left, right)\n if len(temp) != k:\n continue\n ans = max(ans, temp)\n return ans","runtime":"752"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n L1, L2, cache = len(nums1), len(nums2), {}\n for i in range(L1): nums1[i] = str(nums1[i])\n for i in range(L2): nums2[i] = str(nums2[i])\n def DFS(i, n, T):\n if (i, n, T) in cache: return cache[(i, n, T)]\n if T==1:\n if L1-i<n: return \"\"\n elif L1-i==n: return \"\".join(nums1[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L1:\n s = nums1[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n else:\n if L2-i<n: return \"\"\n elif L2-i==n: return \"\".join(nums2[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L2:\n s = nums2[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n cache[(i, n, T)] = S\n return S \n def merge(s1, s2):\n S = \"\"\n while s1 or s2:\n v1 = s1[0] if s1 else \"\"\n v2 = s2[0] if s2 else \"\"\n if v1>v2: \n S += v1\n s1.pop(0)\n elif v1==v2:\n j = 0\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\n elif j<len(s1): f = True\n else: f = False\n if f: \n S += v1\n s1.pop(0)\n else:\n S += v2\n s2.pop(0)\n else:\n S += v2\n s2.pop(0)\n return S\n S, lst = \"\", []\n for i in range(max(0, k-L2), min(L1, k)+1):\n s1 = DFS(0, i, 1)\n s2 = DFS(0, k-i, 2)\n S = max(S, merge(list(s1), list(s2)))\n for c in S: lst.append( int(c) )\n return lst ","runtime":"766"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n L1, L2, cache = len(nums1), len(nums2), {}\n for i in range(L1): nums1[i] = str(nums1[i])\n for i in range(L2): nums2[i] = str(nums2[i])\n def DFS(i, n, T):\n if (i, n, T) in cache: return cache[(i, n, T)]\n if T==1:\n if L1-i<n: return \"\"\n elif L1-i==n: return \"\".join(nums1[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L1:\n s = nums1[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n else:\n if L2-i<n: return \"\"\n elif L2-i==n: return \"\".join(nums2[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L2:\n s = nums2[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n cache[(i, n, T)] = S\n return S \n def merge(s1, s2):\n S = \"\"\n while s1 or s2:\n v1 = s1[0] if s1 else \"\"\n v2 = s2[0] if s2 else \"\"\n if v1>v2: \n S += v1\n s1.pop(0)\n elif v1==v2:\n j = 0\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\n elif j<len(s1): f = True\n else: f = False\n if f: \n S += v1\n s1.pop(0)\n else:\n S += v2\n s2.pop(0)\n else:\n S += v2\n s2.pop(0)\n return S\n S, lst = \"\", []\n for i in range(max(0, k-L2), min(L1, k)+1):\n s1 = DFS(0, i, 1)\n s2 = DFS(0, k-i, 2)\n S = max(S, merge(list(s1), list(s2)))\n for c in S: lst.append( int(c) )\n return lst ","runtime":"781"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n L1, L2, cache = len(nums1), len(nums2), {}\n print(L1, L2, k)\n for i in range(L1): nums1[i] = str(nums1[i])\n for i in range(L2): nums2[i] = str(nums2[i])\n def DFS(i, n, T):\n if (i, n, T) in cache: return cache[(i, n, T)]\n if T==1:\n if L1-i<n: return \"\"\n elif L1-i==n: return \"\".join(nums1[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L1:\n s = nums1[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n else:\n if L2-i<n: return \"\"\n elif L2-i==n: return \"\".join(nums2[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L2:\n s = nums2[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n cache[(i, n, T)] = S\n return S \n def merge(s1, s2):\n S = \"\"\n while s1 or s2:\n v1 = s1[0] if s1 else \"\"\n v2 = s2[0] if s2 else \"\"\n if v1>v2: \n S += v1\n s1.pop(0)\n elif v1==v2:\n j = 0\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\n elif j<len(s1): f = True\n else: f = False\n if f: \n S += v1\n s1.pop(0)\n else:\n S += v2\n s2.pop(0)\n else:\n S += v2\n s2.pop(0)\n return S\n S, lst = \"\", []\n for i in range(max(0, k-L2), min(L1, k)+1):\n s1 = DFS(0, i, 1)\n s2 = DFS(0, k-i, 2)\n S = max(S, merge(list(s1), list(s2)))\n for c in S: lst.append( int(c) )\n return lst ","runtime":"795"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n L1, L2, cache = len(nums1), len(nums2), {}\n print(L1, L2, k)\n for i in range(L1): nums1[i] = str(nums1[i])\n for i in range(L2): nums2[i] = str(nums2[i])\n def DFS(i, n, T):\n if (i, n, T) in cache: return cache[(i, n, T)]\n if T==1:\n if L1-i<n: return \"\"\n elif L1-i==n: return \"\".join(nums1[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L1:\n s = nums1[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n else:\n if L2-i<n: return \"\"\n elif L2-i==n: return \"\".join(nums2[i:])\n S = \"\"\n s = DFS(i+1, n, T)\n if len(s)==n and s>S: S = s\n if i<L2:\n s = nums2[i] + DFS(i+1, n-1, T) \n if len(s)==n and s>S: S = s\n cache[(i, n, T)] = S\n return S \n def merge(s1, s2):\n print(s1, s2)\n S = \"\"\n while s1 or s2:\n v1 = s1[0] if s1 else \"\"\n v2 = s2[0] if s2 else \"\"\n if v1>v2: \n S += v1\n s1.pop(0)\n elif v1==v2:\n j = 0\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\n elif j<len(s1): f = True\n else: f = False\n if f: \n S += v1\n s1.pop(0)\n else:\n S += v2\n s2.pop(0)\n else:\n S += v2\n s2.pop(0)\n return S\n S, lst = \"\", []\n for i in range(max(0, k-L2), min(L1, k)+1):\n s1 = DFS(0, i, 1)\n s2 = DFS(0, k-i, 2)\n S = max(S, merge(list(s1), list(s2)))\n for c in S: lst.append( int(c) )\n return lst ","runtime":"809"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def maximum_num_each_list(nums: List[int], k_i: int) -> List[int]:\n # monotonically decreasing stack\n s = []\n m = len(nums) - k_i\n for n in nums:\n while s and s[-1] < n and m > 0:\n s.pop()\n m -= 1\n s.append(n)\n s = s[:len(s)-m] # very important\n return s\n def greater(a, b, i , j): # get the number which is lexiographically greater\n while i< len(a) or j < len(b): \n if i == len(a): return False\n if j == len(b): return True\n if a[i] > b[j]: return True\n if a[i] < b[j]: return False\n i += 1 # we increment until each of their elements are same\n j += 1\n \n def merge(x_num, y_num):\n n = len(x_num)\n m = len(y_num)\n i = 0\n j = 0\n s = []\n while i < n or j < m:\n a = x_num[i] if i < n else float(\"-inf\") \n b = y_num[j] if j < m else float(\"-inf\") \n\n if a > b or greater(x_num, y_num, i , j):\n# greater(x_num, y_num, i , j): this function is meant for check which list has element lexicographically greater means it will iterate through both arrays incrementing both at the same time until one of them is greater than other.\n chosen = a\n i += 1\n else:\n chosen = b\n j += 1\n s.append(chosen)\n return s\n\n max_num_arr = []\n for i in range(k+1): # we check for all values of k and find the maximum number we can create for that value of k and we repeat this for all values of k and then at eacch time merge the numbers to check if arrive at optimal solution\n first = maximum_num_each_list(nums1, i)\n second = maximum_num_each_list(nums2, k-i)\n merged = merge(first, second)\n # these two conditions are required because list comparison in python only compares the elements even if one of their lengths is greater, so I had to add these conditions to compare elements only if length is equal.\n\t\t\t# Alternatively you can avoid this and convert them both to int and then compare, but I wanted to this as it is somewhat more efficient.\n if len(merged) == len(max_num_arr) and merged > max_num_arr:\n max_num_arr = merged\n elif len(merged) > len(max_num_arr):\n max_num_arr = merged\n return max_num_arr","runtime":"823"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def maximum_num_each_list(nums: List[int], k_i: int) -> List[int]:\n # monotonically decreasing stack\n s = []\n m = len(nums) - k_i\n for n in nums:\n while s and s[-1] < n and m > 0:\n s.pop()\n m -= 1\n s.append(n)\n s = s[:len(s)-m] # very important\n return s\n def greater(a, b, i , j): # get the number which is lexiographically greater\n while i< len(a) or j < len(b): \n if i == len(a): return False\n if j == len(b): return True\n if a[i] > b[j]: return True\n if a[i] < b[j]: return False\n i += 1 # we increment until each of their elements are same\n j += 1\n \n def merge(x_num, y_num):\n n = len(x_num)\n m = len(y_num)\n i = 0\n j = 0\n s = []\n while i < n or j < m:\n a = x_num[i] if i < n else float(\"-inf\") \n b = y_num[j] if j < m else float(\"-inf\") \n\n if a > b or greater(x_num, y_num, i , j):\n# greater(x_num, y_num, i , j): this function is meant for check which list has element lexicographically greater means it will iterate through both arrays incrementing both at the same time until one of them is greater than other.\n chosen = a\n i += 1\n else:\n chosen = b\n j += 1\n s.append(chosen)\n return s\n\n max_num_arr = []\n for i in range(k+1): # we check for all values of k and find the maximum number we can create for that value of k and we repeat this for all values of k and then at eacch time merge the numbers to check if arrive at optimal solution\n first = maximum_num_each_list(nums1, i)\n second = maximum_num_each_list(nums2, k-i)\n merged = merge(first, second)\n # these two conditions are required because list comparison in python only compares the elements even if one of their lengths is greater, so I had to add these conditions to compare elements only if length is equal.\n\t\t\t# Alternatively you can avoid this and convert them both to int and then compare, but I wanted to this as it is somewhat more efficient.\n if len(merged) == len(max_num_arr) and merged > max_num_arr:\n max_num_arr = merged\n elif len(merged) > len(max_num_arr):\n max_num_arr = merged\n return max_num_arr","runtime":"837"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n res = []\n for i in range(min(k + 1, len(nums1) + 1)):\n res1 = self.singleMaxK(nums1, i)\n res2 = self.singleMaxK(nums2, k - i)\n temp = self.constructArray(res1, res2)\n if len(res) == 0:\n res = temp[:]\n else:\n temp_n = self.arrayToInt(temp)\n res_n = self.arrayToInt(res)\n if temp_n > res_n:\n res = temp[:]\n return res\n\n def arrayToInt(self, nums: List[int]) -> int:\n res = 0\n for i in nums:\n res = res * 10 + i\n return res\n\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\n i1, i2 = 0, 0\n n1, n2 = len(nums1), len(nums2)\n res = []\n while i1 < n1 or i2 < n2:\n if self.isGreater(nums1, nums2, i1, i2):\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n return res\n\n def isGreater(self, nums1: List[int], nums2: List[int], i: int, j: int) -> bool:\n while i < len(nums1) and j < len(nums2) and nums1[i] == nums2[j]:\n i += 1\n j += 1\n return j == len(nums2) or (i < len(nums1) and nums1[i] > nums2[j])\n\n def singleMaxK(self, nums: List[int], k: int) -> List[int]:\n stack = []\n for i, num in enumerate(nums):\n while stack and len(nums) - i + len(stack) > k and stack[-1] < num:\n stack.pop()\n if len(stack) < k:\n stack.append(num)\n return stack","runtime":"851"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n n1 = len(nums1)\n n2 = len(nums2)\n\n table = {}\n def helper(s1, s2, k):\n combo = (s1, s2, k)\n if combo in table:\n return table[combo]\n if k == 1:\n v1 = max(nums1[s1:]) if s1 < n1 else -1\n v2 = max(nums2[s2:]) if s2 < n2 else -1\n rval = max(v1, v2)\n table[combo] = rval\n return rval\n m1, idx1 = -1, -1\n c1 = s1\n while c1 < n1 and (n1 - (c1 + 1)) + (n2 - s2) >= k - 1:\n if nums1[c1] > m1:\n m1 = nums1[c1]\n idx1 = c1\n c1 += 1\n m2, idx2 = -1, -1\n c2 = s2\n while c2 < n2 and (n2 - (c2 + 1)) + (n1 - s1) >= k - 1:\n if nums2[c2] > m2:\n m2 = nums2[c2]\n idx2 = c2\n c2 += 1\n if m1 > m2:\n rval = m1 * (10 ** (k - 1)) + helper(idx1 + 1, s2, k - 1)\n elif m2 > m1:\n rval = m2 * (10 ** (k - 1)) + helper(s1, idx2 + 1, k - 1)\n else:\n val1 = m1 * (10 ** (k - 1)) + helper(idx1 + 1, s2, k - 1)\n val2 = m2 * (10 ** (k - 1)) + helper(s1, idx2 + 1, k - 1)\n rval = max(val1, val2)\n table[combo] = rval\n return rval\n result = helper(0, 0, k)\n rval = []\n while result > 0:\n rval.append(result % 10)\n result //= 10\n return rval[::-1]\n \n \n\n rval = []\n\n h1 = []\n h2 = []\n\n s1 = 0\n s2 = 0\n\n c1 = 0\n c2 = 0\n\n while k > 0:\n while c1 < n1 and (n1 - (c1 + 1)) + (n2 - s2) >= k - 1:\n heapq.heappush(h1, (-nums1[c1], c1))\n c1 += 1\n while c2 < n2 and (n2 - (c2 + 1)) + (n1 - s1) >= k - 1:\n heapq.heappush(h2, (-nums2[c2], c2))\n c2 += 1\n while h1 and h1[0][1] < s1:\n heapq.heappop(h1)\n while h2 and h2[0][1] < s2:\n heapq.heappop(h2)\n\n x1, idx1 = h1[0] if h1 else (1, -1)\n x2, idx2 = h2[0] if h2 else (1, -1)\n x1 = -x1\n x2 = -x2\n\n if x1 > x2:\n rval.append(x1)\n s1 = idx1 + 1\n elif x2 > x1:\n rval.append(x2)\n s2 = idx2 + 1\n else:\n\n \n if (n1 - idx1) >= (n2 - idx2):\n rval.append(x1)\n s1 = idx1 + 1\n else:\n rval.append(x2)\n s2 = idx2 + 1\n k -= 1\n return rval\n\n match_length = [[0 for _ in range(n)] for _ in range(m)]\n for idx1 in range(m - 1, -1, -1):\n for idx2 in range(n - 1, -1, -1):\n if nums1[idx1] != nums2[idx2]:\n match_length[idx1][idx2] = 0\n continue\n \n if idx1 + 1 == m or idx2 + 1 == n:\n next_length = 0\n else:\n next_length = match_length[idx1 + 1][idx2 + 1]\n \n match_length[idx1][idx2] = 1 + next_length\n\n pick = [[0 for _ in range(n)] for _ in range(m)]\n for idx1 in range(m - 1, -1, -1):\n for idx2 in range(n - 1, -1, -1):\n if nums1[idx1] > nums2[idx2]:\n pick[idx1][idx2] = 0\n elif nums1[idx1] < nums2[idx2]:\n pick[idx1][idx2] = 1\n else:\n length1 = m - idx1\n length2 = n - idx2\n ml = match_length[idx1][idx2]\n if ml == min(length1, length2):\n if length1 < length2:\n pick[idx1][idx2] = 1\n else:\n pick[idx1][idx2] = 0\n else:\n if nums1[idx1 + ml] > nums2[idx2 + ml]:\n pick[idx1][idx2] = 0\n else:\n pick[idx1][idx2] = 1\n \n result = []\n idx1 = 0\n idx2 = 0\n while idx1 < m and idx2 < n:\n p = pick[idx1][idx2]\n if p == 0:\n result.append(nums1[idx1])\n idx1 += 1\n else:\n result.append(nums2[idx2])\n idx2 += 1\n while idx1 < m:\n result.append(nums1[idx1])\n idx1 += 1\n while idx2 < n:\n result.append(nums2[idx2])\n idx2 += 1\n return result\n\n","runtime":"865"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n ln2=len(nums2)\n max2={}\n for i in range(1,ln2+1):\n s=[]\n ls=0\n maxpop=ln2-i\n maxi=[]\n for x in nums2:\n while maxpop>0 and s and s[-1]<x:\n s.pop()\n ls-=1\n maxpop-=1\n if ls<i:\n s.append(x)\n ls+=1\n else:\n maxpop-=1\n if maxi<s:\n maxi=s.copy()\n max2[i]=maxi\n \n ln1=len(nums1)\n max1={}\n for i in range(1,ln1+1):\n s=[]\n ls=0\n maxpop=ln1-i\n maxi=[]\n for x in nums1:\n while maxpop>0 and s and s[-1]<x:\n s.pop()\n ls-=1\n maxpop-=1\n if ls<i:\n s.append(x)\n ls+=1\n else:\n maxpop-=1\n if maxi<s:\n maxi=s.copy()\n max1[i]=maxi\n\n\n answer=[]\n def merge(i,j):\n nonlocal answer\n if i==0:\n if max2[j]>answer:\n answer=max2[j].copy()\n return\n if j==0:\n if max1[i]>answer:\n answer=max1[i].copy()\n return\n l1=max1[i]\n l2=max2[j]\n ii,jj=0,0\n l=[]\n \n while l1 or l2:\n if l1>l2:\n l.append(l1[0])\n l1=l1[1:]\n else:\n l.append(l2[0])\n l2=l2[1:]\n\n if l>answer:\n answer=l.copy()\n \n for i in range(ln1+1):\n if 0<=k-i<=ln2:\n merge(i,k-i)\n\n return answer\n\n \n ","runtime":"879"}],"string":"[\n {\n \"code\": \"import bisect\\nimport collections as cc\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n nums = [nums1, nums2]\\n \\n def generateMaxPos(aid: int) -> List[List[int]]:\\n ret = [[] for _ in range(10)]\\n for i, a in enumerate(nums[aid]):\\n ret[a].append(i)\\n return ret\\n positions = [generateMaxPos(i) for i in range(len(nums))]\\n \\n def findMaxPos(aid: int, begin: int, end: int) -> Tuple[int, int]:\\n assert begin < end <= len(nums[aid]), f\\\"{aid}, {begin}, {end}\\\"\\n for i, v in enumerate(reversed(positions[aid])):\\n i = 9 - i\\n j = bisect.bisect_left(v, begin)\\n if j >= len(v) or v[j] >= end:\\n continue\\n return i, v[j]\\n assert False, \\\"begin/end not in range\\\"\\n \\n def getEndRange(aid: int, state: Tuple[int, int], step: int) -> int:\\n return len(nums[aid]) - max(0, (k - step - 1) - (len(nums[1 - aid]) - state[1 - aid]))\\n\\n pendings = {(0, 0)}\\n outputSeq = []\\n while pendings and len(outputSeq) < k:\\n bestVal = -1\\n bestSeq = set()\\n for state in pendings:\\n for aid in range(2):\\n e = getEndRange(aid, state, len(outputSeq))\\n if e == state[aid]:\\n continue\\n digit, pos = findMaxPos(aid, state[aid], e)\\n if digit > bestVal:\\n bestVal = digit\\n bestSeq.clear()\\n if digit == bestVal:\\n ns = list(state)\\n ns[aid] = pos + 1\\n bestSeq.add(tuple(ns))\\n outputSeq.append(bestVal)\\n pendings = bestSeq\\n\\n return outputSeq\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n from typing import List\\n\\n def maxNumber(self,nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def maxNumberFromArray(nums, k):\\n stack = []\\n drop = len(nums) - k\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:k]\\n\\n def merge(nums1, nums2):\\n merged = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n merged.append(nums1.pop(0))\\n else:\\n merged.append(nums2.pop(0))\\n return merged\\n\\n best = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n part1 = maxNumberFromArray(nums1, i)\\n part2 = maxNumberFromArray(nums2, k - i)\\n best = max(best, merge(part1, part2))\\n return best\\n\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n def find_num(nums, k):\\n st = []\\n remain = len(nums) - k\\n for n in nums:\\n while remain and st and st[-1] < n:\\n st.pop()\\n remain -= 1\\n st.append(n)\\n return st[:k]\\n\\n def merge(A,B):\\n ans = []\\n while A or B:\\n bigger = A if A > B else B\\n ans.append(bigger.pop(0))\\n return ans\\n\\n return max(merge(find_num(nums1, i), find_num(nums2, k-i)) for i in range(k+1) if i <=len(nums1) and k-i <= len(nums2))\\n\\n \\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def get_max_subsequence(self, nums: List[int], k: int) -> List[int]:\\n stack = []\\n drop = len(nums) - k\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:k]\\n\\n def merge(self, a: List[int], b: List[int]) -> List[int]:\\n result = []\\n while a or b:\\n if a > b:\\n result.append(a.pop(0))\\n else:\\n result.append(b.pop(0))\\n return result\\n\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n max_seq = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n max_seq1 = self.get_max_subsequence(nums1, i)\\n max_seq2 = self.get_max_subsequence(nums2, k - i)\\n candidate = self.merge(max_seq1, max_seq2)\\n if candidate > max_seq:\\n max_seq = candidate\\n return max_seq\\n\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def fst(arr, size):\\n stack = []\\n drop = len(arr) - size\\n for num in arr:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:size]\\n\\n def merge(nums1, nums2):\\n res = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n res.append(nums1.pop(0))\\n else:\\n res.append(nums2.pop(0))\\n return res\\n\\n max_num = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n sub1 = fst(nums1, i)\\n sub2 = fst(nums2, k - i)\\n max_num = max(max_num, merge(sub1, sub2))\\n \\n return max_num\\n\\n \\n \",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def pick_max(nums, t):\\n stack = []\\n drop = len(nums) - t\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:t]\\n\\n # Helper function to merge two sequences to get the lexicographically largest result\\n def merge(seq1, seq2):\\n result = []\\n while seq1 or seq2:\\n if seq1 > seq2:\\n result.append(seq1.pop(0))\\n else:\\n result.append(seq2.pop(0))\\n return result\\n\\n max_combination = []\\n # Try all possible combinations of picking i digits from nums1 and k - i from nums2\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n max_from_nums1 = pick_max(nums1, i)\\n max_from_nums2 = pick_max(nums2, k - i)\\n candidate = merge(max_from_nums1, max_from_nums2)\\n max_combination = max(max_combination, candidate)\\n\\n return max_combination\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def pick(nums, t):\\n stack = []\\n drop = len(nums) - t\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:t]\\n def merge(subseq1, subseq2):\\n result = []\\n while subseq1 or subseq2:\\n if subseq1 > subseq2:\\n result.append(subseq1.pop(0))\\n else:\\n result.append(subseq2.pop(0))\\n return result\\n \\n max_sequence = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1))+1):\\n subseq1 = pick(nums1, i)\\n subseq2 = pick(nums2, k - i)\\n max_sequence = max(max_sequence, merge(subseq1, subseq2))\\n return max_sequence\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n m, n = len(nums1), len(nums2)\\n \\n def merge(seq1, seq2):\\n ans = []\\n while seq1 or seq2:\\n bigger = seq1 if seq1 > seq2 else seq2\\n ans.append(bigger[0])\\n bigger.pop(0)\\n return ans\\n \\n def max_from_one(nums, k):\\n drop = len(nums) - k\\n out = []\\n for num in nums:\\n while drop and out and out[-1] < num:\\n out.pop()\\n drop -= 1\\n out.append(num)\\n return out[:k]\\n \\n def max_number(nums1, nums2, k):\\n return max(merge(max_from_one(nums1, i), max_from_one(nums2, k-i)) for i in range(max(0, k-len(nums2)), min(k, len(nums1))+1))\\n \\n return max_number(nums1, nums2, k)\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def prep(nums, k):\\n drop = len(nums) - k\\n out = []\\n for num in nums:\\n while drop and out and out[-1] < num:\\n out.pop()\\n drop -= 1\\n out.append(num)\\n return out[:k]\\n \\n def merge(a, b):\\n return [max(a, b).pop(0) for _ in a+b]\\n \\n return max(merge(prep(nums1, i), prep(nums2, k-i)) for i in range(k+1) if i <= len(nums1) and k-i <= len(nums2))\\n\\n# Example usage:\\nsolution = Solution()\\nnums1 = [3, 4, 6, 5]\\nnums2 = [9, 1, 2, 5, 8, 3]\\nk = 5\\nprint(solution.maxNumber(nums1, nums2, k)) # Output: [9, 8, 6, 5, 3]\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def prep(nums, k):\\n drop = len(nums) - k\\n out = []\\n for num in nums:\\n while drop and out and out[-1] < num:\\n out.pop()\\n drop -= 1\\n out.append(num)\\n return out[:k]\\n \\n def merge(a, b):\\n return [max(a, b).pop(0) for _ in a + b]\\n \\n return max(merge(prep(nums1, i), prep(nums2, k - i))\\n for i in range(k + 1)\\n if i <= len(nums1) and k - i <= len(nums2))\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def pick_max(nums, length):\\n \\\"\\\"\\\"Pick the max subsequence of given length.\\\"\\\"\\\"\\n stack = []\\n drop = len(nums) - length\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:length]\\n \\n def merge(nums1, nums2):\\n \\\"\\\"\\\"Merge two subsequences to form the maximum number.\\\"\\\"\\\"\\n return [max(nums1, nums2).pop(0) for _ in range(len(nums1) + len(nums2))]\\n\\n max_num = []\\n # i represents the number of elements we take from nums1, so k-i from nums2.\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n candidate = merge(pick_max(nums1, i), pick_max(nums2, k - i))\\n max_num = max(max_num, candidate)\\n \\n return max_num\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def maxSingle(nums: List[int], k: int) -> List[int]:\\n \\\"\\\"\\\" Get the maximum number from single array `nums` with `k` digits. \\\"\\\"\\\"\\n stack = []\\n drop = len(nums) - k\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:k]\\n\\n def merge(A: List[int], B: List[int]) -> List[int]:\\n \\\"\\\"\\\" Merge two arrays into the largest number. \\\"\\\"\\\"\\n return [max(A, B).pop(0) for _ in range(len(A) + len(B)) if A or B]\\n\\n # Main function body starts here\\n m, n = len(nums1), len(nums2)\\n result = []\\n \\n for i in range(max(0, k - n), min(k, m) + 1):\\n part1 = maxSingle(nums1, i)\\n part2 = maxSingle(nums2, k - i)\\n candidate = merge(part1, part2)\\n if candidate > result:\\n result = candidate\\n \\n return result\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def getOneMax(digits: List[int], count: int) -> List[int]:\\n stack = []\\n for i, digit in enumerate(digits):\\n while stack and digit > stack[-1] and count - len(stack) < len(digits) - i:\\n stack.pop()\\n stack.append(digit)\\n while len(stack) > count:\\n stack.pop()\\n return stack\\n def merge(first, second):\\n f, s = 0, 0\\n merged = []\\n while f < len(first) and s < len(second):\\n f_2, s_2 = f, s\\n while f_2 < len(first) and s_2 < len(second) and first[f_2] == second[s_2]:\\n f_2 += 1\\n s_2 += 1\\n if s_2 == len(second) or (f_2 < len(first) and s_2 < len(second) and first[f_2] > second[s_2]):\\n merged.append(first[f])\\n f += 1\\n else:\\n merged.append(second[s])\\n s += 1\\n if f < len(first):\\n merged.extend(first[f:])\\n if s < len(second):\\n merged.extend(second[s:])\\n return merged\\n low_bound_1 = max(0, k - len(nums2))\\n up_bound_1 = min(len(nums1), k)\\n max_num = None\\n for i in range(low_bound_1, up_bound_1 + 1):\\n solve1 = getOneMax(nums1, i)\\n solve2 = getOneMax(nums2, k - i)\\n solution = merge(solve1, solve2)\\n if max_num is None:\\n max_num = solution\\n continue\\n for digit1, digit2 in zip(max_num, solution):\\n if digit2 > digit1:\\n max_num = solution\\n if not digit2 == digit1:\\n break\\n return max_num\",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"def build_stack(nums, pos, stack, stack_size):\\n n = len(nums)\\n if n - pos <= stack_size - len(stack):\\n for i in range(pos, n):\\n stack.append(nums[i])\\n elif stack and nums[pos] > stack[-1]:\\n stack.pop()\\n build_stack(nums, pos, stack, stack_size)\\n else:\\n if len(stack) < stack_size:\\n stack.append(nums[pos])\\n build_stack(nums, pos + 1, stack, stack_size)\\n\\n return stack\\n\\n\\ndef merge(a, b):\\n result = []\\n i = j = 0\\n l_a, l_b = len(a), len(b)\\n while i < l_a and j < l_b:\\n if a[i] > b[j]:\\n result.append(a[i])\\n i += 1\\n elif a[i] < b[j]:\\n result.append(b[j])\\n j += 1\\n else:\\n result.append(a[i])\\n u = 1\\n while i + u < l_a and j + u < l_b and a[i + u] == b[j + u]:\\n u += 1\\n \\n if i + u >= l_a:\\n j += 1\\n elif j + u >= l_b:\\n i += 1\\n elif a[i + u] > b[j + u]:\\n i += 1\\n else:\\n j += 1\\n\\n if i < l_a:\\n result += a[i:]\\n elif j < l_b:\\n result += b[j:]\\n\\n return result\\n\\n\\ndef max_arr(a, b):\\n for i in range(len(a)):\\n if a[i] > b[i]:\\n return a\\n elif a[i] < b[i]:\\n return b\\n \\n return a\\n\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n m, n = len(nums1), len(nums2)\\n max_num = [0] * k\\n for k1 in range(max(0, k - n), min(k, m) + 1):\\n k2 = k - k1\\n # print(k1, k2)\\n\\n s1 = build_stack(nums1, 0, [], k1)\\n s2 = build_stack(nums2, 0, [], k2)\\n\\n # print(s1, s2)\\n\\n num = merge(s1, s2)\\n\\n # tmp = num\\n\\n max_num = max_arr(max_num, num)\\n\\n # if max_num == num:\\n # print('!')\\n # print(num)\\n\\n return max_num\\n\",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def f(nums: List[int], k: int) -> List[int]:\\n n = len(nums)\\n stk = [0] * k\\n top = -1\\n remain = n - k\\n for x in nums:\\n while top >= 0 and stk[top] < x and remain > 0:\\n top -= 1\\n remain -= 1\\n if top + 1 < k:\\n top += 1\\n stk[top] = x\\n else:\\n remain -= 1\\n return stk\\n\\n def compare(nums1: List[int], nums2: List[int], i: int, j: int) -> bool:\\n if i >= len(nums1):\\n return False\\n if j >= len(nums2):\\n return True\\n if nums1[i] > nums2[j]:\\n return True\\n if nums1[i] < nums2[j]:\\n return False\\n return compare(nums1, nums2, i + 1, j + 1)\\n\\n def merge(nums1: List[int], nums2: List[int]) -> List[int]:\\n m, n = len(nums1), len(nums2)\\n i = j = 0\\n ans = [0] * (m + n)\\n for k in range(m + n):\\n if compare(nums1, nums2, i, j):\\n ans[k] = nums1[i]\\n i += 1\\n else:\\n ans[k] = nums2[j]\\n j += 1\\n return ans\\n\\n m, n = len(nums1), len(nums2)\\n l, r = max(0, k - n), min(k, m)\\n ans = [0] * k\\n for x in range(l, r + 1):\\n arr1 = f(nums1, x)\\n arr2 = f(nums2, k - x)\\n arr = merge(arr1, arr2)\\n if ans < arr:\\n ans = arr\\n return ans\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def getMaxLexSubseq(lst: List[int], k: int) -> List[int]:\\n stack = [] # monotonically decreasing stack\\n\\n for i, num in enumerate(lst):\\n while len(stack) and stack[-1] < num and len(stack) - 1 + len(lst) - i >= k:\\n stack.pop()\\n \\n if len(stack) < k:\\n stack.append(num)\\n\\n return stack\\n\\n # merge a, b in a way to produce the maximum resulting array lexicographically (i.e element-by-element comparison). \\n def maximalLexMerge(a: List[int], b: List[int]) -> List[int]:\\n res = []\\n a = deque(a)\\n b = deque(b)\\n while a or b:\\n if a > b:\\n res.append(a[0])\\n a.popleft()\\n else:\\n res.append(b[0])\\n b.popleft()\\n return res\\n\\n\\n maxNumber = []\\n n = len(nums1)\\n m = len(nums2)\\n\\n for numDigitsFrom1 in range(k + 1):\\n numDigitsFrom2 = k - numDigitsFrom1\\n \\n if numDigitsFrom1 > n or numDigitsFrom2 > m:\\n continue\\n \\n maxSubseq1 = getMaxLexSubseq(nums1, numDigitsFrom1)\\n maxSubseq2 = getMaxLexSubseq(nums2, numDigitsFrom2)\\n\\n maxNumber = max(maxNumber, maximalLexMerge(maxSubseq1, maxSubseq2))\\n\\n\\n return maxNumber\\n \\n\\n\\n\\n\\n \\n \\n\\n \",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def max_subsequence(nums, k):\\n stack = []\\n remaining = len(nums) - k\\n for num in nums:\\n while stack and stack[-1] < num and remaining > 0:\\n stack.pop()\\n remaining -= 1\\n stack.append(num)\\n return stack[:k]\\n\\n def merge(seq1, seq2):\\n merged = []\\n i, j = 0, 0\\n while i < len(seq1) and j < len(seq2):\\n if seq1[i:] > seq2[j:]:\\n merged.append(seq1[i])\\n i += 1\\n else:\\n merged.append(seq2[j])\\n j += 1\\n merged.extend(seq1[i:])\\n merged.extend(seq2[j:])\\n return merged\\n\\n max_num = []\\n for i in range(k+1):\\n if i <= len(nums1) and k-i <= len(nums2):\\n seq1 = max_subsequence(nums1, i)\\n seq2 = max_subsequence(nums2, k-i)\\n max_num = max(max_num, merge(seq1, seq2))\\n return max_num\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n n = len(nums1)\\n m = len(nums2)\\n ans = [0] * k\\n for i in range(max(0, k - m), k + 1):\\n if i <= n:\\n candidate = self.merge(self.maxArray(nums1, i), self.maxArray(nums2, k - i), k)\\n if self.greater(candidate, 0, ans, 0):\\n ans = candidate\\n return ans\\n\\n def merge(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n ans = [0] * k\\n i = j = r = 0\\n while r < k:\\n if self.greater(nums1, i, nums2, j):\\n ans[r] = nums1[i]\\n i += 1\\n else:\\n ans[r] = nums2[j]\\n j += 1\\n r += 1\\n return ans\\n\\n def greater(self, nums1: List[int], i: int, nums2: List[int], j: int) -> bool:\\n while i < len(nums1) and j < len(nums2) and nums1[i] == nums2[j]:\\n i += 1\\n j += 1\\n return j == len(nums2) or (i < len(nums1) and nums1[i] > nums2[j])\\n\\n def maxArray(self, nums: List[int], k: int) -> List[int]:\\n n = len(nums)\\n ans = [0] * k\\n j = 0\\n for i in range(n):\\n while n - i + j > k and j > 0 and ans[j - 1] < nums[i]:\\n j -= 1\\n if j < k:\\n ans[j] = nums[i]\\n j += 1\\n return ans\\n\\n# Example usage\\n# solution = Solution()\\n# nums1 = [3, 4, 6, 5]\\n# nums2 = [9, 1, 2, 5, 8, 3]\\n# k = 5\\n# print(solution.maxNumber(nums1, nums2, k))\\n\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"def build_stack(nums, pos, stack, stack_size):\\n n = len(nums)\\n if n - pos <= stack_size - len(stack):\\n for i in range(pos, n):\\n stack.append(nums[i])\\n elif stack and nums[pos] > stack[-1]:\\n stack.pop()\\n build_stack(nums, pos, stack, stack_size)\\n else:\\n if len(stack) < stack_size:\\n stack.append(nums[pos])\\n build_stack(nums, pos + 1, stack, stack_size)\\n\\n return stack\\n\\n\\ndef merge(a, b):\\n result = []\\n i = j = 0\\n l_a, l_b = len(a), len(b)\\n while i < l_a and j < l_b:\\n if a[i] > b[j]:\\n result.append(a[i])\\n i += 1\\n elif a[i] < b[j]:\\n result.append(b[j])\\n j += 1\\n else:\\n result.append(a[i])\\n u = 1\\n while i + u < l_a and j + u < l_b and a[i + u] == b[j + u]:\\n u += 1\\n \\n if i + u >= l_a:\\n j += 1\\n elif j + u >= l_b:\\n i += 1\\n elif a[i + u] > b[j + u]:\\n i += 1\\n else:\\n j += 1\\n\\n if i < l_a:\\n result += a[i:]\\n elif j < l_b:\\n result += b[j:]\\n\\n return result\\n\\n\\ndef max_arr(a, b):\\n for i in range(len(a)):\\n if a[i] > b[i]:\\n return a\\n elif a[i] < b[i]:\\n return b\\n \\n return a\\n\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n m, n = len(nums1), len(nums2)\\n max_num = [0] * k\\n for k1 in range(max(0, k - n), min(k, m) + 1):\\n k2 = k - k1\\n\\n s1 = build_stack(nums1, 0, [], k1)\\n s2 = build_stack(nums2, 0, [], k2)\\n\\n num = merge(s1, s2)\\n max_num = max_arr(max_num, num)\\n\\n return max_num\\n\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def max_number_from_single_array(nums, k):\\n stack = []\\n drop = len(nums) - k\\n for num in nums:\\n while drop > 0 and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:k]\\n\\n def merge(nums1, nums2):\\n merged = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n merged.append(nums1[0])\\n nums1 = nums1[1:]\\n else:\\n merged.append(nums2[0])\\n nums2 = nums2[1:]\\n return merged\\n\\n res = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n max1 = max_number_from_single_array(nums1, i)\\n max2 = max_number_from_single_array(nums2, k - i)\\n res = max(res, merge(max1, max2))\\n return res\\n\\n# Example usage:\\nsolution = Solution()\\nnums1 = [3, 4, 6, 5]\\nnums2 = [9, 1, 2, 5, 8, 3]\\nk = 5\\nprint(solution.maxNumber(nums1, nums2, k)) # Output: [9, 8, 6, 5, 3]\",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def max_number_from_single_array(nums, k):\\n drop = len(nums) - k\\n stack = []\\n for num in nums:\\n while drop > 0 and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:k]\\n\\n def merge(nums1, nums2):\\n merged = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n merged.append(nums1[0])\\n nums1 = nums1[1:]\\n else:\\n merged.append(nums2[0])\\n nums2 = nums2[1:]\\n return merged\\n\\n max_number = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n max_from_nums1 = max_number_from_single_array(nums1, i)\\n max_from_nums2 = max_number_from_single_array(nums2, k - i)\\n merged = merge(max_from_nums1, max_from_nums2)\\n max_number = max(max_number, merged)\\n return max_number\\n\\n# Example usage:\\nsolution = Solution()\\nnums1 = [3, 4, 6, 5]\\nnums2 = [9, 1, 2, 5, 8, 3]\\nk = 5\\nprint(solution.maxNumber(nums1, nums2, k)) # Output: [9, 8, 6, 5, 3]\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"def merge(lhs, rhs):\\n ans = []\\n i, j = 0, 0\\n while i < len(lhs) and j < len(rhs):\\n if lhs[i:] > rhs[j:]:\\n ans.append(lhs[i])\\n i += 1\\n else:\\n ans.append(rhs[j])\\n j += 1\\n return ans + lhs[i:] + rhs[j:]\\n\\n\\ndef maxNumber(nums, k):\\n ans = [0] * k\\n i, j, n = 0, 0, len(nums)\\n while i < n:\\n while k - j < n - i and j > 0 and ans[j-1] < nums[i]:\\n j -= 1\\n if j < k:\\n ans[j] = nums[i]\\n j += 1\\n i += 1\\n return ans\\n\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], l: int) -> List[int]:\\n ans = [0] * l\\n for k in range(max(0, l - len(nums2)), min(l, len(nums1)) + 1):\\n lhs = maxNumber(nums1, k)\\n rhs = maxNumber(nums2, l - k)\\n ans = max(ans, merge(lhs, rhs))\\n return ans\\n\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n nums1 = list(enumerate(nums1))\\n nums2 = list(enumerate(nums2))\\n\\n def get_max_num(nums, t):\\n stack = []\\n for i, x in nums:\\n min_length = max(0, t - len(nums) + i) \\n while stack and stack[-1] < x and len(stack) > min_length:\\n stack.pop()\\n stack.append(x)\\n return stack[:t]\\n \\n def combine(arr1, arr2):\\n i = j = 0\\n p, q = len(arr1), len(arr2)\\n res = []\\n while i < p or j < q:\\n if i == p:\\n res.extend(arr2[j:])\\n break\\n elif j == q:\\n res.extend(arr1[i:])\\n break\\n elif arr1[i] > arr2[j]:\\n res.append(arr1[i])\\n i += 1\\n elif arr1[i] < arr2[j]:\\n res.append(arr2[j])\\n j += 1\\n elif arr1[i:] > arr2[j:]:\\n res.append(arr1[i])\\n i += 1\\n else:\\n res.append(arr2[j])\\n j += 1\\n\\n return res\\n\\n \\n ans = []\\n for i in range(k+1):\\n if i > len(nums1) or k-i > len(nums2):\\n continue\\n\\n m1 = get_max_num(nums1, i) if i > 0 else []\\n m2 = get_max_num(nums2, k-i) if k-i > 0 else []\\n ans.append(combine(m1, m2))\\n \\n return sorted(ans)[-1]\\n\\n \\n \",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def merge(n1, n2):\\n res = []\\n while (n1 or n2) :\\n if n1>n2:\\n res.append(n1[0])\\n n1 = n1[1:]\\n else:\\n res.append(n2[0])\\n n2 = n2[1:]\\n return res\\n \\n def findmax(nums, length):\\n l = []\\n maxpop = len(nums)-length\\n for i in range(len(nums)):\\n while maxpop>0 and len(l) and nums[i]>l[-1]:\\n l.pop()\\n maxpop -= 1\\n l.append(nums[i])\\n return l[:length]\\n \\n n1 = len(nums1)\\n n2 = len(nums2)\\n res = [0]*k\\n for i in range(k+1):\\n j = k-i\\n if i>n1 or j>n2: continue\\n l1 = findmax(nums1, i)\\n l2 = findmax(nums2, j)\\n res = max(res, merge(l1,l2))\\n return res\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def maxNumberCount(nums, count):\\n i = 0\\n j = 0\\n ans = []\\n while i < count:\\n temp = nums[j:len(nums) - count + i + 1]\\n max_ele = max(temp)\\n j += temp.index(max_ele) + 1\\n ans.append(max_ele)\\n i += 1\\n return ans\\n \\n def createMax(x, y):\\n m = []\\n while len(x) > 0 and len(y) > 0:\\n if x > y:\\n m.append(x.pop(0))\\n else:\\n m.append(y.pop(0))\\n while len(x) > 0:\\n m.append(x.pop(0))\\n\\n while len(y) > 0:\\n m.append(y.pop(0))\\n return m\\n \\n max_number = []\\n for i in range(min(k+1, len(nums1) + 1)):\\n if k - i > len(nums2):\\n continue\\n p = maxNumberCount(nums1, i)\\n q = maxNumberCount(nums2, k - i)\\n max_number = max(max_number, createMax(p, q))\\n return max_number\",\n \"runtime\": \"286\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def getMaxOrder(nums, n, total, res):\\n \\\"\\\"\\\"\\n Extract the maximum subsequence of length n from nums using a monotonic stack.\\n \\\"\\\"\\\"\\n for i, v in enumerate(nums):\\n # Remove elements from the end of res if they are smaller than the current element\\n # and if we can still achieve the length n with remaining elements.\\n while res and len(res) + total - i > n and res[-1] < v:\\n res.pop()\\n # Add the current element to res if we haven't yet reached length n.\\n if len(res) < n:\\n res.append(v)\\n return res\\n\\n def merge(nums1, nums2, ans):\\n \\\"\\\"\\\"\\n Merge two subsequences to form the largest lexicographical sequence.\\n \\\"\\\"\\\"\\n while nums1 or nums2:\\n # Append the larger element from the front of nums1 or nums2 to ans.\\n if nums1 > nums2:\\n ans.append(nums1[0])\\n nums1 = nums1[1:]\\n else:\\n ans.append(nums2[0])\\n nums2 = nums2[1:]\\n return ans\\n\\n n1, n2 = len(nums1), len(nums2)\\n res = []\\n\\n # Iterate over all possible lengths for the subsequence from nums1.\\n for i in range(max(0, k - n2), min(k, n1) + 1):\\n # Get the maximum subsequences of length i from nums1 and k-i from nums2.\\n maxSeq1 = getMaxOrder(nums1, i, n1, [])\\n maxSeq2 = getMaxOrder(nums2, k - i, n2, [])\\n # Merge the two subsequences to get the largest lexicographical result.\\n ans = merge(maxSeq1, maxSeq2, [])\\n # Update the result if the current merged result is larger.\\n res = max(ans, res)\\n \\n return res\\n\",\n \"runtime\": \"286\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def getLexMax(nums, k):\\n stack = []\\n for idx, num in enumerate(nums):\\n while stack and len(nums) - idx + len(stack) > k and stack[-1] < num:\\n stack.pop()\\n if len(stack) < k:\\n stack.append(num)\\n return stack\\n\\n def merge(nums1, nums2):\\n merged = []\\n i, j = 0, 0\\n while i < len(nums1) or j < len(nums2):\\n if i >= len(nums1):\\n merged.append(nums2[j])\\n j += 1\\n elif j >= len(nums2):\\n merged.append(nums1[i])\\n i += 1\\n elif nums1[i:] > nums2[j:]:\\n merged.append(nums1[i])\\n i += 1\\n else:\\n merged.append(nums2[j])\\n j += 1\\n return merged\\n \\n maxim = []\\n for i in range(max(0, k-len(nums2)), min(len(nums1), k) + 1):\\n j = k - i\\n subs1 = getLexMax(nums1, i)\\n subs2 = getLexMax(nums2, j)\\n merged = merge(subs1, subs2)\\n maxim = max(maxim, merged)\\n return maxim\\n\\n\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def get_max_subseq(nums, k):\\n stack = []\\n for i, num in enumerate(nums):\\n while stack and len(nums) - i + len(stack) > k and stack[-1] < num:\\n stack.pop()\\n if len(stack) < k:\\n stack.append(num)\\n return stack\\n \\n def merge(nums1, nums2):\\n merged = []\\n i, j = 0, 0\\n while i < len(nums1) or j < len(nums2):\\n if i >= len(nums1):\\n merged.append(nums2[j])\\n j += 1\\n elif j >= len(nums2):\\n merged.append(nums1[i])\\n i += 1\\n elif nums1[i:] > nums2[j:]:\\n merged.append(nums1[i])\\n i += 1\\n else:\\n merged.append(nums2[j])\\n j += 1\\n return merged\\n \\n ans = []\\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\\n j = k - i\\n subseq1 = get_max_subseq(nums1, i)\\n subseq2 = get_max_subseq(nums2, j)\\n merged = merge(subseq1, subseq2)\\n ans = max(ans, merged)\\n return ans\\n\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, a: List[int], b: List[int], k: int) -> List[int]:\\n def g(x, k):\\n s = []\\n for i, n in enumerate(x):\\n while s and len(x) - i + len(s) > k and s[-1] < n: s.pop()\\n if len(s) < k: s.append(n)\\n return s\\n def m(x, y):\\n z, i, j = [], 0, 0\\n while i < len(x) or j < len(y):\\n if i >= len(x): z.append(y[j]); j += 1\\n elif j >= len(y): z.append(x[i]); i += 1\\n elif x[i:] > y[j:]: z.append(x[i]); i += 1\\n else: z.append(y[j]); j += 1\\n return z\\n \\n r = []\\n for i in range(max(0, k - len(b)), min(len(a), k) + 1):\\n j = k - i\\n s1, s2 = g(a, i), g(b, j)\\n mrg = m(s1, s2)\\n r = max(r, mrg)\\n return r\\n\",\n \"runtime\": \"314\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n L1, L2, S, L = len(nums1), len(nums2), -1, []\\n def find(n, N):\\n if n==0: return []\\n elif n==len(N): return N\\n stack = []\\n for i, v in enumerate(N):\\n while stack and len(stack)+len(N)-i>n and stack[-1]<v: stack.pop()\\n stack.append(v) \\n return stack[:n]\\n def merge(s1, s2):\\n N, lst, = 0, []\\n while s1 or s2:\\n v1 = s1[0] if s1 else -1\\n v2 = s2[0] if s2 else -1\\n if v1>v2: \\n lst.append(v1)\\n s1.pop(0)\\n elif v2>v1:\\n lst.append(v2)\\n s2.pop(0)\\n else:\\n j, f = 1, False\\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j+=1\\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\\n elif j<len(s1): f = True\\n if f: \\n lst.append(v1)\\n s1.pop(0)\\n else:\\n lst.append(v2)\\n s2.pop(0)\\n for v in lst: N = N*10 + v\\n return N, lst \\n for j in range(max(0, k-L2), min(L1, k)+1):\\n s1 = find(j, nums1)\\n s2 = find(k-j, nums2)\\n N, lst = merge(s1.copy(), s2.copy())\\n if N>S: S, L = N, lst\\n return L \",\n \"runtime\": \"314\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n def fn(arr, k):\\n \\\"\\\"\\\"Return largest sub-sequence of arr of size k.\\\"\\\"\\\"\\n ans = []\\n for i, x in enumerate(arr): \\n while ans and ans[-1] < x and len(ans) + len(arr) - i > k: ans.pop()\\n if len(ans) < k: ans.append(x)\\n return ans\\n \\n ans = [0] * k\\n for i in range(k+1): \\n if k - len(nums2) <= i <= len(nums1): \\n val1 = fn(nums1, i)\\n val2 = fn(nums2, k-i)\\n cand = []\\n i1 = i2 = 0\\n while i1 < len(val1) or i2 < len(val2): \\n if val1[i1:] >= val2[i2:]: \\n cand.append(val1[i1])\\n i1 += 1\\n else: \\n cand.append(val2[i2])\\n i2 += 1\\n ans = max(ans, cand)\\n return ans\",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"class Solution(object):\\n def maxNumber(self, nums1, nums2, k):\\n \\\"\\\"\\\"\\n :type nums1: List[int]\\n :type nums2: List[int]\\n :type k: int\\n :rtype: List[int]\\n \\\"\\\"\\\"\\n def getMax(nums, t):\\n ans = []\\n size = len(nums)\\n for x in range(size):\\n while ans and len(ans) + size - x > t and ans[-1] < nums[x]:\\n ans.pop()\\n if len(ans) < t:\\n ans += nums[x],\\n return ans\\n\\n def merge(nums1, nums2):\\n ans = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n ans += nums1[0],\\n nums1 = nums1[1:]\\n else:\\n ans += nums2[0],\\n nums2 = nums2[1:]\\n return ans\\n \\n len1, len2 = len(nums1), len(nums2)\\n res = []\\n for x in range(max(0, k - len2), min(k, len1) + 1):\\n tmp = merge(getMax(nums1, x), getMax(nums2, k - x))\\n res = max(tmp, res)\\n return res\\n\\n \\n \",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\r\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\r\\n return self.fun2(nums1, nums2, k)\\r\\n\\r\\n def fun2(self, nums1, nums2, k):\\r\\n if k == len(nums1) + len(nums2):\\r\\n return self.join(nums1, nums2)\\r\\n res = [0]\\r\\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\\r\\n a = self.getnums(nums1, i)\\r\\n b = self.getnums(nums2, k - i)\\r\\n ans = self.join(a, b)\\r\\n if ans > res:\\r\\n res = ans\\r\\n\\r\\n return res\\r\\n\\r\\n def fun1(self, nums1, nums2, k):\\r\\n ln = len(nums1)\\r\\n a = [(n, ln - k - 1) for k, n in enumerate(nums1)]\\r\\n ln = len(nums2)\\r\\n b = [(n, ln - k - 1) for k, n in enumerate(nums2)]\\r\\n a.sort()\\r\\n b.sort()\\r\\n\\r\\n a.insert(0, (-1, len(nums1)))\\r\\n b.insert(0, (-1, len(nums2)))\\r\\n resa = [(-1, len(nums1))]\\r\\n resb = [(-1, len(nums2))]\\r\\n while k > 0 and a and b:\\r\\n an, ak = a[-1] if a else (-1, 0)\\r\\n bn, bk = b[-1] if b else (-1, 0)\\r\\n if an >= bn:\\r\\n if ak < resa[-1][1] and ak + resb[-1][1] + 1 >= k:\\r\\n resa.append((an, ak))\\r\\n k -= 1\\r\\n a.pop()\\r\\n else:\\r\\n if bk < resb[-1][1] and bk + resa[-1][1] + 1 >= k:\\r\\n resb.append((bn, bk))\\r\\n k -= 1\\r\\n b.pop()\\r\\n\\r\\n res = []\\r\\n i = j = 1\\r\\n while i < len(resa) and j < len(resb):\\r\\n if resa[i] >= resb[j]:\\r\\n res.append(resa[i])\\r\\n i += 1\\r\\n else:\\r\\n res.append(resb[j])\\r\\n j += 1\\r\\n\\r\\n return [d[0] for d in res + resa[i:] + resb[j:]]\\r\\n\\r\\n def getnums(self, nums, k):\\r\\n if k <= 0 or not nums:\\r\\n return []\\r\\n if k == len(nums):\\r\\n return nums.copy()\\r\\n m = max(nums)\\r\\n n = nums.index(m)\\r\\n if len(nums) - n == k:\\r\\n return nums[n:]\\r\\n elif len(nums) - n < k:\\r\\n return self.getnums(nums[:n], k - len(nums) + n) + nums[n:]\\r\\n else:\\r\\n return [m] + self.getnums(nums[n + 1 :], k - 1)\\r\\n\\r\\n def join(self, nums1, nums2):\\r\\n return [max(nums1, nums2).pop(0) for _ in nums1 + nums2]\\r\\n\\r\\n def join2(self, nums1, nums2):\\r\\n res = []\\r\\n i = j = 0\\r\\n while i < len(nums1) and j < len(nums2):\\r\\n if nums1[i:] >= nums2[j:]:\\r\\n res.append(nums1[i])\\r\\n i += 1\\r\\n elif nums1[i:] < nums2[j:]:\\r\\n res.append(nums2[j])\\r\\n j += 1\\r\\n\\r\\n return res + nums1[i:] + nums2[j:]\\r\\n\\r\\n\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n def fn(arr, k):\\n \\\"\\\"\\\"Return largest sub-sequence of arr of size k.\\\"\\\"\\\"\\n ans = []\\n for i, x in enumerate(arr): \\n while ans and ans[-1] < x and len(ans) + len(arr) - i > k: ans.pop()\\n if len(ans) < k: ans.append(x)\\n return ans\\n \\n ans = [0] * k\\n for i in range(k+1): \\n if k - len(nums2) <= i <= len(nums1): \\n val1 = fn(nums1, i)\\n val2 = fn(nums2, k-i)\\n cand = []\\n i1 = i2 = 0\\n while i1 < len(val1) or i2 < len(val2): \\n if val1[i1:] >= val2[i2:]: \\n cand.append(val1[i1])\\n i1 += 1\\n else: \\n cand.append(val2[i2])\\n i2 += 1\\n ans = max(ans, cand)\\n return ans \",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n ans = None\\n for i in range(min(len(nums1) + 1, k + 1)):\\n if k - i > len(nums2):\\n continue\\n\\n num1 = self.max_number(nums1, i)\\n num2 = self.max_number(nums2, k - i)\\n\\n cand = self.merge(num1, num2)\\n ans = cand if ans is None else max(ans, cand)\\n return ans\\n\\n def merge(self, num1, num2):\\n ans = []\\n i = 0\\n j = 0\\n while i < len(num1) and j < len(num2):\\n if num1[i] > num2[j] or num1[i:] > num2[j:]:\\n ans.append(num1[i])\\n i += 1\\n else:\\n ans.append(num2[j])\\n j += 1\\n while i < len(num1):\\n ans.append(num1[i])\\n i += 1\\n while j < len(num2):\\n ans.append(num2[j])\\n j += 1\\n\\n return ans\\n\\n def max_number(self, nums, k):\\n h = []\\n n = len(nums)\\n\\n cur = 0\\n ans = []\\n last_i = -1\\n while k > 0:\\n while cur <= n - k:\\n heapq.heappush(h, (-nums[cur], cur))\\n cur += 1\\n while h[0][1] <= last_i:\\n heapq.heappop(h)\\n top = heapq.heappop(h)\\n ans.append(-top[0]) \\n last_i = top[1]\\n k -= 1\\n\\n return ans\\n \\n \\n\",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n res = []\\n for select1 in range(k+1):\\n select2 = k - select1\\n if select2 > len(nums2) or select1 > len(nums1):\\n continue\\n\\n top1 = self.selectMax(nums1, select1)\\n top2 = self.selectMax(nums2, select2)\\n\\n # print(\\\"here\\\")\\n # print(top1)\\n # print(top2)\\n cand = self.mergeNums(top1, top2)\\n # print(cand)\\n res = max(res, cand)\\n\\n return res\\n\\n\\n def selectMax(self, nums, s):\\n # select in a range such that len(nums) - len(range) = s - 1\\n # len(range) = len(remaining) - s + 1\\n # len(range) = len(nums) - maxISelected - s + 1\\n # nums[maxISelected: len(nums) - maxISelected - s + 1] \\n # repeat this equation between selectedI + 1 \\n res = []\\n maxISelected = 0\\n sInit = s\\n while len(res) < sInit:\\n maxI = 0\\n mx = -1\\n # print(maxISelected, len(nums) - s)\\n for i in range(maxISelected, len(nums) - s + 1):\\n if nums[i] > mx:\\n mx = nums[i]\\n maxI = i\\n maxISelected = maxI +1\\n res.append(mx)\\n s -= 1\\n return res\\n \\n def mergeNums(self, nums1, nums2):\\n res = []\\n \\n def compare_prefix(n1, n2):\\n l1, l2 = len(n1), len(n2)\\n for i in range(min(l1, l2)):\\n if n1[i] != n2[i]:\\n return n1[i] < n2[i]\\n return l1 < l2\\n \\n while nums1 and nums2:\\n if nums1[0] == nums2[0]:\\n if compare_prefix(nums1, nums2):\\n res.append(nums2.pop(0))\\n else:\\n res.append(nums1.pop(0))\\n elif nums1[0] > nums2[0]:\\n res.append(nums1.pop(0))\\n else:\\n res.append(nums2.pop(0))\\n \\n # Append the remaining items from nums1 or nums2\\n res.extend(nums1 if nums1 else nums2)\\n \\n return res\",\n \"runtime\": \"371\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n\\n def array(arr,size):\\n\\n stack=[]\\n\\n temp=len(arr) - size\\n\\n for i in arr:\\n while temp>0 and stack and stack[-1]<i:\\n stack.pop()\\n temp-=1\\n \\n stack.append(i)\\n \\n return stack[:size]\\n \\n def merge(arr1, arr2):\\n result = []\\n while arr1 or arr2:\\n if arr1 > arr2:\\n result.append(arr1.pop(0))\\n else:\\n result.append(arr2.pop(0))\\n return result\\n\\n n = len(nums1)\\n m = len(nums2)\\n\\n ans=[]\\n for x in range(min(k+1,n+1)):\\n\\n arr1 = array(nums1,x)\\n arr2 = array(nums2,k-x)\\n\\n candidate = merge(arr1,arr2)\\n if len(candidate)<=k and (candidate > ans or len(candidate) > len(ans)):\\n ans = candidate\\n\\n \\n return ans\\n\\n \",\n \"runtime\": \"371\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def merge(arr1, arr2):\\n res, i, j = [], 0, 0\\n while i < len(arr1) and j < len(arr2):\\n if arr1[i:] >= arr2[j:]:\\n res.append(arr1[i])\\n i += 1\\n else: \\n res.append(arr2[j])\\n j += 1\\n if i < len(arr1): res += arr1[i:]\\n elif j < len(arr2): res += arr2[j:]\\n return res \\n \\n def makeArr(arr, l):\\n i, res = 0, []\\n for r in range(l - 1, -1, -1):\\n num, i = max(arr[i:-r] or arr[i:])\\n i = -i + 1\\n res.append(num)\\n return res\\n \\n nums1, nums2, choices = [(num, -i) for i, num in enumerate(nums1)], [(num, -i) for i, num in enumerate(nums2)], []\\n for m in range(k + 1):\\n if m > len(nums1) or k - m > len(nums2): continue\\n arr1, arr2 = makeArr(nums1, m), makeArr(nums2, k - m) \\n choices.append(merge(arr1, arr2))\\n return max(choices)\",\n \"runtime\": \"385\"\n },\n {\n \"code\": \"class Solution:\\r\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\r\\n return self.fun2(nums1, nums2, k)\\r\\n\\r\\n def fun2(self, nums1, nums2, k):\\r\\n if k == len(nums1) + len(nums2):\\r\\n return self.join(nums1, nums2)\\r\\n res = [0]\\r\\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\\r\\n a = self.getnums(nums1, i)\\r\\n b = self.getnums(nums2, k - i)\\r\\n ans = self.join(a, b)\\r\\n if ans > res:\\r\\n res = ans\\r\\n\\r\\n return res\\r\\n\\r\\n def fun1(self, nums1, nums2, k):\\r\\n ln = len(nums1)\\r\\n a = [(n, ln - k - 1) for k, n in enumerate(nums1)]\\r\\n ln = len(nums2)\\r\\n b = [(n, ln - k - 1) for k, n in enumerate(nums2)]\\r\\n a.sort()\\r\\n b.sort()\\r\\n\\r\\n a.insert(0, (-1, len(nums1)))\\r\\n b.insert(0, (-1, len(nums2)))\\r\\n resa = [(-1, len(nums1))]\\r\\n resb = [(-1, len(nums2))]\\r\\n while k > 0 and a and b:\\r\\n an, ak = a[-1] if a else (-1, 0)\\r\\n bn, bk = b[-1] if b else (-1, 0)\\r\\n if an >= bn:\\r\\n if ak < resa[-1][1] and ak + resb[-1][1] + 1 >= k:\\r\\n resa.append((an, ak))\\r\\n k -= 1\\r\\n a.pop()\\r\\n else:\\r\\n if bk < resb[-1][1] and bk + resa[-1][1] + 1 >= k:\\r\\n resb.append((bn, bk))\\r\\n k -= 1\\r\\n b.pop()\\r\\n\\r\\n res = []\\r\\n i = j = 1\\r\\n while i < len(resa) and j < len(resb):\\r\\n if resa[i] >= resb[j]:\\r\\n res.append(resa[i])\\r\\n i += 1\\r\\n else:\\r\\n res.append(resb[j])\\r\\n j += 1\\r\\n\\r\\n return [d[0] for d in res + resa[i:] + resb[j:]]\\r\\n\\r\\n def getnums(self, nums, k):\\r\\n if k <= 0:\\r\\n return []\\r\\n if k == len(nums):\\r\\n return nums\\r\\n m = max(nums)\\r\\n n = nums.index(m)\\r\\n if len(nums) - n == k:\\r\\n return nums[n:]\\r\\n elif len(nums) - n < k:\\r\\n return self.getnums(nums[:n], k - len(nums) + n) + nums[n:]\\r\\n else:\\r\\n return [m] + self.getnums(nums[n + 1 :], k - 1)\\r\\n\\r\\n def join(self, nums1, nums2):\\r\\n res = []\\r\\n i = j = 0\\r\\n while i < len(nums1) and j < len(nums2):\\r\\n if nums1[i:] >= nums2[j:]:\\r\\n res.append(nums1[i])\\r\\n i += 1\\r\\n elif nums1[i:] < nums2[j:]:\\r\\n res.append(nums2[j])\\r\\n j += 1\\r\\n\\r\\n return res + nums1[i:] + nums2[j:]\\r\\n\\r\\n\",\n \"runtime\": \"399\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def getMaxSeq(nums, kk):\\n stk = []\\n n = len(nums)\\n for i in range(len(nums)):\\n while stk and stk[-1] < nums[i] and len(stk) + n - i > kk:\\n stk.pop()\\n stk.append(nums[i])\\n return stk[:kk]\\n\\n def greater(a1, a2):\\n for i in range(min(len(a1), len(a2))):\\n if a1[i] > a2[i]:\\n return True\\n elif a1[i] < a2[i]:\\n return False\\n return True if len(a1) > len(a2) else False\\n\\n # merge nums1 and nums2\\n def merge(sub1, sub2):\\n i1, i2 = 0, 0\\n res = []\\n for kk in range(k):\\n if greater(sub1[i1:], sub2[i2:]):\\n res.append(sub1[i1])\\n i1 += 1\\n else:\\n res.append(sub2[i2])\\n i2 += 1\\n return res\\n \\n res = []\\n for i in range(k + 1):\\n if i > len(nums1) or k - i > len(nums2):\\n continue\\n sub1 = getMaxSeq(nums1, i)\\n sub2 = getMaxSeq(nums2, k - i)\\n sub = merge(sub1, sub2)\\n # print(sub1, sub2, sub)\\n if len(res) == 0 or greater(sub, res):\\n res = sub\\n return res\\n \\n\",\n \"runtime\": \"413\"\n },\n {\n \"code\": \"def createMaxNum(L,k):\\n # returns maximum number one can make of all different lengths till k\\n n = len(L)\\n # Let A[i][j] be max numer one can make with subsequence of A[:i+1] of length j\\n # A[i][j] = 0 if i+1 < j\\n # A[i][0] = 0\\n A = [[0]*(k+1) for i in range(n)]\\n for j in range(1,k+1):\\n for i in range(j-1,n):\\n prev = A[i-1][j-1]\\n x = 10*prev + L[i] #if L[i] is to be included\\n y = A[i-1][j] # otherwise\\n A[i][j] = max(x,y)\\n return A[n-1]\\n\\n\\ndef merge(A,B):\\n n,m = len(A),len(B)\\n if n == 0:return B\\n if m == 0:return A\\n C = []\\n i = 0\\n j = 0\\n while i < n and j < m:\\n I = i\\n J = j\\n while I < n and J < m and A[I] == B[J]:\\n I += 1\\n J += 1\\n if I >= n and J < m:\\n C.append(B[j])\\n j += 1\\n elif I < n and J >= m:\\n C.append(A[i])\\n i += 1\\n elif I >= n and J >= m:\\n C.append(A[i])\\n i += 1\\n elif A[I] > B[J]:\\n C.append(A[i])\\n i += 1\\n elif A[I] < B[J]:\\n C.append(B[j])\\n j += 1\\n else:\\n raise ValueError()\\n C.extend(A[i:])\\n C.extend(B[j:])\\n return C \\n\\ndef solve(L1,L2,k):\\n A = createMaxNum(L1,k)\\n B = createMaxNum(L2,k)\\n #print(A)\\n #print(B)\\n if len(L1)==0:\\n return [int(x) for x in str(B[-1])]\\n if len(L2)==0:\\n return [int(x) for x in str(A[-1])]\\n if L2 ==[0]*len(L2):\\n return [int(x) for x in A[-1]] + L2\\n if L1 ==[0]*len(L1):\\n return [int(x) for x in B[-1]] + L1\\n toret = [A[-1],B[-1]]\\n for x in range(1,k):\\n y = k - x\\n if A[x]:a = list(str(A[x]))\\n else: a = []\\n if B[y]:b = list(str(B[y]))\\n else: b = []\\n c = merge(a,b)\\n c = \\\"\\\".join(c)\\n if c:c = int(c)\\n else: c = 0\\n toret.append(c)\\n #print(toret)\\n return max(toret)\\n\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n x = solve(nums1,nums2,k)\\n x = [int(y) for y in str(x)]\\n return x \",\n \"runtime\": \"427\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n nums1_max = self.singleArraryMaxIndex(nums1)\\n nums2_max = self.singleArraryMaxIndex(nums2)\\n res = []\\n for i in range(min(k + 1, len(nums1) + 1)):\\n res1 = self.singleMaxK(nums1, nums1_max, i)\\n res2 = self.singleMaxK(nums2, nums2_max, k - i)\\n temp = self.constructArray(res1, res2)\\n if len(res) == 0:\\n res = temp[:]\\n else:\\n temp_n = self.arrayToInt(temp)\\n res_n = self.arrayToInt(res)\\n if temp_n > res_n:\\n res = temp[:]\\n return res\\n\\n def arrayToInt(self, nums: List[int]) -> int:\\n res = 0\\n for i in nums:\\n res = res * 10 + i\\n return res\\n\\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\\n i1, i2 = 0, 0\\n n1, n2 = len(nums1), len(nums2)\\n res = []\\n while i1 < n1 or i2 < n2:\\n if i1 < n1 and i2 < n2:\\n if nums1[i1] > nums2[i2]:\\n res.append(nums1[i1])\\n i1 += 1\\n elif nums1[i1] < nums2[i2]:\\n res.append(nums2[i2])\\n i2 += 1\\n else:\\n temp_i1, temp_i2 = i1+1, i2+1\\n while temp_i1 < n1 and temp_i2 < n2 and nums1[temp_i1] == nums2[temp_i2]:\\n temp_i1 += 1\\n temp_i2 += 1\\n if temp_i1 < n1 and temp_i2 < n2:\\n if nums1[temp_i1] > nums2[temp_i2]:\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n elif temp_i1 < n1:\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n elif i1 < n1:\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n return res\\n\\n def singleMaxK(self, nums: List[int], max_index: List[List[int]], k: int) -> List[int]:\\n n = len(nums)\\n res = []\\n start, end = 0, n - k\\n while len(res) < k and start <= end:\\n res.append(nums[max_index[start][end]])\\n start = max_index[start][end] + 1\\n end += 1\\n return res\\n\\n def singleArraryMaxIndex(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n res = [[0] * n for i in range(n)]\\n for i in range(n):\\n for j in range(i, n):\\n if j == i:\\n res[i][j] = i\\n else:\\n res[i][j] = j if nums[j] > nums[res[i][j-1]] else res[i][j-1]\\n return res\",\n \"runtime\": \"442\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n ln2=len(nums2)\\n @cache\\n def max2(i):\\n s=[]\\n ls=0\\n maxpop=ln2-i\\n maxi=[]\\n for x in nums2:\\n while maxpop>0 and s and s[-1]<x:\\n s.pop()\\n ls-=1\\n maxpop-=1\\n if ls<i:\\n s.append(x)\\n ls+=1\\n else:\\n maxpop-=1\\n if maxi<s:\\n maxi=s.copy()\\n return maxi\\n \\n ln1=len(nums1)\\n @cache\\n def max1(i):\\n s=[]\\n ls=0\\n maxpop=ln1-i\\n maxi=[]\\n for x in nums1:\\n while maxpop>0 and s and s[-1]<x:\\n s.pop()\\n ls-=1\\n maxpop-=1\\n if ls<i:\\n s.append(x)\\n ls+=1\\n else:\\n maxpop-=1\\n if maxi<s:\\n maxi=s.copy()\\n return maxi\\n\\n\\n answer=[]\\n def merge(i,j):\\n nonlocal answer\\n if i==0:\\n if max2(j)>answer:\\n answer=max2(j).copy()\\n return\\n if j==0:\\n if max1(i)>answer:\\n answer=max1(i).copy()\\n return\\n l1=max1(i)\\n l2=max2(j)\\n ii,jj=0,0\\n l=[]\\n \\n while l1 or l2:\\n if l1>l2:\\n l.append(l1[0])\\n l1=l1[1:]\\n else:\\n l.append(l2[0])\\n l2=l2[1:]\\n\\n if l>answer:\\n answer=l.copy()\\n \\n for i in range(ln1+1):\\n if 0<=k-i<=ln2:\\n merge(i,k-i)\\n\\n return answer\\n\\n \\n \",\n \"runtime\": \"456\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def findMaxSubArray(array, n):\\n drop = len(array) - n\\n stack = []\\n for i in range(len(array)):\\n while stack and stack[-1] < array[i] and drop > 0:\\n stack.pop()\\n drop -= 1\\n stack.append(array[i])\\n return stack[:n]\\n \\n def merge(subsequence1, subsequence2):\\n merged = []\\n while subsequence1 or subsequence2:\\n if subsequence1 > subsequence2:\\n merged.append(subsequence1.pop(0))\\n else:\\n merged.append(subsequence2.pop(0))\\n return merged\\n \\n res = [0] * k\\n for i in range(k + 1):\\n maxSubArray1 = findMaxSubArray(nums1, i)\\n maxSubArray2 = findMaxSubArray(nums2, k - i)\\n if len(maxSubArray1) + len(maxSubArray2) != k:\\n continue\\n res = max(res, merge(maxSubArray1[:], maxSubArray2[:]))\\n \\n return res\\n\\n\",\n \"runtime\": \"470\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def dfs(nums,x):\\n stack, n = [], len(nums)\\n\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\\n stack.pop()\\n\\n if len(stack) < x:\\n stack.append(nums[i])\\n\\n return stack \\n\\n def merge(ans1,ans2):\\n if len(ans1) + len(ans2) < k:\\n return []\\n \\n result = []\\n\\n while ans1 or ans2:\\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\\n result.append(cur)\\n\\n return result \\n\\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))\",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def dfs(nums,x):\\n stack, n = [], len(nums)\\n\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\\n stack.pop()\\n\\n if len(stack) < x:\\n stack.append(nums[i])\\n\\n return stack \\n\\n def merge(ans1,ans2):\\n if len(ans1) + len(ans2) < k:\\n return []\\n \\n result = []\\n\\n while ans1 or ans2:\\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\\n result.append(cur)\\n\\n return result \\n\\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))\",\n \"runtime\": \"512\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n\\n def findMono(nums, x):\\n stack, n = [], len(nums)\\n\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and n - i + len(stack) > x:\\n stack.pop()\\n if len(stack) < x:\\n stack.append(nums[i])\\n return stack\\n\\n def merge(ans1, ans2):\\n res = []\\n if len(ans1) + len(ans2) < k:\\n return res\\n while ans1 or ans2:\\n res.append(ans1.pop(0) if ans1 > ans2 else ans2.pop(0))\\n return res\\n\\n\\n return max(merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1))\",\n \"runtime\": \"526\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def dfs(nums, x):\\n stack = []\\n n = len(nums)\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and n - i + len(stack) > x:\\n stack.pop()\\n if len(stack) < x:\\n stack.append(nums[i])\\n return stack\\n\\n def merge(ans1, ans2):\\n res = []\\n if len(ans1) + len(ans2) < k:\\n return []\\n while ans1 or ans2:\\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\\n res.append(cur)\\n return res\\n\\n return max(merge(dfs(nums1, i), dfs(nums2, k-i)) for i in range(k+1))\\n\\n\\n\",\n \"runtime\": \"540\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def dfs(nums,x):\\n stack, n = [], len(nums)\\n\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\\n stack.pop()\\n\\n if len(stack) < x:\\n stack.append(nums[i])\\n\\n return stack \\n\\n def merge(ans1,ans2):\\n if len(ans1) + len(ans2) < k:\\n return []\\n \\n result = []\\n\\n while ans1 or ans2:\\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\\n result.append(cur)\\n\\n return result \\n\\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))\",\n \"runtime\": \"540\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def dfs(nums,x):\\n stack, n = [], len(nums)\\n\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\\n stack.pop()\\n\\n if len(stack) < x:\\n stack.append(nums[i])\\n\\n return stack \\n\\n def merge(ans1,ans2):\\n if len(ans1) + len(ans2) < k:\\n return []\\n \\n result = []\\n\\n while ans1 or ans2:\\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\\n result.append(cur)\\n\\n return result \\n\\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))\",\n \"runtime\": \"555\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def dfs(nums,x):\\n stack, n = [], len(nums)\\n\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and len(stack) > x-n+i:\\n stack.pop()\\n\\n if len(stack) < x:\\n stack.append(nums[i])\\n\\n return stack \\n\\n def merge(ans1,ans2):\\n if len(ans1) + len(ans2) < k:\\n return []\\n \\n result = []\\n\\n while ans1 or ans2:\\n cur = ans1.pop(0) if ans1 > ans2 else ans2.pop(0)\\n result.append(cur)\\n\\n return result \\n\\n return max(merge(dfs(nums1,i),dfs(nums2,k-i)) for i in range(k+1))\",\n \"runtime\": \"569\"\n },\n {\n \"code\": \"class RMQ:\\n def __init__(self, nums):\\n n = len(nums)\\n self.N = int(log2(n)) + 1\\n self.nums = nums\\n\\n rmq = [[0] * self.N for _ in range(n)]\\n for i in range(n):\\n rmq[i][0] = i\\n\\n j = 1\\n while (1 << j) <= n:\\n i = 0\\n while i + (1 << j) -1 < n:\\n l, r = rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]\\n if nums[l] >= nums[r]:\\n rmq[i][j] = l\\n else:\\n rmq[i][j] = r\\n i += 1\\n j += 1\\n\\n self.rmq = rmq\\n\\n\\n def min_q(self, l, r):\\n j = int(log2(r - l + 1))\\n ll, rr = self.rmq[l][j], self.rmq[r-(1<<j)+1][j]\\n if self.nums[ll] >= self.nums[rr]:\\n return ll\\n return rr\\n\\n\\ndef get_n(nums, take, rmq) -> List[int]:\\n left, n = 0, len(nums)\\n if take >= n:\\n return nums\\n\\n ans = []\\n for right in range(n-take, n):\\n i = rmq.min_q(left, right)\\n ans.append(nums[i])\\n left = i + 1\\n return ans\\n\\n\\ndef merge(a, b) -> List[int]:\\n a, b = deque(a), deque(b)\\n ans = []\\n while a and b:\\n if a > b:\\n ans.append(a.popleft())\\n else:\\n ans.append(b.popleft())\\n if a:\\n ans += list(a)\\n if b:\\n ans += list(b)\\n return ans\\n\\nclass Solution:\\n def maxNumber(self, A: List[int], B: List[int], k: int) -> List[int]:\\n rmq_a, rmq_b = RMQ(A), RMQ(B)\\n ans = [-100000000] * k\\n for l in range(k+1):\\n r = k - l\\n arr_l = get_n(A, l, rmq_a)\\n arr_r = get_n(B, r, rmq_b)\\n\\n tmp = merge(arr_l, arr_r)\\n if len(tmp) == k:\\n ans = max(ans, tmp)\\n\\n return ans\",\n \"runtime\": \"569\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.pop(0))\\n else:\\n ret.append(n2.pop(0))\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n if i == 9:\\n print(\\\"debug\\\")\\n \\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"583\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.pop(0))\\n else:\\n ret.append(n2.pop(0))\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n if i == 9:\\n print(\\\"debug\\\")\\n \\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"597\"\n },\n {\n \"code\": \"class Solution:\\n def getBiggestK(self, nums: List[int], k: int) -> List[int]:\\n if k == 0:\\n return []\\n stack = []\\n drop = len(nums) - k # number of elements we can drop\\n \\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n \\n # Ensure the result has exactly k elements\\n return stack[:k]\\n\\n def merge(self, nums1: List[int], nums2: List[int]) -> List[int]:\\n merged = []\\n while nums1 or nums2:\\n # Compare slices to decide which element to take\\n if nums1 > nums2:\\n merged.append(nums1.pop(0))\\n else:\\n merged.append(nums2.pop(0))\\n return merged\\n\\n\\n def compare(self, nums1, nums2) -> int:\\n if len(nums1) != len(nums2):\\n return len(nums1) > len(nums2) \\n i = 0\\n j = 0\\n while i<len(nums1) and j<len(nums2):\\n if nums1[i] > nums2[j]:\\n return True\\n elif nums1[i] < nums2[j]:\\n return False\\n i += 1\\n j += 1\\n return len(nums1) >= len(nums2)\\n\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n greatest = [0] * k\\n for i in range(k+1):\\n nums1_biggest = self.getBiggestK(nums1, i)\\n nums2_biggest = self.getBiggestK(nums2, k-i)\\n comb_big = self.merge(nums1_biggest, nums2_biggest)\\n if self.compare(comb_big, greatest):\\n greatest = comb_big\\n\\n return greatest\\n\\n \",\n \"runtime\": \"611\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n while drop and s1 and s1[-1] < n1[i]:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(n1[i])\\n while s1 and len(s1) > j:\\n s1.pop()\\n return s1\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"625\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n if i == 9:\\n print(\\\"debug\\\")\\n \\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"639\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n if i == 9:\\n print(\\\"debug\\\")\\n \\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"653\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"653\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n def max_single(arr, l):\\n num = []\\n \\n cur = -1\\n for start in range(len(arr)-l, len(arr)):\\n best = -float(\\\"inf\\\")\\n best_idx = None\\n while start >= 0 and start > cur:\\n if arr[start] >= best:\\n best = arr[start]\\n best_idx = start\\n start -= 1\\n num.append(arr[best_idx])\\n cur = best_idx\\n return num\\n \\n def mergeMax(nums1, nums2):\\n ans = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n ans += nums1[0],\\n nums1 = nums1[1:]\\n else:\\n ans += nums2[0],\\n nums2 = nums2[1:]\\n return ans\\n \\n \\n# def merge(a1, a2):\\n# num = []\\n \\n# a1 = deque(a1)\\n# a2 = deque(a2)\\n \\n# while a1 or a2:\\n# if a1 and a2:\\n# if a1[0] > a2[0]:\\n# num.append(a1.popleft())\\n# elif a1[0] < a2[0]:\\n# num.append(a2.popleft())\\n# else:\\n \\n# else:\\n# if a1:\\n# num.append(a1.popleft())\\n# else:\\n# num.append(a2.popleft())\\n# return num\\n \\n def greater(n1, n2):\\n for nn1, nn2 in zip(n1, n2):\\n if nn1 > nn2:\\n return n1\\n elif nn2 > nn1:\\n return n2\\n return n1\\n \\n max_number = []\\n \\n for left in range(min(k, len(nums1)) + 1):\\n if k - left > len(nums2):\\n continue\\n # print(left, k-left)\\n \\n l = max_single(nums1, left)\\n r = max_single(nums2, k-left)\\n num = mergeMax(l, r)\\n # print(\\\"gg\\\")\\n if max_number:\\n max_number = greater(max_number, num)\\n else:\\n max_number = num\\n return max_number\\n \\n \\n \",\n \"runtime\": \"668\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n def max_single(arr, l):\\n num = []\\n \\n cur = -1\\n for start in range(len(arr)-l, len(arr)):\\n best = -float(\\\"inf\\\")\\n best_idx = None\\n while start >= 0 and start > cur:\\n if arr[start] >= best:\\n best = arr[start]\\n best_idx = start\\n start -= 1\\n num.append(arr[best_idx])\\n cur = best_idx\\n return num\\n \\n def mergeMax(nums1, nums2):\\n ans = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n ans += nums1[0],\\n nums1 = nums1[1:]\\n else:\\n ans += nums2[0],\\n nums2 = nums2[1:]\\n return ans\\n \\n def greater(n1, n2):\\n for nn1, nn2 in zip(n1, n2):\\n if nn1 > nn2:\\n return n1\\n elif nn2 > nn1:\\n return n2\\n return n1\\n \\n max_number = []\\n \\n for left in range(min(k, len(nums1)) + 1):\\n if k - left > len(nums2):\\n continue\\n\\n l = max_single(nums1, left)\\n r = max_single(nums2, k-left)\\n num = mergeMax(l, r)\\n \\n if max_number:\\n max_number = greater(max_number, num)\\n else:\\n max_number = num\\n \\n return max_number\\n \\n \\n \",\n \"runtime\": \"682\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n m = len(nums1)\\n n = len(nums2)\\n dp = {}\\n \\n # get the max number string with \\\"length\\\" from index \\\"i\\\" in nums1 and index \\\"j\\\" in nums2\\n # using number string to easy to compare\\n def getMaxNumberString(i, j, length):\\n if length == 0:\\n return \\\"\\\"\\n \\n # using memoization to optimize for the overlapping subproblems\\n key = (i, j, length)\\n if key in dp:\\n return dp[key]\\n \\n # greedy to find the possible max digit from nums1 and nums2\\n # 1) bigger digit in the higher position of the number will get bigger number\\n # 2) at the same time, we need to ensure that we still have enough digits to form a number with \\\"length\\\" digits\\n \\n # try to find the possible max digit from index i in nums1\\n index1 = None\\n for ii in range(i, m):\\n if (m - ii + n - j) < length:\\n break\\n if index1 is None or nums1[index1] < nums1[ii]:\\n index1 = ii\\n \\n # try to find the possible max digit from index j in nums2\\n index2 = None\\n for jj in range(j, n):\\n if (m - i + n - jj) < length:\\n break\\n if index2 is None or nums2[index2] < nums2[jj]:\\n index2 = jj\\n \\n maxNumberStr = None\\n if index1 is not None and index2 is not None:\\n if nums1[index1] > nums2[index2]:\\n maxNumberStr = str(nums1[index1]) + getMaxNumberString(index1 + 1, j, length - 1)\\n elif nums1[index1] < nums2[index2]:\\n maxNumberStr = str(nums2[index2]) + getMaxNumberString(i, index2 + 1, length - 1)\\n else:\\n # get the same digit from nums1 and nums2, so need to try two cases and get the max one \\n maxNumberStr = max(str(nums1[index1]) + getMaxNumberString(index1 + 1, j, length - 1), str(nums2[index2]) + getMaxNumberString(i, index2 + 1, length - 1))\\n elif index1 is not None:\\n maxNumberStr = str(nums1[index1]) + getMaxNumberString(index1 + 1, j, length - 1)\\n elif index2 is not None:\\n maxNumberStr = str(nums2[index2]) + getMaxNumberString(i, index2 + 1, length - 1)\\n \\n dp[key] = maxNumberStr\\n return maxNumberStr\\n\\n result_str = getMaxNumberString(0, 0, k)\\n \\n # number string to digit array\\n result = []\\n for c in result_str:\\n result.append(int(c))\\n \\n return result\",\n \"runtime\": \"696\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n while drop and s1 and s1[-1] < n1[i]:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(n1[i])\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"runtime\": \"696\"\n },\n {\n \"code\": \"class Solution:\\n def mostCompetitive(self, nums: List[int], k: int) -> List[int]:\\n stack = []\\n k = len(nums) - k\\n for digit in nums:\\n while stack and k > 0 and digit > stack[-1]:\\n stack.pop()\\n k -= 1\\n stack.append(digit)\\n \\n if k > 0:\\n stack = stack[:-k]\\n \\n return stack\\n \\n def largestMerge(self, word1: List[int], word2: List[int]) -> List[int]:\\n i = 0\\n j = 0\\n res = []\\n while i < len(word1) and j < len(word2):\\n if word1[i] > word2[j]:\\n res.append(word1[i])\\n i += 1\\n elif word2[j] > word1[i]:\\n res.append(word2[j])\\n j += 1\\n else:\\n if word1[i:] > word2[j:]:\\n res.append(word1[i])\\n i += 1\\n else:\\n res.append(word2[j])\\n j += 1\\n \\n res.extend(word1[i:])\\n res.extend(word2[j:])\\n return res\\n\\n def maxNumber(self, nums1: List[int], nums2: List[int], length: int) -> List[int]:\\n mx = 0\\n mx_list = []\\n for k in range(min(len(nums1), length) + 1):\\n print(k)\\n d1 = self.mostCompetitive(nums1, k)\\n d2 = self.mostCompetitive(nums2, length - k)\\n \\n jeff = self.largestMerge(d1, d2)\\n print(jeff)\\n candidate = int(\\\"\\\".join([str(x) for x in jeff]))\\n if candidate > mx:\\n mx = candidate\\n mx_list = jeff.copy()\\n \\n return mx_list\\n\",\n \"runtime\": \"710\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n\\n def findMono(nums, x):\\n stack, n = [], len(nums)\\n drop = n - x\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and drop > 0:\\n stack.pop()\\n drop -= 1\\n stack.append(nums[i])\\n return stack[:x]\\n\\n def merge(ans1, ans2):\\n res = []\\n if len(ans1) + len(ans2) < k:\\n return res\\n while ans1 or ans2:\\n res.append(ans1.pop(0) if ans1 > ans2 else ans2.pop(0))\\n return res\\n\\n print([merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1)])\\n return max(merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1))\",\n \"runtime\": \"724\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n L1, L2, cache = len(nums1), len(nums2), {}\\n for i in range(L1): nums1[i] = str(nums1[i])\\n for i in range(L2): nums2[i] = str(nums2[i])\\n def DFS(i, n, T):\\n if (i, n, T) in cache: return cache[(i, n, T)]\\n if T==1:\\n if L1-i<n: return \\\"\\\"\\n elif L1-i==n: return \\\"\\\".join(nums1[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L1:\\n s = nums1[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n else:\\n if L2-i<n: return \\\"\\\"\\n elif L2-i==n: return \\\"\\\".join(nums2[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L2:\\n s = nums2[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n cache[(i, n, T)] = S\\n return S \\n def merge(s1, s2):\\n S = \\\"\\\"\\n while s1 or s2:\\n v1 = s1[0] if s1 else \\\"\\\"\\n v2 = s2[0] if s2 else \\\"\\\"\\n if v1>v2: \\n S += v1\\n s1.pop(0)\\n elif v1==v2:\\n j = 0\\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\\n elif j<len(s1): f = True\\n else: f = False\\n if f: \\n S += v1\\n s1.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n return S\\n S, lst = \\\"\\\", []\\n for i in range(max(0, k-L2), min(L1, k)+1):\\n s1 = DFS(0, i, 1)\\n s2 = DFS(0, k-i, 2)\\n S = max(S, merge(list(s1), list(s2)))\\n for c in S: lst.append( int(c) )\\n return lst \",\n \"runtime\": \"738\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def solve_one(arr, k):\\n n = len(arr)\\n stack = []\\n for i in range(n):\\n while stack and stack[-1] < arr[i] and len(stack) + n - i - 1 >= k:\\n stack.pop()\\n if len(stack) < k:\\n stack.append(arr[i])\\n return stack\\n\\n def merge(arr, brr):\\n return [max(arr, brr).pop(0) for _ in range(len(arr) + len(brr))]\\n\\n ans = [0 for _ in range(k)]\\n for x in range(k + 1):\\n left, right = solve_one(nums1, x), solve_one(nums2, k - x)\\n temp = merge(left, right)\\n if len(temp) != k:\\n continue\\n ans = max(ans, temp)\\n return ans\",\n \"runtime\": \"752\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n L1, L2, cache = len(nums1), len(nums2), {}\\n for i in range(L1): nums1[i] = str(nums1[i])\\n for i in range(L2): nums2[i] = str(nums2[i])\\n def DFS(i, n, T):\\n if (i, n, T) in cache: return cache[(i, n, T)]\\n if T==1:\\n if L1-i<n: return \\\"\\\"\\n elif L1-i==n: return \\\"\\\".join(nums1[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L1:\\n s = nums1[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n else:\\n if L2-i<n: return \\\"\\\"\\n elif L2-i==n: return \\\"\\\".join(nums2[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L2:\\n s = nums2[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n cache[(i, n, T)] = S\\n return S \\n def merge(s1, s2):\\n S = \\\"\\\"\\n while s1 or s2:\\n v1 = s1[0] if s1 else \\\"\\\"\\n v2 = s2[0] if s2 else \\\"\\\"\\n if v1>v2: \\n S += v1\\n s1.pop(0)\\n elif v1==v2:\\n j = 0\\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\\n elif j<len(s1): f = True\\n else: f = False\\n if f: \\n S += v1\\n s1.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n return S\\n S, lst = \\\"\\\", []\\n for i in range(max(0, k-L2), min(L1, k)+1):\\n s1 = DFS(0, i, 1)\\n s2 = DFS(0, k-i, 2)\\n S = max(S, merge(list(s1), list(s2)))\\n for c in S: lst.append( int(c) )\\n return lst \",\n \"runtime\": \"766\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n L1, L2, cache = len(nums1), len(nums2), {}\\n for i in range(L1): nums1[i] = str(nums1[i])\\n for i in range(L2): nums2[i] = str(nums2[i])\\n def DFS(i, n, T):\\n if (i, n, T) in cache: return cache[(i, n, T)]\\n if T==1:\\n if L1-i<n: return \\\"\\\"\\n elif L1-i==n: return \\\"\\\".join(nums1[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L1:\\n s = nums1[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n else:\\n if L2-i<n: return \\\"\\\"\\n elif L2-i==n: return \\\"\\\".join(nums2[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L2:\\n s = nums2[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n cache[(i, n, T)] = S\\n return S \\n def merge(s1, s2):\\n S = \\\"\\\"\\n while s1 or s2:\\n v1 = s1[0] if s1 else \\\"\\\"\\n v2 = s2[0] if s2 else \\\"\\\"\\n if v1>v2: \\n S += v1\\n s1.pop(0)\\n elif v1==v2:\\n j = 0\\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\\n elif j<len(s1): f = True\\n else: f = False\\n if f: \\n S += v1\\n s1.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n return S\\n S, lst = \\\"\\\", []\\n for i in range(max(0, k-L2), min(L1, k)+1):\\n s1 = DFS(0, i, 1)\\n s2 = DFS(0, k-i, 2)\\n S = max(S, merge(list(s1), list(s2)))\\n for c in S: lst.append( int(c) )\\n return lst \",\n \"runtime\": \"781\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n L1, L2, cache = len(nums1), len(nums2), {}\\n print(L1, L2, k)\\n for i in range(L1): nums1[i] = str(nums1[i])\\n for i in range(L2): nums2[i] = str(nums2[i])\\n def DFS(i, n, T):\\n if (i, n, T) in cache: return cache[(i, n, T)]\\n if T==1:\\n if L1-i<n: return \\\"\\\"\\n elif L1-i==n: return \\\"\\\".join(nums1[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L1:\\n s = nums1[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n else:\\n if L2-i<n: return \\\"\\\"\\n elif L2-i==n: return \\\"\\\".join(nums2[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L2:\\n s = nums2[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n cache[(i, n, T)] = S\\n return S \\n def merge(s1, s2):\\n S = \\\"\\\"\\n while s1 or s2:\\n v1 = s1[0] if s1 else \\\"\\\"\\n v2 = s2[0] if s2 else \\\"\\\"\\n if v1>v2: \\n S += v1\\n s1.pop(0)\\n elif v1==v2:\\n j = 0\\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\\n elif j<len(s1): f = True\\n else: f = False\\n if f: \\n S += v1\\n s1.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n return S\\n S, lst = \\\"\\\", []\\n for i in range(max(0, k-L2), min(L1, k)+1):\\n s1 = DFS(0, i, 1)\\n s2 = DFS(0, k-i, 2)\\n S = max(S, merge(list(s1), list(s2)))\\n for c in S: lst.append( int(c) )\\n return lst \",\n \"runtime\": \"795\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n L1, L2, cache = len(nums1), len(nums2), {}\\n print(L1, L2, k)\\n for i in range(L1): nums1[i] = str(nums1[i])\\n for i in range(L2): nums2[i] = str(nums2[i])\\n def DFS(i, n, T):\\n if (i, n, T) in cache: return cache[(i, n, T)]\\n if T==1:\\n if L1-i<n: return \\\"\\\"\\n elif L1-i==n: return \\\"\\\".join(nums1[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L1:\\n s = nums1[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n else:\\n if L2-i<n: return \\\"\\\"\\n elif L2-i==n: return \\\"\\\".join(nums2[i:])\\n S = \\\"\\\"\\n s = DFS(i+1, n, T)\\n if len(s)==n and s>S: S = s\\n if i<L2:\\n s = nums2[i] + DFS(i+1, n-1, T) \\n if len(s)==n and s>S: S = s\\n cache[(i, n, T)] = S\\n return S \\n def merge(s1, s2):\\n print(s1, s2)\\n S = \\\"\\\"\\n while s1 or s2:\\n v1 = s1[0] if s1 else \\\"\\\"\\n v2 = s2[0] if s2 else \\\"\\\"\\n if v1>v2: \\n S += v1\\n s1.pop(0)\\n elif v1==v2:\\n j = 0\\n while j<min(len(s1),len(s2)) and s1[j]==s2[j]: j += 1\\n if j<min(len(s1),len(s2)): f = s1[j]>s2[j]\\n elif j<len(s1): f = True\\n else: f = False\\n if f: \\n S += v1\\n s1.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n else:\\n S += v2\\n s2.pop(0)\\n return S\\n S, lst = \\\"\\\", []\\n for i in range(max(0, k-L2), min(L1, k)+1):\\n s1 = DFS(0, i, 1)\\n s2 = DFS(0, k-i, 2)\\n S = max(S, merge(list(s1), list(s2)))\\n for c in S: lst.append( int(c) )\\n return lst \",\n \"runtime\": \"809\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def maximum_num_each_list(nums: List[int], k_i: int) -> List[int]:\\n # monotonically decreasing stack\\n s = []\\n m = len(nums) - k_i\\n for n in nums:\\n while s and s[-1] < n and m > 0:\\n s.pop()\\n m -= 1\\n s.append(n)\\n s = s[:len(s)-m] # very important\\n return s\\n def greater(a, b, i , j): # get the number which is lexiographically greater\\n while i< len(a) or j < len(b): \\n if i == len(a): return False\\n if j == len(b): return True\\n if a[i] > b[j]: return True\\n if a[i] < b[j]: return False\\n i += 1 # we increment until each of their elements are same\\n j += 1\\n \\n def merge(x_num, y_num):\\n n = len(x_num)\\n m = len(y_num)\\n i = 0\\n j = 0\\n s = []\\n while i < n or j < m:\\n a = x_num[i] if i < n else float(\\\"-inf\\\") \\n b = y_num[j] if j < m else float(\\\"-inf\\\") \\n\\n if a > b or greater(x_num, y_num, i , j):\\n# greater(x_num, y_num, i , j): this function is meant for check which list has element lexicographically greater means it will iterate through both arrays incrementing both at the same time until one of them is greater than other.\\n chosen = a\\n i += 1\\n else:\\n chosen = b\\n j += 1\\n s.append(chosen)\\n return s\\n\\n max_num_arr = []\\n for i in range(k+1): # we check for all values of k and find the maximum number we can create for that value of k and we repeat this for all values of k and then at eacch time merge the numbers to check if arrive at optimal solution\\n first = maximum_num_each_list(nums1, i)\\n second = maximum_num_each_list(nums2, k-i)\\n merged = merge(first, second)\\n # these two conditions are required because list comparison in python only compares the elements even if one of their lengths is greater, so I had to add these conditions to compare elements only if length is equal.\\n\\t\\t\\t# Alternatively you can avoid this and convert them both to int and then compare, but I wanted to this as it is somewhat more efficient.\\n if len(merged) == len(max_num_arr) and merged > max_num_arr:\\n max_num_arr = merged\\n elif len(merged) > len(max_num_arr):\\n max_num_arr = merged\\n return max_num_arr\",\n \"runtime\": \"823\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def maximum_num_each_list(nums: List[int], k_i: int) -> List[int]:\\n # monotonically decreasing stack\\n s = []\\n m = len(nums) - k_i\\n for n in nums:\\n while s and s[-1] < n and m > 0:\\n s.pop()\\n m -= 1\\n s.append(n)\\n s = s[:len(s)-m] # very important\\n return s\\n def greater(a, b, i , j): # get the number which is lexiographically greater\\n while i< len(a) or j < len(b): \\n if i == len(a): return False\\n if j == len(b): return True\\n if a[i] > b[j]: return True\\n if a[i] < b[j]: return False\\n i += 1 # we increment until each of their elements are same\\n j += 1\\n \\n def merge(x_num, y_num):\\n n = len(x_num)\\n m = len(y_num)\\n i = 0\\n j = 0\\n s = []\\n while i < n or j < m:\\n a = x_num[i] if i < n else float(\\\"-inf\\\") \\n b = y_num[j] if j < m else float(\\\"-inf\\\") \\n\\n if a > b or greater(x_num, y_num, i , j):\\n# greater(x_num, y_num, i , j): this function is meant for check which list has element lexicographically greater means it will iterate through both arrays incrementing both at the same time until one of them is greater than other.\\n chosen = a\\n i += 1\\n else:\\n chosen = b\\n j += 1\\n s.append(chosen)\\n return s\\n\\n max_num_arr = []\\n for i in range(k+1): # we check for all values of k and find the maximum number we can create for that value of k and we repeat this for all values of k and then at eacch time merge the numbers to check if arrive at optimal solution\\n first = maximum_num_each_list(nums1, i)\\n second = maximum_num_each_list(nums2, k-i)\\n merged = merge(first, second)\\n # these two conditions are required because list comparison in python only compares the elements even if one of their lengths is greater, so I had to add these conditions to compare elements only if length is equal.\\n\\t\\t\\t# Alternatively you can avoid this and convert them both to int and then compare, but I wanted to this as it is somewhat more efficient.\\n if len(merged) == len(max_num_arr) and merged > max_num_arr:\\n max_num_arr = merged\\n elif len(merged) > len(max_num_arr):\\n max_num_arr = merged\\n return max_num_arr\",\n \"runtime\": \"837\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n res = []\\n for i in range(min(k + 1, len(nums1) + 1)):\\n res1 = self.singleMaxK(nums1, i)\\n res2 = self.singleMaxK(nums2, k - i)\\n temp = self.constructArray(res1, res2)\\n if len(res) == 0:\\n res = temp[:]\\n else:\\n temp_n = self.arrayToInt(temp)\\n res_n = self.arrayToInt(res)\\n if temp_n > res_n:\\n res = temp[:]\\n return res\\n\\n def arrayToInt(self, nums: List[int]) -> int:\\n res = 0\\n for i in nums:\\n res = res * 10 + i\\n return res\\n\\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\\n i1, i2 = 0, 0\\n n1, n2 = len(nums1), len(nums2)\\n res = []\\n while i1 < n1 or i2 < n2:\\n if self.isGreater(nums1, nums2, i1, i2):\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n return res\\n\\n def isGreater(self, nums1: List[int], nums2: List[int], i: int, j: int) -> bool:\\n while i < len(nums1) and j < len(nums2) and nums1[i] == nums2[j]:\\n i += 1\\n j += 1\\n return j == len(nums2) or (i < len(nums1) and nums1[i] > nums2[j])\\n\\n def singleMaxK(self, nums: List[int], k: int) -> List[int]:\\n stack = []\\n for i, num in enumerate(nums):\\n while stack and len(nums) - i + len(stack) > k and stack[-1] < num:\\n stack.pop()\\n if len(stack) < k:\\n stack.append(num)\\n return stack\",\n \"runtime\": \"851\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n n1 = len(nums1)\\n n2 = len(nums2)\\n\\n table = {}\\n def helper(s1, s2, k):\\n combo = (s1, s2, k)\\n if combo in table:\\n return table[combo]\\n if k == 1:\\n v1 = max(nums1[s1:]) if s1 < n1 else -1\\n v2 = max(nums2[s2:]) if s2 < n2 else -1\\n rval = max(v1, v2)\\n table[combo] = rval\\n return rval\\n m1, idx1 = -1, -1\\n c1 = s1\\n while c1 < n1 and (n1 - (c1 + 1)) + (n2 - s2) >= k - 1:\\n if nums1[c1] > m1:\\n m1 = nums1[c1]\\n idx1 = c1\\n c1 += 1\\n m2, idx2 = -1, -1\\n c2 = s2\\n while c2 < n2 and (n2 - (c2 + 1)) + (n1 - s1) >= k - 1:\\n if nums2[c2] > m2:\\n m2 = nums2[c2]\\n idx2 = c2\\n c2 += 1\\n if m1 > m2:\\n rval = m1 * (10 ** (k - 1)) + helper(idx1 + 1, s2, k - 1)\\n elif m2 > m1:\\n rval = m2 * (10 ** (k - 1)) + helper(s1, idx2 + 1, k - 1)\\n else:\\n val1 = m1 * (10 ** (k - 1)) + helper(idx1 + 1, s2, k - 1)\\n val2 = m2 * (10 ** (k - 1)) + helper(s1, idx2 + 1, k - 1)\\n rval = max(val1, val2)\\n table[combo] = rval\\n return rval\\n result = helper(0, 0, k)\\n rval = []\\n while result > 0:\\n rval.append(result % 10)\\n result //= 10\\n return rval[::-1]\\n \\n \\n\\n rval = []\\n\\n h1 = []\\n h2 = []\\n\\n s1 = 0\\n s2 = 0\\n\\n c1 = 0\\n c2 = 0\\n\\n while k > 0:\\n while c1 < n1 and (n1 - (c1 + 1)) + (n2 - s2) >= k - 1:\\n heapq.heappush(h1, (-nums1[c1], c1))\\n c1 += 1\\n while c2 < n2 and (n2 - (c2 + 1)) + (n1 - s1) >= k - 1:\\n heapq.heappush(h2, (-nums2[c2], c2))\\n c2 += 1\\n while h1 and h1[0][1] < s1:\\n heapq.heappop(h1)\\n while h2 and h2[0][1] < s2:\\n heapq.heappop(h2)\\n\\n x1, idx1 = h1[0] if h1 else (1, -1)\\n x2, idx2 = h2[0] if h2 else (1, -1)\\n x1 = -x1\\n x2 = -x2\\n\\n if x1 > x2:\\n rval.append(x1)\\n s1 = idx1 + 1\\n elif x2 > x1:\\n rval.append(x2)\\n s2 = idx2 + 1\\n else:\\n\\n \\n if (n1 - idx1) >= (n2 - idx2):\\n rval.append(x1)\\n s1 = idx1 + 1\\n else:\\n rval.append(x2)\\n s2 = idx2 + 1\\n k -= 1\\n return rval\\n\\n match_length = [[0 for _ in range(n)] for _ in range(m)]\\n for idx1 in range(m - 1, -1, -1):\\n for idx2 in range(n - 1, -1, -1):\\n if nums1[idx1] != nums2[idx2]:\\n match_length[idx1][idx2] = 0\\n continue\\n \\n if idx1 + 1 == m or idx2 + 1 == n:\\n next_length = 0\\n else:\\n next_length = match_length[idx1 + 1][idx2 + 1]\\n \\n match_length[idx1][idx2] = 1 + next_length\\n\\n pick = [[0 for _ in range(n)] for _ in range(m)]\\n for idx1 in range(m - 1, -1, -1):\\n for idx2 in range(n - 1, -1, -1):\\n if nums1[idx1] > nums2[idx2]:\\n pick[idx1][idx2] = 0\\n elif nums1[idx1] < nums2[idx2]:\\n pick[idx1][idx2] = 1\\n else:\\n length1 = m - idx1\\n length2 = n - idx2\\n ml = match_length[idx1][idx2]\\n if ml == min(length1, length2):\\n if length1 < length2:\\n pick[idx1][idx2] = 1\\n else:\\n pick[idx1][idx2] = 0\\n else:\\n if nums1[idx1 + ml] > nums2[idx2 + ml]:\\n pick[idx1][idx2] = 0\\n else:\\n pick[idx1][idx2] = 1\\n \\n result = []\\n idx1 = 0\\n idx2 = 0\\n while idx1 < m and idx2 < n:\\n p = pick[idx1][idx2]\\n if p == 0:\\n result.append(nums1[idx1])\\n idx1 += 1\\n else:\\n result.append(nums2[idx2])\\n idx2 += 1\\n while idx1 < m:\\n result.append(nums1[idx1])\\n idx1 += 1\\n while idx2 < n:\\n result.append(nums2[idx2])\\n idx2 += 1\\n return result\\n\\n\",\n \"runtime\": \"865\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n ln2=len(nums2)\\n max2={}\\n for i in range(1,ln2+1):\\n s=[]\\n ls=0\\n maxpop=ln2-i\\n maxi=[]\\n for x in nums2:\\n while maxpop>0 and s and s[-1]<x:\\n s.pop()\\n ls-=1\\n maxpop-=1\\n if ls<i:\\n s.append(x)\\n ls+=1\\n else:\\n maxpop-=1\\n if maxi<s:\\n maxi=s.copy()\\n max2[i]=maxi\\n \\n ln1=len(nums1)\\n max1={}\\n for i in range(1,ln1+1):\\n s=[]\\n ls=0\\n maxpop=ln1-i\\n maxi=[]\\n for x in nums1:\\n while maxpop>0 and s and s[-1]<x:\\n s.pop()\\n ls-=1\\n maxpop-=1\\n if ls<i:\\n s.append(x)\\n ls+=1\\n else:\\n maxpop-=1\\n if maxi<s:\\n maxi=s.copy()\\n max1[i]=maxi\\n\\n\\n answer=[]\\n def merge(i,j):\\n nonlocal answer\\n if i==0:\\n if max2[j]>answer:\\n answer=max2[j].copy()\\n return\\n if j==0:\\n if max1[i]>answer:\\n answer=max1[i].copy()\\n return\\n l1=max1[i]\\n l2=max2[j]\\n ii,jj=0,0\\n l=[]\\n \\n while l1 or l2:\\n if l1>l2:\\n l.append(l1[0])\\n l1=l1[1:]\\n else:\\n l.append(l2[0])\\n l2=l2[1:]\\n\\n if l>answer:\\n answer=l.copy()\\n \\n for i in range(ln1+1):\\n if 0<=k-i<=ln2:\\n merge(i,k-i)\\n\\n return answer\\n\\n \\n \",\n \"runtime\": \"879\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":76,"string":"76"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n output = []\n\n def get_monotonic_stack(nums, upper_bound):\n stack = []\n\n n = len(nums)\n for idx, num in enumerate(nums):\n remain = n - idx\n while stack and stack[-1] < num and len(stack) + remain > upper_bound:\n stack.pop()\n\n if len(stack) < upper_bound:\n stack.append(num)\n \n return stack\n\n def merge(stack1, stack2):\n output = []\n\n l, r = 0, 0\n\n m, n = len(stack1), len(stack2)\n\n while l < m and r < n:\n left = stack1[l:]\n right = stack2[r:]\n\n if left > right:\n output.append(stack1[l])\n l += 1\n else:\n output.append(stack2[r])\n r += 1\n \n if r == n:\n output.extend(stack1[l:])\n \n if l == m:\n output.extend(stack2[r:])\n \n return output\n\n answer = []\n\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\n stack1 = get_monotonic_stack(nums1, i)\n stack2 = get_monotonic_stack(nums2, k - i)\n\n merged = merge(stack1, stack2)\n\n answer = max(answer, merged)\n \n return answer","memory":"16500"},{"code":"class Solution(object):\n def maxNumber(self, nums1, nums2, k):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k: int\n :rtype: List[int]\n \"\"\"\n def getMax(nums, t):\n ans = []\n size = len(nums)\n for x in range(size):\n while ans and len(ans) + size - x > t and ans[-1] < nums[x]:\n ans.pop()\n if len(ans) < t:\n ans += nums[x],\n return ans\n\n def merge(nums1, nums2):\n ans = []\n while nums1 or nums2:\n if nums1 > nums2:\n ans += nums1[0],\n nums1 = nums1[1:]\n else:\n ans += nums2[0],\n nums2 = nums2[1:]\n return ans\n \n len1, len2 = len(nums1), len(nums2)\n res = []\n for x in range(max(0, k - len2), min(k, len1) + 1):\n tmp = merge(getMax(nums1, x), getMax(nums2, k - x))\n res = max(tmp, res)\n return res\n\n \n ","memory":"16600"},{"code":"def max_number_from_single_array(nums, k):\n stack = []\n to_pop = len(nums) - k\n \n for num in nums:\n while to_pop > 0 and stack and stack[-1] < num:\n stack.pop()\n to_pop -= 1\n stack.append(num)\n \n return stack[:k]\n\ndef merge(nums1, nums2):\n result = []\n while nums1 or nums2:\n if nums1 > nums2:\n result.append(nums1[0])\n nums1 = nums1[1:]\n else:\n result.append(nums2[0])\n nums2 = nums2[1:]\n return result\n\ndef max_number(nums1, nums2, k):\n m, n = len(nums1), len(nums2)\n max_result = [0] * k\n \n for i in range(max(0, k - n), min(k, m) + 1):\n j = k - i\n max1 = max_number_from_single_array(nums1, i)\n max2 = max_number_from_single_array(nums2, j)\n merged = merge(max1, max2)\n max_result = max(max_result, merged)\n \n return max_result\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n return max_number(nums1, nums2, k)\n\n\n# Example usage","memory":"16700"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","memory":"16700"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n if i == 9:\n print(\"debug\")\n \n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","memory":"16800"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n while drop and s1 and s1[-1] < n1[i]:\n drop -= 1\n s1.pop()\n continue\n s1.append(n1[i])\n return s1[:j]\n\n\n def merge(n1, n2):\n n1, n2 = deque(n1) , deque(n2)\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.popleft())\n else:\n ret.append(n2.popleft())\n return ret\n best = []\n for i in range(0, k + 1):\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","memory":"16800"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]: \n def merge(n1, n2):\n res = []\n while (n1 or n2) :\n if n1>n2:\n res.append(n1[0])\n n1 = n1[1:]\n else:\n res.append(n2[0])\n n2 = n2[1:]\n return res\n \n def findmax(nums, length):\n l = []\n maxpop = len(nums)-length\n for i in range(len(nums)):\n while maxpop>0 and len(l) and nums[i]>l[-1]:\n l.pop()\n maxpop -= 1\n l.append(nums[i])\n return l[:length]\n \n n1 = len(nums1)\n n2 = len(nums2)\n res = [0]*k\n for i in range(k+1):\n j = k-i\n if i>n1 or j>n2: continue\n l1 = findmax(nums1, i)\n l2 = findmax(nums2, j)\n res = max(res, merge(l1,l2))\n return res","memory":"16900"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def maxSubsequence(nums, k):\n stack = []\n drop = len(nums) - k\n for num in nums:\n while drop > 0 and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return stack[:k]\n \n def merge(subseq1, subseq2):\n result = []\n while subseq1 or subseq2:\n if subseq1 > subseq2:\n result.append(subseq1.pop(0))\n else:\n result.append(subseq2.pop(0))\n return result\n \n maxResult = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n subseq1 = maxSubsequence(nums1, i)\n subseq2 = maxSubsequence(nums2, k - i)\n merged = merge(subseq1[:], subseq2[:])\n maxResult = max(maxResult, merged)\n \n return maxResult","memory":"16900"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n\n def prep(nums, k):\n drop = len(nums) - k\n out = []\n for num in nums:\n while drop and out and out[-1] < num:\n out.pop()\n drop -= 1\n out.append(num)\n return out[:k]\n\n def merge(a, b):\n return [max(a, b).pop(0) for _ in a+b]\n\n return max(merge(prep(nums1, i), prep(nums2, k-i))\n for i in range(k+1)\n if i <= len(nums1) and k-i <= len(nums2))\n ","memory":"17000"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n # take max k from the first list and take k from the second list\n def greedySelection(j, n1):\n # if j is too big cut into down to length if first\n j = min(j , len(n1))\n drop = len(n1) - j ## how many you are allowed to drop\n s1 = []\n for i in range(0, len(n1)):\n curr = n1[i]\n \n while drop and s1 and s1[-1] < curr:\n drop -= 1\n s1.pop()\n continue\n s1.append(curr)\n return s1[:j]\n\n\n def merge(n1, n2):\n ret = []\n while n1 or n2:\n if n1 > n2: # Compare lexicographically remaining parts of both lists\n ret.append(n1.pop(0))\n else:\n ret.append(n2.pop(0))\n return ret\n best = []\n for i in range(0, k + 1):\n if i == 9:\n print(\"debug\")\n \n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\n if len(res) > len(best):\n best = res\n elif len(res) == len(best) and res > best:\n best = res\n return best\n\n","memory":"17000"},{"code":"class RMQ:\n def __init__(self, nums):\n n = len(nums)\n self.N = int(log2(n)) + 1\n self.nums = nums\n\n rmq = [[0] * self.N for _ in range(n)]\n for i in range(n):\n rmq[i][0] = i\n\n j = 1\n while (1 << j) <= n:\n i = 0\n while i + (1 << j) -1 < n:\n l, r = rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]\n if nums[l] >= nums[r]:\n rmq[i][j] = l\n else:\n rmq[i][j] = r\n i += 1\n j += 1\n\n self.rmq = rmq\n\n\n def min_q(self, l, r):\n j = int(log2(r - l + 1))\n ll, rr = self.rmq[l][j], self.rmq[r-(1<<j)+1][j]\n if self.nums[ll] >= self.nums[rr]:\n return ll\n return rr\n\n\ndef get_n(nums, take, rmq) -> List[int]:\n left, n = 0, len(nums)\n if take >= n:\n return nums\n\n ans = []\n for right in range(n-take, n):\n i = rmq.min_q(left, right)\n ans.append(nums[i])\n left = i + 1\n return ans\n\n\ndef merge(a, b) -> List[int]:\n a, b = deque(a), deque(b)\n ans = []\n while a and b:\n if a > b:\n ans.append(a.popleft())\n else:\n ans.append(b.popleft())\n if a:\n ans += list(a)\n if b:\n ans += list(b)\n return ans\n\nclass Solution:\n def maxNumber(self, A: List[int], B: List[int], k: int) -> List[int]:\n rmq_a, rmq_b = RMQ(A), RMQ(B)\n ans = [-100000000] * k\n for l in range(k+1):\n r = k - l\n arr_l = get_n(A, l, rmq_a)\n arr_r = get_n(B, r, rmq_b)\n\n tmp = merge(arr_l, arr_r)\n if len(tmp) == k:\n ans = max(ans, tmp)\n\n return ans","memory":"17100"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n def prep(nums, k):\n drop = len(nums) - k\n out = []\n for num in nums:\n while drop and out and out[-1] < num:\n out.pop()\n drop -= 1\n out.append(num)\n return out[:k]\n \n def merge(a, b):\n return [max(a, b).pop(0) for _ in a+b]\n \n return max(merge(prep(nums1, i), prep(nums2, k-i)) for i in range(k+1) if i <= len(nums1) and k-i <= len(nums2))\n \n \"\"\"\n def merge(n1, n2):\n res = []\n while (n1 or n2) :\n if n1>n2:\n res.append(n1[0])\n n1 = n1[1:]\n else:\n res.append(n2[0])\n n2 = n2[1:]\n return res\n \n def findmax(nums, length):\n l = []\n maxpop = len(nums)-length\n for i in range(len(nums)):\n while maxpop>0 and len(l) and nums[i]>l[-1]:\n l.pop()\n maxpop -= 1\n l.append(nums[i])\n return l[:length]\n \n n1 = len(nums1)\n n2 = len(nums2)\n res = [0]*k\n for i in range(k+1):\n j = k-i\n if i>n1 or j>n2: continue\n l1 = findmax(nums1, i)\n l2 = findmax(nums2, j)\n res = max(res, merge(l1,l2))\n return res \"\"\"","memory":"17100"},{"code":"from collections import deque\n\nclass Solution:\n def maxNumber(self, nums1: list[int], nums2: list[int], k: int) -> list[int]:\n def maxSubsequence(nums: list[int], length: int) -> list[int]:\n stack = deque()\n drop = len(nums) - length\n for num in nums:\n while drop and stack and stack[-1] < num:\n stack.pop()\n drop -= 1\n stack.append(num)\n return list(stack)[:length]\n\n def merge(nums1: list[int], nums2: list[int]) -> list[int]:\n return [max(nums1, nums2).pop(0) for _ in range(len(nums1) + len(nums2))]\n\n max_number = []\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\n subseq1 = maxSubsequence(nums1, i)\n subseq2 = maxSubsequence(nums2, k - i)\n merged = merge(subseq1, subseq2)\n max_number = max(max_number, merged)\n \n return max_number\n\n# Example usage:\nsol = Solution()\nprint(sol.maxNumber([3,4,6,5], [9,1,2,5,8,3], 5)) # Output: [9,8,6,5,3]\nprint(sol.maxNumber([6,7], [6,0,4], 5)) # Output: [6,7,6,0,4]\nprint(sol.maxNumber([3,9], [8,9], 3)) # Output: [9,8,9]\n","memory":"17200"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def maxNumber(self, left: List[int], right: List[int], k: int) -> List[int]:\n result = [0 for _ in range(k)]\n\n def get_best(arr, to_take):\n stack = []\n\n for i in range(len(arr)):\n elements_here_and_to_right = len(arr) - i\n while len(stack) + elements_here_and_to_right > to_take and (stack and arr[i] > stack[-1]):\n stack.pop()\n \n if len(stack) < to_take:\n stack.append(arr[i])\n \n return stack\n \n def compare(alpha, beta, a, b):\n if a >= len(alpha):\n return False\n \n if b >= len(beta):\n return True\n if alpha[a] > beta[b]:\n return True\n \n if alpha[a] < beta[b]:\n return False\n \n return compare(alpha, beta, a + 1, b + 1)\n\n def merge(alpha, beta):\n merged = []\n a = 0\n b = 0\n\n while a < len(alpha) or b < len(beta):\n if compare(alpha, beta, a, b):\n merged.append(alpha[a])\n a += 1\n else:\n merged.append(beta[b])\n b += 1\n\n return merged\n\n for to_take_from_left in range(max(0, k - len(right)), min(k, len(left)) + 1):\n to_take_from_right = k - to_take_from_left\n\n candidate = merge(get_best(left, to_take_from_left), get_best(right, to_take_from_right)) \n\n if compare(candidate, result, 0,0):\n result = candidate\n \n return result\n\n ","memory":"17300"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n\n g =[]\n n1,n2=len(nums1),len(nums2)\n nums1.append(inf)\n nums2.append(inf)\n for w in range(k+1):\n u1,u2 = w,k-w\n cs = []\n if u1<=n1 and u2<=n2:\n st1 = deque([])\n st2 = deque([])\n d1,d2 = n1-u1,n2-u2\n for num in nums1:\n while st1 and d1>0 and num>st1[-1]:\n st1.pop()\n d1-=1\n st1.append(num)\n st1.pop()\n for num in nums2:\n while st2 and d2>0 and num>st2[-1]:\n st2.pop()\n d2-=1\n st2.append(num)\n st2.pop()\n while st1 or st2:\n A = st1 if st1>st2 else st2\n cs.append(A.popleft())\n # i1,i2=0,0\n # while i1<len(st1) or i2<len(st2):\n # if i2==len(st2) or i1<len(st1) and st1[i1]>st2[i2]:\n # cs.append(st1[i1])\n # i1+=1\n # else:\n # cs.append(st2[i2])\n # i2+=1\n g.append(cs)\n maxi = [0]*k\n for cur in g:\n flag = False\n for u,v in zip(cur,maxi):\n if u>v:\n flag=True\n break\n if u<v: break\n if flag:\n maxi=cur\n return maxi\n\n\n\n ","memory":"18400"},{"code":"class Solution:\n def maxNumber(self, nums1, nums2, k):\n def merge(arr1, arr2):\n res, i, j = [], 0, 0\n while i < len(arr1) and j < len(arr2):\n if arr1[i:] >= arr2[j:]:\n res.append(arr1[i])\n i += 1\n else: \n res.append(arr2[j])\n j += 1\n if i < len(arr1): res += arr1[i:]\n elif j < len(arr2): res += arr2[j:]\n return res \n \n def makeArr(arr, l):\n i, res = 0, []\n for r in range(l - 1, -1, -1):\n num, i = max(arr[i:-r] or arr[i:])\n i = -i + 1\n res.append(num)\n return res\n \n nums1, nums2, choices = [(num, -i) for i, num in enumerate(nums1)], [(num, -i) for i, num in enumerate(nums2)], []\n for m in range(k + 1):\n if m > len(nums1) or k - m > len(nums2): continue\n arr1, arr2 = makeArr(nums1, m), makeArr(nums2, k - m) \n choices.append(merge(arr1, arr2))\n return max(choices)","memory":"18700"},{"code":"class Solution:\n def maxNumber(self, a: List[int], b: List[int], k: int) -> List[int]:\n def f(arr,x):\n rem=len(arr)-x\n q=[]\n for i in arr:\n while rem and q and q[-1]<i:\n q.pop()\n rem-=1\n q.append(i)\n return q[:x]\n def merge(a,b):\n return [max(a,b).pop(0) for i in a+b]\n n=len(a)\n m=len(b)\n ans=[]\n for i in range(k+1):\n if i<=n and k-i<=m:\n ans.append(merge(f(a,i),f(b,k-i)))\n return max(ans)","memory":"18800"},{"code":"def bestMinus1(nums: List[int]):\n ln = len(nums)\n for i in range(ln - 1):\n if nums[i] < nums[i+1]:\n del nums[i]\n break\n if ln == len(nums):\n nums.pop()\n\ndef produceBests(nums: List[int], shortest, longest):\n result = []\n while True:\n if len(nums) <= longest:\n result.append(nums.copy())\n if len(nums) == shortest:\n break\n bestMinus1(nums)\n result.reverse()\n return result\n\ndef getBestMix(nums1: List[int], nums2: List[int]) -> List[int]:\n if not nums1:\n return nums2\n if not nums2:\n # nums1 is being reused.\n return nums1.copy()\n if nums1 >= nums2:\n return [nums1[0]] + getBestMix(nums1[1:], nums2)\n return [nums2[0]] + getBestMix(nums1, nums2[1:])\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n l1 = len(nums1)\n l2 = len(nums2)\n\n minFrom2 = max(0, k - l1)\n maxFrom2 = min(k, l2)\n bests2 = produceBests(nums2, minFrom2, maxFrom2)\n \n minFrom1 = k - maxFrom2\n maxFrom1 = k - minFrom2\n\n while len(nums1) > maxFrom1:\n bestMinus1(nums1)\n\n bestCandidate = []\n while True:\n from1 = len(nums1)\n from2 = k - from1\n candidate = getBestMix(nums1, bests2[from2 - minFrom2])\n if bestCandidate < candidate:\n bestCandidate = candidate\n if len(nums1) <= minFrom1:\n break\n bestMinus1(nums1)\n return bestCandidate","memory":"18800"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n nums1 = list(enumerate(nums1))\n nums2 = list(enumerate(nums2))\n\n def get_max_num(nums, t):\n stack = []\n for i, x in nums:\n min_length = max(0, t - len(nums) + i) \n while stack and stack[-1] < x and len(stack) > min_length:\n stack.pop()\n stack.append(x)\n return stack[:t]\n \n def combine(arr1, arr2):\n i = j = 0\n p, q = len(arr1), len(arr2)\n res = []\n while i < p or j < q:\n if i == p:\n res.extend(arr2[j:])\n break\n elif j == q:\n res.extend(arr1[i:])\n break\n elif arr1[i] > arr2[j]:\n res.append(arr1[i])\n i += 1\n elif arr1[i] < arr2[j]:\n res.append(arr2[j])\n j += 1\n elif arr1[i:] > arr2[j:]:\n res.append(arr1[i])\n i += 1\n else:\n res.append(arr2[j])\n j += 1\n\n return res\n\n \n ans = []\n for i in range(k+1):\n if i > len(nums1) or k-i > len(nums2):\n continue\n\n m1 = get_max_num(nums1, i) if i > 0 else []\n m2 = get_max_num(nums2, k-i) if k-i > 0 else []\n ans.append(combine(m1, m2))\n \n return sorted(ans)[-1]\n\n \n ","memory":"18900"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \"\"\"\n 6 5\n 9 8 3\n\n 9 8 6 5 3\n\n 3 4 6 5\n 9 1 2 5 8 3\n\n 1 9 3 2 8 5\n\n 0, 5\n 1, 4\n 2, 3\n 3, 2\n 4, 1\n\n 4 5 3 2 1 6 0 8\n length = 5\n\n l = [5 3 6 0 8]\n maxpop = 0\n i = 5\n\n \n i = 0\n 0: 4 5 3 2 1 6 0 8\n 1: 5 3 2 1 6 0 8\n 2: 5 3 2 6 0 8\n 3: 5 3 6 0 8\n 4: 5 6 0 8\n 5: 6 0 8\n 6: 6 8\n 7: 8\n 8: \n\n\n 0: 3 4 6 5\n 1: 4 6 5\n 2: 6 5\n 3: 6\n 4:\n \"\"\"\n def getMaxAfterRemovals(nums):\n n = len(nums)\n maxAfterRemovals = [copy.deepcopy(nums)]\n i = 0\n while i < len(maxAfterRemovals[-1]) - 1:\n if maxAfterRemovals[-1][i] < maxAfterRemovals[-1][i+1]:\n maxAfterRemovals.append(maxAfterRemovals[-1][:i] + maxAfterRemovals[-1][i+1:])\n i = max(0, i-1)\n else:\n i += 1\n while len(maxAfterRemovals) < len(nums)+1:\n maxAfterRemovals.append(maxAfterRemovals[-1][:-1])\n return maxAfterRemovals\n\n maxAfterRemovals1 = getMaxAfterRemovals(nums1)\n maxAfterRemovals2 = getMaxAfterRemovals(nums2)\n\n def merge(nums1, nums2):\n i1 = i2 = 0\n n1 = len(nums1)\n n2 = len(nums2)\n merged = []\n while i1 < n1 and i2 < n2:\n if nums1[i1:] > nums2[i2:]:\n merged.append(nums1[i1])\n i1 += 1\n else:\n merged.append(nums2[i2])\n i2 += 1\n while i1 < n1:\n merged.append(nums1[i1])\n i1 += 1\n while i2 < n2:\n merged.append(nums2[i2])\n i2 += 1\n return merged\n\n def isGreater(nums1, nums2):\n i = 0\n while i < len(nums1):\n if nums1[i] > nums2[i]:\n return True\n elif nums1[i] < nums2[i]:\n return False\n i += 1\n return False\n \n result = None\n n1 = len(nums1)\n n2 = len(nums2)\n for count1 in range(k+1):\n if count1 <= n1 and (k-count1) <= n2:\n max1 = maxAfterRemovals1[n1-count1]\n max2 = maxAfterRemovals2[n2-k+count1]\n print(max1)\n print(max2)\n mergedNumber = merge(\n max1, \n max2\n )\n if not result or isGreater(mergedNumber, result):\n result = mergedNumber\n \n return result\n","memory":"19000"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n ln2=len(nums2)\n max2={}\n for i in range(1,ln2+1):\n s=[]\n ls=0\n maxpop=ln2-i\n maxi=[]\n for x in nums2:\n while maxpop>0 and s and s[-1]<x:\n s.pop()\n ls-=1\n maxpop-=1\n if ls<i:\n s.append(x)\n ls+=1\n else:\n maxpop-=1\n if maxi<s:\n maxi=s.copy()\n max2[i]=maxi\n \n ln1=len(nums1)\n max1={}\n for i in range(1,ln1+1):\n s=[]\n ls=0\n maxpop=ln1-i\n maxi=[]\n for x in nums1:\n while maxpop>0 and s and s[-1]<x:\n s.pop()\n ls-=1\n maxpop-=1\n if ls<i:\n s.append(x)\n ls+=1\n else:\n maxpop-=1\n if maxi<s:\n maxi=s.copy()\n max1[i]=maxi\n\n\n answer=[]\n def merge(i,j):\n nonlocal answer\n if i==0:\n if max2[j]>answer:\n answer=max2[j].copy()\n return\n if j==0:\n if max1[i]>answer:\n answer=max1[i].copy()\n return\n l1=max1[i]\n l2=max2[j]\n ii,jj=0,0\n l=[]\n \n while l1 or l2:\n if l1>l2:\n l.append(l1[0])\n l1=l1[1:]\n else:\n l.append(l2[0])\n l2=l2[1:]\n\n if l>answer:\n answer=l.copy()\n \n for i in range(ln1+1):\n if 0<=k-i<=ln2:\n merge(i,k-i)\n\n return answer\n\n \n ","memory":"19200"},{"code":"def bestMinus1(nums: List[int]):\n ln = len(nums)\n for i in range(ln - 1):\n if nums[i] < nums[i+1]:\n del nums[i]\n break\n if ln == len(nums):\n nums.pop()\n\ndef produceBests(nums: List[int]):\n result = []\n while nums:\n result.append(nums.copy())\n bestMinus1(nums)\n result.append([])\n result.reverse()\n return result\n\ndef getBestMix(nums1: List[int], nums2: List[int]) -> List[int]:\n if not nums1:\n return nums2\n if not nums2:\n # nums1 is being reused.\n return nums1.copy()\n if nums1 >= nums2:\n return [nums1[0]] + getBestMix(nums1[1:], nums2)\n return [nums2[0]] + getBestMix(nums1, nums2[1:])\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n l1 = len(nums1)\n l2 = len(nums2)\n bests2 = produceBests(nums2)\n \n minFrom1 = max(0, k - l2)\n maxFrom1 = min(k, l1)\n\n while len(nums1) > maxFrom1:\n bestMinus1(nums1)\n\n bestCandidate = []\n while True:\n from1 = len(nums1)\n from2 = k - from1\n candidate = getBestMix(nums1, bests2[from2])\n if bestCandidate < candidate:\n bestCandidate = candidate\n if len(nums1) <= minFrom1:\n break\n bestMinus1(nums1)\n return bestCandidate","memory":"19800"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n nums1_max = self.singleArraryMaxIndex(nums1)\n nums2_max = self.singleArraryMaxIndex(nums2)\n res = []\n for i in range(min(k + 1, len(nums1) + 1)):\n res1 = self.singleMaxK(nums1, nums1_max, i)\n res2 = self.singleMaxK(nums2, nums2_max, k - i)\n temp = self.constructArray(res1, res2)\n if len(res) == 0:\n res = temp[:]\n else:\n temp_n = self.arrayToInt(temp)\n res_n = self.arrayToInt(res)\n if temp_n > res_n:\n res = temp[:]\n return res\n\n def arrayToInt(self, nums: List[int]) -> int:\n res = 0\n for i in nums:\n res = res * 10 + i\n return res\n\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\n i1, i2 = 0, 0\n n1, n2 = len(nums1), len(nums2)\n res = []\n while i1 < n1 or i2 < n2:\n if self.isGreater(nums1, nums2, i1, i2):\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n return res\n\n def isGreater(self, nums1: List[int], nums2: List[int], i: int, j: int) -> bool:\n while i < len(nums1) and j < len(nums2) and nums1[i] == nums2[j]:\n i += 1\n j += 1\n return j == len(nums2) or (i < len(nums1) and nums1[i] > nums2[j])\n\n def singleMaxK(self, nums: List[int], max_index: List[List[int]], k: int) -> List[int]:\n n = len(nums)\n res = []\n start, end = 0, n - k\n while len(res) < k and start <= end:\n res.append(nums[max_index[start][end]])\n start = max_index[start][end] + 1\n end += 1\n return res\n\n def singleArraryMaxIndex(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n res = [[0] * n for i in range(n)]\n for i in range(n):\n for j in range(i, n):\n if j == i:\n res[i][j] = i\n else:\n res[i][j] = j if nums[j] > nums[res[i][j-1]] else res[i][j-1]\n return res","memory":"20300"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n\n def findMono(nums, x):\n stack, n = [], len(nums)\n drop = n - x\n for i in range(n):\n while stack and stack[-1] < nums[i] and drop > 0:\n stack.pop()\n drop -= 1\n stack.append(nums[i])\n return stack[:x]\n\n def merge(ans1, ans2):\n res = []\n if len(ans1) + len(ans2) < k:\n return res\n while ans1 or ans2:\n res.append(ans1.pop(0) if ans1 > ans2 else ans2.pop(0))\n return res\n\n print([merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1)])\n return max(merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1))","memory":"20400"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n nums1_max = self.singleArraryMaxIndex(nums1)\n nums2_max = self.singleArraryMaxIndex(nums2)\n res = []\n for i in range(min(k + 1, len(nums1) + 1)):\n res1 = self.singleMaxK(nums1, nums1_max, i)\n res2 = self.singleMaxK(nums2, nums2_max, k - i)\n temp = self.constructArray(res1, res2)\n if len(res) == 0:\n res = temp[:]\n else:\n temp_n = self.arrayToInt(temp)\n res_n = self.arrayToInt(res)\n if temp_n > res_n:\n res = temp[:]\n return res\n\n def arrayToInt(self, nums: List[int]) -> int:\n res = 0\n for i in nums:\n res = res * 10 + i\n return res\n\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\n i1, i2 = 0, 0\n n1, n2 = len(nums1), len(nums2)\n res = []\n while i1 < n1 or i2 < n2:\n if i1 < n1 and i2 < n2:\n if nums1[i1] > nums2[i2]:\n res.append(nums1[i1])\n i1 += 1\n elif nums1[i1] < nums2[i2]:\n res.append(nums2[i2])\n i2 += 1\n else:\n temp_i1, temp_i2 = i1+1, i2+1\n while temp_i1 < n1 and temp_i2 < n2 and nums1[temp_i1] == nums2[temp_i2]:\n temp_i1 += 1\n temp_i2 += 1\n if temp_i1 < n1 and temp_i2 < n2:\n if nums1[temp_i1] > nums2[temp_i2]:\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n elif temp_i1 < n1:\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n elif i1 < n1:\n res.append(nums1[i1])\n i1 += 1\n else:\n res.append(nums2[i2])\n i2 += 1\n return res\n\n def singleMaxK(self, nums: List[int], max_index: List[List[int]], k: int) -> List[int]:\n n = len(nums)\n res = []\n start, end = 0, n - k\n while len(res) < k and start <= end:\n res.append(nums[max_index[start][end]])\n start = max_index[start][end] + 1\n end += 1\n return res\n\n def singleArraryMaxIndex(self, nums: List[int]) -> List[List[int]]:\n n = len(nums)\n res = [[0] * n for i in range(n)]\n for i in range(n):\n for j in range(i, n):\n if j == i:\n res[i][j] = i\n else:\n res[i][j] = j if nums[j] > nums[res[i][j-1]] else res[i][j-1]\n return res","memory":"20600"},{"code":"def produceBests(nums: List[int]):\n result = []\n while nums:\n result.append(nums.copy())\n ln = len(nums)\n for i in range(ln - 1):\n if nums[i] < nums[i+1]:\n del nums[i]\n break\n if ln == len(nums):\n nums.pop()\n result.append([])\n result.reverse()\n return result\n\ndef getBestMix(nums1: List[int], nums2: List[int]) -> List[int]:\n if not nums1:\n return nums2\n if not nums2:\n return nums1\n if nums1 >= nums2:\n return [nums1[0]] + getBestMix(nums1[1:], nums2)\n return [nums2[0]] + getBestMix(nums1, nums2[1:])\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n l1 = len(nums1)\n l2 = len(nums2)\n bests1 = produceBests(nums1)\n bests2 = produceBests(nums2)\n # print(f\"{bests1=}\")\n # print(f\"{bests2=}\")\n \n minFrom1 = max(0, k - l2)\n maxFrom1 = min(k, l1)\n # print(f\"{k=} {minFrom1=} {maxFrom1=}\")\n\n bestCandidate = []\n for from1 in range(minFrom1, maxFrom1 + 1):\n from2 = k - from1\n # print(f\"{from1=} {from2=}\")\n candidate = getBestMix(bests1[from1], bests2[from2])\n # print(f\"{candidate=} {bests1[from1]=} {bests2[from2]=}\")\n if bestCandidate < candidate:\n bestCandidate = candidate\n return bestCandidate","memory":"20900"},{"code":"class Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n \n\n def subFinder(nums,size):\n sequence = []\n for i in range(len(nums)):\n while sequence and sequence[-1] < nums[i] and (len(nums) - i) > (size - len(sequence)):\n sequence.pop()\n\n if size - len(sequence) > 0 :\n sequence.append(nums[i])\n return sequence\n sequencesOne = []\n sequencesTwo = []\n for i in range(k+1):\n sequencesOne.append(subFinder(nums1,i))\n sequencesTwo.append(subFinder(nums2,k-i))\n merge = []\n for i in range(k+1):\n first = 0\n second = 0\n arr1 = sequencesOne[i]\n arr2 = sequencesTwo[i]\n currSeq = []\n while first+second < k:\n if first >= len(arr1):\n currSeq += arr2[second:]\n second = k\n if second >= len(arr2):\n currSeq +=arr1[first:]\n first = k\n else:\n if arr1[first:] < arr2[second:]:\n currSeq.append(arr2[second])\n second+=1\n else:\n currSeq.append(arr1[first])\n first+=1\n merge.append(currSeq)\n\n biggestVal = \"0\"\n greatestSeq = [] \n for seq in merge:\n stringSeq = [str(i) for i in seq]\n val = \"\".join(stringSeq)\n if int(val) > int(biggestVal):\n biggestVal = val\n greatestSeq = seq\n return greatestSeq","memory":"29400"},{"code":"def createMaxNum(L,k):\n # returns maximum number one can make of all different lengths till k\n n = len(L)\n # Let A[i][j] be max numer one can make with subsequence of A[:i+1] of length j\n # A[i][j] = 0 if i+1 < j\n # A[i][0] = 0\n A = [[0]*(k+1) for i in range(n)]\n for j in range(1,k+1):\n for i in range(j-1,n):\n prev = A[i-1][j-1]\n x = 10*prev + L[i] #if L[i] is to be included\n y = A[i-1][j] # otherwise\n A[i][j] = max(x,y)\n return A[n-1]\n\n\ndef merge(A,B):\n n,m = len(A),len(B)\n if n == 0:return B\n if m == 0:return A\n C = []\n i = 0\n j = 0\n while i < n and j < m:\n I = i\n J = j\n while I < n and J < m and A[I] == B[J]:\n I += 1\n J += 1\n if I >= n and J < m:\n C.append(B[j])\n j += 1\n elif I < n and J >= m:\n C.append(A[i])\n i += 1\n elif I >= n and J >= m:\n C.append(A[i])\n i += 1\n elif A[I] > B[J]:\n C.append(A[i])\n i += 1\n elif A[I] < B[J]:\n C.append(B[j])\n j += 1\n else:\n raise ValueError()\n C.extend(A[i:])\n C.extend(B[j:])\n return C \n\ndef solve(L1,L2,k):\n A = createMaxNum(L1,k)\n B = createMaxNum(L2,k)\n #print(A)\n #print(B)\n if len(L1)==0:\n return [int(x) for x in str(B[-1])]\n if len(L2)==0:\n return [int(x) for x in str(A[-1])]\n if L2 ==[0]*len(L2):\n return [int(x) for x in A[-1]] + L2\n if L1 ==[0]*len(L1):\n return [int(x) for x in B[-1]] + L1\n toret = [A[-1],B[-1]]\n for x in range(1,k):\n y = k - x\n if A[x]:a = list(str(A[x]))\n else: a = []\n if B[y]:b = list(str(B[y]))\n else: b = []\n c = merge(a,b)\n c = \"\".join(c)\n if c:c = int(c)\n else: c = 0\n toret.append(c)\n #print(toret)\n return max(toret)\n\n\nclass Solution:\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\n x = solve(nums1,nums2,k)\n x = [int(y) for y in str(x)]\n return x ","memory":"32500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n output = []\\n\\n def get_monotonic_stack(nums, upper_bound):\\n stack = []\\n\\n n = len(nums)\\n for idx, num in enumerate(nums):\\n remain = n - idx\\n while stack and stack[-1] < num and len(stack) + remain > upper_bound:\\n stack.pop()\\n\\n if len(stack) < upper_bound:\\n stack.append(num)\\n \\n return stack\\n\\n def merge(stack1, stack2):\\n output = []\\n\\n l, r = 0, 0\\n\\n m, n = len(stack1), len(stack2)\\n\\n while l < m and r < n:\\n left = stack1[l:]\\n right = stack2[r:]\\n\\n if left > right:\\n output.append(stack1[l])\\n l += 1\\n else:\\n output.append(stack2[r])\\n r += 1\\n \\n if r == n:\\n output.extend(stack1[l:])\\n \\n if l == m:\\n output.extend(stack2[r:])\\n \\n return output\\n\\n answer = []\\n\\n for i in range(max(0, k - len(nums2)), min(len(nums1), k) + 1):\\n stack1 = get_monotonic_stack(nums1, i)\\n stack2 = get_monotonic_stack(nums2, k - i)\\n\\n merged = merge(stack1, stack2)\\n\\n answer = max(answer, merged)\\n \\n return answer\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution(object):\\n def maxNumber(self, nums1, nums2, k):\\n \\\"\\\"\\\"\\n :type nums1: List[int]\\n :type nums2: List[int]\\n :type k: int\\n :rtype: List[int]\\n \\\"\\\"\\\"\\n def getMax(nums, t):\\n ans = []\\n size = len(nums)\\n for x in range(size):\\n while ans and len(ans) + size - x > t and ans[-1] < nums[x]:\\n ans.pop()\\n if len(ans) < t:\\n ans += nums[x],\\n return ans\\n\\n def merge(nums1, nums2):\\n ans = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n ans += nums1[0],\\n nums1 = nums1[1:]\\n else:\\n ans += nums2[0],\\n nums2 = nums2[1:]\\n return ans\\n \\n len1, len2 = len(nums1), len(nums2)\\n res = []\\n for x in range(max(0, k - len2), min(k, len1) + 1):\\n tmp = merge(getMax(nums1, x), getMax(nums2, k - x))\\n res = max(tmp, res)\\n return res\\n\\n \\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"def max_number_from_single_array(nums, k):\\n stack = []\\n to_pop = len(nums) - k\\n \\n for num in nums:\\n while to_pop > 0 and stack and stack[-1] < num:\\n stack.pop()\\n to_pop -= 1\\n stack.append(num)\\n \\n return stack[:k]\\n\\ndef merge(nums1, nums2):\\n result = []\\n while nums1 or nums2:\\n if nums1 > nums2:\\n result.append(nums1[0])\\n nums1 = nums1[1:]\\n else:\\n result.append(nums2[0])\\n nums2 = nums2[1:]\\n return result\\n\\ndef max_number(nums1, nums2, k):\\n m, n = len(nums1), len(nums2)\\n max_result = [0] * k\\n \\n for i in range(max(0, k - n), min(k, m) + 1):\\n j = k - i\\n max1 = max_number_from_single_array(nums1, i)\\n max2 = max_number_from_single_array(nums2, j)\\n merged = merge(max1, max2)\\n max_result = max(max_result, merged)\\n \\n return max_result\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n return max_number(nums1, nums2, k)\\n\\n\\n# Example usage\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n if i == 9:\\n print(\\\"debug\\\")\\n \\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n while drop and s1 and s1[-1] < n1[i]:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(n1[i])\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n n1, n2 = deque(n1) , deque(n2)\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.popleft())\\n else:\\n ret.append(n2.popleft())\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]: \\n def merge(n1, n2):\\n res = []\\n while (n1 or n2) :\\n if n1>n2:\\n res.append(n1[0])\\n n1 = n1[1:]\\n else:\\n res.append(n2[0])\\n n2 = n2[1:]\\n return res\\n \\n def findmax(nums, length):\\n l = []\\n maxpop = len(nums)-length\\n for i in range(len(nums)):\\n while maxpop>0 and len(l) and nums[i]>l[-1]:\\n l.pop()\\n maxpop -= 1\\n l.append(nums[i])\\n return l[:length]\\n \\n n1 = len(nums1)\\n n2 = len(nums2)\\n res = [0]*k\\n for i in range(k+1):\\n j = k-i\\n if i>n1 or j>n2: continue\\n l1 = findmax(nums1, i)\\n l2 = findmax(nums2, j)\\n res = max(res, merge(l1,l2))\\n return res\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def maxSubsequence(nums, k):\\n stack = []\\n drop = len(nums) - k\\n for num in nums:\\n while drop > 0 and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return stack[:k]\\n \\n def merge(subseq1, subseq2):\\n result = []\\n while subseq1 or subseq2:\\n if subseq1 > subseq2:\\n result.append(subseq1.pop(0))\\n else:\\n result.append(subseq2.pop(0))\\n return result\\n \\n maxResult = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n subseq1 = maxSubsequence(nums1, i)\\n subseq2 = maxSubsequence(nums2, k - i)\\n merged = merge(subseq1[:], subseq2[:])\\n maxResult = max(maxResult, merged)\\n \\n return maxResult\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n\\n def prep(nums, k):\\n drop = len(nums) - k\\n out = []\\n for num in nums:\\n while drop and out and out[-1] < num:\\n out.pop()\\n drop -= 1\\n out.append(num)\\n return out[:k]\\n\\n def merge(a, b):\\n return [max(a, b).pop(0) for _ in a+b]\\n\\n return max(merge(prep(nums1, i), prep(nums2, k-i))\\n for i in range(k+1)\\n if i <= len(nums1) and k-i <= len(nums2))\\n \",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n # take max k from the first list and take k from the second list\\n def greedySelection(j, n1):\\n # if j is too big cut into down to length if first\\n j = min(j , len(n1))\\n drop = len(n1) - j ## how many you are allowed to drop\\n s1 = []\\n for i in range(0, len(n1)):\\n curr = n1[i]\\n \\n while drop and s1 and s1[-1] < curr:\\n drop -= 1\\n s1.pop()\\n continue\\n s1.append(curr)\\n return s1[:j]\\n\\n\\n def merge(n1, n2):\\n ret = []\\n while n1 or n2:\\n if n1 > n2: # Compare lexicographically remaining parts of both lists\\n ret.append(n1.pop(0))\\n else:\\n ret.append(n2.pop(0))\\n return ret\\n best = []\\n for i in range(0, k + 1):\\n if i == 9:\\n print(\\\"debug\\\")\\n \\n res = merge( greedySelection(k-i, nums1) , greedySelection(i, nums2) )\\n if len(res) > len(best):\\n best = res\\n elif len(res) == len(best) and res > best:\\n best = res\\n return best\\n\\n\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class RMQ:\\n def __init__(self, nums):\\n n = len(nums)\\n self.N = int(log2(n)) + 1\\n self.nums = nums\\n\\n rmq = [[0] * self.N for _ in range(n)]\\n for i in range(n):\\n rmq[i][0] = i\\n\\n j = 1\\n while (1 << j) <= n:\\n i = 0\\n while i + (1 << j) -1 < n:\\n l, r = rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]\\n if nums[l] >= nums[r]:\\n rmq[i][j] = l\\n else:\\n rmq[i][j] = r\\n i += 1\\n j += 1\\n\\n self.rmq = rmq\\n\\n\\n def min_q(self, l, r):\\n j = int(log2(r - l + 1))\\n ll, rr = self.rmq[l][j], self.rmq[r-(1<<j)+1][j]\\n if self.nums[ll] >= self.nums[rr]:\\n return ll\\n return rr\\n\\n\\ndef get_n(nums, take, rmq) -> List[int]:\\n left, n = 0, len(nums)\\n if take >= n:\\n return nums\\n\\n ans = []\\n for right in range(n-take, n):\\n i = rmq.min_q(left, right)\\n ans.append(nums[i])\\n left = i + 1\\n return ans\\n\\n\\ndef merge(a, b) -> List[int]:\\n a, b = deque(a), deque(b)\\n ans = []\\n while a and b:\\n if a > b:\\n ans.append(a.popleft())\\n else:\\n ans.append(b.popleft())\\n if a:\\n ans += list(a)\\n if b:\\n ans += list(b)\\n return ans\\n\\nclass Solution:\\n def maxNumber(self, A: List[int], B: List[int], k: int) -> List[int]:\\n rmq_a, rmq_b = RMQ(A), RMQ(B)\\n ans = [-100000000] * k\\n for l in range(k+1):\\n r = k - l\\n arr_l = get_n(A, l, rmq_a)\\n arr_r = get_n(B, r, rmq_b)\\n\\n tmp = merge(arr_l, arr_r)\\n if len(tmp) == k:\\n ans = max(ans, tmp)\\n\\n return ans\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n def prep(nums, k):\\n drop = len(nums) - k\\n out = []\\n for num in nums:\\n while drop and out and out[-1] < num:\\n out.pop()\\n drop -= 1\\n out.append(num)\\n return out[:k]\\n \\n def merge(a, b):\\n return [max(a, b).pop(0) for _ in a+b]\\n \\n return max(merge(prep(nums1, i), prep(nums2, k-i)) for i in range(k+1) if i <= len(nums1) and k-i <= len(nums2))\\n \\n \\\"\\\"\\\"\\n def merge(n1, n2):\\n res = []\\n while (n1 or n2) :\\n if n1>n2:\\n res.append(n1[0])\\n n1 = n1[1:]\\n else:\\n res.append(n2[0])\\n n2 = n2[1:]\\n return res\\n \\n def findmax(nums, length):\\n l = []\\n maxpop = len(nums)-length\\n for i in range(len(nums)):\\n while maxpop>0 and len(l) and nums[i]>l[-1]:\\n l.pop()\\n maxpop -= 1\\n l.append(nums[i])\\n return l[:length]\\n \\n n1 = len(nums1)\\n n2 = len(nums2)\\n res = [0]*k\\n for i in range(k+1):\\n j = k-i\\n if i>n1 or j>n2: continue\\n l1 = findmax(nums1, i)\\n l2 = findmax(nums2, j)\\n res = max(res, merge(l1,l2))\\n return res \\\"\\\"\\\"\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def maxNumber(self, nums1: list[int], nums2: list[int], k: int) -> list[int]:\\n def maxSubsequence(nums: list[int], length: int) -> list[int]:\\n stack = deque()\\n drop = len(nums) - length\\n for num in nums:\\n while drop and stack and stack[-1] < num:\\n stack.pop()\\n drop -= 1\\n stack.append(num)\\n return list(stack)[:length]\\n\\n def merge(nums1: list[int], nums2: list[int]) -> list[int]:\\n return [max(nums1, nums2).pop(0) for _ in range(len(nums1) + len(nums2))]\\n\\n max_number = []\\n for i in range(max(0, k - len(nums2)), min(k, len(nums1)) + 1):\\n subseq1 = maxSubsequence(nums1, i)\\n subseq2 = maxSubsequence(nums2, k - i)\\n merged = merge(subseq1, subseq2)\\n max_number = max(max_number, merged)\\n \\n return max_number\\n\\n# Example usage:\\nsol = Solution()\\nprint(sol.maxNumber([3,4,6,5], [9,1,2,5,8,3], 5)) # Output: [9,8,6,5,3]\\nprint(sol.maxNumber([6,7], [6,0,4], 5)) # Output: [6,7,6,0,4]\\nprint(sol.maxNumber([3,9], [8,9], 3)) # Output: [9,8,9]\\n\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def maxNumber(self, left: List[int], right: List[int], k: int) -> List[int]:\\n result = [0 for _ in range(k)]\\n\\n def get_best(arr, to_take):\\n stack = []\\n\\n for i in range(len(arr)):\\n elements_here_and_to_right = len(arr) - i\\n while len(stack) + elements_here_and_to_right > to_take and (stack and arr[i] > stack[-1]):\\n stack.pop()\\n \\n if len(stack) < to_take:\\n stack.append(arr[i])\\n \\n return stack\\n \\n def compare(alpha, beta, a, b):\\n if a >= len(alpha):\\n return False\\n \\n if b >= len(beta):\\n return True\\n if alpha[a] > beta[b]:\\n return True\\n \\n if alpha[a] < beta[b]:\\n return False\\n \\n return compare(alpha, beta, a + 1, b + 1)\\n\\n def merge(alpha, beta):\\n merged = []\\n a = 0\\n b = 0\\n\\n while a < len(alpha) or b < len(beta):\\n if compare(alpha, beta, a, b):\\n merged.append(alpha[a])\\n a += 1\\n else:\\n merged.append(beta[b])\\n b += 1\\n\\n return merged\\n\\n for to_take_from_left in range(max(0, k - len(right)), min(k, len(left)) + 1):\\n to_take_from_right = k - to_take_from_left\\n\\n candidate = merge(get_best(left, to_take_from_left), get_best(right, to_take_from_right)) \\n\\n if compare(candidate, result, 0,0):\\n result = candidate\\n \\n return result\\n\\n \",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n\\n g =[]\\n n1,n2=len(nums1),len(nums2)\\n nums1.append(inf)\\n nums2.append(inf)\\n for w in range(k+1):\\n u1,u2 = w,k-w\\n cs = []\\n if u1<=n1 and u2<=n2:\\n st1 = deque([])\\n st2 = deque([])\\n d1,d2 = n1-u1,n2-u2\\n for num in nums1:\\n while st1 and d1>0 and num>st1[-1]:\\n st1.pop()\\n d1-=1\\n st1.append(num)\\n st1.pop()\\n for num in nums2:\\n while st2 and d2>0 and num>st2[-1]:\\n st2.pop()\\n d2-=1\\n st2.append(num)\\n st2.pop()\\n while st1 or st2:\\n A = st1 if st1>st2 else st2\\n cs.append(A.popleft())\\n # i1,i2=0,0\\n # while i1<len(st1) or i2<len(st2):\\n # if i2==len(st2) or i1<len(st1) and st1[i1]>st2[i2]:\\n # cs.append(st1[i1])\\n # i1+=1\\n # else:\\n # cs.append(st2[i2])\\n # i2+=1\\n g.append(cs)\\n maxi = [0]*k\\n for cur in g:\\n flag = False\\n for u,v in zip(cur,maxi):\\n if u>v:\\n flag=True\\n break\\n if u<v: break\\n if flag:\\n maxi=cur\\n return maxi\\n\\n\\n\\n \",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1, nums2, k):\\n def merge(arr1, arr2):\\n res, i, j = [], 0, 0\\n while i < len(arr1) and j < len(arr2):\\n if arr1[i:] >= arr2[j:]:\\n res.append(arr1[i])\\n i += 1\\n else: \\n res.append(arr2[j])\\n j += 1\\n if i < len(arr1): res += arr1[i:]\\n elif j < len(arr2): res += arr2[j:]\\n return res \\n \\n def makeArr(arr, l):\\n i, res = 0, []\\n for r in range(l - 1, -1, -1):\\n num, i = max(arr[i:-r] or arr[i:])\\n i = -i + 1\\n res.append(num)\\n return res\\n \\n nums1, nums2, choices = [(num, -i) for i, num in enumerate(nums1)], [(num, -i) for i, num in enumerate(nums2)], []\\n for m in range(k + 1):\\n if m > len(nums1) or k - m > len(nums2): continue\\n arr1, arr2 = makeArr(nums1, m), makeArr(nums2, k - m) \\n choices.append(merge(arr1, arr2))\\n return max(choices)\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, a: List[int], b: List[int], k: int) -> List[int]:\\n def f(arr,x):\\n rem=len(arr)-x\\n q=[]\\n for i in arr:\\n while rem and q and q[-1]<i:\\n q.pop()\\n rem-=1\\n q.append(i)\\n return q[:x]\\n def merge(a,b):\\n return [max(a,b).pop(0) for i in a+b]\\n n=len(a)\\n m=len(b)\\n ans=[]\\n for i in range(k+1):\\n if i<=n and k-i<=m:\\n ans.append(merge(f(a,i),f(b,k-i)))\\n return max(ans)\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"def bestMinus1(nums: List[int]):\\n ln = len(nums)\\n for i in range(ln - 1):\\n if nums[i] < nums[i+1]:\\n del nums[i]\\n break\\n if ln == len(nums):\\n nums.pop()\\n\\ndef produceBests(nums: List[int], shortest, longest):\\n result = []\\n while True:\\n if len(nums) <= longest:\\n result.append(nums.copy())\\n if len(nums) == shortest:\\n break\\n bestMinus1(nums)\\n result.reverse()\\n return result\\n\\ndef getBestMix(nums1: List[int], nums2: List[int]) -> List[int]:\\n if not nums1:\\n return nums2\\n if not nums2:\\n # nums1 is being reused.\\n return nums1.copy()\\n if nums1 >= nums2:\\n return [nums1[0]] + getBestMix(nums1[1:], nums2)\\n return [nums2[0]] + getBestMix(nums1, nums2[1:])\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n l1 = len(nums1)\\n l2 = len(nums2)\\n\\n minFrom2 = max(0, k - l1)\\n maxFrom2 = min(k, l2)\\n bests2 = produceBests(nums2, minFrom2, maxFrom2)\\n \\n minFrom1 = k - maxFrom2\\n maxFrom1 = k - minFrom2\\n\\n while len(nums1) > maxFrom1:\\n bestMinus1(nums1)\\n\\n bestCandidate = []\\n while True:\\n from1 = len(nums1)\\n from2 = k - from1\\n candidate = getBestMix(nums1, bests2[from2 - minFrom2])\\n if bestCandidate < candidate:\\n bestCandidate = candidate\\n if len(nums1) <= minFrom1:\\n break\\n bestMinus1(nums1)\\n return bestCandidate\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n nums1 = list(enumerate(nums1))\\n nums2 = list(enumerate(nums2))\\n\\n def get_max_num(nums, t):\\n stack = []\\n for i, x in nums:\\n min_length = max(0, t - len(nums) + i) \\n while stack and stack[-1] < x and len(stack) > min_length:\\n stack.pop()\\n stack.append(x)\\n return stack[:t]\\n \\n def combine(arr1, arr2):\\n i = j = 0\\n p, q = len(arr1), len(arr2)\\n res = []\\n while i < p or j < q:\\n if i == p:\\n res.extend(arr2[j:])\\n break\\n elif j == q:\\n res.extend(arr1[i:])\\n break\\n elif arr1[i] > arr2[j]:\\n res.append(arr1[i])\\n i += 1\\n elif arr1[i] < arr2[j]:\\n res.append(arr2[j])\\n j += 1\\n elif arr1[i:] > arr2[j:]:\\n res.append(arr1[i])\\n i += 1\\n else:\\n res.append(arr2[j])\\n j += 1\\n\\n return res\\n\\n \\n ans = []\\n for i in range(k+1):\\n if i > len(nums1) or k-i > len(nums2):\\n continue\\n\\n m1 = get_max_num(nums1, i) if i > 0 else []\\n m2 = get_max_num(nums2, k-i) if k-i > 0 else []\\n ans.append(combine(m1, m2))\\n \\n return sorted(ans)[-1]\\n\\n \\n \",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\\"\\\"\\\"\\n 6 5\\n 9 8 3\\n\\n 9 8 6 5 3\\n\\n 3 4 6 5\\n 9 1 2 5 8 3\\n\\n 1 9 3 2 8 5\\n\\n 0, 5\\n 1, 4\\n 2, 3\\n 3, 2\\n 4, 1\\n\\n 4 5 3 2 1 6 0 8\\n length = 5\\n\\n l = [5 3 6 0 8]\\n maxpop = 0\\n i = 5\\n\\n \\n i = 0\\n 0: 4 5 3 2 1 6 0 8\\n 1: 5 3 2 1 6 0 8\\n 2: 5 3 2 6 0 8\\n 3: 5 3 6 0 8\\n 4: 5 6 0 8\\n 5: 6 0 8\\n 6: 6 8\\n 7: 8\\n 8: \\n\\n\\n 0: 3 4 6 5\\n 1: 4 6 5\\n 2: 6 5\\n 3: 6\\n 4:\\n \\\"\\\"\\\"\\n def getMaxAfterRemovals(nums):\\n n = len(nums)\\n maxAfterRemovals = [copy.deepcopy(nums)]\\n i = 0\\n while i < len(maxAfterRemovals[-1]) - 1:\\n if maxAfterRemovals[-1][i] < maxAfterRemovals[-1][i+1]:\\n maxAfterRemovals.append(maxAfterRemovals[-1][:i] + maxAfterRemovals[-1][i+1:])\\n i = max(0, i-1)\\n else:\\n i += 1\\n while len(maxAfterRemovals) < len(nums)+1:\\n maxAfterRemovals.append(maxAfterRemovals[-1][:-1])\\n return maxAfterRemovals\\n\\n maxAfterRemovals1 = getMaxAfterRemovals(nums1)\\n maxAfterRemovals2 = getMaxAfterRemovals(nums2)\\n\\n def merge(nums1, nums2):\\n i1 = i2 = 0\\n n1 = len(nums1)\\n n2 = len(nums2)\\n merged = []\\n while i1 < n1 and i2 < n2:\\n if nums1[i1:] > nums2[i2:]:\\n merged.append(nums1[i1])\\n i1 += 1\\n else:\\n merged.append(nums2[i2])\\n i2 += 1\\n while i1 < n1:\\n merged.append(nums1[i1])\\n i1 += 1\\n while i2 < n2:\\n merged.append(nums2[i2])\\n i2 += 1\\n return merged\\n\\n def isGreater(nums1, nums2):\\n i = 0\\n while i < len(nums1):\\n if nums1[i] > nums2[i]:\\n return True\\n elif nums1[i] < nums2[i]:\\n return False\\n i += 1\\n return False\\n \\n result = None\\n n1 = len(nums1)\\n n2 = len(nums2)\\n for count1 in range(k+1):\\n if count1 <= n1 and (k-count1) <= n2:\\n max1 = maxAfterRemovals1[n1-count1]\\n max2 = maxAfterRemovals2[n2-k+count1]\\n print(max1)\\n print(max2)\\n mergedNumber = merge(\\n max1, \\n max2\\n )\\n if not result or isGreater(mergedNumber, result):\\n result = mergedNumber\\n \\n return result\\n\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n ln2=len(nums2)\\n max2={}\\n for i in range(1,ln2+1):\\n s=[]\\n ls=0\\n maxpop=ln2-i\\n maxi=[]\\n for x in nums2:\\n while maxpop>0 and s and s[-1]<x:\\n s.pop()\\n ls-=1\\n maxpop-=1\\n if ls<i:\\n s.append(x)\\n ls+=1\\n else:\\n maxpop-=1\\n if maxi<s:\\n maxi=s.copy()\\n max2[i]=maxi\\n \\n ln1=len(nums1)\\n max1={}\\n for i in range(1,ln1+1):\\n s=[]\\n ls=0\\n maxpop=ln1-i\\n maxi=[]\\n for x in nums1:\\n while maxpop>0 and s and s[-1]<x:\\n s.pop()\\n ls-=1\\n maxpop-=1\\n if ls<i:\\n s.append(x)\\n ls+=1\\n else:\\n maxpop-=1\\n if maxi<s:\\n maxi=s.copy()\\n max1[i]=maxi\\n\\n\\n answer=[]\\n def merge(i,j):\\n nonlocal answer\\n if i==0:\\n if max2[j]>answer:\\n answer=max2[j].copy()\\n return\\n if j==0:\\n if max1[i]>answer:\\n answer=max1[i].copy()\\n return\\n l1=max1[i]\\n l2=max2[j]\\n ii,jj=0,0\\n l=[]\\n \\n while l1 or l2:\\n if l1>l2:\\n l.append(l1[0])\\n l1=l1[1:]\\n else:\\n l.append(l2[0])\\n l2=l2[1:]\\n\\n if l>answer:\\n answer=l.copy()\\n \\n for i in range(ln1+1):\\n if 0<=k-i<=ln2:\\n merge(i,k-i)\\n\\n return answer\\n\\n \\n \",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"def bestMinus1(nums: List[int]):\\n ln = len(nums)\\n for i in range(ln - 1):\\n if nums[i] < nums[i+1]:\\n del nums[i]\\n break\\n if ln == len(nums):\\n nums.pop()\\n\\ndef produceBests(nums: List[int]):\\n result = []\\n while nums:\\n result.append(nums.copy())\\n bestMinus1(nums)\\n result.append([])\\n result.reverse()\\n return result\\n\\ndef getBestMix(nums1: List[int], nums2: List[int]) -> List[int]:\\n if not nums1:\\n return nums2\\n if not nums2:\\n # nums1 is being reused.\\n return nums1.copy()\\n if nums1 >= nums2:\\n return [nums1[0]] + getBestMix(nums1[1:], nums2)\\n return [nums2[0]] + getBestMix(nums1, nums2[1:])\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n l1 = len(nums1)\\n l2 = len(nums2)\\n bests2 = produceBests(nums2)\\n \\n minFrom1 = max(0, k - l2)\\n maxFrom1 = min(k, l1)\\n\\n while len(nums1) > maxFrom1:\\n bestMinus1(nums1)\\n\\n bestCandidate = []\\n while True:\\n from1 = len(nums1)\\n from2 = k - from1\\n candidate = getBestMix(nums1, bests2[from2])\\n if bestCandidate < candidate:\\n bestCandidate = candidate\\n if len(nums1) <= minFrom1:\\n break\\n bestMinus1(nums1)\\n return bestCandidate\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n nums1_max = self.singleArraryMaxIndex(nums1)\\n nums2_max = self.singleArraryMaxIndex(nums2)\\n res = []\\n for i in range(min(k + 1, len(nums1) + 1)):\\n res1 = self.singleMaxK(nums1, nums1_max, i)\\n res2 = self.singleMaxK(nums2, nums2_max, k - i)\\n temp = self.constructArray(res1, res2)\\n if len(res) == 0:\\n res = temp[:]\\n else:\\n temp_n = self.arrayToInt(temp)\\n res_n = self.arrayToInt(res)\\n if temp_n > res_n:\\n res = temp[:]\\n return res\\n\\n def arrayToInt(self, nums: List[int]) -> int:\\n res = 0\\n for i in nums:\\n res = res * 10 + i\\n return res\\n\\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\\n i1, i2 = 0, 0\\n n1, n2 = len(nums1), len(nums2)\\n res = []\\n while i1 < n1 or i2 < n2:\\n if self.isGreater(nums1, nums2, i1, i2):\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n return res\\n\\n def isGreater(self, nums1: List[int], nums2: List[int], i: int, j: int) -> bool:\\n while i < len(nums1) and j < len(nums2) and nums1[i] == nums2[j]:\\n i += 1\\n j += 1\\n return j == len(nums2) or (i < len(nums1) and nums1[i] > nums2[j])\\n\\n def singleMaxK(self, nums: List[int], max_index: List[List[int]], k: int) -> List[int]:\\n n = len(nums)\\n res = []\\n start, end = 0, n - k\\n while len(res) < k and start <= end:\\n res.append(nums[max_index[start][end]])\\n start = max_index[start][end] + 1\\n end += 1\\n return res\\n\\n def singleArraryMaxIndex(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n res = [[0] * n for i in range(n)]\\n for i in range(n):\\n for j in range(i, n):\\n if j == i:\\n res[i][j] = i\\n else:\\n res[i][j] = j if nums[j] > nums[res[i][j-1]] else res[i][j-1]\\n return res\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n\\n def findMono(nums, x):\\n stack, n = [], len(nums)\\n drop = n - x\\n for i in range(n):\\n while stack and stack[-1] < nums[i] and drop > 0:\\n stack.pop()\\n drop -= 1\\n stack.append(nums[i])\\n return stack[:x]\\n\\n def merge(ans1, ans2):\\n res = []\\n if len(ans1) + len(ans2) < k:\\n return res\\n while ans1 or ans2:\\n res.append(ans1.pop(0) if ans1 > ans2 else ans2.pop(0))\\n return res\\n\\n print([merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1)])\\n return max(merge(findMono(nums1, i), findMono(nums2, k-i)) for i in range(k+1))\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n nums1_max = self.singleArraryMaxIndex(nums1)\\n nums2_max = self.singleArraryMaxIndex(nums2)\\n res = []\\n for i in range(min(k + 1, len(nums1) + 1)):\\n res1 = self.singleMaxK(nums1, nums1_max, i)\\n res2 = self.singleMaxK(nums2, nums2_max, k - i)\\n temp = self.constructArray(res1, res2)\\n if len(res) == 0:\\n res = temp[:]\\n else:\\n temp_n = self.arrayToInt(temp)\\n res_n = self.arrayToInt(res)\\n if temp_n > res_n:\\n res = temp[:]\\n return res\\n\\n def arrayToInt(self, nums: List[int]) -> int:\\n res = 0\\n for i in nums:\\n res = res * 10 + i\\n return res\\n\\n def constructArray(self, nums1: List[int], nums2: List[int]) -> List[int]:\\n i1, i2 = 0, 0\\n n1, n2 = len(nums1), len(nums2)\\n res = []\\n while i1 < n1 or i2 < n2:\\n if i1 < n1 and i2 < n2:\\n if nums1[i1] > nums2[i2]:\\n res.append(nums1[i1])\\n i1 += 1\\n elif nums1[i1] < nums2[i2]:\\n res.append(nums2[i2])\\n i2 += 1\\n else:\\n temp_i1, temp_i2 = i1+1, i2+1\\n while temp_i1 < n1 and temp_i2 < n2 and nums1[temp_i1] == nums2[temp_i2]:\\n temp_i1 += 1\\n temp_i2 += 1\\n if temp_i1 < n1 and temp_i2 < n2:\\n if nums1[temp_i1] > nums2[temp_i2]:\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n elif temp_i1 < n1:\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n elif i1 < n1:\\n res.append(nums1[i1])\\n i1 += 1\\n else:\\n res.append(nums2[i2])\\n i2 += 1\\n return res\\n\\n def singleMaxK(self, nums: List[int], max_index: List[List[int]], k: int) -> List[int]:\\n n = len(nums)\\n res = []\\n start, end = 0, n - k\\n while len(res) < k and start <= end:\\n res.append(nums[max_index[start][end]])\\n start = max_index[start][end] + 1\\n end += 1\\n return res\\n\\n def singleArraryMaxIndex(self, nums: List[int]) -> List[List[int]]:\\n n = len(nums)\\n res = [[0] * n for i in range(n)]\\n for i in range(n):\\n for j in range(i, n):\\n if j == i:\\n res[i][j] = i\\n else:\\n res[i][j] = j if nums[j] > nums[res[i][j-1]] else res[i][j-1]\\n return res\",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"def produceBests(nums: List[int]):\\n result = []\\n while nums:\\n result.append(nums.copy())\\n ln = len(nums)\\n for i in range(ln - 1):\\n if nums[i] < nums[i+1]:\\n del nums[i]\\n break\\n if ln == len(nums):\\n nums.pop()\\n result.append([])\\n result.reverse()\\n return result\\n\\ndef getBestMix(nums1: List[int], nums2: List[int]) -> List[int]:\\n if not nums1:\\n return nums2\\n if not nums2:\\n return nums1\\n if nums1 >= nums2:\\n return [nums1[0]] + getBestMix(nums1[1:], nums2)\\n return [nums2[0]] + getBestMix(nums1, nums2[1:])\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n l1 = len(nums1)\\n l2 = len(nums2)\\n bests1 = produceBests(nums1)\\n bests2 = produceBests(nums2)\\n # print(f\\\"{bests1=}\\\")\\n # print(f\\\"{bests2=}\\\")\\n \\n minFrom1 = max(0, k - l2)\\n maxFrom1 = min(k, l1)\\n # print(f\\\"{k=} {minFrom1=} {maxFrom1=}\\\")\\n\\n bestCandidate = []\\n for from1 in range(minFrom1, maxFrom1 + 1):\\n from2 = k - from1\\n # print(f\\\"{from1=} {from2=}\\\")\\n candidate = getBestMix(bests1[from1], bests2[from2])\\n # print(f\\\"{candidate=} {bests1[from1]=} {bests2[from2]=}\\\")\\n if bestCandidate < candidate:\\n bestCandidate = candidate\\n return bestCandidate\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n \\n\\n def subFinder(nums,size):\\n sequence = []\\n for i in range(len(nums)):\\n while sequence and sequence[-1] < nums[i] and (len(nums) - i) > (size - len(sequence)):\\n sequence.pop()\\n\\n if size - len(sequence) > 0 :\\n sequence.append(nums[i])\\n return sequence\\n sequencesOne = []\\n sequencesTwo = []\\n for i in range(k+1):\\n sequencesOne.append(subFinder(nums1,i))\\n sequencesTwo.append(subFinder(nums2,k-i))\\n merge = []\\n for i in range(k+1):\\n first = 0\\n second = 0\\n arr1 = sequencesOne[i]\\n arr2 = sequencesTwo[i]\\n currSeq = []\\n while first+second < k:\\n if first >= len(arr1):\\n currSeq += arr2[second:]\\n second = k\\n if second >= len(arr2):\\n currSeq +=arr1[first:]\\n first = k\\n else:\\n if arr1[first:] < arr2[second:]:\\n currSeq.append(arr2[second])\\n second+=1\\n else:\\n currSeq.append(arr1[first])\\n first+=1\\n merge.append(currSeq)\\n\\n biggestVal = \\\"0\\\"\\n greatestSeq = [] \\n for seq in merge:\\n stringSeq = [str(i) for i in seq]\\n val = \\\"\\\".join(stringSeq)\\n if int(val) > int(biggestVal):\\n biggestVal = val\\n greatestSeq = seq\\n return greatestSeq\",\n \"memory\": \"29400\"\n },\n {\n \"code\": \"def createMaxNum(L,k):\\n # returns maximum number one can make of all different lengths till k\\n n = len(L)\\n # Let A[i][j] be max numer one can make with subsequence of A[:i+1] of length j\\n # A[i][j] = 0 if i+1 < j\\n # A[i][0] = 0\\n A = [[0]*(k+1) for i in range(n)]\\n for j in range(1,k+1):\\n for i in range(j-1,n):\\n prev = A[i-1][j-1]\\n x = 10*prev + L[i] #if L[i] is to be included\\n y = A[i-1][j] # otherwise\\n A[i][j] = max(x,y)\\n return A[n-1]\\n\\n\\ndef merge(A,B):\\n n,m = len(A),len(B)\\n if n == 0:return B\\n if m == 0:return A\\n C = []\\n i = 0\\n j = 0\\n while i < n and j < m:\\n I = i\\n J = j\\n while I < n and J < m and A[I] == B[J]:\\n I += 1\\n J += 1\\n if I >= n and J < m:\\n C.append(B[j])\\n j += 1\\n elif I < n and J >= m:\\n C.append(A[i])\\n i += 1\\n elif I >= n and J >= m:\\n C.append(A[i])\\n i += 1\\n elif A[I] > B[J]:\\n C.append(A[i])\\n i += 1\\n elif A[I] < B[J]:\\n C.append(B[j])\\n j += 1\\n else:\\n raise ValueError()\\n C.extend(A[i:])\\n C.extend(B[j:])\\n return C \\n\\ndef solve(L1,L2,k):\\n A = createMaxNum(L1,k)\\n B = createMaxNum(L2,k)\\n #print(A)\\n #print(B)\\n if len(L1)==0:\\n return [int(x) for x in str(B[-1])]\\n if len(L2)==0:\\n return [int(x) for x in str(A[-1])]\\n if L2 ==[0]*len(L2):\\n return [int(x) for x in A[-1]] + L2\\n if L1 ==[0]*len(L1):\\n return [int(x) for x in B[-1]] + L1\\n toret = [A[-1],B[-1]]\\n for x in range(1,k):\\n y = k - x\\n if A[x]:a = list(str(A[x]))\\n else: a = []\\n if B[y]:b = list(str(B[y]))\\n else: b = []\\n c = merge(a,b)\\n c = \\\"\\\".join(c)\\n if c:c = int(c)\\n else: c = 0\\n toret.append(c)\\n #print(toret)\\n return max(toret)\\n\\n\\nclass Solution:\\n def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:\\n x = solve(nums1,nums2,k)\\n x = [int(y) for y in str(x)]\\n return x \",\n \"memory\": \"32500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":28,"string":"28"}}},{"rowIdx":252,"cells":{"question_id":{"kind":"number","value":322,"string":"322"},"name":{"kind":"string","value":"coin-change"},"content":{"kind":"string","value":"<p>You are given an integer array <code>coins</code> representing coins of different denominations and an integer <code>amount</code> representing a total amount of money.</p>\n\n<p>Return <em>the fewest number of coins that you need to make up that amount</em>. If that amount of money cannot be made up by any combination of the coins, return <code>-1</code>.</p>\n\n<p>You may assume that you have an infinite number of each kind of coin.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> coins = [1,2,5], amount = 11\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> 11 = 5 + 5 + 1\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> coins = [2], amount = 3\n<strong>Output:</strong> -1\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> coins = [1], amount = 0\n<strong>Output:</strong> 0\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= coins.length <= 12</code></li>\n\t<li><code>1 <= coins[i] <= 2<sup>31</sup> - 1</code></li>\n\t<li><code>0 <= amount <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":44.813918306977115,"string":"44.813918"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","dynamic-programming","breadth-first-search"],"string":"[\n \"array\",\n \"dynamic-programming\",\n \"breadth-first-search\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"41\", 0.1489], [\"61\", 0.04170000000000001], [\"81\", 0.0035], [\"100\", 0.0035], [\"120\", 0.0035], [\"140\", 0.0035], [\"160\", 0.007], [\"179\", 0.0105], [\"199\", 0.0139], [\"219\", 0.0245], [\"238\", 0.0104], [\"258\", 0.0555], [\"278\", 0.10750000000000003], [\"298\", 0.1797], [\"317\", 0.30079999999999996], [\"337\", 0.4248], [\"357\", 0.2731], [\"376\", 0.2627], [\"396\", 0.37329999999999997], [\"416\", 0.25239999999999996], [\"436\", 0.23849999999999996], [\"455\", 0.2179], [\"475\", 0.24889999999999998], [\"495\", 0.32139999999999996], [\"514\", 0.3317], [\"534\", 0.34209999999999996], [\"554\", 0.33849999999999997], [\"574\", 0.3661], [\"593\", 0.26949999999999996], [\"613\", 0.26969999999999994], [\"633\", 0.5317999999999999], [\"652\", 1.4608999999999999], [\"672\", 2.7251000000000003], [\"692\", 4.262099999999999], [\"712\", 3.2084999999999995], [\"731\", 5.7887], [\"751\", 9.1806], [\"771\", 9.3428], [\"790\", 7.4704999999999995], [\"810\", 5.702400000000001], [\"830\", 4.027200000000001], [\"850\", 2.9187999999999996], [\"869\", 2.6285], [\"889\", 1.8062], [\"909\", 1.7337000000000005], [\"928\", 1.4921000000000002], [\"948\", 1.5474000000000003], [\"968\", 1.9272], [\"988\", 1.4919000000000002], [\"1007\", 1.1086999999999998], [\"1027\", 1.1951000000000003], [\"1047\", 1.0951], [\"1066\", 1.1157], [\"1086\", 1.2469000000000001], [\"1106\", 1.3402999999999998], [\"1126\", 1.1848], [\"1145\", 1.1814999999999998], [\"1165\", 1.2953999999999999], [\"1185\", 1.0393999999999999], [\"1204\", 0.8464], [\"1224\", 0.7632999999999999], [\"1244\", 0.7114], [\"1264\", 0.5283], [\"1283\", 0.5249], [\"1303\", 0.5419], [\"1323\", 0.4282], [\"1342\", 0.36979999999999996], [\"1362\", 0.37639999999999996], [\"1382\", 0.3351], [\"1402\", 0.2765], [\"1421\", 0.2626], [\"1441\", 0.21089999999999995], [\"1461\", 0.20060000000000003], [\"1480\", 0.24519999999999995], [\"1500\", 0.2662], [\"1520\", 0.2697], [\"1540\", 0.2869], [\"1559\", 0.3904], [\"1579\", 0.39039999999999997], [\"1599\", 0.273]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16301\", 1.012], [\"16703\", 60.6776], [\"17106\", 5.654], [\"17508\", 3.0498000000000003], [\"17911\", 0.4282], [\"18313\", 1.2365], [\"18716\", 1.2814], [\"19118\", 2.176], [\"19521\", 1.2294999999999998], [\"19923\", 0.5249999999999999], [\"20326\", 0.7289], [\"20728\", 0.5595], [\"21131\", 0.4006], [\"21533\", 0.2555], [\"21936\", 0.20719999999999997], [\"22338\", 0.1659], [\"22741\", 0.36949999999999994], [\"23143\", 0.2936], [\"23546\", 0.07250000000000001], [\"23948\", 0.0795], [\"24351\", 0.0553], [\"24753\", 0.1036], [\"25156\", 0.0519], [\"25558\", 0.0691], [\"25961\", 0.0138], [\"26363\", 0.0346], [\"26766\", 0.0139], [\"27168\", 0.0691], [\"27571\", 0.13119999999999998], [\"27973\", 0.48009999999999997], [\"28376\", 0.08279999999999998], [\"28778\", 0.19679999999999997], [\"29181\", 0.08979999999999999], [\"29583\", 0.076], [\"29986\", 0.183], [\"30388\", 0.045], [\"30791\", 0.09319999999999999], [\"31193\", 0.2452], [\"31596\", 0.38680000000000003], [\"31998\", 0.1036], [\"32401\", 0.1104], [\"32803\", 0.0484], [\"33206\", 0.0278], [\"33608\", 0.0174], [\"34011\", 0.0174], [\"34413\", 0.0174], [\"34816\", 0.0518], [\"35218\", 0.0484], [\"35621\", 0.3765], [\"36023\", 0.3143], [\"36426\", 0.2625], [\"36828\", 1.8304999999999998], [\"37231\", 0.2867], [\"37633\", 0.1071], [\"38036\", 0.8634999999999999], [\"38438\", 0.1657], [\"38841\", 0.041499999999999995], [\"39243\", 0.1451], [\"39646\", 0.0725], [\"40048\", 0.041499999999999995], [\"40451\", 0.0518], [\"40853\", 0.1244], [\"41256\", 0.0622], [\"41658\", 0.048499999999999995], [\"42061\", 0.1174], [\"42463\", 0.1691], [\"42866\", 0.1347], [\"43268\", 0.27290000000000003], [\"43671\", 0.297], [\"44073\", 1.6854999999999998], [\"44476\", 0.304], [\"44878\", 0.6044], [\"45281\", 2.5696], [\"45683\", 0.1899], [\"46086\", 0.1693], [\"46488\", 0.1278], [\"46891\", 0.062200000000000005], [\"47293\", 0.0622], [\"47696\", 0.1278], [\"48098\", 0.0346]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0: return 0\n dp = {}\n coins.sort(reverse=True)\n def makeChange(curr, coinHigh, coinsUsed):\n if dp.get(curr) == -1: return\n if dp.get(0, amount) < (curr / coins[coinHigh] + coinsUsed): return\n for i in range(coinHigh, len(coins)):\n remainder = curr - coins[i]\n if dp.get(remainder, 10001) > coinsUsed + 1 and remainder >= 0:\n dp[remainder] = coinsUsed + 1\n if remainder == 0: return\n makeChange(remainder, i, coinsUsed + 1)\n if curr not in dp: dp[curr] = -1\n makeChange(amount, 0, 0)\n return dp[0] if 0 in dp else -1","runtime":"81"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n # n = len(coins)\n\n # dp = [0] + [amount+1]*amount\n\n # for coin in coins:\n # for i in range(coin, amount+1):\n # dp[i] = min([dp[i], dp[i-coin] +1])\n\n # return -1 if dp[amount] == amount +1 else dp[amount]\n\n\n\n if not amount: return 0\n dp=1<<amount\n i=dp\n res=0\n while i:\n if i&dp:\n res+=1\n curr=dp\n for coin in coins:\n dp|=curr>>coin\n if dp&1: return res\n i>>=1\n return -1\n\n\n \n\n\n","runtime":"100"},{"code":"import bisect\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \"\"\"\n DP + recursion\n 1. sort coins, use large denominations first\n 2. remember fewest number. stop processing if current number > fewest number\n 3. memorize best results for sub-amount\n\n Notes (made mistake):\n 1. memorize number that cannot form a combo\n 2. in each search, try all coins denominations\n 3. only 2 key parameters are needed in each search: target and memorized items\n\n \"\"\"\n if amount == 0:\n return 0\n \n coins = sorted(coins)\n\n def search(targetAmount: int, mem: dict) -> int:\n \"\"\" return fewest number for target amount \"\"\"\n currFewest = -1 # for target amount\n \n # print(targetAmount, topCoinPos)\n if targetAmount in mem:\n return mem[targetAmount]\n elif targetAmount < coins[0]:\n return -1\n \n topCoinPos = bisect.bisect_left(coins, targetAmount) - 1\n\n while topCoinPos >= 0:\n newTarget = targetAmount - coins[topCoinPos]\n newNum = search(newTarget, mem)\n if newNum != -1:\n if currFewest == -1:\n currFewest = 1 + newNum\n else:\n currFewest = min(currFewest, 1+newNum)\n \n # check smaller denomination\n topCoinPos -= 1\n if topCoinPos >= 0 and currFewest != -1 and targetAmount / coins[topCoinPos] > currFewest:\n break\n \n mem[targetAmount] = currFewest\n # print(\"-\", targetAmount, currFewest)\n return currFewest\n\n num = search(amount, {c: 1 for c in coins})\n return num","runtime":"120"},{"code":"import bisect\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \"\"\"\n DP + recursion\n 1. sort coins, use large denominations first\n 2. remember fewest number. stop processing if current number > fewest number\n 3. memorize best results for sub-amount\n\n Notes (made mistake):\n 1. memorize number that cannot form a combo\n\n \"\"\"\n if amount == 0:\n return 0\n \n coins = sorted(coins)\n\n def search(targetAmount: int, mem: dict) -> int:\n \"\"\" return fewest number for target amount \"\"\"\n currFewest = -1 # for target amount\n \n # print(targetAmount, topCoinPos)\n if targetAmount in mem:\n return mem[targetAmount]\n elif targetAmount < coins[0]:\n return -1\n \n topCoinPos = bisect.bisect_left(coins, targetAmount) - 1\n\n while topCoinPos >= 0:\n newTarget = targetAmount - coins[topCoinPos]\n newNum = search(newTarget, mem)\n if newNum != -1:\n if currFewest == -1:\n currFewest = 1 + newNum\n else:\n currFewest = min(currFewest, 1+newNum)\n \n # check smaller denomination\n topCoinPos -= 1\n if topCoinPos >= 0 and currFewest != -1 and targetAmount / coins[topCoinPos] > currFewest:\n break\n \n mem[targetAmount] = currFewest\n # print(\"-\", targetAmount, currFewest)\n return currFewest\n\n num = search(amount, {c: 1 for c in coins})\n return num","runtime":"140"},{"code":"class Solution:\n\n def find(self,arr,n,amount):\n num=[0]*n\n minnum=10001\n numcoins=0\n remainder=amount\n\n start=0\n ind=0\n while True:\n # print()\n # print(ind,num,numcoins,remainder,minnum)\n maxmax=remainder//arr[ind]\n if maxmax+numcoins>minnum:\n # while num[ind]==0:\n # ind-=1\n # if ind==-1:\n # return minnum\n ind-=1\n if ind==-1:\n return minnum\n remainder+=arr[ind]*num[ind]\n numcoins-=num[ind]\n num[ind]=0\n\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n ind+=1\n continue\n if maxmax==0 :\n if ind==n-1:\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n ind+=1\n continue\n num[ind]=maxmax\n numcoins+=maxmax\n remainder=remainder-maxmax*arr[ind]\n # print(ind,num,numcoins,remainder,minnum)\n if remainder==0:\n minnum=min(minnum,numcoins)\n remainder+=num[ind]*arr[ind]\n numcoins-=num[ind]\n num[ind]=0\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n # print(ind,num,numcoins,remainder,minnum)\n ind+=1\n continue\n else:\n if ind==n-1:\n remainder+=num[ind]*arr[ind]\n numcoins-=num[ind]\n num[ind]=0\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n\n ind+=1\n\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n # coins=coins[::-1]\n # counts=[0]*len()\n # maxmax=amount//coins[0]\n if amount==0:\n return 0\n\n\n minval=maxval=amount/coins[0]\n for i in coins[1:]:\n val=amount/i\n if val>maxval:\n maxval=val\n elif val<minval:\n minval=val\n if maxval-minval<1:\n for i in coins:\n if amount%i==0:\n return amount//i\n \n minval=amount/max(coins)\n maxval=amount/min(coins)\n if maxval-minval<1 and maxval!=minval:\n if minval//1==maxval//1:\n return -1\n \n if amount%2==1:\n for i in coins:\n if i%2==1:\n break\n if i==coins[-1]:\n return -1\n\n arr=sorted(coins,reverse=True)\n \n n=len(arr)\n # print(self.arr)\n val=self.find(arr,n,amount)\n if val==10001:val=-1\n return val\n \n","runtime":"160"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def dfs(rem):\n if rem == 0:\n return 0\n\n min_cost = inf\n\n for coin in coins:\n if rem / coin > min_cost:\n break\n\n if rem - coin >= 0:\n min_cost = min(min_cost, dfs(rem - coin) + 1)\n\n return min_cost\n\n coins.sort(reverse=True)\n res = dfs(amount)\n return res if res != inf else -1\n","runtime":"160"},{"code":"class Solution:\n\n def find(self,arr,n,amount):\n num=[0]*n\n minnum=10001\n numcoins=0\n remainder=amount\n\n start=0\n ind=0\n while True:\n # print()\n # print(ind,num,numcoins,remainder,minnum)\n maxmax=remainder//arr[ind]\n if maxmax+numcoins>minnum:\n # while num[ind]==0:\n # ind-=1\n # if ind==-1:\n # return minnum\n ind-=1\n if ind==-1:\n return minnum\n remainder+=arr[ind]*num[ind]\n numcoins-=num[ind]\n num[ind]=0\n\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n ind+=1\n continue\n if maxmax==0 :\n if ind==n-1:\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n ind+=1\n continue\n num[ind]=maxmax\n numcoins+=maxmax\n remainder=remainder-maxmax*arr[ind]\n # print(ind,num,numcoins,remainder,minnum)\n if remainder==0:\n minnum=min(minnum,numcoins)\n remainder+=num[ind]*arr[ind]\n numcoins-=num[ind]\n num[ind]=0\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n # print(ind,num,numcoins,remainder,minnum)\n ind+=1\n continue\n else:\n if ind==n-1:\n remainder+=num[ind]*arr[ind]\n numcoins-=num[ind]\n num[ind]=0\n while num[ind]==0:\n ind-=1\n if ind==-1:\n return minnum\n num[ind]-=1\n numcoins-=1\n remainder+=arr[ind]\n\n ind+=1\n\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n # coins=coins[::-1]\n # counts=[0]*len()\n # maxmax=amount//coins[0]\n if amount==0:\n return 0\n # for i in range(len(coins)):\n # if coins[i]==[411,412,413,414,415,416,417,418,419,420,421,422][i]:\n # if i==len(coins)-1:\n # return -1\n # else:\n # break\n minval=maxval=amount/coins[0]\n for i in coins[1:]:\n val=amount/i\n if val>maxval:\n maxval=val\n elif val<minval:\n minval=val\n if maxval-minval<1:\n for i in coins:\n if amount%i==0:\n return amount//i\n \n minval=amount/max(coins)\n maxval=amount/min(coins)\n if maxval-minval<1 and maxval!=minval:\n if minval//1==maxval//1:\n return -1\n \n if amount%2==1:\n for i in coins:\n if i%2==1:\n break\n if i==coins[-1]:\n return -1\n\n arr=sorted(coins,reverse=True)\n \n n=len(arr)\n # print(self.arr)\n val=self.find(arr,n,amount)\n if val==10001:val=-1\n return val\n \n","runtime":"179"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def dfs(rem):\n if rem == 0:\n return 0\n \n min_cost = inf\n\n for coin in coins:\n if rem / coin > min_cost:\n break\n\n if rem - coin >= 0:\n min_cost = min(min_cost, dfs(rem - coin) + 1)\n \n return min_cost\n \n coins.sort(reverse=True)\n res = dfs(amount)\n return res if res != inf else -1","runtime":"179"},{"code":"\"\"\"\n11\n10, 9, 6\n8, 5, 7, 4, 1\n\ndynamic programming: bottom up\nstart with each amount of coins:\nif it equals target then stop\nadd to every other type of coin\nif you get a sum that you've already seen then discard (bc there is a faster way to get there)\n\n\"\"\"\n\nfrom collections import deque\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n coins.sort()\n q = deque()\n visited = set()\n\n for i, coin in enumerate(coins):\n if coin == amount:\n return 1\n if coin > amount:\n break\n visited.add(coin)\n q.append((i, coin))\n \n level = 1\n \n while q:\n size = len(q)\n for i in range(size):\n currIndex, currCoin = q.popleft()\n for i in range(currIndex, len(coins)):\n nextCoin = currCoin + coins[i]\n if nextCoin in visited:\n continue\n if nextCoin == amount:\n return level + 1\n if nextCoin > amount:\n break\n visited.add(nextCoin)\n q.append((i, nextCoin))\n \n level += 1\n \n return -1\n\n","runtime":"199"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n from functools import cache\n @cache\n def dfs(rem):\n if rem == 0:\n return 0\n\n min_cost = float('inf')\n\n for coin in coins:\n if rem / coin > min_cost:\n break\n\n if rem - coin >= 0:\n min_cost = min(min_cost, dfs(rem - coin) + 1)\n\n return min_cost\n\n coins.sort(reverse=True)\n res = dfs(amount)\n return res if res != float('inf') else -1","runtime":"199"},{"code":"import heapq\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n return num_coins(coins, amount)\n\ndef num_coins(coins, amount):\n coins.sort(reverse=True)\n\n queue = [((math.ceil(amount / coins[0]), 0), 0, amount, 0)]\n visited = set()\n while queue:\n _, total, remainder, i = heapq.heappop(queue)\n if (remainder, i) in visited:\n continue\n visited.add((remainder, i))\n if remainder == 0:\n return total\n\n if i + 1 < len(coins) and (remainder, i + 1) not in visited:\n heapq.heappush(queue, ((total + math.ceil(remainder / coins[i]), -total), total, remainder, i + 1))\n if remainder >= coins[i] and (remainder - coins[i], i) not in visited:\n total += 1\n remainder -= coins[i]\n heapq.heappush(queue, ((total + math.ceil(remainder / coins[i]), -total), total, remainder, i))\n \n return -1","runtime":"219"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n visited = [False] * amount\n subamounts = [amount]\n\n for c in itertools.count(1):\n new_subamounts = []\n for coin in coins:\n for subamount in subamounts:\n new_subamount = subamount - coin\n if new_subamount >= 0 and visited[new_subamount] is False:\n visited[new_subamount] = True\n new_subamounts.append(new_subamount)\n\n if not new_subamounts:\n return -1\n if visited[0]:\n return c\n subamounts = new_subamounts","runtime":"219"},{"code":"from typing import List\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n \n coins_needed = [-1 for _ in range(amount + 1)]\n coins_needed[0] = 0\n\n count = 1\n current_amount_list = [0]\n while current_amount_list:\n\n next_amount_list = []\n for last_amount in current_amount_list:\n for coin in coins:\n amount_value = coin + last_amount\n if (amount_value > amount) or (coins_needed[amount_value] != -1):\n continue\n if amount_value == amount:\n return count\n next_amount_list.append(amount_value)\n coins_needed[amount_value] = count\n count += 1\n current_amount_list = next_amount_list\n\n return -1 ","runtime":"238"},{"code":"class Solution:\n def coinChange2(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n if amount == 0:\n return 0\n comb = [-1] * (amount + 1)\n comb[-1] = 0\n for i in range(amount, -1, -1):\n if comb[i] == -1:\n continue\n for coin in coins:\n pos = i - coin\n if pos < 0:\n continue\n if comb[pos] == -1:\n comb[pos] = comb[i] + 1\n else:\n comb[pos] = min(comb[pos], comb[i] + 1)\n #if pos == 0:\n # return comb[0]\n return comb[0]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n flags = [False]*(amount+1)\n q = [0]\n steps = 0\n coins = [c for c in coins if c <= amount]\n coins.sort(reverse=True)\n while q:\n steps += 1\n new_q = []\n for i in q:\n for c in coins:\n pos = i + c\n if pos == amount:\n return steps\n if pos < amount and not flags[pos]:\n flags[pos] = True\n new_q.append(pos)\n q = new_q\n return -1\n\n\n","runtime":"238"},{"code":"class Solution:\n def coinChange2(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n if amount == 0:\n return 0\n comb = [-1] * (amount + 1)\n comb[-1] = 0\n for i in range(amount, -1, -1):\n if comb[i] == -1:\n continue\n for coin in coins:\n pos = i - coin\n if pos < 0:\n continue\n if comb[pos] == -1:\n comb[pos] = comb[i] + 1\n else:\n comb[pos] = min(comb[pos], comb[i] + 1)\n #if pos == 0:\n # return comb[0]\n return comb[0]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n flags = [False]*(amount+1)\n q = [0]\n steps = 0\n coins.sort(reverse=True)\n while q:\n steps += 1\n new_q = []\n for i in q:\n for c in coins:\n pos = i + c\n if pos == amount:\n return steps\n if pos < amount and not flags[pos]:\n flags[pos] = True\n new_q.append(pos)\n q = new_q\n return -1\n\n\n","runtime":"258"},{"code":"class Solution:\n def coinChange2(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n if amount == 0:\n return 0\n comb = [-1] * (amount + 1)\n comb[-1] = 0\n for i in range(amount, -1, -1):\n if comb[i] == -1:\n continue\n for coin in coins:\n pos = i - coin\n if pos < 0:\n continue\n if comb[pos] == -1:\n comb[pos] = comb[i] + 1\n else:\n comb[pos] = min(comb[pos], comb[i] + 1)\n #if pos == 0:\n # return comb[0]\n return comb[0]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n flags = [False]*(amount+1)\n q = [0]\n steps = 0\n coins.sort(reverse=True)\n while q:\n steps += 1\n new_q = []\n for i in q:\n for c in coins:\n pos = i + c\n if pos == amount:\n return steps\n if pos < amount and not flags[pos]:\n flags[pos] = True\n new_q.append(pos)\n q = new_q\n return -1\n\n\n","runtime":"258"},{"code":"from collections import deque\nclass Solution(object):\n def coinChange(self, coins, amount):\n # bfs 최단거리 구하기\n # 초기 세팅\n queue = deque()\n visited = [False] * (amount+1) \n # 시작 노드 예약\n queue.append((amount, 0))\n visited[amount] = True\n\n while queue:\n # 현재 노드 방문\n cur_v, dist = queue.popleft()\n if cur_v == 0:\n return dist\n # 다음 노드 예약\n for coin in coins:\n next_v = cur_v - coin\n if next_v >= 0 and not visited[next_v]:\n queue.append((next_v, dist+1))\n visited[next_v] = True\n\n return -1","runtime":"278"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount==0:\n return 0\n dp=[-1]*(amount+1)\n que=deque([0])\n dp[0]=0\n\n while que:\n nextAmount=que.popleft()\n for c in coins:\n newAmount=nextAmount+c\n #print(newAmount)\n if newAmount<=amount and dp[newAmount]==-1 :\n dp[newAmount]=dp[nextAmount]+1\n que.append(newAmount)\n if dp[amount]!=-1:\n return dp[amount]\n return -1\n\n ","runtime":"278"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins = [c for c in coins if c <= amount]\n r = {0: 0} # if amount is 0\n current_sums = [0]\n while current_sums:\n tmp_current_sums = []\n for c in coins:\n for s in current_sums:\n new_sum = c + s\n if new_sum not in r and new_sum <= amount:\n r[new_sum] = r[s] + 1\n tmp_current_sums.append(new_sum)\n current_sums = tmp_current_sums\n return r.get(amount, -1)","runtime":"298"},{"code":"class Solution:\n def __init__(self):\n self.appeared = set()\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n levels = 1\n current_level = [amount]\n while True:\n next_level = []\n for coin in coins:\n for residual in current_level:\n if residual == coin:\n return levels\n elif residual > coin:\n if residual - coin in self.appeared:\n continue\n else:\n next_level.append(residual - coin)\n self.appeared.add(residual - coin)\n\n else:\n current_level = next_level\n levels += 1\n if next_level == []:\n return -1","runtime":"298"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n q = deque([(amount, 0)])\n seen = set()\n\n while q:\n amt_left, num_coins = q.popleft()\n if amt_left == 0:\n return num_coins\n\n for c in coins:\n new_left = amt_left - c\n if new_left not in seen and new_left >= 0:\n seen.add(new_left)\n q.append((new_left, num_coins + 1))\n \n return -1\n","runtime":"317"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n coins.sort(reverse=True)\n visited = set()\n toProcess = deque()\n\n toProcess.append((amount, 0))\n\n while toProcess:\n # print(toProcess)\n target, count = toProcess.popleft()\n\n for coin in coins:\n diff = target - coin\n if diff not in visited and diff > 0:\n visited.add(diff)\n toProcess.append((diff, count + 1))\n if diff == 0:\n return count + 1\n return -1\n\n\n\n\n\n","runtime":"317"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n occurredNums = {}\n queue = [amount]\n count = 0\n while len(queue) > 0: \n tempQueue = []\n for amountLeft in queue: \n if amountLeft == 0: return count\n for coin in coins: \n newAmountLeft = amountLeft-coin\n if newAmountLeft >= 0 and newAmountLeft not in occurredNums: \n occurredNums[newAmountLeft] = None\n tempQueue.append(newAmountLeft)\n queue = tempQueue\n count += 1\n return -1","runtime":"337"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n BUF = [None]*(amount+1)\n BUF[0] = 0\n for coin in coins:\n for amt in range(coin, amount+1):\n old_val = BUF[amt]\n delta_val = BUF[amt-coin]\n if delta_val is not None and (old_val is None or old_val > delta_val+1):\n BUF[amt] = delta_val+1\n opt = BUF[amount]\n return -1 if opt is None else opt\n","runtime":"337"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if not coins:\n return -1\n if amount == 0:\n return 0\n\n remaining = collections.deque()\n remaining.append(amount)\n visited = set()\n step = 0\n while remaining:\n size = len(remaining)\n step += 1\n for i in range(size):\n current = remaining.popleft()\n for coin in coins:\n tmp = current - coin\n if tmp == 0:\n return step\n if tmp > 0 and tmp not in visited:\n remaining.append(tmp)\n visited.add(tmp)\n\n return -1","runtime":"357"},{"code":"#from functools import cache\nfrom collections import deque\nclass Solution:\n def coinChange(self, coins, amount):\n level = seen = {0}\n number = 0\n while level:\n if amount in level:\n return number\n level = {a+c for a in level for c in coins if a+c <= amount} - seen\n seen |= level\n number += 1\n return -1\n # Solution 4: BFS\n \"\"\"def coinChange(self, coins: List[int], amount: int) -> int:\n if amount==0: return 0\n dq = deque([(0,0)])\n nc = 0\n seen = [False]*(amount+1)\n seen[0] = True\n while dq:\n curr, nc=dq.pop()\n for c in coins:\n if c+curr==amount: \n return nc+1\n if c+curr<amount and not seen[c+curr]:\n dq.appendleft((c+curr,nc+1))\n return -1\"\"\"\n\n\n\n # Solution 3: do not keep track of coin number used so far, just track the amount remaining\n \"\"\"def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def dp(rest):\n if rest==0: return 0\n if rest<0: return float('inf')\n return min([1+dp(max(-1,rest-c)) for c in coins])\n ans = dp(amount)\n if ans<float('inf'): return ans\n return -1\"\"\"\n\n # Solution 2: uses dict to save computed values - no difference in time/space with Solution 1\n \"\"\"def coinChange(self, coins: List[int], amount: int) -> int:\n DP = dict()\n def dp(i,rest):\n if rest==0: return 0 # no coins needed\n if i==len(coins): return float('inf') # no coins left \n if coins[i]==rest: return 1 # one coin is the best choice to cover the rest \n # if we can pick this coin->compare between 2 values, else compute one value\n if coins[i]<rest: \n if (i,rest-coins[i]) not in DP:\n DP[(i,rest-coins[i])] = dp(i,rest-coins[i])\n if (i+1,rest) not in DP:\n DP[(i+1,rest)] = dp(i+1,rest)\n return min(1+DP[(i,rest-coins[i])], DP[(i+1,rest)])\n else:\n if (i+1,rest) not in DP:\n DP[(i+1,rest)] = dp(i+1,rest)\n return DP[(i+1,rest)]\n #coins.sort(reverse=True)\n temp = dp(0,amount)\n if temp<float('inf'): return temp\n return -1\"\"\"\n # Solution 1: uses cache\n \"\"\"def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def dp(i,rest):\n if rest==0: return 0 # no coins needed\n if i==len(coins): return float('inf') # no coins left \n if coins[i]==rest: return 1 # one coin is the best choice to cover the rest \n # if we can pick this coin->compare between 2 values, else compute one value\n if coins[i]<rest: \n return min(1+dp(i,rest-coins[i]), dp(i+1,rest))\n else:\n return dp(i+1,rest)\n #coins.sort(reverse=True)\n temp = dp(0,amount)\n if temp<float('inf'): return temp\n return -1\"\"\"\n \n ","runtime":"357"},{"code":"IMPOSSIBLE = 10**6\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n d = [0]\n for ant in range(1, amount + 1):\n _min = IMPOSSIBLE\n for c in coins:\n prev = ant - c\n if prev < 0:\n continue\n if _min > d[prev] + 1:\n _min = d[prev] + 1\n d.append(_min)\n \n return d[amount] if d[amount] != IMPOSSIBLE else -1\n \n ","runtime":"376"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {0: 0}\n q = deque([0])\n while q:\n cur = q.popleft()\n curcount = memo[cur]\n if cur == amount: return curcount\n for c in coins:\n newval = cur + c\n if newval <= amount and newval not in memo:\n memo[newval] = curcount + 1\n q.append(newval)\n return -1\n \n \n\n\n ","runtime":"376"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n dp = [-1] * (amount+1)\n dp[0] = 0\n\n for c in coins:\n for i in range(1, amount+1):\n if c <= i and dp[i-c] > -1 and (dp[i] == -1 or dp[i]>dp[i-c]+1):\n dp[i] = dp[i-c] + 1\n\n return dp[-1] ","runtime":"396"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n #backtracking with memoization table\n #O(2^N) time complexity, but average time will be faster\n\n queue = collections.deque()\n memo = { 0:0 }\n\n def dfs(queue):\n next_level = []\n while coins[-1] not in memo or next_level:\n if next_level:\n queue.extend(next_level)\n next_level = []\n while queue:\n curr = queue.popleft()\n res = memo[curr]\n if curr == amount:\n return res\n if curr > amount:\n continue\n for coin in coins:\n candidate = curr + coin\n if candidate in memo:\n continue\n memo[candidate] = memo[curr] + 1\n next_level.append(curr + coin)\n return -1\n \n queue.append(0)\n return dfs(queue)","runtime":"396"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [amount+1]*(amount+1)\n dp[0]=0\n for i in range(1,amount+1):\n for elt in coins:\n if i-elt>=0:\n if dp[i-elt]+1<dp[i]:\n dp[i]=dp[i-elt]+1\n \n if dp[-1]<amount+1:\n return dp[-1]\n return -1","runtime":"416"},{"code":"\nfrom collections import deque\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n queue = deque()\n\n queue.append([amount, 0])\n seen = set([amount])\n\n while queue:\n \n amount_remain, num_coins = queue.popleft()\n\n if amount_remain == 0:\n return num_coins\n\n for i in range(len(coins)):\n if amount_remain - coins[i] not in seen and amount_remain - coins[i] >= 0:\n queue.append([amount_remain - coins[i], num_coins + 1])\n seen.add(amount_remain - coins[i])\n\n return -1\n\n\n ","runtime":"416"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n rem = amount\n res = 0\n\n dp = [float('inf')] * (amount + 1)\n\n dp[0] = 0\n for i in range(1, amount + 1):\n for c in coins:\n if i - c >= 0 and dp[i-c] + 1 < dp[i]:\n dp[i] = dp[i-c] + 1\n \n if dp[amount] == float('inf'):\n return -1\n return dp[amount]\n\n\n\n \n","runtime":"436"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp={0:0}\n MAX=9999999\n for curr in range(amount):\n if curr not in dp:\n continue\n curr_count=dp[curr]\n for coin in coins:\n if dp.get(curr+coin,MAX)>(curr_count+1):\n dp[curr+coin]=curr_count+1\n \n del dp[curr]\n return dp.get(amount,-1)\n \n ","runtime":"436"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n if amount == 0:\n return 0\n\n combinations = [0] * (amount + 1)\n combinations[0] = 0\n combinations[1] = 1 if 1 in coins else 0\n\n for k in range(2, amount + 1):\n if k in coins:\n combinations[k] = 1\n continue\n\n current_min = None\n for c in coins:\n if c < k and combinations[k - c]:\n if current_min is None or current_min > combinations[k - c]:\n current_min = combinations[k - c]\n \n combinations[k] = current_min + 1 if current_min else 0\n\n ret_combinations = combinations[amount]\n return ret_combinations if ret_combinations > 0 else -1","runtime":"455"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n changes = [] \n work = [0] \n show = True \n \n exchange = CoinChange(coins, amount, changes, work, show)\n result = exchange.find_fewest_coins()\n return len(result) if result != [-1] else -1\n\nclass CoinChange:\n def __init__(self, w, c, changes, work, show):\n self._w = w \n self._c = c \n self._changes = changes \n self._work = work \n self._show = show \n\n def find_fewest_coins(self):\n if self._c < 0:\n self._changes[:] = [-1]\n return self._changes\n\n # Initialize the dynamic programming table\n minCoins = [float('inf')] * (self._c + 1)\n minCoins[0] = 0\n coinsUsed = [-1] * (self._c + 1)\n\n for amount in range(1, self._c + 1):\n for coin in self._w:\n if coin <= amount:\n if minCoins[amount - coin] + 1 < minCoins[amount]:\n minCoins[amount] = minCoins[amount - coin] + 1\n coinsUsed[amount] = coin\n self._work[0] += 1\n\n if minCoins[self._c] == float('inf'):\n self._changes[:] = [-1]\n else:\n self._changes.clear()\n remainingAmount = self._c\n while remainingAmount > 0:\n self._changes.append(coinsUsed[remainingAmount])\n remainingAmount -= coinsUsed[remainingAmount]\n\n if self._show:\n self._display_results()\n\n return self._changes\n\n def _display_results(self):\n # print(f\"Coins available: {self._w}\")\n print(f\"Target amount: {self._c}\")\n print(f\"Minimum coins required: {len(self._changes) if self._changes != [-1] else -1}\")\n print(f\"Coins selected: {self._changes}\")\n\n if self._changes != [-1]:\n print(\"Coin selection process:\")\n remaining = self._c\n for coin in self._changes:\n print(f\" Selected coin: {coin}, Remaining amount: {remaining} - {coin} = {remaining - coin}\")\n remaining -= coin\n print(f\" Final remaining amount: {remaining}\")","runtime":"455"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n count = [None for i in range(amount + 1)]\n count[0] = 0\n for i in range(amount + 1):\n for c in coins:\n if count[i] is not None and (i + c <= amount) and (not count[i+c] or count[i+c] > count[i] + 1):\n count[i+c] = count[i] + 1\n return count[amount] or -1","runtime":"475"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n M = [-1 for _ in range(amount+1)]\n M[0] = 0\n coins =[c for c in coins if c<=amount]\n coins.sort(reverse = True)\n #print(coins)\n for c in coins:\n M[c] = 1\n for i in range(amount+1):\n if M[i] == -1:\n m=amount+1\n able = False\n for c in coins:\n if i>c and M[i-c]!=-1 and M[i-c]+1<m:\n m = M[i-c] +1\n able = True\n if able:\n M[i] = m\n else:\n M[i] = -1\n \n return M[amount]","runtime":"475"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n solutions = [10**5 for i in range(amount + 1)]\n solutions[0] = 0\n for i in range(1, amount + 1):\n for coin in coins:\n if i - coin >= 0 and 1+solutions[i-coin] <= solutions[i] :\n solutions[i] = 1 + solutions[i - coin]\n if solutions[amount] == 10**5:\n return -1\n else:\n return solutions[amount]\n ","runtime":"495"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n cc, q = 0, collections.deque([0])\n seen = set()\n while len(q) != 0:\n for _ in range(len(q)):\n amt = q.popleft()\n if amt == amount:\n return cc\n if amt > amount or amt in seen:\n continue\n seen.add(amt)\n for c in coins:\n q.append(amt + c)\n cc += 1\n return -1","runtime":"495"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n dp=[-1]*(amount+1)\n\n dp[0]=0\n\n for c in coins:\n for i in range(amount-c+1):\n if dp[i]!=-1:\n if dp[i+c]==-1:\n dp[i+c]=dp[i]+1\n else:\n dp[i+c]=min(dp[i+c],dp[i]+1)\n return dp[-1]\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # @cache\n # def func(idx,s):\n # if s==amount:\n # return 0 \n # if s> amount or idx==len(coins):\n # return float('inf')\n \n # return min(1+func(idx,s+coins[idx]), func(idx+1,s))\n # res=func(0,0) \n # return res if res<float('inf') else -1\n\n dp= [-1]*(amount+1)\n dp[0]=0\n\n for c in coins:\n print(dp)\n for i in range(amount+1-c):\n if dp[i]!=-1:\n if dp[i+c]==-1:\n dp[i+c]=dp[i]+1\n else:\n dp[i+c]=min(dp[i+c],dp[i]+1)\n return dp[-1]\n\n @cache\n def func(idx,s):\n if s==amount:\n return 0 \n if s> amount or idx==len(coins):\n return -1\n res=[] \n r=func(idx,s+coins[idx])\n if r!=-1:\n res.append(r+1)\n r= func(idx+1,s)\n if r!=-1:\n res.append(r)\n if not res:\n return -1\n else:\n return min(res)\n res=func(0,0) \n return res \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n @cache\n def func(s):\n if s== amount:\n return 0\n if s>amount:\n return -1\n res=[]\n for j in range(len(coins)):\n if s+coins[j]<=amount:\n r= func(s+coins[j])\n if r!=-1:\n res.append(r+1)\n if res:\n return min(res)\n else:\n return -1\n return func(0)\n\n\n ","runtime":"514"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [-1] * (amount + 1)\n dp[0] = 0\n\n #print(dp)\n\n for c in coins:\n if(c <= amount):\n dp[c] = 1\n\n coinSet = set(coins)\n\n for i in range(1, amount + 1):\n if(i in coinSet):\n continue\n\n dpList = []\n for c in coins:\n if c < i and dp[i - c] != -1:\n dpList.append(dp[i - c])\n\n #print(\"i = \", i)\n #print(\"dpList = \", dpList)\n\n if(len(dpList) > 0):\n dp[i] = 1 + min(dpList)\n \n #print(dp)\n\n return dp[amount]","runtime":"514"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # return fewest number of coins needed to make up that amount\n # could try to make up each val up to amount\n # and for each val, could look at coins places back to find the min amount of coins needed there\n\n if amount == 0:\n return 0\n\n dp = [-1] * (amount+1)\n dp[0] = 0\n\n for i in range(1, amount+1):\n # check adding to the previous\n coin_counts = []\n for coin in coins:\n if i >= coin:\n if dp[i-coin] > -1:\n coin_counts.append(1 + dp[i-coin])\n if coin_counts:\n dp[i] = min(coin_counts)\n return dp[-1]\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \"\"\"\n # return fewest number of coins that you need to make up the amount\n # ifthe amount of money can be made up by any combination of coins, return -1\n # assume an infinite number of each kind of coin\n \n # could store the amount of coins needed for each if we focused on maximizing the high val coin\n # and then return the min of that?\n\n # 0 coins always to reach amount of 0\n if not amount:\n return 0\n\n # if any coins are a multiple of other coins, you can delete\n # could sub one of the coins for another kind\n\n # could find minimum number of coins to create every amount up to amount -- in a dp array\n dp = [amount+1] * (amount + 1)\n dp[0] = 0 # costs 0 coins to get remainder\n for i in range(1, amount+1):\n # print(dp)\n min_coins = amount+1\n for coin in coins:\n # need some amount of min_coins to compare against\n if i - coin >= 0:\n min_coins = min(min_coins, 1 + dp[i-coin])\n dp[i] = min_coins\n if dp[-1] > amount:\n return -1\n return dp[-1]\n \"\"\"\n \n\n \n \n\n ","runtime":"534"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n if amount != 0 and amount < min(coins):\n return -1\n\n n = len(coins)\n dp = [0] * (amount+1)\n a = min(coins)\n dp[0] = 0\n dp[1:a] = [-1] * (a-1)\n dp[a] = 1\n for i in range(a+1, amount+1):\n possible = []\n for coin in coins:\n if i >= coin and dp[i - coin] != -1:\n possible.append(dp[i - coin] + 1)\n dp[i] = min(possible) if possible else -1\n return dp[-1]","runtime":"534"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n times = [0]\n\n for i in range(1, amount + 1):\n if i in coins:\n times.append(1)\n continue\n\n minimum = -1\n for j in coins:\n if j > i:\n continue\n if times[j] != -1 and times[i - j] != -1 and (minimum < 0 or times[j] + times[i - j] < minimum):\n minimum = times[j] + times[i - j]\n \n times.append(minimum)\n\n return times[-1]\n ","runtime":"554"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n coins = sorted(coins, reverse=True)\n dp = [float('inf')] * (amount+1)\n\n dp[0] = 0 \n\n for i in range(1, amount+1):\n min_amount = float('inf')\n for c in coins:\n\n if i-c>=0 and dp[i-c]+1<=min_amount:\n min_amount = dp[i-c] + 1\n dp[i] = min_amount\n if dp[amount] == float('inf'):\n return -1 \n return dp[amount]\n\n\n","runtime":"554"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0: return 0\n # Assume all coins can't be made initially\n dp = [-1 for i in range(amount+1)]\n \n # Bottom up solution, so build up the dp array by solving for lower cases first\n for x in range(1,amount+1):\n if x in coins: \n dp[x] = 1\n continue\n\n # Only need to iterate through coins array\n # ... because adding 1 coin is the most efficient way you can improve on a solution\n for c in coins:\n if c > x: continue\n if dp[x-c] == -1: continue\n count = dp[x-c]+1\n if dp[x] == -1 or count < dp[x]: dp[x] = count\n \n return dp[amount]\n\n\n\n \n\n\n \n","runtime":"574"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount in coins:\n return 1\n\n coins = sorted(coins)\n min_coins = [amount + 1] * (amount + 1)\n min_coins[0] = 0\n\n for coin in coins:\n if coin <= amount:\n min_coins[coin] = 1\n\n for i in range(1, len(min_coins)):\n if i not in coins:\n min_list_i = []\n for coin in coins:\n if i - coin >= 0:\n min_list_i.append(min_coins[i - coin])\n else:\n break\n if min_list_i:\n min_coins[i] = min(min_coins[i], min(min_list_i) + 1)\n\n return min_coins[-1] if min_coins[-1] != amount + 1 else -1\n\n # self.counts = {}\n # self.coins = sorted(coins)\n # for coin in self.coins:\n # self.counts[coin] = 1\n # self.counts[0] = 0\n \n # def helper(amount):\n # if amount in self.counts:\n # return self.counts[amount]\n # min_list = []\n # for coin in self.coins:\n # if amount - coin >= 0:\n # if amount - coin not in self.counts:\n # helper(amount - coin)\n # if self.counts[amount - coin] != -1:\n # min_list.append(self.counts[amount - coin])\n # else:\n # break\n # if not min_list:\n # self.counts[amount] = -1\n # return -1\n # else: \n # output = min(min_list) + 1\n # self.counts[amount] = output\n # return output\n \n # return helper(amount)","runtime":"574"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n if len(coins) == 0:\n return 0\n coins = [coin for coin in coins if coin <= amount]\n dp = [-1 for x in range(amount+1)]\n dp[0] = 1\n for coin in coins:\n dp[coin] = 1\n for i in range(1, len(dp)):\n possible = []\n if dp[i]==-1:\n for coin in coins:\n if i-coin >= 0 and dp[i-coin] >=0:\n possible.append(dp[i-coin])\n if len(possible) != 0:\n dp[i] = min(possible) + 1\n \n return dp[-1]\n \n\n \n ","runtime":"593"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n \n memo = [0] * (amount + 1)\n\n for i in range(1, amount + 1):\n amounts = []\n for c in coins:\n if i - c >= 0:\n if memo[i - c] != -1:\n amounts.append(memo[i - c] + 1)\n if len(amounts) > 0:\n memo[i] = min(amounts)\n else:\n memo[i] = -1\n \n return memo[amount]\n\n","runtime":"593"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n inf = float(\"inf\")\n ret = [0] * (amount + 1)\n\n for i in range(1, amount + 1):\n ret[i] = 1 + min([ret[i - coin] if i - coin >= 0 else float(\"inf\") for coin in coins])\n return ret[amount] if ret[amount] != float(\"inf\") else -1","runtime":"613"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n inf = float(\"inf\")\n ret = [0] * (amount + 1)\n\n for i in range(1, amount + 1):\n ret[i] = 1 + min([ret[i - coin] if i - coin >= 0 else float(\"inf\") for coin in coins])\n return ret[amount] if ret[amount] != float(\"inf\") else -1","runtime":"613"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n d = {0: 0} # k: v means v is the fewest number of coins to make k\n for coin in coins:\n for k in range(amount):\n if k in d and (k + coin not in d or d[k + coin] > d[k] + 1):\n d[k + coin] = d[k] + 1\n return d[amount] if amount in d else -1","runtime":"633"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n dp = [None]*(amount+1)\n #print(dp)\n if amount ==0 :return 0\n if amount < coins[0] :return -1\n while coins[-1] > amount and len(coins)>0:\n coins.pop()\n if len(coins) == 0:\n return -1\n for c in coins:\n dp[c] = 1\n #print(dp)\n for i in range(coins[0]):\n dp[i] = -1\n #print(dp)\n for k in range(coins[0],amount+1):\n if dp[k] is not None:\n continue\n l = []\n for c in coins:\n if k-c >=0 and dp[k - c] != -1 :\n l.append(dp[k - c] +1)\n if len(l) > 0:\n dp[k] = min(l)\n else:\n dp[k] = -1\n return dp[amount]\n\n\n ","runtime":"633"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n '''\n coins = [a, b, c]\n m[i] = min(m[i - a], m[i - b], m[i - c])\n '''\n m = [-1 for i in range(amount + 1)]\n\n m[0] = 0\n for c in coins:\n if c < amount:\n m[c] = 1\n\n for i in range(1, amount + 1):\n candidates = [m[i - c] for c in coins if i - c >= 0 and m[i-c] != -1]\n if candidates:\n m[i] = min(candidates) + 1\n\n return m[amount]","runtime":"652"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n INF = amount + 1\n mnc = [INF] * (amount + 1)\n mnc[0] = 0\n \n for c in coins:\n for a in range(c, amount + 1):\n mnc[a] = min(mnc[a], 1 + mnc[a - c])\n \n return mnc[amount] if mnc[amount] < INF else -1\n \n ","runtime":"652"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n res = [0] * (amount + 1)\n res[0] = 1\n coins = sorted(coins)\n\n for coin in coins:\n for i in range(coin, amount + 1):\n if res[i-coin] == 0:\n continue\n elif i-coin == 0:\n res[i] = 1\n continue\n elif res[i] == 0:\n res[i] = res[i-coin] + 1\n continue\n\n res[i] = min(res[i-coin] + 1, res[i])\n\n return -1 if res[amount] == 0 else res[amount]","runtime":"672"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0 \n dp = [amount + 1] * (amount + 1)\n dp[0] = 0\n for c in coins:\n for i in range(c, len(dp)):\n dp[i] = min(dp[i], 1 + dp[i - c])\n if dp[-1] > amount:\n return -1\n return dp[-1]","runtime":"672"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0\n \n for c in coins:\n for i in range(c, amount + 1):\n dp[i] = min(dp[i], dp[i - c] + 1)\n return dp[-1] if dp[-1] != float('inf') else -1","runtime":"692"},{"code":"class Solution:\n\n \n\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n minc = float(inf)\n\n @cache\n def dfs(amt):\n if amt < 0:\n return -1\n if amt == 0:\n return 0\n\n n = coins\n tres = []\n for c in n:\n t = dfs(amt - c)\n if t != -1:\n tres.append(t)\n if len(tres) == 0:\n return -1\n return min(tres) + 1\n\n return dfs(amount)\n","runtime":"692"},{"code":"class Solution:\n def coinChange(self, coins: list[int], amount: int) -> int:\n # dp[i] := the minimum number Of coins to make up i\n dp = [0] + [amount + 1] * amount\n\n for coin in coins:\n for i in range(coin, amount + 1):\n dp[i] = min(dp[i], dp[i - coin] + 1)\n\n return -1 if dp[amount] == amount + 1 else dp[amount]","runtime":"731"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [amount + 1] * (amount + 1)\n dp[0] = 0\n\n for c in coins:\n for a in range(c, amount + 1):\n dp[a] = min(dp[a], dp[a - c] + 1)\n \n return dp[amount] if dp[amount] != (amount + 1) else -1","runtime":"731"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # init\n dp = [float(\"inf\")] * (amount + 1) # to return dp[amount] later\n dp[0] = 0\n # now build from the ground up\n for i in range(1, amount + 1):\n dp[i] = 1 + min([dp[i-c] for c in coins if i-c >= 0], default=float(\"inf\"))\n\n return dp[amount] if dp[amount] != float(\"inf\") else -1","runtime":"751"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount==0:\n return 0\n Bar=amount+1\n pool=[Bar for _ in range(amount+1)]\n pool[0]=0\n for p in range(1, amount+1):\n for c in coins:\n if p>=c:\n pool[p]=min(pool[p], 1+pool[p-c])\n return pool[-1] if pool[-1]<Bar else -1","runtime":"751"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')]*(amount+1)\n dp[0] = 0\n \n for coin in coins:\n for i in range(coin, amount+1):\n dp[i] = min(dp[i], dp[i-coin]+1)\n\n return dp[amount] if dp[amount] != float('inf') else -1\n ","runtime":"771"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # if not coins:\n # return 0\n\n # n = len(coins)\n\n # def helper(idx, amount):\n # if amount == 0:\n # return 0\n \n # if idx < n and amount > 0:\n # min_cost = float('inf')\n\n # for x in range(0, amount // coins[idx] + 1):\n\n # result = helper(idx + 1, amount - x * coins[idx])\n # if result != -1:\n # min_cost = min (min_cost, result + x)\n\n # return -1 if min_cost == float('inf') else min_cost\n # return -1 \n\n # return helper(0, amount)\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0\n\n for coin in coins:\n for x in range(coin, amount + 1):\n dp[x] = min(dp[x], dp[x - coin] + 1)\n \n return dp[amount] if dp[amount] != float('inf') else -1\n\n \n\n ","runtime":"771"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n dp = [float('inf')] * (amount +1)\n dp[0] = 0\n\n for coin in coins:\n for i in range(coin, amount +1):\n\n dp[i] = min(dp[i] , dp[i - coin] + 1)\n\n return dp[amount] if dp[amount] != float('inf') else -1\n\n\n\n \n","runtime":"790"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if not coins:\n return -1\n bar=amount+1\n pool=[bar for _ in range(amount+1)]\n pool[0]=0\n for p in range(1, amount+1):\n for c in coins:\n if p>=c:\n pool[p]=min(pool[p], pool[p-c]+1)\n return pool[-1] if pool[-1]<bar else -1","runtime":"790"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [amount + 1] * (amount + 1)\n dp[0] = 0\n\n for a in range(1, amount + 1):\n for c in coins:\n if a - c >= 0:\n dp[a] = min(dp[a], 1 + dp[a - c])\n \n return dp[amount] if dp[amount] != amount + 1 else -1","runtime":"810"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0\n for i in range(1, amount + 1):\n for c in coins:\n tgt = i - c\n if tgt >= 0:\n dp[i] = min(dp[i], dp[tgt]+1)\n return dp[-1] if dp[-1] != float('inf') else -1","runtime":"810"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [amount + 1] * (amount + 1)\n dp[0] = 0\n\n for i in range(1, amount + 1):\n for coin in coins:\n if (i - coin) >= 0:\n dp[i] = min(dp[i], 1 + dp[i - coin])\n\n return dp[amount] if dp[amount] != (amount + 1) else -1\n\n ","runtime":"830"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0\n for coin in coins: \n for i in range(coin, amount + 1):\n dp[i] = min(dp[i], dp[i-coin] + 1)\n return dp[amount] if dp[amount] != float('inf') else -1","runtime":"830"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')]*(amount+1)\n dp[0] = 0\n \n for a in range(1, amount+1):\n for c in coins:\n if a - c >= 0:\n dp[a] = min(dp[a], 1 + dp[a-c])\n return dp[amount] if dp[amount] != float('inf') else -1\n \n\n\n ","runtime":"850"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n dp = [inf for _ in range(amount+1)]\n dp[0] = 0\n for i in range(amount+1):\n for c in coins:\n if i-c >= 0:\n dp[i] = min(dp[i], 1 + dp[i-c])\n\n if dp[amount]==inf: return -1\n return dp[amount]","runtime":"850"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def solve(amt):\n if amt == 0:\n return 0\n\n if amt < 0:\n return -1\n\n ans = 10001\n for c in coins:\n t = solve(amt - c)\n if t != -1:\n ans = min(t + 1, ans)\n \n if ans == 10001:\n ans = -1\n\n return ans\n\n return solve(amount)\n","runtime":"869"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n MAX = amount + 1\n dp = [amount + 1] * (amount + 1)\n dp[0] = 0\n for a in range(1, amount + 1):\n for c in coins:\n if a - c >= 0:\n dp[a] = min(dp[a], dp[a - c] + 1)\n return dp[amount] if dp[amount] != amount + 1 else -1","runtime":"869"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [inf] * (amount + 1)\n dp[0] = 0\n for i in range(amount):\n for c in coins:\n if i + c <= amount:\n dp[i+c] = min(dp[i]+1, dp[i+c])\n if dp[-1] == inf:\n return -1\n return dp[-1]","runtime":"889"},{"code":"from functools import lru_cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @lru_cache(None)\n def recurse(amount):\n if amount == 0:\n return 0\n if amount < 0:\n return math.inf\n \n ans = math.inf\n for coin in coins:\n if amount >= coin:\n ans = min(ans, recurse(amount-coin)+1)\n return ans\n\n ans = recurse(amount)\n return ans if ans != float('inf') else -1\n\n\n","runtime":"889"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n dp = [float('inf') for _ in range(amount + 1)]\n dp[0] = 0\n\n for i in range(len(coins)):\n for j in range(len(dp)):\n if coins[i] <= j:\n dp[j] = min(dp[j], dp[j - coins[i]]+1)\n \n if dp[-1] == float('inf'):\n return -1\n else:\n return dp[-1]","runtime":"909"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n arr = [0] * (amount+1)\n for i in range(1,amount+1):\n arr[i] = -1\n for coin in coins: \n if i-coin >= 0 and arr[i-coin] != -1:\n if arr[i] == -1:\n arr[i] = arr[i-coin]+1\n else:\n arr[i] = min(arr[i],arr[i-coin]+1)\n return arr[-1]","runtime":"909"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n dp = [float(\"inf\")] * (amount+1)\n\n dp[0] = 0\n\n for i in range(1, n+1):\n for j in range(1, amount+1):\n if coins[i-1] <= j:\n dp[j] = min(dp[j], 1 + dp[j - coins[i-1]])\n\n return dp[amount] if dp[amount] != float(\"inf\") else -1","runtime":"928"},{"code":"'''\n Solution: DP TOP DOWN b/c we're trying to find (combinations of coins) fewest number of coins that make up that AMOUNT.\n \n IOW - Use dynamic programming b/c the problem can be resolve in subproblems and there are subproblems need to compute multiple times.\n \n\nDesign solution: \n \n 1. if coin is larger than the amount we're trying to reach, just use the previous coin[i-1] that make up that amount\n\n 2. dp[i][j] = fewest number of coins to reach amount j\n dp[i][j] = min(previous number of coins that made up amount j, dp[i][current amount j - coin[i]] + 1 use current coin type)\n \n 3. return dp[-1][-1] as it represent THE FINAL RESULT OF FEWEST NUMBER OF COINS THAT MAKE UP THAT AMOUNT\n \n \n Pseudocode:\n initialize the 2d dp grid using the amount as cols and coins as rows, all initialize as float(inf)\n \n #set up the inital dp cases\n dp[0][0] = 0\n \n #build the first row of dp first using the first coin, so that other coins can compare\n for j in range(amount + 1):\n if amount j >= first_coin:\n dp[0][j] = dp[0][j - first_coin] + 1\n \n for i in range(1, len(coins)):\n for j in range(amount + 1):\n if coins[i] > amount j we're trying to reach:\n dp[i][j] = use the previous coin type that made up amount j \n elif amount j is >= current type of coin[i]:\n #find the fewest number of coin that made up amount j either using current coin or previous number of coins\n dp[i][j] = min(previous number of coins that made up amount j, dp[i][current amount j - coin[i]] + 1)\n \n if last elm of dp is float(inf) that means the amount of money cannot be made up by any combination of the coins return -1\n \n return last elm of dp\n \n EX\n coins = [1,2,5] amount = 5\n j\n 0,1,2,3,4,5 -> each amount j to reach using each available kind of coins\n (0)1 [0,1,2,3,4,5]\n (1)2 [0,1,1,2,2,3]\n (2)5 [0,1,1,2,2,1]\n |\n coins i\n \n \n EX2:\n coins = [2], amount = 3\n \n 0,1,2,3 \n 0(2)[0,f,1,f]\n \n since last of elm of dp is f so return -1\n \n \n coins = [1,2] amount = 2\n 0 1 2\n 1 [0 1 2]\n 2 [0 1 1]\n'''\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[float('inf')] * (amount + 1) for _ in range(len(coins))]\n dp[0][0] = 0\n\n for amt in range(amount + 1):\n if coins[0] <= amt:\n dp[0][amt] = dp[0][amt - coins[0]] + 1\n\n for i in range(1, len(coins)):\n for amt in range(amount + 1):\n if coins[i] <= amt:\n dp[i][amt] = min(dp[i-1][amt], dp[i][amt - coins[i]] + 1)\n else:\n dp[i][amt] = dp[i-1][amt]\n\n res = dp[-1][-1]\n\n if res == float(\"inf\"):\n return -1\n\n return res \n\n \n \n\n\n\n ","runtime":"928"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n if amount in coins:\n return 1\n\n dp = [float('inf')] * (amount + 1)\n for i in range(1, amount+1):\n if i in coins:\n dp[i] = 1\n continue\n\n min_value = float('inf')\n for value in coins:\n if i - value < 0:\n continue\n min_value = min(min_value, dp[i-value])\n\n if min_value < float('inf'):\n dp[i] = 1 + min_value\n if dp[-1] < float('inf'):\n return dp[-1]\n return -1\n","runtime":"948"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n dp = [-1] * (amount + 1)\n dp[0] = 0\n\n for i in range(1, amount + 1):\n num = float('inf')\n for c in coins:\n if i - c >= 0 and dp[i - c] != -1:\n num = min(num, dp[i - c] + 1)\n\n if num != float('inf'):\n dp[i] = num\n\n print(dp)\n return dp[-1]\n","runtime":"948"},{"code":"from functools import lru_cache\n\nclass Solution:\n def coinChange(self, coins: list[int], amount: int) -> int:\n # If amount is 0, no coins are needed.\n if amount == 0:\n return 0\n \n # Memoization using lru_cache\n @lru_cache(None)\n def dp(rem_amount):\n # Base cases\n if rem_amount < 0:\n return float('inf') # No valid solution\n if rem_amount == 0:\n return 0 # No coins needed when amount is 0\n \n # Try every coin and choose the one that gives the minimum number of coins\n min_coins = float('inf')\n for coin in coins:\n min_coins = min(min_coins, dp(rem_amount - coin) + 1)\n \n return min_coins\n \n # Get the result from the dp function\n result = dp(amount)\n return result if result != float('inf') else -1\n","runtime":"968"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n coins.sort()\n dp = [amount+1 for x in range(amount+1)]\n\n for i in coins:\n if i <= amount:\n dp[i] = 1\n\n for value in range(len(dp)):\n for coin in coins:\n if value-coin < 0 or coin > amount:\n continue\n dp[value] = min(dp[value],dp[value-coin]+1)\n\n return -1 if dp[amount] > amount else dp[amount]","runtime":"968"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n prev = [0]*(amount+1)\n\n for i in range(amount+1):\n\n if i % coins[0] == 0:\n prev[i] = i // coins[0]\n\n else:\n prev[i] = int(1e9)\n\n\n for i in range(1,n):\n cur = [0]*(amount+1)\n for j in range(amount+1):\n\n notpick = prev[j]\n pick = int(1e9)\n\n if coins[i] <= j:\n pick = 1 + cur[j-coins[i]]\n\n cur[j] = min(pick,notpick)\n\n prev = cur\n\n if prev[amount] == int(1e9):\n return -1\n\n return prev[amount]\n ","runtime":"988"},{"code":"from collections import deque\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {0: 0}\n for c in coins:\n dp[c] = 1\n \n for i in range(amount + 1):\n if i in dp: continue\n min_steps = float('inf')\n for c in coins:\n if (i - c) in dp:\n min_steps = min(min_steps, dp[i - c])\n if min_steps != float('inf'): dp[i] = min_steps+1\n # print(dp)\n \n return dp[amount] if amount in dp else -1\n \n\n # if amount == 0: return 0\n # queue = deque([(amount, 0)])\n # visited = [False] * (amount+1)\n # while queue:\n # # print(queue)\n # curr, steps = queue.popleft()\n # # If BFS, the first element reaching 0 must be the solution. \n # if curr == 0: return steps\n # if visited[curr]: continue\n # visited[curr] = True\n\n # for coin in coins:\n # if curr - coin >= 0 and not visited[curr - coin]:\n # queue.append((curr - coin, steps + 1))\n\n # return -1","runtime":"988"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n @cache\n def dp(a):\n if a == 0:\n return 0\n elif a < 0:\n return -1\n \n minc = float(\"inf\")\n\n for c in coins:\n \n num = dp(a-c) + 1\n if num != 0:\n minc = min(minc, num)\n\n return minc if minc != float(\"inf\") else -1\n \n return dp(amount)\n \n ","runtime":"1007"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n minWays = [float('inf')] * (amount + 1)\n minWays[0] = 0\n\n for amt in range(len(minWays)):\n for coin in coins:\n if amt + coin < len(minWays):\n minWays[amt + coin] = min(minWays[amt + coin], minWays[amt] + 1)\n \n return minWays[-1] if minWays[-1] != float('inf') else -1","runtime":"1007"},{"code":"from functools import lru_cache\n\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n @cache\n def dfs(rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n min_cost = float('inf')\n for coin in coins:\n res = dfs(rem - coin)\n if res != -1:\n min_cost = min(min_cost, res + 1)\n return min_cost if min_cost != float('inf') else -1\n\n return dfs(amount)","runtime":"1027"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {0:0}\n for coin in coins:\n dp[coin] = 1\n \n for i in range(1, amount+1):\n minCoins = inf\n for coin in coins:\n if coin <= i and i-coin in dp:\n minCoins = min(minCoins, 1+dp[i-coin])\n dp[i] = minCoins\n \n if dp[amount] == inf:\n return -1\n return dp[amount]","runtime":"1027"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n m, n = len(coins), amount\n f = [[inf] * (n + 1) for _ in range(m + 1)]\n f[0][0] = 0\n for i, x in enumerate(coins, 1):\n for j in range(n + 1):\n f[i][j] = f[i - 1][j]\n if j >= x:\n f[i][j] = min(f[i][j], f[i][j - x] + 1)\n return -1 if f[m][n] >= inf else f[m][n]","runtime":"1047"},{"code":"\"\"\"\n\nState: current index and amount\n\nRecurrence Relation: dp(i, a) = min(dp(i, a - coins[i]) + 1, dp(i + 1, a))\n\nBase Case: i == len(coins) or amount <= 0\n\n\"\"\"\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n n = len(coins)\n dp = [[inf] * (amount + 1) for _ in range(n)]\n\n for r in range(len(dp)):\n dp[r][0] = 0\n for i in range(n):\n for a in range(1, amount + 1):\n if a < coins[i] and i == 0:\n continue\n elif a < coins[i]:\n dp[i][a] = dp[i - 1][a]\n else:\n dp[i][a] = min(dp[i][a - coins[i]] + 1, dp[i - 1][a])\n return dp[-1][-1] if dp[-1][-1] != inf else -1","runtime":"1047"},{"code":"# from functools import lru_cache\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {c:1 for c in coins}\n def dfs(i):\n if i in memo:\n return memo[i]\n if i == 0:\n return 0\n result = float(\"inf\")\n for coin in coins:\n if coin < i:\n result = min(result, dfs(i-coin))\n memo[i] = result + 1\n return memo[i]\n res = dfs(amount)\n return res if res != float(\"inf\") else -1\n \n \n \n # @cache\n # def dp(change):\n # if change < 0:\n # return -1\n # if change == 0:\n # return 0\n # min_cost = float('inf')\n # for coin in coins:\n # res = dp(change-coin)\n # if res != -1:\n # min_cost = min( min_cost,\n # res+1)\n # return min_cost if min_cost != float('inf') else -1\n # return dp(amount)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # @lru_cache(None)\n # def dp(change):\n # if change < 0:\n # return -1\n # if change == 0:\n # return 0\n # min_cost = float('inf')\n # for i in range(len(coins)):\n # res = dp(change - coins[i])\n # if res != -1:\n # min_cost = min(min_cost, res+1)\n # return -1 if min_cost == float('inf') else min_cost\n \n # return dp(amount)\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # @lru_cache(None)\n # def dfs(remaining):\n # if remaining == 0:\n # return 0\n # if remaining < 0:\n # return -1\n # minCost = float('inf')\n # for coin in coins:\n # res = dfs(remaining-coin)\n # if res != -1:\n # minCost = min(minCost, res+1)\n # return minCost if minCost != float('inf') else -1\n # return dfs(amount)\n \n\n \n \n \n\n\n ","runtime":"1066"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n cache = {0:0}\n for am in range(1, amount + 1):\n cache[am] = min([cache.get(am - coin, float('inf')) for coin in coins]) + 1\n return cache[amount] if cache[amount] != float('inf') else -1\n\n \n \n\n\n","runtime":"1066"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [-1]*(amount+1)\n dp[0]=0\n for i in range(1,amount+1): \n for j in range(len(coins)):\n if i-coins[j]>=0 and dp[i-coins[j]]!=-1:\n if dp[i]==-1:\n dp[i]=dp[i-coins[j]]+1\n dp[i] = min(dp[i],dp[i-coins[j]]+1)\n return dp[-1]","runtime":"1086"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[float('inf')] * (amount+1) for _ in range(len(coins)+1)]\n n = len(coins)\n for i in range(n+1): \n dp[i][0] = 0\n # print(dp)\n for i in range(1, amount+1): \n minumum = float('inf')\n for j in range(len(coins)): \n coin = coins[j]\n if i-coin >=0: \n dp[j][i] = dp[n][i-coin]+1\n minumum = min(minumum, dp[j][i])\n \n dp[n][i] = minumum\n # print(dp)\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\n[\n [0, 1, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf], \n [0, inf, 1, inf, inf, inf, inf, inf, inf, inf, inf, inf], \n [0, inf, inf, inf, inf, 1, inf, inf, inf, inf, inf, inf], \n [0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf]]\n\n","runtime":"1086"},{"code":"# dp, bottom-up, cache as dict\nclass Solution:\n def coinChange(self, coins, amount):\n # min number of coins needed to get target amount (equal to the index)\n # \"anmount + 1\" an imposbile value stays when the last element of min_coins was not modified\n min_coins = {k: amount + 1 for k in range(amount + 1)}\n min_coins[0] = 0 # no coins needed to get 0\n\n for coin in coins: # check every coin\n for index in range(coin, amount + 1): # check each 'min_coins' index\n # choose current amount of coins or get ammount without current coin and add 1\n min_coins[index] = min(min_coins.get(index), min_coins.get(index - coin) + 1)\n \n if (amount in min_coins and # if amount exists and\n min_coins[amount] < amount + 1): # the value is less than impossible value\n return min_coins[amount] # valid combination\n else:\n return -1","runtime":"1106"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def dp(cache, amountRem):\n if amountRem == 0:\n return 0\n if amountRem in cache:\n return cache[amountRem]\n minWays = math.inf\n for coin in coins:\n if coin <= amountRem:\n minWays = min(minWays, 1 + dp(cache, amountRem-coin))\n cache[amountRem] = minWays\n return minWays\n \n memo = collections.defaultdict(int)\n op = dp({},amount)\n if op == math.inf:\n return -1\n return op","runtime":"1106"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memory = {0: 0}\n def dfs(total):\n if total in memory:\n return memory[total]\n num_coins = float('inf')\n for coin in coins:\n if total - coin >= 0:\n num_coins = min(dfs(total - coin), num_coins)\n memory[total] = num_coins + 1\n return num_coins + 1\n dfs(amount)\n if memory[amount] == float('inf'):\n return -1\n return memory[amount]","runtime":"1126"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n # def recurr(coins, idx, t, dp = None):\n\n # if not dp:\n # dp = [-1 for i in range(t+1)]\n\n # if idx == 0: \n # if t % coins[0] == 0: \n # dp[t] = int(t / coins[0])\n # return dp[t]\n\n\n # not_pick = recurr(coins, idx - 1, t, dp)\n\n # pick = float(\"inf\")\n\n # if t - coins[idx] >= 0:\n # if dp[t - coins[idx]] != -1:\n # pick = 1 + dp[t - coins[idx]]\n # else:\n # pick = 1 + recurr(coins, idx, t - coins[idx], dp)\n \n # dp[t] = min(pick, not_pick)\n # return dp[t]\n \n # return recurr(coins, len(coins) - 1, amount) \n\n dp = [float(\"inf\") for i in range(amount+1)]\n\n for t in range(amount + 1):\n if t % coins[0] == 0:\n dp[t] = t // coins[0]\n \n for i in range(1, len(coins)):\n for j in range(amount + 1):\n not_pick = dp[j]\n\n pick = float(\"inf\")\n\n if j >= coins[i]:\n pick = 1 + dp[j-coins[i]]\n\n dp[j] = min(pick, not_pick)\n \n if dp[amount] != float(\"inf\"):\n return dp[amount]\n else:\n return -1\n\n\n\n \n ","runtime":"1126"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # brute force approach here is a decision tree where at each step, we can pick from n coins. 2^n. and then for the multiple possilbe solutions, we pick the smallest one\n memo = {}\n def dfs(currSum):\n if currSum in memo:\n return memo[currSum]\n if currSum > amount:\n return float(\"inf\")\n if currSum == amount:\n # how many coins does it take to get from curr amount to amount?\n return 0\n minCoins = float('inf')\n for coin in coins:\n minCoins = min(minCoins, 1 + dfs(currSum + coin))\n memo[currSum] = minCoins \n return minCoins\n \n res = dfs(0)\n return res if res != float('inf') else -1","runtime":"1145"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n cache = {}\n\n def min_n_coins(amount_rest):\n if amount_rest in cache:\n return cache[amount_rest]\n\n if amount_rest == 0:\n return 0\n if amount_rest <0:\n return float(\"inf\")\n else:\n min_c = float(\"inf\")\n for coin in coins:\n # list the possibilities\n min_c = min(min_c, 1 + min_n_coins(amount_rest-coin))\n \n cache[amount_rest] = min_c\n return min_c\n \n min_amount = min_n_coins(amount)\n return -1 if min_amount == float(\"inf\") else min_amount\n\n","runtime":"1145"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n '''\n 0 to 5\n [0,1,1,2,2,1]\n\n [0,-1,1,-1]\n '''\n dp = [[0 for _ in range(amount+1)] for _ in range(len(coins)+1)]\n\n for j in range(len(dp[0])):\n dp[0][j] = float('inf')\n if j%coins[0]==0:\n dp[1][j] = j//coins[0]\n else:\n dp[1][j] = float('inf')\n \n dp[0][0] = 0\n\n for i in range(2, len(dp)):\n for j in range(1, len(dp[0])):\n if coins[i-1] <= j:\n dp[i][j] = min (dp[i-1][j], dp[i][j-coins[i-1]] + 1)\n else:\n dp[i][j] = dp[i-1][j]\n\n\n val = dp[len(coins)][amount] \n if val != float('inf'):\n return val\n return -1","runtime":"1165"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp={}\n dp[0]=0\n for i in range(amount+1):\n for j in range(len(coins)):\n if i- coins[j] in dp:\n if i in dp:\n dp[i]= min(dp[i], dp[i-coins[j]]+1)\n else:\n dp[i]= dp[i-coins[j]]+1\n # return dp[2]\n if amount in dp:\n return dp[amount]\n return -1\n \n ","runtime":"1165"},{"code":"class Solution:\n def find(self,coins:List[int],n:int,amount:int,dp:List[List[int]])->int:\n if n==0:\n if amount%coins[n]==0:\n return amount//coins[n]\n else:\n return float('inf')\n if dp[n][amount]==-1:\n not_t=0+self.find(coins,n-1,amount,dp)\n take=float('inf')\n if coins[n]<=amount:\n take=1+self.find(coins,n,amount-coins[n],dp)\n dp[n][amount]=min(not_t,take)\n return dp[n][amount]\n else:\n return dp[n][amount]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n n=len(coins)\n dp = [[-1 for _ in range(amount + 1)] for _ in range(n)]\n ans=self.find(coins,n-1,amount,dp)\n if ans>=float('inf'):\n return -1\n else:\n return ans\n\n\n\n ","runtime":"1185"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n coins = sorted(coins)\n mem = {}\n\n def getCount(amount):\n nonlocal coins\n\n if amount == 0:\n return 0\n if amount < 0:\n return -1\n \n if amount in mem:\n return mem[amount]\n mincount = math.inf\n for c in coins[::-1]:\n count = getCount(amount-c)\n if count != -1:\n mincount = min(count+1, mincount)\n if mincount != math.inf:\n mem[amount] = mincount\n else:\n mem[amount] = -1\n\n return mem[amount]\n \n return getCount(amount)\n","runtime":"1185"},{"code":"# top down recursive memoization\n # we want to find min number of coins to make up amount\n # pass current amount\n \n # recursion: (amount)\n # base case: amount == 0\n # reached \n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n def coinChangeRecursive(amount):\n if amount == 0:\n return 0\n if amount < 0:\n return float('inf')\n if amount in memo:\n return memo[amount]\n \n min_count = float('inf')\n for coin in coins:\n min_count = min(min_count, coinChangeRecursive(amount - coin) + 1)\n \n memo[amount] = min_count\n return min_count\n \n res = coinChangeRecursive(amount)\n return res if res < float('inf') else -1\n\n ","runtime":"1204"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[float(\"inf\")] * (amount + 1) for _ in range(len(coins) + 1)]\n\n for i in range(len(coins)+1):\n dp[i][0] = 0\n\n for i in range(len(coins) + 1):\n for j in range(amount + 1):\n if coins[i-1] <= j:\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\n else:\n dp[i][j] = dp[i-1][j]\n \n return dp[i][j] if dp[i][j] != float(\"inf\") else -1\n\n \n ","runtime":"1204"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0\n for i in range(1,amount + 1):\n for coin in coins:\n if i - coin >= 0 and dp[i - coin] != float('inf'):\n dp[i] = min(dp[i],1 + dp[i - coin])\n if dp[-1] == float('inf'):\n return -1\n else:\n return dp[-1]\n\n ","runtime":"1224"},{"code":"from functools import lru_cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @lru_cache(None)\n def dfs(i):\n if i < 0:\n return -1\n if i == 0:\n return 0\n # start from idx 1, calculate the min cnt to reach idx i\n min_cost = float(\"Inf\")\n for coin in coins:\n val = dfs(i-coin)\n if val != -1:\n min_cost = min(min_cost, dfs(i-coin)+1)\n if min_cost == float(\"Inf\"):\n return -1\n \n return min_cost\n \n return dfs(amount)\n\n \n \n\n\n \n\n\n","runtime":"1224"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n L = [0] * (amount + 1)\n\n for N in range(1, amount + 1):\n curr = []\n for coin in coins:\n if N - coin >= 0 and L[N - coin] != -1:\n curr.append(L[N - coin])\n L[N] = 1 + min(curr) if curr != [] else -1\n \n return L[amount]\n\n","runtime":"1244"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n dp = {}\n def dfs(rem):\n if rem == 0:\n return 0\n \n if rem < 0:\n return float(\"inf\")\n\n if rem in dp:\n return dp[rem]\n\n minNumCoins = float(\"inf\")\n for i in range(len(coins)):\n minNumCoins = min(minNumCoins, 1 + dfs(rem - coins[i]))\n \n dp[rem] = minNumCoins\n return minNumCoins\n \n total = dfs(amount)\n\n if math.isinf(total):\n return -1\n \n return total","runtime":"1244"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # n=amount\n \n # if not n: return 0\n # coins = [c for c in coins if c<=n]\n # if not coins: return -1\n # if len(coins) < 2:\n # ret = n // coins[0]\n # return -1 if n-ret*coins[0] else ret\n # if n & 1 and not any(c & 1 for c in coins): return -1\n \n if amount ==0:\n return 0\n if amount < min(coins):\n return -1\n di = {a: 10**6 for a in range(1, amount + 1)}\n di[0] = 0\n\n for a in range(1,amount+1):\n \n for c in coins:\n # print(a,c)\n # print(di)\n # print()\n if a-c ==0:\n di[a] = 1\n elif a-c >0:\n di[a] = min(di[c]+di[a-c],di[a])\n else:\n continue\n return -1 if di[amount] == 10**6 else di[amount]\n ","runtime":"1264"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp=[[inf]*(amount+1) for _ in range(len(coins)+1)]\n for i in range(len(coins)+1):dp[i][0]=0\n for i in range(1,len(coins)+1):\n for j in range(amount+1):\n if coins[i-1]<=j:\n dp[i][j]=min(dp[i][j],1+dp[i][j-coins[i-1]],dp[i-1][j])\n else:dp[i][j]=min(dp[i][j],dp[i-1][j])\n return dp[len(coins)][amount] if dp[len(coins)][amount]!=inf else -1","runtime":"1264"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins = sorted(coins, reverse=True)\n\n # f(i, rem) = min(1 + f(j, rem-i) for j in i:len(arr))\n def minCoins(rem: int, dp: Dict[Tuple[int,int], int]) -> int:\n if rem == 0:\n return 0\n elif rem < 0:\n return float('inf')\n if rem in dp:\n return dp[rem]\n dp[rem] = float('inf')\n for coin in coins:\n dp[rem] = min(dp[rem], 1 + minCoins(rem-coin, dp))\n return dp[rem]\n \n ans = minCoins(amount, {})\n return ans if ans != float('inf') else -1","runtime":"1283"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float(\"inf\")]*(amount + 1)\n dp[0] = 0\n\n for i in range(1, amount+1):\n for c in coins:\n if (i - c >= 0) and dp[i-c] != float(\"inf\"):\n dp[i] = min(dp[i], dp[i-c]+1)\n\n if dp[amount] == float(\"inf\"):\n return -1\n return dp[amount]","runtime":"1283"},{"code":"from collections import defaultdict\r\nclass Solution:\r\n def coinChange(self, coins: List[int], amount: int) -> int:\r\n memo = defaultdict(int)\r\n minCoin = min(coins)\r\n def dp(i):\r\n if i == 0:\r\n return 0\r\n if i < minCoin:\r\n return float(\"inf\")\r\n if i in memo:\r\n return memo[i]\r\n acc = float(\"inf\")\r\n for j in range(len(coins)):\r\n if i >= coins[j]:\r\n acc = min(acc, 1 + dp(i - coins[j]))\r\n memo[i] = acc\r\n return memo[i]\r\n \r\n res = dp(amount)\r\n if res == float(\"inf\"):\r\n return -1\r\n return dp(amount)\r\n ","runtime":"1303"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def tab():\n dp = [inf] * (amount + 1)\n dp[0] = 0\n for i in range(1, amount + 1):\n for coin in coins:\n if coin == i:\n dp[i] = 1\n break\n elif coin > i:\n continue\n else:\n dp[i] = min(dp[i], 1 + dp[i-coin])\n return -1 if dp[amount] == inf else dp[amount]\n \n def memo(index, remain):\n if remain < 0:\n return inf\n if remain == 0:\n return 0\n if index == len(coins):\n return inf\n if remain in cache:\n return cache[remain]\n #min_coin = inf\n \n take = 1 + memo(index, remain - coins[index])\n skip = memo(index + 1, remain)\n min_coin = min(take, skip)\n #return min_coin\n cache[remain] = min_coin\n return cache[remain]\n\n #return tab()\n cache = {}\n #min_coin = memo(0, amount)\n #return -1 if min_coin == inf else min_coin\n\n @lru_cache(None)\n def dfs2(index, rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n min_cost = float('inf')\n for i in range(index, len(coins)):\n take = dfs(i, rem - coins[i])\n if take != -1:\n min_cost = min(min_cost, take + 1)\n skip = dfs(i + 1 , rem)\n if skip != -1:\n min_cost = min(min_cost, skip) \n return min_cost if min_cost != float('inf') else -1\n \n #return dfs2(0, amount)\n\n \n memo = {}\n\n def dfs(rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n if rem in memo:\n return memo[rem]\n min_cost = float('inf')\n for coin in coins:\n res = dfs(rem - coin)\n if res != -1:\n min_cost = min(min_cost, res + 1)\n memo[rem] = min_cost\n return memo[rem] if min_cost != float('inf') else -1\n\n return dfs(amount)","runtime":"1303"},{"code":"class Solution:\n def f(self,coins, amount,i,n,dp):\n if(i==n and amount==0):\n return 0\n if amount<0: return float('inf')\n if i==n: return float('inf')\n if(dp[i][amount]!=None): return dp[i][amount]\n not_take=self.f(coins,amount,i+1,n,dp)\n take=float('inf')\n if(coins[i]<=amount) :\n take=1+self.f(coins,amount-coins[i],i,n,dp)\n dp[i][amount]=min(take,not_take)\n return dp[i][amount]\n def coinChange(self, coins: List[int], amount: int) -> int:\n n=len(coins)\n dp = [[None] * (amount + 1) for _ in range(n)]\n ans=self.f(coins,amount,0,n,dp)\n if ans==float('inf'):\n return -1\n return ans\n ","runtime":"1362"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {}\n dp[0] = 0\n for i in range(amount):\n for c in coins:\n if i + 1 - c in dp:\n dp[i + 1] = min(dp.get(i + 1, amount + 1), dp[i + 1 - c] + 1)\n return dp.get(amount, -1)","runtime":"1362"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {}\n def solve(curr):\n if curr > amount:\n return 10**18\n if curr==amount:\n return 0\n if curr in dp:\n return dp[curr]\n\n dp[curr] = 10**18\n # print(dp)\n for i in range(len(coins)):\n s = solve(curr+coins[i])\n if s!= -1:\n dp[curr] = min(dp[curr], 1+s)\n if dp[curr] == 10**18:\n return -1\n return dp[curr]\n # print(dp)\n return solve(0)","runtime":"1382"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n sorted_coins = sorted(set(coins), reverse=True)\n memo = {k: 1 for k in sorted_coins} | {0: 0}\n return self.coinChangeHelper(sorted_coins, amount, memo)\n \n def coinChangeHelper(self, coins, amount, memo) -> int:\n \"\"\"coinChange returns fewest number of coins that make up amount.\"\"\"\n if amount in memo:\n return memo[amount]\n if coins[0] > amount:\n coins = [c for c in coins if c <= amount]\n fewest = math.inf\n for coin in coins:\n current = self.coinChangeHelper(coins, amount - coin, memo)\n if current != -1:\n memo[amount - coin] = current\n fewest = min(fewest, 1 + current)\n else:\n memo[amount - coin] = -1\n #rint(coins, amount, fewest)\n \n if fewest != math.inf:\n memo[amount] = fewest\n return fewest\n return -1\n ","runtime":"1382"},{"code":"class Solution:\n def coinChangeHelper(self, coins, amount, cdict):\n if amount < 0:\n return sys.maxsize\n elif amount == 0:\n return 0\n elif amount in cdict:\n return cdict[amount]\n else:\n res = sys.maxsize\n for coin in coins:\n if coin > amount:\n continue\n tempres = self.coinChangeHelper(coins, amount - coin, cdict)\n if tempres != sys.maxsize:\n cdict[amount - coin] = tempres \n tempres += 1\n res = min(res, tempres)\n cdict[amount] = res \n return res\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n cdict = {}\n for coin in coins:\n cdict[coin] = 1\n \n res = self.coinChangeHelper(coins, amount, cdict)\n if res == sys.maxsize:\n return -1\n else:\n return res\n ","runtime":"1402"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n rows, cols = len(coins) + 1, amount + 1\n dp = [[0 for _ in range(cols)] for _ in range(rows)]\n\n for col in range(1, cols):\n dp[0][col] = float('inf')\n\n for i in range(1, rows):\n for j in range(1, cols):\n dp[i][j] = dp[i - 1][j]\n if j >= coins[i - 1]:\n dp[i][j] = min(dp[i][j], dp[i][j - coins[i - 1]] + 1)\n \n return -1 if dp[rows - 1][cols - 1] == float('inf') else dp[rows - 1][cols - 1]\n\n\n\n# knapsack\n# dp[i][j]: fewest number of coins to make up j amount using first i items\n\n# base case:\n# dp[0][any]: max infinite -> for future finding minimum for any amount (exclude dp[0][0])\n# dp[any][0]: 0 -> already find the minimum (include dp[0][0])\n\n# induction rule:\n# dp[i][j] = min{\n# dp[i][j - coins[i]] + 1 take it (j >= coins[i])\n# dp[i - 1][j] not take it\n# }\n\n\n","runtime":"1402"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def f(memo, n):\n if memo[n]:\n return memo[n]\n if n==0:\n return 0\n memo[n] = float(\"inf\")\n for coin in coins:\n if n-coin >= 0:\n memo[n] = min(memo[n], f(memo, n-coin)+1)\n return memo[n]\n\n memo = collections.defaultdict(int)\n tmp = f(memo, amount)\n\n return tmp if tmp != float(\"inf\") else -1\n ","runtime":"1421"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n x = [[1e9 for i in range(len(coins))] for j in range(amount + 1)]\n for i in range(len(coins)):\n x[0][i] = 0\n\n for i in range(amount+1):\n for j in range(len(coins)):\n x[i][j] = min(x[i-coins[j]][j] + 1 if i-coins[j] >= 0 else 1e9, x[i][j-1])\n \n output = x[amount][len(coins)-1]\n return output if output < 1e9 else -1","runtime":"1421"},{"code":"class Solution:\n def coinChange(self, cs: List[int], amount: int) -> int:\n cs.sort(reverse=True)\n\n @cache\n def solve(x, i):\n if x < 0 or i >= len(cs):\n return float('inf')\n elif x == 0:\n return 0\n return min(1 + solve(x-cs[i], i), solve(x, i+1))\n \n result = solve(amount, 0)\n return result if result < float('inf') else -1 \n\n ","runtime":"1441"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n w = amount \n n = len(coins)\n\n dp = [[float(\"inf\")]*(w+1) for _ in range(n+1)]\n\n for i in range(n+1):\n dp[i][0] = 0\n\n for j in range(1,w+1):\n if j%coins[0]==0:\n dp[1][j] = j//coins[0]\n \n \n for i in range(1,n+1):\n for j in range(1,w+1):\n not_take = dp[i-1][j]\n take = float(\"inf\")\n if coins[i-1]<=j:\n take = dp[i][j-coins[i-1]]+1\n dp[i][j] = min(take,not_take)\n\n if dp[n][w]!=float(\"inf\"):\n return dp[n][w]\n else:\n return -1\n \n\n\n\n\n","runtime":"1441"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n dp = {}\n def dfs(total = 0):\n \n mn = float(\"inf\") # by default is impossible to reach amount if no changes\n\n if total in dp:\n return dp[total]\n\n if total == amount:\n return 0\n\n if total > amount:\n return float(\"inf\") # impossible\n\n for c in coins:\n\n reached = dfs( total + c)\n mn = min(mn, reached + 1)\n\n dp[total] = mn\n return dp[total]\n\n res = dfs()\n return -1 if res == float(\"inf\") else res \n\n\n ","runtime":"1461"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp=[[float('inf') for _ in range(amount+1)] for _ in range(len(coins))]\n\n for i in range(len(coins)):\n dp[i][0]=0\n \n for k in range(1,amount+1):\n if k-coins[0]>=0:\n dp[0][k]=1+dp[0][k-coins[0]]\n\n for i in range(1,len(coins)):\n for k in range(1,amount+1):\n dp[i][k]=dp[i-1][k]\n if k-coins[i]>=0:\n dp[i][k]=min(dp[i][k],1+dp[i][k-coins[i]])\n \n mincoins=float('inf')\n for i in range(len(coins)):\n mincoins=min(mincoins,dp[i][amount])\n \n if mincoins>10**6:\n return -1\n return mincoins\n \n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n x=[[10**8 for _ in range(amount+1)] for _ in coins]\n\n for i in range(len(coins)):\n x[i][0]=0\n k=0\n while k*coins[0]<=amount:\n x[0][k*coins[0]]=k\n k+=1\n \n for i in range(1,len(coins)):\n for amt in range(amount+1):\n x[i][amt]=x[i-1][amt]\n if amt-coins[i]>=0:\n x[i][amt]=min(x[i][amt],x[i][amt-coins[i]]+1)\n #for k in range(amt//coins[i]+1):\n # x[i][amt]=min(x[i][amt],x[i-1][amt-k*coins[i]]+k)\n\n if x[-1][amount]>amount:\n return -1\n else:\n return x[-1][amount]\n \n \n coins.sort()\n coins.reverse()\n x=[{} for _ in coins]\n\n for m in range(0,amount+1):\n if m*coins[0]<=amount:\n x[0][m*coins[0]]=m\n else:\n break\n\n for j in range(1,len(coins)):\n for qty in x[j-1]:\n for l in range(0,amount+1):\n if qty+l*coins[j]>amount:\n break\n if qty+l*coins[j] not in x[j]:\n x[j][qty+l*coins[j]]=l+x[j-1][qty]\n else:\n x[j][qty+l*coins[j]]=min(l+x[j-1][qty],x[j][qty+l*coins[j]])\n \n print(x)\n\n out=10**6\n for elem in x:\n if amount in elem:\n out=min(out,elem[amount])\n if out>10**5:\n return -1\n else:\n return out\n \n\n\n\n","runtime":"1461"},{"code":"class Solution:\n \n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {}\n dp[0] = 0\n \n for cur_amt in range(1, amount + 1):\n \n \n min_num_coins = float(\"inf\")\n \n for cur_coin in coins:\n if cur_amt - cur_coin < 0:\n continue\n else:\n if dp[int(cur_amt - cur_coin)] == -1:\n continue\n else:\n min_num_coins = min(min_num_coins, 1 + dp[int(cur_amt - cur_coin)])\n \n if min_num_coins == float(\"inf\"):\n dp[int(cur_amt)] = -1\n else:\n dp[int(cur_amt)] = min_num_coins\n \n return dp[amount]\n \n\n # def coinChange(self, coins: List[int], amount: int) -> int:\n # self.memo = dict()\n # return self.dp(coins, amount)\n \n\n # def dp(self, coins, amount):\n # # for the given amount, what's the minimum # of coins needed to reach this amount\n \n # if amount == 0:\n # return 0\n \n # if amount < 0:\n # return -1\n \n \n # if amount in self.memo:\n # return self.memo[amount]\n \n # min_coins_needed = float('inf')\n # for cur_coin in coins:\n # num_coins_remaining = self.dp(coins, amount - cur_coin)\n # if num_coins_remaining != -1:\n # min_coins_needed = int(min(1 + num_coins_remaining, min_coins_needed))\n \n # if min_coins_needed == float(\"inf\"):\n # self.memo[amount] = -1\n # return -1\n # else:\n # self.memo[amount] = min_coins_needed\n # return self.memo[amount]\n \n \n \n ","runtime":"1480"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def solve(amount):\n if amount== 0:\n return 0\n if amount< 0:\n return float('inf')\n \n if dp[amount]!= -1:\n return dp[amount]\n \n mini= float('inf')\n for i in range(len(coins)):\n ans= solve(amount- coins[i])\n if ans!= float('inf'):\n mini= min(mini, 1+ans)\n dp[amount]= mini\n return mini\n \n dp = [-1] * (amount + 1)\n ans= solve(amount)\n\n if ans== float('inf'):\n return -1\n return ans\n\n \n \n \n \n \n\n\n","runtime":"1480"},{"code":"class Solution:\n def _coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[float(\"inf\")] * (amount + 1) for _ in range(len(coins) + 1)]\n\n for i in range(len(coins)+1):\n dp[i][0] = 0\n\n for i in range(1, len(coins) + 1):\n for j in range(1, amount + 1):\n if coins[i-1] <= j:\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\n else:\n dp[i][j] = dp[i-1][j]\n \n return dp[len(coins)][amount] if dp[len(coins)][amount] != float(\"inf\") else -1\n \n def coinChange(self, coins: List[int], amount: int) -> int:\n\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\n \n def dfs(idx: int, remaining_amount: int) -> int:\n # Base case: if the amount is zero, we found a valid solution (0 coins more needed)\n if remaining_amount == 0:\n return 0\n \n if idx == len(coins) or remaining_amount < 0:\n return float(\"inf\")\n\n if dp[idx][remaining_amount] != -1:\n return dp[idx][remaining_amount]\n\n include = float(\"inf\")\n if coins[idx] <= remaining_amount:\n include = 1 + dfs(idx, remaining_amount - coins[idx])\n exclude = dfs(idx + 1, remaining_amount)\n dp[idx][remaining_amount] = min(exclude, include)\n\n return dp[idx][remaining_amount]\n \n result = dfs(0, amount)\n return result if result != float(\"inf\") else -1\n\n\n\n \n ","runtime":"1500"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n dp = [[float('inf') for _ in range(amount+1)] for _ in range(n+1)]\n\n\n for i in range(n+1):\n dp[i][0] = 0\n\n for i in range(1, n+1):\n for j in range(amount+1):\n if coins[i-1] <= j:\n dp[i][j] = min(1 + dp[i][j-coins[i-1]], dp[i-1][j])\n else:\n dp[i][j] = dp[i-1][j]\n\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\n ","runtime":"1500"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n memo = {}\n\n def dfs(num:int):\n if num == 0:\n return 0\n if num < 0:\n return float('inf')\n\n\n if num in memo:\n return memo[num]\n\n min_coins = float('inf')\n for i in coins:\n if i <= num:\n c = dfs(num - i)\n if c != float('inf'):\n stepsHereTillTheEnd = c + 1\n min_coins = min(stepsHereTillTheEnd, min_coins)\n \n\n memo[num] = min_coins\n return min_coins\n res = dfs(amount)\n return res if res != float('inf') else - 1\n","runtime":"1520"},{"code":"import functools\n\nclass Solution:\n coins: List[int]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n self.coins = coins\n return self.coinChangeDyn(amount)\n \n @functools.cache\n def coinChangeDyn(self, amount: int) -> int:\n if amount == 0:\n return 0\n\n min_coins = -1\n for coin in reversed(self.coins):\n if coin == amount:\n return 1\n elif coin < amount:\n coins = self.coinChangeDyn(amount - coin)\n if coins != -1 and min_coins == -1:\n min_coins = coins + 1\n elif coins != -1:\n min_coins = min(min_coins, coins + 1)\n return min_coins","runtime":"1520"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n #have a dp array, col is up to amount and row is number of coins\n dp = [[float('inf') for _ in range(amount+1)] for _ in range(len(coins))]\n \n for i in range(len(coins)):\n dp[i][0] = 0\n \n for i in range((len(coins))):\n for j in range(1, amount+1):\n dp[i][j] = dp[i-1][j]\n if coins[i]<=j:\n r = j - coins[i]\n dp[i][j] = min(1 + dp[i][r], dp[i][j])\n \n return dp[-1][-1] if dp[-1][-1] < float('inf') else -1\n\n ","runtime":"1540"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {0:0}\n def helper(recNum):\n if recNum in memo.keys():\n return memo[recNum]\n elif recNum < 0:\n memo[recNum] = -1\n else:\n for i in coins:\n helper(recNum - i)\n memo[recNum] = 1 + min([memo[recNum - c] for c in coins if memo[recNum - c] != -1], default = -2)\n return memo[recNum]\n return helper(amount)","runtime":"1540"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n\n # have to figure out minimum # of coins needed to make amount\n # we have unlimited # of coins of denominations present in coins\n # if amount cant be made with the coins provided, return -1\n # coin val > amount\n\n # we're returning mionimum coins needed, so need to minimize the values coming from each subproblem\n # amount = 5, coins = [1, 2]\n # amount = 4\n # amount = 3\n # amount = 4\n # amount = 5\n # amount = 3\n # amount = 5\n \n @cache\n def CC(i :int, x :int) -> int:\n\n # i is idx of coins arr\n if i == len(coins):\n return 0 if x == 0 else 10**5\n take = 10**5 \n if coins[i] <= x:\n take = 1 + CC(i, x - coins[i])\n skip = CC(i + 1, x)\n\n return min(take, skip)\n\n result = CC(0, amount)\n return -1 if result == 10**5 else result\n\n","runtime":"1559"},{"code":"class Solution:\n def rec(self, coins, amt, dp):\n if amt < 0:\n return float('inf') # Return a large value to signify an invalid path\n if amt == 0:\n return 0 # No coins needed if the amount is 0\n\n if amt in dp:\n return dp[amt]\n\n min_coins = float('inf')\n for coin in coins:\n result = self.rec(coins, amt - coin, dp)\n if result != float('inf'):\n min_coins = min(min_coins, result + 1)\n\n dp[amt] = min_coins\n return dp[amt]\n \n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {}\n result = self.rec(coins, amount, dp)\n return result if result != float('inf') else -1\n","runtime":"1559"},{"code":"class Solution:\n # DFS(i,j) = min(DFS(i-1,j), DFS(i,j-w[i]) + v[i]) -> min coins\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n # v[i] = 1; w[i] = coins[i]\n @cache\n def DFS(i,j):\n if i < 0:\n return 0 if j == 0 else inf\n if j < coins[i]:\n return DFS(i-1,j)\n return min(DFS(i-1,j), DFS(i,j-coins[i])+1)\n Ans = DFS(n-1,amount)\n return Ans if Ans != inf else -1\n \n","runtime":"1579"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n memo = dict()\n\n def dfs(curr):\n if curr > amount:\n return float('inf')\n \n if curr == amount:\n return 0\n \n if curr in memo:\n return memo[curr]\n \n min_steps = float('inf')\n\n for c in coins:\n res = dfs(curr + c)\n if res != float('inf'):\n min_steps = min(min_steps, res + 1)\n \n memo[curr] = min_steps\n\n return memo[curr]\n \n res = dfs(0)\n return res if res != float('inf') else -1","runtime":"1579"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n\n def dp(rem):\n if rem == 0:\n return 0\n if rem < 0:\n return float('inf')\n if rem in memo:\n return memo[rem]\n \n min_coins = float(\"inf\")\n for coin in coins:\n res = dp(rem - coin)\n if res != float('inf'):\n min_coins = min(min_coins, res + 1)\n \n memo[rem] = min_coins\n return memo[rem]\n\n result = dp(amount)\n return result if result != float('inf') else -1","runtime":"1599"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n memo = {}\n def dp(index, current):\n if (index,current) in memo:\n return memo[(index,current)]\n\n \n\n if index>=len(coins) or current<0:\n return float('inf')\n \n if current == 0:\n return 0\n #We are adding +1 while calling the function because we want to track how many times the use_it function in used.\n use_it = 1+dp(index,current-coins[index])\n skip_it = dp(index+1,current)\n\n memo[(index,current)] = min(use_it, skip_it)\n return memo[(index,current)]\n \n return dp(0,amount) if dp(0,amount)!=float('inf') else -1\n\n\n ","runtime":"1599"}],"string":"[\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0: return 0\\n dp = {}\\n coins.sort(reverse=True)\\n def makeChange(curr, coinHigh, coinsUsed):\\n if dp.get(curr) == -1: return\\n if dp.get(0, amount) < (curr / coins[coinHigh] + coinsUsed): return\\n for i in range(coinHigh, len(coins)):\\n remainder = curr - coins[i]\\n if dp.get(remainder, 10001) > coinsUsed + 1 and remainder >= 0:\\n dp[remainder] = coinsUsed + 1\\n if remainder == 0: return\\n makeChange(remainder, i, coinsUsed + 1)\\n if curr not in dp: dp[curr] = -1\\n makeChange(amount, 0, 0)\\n return dp[0] if 0 in dp else -1\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n # n = len(coins)\\n\\n # dp = [0] + [amount+1]*amount\\n\\n # for coin in coins:\\n # for i in range(coin, amount+1):\\n # dp[i] = min([dp[i], dp[i-coin] +1])\\n\\n # return -1 if dp[amount] == amount +1 else dp[amount]\\n\\n\\n\\n if not amount: return 0\\n dp=1<<amount\\n i=dp\\n res=0\\n while i:\\n if i&dp:\\n res+=1\\n curr=dp\\n for coin in coins:\\n dp|=curr>>coin\\n if dp&1: return res\\n i>>=1\\n return -1\\n\\n\\n \\n\\n\\n\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\\"\\\"\\\"\\n DP + recursion\\n 1. sort coins, use large denominations first\\n 2. remember fewest number. stop processing if current number > fewest number\\n 3. memorize best results for sub-amount\\n\\n Notes (made mistake):\\n 1. memorize number that cannot form a combo\\n 2. in each search, try all coins denominations\\n 3. only 2 key parameters are needed in each search: target and memorized items\\n\\n \\\"\\\"\\\"\\n if amount == 0:\\n return 0\\n \\n coins = sorted(coins)\\n\\n def search(targetAmount: int, mem: dict) -> int:\\n \\\"\\\"\\\" return fewest number for target amount \\\"\\\"\\\"\\n currFewest = -1 # for target amount\\n \\n # print(targetAmount, topCoinPos)\\n if targetAmount in mem:\\n return mem[targetAmount]\\n elif targetAmount < coins[0]:\\n return -1\\n \\n topCoinPos = bisect.bisect_left(coins, targetAmount) - 1\\n\\n while topCoinPos >= 0:\\n newTarget = targetAmount - coins[topCoinPos]\\n newNum = search(newTarget, mem)\\n if newNum != -1:\\n if currFewest == -1:\\n currFewest = 1 + newNum\\n else:\\n currFewest = min(currFewest, 1+newNum)\\n \\n # check smaller denomination\\n topCoinPos -= 1\\n if topCoinPos >= 0 and currFewest != -1 and targetAmount / coins[topCoinPos] > currFewest:\\n break\\n \\n mem[targetAmount] = currFewest\\n # print(\\\"-\\\", targetAmount, currFewest)\\n return currFewest\\n\\n num = search(amount, {c: 1 for c in coins})\\n return num\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\\"\\\"\\\"\\n DP + recursion\\n 1. sort coins, use large denominations first\\n 2. remember fewest number. stop processing if current number > fewest number\\n 3. memorize best results for sub-amount\\n\\n Notes (made mistake):\\n 1. memorize number that cannot form a combo\\n\\n \\\"\\\"\\\"\\n if amount == 0:\\n return 0\\n \\n coins = sorted(coins)\\n\\n def search(targetAmount: int, mem: dict) -> int:\\n \\\"\\\"\\\" return fewest number for target amount \\\"\\\"\\\"\\n currFewest = -1 # for target amount\\n \\n # print(targetAmount, topCoinPos)\\n if targetAmount in mem:\\n return mem[targetAmount]\\n elif targetAmount < coins[0]:\\n return -1\\n \\n topCoinPos = bisect.bisect_left(coins, targetAmount) - 1\\n\\n while topCoinPos >= 0:\\n newTarget = targetAmount - coins[topCoinPos]\\n newNum = search(newTarget, mem)\\n if newNum != -1:\\n if currFewest == -1:\\n currFewest = 1 + newNum\\n else:\\n currFewest = min(currFewest, 1+newNum)\\n \\n # check smaller denomination\\n topCoinPos -= 1\\n if topCoinPos >= 0 and currFewest != -1 and targetAmount / coins[topCoinPos] > currFewest:\\n break\\n \\n mem[targetAmount] = currFewest\\n # print(\\\"-\\\", targetAmount, currFewest)\\n return currFewest\\n\\n num = search(amount, {c: 1 for c in coins})\\n return num\",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n\\n def find(self,arr,n,amount):\\n num=[0]*n\\n minnum=10001\\n numcoins=0\\n remainder=amount\\n\\n start=0\\n ind=0\\n while True:\\n # print()\\n # print(ind,num,numcoins,remainder,minnum)\\n maxmax=remainder//arr[ind]\\n if maxmax+numcoins>minnum:\\n # while num[ind]==0:\\n # ind-=1\\n # if ind==-1:\\n # return minnum\\n ind-=1\\n if ind==-1:\\n return minnum\\n remainder+=arr[ind]*num[ind]\\n numcoins-=num[ind]\\n num[ind]=0\\n\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n ind+=1\\n continue\\n if maxmax==0 :\\n if ind==n-1:\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n ind+=1\\n continue\\n num[ind]=maxmax\\n numcoins+=maxmax\\n remainder=remainder-maxmax*arr[ind]\\n # print(ind,num,numcoins,remainder,minnum)\\n if remainder==0:\\n minnum=min(minnum,numcoins)\\n remainder+=num[ind]*arr[ind]\\n numcoins-=num[ind]\\n num[ind]=0\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n # print(ind,num,numcoins,remainder,minnum)\\n ind+=1\\n continue\\n else:\\n if ind==n-1:\\n remainder+=num[ind]*arr[ind]\\n numcoins-=num[ind]\\n num[ind]=0\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n\\n ind+=1\\n\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # coins=coins[::-1]\\n # counts=[0]*len()\\n # maxmax=amount//coins[0]\\n if amount==0:\\n return 0\\n\\n\\n minval=maxval=amount/coins[0]\\n for i in coins[1:]:\\n val=amount/i\\n if val>maxval:\\n maxval=val\\n elif val<minval:\\n minval=val\\n if maxval-minval<1:\\n for i in coins:\\n if amount%i==0:\\n return amount//i\\n \\n minval=amount/max(coins)\\n maxval=amount/min(coins)\\n if maxval-minval<1 and maxval!=minval:\\n if minval//1==maxval//1:\\n return -1\\n \\n if amount%2==1:\\n for i in coins:\\n if i%2==1:\\n break\\n if i==coins[-1]:\\n return -1\\n\\n arr=sorted(coins,reverse=True)\\n \\n n=len(arr)\\n # print(self.arr)\\n val=self.find(arr,n,amount)\\n if val==10001:val=-1\\n return val\\n \\n\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def dfs(rem):\\n if rem == 0:\\n return 0\\n\\n min_cost = inf\\n\\n for coin in coins:\\n if rem / coin > min_cost:\\n break\\n\\n if rem - coin >= 0:\\n min_cost = min(min_cost, dfs(rem - coin) + 1)\\n\\n return min_cost\\n\\n coins.sort(reverse=True)\\n res = dfs(amount)\\n return res if res != inf else -1\\n\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n\\n def find(self,arr,n,amount):\\n num=[0]*n\\n minnum=10001\\n numcoins=0\\n remainder=amount\\n\\n start=0\\n ind=0\\n while True:\\n # print()\\n # print(ind,num,numcoins,remainder,minnum)\\n maxmax=remainder//arr[ind]\\n if maxmax+numcoins>minnum:\\n # while num[ind]==0:\\n # ind-=1\\n # if ind==-1:\\n # return minnum\\n ind-=1\\n if ind==-1:\\n return minnum\\n remainder+=arr[ind]*num[ind]\\n numcoins-=num[ind]\\n num[ind]=0\\n\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n ind+=1\\n continue\\n if maxmax==0 :\\n if ind==n-1:\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n ind+=1\\n continue\\n num[ind]=maxmax\\n numcoins+=maxmax\\n remainder=remainder-maxmax*arr[ind]\\n # print(ind,num,numcoins,remainder,minnum)\\n if remainder==0:\\n minnum=min(minnum,numcoins)\\n remainder+=num[ind]*arr[ind]\\n numcoins-=num[ind]\\n num[ind]=0\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n # print(ind,num,numcoins,remainder,minnum)\\n ind+=1\\n continue\\n else:\\n if ind==n-1:\\n remainder+=num[ind]*arr[ind]\\n numcoins-=num[ind]\\n num[ind]=0\\n while num[ind]==0:\\n ind-=1\\n if ind==-1:\\n return minnum\\n num[ind]-=1\\n numcoins-=1\\n remainder+=arr[ind]\\n\\n ind+=1\\n\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # coins=coins[::-1]\\n # counts=[0]*len()\\n # maxmax=amount//coins[0]\\n if amount==0:\\n return 0\\n # for i in range(len(coins)):\\n # if coins[i]==[411,412,413,414,415,416,417,418,419,420,421,422][i]:\\n # if i==len(coins)-1:\\n # return -1\\n # else:\\n # break\\n minval=maxval=amount/coins[0]\\n for i in coins[1:]:\\n val=amount/i\\n if val>maxval:\\n maxval=val\\n elif val<minval:\\n minval=val\\n if maxval-minval<1:\\n for i in coins:\\n if amount%i==0:\\n return amount//i\\n \\n minval=amount/max(coins)\\n maxval=amount/min(coins)\\n if maxval-minval<1 and maxval!=minval:\\n if minval//1==maxval//1:\\n return -1\\n \\n if amount%2==1:\\n for i in coins:\\n if i%2==1:\\n break\\n if i==coins[-1]:\\n return -1\\n\\n arr=sorted(coins,reverse=True)\\n \\n n=len(arr)\\n # print(self.arr)\\n val=self.find(arr,n,amount)\\n if val==10001:val=-1\\n return val\\n \\n\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def dfs(rem):\\n if rem == 0:\\n return 0\\n \\n min_cost = inf\\n\\n for coin in coins:\\n if rem / coin > min_cost:\\n break\\n\\n if rem - coin >= 0:\\n min_cost = min(min_cost, dfs(rem - coin) + 1)\\n \\n return min_cost\\n \\n coins.sort(reverse=True)\\n res = dfs(amount)\\n return res if res != inf else -1\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n11\\n10, 9, 6\\n8, 5, 7, 4, 1\\n\\ndynamic programming: bottom up\\nstart with each amount of coins:\\nif it equals target then stop\\nadd to every other type of coin\\nif you get a sum that you've already seen then discard (bc there is a faster way to get there)\\n\\n\\\"\\\"\\\"\\n\\nfrom collections import deque\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n coins.sort()\\n q = deque()\\n visited = set()\\n\\n for i, coin in enumerate(coins):\\n if coin == amount:\\n return 1\\n if coin > amount:\\n break\\n visited.add(coin)\\n q.append((i, coin))\\n \\n level = 1\\n \\n while q:\\n size = len(q)\\n for i in range(size):\\n currIndex, currCoin = q.popleft()\\n for i in range(currIndex, len(coins)):\\n nextCoin = currCoin + coins[i]\\n if nextCoin in visited:\\n continue\\n if nextCoin == amount:\\n return level + 1\\n if nextCoin > amount:\\n break\\n visited.add(nextCoin)\\n q.append((i, nextCoin))\\n \\n level += 1\\n \\n return -1\\n\\n\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n from functools import cache\\n @cache\\n def dfs(rem):\\n if rem == 0:\\n return 0\\n\\n min_cost = float('inf')\\n\\n for coin in coins:\\n if rem / coin > min_cost:\\n break\\n\\n if rem - coin >= 0:\\n min_cost = min(min_cost, dfs(rem - coin) + 1)\\n\\n return min_cost\\n\\n coins.sort(reverse=True)\\n res = dfs(amount)\\n return res if res != float('inf') else -1\",\n \"runtime\": \"199\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n return num_coins(coins, amount)\\n\\ndef num_coins(coins, amount):\\n coins.sort(reverse=True)\\n\\n queue = [((math.ceil(amount / coins[0]), 0), 0, amount, 0)]\\n visited = set()\\n while queue:\\n _, total, remainder, i = heapq.heappop(queue)\\n if (remainder, i) in visited:\\n continue\\n visited.add((remainder, i))\\n if remainder == 0:\\n return total\\n\\n if i + 1 < len(coins) and (remainder, i + 1) not in visited:\\n heapq.heappush(queue, ((total + math.ceil(remainder / coins[i]), -total), total, remainder, i + 1))\\n if remainder >= coins[i] and (remainder - coins[i], i) not in visited:\\n total += 1\\n remainder -= coins[i]\\n heapq.heappush(queue, ((total + math.ceil(remainder / coins[i]), -total), total, remainder, i))\\n \\n return -1\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n visited = [False] * amount\\n subamounts = [amount]\\n\\n for c in itertools.count(1):\\n new_subamounts = []\\n for coin in coins:\\n for subamount in subamounts:\\n new_subamount = subamount - coin\\n if new_subamount >= 0 and visited[new_subamount] is False:\\n visited[new_subamount] = True\\n new_subamounts.append(new_subamount)\\n\\n if not new_subamounts:\\n return -1\\n if visited[0]:\\n return c\\n subamounts = new_subamounts\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n \\n coins_needed = [-1 for _ in range(amount + 1)]\\n coins_needed[0] = 0\\n\\n count = 1\\n current_amount_list = [0]\\n while current_amount_list:\\n\\n next_amount_list = []\\n for last_amount in current_amount_list:\\n for coin in coins:\\n amount_value = coin + last_amount\\n if (amount_value > amount) or (coins_needed[amount_value] != -1):\\n continue\\n if amount_value == amount:\\n return count\\n next_amount_list.append(amount_value)\\n coins_needed[amount_value] = count\\n count += 1\\n current_amount_list = next_amount_list\\n\\n return -1 \",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange2(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n if amount == 0:\\n return 0\\n comb = [-1] * (amount + 1)\\n comb[-1] = 0\\n for i in range(amount, -1, -1):\\n if comb[i] == -1:\\n continue\\n for coin in coins:\\n pos = i - coin\\n if pos < 0:\\n continue\\n if comb[pos] == -1:\\n comb[pos] = comb[i] + 1\\n else:\\n comb[pos] = min(comb[pos], comb[i] + 1)\\n #if pos == 0:\\n # return comb[0]\\n return comb[0]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n flags = [False]*(amount+1)\\n q = [0]\\n steps = 0\\n coins = [c for c in coins if c <= amount]\\n coins.sort(reverse=True)\\n while q:\\n steps += 1\\n new_q = []\\n for i in q:\\n for c in coins:\\n pos = i + c\\n if pos == amount:\\n return steps\\n if pos < amount and not flags[pos]:\\n flags[pos] = True\\n new_q.append(pos)\\n q = new_q\\n return -1\\n\\n\\n\",\n \"runtime\": \"238\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange2(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n if amount == 0:\\n return 0\\n comb = [-1] * (amount + 1)\\n comb[-1] = 0\\n for i in range(amount, -1, -1):\\n if comb[i] == -1:\\n continue\\n for coin in coins:\\n pos = i - coin\\n if pos < 0:\\n continue\\n if comb[pos] == -1:\\n comb[pos] = comb[i] + 1\\n else:\\n comb[pos] = min(comb[pos], comb[i] + 1)\\n #if pos == 0:\\n # return comb[0]\\n return comb[0]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n flags = [False]*(amount+1)\\n q = [0]\\n steps = 0\\n coins.sort(reverse=True)\\n while q:\\n steps += 1\\n new_q = []\\n for i in q:\\n for c in coins:\\n pos = i + c\\n if pos == amount:\\n return steps\\n if pos < amount and not flags[pos]:\\n flags[pos] = True\\n new_q.append(pos)\\n q = new_q\\n return -1\\n\\n\\n\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange2(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n if amount == 0:\\n return 0\\n comb = [-1] * (amount + 1)\\n comb[-1] = 0\\n for i in range(amount, -1, -1):\\n if comb[i] == -1:\\n continue\\n for coin in coins:\\n pos = i - coin\\n if pos < 0:\\n continue\\n if comb[pos] == -1:\\n comb[pos] = comb[i] + 1\\n else:\\n comb[pos] = min(comb[pos], comb[i] + 1)\\n #if pos == 0:\\n # return comb[0]\\n return comb[0]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n flags = [False]*(amount+1)\\n q = [0]\\n steps = 0\\n coins.sort(reverse=True)\\n while q:\\n steps += 1\\n new_q = []\\n for i in q:\\n for c in coins:\\n pos = i + c\\n if pos == amount:\\n return steps\\n if pos < amount and not flags[pos]:\\n flags[pos] = True\\n new_q.append(pos)\\n q = new_q\\n return -1\\n\\n\\n\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution(object):\\n def coinChange(self, coins, amount):\\n # bfs 최단거리 구하기\\n # 초기 세팅\\n queue = deque()\\n visited = [False] * (amount+1) \\n # 시작 노드 예약\\n queue.append((amount, 0))\\n visited[amount] = True\\n\\n while queue:\\n # 현재 노드 방문\\n cur_v, dist = queue.popleft()\\n if cur_v == 0:\\n return dist\\n # 다음 노드 예약\\n for coin in coins:\\n next_v = cur_v - coin\\n if next_v >= 0 and not visited[next_v]:\\n queue.append((next_v, dist+1))\\n visited[next_v] = True\\n\\n return -1\",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount==0:\\n return 0\\n dp=[-1]*(amount+1)\\n que=deque([0])\\n dp[0]=0\\n\\n while que:\\n nextAmount=que.popleft()\\n for c in coins:\\n newAmount=nextAmount+c\\n #print(newAmount)\\n if newAmount<=amount and dp[newAmount]==-1 :\\n dp[newAmount]=dp[nextAmount]+1\\n que.append(newAmount)\\n if dp[amount]!=-1:\\n return dp[amount]\\n return -1\\n\\n \",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins = [c for c in coins if c <= amount]\\n r = {0: 0} # if amount is 0\\n current_sums = [0]\\n while current_sums:\\n tmp_current_sums = []\\n for c in coins:\\n for s in current_sums:\\n new_sum = c + s\\n if new_sum not in r and new_sum <= amount:\\n r[new_sum] = r[s] + 1\\n tmp_current_sums.append(new_sum)\\n current_sums = tmp_current_sums\\n return r.get(amount, -1)\",\n \"runtime\": \"298\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.appeared = set()\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n levels = 1\\n current_level = [amount]\\n while True:\\n next_level = []\\n for coin in coins:\\n for residual in current_level:\\n if residual == coin:\\n return levels\\n elif residual > coin:\\n if residual - coin in self.appeared:\\n continue\\n else:\\n next_level.append(residual - coin)\\n self.appeared.add(residual - coin)\\n\\n else:\\n current_level = next_level\\n levels += 1\\n if next_level == []:\\n return -1\",\n \"runtime\": \"298\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n q = deque([(amount, 0)])\\n seen = set()\\n\\n while q:\\n amt_left, num_coins = q.popleft()\\n if amt_left == 0:\\n return num_coins\\n\\n for c in coins:\\n new_left = amt_left - c\\n if new_left not in seen and new_left >= 0:\\n seen.add(new_left)\\n q.append((new_left, num_coins + 1))\\n \\n return -1\\n\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n coins.sort(reverse=True)\\n visited = set()\\n toProcess = deque()\\n\\n toProcess.append((amount, 0))\\n\\n while toProcess:\\n # print(toProcess)\\n target, count = toProcess.popleft()\\n\\n for coin in coins:\\n diff = target - coin\\n if diff not in visited and diff > 0:\\n visited.add(diff)\\n toProcess.append((diff, count + 1))\\n if diff == 0:\\n return count + 1\\n return -1\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n occurredNums = {}\\n queue = [amount]\\n count = 0\\n while len(queue) > 0: \\n tempQueue = []\\n for amountLeft in queue: \\n if amountLeft == 0: return count\\n for coin in coins: \\n newAmountLeft = amountLeft-coin\\n if newAmountLeft >= 0 and newAmountLeft not in occurredNums: \\n occurredNums[newAmountLeft] = None\\n tempQueue.append(newAmountLeft)\\n queue = tempQueue\\n count += 1\\n return -1\",\n \"runtime\": \"337\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n BUF = [None]*(amount+1)\\n BUF[0] = 0\\n for coin in coins:\\n for amt in range(coin, amount+1):\\n old_val = BUF[amt]\\n delta_val = BUF[amt-coin]\\n if delta_val is not None and (old_val is None or old_val > delta_val+1):\\n BUF[amt] = delta_val+1\\n opt = BUF[amount]\\n return -1 if opt is None else opt\\n\",\n \"runtime\": \"337\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if not coins:\\n return -1\\n if amount == 0:\\n return 0\\n\\n remaining = collections.deque()\\n remaining.append(amount)\\n visited = set()\\n step = 0\\n while remaining:\\n size = len(remaining)\\n step += 1\\n for i in range(size):\\n current = remaining.popleft()\\n for coin in coins:\\n tmp = current - coin\\n if tmp == 0:\\n return step\\n if tmp > 0 and tmp not in visited:\\n remaining.append(tmp)\\n visited.add(tmp)\\n\\n return -1\",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"#from functools import cache\\nfrom collections import deque\\nclass Solution:\\n def coinChange(self, coins, amount):\\n level = seen = {0}\\n number = 0\\n while level:\\n if amount in level:\\n return number\\n level = {a+c for a in level for c in coins if a+c <= amount} - seen\\n seen |= level\\n number += 1\\n return -1\\n # Solution 4: BFS\\n \\\"\\\"\\\"def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount==0: return 0\\n dq = deque([(0,0)])\\n nc = 0\\n seen = [False]*(amount+1)\\n seen[0] = True\\n while dq:\\n curr, nc=dq.pop()\\n for c in coins:\\n if c+curr==amount: \\n return nc+1\\n if c+curr<amount and not seen[c+curr]:\\n dq.appendleft((c+curr,nc+1))\\n return -1\\\"\\\"\\\"\\n\\n\\n\\n # Solution 3: do not keep track of coin number used so far, just track the amount remaining\\n \\\"\\\"\\\"def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def dp(rest):\\n if rest==0: return 0\\n if rest<0: return float('inf')\\n return min([1+dp(max(-1,rest-c)) for c in coins])\\n ans = dp(amount)\\n if ans<float('inf'): return ans\\n return -1\\\"\\\"\\\"\\n\\n # Solution 2: uses dict to save computed values - no difference in time/space with Solution 1\\n \\\"\\\"\\\"def coinChange(self, coins: List[int], amount: int) -> int:\\n DP = dict()\\n def dp(i,rest):\\n if rest==0: return 0 # no coins needed\\n if i==len(coins): return float('inf') # no coins left \\n if coins[i]==rest: return 1 # one coin is the best choice to cover the rest \\n # if we can pick this coin->compare between 2 values, else compute one value\\n if coins[i]<rest: \\n if (i,rest-coins[i]) not in DP:\\n DP[(i,rest-coins[i])] = dp(i,rest-coins[i])\\n if (i+1,rest) not in DP:\\n DP[(i+1,rest)] = dp(i+1,rest)\\n return min(1+DP[(i,rest-coins[i])], DP[(i+1,rest)])\\n else:\\n if (i+1,rest) not in DP:\\n DP[(i+1,rest)] = dp(i+1,rest)\\n return DP[(i+1,rest)]\\n #coins.sort(reverse=True)\\n temp = dp(0,amount)\\n if temp<float('inf'): return temp\\n return -1\\\"\\\"\\\"\\n # Solution 1: uses cache\\n \\\"\\\"\\\"def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def dp(i,rest):\\n if rest==0: return 0 # no coins needed\\n if i==len(coins): return float('inf') # no coins left \\n if coins[i]==rest: return 1 # one coin is the best choice to cover the rest \\n # if we can pick this coin->compare between 2 values, else compute one value\\n if coins[i]<rest: \\n return min(1+dp(i,rest-coins[i]), dp(i+1,rest))\\n else:\\n return dp(i+1,rest)\\n #coins.sort(reverse=True)\\n temp = dp(0,amount)\\n if temp<float('inf'): return temp\\n return -1\\\"\\\"\\\"\\n \\n \",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"IMPOSSIBLE = 10**6\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n d = [0]\\n for ant in range(1, amount + 1):\\n _min = IMPOSSIBLE\\n for c in coins:\\n prev = ant - c\\n if prev < 0:\\n continue\\n if _min > d[prev] + 1:\\n _min = d[prev] + 1\\n d.append(_min)\\n \\n return d[amount] if d[amount] != IMPOSSIBLE else -1\\n \\n \",\n \"runtime\": \"376\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {0: 0}\\n q = deque([0])\\n while q:\\n cur = q.popleft()\\n curcount = memo[cur]\\n if cur == amount: return curcount\\n for c in coins:\\n newval = cur + c\\n if newval <= amount and newval not in memo:\\n memo[newval] = curcount + 1\\n q.append(newval)\\n return -1\\n \\n \\n\\n\\n \",\n \"runtime\": \"376\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n dp = [-1] * (amount+1)\\n dp[0] = 0\\n\\n for c in coins:\\n for i in range(1, amount+1):\\n if c <= i and dp[i-c] > -1 and (dp[i] == -1 or dp[i]>dp[i-c]+1):\\n dp[i] = dp[i-c] + 1\\n\\n return dp[-1] \",\n \"runtime\": \"396\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n #backtracking with memoization table\\n #O(2^N) time complexity, but average time will be faster\\n\\n queue = collections.deque()\\n memo = { 0:0 }\\n\\n def dfs(queue):\\n next_level = []\\n while coins[-1] not in memo or next_level:\\n if next_level:\\n queue.extend(next_level)\\n next_level = []\\n while queue:\\n curr = queue.popleft()\\n res = memo[curr]\\n if curr == amount:\\n return res\\n if curr > amount:\\n continue\\n for coin in coins:\\n candidate = curr + coin\\n if candidate in memo:\\n continue\\n memo[candidate] = memo[curr] + 1\\n next_level.append(curr + coin)\\n return -1\\n \\n queue.append(0)\\n return dfs(queue)\",\n \"runtime\": \"396\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [amount+1]*(amount+1)\\n dp[0]=0\\n for i in range(1,amount+1):\\n for elt in coins:\\n if i-elt>=0:\\n if dp[i-elt]+1<dp[i]:\\n dp[i]=dp[i-elt]+1\\n \\n if dp[-1]<amount+1:\\n return dp[-1]\\n return -1\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"\\nfrom collections import deque\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n queue = deque()\\n\\n queue.append([amount, 0])\\n seen = set([amount])\\n\\n while queue:\\n \\n amount_remain, num_coins = queue.popleft()\\n\\n if amount_remain == 0:\\n return num_coins\\n\\n for i in range(len(coins)):\\n if amount_remain - coins[i] not in seen and amount_remain - coins[i] >= 0:\\n queue.append([amount_remain - coins[i], num_coins + 1])\\n seen.add(amount_remain - coins[i])\\n\\n return -1\\n\\n\\n \",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n rem = amount\\n res = 0\\n\\n dp = [float('inf')] * (amount + 1)\\n\\n dp[0] = 0\\n for i in range(1, amount + 1):\\n for c in coins:\\n if i - c >= 0 and dp[i-c] + 1 < dp[i]:\\n dp[i] = dp[i-c] + 1\\n \\n if dp[amount] == float('inf'):\\n return -1\\n return dp[amount]\\n\\n\\n\\n \\n\",\n \"runtime\": \"436\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp={0:0}\\n MAX=9999999\\n for curr in range(amount):\\n if curr not in dp:\\n continue\\n curr_count=dp[curr]\\n for coin in coins:\\n if dp.get(curr+coin,MAX)>(curr_count+1):\\n dp[curr+coin]=curr_count+1\\n \\n del dp[curr]\\n return dp.get(amount,-1)\\n \\n \",\n \"runtime\": \"436\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n if amount == 0:\\n return 0\\n\\n combinations = [0] * (amount + 1)\\n combinations[0] = 0\\n combinations[1] = 1 if 1 in coins else 0\\n\\n for k in range(2, amount + 1):\\n if k in coins:\\n combinations[k] = 1\\n continue\\n\\n current_min = None\\n for c in coins:\\n if c < k and combinations[k - c]:\\n if current_min is None or current_min > combinations[k - c]:\\n current_min = combinations[k - c]\\n \\n combinations[k] = current_min + 1 if current_min else 0\\n\\n ret_combinations = combinations[amount]\\n return ret_combinations if ret_combinations > 0 else -1\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n changes = [] \\n work = [0] \\n show = True \\n \\n exchange = CoinChange(coins, amount, changes, work, show)\\n result = exchange.find_fewest_coins()\\n return len(result) if result != [-1] else -1\\n\\nclass CoinChange:\\n def __init__(self, w, c, changes, work, show):\\n self._w = w \\n self._c = c \\n self._changes = changes \\n self._work = work \\n self._show = show \\n\\n def find_fewest_coins(self):\\n if self._c < 0:\\n self._changes[:] = [-1]\\n return self._changes\\n\\n # Initialize the dynamic programming table\\n minCoins = [float('inf')] * (self._c + 1)\\n minCoins[0] = 0\\n coinsUsed = [-1] * (self._c + 1)\\n\\n for amount in range(1, self._c + 1):\\n for coin in self._w:\\n if coin <= amount:\\n if minCoins[amount - coin] + 1 < minCoins[amount]:\\n minCoins[amount] = minCoins[amount - coin] + 1\\n coinsUsed[amount] = coin\\n self._work[0] += 1\\n\\n if minCoins[self._c] == float('inf'):\\n self._changes[:] = [-1]\\n else:\\n self._changes.clear()\\n remainingAmount = self._c\\n while remainingAmount > 0:\\n self._changes.append(coinsUsed[remainingAmount])\\n remainingAmount -= coinsUsed[remainingAmount]\\n\\n if self._show:\\n self._display_results()\\n\\n return self._changes\\n\\n def _display_results(self):\\n # print(f\\\"Coins available: {self._w}\\\")\\n print(f\\\"Target amount: {self._c}\\\")\\n print(f\\\"Minimum coins required: {len(self._changes) if self._changes != [-1] else -1}\\\")\\n print(f\\\"Coins selected: {self._changes}\\\")\\n\\n if self._changes != [-1]:\\n print(\\\"Coin selection process:\\\")\\n remaining = self._c\\n for coin in self._changes:\\n print(f\\\" Selected coin: {coin}, Remaining amount: {remaining} - {coin} = {remaining - coin}\\\")\\n remaining -= coin\\n print(f\\\" Final remaining amount: {remaining}\\\")\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n count = [None for i in range(amount + 1)]\\n count[0] = 0\\n for i in range(amount + 1):\\n for c in coins:\\n if count[i] is not None and (i + c <= amount) and (not count[i+c] or count[i+c] > count[i] + 1):\\n count[i+c] = count[i] + 1\\n return count[amount] or -1\",\n \"runtime\": \"475\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n M = [-1 for _ in range(amount+1)]\\n M[0] = 0\\n coins =[c for c in coins if c<=amount]\\n coins.sort(reverse = True)\\n #print(coins)\\n for c in coins:\\n M[c] = 1\\n for i in range(amount+1):\\n if M[i] == -1:\\n m=amount+1\\n able = False\\n for c in coins:\\n if i>c and M[i-c]!=-1 and M[i-c]+1<m:\\n m = M[i-c] +1\\n able = True\\n if able:\\n M[i] = m\\n else:\\n M[i] = -1\\n \\n return M[amount]\",\n \"runtime\": \"475\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n solutions = [10**5 for i in range(amount + 1)]\\n solutions[0] = 0\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if i - coin >= 0 and 1+solutions[i-coin] <= solutions[i] :\\n solutions[i] = 1 + solutions[i - coin]\\n if solutions[amount] == 10**5:\\n return -1\\n else:\\n return solutions[amount]\\n \",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cc, q = 0, collections.deque([0])\\n seen = set()\\n while len(q) != 0:\\n for _ in range(len(q)):\\n amt = q.popleft()\\n if amt == amount:\\n return cc\\n if amt > amount or amt in seen:\\n continue\\n seen.add(amt)\\n for c in coins:\\n q.append(amt + c)\\n cc += 1\\n return -1\",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n dp=[-1]*(amount+1)\\n\\n dp[0]=0\\n\\n for c in coins:\\n for i in range(amount-c+1):\\n if dp[i]!=-1:\\n if dp[i+c]==-1:\\n dp[i+c]=dp[i]+1\\n else:\\n dp[i+c]=min(dp[i+c],dp[i]+1)\\n return dp[-1]\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # @cache\\n # def func(idx,s):\\n # if s==amount:\\n # return 0 \\n # if s> amount or idx==len(coins):\\n # return float('inf')\\n \\n # return min(1+func(idx,s+coins[idx]), func(idx+1,s))\\n # res=func(0,0) \\n # return res if res<float('inf') else -1\\n\\n dp= [-1]*(amount+1)\\n dp[0]=0\\n\\n for c in coins:\\n print(dp)\\n for i in range(amount+1-c):\\n if dp[i]!=-1:\\n if dp[i+c]==-1:\\n dp[i+c]=dp[i]+1\\n else:\\n dp[i+c]=min(dp[i+c],dp[i]+1)\\n return dp[-1]\\n\\n @cache\\n def func(idx,s):\\n if s==amount:\\n return 0 \\n if s> amount or idx==len(coins):\\n return -1\\n res=[] \\n r=func(idx,s+coins[idx])\\n if r!=-1:\\n res.append(r+1)\\n r= func(idx+1,s)\\n if r!=-1:\\n res.append(r)\\n if not res:\\n return -1\\n else:\\n return min(res)\\n res=func(0,0) \\n return res \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n @cache\\n def func(s):\\n if s== amount:\\n return 0\\n if s>amount:\\n return -1\\n res=[]\\n for j in range(len(coins)):\\n if s+coins[j]<=amount:\\n r= func(s+coins[j])\\n if r!=-1:\\n res.append(r+1)\\n if res:\\n return min(res)\\n else:\\n return -1\\n return func(0)\\n\\n\\n \",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [-1] * (amount + 1)\\n dp[0] = 0\\n\\n #print(dp)\\n\\n for c in coins:\\n if(c <= amount):\\n dp[c] = 1\\n\\n coinSet = set(coins)\\n\\n for i in range(1, amount + 1):\\n if(i in coinSet):\\n continue\\n\\n dpList = []\\n for c in coins:\\n if c < i and dp[i - c] != -1:\\n dpList.append(dp[i - c])\\n\\n #print(\\\"i = \\\", i)\\n #print(\\\"dpList = \\\", dpList)\\n\\n if(len(dpList) > 0):\\n dp[i] = 1 + min(dpList)\\n \\n #print(dp)\\n\\n return dp[amount]\",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # return fewest number of coins needed to make up that amount\\n # could try to make up each val up to amount\\n # and for each val, could look at coins places back to find the min amount of coins needed there\\n\\n if amount == 0:\\n return 0\\n\\n dp = [-1] * (amount+1)\\n dp[0] = 0\\n\\n for i in range(1, amount+1):\\n # check adding to the previous\\n coin_counts = []\\n for coin in coins:\\n if i >= coin:\\n if dp[i-coin] > -1:\\n coin_counts.append(1 + dp[i-coin])\\n if coin_counts:\\n dp[i] = min(coin_counts)\\n return dp[-1]\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\\"\\\"\\\"\\n # return fewest number of coins that you need to make up the amount\\n # ifthe amount of money can be made up by any combination of coins, return -1\\n # assume an infinite number of each kind of coin\\n \\n # could store the amount of coins needed for each if we focused on maximizing the high val coin\\n # and then return the min of that?\\n\\n # 0 coins always to reach amount of 0\\n if not amount:\\n return 0\\n\\n # if any coins are a multiple of other coins, you can delete\\n # could sub one of the coins for another kind\\n\\n # could find minimum number of coins to create every amount up to amount -- in a dp array\\n dp = [amount+1] * (amount + 1)\\n dp[0] = 0 # costs 0 coins to get remainder\\n for i in range(1, amount+1):\\n # print(dp)\\n min_coins = amount+1\\n for coin in coins:\\n # need some amount of min_coins to compare against\\n if i - coin >= 0:\\n min_coins = min(min_coins, 1 + dp[i-coin])\\n dp[i] = min_coins\\n if dp[-1] > amount:\\n return -1\\n return dp[-1]\\n \\\"\\\"\\\"\\n \\n\\n \\n \\n\\n \",\n \"runtime\": \"534\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n if amount != 0 and amount < min(coins):\\n return -1\\n\\n n = len(coins)\\n dp = [0] * (amount+1)\\n a = min(coins)\\n dp[0] = 0\\n dp[1:a] = [-1] * (a-1)\\n dp[a] = 1\\n for i in range(a+1, amount+1):\\n possible = []\\n for coin in coins:\\n if i >= coin and dp[i - coin] != -1:\\n possible.append(dp[i - coin] + 1)\\n dp[i] = min(possible) if possible else -1\\n return dp[-1]\",\n \"runtime\": \"534\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n times = [0]\\n\\n for i in range(1, amount + 1):\\n if i in coins:\\n times.append(1)\\n continue\\n\\n minimum = -1\\n for j in coins:\\n if j > i:\\n continue\\n if times[j] != -1 and times[i - j] != -1 and (minimum < 0 or times[j] + times[i - j] < minimum):\\n minimum = times[j] + times[i - j]\\n \\n times.append(minimum)\\n\\n return times[-1]\\n \",\n \"runtime\": \"554\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n coins = sorted(coins, reverse=True)\\n dp = [float('inf')] * (amount+1)\\n\\n dp[0] = 0 \\n\\n for i in range(1, amount+1):\\n min_amount = float('inf')\\n for c in coins:\\n\\n if i-c>=0 and dp[i-c]+1<=min_amount:\\n min_amount = dp[i-c] + 1\\n dp[i] = min_amount\\n if dp[amount] == float('inf'):\\n return -1 \\n return dp[amount]\\n\\n\\n\",\n \"runtime\": \"554\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0: return 0\\n # Assume all coins can't be made initially\\n dp = [-1 for i in range(amount+1)]\\n \\n # Bottom up solution, so build up the dp array by solving for lower cases first\\n for x in range(1,amount+1):\\n if x in coins: \\n dp[x] = 1\\n continue\\n\\n # Only need to iterate through coins array\\n # ... because adding 1 coin is the most efficient way you can improve on a solution\\n for c in coins:\\n if c > x: continue\\n if dp[x-c] == -1: continue\\n count = dp[x-c]+1\\n if dp[x] == -1 or count < dp[x]: dp[x] = count\\n \\n return dp[amount]\\n\\n\\n\\n \\n\\n\\n \\n\",\n \"runtime\": \"574\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount in coins:\\n return 1\\n\\n coins = sorted(coins)\\n min_coins = [amount + 1] * (amount + 1)\\n min_coins[0] = 0\\n\\n for coin in coins:\\n if coin <= amount:\\n min_coins[coin] = 1\\n\\n for i in range(1, len(min_coins)):\\n if i not in coins:\\n min_list_i = []\\n for coin in coins:\\n if i - coin >= 0:\\n min_list_i.append(min_coins[i - coin])\\n else:\\n break\\n if min_list_i:\\n min_coins[i] = min(min_coins[i], min(min_list_i) + 1)\\n\\n return min_coins[-1] if min_coins[-1] != amount + 1 else -1\\n\\n # self.counts = {}\\n # self.coins = sorted(coins)\\n # for coin in self.coins:\\n # self.counts[coin] = 1\\n # self.counts[0] = 0\\n \\n # def helper(amount):\\n # if amount in self.counts:\\n # return self.counts[amount]\\n # min_list = []\\n # for coin in self.coins:\\n # if amount - coin >= 0:\\n # if amount - coin not in self.counts:\\n # helper(amount - coin)\\n # if self.counts[amount - coin] != -1:\\n # min_list.append(self.counts[amount - coin])\\n # else:\\n # break\\n # if not min_list:\\n # self.counts[amount] = -1\\n # return -1\\n # else: \\n # output = min(min_list) + 1\\n # self.counts[amount] = output\\n # return output\\n \\n # return helper(amount)\",\n \"runtime\": \"574\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n if len(coins) == 0:\\n return 0\\n coins = [coin for coin in coins if coin <= amount]\\n dp = [-1 for x in range(amount+1)]\\n dp[0] = 1\\n for coin in coins:\\n dp[coin] = 1\\n for i in range(1, len(dp)):\\n possible = []\\n if dp[i]==-1:\\n for coin in coins:\\n if i-coin >= 0 and dp[i-coin] >=0:\\n possible.append(dp[i-coin])\\n if len(possible) != 0:\\n dp[i] = min(possible) + 1\\n \\n return dp[-1]\\n \\n\\n \\n \",\n \"runtime\": \"593\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n \\n memo = [0] * (amount + 1)\\n\\n for i in range(1, amount + 1):\\n amounts = []\\n for c in coins:\\n if i - c >= 0:\\n if memo[i - c] != -1:\\n amounts.append(memo[i - c] + 1)\\n if len(amounts) > 0:\\n memo[i] = min(amounts)\\n else:\\n memo[i] = -1\\n \\n return memo[amount]\\n\\n\",\n \"runtime\": \"593\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n inf = float(\\\"inf\\\")\\n ret = [0] * (amount + 1)\\n\\n for i in range(1, amount + 1):\\n ret[i] = 1 + min([ret[i - coin] if i - coin >= 0 else float(\\\"inf\\\") for coin in coins])\\n return ret[amount] if ret[amount] != float(\\\"inf\\\") else -1\",\n \"runtime\": \"613\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n inf = float(\\\"inf\\\")\\n ret = [0] * (amount + 1)\\n\\n for i in range(1, amount + 1):\\n ret[i] = 1 + min([ret[i - coin] if i - coin >= 0 else float(\\\"inf\\\") for coin in coins])\\n return ret[amount] if ret[amount] != float(\\\"inf\\\") else -1\",\n \"runtime\": \"613\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n d = {0: 0} # k: v means v is the fewest number of coins to make k\\n for coin in coins:\\n for k in range(amount):\\n if k in d and (k + coin not in d or d[k + coin] > d[k] + 1):\\n d[k + coin] = d[k] + 1\\n return d[amount] if amount in d else -1\",\n \"runtime\": \"633\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n dp = [None]*(amount+1)\\n #print(dp)\\n if amount ==0 :return 0\\n if amount < coins[0] :return -1\\n while coins[-1] > amount and len(coins)>0:\\n coins.pop()\\n if len(coins) == 0:\\n return -1\\n for c in coins:\\n dp[c] = 1\\n #print(dp)\\n for i in range(coins[0]):\\n dp[i] = -1\\n #print(dp)\\n for k in range(coins[0],amount+1):\\n if dp[k] is not None:\\n continue\\n l = []\\n for c in coins:\\n if k-c >=0 and dp[k - c] != -1 :\\n l.append(dp[k - c] +1)\\n if len(l) > 0:\\n dp[k] = min(l)\\n else:\\n dp[k] = -1\\n return dp[amount]\\n\\n\\n \",\n \"runtime\": \"633\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n '''\\n coins = [a, b, c]\\n m[i] = min(m[i - a], m[i - b], m[i - c])\\n '''\\n m = [-1 for i in range(amount + 1)]\\n\\n m[0] = 0\\n for c in coins:\\n if c < amount:\\n m[c] = 1\\n\\n for i in range(1, amount + 1):\\n candidates = [m[i - c] for c in coins if i - c >= 0 and m[i-c] != -1]\\n if candidates:\\n m[i] = min(candidates) + 1\\n\\n return m[amount]\",\n \"runtime\": \"652\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n INF = amount + 1\\n mnc = [INF] * (amount + 1)\\n mnc[0] = 0\\n \\n for c in coins:\\n for a in range(c, amount + 1):\\n mnc[a] = min(mnc[a], 1 + mnc[a - c])\\n \\n return mnc[amount] if mnc[amount] < INF else -1\\n \\n \",\n \"runtime\": \"652\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n res = [0] * (amount + 1)\\n res[0] = 1\\n coins = sorted(coins)\\n\\n for coin in coins:\\n for i in range(coin, amount + 1):\\n if res[i-coin] == 0:\\n continue\\n elif i-coin == 0:\\n res[i] = 1\\n continue\\n elif res[i] == 0:\\n res[i] = res[i-coin] + 1\\n continue\\n\\n res[i] = min(res[i-coin] + 1, res[i])\\n\\n return -1 if res[amount] == 0 else res[amount]\",\n \"runtime\": \"672\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0 \\n dp = [amount + 1] * (amount + 1)\\n dp[0] = 0\\n for c in coins:\\n for i in range(c, len(dp)):\\n dp[i] = min(dp[i], 1 + dp[i - c])\\n if dp[-1] > amount:\\n return -1\\n return dp[-1]\",\n \"runtime\": \"672\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0\\n \\n for c in coins:\\n for i in range(c, amount + 1):\\n dp[i] = min(dp[i], dp[i - c] + 1)\\n return dp[-1] if dp[-1] != float('inf') else -1\",\n \"runtime\": \"692\"\n },\n {\n \"code\": \"class Solution:\\n\\n \\n\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n minc = float(inf)\\n\\n @cache\\n def dfs(amt):\\n if amt < 0:\\n return -1\\n if amt == 0:\\n return 0\\n\\n n = coins\\n tres = []\\n for c in n:\\n t = dfs(amt - c)\\n if t != -1:\\n tres.append(t)\\n if len(tres) == 0:\\n return -1\\n return min(tres) + 1\\n\\n return dfs(amount)\\n\",\n \"runtime\": \"692\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: list[int], amount: int) -> int:\\n # dp[i] := the minimum number Of coins to make up i\\n dp = [0] + [amount + 1] * amount\\n\\n for coin in coins:\\n for i in range(coin, amount + 1):\\n dp[i] = min(dp[i], dp[i - coin] + 1)\\n\\n return -1 if dp[amount] == amount + 1 else dp[amount]\",\n \"runtime\": \"731\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [amount + 1] * (amount + 1)\\n dp[0] = 0\\n\\n for c in coins:\\n for a in range(c, amount + 1):\\n dp[a] = min(dp[a], dp[a - c] + 1)\\n \\n return dp[amount] if dp[amount] != (amount + 1) else -1\",\n \"runtime\": \"731\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # init\\n dp = [float(\\\"inf\\\")] * (amount + 1) # to return dp[amount] later\\n dp[0] = 0\\n # now build from the ground up\\n for i in range(1, amount + 1):\\n dp[i] = 1 + min([dp[i-c] for c in coins if i-c >= 0], default=float(\\\"inf\\\"))\\n\\n return dp[amount] if dp[amount] != float(\\\"inf\\\") else -1\",\n \"runtime\": \"751\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount==0:\\n return 0\\n Bar=amount+1\\n pool=[Bar for _ in range(amount+1)]\\n pool[0]=0\\n for p in range(1, amount+1):\\n for c in coins:\\n if p>=c:\\n pool[p]=min(pool[p], 1+pool[p-c])\\n return pool[-1] if pool[-1]<Bar else -1\",\n \"runtime\": \"751\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')]*(amount+1)\\n dp[0] = 0\\n \\n for coin in coins:\\n for i in range(coin, amount+1):\\n dp[i] = min(dp[i], dp[i-coin]+1)\\n\\n return dp[amount] if dp[amount] != float('inf') else -1\\n \",\n \"runtime\": \"771\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # if not coins:\\n # return 0\\n\\n # n = len(coins)\\n\\n # def helper(idx, amount):\\n # if amount == 0:\\n # return 0\\n \\n # if idx < n and amount > 0:\\n # min_cost = float('inf')\\n\\n # for x in range(0, amount // coins[idx] + 1):\\n\\n # result = helper(idx + 1, amount - x * coins[idx])\\n # if result != -1:\\n # min_cost = min (min_cost, result + x)\\n\\n # return -1 if min_cost == float('inf') else min_cost\\n # return -1 \\n\\n # return helper(0, amount)\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0\\n\\n for coin in coins:\\n for x in range(coin, amount + 1):\\n dp[x] = min(dp[x], dp[x - coin] + 1)\\n \\n return dp[amount] if dp[amount] != float('inf') else -1\\n\\n \\n\\n \",\n \"runtime\": \"771\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n dp = [float('inf')] * (amount +1)\\n dp[0] = 0\\n\\n for coin in coins:\\n for i in range(coin, amount +1):\\n\\n dp[i] = min(dp[i] , dp[i - coin] + 1)\\n\\n return dp[amount] if dp[amount] != float('inf') else -1\\n\\n\\n\\n \\n\",\n \"runtime\": \"790\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if not coins:\\n return -1\\n bar=amount+1\\n pool=[bar for _ in range(amount+1)]\\n pool[0]=0\\n for p in range(1, amount+1):\\n for c in coins:\\n if p>=c:\\n pool[p]=min(pool[p], pool[p-c]+1)\\n return pool[-1] if pool[-1]<bar else -1\",\n \"runtime\": \"790\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [amount + 1] * (amount + 1)\\n dp[0] = 0\\n\\n for a in range(1, amount + 1):\\n for c in coins:\\n if a - c >= 0:\\n dp[a] = min(dp[a], 1 + dp[a - c])\\n \\n return dp[amount] if dp[amount] != amount + 1 else -1\",\n \"runtime\": \"810\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0\\n for i in range(1, amount + 1):\\n for c in coins:\\n tgt = i - c\\n if tgt >= 0:\\n dp[i] = min(dp[i], dp[tgt]+1)\\n return dp[-1] if dp[-1] != float('inf') else -1\",\n \"runtime\": \"810\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [amount + 1] * (amount + 1)\\n dp[0] = 0\\n\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if (i - coin) >= 0:\\n dp[i] = min(dp[i], 1 + dp[i - coin])\\n\\n return dp[amount] if dp[amount] != (amount + 1) else -1\\n\\n \",\n \"runtime\": \"830\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0\\n for coin in coins: \\n for i in range(coin, amount + 1):\\n dp[i] = min(dp[i], dp[i-coin] + 1)\\n return dp[amount] if dp[amount] != float('inf') else -1\",\n \"runtime\": \"830\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')]*(amount+1)\\n dp[0] = 0\\n \\n for a in range(1, amount+1):\\n for c in coins:\\n if a - c >= 0:\\n dp[a] = min(dp[a], 1 + dp[a-c])\\n return dp[amount] if dp[amount] != float('inf') else -1\\n \\n\\n\\n \",\n \"runtime\": \"850\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n dp = [inf for _ in range(amount+1)]\\n dp[0] = 0\\n for i in range(amount+1):\\n for c in coins:\\n if i-c >= 0:\\n dp[i] = min(dp[i], 1 + dp[i-c])\\n\\n if dp[amount]==inf: return -1\\n return dp[amount]\",\n \"runtime\": \"850\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def solve(amt):\\n if amt == 0:\\n return 0\\n\\n if amt < 0:\\n return -1\\n\\n ans = 10001\\n for c in coins:\\n t = solve(amt - c)\\n if t != -1:\\n ans = min(t + 1, ans)\\n \\n if ans == 10001:\\n ans = -1\\n\\n return ans\\n\\n return solve(amount)\\n\",\n \"runtime\": \"869\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n MAX = amount + 1\\n dp = [amount + 1] * (amount + 1)\\n dp[0] = 0\\n for a in range(1, amount + 1):\\n for c in coins:\\n if a - c >= 0:\\n dp[a] = min(dp[a], dp[a - c] + 1)\\n return dp[amount] if dp[amount] != amount + 1 else -1\",\n \"runtime\": \"869\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [inf] * (amount + 1)\\n dp[0] = 0\\n for i in range(amount):\\n for c in coins:\\n if i + c <= amount:\\n dp[i+c] = min(dp[i]+1, dp[i+c])\\n if dp[-1] == inf:\\n return -1\\n return dp[-1]\",\n \"runtime\": \"889\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @lru_cache(None)\\n def recurse(amount):\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return math.inf\\n \\n ans = math.inf\\n for coin in coins:\\n if amount >= coin:\\n ans = min(ans, recurse(amount-coin)+1)\\n return ans\\n\\n ans = recurse(amount)\\n return ans if ans != float('inf') else -1\\n\\n\\n\",\n \"runtime\": \"889\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n dp = [float('inf') for _ in range(amount + 1)]\\n dp[0] = 0\\n\\n for i in range(len(coins)):\\n for j in range(len(dp)):\\n if coins[i] <= j:\\n dp[j] = min(dp[j], dp[j - coins[i]]+1)\\n \\n if dp[-1] == float('inf'):\\n return -1\\n else:\\n return dp[-1]\",\n \"runtime\": \"909\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n arr = [0] * (amount+1)\\n for i in range(1,amount+1):\\n arr[i] = -1\\n for coin in coins: \\n if i-coin >= 0 and arr[i-coin] != -1:\\n if arr[i] == -1:\\n arr[i] = arr[i-coin]+1\\n else:\\n arr[i] = min(arr[i],arr[i-coin]+1)\\n return arr[-1]\",\n \"runtime\": \"909\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n dp = [float(\\\"inf\\\")] * (amount+1)\\n\\n dp[0] = 0\\n\\n for i in range(1, n+1):\\n for j in range(1, amount+1):\\n if coins[i-1] <= j:\\n dp[j] = min(dp[j], 1 + dp[j - coins[i-1]])\\n\\n return dp[amount] if dp[amount] != float(\\\"inf\\\") else -1\",\n \"runtime\": \"928\"\n },\n {\n \"code\": \"'''\\n Solution: DP TOP DOWN b/c we're trying to find (combinations of coins) fewest number of coins that make up that AMOUNT.\\n \\n IOW - Use dynamic programming b/c the problem can be resolve in subproblems and there are subproblems need to compute multiple times.\\n \\n\\nDesign solution: \\n \\n 1. if coin is larger than the amount we're trying to reach, just use the previous coin[i-1] that make up that amount\\n\\n 2. dp[i][j] = fewest number of coins to reach amount j\\n dp[i][j] = min(previous number of coins that made up amount j, dp[i][current amount j - coin[i]] + 1 use current coin type)\\n \\n 3. return dp[-1][-1] as it represent THE FINAL RESULT OF FEWEST NUMBER OF COINS THAT MAKE UP THAT AMOUNT\\n \\n \\n Pseudocode:\\n initialize the 2d dp grid using the amount as cols and coins as rows, all initialize as float(inf)\\n \\n #set up the inital dp cases\\n dp[0][0] = 0\\n \\n #build the first row of dp first using the first coin, so that other coins can compare\\n for j in range(amount + 1):\\n if amount j >= first_coin:\\n dp[0][j] = dp[0][j - first_coin] + 1\\n \\n for i in range(1, len(coins)):\\n for j in range(amount + 1):\\n if coins[i] > amount j we're trying to reach:\\n dp[i][j] = use the previous coin type that made up amount j \\n elif amount j is >= current type of coin[i]:\\n #find the fewest number of coin that made up amount j either using current coin or previous number of coins\\n dp[i][j] = min(previous number of coins that made up amount j, dp[i][current amount j - coin[i]] + 1)\\n \\n if last elm of dp is float(inf) that means the amount of money cannot be made up by any combination of the coins return -1\\n \\n return last elm of dp\\n \\n EX\\n coins = [1,2,5] amount = 5\\n j\\n 0,1,2,3,4,5 -> each amount j to reach using each available kind of coins\\n (0)1 [0,1,2,3,4,5]\\n (1)2 [0,1,1,2,2,3]\\n (2)5 [0,1,1,2,2,1]\\n |\\n coins i\\n \\n \\n EX2:\\n coins = [2], amount = 3\\n \\n 0,1,2,3 \\n 0(2)[0,f,1,f]\\n \\n since last of elm of dp is f so return -1\\n \\n \\n coins = [1,2] amount = 2\\n 0 1 2\\n 1 [0 1 2]\\n 2 [0 1 1]\\n'''\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[float('inf')] * (amount + 1) for _ in range(len(coins))]\\n dp[0][0] = 0\\n\\n for amt in range(amount + 1):\\n if coins[0] <= amt:\\n dp[0][amt] = dp[0][amt - coins[0]] + 1\\n\\n for i in range(1, len(coins)):\\n for amt in range(amount + 1):\\n if coins[i] <= amt:\\n dp[i][amt] = min(dp[i-1][amt], dp[i][amt - coins[i]] + 1)\\n else:\\n dp[i][amt] = dp[i-1][amt]\\n\\n res = dp[-1][-1]\\n\\n if res == float(\\\"inf\\\"):\\n return -1\\n\\n return res \\n\\n \\n \\n\\n\\n\\n \",\n \"runtime\": \"928\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n if amount in coins:\\n return 1\\n\\n dp = [float('inf')] * (amount + 1)\\n for i in range(1, amount+1):\\n if i in coins:\\n dp[i] = 1\\n continue\\n\\n min_value = float('inf')\\n for value in coins:\\n if i - value < 0:\\n continue\\n min_value = min(min_value, dp[i-value])\\n\\n if min_value < float('inf'):\\n dp[i] = 1 + min_value\\n if dp[-1] < float('inf'):\\n return dp[-1]\\n return -1\\n\",\n \"runtime\": \"948\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n dp = [-1] * (amount + 1)\\n dp[0] = 0\\n\\n for i in range(1, amount + 1):\\n num = float('inf')\\n for c in coins:\\n if i - c >= 0 and dp[i - c] != -1:\\n num = min(num, dp[i - c] + 1)\\n\\n if num != float('inf'):\\n dp[i] = num\\n\\n print(dp)\\n return dp[-1]\\n\",\n \"runtime\": \"948\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n def coinChange(self, coins: list[int], amount: int) -> int:\\n # If amount is 0, no coins are needed.\\n if amount == 0:\\n return 0\\n \\n # Memoization using lru_cache\\n @lru_cache(None)\\n def dp(rem_amount):\\n # Base cases\\n if rem_amount < 0:\\n return float('inf') # No valid solution\\n if rem_amount == 0:\\n return 0 # No coins needed when amount is 0\\n \\n # Try every coin and choose the one that gives the minimum number of coins\\n min_coins = float('inf')\\n for coin in coins:\\n min_coins = min(min_coins, dp(rem_amount - coin) + 1)\\n \\n return min_coins\\n \\n # Get the result from the dp function\\n result = dp(amount)\\n return result if result != float('inf') else -1\\n\",\n \"runtime\": \"968\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n coins.sort()\\n dp = [amount+1 for x in range(amount+1)]\\n\\n for i in coins:\\n if i <= amount:\\n dp[i] = 1\\n\\n for value in range(len(dp)):\\n for coin in coins:\\n if value-coin < 0 or coin > amount:\\n continue\\n dp[value] = min(dp[value],dp[value-coin]+1)\\n\\n return -1 if dp[amount] > amount else dp[amount]\",\n \"runtime\": \"968\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n prev = [0]*(amount+1)\\n\\n for i in range(amount+1):\\n\\n if i % coins[0] == 0:\\n prev[i] = i // coins[0]\\n\\n else:\\n prev[i] = int(1e9)\\n\\n\\n for i in range(1,n):\\n cur = [0]*(amount+1)\\n for j in range(amount+1):\\n\\n notpick = prev[j]\\n pick = int(1e9)\\n\\n if coins[i] <= j:\\n pick = 1 + cur[j-coins[i]]\\n\\n cur[j] = min(pick,notpick)\\n\\n prev = cur\\n\\n if prev[amount] == int(1e9):\\n return -1\\n\\n return prev[amount]\\n \",\n \"runtime\": \"988\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {0: 0}\\n for c in coins:\\n dp[c] = 1\\n \\n for i in range(amount + 1):\\n if i in dp: continue\\n min_steps = float('inf')\\n for c in coins:\\n if (i - c) in dp:\\n min_steps = min(min_steps, dp[i - c])\\n if min_steps != float('inf'): dp[i] = min_steps+1\\n # print(dp)\\n \\n return dp[amount] if amount in dp else -1\\n \\n\\n # if amount == 0: return 0\\n # queue = deque([(amount, 0)])\\n # visited = [False] * (amount+1)\\n # while queue:\\n # # print(queue)\\n # curr, steps = queue.popleft()\\n # # If BFS, the first element reaching 0 must be the solution. \\n # if curr == 0: return steps\\n # if visited[curr]: continue\\n # visited[curr] = True\\n\\n # for coin in coins:\\n # if curr - coin >= 0 and not visited[curr - coin]:\\n # queue.append((curr - coin, steps + 1))\\n\\n # return -1\",\n \"runtime\": \"988\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n @cache\\n def dp(a):\\n if a == 0:\\n return 0\\n elif a < 0:\\n return -1\\n \\n minc = float(\\\"inf\\\")\\n\\n for c in coins:\\n \\n num = dp(a-c) + 1\\n if num != 0:\\n minc = min(minc, num)\\n\\n return minc if minc != float(\\\"inf\\\") else -1\\n \\n return dp(amount)\\n \\n \",\n \"runtime\": \"1007\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n minWays = [float('inf')] * (amount + 1)\\n minWays[0] = 0\\n\\n for amt in range(len(minWays)):\\n for coin in coins:\\n if amt + coin < len(minWays):\\n minWays[amt + coin] = min(minWays[amt + coin], minWays[amt] + 1)\\n \\n return minWays[-1] if minWays[-1] != float('inf') else -1\",\n \"runtime\": \"1007\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n @cache\\n def dfs(rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n min_cost = float('inf')\\n for coin in coins:\\n res = dfs(rem - coin)\\n if res != -1:\\n min_cost = min(min_cost, res + 1)\\n return min_cost if min_cost != float('inf') else -1\\n\\n return dfs(amount)\",\n \"runtime\": \"1027\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {0:0}\\n for coin in coins:\\n dp[coin] = 1\\n \\n for i in range(1, amount+1):\\n minCoins = inf\\n for coin in coins:\\n if coin <= i and i-coin in dp:\\n minCoins = min(minCoins, 1+dp[i-coin])\\n dp[i] = minCoins\\n \\n if dp[amount] == inf:\\n return -1\\n return dp[amount]\",\n \"runtime\": \"1027\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n m, n = len(coins), amount\\n f = [[inf] * (n + 1) for _ in range(m + 1)]\\n f[0][0] = 0\\n for i, x in enumerate(coins, 1):\\n for j in range(n + 1):\\n f[i][j] = f[i - 1][j]\\n if j >= x:\\n f[i][j] = min(f[i][j], f[i][j - x] + 1)\\n return -1 if f[m][n] >= inf else f[m][n]\",\n \"runtime\": \"1047\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n\\nState: current index and amount\\n\\nRecurrence Relation: dp(i, a) = min(dp(i, a - coins[i]) + 1, dp(i + 1, a))\\n\\nBase Case: i == len(coins) or amount <= 0\\n\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n n = len(coins)\\n dp = [[inf] * (amount + 1) for _ in range(n)]\\n\\n for r in range(len(dp)):\\n dp[r][0] = 0\\n for i in range(n):\\n for a in range(1, amount + 1):\\n if a < coins[i] and i == 0:\\n continue\\n elif a < coins[i]:\\n dp[i][a] = dp[i - 1][a]\\n else:\\n dp[i][a] = min(dp[i][a - coins[i]] + 1, dp[i - 1][a])\\n return dp[-1][-1] if dp[-1][-1] != inf else -1\",\n \"runtime\": \"1047\"\n },\n {\n \"code\": \"# from functools import lru_cache\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {c:1 for c in coins}\\n def dfs(i):\\n if i in memo:\\n return memo[i]\\n if i == 0:\\n return 0\\n result = float(\\\"inf\\\")\\n for coin in coins:\\n if coin < i:\\n result = min(result, dfs(i-coin))\\n memo[i] = result + 1\\n return memo[i]\\n res = dfs(amount)\\n return res if res != float(\\\"inf\\\") else -1\\n \\n \\n \\n # @cache\\n # def dp(change):\\n # if change < 0:\\n # return -1\\n # if change == 0:\\n # return 0\\n # min_cost = float('inf')\\n # for coin in coins:\\n # res = dp(change-coin)\\n # if res != -1:\\n # min_cost = min( min_cost,\\n # res+1)\\n # return min_cost if min_cost != float('inf') else -1\\n # return dp(amount)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # @lru_cache(None)\\n # def dp(change):\\n # if change < 0:\\n # return -1\\n # if change == 0:\\n # return 0\\n # min_cost = float('inf')\\n # for i in range(len(coins)):\\n # res = dp(change - coins[i])\\n # if res != -1:\\n # min_cost = min(min_cost, res+1)\\n # return -1 if min_cost == float('inf') else min_cost\\n \\n # return dp(amount)\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # @lru_cache(None)\\n # def dfs(remaining):\\n # if remaining == 0:\\n # return 0\\n # if remaining < 0:\\n # return -1\\n # minCost = float('inf')\\n # for coin in coins:\\n # res = dfs(remaining-coin)\\n # if res != -1:\\n # minCost = min(minCost, res+1)\\n # return minCost if minCost != float('inf') else -1\\n # return dfs(amount)\\n \\n\\n \\n \\n \\n\\n\\n \",\n \"runtime\": \"1066\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cache = {0:0}\\n for am in range(1, amount + 1):\\n cache[am] = min([cache.get(am - coin, float('inf')) for coin in coins]) + 1\\n return cache[amount] if cache[amount] != float('inf') else -1\\n\\n \\n \\n\\n\\n\",\n \"runtime\": \"1066\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [-1]*(amount+1)\\n dp[0]=0\\n for i in range(1,amount+1): \\n for j in range(len(coins)):\\n if i-coins[j]>=0 and dp[i-coins[j]]!=-1:\\n if dp[i]==-1:\\n dp[i]=dp[i-coins[j]]+1\\n dp[i] = min(dp[i],dp[i-coins[j]]+1)\\n return dp[-1]\",\n \"runtime\": \"1086\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[float('inf')] * (amount+1) for _ in range(len(coins)+1)]\\n n = len(coins)\\n for i in range(n+1): \\n dp[i][0] = 0\\n # print(dp)\\n for i in range(1, amount+1): \\n minumum = float('inf')\\n for j in range(len(coins)): \\n coin = coins[j]\\n if i-coin >=0: \\n dp[j][i] = dp[n][i-coin]+1\\n minumum = min(minumum, dp[j][i])\\n \\n dp[n][i] = minumum\\n # print(dp)\\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\\n[\\n [0, 1, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf], \\n [0, inf, 1, inf, inf, inf, inf, inf, inf, inf, inf, inf], \\n [0, inf, inf, inf, inf, 1, inf, inf, inf, inf, inf, inf], \\n [0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf]]\\n\\n\",\n \"runtime\": \"1086\"\n },\n {\n \"code\": \"# dp, bottom-up, cache as dict\\nclass Solution:\\n def coinChange(self, coins, amount):\\n # min number of coins needed to get target amount (equal to the index)\\n # \\\"anmount + 1\\\" an imposbile value stays when the last element of min_coins was not modified\\n min_coins = {k: amount + 1 for k in range(amount + 1)}\\n min_coins[0] = 0 # no coins needed to get 0\\n\\n for coin in coins: # check every coin\\n for index in range(coin, amount + 1): # check each 'min_coins' index\\n # choose current amount of coins or get ammount without current coin and add 1\\n min_coins[index] = min(min_coins.get(index), min_coins.get(index - coin) + 1)\\n \\n if (amount in min_coins and # if amount exists and\\n min_coins[amount] < amount + 1): # the value is less than impossible value\\n return min_coins[amount] # valid combination\\n else:\\n return -1\",\n \"runtime\": \"1106\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def dp(cache, amountRem):\\n if amountRem == 0:\\n return 0\\n if amountRem in cache:\\n return cache[amountRem]\\n minWays = math.inf\\n for coin in coins:\\n if coin <= amountRem:\\n minWays = min(minWays, 1 + dp(cache, amountRem-coin))\\n cache[amountRem] = minWays\\n return minWays\\n \\n memo = collections.defaultdict(int)\\n op = dp({},amount)\\n if op == math.inf:\\n return -1\\n return op\",\n \"runtime\": \"1106\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memory = {0: 0}\\n def dfs(total):\\n if total in memory:\\n return memory[total]\\n num_coins = float('inf')\\n for coin in coins:\\n if total - coin >= 0:\\n num_coins = min(dfs(total - coin), num_coins)\\n memory[total] = num_coins + 1\\n return num_coins + 1\\n dfs(amount)\\n if memory[amount] == float('inf'):\\n return -1\\n return memory[amount]\",\n \"runtime\": \"1126\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n # def recurr(coins, idx, t, dp = None):\\n\\n # if not dp:\\n # dp = [-1 for i in range(t+1)]\\n\\n # if idx == 0: \\n # if t % coins[0] == 0: \\n # dp[t] = int(t / coins[0])\\n # return dp[t]\\n\\n\\n # not_pick = recurr(coins, idx - 1, t, dp)\\n\\n # pick = float(\\\"inf\\\")\\n\\n # if t - coins[idx] >= 0:\\n # if dp[t - coins[idx]] != -1:\\n # pick = 1 + dp[t - coins[idx]]\\n # else:\\n # pick = 1 + recurr(coins, idx, t - coins[idx], dp)\\n \\n # dp[t] = min(pick, not_pick)\\n # return dp[t]\\n \\n # return recurr(coins, len(coins) - 1, amount) \\n\\n dp = [float(\\\"inf\\\") for i in range(amount+1)]\\n\\n for t in range(amount + 1):\\n if t % coins[0] == 0:\\n dp[t] = t // coins[0]\\n \\n for i in range(1, len(coins)):\\n for j in range(amount + 1):\\n not_pick = dp[j]\\n\\n pick = float(\\\"inf\\\")\\n\\n if j >= coins[i]:\\n pick = 1 + dp[j-coins[i]]\\n\\n dp[j] = min(pick, not_pick)\\n \\n if dp[amount] != float(\\\"inf\\\"):\\n return dp[amount]\\n else:\\n return -1\\n\\n\\n\\n \\n \",\n \"runtime\": \"1126\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # brute force approach here is a decision tree where at each step, we can pick from n coins. 2^n. and then for the multiple possilbe solutions, we pick the smallest one\\n memo = {}\\n def dfs(currSum):\\n if currSum in memo:\\n return memo[currSum]\\n if currSum > amount:\\n return float(\\\"inf\\\")\\n if currSum == amount:\\n # how many coins does it take to get from curr amount to amount?\\n return 0\\n minCoins = float('inf')\\n for coin in coins:\\n minCoins = min(minCoins, 1 + dfs(currSum + coin))\\n memo[currSum] = minCoins \\n return minCoins\\n \\n res = dfs(0)\\n return res if res != float('inf') else -1\",\n \"runtime\": \"1145\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n cache = {}\\n\\n def min_n_coins(amount_rest):\\n if amount_rest in cache:\\n return cache[amount_rest]\\n\\n if amount_rest == 0:\\n return 0\\n if amount_rest <0:\\n return float(\\\"inf\\\")\\n else:\\n min_c = float(\\\"inf\\\")\\n for coin in coins:\\n # list the possibilities\\n min_c = min(min_c, 1 + min_n_coins(amount_rest-coin))\\n \\n cache[amount_rest] = min_c\\n return min_c\\n \\n min_amount = min_n_coins(amount)\\n return -1 if min_amount == float(\\\"inf\\\") else min_amount\\n\\n\",\n \"runtime\": \"1145\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n '''\\n 0 to 5\\n [0,1,1,2,2,1]\\n\\n [0,-1,1,-1]\\n '''\\n dp = [[0 for _ in range(amount+1)] for _ in range(len(coins)+1)]\\n\\n for j in range(len(dp[0])):\\n dp[0][j] = float('inf')\\n if j%coins[0]==0:\\n dp[1][j] = j//coins[0]\\n else:\\n dp[1][j] = float('inf')\\n \\n dp[0][0] = 0\\n\\n for i in range(2, len(dp)):\\n for j in range(1, len(dp[0])):\\n if coins[i-1] <= j:\\n dp[i][j] = min (dp[i-1][j], dp[i][j-coins[i-1]] + 1)\\n else:\\n dp[i][j] = dp[i-1][j]\\n\\n\\n val = dp[len(coins)][amount] \\n if val != float('inf'):\\n return val\\n return -1\",\n \"runtime\": \"1165\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp={}\\n dp[0]=0\\n for i in range(amount+1):\\n for j in range(len(coins)):\\n if i- coins[j] in dp:\\n if i in dp:\\n dp[i]= min(dp[i], dp[i-coins[j]]+1)\\n else:\\n dp[i]= dp[i-coins[j]]+1\\n # return dp[2]\\n if amount in dp:\\n return dp[amount]\\n return -1\\n \\n \",\n \"runtime\": \"1165\"\n },\n {\n \"code\": \"class Solution:\\n def find(self,coins:List[int],n:int,amount:int,dp:List[List[int]])->int:\\n if n==0:\\n if amount%coins[n]==0:\\n return amount//coins[n]\\n else:\\n return float('inf')\\n if dp[n][amount]==-1:\\n not_t=0+self.find(coins,n-1,amount,dp)\\n take=float('inf')\\n if coins[n]<=amount:\\n take=1+self.find(coins,n,amount-coins[n],dp)\\n dp[n][amount]=min(not_t,take)\\n return dp[n][amount]\\n else:\\n return dp[n][amount]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n=len(coins)\\n dp = [[-1 for _ in range(amount + 1)] for _ in range(n)]\\n ans=self.find(coins,n-1,amount,dp)\\n if ans>=float('inf'):\\n return -1\\n else:\\n return ans\\n\\n\\n\\n \",\n \"runtime\": \"1185\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n coins = sorted(coins)\\n mem = {}\\n\\n def getCount(amount):\\n nonlocal coins\\n\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return -1\\n \\n if amount in mem:\\n return mem[amount]\\n mincount = math.inf\\n for c in coins[::-1]:\\n count = getCount(amount-c)\\n if count != -1:\\n mincount = min(count+1, mincount)\\n if mincount != math.inf:\\n mem[amount] = mincount\\n else:\\n mem[amount] = -1\\n\\n return mem[amount]\\n \\n return getCount(amount)\\n\",\n \"runtime\": \"1185\"\n },\n {\n \"code\": \"# top down recursive memoization\\n # we want to find min number of coins to make up amount\\n # pass current amount\\n \\n # recursion: (amount)\\n # base case: amount == 0\\n # reached \\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n def coinChangeRecursive(amount):\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return float('inf')\\n if amount in memo:\\n return memo[amount]\\n \\n min_count = float('inf')\\n for coin in coins:\\n min_count = min(min_count, coinChangeRecursive(amount - coin) + 1)\\n \\n memo[amount] = min_count\\n return min_count\\n \\n res = coinChangeRecursive(amount)\\n return res if res < float('inf') else -1\\n\\n \",\n \"runtime\": \"1204\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[float(\\\"inf\\\")] * (amount + 1) for _ in range(len(coins) + 1)]\\n\\n for i in range(len(coins)+1):\\n dp[i][0] = 0\\n\\n for i in range(len(coins) + 1):\\n for j in range(amount + 1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\\n else:\\n dp[i][j] = dp[i-1][j]\\n \\n return dp[i][j] if dp[i][j] != float(\\\"inf\\\") else -1\\n\\n \\n \",\n \"runtime\": \"1204\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0\\n for i in range(1,amount + 1):\\n for coin in coins:\\n if i - coin >= 0 and dp[i - coin] != float('inf'):\\n dp[i] = min(dp[i],1 + dp[i - coin])\\n if dp[-1] == float('inf'):\\n return -1\\n else:\\n return dp[-1]\\n\\n \",\n \"runtime\": \"1224\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @lru_cache(None)\\n def dfs(i):\\n if i < 0:\\n return -1\\n if i == 0:\\n return 0\\n # start from idx 1, calculate the min cnt to reach idx i\\n min_cost = float(\\\"Inf\\\")\\n for coin in coins:\\n val = dfs(i-coin)\\n if val != -1:\\n min_cost = min(min_cost, dfs(i-coin)+1)\\n if min_cost == float(\\\"Inf\\\"):\\n return -1\\n \\n return min_cost\\n \\n return dfs(amount)\\n\\n \\n \\n\\n\\n \\n\\n\\n\",\n \"runtime\": \"1224\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n L = [0] * (amount + 1)\\n\\n for N in range(1, amount + 1):\\n curr = []\\n for coin in coins:\\n if N - coin >= 0 and L[N - coin] != -1:\\n curr.append(L[N - coin])\\n L[N] = 1 + min(curr) if curr != [] else -1\\n \\n return L[amount]\\n\\n\",\n \"runtime\": \"1244\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n dp = {}\\n def dfs(rem):\\n if rem == 0:\\n return 0\\n \\n if rem < 0:\\n return float(\\\"inf\\\")\\n\\n if rem in dp:\\n return dp[rem]\\n\\n minNumCoins = float(\\\"inf\\\")\\n for i in range(len(coins)):\\n minNumCoins = min(minNumCoins, 1 + dfs(rem - coins[i]))\\n \\n dp[rem] = minNumCoins\\n return minNumCoins\\n \\n total = dfs(amount)\\n\\n if math.isinf(total):\\n return -1\\n \\n return total\",\n \"runtime\": \"1244\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # n=amount\\n \\n # if not n: return 0\\n # coins = [c for c in coins if c<=n]\\n # if not coins: return -1\\n # if len(coins) < 2:\\n # ret = n // coins[0]\\n # return -1 if n-ret*coins[0] else ret\\n # if n & 1 and not any(c & 1 for c in coins): return -1\\n \\n if amount ==0:\\n return 0\\n if amount < min(coins):\\n return -1\\n di = {a: 10**6 for a in range(1, amount + 1)}\\n di[0] = 0\\n\\n for a in range(1,amount+1):\\n \\n for c in coins:\\n # print(a,c)\\n # print(di)\\n # print()\\n if a-c ==0:\\n di[a] = 1\\n elif a-c >0:\\n di[a] = min(di[c]+di[a-c],di[a])\\n else:\\n continue\\n return -1 if di[amount] == 10**6 else di[amount]\\n \",\n \"runtime\": \"1264\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp=[[inf]*(amount+1) for _ in range(len(coins)+1)]\\n for i in range(len(coins)+1):dp[i][0]=0\\n for i in range(1,len(coins)+1):\\n for j in range(amount+1):\\n if coins[i-1]<=j:\\n dp[i][j]=min(dp[i][j],1+dp[i][j-coins[i-1]],dp[i-1][j])\\n else:dp[i][j]=min(dp[i][j],dp[i-1][j])\\n return dp[len(coins)][amount] if dp[len(coins)][amount]!=inf else -1\",\n \"runtime\": \"1264\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins = sorted(coins, reverse=True)\\n\\n # f(i, rem) = min(1 + f(j, rem-i) for j in i:len(arr))\\n def minCoins(rem: int, dp: Dict[Tuple[int,int], int]) -> int:\\n if rem == 0:\\n return 0\\n elif rem < 0:\\n return float('inf')\\n if rem in dp:\\n return dp[rem]\\n dp[rem] = float('inf')\\n for coin in coins:\\n dp[rem] = min(dp[rem], 1 + minCoins(rem-coin, dp))\\n return dp[rem]\\n \\n ans = minCoins(amount, {})\\n return ans if ans != float('inf') else -1\",\n \"runtime\": \"1283\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float(\\\"inf\\\")]*(amount + 1)\\n dp[0] = 0\\n\\n for i in range(1, amount+1):\\n for c in coins:\\n if (i - c >= 0) and dp[i-c] != float(\\\"inf\\\"):\\n dp[i] = min(dp[i], dp[i-c]+1)\\n\\n if dp[amount] == float(\\\"inf\\\"):\\n return -1\\n return dp[amount]\",\n \"runtime\": \"1283\"\n },\n {\n \"code\": \"from collections import defaultdict\\r\\nclass Solution:\\r\\n def coinChange(self, coins: List[int], amount: int) -> int:\\r\\n memo = defaultdict(int)\\r\\n minCoin = min(coins)\\r\\n def dp(i):\\r\\n if i == 0:\\r\\n return 0\\r\\n if i < minCoin:\\r\\n return float(\\\"inf\\\")\\r\\n if i in memo:\\r\\n return memo[i]\\r\\n acc = float(\\\"inf\\\")\\r\\n for j in range(len(coins)):\\r\\n if i >= coins[j]:\\r\\n acc = min(acc, 1 + dp(i - coins[j]))\\r\\n memo[i] = acc\\r\\n return memo[i]\\r\\n \\r\\n res = dp(amount)\\r\\n if res == float(\\\"inf\\\"):\\r\\n return -1\\r\\n return dp(amount)\\r\\n \",\n \"runtime\": \"1303\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def tab():\\n dp = [inf] * (amount + 1)\\n dp[0] = 0\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if coin == i:\\n dp[i] = 1\\n break\\n elif coin > i:\\n continue\\n else:\\n dp[i] = min(dp[i], 1 + dp[i-coin])\\n return -1 if dp[amount] == inf else dp[amount]\\n \\n def memo(index, remain):\\n if remain < 0:\\n return inf\\n if remain == 0:\\n return 0\\n if index == len(coins):\\n return inf\\n if remain in cache:\\n return cache[remain]\\n #min_coin = inf\\n \\n take = 1 + memo(index, remain - coins[index])\\n skip = memo(index + 1, remain)\\n min_coin = min(take, skip)\\n #return min_coin\\n cache[remain] = min_coin\\n return cache[remain]\\n\\n #return tab()\\n cache = {}\\n #min_coin = memo(0, amount)\\n #return -1 if min_coin == inf else min_coin\\n\\n @lru_cache(None)\\n def dfs2(index, rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n min_cost = float('inf')\\n for i in range(index, len(coins)):\\n take = dfs(i, rem - coins[i])\\n if take != -1:\\n min_cost = min(min_cost, take + 1)\\n skip = dfs(i + 1 , rem)\\n if skip != -1:\\n min_cost = min(min_cost, skip) \\n return min_cost if min_cost != float('inf') else -1\\n \\n #return dfs2(0, amount)\\n\\n \\n memo = {}\\n\\n def dfs(rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n if rem in memo:\\n return memo[rem]\\n min_cost = float('inf')\\n for coin in coins:\\n res = dfs(rem - coin)\\n if res != -1:\\n min_cost = min(min_cost, res + 1)\\n memo[rem] = min_cost\\n return memo[rem] if min_cost != float('inf') else -1\\n\\n return dfs(amount)\",\n \"runtime\": \"1303\"\n },\n {\n \"code\": \"class Solution:\\n def f(self,coins, amount,i,n,dp):\\n if(i==n and amount==0):\\n return 0\\n if amount<0: return float('inf')\\n if i==n: return float('inf')\\n if(dp[i][amount]!=None): return dp[i][amount]\\n not_take=self.f(coins,amount,i+1,n,dp)\\n take=float('inf')\\n if(coins[i]<=amount) :\\n take=1+self.f(coins,amount-coins[i],i,n,dp)\\n dp[i][amount]=min(take,not_take)\\n return dp[i][amount]\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n=len(coins)\\n dp = [[None] * (amount + 1) for _ in range(n)]\\n ans=self.f(coins,amount,0,n,dp)\\n if ans==float('inf'):\\n return -1\\n return ans\\n \",\n \"runtime\": \"1362\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {}\\n dp[0] = 0\\n for i in range(amount):\\n for c in coins:\\n if i + 1 - c in dp:\\n dp[i + 1] = min(dp.get(i + 1, amount + 1), dp[i + 1 - c] + 1)\\n return dp.get(amount, -1)\",\n \"runtime\": \"1362\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {}\\n def solve(curr):\\n if curr > amount:\\n return 10**18\\n if curr==amount:\\n return 0\\n if curr in dp:\\n return dp[curr]\\n\\n dp[curr] = 10**18\\n # print(dp)\\n for i in range(len(coins)):\\n s = solve(curr+coins[i])\\n if s!= -1:\\n dp[curr] = min(dp[curr], 1+s)\\n if dp[curr] == 10**18:\\n return -1\\n return dp[curr]\\n # print(dp)\\n return solve(0)\",\n \"runtime\": \"1382\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n sorted_coins = sorted(set(coins), reverse=True)\\n memo = {k: 1 for k in sorted_coins} | {0: 0}\\n return self.coinChangeHelper(sorted_coins, amount, memo)\\n \\n def coinChangeHelper(self, coins, amount, memo) -> int:\\n \\\"\\\"\\\"coinChange returns fewest number of coins that make up amount.\\\"\\\"\\\"\\n if amount in memo:\\n return memo[amount]\\n if coins[0] > amount:\\n coins = [c for c in coins if c <= amount]\\n fewest = math.inf\\n for coin in coins:\\n current = self.coinChangeHelper(coins, amount - coin, memo)\\n if current != -1:\\n memo[amount - coin] = current\\n fewest = min(fewest, 1 + current)\\n else:\\n memo[amount - coin] = -1\\n #rint(coins, amount, fewest)\\n \\n if fewest != math.inf:\\n memo[amount] = fewest\\n return fewest\\n return -1\\n \",\n \"runtime\": \"1382\"\n },\n {\n \"code\": \"class Solution:\\n def coinChangeHelper(self, coins, amount, cdict):\\n if amount < 0:\\n return sys.maxsize\\n elif amount == 0:\\n return 0\\n elif amount in cdict:\\n return cdict[amount]\\n else:\\n res = sys.maxsize\\n for coin in coins:\\n if coin > amount:\\n continue\\n tempres = self.coinChangeHelper(coins, amount - coin, cdict)\\n if tempres != sys.maxsize:\\n cdict[amount - coin] = tempres \\n tempres += 1\\n res = min(res, tempres)\\n cdict[amount] = res \\n return res\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cdict = {}\\n for coin in coins:\\n cdict[coin] = 1\\n \\n res = self.coinChangeHelper(coins, amount, cdict)\\n if res == sys.maxsize:\\n return -1\\n else:\\n return res\\n \",\n \"runtime\": \"1402\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n rows, cols = len(coins) + 1, amount + 1\\n dp = [[0 for _ in range(cols)] for _ in range(rows)]\\n\\n for col in range(1, cols):\\n dp[0][col] = float('inf')\\n\\n for i in range(1, rows):\\n for j in range(1, cols):\\n dp[i][j] = dp[i - 1][j]\\n if j >= coins[i - 1]:\\n dp[i][j] = min(dp[i][j], dp[i][j - coins[i - 1]] + 1)\\n \\n return -1 if dp[rows - 1][cols - 1] == float('inf') else dp[rows - 1][cols - 1]\\n\\n\\n\\n# knapsack\\n# dp[i][j]: fewest number of coins to make up j amount using first i items\\n\\n# base case:\\n# dp[0][any]: max infinite -> for future finding minimum for any amount (exclude dp[0][0])\\n# dp[any][0]: 0 -> already find the minimum (include dp[0][0])\\n\\n# induction rule:\\n# dp[i][j] = min{\\n# dp[i][j - coins[i]] + 1 take it (j >= coins[i])\\n# dp[i - 1][j] not take it\\n# }\\n\\n\\n\",\n \"runtime\": \"1402\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def f(memo, n):\\n if memo[n]:\\n return memo[n]\\n if n==0:\\n return 0\\n memo[n] = float(\\\"inf\\\")\\n for coin in coins:\\n if n-coin >= 0:\\n memo[n] = min(memo[n], f(memo, n-coin)+1)\\n return memo[n]\\n\\n memo = collections.defaultdict(int)\\n tmp = f(memo, amount)\\n\\n return tmp if tmp != float(\\\"inf\\\") else -1\\n \",\n \"runtime\": \"1421\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n x = [[1e9 for i in range(len(coins))] for j in range(amount + 1)]\\n for i in range(len(coins)):\\n x[0][i] = 0\\n\\n for i in range(amount+1):\\n for j in range(len(coins)):\\n x[i][j] = min(x[i-coins[j]][j] + 1 if i-coins[j] >= 0 else 1e9, x[i][j-1])\\n \\n output = x[amount][len(coins)-1]\\n return output if output < 1e9 else -1\",\n \"runtime\": \"1421\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, cs: List[int], amount: int) -> int:\\n cs.sort(reverse=True)\\n\\n @cache\\n def solve(x, i):\\n if x < 0 or i >= len(cs):\\n return float('inf')\\n elif x == 0:\\n return 0\\n return min(1 + solve(x-cs[i], i), solve(x, i+1))\\n \\n result = solve(amount, 0)\\n return result if result < float('inf') else -1 \\n\\n \",\n \"runtime\": \"1441\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n w = amount \\n n = len(coins)\\n\\n dp = [[float(\\\"inf\\\")]*(w+1) for _ in range(n+1)]\\n\\n for i in range(n+1):\\n dp[i][0] = 0\\n\\n for j in range(1,w+1):\\n if j%coins[0]==0:\\n dp[1][j] = j//coins[0]\\n \\n \\n for i in range(1,n+1):\\n for j in range(1,w+1):\\n not_take = dp[i-1][j]\\n take = float(\\\"inf\\\")\\n if coins[i-1]<=j:\\n take = dp[i][j-coins[i-1]]+1\\n dp[i][j] = min(take,not_take)\\n\\n if dp[n][w]!=float(\\\"inf\\\"):\\n return dp[n][w]\\n else:\\n return -1\\n \\n\\n\\n\\n\\n\",\n \"runtime\": \"1441\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n dp = {}\\n def dfs(total = 0):\\n \\n mn = float(\\\"inf\\\") # by default is impossible to reach amount if no changes\\n\\n if total in dp:\\n return dp[total]\\n\\n if total == amount:\\n return 0\\n\\n if total > amount:\\n return float(\\\"inf\\\") # impossible\\n\\n for c in coins:\\n\\n reached = dfs( total + c)\\n mn = min(mn, reached + 1)\\n\\n dp[total] = mn\\n return dp[total]\\n\\n res = dfs()\\n return -1 if res == float(\\\"inf\\\") else res \\n\\n\\n \",\n \"runtime\": \"1461\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp=[[float('inf') for _ in range(amount+1)] for _ in range(len(coins))]\\n\\n for i in range(len(coins)):\\n dp[i][0]=0\\n \\n for k in range(1,amount+1):\\n if k-coins[0]>=0:\\n dp[0][k]=1+dp[0][k-coins[0]]\\n\\n for i in range(1,len(coins)):\\n for k in range(1,amount+1):\\n dp[i][k]=dp[i-1][k]\\n if k-coins[i]>=0:\\n dp[i][k]=min(dp[i][k],1+dp[i][k-coins[i]])\\n \\n mincoins=float('inf')\\n for i in range(len(coins)):\\n mincoins=min(mincoins,dp[i][amount])\\n \\n if mincoins>10**6:\\n return -1\\n return mincoins\\n \\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n x=[[10**8 for _ in range(amount+1)] for _ in coins]\\n\\n for i in range(len(coins)):\\n x[i][0]=0\\n k=0\\n while k*coins[0]<=amount:\\n x[0][k*coins[0]]=k\\n k+=1\\n \\n for i in range(1,len(coins)):\\n for amt in range(amount+1):\\n x[i][amt]=x[i-1][amt]\\n if amt-coins[i]>=0:\\n x[i][amt]=min(x[i][amt],x[i][amt-coins[i]]+1)\\n #for k in range(amt//coins[i]+1):\\n # x[i][amt]=min(x[i][amt],x[i-1][amt-k*coins[i]]+k)\\n\\n if x[-1][amount]>amount:\\n return -1\\n else:\\n return x[-1][amount]\\n \\n \\n coins.sort()\\n coins.reverse()\\n x=[{} for _ in coins]\\n\\n for m in range(0,amount+1):\\n if m*coins[0]<=amount:\\n x[0][m*coins[0]]=m\\n else:\\n break\\n\\n for j in range(1,len(coins)):\\n for qty in x[j-1]:\\n for l in range(0,amount+1):\\n if qty+l*coins[j]>amount:\\n break\\n if qty+l*coins[j] not in x[j]:\\n x[j][qty+l*coins[j]]=l+x[j-1][qty]\\n else:\\n x[j][qty+l*coins[j]]=min(l+x[j-1][qty],x[j][qty+l*coins[j]])\\n \\n print(x)\\n\\n out=10**6\\n for elem in x:\\n if amount in elem:\\n out=min(out,elem[amount])\\n if out>10**5:\\n return -1\\n else:\\n return out\\n \\n\\n\\n\\n\",\n \"runtime\": \"1461\"\n },\n {\n \"code\": \"class Solution:\\n \\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {}\\n dp[0] = 0\\n \\n for cur_amt in range(1, amount + 1):\\n \\n \\n min_num_coins = float(\\\"inf\\\")\\n \\n for cur_coin in coins:\\n if cur_amt - cur_coin < 0:\\n continue\\n else:\\n if dp[int(cur_amt - cur_coin)] == -1:\\n continue\\n else:\\n min_num_coins = min(min_num_coins, 1 + dp[int(cur_amt - cur_coin)])\\n \\n if min_num_coins == float(\\\"inf\\\"):\\n dp[int(cur_amt)] = -1\\n else:\\n dp[int(cur_amt)] = min_num_coins\\n \\n return dp[amount]\\n \\n\\n # def coinChange(self, coins: List[int], amount: int) -> int:\\n # self.memo = dict()\\n # return self.dp(coins, amount)\\n \\n\\n # def dp(self, coins, amount):\\n # # for the given amount, what's the minimum # of coins needed to reach this amount\\n \\n # if amount == 0:\\n # return 0\\n \\n # if amount < 0:\\n # return -1\\n \\n \\n # if amount in self.memo:\\n # return self.memo[amount]\\n \\n # min_coins_needed = float('inf')\\n # for cur_coin in coins:\\n # num_coins_remaining = self.dp(coins, amount - cur_coin)\\n # if num_coins_remaining != -1:\\n # min_coins_needed = int(min(1 + num_coins_remaining, min_coins_needed))\\n \\n # if min_coins_needed == float(\\\"inf\\\"):\\n # self.memo[amount] = -1\\n # return -1\\n # else:\\n # self.memo[amount] = min_coins_needed\\n # return self.memo[amount]\\n \\n \\n \\n \",\n \"runtime\": \"1480\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def solve(amount):\\n if amount== 0:\\n return 0\\n if amount< 0:\\n return float('inf')\\n \\n if dp[amount]!= -1:\\n return dp[amount]\\n \\n mini= float('inf')\\n for i in range(len(coins)):\\n ans= solve(amount- coins[i])\\n if ans!= float('inf'):\\n mini= min(mini, 1+ans)\\n dp[amount]= mini\\n return mini\\n \\n dp = [-1] * (amount + 1)\\n ans= solve(amount)\\n\\n if ans== float('inf'):\\n return -1\\n return ans\\n\\n \\n \\n \\n \\n \\n\\n\\n\",\n \"runtime\": \"1480\"\n },\n {\n \"code\": \"class Solution:\\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[float(\\\"inf\\\")] * (amount + 1) for _ in range(len(coins) + 1)]\\n\\n for i in range(len(coins)+1):\\n dp[i][0] = 0\\n\\n for i in range(1, len(coins) + 1):\\n for j in range(1, amount + 1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\\n else:\\n dp[i][j] = dp[i-1][j]\\n \\n return dp[len(coins)][amount] if dp[len(coins)][amount] != float(\\\"inf\\\") else -1\\n \\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\\n \\n def dfs(idx: int, remaining_amount: int) -> int:\\n # Base case: if the amount is zero, we found a valid solution (0 coins more needed)\\n if remaining_amount == 0:\\n return 0\\n \\n if idx == len(coins) or remaining_amount < 0:\\n return float(\\\"inf\\\")\\n\\n if dp[idx][remaining_amount] != -1:\\n return dp[idx][remaining_amount]\\n\\n include = float(\\\"inf\\\")\\n if coins[idx] <= remaining_amount:\\n include = 1 + dfs(idx, remaining_amount - coins[idx])\\n exclude = dfs(idx + 1, remaining_amount)\\n dp[idx][remaining_amount] = min(exclude, include)\\n\\n return dp[idx][remaining_amount]\\n \\n result = dfs(0, amount)\\n return result if result != float(\\\"inf\\\") else -1\\n\\n\\n\\n \\n \",\n \"runtime\": \"1500\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n dp = [[float('inf') for _ in range(amount+1)] for _ in range(n+1)]\\n\\n\\n for i in range(n+1):\\n dp[i][0] = 0\\n\\n for i in range(1, n+1):\\n for j in range(amount+1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(1 + dp[i][j-coins[i-1]], dp[i-1][j])\\n else:\\n dp[i][j] = dp[i-1][j]\\n\\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\\n \",\n \"runtime\": \"1500\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n memo = {}\\n\\n def dfs(num:int):\\n if num == 0:\\n return 0\\n if num < 0:\\n return float('inf')\\n\\n\\n if num in memo:\\n return memo[num]\\n\\n min_coins = float('inf')\\n for i in coins:\\n if i <= num:\\n c = dfs(num - i)\\n if c != float('inf'):\\n stepsHereTillTheEnd = c + 1\\n min_coins = min(stepsHereTillTheEnd, min_coins)\\n \\n\\n memo[num] = min_coins\\n return min_coins\\n res = dfs(amount)\\n return res if res != float('inf') else - 1\\n\",\n \"runtime\": \"1520\"\n },\n {\n \"code\": \"import functools\\n\\nclass Solution:\\n coins: List[int]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n self.coins = coins\\n return self.coinChangeDyn(amount)\\n \\n @functools.cache\\n def coinChangeDyn(self, amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n min_coins = -1\\n for coin in reversed(self.coins):\\n if coin == amount:\\n return 1\\n elif coin < amount:\\n coins = self.coinChangeDyn(amount - coin)\\n if coins != -1 and min_coins == -1:\\n min_coins = coins + 1\\n elif coins != -1:\\n min_coins = min(min_coins, coins + 1)\\n return min_coins\",\n \"runtime\": \"1520\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n #have a dp array, col is up to amount and row is number of coins\\n dp = [[float('inf') for _ in range(amount+1)] for _ in range(len(coins))]\\n \\n for i in range(len(coins)):\\n dp[i][0] = 0\\n \\n for i in range((len(coins))):\\n for j in range(1, amount+1):\\n dp[i][j] = dp[i-1][j]\\n if coins[i]<=j:\\n r = j - coins[i]\\n dp[i][j] = min(1 + dp[i][r], dp[i][j])\\n \\n return dp[-1][-1] if dp[-1][-1] < float('inf') else -1\\n\\n \",\n \"runtime\": \"1540\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {0:0}\\n def helper(recNum):\\n if recNum in memo.keys():\\n return memo[recNum]\\n elif recNum < 0:\\n memo[recNum] = -1\\n else:\\n for i in coins:\\n helper(recNum - i)\\n memo[recNum] = 1 + min([memo[recNum - c] for c in coins if memo[recNum - c] != -1], default = -2)\\n return memo[recNum]\\n return helper(amount)\",\n \"runtime\": \"1540\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n\\n # have to figure out minimum # of coins needed to make amount\\n # we have unlimited # of coins of denominations present in coins\\n # if amount cant be made with the coins provided, return -1\\n # coin val > amount\\n\\n # we're returning mionimum coins needed, so need to minimize the values coming from each subproblem\\n # amount = 5, coins = [1, 2]\\n # amount = 4\\n # amount = 3\\n # amount = 4\\n # amount = 5\\n # amount = 3\\n # amount = 5\\n \\n @cache\\n def CC(i :int, x :int) -> int:\\n\\n # i is idx of coins arr\\n if i == len(coins):\\n return 0 if x == 0 else 10**5\\n take = 10**5 \\n if coins[i] <= x:\\n take = 1 + CC(i, x - coins[i])\\n skip = CC(i + 1, x)\\n\\n return min(take, skip)\\n\\n result = CC(0, amount)\\n return -1 if result == 10**5 else result\\n\\n\",\n \"runtime\": \"1559\"\n },\n {\n \"code\": \"class Solution:\\n def rec(self, coins, amt, dp):\\n if amt < 0:\\n return float('inf') # Return a large value to signify an invalid path\\n if amt == 0:\\n return 0 # No coins needed if the amount is 0\\n\\n if amt in dp:\\n return dp[amt]\\n\\n min_coins = float('inf')\\n for coin in coins:\\n result = self.rec(coins, amt - coin, dp)\\n if result != float('inf'):\\n min_coins = min(min_coins, result + 1)\\n\\n dp[amt] = min_coins\\n return dp[amt]\\n \\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {}\\n result = self.rec(coins, amount, dp)\\n return result if result != float('inf') else -1\\n\",\n \"runtime\": \"1559\"\n },\n {\n \"code\": \"class Solution:\\n # DFS(i,j) = min(DFS(i-1,j), DFS(i,j-w[i]) + v[i]) -> min coins\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n # v[i] = 1; w[i] = coins[i]\\n @cache\\n def DFS(i,j):\\n if i < 0:\\n return 0 if j == 0 else inf\\n if j < coins[i]:\\n return DFS(i-1,j)\\n return min(DFS(i-1,j), DFS(i,j-coins[i])+1)\\n Ans = DFS(n-1,amount)\\n return Ans if Ans != inf else -1\\n \\n\",\n \"runtime\": \"1579\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n memo = dict()\\n\\n def dfs(curr):\\n if curr > amount:\\n return float('inf')\\n \\n if curr == amount:\\n return 0\\n \\n if curr in memo:\\n return memo[curr]\\n \\n min_steps = float('inf')\\n\\n for c in coins:\\n res = dfs(curr + c)\\n if res != float('inf'):\\n min_steps = min(min_steps, res + 1)\\n \\n memo[curr] = min_steps\\n\\n return memo[curr]\\n \\n res = dfs(0)\\n return res if res != float('inf') else -1\",\n \"runtime\": \"1579\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n\\n def dp(rem):\\n if rem == 0:\\n return 0\\n if rem < 0:\\n return float('inf')\\n if rem in memo:\\n return memo[rem]\\n \\n min_coins = float(\\\"inf\\\")\\n for coin in coins:\\n res = dp(rem - coin)\\n if res != float('inf'):\\n min_coins = min(min_coins, res + 1)\\n \\n memo[rem] = min_coins\\n return memo[rem]\\n\\n result = dp(amount)\\n return result if result != float('inf') else -1\",\n \"runtime\": \"1599\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n memo = {}\\n def dp(index, current):\\n if (index,current) in memo:\\n return memo[(index,current)]\\n\\n \\n\\n if index>=len(coins) or current<0:\\n return float('inf')\\n \\n if current == 0:\\n return 0\\n #We are adding +1 while calling the function because we want to track how many times the use_it function in used.\\n use_it = 1+dp(index,current-coins[index])\\n skip_it = dp(index+1,current)\\n\\n memo[(index,current)] = min(use_it, skip_it)\\n return memo[(index,current)]\\n \\n return dp(0,amount) if dp(0,amount)!=float('inf') else -1\\n\\n\\n \",\n \"runtime\": \"1599\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":146,"string":"146"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {0: 0}\n for i in range(1,amount+1):\n for coin in coins:\n if i - coin in dp and i not in dp:\n dp[i] = 1 + dp[i-coin]\n elif i-coin in dp:\n dp[i] = min(dp[i], 1+dp[i-coin])\n return dp.get(amount, -1)","memory":"16301"},{"code":"# 零钱兑换\n\n# 整数数组 coins ，表示不同面额的硬币；以及一个整数 amount ，表示总金额。\n\n# 返回可以凑成总金额所需的 最少的硬币个数 。\n# 如果没有任何一种硬币组合能组成总金额，返回 -1 。\n\n# 每种硬币的数量是无限的。\n\n# 解題思路：\n# 這道問題要求找到最少的硬幣數量來湊成給定的 amount，可以使用動態規劃（Dynamic Programming）來解決。\n# 這是一個經典的最優子結構問題，我們可以通過將問題拆解為子問題來解決。\n\n# 動態規劃的思路：\n# 定義狀態：\n# 定義一個一維數組 dp，其中 dp[i] 表示湊成金額 i 所需的最少硬幣數量。\n# 初始時，dp[0] = 0，因為湊成金額 0 所需的硬幣數量是 0。\n# 其他的 dp[i] 初始設為 float('inf')，表示初始時無法湊成該金額。\n\n# 轉移方程：\n# 我們可以使用每個硬幣來更新 dp 表：對於每個硬幣 coin，遍歷 dp，如果我們選擇該硬幣，則可以更新金額 i 的最少硬幣數量：\n# dp[i]=min(dp[i],dp[i−coin]+1)\n# 這意味著，如果選擇了硬幣 coin，那麼我們只需要湊成金額 i - coin，並再加上一枚 coin。\n\n# 結果：\n# 最終，dp[amount] 中的值就是湊成該金額所需的最少硬幣數量。如果 dp[amount] 依然是 float('inf')，則表示無法湊成該金額，返回 -1。\n\n# 279 322 2915 518 983 264\n# 279. Perfect Squares\n# 322. Coin Change\n# 2915. Length of the Longest Subsequence That Sums to Target\n# 518. Coin Change II\n# 983. Minimum Cost For Tickets\n# 264. Ugly Number II\n\n# DP Bottom Up, math\n# O(n * m), s:O(n)\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float(\"inf\")] * (amount + 1)\n dp [0] = 0\n\n for i in range(1, amount + 1):\n for coin in coins:\n if coin <= i:\n dp[i] = min(dp[i], dp[i - coin] + 1)\n \n return dp[-1] if dp[-1] != float(\"inf\") else -1 # 如果 dp[amount] 還是無限大，說明無法湊成該金額\n \n \n '''\n 先 loop coins\n '''\n # 初始化 dp 數組，大小為 amount + 1，初始值為無限大\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0 # 湊成金額 0 所需硬幣數量為 0\n \n # 對於每一個金額，嘗試使用每一個硬幣\n for coin in coins:\n for i in range(coin, amount + 1):\n dp[i] = min(dp[i], dp[i - coin] + 1)\n \n # 如果 dp[amount] 還是無限大，說明無法湊成該金額\n return dp[amount] if dp[amount] != float('inf') else -1 ","memory":"16301"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n # Create a dp array with size (amount + 1), initialized to a large number (inf)\n dp = [float('inf')] * (amount + 1)\n \n # Base case: No coins are needed to make amount 0\n dp[0] = 0\n \n # Iterate over each coin in the coins array\n for coin in coins:\n # For each coin, update the dp array for all amounts from the coin to the amount\n for i in range(coin, amount + 1):\n dp[i] = min(dp[i], dp[i - coin] + 1)\n \n # If the value in dp[amount] is still infinity, it means it's impossible to make that amount\n return dp[amount] if dp[amount] != float('inf') else -1\n\n \"\"\"\n sorted_coins = sorted(coins)\n if amount == 0:\n return 0\n\n if sorted_coins[0] > amount:\n return -1\n\n \n remaining_amount = amount\n n_coins = 0\n j = len(sorted_coins) - 1\n while(remaining_amount > 0):\n if sorted_coins[j] <= remaining_amount:\n remaining_amount-=sorted_coins[j]\n n_coins+=1\n else:\n j-=1\n if j < 0:\n return -1\n \n return n_coins\n \"\"\"","memory":"16703"},{"code":"class Solution:\n def coinChange(self, coins: List[int], n: int) -> int:\n dp = [float('inf') for i in range(n+1)]\n dp[0] = 0\n\n for c in coins:\n for i in range(c, n+1):\n dp[i] = min(dp[i], dp[i-c] + 1)\n \n return dp[-1] if dp[-1] != float('inf') else -1\n\n ","memory":"16703"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n MAX_INT = 2**31 - 1\n \n # DP is the minimum number of couns needed to produce amount i\n dp = [MAX_INT] * (amount + 1)\n dp[0] = 0\n for i in range(1, amount + 1):\n for coin in coins:\n if i - coin >= 0:\n dp[i] = min(dp[i], dp[i - coin] + 1)\n \n return dp[-1] if dp[-1] != MAX_INT else -1\n ","memory":"17106"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [0] + [-1 for _ in range(amount)]\n for coin in coins:\n if len(dp) > coin:\n dp[coin] = 1\n\n for i in range(len(dp)):\n if dp[i] == -1:\n tmp_num = 10001\n for coin in coins:\n if i - coin >= 0:\n if dp[i-coin] >= 0:\n tmp_num = min(tmp_num, dp[i-coin])\n if tmp_num >= 0 and tmp_num <= 10000:\n dp[i] = tmp_num + 1\n return dp[amount]","memory":"17106"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n nums = [-1] * (amount + 1)\n nums[0] = 0\n for i in range(len(nums)):\n for coin in coins:\n prev_idx = i - coin\n if 0 <= prev_idx and nums[prev_idx] != -1:\n if nums[i] == -1:\n nums[i] = nums[prev_idx] + 1\n nums[i] = min(nums[i], nums[prev_idx] + 1)\n print(nums)\n return nums[amount]","memory":"17508"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [float('inf')] * (amount + 1)\n dp[0] = 0\n for coin in coins:\n for i in range(1, len(dp)):\n if i >= coin:\n dp[i] = min(dp[i], dp[i - coin] + 1)\n print(dp)\n return dp[-1] if dp[-1] != float('inf') else -1\n","memory":"17508"},{"code":"import heapq\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \"\"\"\n Can't simply use the largest coin\n Maybe do preprocessing?\n BFS forward times out, not sure what's faster. Not clear that backward would be faster\n\n Try Dijkstra's? No, this would be the same\n this wasn't DFS at all, can fix it\n \"\"\"\n q = []\n d = defaultdict(lambda: float('inf'))\n\n heapq.heappush(q, (0, 0))\n\n while q:\n n, a = heapq.heappop(q)\n if a == amount: return n\n if n < d[a]:\n d[a] = n\n for coin in coins:\n if a + coin <= amount:\n heapq.heappush(q, (n+1, a + coin))\n\n return -1\n","memory":"17911"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n # top-down approach\n # min_coins = 0\n\n # @cache\n # def coinChangeHelper(curr_amount):\n\n # if curr_amount == amount:\n # return 0\n \n # if curr_amount > amount:\n # return -1\n \n # min_coins = float('inf')\n\n # for coin in coins:\n # c1 = coinChangeHelper(curr_amount + coin)\n # if c1 != -1:\n # min_coins = min(c1 + 1, min_coins)\n \n # return min_coins\n\n # res = coinChangeHelper(0)\n # if res < float('inf'):\n # return res\n \n # return -1\n\n\n # bottom up solution\n dp = defaultdict(int)\n dp[0] = 0\n for cost in range(1, amount + 1):\n min_cost = float('inf')\n for coin in coins:\n if cost - coin in dp:\n min_cost = min(1 + dp[cost - coin], min_cost)\n dp[cost] = min_cost\n\n print(dp)\n return dp[amount] if dp[amount] < float('inf') else -1\n \n\n\n\n\n\n","memory":"17911"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n=len(coins)\n dp=[[-1 for i in range(amount+1)]for j in range(n+1)]\n ans=self.helper(n-1,amount,coins,n,dp)\n if(ans==sys.maxsize):\n return -1\n return ans\n\n def helper(self,ind,amount,coins,n,dp):\n if(ind==0):\n if(amount%coins[ind]==0):\n return amount//coins[ind]\n else:\n return sys.maxsize\n if(dp[ind][amount]!=-1):\n return dp[ind][amount]\n #two options either to pick or notpick\n notpick=self.helper(ind-1,amount,coins,n,dp)\n pick=sys.maxsize\n if(coins[ind]<=amount):\n #here we have infinite supply of coins\n pick=1+self.helper(ind,amount-coins[ind],coins,n,dp)\n dp[ind][amount]=min(pick,notpick)\n return dp[ind][amount]\n \n\n\n\n\n\n\n\n\n \n\n\n\n\n\n \n\n\n ","memory":"18313"},{"code":"class Solution:\n def coins(self, idx, amt, coins, dp):\n if idx == 0:\n if amt % coins[idx] == 0:\n return amt//coins[idx]\n else:\n return 10**8\n\n if dp[idx][amt] != -1:\n return dp[idx][amt]\n not_take = self.coins(idx-1, amt, coins, dp)\n take = 10**8\n if coins[idx] <= amt:\n take = 1 + self.coins(idx, amt-coins[idx], coins, dp)\n dp[idx][amt] = min(not_take, take)\n return dp[idx][amt]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n dp = [[-1 for _ in range(amount+1)] for _ in range(n)]\n return self.coins(n-1,amount, coins, dp) if self.coins(n-1,amount, coins, dp) != 10**8 else -1\n ","memory":"18313"},{"code":"class Solution:\n def coinChange(self, coins, amount):\n \"\"\"\n :type coins: List[int]\n :type amount: int\n :rtype: int\n \"\"\"\n # A large value greater than the maximum possible number of coins required, even infinity is fine\n # coins.sort(reverse=True)\n # count = 0\n # for i in coins:\n # if amount != 0:\n # count += amount//i\n # amount %= i\n # else:\n # break\n # if amount == 0:\n # return count\n # else:\n # return -1\n max_value = float('inf')\n n = len(coins)\n \n dp = [[0 for _ in range(amount+1)] for _ in range(n +1 )]\n \n for i in range(amount + 1):\n dp[0][i] = max_value\n for i in range(1, n+1):\n dp[i][0] = 0\n\n for i in range(1, amount +1):\n if i % coins[0] == 0:\n dp[1][i] = i// coins[0]\n else:\n dp[1][i] = max_value\n \n for i in range(2, n +1):\n for j in range(1, amount + 1):\n if coins[i-1] <= j:\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][ j - coins[i-1]])\n else:\n dp[i][j] = dp[i-1][j]\n\n # print(dp)\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\n\n\n # # Initialize dp array where dp[i] represents the minimum number of coins needed for amount i\n # # dp[i] is initialized with max_value, which is essentially infinity\n # dp = [max_value] * (amount + 1)\n \n # # Base case: No coins are needed to make the amount 0\n # dp[0] = 0\n \n # # Iterate through each coin denomination\n # for coin in coins:\n # # Iterate through all amounts from the current coin value to the target amount\n # for x in range(coin, amount + 1):\n # # Update dp[x] with the minimum of:\n # # 1. The current value of dp[x] (minimum coins needed without considering the current coin)\n # # 2. dp[x - coin] + 1 (minimum coins needed for the remaining amount (x - coin) plus the current coin)\n # dp[x] = min(dp[x], dp[x - coin] + 1)\n \n # # If dp[amount] is still max_value, it means the target amount cannot be made up by any combination of the coins\n # # In that case, return -1 to indicate that it's not possible to make the change\n # # Otherwise, return dp[amount], which represents the minimum number of coins needed\n # return dp[amount] if dp[amount] != max_value else -1","memory":"18716"},{"code":"class Solution:\n def coinChange(self, coins, amount):\n \"\"\"\n :type coins: List[int]\n :type amount: int\n :rtype: int\n \"\"\"\n # A large value greater than the maximum possible number of coins required, even infinity is fine\n # coins.sort(reverse=True)\n # count = 0\n # for i in coins:\n # if amount != 0:\n # count += amount//i\n # amount %= i\n # else:\n # break\n # if amount == 0:\n # return count\n # else:\n # return -1\n max_value = float('inf')\n n = len(coins)\n \n dp = [[0 for _ in range(amount+1)] for _ in range(n +1 )]\n \n for i in range(amount + 1):\n dp[0][i] = max_value\n for i in range(1, n+1):\n dp[i][0] = 0\n\n for i in range(1, amount +1):\n if i % coins[0] == 0:\n dp[1][i] = i// coins[0]\n else:\n dp[1][i] = max_value\n \n for i in range(2, n +1):\n for j in range(1, amount + 1):\n if coins[i-1] <= j:\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][ j - coins[i-1]])\n else:\n dp[i][j] = dp[i-1][j]\n\n # print(dp)\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\n\n\n # # Initialize dp array where dp[i] represents the minimum number of coins needed for amount i\n # # dp[i] is initialized with max_value, which is essentially infinity\n # dp = [max_value] * (amount + 1)\n \n # # Base case: No coins are needed to make the amount 0\n # dp[0] = 0\n \n # # Iterate through each coin denomination\n # for coin in coins:\n # # Iterate through all amounts from the current coin value to the target amount\n # for x in range(coin, amount + 1):\n # # Update dp[x] with the minimum of:\n # # 1. The current value of dp[x] (minimum coins needed without considering the current coin)\n # # 2. dp[x - coin] + 1 (minimum coins needed for the remaining amount (x - coin) plus the current coin)\n # dp[x] = min(dp[x], dp[x - coin] + 1)\n \n # # If dp[amount] is still max_value, it means the target amount cannot be made up by any combination of the coins\n # # In that case, return -1 to indicate that it's not possible to make the change\n # # Otherwise, return dp[amount], which represents the minimum number of coins needed\n # return dp[amount] if dp[amount] != max_value else -1","memory":"18716"},{"code":"class Solution:\n def coinChangeHelper(self, coins, amount, cdict):\n if amount < 0:\n return sys.maxsize\n elif amount == 0:\n return 0\n elif amount in cdict:\n return cdict[amount]\n else:\n res = sys.maxsize\n for coin in coins:\n tempres = self.coinChangeHelper(coins, amount - coin, cdict)\n if tempres != sys.maxsize:\n tempres += 1\n res = min(res, tempres)\n cdict[amount] = res \n return res\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n cdict = {}\n for coin in coins:\n cdict[coin] = 1\n \n res = self.coinChangeHelper(coins, amount, cdict)\n if res == sys.maxsize:\n return -1\n else:\n return res\n ","memory":"19118"},{"code":"def calculate_minimum_coins(coins, rem, counter):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n if counter[rem - 1] != float(\"inf\"):\n return counter[rem - 1]\n minimum = float(\"inf\")\n\n for s in coins:\n result = calculate_minimum_coins(coins, rem - s, counter)\n if result >= 0 and result < minimum:\n minimum = 1 + result\n\n counter[rem - 1] = minimum if minimum != float(\"inf\") else -1\n return counter[rem - 1]\n\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n if amount < 1:\n return 0\n return calculate_minimum_coins(coins, amount, [float(\"inf\")] * amount)","memory":"19118"},{"code":"class Solution:\n def _coinChange(self, coins, amount, dp):\n if amount in dp:\n return dp[amount]\n if amount == 0:\n return 0\n if amount < 0 or len(coins) == 0:\n return float('inf')\n\n best = float('inf')\n for coin in coins:\n if amount - coin < 0:\n break\n best = min(best, self._coinChange(coins, amount-coin, dp) + 1)\n dp[amount] = best\n return best\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins = sorted(coins)\n total = self._coinChange(coins, amount, {})\n return -1 if total > 10**6 else total","memory":"19521"},{"code":"class Solution:\n def dp(self, coins, w):\n if w < 0:\n return float(\"Inf\")\n if w == 0:\n return 0\n if self.mat[w] != -1:\n return self.mat[w]\n minCoins = float(\"Inf\")\n for coin in coins:\n minCoins = min(minCoins, 1 + self.dp(coins, w - coin))\n self.mat[w] = minCoins\n return self.mat[w]\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n self.mat = [-1 for i in range(0, amount + 1)]\n ans = self.dp(coins, amount)\n if ans < float(\"Inf\"):\n return ans\n return -1\n ","memory":"19521"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n self.cache = dict()\n self.cache[0] = 0\n ways = self.helper(coins, amount)\n return ways if ways != float('inf') else -1\n\n def helper(self, coins, amount):\n if amount in self.cache:\n return self.cache[amount]\n if amount < 0:\n return float('inf')\n \n minWays = float('inf')\n ways = float('inf')\n for coin in coins:\n ways = 1 + self.helper(coins, amount - coin)\n minWays = min(minWays, ways)\n\n self.cache[amount] = minWays\n return minWays","memory":"19923"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n min_coins = [amount+1 for _ in range(amount+1)]\n min_coins[0] = 0\n '''\n for i in range(1,amount+1):\n for coin in coins:\n if i - coin >= 0:\n min_coins[i] = min(min_coins[i-coin]+1, min_coins[i])\n if min_coins[-1] > amount:\n return -1\n else:\n return min_coins[-1]\n '''\n\n visited = {}\n def roundcounter(n,coins,visited):\n if n in visited:\n return visited[n]\n if n == 0:\n result = 0 \n elif n < 0:\n result = amount + 1\n else:\n results = []\n for coin in coins:\n results.append(roundcounter(n-coin,coins,visited))\n result = min(results) + 1\n visited[n] = result\n return result\n \n answer = roundcounter(amount,coins,visited)\n if answer > amount:\n answer = -1\n return answer\n\n\n\n","memory":"19923"},{"code":"class Solution:\n def solve(self, coins, t, i):\n # Base case: if we are at the last coin\n if i == len(coins) - 1:\n if t % coins[i] == 0:\n self.dp[i][t] = t // coins[i]\n return self.dp[i][t]\n self.dp[i][t] = float('inf') # Impossible case, return inf\n return self.dp[i][t]\n \n # Return the already computed value if available\n if self.dp[i][t] != -1:\n return self.dp[i][t]\n \n # Case where we do not take the current coin\n not_take = self.solve(coins, t, i + 1)\n \n # Case where we take the current coin (if possible)\n take = float('inf')\n if coins[i] <= t:\n take = 1 + self.solve(coins, t - coins[i], i)\n \n # Store the result in dp table and return\n self.dp[i][t] = min(take, not_take)\n return self.dp[i][t]\n\n def coinChange(self, coins: list[int], amount: int) -> int:\n # Initialize dp table with -1 (for memoization)\n self.dp = [[-1 for _ in range(amount + 1)] for _ in range(len(coins))]\n \n # Solve the problem starting from the first coin\n ans = self.solve(coins, amount, 0)\n \n # If no valid solution exists, return -1\n if ans >= float('inf'):\n return -1\n \n return ans","memory":"20326"},{"code":"import sys\nclass Solution:\n def helper(self,n,coins,w,res,idx):\n if n == idx:\n if w == 0:\n return res\n return sys.maxsize\n if w>=coins[idx]:\n return min(self.helper(n,coins,w-coins[idx],res+1,idx),self.helper(n,coins,w-coins[idx],res+1,idx+1),self.helper(n,coins,w,res,idx+1))\n else:\n return self.helper(n,coins,w,res,idx+1)\n def coinChange(self, coins: List[int], amount: int) -> int:\n # res=0\n \n # ans = self.helper(n,coins,amount,res,0)\n # if ans == sys.maxsize:\n # return -1\n # return ans\n n=len(coins)\n dp=[[float('inf')]*(amount+1) for _ in range(n+1)]\n for i in range(n+1):\n dp[i][0] = 0\n for i in range(1,n+1):\n for j in range(amount+1):\n if j>=coins[i-1]:\n dp[i][j] = min(dp[i][j-coins[i-1]]+1,dp[i-1][j])\n else:\n dp[i][j] = dp[i-1][j]\n if dp[n][amount] == float('inf'):\n return -1\n return dp[n][amount]","memory":"20326"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp=[]\n for i in range(len(coins)+1):\n dp.append([0]*(amount+1))\n for i in range(amount+1):\n dp[0][i]=float('inf')\n for i in range(1,len(coins)+1):\n for j in range(1,amount+1):\n take=float('inf')\n if j>=coins[i-1]:\n take=dp[i][j-coins[i-1]]+1\n not_take=dp[i-1][j]\n dp[i][j]=min(take,not_take)\n #print(dp)\n return dp[-1][-1] if dp[-1][-1]!=float('inf') else -1","memory":"20728"},{"code":"import sys\nclass Solution:\n def helper(self,n,coins,w,res,idx):\n if n == idx:\n if w == 0:\n return res\n return sys.maxsize\n if w>=coins[idx]:\n return min(self.helper(n,coins,w-coins[idx],res+1,idx),self.helper(n,coins,w-coins[idx],res+1,idx+1),self.helper(n,coins,w,res,idx+1))\n else:\n return self.helper(n,coins,w,res,idx+1)\n def coinChange(self, coins: List[int], amount: int) -> int:\n # res=0\n \n # ans = self.helper(n,coins,amount,res,0)\n # if ans == sys.maxsize:\n # return -1\n # return ans\n n=len(coins)\n dp=[[float('inf')]*(amount+1) for _ in range(n+1)]\n for i in range(n+1):\n dp[i][0] = 0\n for i in range(1,n+1):\n for j in range(amount+1):\n if j>=coins[i-1]:\n dp[i][j] = min(dp[i-1][j-coins[i-1]]+1, dp[i][j-coins[i-1]]+1,dp[i-1][j])\n else:\n dp[i][j] = dp[i-1][j]\n \n \n if dp[n][amount] == float('inf'):\n return -1\n return dp[n][amount]","memory":"20728"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n cnts = [None for _ in range(amount)] #ith for amt=i+1\n cset = set(coins)\n\n def dp(amt):\n nonlocal cnts, cset \n minc = amt + 1\n if amt == 0:\n return 0\n if cnts[amt-1]: # careful w -1!\n return cnts[amt-1]\n for c in cset:\n if c > amt:\n continue\n if dp(amt-c) == -1:\n continue\n # Q: early stop when no longer possible?\n minc = min(minc,dp(amt-c)+1)\n \n if minc == amt + 1: # no actual update\n minc = -1\n cnts[amt-1] = minc\n return minc\n\n return dp(amount)\n\n \n \n","memory":"21131"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n # dp[i][j] = number of coins from first i coins needed to make amount j\n \n n = len(coins)\n dp = [[float('inf') for j in range(amount+1)] for i in range(n)]\n \n for i in range(n): \n dp[i][0] = 0 # no coins needed to make amount 0\n if coins[i] <= amount:\n dp[i][coins[i]] = 1 # 1 coin needed to make coins[i] amongst first i coins\n \n for j in range(1, amount+1):\n for i in range(n):\n \n if coins[i] <= j:\n dp[i][j] = min(dp[i-1][j], dp[i][j-coins[i]]+1) # dp[i-1][j] -> not using ith coin, or using it \n else:\n dp[i][j] = dp[i-1][j] # not using coins[i], just using first i-1 coins\n \n if dp[n-1][amount] == float('inf'):\n return -1\n return dp[n-1][amount]","memory":"21131"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # dp[i][amount] = min coins to make sum amount with i coins available\n n = len(coins)\n dp = [[float(\"inf\") for i in range(amount + 2)] for j in range(n + 2)]\n for i in range(n):\n dp[i][0] = 0\n for i in range(n):\n for j in range(amount + 1):\n if j == 0:\n continue\n if j - coins[i] >= 0:\n dp[i][j] = min(dp[i][j - coins[i]], dp[i][j]) + 1\n if i - 1 >= 0:\n dp[i][j] = min(dp[i - 1][j], dp[i][j])\n return dp[n - 1][amount] if dp[n - 1][amount] != float(\"inf\") else -1\n ","memory":"21533"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n t = [[float('inf')]*(n+1) for _ in range(amount+1)]\n\n for i in range(1, n+1):\n t[0][i] = 0\n \n for i in range(1, amount+1):\n for j in range(1, n+1):\n if coins[j-1] <= i:\n t[i][j] = min(1+t[i-coins[j-1]][j], t[i][j-1])\n else:\n t[i][j] = t[i][j-1]\n\n if t[-1][-1] == float(\"inf\"):\n t[-1][-1] = -1\n\n return t[-1][-1]\n\n \n ","memory":"21533"},{"code":"class Solution:\n \n\n def coinChange(self, coins: List[int], amount: int) -> int:\n n=len(coins)\n dp = [[float('inf') for _ in range(amount + 1)] for _ in range(n)]\n for i in range(amount+1):\n if i%coins[0]==0:\n dp[0][i]=i//coins[0]\n else:\n dp[0][i]=float('inf')\n for i in range(1,n):\n for j in range(amount+1):\n not_t=0+dp[i-1][j]\n take=float('inf')\n if coins[i]<=j:\n take=1+dp[i][j-coins[i]]\n dp[i][j]=min(not_t,take)\n \n ans=dp[n-1][amount]\n if ans>=float('inf'):\n return -1\n else:\n return ans\n\n\n\n ","memory":"21936"},{"code":"class Solution:\n \n\n def coinChange(self, coins: List[int], amount: int) -> int:\n n=len(coins)\n dp = [[float('inf') for _ in range(amount + 1)] for _ in range(n)]\n for i in range(amount+1):\n if i%coins[0]==0:\n dp[0][i]=i//coins[0]\n else:\n dp[0][i]=float('inf')\n for i in range(1,n):\n for j in range(amount+1):\n not_t=0+dp[i-1][j]\n take=float('inf')\n if coins[i]<=j:\n take=1+dp[i][j-coins[i]]\n dp[i][j]=min(not_t,take)\n \n ans=dp[n-1][amount]\n if ans>=float('inf'):\n return -1\n else:\n return ans\n\n\n\n ","memory":"21936"},{"code":"# Top down\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def dp(i, curr):\n if i >= len(coins) or curr > amount:\n return float(\"inf\")\n elif curr == amount:\n return 0\n return min(\n 1 + dp(i, curr+coins[i]),\n dp(i+1, curr)\n )\n\n min_num_coins = dp(0,0) \n return min_num_coins if min_num_coins != float(\"inf\") else -1\n\n# Bottom Up\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int: \n \"\"\"\n Note\n - i maps to curr in top down soln\n - i-coins[j] maps to curr+coins[i] in dp(i, curr+coins[i]) \n - j maps to i (index of coins) in top down soln\n - j-1 maps to i+1 in dp(i+1, curr)\n\n dp = [ [float(\"inf\") for j in range(len(coins)+1)] for i in range(amount+1) ]\n - for i in range(amount+1) : amount can be 0 \n - for j in range(len(coins)+1) : min nos of coins to take can be 0\n \"\"\"\n\n dp = [ [float(\"inf\") for j in range(len(coins)+1)] for i in range(amount+1) ]\n \n for j in range(len(coins)+1):\n dp[0][j] = 0\n\n for i in range(amount+1):\n for j in range(len(coins)+1):\n if j < len(coins) and i - coins[j] >= 0:\n dp[i][j] = min(dp[i][j], 1 + dp[i - coins[j]][j])\n if j - 1 >= 0:\n dp[i][j] = min(dp[i][j], dp[i][j-1])\n\n return dp[-1][-1] if dp[-1][-1] != float(\"inf\") else -1\n\n \n# Bottom Up (space optimised)\n# class Solution:\n# def coinChange(self, coins: List[int], amount: int) -> int:\n# \"\"\"\n# Overall Approach\n# - dp[i] \n# - nos of ways to form i amt w/o taking new coins\n# - 1 + dp[i - c]\n# - nos of ways to form i amt by taking coin c (1) + nos of ways to form i-c amt\n# \"\"\"\n \n# dp = [float(\"inf\")] * (amount+1)\n# dp[0] = 0\n# for i in range(len(dp)):\n# for c in coins:\n# if i - c in range(len(dp)):\n# dp[i] = min(dp[i], 1 + dp[i - c])\n \n# return dp[-1] if dp[-1] != float(\"inf\") else -1\n","memory":"22338"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n n = len(coins)\n dp = [-1] * (amount+1)\n def path(sum):\n if sum > amount:\n return float('inf')\n if sum == amount:\n return 0\n if dp[sum] != -1:\n return dp[sum]\n res = float('inf')\n for i in range(n):\n res = min(res, path(sum+coins[i])+1)\n dp[sum] = res\n return res\n out = path(0)\n return out if out != float('inf') else -1\n\n ","memory":"22338"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = [float('inf')] * (amount+1)\n memo[0] = 0 # index is the amount and the value is the coins used\n def dfs(currAmount):\n nonlocal memo\n if currAmount < 0:\n return -1\n\n if memo[currAmount] != float('inf'):\n return memo[currAmount]\n\n result = float('inf')\n for coin in coins:\n res = dfs(currAmount-coin)\n if res >= 0:\n result = min(result, res+1)\n \n memo[currAmount] = result if result != float('inf') else -1\n return memo[currAmount]\n \n dfs(amount)\n return memo[amount]","memory":"22741"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coinSet = set(coins)\n # the minimum number of coins required to get to amount.\n # dp[amount] = min number of coins to get here\n # if you cannot form that value, -1.\n dp = defaultdict(lambda:float(\"inf\"))\n\n # base case. Only use 1 coin for that coin value.\n for coinValue in coinSet:\n dp[coinValue] = 1\n\n dp[0] = 0\n\n for i in range(1, amount + 1):\n bestCandidate = float('inf')\n\n # find what is the best way to get to each possible previous value\n for coinValue in coinSet:\n candidate = dp[i - coinValue] # could be inf.\n bestCandidate = min(bestCandidate, candidate)\n\n # we've now tried every coin. your value is just previous value plus the one coin you tried.\n dp[i] = 1 + bestCandidate\n if dp[amount] == float('inf'):\n return -1\n return dp[amount]\n\n","memory":"22741"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n dp = [amount + 1 for _ in range(amount + 1)]\n dp[amount] = 0\n\n def dfs(total):\n if total > amount:\n return -1\n if dp[total] != amount+1:\n return dp[total]\n minCoins = amount + 1\n for i in coins:\n m = dfs(total + i)\n if m != -1 and minCoins > m:\n minCoins = m\n\n dp[total] = 1 + minCoins if minCoins != amount+1 else -1\n return dp[total]\n\n return dfs(0)\n","memory":"23546"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n dp = [-1] * (amount)\n\n def findMin(coins,amount,m):\n if amount == 0:\n return 0\n \n if dp[amount - 1] != -1:\n return dp[amount - 1]\n \n res = float('inf')\n\n for i in range(m):\n if coins[i] <= amount:\n value = findMin(coins,amount - coins[i],m)\n\n if value != float('inf') and value + 1 < res:\n res = value + 1\n \n dp[amount - 1] = res\n\n return res\n \n rs = findMin(coins,amount,len(coins))\n if rs != float('inf'):\n return rs\n return -1\n","memory":"23546"},{"code":"import itertools\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n answers = {0: {}}\n for coin in coins:\n answers[0][coin] = 0\n answers[0][-1] = 0\n NA_ANSWER = 100000\n\n for i in range(1, amount + 1):\n answers[i] = {}\n answers[i][-1] = NA_ANSWER\n for coin in coins:\n if coin > i:\n answers[i][coin] = NA_ANSWER\n continue\n answers[i][coin] = answers[i - coin][-1]\n if answers[i][coin] != NA_ANSWER:\n answers[i][coin] += 1\n answers[i][-1] = min(answers[i][-1], answers[i][coin])\n final_answer = answers[amount][-1]\n return -1 if final_answer == NA_ANSWER else final_answer","memory":"23948"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def solve(amount):\n if amount== 0:\n return 0\n if amount< 0:\n return float('inf')\n \n if dp[amount]!= -1:\n return dp[amount]\n \n mini= float('inf')\n for i in range(len(coins)):\n ans= solve(amount- coins[i])\n if ans!= float('inf'):\n mini= min(mini, 1+ans)\n dp[amount]= mini\n return mini\n \n dp = [-1] * (amount + 1)\n ans= solve(amount)\n\n if ans== float('inf'):\n return -1\n return ans\n\n \n \n \n \n \n\n\n","memory":"23948"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n coins = sorted(coins,reverse=True)\n\n dp = [-1 for _ in range(amount+1)]\n\n def f(amount):\n\n if amount <= 0:\n return 0\n if dp[amount] != -1:\n return dp[amount] \n _min = float('inf')\n\n for i in range(len(coins)):\n if amount >= coins[i]:\n res = 1 + f(amount-coins[i])\n _min = min(_min,res)\n dp[amount] = _min\n return _min\n\n res = f(amount)\n return res if res != float('inf') else -1","memory":"24351"},{"code":"INF = float('inf')\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # TD approach first\n if amount == 0 : return 0\n\n coins.sort()\n dp = {0:0}\n\n def min_coins(amt: int) -> int:\n if amt in dp : return dp[amt]\n dp[amt] = min([INF] + [1 + min_coins(amt - coin) for coin in coins if amt - coin >= 0])\n return dp[amt]\n\n result = min_coins(amount)\n return result if result < INF else -1\n\n","memory":"24351"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n self.dp = {0:0}\n r = self.get(coins, amount)\n if r > amount:\n return -1\n return r\n\n def get(self, coins, i):\n if i in self.dp:\n return self.dp[i]\n if i < 0:\n return inf\n self.dp[i] = 1 + min([self.get(coins, i - n) for n in coins])\n return self.dp[i]","memory":"24753"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0: return 0\n\n self.fewest_coins = float('inf')\n self.cache = [-1] * (amount+1)\n\n def helper(total):\n if total == 0:\n return 0\n if total < 0:\n return float('inf')\n if self.cache[total] != -1: return self.cache[total]\n\n minVal = float('inf')\n for c in range(len(coins)):\n minVal = min(minVal, 1 + helper(total - coins[c]))\n\n self.cache[total] = minVal\n return self.cache[total]\n \n res = helper(amount)\n return res if res != float('inf') else -1","memory":"24753"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n dp = [-1 for _ in range(amount+1)]\n def solve(amount):\n if amount == 0:\n return 0\n if amount < 0:\n return float(\"inf\")\n if dp[amount] != -1:\n return dp[amount]\n ans = float(\"inf\")\n for i in range(n):\n res = 1+solve(amount-coins[i])\n ans = min(res,ans)\n dp[amount] = ans\n return ans\n ans = solve(amount)\n if ans!=float(\"inf\"):\n return ans\n return -1","memory":"25156"},{"code":"class Solution:\n def __init__(self):\n self.mapping = {}\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n ans = self.solve(coins, amount, 0, n)\n if ans == sys.maxsize:\n return -1\n return ans\n \n def solve(self, coins, amount, i, n):\n if amount == 0:\n return 0\n if amount < 0:\n return sys.maxsize\n if i == n and amount != 0:\n return sys.maxsize\n val = str(amount) + ' ' + str(i)\n if val in self.mapping:\n return self.mapping[val]\n\n if coins[i] <= amount:\n ans = min(1 + self.solve(coins, amount - coins[i], i, n),\n self.solve(coins, amount, i+1, n))\n else:\n ans = self.solve(coins, amount, i+1, n)\n self.mapping[val] = ans\n return ans ","memory":"25156"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n result = self.dp(coins, amount, {})\n return -1 if result == inf else result\n \n def dp(self, coins, amount, memo):\n if amount in memo:\n return memo[amount]\n \n if amount == 0:\n return 0\n \n if amount < 0:\n return inf\n \n memo[amount] = min([self.dp(coins, amount - coin, memo) for coin in coins]) + 1\n return memo[amount]\n ","memory":"25558"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n self.early_returns = {}\n self.currentAnswer = amount + 1\n if amount %2:\n foundOdd = False\n for coin in coins:\n if coin %2:\n foundOdd = True\n break\n if not foundOdd:\n return -1\n coins.sort()\n result, answer = self.coinChangeSorted(coins, amount, 0)\n return answer if result else -1\n\n def coinChangeSorted(self, coins: List[int], amount: int, coinsUsed: int) -> int:\n if not coins:\n return False, -1\n if coinsUsed >= self.currentAnswer:\n return False, -1\n l = len(coins)\n if l in self.early_returns:\n if amount in self.early_returns[l]:\n return self.early_returns[l][amount]\n maxCoinsForLast = amount // coins[-1]\n maxCoinsForLast = min(maxCoinsForLast, self.currentAnswer - coinsUsed)\n # if amount % coins[-1] == 0:\n if maxCoinsForLast * coins[-1] == amount:\n if l not in self.early_returns: \n self.early_returns[l] = {}\n self.early_returns[l][amount] = [True, maxCoinsForLast]\n self.currentAnswer = min(self.currentAnswer, coinsUsed + maxCoinsForLast)\n return True, maxCoinsForLast\n foundAnswer = False\n answer = amount\n for coinsForLast in range(maxCoinsForLast, -1, -1):\n val, numCoins = self.coinChangeSorted(coins[:-1], amount - coins[-1] * coinsForLast, coinsUsed + coinsForLast)\n if val:\n foundAnswer = True\n answer = min(answer, numCoins + coinsForLast)\n if foundAnswer:\n if l not in self.early_returns: \n self.early_returns[l] = {}\n self.early_returns[l][amount] = [foundAnswer, answer]\n self.currentAnswer = min(self.currentAnswer, coinsUsed + answer)\n return foundAnswer, answer\n if l not in self.early_returns: \n self.early_returns[l] = {}\n self.early_returns[l][amount] = [False, -1]\n return False, -1\n","memory":"25558"},{"code":"from typing import List\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # 先排序硬币数组\n coins.sort()\n # 使用一个字典作为记忆化缓存\n memo = {}\n \n def dp(n):\n # 基本情况\n if n == 0:\n return 0\n if n < 0:\n return -1\n \n # 检查缓存\n if n in memo:\n return memo[n]\n \n # 计算所有可能的子问题结果\n results = []\n for coin in coins:\n if coin > n:\n break # 剪枝优化\n res = dp(n - coin)\n if res >= 0:\n results.append(res + 1)\n \n # 如果results为空，表示无法凑成该金额\n memo[n] = min(results) if results else -1\n return memo[n]\n \n return dp(amount)\n\n","memory":"25961"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n INF = 987654321\n dp = [-1 for _ in range(10_001)]\n\n dp[0] = 0\n def find_dp(x) :\n if dp[x] != -1 : return dp[x]\n\n dp[x] = INF\n for coin in coins :\n if x >= coin :\n dp[x] = min(dp[x], 1 + find_dp(x-coin))\n return dp[x]\n\n find_dp(amount)\n return -1 if dp[amount] == INF else dp[amount]","memory":"25961"},{"code":"import itertools\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n answers = {0: {}}\n for coin in coins:\n answers[0][coin] = True\n coins = sorted(coins, reverse=True)\n for i in range(1, amount + 1):\n answers[i] = {}\n for coin in coins:\n if coin > i:\n answers[i][coin] = False\n continue\n answers[i][coin] = sum(answers[i - coin].values()) > 0\n if sum(answers[amount].values()) == 0:\n return -1\n ways = {i: None for i in range(amount + 1)}\n ways[0] = 0\n for i in range(1, amount + 1):\n ways[i] = 100000\n for coin in coins:\n if answers[i][coin]:\n ways[i] = min(ways[i], ways[i - coin] + 1)\n return ways[amount]\n \n ","memory":"26363"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins = sorted(coins)\n x = {}\n def recur(s):\n if s == 0:\n return 0\n if s in x:\n return x[s]\n arr = []\n for c in coins:\n if c > s:\n break\n arr.append(1+recur(s-c))\n x[s] = min(arr) if len(arr) > 0 else float('inf')\n return x[s]\n res = recur(amount)\n return res if res < float('inf') else -1\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \"\"\"\n coins = sorted(set(coins))\n dp = [0]*(amount+1)\n for v in range(1, amount+1):\n dp[v] = float('inf')\n for c in coins:\n if v-c<0:\n break\n dp[v] = min(dp[v], 1+dp[v-c])\n return dp[amount] if dp[amount] != float('inf') else -1\n \"\"\"\n \n \n \n # dp = {}\n # def recur(v):\n # if v == 0:\n # return 0\n # if v in dp:\n # return dp[v]\n # dp[v] = float('inf')\n # for j in range(len(coins)):\n # if v-coins[j]>=0:\n # dp[v] = min(dp[v], 1+recur(v-coins[j]))\n # return dp[v]\n # x = recur(amount)\n # return -1 if x == float('inf') else x\n \n \"\"\"\n def recur(sofar, num_sofar, i):\n if sofar > amount:\n return float('inf')\n if sofar == amount:\n return num_sofar\n res = float('inf')\n for j in range(i, len(coins)):\n if sofar + coins[j] > amount:\n break\n res = min(res, recur(sofar+coins[j], num_sofar+1, j))\n return res\n \n x = recur(0, 0, 0)\n return -1 if x == float('inf') else x\n \"\"\"","memory":"26363"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n total_memo = dict()\n reversed_coins = coins[::-1]\n def dfs(total):\n if total == 0:\n return 0\n elif total < 0:\n return math.inf\n elif total in total_memo:\n return total_memo[total]\n else:\n min_coins_required = min([dfs(total-coin) for coin in reversed_coins]) + 1\n total_memo[total] = min_coins_required\n return min_coins_required\n coins_required = dfs(amount)\n if math.isinf(coins_required):\n return -1\n else:\n return coins_required\n\n ","memory":"26766"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n cache = {}\n numcoins = self.rec(coins, amount, len(coins)-1, cache)\n return -1 if numcoins >= sys.maxsize else numcoins\n\n def rec(self, coins, amount, idx, cache):\n if idx == 0:\n if amount%coins[idx] == 0:\n return amount//coins[idx]\n else:\n return sys.maxsize\n\n if (idx, amount) in cache:\n return cache[(idx, amount)]\n\n pick = sys.maxsize\n if coins[idx] <= amount:\n pick = 1+self.rec(coins, amount-coins[idx], idx, cache)\n notpick = self.rec(coins, amount, idx-1, cache)\n\n cache[(idx, amount)] = min(pick, notpick)\n return cache[(idx, amount)]\n ","memory":"26766"},{"code":"class Solution:\n def helper(self,coins,idx,amount,dp):\n if idx == 0:\n if amount % coins[0] == 0:\n return amount // coins[0]\n return 1e8\n if amount == 0:\n return 0\n if (idx,amount) in dp:\n return dp[(idx,amount)]\n take = 1e8\n if coins[idx] <= amount:\n take = 1 + self.helper(coins,idx,amount-coins[idx],dp)\n notTake = self.helper(coins,idx-1,amount,dp)\n dp[(idx,amount)] = min(take,notTake)\n return min(take,notTake)\n\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n dp = {}\n ans = self.helper(coins,n-1,amount,dp)\n if ans == 1e8:\n return -1\n return ans\n\n # def coinChange(self, coins: List[int], amount: int) -> int:\n # n = len(coins)\n\n \n ","memory":"27168"},{"code":"class Solution:\n def __init__(self):\n self.mem = {}\n def fun(self, coins, target, i, n):\n if i >= n:\n return -1\n if target == 0:\n return 0\n if target < 0:\n return -1\n if (i, target) in self.mem:\n return self.mem[(i, target)]\n \n a = self.fun(coins, target-coins[i], i, n)\n b = self.fun(coins, target, i+1, n)\n if a == -1 and b == -1:\n ans = -1\n elif a == -1:\n ans = b\n elif b == -1:\n ans = a + 1\n else:\n ans = min(a+1, b)\n self.mem[(i, target)] = ans\n return ans\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n return self.fun(coins, amount, 0, len(coins))","memory":"27168"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n from functools import cache\n @cache\n def dfs(rem):\n if rem == 0:\n return 0\n\n min_cost = float('inf')\n\n for coin in coins:\n if rem / coin > min_cost:\n break\n\n if rem - coin >= 0:\n min_cost = min(min_cost, dfs(rem - coin) + 1)\n\n return min_cost\n\n coins.sort(reverse=True)\n res = dfs(amount)\n return res if res != float('inf') else -1","memory":"27571"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n mem ={0:0}\n\n def min_coins(amt):\n if amt in mem:\n return mem[amt]\n minn = float('inf')\n for coin in coins:\n diff = amt - coin\n if diff < 0:\n break\n minn = min(minn,1+min_coins(diff))\n mem[amt] = minn\n return mem[amt]\n result = min_coins(amount)\n if result < float('inf'):\n return result\n else:\n return -1","memory":"27571"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n memo = {}\n def dp(target: int) -> int:\n if target < 0:\n return -1\n if target == 0:\n return 0\n if target in memo:\n return memo[target]\n result = float('inf')\n for coin in coins:\n if coin <= target:\n subcase = dp(target-coin)\n if subcase != -1:\n result = min(result, 1+dp(target-coin))\n memo[target] = result if result < float('inf') else -1\n return memo[target]\n return dp(amount)","memory":"27973"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n solutions = {}\n\n def f(coins, amount):\n \n if amount in solutions:\n return solutions[amount]\n \n if amount == 0:\n return 0\n\n if amount < min(coins):\n return -1\n \n l = [f(coins, amount - c) for c in coins]\n l = [e for e in l if e > -1]\n\n if len(l) == 0:\n solution = -1\n else:\n solution = 1 + min(l)\n\n solutions[amount] = solution\n \n return solution\n\n return f(coins, amount)","memory":"27973"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount <= 0:\n return 0\n import numpy as np\n r = (amount+1)*np.ones(amount+1) # store the min num of coins to make up a certain amount, initialize it to the max number of coins (= all 1)\n r[0] = 0\n for i in range(1,amount+1):\n \n for c in coins:\n if i>=c: #amount larger than the coin c\n r[i] = min(r[i], r[i-c]+1)\n if int(r[amount])==amount+1:\n return -1\n return int(r[amount])\n\n","memory":"28376"},{"code":"class Solution:\n def coinChange(self, coins: List[int], target: int) -> int:\n coins.sort()\n\n cache = {}\n mcache = {}\n total_needed = 0\n\n ss = []\n def _change(target):\n if target in cache:\n return cache[target]\n\n if target == 0:\n # print(\"CACHE:\", cache)\n return 0\n \n if target < 0:\n return float('+Inf')\n \n res = float(\"+Inf\")\n for c in coins:\n diff = target - c \n if diff >= 0:\n ss.append(c)\n sub_result = _change(diff)\n res = min(res, sub_result + 1 )\n ss.pop()\n \n cache[target] = res\n return res\n \n result = _change(target)\n print(cache)\n return result if result != float('inf') else -1\n ","memory":"28376"},{"code":"import numpy as np\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n min_coins = [amount + 1] * (amount + 1)\n min_coins[0] = 0\n\n for i in range(1, amount + 1):\n for c in coins:\n if i - c >= 0:\n min_coins[i] = min(min_coins[i], 1 + min_coins[i - c])\n \n return min_coins[-1] if min_coins[-1] != amount + 1 else -1","memory":"28778"},{"code":"import numpy as np\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [np.inf for _ in range(amount+1)]\n dp[0] = 0\n for i in range(1, amount+1):\n smallest = np.inf\n for c in coins:\n if i - c >= 0:\n smallest = min(smallest, 1 + dp[i-c])\n dp[i] = smallest\n if dp[amount] == np.inf:\n return -1\n return dp[amount]\n\n\n ","memory":"28778"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {0: 0}\n\n def helper(amount):\n # print(amount)\n if amount in memo:\n return memo[amount]\n if amount in coins:\n memo[amount] = 1\n else:\n res = [1 + helper(amount-coin) for coin in coins if coin <= amount]\n if any([x for x in res if x > 0]):\n memo[amount] = min([x for x in res if x > 0])\n else:\n memo[amount] = -1\n return memo[amount]\n \n return helper(amount)\n \n","memory":"29181"},{"code":"import numpy as np\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n\n # typical dp\n\n k = len(coins)\n \n if amount == 0:\n return 0\n # minimum number of coins at step i if I add the k-th coin\n dp_1d_sums = np.zeros((amount)) + np.inf\n\n dp_1d_cnt = np.zeros((amount)) + np.inf\n\n for i in range(amount):\n\n for j in range(k):\n if coins[j] == (i + 1):\n dp_1d_cnt[i] = 1\n elif coins[j] < (i + 1):\n dp_1d_cnt[i] = min(dp_1d_cnt[i], dp_1d_cnt[i - coins[j]] + 1)\n\n v = dp_1d_cnt[-1]\n if np.isinf(v):\n return -1\n else:\n return np.int64(v)\n \n \n\n\n\n","memory":"29181"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n \n memo = {c: 1 for c in coins}\n\n def dfs(amount: int):\n if amount in memo:\n return memo[amount]\n\n if amount < 0:\n return float(\"inf\")\n\n memo[amount] = 1 + min([dfs(amount - c) for c in coins])\n\n return memo[amount]\n\n coins = dfs(amount)\n if coins > amount:\n return -1\n else:\n return coins","memory":"29583"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n def dp(amt):\n if amt in memo:\n return memo[amt]\n # dp(11) = min([1 + dp(amt - c) for c in coins])\n if amt == 0:\n return 0\n elif amt < 0:\n return -1\n else:\n possible_answers = [dp(amt - c) for c in coins]\n filtered_answers = [x for x in possible_answers if x >= 0]\n if len(filtered_answers) == 0:\n memo[amt] = -1\n else:\n memo[amt] = min([1 + ans for ans in filtered_answers])\n return memo[amt]\n return dp(amount)\n ","memory":"29583"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n\n def backTrack(amnt,i,memo):\n\n if amnt ==0:\n return 0\n \n if amnt < 0:\n \n return float('inf')\n\n if i >= len(coins):\n return float('inf')\n \n if (amnt,i) in memo:\n return memo[(amnt,i)] \n \n m1=backTrack(amnt-coins[i],i,memo)+1\n m2=backTrack(amnt,i+1,memo)\n memo[(amnt,i)]=min(m1,m2)\n # return min(m1,m2)\n return memo[(amnt,i)]\n \n result=backTrack(amount,0,{})\n return result if result!=float('inf') else -1\n \n\n\n ","memory":"29986"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n table = {} \n\n def dp(amount):\n if amount == 0: \n return 0 \n \n if amount <0 :\n return float(\"inf\")\n\n if amount in table:\n return table[amount]\n \n table[amount] = min(dp(amount-coin)+1 for coin in coins)\n\n return table[amount]\n \n result = dp(amount)\n\n return -1 if result == float(\"inf\") else result\n\n # table = {}\n\n # def dp(amount):\n # if amount < 0:\n # return float(\"inf\")\n \n # if amount == 0:\n # return 0\n \n # if amount in table: \n # return table[amount]\n\n # table[amount] = min(dp(amount-coin)+1 for coin in coins)\n\n # return table[amount]\n \n # result = dp(amount)\n\n # return -1 if result == float(\"inf\") else result","memory":"29986"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins = sorted(coins)\n n = len(coins)\n # coins = coins[::-1]\n ans = 0\n if amount == 0 :\n return 0 \n\n an = 100001\n\n\n def bfs (i=0):\n qu = deque()\n for i in coins:\n qu.append((i,1))\n su = 0\n co = 0\n vi = set()\n while qu:\n nn = len(qu)\n # print(qu)\n for i in range(nn):\n cur , cnt = qu.popleft()\n if cur == amount:\n return cnt\n\n for i in range(n):\n if cur + coins[i] <= amount and (cur,coins[i]) not in vi:\n qu.append(((cur + coins[i]),cnt + 1))\n vi.add((cur,coins[i]))\n \n \n \n return -1\n\n return bfs()\n \n\n \n \n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n def chk (i , s = 0, co = 1):\n nonlocal an\n if i >= n:\n return \n s = coins[i] + s\n if s > amount:\n print(co)\n return \n\n if s == amount:\n an = min(an,co)\n return \n for x in range(i,n):\n chk(i + x ,s , co+1)\n \n for i in range(n):\n chk(i)\n \n if an == 100001:\n return -1\n return an\n \n\n \n\n\n\n\n ","memory":"30388"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def helper(coins, amount):\n if amount in memo:\n return memo[amount]\n min_coin_need = float(\"inf\")\n for coin in coins:\n if coin <= amount:\n coin_need = helper(coins, amount - coin)\n min_coin_need = min(min_coin_need, coin_need)\n if min_coin_need != float(\"inf\"):\n min_coin_need += 1\n memo[amount] = min_coin_need\n return min_coin_need\n \n memo = {0:0}\n for coin in coins:\n if coin <= amount:\n memo[coin] = 1\n coins.sort()\n value = helper(coins, amount)\n return value if value != float(\"inf\") else -1","memory":"30388"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo={}\n x= self.helper(coins,amount,len(coins)-1,memo)\n if x==float('inf'):\n return -1\n return x\n def helper(self,coins,amount,i,memo):\n\n if amount==0:\n return 0\n if amount<0 or i<0:\n return float('inf')\n if (i,amount) in memo:\n return memo[(i,amount)]\n\n take=self.helper(coins,amount-coins[i],i,memo)+1\n notTake=self.helper(coins,amount,i-1,memo)\n\n memo[(i,amount)]= min(take,notTake)\n return memo[(i,amount)]\n","memory":"30791"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def helper(amount):\n if amount == 0:\n return 0\n elif amount < 0:\n return -1\n \n others = [helper(amount-c) for c in coins]\n others = [r for r in others if r != -1]\n \n if len(others) == 0:\n return -1\n else:\n return min(others) + 1 \n \n return helper(amount)\n \n \n ","memory":"30791"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n @cache\n def dp(amt):\n if amt == amount:\n return 0\n \n if amt > amount:\n return 2 * amount\n\n return 1 + min([dp(amt+coin) for coin in coins])\n\n ans = dp(0)\n if ans > amount:\n return -1\n\n return ans","memory":"31193"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def dp(rest_amount):\n # Base Case\n if rest_amount < 0:\n return math.inf\n if rest_amount == 0:\n return 0\n \n # Recurrence relation\n if rest_amount not in memo:\n memo[rest_amount] = min(dp(rest_amount - i) for i in coins) + 1\n return memo[rest_amount]\n \n memo = {}\n ans = dp(amount)\n return -1 if ans == math.inf else ans\n","memory":"31193"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n table = {}\n\n def dfs(amount):\n if amount<0:\n return float(\"inf\")\n if amount == 0:\n return 0\n \n if amount in table:\n return table[amount]\n\n table[amount] = min(dfs(amount-coin)+1 for coin in coins)\n return table[amount]\n\n result = dfs(amount)\n\n return -1 if result==float(\"inf\") else result\n \n\n\n\n\n\n\n\n\n\n\n\n\n table = {}\n def dp(amount):\n if amount<0:\n return float(\"inf\")\n if amount==0:\n return 0\n \n if amount in table:\n return table[amount]\n \n table[amount] = min(dp(amount-coin)+1 for coin in coins)\n return table[amount]\n \n result = dp(amount)\n return -1 if result == float(\"inf\") else result\n\n\n\n\n\n\n\n\n\n \n table = {} \n\n def dp(amount):\n if amount < 0:\n return float(\"inf\")\n\n if amount==0:\n return 0\n\n if amount in table:\n return table[amount]\n\n table[amount] = min(dp(amount-coin)+1 for coin in coins)\n\n return table[amount]\n\n result = dp(amount)\n\n return -1 if result == float(\"inf\") else result \n\n # table = {} \n\n # def dp(amount):\n # if amount == 0: \n # return 0 \n \n # if amount <0 :\n # return float(\"inf\")\n\n # if amount in table:\n # return table[amount]\n \n # table[amount] = min(dp(amount-coin)+1 for coin in coins)\n\n # return table[amount]\n \n # result = dp(amount)\n\n # return -1 if result == float(\"inf\") else result\n\n # table = {}\n\n # def dp(amount):\n # if amount < 0:\n # return float(\"inf\")\n \n # if amount == 0:\n # return 0\n \n # if amount in table: \n # return table[amount]\n\n # table[amount] = min(dp(amount-coin)+1 for coin in coins)\n\n # return table[amount]\n \n # result = dp(amount)\n\n # return -1 if result == float(\"inf\") else result","memory":"31596"},{"code":"from functools import cache\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n @lru_cache(maxsize = None)\n def dp(i):\n if i == 0:\n return 0\n if i < 0:\n return float(\"inf\")\n \n \n return 1+min([dp(i-c) for c in coins])\n answer = dp(amount)\n \n return -1 if answer == float(\"inf\") else answer\n \n \n \n \n \n ","memory":"31596"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n \n @cache\n def num(amount):\n if amount in coins:\n return 1\n if amount % coins[-1] == 0:\n return amount // coins[-1]\n if amount < coins[0]:\n return inf\n \n return 1 + min(num(amount - c) for c in coins)\n \n num_coins = num(amount)\n if num_coins == inf:\n num_coins = -1\n\n return num_coins\n","memory":"31998"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n def dfs(remain,cache):\n\n if remain in cache:\n return cache[remain]\n\n if remain < 0:\n return math.inf\n \n if remain == 0:\n return 0\n\n cache[remain] = min(dfs(remain-coin,cache) + 1 for coin in coins)\n\n return cache[remain]\n\n ans = dfs(amount,{})\n\n return -1 if ans == math.inf else ans\n \n ","memory":"31998"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def coinChangeInner(rem, cache={}):\n if rem < 0:\n return math.inf\n if rem == 0:\n return 0\n if rem in cache:\n return cache[rem]\n\n cache[rem] = min(coinChangeInner(rem-x, cache) + 1 for x in coins)\n return cache[rem]\n\n ans = coinChangeInner(amount)\n return -1 if ans == math.inf else ans","memory":"32401"},{"code":"from functools import cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n n = len(coins)\n coins.sort()\n\n\n @cache\n def dp(a: int) -> Union[int, float]:\n if a < 0:\n return -1\n if a == 0:\n return 0\n \n best = float(\"inf\")\n for coin in coins:\n change = dp(a - coin)\n if change != -1:\n best = min(best, change + 1)\n \n \"\"\"\n [2]\n ^\n a = 3 > 1 > -1\n best = inf > inf > inf\n \"\"\"\n\n return -1 if best == float(\"inf\") else best\n \n \n return dp(amount)\n \n\n\n\n ","memory":"32401"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {\n 0: 0\n }\n\n def dp(n):\n if n < 0:\n return 999999999999999999999\n\n if n in memo:\n return memo[n]\n \n val = 1 + min(dp(n - c) for c in coins)\n memo[n] = val\n return val\n\n res = dp(amount)\n if res >= 999999999999999999999:\n return -1\n else:\n return res \n\n\n ","memory":"32803"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n n = len(coins)\n dp = [[[0,0]]*(amount + 1) for _ in range(n + 1)]\n coins.insert(0, 0)\n for i in range(1, n + 1):\n for j in range(amount + 1):\n if coins[i] > j:\n dp[i][j] = dp[i-1][j]\n else:\n number = None\n val1 = dp[i - 1][j - coins[i]]\n val2 = dp[i][j - coins[i]]\n val3 = dp[i-1][j]\n candidate = None\n \n if val1[0] > val2[0]:\n number = dp[i - 1][j - coins[i]][1]\n candidate = val1[0]\n elif val1[0] < val2[0]:\n number = dp[i][j - coins[i]][1]\n candidate = val2[0]\n else:\n candidate = val1[0]\n number = min(val1[1], val2[1])\n \n \n if candidate + coins[i] < val3[0]:\n candidate = val3[0]\n number = val3[1]\n elif candidate + coins[i] == val3[0]:\n candidate += coins[i]\n number = min(number + 1, val3[1]) \n else:\n candidate += coins[i]\n number += 1\n dp[i][j] = [candidate, number]\n\n if dp[n][amount][0] < amount:\n return -1\n return dp[n][amount][1]","memory":"32803"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {0: 0}\n\n def min_coins_for_amount_from_coin_list(coins: list[int], amount: int) -> int:\n if amount < 0:\n return math.inf\n if amount in memo:\n return memo[amount]\n\n memo[amount] = 1 + min(\n min_coins_for_amount_from_coin_list(\n coins=coins,\n amount=amount - coin,\n )\n for i, coin in enumerate(coins)\n )\n\n return memo[amount]\n\n ans = min_coins_for_amount_from_coin_list(coins, amount)\n return -1 if ans == math.inf else ans\n","memory":"33206"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {0: 0}\n\n def min_coins_for_amount_from_coin_list(coins: list[int], amount: int) -> int:\n if amount < 0:\n return math.inf\n if amount in memo:\n return memo[amount]\n\n memo[amount] = 1 + min(\n min_coins_for_amount_from_coin_list(\n coins=coins,\n amount=amount - coin,\n )\n for i, coin in enumerate(coins)\n )\n\n return memo[amount]\n\n ans = min_coins_for_amount_from_coin_list(coins, amount)\n return -1 if ans == math.inf else ans\n","memory":"33206"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n '''\n at each step we decide to use the coin and up our tally, or not use the coin and proceed\n '''\n n = len(coins)\n coins = sorted(coins)\n\n @cache\n def dp(amt):\n if amt == 0:\n return 0\n elif amt < 0:\n return float('inf')\n\n min_coins = float('inf')\n \n for c in coins:\n min_coins = min(min_coins, dp(amt - c) + 1)\n return min_coins\n \n total = dp(amount)\n\n return total if total != float('inf') else -1\n \n\n \n \n ","memory":"33608"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = dict()\n\n def coin_change_helper(amount: int) -> int:\n if amount == 0:\n return 0\n if amount < 0:\n return -1\n\n if amount in memo:\n return memo[amount]\n\n result = list()\n for c in coins:\n r = coin_change_helper(amount - c)\n if r >= 0:\n result.append(r + 1)\n\n if not result:\n memo[amount] = -1\n else:\n memo[amount] = min(result)\n return memo[amount]\n\n return coin_change_helper(amount)\n ","memory":"33608"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount==0:\n return 0\n\n coin_set = set(coins)\n coins = list(coin_set)\n self.result = sys.maxsize\n\n @functools.cache\n def leastCoins(n):\n if n<0:\n return -1\n elif n in coin_set:\n return 1\n else:\n minim = sys.maxsize\n for c in coins:\n res = leastCoins(n-c)\n if res!=-1:\n minim = min(minim, res)\n if minim == sys.maxsize:\n return -1\n else:\n return 1+minim\n\n return leastCoins(amount)","memory":"34011"},{"code":"\"\"\"\nproblem\n+ you have an array of coins representing different demoninations and an amount of money\n+ return the smallest number of coins that you need to represent that maount\n\nmust use recurssion of some form\n\ninsight:\n+ different comb -> recurrence relation\n+ dp to optimize similar recursive steps\n\napproaches:\n+ brute force: go through every possible result and find the smallest number of change\n+ optimized (likely sol): go through different results, and use dp to remove redundent calls\n\noptimized recursive (recurrence relation):\nparameters -> amount\nbase case: if amount left == demonimation of some kind, return 1\nif amount < all coins, return -1\nloop through coins\n recurs on amount minus coin if the coin is less than denmon\n if it returns a valid amount (non negative), return this one up\n else continue on\n\n if never exited, return -1\n\"\"\"\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n coins.sort(reverse = True)\n\n coinS = set(coins)\n smallestC = coins[-1]\n\n @cache\n def getStepsOfAmount_(curr_amount) -> int:\n if curr_amount in coinS:\n return 1\n \n if curr_amount < smallestC:\n return -1\n \n lowest = None\n\n for coin in coins:\n if coin < curr_amount:\n steps = getStepsOfAmount_(curr_amount - coin)\n \n if steps != -1:\n lowest = steps + 1 if lowest is None else min(lowest, steps + 1)\n\n return lowest if lowest is not None else -1\n \n return getStepsOfAmount_(amount)\n","memory":"34011"},{"code":"class Solution:\n def __init__(self):\n self.cache = {}\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n res = self.find(coins, amount)\n if res == 1000000:\n return -1\n else:\n return res\n\n def find(self, coins: List[int], amount: int) -> int:\n L = len(coins)\n if (L,amount) not in self.cache:\n if not amount:\n self.cache[(L,amount)] = 0\n elif not coins:\n self.cache[(L,amount)] = 1000000\n else:\n a, b = 1000000, 1000000\n a = self.find(coins[:-1], amount)\n if coins[-1] <=amount:\n b = self.find(coins, amount-coins[-1])\n self.cache[(L,amount)] = min(a,b+1)\n return self.cache[(L,amount)]","memory":"34413"},{"code":"import numpy as np\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def dfs(amount, i):\n if i >= len(coins):\n return float('inf')\n if amount == 0:\n return 0\n if amount < 0:\n return float('inf')\n return min(1 + dfs(amount - coins[i], i), dfs(amount, i + 1))\n \n dp = [[float('inf') for _ in range(len(coins) + 1)] for _ in range(amount + 1)]\n #setting amount row to 0 like dfs\n for j in range(len(coins) + 1):\n dp[0][j] = 0\n\n for i in range(1, amount + 1):\n for j in range(len(coins) - 1, -1, -1):\n if i - coins[j] < 0:\n dp[i][j] = dp[i][j + 1]\n else:\n dp[i][j] = min(dp[i][j + 1], 1 + dp[i - coins[j]][j])\n\n return dp[amount][0] if dp[amount][0] != float('inf') else -1\n\n\n\n \n \n\n ","memory":"34413"},{"code":"class Solution:\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n self.coin_mem = {}\n\n #coins.sort(reverse=True) # O(nlogn)\n return self.get_coin_change(coins, amount)\n\n def get_coin_change(self, coins: List[int], amount: int, start: int = 0) -> int:\n\n key_coin_dct = (start, amount)\n\n mem_out = self.coin_mem.get(key_coin_dct, None)\n if mem_out is not None:\n return mem_out\n\n if amount == 0:\n self.coin_mem[key_coin_dct] = 0\n return 0\n elif start == len(coins):\n self.coin_mem[key_coin_dct] = -1\n return -1\n\n # not use first coin\n out_1 = self.get_coin_change(coins, amount, start=start+1)\n\n # use first coin\n if amount >= coins[start]:\n out_2 = self.get_coin_change(coins, amount - coins[start], start=start)\n\n if out_2 == -1:\n self.coin_mem[key_coin_dct] = out_1\n return out_1\n \n out_2 += 1\n\n if out_1 == -1:\n self.coin_mem[key_coin_dct] = out_2\n return out_2\n else:\n out = min(out_1, out_2)\n self.coin_mem[key_coin_dct] = out\n return out\n \n self.coin_mem[key_coin_dct] = out_1\n return out_1\n\n \"\"\"\n # generate all possible permutations: O(n!)\n all_permutations = list(itertools.permutations(coins))\n \n #coins.sort(reverse=False)\n out_coins = None\n for coins_reordered in all_permutations:\n _coins = self.get_coin_change(coins_reordered, amount)\n print(f\"{coins_reordered}-{_coins}\")\n if out_coins is None:\n out_coins = _coins\n elif _coins != -1 and _coins < out_coins:\n out_coins = _coins\n return out_coins\n\n \"\"\"","memory":"34816"},{"code":"class Solution:\n\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n self.coin_mem = {}\n\n #coins.sort(reverse=True) # O(nlogn)\n return self.get_coin_change(coins, amount)\n\n def get_coin_change(self, coins: List[int], amount: int, start: int = 0) -> int:\n\n key_coin_dct = (start, amount)\n\n mem_out = self.coin_mem.get(key_coin_dct, None)\n if mem_out is not None:\n return mem_out\n\n if amount == 0:\n self.coin_mem[key_coin_dct] = 0\n return 0\n elif start == len(coins):\n self.coin_mem[key_coin_dct] = -1\n return -1\n\n # not use first coin\n out_1 = self.get_coin_change(coins, amount, start=start+1)\n\n # use first coin\n if amount >= coins[start]:\n out_2 = self.get_coin_change(coins, amount - coins[start], start=start)\n\n if out_2 == -1:\n self.coin_mem[key_coin_dct] = out_1\n return out_1\n \n out_2 += 1\n\n if out_1 == -1:\n self.coin_mem[key_coin_dct] = out_2\n return out_2\n else:\n out = min(out_1, out_2)\n self.coin_mem[key_coin_dct] = out\n return out\n \n self.coin_mem[key_coin_dct] = out_1\n return out_1\n\n \"\"\"\n # generate all possible permutations: O(n!)\n all_permutations = list(itertools.permutations(coins))\n \n #coins.sort(reverse=False)\n out_coins = None\n for coins_reordered in all_permutations:\n _coins = self.get_coin_change(coins_reordered, amount)\n print(f\"{coins_reordered}-{_coins}\")\n if out_coins is None:\n out_coins = _coins\n elif _coins != -1 and _coins < out_coins:\n out_coins = _coins\n return out_coins\n\n \"\"\"","memory":"34816"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n def dp(state):\n\n if state < min(coins):\n return -1\n elif state in coins:\n memo[state] = 1\n return memo[state]\n elif state in memo:\n return memo[state]\n elif state == 0:\n return 0\n else:\n ans = float('inf')\n curr = [state - i for i in coins]\n for i in curr:\n temp = dp(i)\n if temp > 0:\n ans = min(ans, temp + 1)\n if ans != float('inf'):\n memo[state] = ans\n else:\n memo[state] = -1\n return memo[state]\n \n\n\n \n\n \n \n \n memo = {}\n return dp(amount)\n \n \n \n ","memory":"35218"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n def dp(state):\n\n if state < min(coins):\n return -1\n elif state in coins:\n memo[state] = 1\n return memo[state]\n elif state in memo:\n return memo[state]\n elif state == 0:\n return 0\n else:\n ans = float('inf')\n curr = [state - i for i in coins]\n for i in curr:\n temp = dp(i)\n if temp > 0:\n ans = min(ans, temp + 1)\n if ans != float('inf'):\n memo[state] = ans\n else:\n memo[state] = -1\n return memo[state]\n \n\n\n \n\n \n \n \n memo = {}\n return dp(amount)\n \n \n \n ","memory":"35218"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n min_coin = min(coins)\n @cache\n def dp(i):\n if i == 0:\n return 0\n elif i < min_coin:\n return float('inf')\n else:\n minimum = float('inf')\n for coin in coins:\n if coin <= i:\n minimum = min(minimum, 1 + dp(i - coin))\n return minimum\n \n if dp(amount) == float('inf'):\n return -1\n return dp(amount)","memory":"36426"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def find(k):\n if k == 0:\n return 0\n if k < 0:\n return float('inf')\n count = float('inf')\n for coin in coins:\n if coin <= k:\n count = min(count, 1 + find(k - coin))\n return count\n ans = find(amount)\n return ans if ans != float('inf') else -1","memory":"36426"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # if not coins:\n # return 0\n\n # n = len(coins)\n\n # def helper(idx, amount):\n # if amount == 0:\n # return 0\n \n # if idx < n and amount > 0:\n # min_cost = float('inf')\n\n # for x in range(0, amount // coins[idx] + 1):\n\n # result = helper(idx + 1, amount - x * coins[idx])\n # if result != -1:\n # min_cost = min (min_cost, result + x)\n\n # return -1 if min_cost == float('inf') else min_cost\n # return -1 \n\n # return helper(0, amount)\n # dp = [float('inf')] * (amount + 1)\n # dp[0] = 0\n\n # for coin in coins:\n # for x in range(coin, amount + 1):\n # dp[x] = min(dp[x], dp[x - coin] + 1)\n \n # return dp[amount] if dp[amount] != float('inf') else -1\n @lru_cache(None)\n def dfs(rem):\n if rem < 0:\n return - 1\n \n if rem == 0:\n return 0 \n \n min_cost = float('inf')\n\n for coin in coins:\n res = dfs(rem - coin)\n if res != -1:\n min_cost = min(min_cost, res + 1)\n \n return min_cost if min_cost != float('inf') else -1 \n\n return dfs(amount)\n\n\n \n\n ","memory":"36828"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n '''\n amount = 11\n coins = [1, 2, 5]\n\n 11 \n = 1 + 10\n = 1 + 1 + 9\n = 1 + 1 + 1 + 8\n ...\n = 1 + 1 + 1 + ... 1 (11 of such ones)\n = 1 + 2 + 1 + 1 + 1 ... + 1 (9 1s and 1 2 coin)\n = 1 + 2 + 2 + 1 ... + 1 (7 1 coins and 2 2 coins)\n\n '''\n #Global variable coins and it represents all the coins that \n #we can use\n coins = coins\n\n #DP function that will be called\n\n '''\n Base case:\n amount = 1 but i'm exchanging the value with a coin of value 2\n => amount = -1\n => check if amount < 0. If so, return inf\n\n amount = 0 and i'm the value with a coin of value 1\n => amount = 0\n => Good value\n\n '''\n @lru_cache(None)\n def dp(amount):\n if amount < 0:\n return inf\n elif amount == 0:\n return 0\n else:\n #This is required because for a given node,\n #There may be several branches branch up to\n #So if one of the branch is finished, but not the other branches, this variable would have stored an intermediate value.\n #Once other branch are done and they have returned a value\n #We can then take the minimum of this intermediate variable\n #and the value that has just been returned.\n number_of_coins_required = inf\n\n #This represents the exchanging process\n #What it does is loop through all the coins\n #That is available, and the minus the amount\n #By the coin that is selected\n\n for i in coins:\n number_of_coins_required = min(number_of_coins_required, 1 + dp(amount - i))\n return number_of_coins_required\n \n #I want to see what kind of value\n #Is returned. If the ans value is inf, it means\n #There is no valid operation. \n ans = dp(amount)\n if ans == inf:\n return -1\n return ans","memory":"36828"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @functools.cache\n def dp(curr):\n if curr > amount: return math.inf\n if curr == amount: return 0\n mincoins = math.inf\n for c in coins:\n mincoins = min(mincoins, 1 + dp(c + curr))\n return mincoins\n res = dp(0)\n return res if dp(0) != math.inf else -1\n ","memory":"37231"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def f(amt):\n if amt == amount: return 0 # We reached the amount, no more steps needed\n if amt > amount: return 10e4+1 # Amount exceeded, return max number\n\n min_steps = 10e4+1\n for val in coins: # For multiple branches\n curr_steps = f(amt + val) + 1 # Add one step for each coin used\n min_steps = min(min_steps, curr_steps)\n return min_steps\n \n res = f(0)\n return -1 if res == 10e4+1 else res","memory":"37231"},{"code":"from functools import cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # recurse through it in dfs manner?\n # start with full amount,\n # try moving each direction in graph (subtracting different coin denomination from list) recursively\n\n @cache\n def backtrack(remaining):\n if remaining == 0:\n return 0\n if remaining < 0:\n return -1\n \n min_count = float(\"inf\")\n\n for coin in coins:\n res = backtrack(remaining-coin)\n if res != -1:\n min_count = min(min_count, res + 1)\n \n return min_count\n \n res = backtrack(amount)\n\n return res if res != float(\"inf\") else -1\n","memory":"37633"},{"code":"from functools import lru_cache, cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n @cache\n def solve(remaining):\n if remaining == 0:\n return 0\n best = float('inf')\n for c in coins:\n if remaining - c >= 0:\n res = solve(remaining - c)\n if res >= 0:\n best = min(res, best)\n return best + 1 if best != float('inf') else -1\n return solve(amount)","memory":"37633"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @lru_cache(None)\n def recurse(a):\n if a < 0:\n return float('inf')\n if a == 0:\n return 0\n return min(recurse(a - coin) + 1 for coin in coins)\n \n ans = recurse(amount)\n return ans if ans != float('inf') else -1\n","memory":"38036"},{"code":"from functools import cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @cache\n def dp(amount):\n if amount == 0:\n return 0\n elif amount < min(coins):\n return float(\"inf\")\n \n ans = float(\"inf\")\n for c in coins:\n ans = min(1+dp(amount-c), ans)\n return ans\n \n ans = dp(amount)\n if ans==float(\"inf\"):\n ans = -1\n return ans\n \n ","memory":"38036"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n MAX = 2**31-1\n n = len(coins)\n @cache\n def dp(curSum: int) -> int:\n \"\"\"\n Returns number of coins\n \"\"\"\n if curSum > amount:\n return MAX\n elif curSum == amount:\n return 0\n \n return 1 + min(\n dp(curSum + coin) for coin in coins\n )\n \n answ = dp(0)\n return answ if answ < MAX else -1","memory":"38438"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n\n from functools import cache\n @cache\n def func(s):\n if s ==amount:\n return 0\n if s>amount:\n return float('inf')\n\n r=float('inf')\n for c in coins:\n r=min(r, 1+func(s+c))\n return r\n\n r= func(0) \n return r if r!=float('inf') else -1 \n\n\n\n\n\n\n from functools import cache\n @cache\n def func(idx, s):\n if s==amount:\n return 0\n if s>amount or idx==len(coins):\n return float('inf')\n \n return min(1+func(idx,s+coins[idx]), func(idx+1,s) )\n # res= float('inf')\n # for c in coins:\n # res=min(res,func(s+c)+1)\n # return res\n res= func(0,0)\n return res if res !=float('inf') else -1\n\n \n\n\n\n\n\n\n\n dp=[-1]*(amount+1)\n dp[0]=0\n\n for c in coins:\n for i in range(amount-c+1):\n if dp[i]!=-1:\n if dp[i+c]== -1:\n dp[i+c]=dp[i]+1\n else:\n dp[i+c]=min(dp[i+c],dp[i]+1)\n return dp[-1]\n","memory":"38438"},{"code":"r'''\n# Requirements\n\nn = len(coins)\nw = amount\n1 <= n <= 12\n0 <= w <= 10,000\n1 <= coins[i] <= 2^31 - 1\n\n# Edge cases\n\n1. amount == 0\n - Return 0\n2. Cannot make up amount using the provided coin values\n - Return -1\n\n# Solutions\n\n1. Brute force, backtracking\n - O(w^n) time, O(n) auxiliary space\n2. Knapsack DP\n - O(n * w) time, O(n * w) auxiliary space\n'''\nINF = 10 ** 9\n\ndef coin_change_memo(coins: list[int], amount: int) -> int:\n memo = [[-1] * (amount + 1) for _ in range(len(coins))]\n\n def knapsack(i: int, target: int) -> int:\n if target == 0:\n return 0\n if i == len(coins):\n return INF\n if memo[i][target] > -1:\n return memo[i][target]\n\n memo[i][target] = knapsack(i + 1, target)\n if target >= coins[i]:\n memo[i][target] = min(memo[i][target], 1 + knapsack(i, target - coins[i]))\n\n return memo[i][target]\n\n ans = knapsack(0, amount)\n return ans if ans < INF else -1\n\nclass Solution:\n def coinChange(self, coins: list[int], amount: int) -> int:\n return coin_change_memo(coins, amount)","memory":"38841"},{"code":"'''\nYou are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.\n\namount = money\ncoins = type of coins\n\nreturn minimum number of coins to make that amount.\n\nif not found, return -1\n\n1 <= coins.length <= 12\n0 <= amount <= 104\n\n1 2 3 4 5\n\npick 5 until target > t\npick 4 \n'''\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # n = len(coins)\n # hm = {}\n # def dp(i,target):\n # if i == 0:\n # if target%coins[i]==0:\n # hm[(i,target)] = target//coins[i]\n # return target//coins[i]\n # else:\n # hm[(i,target)] = math.inf\n # return math.inf\n\n # if (i,target) in hm:\n # return hm[(i,target)]\n\n # pick = math.inf\n # not_pick = 0 + dp(i-1,target)\n # if coins[i] <= target:\n # pick = 1 + dp(i,target-coins[i])\n # min_cost = min(not_pick,pick)\n # hm[(i,target)] = min_cost\n # return min_cost\n \n # res= dp(n-1,amount)\n # if res == math.inf:\n # return -1\n # else: return res\n default_dict = defaultdict(lambda: math.inf)\n\n # Initialize the base cases\n for t in range(amount + 1):\n if t % coins[0] == 0:\n default_dict[(0, t)] = t // coins[0] # Use integer division\n\n # Fill the DP table\n for i in range(1, len(coins)):\n for j in range(amount + 1):\n not_pick = default_dict[(i - 1, j)] # Case where we don't pick the current coin\n pick = math.inf # Case where we pick the current coin\n if coins[i] <= j:\n pick = 1 + default_dict[(i, j - coins[i])]\n default_dict[(i, j)] = min(not_pick, pick)\n\n # Get the result from the dictionary\n result = default_dict[(len(coins) - 1, amount)]\n return result if result != math.inf else -1\n \n \n\n ","memory":"38841"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n @lru_cache(None)\n def getCoins(amnt):\n if amnt == 0:\n return 0\n elif amnt < 0:\n return math.inf\n \n minCoins = math.inf\n for coin in coins:\n minCoins = min(minCoins, getCoins(amnt - coin) + 1)\n \n return minCoins\n\n coins.sort(reverse = True)\n ret = getCoins(amount)\n\n return ret if ret != math.inf else -1","memory":"39243"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins = sorted(coins, reverse=True)\n # O(S*n) - S amount, n number of coins\n @lru_cache(None)\n def dfs(remaining_amount):\n if remaining_amount < 0:\n return -1\n if remaining_amount == 0:\n return 0\n \n min_cost = float('inf')\n for coin in coins:\n result = dfs(remaining_amount-coin)\n if result != -1:\n min_cost = min(min_cost, result+1) # +1 for the coin we just used\n \n return min_cost if min_cost != float('inf') else -1\n \n return dfs(amount)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # cache = [amount+1] * (amount+1)\n # cache[0] = 0\n\n # for i in range(1, amount+1):\n # for c in coins:\n # if i - c >= 0:\n # # print(i - c)\n # cache[i] = min(cache[i], cache[i-c] + 1)\n\n # if cache[amount] <= amount:\n # return cache[amount]\n # return -1\n","memory":"39243"},{"code":"r'''\n# Requirements\n\nn = len(coins)\nw = amount\n1 <= n <= 12\n0 <= w <= 10,000\n1 <= coins[i] <= 2^31 - 1\n\n# Edge cases\n\n1. amount == 0\n - Return 0\n2. Cannot make up amount using the provided coin values\n - Return -1\n\n# Solutions\n\n1. Brute force, backtracking\n - O(w^n) time, O(n) auxiliary space\n2. Knapsack DP\n - O(n * w) time, O(n * w) auxiliary space\n'''\nINF = 10 ** 9\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n\n memo = [[-1 if c > 0 else 0 for c in range(amount + 1)] for _ in range(len(coins))]\n\n def knapsack(coin_index: int, target: int) -> int:\n if target == 0:\n return 0\n if coin_index == len(coins):\n return INF\n if memo[coin_index][target] > -1:\n return memo[coin_index][target]\n \n min_coins = knapsack(coin_index + 1, target)\n if target >= coins[coin_index]:\n min_coins = min(min_coins, 1 + knapsack(coin_index, target - coins[coin_index]))\n\n memo[coin_index][target] = min_coins\n return min_coins\n \n coins = sorted(coins, reverse = True)\n ans = knapsack(0, amount)\n return ans if ans < INF else -1","memory":"39646"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n coins.sort(reverse=True)\n @cache\n def solve(t):\n if t == 0:\n return 0\n if t in coins:\n return 1\n if (t < min(coins)):\n return inf \n \n return min((1 + solve(t-c) for c in coins), default=inf)\n\n return solve(amount) if solve(amount) != inf else -1","memory":"39646"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0: return 0\n memo = {0: -1}\n coins.sort(reverse = True)\n def dp(total, count):\n if memo[0] != -1 and memo[0] <= count+1:\n return -1\n for coin in coins:\n if coin == total:\n memo[0] = count+1 if memo[0] == -1 else min(memo[0], count+1)\n return 1\n if coin > total or ((total-coin) in memo and memo[total-coin] <= count+1):\n continue\n if dp(total-coin, count+1) == 1:\n return count+1\n memo[total-coin] = count+1\n return -1\n\n dp(amount, 0)\n return memo[0]","memory":"40048"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0: return 0\n memo = {0: -1}\n coins.sort(reverse = True)\n def dp(total, count):\n if memo[0] != -1 and memo[0] <= count+1:\n return -1\n for coin in coins:\n if coin == total:\n memo[0] = count+1 if memo[0] == -1 else min(memo[0], count+1)\n return 1\n if coin > total or ((total-coin) in memo and memo[total-coin] <= count+1):\n continue\n if dp(total-coin, count+1) == 1:\n return count+1\n memo[total-coin] = count+1\n return -1\n\n dp(amount, 0)\n return memo[0]","memory":"40048"},{"code":"\"\"\"\n\n\"\"\" \n \nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n MAX = 10**5\n\n @cache\n def dp(amount: int) -> int:\n if amount < 0:\n return MAX\n\n if amount == 0:\n return 0\n\n rs = MAX\n for c in coins:\n rs = min(rs, 1 + dp(amount - c))\n return rs\n \n rs = dp(amount)\n return -1 if rs >= MAX else rs","memory":"40451"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n init_val = amount\n coins.sort(reverse=True)\n \n d = {}\n def numCoins(amount):\n if amount == 0:\n return 0\n if amount in coins:\n return 1\n if amount in d:\n return d[amount]\n d[amount]=1+min([numCoins(amount-coin) for coin in coins if amount-coin>0]+[init_val])\n return d[amount]\n\n if numCoins(amount) <= amount:\n return numCoins(amount)\n return -1\n\n","memory":"40451"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n @cache\n def helper(s):\n if s == amount:\n return 0\n if s > amount:\n return None\n min_coins = None\n for coin in coins:\n ans = helper(s+coin)\n if ans!=None:\n if min_coins == None:\n min_coins = 1+ans\n else:\n min_coins = min(min_coins,1+ans)\n return min_coins\n ret = helper(0)\n if ret == None:\n return -1\n return ret\n \n\n","memory":"40853"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n # def recursion(ind, target): \n\n # if ind == 0 :\n # if target % coins[ind] == 0:\n # return target // coins[ind] \n\n \n # return float(\"inf\") \n\n # if (ind, target) in dp:\n # return dp[(ind, target)]\n \n # notTake = 0 + recursion(ind-1, target)\n \n # take = float(\"inf\")\n # if coins[ind] <= target: #not taking amount that is greater than target\n # #fucntion is counting coins; therefore add 1\n # take = 1 + recursion(ind, target - coins[ind])\n # dp[(ind, target)] = min(notTake, take)\n # return dp[(ind, target)] \n \n # n = len(coins)\n # dp = {}\n # ans = recursion(n-1, amount)\n # print(1+float(\"inf\"))\n # return ans if ans != float(\"inf\") else -1\n \n \n # TABULATION:\n\n dp = {}\n for target in range(amount+1):\n if target % coins[0] == 0:\n dp[(0,target)] = target // coins[0]\n\n else:\n dp[(0,target)] = float(\"inf\")\n\n #written for ind = 0\n #now write loops in opposite fashion for both of the changing parameters\n n = len(coins)\n for ind in range(1, n):\n for target in range(amount+1):\n notTake = 0 + dp[(ind-1,target)]\n \n take = float(\"inf\")\n if coins[ind] <= target: #not taking amount that is greater than target\n #fucntion is counting coins; therefore add 1\n take = 1 + dp[(ind, target - coins[ind])]\n dp[(ind, target)] = min(notTake, take)\n\n ans = dp[(n-1, amount)]\n return ans if ans != float(\"inf\") else -1\n ","memory":"40853"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort(reverse=True)\n coinSet = set(coins)\n mapping = {}\n\n evenCoins = {}\n\n for c in coins:\n for d in coins:\n if c > d and c % d == 0:\n if c in evenCoins:\n evenCoins[c].append(d)\n else:\n evenCoins[c] = [d]\n\n if amount == 0:\n return 0\n\n def recurse(n: int):\n if n in coinSet:\n return 1\n\n if n in mapping:\n return mapping[n]\n\n found = None\n\n coinsToSkip = set()\n\n for c in coins:\n if c not in coinsToSkip and n > c:\n temp = recurse(n-c)\n if temp > 0:\n if c in evenCoins:\n for e in evenCoins[c]:\n coinsToSkip.add(e)\n\n if found is None:\n found = temp + 1\n else:\n found = min(found, temp + 1)\n\n if found is None:\n mapping[n] = -1\n return -1\n else:\n mapping[n] = found\n return found\n\n return recurse(amount)\n\n \n ","memory":"41256"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def coinschange(i,amount,n):\n if i >= n:\n return 1e9\n if amount == 0:\n return 0\n if dp[i][amount] != -1:\n return dp[i][amount]\n pick = 1e9\n if coins[i] <= amount:\n pick = 1 + coinschange(i,amount-coins[i],n)\n notpick = coinschange(i+1,amount,n)\n dp[i][amount] = min(pick,notpick)\n return dp[i][amount]\n pick,notpick = 0,0\n res = []\n dp = [[-1 for k in range(amount+1)]for l in range(len(coins)+1)]\n ans=coinschange(0,amount,len(coins))\n return -1 if ans==1e9 else ans\n ","memory":"41256"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n mem = defaultdict(lambda: math.inf)\n mem[amount] = 0\n\n def dfs(s):\n if s > amount:\n return math.inf\n \n if s in mem:\n return mem[s]\n\n for c in coins:\n ss = s + c\n mem[s] = min(mem[s], dfs(ss) + 1)\n return mem[s]\n\n res = dfs(0)\n return res if res < math.inf else -1 ","memory":"41658"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[-1 for i in range(len(coins))] for j in range(amount + 1)]\n #coins.sort()\n def helper(ind, tar):\n if tar == 0:\n return 0\n \n if ind == -1:\n return float(\"inf\")\n\n if dp[tar][ind] != -1:\n return dp[tar][ind]\n r1 = float(\"inf\")\n if coins[ind] <= tar:\n r1 = helper(ind, tar - coins[ind])\n r2 = helper(ind - 1, tar)\n dp[tar][ind] = min(1 + r1, r2)\n return dp[tar][ind]\n \n ans = helper(len(coins) - 1 , amount)\n #print(dp)\n if ans == float(\"inf\"):\n return -1\n else:\n return ans","memory":"41658"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n def solve(rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n if rem in dp:\n return dp[rem]\n\n mn = float(\"inf\")\n for c in coins:\n res = solve(rem - c)\n if res >= 0 and res < mn:\n mn = res + 1\n dp[rem] = mn if mn != float(\"inf\") else -1\n return dp[rem]\n\n dp = {}\n coins.sort(reverse=True)\n return solve(amount)\n","memory":"42061"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def tab():\n dp = [inf] * (amount + 1)\n dp[0] = 0\n for i in range(1, amount + 1):\n for coin in coins:\n if coin == i:\n dp[i] = 1\n break\n elif coin > i:\n continue\n else:\n dp[i] = min(dp[i], 1 + dp[i-coin])\n return -1 if dp[amount] == inf else dp[amount]\n \n def memo(index, remain):\n if remain < 0:\n return inf\n if remain == 0:\n return 0\n if index == len(coins):\n return inf\n if remain in cache:\n return cache[remain]\n min_coin = inf\n for i in range(index, len(coins)):\n take = 1 + memo(index, remain - coins[i])\n skip = memo(index + 1, remain)\n min_coin = min(min_coin, take, skip)\n #return min_coin\n cache[remain] = min_coin\n return cache[remain]\n\n #return tab()\n cache = {}\n #min_coin = memo(0, amount)\n #return -1 if min_coin == inf else min_coin\n\n def dfs(rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n if rem in cache:\n return cache[rem]\n min_cost = float('inf')\n for coin in coins:\n res = dfs(rem - coin)\n if res != -1:\n min_cost = min(min_cost, res + 1)\n cache[rem] = min_cost\n return cache[rem] if cache[rem] != float('inf') else -1\n\n return dfs(amount)","memory":"42061"},{"code":"from functools import lru_cache\n\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n coins.sort()\n @lru_cache(None)\n def dfs(rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n min_cost = float('inf')\n for i in range(len(coins)):\n if coins[i] > amount:\n break\n res = dfs(rem - coins[i])\n if res != -1:\n min_cost = min(min_cost, res + 1)\n return min_cost if min_cost != float('inf') else -1\n\n return dfs(amount)","memory":"42463"},{"code":"'''Return the fewest number of coins that you need to make up that amount.\n - using the array coins, and figure out how many coins minimum are needed to make up amount\n\n\nIf that amount of money cannot be made up by any combination of the coins, return -1.\n - what does it mean if it cant be made?\n all coin values > amount, so there is no possible way to make exact amount with coins\n\n- infinite number of coins\n - i can reuse coins\n\n- count of minimum coins needed.\n - counting\n - minimum\n - compare against every other count\n\ncoins = coins, i = individual coin\n\namount = amount\n\ndecisions?\n\ntake: amount - i\n take: amount - i\n skip i = i + 1\nskip : i + 1'''\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n global res\n res = amount + 1\n @cache\n def minimumCoins_startingWith_toMake(x: int) -> int:\n if x == 0:\n return 0\n res = 10**5\n for i in range(len(coins)):\n if coins[i] <= x:\n curr = minimumCoins_startingWith_toMake(x - coins[i])\n res = min(curr + 1, res)\n\n return res\n\n result = minimumCoins_startingWith_toMake(amount)\n\n return (-1 if result == 10**5 else result)\n\n \n\n\n\n\n ","memory":"42463"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def collect(idx: int, remaining: int) -> int:\n if idx == 0:\n if remaining % coins[idx] == 0:\n return remaining // coins[idx]\n \n return float(\"inf\")\n \n if dp[idx][remaining] != -1:\n return dp[idx][remaining]\n \n pick = float(\"inf\")\n notPick = collect(idx-1, remaining)\n if coins[idx] <= remaining:\n pick = 1 + collect(idx, remaining-coins[idx])\n \n dp[idx][remaining] = min(notPick, pick)\n return dp[idx][remaining]\n \n N = len(coins)\n dp = [[-1]*(amount+1) for _ in range(N)]\n result = collect(N-1, amount)\n \n return result if result != float(\"inf\") else -1\n","memory":"42866"},{"code":"from collections import defaultdict\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n self.dp={}\n self.dp[0]=0\n def helper(amount):\n if amount in self.dp:\n return self.dp[amount]\n if amount<0:\n return float('inf')\n if amount==0:\n return 0\n if amount in coins:\n return 1\n else:\n mins=[]\n for c in coins:\n if c<=amount:\n mins.append(helper(amount-c)+1)\n if len(mins)>0: \n self.dp[amount]=min(mins) \n return self.dp[amount]\n else:\n return float('inf')\n res=helper(amount) \n return res if res<float('inf') else -1\n \n\n","memory":"42866"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n\n # dp calculates the minimum number of coins needed to reach amount starting from currAmount\n def dp(currAmount: int) -> int:\n if currAmount == amount:\n #print(currAmount, \" trovato\")\n return 0\n elif currAmount > amount:\n #print(currAmount, \" non valido\")\n return -1\n\n if currAmount in memo:\n return memo[currAmount]\n\n minimum = -1\n for coin in coins:\n #print(currAmount, \" + \", coin)\n candidate = dp(currAmount + coin)\n if minimum == -1 and candidate >= 0: # the first time a solution is found, the minimum is update\n #print(\"minimum = \", candidate)\n minimum = candidate\n elif candidate != -1: # ignores all the wrong \"path\" that leads to -1\n minimum = min(minimum, candidate)\n #print(\"minimum = \", minimum)\n \n if minimum == -1:\n memo[currAmount] = -1\n else:\n memo[currAmount] = minimum + 1 \n return memo[currAmount]\n \n memo = {}\n return dp(0)\n ","memory":"43268"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n # Sort the coins in descending order\n reversedOrderedCoins = sorted(coins, reverse=True)\n\n def dp(currAmount: int) -> int:\n if currAmount == amount:\n return 0\n elif currAmount > amount:\n return -1\n\n if currAmount in memo:\n return memo[currAmount]\n\n minimum = -1\n for coin in coins:\n candidate = dp(currAmount + coin)\n \n # If candidate reaches the amount, break the loop early\n if candidate == 0:\n memo[currAmount] = 1\n return 1\n \n if minimum == -1 and candidate >= 0: # First valid solution\n minimum = candidate\n elif candidate != -1: # Ignore invalid paths\n minimum = min(minimum, candidate)\n\n if minimum == -1:\n memo[currAmount] = -1\n else:\n memo[currAmount] = minimum + 1\n\n return memo[currAmount]\n\n memo = {}\n return dp(0)\n","memory":"43268"},{"code":"r'''\n# Requirements\n\nn = len(coins)\n1 <= n <= 12\n1 <= coins[i] <= 2^31 - 1\n1 <= amount <= 10,000\n\n# Edge cases\n\n1. len(coins) == 1\n\n2. Coins cannot make up amount\n - Return -1\n\n# Solutions\n\n1. Brute force, backtracking\n - O(2^w) time, O(n) auxiliary space, where w = amount\n2. Memo / DP, unlimited knapsack\n - O(nw) time, O(nw) auxiliary space\n'''\ndef coin_change_memo(coins: list[int], amount: int) -> int:\n n = len(coins)\n memo = [[-1] * (amount + 1) for _ in range(n)]\n\n def min_coins(i: int, target: int) -> int:\n if target == 0:\n return 0\n if i == n:\n return float('inf')\n if memo[i][target] != -1:\n return memo[i][target]\n\n # Skip this coin\n memo[i][target] = min_coins(i + 1, target)\n\n # Take one coin\n if target >= coins[i]:\n memo[i][target] = min(memo[i][target], min_coins(i, target - coins[i]) + 1)\n\n return memo[i][target]\n\n ans = min_coins(0, amount)\n return ans if ans != float('inf') else -1\n\nclass Solution:\n def coinChange(self, coins: list[int], amount: int) -> int:\n return coin_change_memo(coins, amount)","memory":"43671"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n cache = {}\n def dfs(amt):\n if amt == amount:\n return 0\n if amt > amount:\n return math.inf\n if amt in cache:\n return cache[amt]\n cache[amt] = math.inf\n for c in coins:\n cache[amt] = min(cache[amt], 1 + dfs(amt + c))\n return cache[amt]\n\n cc = dfs(0)\n return cc if cc != math.inf else -1","memory":"43671"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n cache = {}\n\n def DP(n):\n if n < 0: # used too many coins\n return math.inf\n if n == 0: # hit the target amount perfectly\n return 0\n if n in cache: # call already cached\n return cache[n]\n \n res = math.inf # what will be returned => min num of coins used\n \n for coin in coins:\n call = DP(n - coin)\n res = min(res, call + 1)\n \n cache[n] = res\n return res\n \n res = DP(amount)\n \n if res == math.inf:\n return -1\n \n return res\n ","memory":"44073"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n cache = {}\n def dfs(amt):\n if amt < 0:\n return sys.maxsize\n if amt == 0:\n return 0\n if amt in cache:\n return cache[amt]\n cache[amt] = sys.maxsize\n for c in coins:\n cache[amt] = min(cache[amt], 1 + dfs(amt - c))\n return cache[amt]\n\n cc = dfs(amount)\n return cc if cc != sys.maxsize else -1","memory":"44073"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n \n def top_down(coins: List[int], amount: int):\n cache = {}\n def traverse(current):\n if current == amount:\n return 0\n \n if current in cache:\n return cache[current]\n \n current_min = amount+1\n for coin in coins:\n if current + coin <= amount:\n n_coins = traverse(\n current+coin\n ) + 1\n current_min = min(current_min, n_coins)\n \n cache[current] = current_min\n return current_min\n\n current_min = traverse(0)\n return current_min if (current_min < amount + 1) else -1\n \n return top_down(coins, amount)","memory":"44476"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n def backtrack(cur_a):\n if cur_a in memo:\n return memo[cur_a]\n if cur_a == amount:\n return 0\n if cur_a > amount:\n return float('inf')\n min_coins = float('inf')\n for n in coins:\n min_coins = min(min_coins , backtrack(cur_a + n ) + 1)\n memo[cur_a] = min_coins\n return min_coins\n res = backtrack(0)\n return res if res != float('inf') else -1","memory":"44476"},{"code":"class Solution:\n\n \"\"\"\n\n \"\"\"\n def coinChange(self, coins: List[int], amount: int) -> int:\n mem = dict()\n def backtrack(val):\n if val in mem:\n return mem[val]\n if val == amount:\n return 0\n \n mem[val] = float('inf')\n for c in coins:\n if c + val <= amount:\n mem[val] = min(mem[val], 1 + backtrack(c+val))\n return mem[val]\n res = backtrack(0)\n return res if res != float('inf') else -1 \n","memory":"44878"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n recurDict = {}\n\n def recur(coins, amount):\n\n if amount == 0:\n return 0\n\n elif amount < 0:\n return -1\n\n else:\n if amount in recurDict:\n return recurDict[amount]\n \n temp = []\n for coin in coins:\n val = recur(coins, amount - coin)\n if val != -1:\n temp.append(val + 1)\n \n if len(temp) == 0:\n recurDict[amount] = -1\n return -1\n else:\n retval = min(temp)\n recurDict[amount] = retval \n return retval\n\n return recur(coins, amount)","memory":"44878"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n seen_amounts = {}\n def recurs(amount):\n if amount == 0:\n return 0\n if amount in seen_amounts:\n return seen_amounts[amount]\n \n temp = []\n for coin in coins:\n if coin < amount:\n temp.append(1 + recurs(amount-coin))\n elif coin == amount:\n temp.append(1)\n else:\n temp.append(10001)\n least_coins = min(temp)\n seen_amounts[amount] = least_coins\n return least_coins\n \n ans = recurs(amount)\n if ans > 10000:\n return -1\n return ans\n ","memory":"45281"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n # Memoization dictionary\n memo = {}\n\n def _dp(remaining):\n # Base case\n if remaining == 0:\n return 0\n if remaining < 0:\n return float('inf')\n\n # Check memorize\n if remaining in memo:\n return memo[remaining]\n\n # Recursive: Try all coins\n min_coins = float('inf')\n for coin in coins:\n result = _dp(remaining - coin)\n # Check if it return positive number, can have answer\n if result != float('inf'):\n min_coins = min(min_coins, result+1)\n \n # Memory\n memo[remaining] = min_coins\n return min_coins\n\n result = _dp(amount)\n return result if result != float('inf') else -1","memory":"45281"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n def tab():\n dp = [inf] * (amount + 1)\n dp[0] = 0\n for i in range(1, amount + 1):\n for coin in coins:\n if coin == i:\n dp[i] = 1\n break\n elif coin > i:\n continue\n else:\n dp[i] = min(dp[i], 1 + dp[i-coin])\n return -1 if dp[amount] == inf else dp[amount]\n \n def memo(index, remain):\n if remain < 0:\n return inf\n if remain == 0:\n return 0\n if index == len(coins):\n return inf\n if remain in cache:\n return cache[remain]\n #min_coin = inf\n \n take = 1 + memo(index, remain - coins[index])\n skip = memo(index + 1, remain)\n min_coin = min(take, skip)\n #return min_coin\n cache[remain] = min_coin\n return cache[remain]\n\n #return tab()\n cache = {}\n #min_coin = memo(0, amount)\n #return -1 if min_coin == inf else min_coin\n\n @lru_cache(None)\n def dfs2(index, rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n min_cost = float('inf')\n for i in range(index, len(coins)):\n take = dfs(i, rem - coins[i])\n if take != -1:\n min_cost = min(min_cost, take + 1)\n skip = dfs(i + 1 , rem)\n if skip != -1:\n min_cost = min(min_cost, skip) \n return min_cost if min_cost != float('inf') else -1\n \n #return dfs2(0, amount)\n\n \n memo = {}\n\n def dfs(rem):\n if rem < 0:\n return -1\n if rem == 0:\n return 0\n if rem in memo:\n return memo[rem]\n min_cost = float('inf')\n for coin in coins:\n res = dfs(rem - coin)\n if res != -1:\n min_cost = min(min_cost, res + 1)\n memo[rem] = min_cost\n return memo[rem] if min_cost != float('inf') else -1\n\n return dfs(amount)","memory":"45683"},{"code":"class Solution:\n def _coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[float(\"inf\")] * (amount + 1) for _ in range(len(coins) + 1)]\n\n for i in range(len(coins)+1):\n dp[i][0] = 0\n\n for i in range(1, len(coins) + 1):\n for j in range(1, amount + 1):\n if coins[i-1] <= j:\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\n else:\n dp[i][j] = dp[i-1][j]\n \n return dp[len(coins)][amount] if dp[len(coins)][amount] != float(\"inf\") else -1\n \n def coinChange(self, coins: List[int], amount: int) -> int:\n\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\n \n def dfs(idx: int, remaining_amount: int) -> int:\n # Base case: if the amount is zero, we found a valid solution (0 coins more needed)\n if remaining_amount == 0:\n return 0\n \n if idx == len(coins):\n return float(\"inf\")\n\n if dp[idx][remaining_amount] != -1:\n return dp[idx][remaining_amount]\n\n include = float(\"inf\")\n if coins[idx] <= remaining_amount:\n include = 1 + dfs(idx, remaining_amount - coins[idx])\n exclude = dfs(idx + 1, remaining_amount)\n dp[idx][remaining_amount] = min(exclude, include)\n\n return dp[idx][remaining_amount]\n \n result = dfs(0, amount)\n return result if result != float(\"inf\") else -1\n\n def _coinChange(self, coins: List[int], amount: int) -> int:\n # Initialize dp table for memoization with -1 (indicating uncomputed states)\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\n \n def dfs(i: int, amount: int) -> int:\n # Base case: If the amount is 0, no coins are needed\n if amount == 0:\n return 0\n # If no coins left but amount > 0, it's not possible to make the amount\n if i == 0:\n return float('inf')\n \n # Check memoized result\n if dp[i][amount] != -1:\n return dp[i][amount]\n \n # Recursive case: two options, either take the current coin or skip it\n if coins[i - 1] <= amount:\n # Option 1: Take the coin and reduce the amount, stay on the same coin (i)\n take = 1 + dfs(i, amount - coins[i - 1])\n # Option 2: Don't take the coin, move to the previous coin (i-1)\n skip = dfs(i - 1, amount)\n dp[i][amount] = min(take, skip) # Choose the minimum\n else:\n # Skip the current coin since it's greater than the amount\n dp[i][amount] = dfs(i - 1, amount)\n \n return dp[i][amount]\n \n # Call the recursive function starting from the last coin\n result = dfs(len(coins), amount)\n \n # If the result is infinity, it means it's not possible to make the amount\n return result if result != float('inf') else -1\n \n def _coinChange(self, coins: List[int], amount: int) -> int:\n dp = [-1] * (amount + 1)\n\n def dfs(amount):\n if amount == 0:\n return 0\n \n if amount < 0:\n return float(\"inf\")\n if dp[amount] != -1:\n return dp[amount]\n\n low = float(\"inf\")\n for coin in coins:\n res = dfs(amount - coin)\n if res != float(\"inf\"):\n low = min(low, 1 + res) \n dp[amount] = low\n return low\n \n res = dfs(amount)\n return res if res != float(\"inf\") else -1\n\n\n \n ","memory":"45683"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = dict()\n\n def dp(v):\n if v < 0:\n return -1\n if v == 0:\n return 0\n \n min_v = math.inf\n for i in range(len(coins)):\n if (v-coins[i]) not in memo:\n _dp = dp(v-coins[i])\n memo[v-coins[i]] = _dp\n else:\n _dp = memo[v-coins[i]]\n \n if _dp != -1:\n min_v = min(min_v, 1+_dp)\n\n return min_v if min_v != math.inf else -1\n \n return dp(amount)","memory":"46086"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n wayMap = {}\n def ways(n):\n if n < 0:\n return 10**12\n if n == 0:\n wayMap[0] = 0\n return 0\n if n in wayMap:\n return wayMap[n]\n\n m = 10**12\n for coin in coins:\n c = ways(n-coin)\n if c < m:\n m = c\n\n wayMap[n] = 1 + m\n return 1 + m\n\n ways(amount)\n return wayMap[amount] if wayMap[amount] < 10**12 else -1","memory":"46086"},{"code":"class Solution:\n def _coinChange(self, coins: List[int], amount: int) -> int:\n dp = [[float(\"inf\")] * (amount + 1) for _ in range(len(coins) + 1)]\n\n for i in range(len(coins)+1):\n dp[i][0] = 0\n\n for i in range(1, len(coins) + 1):\n for j in range(1, amount + 1):\n if coins[i-1] <= j:\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\n else:\n dp[i][j] = dp[i-1][j]\n \n return dp[len(coins)][amount] if dp[len(coins)][amount] != float(\"inf\") else -1\n \n def coinChange(self, coins: List[int], amount: int) -> int:\n\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\n \n def dfs(idx: int, remaining_amount: int) -> int:\n # Base case: if the amount is zero, we found a valid solution (0 coins more needed)\n if remaining_amount == 0:\n return 0\n \n if idx == len(coins) or remaining_amount < 0:\n return float(\"inf\")\n\n if dp[idx][remaining_amount] != -1:\n return dp[idx][remaining_amount]\n\n include = float(\"inf\")\n if coins[idx] <= remaining_amount:\n include = 1 + dfs(idx, remaining_amount - coins[idx])\n exclude = dfs(idx + 1, remaining_amount)\n dp[idx][remaining_amount] = min(exclude, include)\n\n return dp[idx][remaining_amount]\n \n result = dfs(0, amount)\n return result if result != float(\"inf\") else -1\n\n def _coinChange(self, coins: List[int], amount: int) -> int:\n # Initialize dp table for memoization with -1 (indicating uncomputed states)\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\n \n def dfs(i: int, amount: int) -> int:\n # Base case: If the amount is 0, no coins are needed\n if amount == 0:\n return 0\n # If no coins left but amount > 0, it's not possible to make the amount\n if i == 0:\n return float('inf')\n \n # Check memoized result\n if dp[i][amount] != -1:\n return dp[i][amount]\n \n # Recursive case: two options, either take the current coin or skip it\n if coins[i - 1] <= amount:\n # Option 1: Take the coin and reduce the amount, stay on the same coin (i)\n take = 1 + dfs(i, amount - coins[i - 1])\n # Option 2: Don't take the coin, move to the previous coin (i-1)\n skip = dfs(i - 1, amount)\n dp[i][amount] = min(take, skip) # Choose the minimum\n else:\n # Skip the current coin since it's greater than the amount\n dp[i][amount] = dfs(i - 1, amount)\n \n return dp[i][amount]\n \n # Call the recursive function starting from the last coin\n result = dfs(len(coins), amount)\n \n # If the result is infinity, it means it's not possible to make the amount\n return result if result != float('inf') else -1\n \n def _coinChange(self, coins: List[int], amount: int) -> int:\n dp = [-1] * (amount + 1)\n\n def dfs(amount):\n if amount == 0:\n return 0\n \n if amount < 0:\n return float(\"inf\")\n if dp[amount] != -1:\n return dp[amount]\n\n low = float(\"inf\")\n for coin in coins:\n res = dfs(amount - coin)\n if res != float(\"inf\"):\n low = min(low, 1 + res) \n dp[amount] = low\n return low\n \n res = dfs(amount)\n return res if res != float(\"inf\") else -1\n\n\n \n ","memory":"46488"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n dp = {}\n coins.sort(reverse=True)\n def helper(amount):\n if amount == 0:\n return 0\n elif amount in dp:\n return dp[amount]\n coinCounts = []\n for c in coins:\n if amount >= c:\n minChange = helper(amount - c)\n if minChange >= 0:\n coinCounts.append(minChange + 1)\n dp[amount] = min(coinCounts) if coinCounts else - 1\n return dp[amount]\n return helper(amount)","memory":"46488"},{"code":"class Solution:\n def coinChange(self, coins, amount):\n if amount == 0:\n return 0\n \n memo = {}\n min_coin = 2 ** 31 - 1\n for coin in coins:\n if coin < min_coin:\n min_coin = coin\n memo[coin] = 1\n \n if amount < min_coin:\n return -1\n \n def dp(rem_amount):\n if rem_amount in memo:\n return memo[rem_amount]\n if rem_amount < 0:\n return -1\n if rem_amount < min_coin:\n memo[rem_amount] = -1\n return memo[rem_amount]\n \n min_res = float('inf')\n for i in range(len(coins) - 1, -1, -1):\n coin = coins[i]\n res = dp(rem_amount - coin)\n if res != -1 and res < min_res:\n min_res = res + 1\n \n memo[rem_amount] = min_res if min_res != float('inf') else -1\n return memo[rem_amount]\n \n memo[amount] = dp( amount)\n return memo[amount]\n \n ","memory":"46891"},{"code":"class Solution:\n results = dict()\n def coinChange(self, coins: List[int], amount: int) -> int:\n seen = dict()\n seen[0] = 0\n for c in coins:\n seen[c] = 1\n def coinChangeHelper(level, attempts):\n if (amount in seen):\n return\n nextLevel = set()\n for c in coins:\n for l in level:\n if c + l not in seen and c + l <= amount:\n nextLevel.add(c + l)\n seen[c + l] = attempts + 1\n if len(nextLevel) == 0:\n return -1\n coinChangeHelper(nextLevel, attempts + 1)\n coinChangeHelper(set(coins), 1)\n if (amount in seen):\n return seen[amount]\n return -1\n","memory":"46891"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n\n def helper(amount):\n if amount == 0 :\n return 0\n elif amount < 0 :\n return float('inf')\n if amount in memo:\n return memo[amount]\n min_coins = float('inf')\n for coin in coins:\n num_coins_with_curr_coin = helper(amount-coin)\n memo[amount-coin] = num_coins_with_curr_coin\n if num_coins_with_curr_coin != -1:\n min_coins = min(min_coins, 1 + num_coins_with_curr_coin)\n return min_coins if min_coins != float('inf') else -1\n return helper(amount)\n","memory":"47293"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n #next block doesnt work\n '''\n coins.sort(reverse=True)\n res = 0\n for coin in coins:\n if amount//coin:\n temp, amount = divmod(amount, coin)\n res += temp\n if amount == 0:\n return res\n else:\n return -1\n '''\n coins.sort(reverse=True)\n partial = Counter(coins)\n for coin1 in coins:\n for coin2 in coins:\n val = coin1+coin2\n if val in partial:\n partial[val] = min(partial[val], 2)\n val = 2*coin1+coin2\n if val in partial:\n partial[val] = min(partial[val], 3)\n val = 3*coin1+coin2\n if val in partial:\n partial[val] = min(partial[val], 4)\n val = 4*coin1+coin2\n if val in partial:\n partial[val] = min(partial[val], 5)\n val = 5*coin1+coin2\n if val in partial:\n partial[val] = min(partial[val], 6)\n\n def recursive(amount):\n res = 2**32\n if amount < min(coins):\n return res\n if amount in partial.keys():\n #print(f\"amount found {amount} {partial[amount]}\")\n return partial[amount]\n\n for c in coins:\n res = min(res, recursive(amount-c)+1)\n partial[amount] = res\n return res\n res = recursive(amount)\n if res == 2**32:\n return -1\n return res\n#[186,419,83,408]\n#6249 ","memory":"47293"},{"code":"from functools import lru_cache\n\nclass Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n def recurse(amount):\n output = float('inf')\n if amount in memo:\n return memo[amount]\n if amount == 0:\n # print('true')\n output = 0\n if amount < 0:\n output = None \n else:\n for coin in coins:\n if recurse(amount-coin) is not None:\n # print(amount-coin)\n output = min(output, recurse(amount-coin) +1)\n # print(output)\n memo[amount] = output\n return output\n temp = recurse(amount)\n # print(memo)\n return temp if temp != float('inf') else -1\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n # dp = {}\n # # debug this thing!!!!!!\n # def backtrack(amount, count):\n # mincount = float('inf')\n # if amount in dp:\n # return dp[amount]\n # if amount == 0: \n # mincount = min(mincount, count)\n # print('mincount is ' +str(mincount))\n # if amount < 0:\n # return\n # for coin in coins:\n # print(coin)\n # backtrack(amount - coin, count +1)\n # dp[amount] = mincount\n # return dp[amount]\n # backtrack(amount, 0)\n # # print(dp)\n # return dp[amount] if dp[amount] != float('inf') else -1\n\n\n\n\n\n\n\n\n\n\n\n # # if amount == 0:\n # # return 0\n # # # bottom up dp \n # # m = len(coins)\n # # n = amount\n # # dp = [[float('inf')] * (n+1)] * m\n # # for i in range(m):\n # # dp[i][0] = 0\n # # for j in range(n+1):\n # # for i in range(m):\n # # if j - coins[i] >= 0 and dp[i][j-coins[i]] != float('inf'):\n # # print(dp[i][j-coins[i]])\n # # dp[i][j] = min(dp[i][j], dp[i][j-coins[i]]+1)\n # # # dp[i][j] = min(dp[i][j], dp[i-1][j]) # is this necessary??\n # # # print(dp)\n # # return dp[-1][-1] if dp[-1][-1] != float('inf') else -1 \n\n\n\n\n\n\n\n\n\n\n\n # # # # but first, recursion:\n # # # @lru_cache(None)\n # # # # coins = sorted(coins, reverse=True)\n\n # # # def recurse(amount):\n # # # mincount = float('inf')\n # # # if amount < 0:\n # # # return None\n # # # if amount == 0:\n # # # return 0\n # # # for coin in coins:\n # # # temp = recurse(amount-coin)\n # # # print(temp)\n # # # if temp: # note this is the mistake, the second last line would return -1\n # # # mincount = min(mincount, temp+1)\n # # # return mincount if mincount != float('inf') else -1\n\n # # # return recurse(amount)\n\n\n\n\n # # # recursion \n # # # if amount == 0:\n # # # print(amount)\n # # # return 0\n # # # def recurse(coins, amount, count):\n # # # mincount = float('inf')\n # # # if amount <0:\n # # # return None\n # # # if amount == 0:\n # # # return count\n # # # else:\n # # # for i in coins:\n # # # temp =recurse(coins, amount - i, count+1)\n # # # if temp:\n # # # mincount= min(mincount, temp)\n # # # return mincount\n # # # temp = recurse(coins, amount, 0) \n # # # return temp if temp != float('inf') else -1\n\n\n\n\n\n\n\n\n\n\n\n\n\n # # # dp = [float('inf')] * (amount +1)\n # # # dp[0] = 0\n # # # for i in range(amount+1):\n # # # for j in coins:\n # # # if j <= i:\n # # # dp[i] = min(dp[i], dp[i-j]+1)\n # # # return -1 if dp[-1] == float('inf') else dp[-1]\n","memory":"47696"},{"code":"from functools import lru_cache\n\nclass Solution:\n \n def coinChange(self, coins: List[int], amount: int) -> int:\n\n # can a greedy solution work\n # coins.sort(reverse=True)\n count = 0\n\n @lru_cache(5000)\n def brute_dp(left):\n if left == 0: return 0\n if left < 0: return float('inf')\n \n exchanges = float('inf')\n for c in coins:\n exchanges = min(exchanges, 1 + brute_dp(left-c) )\n \n return exchanges\n \n # \n ans = brute_dp(amount)\n if ans == float('inf'): return -1\n return ans\n\n ","memory":"47696"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n if amount == 0:\n return 0\n memo = {}\n coins.sort(reverse=True)\n def backtrack(curr):\n if curr in memo:\n return memo[curr]\n if curr == amount:\n return 0\n result = float('inf')\n for num in coins:\n if curr + num > amount:\n continue\n result = min(result, 1 + backtrack(curr + num))\n memo[curr] = result\n return memo[curr]\n val = backtrack(0)\n if val == float('inf'):\n return -1\n return val","memory":"48098"},{"code":"class Solution:\n def coinChange(self, coins: List[int], amount: int) -> int:\n memo = {}\n def helper(coins, amount):\n if (tuple(coins), amount) in memo:\n return memo[(tuple(coins), amount)]\n if amount == 0:\n memo[(tuple(coins), amount)] = 0\n return 0\n elif coins == []:\n memo[(tuple(coins), amount)] = float(inf)\n return float(inf)\n elif coins[0] > amount:\n return float(inf)\n memo[(tuple(coins), amount)] = float(inf)\n else:\n # choose the coin\n # skip the coin\n res = min(\n helper(coins[1:], amount),\n 1 + helper(coins, amount - coins[0])\n )\n memo[(tuple(coins), amount)] = res\n return res\n res = helper(sorted(coins), amount)\n if res == float(inf):\n return -1\n else:\n return res\n","memory":"48098"}],"string":"[\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {0: 0}\\n for i in range(1,amount+1):\\n for coin in coins:\\n if i - coin in dp and i not in dp:\\n dp[i] = 1 + dp[i-coin]\\n elif i-coin in dp:\\n dp[i] = min(dp[i], 1+dp[i-coin])\\n return dp.get(amount, -1)\",\n \"memory\": \"16301\"\n },\n {\n \"code\": \"# 零钱兑换\\n\\n# 整数数组 coins ，表示不同面额的硬币；以及一个整数 amount ，表示总金额。\\n\\n# 返回可以凑成总金额所需的 最少的硬币个数 。\\n# 如果没有任何一种硬币组合能组成总金额，返回 -1 。\\n\\n# 每种硬币的数量是无限的。\\n\\n# 解題思路：\\n# 這道問題要求找到最少的硬幣數量來湊成給定的 amount，可以使用動態規劃（Dynamic Programming）來解決。\\n# 這是一個經典的最優子結構問題，我們可以通過將問題拆解為子問題來解決。\\n\\n# 動態規劃的思路：\\n# 定義狀態：\\n# 定義一個一維數組 dp，其中 dp[i] 表示湊成金額 i 所需的最少硬幣數量。\\n# 初始時，dp[0] = 0，因為湊成金額 0 所需的硬幣數量是 0。\\n# 其他的 dp[i] 初始設為 float('inf')，表示初始時無法湊成該金額。\\n\\n# 轉移方程：\\n# 我們可以使用每個硬幣來更新 dp 表：對於每個硬幣 coin，遍歷 dp，如果我們選擇該硬幣，則可以更新金額 i 的最少硬幣數量：\\n# dp[i]=min(dp[i],dp[i−coin]+1)\\n# 這意味著，如果選擇了硬幣 coin，那麼我們只需要湊成金額 i - coin，並再加上一枚 coin。\\n\\n# 結果：\\n# 最終，dp[amount] 中的值就是湊成該金額所需的最少硬幣數量。如果 dp[amount] 依然是 float('inf')，則表示無法湊成該金額，返回 -1。\\n\\n# 279 322 2915 518 983 264\\n# 279. Perfect Squares\\n# 322. Coin Change\\n# 2915. Length of the Longest Subsequence That Sums to Target\\n# 518. Coin Change II\\n# 983. Minimum Cost For Tickets\\n# 264. Ugly Number II\\n\\n# DP Bottom Up, math\\n# O(n * m), s:O(n)\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float(\\\"inf\\\")] * (amount + 1)\\n dp [0] = 0\\n\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if coin <= i:\\n dp[i] = min(dp[i], dp[i - coin] + 1)\\n \\n return dp[-1] if dp[-1] != float(\\\"inf\\\") else -1 # 如果 dp[amount] 還是無限大，說明無法湊成該金額\\n \\n \\n '''\\n 先 loop coins\\n '''\\n # 初始化 dp 數組，大小為 amount + 1，初始值為無限大\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0 # 湊成金額 0 所需硬幣數量為 0\\n \\n # 對於每一個金額，嘗試使用每一個硬幣\\n for coin in coins:\\n for i in range(coin, amount + 1):\\n dp[i] = min(dp[i], dp[i - coin] + 1)\\n \\n # 如果 dp[amount] 還是無限大，說明無法湊成該金額\\n return dp[amount] if dp[amount] != float('inf') else -1 \",\n \"memory\": \"16301\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n # Create a dp array with size (amount + 1), initialized to a large number (inf)\\n dp = [float('inf')] * (amount + 1)\\n \\n # Base case: No coins are needed to make amount 0\\n dp[0] = 0\\n \\n # Iterate over each coin in the coins array\\n for coin in coins:\\n # For each coin, update the dp array for all amounts from the coin to the amount\\n for i in range(coin, amount + 1):\\n dp[i] = min(dp[i], dp[i - coin] + 1)\\n \\n # If the value in dp[amount] is still infinity, it means it's impossible to make that amount\\n return dp[amount] if dp[amount] != float('inf') else -1\\n\\n \\\"\\\"\\\"\\n sorted_coins = sorted(coins)\\n if amount == 0:\\n return 0\\n\\n if sorted_coins[0] > amount:\\n return -1\\n\\n \\n remaining_amount = amount\\n n_coins = 0\\n j = len(sorted_coins) - 1\\n while(remaining_amount > 0):\\n if sorted_coins[j] <= remaining_amount:\\n remaining_amount-=sorted_coins[j]\\n n_coins+=1\\n else:\\n j-=1\\n if j < 0:\\n return -1\\n \\n return n_coins\\n \\\"\\\"\\\"\",\n \"memory\": \"16703\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], n: int) -> int:\\n dp = [float('inf') for i in range(n+1)]\\n dp[0] = 0\\n\\n for c in coins:\\n for i in range(c, n+1):\\n dp[i] = min(dp[i], dp[i-c] + 1)\\n \\n return dp[-1] if dp[-1] != float('inf') else -1\\n\\n \",\n \"memory\": \"16703\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n MAX_INT = 2**31 - 1\\n \\n # DP is the minimum number of couns needed to produce amount i\\n dp = [MAX_INT] * (amount + 1)\\n dp[0] = 0\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if i - coin >= 0:\\n dp[i] = min(dp[i], dp[i - coin] + 1)\\n \\n return dp[-1] if dp[-1] != MAX_INT else -1\\n \",\n \"memory\": \"17106\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [0] + [-1 for _ in range(amount)]\\n for coin in coins:\\n if len(dp) > coin:\\n dp[coin] = 1\\n\\n for i in range(len(dp)):\\n if dp[i] == -1:\\n tmp_num = 10001\\n for coin in coins:\\n if i - coin >= 0:\\n if dp[i-coin] >= 0:\\n tmp_num = min(tmp_num, dp[i-coin])\\n if tmp_num >= 0 and tmp_num <= 10000:\\n dp[i] = tmp_num + 1\\n return dp[amount]\",\n \"memory\": \"17106\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n nums = [-1] * (amount + 1)\\n nums[0] = 0\\n for i in range(len(nums)):\\n for coin in coins:\\n prev_idx = i - coin\\n if 0 <= prev_idx and nums[prev_idx] != -1:\\n if nums[i] == -1:\\n nums[i] = nums[prev_idx] + 1\\n nums[i] = min(nums[i], nums[prev_idx] + 1)\\n print(nums)\\n return nums[amount]\",\n \"memory\": \"17508\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [float('inf')] * (amount + 1)\\n dp[0] = 0\\n for coin in coins:\\n for i in range(1, len(dp)):\\n if i >= coin:\\n dp[i] = min(dp[i], dp[i - coin] + 1)\\n print(dp)\\n return dp[-1] if dp[-1] != float('inf') else -1\\n\",\n \"memory\": \"17508\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\\"\\\"\\\"\\n Can't simply use the largest coin\\n Maybe do preprocessing?\\n BFS forward times out, not sure what's faster. Not clear that backward would be faster\\n\\n Try Dijkstra's? No, this would be the same\\n this wasn't DFS at all, can fix it\\n \\\"\\\"\\\"\\n q = []\\n d = defaultdict(lambda: float('inf'))\\n\\n heapq.heappush(q, (0, 0))\\n\\n while q:\\n n, a = heapq.heappop(q)\\n if a == amount: return n\\n if n < d[a]:\\n d[a] = n\\n for coin in coins:\\n if a + coin <= amount:\\n heapq.heappush(q, (n+1, a + coin))\\n\\n return -1\\n\",\n \"memory\": \"17911\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n # top-down approach\\n # min_coins = 0\\n\\n # @cache\\n # def coinChangeHelper(curr_amount):\\n\\n # if curr_amount == amount:\\n # return 0\\n \\n # if curr_amount > amount:\\n # return -1\\n \\n # min_coins = float('inf')\\n\\n # for coin in coins:\\n # c1 = coinChangeHelper(curr_amount + coin)\\n # if c1 != -1:\\n # min_coins = min(c1 + 1, min_coins)\\n \\n # return min_coins\\n\\n # res = coinChangeHelper(0)\\n # if res < float('inf'):\\n # return res\\n \\n # return -1\\n\\n\\n # bottom up solution\\n dp = defaultdict(int)\\n dp[0] = 0\\n for cost in range(1, amount + 1):\\n min_cost = float('inf')\\n for coin in coins:\\n if cost - coin in dp:\\n min_cost = min(1 + dp[cost - coin], min_cost)\\n dp[cost] = min_cost\\n\\n print(dp)\\n return dp[amount] if dp[amount] < float('inf') else -1\\n \\n\\n\\n\\n\\n\\n\",\n \"memory\": \"17911\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n=len(coins)\\n dp=[[-1 for i in range(amount+1)]for j in range(n+1)]\\n ans=self.helper(n-1,amount,coins,n,dp)\\n if(ans==sys.maxsize):\\n return -1\\n return ans\\n\\n def helper(self,ind,amount,coins,n,dp):\\n if(ind==0):\\n if(amount%coins[ind]==0):\\n return amount//coins[ind]\\n else:\\n return sys.maxsize\\n if(dp[ind][amount]!=-1):\\n return dp[ind][amount]\\n #two options either to pick or notpick\\n notpick=self.helper(ind-1,amount,coins,n,dp)\\n pick=sys.maxsize\\n if(coins[ind]<=amount):\\n #here we have infinite supply of coins\\n pick=1+self.helper(ind,amount-coins[ind],coins,n,dp)\\n dp[ind][amount]=min(pick,notpick)\\n return dp[ind][amount]\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n\\n\\n\\n\\n \\n\\n\\n \",\n \"memory\": \"18313\"\n },\n {\n \"code\": \"class Solution:\\n def coins(self, idx, amt, coins, dp):\\n if idx == 0:\\n if amt % coins[idx] == 0:\\n return amt//coins[idx]\\n else:\\n return 10**8\\n\\n if dp[idx][amt] != -1:\\n return dp[idx][amt]\\n not_take = self.coins(idx-1, amt, coins, dp)\\n take = 10**8\\n if coins[idx] <= amt:\\n take = 1 + self.coins(idx, amt-coins[idx], coins, dp)\\n dp[idx][amt] = min(not_take, take)\\n return dp[idx][amt]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n dp = [[-1 for _ in range(amount+1)] for _ in range(n)]\\n return self.coins(n-1,amount, coins, dp) if self.coins(n-1,amount, coins, dp) != 10**8 else -1\\n \",\n \"memory\": \"18313\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins, amount):\\n \\\"\\\"\\\"\\n :type coins: List[int]\\n :type amount: int\\n :rtype: int\\n \\\"\\\"\\\"\\n # A large value greater than the maximum possible number of coins required, even infinity is fine\\n # coins.sort(reverse=True)\\n # count = 0\\n # for i in coins:\\n # if amount != 0:\\n # count += amount//i\\n # amount %= i\\n # else:\\n # break\\n # if amount == 0:\\n # return count\\n # else:\\n # return -1\\n max_value = float('inf')\\n n = len(coins)\\n \\n dp = [[0 for _ in range(amount+1)] for _ in range(n +1 )]\\n \\n for i in range(amount + 1):\\n dp[0][i] = max_value\\n for i in range(1, n+1):\\n dp[i][0] = 0\\n\\n for i in range(1, amount +1):\\n if i % coins[0] == 0:\\n dp[1][i] = i// coins[0]\\n else:\\n dp[1][i] = max_value\\n \\n for i in range(2, n +1):\\n for j in range(1, amount + 1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][ j - coins[i-1]])\\n else:\\n dp[i][j] = dp[i-1][j]\\n\\n # print(dp)\\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\\n\\n\\n # # Initialize dp array where dp[i] represents the minimum number of coins needed for amount i\\n # # dp[i] is initialized with max_value, which is essentially infinity\\n # dp = [max_value] * (amount + 1)\\n \\n # # Base case: No coins are needed to make the amount 0\\n # dp[0] = 0\\n \\n # # Iterate through each coin denomination\\n # for coin in coins:\\n # # Iterate through all amounts from the current coin value to the target amount\\n # for x in range(coin, amount + 1):\\n # # Update dp[x] with the minimum of:\\n # # 1. The current value of dp[x] (minimum coins needed without considering the current coin)\\n # # 2. dp[x - coin] + 1 (minimum coins needed for the remaining amount (x - coin) plus the current coin)\\n # dp[x] = min(dp[x], dp[x - coin] + 1)\\n \\n # # If dp[amount] is still max_value, it means the target amount cannot be made up by any combination of the coins\\n # # In that case, return -1 to indicate that it's not possible to make the change\\n # # Otherwise, return dp[amount], which represents the minimum number of coins needed\\n # return dp[amount] if dp[amount] != max_value else -1\",\n \"memory\": \"18716\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins, amount):\\n \\\"\\\"\\\"\\n :type coins: List[int]\\n :type amount: int\\n :rtype: int\\n \\\"\\\"\\\"\\n # A large value greater than the maximum possible number of coins required, even infinity is fine\\n # coins.sort(reverse=True)\\n # count = 0\\n # for i in coins:\\n # if amount != 0:\\n # count += amount//i\\n # amount %= i\\n # else:\\n # break\\n # if amount == 0:\\n # return count\\n # else:\\n # return -1\\n max_value = float('inf')\\n n = len(coins)\\n \\n dp = [[0 for _ in range(amount+1)] for _ in range(n +1 )]\\n \\n for i in range(amount + 1):\\n dp[0][i] = max_value\\n for i in range(1, n+1):\\n dp[i][0] = 0\\n\\n for i in range(1, amount +1):\\n if i % coins[0] == 0:\\n dp[1][i] = i// coins[0]\\n else:\\n dp[1][i] = max_value\\n \\n for i in range(2, n +1):\\n for j in range(1, amount + 1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][ j - coins[i-1]])\\n else:\\n dp[i][j] = dp[i-1][j]\\n\\n # print(dp)\\n return dp[n][amount] if dp[n][amount] != float('inf') else -1\\n\\n\\n # # Initialize dp array where dp[i] represents the minimum number of coins needed for amount i\\n # # dp[i] is initialized with max_value, which is essentially infinity\\n # dp = [max_value] * (amount + 1)\\n \\n # # Base case: No coins are needed to make the amount 0\\n # dp[0] = 0\\n \\n # # Iterate through each coin denomination\\n # for coin in coins:\\n # # Iterate through all amounts from the current coin value to the target amount\\n # for x in range(coin, amount + 1):\\n # # Update dp[x] with the minimum of:\\n # # 1. The current value of dp[x] (minimum coins needed without considering the current coin)\\n # # 2. dp[x - coin] + 1 (minimum coins needed for the remaining amount (x - coin) plus the current coin)\\n # dp[x] = min(dp[x], dp[x - coin] + 1)\\n \\n # # If dp[amount] is still max_value, it means the target amount cannot be made up by any combination of the coins\\n # # In that case, return -1 to indicate that it's not possible to make the change\\n # # Otherwise, return dp[amount], which represents the minimum number of coins needed\\n # return dp[amount] if dp[amount] != max_value else -1\",\n \"memory\": \"18716\"\n },\n {\n \"code\": \"class Solution:\\n def coinChangeHelper(self, coins, amount, cdict):\\n if amount < 0:\\n return sys.maxsize\\n elif amount == 0:\\n return 0\\n elif amount in cdict:\\n return cdict[amount]\\n else:\\n res = sys.maxsize\\n for coin in coins:\\n tempres = self.coinChangeHelper(coins, amount - coin, cdict)\\n if tempres != sys.maxsize:\\n tempres += 1\\n res = min(res, tempres)\\n cdict[amount] = res \\n return res\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cdict = {}\\n for coin in coins:\\n cdict[coin] = 1\\n \\n res = self.coinChangeHelper(coins, amount, cdict)\\n if res == sys.maxsize:\\n return -1\\n else:\\n return res\\n \",\n \"memory\": \"19118\"\n },\n {\n \"code\": \"def calculate_minimum_coins(coins, rem, counter):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n if counter[rem - 1] != float(\\\"inf\\\"):\\n return counter[rem - 1]\\n minimum = float(\\\"inf\\\")\\n\\n for s in coins:\\n result = calculate_minimum_coins(coins, rem - s, counter)\\n if result >= 0 and result < minimum:\\n minimum = 1 + result\\n\\n counter[rem - 1] = minimum if minimum != float(\\\"inf\\\") else -1\\n return counter[rem - 1]\\n\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n if amount < 1:\\n return 0\\n return calculate_minimum_coins(coins, amount, [float(\\\"inf\\\")] * amount)\",\n \"memory\": \"19118\"\n },\n {\n \"code\": \"class Solution:\\n def _coinChange(self, coins, amount, dp):\\n if amount in dp:\\n return dp[amount]\\n if amount == 0:\\n return 0\\n if amount < 0 or len(coins) == 0:\\n return float('inf')\\n\\n best = float('inf')\\n for coin in coins:\\n if amount - coin < 0:\\n break\\n best = min(best, self._coinChange(coins, amount-coin, dp) + 1)\\n dp[amount] = best\\n return best\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins = sorted(coins)\\n total = self._coinChange(coins, amount, {})\\n return -1 if total > 10**6 else total\",\n \"memory\": \"19521\"\n },\n {\n \"code\": \"class Solution:\\n def dp(self, coins, w):\\n if w < 0:\\n return float(\\\"Inf\\\")\\n if w == 0:\\n return 0\\n if self.mat[w] != -1:\\n return self.mat[w]\\n minCoins = float(\\\"Inf\\\")\\n for coin in coins:\\n minCoins = min(minCoins, 1 + self.dp(coins, w - coin))\\n self.mat[w] = minCoins\\n return self.mat[w]\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n self.mat = [-1 for i in range(0, amount + 1)]\\n ans = self.dp(coins, amount)\\n if ans < float(\\\"Inf\\\"):\\n return ans\\n return -1\\n \",\n \"memory\": \"19521\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n self.cache = dict()\\n self.cache[0] = 0\\n ways = self.helper(coins, amount)\\n return ways if ways != float('inf') else -1\\n\\n def helper(self, coins, amount):\\n if amount in self.cache:\\n return self.cache[amount]\\n if amount < 0:\\n return float('inf')\\n \\n minWays = float('inf')\\n ways = float('inf')\\n for coin in coins:\\n ways = 1 + self.helper(coins, amount - coin)\\n minWays = min(minWays, ways)\\n\\n self.cache[amount] = minWays\\n return minWays\",\n \"memory\": \"19923\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n min_coins = [amount+1 for _ in range(amount+1)]\\n min_coins[0] = 0\\n '''\\n for i in range(1,amount+1):\\n for coin in coins:\\n if i - coin >= 0:\\n min_coins[i] = min(min_coins[i-coin]+1, min_coins[i])\\n if min_coins[-1] > amount:\\n return -1\\n else:\\n return min_coins[-1]\\n '''\\n\\n visited = {}\\n def roundcounter(n,coins,visited):\\n if n in visited:\\n return visited[n]\\n if n == 0:\\n result = 0 \\n elif n < 0:\\n result = amount + 1\\n else:\\n results = []\\n for coin in coins:\\n results.append(roundcounter(n-coin,coins,visited))\\n result = min(results) + 1\\n visited[n] = result\\n return result\\n \\n answer = roundcounter(amount,coins,visited)\\n if answer > amount:\\n answer = -1\\n return answer\\n\\n\\n\\n\",\n \"memory\": \"19923\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, coins, t, i):\\n # Base case: if we are at the last coin\\n if i == len(coins) - 1:\\n if t % coins[i] == 0:\\n self.dp[i][t] = t // coins[i]\\n return self.dp[i][t]\\n self.dp[i][t] = float('inf') # Impossible case, return inf\\n return self.dp[i][t]\\n \\n # Return the already computed value if available\\n if self.dp[i][t] != -1:\\n return self.dp[i][t]\\n \\n # Case where we do not take the current coin\\n not_take = self.solve(coins, t, i + 1)\\n \\n # Case where we take the current coin (if possible)\\n take = float('inf')\\n if coins[i] <= t:\\n take = 1 + self.solve(coins, t - coins[i], i)\\n \\n # Store the result in dp table and return\\n self.dp[i][t] = min(take, not_take)\\n return self.dp[i][t]\\n\\n def coinChange(self, coins: list[int], amount: int) -> int:\\n # Initialize dp table with -1 (for memoization)\\n self.dp = [[-1 for _ in range(amount + 1)] for _ in range(len(coins))]\\n \\n # Solve the problem starting from the first coin\\n ans = self.solve(coins, amount, 0)\\n \\n # If no valid solution exists, return -1\\n if ans >= float('inf'):\\n return -1\\n \\n return ans\",\n \"memory\": \"20326\"\n },\n {\n \"code\": \"import sys\\nclass Solution:\\n def helper(self,n,coins,w,res,idx):\\n if n == idx:\\n if w == 0:\\n return res\\n return sys.maxsize\\n if w>=coins[idx]:\\n return min(self.helper(n,coins,w-coins[idx],res+1,idx),self.helper(n,coins,w-coins[idx],res+1,idx+1),self.helper(n,coins,w,res,idx+1))\\n else:\\n return self.helper(n,coins,w,res,idx+1)\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # res=0\\n \\n # ans = self.helper(n,coins,amount,res,0)\\n # if ans == sys.maxsize:\\n # return -1\\n # return ans\\n n=len(coins)\\n dp=[[float('inf')]*(amount+1) for _ in range(n+1)]\\n for i in range(n+1):\\n dp[i][0] = 0\\n for i in range(1,n+1):\\n for j in range(amount+1):\\n if j>=coins[i-1]:\\n dp[i][j] = min(dp[i][j-coins[i-1]]+1,dp[i-1][j])\\n else:\\n dp[i][j] = dp[i-1][j]\\n if dp[n][amount] == float('inf'):\\n return -1\\n return dp[n][amount]\",\n \"memory\": \"20326\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp=[]\\n for i in range(len(coins)+1):\\n dp.append([0]*(amount+1))\\n for i in range(amount+1):\\n dp[0][i]=float('inf')\\n for i in range(1,len(coins)+1):\\n for j in range(1,amount+1):\\n take=float('inf')\\n if j>=coins[i-1]:\\n take=dp[i][j-coins[i-1]]+1\\n not_take=dp[i-1][j]\\n dp[i][j]=min(take,not_take)\\n #print(dp)\\n return dp[-1][-1] if dp[-1][-1]!=float('inf') else -1\",\n \"memory\": \"20728\"\n },\n {\n \"code\": \"import sys\\nclass Solution:\\n def helper(self,n,coins,w,res,idx):\\n if n == idx:\\n if w == 0:\\n return res\\n return sys.maxsize\\n if w>=coins[idx]:\\n return min(self.helper(n,coins,w-coins[idx],res+1,idx),self.helper(n,coins,w-coins[idx],res+1,idx+1),self.helper(n,coins,w,res,idx+1))\\n else:\\n return self.helper(n,coins,w,res,idx+1)\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # res=0\\n \\n # ans = self.helper(n,coins,amount,res,0)\\n # if ans == sys.maxsize:\\n # return -1\\n # return ans\\n n=len(coins)\\n dp=[[float('inf')]*(amount+1) for _ in range(n+1)]\\n for i in range(n+1):\\n dp[i][0] = 0\\n for i in range(1,n+1):\\n for j in range(amount+1):\\n if j>=coins[i-1]:\\n dp[i][j] = min(dp[i-1][j-coins[i-1]]+1, dp[i][j-coins[i-1]]+1,dp[i-1][j])\\n else:\\n dp[i][j] = dp[i-1][j]\\n \\n \\n if dp[n][amount] == float('inf'):\\n return -1\\n return dp[n][amount]\",\n \"memory\": \"20728\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n cnts = [None for _ in range(amount)] #ith for amt=i+1\\n cset = set(coins)\\n\\n def dp(amt):\\n nonlocal cnts, cset \\n minc = amt + 1\\n if amt == 0:\\n return 0\\n if cnts[amt-1]: # careful w -1!\\n return cnts[amt-1]\\n for c in cset:\\n if c > amt:\\n continue\\n if dp(amt-c) == -1:\\n continue\\n # Q: early stop when no longer possible?\\n minc = min(minc,dp(amt-c)+1)\\n \\n if minc == amt + 1: # no actual update\\n minc = -1\\n cnts[amt-1] = minc\\n return minc\\n\\n return dp(amount)\\n\\n \\n \\n\",\n \"memory\": \"21131\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n # dp[i][j] = number of coins from first i coins needed to make amount j\\n \\n n = len(coins)\\n dp = [[float('inf') for j in range(amount+1)] for i in range(n)]\\n \\n for i in range(n): \\n dp[i][0] = 0 # no coins needed to make amount 0\\n if coins[i] <= amount:\\n dp[i][coins[i]] = 1 # 1 coin needed to make coins[i] amongst first i coins\\n \\n for j in range(1, amount+1):\\n for i in range(n):\\n \\n if coins[i] <= j:\\n dp[i][j] = min(dp[i-1][j], dp[i][j-coins[i]]+1) # dp[i-1][j] -> not using ith coin, or using it \\n else:\\n dp[i][j] = dp[i-1][j] # not using coins[i], just using first i-1 coins\\n \\n if dp[n-1][amount] == float('inf'):\\n return -1\\n return dp[n-1][amount]\",\n \"memory\": \"21131\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # dp[i][amount] = min coins to make sum amount with i coins available\\n n = len(coins)\\n dp = [[float(\\\"inf\\\") for i in range(amount + 2)] for j in range(n + 2)]\\n for i in range(n):\\n dp[i][0] = 0\\n for i in range(n):\\n for j in range(amount + 1):\\n if j == 0:\\n continue\\n if j - coins[i] >= 0:\\n dp[i][j] = min(dp[i][j - coins[i]], dp[i][j]) + 1\\n if i - 1 >= 0:\\n dp[i][j] = min(dp[i - 1][j], dp[i][j])\\n return dp[n - 1][amount] if dp[n - 1][amount] != float(\\\"inf\\\") else -1\\n \",\n \"memory\": \"21533\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n t = [[float('inf')]*(n+1) for _ in range(amount+1)]\\n\\n for i in range(1, n+1):\\n t[0][i] = 0\\n \\n for i in range(1, amount+1):\\n for j in range(1, n+1):\\n if coins[j-1] <= i:\\n t[i][j] = min(1+t[i-coins[j-1]][j], t[i][j-1])\\n else:\\n t[i][j] = t[i][j-1]\\n\\n if t[-1][-1] == float(\\\"inf\\\"):\\n t[-1][-1] = -1\\n\\n return t[-1][-1]\\n\\n \\n \",\n \"memory\": \"21533\"\n },\n {\n \"code\": \"class Solution:\\n \\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n=len(coins)\\n dp = [[float('inf') for _ in range(amount + 1)] for _ in range(n)]\\n for i in range(amount+1):\\n if i%coins[0]==0:\\n dp[0][i]=i//coins[0]\\n else:\\n dp[0][i]=float('inf')\\n for i in range(1,n):\\n for j in range(amount+1):\\n not_t=0+dp[i-1][j]\\n take=float('inf')\\n if coins[i]<=j:\\n take=1+dp[i][j-coins[i]]\\n dp[i][j]=min(not_t,take)\\n \\n ans=dp[n-1][amount]\\n if ans>=float('inf'):\\n return -1\\n else:\\n return ans\\n\\n\\n\\n \",\n \"memory\": \"21936\"\n },\n {\n \"code\": \"class Solution:\\n \\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n=len(coins)\\n dp = [[float('inf') for _ in range(amount + 1)] for _ in range(n)]\\n for i in range(amount+1):\\n if i%coins[0]==0:\\n dp[0][i]=i//coins[0]\\n else:\\n dp[0][i]=float('inf')\\n for i in range(1,n):\\n for j in range(amount+1):\\n not_t=0+dp[i-1][j]\\n take=float('inf')\\n if coins[i]<=j:\\n take=1+dp[i][j-coins[i]]\\n dp[i][j]=min(not_t,take)\\n \\n ans=dp[n-1][amount]\\n if ans>=float('inf'):\\n return -1\\n else:\\n return ans\\n\\n\\n\\n \",\n \"memory\": \"21936\"\n },\n {\n \"code\": \"# Top down\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def dp(i, curr):\\n if i >= len(coins) or curr > amount:\\n return float(\\\"inf\\\")\\n elif curr == amount:\\n return 0\\n return min(\\n 1 + dp(i, curr+coins[i]),\\n dp(i+1, curr)\\n )\\n\\n min_num_coins = dp(0,0) \\n return min_num_coins if min_num_coins != float(\\\"inf\\\") else -1\\n\\n# Bottom Up\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int: \\n \\\"\\\"\\\"\\n Note\\n - i maps to curr in top down soln\\n - i-coins[j] maps to curr+coins[i] in dp(i, curr+coins[i]) \\n - j maps to i (index of coins) in top down soln\\n - j-1 maps to i+1 in dp(i+1, curr)\\n\\n dp = [ [float(\\\"inf\\\") for j in range(len(coins)+1)] for i in range(amount+1) ]\\n - for i in range(amount+1) : amount can be 0 \\n - for j in range(len(coins)+1) : min nos of coins to take can be 0\\n \\\"\\\"\\\"\\n\\n dp = [ [float(\\\"inf\\\") for j in range(len(coins)+1)] for i in range(amount+1) ]\\n \\n for j in range(len(coins)+1):\\n dp[0][j] = 0\\n\\n for i in range(amount+1):\\n for j in range(len(coins)+1):\\n if j < len(coins) and i - coins[j] >= 0:\\n dp[i][j] = min(dp[i][j], 1 + dp[i - coins[j]][j])\\n if j - 1 >= 0:\\n dp[i][j] = min(dp[i][j], dp[i][j-1])\\n\\n return dp[-1][-1] if dp[-1][-1] != float(\\\"inf\\\") else -1\\n\\n \\n# Bottom Up (space optimised)\\n# class Solution:\\n# def coinChange(self, coins: List[int], amount: int) -> int:\\n# \\\"\\\"\\\"\\n# Overall Approach\\n# - dp[i] \\n# - nos of ways to form i amt w/o taking new coins\\n# - 1 + dp[i - c]\\n# - nos of ways to form i amt by taking coin c (1) + nos of ways to form i-c amt\\n# \\\"\\\"\\\"\\n \\n# dp = [float(\\\"inf\\\")] * (amount+1)\\n# dp[0] = 0\\n# for i in range(len(dp)):\\n# for c in coins:\\n# if i - c in range(len(dp)):\\n# dp[i] = min(dp[i], 1 + dp[i - c])\\n \\n# return dp[-1] if dp[-1] != float(\\\"inf\\\") else -1\\n\",\n \"memory\": \"22338\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n n = len(coins)\\n dp = [-1] * (amount+1)\\n def path(sum):\\n if sum > amount:\\n return float('inf')\\n if sum == amount:\\n return 0\\n if dp[sum] != -1:\\n return dp[sum]\\n res = float('inf')\\n for i in range(n):\\n res = min(res, path(sum+coins[i])+1)\\n dp[sum] = res\\n return res\\n out = path(0)\\n return out if out != float('inf') else -1\\n\\n \",\n \"memory\": \"22338\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = [float('inf')] * (amount+1)\\n memo[0] = 0 # index is the amount and the value is the coins used\\n def dfs(currAmount):\\n nonlocal memo\\n if currAmount < 0:\\n return -1\\n\\n if memo[currAmount] != float('inf'):\\n return memo[currAmount]\\n\\n result = float('inf')\\n for coin in coins:\\n res = dfs(currAmount-coin)\\n if res >= 0:\\n result = min(result, res+1)\\n \\n memo[currAmount] = result if result != float('inf') else -1\\n return memo[currAmount]\\n \\n dfs(amount)\\n return memo[amount]\",\n \"memory\": \"22741\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coinSet = set(coins)\\n # the minimum number of coins required to get to amount.\\n # dp[amount] = min number of coins to get here\\n # if you cannot form that value, -1.\\n dp = defaultdict(lambda:float(\\\"inf\\\"))\\n\\n # base case. Only use 1 coin for that coin value.\\n for coinValue in coinSet:\\n dp[coinValue] = 1\\n\\n dp[0] = 0\\n\\n for i in range(1, amount + 1):\\n bestCandidate = float('inf')\\n\\n # find what is the best way to get to each possible previous value\\n for coinValue in coinSet:\\n candidate = dp[i - coinValue] # could be inf.\\n bestCandidate = min(bestCandidate, candidate)\\n\\n # we've now tried every coin. your value is just previous value plus the one coin you tried.\\n dp[i] = 1 + bestCandidate\\n if dp[amount] == float('inf'):\\n return -1\\n return dp[amount]\\n\\n\",\n \"memory\": \"22741\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n dp = [amount + 1 for _ in range(amount + 1)]\\n dp[amount] = 0\\n\\n def dfs(total):\\n if total > amount:\\n return -1\\n if dp[total] != amount+1:\\n return dp[total]\\n minCoins = amount + 1\\n for i in coins:\\n m = dfs(total + i)\\n if m != -1 and minCoins > m:\\n minCoins = m\\n\\n dp[total] = 1 + minCoins if minCoins != amount+1 else -1\\n return dp[total]\\n\\n return dfs(0)\\n\",\n \"memory\": \"23546\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n dp = [-1] * (amount)\\n\\n def findMin(coins,amount,m):\\n if amount == 0:\\n return 0\\n \\n if dp[amount - 1] != -1:\\n return dp[amount - 1]\\n \\n res = float('inf')\\n\\n for i in range(m):\\n if coins[i] <= amount:\\n value = findMin(coins,amount - coins[i],m)\\n\\n if value != float('inf') and value + 1 < res:\\n res = value + 1\\n \\n dp[amount - 1] = res\\n\\n return res\\n \\n rs = findMin(coins,amount,len(coins))\\n if rs != float('inf'):\\n return rs\\n return -1\\n\",\n \"memory\": \"23546\"\n },\n {\n \"code\": \"import itertools\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n answers = {0: {}}\\n for coin in coins:\\n answers[0][coin] = 0\\n answers[0][-1] = 0\\n NA_ANSWER = 100000\\n\\n for i in range(1, amount + 1):\\n answers[i] = {}\\n answers[i][-1] = NA_ANSWER\\n for coin in coins:\\n if coin > i:\\n answers[i][coin] = NA_ANSWER\\n continue\\n answers[i][coin] = answers[i - coin][-1]\\n if answers[i][coin] != NA_ANSWER:\\n answers[i][coin] += 1\\n answers[i][-1] = min(answers[i][-1], answers[i][coin])\\n final_answer = answers[amount][-1]\\n return -1 if final_answer == NA_ANSWER else final_answer\",\n \"memory\": \"23948\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def solve(amount):\\n if amount== 0:\\n return 0\\n if amount< 0:\\n return float('inf')\\n \\n if dp[amount]!= -1:\\n return dp[amount]\\n \\n mini= float('inf')\\n for i in range(len(coins)):\\n ans= solve(amount- coins[i])\\n if ans!= float('inf'):\\n mini= min(mini, 1+ans)\\n dp[amount]= mini\\n return mini\\n \\n dp = [-1] * (amount + 1)\\n ans= solve(amount)\\n\\n if ans== float('inf'):\\n return -1\\n return ans\\n\\n \\n \\n \\n \\n \\n\\n\\n\",\n \"memory\": \"23948\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n coins = sorted(coins,reverse=True)\\n\\n dp = [-1 for _ in range(amount+1)]\\n\\n def f(amount):\\n\\n if amount <= 0:\\n return 0\\n if dp[amount] != -1:\\n return dp[amount] \\n _min = float('inf')\\n\\n for i in range(len(coins)):\\n if amount >= coins[i]:\\n res = 1 + f(amount-coins[i])\\n _min = min(_min,res)\\n dp[amount] = _min\\n return _min\\n\\n res = f(amount)\\n return res if res != float('inf') else -1\",\n \"memory\": \"24351\"\n },\n {\n \"code\": \"INF = float('inf')\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # TD approach first\\n if amount == 0 : return 0\\n\\n coins.sort()\\n dp = {0:0}\\n\\n def min_coins(amt: int) -> int:\\n if amt in dp : return dp[amt]\\n dp[amt] = min([INF] + [1 + min_coins(amt - coin) for coin in coins if amt - coin >= 0])\\n return dp[amt]\\n\\n result = min_coins(amount)\\n return result if result < INF else -1\\n\\n\",\n \"memory\": \"24351\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n self.dp = {0:0}\\n r = self.get(coins, amount)\\n if r > amount:\\n return -1\\n return r\\n\\n def get(self, coins, i):\\n if i in self.dp:\\n return self.dp[i]\\n if i < 0:\\n return inf\\n self.dp[i] = 1 + min([self.get(coins, i - n) for n in coins])\\n return self.dp[i]\",\n \"memory\": \"24753\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0: return 0\\n\\n self.fewest_coins = float('inf')\\n self.cache = [-1] * (amount+1)\\n\\n def helper(total):\\n if total == 0:\\n return 0\\n if total < 0:\\n return float('inf')\\n if self.cache[total] != -1: return self.cache[total]\\n\\n minVal = float('inf')\\n for c in range(len(coins)):\\n minVal = min(minVal, 1 + helper(total - coins[c]))\\n\\n self.cache[total] = minVal\\n return self.cache[total]\\n \\n res = helper(amount)\\n return res if res != float('inf') else -1\",\n \"memory\": \"24753\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n dp = [-1 for _ in range(amount+1)]\\n def solve(amount):\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return float(\\\"inf\\\")\\n if dp[amount] != -1:\\n return dp[amount]\\n ans = float(\\\"inf\\\")\\n for i in range(n):\\n res = 1+solve(amount-coins[i])\\n ans = min(res,ans)\\n dp[amount] = ans\\n return ans\\n ans = solve(amount)\\n if ans!=float(\\\"inf\\\"):\\n return ans\\n return -1\",\n \"memory\": \"25156\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.mapping = {}\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n ans = self.solve(coins, amount, 0, n)\\n if ans == sys.maxsize:\\n return -1\\n return ans\\n \\n def solve(self, coins, amount, i, n):\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return sys.maxsize\\n if i == n and amount != 0:\\n return sys.maxsize\\n val = str(amount) + ' ' + str(i)\\n if val in self.mapping:\\n return self.mapping[val]\\n\\n if coins[i] <= amount:\\n ans = min(1 + self.solve(coins, amount - coins[i], i, n),\\n self.solve(coins, amount, i+1, n))\\n else:\\n ans = self.solve(coins, amount, i+1, n)\\n self.mapping[val] = ans\\n return ans \",\n \"memory\": \"25156\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n result = self.dp(coins, amount, {})\\n return -1 if result == inf else result\\n \\n def dp(self, coins, amount, memo):\\n if amount in memo:\\n return memo[amount]\\n \\n if amount == 0:\\n return 0\\n \\n if amount < 0:\\n return inf\\n \\n memo[amount] = min([self.dp(coins, amount - coin, memo) for coin in coins]) + 1\\n return memo[amount]\\n \",\n \"memory\": \"25558\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n self.early_returns = {}\\n self.currentAnswer = amount + 1\\n if amount %2:\\n foundOdd = False\\n for coin in coins:\\n if coin %2:\\n foundOdd = True\\n break\\n if not foundOdd:\\n return -1\\n coins.sort()\\n result, answer = self.coinChangeSorted(coins, amount, 0)\\n return answer if result else -1\\n\\n def coinChangeSorted(self, coins: List[int], amount: int, coinsUsed: int) -> int:\\n if not coins:\\n return False, -1\\n if coinsUsed >= self.currentAnswer:\\n return False, -1\\n l = len(coins)\\n if l in self.early_returns:\\n if amount in self.early_returns[l]:\\n return self.early_returns[l][amount]\\n maxCoinsForLast = amount // coins[-1]\\n maxCoinsForLast = min(maxCoinsForLast, self.currentAnswer - coinsUsed)\\n # if amount % coins[-1] == 0:\\n if maxCoinsForLast * coins[-1] == amount:\\n if l not in self.early_returns: \\n self.early_returns[l] = {}\\n self.early_returns[l][amount] = [True, maxCoinsForLast]\\n self.currentAnswer = min(self.currentAnswer, coinsUsed + maxCoinsForLast)\\n return True, maxCoinsForLast\\n foundAnswer = False\\n answer = amount\\n for coinsForLast in range(maxCoinsForLast, -1, -1):\\n val, numCoins = self.coinChangeSorted(coins[:-1], amount - coins[-1] * coinsForLast, coinsUsed + coinsForLast)\\n if val:\\n foundAnswer = True\\n answer = min(answer, numCoins + coinsForLast)\\n if foundAnswer:\\n if l not in self.early_returns: \\n self.early_returns[l] = {}\\n self.early_returns[l][amount] = [foundAnswer, answer]\\n self.currentAnswer = min(self.currentAnswer, coinsUsed + answer)\\n return foundAnswer, answer\\n if l not in self.early_returns: \\n self.early_returns[l] = {}\\n self.early_returns[l][amount] = [False, -1]\\n return False, -1\\n\",\n \"memory\": \"25558\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # 先排序硬币数组\\n coins.sort()\\n # 使用一个字典作为记忆化缓存\\n memo = {}\\n \\n def dp(n):\\n # 基本情况\\n if n == 0:\\n return 0\\n if n < 0:\\n return -1\\n \\n # 检查缓存\\n if n in memo:\\n return memo[n]\\n \\n # 计算所有可能的子问题结果\\n results = []\\n for coin in coins:\\n if coin > n:\\n break # 剪枝优化\\n res = dp(n - coin)\\n if res >= 0:\\n results.append(res + 1)\\n \\n # 如果results为空，表示无法凑成该金额\\n memo[n] = min(results) if results else -1\\n return memo[n]\\n \\n return dp(amount)\\n\\n\",\n \"memory\": \"25961\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n INF = 987654321\\n dp = [-1 for _ in range(10_001)]\\n\\n dp[0] = 0\\n def find_dp(x) :\\n if dp[x] != -1 : return dp[x]\\n\\n dp[x] = INF\\n for coin in coins :\\n if x >= coin :\\n dp[x] = min(dp[x], 1 + find_dp(x-coin))\\n return dp[x]\\n\\n find_dp(amount)\\n return -1 if dp[amount] == INF else dp[amount]\",\n \"memory\": \"25961\"\n },\n {\n \"code\": \"import itertools\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n answers = {0: {}}\\n for coin in coins:\\n answers[0][coin] = True\\n coins = sorted(coins, reverse=True)\\n for i in range(1, amount + 1):\\n answers[i] = {}\\n for coin in coins:\\n if coin > i:\\n answers[i][coin] = False\\n continue\\n answers[i][coin] = sum(answers[i - coin].values()) > 0\\n if sum(answers[amount].values()) == 0:\\n return -1\\n ways = {i: None for i in range(amount + 1)}\\n ways[0] = 0\\n for i in range(1, amount + 1):\\n ways[i] = 100000\\n for coin in coins:\\n if answers[i][coin]:\\n ways[i] = min(ways[i], ways[i - coin] + 1)\\n return ways[amount]\\n \\n \",\n \"memory\": \"26363\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins = sorted(coins)\\n x = {}\\n def recur(s):\\n if s == 0:\\n return 0\\n if s in x:\\n return x[s]\\n arr = []\\n for c in coins:\\n if c > s:\\n break\\n arr.append(1+recur(s-c))\\n x[s] = min(arr) if len(arr) > 0 else float('inf')\\n return x[s]\\n res = recur(amount)\\n return res if res < float('inf') else -1\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\\"\\\"\\\"\\n coins = sorted(set(coins))\\n dp = [0]*(amount+1)\\n for v in range(1, amount+1):\\n dp[v] = float('inf')\\n for c in coins:\\n if v-c<0:\\n break\\n dp[v] = min(dp[v], 1+dp[v-c])\\n return dp[amount] if dp[amount] != float('inf') else -1\\n \\\"\\\"\\\"\\n \\n \\n \\n # dp = {}\\n # def recur(v):\\n # if v == 0:\\n # return 0\\n # if v in dp:\\n # return dp[v]\\n # dp[v] = float('inf')\\n # for j in range(len(coins)):\\n # if v-coins[j]>=0:\\n # dp[v] = min(dp[v], 1+recur(v-coins[j]))\\n # return dp[v]\\n # x = recur(amount)\\n # return -1 if x == float('inf') else x\\n \\n \\\"\\\"\\\"\\n def recur(sofar, num_sofar, i):\\n if sofar > amount:\\n return float('inf')\\n if sofar == amount:\\n return num_sofar\\n res = float('inf')\\n for j in range(i, len(coins)):\\n if sofar + coins[j] > amount:\\n break\\n res = min(res, recur(sofar+coins[j], num_sofar+1, j))\\n return res\\n \\n x = recur(0, 0, 0)\\n return -1 if x == float('inf') else x\\n \\\"\\\"\\\"\",\n \"memory\": \"26363\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n total_memo = dict()\\n reversed_coins = coins[::-1]\\n def dfs(total):\\n if total == 0:\\n return 0\\n elif total < 0:\\n return math.inf\\n elif total in total_memo:\\n return total_memo[total]\\n else:\\n min_coins_required = min([dfs(total-coin) for coin in reversed_coins]) + 1\\n total_memo[total] = min_coins_required\\n return min_coins_required\\n coins_required = dfs(amount)\\n if math.isinf(coins_required):\\n return -1\\n else:\\n return coins_required\\n\\n \",\n \"memory\": \"26766\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cache = {}\\n numcoins = self.rec(coins, amount, len(coins)-1, cache)\\n return -1 if numcoins >= sys.maxsize else numcoins\\n\\n def rec(self, coins, amount, idx, cache):\\n if idx == 0:\\n if amount%coins[idx] == 0:\\n return amount//coins[idx]\\n else:\\n return sys.maxsize\\n\\n if (idx, amount) in cache:\\n return cache[(idx, amount)]\\n\\n pick = sys.maxsize\\n if coins[idx] <= amount:\\n pick = 1+self.rec(coins, amount-coins[idx], idx, cache)\\n notpick = self.rec(coins, amount, idx-1, cache)\\n\\n cache[(idx, amount)] = min(pick, notpick)\\n return cache[(idx, amount)]\\n \",\n \"memory\": \"26766\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self,coins,idx,amount,dp):\\n if idx == 0:\\n if amount % coins[0] == 0:\\n return amount // coins[0]\\n return 1e8\\n if amount == 0:\\n return 0\\n if (idx,amount) in dp:\\n return dp[(idx,amount)]\\n take = 1e8\\n if coins[idx] <= amount:\\n take = 1 + self.helper(coins,idx,amount-coins[idx],dp)\\n notTake = self.helper(coins,idx-1,amount,dp)\\n dp[(idx,amount)] = min(take,notTake)\\n return min(take,notTake)\\n\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n dp = {}\\n ans = self.helper(coins,n-1,amount,dp)\\n if ans == 1e8:\\n return -1\\n return ans\\n\\n # def coinChange(self, coins: List[int], amount: int) -> int:\\n # n = len(coins)\\n\\n \\n \",\n \"memory\": \"27168\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.mem = {}\\n def fun(self, coins, target, i, n):\\n if i >= n:\\n return -1\\n if target == 0:\\n return 0\\n if target < 0:\\n return -1\\n if (i, target) in self.mem:\\n return self.mem[(i, target)]\\n \\n a = self.fun(coins, target-coins[i], i, n)\\n b = self.fun(coins, target, i+1, n)\\n if a == -1 and b == -1:\\n ans = -1\\n elif a == -1:\\n ans = b\\n elif b == -1:\\n ans = a + 1\\n else:\\n ans = min(a+1, b)\\n self.mem[(i, target)] = ans\\n return ans\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n return self.fun(coins, amount, 0, len(coins))\",\n \"memory\": \"27168\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n from functools import cache\\n @cache\\n def dfs(rem):\\n if rem == 0:\\n return 0\\n\\n min_cost = float('inf')\\n\\n for coin in coins:\\n if rem / coin > min_cost:\\n break\\n\\n if rem - coin >= 0:\\n min_cost = min(min_cost, dfs(rem - coin) + 1)\\n\\n return min_cost\\n\\n coins.sort(reverse=True)\\n res = dfs(amount)\\n return res if res != float('inf') else -1\",\n \"memory\": \"27571\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n mem ={0:0}\\n\\n def min_coins(amt):\\n if amt in mem:\\n return mem[amt]\\n minn = float('inf')\\n for coin in coins:\\n diff = amt - coin\\n if diff < 0:\\n break\\n minn = min(minn,1+min_coins(diff))\\n mem[amt] = minn\\n return mem[amt]\\n result = min_coins(amount)\\n if result < float('inf'):\\n return result\\n else:\\n return -1\",\n \"memory\": \"27571\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n memo = {}\\n def dp(target: int) -> int:\\n if target < 0:\\n return -1\\n if target == 0:\\n return 0\\n if target in memo:\\n return memo[target]\\n result = float('inf')\\n for coin in coins:\\n if coin <= target:\\n subcase = dp(target-coin)\\n if subcase != -1:\\n result = min(result, 1+dp(target-coin))\\n memo[target] = result if result < float('inf') else -1\\n return memo[target]\\n return dp(amount)\",\n \"memory\": \"27973\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n solutions = {}\\n\\n def f(coins, amount):\\n \\n if amount in solutions:\\n return solutions[amount]\\n \\n if amount == 0:\\n return 0\\n\\n if amount < min(coins):\\n return -1\\n \\n l = [f(coins, amount - c) for c in coins]\\n l = [e for e in l if e > -1]\\n\\n if len(l) == 0:\\n solution = -1\\n else:\\n solution = 1 + min(l)\\n\\n solutions[amount] = solution\\n \\n return solution\\n\\n return f(coins, amount)\",\n \"memory\": \"27973\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount <= 0:\\n return 0\\n import numpy as np\\n r = (amount+1)*np.ones(amount+1) # store the min num of coins to make up a certain amount, initialize it to the max number of coins (= all 1)\\n r[0] = 0\\n for i in range(1,amount+1):\\n \\n for c in coins:\\n if i>=c: #amount larger than the coin c\\n r[i] = min(r[i], r[i-c]+1)\\n if int(r[amount])==amount+1:\\n return -1\\n return int(r[amount])\\n\\n\",\n \"memory\": \"28376\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], target: int) -> int:\\n coins.sort()\\n\\n cache = {}\\n mcache = {}\\n total_needed = 0\\n\\n ss = []\\n def _change(target):\\n if target in cache:\\n return cache[target]\\n\\n if target == 0:\\n # print(\\\"CACHE:\\\", cache)\\n return 0\\n \\n if target < 0:\\n return float('+Inf')\\n \\n res = float(\\\"+Inf\\\")\\n for c in coins:\\n diff = target - c \\n if diff >= 0:\\n ss.append(c)\\n sub_result = _change(diff)\\n res = min(res, sub_result + 1 )\\n ss.pop()\\n \\n cache[target] = res\\n return res\\n \\n result = _change(target)\\n print(cache)\\n return result if result != float('inf') else -1\\n \",\n \"memory\": \"28376\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n min_coins = [amount + 1] * (amount + 1)\\n min_coins[0] = 0\\n\\n for i in range(1, amount + 1):\\n for c in coins:\\n if i - c >= 0:\\n min_coins[i] = min(min_coins[i], 1 + min_coins[i - c])\\n \\n return min_coins[-1] if min_coins[-1] != amount + 1 else -1\",\n \"memory\": \"28778\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [np.inf for _ in range(amount+1)]\\n dp[0] = 0\\n for i in range(1, amount+1):\\n smallest = np.inf\\n for c in coins:\\n if i - c >= 0:\\n smallest = min(smallest, 1 + dp[i-c])\\n dp[i] = smallest\\n if dp[amount] == np.inf:\\n return -1\\n return dp[amount]\\n\\n\\n \",\n \"memory\": \"28778\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {0: 0}\\n\\n def helper(amount):\\n # print(amount)\\n if amount in memo:\\n return memo[amount]\\n if amount in coins:\\n memo[amount] = 1\\n else:\\n res = [1 + helper(amount-coin) for coin in coins if coin <= amount]\\n if any([x for x in res if x > 0]):\\n memo[amount] = min([x for x in res if x > 0])\\n else:\\n memo[amount] = -1\\n return memo[amount]\\n \\n return helper(amount)\\n \\n\",\n \"memory\": \"29181\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n\\n # typical dp\\n\\n k = len(coins)\\n \\n if amount == 0:\\n return 0\\n # minimum number of coins at step i if I add the k-th coin\\n dp_1d_sums = np.zeros((amount)) + np.inf\\n\\n dp_1d_cnt = np.zeros((amount)) + np.inf\\n\\n for i in range(amount):\\n\\n for j in range(k):\\n if coins[j] == (i + 1):\\n dp_1d_cnt[i] = 1\\n elif coins[j] < (i + 1):\\n dp_1d_cnt[i] = min(dp_1d_cnt[i], dp_1d_cnt[i - coins[j]] + 1)\\n\\n v = dp_1d_cnt[-1]\\n if np.isinf(v):\\n return -1\\n else:\\n return np.int64(v)\\n \\n \\n\\n\\n\\n\",\n \"memory\": \"29181\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n \\n memo = {c: 1 for c in coins}\\n\\n def dfs(amount: int):\\n if amount in memo:\\n return memo[amount]\\n\\n if amount < 0:\\n return float(\\\"inf\\\")\\n\\n memo[amount] = 1 + min([dfs(amount - c) for c in coins])\\n\\n return memo[amount]\\n\\n coins = dfs(amount)\\n if coins > amount:\\n return -1\\n else:\\n return coins\",\n \"memory\": \"29583\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n def dp(amt):\\n if amt in memo:\\n return memo[amt]\\n # dp(11) = min([1 + dp(amt - c) for c in coins])\\n if amt == 0:\\n return 0\\n elif amt < 0:\\n return -1\\n else:\\n possible_answers = [dp(amt - c) for c in coins]\\n filtered_answers = [x for x in possible_answers if x >= 0]\\n if len(filtered_answers) == 0:\\n memo[amt] = -1\\n else:\\n memo[amt] = min([1 + ans for ans in filtered_answers])\\n return memo[amt]\\n return dp(amount)\\n \",\n \"memory\": \"29583\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n\\n def backTrack(amnt,i,memo):\\n\\n if amnt ==0:\\n return 0\\n \\n if amnt < 0:\\n \\n return float('inf')\\n\\n if i >= len(coins):\\n return float('inf')\\n \\n if (amnt,i) in memo:\\n return memo[(amnt,i)] \\n \\n m1=backTrack(amnt-coins[i],i,memo)+1\\n m2=backTrack(amnt,i+1,memo)\\n memo[(amnt,i)]=min(m1,m2)\\n # return min(m1,m2)\\n return memo[(amnt,i)]\\n \\n result=backTrack(amount,0,{})\\n return result if result!=float('inf') else -1\\n \\n\\n\\n \",\n \"memory\": \"29986\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n table = {} \\n\\n def dp(amount):\\n if amount == 0: \\n return 0 \\n \\n if amount <0 :\\n return float(\\\"inf\\\")\\n\\n if amount in table:\\n return table[amount]\\n \\n table[amount] = min(dp(amount-coin)+1 for coin in coins)\\n\\n return table[amount]\\n \\n result = dp(amount)\\n\\n return -1 if result == float(\\\"inf\\\") else result\\n\\n # table = {}\\n\\n # def dp(amount):\\n # if amount < 0:\\n # return float(\\\"inf\\\")\\n \\n # if amount == 0:\\n # return 0\\n \\n # if amount in table: \\n # return table[amount]\\n\\n # table[amount] = min(dp(amount-coin)+1 for coin in coins)\\n\\n # return table[amount]\\n \\n # result = dp(amount)\\n\\n # return -1 if result == float(\\\"inf\\\") else result\",\n \"memory\": \"29986\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins = sorted(coins)\\n n = len(coins)\\n # coins = coins[::-1]\\n ans = 0\\n if amount == 0 :\\n return 0 \\n\\n an = 100001\\n\\n\\n def bfs (i=0):\\n qu = deque()\\n for i in coins:\\n qu.append((i,1))\\n su = 0\\n co = 0\\n vi = set()\\n while qu:\\n nn = len(qu)\\n # print(qu)\\n for i in range(nn):\\n cur , cnt = qu.popleft()\\n if cur == amount:\\n return cnt\\n\\n for i in range(n):\\n if cur + coins[i] <= amount and (cur,coins[i]) not in vi:\\n qu.append(((cur + coins[i]),cnt + 1))\\n vi.add((cur,coins[i]))\\n \\n \\n \\n return -1\\n\\n return bfs()\\n \\n\\n \\n \\n \\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n def chk (i , s = 0, co = 1):\\n nonlocal an\\n if i >= n:\\n return \\n s = coins[i] + s\\n if s > amount:\\n print(co)\\n return \\n\\n if s == amount:\\n an = min(an,co)\\n return \\n for x in range(i,n):\\n chk(i + x ,s , co+1)\\n \\n for i in range(n):\\n chk(i)\\n \\n if an == 100001:\\n return -1\\n return an\\n \\n\\n \\n\\n\\n\\n\\n \",\n \"memory\": \"30388\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def helper(coins, amount):\\n if amount in memo:\\n return memo[amount]\\n min_coin_need = float(\\\"inf\\\")\\n for coin in coins:\\n if coin <= amount:\\n coin_need = helper(coins, amount - coin)\\n min_coin_need = min(min_coin_need, coin_need)\\n if min_coin_need != float(\\\"inf\\\"):\\n min_coin_need += 1\\n memo[amount] = min_coin_need\\n return min_coin_need\\n \\n memo = {0:0}\\n for coin in coins:\\n if coin <= amount:\\n memo[coin] = 1\\n coins.sort()\\n value = helper(coins, amount)\\n return value if value != float(\\\"inf\\\") else -1\",\n \"memory\": \"30388\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo={}\\n x= self.helper(coins,amount,len(coins)-1,memo)\\n if x==float('inf'):\\n return -1\\n return x\\n def helper(self,coins,amount,i,memo):\\n\\n if amount==0:\\n return 0\\n if amount<0 or i<0:\\n return float('inf')\\n if (i,amount) in memo:\\n return memo[(i,amount)]\\n\\n take=self.helper(coins,amount-coins[i],i,memo)+1\\n notTake=self.helper(coins,amount,i-1,memo)\\n\\n memo[(i,amount)]= min(take,notTake)\\n return memo[(i,amount)]\\n\",\n \"memory\": \"30791\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def helper(amount):\\n if amount == 0:\\n return 0\\n elif amount < 0:\\n return -1\\n \\n others = [helper(amount-c) for c in coins]\\n others = [r for r in others if r != -1]\\n \\n if len(others) == 0:\\n return -1\\n else:\\n return min(others) + 1 \\n \\n return helper(amount)\\n \\n \\n \",\n \"memory\": \"30791\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n @cache\\n def dp(amt):\\n if amt == amount:\\n return 0\\n \\n if amt > amount:\\n return 2 * amount\\n\\n return 1 + min([dp(amt+coin) for coin in coins])\\n\\n ans = dp(0)\\n if ans > amount:\\n return -1\\n\\n return ans\",\n \"memory\": \"31193\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def dp(rest_amount):\\n # Base Case\\n if rest_amount < 0:\\n return math.inf\\n if rest_amount == 0:\\n return 0\\n \\n # Recurrence relation\\n if rest_amount not in memo:\\n memo[rest_amount] = min(dp(rest_amount - i) for i in coins) + 1\\n return memo[rest_amount]\\n \\n memo = {}\\n ans = dp(amount)\\n return -1 if ans == math.inf else ans\\n\",\n \"memory\": \"31193\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n table = {}\\n\\n def dfs(amount):\\n if amount<0:\\n return float(\\\"inf\\\")\\n if amount == 0:\\n return 0\\n \\n if amount in table:\\n return table[amount]\\n\\n table[amount] = min(dfs(amount-coin)+1 for coin in coins)\\n return table[amount]\\n\\n result = dfs(amount)\\n\\n return -1 if result==float(\\\"inf\\\") else result\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n table = {}\\n def dp(amount):\\n if amount<0:\\n return float(\\\"inf\\\")\\n if amount==0:\\n return 0\\n \\n if amount in table:\\n return table[amount]\\n \\n table[amount] = min(dp(amount-coin)+1 for coin in coins)\\n return table[amount]\\n \\n result = dp(amount)\\n return -1 if result == float(\\\"inf\\\") else result\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n table = {} \\n\\n def dp(amount):\\n if amount < 0:\\n return float(\\\"inf\\\")\\n\\n if amount==0:\\n return 0\\n\\n if amount in table:\\n return table[amount]\\n\\n table[amount] = min(dp(amount-coin)+1 for coin in coins)\\n\\n return table[amount]\\n\\n result = dp(amount)\\n\\n return -1 if result == float(\\\"inf\\\") else result \\n\\n # table = {} \\n\\n # def dp(amount):\\n # if amount == 0: \\n # return 0 \\n \\n # if amount <0 :\\n # return float(\\\"inf\\\")\\n\\n # if amount in table:\\n # return table[amount]\\n \\n # table[amount] = min(dp(amount-coin)+1 for coin in coins)\\n\\n # return table[amount]\\n \\n # result = dp(amount)\\n\\n # return -1 if result == float(\\\"inf\\\") else result\\n\\n # table = {}\\n\\n # def dp(amount):\\n # if amount < 0:\\n # return float(\\\"inf\\\")\\n \\n # if amount == 0:\\n # return 0\\n \\n # if amount in table: \\n # return table[amount]\\n\\n # table[amount] = min(dp(amount-coin)+1 for coin in coins)\\n\\n # return table[amount]\\n \\n # result = dp(amount)\\n\\n # return -1 if result == float(\\\"inf\\\") else result\",\n \"memory\": \"31596\"\n },\n {\n \"code\": \"from functools import cache\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n @lru_cache(maxsize = None)\\n def dp(i):\\n if i == 0:\\n return 0\\n if i < 0:\\n return float(\\\"inf\\\")\\n \\n \\n return 1+min([dp(i-c) for c in coins])\\n answer = dp(amount)\\n \\n return -1 if answer == float(\\\"inf\\\") else answer\\n \\n \\n \\n \\n \\n \",\n \"memory\": \"31596\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n \\n @cache\\n def num(amount):\\n if amount in coins:\\n return 1\\n if amount % coins[-1] == 0:\\n return amount // coins[-1]\\n if amount < coins[0]:\\n return inf\\n \\n return 1 + min(num(amount - c) for c in coins)\\n \\n num_coins = num(amount)\\n if num_coins == inf:\\n num_coins = -1\\n\\n return num_coins\\n\",\n \"memory\": \"31998\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n def dfs(remain,cache):\\n\\n if remain in cache:\\n return cache[remain]\\n\\n if remain < 0:\\n return math.inf\\n \\n if remain == 0:\\n return 0\\n\\n cache[remain] = min(dfs(remain-coin,cache) + 1 for coin in coins)\\n\\n return cache[remain]\\n\\n ans = dfs(amount,{})\\n\\n return -1 if ans == math.inf else ans\\n \\n \",\n \"memory\": \"31998\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def coinChangeInner(rem, cache={}):\\n if rem < 0:\\n return math.inf\\n if rem == 0:\\n return 0\\n if rem in cache:\\n return cache[rem]\\n\\n cache[rem] = min(coinChangeInner(rem-x, cache) + 1 for x in coins)\\n return cache[rem]\\n\\n ans = coinChangeInner(amount)\\n return -1 if ans == math.inf else ans\",\n \"memory\": \"32401\"\n },\n {\n \"code\": \"from functools import cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n n = len(coins)\\n coins.sort()\\n\\n\\n @cache\\n def dp(a: int) -> Union[int, float]:\\n if a < 0:\\n return -1\\n if a == 0:\\n return 0\\n \\n best = float(\\\"inf\\\")\\n for coin in coins:\\n change = dp(a - coin)\\n if change != -1:\\n best = min(best, change + 1)\\n \\n \\\"\\\"\\\"\\n [2]\\n ^\\n a = 3 > 1 > -1\\n best = inf > inf > inf\\n \\\"\\\"\\\"\\n\\n return -1 if best == float(\\\"inf\\\") else best\\n \\n \\n return dp(amount)\\n \\n\\n\\n\\n \",\n \"memory\": \"32401\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {\\n 0: 0\\n }\\n\\n def dp(n):\\n if n < 0:\\n return 999999999999999999999\\n\\n if n in memo:\\n return memo[n]\\n \\n val = 1 + min(dp(n - c) for c in coins)\\n memo[n] = val\\n return val\\n\\n res = dp(amount)\\n if res >= 999999999999999999999:\\n return -1\\n else:\\n return res \\n\\n\\n \",\n \"memory\": \"32803\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n n = len(coins)\\n dp = [[[0,0]]*(amount + 1) for _ in range(n + 1)]\\n coins.insert(0, 0)\\n for i in range(1, n + 1):\\n for j in range(amount + 1):\\n if coins[i] > j:\\n dp[i][j] = dp[i-1][j]\\n else:\\n number = None\\n val1 = dp[i - 1][j - coins[i]]\\n val2 = dp[i][j - coins[i]]\\n val3 = dp[i-1][j]\\n candidate = None\\n \\n if val1[0] > val2[0]:\\n number = dp[i - 1][j - coins[i]][1]\\n candidate = val1[0]\\n elif val1[0] < val2[0]:\\n number = dp[i][j - coins[i]][1]\\n candidate = val2[0]\\n else:\\n candidate = val1[0]\\n number = min(val1[1], val2[1])\\n \\n \\n if candidate + coins[i] < val3[0]:\\n candidate = val3[0]\\n number = val3[1]\\n elif candidate + coins[i] == val3[0]:\\n candidate += coins[i]\\n number = min(number + 1, val3[1]) \\n else:\\n candidate += coins[i]\\n number += 1\\n dp[i][j] = [candidate, number]\\n\\n if dp[n][amount][0] < amount:\\n return -1\\n return dp[n][amount][1]\",\n \"memory\": \"32803\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {0: 0}\\n\\n def min_coins_for_amount_from_coin_list(coins: list[int], amount: int) -> int:\\n if amount < 0:\\n return math.inf\\n if amount in memo:\\n return memo[amount]\\n\\n memo[amount] = 1 + min(\\n min_coins_for_amount_from_coin_list(\\n coins=coins,\\n amount=amount - coin,\\n )\\n for i, coin in enumerate(coins)\\n )\\n\\n return memo[amount]\\n\\n ans = min_coins_for_amount_from_coin_list(coins, amount)\\n return -1 if ans == math.inf else ans\\n\",\n \"memory\": \"33206\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {0: 0}\\n\\n def min_coins_for_amount_from_coin_list(coins: list[int], amount: int) -> int:\\n if amount < 0:\\n return math.inf\\n if amount in memo:\\n return memo[amount]\\n\\n memo[amount] = 1 + min(\\n min_coins_for_amount_from_coin_list(\\n coins=coins,\\n amount=amount - coin,\\n )\\n for i, coin in enumerate(coins)\\n )\\n\\n return memo[amount]\\n\\n ans = min_coins_for_amount_from_coin_list(coins, amount)\\n return -1 if ans == math.inf else ans\\n\",\n \"memory\": \"33206\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n '''\\n at each step we decide to use the coin and up our tally, or not use the coin and proceed\\n '''\\n n = len(coins)\\n coins = sorted(coins)\\n\\n @cache\\n def dp(amt):\\n if amt == 0:\\n return 0\\n elif amt < 0:\\n return float('inf')\\n\\n min_coins = float('inf')\\n \\n for c in coins:\\n min_coins = min(min_coins, dp(amt - c) + 1)\\n return min_coins\\n \\n total = dp(amount)\\n\\n return total if total != float('inf') else -1\\n \\n\\n \\n \\n \",\n \"memory\": \"33608\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = dict()\\n\\n def coin_change_helper(amount: int) -> int:\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return -1\\n\\n if amount in memo:\\n return memo[amount]\\n\\n result = list()\\n for c in coins:\\n r = coin_change_helper(amount - c)\\n if r >= 0:\\n result.append(r + 1)\\n\\n if not result:\\n memo[amount] = -1\\n else:\\n memo[amount] = min(result)\\n return memo[amount]\\n\\n return coin_change_helper(amount)\\n \",\n \"memory\": \"33608\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount==0:\\n return 0\\n\\n coin_set = set(coins)\\n coins = list(coin_set)\\n self.result = sys.maxsize\\n\\n @functools.cache\\n def leastCoins(n):\\n if n<0:\\n return -1\\n elif n in coin_set:\\n return 1\\n else:\\n minim = sys.maxsize\\n for c in coins:\\n res = leastCoins(n-c)\\n if res!=-1:\\n minim = min(minim, res)\\n if minim == sys.maxsize:\\n return -1\\n else:\\n return 1+minim\\n\\n return leastCoins(amount)\",\n \"memory\": \"34011\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nproblem\\n+ you have an array of coins representing different demoninations and an amount of money\\n+ return the smallest number of coins that you need to represent that maount\\n\\nmust use recurssion of some form\\n\\ninsight:\\n+ different comb -> recurrence relation\\n+ dp to optimize similar recursive steps\\n\\napproaches:\\n+ brute force: go through every possible result and find the smallest number of change\\n+ optimized (likely sol): go through different results, and use dp to remove redundent calls\\n\\noptimized recursive (recurrence relation):\\nparameters -> amount\\nbase case: if amount left == demonimation of some kind, return 1\\nif amount < all coins, return -1\\nloop through coins\\n recurs on amount minus coin if the coin is less than denmon\\n if it returns a valid amount (non negative), return this one up\\n else continue on\\n\\n if never exited, return -1\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n coins.sort(reverse = True)\\n\\n coinS = set(coins)\\n smallestC = coins[-1]\\n\\n @cache\\n def getStepsOfAmount_(curr_amount) -> int:\\n if curr_amount in coinS:\\n return 1\\n \\n if curr_amount < smallestC:\\n return -1\\n \\n lowest = None\\n\\n for coin in coins:\\n if coin < curr_amount:\\n steps = getStepsOfAmount_(curr_amount - coin)\\n \\n if steps != -1:\\n lowest = steps + 1 if lowest is None else min(lowest, steps + 1)\\n\\n return lowest if lowest is not None else -1\\n \\n return getStepsOfAmount_(amount)\\n\",\n \"memory\": \"34011\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.cache = {}\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n res = self.find(coins, amount)\\n if res == 1000000:\\n return -1\\n else:\\n return res\\n\\n def find(self, coins: List[int], amount: int) -> int:\\n L = len(coins)\\n if (L,amount) not in self.cache:\\n if not amount:\\n self.cache[(L,amount)] = 0\\n elif not coins:\\n self.cache[(L,amount)] = 1000000\\n else:\\n a, b = 1000000, 1000000\\n a = self.find(coins[:-1], amount)\\n if coins[-1] <=amount:\\n b = self.find(coins, amount-coins[-1])\\n self.cache[(L,amount)] = min(a,b+1)\\n return self.cache[(L,amount)]\",\n \"memory\": \"34413\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def dfs(amount, i):\\n if i >= len(coins):\\n return float('inf')\\n if amount == 0:\\n return 0\\n if amount < 0:\\n return float('inf')\\n return min(1 + dfs(amount - coins[i], i), dfs(amount, i + 1))\\n \\n dp = [[float('inf') for _ in range(len(coins) + 1)] for _ in range(amount + 1)]\\n #setting amount row to 0 like dfs\\n for j in range(len(coins) + 1):\\n dp[0][j] = 0\\n\\n for i in range(1, amount + 1):\\n for j in range(len(coins) - 1, -1, -1):\\n if i - coins[j] < 0:\\n dp[i][j] = dp[i][j + 1]\\n else:\\n dp[i][j] = min(dp[i][j + 1], 1 + dp[i - coins[j]][j])\\n\\n return dp[amount][0] if dp[amount][0] != float('inf') else -1\\n\\n\\n\\n \\n \\n\\n \",\n \"memory\": \"34413\"\n },\n {\n \"code\": \"class Solution:\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n self.coin_mem = {}\\n\\n #coins.sort(reverse=True) # O(nlogn)\\n return self.get_coin_change(coins, amount)\\n\\n def get_coin_change(self, coins: List[int], amount: int, start: int = 0) -> int:\\n\\n key_coin_dct = (start, amount)\\n\\n mem_out = self.coin_mem.get(key_coin_dct, None)\\n if mem_out is not None:\\n return mem_out\\n\\n if amount == 0:\\n self.coin_mem[key_coin_dct] = 0\\n return 0\\n elif start == len(coins):\\n self.coin_mem[key_coin_dct] = -1\\n return -1\\n\\n # not use first coin\\n out_1 = self.get_coin_change(coins, amount, start=start+1)\\n\\n # use first coin\\n if amount >= coins[start]:\\n out_2 = self.get_coin_change(coins, amount - coins[start], start=start)\\n\\n if out_2 == -1:\\n self.coin_mem[key_coin_dct] = out_1\\n return out_1\\n \\n out_2 += 1\\n\\n if out_1 == -1:\\n self.coin_mem[key_coin_dct] = out_2\\n return out_2\\n else:\\n out = min(out_1, out_2)\\n self.coin_mem[key_coin_dct] = out\\n return out\\n \\n self.coin_mem[key_coin_dct] = out_1\\n return out_1\\n\\n \\\"\\\"\\\"\\n # generate all possible permutations: O(n!)\\n all_permutations = list(itertools.permutations(coins))\\n \\n #coins.sort(reverse=False)\\n out_coins = None\\n for coins_reordered in all_permutations:\\n _coins = self.get_coin_change(coins_reordered, amount)\\n print(f\\\"{coins_reordered}-{_coins}\\\")\\n if out_coins is None:\\n out_coins = _coins\\n elif _coins != -1 and _coins < out_coins:\\n out_coins = _coins\\n return out_coins\\n\\n \\\"\\\"\\\"\",\n \"memory\": \"34816\"\n },\n {\n \"code\": \"class Solution:\\n\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n self.coin_mem = {}\\n\\n #coins.sort(reverse=True) # O(nlogn)\\n return self.get_coin_change(coins, amount)\\n\\n def get_coin_change(self, coins: List[int], amount: int, start: int = 0) -> int:\\n\\n key_coin_dct = (start, amount)\\n\\n mem_out = self.coin_mem.get(key_coin_dct, None)\\n if mem_out is not None:\\n return mem_out\\n\\n if amount == 0:\\n self.coin_mem[key_coin_dct] = 0\\n return 0\\n elif start == len(coins):\\n self.coin_mem[key_coin_dct] = -1\\n return -1\\n\\n # not use first coin\\n out_1 = self.get_coin_change(coins, amount, start=start+1)\\n\\n # use first coin\\n if amount >= coins[start]:\\n out_2 = self.get_coin_change(coins, amount - coins[start], start=start)\\n\\n if out_2 == -1:\\n self.coin_mem[key_coin_dct] = out_1\\n return out_1\\n \\n out_2 += 1\\n\\n if out_1 == -1:\\n self.coin_mem[key_coin_dct] = out_2\\n return out_2\\n else:\\n out = min(out_1, out_2)\\n self.coin_mem[key_coin_dct] = out\\n return out\\n \\n self.coin_mem[key_coin_dct] = out_1\\n return out_1\\n\\n \\\"\\\"\\\"\\n # generate all possible permutations: O(n!)\\n all_permutations = list(itertools.permutations(coins))\\n \\n #coins.sort(reverse=False)\\n out_coins = None\\n for coins_reordered in all_permutations:\\n _coins = self.get_coin_change(coins_reordered, amount)\\n print(f\\\"{coins_reordered}-{_coins}\\\")\\n if out_coins is None:\\n out_coins = _coins\\n elif _coins != -1 and _coins < out_coins:\\n out_coins = _coins\\n return out_coins\\n\\n \\\"\\\"\\\"\",\n \"memory\": \"34816\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n def dp(state):\\n\\n if state < min(coins):\\n return -1\\n elif state in coins:\\n memo[state] = 1\\n return memo[state]\\n elif state in memo:\\n return memo[state]\\n elif state == 0:\\n return 0\\n else:\\n ans = float('inf')\\n curr = [state - i for i in coins]\\n for i in curr:\\n temp = dp(i)\\n if temp > 0:\\n ans = min(ans, temp + 1)\\n if ans != float('inf'):\\n memo[state] = ans\\n else:\\n memo[state] = -1\\n return memo[state]\\n \\n\\n\\n \\n\\n \\n \\n \\n memo = {}\\n return dp(amount)\\n \\n \\n \\n \",\n \"memory\": \"35218\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n def dp(state):\\n\\n if state < min(coins):\\n return -1\\n elif state in coins:\\n memo[state] = 1\\n return memo[state]\\n elif state in memo:\\n return memo[state]\\n elif state == 0:\\n return 0\\n else:\\n ans = float('inf')\\n curr = [state - i for i in coins]\\n for i in curr:\\n temp = dp(i)\\n if temp > 0:\\n ans = min(ans, temp + 1)\\n if ans != float('inf'):\\n memo[state] = ans\\n else:\\n memo[state] = -1\\n return memo[state]\\n \\n\\n\\n \\n\\n \\n \\n \\n memo = {}\\n return dp(amount)\\n \\n \\n \\n \",\n \"memory\": \"35218\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n min_coin = min(coins)\\n @cache\\n def dp(i):\\n if i == 0:\\n return 0\\n elif i < min_coin:\\n return float('inf')\\n else:\\n minimum = float('inf')\\n for coin in coins:\\n if coin <= i:\\n minimum = min(minimum, 1 + dp(i - coin))\\n return minimum\\n \\n if dp(amount) == float('inf'):\\n return -1\\n return dp(amount)\",\n \"memory\": \"36426\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def find(k):\\n if k == 0:\\n return 0\\n if k < 0:\\n return float('inf')\\n count = float('inf')\\n for coin in coins:\\n if coin <= k:\\n count = min(count, 1 + find(k - coin))\\n return count\\n ans = find(amount)\\n return ans if ans != float('inf') else -1\",\n \"memory\": \"36426\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # if not coins:\\n # return 0\\n\\n # n = len(coins)\\n\\n # def helper(idx, amount):\\n # if amount == 0:\\n # return 0\\n \\n # if idx < n and amount > 0:\\n # min_cost = float('inf')\\n\\n # for x in range(0, amount // coins[idx] + 1):\\n\\n # result = helper(idx + 1, amount - x * coins[idx])\\n # if result != -1:\\n # min_cost = min (min_cost, result + x)\\n\\n # return -1 if min_cost == float('inf') else min_cost\\n # return -1 \\n\\n # return helper(0, amount)\\n # dp = [float('inf')] * (amount + 1)\\n # dp[0] = 0\\n\\n # for coin in coins:\\n # for x in range(coin, amount + 1):\\n # dp[x] = min(dp[x], dp[x - coin] + 1)\\n \\n # return dp[amount] if dp[amount] != float('inf') else -1\\n @lru_cache(None)\\n def dfs(rem):\\n if rem < 0:\\n return - 1\\n \\n if rem == 0:\\n return 0 \\n \\n min_cost = float('inf')\\n\\n for coin in coins:\\n res = dfs(rem - coin)\\n if res != -1:\\n min_cost = min(min_cost, res + 1)\\n \\n return min_cost if min_cost != float('inf') else -1 \\n\\n return dfs(amount)\\n\\n\\n \\n\\n \",\n \"memory\": \"36828\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n '''\\n amount = 11\\n coins = [1, 2, 5]\\n\\n 11 \\n = 1 + 10\\n = 1 + 1 + 9\\n = 1 + 1 + 1 + 8\\n ...\\n = 1 + 1 + 1 + ... 1 (11 of such ones)\\n = 1 + 2 + 1 + 1 + 1 ... + 1 (9 1s and 1 2 coin)\\n = 1 + 2 + 2 + 1 ... + 1 (7 1 coins and 2 2 coins)\\n\\n '''\\n #Global variable coins and it represents all the coins that \\n #we can use\\n coins = coins\\n\\n #DP function that will be called\\n\\n '''\\n Base case:\\n amount = 1 but i'm exchanging the value with a coin of value 2\\n => amount = -1\\n => check if amount < 0. If so, return inf\\n\\n amount = 0 and i'm the value with a coin of value 1\\n => amount = 0\\n => Good value\\n\\n '''\\n @lru_cache(None)\\n def dp(amount):\\n if amount < 0:\\n return inf\\n elif amount == 0:\\n return 0\\n else:\\n #This is required because for a given node,\\n #There may be several branches branch up to\\n #So if one of the branch is finished, but not the other branches, this variable would have stored an intermediate value.\\n #Once other branch are done and they have returned a value\\n #We can then take the minimum of this intermediate variable\\n #and the value that has just been returned.\\n number_of_coins_required = inf\\n\\n #This represents the exchanging process\\n #What it does is loop through all the coins\\n #That is available, and the minus the amount\\n #By the coin that is selected\\n\\n for i in coins:\\n number_of_coins_required = min(number_of_coins_required, 1 + dp(amount - i))\\n return number_of_coins_required\\n \\n #I want to see what kind of value\\n #Is returned. If the ans value is inf, it means\\n #There is no valid operation. \\n ans = dp(amount)\\n if ans == inf:\\n return -1\\n return ans\",\n \"memory\": \"36828\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @functools.cache\\n def dp(curr):\\n if curr > amount: return math.inf\\n if curr == amount: return 0\\n mincoins = math.inf\\n for c in coins:\\n mincoins = min(mincoins, 1 + dp(c + curr))\\n return mincoins\\n res = dp(0)\\n return res if dp(0) != math.inf else -1\\n \",\n \"memory\": \"37231\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def f(amt):\\n if amt == amount: return 0 # We reached the amount, no more steps needed\\n if amt > amount: return 10e4+1 # Amount exceeded, return max number\\n\\n min_steps = 10e4+1\\n for val in coins: # For multiple branches\\n curr_steps = f(amt + val) + 1 # Add one step for each coin used\\n min_steps = min(min_steps, curr_steps)\\n return min_steps\\n \\n res = f(0)\\n return -1 if res == 10e4+1 else res\",\n \"memory\": \"37231\"\n },\n {\n \"code\": \"from functools import cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # recurse through it in dfs manner?\\n # start with full amount,\\n # try moving each direction in graph (subtracting different coin denomination from list) recursively\\n\\n @cache\\n def backtrack(remaining):\\n if remaining == 0:\\n return 0\\n if remaining < 0:\\n return -1\\n \\n min_count = float(\\\"inf\\\")\\n\\n for coin in coins:\\n res = backtrack(remaining-coin)\\n if res != -1:\\n min_count = min(min_count, res + 1)\\n \\n return min_count\\n \\n res = backtrack(amount)\\n\\n return res if res != float(\\\"inf\\\") else -1\\n\",\n \"memory\": \"37633\"\n },\n {\n \"code\": \"from functools import lru_cache, cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n @cache\\n def solve(remaining):\\n if remaining == 0:\\n return 0\\n best = float('inf')\\n for c in coins:\\n if remaining - c >= 0:\\n res = solve(remaining - c)\\n if res >= 0:\\n best = min(res, best)\\n return best + 1 if best != float('inf') else -1\\n return solve(amount)\",\n \"memory\": \"37633\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @lru_cache(None)\\n def recurse(a):\\n if a < 0:\\n return float('inf')\\n if a == 0:\\n return 0\\n return min(recurse(a - coin) + 1 for coin in coins)\\n \\n ans = recurse(amount)\\n return ans if ans != float('inf') else -1\\n\",\n \"memory\": \"38036\"\n },\n {\n \"code\": \"from functools import cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @cache\\n def dp(amount):\\n if amount == 0:\\n return 0\\n elif amount < min(coins):\\n return float(\\\"inf\\\")\\n \\n ans = float(\\\"inf\\\")\\n for c in coins:\\n ans = min(1+dp(amount-c), ans)\\n return ans\\n \\n ans = dp(amount)\\n if ans==float(\\\"inf\\\"):\\n ans = -1\\n return ans\\n \\n \",\n \"memory\": \"38036\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n MAX = 2**31-1\\n n = len(coins)\\n @cache\\n def dp(curSum: int) -> int:\\n \\\"\\\"\\\"\\n Returns number of coins\\n \\\"\\\"\\\"\\n if curSum > amount:\\n return MAX\\n elif curSum == amount:\\n return 0\\n \\n return 1 + min(\\n dp(curSum + coin) for coin in coins\\n )\\n \\n answ = dp(0)\\n return answ if answ < MAX else -1\",\n \"memory\": \"38438\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n\\n from functools import cache\\n @cache\\n def func(s):\\n if s ==amount:\\n return 0\\n if s>amount:\\n return float('inf')\\n\\n r=float('inf')\\n for c in coins:\\n r=min(r, 1+func(s+c))\\n return r\\n\\n r= func(0) \\n return r if r!=float('inf') else -1 \\n\\n\\n\\n\\n\\n\\n from functools import cache\\n @cache\\n def func(idx, s):\\n if s==amount:\\n return 0\\n if s>amount or idx==len(coins):\\n return float('inf')\\n \\n return min(1+func(idx,s+coins[idx]), func(idx+1,s) )\\n # res= float('inf')\\n # for c in coins:\\n # res=min(res,func(s+c)+1)\\n # return res\\n res= func(0,0)\\n return res if res !=float('inf') else -1\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n dp=[-1]*(amount+1)\\n dp[0]=0\\n\\n for c in coins:\\n for i in range(amount-c+1):\\n if dp[i]!=-1:\\n if dp[i+c]== -1:\\n dp[i+c]=dp[i]+1\\n else:\\n dp[i+c]=min(dp[i+c],dp[i]+1)\\n return dp[-1]\\n\",\n \"memory\": \"38438\"\n },\n {\n \"code\": \"r'''\\n# Requirements\\n\\nn = len(coins)\\nw = amount\\n1 <= n <= 12\\n0 <= w <= 10,000\\n1 <= coins[i] <= 2^31 - 1\\n\\n# Edge cases\\n\\n1. amount == 0\\n - Return 0\\n2. Cannot make up amount using the provided coin values\\n - Return -1\\n\\n# Solutions\\n\\n1. Brute force, backtracking\\n - O(w^n) time, O(n) auxiliary space\\n2. Knapsack DP\\n - O(n * w) time, O(n * w) auxiliary space\\n'''\\nINF = 10 ** 9\\n\\ndef coin_change_memo(coins: list[int], amount: int) -> int:\\n memo = [[-1] * (amount + 1) for _ in range(len(coins))]\\n\\n def knapsack(i: int, target: int) -> int:\\n if target == 0:\\n return 0\\n if i == len(coins):\\n return INF\\n if memo[i][target] > -1:\\n return memo[i][target]\\n\\n memo[i][target] = knapsack(i + 1, target)\\n if target >= coins[i]:\\n memo[i][target] = min(memo[i][target], 1 + knapsack(i, target - coins[i]))\\n\\n return memo[i][target]\\n\\n ans = knapsack(0, amount)\\n return ans if ans < INF else -1\\n\\nclass Solution:\\n def coinChange(self, coins: list[int], amount: int) -> int:\\n return coin_change_memo(coins, amount)\",\n \"memory\": \"38841\"\n },\n {\n \"code\": \"'''\\nYou are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.\\n\\namount = money\\ncoins = type of coins\\n\\nreturn minimum number of coins to make that amount.\\n\\nif not found, return -1\\n\\n1 <= coins.length <= 12\\n0 <= amount <= 104\\n\\n1 2 3 4 5\\n\\npick 5 until target > t\\npick 4 \\n'''\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # n = len(coins)\\n # hm = {}\\n # def dp(i,target):\\n # if i == 0:\\n # if target%coins[i]==0:\\n # hm[(i,target)] = target//coins[i]\\n # return target//coins[i]\\n # else:\\n # hm[(i,target)] = math.inf\\n # return math.inf\\n\\n # if (i,target) in hm:\\n # return hm[(i,target)]\\n\\n # pick = math.inf\\n # not_pick = 0 + dp(i-1,target)\\n # if coins[i] <= target:\\n # pick = 1 + dp(i,target-coins[i])\\n # min_cost = min(not_pick,pick)\\n # hm[(i,target)] = min_cost\\n # return min_cost\\n \\n # res= dp(n-1,amount)\\n # if res == math.inf:\\n # return -1\\n # else: return res\\n default_dict = defaultdict(lambda: math.inf)\\n\\n # Initialize the base cases\\n for t in range(amount + 1):\\n if t % coins[0] == 0:\\n default_dict[(0, t)] = t // coins[0] # Use integer division\\n\\n # Fill the DP table\\n for i in range(1, len(coins)):\\n for j in range(amount + 1):\\n not_pick = default_dict[(i - 1, j)] # Case where we don't pick the current coin\\n pick = math.inf # Case where we pick the current coin\\n if coins[i] <= j:\\n pick = 1 + default_dict[(i, j - coins[i])]\\n default_dict[(i, j)] = min(not_pick, pick)\\n\\n # Get the result from the dictionary\\n result = default_dict[(len(coins) - 1, amount)]\\n return result if result != math.inf else -1\\n \\n \\n\\n \",\n \"memory\": \"38841\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n @lru_cache(None)\\n def getCoins(amnt):\\n if amnt == 0:\\n return 0\\n elif amnt < 0:\\n return math.inf\\n \\n minCoins = math.inf\\n for coin in coins:\\n minCoins = min(minCoins, getCoins(amnt - coin) + 1)\\n \\n return minCoins\\n\\n coins.sort(reverse = True)\\n ret = getCoins(amount)\\n\\n return ret if ret != math.inf else -1\",\n \"memory\": \"39243\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins = sorted(coins, reverse=True)\\n # O(S*n) - S amount, n number of coins\\n @lru_cache(None)\\n def dfs(remaining_amount):\\n if remaining_amount < 0:\\n return -1\\n if remaining_amount == 0:\\n return 0\\n \\n min_cost = float('inf')\\n for coin in coins:\\n result = dfs(remaining_amount-coin)\\n if result != -1:\\n min_cost = min(min_cost, result+1) # +1 for the coin we just used\\n \\n return min_cost if min_cost != float('inf') else -1\\n \\n return dfs(amount)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # cache = [amount+1] * (amount+1)\\n # cache[0] = 0\\n\\n # for i in range(1, amount+1):\\n # for c in coins:\\n # if i - c >= 0:\\n # # print(i - c)\\n # cache[i] = min(cache[i], cache[i-c] + 1)\\n\\n # if cache[amount] <= amount:\\n # return cache[amount]\\n # return -1\\n\",\n \"memory\": \"39243\"\n },\n {\n \"code\": \"r'''\\n# Requirements\\n\\nn = len(coins)\\nw = amount\\n1 <= n <= 12\\n0 <= w <= 10,000\\n1 <= coins[i] <= 2^31 - 1\\n\\n# Edge cases\\n\\n1. amount == 0\\n - Return 0\\n2. Cannot make up amount using the provided coin values\\n - Return -1\\n\\n# Solutions\\n\\n1. Brute force, backtracking\\n - O(w^n) time, O(n) auxiliary space\\n2. Knapsack DP\\n - O(n * w) time, O(n * w) auxiliary space\\n'''\\nINF = 10 ** 9\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n\\n memo = [[-1 if c > 0 else 0 for c in range(amount + 1)] for _ in range(len(coins))]\\n\\n def knapsack(coin_index: int, target: int) -> int:\\n if target == 0:\\n return 0\\n if coin_index == len(coins):\\n return INF\\n if memo[coin_index][target] > -1:\\n return memo[coin_index][target]\\n \\n min_coins = knapsack(coin_index + 1, target)\\n if target >= coins[coin_index]:\\n min_coins = min(min_coins, 1 + knapsack(coin_index, target - coins[coin_index]))\\n\\n memo[coin_index][target] = min_coins\\n return min_coins\\n \\n coins = sorted(coins, reverse = True)\\n ans = knapsack(0, amount)\\n return ans if ans < INF else -1\",\n \"memory\": \"39646\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n coins.sort(reverse=True)\\n @cache\\n def solve(t):\\n if t == 0:\\n return 0\\n if t in coins:\\n return 1\\n if (t < min(coins)):\\n return inf \\n \\n return min((1 + solve(t-c) for c in coins), default=inf)\\n\\n return solve(amount) if solve(amount) != inf else -1\",\n \"memory\": \"39646\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0: return 0\\n memo = {0: -1}\\n coins.sort(reverse = True)\\n def dp(total, count):\\n if memo[0] != -1 and memo[0] <= count+1:\\n return -1\\n for coin in coins:\\n if coin == total:\\n memo[0] = count+1 if memo[0] == -1 else min(memo[0], count+1)\\n return 1\\n if coin > total or ((total-coin) in memo and memo[total-coin] <= count+1):\\n continue\\n if dp(total-coin, count+1) == 1:\\n return count+1\\n memo[total-coin] = count+1\\n return -1\\n\\n dp(amount, 0)\\n return memo[0]\",\n \"memory\": \"40048\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0: return 0\\n memo = {0: -1}\\n coins.sort(reverse = True)\\n def dp(total, count):\\n if memo[0] != -1 and memo[0] <= count+1:\\n return -1\\n for coin in coins:\\n if coin == total:\\n memo[0] = count+1 if memo[0] == -1 else min(memo[0], count+1)\\n return 1\\n if coin > total or ((total-coin) in memo and memo[total-coin] <= count+1):\\n continue\\n if dp(total-coin, count+1) == 1:\\n return count+1\\n memo[total-coin] = count+1\\n return -1\\n\\n dp(amount, 0)\\n return memo[0]\",\n \"memory\": \"40048\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n\\n\\\"\\\"\\\" \\n \\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n MAX = 10**5\\n\\n @cache\\n def dp(amount: int) -> int:\\n if amount < 0:\\n return MAX\\n\\n if amount == 0:\\n return 0\\n\\n rs = MAX\\n for c in coins:\\n rs = min(rs, 1 + dp(amount - c))\\n return rs\\n \\n rs = dp(amount)\\n return -1 if rs >= MAX else rs\",\n \"memory\": \"40451\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n init_val = amount\\n coins.sort(reverse=True)\\n \\n d = {}\\n def numCoins(amount):\\n if amount == 0:\\n return 0\\n if amount in coins:\\n return 1\\n if amount in d:\\n return d[amount]\\n d[amount]=1+min([numCoins(amount-coin) for coin in coins if amount-coin>0]+[init_val])\\n return d[amount]\\n\\n if numCoins(amount) <= amount:\\n return numCoins(amount)\\n return -1\\n\\n\",\n \"memory\": \"40451\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n @cache\\n def helper(s):\\n if s == amount:\\n return 0\\n if s > amount:\\n return None\\n min_coins = None\\n for coin in coins:\\n ans = helper(s+coin)\\n if ans!=None:\\n if min_coins == None:\\n min_coins = 1+ans\\n else:\\n min_coins = min(min_coins,1+ans)\\n return min_coins\\n ret = helper(0)\\n if ret == None:\\n return -1\\n return ret\\n \\n\\n\",\n \"memory\": \"40853\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n # def recursion(ind, target): \\n\\n # if ind == 0 :\\n # if target % coins[ind] == 0:\\n # return target // coins[ind] \\n\\n \\n # return float(\\\"inf\\\") \\n\\n # if (ind, target) in dp:\\n # return dp[(ind, target)]\\n \\n # notTake = 0 + recursion(ind-1, target)\\n \\n # take = float(\\\"inf\\\")\\n # if coins[ind] <= target: #not taking amount that is greater than target\\n # #fucntion is counting coins; therefore add 1\\n # take = 1 + recursion(ind, target - coins[ind])\\n # dp[(ind, target)] = min(notTake, take)\\n # return dp[(ind, target)] \\n \\n # n = len(coins)\\n # dp = {}\\n # ans = recursion(n-1, amount)\\n # print(1+float(\\\"inf\\\"))\\n # return ans if ans != float(\\\"inf\\\") else -1\\n \\n \\n # TABULATION:\\n\\n dp = {}\\n for target in range(amount+1):\\n if target % coins[0] == 0:\\n dp[(0,target)] = target // coins[0]\\n\\n else:\\n dp[(0,target)] = float(\\\"inf\\\")\\n\\n #written for ind = 0\\n #now write loops in opposite fashion for both of the changing parameters\\n n = len(coins)\\n for ind in range(1, n):\\n for target in range(amount+1):\\n notTake = 0 + dp[(ind-1,target)]\\n \\n take = float(\\\"inf\\\")\\n if coins[ind] <= target: #not taking amount that is greater than target\\n #fucntion is counting coins; therefore add 1\\n take = 1 + dp[(ind, target - coins[ind])]\\n dp[(ind, target)] = min(notTake, take)\\n\\n ans = dp[(n-1, amount)]\\n return ans if ans != float(\\\"inf\\\") else -1\\n \",\n \"memory\": \"40853\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort(reverse=True)\\n coinSet = set(coins)\\n mapping = {}\\n\\n evenCoins = {}\\n\\n for c in coins:\\n for d in coins:\\n if c > d and c % d == 0:\\n if c in evenCoins:\\n evenCoins[c].append(d)\\n else:\\n evenCoins[c] = [d]\\n\\n if amount == 0:\\n return 0\\n\\n def recurse(n: int):\\n if n in coinSet:\\n return 1\\n\\n if n in mapping:\\n return mapping[n]\\n\\n found = None\\n\\n coinsToSkip = set()\\n\\n for c in coins:\\n if c not in coinsToSkip and n > c:\\n temp = recurse(n-c)\\n if temp > 0:\\n if c in evenCoins:\\n for e in evenCoins[c]:\\n coinsToSkip.add(e)\\n\\n if found is None:\\n found = temp + 1\\n else:\\n found = min(found, temp + 1)\\n\\n if found is None:\\n mapping[n] = -1\\n return -1\\n else:\\n mapping[n] = found\\n return found\\n\\n return recurse(amount)\\n\\n \\n \",\n \"memory\": \"41256\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def coinschange(i,amount,n):\\n if i >= n:\\n return 1e9\\n if amount == 0:\\n return 0\\n if dp[i][amount] != -1:\\n return dp[i][amount]\\n pick = 1e9\\n if coins[i] <= amount:\\n pick = 1 + coinschange(i,amount-coins[i],n)\\n notpick = coinschange(i+1,amount,n)\\n dp[i][amount] = min(pick,notpick)\\n return dp[i][amount]\\n pick,notpick = 0,0\\n res = []\\n dp = [[-1 for k in range(amount+1)]for l in range(len(coins)+1)]\\n ans=coinschange(0,amount,len(coins))\\n return -1 if ans==1e9 else ans\\n \",\n \"memory\": \"41256\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n mem = defaultdict(lambda: math.inf)\\n mem[amount] = 0\\n\\n def dfs(s):\\n if s > amount:\\n return math.inf\\n \\n if s in mem:\\n return mem[s]\\n\\n for c in coins:\\n ss = s + c\\n mem[s] = min(mem[s], dfs(ss) + 1)\\n return mem[s]\\n\\n res = dfs(0)\\n return res if res < math.inf else -1 \",\n \"memory\": \"41658\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[-1 for i in range(len(coins))] for j in range(amount + 1)]\\n #coins.sort()\\n def helper(ind, tar):\\n if tar == 0:\\n return 0\\n \\n if ind == -1:\\n return float(\\\"inf\\\")\\n\\n if dp[tar][ind] != -1:\\n return dp[tar][ind]\\n r1 = float(\\\"inf\\\")\\n if coins[ind] <= tar:\\n r1 = helper(ind, tar - coins[ind])\\n r2 = helper(ind - 1, tar)\\n dp[tar][ind] = min(1 + r1, r2)\\n return dp[tar][ind]\\n \\n ans = helper(len(coins) - 1 , amount)\\n #print(dp)\\n if ans == float(\\\"inf\\\"):\\n return -1\\n else:\\n return ans\",\n \"memory\": \"41658\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n def solve(rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n if rem in dp:\\n return dp[rem]\\n\\n mn = float(\\\"inf\\\")\\n for c in coins:\\n res = solve(rem - c)\\n if res >= 0 and res < mn:\\n mn = res + 1\\n dp[rem] = mn if mn != float(\\\"inf\\\") else -1\\n return dp[rem]\\n\\n dp = {}\\n coins.sort(reverse=True)\\n return solve(amount)\\n\",\n \"memory\": \"42061\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def tab():\\n dp = [inf] * (amount + 1)\\n dp[0] = 0\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if coin == i:\\n dp[i] = 1\\n break\\n elif coin > i:\\n continue\\n else:\\n dp[i] = min(dp[i], 1 + dp[i-coin])\\n return -1 if dp[amount] == inf else dp[amount]\\n \\n def memo(index, remain):\\n if remain < 0:\\n return inf\\n if remain == 0:\\n return 0\\n if index == len(coins):\\n return inf\\n if remain in cache:\\n return cache[remain]\\n min_coin = inf\\n for i in range(index, len(coins)):\\n take = 1 + memo(index, remain - coins[i])\\n skip = memo(index + 1, remain)\\n min_coin = min(min_coin, take, skip)\\n #return min_coin\\n cache[remain] = min_coin\\n return cache[remain]\\n\\n #return tab()\\n cache = {}\\n #min_coin = memo(0, amount)\\n #return -1 if min_coin == inf else min_coin\\n\\n def dfs(rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n if rem in cache:\\n return cache[rem]\\n min_cost = float('inf')\\n for coin in coins:\\n res = dfs(rem - coin)\\n if res != -1:\\n min_cost = min(min_cost, res + 1)\\n cache[rem] = min_cost\\n return cache[rem] if cache[rem] != float('inf') else -1\\n\\n return dfs(amount)\",\n \"memory\": \"42061\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n coins.sort()\\n @lru_cache(None)\\n def dfs(rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n min_cost = float('inf')\\n for i in range(len(coins)):\\n if coins[i] > amount:\\n break\\n res = dfs(rem - coins[i])\\n if res != -1:\\n min_cost = min(min_cost, res + 1)\\n return min_cost if min_cost != float('inf') else -1\\n\\n return dfs(amount)\",\n \"memory\": \"42463\"\n },\n {\n \"code\": \"'''Return the fewest number of coins that you need to make up that amount.\\n - using the array coins, and figure out how many coins minimum are needed to make up amount\\n\\n\\nIf that amount of money cannot be made up by any combination of the coins, return -1.\\n - what does it mean if it cant be made?\\n all coin values > amount, so there is no possible way to make exact amount with coins\\n\\n- infinite number of coins\\n - i can reuse coins\\n\\n- count of minimum coins needed.\\n - counting\\n - minimum\\n - compare against every other count\\n\\ncoins = coins, i = individual coin\\n\\namount = amount\\n\\ndecisions?\\n\\ntake: amount - i\\n take: amount - i\\n skip i = i + 1\\nskip : i + 1'''\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n global res\\n res = amount + 1\\n @cache\\n def minimumCoins_startingWith_toMake(x: int) -> int:\\n if x == 0:\\n return 0\\n res = 10**5\\n for i in range(len(coins)):\\n if coins[i] <= x:\\n curr = minimumCoins_startingWith_toMake(x - coins[i])\\n res = min(curr + 1, res)\\n\\n return res\\n\\n result = minimumCoins_startingWith_toMake(amount)\\n\\n return (-1 if result == 10**5 else result)\\n\\n \\n\\n\\n\\n\\n \",\n \"memory\": \"42463\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def collect(idx: int, remaining: int) -> int:\\n if idx == 0:\\n if remaining % coins[idx] == 0:\\n return remaining // coins[idx]\\n \\n return float(\\\"inf\\\")\\n \\n if dp[idx][remaining] != -1:\\n return dp[idx][remaining]\\n \\n pick = float(\\\"inf\\\")\\n notPick = collect(idx-1, remaining)\\n if coins[idx] <= remaining:\\n pick = 1 + collect(idx, remaining-coins[idx])\\n \\n dp[idx][remaining] = min(notPick, pick)\\n return dp[idx][remaining]\\n \\n N = len(coins)\\n dp = [[-1]*(amount+1) for _ in range(N)]\\n result = collect(N-1, amount)\\n \\n return result if result != float(\\\"inf\\\") else -1\\n\",\n \"memory\": \"42866\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n self.dp={}\\n self.dp[0]=0\\n def helper(amount):\\n if amount in self.dp:\\n return self.dp[amount]\\n if amount<0:\\n return float('inf')\\n if amount==0:\\n return 0\\n if amount in coins:\\n return 1\\n else:\\n mins=[]\\n for c in coins:\\n if c<=amount:\\n mins.append(helper(amount-c)+1)\\n if len(mins)>0: \\n self.dp[amount]=min(mins) \\n return self.dp[amount]\\n else:\\n return float('inf')\\n res=helper(amount) \\n return res if res<float('inf') else -1\\n \\n\\n\",\n \"memory\": \"42866\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n # dp calculates the minimum number of coins needed to reach amount starting from currAmount\\n def dp(currAmount: int) -> int:\\n if currAmount == amount:\\n #print(currAmount, \\\" trovato\\\")\\n return 0\\n elif currAmount > amount:\\n #print(currAmount, \\\" non valido\\\")\\n return -1\\n\\n if currAmount in memo:\\n return memo[currAmount]\\n\\n minimum = -1\\n for coin in coins:\\n #print(currAmount, \\\" + \\\", coin)\\n candidate = dp(currAmount + coin)\\n if minimum == -1 and candidate >= 0: # the first time a solution is found, the minimum is update\\n #print(\\\"minimum = \\\", candidate)\\n minimum = candidate\\n elif candidate != -1: # ignores all the wrong \\\"path\\\" that leads to -1\\n minimum = min(minimum, candidate)\\n #print(\\\"minimum = \\\", minimum)\\n \\n if minimum == -1:\\n memo[currAmount] = -1\\n else:\\n memo[currAmount] = minimum + 1 \\n return memo[currAmount]\\n \\n memo = {}\\n return dp(0)\\n \",\n \"memory\": \"43268\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n # Sort the coins in descending order\\n reversedOrderedCoins = sorted(coins, reverse=True)\\n\\n def dp(currAmount: int) -> int:\\n if currAmount == amount:\\n return 0\\n elif currAmount > amount:\\n return -1\\n\\n if currAmount in memo:\\n return memo[currAmount]\\n\\n minimum = -1\\n for coin in coins:\\n candidate = dp(currAmount + coin)\\n \\n # If candidate reaches the amount, break the loop early\\n if candidate == 0:\\n memo[currAmount] = 1\\n return 1\\n \\n if minimum == -1 and candidate >= 0: # First valid solution\\n minimum = candidate\\n elif candidate != -1: # Ignore invalid paths\\n minimum = min(minimum, candidate)\\n\\n if minimum == -1:\\n memo[currAmount] = -1\\n else:\\n memo[currAmount] = minimum + 1\\n\\n return memo[currAmount]\\n\\n memo = {}\\n return dp(0)\\n\",\n \"memory\": \"43268\"\n },\n {\n \"code\": \"r'''\\n# Requirements\\n\\nn = len(coins)\\n1 <= n <= 12\\n1 <= coins[i] <= 2^31 - 1\\n1 <= amount <= 10,000\\n\\n# Edge cases\\n\\n1. len(coins) == 1\\n\\n2. Coins cannot make up amount\\n - Return -1\\n\\n# Solutions\\n\\n1. Brute force, backtracking\\n - O(2^w) time, O(n) auxiliary space, where w = amount\\n2. Memo / DP, unlimited knapsack\\n - O(nw) time, O(nw) auxiliary space\\n'''\\ndef coin_change_memo(coins: list[int], amount: int) -> int:\\n n = len(coins)\\n memo = [[-1] * (amount + 1) for _ in range(n)]\\n\\n def min_coins(i: int, target: int) -> int:\\n if target == 0:\\n return 0\\n if i == n:\\n return float('inf')\\n if memo[i][target] != -1:\\n return memo[i][target]\\n\\n # Skip this coin\\n memo[i][target] = min_coins(i + 1, target)\\n\\n # Take one coin\\n if target >= coins[i]:\\n memo[i][target] = min(memo[i][target], min_coins(i, target - coins[i]) + 1)\\n\\n return memo[i][target]\\n\\n ans = min_coins(0, amount)\\n return ans if ans != float('inf') else -1\\n\\nclass Solution:\\n def coinChange(self, coins: list[int], amount: int) -> int:\\n return coin_change_memo(coins, amount)\",\n \"memory\": \"43671\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cache = {}\\n def dfs(amt):\\n if amt == amount:\\n return 0\\n if amt > amount:\\n return math.inf\\n if amt in cache:\\n return cache[amt]\\n cache[amt] = math.inf\\n for c in coins:\\n cache[amt] = min(cache[amt], 1 + dfs(amt + c))\\n return cache[amt]\\n\\n cc = dfs(0)\\n return cc if cc != math.inf else -1\",\n \"memory\": \"43671\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cache = {}\\n\\n def DP(n):\\n if n < 0: # used too many coins\\n return math.inf\\n if n == 0: # hit the target amount perfectly\\n return 0\\n if n in cache: # call already cached\\n return cache[n]\\n \\n res = math.inf # what will be returned => min num of coins used\\n \\n for coin in coins:\\n call = DP(n - coin)\\n res = min(res, call + 1)\\n \\n cache[n] = res\\n return res\\n \\n res = DP(amount)\\n \\n if res == math.inf:\\n return -1\\n \\n return res\\n \",\n \"memory\": \"44073\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n cache = {}\\n def dfs(amt):\\n if amt < 0:\\n return sys.maxsize\\n if amt == 0:\\n return 0\\n if amt in cache:\\n return cache[amt]\\n cache[amt] = sys.maxsize\\n for c in coins:\\n cache[amt] = min(cache[amt], 1 + dfs(amt - c))\\n return cache[amt]\\n\\n cc = dfs(amount)\\n return cc if cc != sys.maxsize else -1\",\n \"memory\": \"44073\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n \\n def top_down(coins: List[int], amount: int):\\n cache = {}\\n def traverse(current):\\n if current == amount:\\n return 0\\n \\n if current in cache:\\n return cache[current]\\n \\n current_min = amount+1\\n for coin in coins:\\n if current + coin <= amount:\\n n_coins = traverse(\\n current+coin\\n ) + 1\\n current_min = min(current_min, n_coins)\\n \\n cache[current] = current_min\\n return current_min\\n\\n current_min = traverse(0)\\n return current_min if (current_min < amount + 1) else -1\\n \\n return top_down(coins, amount)\",\n \"memory\": \"44476\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n def backtrack(cur_a):\\n if cur_a in memo:\\n return memo[cur_a]\\n if cur_a == amount:\\n return 0\\n if cur_a > amount:\\n return float('inf')\\n min_coins = float('inf')\\n for n in coins:\\n min_coins = min(min_coins , backtrack(cur_a + n ) + 1)\\n memo[cur_a] = min_coins\\n return min_coins\\n res = backtrack(0)\\n return res if res != float('inf') else -1\",\n \"memory\": \"44476\"\n },\n {\n \"code\": \"class Solution:\\n\\n \\\"\\\"\\\"\\n\\n \\\"\\\"\\\"\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n mem = dict()\\n def backtrack(val):\\n if val in mem:\\n return mem[val]\\n if val == amount:\\n return 0\\n \\n mem[val] = float('inf')\\n for c in coins:\\n if c + val <= amount:\\n mem[val] = min(mem[val], 1 + backtrack(c+val))\\n return mem[val]\\n res = backtrack(0)\\n return res if res != float('inf') else -1 \\n\",\n \"memory\": \"44878\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n recurDict = {}\\n\\n def recur(coins, amount):\\n\\n if amount == 0:\\n return 0\\n\\n elif amount < 0:\\n return -1\\n\\n else:\\n if amount in recurDict:\\n return recurDict[amount]\\n \\n temp = []\\n for coin in coins:\\n val = recur(coins, amount - coin)\\n if val != -1:\\n temp.append(val + 1)\\n \\n if len(temp) == 0:\\n recurDict[amount] = -1\\n return -1\\n else:\\n retval = min(temp)\\n recurDict[amount] = retval \\n return retval\\n\\n return recur(coins, amount)\",\n \"memory\": \"44878\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n seen_amounts = {}\\n def recurs(amount):\\n if amount == 0:\\n return 0\\n if amount in seen_amounts:\\n return seen_amounts[amount]\\n \\n temp = []\\n for coin in coins:\\n if coin < amount:\\n temp.append(1 + recurs(amount-coin))\\n elif coin == amount:\\n temp.append(1)\\n else:\\n temp.append(10001)\\n least_coins = min(temp)\\n seen_amounts[amount] = least_coins\\n return least_coins\\n \\n ans = recurs(amount)\\n if ans > 10000:\\n return -1\\n return ans\\n \",\n \"memory\": \"45281\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n # Memoization dictionary\\n memo = {}\\n\\n def _dp(remaining):\\n # Base case\\n if remaining == 0:\\n return 0\\n if remaining < 0:\\n return float('inf')\\n\\n # Check memorize\\n if remaining in memo:\\n return memo[remaining]\\n\\n # Recursive: Try all coins\\n min_coins = float('inf')\\n for coin in coins:\\n result = _dp(remaining - coin)\\n # Check if it return positive number, can have answer\\n if result != float('inf'):\\n min_coins = min(min_coins, result+1)\\n \\n # Memory\\n memo[remaining] = min_coins\\n return min_coins\\n\\n result = _dp(amount)\\n return result if result != float('inf') else -1\",\n \"memory\": \"45281\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n def tab():\\n dp = [inf] * (amount + 1)\\n dp[0] = 0\\n for i in range(1, amount + 1):\\n for coin in coins:\\n if coin == i:\\n dp[i] = 1\\n break\\n elif coin > i:\\n continue\\n else:\\n dp[i] = min(dp[i], 1 + dp[i-coin])\\n return -1 if dp[amount] == inf else dp[amount]\\n \\n def memo(index, remain):\\n if remain < 0:\\n return inf\\n if remain == 0:\\n return 0\\n if index == len(coins):\\n return inf\\n if remain in cache:\\n return cache[remain]\\n #min_coin = inf\\n \\n take = 1 + memo(index, remain - coins[index])\\n skip = memo(index + 1, remain)\\n min_coin = min(take, skip)\\n #return min_coin\\n cache[remain] = min_coin\\n return cache[remain]\\n\\n #return tab()\\n cache = {}\\n #min_coin = memo(0, amount)\\n #return -1 if min_coin == inf else min_coin\\n\\n @lru_cache(None)\\n def dfs2(index, rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n min_cost = float('inf')\\n for i in range(index, len(coins)):\\n take = dfs(i, rem - coins[i])\\n if take != -1:\\n min_cost = min(min_cost, take + 1)\\n skip = dfs(i + 1 , rem)\\n if skip != -1:\\n min_cost = min(min_cost, skip) \\n return min_cost if min_cost != float('inf') else -1\\n \\n #return dfs2(0, amount)\\n\\n \\n memo = {}\\n\\n def dfs(rem):\\n if rem < 0:\\n return -1\\n if rem == 0:\\n return 0\\n if rem in memo:\\n return memo[rem]\\n min_cost = float('inf')\\n for coin in coins:\\n res = dfs(rem - coin)\\n if res != -1:\\n min_cost = min(min_cost, res + 1)\\n memo[rem] = min_cost\\n return memo[rem] if min_cost != float('inf') else -1\\n\\n return dfs(amount)\",\n \"memory\": \"45683\"\n },\n {\n \"code\": \"class Solution:\\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[float(\\\"inf\\\")] * (amount + 1) for _ in range(len(coins) + 1)]\\n\\n for i in range(len(coins)+1):\\n dp[i][0] = 0\\n\\n for i in range(1, len(coins) + 1):\\n for j in range(1, amount + 1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\\n else:\\n dp[i][j] = dp[i-1][j]\\n \\n return dp[len(coins)][amount] if dp[len(coins)][amount] != float(\\\"inf\\\") else -1\\n \\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\\n \\n def dfs(idx: int, remaining_amount: int) -> int:\\n # Base case: if the amount is zero, we found a valid solution (0 coins more needed)\\n if remaining_amount == 0:\\n return 0\\n \\n if idx == len(coins):\\n return float(\\\"inf\\\")\\n\\n if dp[idx][remaining_amount] != -1:\\n return dp[idx][remaining_amount]\\n\\n include = float(\\\"inf\\\")\\n if coins[idx] <= remaining_amount:\\n include = 1 + dfs(idx, remaining_amount - coins[idx])\\n exclude = dfs(idx + 1, remaining_amount)\\n dp[idx][remaining_amount] = min(exclude, include)\\n\\n return dp[idx][remaining_amount]\\n \\n result = dfs(0, amount)\\n return result if result != float(\\\"inf\\\") else -1\\n\\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n # Initialize dp table for memoization with -1 (indicating uncomputed states)\\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\\n \\n def dfs(i: int, amount: int) -> int:\\n # Base case: If the amount is 0, no coins are needed\\n if amount == 0:\\n return 0\\n # If no coins left but amount > 0, it's not possible to make the amount\\n if i == 0:\\n return float('inf')\\n \\n # Check memoized result\\n if dp[i][amount] != -1:\\n return dp[i][amount]\\n \\n # Recursive case: two options, either take the current coin or skip it\\n if coins[i - 1] <= amount:\\n # Option 1: Take the coin and reduce the amount, stay on the same coin (i)\\n take = 1 + dfs(i, amount - coins[i - 1])\\n # Option 2: Don't take the coin, move to the previous coin (i-1)\\n skip = dfs(i - 1, amount)\\n dp[i][amount] = min(take, skip) # Choose the minimum\\n else:\\n # Skip the current coin since it's greater than the amount\\n dp[i][amount] = dfs(i - 1, amount)\\n \\n return dp[i][amount]\\n \\n # Call the recursive function starting from the last coin\\n result = dfs(len(coins), amount)\\n \\n # If the result is infinity, it means it's not possible to make the amount\\n return result if result != float('inf') else -1\\n \\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [-1] * (amount + 1)\\n\\n def dfs(amount):\\n if amount == 0:\\n return 0\\n \\n if amount < 0:\\n return float(\\\"inf\\\")\\n if dp[amount] != -1:\\n return dp[amount]\\n\\n low = float(\\\"inf\\\")\\n for coin in coins:\\n res = dfs(amount - coin)\\n if res != float(\\\"inf\\\"):\\n low = min(low, 1 + res) \\n dp[amount] = low\\n return low\\n \\n res = dfs(amount)\\n return res if res != float(\\\"inf\\\") else -1\\n\\n\\n \\n \",\n \"memory\": \"45683\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = dict()\\n\\n def dp(v):\\n if v < 0:\\n return -1\\n if v == 0:\\n return 0\\n \\n min_v = math.inf\\n for i in range(len(coins)):\\n if (v-coins[i]) not in memo:\\n _dp = dp(v-coins[i])\\n memo[v-coins[i]] = _dp\\n else:\\n _dp = memo[v-coins[i]]\\n \\n if _dp != -1:\\n min_v = min(min_v, 1+_dp)\\n\\n return min_v if min_v != math.inf else -1\\n \\n return dp(amount)\",\n \"memory\": \"46086\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n wayMap = {}\\n def ways(n):\\n if n < 0:\\n return 10**12\\n if n == 0:\\n wayMap[0] = 0\\n return 0\\n if n in wayMap:\\n return wayMap[n]\\n\\n m = 10**12\\n for coin in coins:\\n c = ways(n-coin)\\n if c < m:\\n m = c\\n\\n wayMap[n] = 1 + m\\n return 1 + m\\n\\n ways(amount)\\n return wayMap[amount] if wayMap[amount] < 10**12 else -1\",\n \"memory\": \"46086\"\n },\n {\n \"code\": \"class Solution:\\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [[float(\\\"inf\\\")] * (amount + 1) for _ in range(len(coins) + 1)]\\n\\n for i in range(len(coins)+1):\\n dp[i][0] = 0\\n\\n for i in range(1, len(coins) + 1):\\n for j in range(1, amount + 1):\\n if coins[i-1] <= j:\\n dp[i][j] = min(dp[i-1][j], 1 + dp[i][j - coins[i-1]])\\n else:\\n dp[i][j] = dp[i-1][j]\\n \\n return dp[len(coins)][amount] if dp[len(coins)][amount] != float(\\\"inf\\\") else -1\\n \\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\\n \\n def dfs(idx: int, remaining_amount: int) -> int:\\n # Base case: if the amount is zero, we found a valid solution (0 coins more needed)\\n if remaining_amount == 0:\\n return 0\\n \\n if idx == len(coins) or remaining_amount < 0:\\n return float(\\\"inf\\\")\\n\\n if dp[idx][remaining_amount] != -1:\\n return dp[idx][remaining_amount]\\n\\n include = float(\\\"inf\\\")\\n if coins[idx] <= remaining_amount:\\n include = 1 + dfs(idx, remaining_amount - coins[idx])\\n exclude = dfs(idx + 1, remaining_amount)\\n dp[idx][remaining_amount] = min(exclude, include)\\n\\n return dp[idx][remaining_amount]\\n \\n result = dfs(0, amount)\\n return result if result != float(\\\"inf\\\") else -1\\n\\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n # Initialize dp table for memoization with -1 (indicating uncomputed states)\\n dp = [[-1] * (amount + 1) for _ in range(len(coins) + 1)]\\n \\n def dfs(i: int, amount: int) -> int:\\n # Base case: If the amount is 0, no coins are needed\\n if amount == 0:\\n return 0\\n # If no coins left but amount > 0, it's not possible to make the amount\\n if i == 0:\\n return float('inf')\\n \\n # Check memoized result\\n if dp[i][amount] != -1:\\n return dp[i][amount]\\n \\n # Recursive case: two options, either take the current coin or skip it\\n if coins[i - 1] <= amount:\\n # Option 1: Take the coin and reduce the amount, stay on the same coin (i)\\n take = 1 + dfs(i, amount - coins[i - 1])\\n # Option 2: Don't take the coin, move to the previous coin (i-1)\\n skip = dfs(i - 1, amount)\\n dp[i][amount] = min(take, skip) # Choose the minimum\\n else:\\n # Skip the current coin since it's greater than the amount\\n dp[i][amount] = dfs(i - 1, amount)\\n \\n return dp[i][amount]\\n \\n # Call the recursive function starting from the last coin\\n result = dfs(len(coins), amount)\\n \\n # If the result is infinity, it means it's not possible to make the amount\\n return result if result != float('inf') else -1\\n \\n def _coinChange(self, coins: List[int], amount: int) -> int:\\n dp = [-1] * (amount + 1)\\n\\n def dfs(amount):\\n if amount == 0:\\n return 0\\n \\n if amount < 0:\\n return float(\\\"inf\\\")\\n if dp[amount] != -1:\\n return dp[amount]\\n\\n low = float(\\\"inf\\\")\\n for coin in coins:\\n res = dfs(amount - coin)\\n if res != float(\\\"inf\\\"):\\n low = min(low, 1 + res) \\n dp[amount] = low\\n return low\\n \\n res = dfs(amount)\\n return res if res != float(\\\"inf\\\") else -1\\n\\n\\n \\n \",\n \"memory\": \"46488\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n dp = {}\\n coins.sort(reverse=True)\\n def helper(amount):\\n if amount == 0:\\n return 0\\n elif amount in dp:\\n return dp[amount]\\n coinCounts = []\\n for c in coins:\\n if amount >= c:\\n minChange = helper(amount - c)\\n if minChange >= 0:\\n coinCounts.append(minChange + 1)\\n dp[amount] = min(coinCounts) if coinCounts else - 1\\n return dp[amount]\\n return helper(amount)\",\n \"memory\": \"46488\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins, amount):\\n if amount == 0:\\n return 0\\n \\n memo = {}\\n min_coin = 2 ** 31 - 1\\n for coin in coins:\\n if coin < min_coin:\\n min_coin = coin\\n memo[coin] = 1\\n \\n if amount < min_coin:\\n return -1\\n \\n def dp(rem_amount):\\n if rem_amount in memo:\\n return memo[rem_amount]\\n if rem_amount < 0:\\n return -1\\n if rem_amount < min_coin:\\n memo[rem_amount] = -1\\n return memo[rem_amount]\\n \\n min_res = float('inf')\\n for i in range(len(coins) - 1, -1, -1):\\n coin = coins[i]\\n res = dp(rem_amount - coin)\\n if res != -1 and res < min_res:\\n min_res = res + 1\\n \\n memo[rem_amount] = min_res if min_res != float('inf') else -1\\n return memo[rem_amount]\\n \\n memo[amount] = dp( amount)\\n return memo[amount]\\n \\n \",\n \"memory\": \"46891\"\n },\n {\n \"code\": \"class Solution:\\n results = dict()\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n seen = dict()\\n seen[0] = 0\\n for c in coins:\\n seen[c] = 1\\n def coinChangeHelper(level, attempts):\\n if (amount in seen):\\n return\\n nextLevel = set()\\n for c in coins:\\n for l in level:\\n if c + l not in seen and c + l <= amount:\\n nextLevel.add(c + l)\\n seen[c + l] = attempts + 1\\n if len(nextLevel) == 0:\\n return -1\\n coinChangeHelper(nextLevel, attempts + 1)\\n coinChangeHelper(set(coins), 1)\\n if (amount in seen):\\n return seen[amount]\\n return -1\\n\",\n \"memory\": \"46891\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n\\n def helper(amount):\\n if amount == 0 :\\n return 0\\n elif amount < 0 :\\n return float('inf')\\n if amount in memo:\\n return memo[amount]\\n min_coins = float('inf')\\n for coin in coins:\\n num_coins_with_curr_coin = helper(amount-coin)\\n memo[amount-coin] = num_coins_with_curr_coin\\n if num_coins_with_curr_coin != -1:\\n min_coins = min(min_coins, 1 + num_coins_with_curr_coin)\\n return min_coins if min_coins != float('inf') else -1\\n return helper(amount)\\n\",\n \"memory\": \"47293\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n #next block doesnt work\\n '''\\n coins.sort(reverse=True)\\n res = 0\\n for coin in coins:\\n if amount//coin:\\n temp, amount = divmod(amount, coin)\\n res += temp\\n if amount == 0:\\n return res\\n else:\\n return -1\\n '''\\n coins.sort(reverse=True)\\n partial = Counter(coins)\\n for coin1 in coins:\\n for coin2 in coins:\\n val = coin1+coin2\\n if val in partial:\\n partial[val] = min(partial[val], 2)\\n val = 2*coin1+coin2\\n if val in partial:\\n partial[val] = min(partial[val], 3)\\n val = 3*coin1+coin2\\n if val in partial:\\n partial[val] = min(partial[val], 4)\\n val = 4*coin1+coin2\\n if val in partial:\\n partial[val] = min(partial[val], 5)\\n val = 5*coin1+coin2\\n if val in partial:\\n partial[val] = min(partial[val], 6)\\n\\n def recursive(amount):\\n res = 2**32\\n if amount < min(coins):\\n return res\\n if amount in partial.keys():\\n #print(f\\\"amount found {amount} {partial[amount]}\\\")\\n return partial[amount]\\n\\n for c in coins:\\n res = min(res, recursive(amount-c)+1)\\n partial[amount] = res\\n return res\\n res = recursive(amount)\\n if res == 2**32:\\n return -1\\n return res\\n#[186,419,83,408]\\n#6249 \",\n \"memory\": \"47293\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n def recurse(amount):\\n output = float('inf')\\n if amount in memo:\\n return memo[amount]\\n if amount == 0:\\n # print('true')\\n output = 0\\n if amount < 0:\\n output = None \\n else:\\n for coin in coins:\\n if recurse(amount-coin) is not None:\\n # print(amount-coin)\\n output = min(output, recurse(amount-coin) +1)\\n # print(output)\\n memo[amount] = output\\n return output\\n temp = recurse(amount)\\n # print(memo)\\n return temp if temp != float('inf') else -1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n # dp = {}\\n # # debug this thing!!!!!!\\n # def backtrack(amount, count):\\n # mincount = float('inf')\\n # if amount in dp:\\n # return dp[amount]\\n # if amount == 0: \\n # mincount = min(mincount, count)\\n # print('mincount is ' +str(mincount))\\n # if amount < 0:\\n # return\\n # for coin in coins:\\n # print(coin)\\n # backtrack(amount - coin, count +1)\\n # dp[amount] = mincount\\n # return dp[amount]\\n # backtrack(amount, 0)\\n # # print(dp)\\n # return dp[amount] if dp[amount] != float('inf') else -1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # # if amount == 0:\\n # # return 0\\n # # # bottom up dp \\n # # m = len(coins)\\n # # n = amount\\n # # dp = [[float('inf')] * (n+1)] * m\\n # # for i in range(m):\\n # # dp[i][0] = 0\\n # # for j in range(n+1):\\n # # for i in range(m):\\n # # if j - coins[i] >= 0 and dp[i][j-coins[i]] != float('inf'):\\n # # print(dp[i][j-coins[i]])\\n # # dp[i][j] = min(dp[i][j], dp[i][j-coins[i]]+1)\\n # # # dp[i][j] = min(dp[i][j], dp[i-1][j]) # is this necessary??\\n # # # print(dp)\\n # # return dp[-1][-1] if dp[-1][-1] != float('inf') else -1 \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # # # # but first, recursion:\\n # # # @lru_cache(None)\\n # # # # coins = sorted(coins, reverse=True)\\n\\n # # # def recurse(amount):\\n # # # mincount = float('inf')\\n # # # if amount < 0:\\n # # # return None\\n # # # if amount == 0:\\n # # # return 0\\n # # # for coin in coins:\\n # # # temp = recurse(amount-coin)\\n # # # print(temp)\\n # # # if temp: # note this is the mistake, the second last line would return -1\\n # # # mincount = min(mincount, temp+1)\\n # # # return mincount if mincount != float('inf') else -1\\n\\n # # # return recurse(amount)\\n\\n\\n\\n\\n # # # recursion \\n # # # if amount == 0:\\n # # # print(amount)\\n # # # return 0\\n # # # def recurse(coins, amount, count):\\n # # # mincount = float('inf')\\n # # # if amount <0:\\n # # # return None\\n # # # if amount == 0:\\n # # # return count\\n # # # else:\\n # # # for i in coins:\\n # # # temp =recurse(coins, amount - i, count+1)\\n # # # if temp:\\n # # # mincount= min(mincount, temp)\\n # # # return mincount\\n # # # temp = recurse(coins, amount, 0) \\n # # # return temp if temp != float('inf') else -1\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # # # dp = [float('inf')] * (amount +1)\\n # # # dp[0] = 0\\n # # # for i in range(amount+1):\\n # # # for j in coins:\\n # # # if j <= i:\\n # # # dp[i] = min(dp[i], dp[i-j]+1)\\n # # # return -1 if dp[-1] == float('inf') else dp[-1]\\n\",\n \"memory\": \"47696\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n \\n def coinChange(self, coins: List[int], amount: int) -> int:\\n\\n # can a greedy solution work\\n # coins.sort(reverse=True)\\n count = 0\\n\\n @lru_cache(5000)\\n def brute_dp(left):\\n if left == 0: return 0\\n if left < 0: return float('inf')\\n \\n exchanges = float('inf')\\n for c in coins:\\n exchanges = min(exchanges, 1 + brute_dp(left-c) )\\n \\n return exchanges\\n \\n # \\n ans = brute_dp(amount)\\n if ans == float('inf'): return -1\\n return ans\\n\\n \",\n \"memory\": \"47696\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n if amount == 0:\\n return 0\\n memo = {}\\n coins.sort(reverse=True)\\n def backtrack(curr):\\n if curr in memo:\\n return memo[curr]\\n if curr == amount:\\n return 0\\n result = float('inf')\\n for num in coins:\\n if curr + num > amount:\\n continue\\n result = min(result, 1 + backtrack(curr + num))\\n memo[curr] = result\\n return memo[curr]\\n val = backtrack(0)\\n if val == float('inf'):\\n return -1\\n return val\",\n \"memory\": \"48098\"\n },\n {\n \"code\": \"class Solution:\\n def coinChange(self, coins: List[int], amount: int) -> int:\\n memo = {}\\n def helper(coins, amount):\\n if (tuple(coins), amount) in memo:\\n return memo[(tuple(coins), amount)]\\n if amount == 0:\\n memo[(tuple(coins), amount)] = 0\\n return 0\\n elif coins == []:\\n memo[(tuple(coins), amount)] = float(inf)\\n return float(inf)\\n elif coins[0] > amount:\\n return float(inf)\\n memo[(tuple(coins), amount)] = float(inf)\\n else:\\n # choose the coin\\n # skip the coin\\n res = min(\\n helper(coins[1:], amount),\\n 1 + helper(coins, amount - coins[0])\\n )\\n memo[(tuple(coins), amount)] = res\\n return res\\n res = helper(sorted(coins), amount)\\n if res == float(inf):\\n return -1\\n else:\\n return res\\n\",\n \"memory\": \"48098\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":154,"string":"154"}}},{"rowIdx":253,"cells":{"question_id":{"kind":"number","value":324,"string":"324"},"name":{"kind":"string","value":"wiggle-sort-ii"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code>, reorder it such that <code>nums[0] < nums[1] > nums[2] < nums[3]...</code>.</p>\n\n<p>You may assume the input array always has a valid answer.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,5,1,1,6,4]\n<strong>Output:</strong> [1,6,1,5,1,4]\n<strong>Explanation:</strong> [1,4,1,5,1,6] is also accepted.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,3,2,2,3,1]\n<strong>Output:</strong> [2,3,1,3,1,2]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>0 <= nums[i] <= 5000</code></li>\n\t<li>It is guaranteed that there will be an answer for the given input <code>nums</code>.</li>\n</ul>\n\n<p> </p>\n<strong>Follow Up:</strong> Can you do it in <code>O(n)</code> time and/or <strong>in-place</strong> with <code>O(1)</code> extra space?"},"acRate":{"kind":"number","value":34.780337690289045,"string":"34.780338"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","divide-and-conquer","greedy","sorting","quickselect"],"string":"[\n \"array\",\n \"divide-and-conquer\",\n \"greedy\",\n \"sorting\",\n \"quickselect\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"112\", 23.5427], [\"128\", 55.9418], [\"143\", 6.726199999999998], [\"159\", 2.0178000000000003], [\"174\", 1.4573], [\"189\", 0.4484], [\"205\", 0.4484], [\"220\", 0.2242], [\"236\", 0.33630000000000004], [\"251\", 0.2242], [\"267\", 0.1121], [\"282\", 0.1121], [\"297\", 0.1121], [\"313\", 0.1121], [\"328\", 0.1121], [\"344\", 0.1121], [\"359\", 0.1121], [\"375\", 0.1121], [\"390\", 0.1121], [\"406\", 0.1121], [\"421\", 0.1121], [\"436\", 0.1121], [\"452\", 0.1121], [\"467\", 0.1121], [\"483\", 0.1121], [\"498\", 0.1121], [\"514\", 0.1121], [\"529\", 0.1121], [\"544\", 0.1121], [\"560\", 0.1121], [\"575\", 0.1121], [\"591\", 0.1121], [\"606\", 0.1121], [\"622\", 0.1121], [\"637\", 0.1121], [\"653\", 0.1121], [\"668\", 0.1121], [\"683\", 0.1121], [\"699\", 0.1121], [\"714\", 0.1121], [\"730\", 0.1121], [\"745\", 0.1121]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18900\", 0.1121], [\"19000\", 0.1121], [\"19100\", 0.1121], [\"19200\", 1.1211], [\"19300\", 16.3677], [\"19400\", 37.8924], [\"19500\", 19.2825], [\"19600\", 8.0717], [\"19700\", 3.4753], [\"19800\", 3.6996], [\"19900\", 2.13], [\"20000\", 1.4574], [\"20100\", 0.8969]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n half = len(nums[::2])\n nums[::2], nums[1::2] = nums[:half][::-1], nums[half:][::-1]","runtime":"112"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n=len(nums)\n nums.sort()\n mid=(n-1)//2\n nums[::2],nums[1::2]=nums[mid::-1],nums[:mid:-1]","runtime":"112"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n mid = (len(nums) - 1) // 2\n nums[::2], nums[1::2] = nums[mid::-1], nums[:mid:-1]\n\n # Hank\n # Time: O(n log n + n)\n # Space: O(1)","runtime":"128"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n sorted_nums = sorted(nums)\n mid = (len(nums) + 1) // 2\n j, k = mid - 1, len(nums) - 1\n \n for i in range(len(nums)):\n if i % 2 == 0:\n nums[i] = sorted_nums[j]\n j -= 1\n else:\n nums[i] = sorted_nums[k]\n k -= 1 ","runtime":"128"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n nums.sort()\n size = len(nums)\n middle = size // 2\n is_pair = size % 2 == 0\n\n p0 = middle - 1 if is_pair else middle\n p1 = size - 1\n\n ans = []\n while len(ans) != size:\n ans.append(nums[p0])\n p0 -= 1\n\n if len(ans) == size:\n break\n\n ans.append(nums[p1])\n p1 -= 1\n \n for i in range(size):\n nums[i] = ans[i]\n\n\n\n\n\n\n\n","runtime":"143"},{"code":"class Solution:\n def wiggleSort(self, nums: list[int]) -> None:\n # Sort the numbers\n nums.sort()\n n = len(nums)\n \n # Create a new array to hold the rearranged elements\n sorted_nums = nums[:]\n \n # Rearrange the elements\n # Use two pointers to fill the elements\n left, right = (n - 1) // 2, n - 1\n for i in range(n):\n if i % 2 == 0:\n nums[i] = sorted_nums[left]\n left -= 1\n else:\n nums[i] = sorted_nums[right]\n right -= 1\n\n# Example usage:\nsol = Solution()\n\nnums1 = [1, 5, 1, 1, 6, 4]\nsol.wiggleSort(nums1)\nprint(nums1) # Output: [1, 6, 1, 5, 1, 4] or similar valid wiggle sort\n\nnums2 = [1, 3, 2, 2, 3, 1]\nsol.wiggleSort(nums2)\nprint(nums2) # Output: [2, 3, 1, 3, 1, 2] or similar valid wiggle sort\n\nnums3 = [4, 5, 5, 6]\nsol.wiggleSort(nums3)\nprint(nums3) # Output: [5, 6, 4, 5] or similar valid wiggle sort\n","runtime":"143"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \n [1,4,1,5,1,6]\n [1, 2, 2, 2, 1, 1]\n [1, 1, 1, 2, 2, 2]\n [1, 2, 1, 2, 1, 2]\n \n [1, 2, 3] => \n \n [1, 2, 3] \n \n 2 = 1\n 3+1 = 2\n [3, 5, 6 , 6]\n [5, 6, 3, 5]\n \n [1, 2]\n [1, 1, 2]\n \n \"\"\"\n \n if len(nums) == 1:\n return\n \n ## Method 1: Time: O(nlog(n)), Space: O(N)\n n = len(nums)\n nums.sort()\n mid = nums[(n + 1) // 2]\n \n def index(i):\n return (i * 2 + 1) % (n|1)\n \n def swap(i, j):\n nums[i], nums[j] = nums[j], nums[i]\n \n \n i, j, k = 0, 0, len(nums) - 1\n \n while j < k:\n if nums[index(j)] > mid:\n swap(index(i), index(j))\n i += 1\n j += 1\n elif nums[index(j)] < mid:\n swap(index(j), index(k))\n k -= 1\n else:\n j += 1\n \n \n# i, j = mid - 1, n - 1\n \n# while i >= 0 and j >= mid:\n# ans.append(nums[i])\n# ans.append(nums[j])\n# i -= 1\n# j -= 1\n \n# if i == 0:\n# ans.append(nums[i])\n\n \n# for i in range(n):\n# nums[i] = ans[i]\n\n \n \"\"\"\n n = len(nums)\n def quick_select(start, end, k):\n pivot = nums[end]\n j = start\n for i in range(start, end):\n if nums[i] < pivot:\n nums[i], nums[j] = nums[j], nums[i]\n j += 1\n nums[end], nums[j] = nums[j], nums[end]\n\n if k == j:\n return nums[j]\n elif j < k:\n return quick_select(j + 1, end, k)\n else:\n return quick_select(start, j - 1, k)\n\n mid = quick_select(0, len(nums) - 1, n // 2)\n\n def index(i):\n return (2 * i + 1) % (n|1)\n def swap(a, b):\n nums[a], nums[b] = nums[b], nums[a]\n\n i, j, k = 0, 0, len(nums) - 1\n \n [5, 6, 4, 5] (3 % 4)\n [4, 5, 5, 6, 6]\n while j <= k:\n print(\"{} > {}\".format(nums[index(j)], mid), index(i), index(j))\n if nums[index(j)] > mid:\n swap(index(j), index(i))\n print(nums, index(i), index(j), 'gt')\n j += 1\n i += 1\n elif nums[index(j)] < mid:\n swap(index(j), index(k))\n print(nums, index(j), index(k), j, k,'le')\n k -= 1\n else:\n j += 1\n \n \"\"\"\n\n \n\n ","runtime":"159"},{"code":"class Solution:\n def wiggleSort(self, nums):\n n = len(nums)\n \n # Find a median\n midptr = n // 2\n nums.sort()\n mid = nums[midptr]\n \n # Index-rewiring\n def A(i):\n return (1 + 2 * i) % (n | 1)\n\n # 3-way partition-to-wiggly in O(n) time with O(1) space\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[A(j)] > mid:\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\n i += 1\n j += 1\n elif nums[A(j)] < mid:\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\n k -= 1\n else:\n j += 1","runtime":"159"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n import statistics\n \n def find_median(nums):\n return statistics.median_low(nums)\n \n def three_way_partition(nums, median):\n def virtual_index(i, n):\n return (2 * i + 1) % (n | 1)\n \n n = len(nums)\n i, j, k = 0, 0, n - 1\n \n while j <= k:\n if nums[virtual_index(j, n)] > median:\n nums[virtual_index(j, n)], nums[virtual_index(i, n)] = nums[virtual_index(i, n)], nums[virtual_index(j, n)]\n i += 1\n j += 1\n elif nums[virtual_index(j, n)] < median:\n nums[virtual_index(j, n)], nums[virtual_index(k, n)] = nums[virtual_index(k, n)], nums[virtual_index(j, n)]\n k -= 1\n else:\n j += 1\n \n median = find_median(nums)\n three_way_partition(nums, median)","runtime":"174"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n nums.sort()\n asc=nums[:len(nums)//2][::-1]\n dsc=nums[len(nums)//2:]\n #print(asc,dsc)\n if len(asc)<len(dsc):\n asc.insert(0,dsc.pop(0))\n #print(asc,dsc)\n i=1\n while dsc:\n asc.insert(i,dsc.pop())\n i+=2\n #print(asc)\n for i in range(len(nums)):\n nums[i]=asc[i]\n ","runtime":"174"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n length = len(nums)\n left, right = nums[:(length+1)//2][::-1], nums[(length+1)//2:][::-1]\n for i in range(length):\n if i%2 == 0: \n nums[i] = left.pop(0)\n else:\n nums[i] = right.pop(0)\n","runtime":"189"},{"code":"import random as r\n\nclass Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n median = self.median(nums)\n upper = list(filter(lambda x : x > median, nums))\n lower = list(filter(lambda x : x < median, nums))\n equal = list(filter(lambda x : x == median, nums))\n flip = True\n for i in equal:\n if (len(upper) < len(lower)):\n upper.append(i)\n else:\n lower.append(i)\n\n lower = list(reversed(lower))\n upRev = upper\n final = []\n lowerI = 0\n upperI = 0\n print(len(upRev))\n print(len(lower))\n\n print(upRev)\n print(lower)\n for i in range(len(nums)):\n if (i % 2 == 0):\n if (len(lower) <= lowerI):\n nums[i] = upRev.pop()\n else:\n nums[i] = lower[lowerI]\n lowerI += 1\n else:\n if (len(upper) <= upperI):\n nums[i] = lower.pop(len(lower) - 1)\n else:\n nums[i] = upRev[upperI]\n upperI += 1\n \n\n def median(self, li):\n if (len(li) % 2 == 0):\n top = self.quickselect(li, len(li) // 2)\n bottom = self.quickselect(li, (len(li) // 2) - 1)\n return (top + bottom) / 2\n else:\n return self.quickselect(li, len(li) // 2)\n\n def quickselect(self, nums: List[int], k: int) -> int:\n pivot = nums[r.randint(0, len(nums) - 1)]\n less = list(filter(lambda x : x < pivot, nums))\n greater = list(filter(lambda x : x > pivot, nums))\n equal = list(filter(lambda x : x == pivot, nums))\n if (k < len(less)):\n return self.quickselect(less, k)\n if (k < len(less) + len(equal)):\n return pivot\n else:\n return self.quickselect(greater, k - len(less) - len(equal))\n \n","runtime":"189"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n i = 0\n while i < len(nums) - 1:\n nums.insert(i + 1, nums.pop(-1))\n i = i + 2\n nums[::2] = nums[::2][::-1]","runtime":"205"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n sorted_nums = sorted(nums)\n print(\"sorted_nums\", sorted_nums)\n l = (len(nums)-1)//2\n r = len(nums)-1\n for i in range(len(nums)):\n print(i, l, r, nums[i], sorted_nums[l], sorted_nums[r])\n if i%2 == 0:\n nums[i] = sorted_nums[l]\n l -= 1\n else:\n nums[i] = sorted_nums[r] \n r -= 1\n \n # \"\"\"\n # Do not return anything, modify nums in-place instead.\n # \"\"\"\n \n # nums_2 = sorted(nums)\n # l = 0\n # r = len(nums)-1 # 5\n # print(nums_2)\n # for i in range(len(nums)): \n # if i%2 == 1:\n # # temp = nums[i]\n # nums[i] = nums_2[r]\n # # nums[r] = temp\n \n # # temp = nums[r]\n # # nums[r] = nums[i]\n # # nums[i] = temp\n # r -= 1\n # else:\n # nums[i] =nums_2[l]\n # l+=1\n\n # print(i, nums)\n \n # # return nums\n\n\n\n # arr = []\n \n # mid = (l+r)//2\n # while l <= r:\n # arr.append(nums[l])\n # arr.append(nums[r])\n # # nums[l+1], nums[r] = nums[r], nums[l+1]\n\n # l += 1\n # r -= 1\n # nums = arr\n \n \n\n # for i in range(1, len(nums)-1):\n # if nums[i-1]<nums[i] and nums[i]>nums[i+1]:\n # continue\n # else:\n # nums[i], nums[i-1] = nums[i-1], nums[i]\n # return nums","runtime":"205"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n # 1, 5, 1, 1, 6, 4 -> 1, 1, 1, 4 ,5 ,6\n # median: 2.5\n # arrange by < or > median\n # 1, 4, 1, 5, 1, 6\n num_heap = [x for x in nums]\n heapq.heapify(num_heap)\n\n small, big = [], []\n\n for i in range(math.ceil(len(nums)/2)):\n small.append(heapq.heappop(num_heap))\n while num_heap:\n big.append(heapq.heappop(num_heap))\n\n res = []\n\n longer, shorter = (big[::-1], small[::-1]) if len(big) > len(small) else (small[::-1], big[::-1])\n while shorter:\n res.append(longer.pop(0))\n res.append(shorter.pop(0))\n\n if longer:\n res += longer\n\n for i in range(len(res)):\n if nums[i] != res[i]:\n nums[i] = res[i]\n\n\n\n ","runtime":"220"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \"\"\"\n Find n/2 small number\n Find n/2 large number\n sort in reverse order\n \"\"\"\n small = []\n large = []\n\n heapq.heapify(nums)\n length = len(nums)\n half = length // 2\n while len(nums) > half:\n small.insert(0, heapq.heappop(nums))\n\n while len(nums) > 0:\n large.insert(0, heapq.heappop(nums))\n\n small_idx = 0\n large_idx = 0\n\n for i in range(length):\n if i % 2 == 0:\n nums.append(small[small_idx])\n small_idx += 1\n else:\n nums.append(large[large_idx])\n large_idx += 1\n \n return nums","runtime":"220"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \"\"\"\n Find n/2 small number\n Find n/2 large number\n sort in reverse order\n \"\"\"\n small = []\n large = []\n\n heapq.heapify(nums)\n length = len(nums)\n half = length // 2\n while len(nums) > half:\n small.insert(0, heapq.heappop(nums))\n\n while len(nums) > 0:\n large.insert(0, heapq.heappop(nums))\n\n small_idx = 0\n large_idx = 0\n\n for i in range(length):\n if i % 2 == 0:\n nums.append(small[small_idx])\n small_idx += 1\n else:\n nums.append(large[large_idx])\n large_idx += 1","runtime":"236"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \"\"\"\n Find n/2 small number\n Find n/2 large number\n sort in reverse order\n \"\"\"\n small = []\n large = []\n\n heapq.heapify(nums)\n length = len(nums)\n half = length // 2\n while len(nums) > half:\n small.insert(0, heapq.heappop(nums))\n\n while len(nums) > 0:\n large.insert(0, heapq.heappop(nums))\n\n small_idx = 0\n large_idx = 0\n\n print(small, large)\n\n for i in range(length):\n if i % 2 == 0:\n nums.append(small[small_idx])\n small_idx += 1\n else:\n nums.append(large[large_idx])\n large_idx += 1\n \n return nums","runtime":"236"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n print(nums)\n l = len(nums)\n\n ind = 1\n nums[:(l+1)//2] = nums[:(l+1)//2][::-1]\n nums[(l+1)//2:] = nums[(l+1)//2:][::-1]\n print(nums)\n\n for i in range((l+1)//2, l):\n print(i)\n nums.insert(ind, nums.pop(i))\n ind+=2\n #print(nums)\n \n print(nums)\n\n ","runtime":"251"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n if len(nums)%2 == 0:\n section1 = section2 = int(len(nums)/2)\n else:\n section1 = int(len(nums)/2)\n section2 = int(len(nums)/2)+1\n bigger_numbers = nums[section2:]\n smaller_numbers = nums[:section2]\n for i in range(section1):\n smaller_number = smaller_numbers[-(i+1)]\n bigger_number = bigger_numbers[-(i+1)]\n nums.pop(0)\n nums.pop(0)\n nums.insert(len(nums), smaller_number)\n nums.insert(len(nums), bigger_number)\n if len(nums)%2 != 0:\n nums.pop(0)\n nums.insert(len(nums), smaller_numbers[0])\n\n# 1 1 2 2 3 3\n# 2 3 1 3 1 2\n\n# 5 6 4 5\n\n# 1 1 1 1 2 2 2\n# 1 2 1 2 1 2 1\n\n# 1 1 1 4 5 6\n# 1 6 1 5 1 4\n\n# 6 3 5 2 4 1","runtime":"251"},{"code":"class Solution:\n def findKthSmallest(self, nums: List[int], k: int) -> int:\n # code from: 215. Kth Largest Element in an Array\n # modified from kth largest -> kth smallest\n start, end = 0, len(nums) - 1\n while True:\n i, j = start, end\n pivot = nums[end]\n while i < j:\n if nums[i] > pivot:\n while j > i and nums[j] > pivot:\n j -= 1\n nums[i], nums[j] = nums[j], nums[i]\n j -= 1\n else:\n i += 1\n if nums[j] > pivot:\n j -= 1\n if j == k:\n return pivot\n if j < k:\n start = j\n while start < k and nums[start] <= pivot:\n start += 1\n else:\n end = j\n while end > k and nums[end] == pivot:\n end -= 1\n\n def wiggleSort(self, nums: List[int]) -> None:\n # get the median. avg O(n) time and constant space\n median = self.findKthSmallest(nums, len(nums) // 2)\n\n idx_less, idx_greater = 0, 1\n # swap elements to the correct list (even or odd index)\n # this whole process is O(n) because each element moves at most once\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\n while nums[idx] > median:\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\n idx_greater += 2\n for idx in range(idx_greater, len(nums), 2): # odd idx\n while nums[idx] < median:\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\n idx_less += 2\n\n # move all medians on the even list to the left\n i, j = 0, len(nums) - 1\n if j & 1:\n j -= 1 # make sure j is even\n while j > 0 and nums[j] != median:\n j -= 2 # find the last non-median elelment\n\n while i < j:\n if nums[i] == median:\n i += 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n j -= 2\n\n # move all medians on the odd list to the right\n i, j = 1, len(nums) - 1\n if (j & 1) == 0:\n j -= 1 # make sure j is odd\n while i < j and nums[i] != median:\n i += 2 # find the first non-median element\n\n while i < j:\n if nums[j] == median:\n j -= 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n i += 2","runtime":"267"},{"code":"class Solution:\n def findKthSmallest(self, nums: List[int], k: int) -> int:\n # code from: 215. Kth Largest Element in an Array\n # modified from kth largest -> kth smallest\n start, end = 0, len(nums) - 1\n while True:\n i, j = start, end\n pivot = nums[end]\n while i < j:\n if nums[i] > pivot:\n while j > i and nums[j] > pivot:\n j -= 1\n nums[i], nums[j] = nums[j], nums[i]\n j -= 1\n else:\n i += 1\n if nums[j] > pivot:\n j -= 1\n if j == k:\n return pivot\n if j < k:\n start = j\n while start < k and nums[start] <= pivot:\n start += 1\n else:\n end = j\n while end > k and nums[end] == pivot:\n end -= 1\n\n def wiggleSort(self, nums: List[int]) -> None:\n # get the median. avg O(n) time and constant space\n median = self.findKthSmallest(nums, len(nums) // 2)\n\n idx_less, idx_greater = 0, 1\n # swap elements to the correct list (even or odd index)\n # this whole process is O(n) because each element moves at most once\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\n while nums[idx] > median:\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\n idx_greater += 2\n for idx in range(idx_greater, len(nums), 2): # odd idx\n while nums[idx] < median:\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\n idx_less += 2\n\n # move all medians on the even list to the left\n i, j = 0, len(nums) - 1\n if j & 1:\n j -= 1 # make sure j is even\n while j > 0 and nums[j] != median:\n j -= 2 # find the last non-median elelment\n\n while i < j:\n if nums[i] == median:\n i += 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n j -= 2\n\n # move all medians on the odd list to the right\n i, j = 1, len(nums) - 1\n if (j & 1) == 0:\n j -= 1 # make sure j is odd\n while i < j and nums[i] != median:\n i += 2 # find the first non-median element\n\n while i < j:\n if nums[j] == median:\n j -= 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n i += 2","runtime":"282"},{"code":"class Solution:\n def findKthSmallest(self, nums: List[int], k: int) -> int:\n # code from: 215. Kth Largest Element in an Array\n # modified from kth largest -> kth smallest\n start, end = 0, len(nums) - 1\n while True:\n i, j = start, end\n pivot = nums[end]\n while i < j:\n if nums[i] > pivot:\n while j > i and nums[j] > pivot:\n j -= 1\n nums[i], nums[j] = nums[j], nums[i]\n j -= 1\n else:\n i += 1\n if nums[j] > pivot:\n j -= 1\n if j == k:\n return pivot\n if j < k:\n start = j\n while start < k and nums[start] <= pivot:\n start += 1\n else:\n end = j\n while end > k and nums[end] == pivot:\n end -= 1\n\n def wiggleSort(self, nums: List[int]) -> None:\n # get the median. avg O(n) time and constant space\n median = self.findKthSmallest(nums, len(nums) // 2)\n\n idx_less, idx_greater = 0, 1\n # swap elements to the correct list (even or odd index)\n # this whole process is O(n) because each element moves at most once\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\n while nums[idx] > median:\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\n idx_greater += 2\n for idx in range(idx_greater, len(nums), 2): # odd idx\n while nums[idx] < median:\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\n idx_less += 2\n\n # move all medians on the even list to the left\n i, j = 0, len(nums) - 1\n if j & 1:\n j -= 1 # make sure j is even\n while j > 0 and nums[j] != median:\n j -= 2 # find the last non-median elelment\n\n while i < j:\n if nums[i] == median:\n i += 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n j -= 2\n\n # move all medians on the odd list to the right\n i, j = 1, len(nums) - 1\n if (j & 1) == 0:\n j -= 1 # make sure j is odd\n while i < j and nums[i] != median:\n i += 2 # find the first non-median element\n\n while i < j:\n if nums[j] == median:\n j -= 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n i += 2","runtime":"297"},{"code":"class Solution:\n def findKthSmallest(self, nums: List[int], k: int) -> int:\n # code from: 215. Kth Largest Element in an Array\n # modified from kth largest -> kth smallest\n start, end = 0, len(nums) - 1\n while True:\n i, j = start, end\n pivot = nums[end]\n while i < j:\n if nums[i] > pivot:\n while j > i and nums[j] > pivot:\n j -= 1\n nums[i], nums[j] = nums[j], nums[i]\n j -= 1\n else:\n i += 1\n if nums[j] > pivot:\n j -= 1\n if j == k:\n return pivot\n if j < k:\n start = j\n while start < k and nums[start] <= pivot:\n start += 1\n else:\n end = j\n while end > k and nums[end] == pivot:\n end -= 1\n\n def wiggleSort(self, nums: List[int]) -> None:\n # get the median. avg O(n) time and constant space\n median = self.findKthSmallest(nums, len(nums) // 2)\n\n idx_less, idx_greater = 0, 1\n # swap elements to the correct list (even or odd index)\n # this whole process is O(n) because each element moves at most once\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\n while nums[idx] > median:\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\n idx_greater += 2\n for idx in range(idx_greater, len(nums), 2): # odd idx\n while nums[idx] < median:\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\n idx_less += 2\n\n # move all medians on the even list to the left\n i, j = 0, len(nums) - 1\n if j & 1:\n j -= 1 # make sure j is even\n while j > 0 and nums[j] != median:\n j -= 2 # find the last non-median elelment\n\n while i < j:\n if nums[i] == median:\n i += 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n j -= 2\n\n # move all medians on the odd list to the right\n i, j = 1, len(nums) - 1\n if (j & 1) == 0:\n j -= 1 # make sure j is odd\n while i < j and nums[i] != median:\n i += 2 # find the first non-median element\n\n while i < j:\n if nums[j] == median:\n j -= 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n i += 2","runtime":"313"},{"code":"class Solution:\n def findKthSmallest(self, nums: List[int], k: int) -> int:\n start, end = 0, len(nums) - 1\n while True:\n i, j = start, end\n pivot = nums[end]\n while i < j:\n if nums[i] > pivot:\n while j > i and nums[j] > pivot:\n j -= 1\n nums[i], nums[j] = nums[j], nums[i]\n j -= 1\n else:\n i += 1\n if nums[j] > pivot:\n j -= 1\n if j == k:\n return pivot\n if j < k:\n start = j\n while start < k and nums[start] <= pivot:\n start += 1\n else:\n end = j\n while end > k and nums[end] == pivot:\n end -= 1\n\n def wiggleSort(self, nums: List[int]) -> None:\n median = self.findKthSmallest(nums, len(nums) // 2)\n\n idx_less, idx_greater = 0, 1\n for idx in range(0, len(nums), 2):\n while nums[idx] > median:\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\n idx_greater += 2\n for idx in range(idx_greater, len(nums), 2):\n while nums[idx] < median:\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\n idx_less += 2\n\n i, j = 0, len(nums) - 1\n if j & 1:\n j -= 1\n while j > 0 and nums[j] != median:\n j -= 2\n\n while i < j:\n if nums[i] == median:\n i += 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n j -= 2\n\n i, j = 1, len(nums) - 1\n if (j & 1) == 0:\n j -= 1\n while i < j and nums[i] != median:\n i += 2\n\n while i < j:\n if nums[j] == median:\n j -= 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n i += 2","runtime":"328"},{"code":"class Solution:\n def findKthSmallest(self, nums: List[int], k: int) -> int:\n # code from: 215. Kth Largest Element in an Array\n # modified from kth largest -> kth smallest\n start, end = 0, len(nums) - 1\n while True:\n i, j = start, end\n pivot = nums[end]\n while i < j:\n if nums[i] > pivot:\n while j > i and nums[j] > pivot:\n j -= 1\n nums[i], nums[j] = nums[j], nums[i]\n j -= 1\n else:\n i += 1\n if nums[j] > pivot:\n j -= 1\n if j == k:\n return pivot\n if j < k:\n start = j\n while start < k and nums[start] <= pivot:\n start += 1\n else:\n end = j\n while end > k and nums[end] == pivot:\n end -= 1\n\n def wiggleSort(self, nums: List[int]) -> None:\n # get the median. avg O(n) time and constant space\n median = self.findKthSmallest(nums, len(nums) // 2)\n\n idx_less, idx_greater = 0, 1\n # swap elements to the correct list (even or odd index)\n # this whole process is O(n) because each element moves at most once\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\n while nums[idx] > median:\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\n idx_greater += 2\n for idx in range(idx_greater, len(nums), 2): # odd idx\n while nums[idx] < median:\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\n idx_less += 2\n\n # move all medians on the even list to the left\n i, j = 0, len(nums) - 1\n if j & 1:\n j -= 1 # make sure j is even\n while j > 0 and nums[j] != median:\n j -= 2 # find the last non-median elelment\n\n while i < j:\n if nums[i] == median:\n i += 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n j -= 2\n\n # move all medians on the odd list to the right\n i, j = 1, len(nums) - 1\n if (j & 1) == 0:\n j -= 1 # make sure j is odd\n while i < j and nums[i] != median:\n i += 2 # find the first non-median element\n\n while i < j:\n if nums[j] == median:\n j -= 2\n else:\n nums[i], nums[j] = nums[j], nums[i]\n i += 2\n ","runtime":"344"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Step 1: Find the median\n def find_median(nums):\n def partition(nums, left, right):\n pivot_index = (left + right) // 2\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[i], nums[store_index] = nums[store_index], nums[i]\n store_index += 1\n nums[store_index], nums[right] = nums[right], nums[store_index]\n return store_index\n\n def quickselect(nums, k):\n left, right = 0, len(nums) - 1\n while left <= right:\n pivot_index = partition(nums, left, right)\n if pivot_index == k:\n return nums[k]\n elif pivot_index < k:\n left = pivot_index + 1\n else:\n right = pivot_index - 1\n\n return quickselect(nums, len(nums) // 2)\n\n # Step 2: Three-way partition\n median = find_median(nums)\n n = len(nums)\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < median:\n nums[i], nums[j] = nums[j], nums[i]\n i += 1\n j += 1\n elif nums[j] > median:\n nums[j], nums[k] = nums[k], nums[j]\n k -= 1\n else:\n j += 1\n\n # Step 3: Interleave the elements\n def interleave(nums):\n half = (n + 1) // 2\n left = nums[:half][::-1]\n right = nums[half:][::-1]\n nums[::2] = left\n nums[1::2] = right\n\n interleave(nums)\n\n# Example usage:\nsolution = Solution()\nnums = [1, 5, 1, 1, 6, 4]\nsolution.wiggleSort(nums)\nprint(nums) # Output: [1, 6, 1, 5, 1, 4] or [1, 4, 1, 5, 1, 6]","runtime":"359"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n mid = self.find_medium(nums, n // 2)\n \n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < mid: \n nums[j], nums[i] = nums[i], nums[j]\n i += 1\n j += 1\n elif nums[j] > mid:\n nums[k], nums[j] = nums[j], nums[k]\n k -= 1\n else:\n j += 1\n \n mid = (n - 1) // 2\n tmp1 = nums[:mid + 1]\n tmp2 = nums[mid + 1:]\n\n for i in range(len(tmp1)):\n nums[2 * i] = tmp1[-1-i]\n for i in range(len(tmp2)):\n nums[2 * i + 1] = tmp2[-1-i]\n\n def find_medium(self, nums: List[int], k: int) -> int:\n left, right = 0, len(nums) - 1\n while True: \n pivot_idx = random.randint(left, right)\n pivot_idx = self.partition(nums, left, right, pivot_idx)\n if k == pivot_idx: \n return nums[k]\n elif k < pivot_idx:\n right = pivot_idx - 1\n else: \n left = pivot_idx + 1\n \n def partition(self, nums, left, right, pivot_idx):\n pivot = nums[pivot_idx]\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\n store_idx = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\n store_idx += 1\n # every number to the left of storeidx (not including store idx) will be less than pivot\n\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\n return store_idx\n\n\n ","runtime":"375"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n \n \n mid = self.find_medium(nums, n // 2)\n \n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < mid: \n nums[j], nums[i] = nums[i], nums[j]\n i += 1\n j += 1\n elif nums[j] > mid:\n nums[k], nums[j] = nums[j], nums[k]\n k -= 1\n else:\n j += 1\n half_len = len(nums[::2])\n nums[::2], nums[1::2] = nums[:half_len][::-1], nums[half_len::][::-1]\n\n def find_medium(self, nums: List[int], k: int) -> int:\n left, right = 0, len(nums) - 1\n while True: \n pivot_idx = random.randint(left, right)\n pivot_idx = self.partition(nums, left, right, pivot_idx)\n if k == pivot_idx: \n return nums[k]\n elif k < pivot_idx:\n right = pivot_idx - 1\n else: \n left = pivot_idx + 1\n \n def partition(self, nums, left, right, pivot_idx):\n pivot = nums[pivot_idx]\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\n store_idx = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\n store_idx += 1\n # every number to the left of storeidx (not including store idx) will be less than pivot\n\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\n return store_idx\n\n\n ","runtime":"390"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def partition(arr, low, high):\n pivot_index = random.randint(low, high)\n pivot = arr[pivot_index]\n \n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\n \n i = low\n for j in range(low, high):\n if arr[j] < pivot:\n arr[i], arr[j] = arr[j], arr[i]\n i += 1\n\n arr[i], arr[high] = arr[high], arr[i]\n \n return i\n \n def quickSelect(arr, low, high, k):\n if low < high:\n pi = partition(arr, low, high)\n\n if pi == k:\n return arr[pi]\n elif pi < k:\n return quickSelect(arr, pi + 1, high, k)\n else:\n return quickSelect(arr, low, pi - 1, k)\n else:\n return arr[low]\n \n n = len(nums)\n median = quickSelect(nums, 0, n - 1, n // 2)\n\n def A(i):\n return (1 + 2 * i) % (n | 1)\n\n i, j, k = 0, 0, n - 1\n \n while j <= k:\n if nums[A(j)] > median:\n # Swap nums[A(i)] and nums[A(j)]\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\n i += 1\n j += 1\n elif nums[A(j)] < median:\n # Swap nums[A(j)] and nums[A(k)]\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\n k -= 1\n else:\n j += 1\n","runtime":"406"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def partition(arr, low, high):\n pivot_index = random.randint(low, high)\n pivot = arr[pivot_index]\n \n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\n \n i = low\n for j in range(low, high):\n if arr[j] < pivot:\n arr[i], arr[j] = arr[j], arr[i]\n i += 1\n\n arr[i], arr[high] = arr[high], arr[i]\n \n return i\n \n def quickSelect(arr, low, high, k):\n if low < high:\n pi = partition(arr, low, high)\n\n if pi == k:\n return arr[pi]\n elif pi < k:\n return quickSelect(arr, pi + 1, high, k)\n else:\n return quickSelect(arr, low, pi - 1, k)\n else:\n return arr[low]\n \n n = len(nums)\n median = quickSelect(nums, 0, n - 1, n // 2)\n\n def A(i):\n return (1 + 2 * i) % (n | 1)\n\n i, j, k = 0, 0, n - 1\n \n while j <= k:\n if nums[A(j)] > median:\n # Swap nums[A(i)] and nums[A(j)]\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\n i += 1\n j += 1\n elif nums[A(j)] < median:\n # Swap nums[A(j)] and nums[A(k)]\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\n k -= 1\n else:\n j += 1\n","runtime":"421"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def find_median(nums):\n def partition(nums, left, right):\n pivot_index = (left + right) // 2\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[i], nums[store_index] = nums[store_index], nums[i]\n store_index += 1\n nums[store_index], nums[right] = nums[right], nums[store_index]\n return store_index\n\n def select(nums, left, right, k):\n if left == right:\n return nums[left]\n pivot_index = partition(nums, left, right)\n if k == pivot_index:\n return nums[k]\n elif k < pivot_index:\n return select(nums, left, pivot_index - 1, k)\n else:\n return select(nums, pivot_index + 1, right, k)\n\n n = len(nums)\n return select(nums, 0, n - 1, n // 2)\n\n def three_way_partition(nums, median):\n def swap(nums, i, j):\n nums[i], nums[j] = nums[j], nums[i]\n\n n = len(nums)\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < median:\n swap(nums, i, j)\n i += 1\n j += 1\n elif nums[j] > median:\n swap(nums, j, k)\n k -= 1\n else:\n j += 1\n\n def interleave(nums):\n n = len(nums)\n half = (n + 1) // 2\n\n def new_index(i):\n return (1 + 2 * i) % (n | 1)\n\n nums[::2], nums[1::2] = nums[:half][::-1], nums[half:][::-1]\n\n median = find_median(nums)\n three_way_partition(nums, median)\n interleave(nums)","runtime":"436"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n mid = self.find_medium(nums, n // 2)\n \n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < mid: \n nums[j], nums[i] = nums[i], nums[j]\n i += 1\n j += 1\n elif nums[j] > mid:\n nums[k], nums[j] = nums[j], nums[k]\n k -= 1\n else:\n j += 1\n \n mid = (n - 1) // 2\n tmp1 = nums[:mid + 1]\n tmp2 = nums[mid + 1:]\n\n for i in range(len(tmp1)):\n nums[2 * i] = tmp1[-1-i]\n for i in range(len(tmp2)):\n nums[2 * i + 1] = tmp2[-1-i]\n\n def find_medium(self, nums: List[int], k: int) -> int:\n left, right = 0, len(nums) - 1\n while True: \n pivot_idx = random.randint(left, right)\n pivot_idx = self.partition(nums, left, right, pivot_idx)\n if k == pivot_idx: \n return nums[k]\n elif k < pivot_idx:\n right = pivot_idx - 1\n else: \n left = pivot_idx + 1\n \n def partition(self, nums, left, right, pivot_idx):\n pivot = nums[pivot_idx]\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\n store_idx = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\n store_idx += 1\n # every number to the left of storeidx (not including store idx) will be less than pivot\n\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\n return store_idx\n\n\n ","runtime":"452"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def partition(arr, low, high):\n pivot_index = random.randint(low, high)\n pivot = arr[pivot_index]\n \n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\n \n i = low\n for j in range(low, high):\n if arr[j] < pivot:\n arr[i], arr[j] = arr[j], arr[i]\n i += 1\n\n arr[i], arr[high] = arr[high], arr[i]\n \n return i\n \n def quickSelect(arr, low, high, k):\n if low < high:\n pi = partition(arr, low, high)\n\n if pi == k:\n return arr[pi]\n elif pi < k:\n return quickSelect(arr, pi + 1, high, k)\n else:\n return quickSelect(arr, low, pi - 1, k)\n else:\n return arr[low]\n \n n = len(nums)\n median = quickSelect(nums, 0, n - 1, n // 2)\n\n def A(i):\n return (1 + 2 * i) % (n | 1)\n\n i, j, k = 0, 0, n - 1\n \n while j <= k:\n if nums[A(j)] > median:\n # Swap nums[A(i)] and nums[A(j)]\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\n i += 1\n j += 1\n elif nums[A(j)] < median:\n # Swap nums[A(j)] and nums[A(k)]\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\n k -= 1\n else:\n j += 1\n","runtime":"467"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def partition(arr, low, high):\n pivot_index = random.randint(low, high)\n pivot = arr[pivot_index]\n \n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\n \n i = low\n for j in range(low, high):\n if arr[j] < pivot:\n arr[i], arr[j] = arr[j], arr[i]\n i += 1\n\n arr[i], arr[high] = arr[high], arr[i]\n \n return i\n \n def quickSelect(arr, low, high, k):\n if low < high:\n pi = partition(arr, low, high)\n\n if pi == k:\n return arr[pi]\n elif pi < k:\n return quickSelect(arr, pi + 1, high, k)\n else:\n return quickSelect(arr, low, pi - 1, k)\n else:\n return arr[low]\n \n n = len(nums)\n median = quickSelect(nums, 0, n - 1, n // 2)\n\n def A(i):\n return (1 + 2 * i) % (n | 1)\n\n i, j, k = 0, 0, n - 1\n \n while j <= k:\n if nums[A(j)] > median:\n # Swap nums[A(i)] and nums[A(j)]\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\n i += 1\n j += 1\n elif nums[A(j)] < median:\n # Swap nums[A(j)] and nums[A(k)]\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\n k -= 1\n else:\n j += 1\n","runtime":"483"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def find_median(nums, k):\n def partition(left, right, pivot_index):\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[i], nums[store_index] = nums[store_index], nums[i]\n store_index += 1\n nums[store_index], nums[right] = nums[right], nums[store_index]\n return store_index\n\n def select(left, right, k):\n if left == right:\n return nums[left]\n pivot_index = random.randint(left, right)\n pivot_index = partition(left, right, pivot_index)\n if k == pivot_index:\n return nums[k]\n elif k < pivot_index:\n return select(left, pivot_index - 1, k)\n else:\n return select(pivot_index + 1, right, k)\n\n return select(0, len(nums) - 1, k)\n\n def three_way_partition(nums, median):\n def swap(i, j):\n nums[i], nums[j] = nums[j], nums[i]\n\n n = len(nums)\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < median:\n swap(i, j)\n i += 1\n j += 1\n elif nums[j] > median:\n swap(j, k)\n k -= 1\n else:\n j += 1\n\n def wiggle_sort(nums):\n n = len(nums)\n median = find_median(nums, (n - 1) // 2)\n three_way_partition(nums, median)\n\n mid = (n - 1) // 2\n even_pos = [nums[i] for i in range(mid + 1)][::-1]\n odd_pos = [nums[i] for i in range(mid + 1, n)][::-1]\n\n nums[::2], nums[1::2] = even_pos, odd_pos\n\n wiggle_sort(nums)\n\n# Example usage:\nsolution = Solution()\nnums = [1, 5, 1, 1, 6, 4]\nsolution.wiggleSort(nums)\nprint(nums) # Output will be [1, 6, 1, 5, 1, 4] or [1, 4, 1, 5, 1, 6]","runtime":"498"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def findKthLargest(nums: List[int], k: int) -> int:\n def partition(left: int, right: int, pivot_index: int) -> int:\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[store_index], nums[i] = nums[i], nums[store_index]\n store_index += 1\n nums[right], nums[store_index] = nums[store_index], nums[right]\n return store_index\n\n def select(left: int, right: int, k_smallest: int) -> int:\n if left == right:\n return nums[left]\n pivot_index = (left + right) // 2\n pivot_index = partition(left, right, pivot_index)\n if k_smallest == pivot_index:\n return nums[k_smallest]\n elif k_smallest < pivot_index:\n return select(left, pivot_index - 1, k_smallest)\n else:\n return select(pivot_index + 1, right, k_smallest)\n\n return select(0, len(nums) - 1, len(nums) - k)\n\n n = len(nums)\n median = findKthLargest(nums, (n + 1) // 2)\n\n def newIndex(index: int) -> int:\n return (1 + 2 * index) % (n | 1)\n\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[newIndex(j)] > median:\n nums[newIndex(i)], nums[newIndex(j)] = nums[newIndex(j)], nums[newIndex(i)]\n i += 1\n j += 1\n elif nums[newIndex(j)] < median:\n nums[newIndex(j)], nums[newIndex(k)] = nums[newIndex(k)], nums[newIndex(j)]\n k -= 1\n else:\n j += 1","runtime":"514"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n def partition(left, right):\n pivotIndex = random.randint(left, right)\n nums[pivotIndex], nums[right] = nums[right], nums[pivotIndex]\n\n pivotIndex = left\n pivotValue = nums[right]\n\n for i in range(left, right):\n if nums[i] < pivotValue:\n nums[i], nums[pivotIndex] = nums[pivotIndex], nums[i]\n pivotIndex += 1\n\n nums[pivotIndex], nums[right] = nums[right], nums[pivotIndex]\n return pivotIndex\n\n def findMedian():\n n = len(nums)\n lo, hi = 0, n-1\n mid = n // 2\n\n while True:\n pivot = partition(lo, hi)\n\n if pivot == mid: return nums[mid]\n elif pivot < mid: lo = pivot + 1\n else: hi = pivot - 1\n\n n = len(nums)\n median = findMedian()\n\n vIdx = lambda index, n: (1 + 2 * index) % (n | 1)\n \n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[vIdx(j, n)] > median:\n nums[vIdx(i, n)], nums[vIdx(j, n)] = nums[vIdx(j, n)], nums[vIdx(i, n)]\n i += 1\n j += 1\n elif nums[vIdx(j, n)] < median:\n nums[vIdx(j, n)], nums[vIdx(k, n)] = nums[vIdx(k, n)], nums[vIdx(j, n)]\n k -= 1\n else:\n j += 1\n","runtime":"529"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n n = len(nums)\n mid = self.find_medium(nums, n // 2)\n \n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < mid: \n nums[j], nums[i] = nums[i], nums[j]\n i += 1\n j += 1\n elif nums[j] > mid:\n nums[k], nums[j] = nums[j], nums[k]\n k -= 1\n else:\n j += 1\n \n mid = (n - 1) // 2\n tmp1 = nums[:mid + 1]\n tmp2 = nums[mid + 1:]\n\n for i in range(len(tmp1)):\n nums[2 * i] = tmp1[-1-i]\n for i in range(len(tmp2)):\n nums[2 * i + 1] = tmp2[-1-i]\n\n def find_medium(self, nums: List[int], k: int) -> int:\n left, right = 0, len(nums) - 1\n while True: \n pivot_idx = random.randint(left, right)\n pivot_idx = self.partition(nums, left, right, pivot_idx)\n if k == pivot_idx: \n return nums[k]\n elif k < pivot_idx:\n right = pivot_idx - 1\n else: \n left = pivot_idx + 1\n \n def partition(self, nums, left, right, pivot_idx):\n pivot = nums[pivot_idx]\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\n store_idx = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\n store_idx += 1\n # every number to the left of storeidx (not including store idx) will be less than pivot\n\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\n return store_idx\n\n\n ","runtime":"544"},{"code":"class Solution:\n def wiggleSort(self,nums):\n def findKthLargest(nums, k):\n def partition(left, right, pivot_index):\n pivot_value = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index] \n store_index = left\n for i in range(left, right):\n if nums[i] < pivot_value:\n nums[store_index], nums[i] = nums[i], nums[store_index]\n store_index += 1\n nums[right], nums[store_index] = nums[store_index], nums[right] \n return store_index\n \n def select(left, right, k_smallest):\n if left == right:\n return nums[left]\n pivot_index = left + (right - left) // 2\n pivot_index = partition(left, right, pivot_index)\n if k_smallest == pivot_index:\n return nums[k_smallest]\n elif k_smallest < pivot_index:\n return select(left, pivot_index - 1, k_smallest)\n else:\n return select(pivot_index + 1, right, k_smallest)\n \n return select(0, len(nums) - 1, len(nums) - k)\n \n n = len(nums)\n if n <= 1:\n return\n \n median = findKthLargest(nums, (n + 1) // 2)\n \n def newIndex(i):\n return (1 + 2 * i) % (n | 1)\n \n left, right, i = 0, n - 1, 0\n while i <= right:\n if nums[newIndex(i)] > median:\n nums[newIndex(left)], nums[newIndex(i)] = nums[newIndex(i)], nums[newIndex(left)]\n left += 1\n i += 1\n elif nums[newIndex(i)] < median:\n nums[newIndex(right)], nums[newIndex(i)] = nums[newIndex(i)], nums[newIndex(right)]\n right -= 1\n else:\n i += 1\n'''\n[1,5,1,1,6,4]\n\n\nDesign\n\nBrute Force\n1. Sort the input array\n2. Create the wiggle requirement using Two Pointers\n\n[1,5,1,1,6,4] sort() -> [1,1,1,4,5,6]\nCreate Wiggle Assortment\n[1,5,1,6,1,4]\n\n[smallest_value, largest_value, 2nd smallest, 2nd largest,....]\n\nDesign\n\n1. Count the frequcny of the elements \n2. Place the largest elements at even indices and update the frequency as the elements get placed\n Largest to Smallest at Even Indinces\n3. Place the smallest elements at the odd indices and update the frequcny as the elemtns get placed\n\n\nMedian Value Pivot\n\n1. Do Quick Select with idx value of n // 2\n a. Partition array with median value, 3-way partition\n2. Create Wiggle Sort Relationship \n\nState of array would Brute\n[values less than median < median <= values greater or equal to median]\n'''\n","runtime":"560"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Step 1: Find the median\n n = len(nums)\n median = self.findKthLargest(nums, (n + 1) // 2)\n \n # Step 2: Three-way-partition around the median\n def partition(nums, median):\n def virtual_index(i, n):\n return (2 * i + 1) % (n | 1)\n\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[virtual_index(j, n)] > median:\n nums[virtual_index(j, n)], nums[virtual_index(i, n)] = nums[virtual_index(i, n)], nums[virtual_index(j, n)]\n i += 1\n j += 1\n elif nums[virtual_index(j, n)] < median:\n nums[virtual_index(j, n)], nums[virtual_index(k, n)] = nums[virtual_index(k, n)], nums[virtual_index(j, n)]\n k -= 1\n else:\n j += 1\n \n # Step 3: Wiggle sort\n partition(nums, median)\n\n def findKthLargest(self, nums, k):\n def partition(left, right, pivot_index):\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[i], nums[store_index] = nums[store_index], nums[i]\n store_index += 1\n nums[right], nums[store_index] = nums[store_index], nums[right]\n return store_index\n \n def select(left, right, k_smallest):\n if left == right:\n return nums[left]\n pivot_index = random.randint(left, right)\n pivot_index = partition(left, right, pivot_index)\n if k_smallest == pivot_index:\n return nums[k_smallest]\n elif k_smallest < pivot_index:\n return select(left, pivot_index - 1, k_smallest)\n else:\n return select(pivot_index + 1, right, k_smallest)\n \n return select(0, len(nums) - 1, len(nums) - k)\n\n# Example usage:\nsolution = Solution()\nnums = [1, 5, 1, 1, 6, 4]\nsolution.wiggleSort(nums)\nprint(nums) # Output will be [1, 6, 1, 5, 1, 4] or similar","runtime":"575"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def find_median(nums):\n def partition(left, right, pivot_index):\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[i], nums[store_index] = nums[store_index], nums[i]\n store_index += 1\n nums[right], nums[store_index] = nums[store_index], nums[right]\n return store_index\n\n def select(left, right, k):\n if left == right:\n return nums[left]\n pivot_index = random.randint(left, right)\n pivot_index = partition(left, right, pivot_index)\n if k == pivot_index:\n return nums[k]\n elif k < pivot_index:\n return select(left, pivot_index - 1, k)\n else:\n return select(pivot_index + 1, right, k)\n\n return select(0, len(nums) - 1, len(nums) // 2)\n\n n = len(nums)\n median = find_median(nums)\n\n # Three-way partition\n def three_way_partition(nums, median):\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[j] < median:\n nums[i], nums[j] = nums[j], nums[i]\n i += 1\n j += 1\n elif nums[j] > median:\n nums[j], nums[k] = nums[k], nums[j]\n k -= 1\n else:\n j += 1\n\n three_way_partition(nums, median)\n\n # Interleave the elements\n mid = (n + 1) // 2\n left = nums[:mid][::-1]\n right = nums[mid:][::-1]\n nums[::2] = left\n nums[1::2] = right\n\n# Example usage:\nsolution = Solution()\nnums = [1, 5, 1, 1, 6, 4]\nsolution.wiggleSort(nums)\nprint(nums) # Output will be [1, 6, 1, 5, 1, 4] or similar","runtime":"591"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n\n n = len(nums)\n \n def quickselect(l, r, k):\n \"\"\"Quickselect algorithm to find the k-th smallest element.\"\"\"\n if l == r:\n return nums[l]\n\n pivot_index = random.randint(l, r)\n pivot_index = partition(l, r, pivot_index)\n\n if k == pivot_index:\n return nums[k]\n elif k < pivot_index:\n return quickselect(l, pivot_index - 1, k)\n else:\n return quickselect(pivot_index + 1, r, k)\n\n def partition(l, r, pivot_index):\n \"\"\"Partition the array around the pivot.\"\"\"\n pivot_value = nums[pivot_index]\n nums[pivot_index], nums[r] = nums[r], nums[pivot_index]\n store_index = l\n\n for i in range(l, r):\n if nums[i] < pivot_value:\n nums[store_index], nums[i] = nums[i], nums[store_index]\n store_index += 1\n\n nums[store_index], nums[r] = nums[r], nums[store_index]\n return store_index\n\n # Step 1: Find the median using quickselect\n mid_index = n // 2\n median = quickselect(0, n - 1, mid_index)\n\n # Step 2: Virtual indexing function (equivalent to A(i) in the C++ code)\n def virtual_index(i):\n return (1 + 2 * i) % (n | 1)\n\n # Step 3: Three-way partitioning to wiggle-sort the array in O(n) time\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[virtual_index(j)] > median:\n nums[virtual_index(i)], nums[virtual_index(j)] = nums[virtual_index(j)], nums[virtual_index(i)]\n i += 1\n j += 1\n elif nums[virtual_index(j)] < median:\n nums[virtual_index(j)], nums[virtual_index(k)] = nums[virtual_index(k)], nums[virtual_index(j)]\n k -= 1\n else:\n j += 1\n\n\n ","runtime":"606"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n\n def findMedian(nums):\n def selectKth(nums, k):\n def partition(left, right, pivot_index):\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot:\n nums[store_index], nums[i] = nums[i], nums[store_index]\n store_index += 1\n nums[right], nums[store_index] = nums[store_index], nums[right]\n return store_index\n\n left, right = 0, len(nums) - 1\n while True:\n pivot_index = (left + right) // 2\n pivot_index = partition(left, right, pivot_index)\n if k == pivot_index:\n return nums[k]\n elif k < pivot_index:\n right = pivot_index - 1\n else:\n left = pivot_index + 1\n\n n = len(nums)\n mid = (n + 1) // 2 - 1\n return selectKth(nums.copy(), mid)\n\n def threeWayPartition(nums, median):\n i, j, k = 0, 0, len(nums) - 1\n while j <= k:\n if nums[j] > median:\n nums[j], nums[k] = nums[k], nums[j]\n k -= 1\n elif nums[j] < median:\n nums[i], nums[j] = nums[j], nums[i]\n i += 1\n j += 1\n else:\n j += 1\n\n def virtualIndex(i, n):\n return (1 + 2 * i) % (n | 1)\n\n n = len(nums)\n median = findMedian(nums)\n threeWayPartition(nums, median)\n\n result = [0] * n\n left, right = (n - 1) // 2, n - 1\n for i in range(n):\n if i % 2 == 0:\n result[i] = nums[left]\n left -= 1\n else:\n result[i] = nums[right]\n right -= 1\n\n for i in range(n):\n nums[i] = result[i]","runtime":"622"},{"code":"from typing import List\n\nclass Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n def quickselect(k):\n def partition(left, right, pivot_index):\n pivot_value = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n store_index = left\n for i in range(left, right):\n if nums[i] < pivot_value:\n nums[store_index], nums[i] = nums[i], nums[store_index]\n store_index += 1\n nums[right], nums[store_index] = nums[store_index], nums[right]\n return store_index\n \n left, right = 0, len(nums) - 1\n while True:\n pivot_index = (left + right) // 2\n pivot_index = partition(left, right, pivot_index)\n if pivot_index == k:\n return nums[k]\n elif pivot_index < k:\n left = pivot_index + 1\n else:\n right = pivot_index - 1\n\n n = len(nums)\n median = quickselect((n - 1) // 2)\n \n def virtual_index(i):\n return (2 * i + 1) % (n | 1)\n\n left, right, i = 0, n - 1, 0\n while i <= right:\n if nums[virtual_index(i)] > median:\n nums[virtual_index(left)], nums[virtual_index(i)] = nums[virtual_index(i)], nums[virtual_index(left)]\n left += 1\n i += 1\n elif nums[virtual_index(i)] < median:\n nums[virtual_index(right)], nums[virtual_index(i)] = nums[virtual_index(i)], nums[virtual_index(right)]\n right -= 1\n else:\n i += 1\n","runtime":"637"},{"code":"# Inspired by https://leetcode.com/problems/wiggle-sort-ii/discuss/77677/O(n)%2BO(1)-after-median-Virtual-Indexing\nclass Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n mid = len(nums) // 2\n def quickselect(arr, lo, hi, k):\n pivot = random.randint(lo, hi)\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n pivot = lo\n for i in range(lo, hi):\n if arr[i] < arr[hi]:\n arr[i], arr[pivot] = arr[pivot], arr[i]\n pivot += 1\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n if k == pivot:\n return arr[pivot]\n elif k < pivot:\n return quickselect(arr, lo, pivot-1, k)\n else:\n return quickselect(arr, pivot+1, hi, k)\n median = quickselect(nums, 0, len(nums)-1, mid)\n \n # virtual index\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\n i, j, k = 0, 0, len(nums) - 1\n while j <= k:\n if nums[vi(j)] < median:\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\n k -= 1\n elif nums[vi(j)] > median:\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\n i += 1\n j += 1\n else:\n j += 1","runtime":"653"},{"code":"import random\nclass Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n def naive():\n nums.sort()\n cp = nums.copy()\n j = 0\n n = len(nums)\n \n # occupy the smallest even indices possible if they come from the S group and will take the largest odd indices possible if they are from the L group, then none of them will be neighbors of others\n # largest in back\n for i in range(n - 1 - ((n-1)%2), -1, -2):\n nums[i] = cp[j]\n j += 1\n for i in range(n - 1 - (n%2), -1, -2):\n nums[i] = cp[j]\n j += 1\n\n def quickselect():\n n = len(nums)\n m = (n + 1) // 2\n median = kthSmallestNumber(nums, m)\n lt = []\n eq = []\n gt = []\n for i in range(0, n):\n if nums[i] < median:\n lt.append(nums[i])\n elif nums[i] == median:\n eq.append(nums[i])\n else:\n gt.append(nums[i])\n cp = lt + eq + gt\n j = 0\n \n for i in range(n - 1 - ((n-1)%2), -1, -2):\n nums[i] = cp[j]\n j += 1\n for i in range(n - 1 - (n%2), -1, -2):\n nums[i] = cp[j]\n j += 1\n\n return nums\n\n def kthSmallestNumber(nums, k):\n m = (len(nums) + 1) // 2\n for i in range(0, len(nums)-1):\n si = random.randint(0, i+1)\n nums[i], nums[si] = nums[si], nums[i]\n l, r = 0, len(nums) - 1\n k -= 1 # to 0 based\n while l < r:\n median = getMiddle(nums, l, r)\n\n if median < k:\n l = median + 1\n elif median > k:\n r = median - 1\n else:\n break\n\n return nums[k]\n\n\n\n def getMiddle(nums, lo, hi):\n i = lo\n for j in range(lo+1, hi+1):\n if nums[j] < nums[lo]:\n i+=1\n nums[i], nums[j] = nums[j], nums[i]\n nums[i], nums[lo] = nums[lo], nums[i]\n return i\n\n \n # def quickSelect for O(n)\n \n quickselect()","runtime":"668"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n n = len(nums)\n mid = len(nums) //2\n def quick(arr,lo,hi,k):\n pivot = random.randint(lo,hi)\n arr[pivot],arr[hi] = arr[hi],arr[pivot]\n pivot = lo\n for i in range(lo,hi):\n if arr[i] < arr[hi]:\n arr[i],arr[pivot] = arr[pivot],arr[i]\n pivot += 1\n arr[pivot],arr[hi] = arr[hi],arr[pivot]\n if k == pivot:\n return arr[pivot]\n elif k < pivot:\n return quick(arr,lo,pivot-1,k)\n else:\n return quick(arr,pivot+1,hi,k)\n median = quick(nums,0,n-1,mid)\n # virtual index\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\n i, j, k = 0, 0, len(nums) - 1\n while j <= k:\n if nums[vi(j)] < median:\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\n k -= 1\n elif nums[vi(j)] > median:\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\n i += 1\n j += 1\n else:\n j += 1\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n ","runtime":"683"},{"code":"# Inspired by https://leetcode.com/problems/wiggle-sort-ii/discuss/77677/O(n)%2BO(1)-after-median-Virtual-Indexing\nclass Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n mid = len(nums) // 2\n def quickselect(arr, lo, hi, k):\n pivot = random.randint(lo, hi)\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n pivot = lo\n for i in range(lo, hi):\n if arr[i] < arr[hi]:\n arr[i], arr[pivot] = arr[pivot], arr[i]\n pivot += 1\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n if k == pivot:\n return arr[pivot]\n elif k < pivot:\n return quickselect(arr, lo, pivot-1, k)\n else:\n return quickselect(arr, pivot+1, hi, k)\n median = quickselect(nums, 0, len(nums)-1, mid)\n \n # virtual index\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\n i, j, k = 0, 0, len(nums) - 1\n while j <= k:\n if nums[vi(j)] < median:\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\n k -= 1\n elif nums[vi(j)] > median:\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\n i += 1\n j += 1\n else:\n j += 1","runtime":"699"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n mid = len(nums) // 2\n def quickselect(arr, lo, hi, k):\n pivot = random.randint(lo, hi)\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n pivot = lo\n for i in range(lo, hi):\n if arr[i] < arr[hi]:\n arr[i], arr[pivot] = arr[pivot], arr[i]\n pivot += 1\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n if k == pivot:\n return arr[pivot]\n elif k < pivot:\n return quickselect(arr, lo, pivot-1, k)\n else:\n return quickselect(arr, pivot+1, hi, k)\n median = quickselect(nums, 0, len(nums)-1, mid)\n \n # virtual index\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\n i, j, k = 0, 0, len(nums) - 1\n while j <= k:\n if nums[vi(j)] < median:\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\n k -= 1\n elif nums[vi(j)] > median:\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\n i += 1\n j += 1\n else:\n j += 1","runtime":"714"},{"code":"class Solution:\n\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n mid = len(nums) // 2\n def quickselect(arr, lo, hi, k):\n pivot = random.randint(lo, hi)\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n pivot = lo\n for i in range(lo, hi):\n if arr[i] < arr[hi]:\n arr[i], arr[pivot] = arr[pivot], arr[i]\n pivot += 1\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n if k == pivot:\n return arr[pivot]\n elif k < pivot:\n return quickselect(arr, lo, pivot-1, k)\n else:\n return quickselect(arr, pivot+1, hi, k)\n median = quickselect(nums, 0, len(nums)-1, mid)\n \n # virtual index\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\n i, j, k = 0, 0, len(nums) - 1\n while j <= k:\n if nums[vi(j)] < median:\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\n k -= 1\n elif nums[vi(j)] > median:\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\n i += 1\n j += 1\n else:\n j += 1","runtime":"730"},{"code":"class Solution:\n\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n mid = len(nums) // 2\n def quickselect(arr, lo, hi, k):\n pivot = random.randint(lo, hi)\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\n p = lo\n for i in range(lo, hi):\n if arr[i] < arr[hi]:\n arr[i], arr[p] = arr[p], arr[i]\n p += 1\n arr[p], arr[hi] = arr[hi], arr[p]\n if p == k:\n return arr[p]\n elif p > k:\n return quickselect(arr, lo, p-1, k)\n else:\n return quickselect(arr, p+1, hi, k)\n\n median = quickselect(nums, 0, len(nums)-1, mid)\n \n # virtual index\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\n l, p, r = 0, 0, len(nums) - 1\n while p <= r:\n if nums[vi(p)] < median:\n nums[vi(p)], nums[vi(r)] = nums[vi(r)], nums[vi(p)]\n r -= 1\n elif nums[vi(p)] > median:\n nums[vi(p)], nums[vi(l)] = nums[vi(l)], nums[vi(p)]\n l += 1\n p += 1\n else:\n p += 1","runtime":"745"}],"string":"[\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n half = len(nums[::2])\\n nums[::2], nums[1::2] = nums[:half][::-1], nums[half:][::-1]\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n=len(nums)\\n nums.sort()\\n mid=(n-1)//2\\n nums[::2],nums[1::2]=nums[mid::-1],nums[:mid:-1]\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n mid = (len(nums) - 1) // 2\\n nums[::2], nums[1::2] = nums[mid::-1], nums[:mid:-1]\\n\\n # Hank\\n # Time: O(n log n + n)\\n # Space: O(1)\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n sorted_nums = sorted(nums)\\n mid = (len(nums) + 1) // 2\\n j, k = mid - 1, len(nums) - 1\\n \\n for i in range(len(nums)):\\n if i % 2 == 0:\\n nums[i] = sorted_nums[j]\\n j -= 1\\n else:\\n nums[i] = sorted_nums[k]\\n k -= 1 \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n nums.sort()\\n size = len(nums)\\n middle = size // 2\\n is_pair = size % 2 == 0\\n\\n p0 = middle - 1 if is_pair else middle\\n p1 = size - 1\\n\\n ans = []\\n while len(ans) != size:\\n ans.append(nums[p0])\\n p0 -= 1\\n\\n if len(ans) == size:\\n break\\n\\n ans.append(nums[p1])\\n p1 -= 1\\n \\n for i in range(size):\\n nums[i] = ans[i]\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"143\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: list[int]) -> None:\\n # Sort the numbers\\n nums.sort()\\n n = len(nums)\\n \\n # Create a new array to hold the rearranged elements\\n sorted_nums = nums[:]\\n \\n # Rearrange the elements\\n # Use two pointers to fill the elements\\n left, right = (n - 1) // 2, n - 1\\n for i in range(n):\\n if i % 2 == 0:\\n nums[i] = sorted_nums[left]\\n left -= 1\\n else:\\n nums[i] = sorted_nums[right]\\n right -= 1\\n\\n# Example usage:\\nsol = Solution()\\n\\nnums1 = [1, 5, 1, 1, 6, 4]\\nsol.wiggleSort(nums1)\\nprint(nums1) # Output: [1, 6, 1, 5, 1, 4] or similar valid wiggle sort\\n\\nnums2 = [1, 3, 2, 2, 3, 1]\\nsol.wiggleSort(nums2)\\nprint(nums2) # Output: [2, 3, 1, 3, 1, 2] or similar valid wiggle sort\\n\\nnums3 = [4, 5, 5, 6]\\nsol.wiggleSort(nums3)\\nprint(nums3) # Output: [5, 6, 4, 5] or similar valid wiggle sort\\n\",\n \"runtime\": \"143\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\n [1,4,1,5,1,6]\\n [1, 2, 2, 2, 1, 1]\\n [1, 1, 1, 2, 2, 2]\\n [1, 2, 1, 2, 1, 2]\\n \\n [1, 2, 3] => \\n \\n [1, 2, 3] \\n \\n 2 = 1\\n 3+1 = 2\\n [3, 5, 6 , 6]\\n [5, 6, 3, 5]\\n \\n [1, 2]\\n [1, 1, 2]\\n \\n \\\"\\\"\\\"\\n \\n if len(nums) == 1:\\n return\\n \\n ## Method 1: Time: O(nlog(n)), Space: O(N)\\n n = len(nums)\\n nums.sort()\\n mid = nums[(n + 1) // 2]\\n \\n def index(i):\\n return (i * 2 + 1) % (n|1)\\n \\n def swap(i, j):\\n nums[i], nums[j] = nums[j], nums[i]\\n \\n \\n i, j, k = 0, 0, len(nums) - 1\\n \\n while j < k:\\n if nums[index(j)] > mid:\\n swap(index(i), index(j))\\n i += 1\\n j += 1\\n elif nums[index(j)] < mid:\\n swap(index(j), index(k))\\n k -= 1\\n else:\\n j += 1\\n \\n \\n# i, j = mid - 1, n - 1\\n \\n# while i >= 0 and j >= mid:\\n# ans.append(nums[i])\\n# ans.append(nums[j])\\n# i -= 1\\n# j -= 1\\n \\n# if i == 0:\\n# ans.append(nums[i])\\n\\n \\n# for i in range(n):\\n# nums[i] = ans[i]\\n\\n \\n \\\"\\\"\\\"\\n n = len(nums)\\n def quick_select(start, end, k):\\n pivot = nums[end]\\n j = start\\n for i in range(start, end):\\n if nums[i] < pivot:\\n nums[i], nums[j] = nums[j], nums[i]\\n j += 1\\n nums[end], nums[j] = nums[j], nums[end]\\n\\n if k == j:\\n return nums[j]\\n elif j < k:\\n return quick_select(j + 1, end, k)\\n else:\\n return quick_select(start, j - 1, k)\\n\\n mid = quick_select(0, len(nums) - 1, n // 2)\\n\\n def index(i):\\n return (2 * i + 1) % (n|1)\\n def swap(a, b):\\n nums[a], nums[b] = nums[b], nums[a]\\n\\n i, j, k = 0, 0, len(nums) - 1\\n \\n [5, 6, 4, 5] (3 % 4)\\n [4, 5, 5, 6, 6]\\n while j <= k:\\n print(\\\"{} > {}\\\".format(nums[index(j)], mid), index(i), index(j))\\n if nums[index(j)] > mid:\\n swap(index(j), index(i))\\n print(nums, index(i), index(j), 'gt')\\n j += 1\\n i += 1\\n elif nums[index(j)] < mid:\\n swap(index(j), index(k))\\n print(nums, index(j), index(k), j, k,'le')\\n k -= 1\\n else:\\n j += 1\\n \\n \\\"\\\"\\\"\\n\\n \\n\\n \",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums):\\n n = len(nums)\\n \\n # Find a median\\n midptr = n // 2\\n nums.sort()\\n mid = nums[midptr]\\n \\n # Index-rewiring\\n def A(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n # 3-way partition-to-wiggly in O(n) time with O(1) space\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[A(j)] > mid:\\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\\n i += 1\\n j += 1\\n elif nums[A(j)] < mid:\\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\\n k -= 1\\n else:\\n j += 1\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n import statistics\\n \\n def find_median(nums):\\n return statistics.median_low(nums)\\n \\n def three_way_partition(nums, median):\\n def virtual_index(i, n):\\n return (2 * i + 1) % (n | 1)\\n \\n n = len(nums)\\n i, j, k = 0, 0, n - 1\\n \\n while j <= k:\\n if nums[virtual_index(j, n)] > median:\\n nums[virtual_index(j, n)], nums[virtual_index(i, n)] = nums[virtual_index(i, n)], nums[virtual_index(j, n)]\\n i += 1\\n j += 1\\n elif nums[virtual_index(j, n)] < median:\\n nums[virtual_index(j, n)], nums[virtual_index(k, n)] = nums[virtual_index(k, n)], nums[virtual_index(j, n)]\\n k -= 1\\n else:\\n j += 1\\n \\n median = find_median(nums)\\n three_way_partition(nums, median)\",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n nums.sort()\\n asc=nums[:len(nums)//2][::-1]\\n dsc=nums[len(nums)//2:]\\n #print(asc,dsc)\\n if len(asc)<len(dsc):\\n asc.insert(0,dsc.pop(0))\\n #print(asc,dsc)\\n i=1\\n while dsc:\\n asc.insert(i,dsc.pop())\\n i+=2\\n #print(asc)\\n for i in range(len(nums)):\\n nums[i]=asc[i]\\n \",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n length = len(nums)\\n left, right = nums[:(length+1)//2][::-1], nums[(length+1)//2:][::-1]\\n for i in range(length):\\n if i%2 == 0: \\n nums[i] = left.pop(0)\\n else:\\n nums[i] = right.pop(0)\\n\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"import random as r\\n\\nclass Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n median = self.median(nums)\\n upper = list(filter(lambda x : x > median, nums))\\n lower = list(filter(lambda x : x < median, nums))\\n equal = list(filter(lambda x : x == median, nums))\\n flip = True\\n for i in equal:\\n if (len(upper) < len(lower)):\\n upper.append(i)\\n else:\\n lower.append(i)\\n\\n lower = list(reversed(lower))\\n upRev = upper\\n final = []\\n lowerI = 0\\n upperI = 0\\n print(len(upRev))\\n print(len(lower))\\n\\n print(upRev)\\n print(lower)\\n for i in range(len(nums)):\\n if (i % 2 == 0):\\n if (len(lower) <= lowerI):\\n nums[i] = upRev.pop()\\n else:\\n nums[i] = lower[lowerI]\\n lowerI += 1\\n else:\\n if (len(upper) <= upperI):\\n nums[i] = lower.pop(len(lower) - 1)\\n else:\\n nums[i] = upRev[upperI]\\n upperI += 1\\n \\n\\n def median(self, li):\\n if (len(li) % 2 == 0):\\n top = self.quickselect(li, len(li) // 2)\\n bottom = self.quickselect(li, (len(li) // 2) - 1)\\n return (top + bottom) / 2\\n else:\\n return self.quickselect(li, len(li) // 2)\\n\\n def quickselect(self, nums: List[int], k: int) -> int:\\n pivot = nums[r.randint(0, len(nums) - 1)]\\n less = list(filter(lambda x : x < pivot, nums))\\n greater = list(filter(lambda x : x > pivot, nums))\\n equal = list(filter(lambda x : x == pivot, nums))\\n if (k < len(less)):\\n return self.quickselect(less, k)\\n if (k < len(less) + len(equal)):\\n return pivot\\n else:\\n return self.quickselect(greater, k - len(less) - len(equal))\\n \\n\",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n i = 0\\n while i < len(nums) - 1:\\n nums.insert(i + 1, nums.pop(-1))\\n i = i + 2\\n nums[::2] = nums[::2][::-1]\",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n sorted_nums = sorted(nums)\\n print(\\\"sorted_nums\\\", sorted_nums)\\n l = (len(nums)-1)//2\\n r = len(nums)-1\\n for i in range(len(nums)):\\n print(i, l, r, nums[i], sorted_nums[l], sorted_nums[r])\\n if i%2 == 0:\\n nums[i] = sorted_nums[l]\\n l -= 1\\n else:\\n nums[i] = sorted_nums[r] \\n r -= 1\\n \\n # \\\"\\\"\\\"\\n # Do not return anything, modify nums in-place instead.\\n # \\\"\\\"\\\"\\n \\n # nums_2 = sorted(nums)\\n # l = 0\\n # r = len(nums)-1 # 5\\n # print(nums_2)\\n # for i in range(len(nums)): \\n # if i%2 == 1:\\n # # temp = nums[i]\\n # nums[i] = nums_2[r]\\n # # nums[r] = temp\\n \\n # # temp = nums[r]\\n # # nums[r] = nums[i]\\n # # nums[i] = temp\\n # r -= 1\\n # else:\\n # nums[i] =nums_2[l]\\n # l+=1\\n\\n # print(i, nums)\\n \\n # # return nums\\n\\n\\n\\n # arr = []\\n \\n # mid = (l+r)//2\\n # while l <= r:\\n # arr.append(nums[l])\\n # arr.append(nums[r])\\n # # nums[l+1], nums[r] = nums[r], nums[l+1]\\n\\n # l += 1\\n # r -= 1\\n # nums = arr\\n \\n \\n\\n # for i in range(1, len(nums)-1):\\n # if nums[i-1]<nums[i] and nums[i]>nums[i+1]:\\n # continue\\n # else:\\n # nums[i], nums[i-1] = nums[i-1], nums[i]\\n # return nums\",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n # 1, 5, 1, 1, 6, 4 -> 1, 1, 1, 4 ,5 ,6\\n # median: 2.5\\n # arrange by < or > median\\n # 1, 4, 1, 5, 1, 6\\n num_heap = [x for x in nums]\\n heapq.heapify(num_heap)\\n\\n small, big = [], []\\n\\n for i in range(math.ceil(len(nums)/2)):\\n small.append(heapq.heappop(num_heap))\\n while num_heap:\\n big.append(heapq.heappop(num_heap))\\n\\n res = []\\n\\n longer, shorter = (big[::-1], small[::-1]) if len(big) > len(small) else (small[::-1], big[::-1])\\n while shorter:\\n res.append(longer.pop(0))\\n res.append(shorter.pop(0))\\n\\n if longer:\\n res += longer\\n\\n for i in range(len(res)):\\n if nums[i] != res[i]:\\n nums[i] = res[i]\\n\\n\\n\\n \",\n \"runtime\": \"220\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\\"\\\"\\\"\\n Find n/2 small number\\n Find n/2 large number\\n sort in reverse order\\n \\\"\\\"\\\"\\n small = []\\n large = []\\n\\n heapq.heapify(nums)\\n length = len(nums)\\n half = length // 2\\n while len(nums) > half:\\n small.insert(0, heapq.heappop(nums))\\n\\n while len(nums) > 0:\\n large.insert(0, heapq.heappop(nums))\\n\\n small_idx = 0\\n large_idx = 0\\n\\n for i in range(length):\\n if i % 2 == 0:\\n nums.append(small[small_idx])\\n small_idx += 1\\n else:\\n nums.append(large[large_idx])\\n large_idx += 1\\n \\n return nums\",\n \"runtime\": \"220\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\\"\\\"\\\"\\n Find n/2 small number\\n Find n/2 large number\\n sort in reverse order\\n \\\"\\\"\\\"\\n small = []\\n large = []\\n\\n heapq.heapify(nums)\\n length = len(nums)\\n half = length // 2\\n while len(nums) > half:\\n small.insert(0, heapq.heappop(nums))\\n\\n while len(nums) > 0:\\n large.insert(0, heapq.heappop(nums))\\n\\n small_idx = 0\\n large_idx = 0\\n\\n for i in range(length):\\n if i % 2 == 0:\\n nums.append(small[small_idx])\\n small_idx += 1\\n else:\\n nums.append(large[large_idx])\\n large_idx += 1\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\\"\\\"\\\"\\n Find n/2 small number\\n Find n/2 large number\\n sort in reverse order\\n \\\"\\\"\\\"\\n small = []\\n large = []\\n\\n heapq.heapify(nums)\\n length = len(nums)\\n half = length // 2\\n while len(nums) > half:\\n small.insert(0, heapq.heappop(nums))\\n\\n while len(nums) > 0:\\n large.insert(0, heapq.heappop(nums))\\n\\n small_idx = 0\\n large_idx = 0\\n\\n print(small, large)\\n\\n for i in range(length):\\n if i % 2 == 0:\\n nums.append(small[small_idx])\\n small_idx += 1\\n else:\\n nums.append(large[large_idx])\\n large_idx += 1\\n \\n return nums\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n print(nums)\\n l = len(nums)\\n\\n ind = 1\\n nums[:(l+1)//2] = nums[:(l+1)//2][::-1]\\n nums[(l+1)//2:] = nums[(l+1)//2:][::-1]\\n print(nums)\\n\\n for i in range((l+1)//2, l):\\n print(i)\\n nums.insert(ind, nums.pop(i))\\n ind+=2\\n #print(nums)\\n \\n print(nums)\\n\\n \",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n if len(nums)%2 == 0:\\n section1 = section2 = int(len(nums)/2)\\n else:\\n section1 = int(len(nums)/2)\\n section2 = int(len(nums)/2)+1\\n bigger_numbers = nums[section2:]\\n smaller_numbers = nums[:section2]\\n for i in range(section1):\\n smaller_number = smaller_numbers[-(i+1)]\\n bigger_number = bigger_numbers[-(i+1)]\\n nums.pop(0)\\n nums.pop(0)\\n nums.insert(len(nums), smaller_number)\\n nums.insert(len(nums), bigger_number)\\n if len(nums)%2 != 0:\\n nums.pop(0)\\n nums.insert(len(nums), smaller_numbers[0])\\n\\n# 1 1 2 2 3 3\\n# 2 3 1 3 1 2\\n\\n# 5 6 4 5\\n\\n# 1 1 1 1 2 2 2\\n# 1 2 1 2 1 2 1\\n\\n# 1 1 1 4 5 6\\n# 1 6 1 5 1 4\\n\\n# 6 3 5 2 4 1\",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def findKthSmallest(self, nums: List[int], k: int) -> int:\\n # code from: 215. Kth Largest Element in an Array\\n # modified from kth largest -> kth smallest\\n start, end = 0, len(nums) - 1\\n while True:\\n i, j = start, end\\n pivot = nums[end]\\n while i < j:\\n if nums[i] > pivot:\\n while j > i and nums[j] > pivot:\\n j -= 1\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 1\\n else:\\n i += 1\\n if nums[j] > pivot:\\n j -= 1\\n if j == k:\\n return pivot\\n if j < k:\\n start = j\\n while start < k and nums[start] <= pivot:\\n start += 1\\n else:\\n end = j\\n while end > k and nums[end] == pivot:\\n end -= 1\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n # get the median. avg O(n) time and constant space\\n median = self.findKthSmallest(nums, len(nums) // 2)\\n\\n idx_less, idx_greater = 0, 1\\n # swap elements to the correct list (even or odd index)\\n # this whole process is O(n) because each element moves at most once\\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\\n while nums[idx] > median:\\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\\n idx_greater += 2\\n for idx in range(idx_greater, len(nums), 2): # odd idx\\n while nums[idx] < median:\\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\\n idx_less += 2\\n\\n # move all medians on the even list to the left\\n i, j = 0, len(nums) - 1\\n if j & 1:\\n j -= 1 # make sure j is even\\n while j > 0 and nums[j] != median:\\n j -= 2 # find the last non-median elelment\\n\\n while i < j:\\n if nums[i] == median:\\n i += 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 2\\n\\n # move all medians on the odd list to the right\\n i, j = 1, len(nums) - 1\\n if (j & 1) == 0:\\n j -= 1 # make sure j is odd\\n while i < j and nums[i] != median:\\n i += 2 # find the first non-median element\\n\\n while i < j:\\n if nums[j] == median:\\n j -= 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 2\",\n \"runtime\": \"267\"\n },\n {\n \"code\": \"class Solution:\\n def findKthSmallest(self, nums: List[int], k: int) -> int:\\n # code from: 215. Kth Largest Element in an Array\\n # modified from kth largest -> kth smallest\\n start, end = 0, len(nums) - 1\\n while True:\\n i, j = start, end\\n pivot = nums[end]\\n while i < j:\\n if nums[i] > pivot:\\n while j > i and nums[j] > pivot:\\n j -= 1\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 1\\n else:\\n i += 1\\n if nums[j] > pivot:\\n j -= 1\\n if j == k:\\n return pivot\\n if j < k:\\n start = j\\n while start < k and nums[start] <= pivot:\\n start += 1\\n else:\\n end = j\\n while end > k and nums[end] == pivot:\\n end -= 1\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n # get the median. avg O(n) time and constant space\\n median = self.findKthSmallest(nums, len(nums) // 2)\\n\\n idx_less, idx_greater = 0, 1\\n # swap elements to the correct list (even or odd index)\\n # this whole process is O(n) because each element moves at most once\\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\\n while nums[idx] > median:\\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\\n idx_greater += 2\\n for idx in range(idx_greater, len(nums), 2): # odd idx\\n while nums[idx] < median:\\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\\n idx_less += 2\\n\\n # move all medians on the even list to the left\\n i, j = 0, len(nums) - 1\\n if j & 1:\\n j -= 1 # make sure j is even\\n while j > 0 and nums[j] != median:\\n j -= 2 # find the last non-median elelment\\n\\n while i < j:\\n if nums[i] == median:\\n i += 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 2\\n\\n # move all medians on the odd list to the right\\n i, j = 1, len(nums) - 1\\n if (j & 1) == 0:\\n j -= 1 # make sure j is odd\\n while i < j and nums[i] != median:\\n i += 2 # find the first non-median element\\n\\n while i < j:\\n if nums[j] == median:\\n j -= 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 2\",\n \"runtime\": \"282\"\n },\n {\n \"code\": \"class Solution:\\n def findKthSmallest(self, nums: List[int], k: int) -> int:\\n # code from: 215. Kth Largest Element in an Array\\n # modified from kth largest -> kth smallest\\n start, end = 0, len(nums) - 1\\n while True:\\n i, j = start, end\\n pivot = nums[end]\\n while i < j:\\n if nums[i] > pivot:\\n while j > i and nums[j] > pivot:\\n j -= 1\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 1\\n else:\\n i += 1\\n if nums[j] > pivot:\\n j -= 1\\n if j == k:\\n return pivot\\n if j < k:\\n start = j\\n while start < k and nums[start] <= pivot:\\n start += 1\\n else:\\n end = j\\n while end > k and nums[end] == pivot:\\n end -= 1\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n # get the median. avg O(n) time and constant space\\n median = self.findKthSmallest(nums, len(nums) // 2)\\n\\n idx_less, idx_greater = 0, 1\\n # swap elements to the correct list (even or odd index)\\n # this whole process is O(n) because each element moves at most once\\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\\n while nums[idx] > median:\\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\\n idx_greater += 2\\n for idx in range(idx_greater, len(nums), 2): # odd idx\\n while nums[idx] < median:\\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\\n idx_less += 2\\n\\n # move all medians on the even list to the left\\n i, j = 0, len(nums) - 1\\n if j & 1:\\n j -= 1 # make sure j is even\\n while j > 0 and nums[j] != median:\\n j -= 2 # find the last non-median elelment\\n\\n while i < j:\\n if nums[i] == median:\\n i += 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 2\\n\\n # move all medians on the odd list to the right\\n i, j = 1, len(nums) - 1\\n if (j & 1) == 0:\\n j -= 1 # make sure j is odd\\n while i < j and nums[i] != median:\\n i += 2 # find the first non-median element\\n\\n while i < j:\\n if nums[j] == median:\\n j -= 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 2\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def findKthSmallest(self, nums: List[int], k: int) -> int:\\n # code from: 215. Kth Largest Element in an Array\\n # modified from kth largest -> kth smallest\\n start, end = 0, len(nums) - 1\\n while True:\\n i, j = start, end\\n pivot = nums[end]\\n while i < j:\\n if nums[i] > pivot:\\n while j > i and nums[j] > pivot:\\n j -= 1\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 1\\n else:\\n i += 1\\n if nums[j] > pivot:\\n j -= 1\\n if j == k:\\n return pivot\\n if j < k:\\n start = j\\n while start < k and nums[start] <= pivot:\\n start += 1\\n else:\\n end = j\\n while end > k and nums[end] == pivot:\\n end -= 1\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n # get the median. avg O(n) time and constant space\\n median = self.findKthSmallest(nums, len(nums) // 2)\\n\\n idx_less, idx_greater = 0, 1\\n # swap elements to the correct list (even or odd index)\\n # this whole process is O(n) because each element moves at most once\\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\\n while nums[idx] > median:\\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\\n idx_greater += 2\\n for idx in range(idx_greater, len(nums), 2): # odd idx\\n while nums[idx] < median:\\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\\n idx_less += 2\\n\\n # move all medians on the even list to the left\\n i, j = 0, len(nums) - 1\\n if j & 1:\\n j -= 1 # make sure j is even\\n while j > 0 and nums[j] != median:\\n j -= 2 # find the last non-median elelment\\n\\n while i < j:\\n if nums[i] == median:\\n i += 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 2\\n\\n # move all medians on the odd list to the right\\n i, j = 1, len(nums) - 1\\n if (j & 1) == 0:\\n j -= 1 # make sure j is odd\\n while i < j and nums[i] != median:\\n i += 2 # find the first non-median element\\n\\n while i < j:\\n if nums[j] == median:\\n j -= 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 2\",\n \"runtime\": \"313\"\n },\n {\n \"code\": \"class Solution:\\n def findKthSmallest(self, nums: List[int], k: int) -> int:\\n start, end = 0, len(nums) - 1\\n while True:\\n i, j = start, end\\n pivot = nums[end]\\n while i < j:\\n if nums[i] > pivot:\\n while j > i and nums[j] > pivot:\\n j -= 1\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 1\\n else:\\n i += 1\\n if nums[j] > pivot:\\n j -= 1\\n if j == k:\\n return pivot\\n if j < k:\\n start = j\\n while start < k and nums[start] <= pivot:\\n start += 1\\n else:\\n end = j\\n while end > k and nums[end] == pivot:\\n end -= 1\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n median = self.findKthSmallest(nums, len(nums) // 2)\\n\\n idx_less, idx_greater = 0, 1\\n for idx in range(0, len(nums), 2):\\n while nums[idx] > median:\\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\\n idx_greater += 2\\n for idx in range(idx_greater, len(nums), 2):\\n while nums[idx] < median:\\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\\n idx_less += 2\\n\\n i, j = 0, len(nums) - 1\\n if j & 1:\\n j -= 1\\n while j > 0 and nums[j] != median:\\n j -= 2\\n\\n while i < j:\\n if nums[i] == median:\\n i += 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 2\\n\\n i, j = 1, len(nums) - 1\\n if (j & 1) == 0:\\n j -= 1\\n while i < j and nums[i] != median:\\n i += 2\\n\\n while i < j:\\n if nums[j] == median:\\n j -= 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 2\",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def findKthSmallest(self, nums: List[int], k: int) -> int:\\n # code from: 215. Kth Largest Element in an Array\\n # modified from kth largest -> kth smallest\\n start, end = 0, len(nums) - 1\\n while True:\\n i, j = start, end\\n pivot = nums[end]\\n while i < j:\\n if nums[i] > pivot:\\n while j > i and nums[j] > pivot:\\n j -= 1\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 1\\n else:\\n i += 1\\n if nums[j] > pivot:\\n j -= 1\\n if j == k:\\n return pivot\\n if j < k:\\n start = j\\n while start < k and nums[start] <= pivot:\\n start += 1\\n else:\\n end = j\\n while end > k and nums[end] == pivot:\\n end -= 1\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n # get the median. avg O(n) time and constant space\\n median = self.findKthSmallest(nums, len(nums) // 2)\\n\\n idx_less, idx_greater = 0, 1\\n # swap elements to the correct list (even or odd index)\\n # this whole process is O(n) because each element moves at most once\\n for idx in range(0, len(nums), 2): # even idx. swap until the element <= median\\n while nums[idx] > median:\\n nums[idx], nums[idx_greater] = nums[idx_greater], nums[idx]\\n idx_greater += 2\\n for idx in range(idx_greater, len(nums), 2): # odd idx\\n while nums[idx] < median:\\n nums[idx], nums[idx_less] = nums[idx_less], nums[idx]\\n idx_less += 2\\n\\n # move all medians on the even list to the left\\n i, j = 0, len(nums) - 1\\n if j & 1:\\n j -= 1 # make sure j is even\\n while j > 0 and nums[j] != median:\\n j -= 2 # find the last non-median elelment\\n\\n while i < j:\\n if nums[i] == median:\\n i += 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n j -= 2\\n\\n # move all medians on the odd list to the right\\n i, j = 1, len(nums) - 1\\n if (j & 1) == 0:\\n j -= 1 # make sure j is odd\\n while i < j and nums[i] != median:\\n i += 2 # find the first non-median element\\n\\n while i < j:\\n if nums[j] == median:\\n j -= 2\\n else:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 2\\n \",\n \"runtime\": \"344\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Step 1: Find the median\\n def find_median(nums):\\n def partition(nums, left, right):\\n pivot_index = (left + right) // 2\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[i], nums[store_index] = nums[store_index], nums[i]\\n store_index += 1\\n nums[store_index], nums[right] = nums[right], nums[store_index]\\n return store_index\\n\\n def quickselect(nums, k):\\n left, right = 0, len(nums) - 1\\n while left <= right:\\n pivot_index = partition(nums, left, right)\\n if pivot_index == k:\\n return nums[k]\\n elif pivot_index < k:\\n left = pivot_index + 1\\n else:\\n right = pivot_index - 1\\n\\n return quickselect(nums, len(nums) // 2)\\n\\n # Step 2: Three-way partition\\n median = find_median(nums)\\n n = len(nums)\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < median:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 1\\n j += 1\\n elif nums[j] > median:\\n nums[j], nums[k] = nums[k], nums[j]\\n k -= 1\\n else:\\n j += 1\\n\\n # Step 3: Interleave the elements\\n def interleave(nums):\\n half = (n + 1) // 2\\n left = nums[:half][::-1]\\n right = nums[half:][::-1]\\n nums[::2] = left\\n nums[1::2] = right\\n\\n interleave(nums)\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 5, 1, 1, 6, 4]\\nsolution.wiggleSort(nums)\\nprint(nums) # Output: [1, 6, 1, 5, 1, 4] or [1, 4, 1, 5, 1, 6]\",\n \"runtime\": \"359\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n mid = self.find_medium(nums, n // 2)\\n \\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < mid: \\n nums[j], nums[i] = nums[i], nums[j]\\n i += 1\\n j += 1\\n elif nums[j] > mid:\\n nums[k], nums[j] = nums[j], nums[k]\\n k -= 1\\n else:\\n j += 1\\n \\n mid = (n - 1) // 2\\n tmp1 = nums[:mid + 1]\\n tmp2 = nums[mid + 1:]\\n\\n for i in range(len(tmp1)):\\n nums[2 * i] = tmp1[-1-i]\\n for i in range(len(tmp2)):\\n nums[2 * i + 1] = tmp2[-1-i]\\n\\n def find_medium(self, nums: List[int], k: int) -> int:\\n left, right = 0, len(nums) - 1\\n while True: \\n pivot_idx = random.randint(left, right)\\n pivot_idx = self.partition(nums, left, right, pivot_idx)\\n if k == pivot_idx: \\n return nums[k]\\n elif k < pivot_idx:\\n right = pivot_idx - 1\\n else: \\n left = pivot_idx + 1\\n \\n def partition(self, nums, left, right, pivot_idx):\\n pivot = nums[pivot_idx]\\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\\n store_idx = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\\n store_idx += 1\\n # every number to the left of storeidx (not including store idx) will be less than pivot\\n\\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\\n return store_idx\\n\\n\\n \",\n \"runtime\": \"375\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n \\n \\n mid = self.find_medium(nums, n // 2)\\n \\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < mid: \\n nums[j], nums[i] = nums[i], nums[j]\\n i += 1\\n j += 1\\n elif nums[j] > mid:\\n nums[k], nums[j] = nums[j], nums[k]\\n k -= 1\\n else:\\n j += 1\\n half_len = len(nums[::2])\\n nums[::2], nums[1::2] = nums[:half_len][::-1], nums[half_len::][::-1]\\n\\n def find_medium(self, nums: List[int], k: int) -> int:\\n left, right = 0, len(nums) - 1\\n while True: \\n pivot_idx = random.randint(left, right)\\n pivot_idx = self.partition(nums, left, right, pivot_idx)\\n if k == pivot_idx: \\n return nums[k]\\n elif k < pivot_idx:\\n right = pivot_idx - 1\\n else: \\n left = pivot_idx + 1\\n \\n def partition(self, nums, left, right, pivot_idx):\\n pivot = nums[pivot_idx]\\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\\n store_idx = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\\n store_idx += 1\\n # every number to the left of storeidx (not including store idx) will be less than pivot\\n\\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\\n return store_idx\\n\\n\\n \",\n \"runtime\": \"390\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def partition(arr, low, high):\\n pivot_index = random.randint(low, high)\\n pivot = arr[pivot_index]\\n \\n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\\n \\n i = low\\n for j in range(low, high):\\n if arr[j] < pivot:\\n arr[i], arr[j] = arr[j], arr[i]\\n i += 1\\n\\n arr[i], arr[high] = arr[high], arr[i]\\n \\n return i\\n \\n def quickSelect(arr, low, high, k):\\n if low < high:\\n pi = partition(arr, low, high)\\n\\n if pi == k:\\n return arr[pi]\\n elif pi < k:\\n return quickSelect(arr, pi + 1, high, k)\\n else:\\n return quickSelect(arr, low, pi - 1, k)\\n else:\\n return arr[low]\\n \\n n = len(nums)\\n median = quickSelect(nums, 0, n - 1, n // 2)\\n\\n def A(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n i, j, k = 0, 0, n - 1\\n \\n while j <= k:\\n if nums[A(j)] > median:\\n # Swap nums[A(i)] and nums[A(j)]\\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\\n i += 1\\n j += 1\\n elif nums[A(j)] < median:\\n # Swap nums[A(j)] and nums[A(k)]\\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\\n k -= 1\\n else:\\n j += 1\\n\",\n \"runtime\": \"406\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def partition(arr, low, high):\\n pivot_index = random.randint(low, high)\\n pivot = arr[pivot_index]\\n \\n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\\n \\n i = low\\n for j in range(low, high):\\n if arr[j] < pivot:\\n arr[i], arr[j] = arr[j], arr[i]\\n i += 1\\n\\n arr[i], arr[high] = arr[high], arr[i]\\n \\n return i\\n \\n def quickSelect(arr, low, high, k):\\n if low < high:\\n pi = partition(arr, low, high)\\n\\n if pi == k:\\n return arr[pi]\\n elif pi < k:\\n return quickSelect(arr, pi + 1, high, k)\\n else:\\n return quickSelect(arr, low, pi - 1, k)\\n else:\\n return arr[low]\\n \\n n = len(nums)\\n median = quickSelect(nums, 0, n - 1, n // 2)\\n\\n def A(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n i, j, k = 0, 0, n - 1\\n \\n while j <= k:\\n if nums[A(j)] > median:\\n # Swap nums[A(i)] and nums[A(j)]\\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\\n i += 1\\n j += 1\\n elif nums[A(j)] < median:\\n # Swap nums[A(j)] and nums[A(k)]\\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\\n k -= 1\\n else:\\n j += 1\\n\",\n \"runtime\": \"421\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def find_median(nums):\\n def partition(nums, left, right):\\n pivot_index = (left + right) // 2\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[i], nums[store_index] = nums[store_index], nums[i]\\n store_index += 1\\n nums[store_index], nums[right] = nums[right], nums[store_index]\\n return store_index\\n\\n def select(nums, left, right, k):\\n if left == right:\\n return nums[left]\\n pivot_index = partition(nums, left, right)\\n if k == pivot_index:\\n return nums[k]\\n elif k < pivot_index:\\n return select(nums, left, pivot_index - 1, k)\\n else:\\n return select(nums, pivot_index + 1, right, k)\\n\\n n = len(nums)\\n return select(nums, 0, n - 1, n // 2)\\n\\n def three_way_partition(nums, median):\\n def swap(nums, i, j):\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n n = len(nums)\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < median:\\n swap(nums, i, j)\\n i += 1\\n j += 1\\n elif nums[j] > median:\\n swap(nums, j, k)\\n k -= 1\\n else:\\n j += 1\\n\\n def interleave(nums):\\n n = len(nums)\\n half = (n + 1) // 2\\n\\n def new_index(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n nums[::2], nums[1::2] = nums[:half][::-1], nums[half:][::-1]\\n\\n median = find_median(nums)\\n three_way_partition(nums, median)\\n interleave(nums)\",\n \"runtime\": \"436\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n mid = self.find_medium(nums, n // 2)\\n \\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < mid: \\n nums[j], nums[i] = nums[i], nums[j]\\n i += 1\\n j += 1\\n elif nums[j] > mid:\\n nums[k], nums[j] = nums[j], nums[k]\\n k -= 1\\n else:\\n j += 1\\n \\n mid = (n - 1) // 2\\n tmp1 = nums[:mid + 1]\\n tmp2 = nums[mid + 1:]\\n\\n for i in range(len(tmp1)):\\n nums[2 * i] = tmp1[-1-i]\\n for i in range(len(tmp2)):\\n nums[2 * i + 1] = tmp2[-1-i]\\n\\n def find_medium(self, nums: List[int], k: int) -> int:\\n left, right = 0, len(nums) - 1\\n while True: \\n pivot_idx = random.randint(left, right)\\n pivot_idx = self.partition(nums, left, right, pivot_idx)\\n if k == pivot_idx: \\n return nums[k]\\n elif k < pivot_idx:\\n right = pivot_idx - 1\\n else: \\n left = pivot_idx + 1\\n \\n def partition(self, nums, left, right, pivot_idx):\\n pivot = nums[pivot_idx]\\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\\n store_idx = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\\n store_idx += 1\\n # every number to the left of storeidx (not including store idx) will be less than pivot\\n\\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\\n return store_idx\\n\\n\\n \",\n \"runtime\": \"452\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def partition(arr, low, high):\\n pivot_index = random.randint(low, high)\\n pivot = arr[pivot_index]\\n \\n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\\n \\n i = low\\n for j in range(low, high):\\n if arr[j] < pivot:\\n arr[i], arr[j] = arr[j], arr[i]\\n i += 1\\n\\n arr[i], arr[high] = arr[high], arr[i]\\n \\n return i\\n \\n def quickSelect(arr, low, high, k):\\n if low < high:\\n pi = partition(arr, low, high)\\n\\n if pi == k:\\n return arr[pi]\\n elif pi < k:\\n return quickSelect(arr, pi + 1, high, k)\\n else:\\n return quickSelect(arr, low, pi - 1, k)\\n else:\\n return arr[low]\\n \\n n = len(nums)\\n median = quickSelect(nums, 0, n - 1, n // 2)\\n\\n def A(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n i, j, k = 0, 0, n - 1\\n \\n while j <= k:\\n if nums[A(j)] > median:\\n # Swap nums[A(i)] and nums[A(j)]\\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\\n i += 1\\n j += 1\\n elif nums[A(j)] < median:\\n # Swap nums[A(j)] and nums[A(k)]\\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\\n k -= 1\\n else:\\n j += 1\\n\",\n \"runtime\": \"467\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def partition(arr, low, high):\\n pivot_index = random.randint(low, high)\\n pivot = arr[pivot_index]\\n \\n arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\\n \\n i = low\\n for j in range(low, high):\\n if arr[j] < pivot:\\n arr[i], arr[j] = arr[j], arr[i]\\n i += 1\\n\\n arr[i], arr[high] = arr[high], arr[i]\\n \\n return i\\n \\n def quickSelect(arr, low, high, k):\\n if low < high:\\n pi = partition(arr, low, high)\\n\\n if pi == k:\\n return arr[pi]\\n elif pi < k:\\n return quickSelect(arr, pi + 1, high, k)\\n else:\\n return quickSelect(arr, low, pi - 1, k)\\n else:\\n return arr[low]\\n \\n n = len(nums)\\n median = quickSelect(nums, 0, n - 1, n // 2)\\n\\n def A(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n i, j, k = 0, 0, n - 1\\n \\n while j <= k:\\n if nums[A(j)] > median:\\n # Swap nums[A(i)] and nums[A(j)]\\n nums[A(i)], nums[A(j)] = nums[A(j)], nums[A(i)]\\n i += 1\\n j += 1\\n elif nums[A(j)] < median:\\n # Swap nums[A(j)] and nums[A(k)]\\n nums[A(j)], nums[A(k)] = nums[A(k)], nums[A(j)]\\n k -= 1\\n else:\\n j += 1\\n\",\n \"runtime\": \"483\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def find_median(nums, k):\\n def partition(left, right, pivot_index):\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[i], nums[store_index] = nums[store_index], nums[i]\\n store_index += 1\\n nums[store_index], nums[right] = nums[right], nums[store_index]\\n return store_index\\n\\n def select(left, right, k):\\n if left == right:\\n return nums[left]\\n pivot_index = random.randint(left, right)\\n pivot_index = partition(left, right, pivot_index)\\n if k == pivot_index:\\n return nums[k]\\n elif k < pivot_index:\\n return select(left, pivot_index - 1, k)\\n else:\\n return select(pivot_index + 1, right, k)\\n\\n return select(0, len(nums) - 1, k)\\n\\n def three_way_partition(nums, median):\\n def swap(i, j):\\n nums[i], nums[j] = nums[j], nums[i]\\n\\n n = len(nums)\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < median:\\n swap(i, j)\\n i += 1\\n j += 1\\n elif nums[j] > median:\\n swap(j, k)\\n k -= 1\\n else:\\n j += 1\\n\\n def wiggle_sort(nums):\\n n = len(nums)\\n median = find_median(nums, (n - 1) // 2)\\n three_way_partition(nums, median)\\n\\n mid = (n - 1) // 2\\n even_pos = [nums[i] for i in range(mid + 1)][::-1]\\n odd_pos = [nums[i] for i in range(mid + 1, n)][::-1]\\n\\n nums[::2], nums[1::2] = even_pos, odd_pos\\n\\n wiggle_sort(nums)\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 5, 1, 1, 6, 4]\\nsolution.wiggleSort(nums)\\nprint(nums) # Output will be [1, 6, 1, 5, 1, 4] or [1, 4, 1, 5, 1, 6]\",\n \"runtime\": \"498\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def findKthLargest(nums: List[int], k: int) -> int:\\n def partition(left: int, right: int, pivot_index: int) -> int:\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[store_index], nums[i] = nums[i], nums[store_index]\\n store_index += 1\\n nums[right], nums[store_index] = nums[store_index], nums[right]\\n return store_index\\n\\n def select(left: int, right: int, k_smallest: int) -> int:\\n if left == right:\\n return nums[left]\\n pivot_index = (left + right) // 2\\n pivot_index = partition(left, right, pivot_index)\\n if k_smallest == pivot_index:\\n return nums[k_smallest]\\n elif k_smallest < pivot_index:\\n return select(left, pivot_index - 1, k_smallest)\\n else:\\n return select(pivot_index + 1, right, k_smallest)\\n\\n return select(0, len(nums) - 1, len(nums) - k)\\n\\n n = len(nums)\\n median = findKthLargest(nums, (n + 1) // 2)\\n\\n def newIndex(index: int) -> int:\\n return (1 + 2 * index) % (n | 1)\\n\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[newIndex(j)] > median:\\n nums[newIndex(i)], nums[newIndex(j)] = nums[newIndex(j)], nums[newIndex(i)]\\n i += 1\\n j += 1\\n elif nums[newIndex(j)] < median:\\n nums[newIndex(j)], nums[newIndex(k)] = nums[newIndex(k)], nums[newIndex(j)]\\n k -= 1\\n else:\\n j += 1\",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n def partition(left, right):\\n pivotIndex = random.randint(left, right)\\n nums[pivotIndex], nums[right] = nums[right], nums[pivotIndex]\\n\\n pivotIndex = left\\n pivotValue = nums[right]\\n\\n for i in range(left, right):\\n if nums[i] < pivotValue:\\n nums[i], nums[pivotIndex] = nums[pivotIndex], nums[i]\\n pivotIndex += 1\\n\\n nums[pivotIndex], nums[right] = nums[right], nums[pivotIndex]\\n return pivotIndex\\n\\n def findMedian():\\n n = len(nums)\\n lo, hi = 0, n-1\\n mid = n // 2\\n\\n while True:\\n pivot = partition(lo, hi)\\n\\n if pivot == mid: return nums[mid]\\n elif pivot < mid: lo = pivot + 1\\n else: hi = pivot - 1\\n\\n n = len(nums)\\n median = findMedian()\\n\\n vIdx = lambda index, n: (1 + 2 * index) % (n | 1)\\n \\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[vIdx(j, n)] > median:\\n nums[vIdx(i, n)], nums[vIdx(j, n)] = nums[vIdx(j, n)], nums[vIdx(i, n)]\\n i += 1\\n j += 1\\n elif nums[vIdx(j, n)] < median:\\n nums[vIdx(j, n)], nums[vIdx(k, n)] = nums[vIdx(k, n)], nums[vIdx(j, n)]\\n k -= 1\\n else:\\n j += 1\\n\",\n \"runtime\": \"529\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n n = len(nums)\\n mid = self.find_medium(nums, n // 2)\\n \\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < mid: \\n nums[j], nums[i] = nums[i], nums[j]\\n i += 1\\n j += 1\\n elif nums[j] > mid:\\n nums[k], nums[j] = nums[j], nums[k]\\n k -= 1\\n else:\\n j += 1\\n \\n mid = (n - 1) // 2\\n tmp1 = nums[:mid + 1]\\n tmp2 = nums[mid + 1:]\\n\\n for i in range(len(tmp1)):\\n nums[2 * i] = tmp1[-1-i]\\n for i in range(len(tmp2)):\\n nums[2 * i + 1] = tmp2[-1-i]\\n\\n def find_medium(self, nums: List[int], k: int) -> int:\\n left, right = 0, len(nums) - 1\\n while True: \\n pivot_idx = random.randint(left, right)\\n pivot_idx = self.partition(nums, left, right, pivot_idx)\\n if k == pivot_idx: \\n return nums[k]\\n elif k < pivot_idx:\\n right = pivot_idx - 1\\n else: \\n left = pivot_idx + 1\\n \\n def partition(self, nums, left, right, pivot_idx):\\n pivot = nums[pivot_idx]\\n nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]\\n store_idx = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[store_idx], nums[i] = nums[i], nums[store_idx]\\n store_idx += 1\\n # every number to the left of storeidx (not including store idx) will be less than pivot\\n\\n nums[store_idx], nums[right] = nums[right], nums[store_idx]\\n return store_idx\\n\\n\\n \",\n \"runtime\": \"544\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self,nums):\\n def findKthLargest(nums, k):\\n def partition(left, right, pivot_index):\\n pivot_value = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index] \\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot_value:\\n nums[store_index], nums[i] = nums[i], nums[store_index]\\n store_index += 1\\n nums[right], nums[store_index] = nums[store_index], nums[right] \\n return store_index\\n \\n def select(left, right, k_smallest):\\n if left == right:\\n return nums[left]\\n pivot_index = left + (right - left) // 2\\n pivot_index = partition(left, right, pivot_index)\\n if k_smallest == pivot_index:\\n return nums[k_smallest]\\n elif k_smallest < pivot_index:\\n return select(left, pivot_index - 1, k_smallest)\\n else:\\n return select(pivot_index + 1, right, k_smallest)\\n \\n return select(0, len(nums) - 1, len(nums) - k)\\n \\n n = len(nums)\\n if n <= 1:\\n return\\n \\n median = findKthLargest(nums, (n + 1) // 2)\\n \\n def newIndex(i):\\n return (1 + 2 * i) % (n | 1)\\n \\n left, right, i = 0, n - 1, 0\\n while i <= right:\\n if nums[newIndex(i)] > median:\\n nums[newIndex(left)], nums[newIndex(i)] = nums[newIndex(i)], nums[newIndex(left)]\\n left += 1\\n i += 1\\n elif nums[newIndex(i)] < median:\\n nums[newIndex(right)], nums[newIndex(i)] = nums[newIndex(i)], nums[newIndex(right)]\\n right -= 1\\n else:\\n i += 1\\n'''\\n[1,5,1,1,6,4]\\n\\n\\nDesign\\n\\nBrute Force\\n1. Sort the input array\\n2. Create the wiggle requirement using Two Pointers\\n\\n[1,5,1,1,6,4] sort() -> [1,1,1,4,5,6]\\nCreate Wiggle Assortment\\n[1,5,1,6,1,4]\\n\\n[smallest_value, largest_value, 2nd smallest, 2nd largest,....]\\n\\nDesign\\n\\n1. Count the frequcny of the elements \\n2. Place the largest elements at even indices and update the frequency as the elements get placed\\n Largest to Smallest at Even Indinces\\n3. Place the smallest elements at the odd indices and update the frequcny as the elemtns get placed\\n\\n\\nMedian Value Pivot\\n\\n1. Do Quick Select with idx value of n // 2\\n a. Partition array with median value, 3-way partition\\n2. Create Wiggle Sort Relationship \\n\\nState of array would Brute\\n[values less than median < median <= values greater or equal to median]\\n'''\\n\",\n \"runtime\": \"560\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Step 1: Find the median\\n n = len(nums)\\n median = self.findKthLargest(nums, (n + 1) // 2)\\n \\n # Step 2: Three-way-partition around the median\\n def partition(nums, median):\\n def virtual_index(i, n):\\n return (2 * i + 1) % (n | 1)\\n\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[virtual_index(j, n)] > median:\\n nums[virtual_index(j, n)], nums[virtual_index(i, n)] = nums[virtual_index(i, n)], nums[virtual_index(j, n)]\\n i += 1\\n j += 1\\n elif nums[virtual_index(j, n)] < median:\\n nums[virtual_index(j, n)], nums[virtual_index(k, n)] = nums[virtual_index(k, n)], nums[virtual_index(j, n)]\\n k -= 1\\n else:\\n j += 1\\n \\n # Step 3: Wiggle sort\\n partition(nums, median)\\n\\n def findKthLargest(self, nums, k):\\n def partition(left, right, pivot_index):\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[i], nums[store_index] = nums[store_index], nums[i]\\n store_index += 1\\n nums[right], nums[store_index] = nums[store_index], nums[right]\\n return store_index\\n \\n def select(left, right, k_smallest):\\n if left == right:\\n return nums[left]\\n pivot_index = random.randint(left, right)\\n pivot_index = partition(left, right, pivot_index)\\n if k_smallest == pivot_index:\\n return nums[k_smallest]\\n elif k_smallest < pivot_index:\\n return select(left, pivot_index - 1, k_smallest)\\n else:\\n return select(pivot_index + 1, right, k_smallest)\\n \\n return select(0, len(nums) - 1, len(nums) - k)\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 5, 1, 1, 6, 4]\\nsolution.wiggleSort(nums)\\nprint(nums) # Output will be [1, 6, 1, 5, 1, 4] or similar\",\n \"runtime\": \"575\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def find_median(nums):\\n def partition(left, right, pivot_index):\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[i], nums[store_index] = nums[store_index], nums[i]\\n store_index += 1\\n nums[right], nums[store_index] = nums[store_index], nums[right]\\n return store_index\\n\\n def select(left, right, k):\\n if left == right:\\n return nums[left]\\n pivot_index = random.randint(left, right)\\n pivot_index = partition(left, right, pivot_index)\\n if k == pivot_index:\\n return nums[k]\\n elif k < pivot_index:\\n return select(left, pivot_index - 1, k)\\n else:\\n return select(pivot_index + 1, right, k)\\n\\n return select(0, len(nums) - 1, len(nums) // 2)\\n\\n n = len(nums)\\n median = find_median(nums)\\n\\n # Three-way partition\\n def three_way_partition(nums, median):\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[j] < median:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 1\\n j += 1\\n elif nums[j] > median:\\n nums[j], nums[k] = nums[k], nums[j]\\n k -= 1\\n else:\\n j += 1\\n\\n three_way_partition(nums, median)\\n\\n # Interleave the elements\\n mid = (n + 1) // 2\\n left = nums[:mid][::-1]\\n right = nums[mid:][::-1]\\n nums[::2] = left\\n nums[1::2] = right\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 5, 1, 1, 6, 4]\\nsolution.wiggleSort(nums)\\nprint(nums) # Output will be [1, 6, 1, 5, 1, 4] or similar\",\n \"runtime\": \"591\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n\\n n = len(nums)\\n \\n def quickselect(l, r, k):\\n \\\"\\\"\\\"Quickselect algorithm to find the k-th smallest element.\\\"\\\"\\\"\\n if l == r:\\n return nums[l]\\n\\n pivot_index = random.randint(l, r)\\n pivot_index = partition(l, r, pivot_index)\\n\\n if k == pivot_index:\\n return nums[k]\\n elif k < pivot_index:\\n return quickselect(l, pivot_index - 1, k)\\n else:\\n return quickselect(pivot_index + 1, r, k)\\n\\n def partition(l, r, pivot_index):\\n \\\"\\\"\\\"Partition the array around the pivot.\\\"\\\"\\\"\\n pivot_value = nums[pivot_index]\\n nums[pivot_index], nums[r] = nums[r], nums[pivot_index]\\n store_index = l\\n\\n for i in range(l, r):\\n if nums[i] < pivot_value:\\n nums[store_index], nums[i] = nums[i], nums[store_index]\\n store_index += 1\\n\\n nums[store_index], nums[r] = nums[r], nums[store_index]\\n return store_index\\n\\n # Step 1: Find the median using quickselect\\n mid_index = n // 2\\n median = quickselect(0, n - 1, mid_index)\\n\\n # Step 2: Virtual indexing function (equivalent to A(i) in the C++ code)\\n def virtual_index(i):\\n return (1 + 2 * i) % (n | 1)\\n\\n # Step 3: Three-way partitioning to wiggle-sort the array in O(n) time\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[virtual_index(j)] > median:\\n nums[virtual_index(i)], nums[virtual_index(j)] = nums[virtual_index(j)], nums[virtual_index(i)]\\n i += 1\\n j += 1\\n elif nums[virtual_index(j)] < median:\\n nums[virtual_index(j)], nums[virtual_index(k)] = nums[virtual_index(k)], nums[virtual_index(j)]\\n k -= 1\\n else:\\n j += 1\\n\\n\\n \",\n \"runtime\": \"606\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n\\n def findMedian(nums):\\n def selectKth(nums, k):\\n def partition(left, right, pivot_index):\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot:\\n nums[store_index], nums[i] = nums[i], nums[store_index]\\n store_index += 1\\n nums[right], nums[store_index] = nums[store_index], nums[right]\\n return store_index\\n\\n left, right = 0, len(nums) - 1\\n while True:\\n pivot_index = (left + right) // 2\\n pivot_index = partition(left, right, pivot_index)\\n if k == pivot_index:\\n return nums[k]\\n elif k < pivot_index:\\n right = pivot_index - 1\\n else:\\n left = pivot_index + 1\\n\\n n = len(nums)\\n mid = (n + 1) // 2 - 1\\n return selectKth(nums.copy(), mid)\\n\\n def threeWayPartition(nums, median):\\n i, j, k = 0, 0, len(nums) - 1\\n while j <= k:\\n if nums[j] > median:\\n nums[j], nums[k] = nums[k], nums[j]\\n k -= 1\\n elif nums[j] < median:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 1\\n j += 1\\n else:\\n j += 1\\n\\n def virtualIndex(i, n):\\n return (1 + 2 * i) % (n | 1)\\n\\n n = len(nums)\\n median = findMedian(nums)\\n threeWayPartition(nums, median)\\n\\n result = [0] * n\\n left, right = (n - 1) // 2, n - 1\\n for i in range(n):\\n if i % 2 == 0:\\n result[i] = nums[left]\\n left -= 1\\n else:\\n result[i] = nums[right]\\n right -= 1\\n\\n for i in range(n):\\n nums[i] = result[i]\",\n \"runtime\": \"622\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n def quickselect(k):\\n def partition(left, right, pivot_index):\\n pivot_value = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n store_index = left\\n for i in range(left, right):\\n if nums[i] < pivot_value:\\n nums[store_index], nums[i] = nums[i], nums[store_index]\\n store_index += 1\\n nums[right], nums[store_index] = nums[store_index], nums[right]\\n return store_index\\n \\n left, right = 0, len(nums) - 1\\n while True:\\n pivot_index = (left + right) // 2\\n pivot_index = partition(left, right, pivot_index)\\n if pivot_index == k:\\n return nums[k]\\n elif pivot_index < k:\\n left = pivot_index + 1\\n else:\\n right = pivot_index - 1\\n\\n n = len(nums)\\n median = quickselect((n - 1) // 2)\\n \\n def virtual_index(i):\\n return (2 * i + 1) % (n | 1)\\n\\n left, right, i = 0, n - 1, 0\\n while i <= right:\\n if nums[virtual_index(i)] > median:\\n nums[virtual_index(left)], nums[virtual_index(i)] = nums[virtual_index(i)], nums[virtual_index(left)]\\n left += 1\\n i += 1\\n elif nums[virtual_index(i)] < median:\\n nums[virtual_index(right)], nums[virtual_index(i)] = nums[virtual_index(i)], nums[virtual_index(right)]\\n right -= 1\\n else:\\n i += 1\\n\",\n \"runtime\": \"637\"\n },\n {\n \"code\": \"# Inspired by https://leetcode.com/problems/wiggle-sort-ii/discuss/77677/O(n)%2BO(1)-after-median-Virtual-Indexing\\nclass Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n mid = len(nums) // 2\\n def quickselect(arr, lo, hi, k):\\n pivot = random.randint(lo, hi)\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n pivot = lo\\n for i in range(lo, hi):\\n if arr[i] < arr[hi]:\\n arr[i], arr[pivot] = arr[pivot], arr[i]\\n pivot += 1\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n if k == pivot:\\n return arr[pivot]\\n elif k < pivot:\\n return quickselect(arr, lo, pivot-1, k)\\n else:\\n return quickselect(arr, pivot+1, hi, k)\\n median = quickselect(nums, 0, len(nums)-1, mid)\\n \\n # virtual index\\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\\n i, j, k = 0, 0, len(nums) - 1\\n while j <= k:\\n if nums[vi(j)] < median:\\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\\n k -= 1\\n elif nums[vi(j)] > median:\\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\\n i += 1\\n j += 1\\n else:\\n j += 1\",\n \"runtime\": \"653\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n def naive():\\n nums.sort()\\n cp = nums.copy()\\n j = 0\\n n = len(nums)\\n \\n # occupy the smallest even indices possible if they come from the S group and will take the largest odd indices possible if they are from the L group, then none of them will be neighbors of others\\n # largest in back\\n for i in range(n - 1 - ((n-1)%2), -1, -2):\\n nums[i] = cp[j]\\n j += 1\\n for i in range(n - 1 - (n%2), -1, -2):\\n nums[i] = cp[j]\\n j += 1\\n\\n def quickselect():\\n n = len(nums)\\n m = (n + 1) // 2\\n median = kthSmallestNumber(nums, m)\\n lt = []\\n eq = []\\n gt = []\\n for i in range(0, n):\\n if nums[i] < median:\\n lt.append(nums[i])\\n elif nums[i] == median:\\n eq.append(nums[i])\\n else:\\n gt.append(nums[i])\\n cp = lt + eq + gt\\n j = 0\\n \\n for i in range(n - 1 - ((n-1)%2), -1, -2):\\n nums[i] = cp[j]\\n j += 1\\n for i in range(n - 1 - (n%2), -1, -2):\\n nums[i] = cp[j]\\n j += 1\\n\\n return nums\\n\\n def kthSmallestNumber(nums, k):\\n m = (len(nums) + 1) // 2\\n for i in range(0, len(nums)-1):\\n si = random.randint(0, i+1)\\n nums[i], nums[si] = nums[si], nums[i]\\n l, r = 0, len(nums) - 1\\n k -= 1 # to 0 based\\n while l < r:\\n median = getMiddle(nums, l, r)\\n\\n if median < k:\\n l = median + 1\\n elif median > k:\\n r = median - 1\\n else:\\n break\\n\\n return nums[k]\\n\\n\\n\\n def getMiddle(nums, lo, hi):\\n i = lo\\n for j in range(lo+1, hi+1):\\n if nums[j] < nums[lo]:\\n i+=1\\n nums[i], nums[j] = nums[j], nums[i]\\n nums[i], nums[lo] = nums[lo], nums[i]\\n return i\\n\\n \\n # def quickSelect for O(n)\\n \\n quickselect()\",\n \"runtime\": \"668\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n n = len(nums)\\n mid = len(nums) //2\\n def quick(arr,lo,hi,k):\\n pivot = random.randint(lo,hi)\\n arr[pivot],arr[hi] = arr[hi],arr[pivot]\\n pivot = lo\\n for i in range(lo,hi):\\n if arr[i] < arr[hi]:\\n arr[i],arr[pivot] = arr[pivot],arr[i]\\n pivot += 1\\n arr[pivot],arr[hi] = arr[hi],arr[pivot]\\n if k == pivot:\\n return arr[pivot]\\n elif k < pivot:\\n return quick(arr,lo,pivot-1,k)\\n else:\\n return quick(arr,pivot+1,hi,k)\\n median = quick(nums,0,n-1,mid)\\n # virtual index\\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\\n i, j, k = 0, 0, len(nums) - 1\\n while j <= k:\\n if nums[vi(j)] < median:\\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\\n k -= 1\\n elif nums[vi(j)] > median:\\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\\n i += 1\\n j += 1\\n else:\\n j += 1\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \",\n \"runtime\": \"683\"\n },\n {\n \"code\": \"# Inspired by https://leetcode.com/problems/wiggle-sort-ii/discuss/77677/O(n)%2BO(1)-after-median-Virtual-Indexing\\nclass Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n mid = len(nums) // 2\\n def quickselect(arr, lo, hi, k):\\n pivot = random.randint(lo, hi)\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n pivot = lo\\n for i in range(lo, hi):\\n if arr[i] < arr[hi]:\\n arr[i], arr[pivot] = arr[pivot], arr[i]\\n pivot += 1\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n if k == pivot:\\n return arr[pivot]\\n elif k < pivot:\\n return quickselect(arr, lo, pivot-1, k)\\n else:\\n return quickselect(arr, pivot+1, hi, k)\\n median = quickselect(nums, 0, len(nums)-1, mid)\\n \\n # virtual index\\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\\n i, j, k = 0, 0, len(nums) - 1\\n while j <= k:\\n if nums[vi(j)] < median:\\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\\n k -= 1\\n elif nums[vi(j)] > median:\\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\\n i += 1\\n j += 1\\n else:\\n j += 1\",\n \"runtime\": \"699\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n mid = len(nums) // 2\\n def quickselect(arr, lo, hi, k):\\n pivot = random.randint(lo, hi)\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n pivot = lo\\n for i in range(lo, hi):\\n if arr[i] < arr[hi]:\\n arr[i], arr[pivot] = arr[pivot], arr[i]\\n pivot += 1\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n if k == pivot:\\n return arr[pivot]\\n elif k < pivot:\\n return quickselect(arr, lo, pivot-1, k)\\n else:\\n return quickselect(arr, pivot+1, hi, k)\\n median = quickselect(nums, 0, len(nums)-1, mid)\\n \\n # virtual index\\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\\n i, j, k = 0, 0, len(nums) - 1\\n while j <= k:\\n if nums[vi(j)] < median:\\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\\n k -= 1\\n elif nums[vi(j)] > median:\\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\\n i += 1\\n j += 1\\n else:\\n j += 1\",\n \"runtime\": \"714\"\n },\n {\n \"code\": \"class Solution:\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n mid = len(nums) // 2\\n def quickselect(arr, lo, hi, k):\\n pivot = random.randint(lo, hi)\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n pivot = lo\\n for i in range(lo, hi):\\n if arr[i] < arr[hi]:\\n arr[i], arr[pivot] = arr[pivot], arr[i]\\n pivot += 1\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n if k == pivot:\\n return arr[pivot]\\n elif k < pivot:\\n return quickselect(arr, lo, pivot-1, k)\\n else:\\n return quickselect(arr, pivot+1, hi, k)\\n median = quickselect(nums, 0, len(nums)-1, mid)\\n \\n # virtual index\\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\\n i, j, k = 0, 0, len(nums) - 1\\n while j <= k:\\n if nums[vi(j)] < median:\\n nums[vi(j)], nums[vi(k)] = nums[vi(k)], nums[vi(j)]\\n k -= 1\\n elif nums[vi(j)] > median:\\n nums[vi(j)], nums[vi(i)] = nums[vi(i)], nums[vi(j)]\\n i += 1\\n j += 1\\n else:\\n j += 1\",\n \"runtime\": \"730\"\n },\n {\n \"code\": \"class Solution:\\n\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n mid = len(nums) // 2\\n def quickselect(arr, lo, hi, k):\\n pivot = random.randint(lo, hi)\\n arr[pivot], arr[hi] = arr[hi], arr[pivot]\\n p = lo\\n for i in range(lo, hi):\\n if arr[i] < arr[hi]:\\n arr[i], arr[p] = arr[p], arr[i]\\n p += 1\\n arr[p], arr[hi] = arr[hi], arr[p]\\n if p == k:\\n return arr[p]\\n elif p > k:\\n return quickselect(arr, lo, p-1, k)\\n else:\\n return quickselect(arr, p+1, hi, k)\\n\\n median = quickselect(nums, 0, len(nums)-1, mid)\\n \\n # virtual index\\n vi = lambda x: x * 2 + 1 if x < mid else (x - mid) * 2\\n l, p, r = 0, 0, len(nums) - 1\\n while p <= r:\\n if nums[vi(p)] < median:\\n nums[vi(p)], nums[vi(r)] = nums[vi(r)], nums[vi(p)]\\n r -= 1\\n elif nums[vi(p)] > median:\\n nums[vi(p)], nums[vi(l)] = nums[vi(l)], nums[vi(p)]\\n l += 1\\n p += 1\\n else:\\n p += 1\",\n \"runtime\": \"745\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":52,"string":"52"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort() # in place Nlog(N)\n N = len(nums)\n medianidx = N // 2 # \n if N % 2 == 0:\n nums[::2], nums[1::2] = nums[:medianidx][::-1], nums[medianidx:][::-1]\n else:\n nums[::2], nums[1::2] = nums[:medianidx + 1][::-1], nums[medianidx + 1:][::-1]\n\n \n \n ","memory":"18900"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n med = (len(nums) + 1) // 2\n nums[::2], nums[1::2] = nums[:med][::-1], nums[med:][::-1]","memory":"19000"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not numsurn anything, modify nums in-place instead.\n approaches:\n 1. brute force:\n all \n 2. sort, break down in half, merge\n\n [1 2 3 4 5 6]\n l r\n \"\"\"\n\n cop = nums.copy()\n cop.sort()\n median = len(nums)//2 if len(nums)%2==0 else len(nums)//2+1\n smaller = cop[:median]\n larger = cop[median:]\n l = len(smaller)-1\n r = len(larger)-1\n\n for i in range(len(nums)):\n if i%2==0:\n nums[i]=smaller[l]\n l-=1\n else:\n nums[i] = larger[r]\n r-=1\n \n \n \n \n ","memory":"19100"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Find the median using QuickSelect\n def find_median(nums):\n def partition(nums, left, right):\n pivot_index = (left + right) // 2\n pivot = nums[pivot_index]\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\n i = left\n for j in range(left, right):\n if nums[j] <= pivot:\n nums[i], nums[j] = nums[j], nums[i]\n i += 1\n nums[i], nums[right] = nums[right], nums[i]\n return i\n\n def quickselect(nums, k):\n left, right = 0, len(nums) - 1\n while left <= right:\n pivot_index = partition(nums, left, right)\n if pivot_index == k:\n return nums[k]\n elif pivot_index < k:\n left = pivot_index + 1\n else:\n right = pivot_index - 1\n\n return quickselect(nums, len(nums) // 2)\n\n # Three-way partition around the median\n def three_way_partition(nums, median):\n def virtual_index(i, n):\n return (1 + 2 * i) % (n | 1)\n\n n = len(nums)\n median_index = nums.index(median)\n nums[median_index], nums[-1] = nums[-1], nums[median_index]\n i, j, k = 0, 0, n - 1\n while j <= k:\n if nums[virtual_index(j, n)] > median:\n nums[virtual_index(i, n)], nums[virtual_index(j, n)] = nums[virtual_index(j, n)], nums[virtual_index(i, n)]\n i += 1\n j += 1\n elif nums[virtual_index(j, n)] < median:\n nums[virtual_index(j, n)], nums[virtual_index(k, n)] = nums[virtual_index(k, n)], nums[virtual_index(j, n)]\n k -= 1\n else:\n j += 1\n\n # Main function\n median = find_median(nums)\n three_way_partition(nums, median)\n\n# Example usage:\nsolution = Solution()\nnums = [1, 5, 1, 1, 6, 4]\nsolution.wiggleSort(nums)\nprint(nums) # Output: [1, 6, 1, 5, 1, 4] or [1, 4, 1, 5, 1, 6]","memory":"19200"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n nums.sort()\n size = len(nums)\n middle = size // 2\n is_pair = size % 2 == 0\n\n p0 = middle - 1 if is_pair else middle\n p1 = size - 1\n\n ans = []\n while len(ans) != size:\n ans.append(nums[p0])\n p0 -= 1\n\n if len(ans) == size:\n break\n\n ans.append(nums[p1])\n p1 -= 1\n \n for i in range(size):\n nums[i] = ans[i]\n\n\n\n\n\n\n\n","memory":"19300"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n A = sorted(nums)\n n = len(nums)\n \n for i in range(1,n,2): nums[i] = A.pop()\n for i in range(0,n,2): nums[i] = A.pop() \n \n ","memory":"19400"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n half = len(nums[::2])\n nums[::2], nums[1::2] = nums[:half][::-1], nums[half:][::-1]\n\n","memory":"19400"},{"code":"class Solution:\n def wiggleSort(self, nums: list[int]) -> None:\n # Sort the numbers\n nums.sort()\n n = len(nums)\n \n # Create a new array to hold the rearranged elements\n sorted_nums = nums[:]\n \n # Rearrange the elements\n # Use two pointers to fill the elements\n left, right = (n - 1) // 2, n - 1\n for i in range(n):\n if i % 2 == 0:\n nums[i] = sorted_nums[left]\n left -= 1\n else:\n nums[i] = sorted_nums[right]\n right -= 1\n\n# Example usage:\nsol = Solution()\n\nnums1 = [1, 5, 1, 1, 6, 4]\nsol.wiggleSort(nums1)\nprint(nums1) # Output: [1, 6, 1, 5, 1, 4] or similar valid wiggle sort\n\nnums2 = [1, 3, 2, 2, 3, 1]\nsol.wiggleSort(nums2)\nprint(nums2) # Output: [2, 3, 1, 3, 1, 2] or similar valid wiggle sort\n\nnums3 = [4, 5, 5, 6]\nsol.wiggleSort(nums3)\nprint(nums3) # Output: [5, 6, 4, 5] or similar valid wiggle sort\n","memory":"19700"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n \n nums_sorted = self.__mergeSort(nums)\n\n n = len(nums)\n\n left = nums_sorted[:n//2+n%2]\n\n right = nums_sorted[n//2+n%2:]\n\n i = len(left) - 1\n\n j = len(right) - 1\n\n for index in range(n):\n\n if index % 2 == 0:\n\n nums[index] = left[i]\n\n i -= 1\n\n else:\n\n nums[index] = right[j]\n\n j -= 1\n\n\n def __mergeSort(self,nums):\n\n if len(nums) < 2:\n\n return nums\n\n left = self.__mergeSort(nums[:len(nums)//2])\n\n right = self.__mergeSort(nums[len(nums)//2:])\n\n new_nums = []\n\n m = len(left)\n\n n = len(right)\n\n i = 0\n\n j = 0\n\n while i < m and j < n:\n\n if left[i] < right[j]:\n\n new_nums.append(left[i])\n\n i += 1\n\n else:\n\n new_nums.append(right[j])\n\n j += 1\n\n while i < m:\n\n new_nums.append(left[i])\n\n i += 1\n\n while j < n:\n\n new_nums.append(right[j])\n\n j += 1\n\n return new_nums\n ","memory":"19800"},{"code":"from copy import deepcopy as dc\nclass Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n nums.sort()\n n = len(nums)\n mid = (n+1)//2\n l,r=mid-1,n-1\n i=0\n opt=[]\n \n while(i<n):\n \n if i%2==0:\n \n opt.append(nums[l])\n l-=1\n else:\n \n opt.append(nums[r])\n r-=1\n i+=1\n nums[:]=dc(opt)\n \n","memory":"19800"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n nums.sort()\n\n middle = len(nums) // 2\n p0, p1 = middle, len(nums) - 1\n \n is_pair = len(nums) % 2 == 0\n if is_pair:\n p0 -= 1\n\n ans = []\n while len(ans) != len(nums):\n print(p0, p1)\n\n ans.append(nums[p0])\n p0 -= 1\n\n if len(ans) == len(nums):\n break\n\n ans.append(nums[p1])\n p1 -= 1\n \n for i in range(len(nums)):\n nums[i] = ans[i]\n\n\n\n\n\n\n\n","memory":"19900"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n nums.sort()\n n = len(nums)\n mid = (n + 1) // 2\n \n left = nums[:mid]\n right = nums[mid:]\n \n for i in range(n):\n if i % 2 == 0:\n nums[i] = left.pop()\n else:\n nums[i] = right.pop()\n","memory":"20000"},{"code":"class Solution:\n def wiggleSort(self, nums: List[int]) -> None:\n \"\"\"\n Do not return anything, modify nums in-place instead.\n \"\"\"\n # Step 1: Sort the array\n nums.sort()\n\n # Step 2: Partition the array into two halves\n mid = (len(nums) + 1) // 2\n left = nums[:mid][::-1] # First half, reversed\n right = nums[mid:][::-1] # Second half, reversed\n\n # Step 3: Place the largest half into odd indices and smallest half into even\n for i in range(len(nums)):\n if i % 2 == 0:\n nums[i] = left.pop(0)\n else:\n nums[i] = right.pop(0)\n\n #for actual wiggle sort question\n # #O(n)O(1) bubble sort/greedy, only move each item once so linear\n # #check with previous index\n # for i in range(1,len(nums)):\n # #even\n # if i%2==0 and nums[i-1] <= nums[i]:\n # nums[i],nums[i-1] = nums[i-1],nums[i]\n # #odd\n # elif nums[i-1] >= nums[i]:\n # nums[i],nums[i-1] = nums[i-1],nums[i]\n","memory":"20100"}],"string":"[\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort() # in place Nlog(N)\\n N = len(nums)\\n medianidx = N // 2 # \\n if N % 2 == 0:\\n nums[::2], nums[1::2] = nums[:medianidx][::-1], nums[medianidx:][::-1]\\n else:\\n nums[::2], nums[1::2] = nums[:medianidx + 1][::-1], nums[medianidx + 1:][::-1]\\n\\n \\n \\n \",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n med = (len(nums) + 1) // 2\\n nums[::2], nums[1::2] = nums[:med][::-1], nums[med:][::-1]\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not numsurn anything, modify nums in-place instead.\\n approaches:\\n 1. brute force:\\n all \\n 2. sort, break down in half, merge\\n\\n [1 2 3 4 5 6]\\n l r\\n \\\"\\\"\\\"\\n\\n cop = nums.copy()\\n cop.sort()\\n median = len(nums)//2 if len(nums)%2==0 else len(nums)//2+1\\n smaller = cop[:median]\\n larger = cop[median:]\\n l = len(smaller)-1\\n r = len(larger)-1\\n\\n for i in range(len(nums)):\\n if i%2==0:\\n nums[i]=smaller[l]\\n l-=1\\n else:\\n nums[i] = larger[r]\\n r-=1\\n \\n \\n \\n \\n \",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Find the median using QuickSelect\\n def find_median(nums):\\n def partition(nums, left, right):\\n pivot_index = (left + right) // 2\\n pivot = nums[pivot_index]\\n nums[pivot_index], nums[right] = nums[right], nums[pivot_index]\\n i = left\\n for j in range(left, right):\\n if nums[j] <= pivot:\\n nums[i], nums[j] = nums[j], nums[i]\\n i += 1\\n nums[i], nums[right] = nums[right], nums[i]\\n return i\\n\\n def quickselect(nums, k):\\n left, right = 0, len(nums) - 1\\n while left <= right:\\n pivot_index = partition(nums, left, right)\\n if pivot_index == k:\\n return nums[k]\\n elif pivot_index < k:\\n left = pivot_index + 1\\n else:\\n right = pivot_index - 1\\n\\n return quickselect(nums, len(nums) // 2)\\n\\n # Three-way partition around the median\\n def three_way_partition(nums, median):\\n def virtual_index(i, n):\\n return (1 + 2 * i) % (n | 1)\\n\\n n = len(nums)\\n median_index = nums.index(median)\\n nums[median_index], nums[-1] = nums[-1], nums[median_index]\\n i, j, k = 0, 0, n - 1\\n while j <= k:\\n if nums[virtual_index(j, n)] > median:\\n nums[virtual_index(i, n)], nums[virtual_index(j, n)] = nums[virtual_index(j, n)], nums[virtual_index(i, n)]\\n i += 1\\n j += 1\\n elif nums[virtual_index(j, n)] < median:\\n nums[virtual_index(j, n)], nums[virtual_index(k, n)] = nums[virtual_index(k, n)], nums[virtual_index(j, n)]\\n k -= 1\\n else:\\n j += 1\\n\\n # Main function\\n median = find_median(nums)\\n three_way_partition(nums, median)\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 5, 1, 1, 6, 4]\\nsolution.wiggleSort(nums)\\nprint(nums) # Output: [1, 6, 1, 5, 1, 4] or [1, 4, 1, 5, 1, 6]\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n nums.sort()\\n size = len(nums)\\n middle = size // 2\\n is_pair = size % 2 == 0\\n\\n p0 = middle - 1 if is_pair else middle\\n p1 = size - 1\\n\\n ans = []\\n while len(ans) != size:\\n ans.append(nums[p0])\\n p0 -= 1\\n\\n if len(ans) == size:\\n break\\n\\n ans.append(nums[p1])\\n p1 -= 1\\n \\n for i in range(size):\\n nums[i] = ans[i]\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n A = sorted(nums)\\n n = len(nums)\\n \\n for i in range(1,n,2): nums[i] = A.pop()\\n for i in range(0,n,2): nums[i] = A.pop() \\n \\n \",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n half = len(nums[::2])\\n nums[::2], nums[1::2] = nums[:half][::-1], nums[half:][::-1]\\n\\n\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: list[int]) -> None:\\n # Sort the numbers\\n nums.sort()\\n n = len(nums)\\n \\n # Create a new array to hold the rearranged elements\\n sorted_nums = nums[:]\\n \\n # Rearrange the elements\\n # Use two pointers to fill the elements\\n left, right = (n - 1) // 2, n - 1\\n for i in range(n):\\n if i % 2 == 0:\\n nums[i] = sorted_nums[left]\\n left -= 1\\n else:\\n nums[i] = sorted_nums[right]\\n right -= 1\\n\\n# Example usage:\\nsol = Solution()\\n\\nnums1 = [1, 5, 1, 1, 6, 4]\\nsol.wiggleSort(nums1)\\nprint(nums1) # Output: [1, 6, 1, 5, 1, 4] or similar valid wiggle sort\\n\\nnums2 = [1, 3, 2, 2, 3, 1]\\nsol.wiggleSort(nums2)\\nprint(nums2) # Output: [2, 3, 1, 3, 1, 2] or similar valid wiggle sort\\n\\nnums3 = [4, 5, 5, 6]\\nsol.wiggleSort(nums3)\\nprint(nums3) # Output: [5, 6, 4, 5] or similar valid wiggle sort\\n\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n \\n nums_sorted = self.__mergeSort(nums)\\n\\n n = len(nums)\\n\\n left = nums_sorted[:n//2+n%2]\\n\\n right = nums_sorted[n//2+n%2:]\\n\\n i = len(left) - 1\\n\\n j = len(right) - 1\\n\\n for index in range(n):\\n\\n if index % 2 == 0:\\n\\n nums[index] = left[i]\\n\\n i -= 1\\n\\n else:\\n\\n nums[index] = right[j]\\n\\n j -= 1\\n\\n\\n def __mergeSort(self,nums):\\n\\n if len(nums) < 2:\\n\\n return nums\\n\\n left = self.__mergeSort(nums[:len(nums)//2])\\n\\n right = self.__mergeSort(nums[len(nums)//2:])\\n\\n new_nums = []\\n\\n m = len(left)\\n\\n n = len(right)\\n\\n i = 0\\n\\n j = 0\\n\\n while i < m and j < n:\\n\\n if left[i] < right[j]:\\n\\n new_nums.append(left[i])\\n\\n i += 1\\n\\n else:\\n\\n new_nums.append(right[j])\\n\\n j += 1\\n\\n while i < m:\\n\\n new_nums.append(left[i])\\n\\n i += 1\\n\\n while j < n:\\n\\n new_nums.append(right[j])\\n\\n j += 1\\n\\n return new_nums\\n \",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"from copy import deepcopy as dc\\nclass Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n nums.sort()\\n n = len(nums)\\n mid = (n+1)//2\\n l,r=mid-1,n-1\\n i=0\\n opt=[]\\n \\n while(i<n):\\n \\n if i%2==0:\\n \\n opt.append(nums[l])\\n l-=1\\n else:\\n \\n opt.append(nums[r])\\n r-=1\\n i+=1\\n nums[:]=dc(opt)\\n \\n\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n nums.sort()\\n\\n middle = len(nums) // 2\\n p0, p1 = middle, len(nums) - 1\\n \\n is_pair = len(nums) % 2 == 0\\n if is_pair:\\n p0 -= 1\\n\\n ans = []\\n while len(ans) != len(nums):\\n print(p0, p1)\\n\\n ans.append(nums[p0])\\n p0 -= 1\\n\\n if len(ans) == len(nums):\\n break\\n\\n ans.append(nums[p1])\\n p1 -= 1\\n \\n for i in range(len(nums)):\\n nums[i] = ans[i]\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n nums.sort()\\n n = len(nums)\\n mid = (n + 1) // 2\\n \\n left = nums[:mid]\\n right = nums[mid:]\\n \\n for i in range(n):\\n if i % 2 == 0:\\n nums[i] = left.pop()\\n else:\\n nums[i] = right.pop()\\n\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def wiggleSort(self, nums: List[int]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify nums in-place instead.\\n \\\"\\\"\\\"\\n # Step 1: Sort the array\\n nums.sort()\\n\\n # Step 2: Partition the array into two halves\\n mid = (len(nums) + 1) // 2\\n left = nums[:mid][::-1] # First half, reversed\\n right = nums[mid:][::-1] # Second half, reversed\\n\\n # Step 3: Place the largest half into odd indices and smallest half into even\\n for i in range(len(nums)):\\n if i % 2 == 0:\\n nums[i] = left.pop(0)\\n else:\\n nums[i] = right.pop(0)\\n\\n #for actual wiggle sort question\\n # #O(n)O(1) bubble sort/greedy, only move each item once so linear\\n # #check with previous index\\n # for i in range(1,len(nums)):\\n # #even\\n # if i%2==0 and nums[i-1] <= nums[i]:\\n # nums[i],nums[i-1] = nums[i-1],nums[i]\\n # #odd\\n # elif nums[i-1] >= nums[i]:\\n # nums[i],nums[i-1] = nums[i-1],nums[i]\\n\",\n \"memory\": \"20100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":13,"string":"13"}}},{"rowIdx":254,"cells":{"question_id":{"kind":"number","value":326,"string":"326"},"name":{"kind":"string","value":"power-of-three"},"content":{"kind":"string","value":"<p>Given an integer <code>n</code>, return <em><code>true</code> if it is a power of three. Otherwise, return <code>false</code></em>.</p>\n\n<p>An integer <code>n</code> is a power of three, if there exists an integer <code>x</code> such that <code>n == 3<sup>x</sup></code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 27\n<strong>Output:</strong> true\n<strong>Explanation:</strong> 27 = 3<sup>3</sup>\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 0\n<strong>Output:</strong> false\n<strong>Explanation:</strong> There is no x where 3<sup>x</sup> = 0.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = -1\n<strong>Output:</strong> false\n<strong>Explanation:</strong> There is no x where 3<sup>x</sup> = (-1).\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>-2<sup>31</sup> <= n <= 2<sup>31</sup> - 1</code></li>\n</ul>\n\n<p> </p>\n<strong>Follow up:</strong> Could you solve it without loops/recursion?"},"acRate":{"kind":"number","value":47.053169018538114,"string":"47.053169"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["math","recursion"],"string":"[\n \"math\",\n \"recursion\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"30\", 0.0728], [\"31\", 0.0728], [\"32\", 0.0182], [\"33\", 0.0728], [\"34\", 0.0546], [\"35\", 0.2002], [\"36\", 0.2184], [\"37\", 0.1092], [\"38\", 0.2548], [\"39\", 0.4914], [\"41\", 0.3822], [\"42\", 0.2912], [\"43\", 0.4914], [\"44\", 0.9647], [\"45\", 1.0739], [\"46\", 0.9101], [\"47\", 1.2559], [\"48\", 1.802], [\"49\", 1.7292], [\"50\", 1.3287], [\"51\", 2.1296], [\"52\", 2.5846], [\"53\", 2.0204], [\"54\", 2.0932], [\"55\", 2.9487], [\"56\", 3.5857], [\"57\", 3.5675], [\"58\", 2.6028], [\"59\", 3.0943], [\"60\", 3.5857], [\"62\", 3.2763], [\"63\", 2.5846], [\"64\", 3.8406], [\"65\", 3.4037], [\"66\", 3.2217], [\"67\", 2.4026], [\"68\", 2.8759], [\"69\", 3.1125], [\"70\", 2.3844], [\"71\", 2.4026], [\"72\", 2.1478], [\"73\", 2.1842], [\"74\", 1.6746], [\"75\", 1.3287], [\"76\", 1.4015], [\"77\", 1.4379], [\"78\", 1.1649], [\"79\", 0.8191], [\"80\", 0.9283], [\"81\", 0.8919], [\"83\", 0.8919], [\"84\", 0.6917], [\"85\", 0.7645], [\"86\", 0.6553], [\"87\", 0.4186], [\"88\", 0.5096], [\"89\", 0.6189], [\"90\", 0.6189], [\"91\", 0.3458], [\"92\", 0.4186], [\"93\", 0.8372], [\"94\", 0.3276], [\"95\", 0.2548], [\"96\", 0.273], [\"97\", 0.364], [\"98\", 0.2548], [\"99\", 0.2912], [\"100\", 0.2184], [\"101\", 0.4186], [\"102\", 0.2912], [\"104\", 0.2366], [\"105\", 0.2366], [\"106\", 0.2912], [\"107\", 0.1274], [\"108\", 0.2366], [\"109\", 0.1638], [\"110\", 0.2184], [\"111\", 0.091], [\"112\", 0.2002], [\"113\", 0.182]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15800\", 0.0182], [\"16000\", 0.0182], [\"16100\", 0.0182], [\"16200\", 0.1274], [\"16300\", 0.6553], [\"16400\", 8.9916], [\"16500\", 39.6432], [\"16600\", 43.0288]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n flag = True\n if n == 0:\n return False\n while flag:\n if n == 1:\n return True\n if n % 3 != 0:\n return False\n n = n // 3\n","runtime":"30"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n>0 and 3**19%n==0:\n return True\n return False\n \n ","runtime":"30"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n while n%3==0:\n n//=3\n return n==1","runtime":"31"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return n > 0 and (3 ** 19) % n == 0\n \n","runtime":"32"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n >= 3:\n n /= 3\n return n == 1\n\n # if n == 0:\n # return False\n # if n == 3:\n # return True\n \n # return self.isPowerOfThree(n / 3)","runtime":"33"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n while n % 3 == 0:\n n = n / 3\n return n == 1","runtime":"34"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n while n > 1 and n%3 == 0:\n n //= 3\n \n return n == 1","runtime":"35"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n while n > 1 and n%3 == 0:\n n //= 3\n \n return n == 1","runtime":"35"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n if n <= 0:\n return False\n\n while n % 3 == 0:\n n //= 3\n \n return n == 1\n \n return n == 1\n ","runtime":"36"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n while n%3==0:\n n/=3\n return n==1\n \n\n ","runtime":"37"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n > 0:\n while n > 1:\n test = n%3\n n/=3\n if test!=0: return False\n return True\n return False\n","runtime":"38"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n > 2:\n if n % 3:\n return False\n n //= 3\n return n == 1","runtime":"39"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n return 1162261467 % n == 0","runtime":"39"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n largest = 3**19\n return n > 0 and largest % n == 0","runtime":"41"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True\n while n:\n if n%3!=0:\n return False\n n=n/3\n if n==1:\n return True\n return False\n \n ","runtime":"42"},{"code":"\nclass Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n m = int(math.log(n)/math.log(3)+.000000001)\n return n == 3**m","runtime":"43"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n x = 3\n if (n == 1):\n # print('yes')\n return True\n if (n%x != 0) | (n==0) :\n return False\n n = n/x\n return self.isPowerOfThree(n)\n ","runtime":"44"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n # The largest power of three that fits in a 32-bit integer\n m = 1162261467 # 3^19\n \n # n must be a positive integer and divide 1162261467 evenly to be a power of three\n return n > 0 and m % n == 0\n","runtime":"45"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n == 1:\n return True\n if n<=0 or n%3 !=0:\n return False\n \n return self.isPowerOfThree(n//3)\n\n \n\n ","runtime":"46"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n \n while n % 3 == 0:\n n /= 3\n \n return n == 1","runtime":"46"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n if n == 1:\n return True\n if n % 3 != 0:\n return False\n return self.isPowerOfThree(n//3)\n \n \n \n ","runtime":"47"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return n>0 and 1162261467%n == 0\n ","runtime":"47"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n while n % 3 == 0:\n n //= 3\n return n == 1\n\n\n ","runtime":"48"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n \n # Continuously divide n by 3 if it's divisible\n while n % 3 == 0:\n n //= 3\n \n # If we end up with 1, then n was a power of three\n return n == 1\n\n# Example usage:\nsol = Solution()\n\nprint(sol.isPowerOfThree(27)) # Output: True\nprint(sol.isPowerOfThree(0)) # Output: False\nprint(sol.isPowerOfThree(-1)) # Output: False\nprint(sol.isPowerOfThree(9)) # Output: True\nprint(sol.isPowerOfThree(45)) # Output: False\nprint(sol.isPowerOfThree(2187)) # Output: True\n","runtime":"48"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n == 1:\n return True\n if n <= 0 or n % 3:\n return False\n return self.isPowerOfThree(n // 3)","runtime":"49"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n >= 3:\n if n%3 == 0:\n n = n/3 \n continue\n else:\n return False\n if n == 1:\n return True\n return False","runtime":"49"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n != abs(n) or not n:\n return False\n if n == 1:\n return True\n while not n % 3:\n if n == 3:\n return True\n n //= 3\n else:\n return False","runtime":"50"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n while n > 1:\n n = n / 3\n \n return n == 1","runtime":"50"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n def pow(n):\n if n==0:\n return False\n if n==1:\n return True\n return n%3==0 and pow(n/3)\n return pow(n)","runtime":"51"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n >= 3:\n if n%3 == 0:\n n = n/3 \n continue\n else:\n return False\n if n == 1:\n return True\n return False","runtime":"51"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0: return False\n while n%3==0:\n n//=3\n return n==1\n ","runtime":"52"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if(n<1):\n return False\n while(n>1):\n if(n!=1 and n%3!=0):\n return False\n n=n//3\n if(n==1):\n return True\n return False\n ","runtime":"53"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return n > 0 and 1162261467 % n == 0","runtime":"54"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n >= 3:\n if n%3 == 0:\n n = n/3 \n continue\n else:\n return False\n if n == 1:\n return True\n return False","runtime":"54"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n < 1:\n return False\n if n == 1:\n return True\n if n%3 == 2 or n%3 == 1:\n return False\n return self.isPowerOfThree(n/3)\n ","runtime":"55"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True\n elif n%3!=0 or n<=0:\n return False\n else:\n return self.isPowerOfThree(n/3)","runtime":"55"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n if n == 1:\n return True\n return (n % 3 == 0) and self.isPowerOfThree(n // 3)","runtime":"56"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n > 0:\n while n//3 == n/3:\n n //= 3\n return n == 1\n else: return False\n","runtime":"56"},{"code":"class Solution:\n\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True\n elif n <=0:\n return False\n elif n % 3==0 and n!=0:\n n = n//3\n return self.isPowerOfThree(n)\n return False\n ","runtime":"57"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n if n<=0:\n return False\n \n \n while n % 3 == 0:\n n = n // 3\n \n \n return n==1 ","runtime":"57"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n # The largest power of three that fits in a 32-bit integer\n m = 1162261467 # 3^19\n \n # n must be a positive integer and divide 1162261467 evenly to be a power of three\n return n > 0 and m % n == 0\n","runtime":"58"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if(n>1): \n while(n%3==0):n//=3\n return n==1\n ","runtime":"58"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n>0 and 3**19 % n == 0 :\n return True;\n return False;\n ","runtime":"59"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n if n == 1: return True\n if n < 3: return False\n\n while n%3 == 0: \n n = n // 3\n if n == 1:\n return True\n else:\n return False","runtime":"59"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n # Check if n is positive\n if n <= 0:\n return False\n \n # The largest power of 3 within 32-bit integer range is 3^19\n # 3^19 = 1162261467\n return 1162261467 % n == 0\n\n# Test the solution\nsolution = Solution()\nprint(solution.isPowerOfThree(27)) # Should print True\nprint(solution.isPowerOfThree(0)) # Should print False\nprint(solution.isPowerOfThree(9)) # Should print True","runtime":"60"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n while n > 1:\n if n % 3 != 0:\n return False\n n //= 3\n return True\n ","runtime":"60"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n == 0:\n return False\n if n == 1:\n return True\n if n % 3 != 0:\n return False\n return self.isPowerOfThree(n/3)","runtime":"62"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n >= 3:\n if n % 3 != 0:\n return False\n n = n // 3\n return n == 1\n\n ","runtime":"62"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n < 1:\n return False\n\n while n > 1:\n if n % 3 > 0:\n return False\n n = n / 3\n return True\n ","runtime":"63"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n while n>1 and n%3==0:\n n//=3\n return n==1\n ","runtime":"63"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n < 1:\n return False\n while n % 3 == 0:\n n //= 3\n return n == 1\n\n","runtime":"64"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n \n while n % 3 == 0:\n n //= 3\n \n return n == 1 ","runtime":"64"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n > 0:\n while n//3 == n/3 and n > 1:\n n //= 3\n return n == 1\n else: return False\n","runtime":"65"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return n > 0 and 1162261467 % n == 0","runtime":"66"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n if n==1:\n return True\n \n \n while n > 3:\n n = n / 3\n if not n.is_integer():\n return False\n \n \n if n == 3:\n return True\n else:\n return False\n ","runtime":"66"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n if n == 1:\n return True\n \n while n:\n \n if n % 3 == 0:\n n = n// 3\n else:\n break\n if n == 1:\n return True\n return False\n \n \n \n ","runtime":"67"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n != 1:\n if n < 1:\n return False\n else:\n n = n/3\n return True","runtime":"67"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n != abs(n) or not n:\n return False\n if n == 1:\n return True\n while n % 3 == 0:\n if n == 3:\n return True\n n //= 3\n return False","runtime":"68"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n x=1\n while x<n:\n x *=3\n return x==n\n\n ","runtime":"68"},{"code":"import math\nclass Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if(n<=0):\n return False\n if(n==1):\n return True\n x= math.log(n,3)\n y=int(x)\n print(x)\n z=0.999999999999996\n if(x==y or x>=(y+z)):\n return True\n else:\n return False\n \n\n ","runtime":"69"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n match = [1]\n i = 1\n while i < 2147483647:\n i = i * 3\n match.append(i)\n if n in match:\n return True\n return False\n","runtime":"69"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0: return False\n\n while 1 < n: n /= 3\n \n return 1 == n\n","runtime":"70"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n while n >= 3:\n if n%3 == 0:\n n = n/3 \n continue\n else:\n return False\n if n == 1:\n return True\n return False","runtime":"70"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return False if n<=0 else self.isPowerOfThree(n//3) if(n%3==0) else n==1 \n ","runtime":"71"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n > 0:\n while n//3 == n/3:\n n //= 3\n return n == 1\n else: return False\n","runtime":"71"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <=0:\n return False\n if n==1:\n return True\n return (n%3==0) and self.isPowerOfThree(n//3)\n ","runtime":"72"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n #recursive\n if n <= 0:\n return False\n if n >= 1:\n while (n % 3 == 0):\n n = n // 3\n return n == 1","runtime":"72"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True \n if n%3!=0 or n==0:\n return False\n return self.isPowerOfThree(n/3)","runtime":"73"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0: return False\n\n k = 1\n while k < n: k *= 3\n \n return k == n\n","runtime":"73"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1 or n==3:\n return True\n elif n<3:\n return False \n return self.isPowerOfThree(n/3)\n ","runtime":"74"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return False if n < 1 else 3 ** 19 % n == 0\n ","runtime":"74"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n while n%3==0:\n n//=3\n return n==1\n ","runtime":"75"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n == 1:\n return True\n elif n <= 0 or n % 3 != 0:\n return False\n else:\n return self.isPowerOfThree(n / 3) # Note: using `/` for division","runtime":"76"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n != abs(n) or not n:\n return False\n if n == 1:\n return True\n while n % 3 == 0:\n if n == 3:\n break\n if n % 3 != 0:\n break\n n //= 3\n if n != 3:\n return False\n return True","runtime":"77"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(n):\n if 3**i==n:\n return True\n if 3**i>n:\n return False\n return False\n","runtime":"78"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True\n elif n<3:\n return False\n return self.isPowerOfThree(n/3)\n ","runtime":"78"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<-2**31 or n>2**31 -1 or n<=0:\n return False\n if n==1:\n return True\n for i in range(1,20):\n if pow(3,i)==n:\n return True\n return False","runtime":"79"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n if n == 1:\n return True\n while n > 1:\n n = n / 3\n if n == 1:\n return True\n return False\n","runtime":"79"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n i=0\n while 3**i<n:\n i+=1\n if 3**i==n:\n return True\n return False","runtime":"80"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n < 1:\n return False\n \n def recursive_division(n: int) -> int:\n if n == 1:\n return n\n if n % 3 != 0:\n return n\n return recursive_division(n // 3)\n\n return recursive_division(n) == 1","runtime":"80"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3 ** i == n:\n return True\n return False","runtime":"81"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<1:\n return False\n elif n == 1:\n return True\n else:\n return(self.isPowerOfThree(n/3))","runtime":"83"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True\n elif n<3:\n return False\n return self.isPowerOfThree(n/3)\n ","runtime":"84"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==0 or n<0:\n return False\n else:\n for i in range(31):\n d=3**i\n if d==n:\n return True\n return False","runtime":"85"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return n in [3**x for x in range(20)]\n \n ","runtime":"86"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return isPow(0,n)\n\ndef isPow(i,n):\n if pow(3,i) >n:\n return False\n \n if pow(3,i) == n:\n return True\n return isPow(i+1,n)","runtime":"87"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n k=0\n while 1:\n if pow(3,k)==n:\n return True\n if pow(3,k)>n:\n return False\n k+=1","runtime":"88"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(n):\n res = math.pow(3,i)\n if res == n:\n return True\n if res > n:\n return False","runtime":"89"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0:\n return False\n print((math.log10(n) / math.log10(3)))\n return (math.log10(n) / math.log10(3)) % 1 == 0","runtime":"89"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(0, n):\n if pow(3, i) == n:\n return True\n elif pow(3,i)>n:\n return False\n else:\n return False\n","runtime":"90"},{"code":"import math\nclass Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0 : return False\n if n == 1 : return True\n i = 1\n while math.pow(3 , i) <= n :\n if math.pow(3 , i) == n :\n return True\n i += 1\n return False\n","runtime":"91"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3**i == n:\n return True\n\n return False","runtime":"92"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n def temp(x):\n if n==1:\n return True\n if x<n:\n return temp(x*3)\n elif x==n:\n return True\n else:\n return False\n if n<3 and n!=1:\n return False\n else:\n return temp(3)","runtime":"93"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range (20):\n if 3**i == n:\n return True\n return False","runtime":"93"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n == 3 or n == 1:\n return True\n if n < 3:\n return False\n return self.isPowerOfThree(n / 3)","runtime":"94"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n return any(3 ** i == n for i in range(31))","runtime":"95"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3**i == n:\n if 3**i == n:\n if 3**i == n:\n if 3**i == n:\n if 3**i == n:\n return True\n\n return False","runtime":"95"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(20):\n if((3**i)==n):\n return True\n return False \n ","runtime":"96"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <=0:\n return False\n else:\n ans = [3**i for i in range(20)]\n return True if n in ans else False","runtime":"97"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<0:\n return False\n else:\n for i in range(31):\n if n==3**i:\n return True\n return False\n ","runtime":"98"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3**i == n:\n return True\n return False\n\n ","runtime":"99"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3**i == n:\n return True\n return False","runtime":"100"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(27):\n if 3**i==n:\n return True\n return False\n \n \n ","runtime":"101"},{"code":"import math\nclass Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0 : return False\n i = 0\n while math.pow(3 , i) <= n :\n if math.pow(3 , i) == n :\n return True\n i += 1\n return False\n","runtime":"102"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n ans = 3 ** i\n if ans == n:\n return True\n return False","runtime":"104"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3**i == n:\n return True\n\n return False","runtime":"105"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3 ** i == n:\n return True\n return False\n ","runtime":"106"},{"code":"import math\nclass Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n ==1:\n return True\n if n > 0:\n c = math.log(n,3)\n i = 0\n a = False\n while i <=(c+1):\n if math.pow(3,i) == n:\n a = True\n break\n else:\n i += 1\n return a","runtime":"107"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3 ** i == n:\n return True\n return False","runtime":"107"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<-2**31 or n>2**31 -1 or n<=0:\n return False\n if n==1:\n return True\n for i in range(1,30):\n if pow(3,i)==n:\n return True\n return False","runtime":"108"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<-2**31 or n>2**31 -1 or n<=0:\n return False\n if n==1:\n return True\n for i in range(1,40):\n if pow(3,i)==n:\n return True\n return False","runtime":"109"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3**i == n:\n return True\n return False\n\n ","runtime":"109"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n else:\n for i in range(31):\n if(3**i==n):\n return True\n \n return False\n ","runtime":"110"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3 ** i == n:\n return True\n return False\n \n \n \n ","runtime":"112"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(30):\n if 3 ** i == n:\n return True\n return False","runtime":"113"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n for i in range(31):\n if 3 ** i == n:\n return(True)\n return (False)","runtime":"113"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n flag = True\\n if n == 0:\\n return False\\n while flag:\\n if n == 1:\\n return True\\n if n % 3 != 0:\\n return False\\n n = n // 3\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n>0 and 3**19%n==0:\\n return True\\n return False\\n \\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n%3==0:\\n n//=3\\n return n==1\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return n > 0 and (3 ** 19) % n == 0\\n \\n\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n >= 3:\\n n /= 3\\n return n == 1\\n\\n # if n == 0:\\n # return False\\n # if n == 3:\\n # return True\\n \\n # return self.isPowerOfThree(n / 3)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n % 3 == 0:\\n n = n / 3\\n return n == 1\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n while n > 1 and n%3 == 0:\\n n //= 3\\n \\n return n == 1\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n while n > 1 and n%3 == 0:\\n n //= 3\\n \\n return n == 1\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n if n <= 0:\\n return False\\n\\n while n % 3 == 0:\\n n //= 3\\n \\n return n == 1\\n \\n return n == 1\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n%3==0:\\n n/=3\\n return n==1\\n \\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n > 0:\\n while n > 1:\\n test = n%3\\n n/=3\\n if test!=0: return False\\n return True\\n return False\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n > 2:\\n if n % 3:\\n return False\\n n //= 3\\n return n == 1\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n return 1162261467 % n == 0\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n largest = 3**19\\n return n > 0 and largest % n == 0\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True\\n while n:\\n if n%3!=0:\\n return False\\n n=n/3\\n if n==1:\\n return True\\n return False\\n \\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n m = int(math.log(n)/math.log(3)+.000000001)\\n return n == 3**m\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n x = 3\\n if (n == 1):\\n # print('yes')\\n return True\\n if (n%x != 0) | (n==0) :\\n return False\\n n = n/x\\n return self.isPowerOfThree(n)\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n # The largest power of three that fits in a 32-bit integer\\n m = 1162261467 # 3^19\\n \\n # n must be a positive integer and divide 1162261467 evenly to be a power of three\\n return n > 0 and m % n == 0\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n == 1:\\n return True\\n if n<=0 or n%3 !=0:\\n return False\\n \\n return self.isPowerOfThree(n//3)\\n\\n \\n\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n \\n while n % 3 == 0:\\n n /= 3\\n \\n return n == 1\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n if n == 1:\\n return True\\n if n % 3 != 0:\\n return False\\n return self.isPowerOfThree(n//3)\\n \\n \\n \\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return n>0 and 1162261467%n == 0\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n % 3 == 0:\\n n //= 3\\n return n == 1\\n\\n\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n \\n # Continuously divide n by 3 if it's divisible\\n while n % 3 == 0:\\n n //= 3\\n \\n # If we end up with 1, then n was a power of three\\n return n == 1\\n\\n# Example usage:\\nsol = Solution()\\n\\nprint(sol.isPowerOfThree(27)) # Output: True\\nprint(sol.isPowerOfThree(0)) # Output: False\\nprint(sol.isPowerOfThree(-1)) # Output: False\\nprint(sol.isPowerOfThree(9)) # Output: True\\nprint(sol.isPowerOfThree(45)) # Output: False\\nprint(sol.isPowerOfThree(2187)) # Output: True\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n == 1:\\n return True\\n if n <= 0 or n % 3:\\n return False\\n return self.isPowerOfThree(n // 3)\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n >= 3:\\n if n%3 == 0:\\n n = n/3 \\n continue\\n else:\\n return False\\n if n == 1:\\n return True\\n return False\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n != abs(n) or not n:\\n return False\\n if n == 1:\\n return True\\n while not n % 3:\\n if n == 3:\\n return True\\n n //= 3\\n else:\\n return False\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n while n > 1:\\n n = n / 3\\n \\n return n == 1\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n def pow(n):\\n if n==0:\\n return False\\n if n==1:\\n return True\\n return n%3==0 and pow(n/3)\\n return pow(n)\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n >= 3:\\n if n%3 == 0:\\n n = n/3 \\n continue\\n else:\\n return False\\n if n == 1:\\n return True\\n return False\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0: return False\\n while n%3==0:\\n n//=3\\n return n==1\\n \",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if(n<1):\\n return False\\n while(n>1):\\n if(n!=1 and n%3!=0):\\n return False\\n n=n//3\\n if(n==1):\\n return True\\n return False\\n \",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return n > 0 and 1162261467 % n == 0\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n >= 3:\\n if n%3 == 0:\\n n = n/3 \\n continue\\n else:\\n return False\\n if n == 1:\\n return True\\n return False\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n < 1:\\n return False\\n if n == 1:\\n return True\\n if n%3 == 2 or n%3 == 1:\\n return False\\n return self.isPowerOfThree(n/3)\\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True\\n elif n%3!=0 or n<=0:\\n return False\\n else:\\n return self.isPowerOfThree(n/3)\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n if n == 1:\\n return True\\n return (n % 3 == 0) and self.isPowerOfThree(n // 3)\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n > 0:\\n while n//3 == n/3:\\n n //= 3\\n return n == 1\\n else: return False\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True\\n elif n <=0:\\n return False\\n elif n % 3==0 and n!=0:\\n n = n//3\\n return self.isPowerOfThree(n)\\n return False\\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n if n<=0:\\n return False\\n \\n \\n while n % 3 == 0:\\n n = n // 3\\n \\n \\n return n==1 \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n # The largest power of three that fits in a 32-bit integer\\n m = 1162261467 # 3^19\\n \\n # n must be a positive integer and divide 1162261467 evenly to be a power of three\\n return n > 0 and m % n == 0\\n\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if(n>1): \\n while(n%3==0):n//=3\\n return n==1\\n \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n>0 and 3**19 % n == 0 :\\n return True;\\n return False;\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n if n == 1: return True\\n if n < 3: return False\\n\\n while n%3 == 0: \\n n = n // 3\\n if n == 1:\\n return True\\n else:\\n return False\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n # Check if n is positive\\n if n <= 0:\\n return False\\n \\n # The largest power of 3 within 32-bit integer range is 3^19\\n # 3^19 = 1162261467\\n return 1162261467 % n == 0\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.isPowerOfThree(27)) # Should print True\\nprint(solution.isPowerOfThree(0)) # Should print False\\nprint(solution.isPowerOfThree(9)) # Should print True\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n > 1:\\n if n % 3 != 0:\\n return False\\n n //= 3\\n return True\\n \",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n == 0:\\n return False\\n if n == 1:\\n return True\\n if n % 3 != 0:\\n return False\\n return self.isPowerOfThree(n/3)\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n >= 3:\\n if n % 3 != 0:\\n return False\\n n = n // 3\\n return n == 1\\n\\n \",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n < 1:\\n return False\\n\\n while n > 1:\\n if n % 3 > 0:\\n return False\\n n = n / 3\\n return True\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n>1 and n%3==0:\\n n//=3\\n return n==1\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n < 1:\\n return False\\n while n % 3 == 0:\\n n //= 3\\n return n == 1\\n\\n\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n \\n while n % 3 == 0:\\n n //= 3\\n \\n return n == 1 \",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n > 0:\\n while n//3 == n/3 and n > 1:\\n n //= 3\\n return n == 1\\n else: return False\\n\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return n > 0 and 1162261467 % n == 0\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n if n==1:\\n return True\\n \\n \\n while n > 3:\\n n = n / 3\\n if not n.is_integer():\\n return False\\n \\n \\n if n == 3:\\n return True\\n else:\\n return False\\n \",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n if n == 1:\\n return True\\n \\n while n:\\n \\n if n % 3 == 0:\\n n = n// 3\\n else:\\n break\\n if n == 1:\\n return True\\n return False\\n \\n \\n \\n \",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n != 1:\\n if n < 1:\\n return False\\n else:\\n n = n/3\\n return True\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n != abs(n) or not n:\\n return False\\n if n == 1:\\n return True\\n while n % 3 == 0:\\n if n == 3:\\n return True\\n n //= 3\\n return False\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n x=1\\n while x<n:\\n x *=3\\n return x==n\\n\\n \",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if(n<=0):\\n return False\\n if(n==1):\\n return True\\n x= math.log(n,3)\\n y=int(x)\\n print(x)\\n z=0.999999999999996\\n if(x==y or x>=(y+z)):\\n return True\\n else:\\n return False\\n \\n\\n \",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n match = [1]\\n i = 1\\n while i < 2147483647:\\n i = i * 3\\n match.append(i)\\n if n in match:\\n return True\\n return False\\n\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0: return False\\n\\n while 1 < n: n /= 3\\n \\n return 1 == n\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n while n >= 3:\\n if n%3 == 0:\\n n = n/3 \\n continue\\n else:\\n return False\\n if n == 1:\\n return True\\n return False\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return False if n<=0 else self.isPowerOfThree(n//3) if(n%3==0) else n==1 \\n \",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n > 0:\\n while n//3 == n/3:\\n n //= 3\\n return n == 1\\n else: return False\\n\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <=0:\\n return False\\n if n==1:\\n return True\\n return (n%3==0) and self.isPowerOfThree(n//3)\\n \",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n #recursive\\n if n <= 0:\\n return False\\n if n >= 1:\\n while (n % 3 == 0):\\n n = n // 3\\n return n == 1\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True \\n if n%3!=0 or n==0:\\n return False\\n return self.isPowerOfThree(n/3)\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0: return False\\n\\n k = 1\\n while k < n: k *= 3\\n \\n return k == n\\n\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1 or n==3:\\n return True\\n elif n<3:\\n return False \\n return self.isPowerOfThree(n/3)\\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return False if n < 1 else 3 ** 19 % n == 0\\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n%3==0:\\n n//=3\\n return n==1\\n \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n == 1:\\n return True\\n elif n <= 0 or n % 3 != 0:\\n return False\\n else:\\n return self.isPowerOfThree(n / 3) # Note: using `/` for division\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n != abs(n) or not n:\\n return False\\n if n == 1:\\n return True\\n while n % 3 == 0:\\n if n == 3:\\n break\\n if n % 3 != 0:\\n break\\n n //= 3\\n if n != 3:\\n return False\\n return True\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(n):\\n if 3**i==n:\\n return True\\n if 3**i>n:\\n return False\\n return False\\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True\\n elif n<3:\\n return False\\n return self.isPowerOfThree(n/3)\\n \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<-2**31 or n>2**31 -1 or n<=0:\\n return False\\n if n==1:\\n return True\\n for i in range(1,20):\\n if pow(3,i)==n:\\n return True\\n return False\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n if n == 1:\\n return True\\n while n > 1:\\n n = n / 3\\n if n == 1:\\n return True\\n return False\\n\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n i=0\\n while 3**i<n:\\n i+=1\\n if 3**i==n:\\n return True\\n return False\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n < 1:\\n return False\\n \\n def recursive_division(n: int) -> int:\\n if n == 1:\\n return n\\n if n % 3 != 0:\\n return n\\n return recursive_division(n // 3)\\n\\n return recursive_division(n) == 1\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3 ** i == n:\\n return True\\n return False\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<1:\\n return False\\n elif n == 1:\\n return True\\n else:\\n return(self.isPowerOfThree(n/3))\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True\\n elif n<3:\\n return False\\n return self.isPowerOfThree(n/3)\\n \",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==0 or n<0:\\n return False\\n else:\\n for i in range(31):\\n d=3**i\\n if d==n:\\n return True\\n return False\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return n in [3**x for x in range(20)]\\n \\n \",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return isPow(0,n)\\n\\ndef isPow(i,n):\\n if pow(3,i) >n:\\n return False\\n \\n if pow(3,i) == n:\\n return True\\n return isPow(i+1,n)\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n k=0\\n while 1:\\n if pow(3,k)==n:\\n return True\\n if pow(3,k)>n:\\n return False\\n k+=1\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(n):\\n res = math.pow(3,i)\\n if res == n:\\n return True\\n if res > n:\\n return False\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n print((math.log10(n) / math.log10(3)))\\n return (math.log10(n) / math.log10(3)) % 1 == 0\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(0, n):\\n if pow(3, i) == n:\\n return True\\n elif pow(3,i)>n:\\n return False\\n else:\\n return False\\n\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0 : return False\\n if n == 1 : return True\\n i = 1\\n while math.pow(3 , i) <= n :\\n if math.pow(3 , i) == n :\\n return True\\n i += 1\\n return False\\n\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3**i == n:\\n return True\\n\\n return False\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n def temp(x):\\n if n==1:\\n return True\\n if x<n:\\n return temp(x*3)\\n elif x==n:\\n return True\\n else:\\n return False\\n if n<3 and n!=1:\\n return False\\n else:\\n return temp(3)\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range (20):\\n if 3**i == n:\\n return True\\n return False\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n == 3 or n == 1:\\n return True\\n if n < 3:\\n return False\\n return self.isPowerOfThree(n / 3)\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n return any(3 ** i == n for i in range(31))\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3**i == n:\\n if 3**i == n:\\n if 3**i == n:\\n if 3**i == n:\\n if 3**i == n:\\n return True\\n\\n return False\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(20):\\n if((3**i)==n):\\n return True\\n return False \\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <=0:\\n return False\\n else:\\n ans = [3**i for i in range(20)]\\n return True if n in ans else False\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<0:\\n return False\\n else:\\n for i in range(31):\\n if n==3**i:\\n return True\\n return False\\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3**i == n:\\n return True\\n return False\\n\\n \",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3**i == n:\\n return True\\n return False\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(27):\\n if 3**i==n:\\n return True\\n return False\\n \\n \\n \",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0 : return False\\n i = 0\\n while math.pow(3 , i) <= n :\\n if math.pow(3 , i) == n :\\n return True\\n i += 1\\n return False\\n\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n ans = 3 ** i\\n if ans == n:\\n return True\\n return False\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3**i == n:\\n return True\\n\\n return False\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3 ** i == n:\\n return True\\n return False\\n \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n ==1:\\n return True\\n if n > 0:\\n c = math.log(n,3)\\n i = 0\\n a = False\\n while i <=(c+1):\\n if math.pow(3,i) == n:\\n a = True\\n break\\n else:\\n i += 1\\n return a\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3 ** i == n:\\n return True\\n return False\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<-2**31 or n>2**31 -1 or n<=0:\\n return False\\n if n==1:\\n return True\\n for i in range(1,30):\\n if pow(3,i)==n:\\n return True\\n return False\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<-2**31 or n>2**31 -1 or n<=0:\\n return False\\n if n==1:\\n return True\\n for i in range(1,40):\\n if pow(3,i)==n:\\n return True\\n return False\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3**i == n:\\n return True\\n return False\\n\\n \",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n else:\\n for i in range(31):\\n if(3**i==n):\\n return True\\n \\n return False\\n \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3 ** i == n:\\n return True\\n return False\\n \\n \\n \\n \",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(30):\\n if 3 ** i == n:\\n return True\\n return False\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n for i in range(31):\\n if 3 ** i == n:\\n return(True)\\n return (False)\",\n \"runtime\": \"113\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":116,"string":"116"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n start = 0\n end = 93\n\n while start <= end:\n mid = (start + end) // 2\n\n if 3**mid == n:\n return True\n elif 3**mid < n:\n start = mid + 1\n else:\n end = mid - 1\n return False","memory":"15800"},{"code":"import math\nclass Solution:\n def isPowerOfThree(self, n: int) -> bool: \n return True if n > 0 and round(math.log(n, 3),9)%1==0 else False\n ","memory":"16000"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n \n if n <= 0:\n return False\n while n % 3 == 0 :\n n //= 3\n return n == 1\n ","memory":"16100"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n else:\n for i in range(31):\n if(3**i==n):\n return True\n \n return False\n ","memory":"16200"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<1:\n return False\n while n%3==0:\n n//=3\n return n==1","memory":"16300"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n==1 or n==3:\n return True\n elif n<3:\n return False \n return self.isPowerOfThree(n/3)\n ","memory":"16400"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<-2**31 or n>2**31 -1 or n<=0:\n return False\n if n==1:\n return True\n for i in range(1,20):\n if pow(3,i)==n:\n return True\n return False","memory":"16400"},{"code":"class Solution:\n\n def isPowerOfThree(self, n: int) -> bool:\n if n==1:\n return True\n elif n <=0:\n return False\n elif n % 3==0 and n!=0:\n n = n//3\n return self.isPowerOfThree(n)\n return False\n ","memory":"16500"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n <= 0: return False\n\n k = 1\n while k < n: k *= 3\n \n return k == n\n","memory":"16500"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n<=0:\n return False\n elif n==1:\n return True\n while(n>3):\n rem = n%3\n print(rem,n)\n if rem!=0:\n return False\n else:\n n = n//3\n if n==3:\n return True\n ","memory":"16600"},{"code":"class Solution:\n def isPowerOfThree(self, n: int) -> bool:\n if n == 1: return True\n if not n or n%3 != 0: return False\n x = n\n exp = 0\n\n while x:\n if x % 3 == 0:\n exp += 1\n x = x/3\n if 3**exp == n:\n return True\n else:\n False","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n start = 0\\n end = 93\\n\\n while start <= end:\\n mid = (start + end) // 2\\n\\n if 3**mid == n:\\n return True\\n elif 3**mid < n:\\n start = mid + 1\\n else:\\n end = mid - 1\\n return False\",\n \"memory\": \"15800\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def isPowerOfThree(self, n: int) -> bool: \\n return True if n > 0 and round(math.log(n, 3),9)%1==0 else False\\n \",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n \\n if n <= 0:\\n return False\\n while n % 3 == 0 :\\n n //= 3\\n return n == 1\\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n else:\\n for i in range(31):\\n if(3**i==n):\\n return True\\n \\n return False\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<1:\\n return False\\n while n%3==0:\\n n//=3\\n return n==1\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1 or n==3:\\n return True\\n elif n<3:\\n return False \\n return self.isPowerOfThree(n/3)\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<-2**31 or n>2**31 -1 or n<=0:\\n return False\\n if n==1:\\n return True\\n for i in range(1,20):\\n if pow(3,i)==n:\\n return True\\n return False\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n\\n def isPowerOfThree(self, n: int) -> bool:\\n if n==1:\\n return True\\n elif n <=0:\\n return False\\n elif n % 3==0 and n!=0:\\n n = n//3\\n return self.isPowerOfThree(n)\\n return False\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n <= 0: return False\\n\\n k = 1\\n while k < n: k *= 3\\n \\n return k == n\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n<=0:\\n return False\\n elif n==1:\\n return True\\n while(n>3):\\n rem = n%3\\n print(rem,n)\\n if rem!=0:\\n return False\\n else:\\n n = n//3\\n if n==3:\\n return True\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfThree(self, n: int) -> bool:\\n if n == 1: return True\\n if not n or n%3 != 0: return False\\n x = n\\n exp = 0\\n\\n while x:\\n if x % 3 == 0:\\n exp += 1\\n x = x/3\\n if 3**exp == n:\\n return True\\n else:\\n False\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":255,"cells":{"question_id":{"kind":"number","value":327,"string":"327"},"name":{"kind":"string","value":"count-of-range-sum"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code> and two integers <code>lower</code> and <code>upper</code>, return <em>the number of range sums that lie in</em> <code>[lower, upper]</code> <em>inclusive</em>.</p>\n\n<p>Range sum <code>S(i, j)</code> is defined as the sum of the elements in <code>nums</code> between indices <code>i</code> and <code>j</code> inclusive, where <code>i <= j</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [-2,5,-1], lower = -2, upper = 2\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> The three ranges are: [0,0], [2,2], and [0,2] and their respective sums are: -2, -1, 2.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0], lower = 0, upper = 0\n<strong>Output:</strong> 1\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>\n\t<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>\n\t<li><code>-10<sup>5</sup> <= lower <= upper <= 10<sup>5</sup></code></li>\n\t<li>The answer is <strong>guaranteed</strong> to fit in a <strong>32-bit</strong> integer.</li>\n</ul>\n"},"acRate":{"kind":"number","value":36.155822225415875,"string":"36.155822"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"],"string":"[\n \"array\",\n \"binary-search\",\n \"divide-and-conquer\",\n \"binary-indexed-tree\",\n \"segment-tree\",\n \"merge-sort\",\n \"ordered-set\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"1110\", 1.0505], [\"1178\", 3.3615000000000004], [\"1246\", 7.983699999999996], [\"1315\", 13.656100000000006], [\"1383\", 7.1434], [\"1451\", 3.9919000000000007], [\"1520\", 1.8908999999999998], [\"1588\", 3.781800000000001], [\"1656\", 5.672600000000001], [\"1725\", 3.991900000000001], [\"1793\", 3.3616000000000006], [\"1862\", 3.9919000000000016], [\"1930\", 3.3616000000000006], [\"1998\", 2.7313000000000005], [\"2067\", 1.8909], [\"2135\", 2.3111], [\"2203\", 3.361600000000001], [\"2272\", 1.2606], [\"2340\", 0.8404], [\"2408\", 0.4202], [\"2477\", 0.4202], [\"2545\", 0.6303000000000001], [\"2613\", 0.2101], [\"2682\", 0.2101], [\"2750\", 0.4202], [\"2818\", 0.2101], [\"2887\", 0.2101], [\"2955\", 0.2101], [\"3023\", 0.2101], [\"3092\", 0.2101], [\"3160\", 0.2101], [\"3229\", 0.2101], [\"3297\", 0.2101], [\"3365\", 0.2101], [\"3434\", 0.2101], [\"3502\", 0.2101], [\"3570\", 0.2101], [\"3639\", 0.2101], [\"3707\", 0.4202], [\"3775\", 0.2101], [\"3844\", 4.412100000000001], [\"3912\", 2.7313000000000005], [\"3980\", 0.4202], [\"4049\", 0.2101], [\"4117\", 0.2101], [\"4185\", 0.2101], [\"4254\", 0.2101], [\"4322\", 0.2101], [\"4390\", 0.2101], [\"4459\", 0.2101], [\"4527\", 0.2101], [\"4596\", 0.2101], [\"4664\", 0.2101], [\"4732\", 0.2101], [\"4801\", 0.2101], [\"4869\", 0.2101], [\"4937\", 0.2101], [\"5006\", 0.2101], [\"5074\", 0.2101], [\"5142\", 0.2101], [\"5211\", 0.2101], [\"5279\", 0.2101], [\"5347\", 0.2101], [\"5416\", 0.2101], [\"5484\", 0.2101], [\"5552\", 0.2101], [\"5621\", 0.2101], [\"5689\", 0.2101], [\"5757\", 0.2101], [\"5826\", 0.2101], [\"5894\", 0.2101], [\"5963\", 0.2101]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"30033\", 20.588400000000004], [\"31701\", 31.9331], [\"33368\", 1.0505], [\"35036\", 0.8404], [\"36703\", 0.6303000000000001], [\"38371\", 0.6303000000000001], [\"40038\", 2.5211000000000006], [\"41706\", 0.6303000000000001], [\"43373\", 0.2101], [\"45041\", 0.4202], [\"46708\", 0.2101], [\"48376\", 0.4202], [\"50043\", 22.268900000000002], [\"51711\", 5.882499999999999], [\"53378\", 0.2101], [\"55046\", 0.4202], [\"56713\", 1.0504], [\"58381\", 0.2101], [\"60048\", 0.2101], [\"61716\", 0.4202], [\"63383\", 0.2101], [\"65051\", 0.2101], [\"66718\", 0.2101], [\"68386\", 0.2101], [\"70053\", 0.2101], [\"71721\", 0.2101], [\"73388\", 0.2101], [\"75056\", 0.2101], [\"76723\", 1.0504]]}"},"rt_list":{"kind":"list like","value":[{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n st = SortedList([])\n l = len(nums)\n p = nums.copy()\n for i in range(1, l):\n p[i] += p[i - 1]\n ans = 0\n for i in range(l - 1, -1, -1):\n st.add(p[i])\n prev = p[i - 1] if i - 1 >= 0 else 0\n lw, up = lower + prev, upper + prev\n l, r = st.bisect_left(lw), st.bisect_right(up)\n ans += (r - l)\n return ans\n ","runtime":"1110"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # ans = prefix = 0\n # seen = [0]\n # for c in nums:\n # prefix+=c\n # lo = bisect.bisect_left(seen,prefix-upper)\n # hi = bisect.bisect_left(seen,prefix-lower+1)\n # ans+= hi -lo\n # bisect.insort(seen,prefix)\n # return ans\n cnt = 0\n sl = SortedList()\n range_offset = 0\n for num in nums:\n sl.add(range_offset)\n range_offset += -num\n l = sl.bisect_left(lower + range_offset)\n r = sl.bisect_right(upper + range_offset)\n cnt += (r - l)\n return cnt","runtime":"1110"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n res = 0\n\n prevSums = SortedList()\n currSum = 0\n for n in nums:\n prevSums.add(currSum)\n currSum += n\n\n res += prevSums.bisect_right(currSum - lower) - prevSums.bisect_left(currSum - upper)\n\n return res\n","runtime":"1178"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n from sortedcontainers import SortedList\n\n # Initialize a sorted list to maintain prefix sums\n prefix_sums = SortedList([0])\n current_sum = 0\n count = 0\n\n for num in nums:\n current_sum += num\n # We need to find the valid range of sums\n range_start = current_sum - upper\n range_end = current_sum - lower\n # Count the number of prefix sums in this valid range\n count += prefix_sums.bisect_right(range_end) - prefix_sums.bisect_left(range_start)\n # Add the current prefix sum to the sorted list\n prefix_sums.add(current_sum)\n\n return count","runtime":"1178"},{"code":"from sortedcontainers import SortedList\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n curr_sum = 0\n count = 0\n sorted_list = SortedList()\n sorted_list.add(0)\n for i in range(len(nums)):\n curr_sum += nums[i]\n #the prefix sum changes depending on what the curr_sum is. e.g. if curr_sum is -2,\n #then to be within -2 and 2, we want to find the range -4 and 0, so that when we add to -2, we fall within the range\n count += sorted_list.bisect_right(curr_sum-lower) - sorted_list.bisect_left(curr_sum-upper)\n #bisectr has bigger index, bisectl is smaller. we want the number of sums inbetween, \n #so get index of bright - index of bleft\n sorted_list.add(curr_sum)\n return count\n","runtime":"1246"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n sums = []\n for num in nums:\n sums.append(num+(sums[-1] if sums else 0))\n sorted_list = SortedList([0])\n res = 0\n for sum in sums:\n res+=sorted_list.bisect_right(sum-lower) - sorted_list.bisect_left(sum-upper)\n sorted_list.add(sum)\n return res","runtime":"1246"},{"code":"from typing import List\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = [0]\n sum = 0\n for num in nums:\n sum += num\n prefix.append(sum)\n return self.merge(prefix, 0, len(prefix), lower, upper)\n \n def merge(self, prefix, lo, hi, lower, upper):\n mid = (lo+hi) // 2\n if mid == lo:\n return 0\n count = self.merge(prefix, lo, mid, lower, upper) + self.merge(prefix, mid, hi, lower, upper) \n i = j = mid\n for left in prefix[lo:mid]:\n while i < hi and prefix[i] - left < lower: i += 1\n while j < hi and prefix[j] - left <= upper: j += 1\n count += j - i\n prefix[lo:hi] = sorted(prefix[lo:hi])\n return count\n ","runtime":"1315"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n def countWhileMerging(prefix_sums, start, end):\n if end - start <= 1:\n return 0\n mid = (start + end) // 2\n count = countWhileMerging(prefix_sums, start, mid) + countWhileMerging(prefix_sums, mid, end)\n \n j = k = mid\n for left in prefix_sums[start:mid]:\n while k < end and prefix_sums[k] - left < lower:\n k += 1\n while j < end and prefix_sums[j] - left <= upper:\n j += 1\n count += j - k\n \n # Merge step\n prefix_sums[start:end] = sorted(prefix_sums[start:end])\n return count\n \n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n \n return countWhileMerging(prefix_sums, 0, len(prefix_sums))","runtime":"1315"},{"code":"class Solution:\n # prefix-sum + merge-sort | time complexity: O(nlogn)\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Initialize prefix sum array with an initial value of 0\n cumulsum = [0]\n ## Compute prefix sums for the given nums array for n in nums\n for n in nums:\n cumulsum.append(cumulsum[-1]+n)\n \n\t\t# Define a helper function for the merge sort \n # This function will also count the valid ranges during the merging process\n def mergesort(left,right):\n # Base case\n if left == right:\n return 0\n # Calculate the middle index for the current range \n mid = (left+right)//2\n # Recursively sort and count the left and right halves\n cnt = mergesort(left,mid) + mergesort(mid+1,right)\n \n\t\t\t# Initialize pointers for the current left and right subarrays\n i = j = mid+1\n \n # Iterate through the left subarray to count valid ranges\n for l in cumulsum[left:mid+1]:\n \n # Move the pointer i to find the first valid range\n while i <= right and cumulsum[i] - l < lower:\n i+=1\n \n # Move the pointer j to find the last valid range \n while j <= right and cumulsum[j] - l <= upper:\n j+=1\n \n # Increment count by the number of valid ranges found\n cnt += j-i\n \n # Merge the two sorted halves\n cumulsum[left:right+1] = sorted(cumulsum[left:right+1])\n return cnt\n\t\t# Call the mergesort function on the entire prefix sum array\n return mergesort(0,len(cumulsum)-1)\n \n \n # Time :O(N)+ O(nlogn) = O(nlogn)\n # Space : O(n)\n ","runtime":"1383"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix_sum = [0]\n\n for n in nums:\n prefix_sum.append(prefix_sum[-1]+n)\n\n def mergeSort(low,high):\n if low == high:\n return 0\n \n middle = low + (high-low)//2\n solution = 0\n\n solution += mergeSort(low,middle) # left sub-array\n solution += mergeSort(middle+1,high) # right sub-array\n\n right_start = middle+1\n\n i = j = right_start\n\n # for each element in the left sub-array\n # counter how many prefix sums in the right \n # satisfy the given condition\n\n for prefix in prefix_sum[low:middle+1]:\n while i <= high and prefix_sum[i] - prefix < lower:\n i += 1\n while j <= high and prefix_sum[j] - prefix <= upper:\n j += 1\n\n solution += j - i\n \n prefix_sum[low:high+1] = sorted(prefix_sum[low:high+1])\n\n return solution\n \n return mergeSort(0,len(nums))\n\n\n","runtime":"1383"},{"code":"from itertools import accumulate \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presum = [0] + list(accumulate(nums))\n def mergeSort(left, right):\n if right == left:\n return 0\n # print(left, right, presum)\n mid = (left + right) // 2\n cnt = mergeSort(left, mid) + mergeSort(mid + 1, right)\n j = k = mid + 1\n for i in range(left, mid + 1):\n while j <= right and presum[j] - presum[i] <= upper:\n j += 1\n while k <= right and presum[k] - presum[i] < lower:\n k += 1\n # print(i, j, k)\n cnt += j - k\n presum[left:right+1] = sorted(presum[left:right+1])\n # print(presum)\n return cnt\n return mergeSort(0, len(presum) - 1)\n\n ","runtime":"1451"},{"code":"class Solution:\n def countRangeSum(self, nums: list[int], lower: int, upper: int) -> int:\n prefix_sums = [0] \n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n def count_while_sorting(prefix_sums, start, end):\n if end - start <= 1:\n return 0\n mid = (start + end) // 2\n count = count_while_sorting(prefix_sums, start, mid) + count_while_sorting(prefix_sums, mid, end)\n j = k = mid\n for i in range(start, mid):\n while j < end and prefix_sums[j] - prefix_sums[i] < lower:\n j += 1\n while k < end and prefix_sums[k] - prefix_sums[i] <= upper:\n k += 1\n count += k - j\n prefix_sums[start:end] = sorted(prefix_sums[start:end])\n return count\n return count_while_sorting(prefix_sums, 0, len(prefix_sums))\n","runtime":"1451"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefixes = [0]*(len(nums))\n for i in range(len(prefixes)):\n prefixes[i] = prefixes[i - 1] + nums[i]\n\n def recurse(l, r):\n if l == r:\n return 1 if lower <= prefixes[l] <= upper else 0\n mid = (l + r)//2\n\n currval = recurse(l, mid) + recurse(mid + 1, r)\n start, end = mid + 1, mid + 1\n for left in prefixes[l: mid + 1]:\n \n \n while start < r + 1 and prefixes[start] - left < lower:\n start += 1\n\n while end < r + 1 and prefixes[end] - left <= upper:\n end += 1\n currval += end - start\n \n # lp, rp = l, mid + 1\n # ret = []\n # while lp < mid + 1 and rp < r + 1:\n # if prefixes[lp] <= prefixes[rp]:\n # ret.append(prefixes[lp])\n # lp += 1\n # else:\n # ret.append(prefixes[rp])\n # rp += 1\n # ret.extend(prefixes[lp:mid + 1])\n # ret.extend(prefixes[rp:r + 1])\n prefixes[l: r + 1] = sorted(prefixes[l: r + 1])\n return currval\n\n val = recurse(0, len(nums) - 1)\n return val\n\n\n ","runtime":"1520"},{"code":"class Solution:\n def countRangeSum(self, nums, lower, upper):\n def countWhileMergeSort(sums, start, end, lower, upper):\n if end - start <= 1:\n return 0\n mid = (start + end) // 2\n count = countWhileMergeSort(sums, start, mid, lower, upper) + countWhileMergeSort(sums, mid, end, lower, upper)\n j, k, t = mid, mid, mid\n temp = []\n for left in sums[start:mid]:\n while k < end and sums[k] - left <= upper:\n k += 1\n while j < end and sums[j] - left < lower:\n j += 1\n count += k - j\n while t < end and sums[t] < left:\n temp.append(sums[t])\n t += 1\n temp.append(left)\n sums[start:start+len(temp)] = temp\n return count\n \n sums = [0] * (len(nums) + 1)\n for i in range(len(nums)):\n sums[i + 1] = sums[i] + nums[i]\n \n return countWhileMergeSort(sums, 0, len(sums), lower, upper)\n\n# Example usage:\nsolution = Solution()\nprint(solution.countRangeSum([-2, 5, -1], -2, 2)) # Output: 3\nprint(solution.countRangeSum([0], 0, 0)) # Output: 1","runtime":"1520"},{"code":"from typing import List\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Initialize prefix sums\n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n \n def merge_count(start: int, end: int) -> int:\n if end - start <= 1:\n return 0\n \n mid = (start + end) // 2\n count = merge_count(start, mid) + merge_count(mid, end)\n \n # Counting the ranges in a sorted fashion\n j = k = mid\n temp = []\n r = mid\n \n for left in prefix_sums[start:mid]:\n # Count the ranges [k, j) where the sum lies within [lower, upper]\n while k < end and prefix_sums[k] - left < lower:\n k += 1\n while j < end and prefix_sums[j] - left <= upper:\n j += 1\n count += j - k\n \n # Merge process\n while r < end and prefix_sums[r] < left:\n temp.append(prefix_sums[r])\n r += 1\n temp.append(left)\n \n # Complete the merge by appending any remaining elements\n while r < end:\n temp.append(prefix_sums[r])\n r += 1\n \n # Copy back the merged and sorted subarray into the original array\n prefix_sums[start:start+len(temp)] = temp\n \n return count\n \n return merge_count(0, len(prefix_sums))\n","runtime":"1588"},{"code":"class Solution:\n def countRangeSum(self, nums, lower, upper):\n def merge_sort(sums, left, right, lower, upper):\n if right - left <= 1:\n return 0\n mid = (left + right) // 2\n count = merge_sort(sums, left, mid, lower, upper) + merge_sort(sums, mid, right, lower, upper)\n j, k, t = mid, mid, mid\n temp = []\n for i in range(left, mid):\n while k < right and sums[k] - sums[i] < lower:\n k += 1\n while j < right and sums[j] - sums[i] <= upper:\n j += 1\n count += j - k\n while t < right and sums[t] < sums[i]:\n temp.append(sums[t])\n t += 1\n temp.append(sums[i])\n sums[left:left+len(temp)] = temp\n return count\n \n sums = [0] * (len(nums) + 1)\n for i in range(len(nums)):\n sums[i + 1] = sums[i] + nums[i]\n return merge_sort(sums, 0, len(sums), lower, upper)\n\n# Example usage:\nsolution = Solution()\nprint(solution.countRangeSum([-2, 5, -1], -2, 2)) # Output: 3\nprint(solution.countRangeSum([0], 0, 0)) # Output: 1","runtime":"1588"},{"code":"class Solution:\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # merge sort\n prefix_sum = [0]\n for num in nums:\n prefix_sum.append(prefix_sum[-1] + num)\n \n return self.mergesort(prefix_sum, lower, upper, 0, len(prefix_sum) - 1)\n \n def mergesort(self, prefix_sum, lower, upper, left, right):\n if left == right:\n return 0\n mid = (left + right) // 2\n count = self.mergesort(prefix_sum, lower, upper, left, mid) + self.mergesort(prefix_sum, lower, upper, mid + 1, right)\n i = j = mid + 1\n for left_value in prefix_sum[left : mid + 1]:\n while i <= right and prefix_sum[i] - left_value < lower:\n i += 1\n while j <= right and prefix_sum[j] - left_value <= upper:\n j += 1\n count += j - i\n \n tmp = []\n p1, p2 = left, mid + 1\n\n while p1 <= mid and p2 <= right:\n if prefix_sum[p1] < prefix_sum[p2]:\n tmp.append(prefix_sum[p1])\n p1 += 1\n else:\n tmp.append(prefix_sum[p2])\n p2 += 1\n\n \n while p1 <= mid:\n tmp.append(prefix_sum[p1]) \n p1 += 1\n\n while p2 <= right:\n tmp.append(prefix_sum[p2]) \n p2 += 1\n\n prefix_sum[left:right+1] = tmp[:]\n return count","runtime":"1656"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n Sum, BITree = [0] * (n + 1), [0] * (n + 2)\n \n def count(x):\n s = 0\n while x:\n s += BITree[x]\n x -= (x & -x)\n return s\n \n def update(x):\n while x <= n + 1:\n BITree[x] += 1\n x += (x & -x)\n \n for i in range(n):\n Sum[i + 1] = Sum[i] + nums[i]\n sortSum, res = sorted(Sum), 0\n for sum_j in Sum:\n sum_i_count = count(bisect.bisect_right(sortSum, sum_j - lower)) - count(bisect.bisect_left(sortSum, sum_j - upper))\n res += sum_i_count\n update(bisect.bisect_left(sortSum, sum_j) + 1)\n return res","runtime":"1656"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n pref = [0] * (n+1)\n for i in range(n):\n pref[i+1] = pref[i] + nums[i]\n \n \n def count(arr,l,m,r):\n cnt = 0\n k,j = m+1,m+1\n for i in range(l,m+1):\n while j <= r and arr[j] - arr[i] <= upper:\n j+=1\n while k <= r and arr[k] - arr[i] < lower:\n k+=1\n cnt += j-k\n return cnt\n\n \n def merge(arr,l,m,r):\n cnt = count(arr,l,m,r)\n i,j = l,m+1\n res = []\n while i <= m and j <= r:\n if arr[i] <= arr[j]:\n res.append(arr[i])\n i+=1\n else:\n res.append(arr[j])\n j+=1\n while i <= m:\n res.append(arr[i])\n i+=1\n while j <= r:\n res.append(arr[j])\n j+=1\n arr[l:r+1] = res\n return cnt\n \n def divide(arr,l,r):\n if r <= l:\n return 0\n mid = (r+l) // 2\n left = divide(arr,l,mid)\n right = divide(arr,mid+1,r)\n cnt = merge(arr,l,mid,r)\n return left+right+cnt\n\n cnt = divide(pref,0,n)\n return cnt","runtime":"1725"},{"code":"class Solution:\n # def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # n = len(nums)\n\n # prefix = [0]\n # prefix_sum = 0\n # for i in range(n):\n # prefix_sum += nums[i]\n # prefix.append(prefix_sum)\n\n # # use modified merge-sort to count the number of valid ranges\n # return self.countAndMergeSort(prefix, 0, n+1, lower, upper)\n\n # def countAndMergeSort(self, prefix, start, end, lower, upper):\n # # print(f\"The start of a new function, prefix is {prefix}\")\n # # base case: no array (end not reachable)\n # if end - start - 1 <= 0:\n # return 0\n\n # mid = (start + end) // 2\n\n # # recursive -> count valid ranges in left and right halves\n # count = self.countAndMergeSort(prefix, start, mid, lower, upper) + \\\n # self.countAndMergeSort(prefix, mid, end, lower, upper)\n\n # # count the valid ranges in current two SORTED halves:\n # mergeOutput = [None] * (end - start)\n # idx = 0 # used to put values in mergeOutput\n\n # ##### @@@@@ FROM HERE ON DID NOT SEE CLEARLY... #####\n # for i in range(start, mid):\n # # print(f\"The start of a loop, prefix is {prefix}\")\n # smallPtr = mid\n # while smallPtr < end and prefix[smallPtr] - prefix[i] < lower:\n # smallPtr += 1\n\n # upperPtr = mid\n # while upperPtr < end and prefix[upperPtr] - prefix[i] <= upper:\n # upperPtr += 1\n\n # mergePtr = mid\n # while mergePtr < end and prefix[mergePtr] < prefix[i]:\n # mergeOutput[idx] = prefix[mergePtr]\n # idx += 1\n # mergePtr += 1\n\n # mergeOutput[idx] = prefix[i]\n # idx += 1\n\n # count += upperPtr - smallPtr\n\n # # print(f\"The end of a loop, prefix is {prefix}\")\n\n # # UPDATE the prefix list!!\n # prefix[start : start + idx] = mergeOutput[: idx]\n\n # return count\n\n def countRangeSum(self, nums, lower, upper):\n n = len(nums)\n \n # Create a prefix sums array (sums[i] = sum of nums[0] to nums[i-1])\n sums = [0] * (n + 1)\n for i in range(n):\n sums[i + 1] = sums[i] + nums[i]\n \n # Use modified merge sort to count the number of valid ranges\n return self.countWhileMergeSort(sums, 0, n + 1, lower, upper)\n\n def countWhileMergeSort(self, sums, start, end, lower, upper):\n # Base case: when the range is too small to form a valid subarray\n if end - start <= 1:\n return 0\n \n # Find the midpoint to divide the sums array\n mid = (start + end) // 2\n \n # Recursively count the valid ranges in both halves\n count = self.countWhileMergeSort(sums, start, mid, lower, upper) \\\n + self.countWhileMergeSort(sums, mid, end, lower, upper)\n \n # Initialize pointers and cache for the merge process\n j = mid\n k = mid\n t = mid\n cache = [0] * (end - start) # Temporary array for merge\n r = 0 # Index for the cache\n \n # For each prefix sum in the left half (from start to mid)\n for i in range(start, mid):\n # Move `k` to find the smallest index in the right half\n # such that sums[k] - sums[i] >= lower\n while k < end and sums[k] - sums[i] < lower:\n k += 1\n \n # Move `j` to find the smallest index in the right half\n # such that sums[j] - sums[i] > upper\n while j < end and sums[j] - sums[i] <= upper:\n j += 1\n \n # Move `t` to merge the sorted halves\n while t < end and sums[t] < sums[i]:\n cache[r] = sums[t]\n t += 1\n r += 1\n \n # Copy the current sum[i] to the cache\n cache[r] = sums[i]\n r += 1\n \n # Count the number of valid subarray sums for this prefix sum[i]\n count += j - k\n \n # Copy the sorted sums back into the original array\n sums[start:start + r] = cache[:r]\n \n return count\n\n\n\n\n\n \n\n ","runtime":"1725"},{"code":"class Solution:\n def countRangeSum(self, nums, lower, upper):\n # Function to merge two halves and count valid range sums\n def merge_and_count(start, end):\n if start == end:\n return [prefix[start]], 0\n\n mid = (start + end) // 2\n left, count_left = merge_and_count(start, mid)\n right, count_right = merge_and_count(mid + 1, end)\n\n merged, count = merge(left, right, start, mid, end, lower, upper)\n return merged, count + count_left + count_right\n\n # Function to merge two sorted halves and count valid range sums\n def merge(left, right, start, mid, end, lower, upper):\n i = j = 0\n count = 0\n merged = []\n\n # Count valid range sums\n for left_sum in left:\n while i < len(right) and right[i] - left_sum < lower:\n i += 1\n while j < len(right) and right[j] - left_sum <= upper:\n j += 1\n count += j - i\n\n # Merge two sorted arrays\n i = j = 0\n while i < len(left) and j < len(right):\n if left[i] <= right[j]:\n merged.append(left[i])\n i += 1\n else:\n merged.append(right[j])\n j += 1\n merged.extend(left[i:] or right[j:])\n\n return merged, count\n\n n = len(nums)\n prefix = [0] * (n + 1)\n for i in range(1, n + 1):\n prefix[i] = prefix[i - 1] + nums[i - 1]\n\n _, count = merge_and_count(0, n)\n return count\n\n# Example usage:\nsolution = Solution()\nnums = [-2, 5, -1]\nlower = -2\nupper = 2\nprint(solution.countRangeSum(nums, lower, upper)) # Output: 3","runtime":"1793"},{"code":"class Solution:\n count = 0\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n def mergeSort(pref, l, r):\n if l == r:\n if lower <= pref[l] <= upper:\n return 1\n if l >= r:\n return 0\n\n mid = l + (r - l) // 2\n count = mergeSort(pref, l, mid) + mergeSort(pref, mid + 1, r)\n\n right = pref[mid + 1: r+ 1]\n for left in pref[l:mid+1]:\n i = bisect_left(right, lower + left) # values at >= i will be >= lower val\n j = bisect_right(right, upper + left) - 1 # values at <= j will be <= upper val\n if i <= j:\n count += (j - i + 1)\n\n pref[l:r + 1] = sorted(pref[l:r + 1])\n\n return count\n\n \n prefix_arr = [0]*(len(nums))\n prefix_arr[0] = nums[0]\n for i in range(1, len(nums)):\n prefix_arr[i] = prefix_arr[i-1] + nums[i]\n\n count = mergeSort(prefix_arr, 0, len(nums) - 1)\n\n return count","runtime":"1793"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n self.ans = 0\n prefix = [0] + list(itertools.accumulate(nums))\n\n self._mergeSort(prefix, 0, n, lower, upper)\n return self.ans\n\n def _mergeSort(self, prefix: List[int], l: int, r: int, lower: int, upper: int) -> None:\n if l >= r:\n return\n\n m = (l + r) // 2\n self._mergeSort(prefix, l, m, lower, upper)\n self._mergeSort(prefix, m + 1, r, lower, upper)\n self._merge(prefix, l, m, r, lower, upper)\n\n def _merge(self, prefix: List[int], l: int, m: int, r: int, lower: int, upper: int) -> None:\n lo = m + 1 # the first index s.t. prefix[lo] - prefix[i] >= lower\n hi = m + 1 # the first index s.t. prefix[hi] - prefix[i] > upper\n\n # For each index i in range [l, m], add hi - lo to `ans`.\n for i in range(l, m + 1):\n while lo <= r and prefix[lo] - prefix[i] < lower:\n lo += 1\n while hi <= r and prefix[hi] - prefix[i] <= upper:\n hi += 1\n self.ans += hi - lo\n\n sorted = [0] * (r - l + 1)\n k = 0 # sorted's index\n i = l # left's index\n j = m + 1 # right's index\n\n while i <= m and j <= r:\n if prefix[i] < prefix[j]:\n sorted[k] = prefix[i]\n k += 1\n i += 1\n else:\n sorted[k] = prefix[j]\n k += 1\n j += 1\n\n # Put the possible remaining left part into the sorted array.\n while i <= m:\n sorted[k] = prefix[i]\n k += 1\n i += 1\n\n # Put the possible remaining right part into the sorted array.\n while j <= r:\n sorted[k] = prefix[j]\n k += 1\n j += 1\n\n prefix[l:l + len(sorted)] = sorted","runtime":"1862"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n #tried to work from my solution to someone else's solution, ended up copying most of their code\n prefixes = [0]*(len(nums))\n for i in range(len(prefixes)):\n prefixes[i] = prefixes[i - 1] + nums[i]\n\n def recurse(l, r):\n if l == r:\n return 1 if lower <= prefixes[l] <= upper else 0\n mid = (l + r)//2\n\n currval = recurse(l, mid) + recurse(mid + 1, r)\n start = end = mid + 1 # from this line to the end of the for loop is the key part\n for left in prefixes[l: mid + 1]:\n \n \n while start < r + 1 and prefixes[start] - left < lower:\n start += 1\n\n while end < r + 1 and prefixes[end] - left <= upper:\n end += 1\n currval += end - start\n \n lp, rp = l, mid + 1\n ret = []\n while lp < mid + 1 and rp < r + 1:\n if prefixes[lp] <= prefixes[rp]:\n ret.append(prefixes[lp])\n lp += 1\n else:\n ret.append(prefixes[rp])\n rp += 1\n ret.extend(prefixes[lp:mid + 1])\n ret.extend(prefixes[rp:r + 1])\n prefixes[l: r + 1] = ret\n return currval\n\n val = recurse(0, len(nums) - 1)\n return val\n\n\n ","runtime":"1862"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Step 1: Create prefix sum array\n # This allows us to quickly calculate the sum of any range [i, j] as prefix_sum[j+1] - prefix_sum[i]\n prefix_sum = [0] # Start with 0 to handle cases where we need the sum from the beginning\n for num in nums:\n prefix_sum.append(prefix_sum[-1] + num)\n \n def mergeSort(start, end):\n # Base case: if the range has 0 or 1 element, there's nothing to sort or count\n if start >= end:\n return 0\n \n mid = (start + end) // 2\n \n # Recursively sort and count in left and right halves\n count = mergeSort(start, mid) + mergeSort(mid + 1, end)\n \n # Count range sums that span across the two halves\n j = k = mid + 1 # Initialize two pointers for the right half\n for i in range(start, mid + 1): # For each element in left half\n # Find the first element in right half where the range sum >= lower\n while j <= end and prefix_sum[j] - prefix_sum[i] < lower:\n j += 1\n # Find the first element in right half where the range sum > upper\n while k <= end and prefix_sum[k] - prefix_sum[i] <= upper:\n k += 1\n # The difference k - j gives the count of elements in [lower, upper]\n count += k - j\n \n # Merge the two sorted halves\n merged = []\n left, right = start, mid + 1\n while left <= mid and right <= end:\n if prefix_sum[left] <= prefix_sum[right]:\n merged.append(prefix_sum[left])\n left += 1\n else:\n merged.append(prefix_sum[right])\n right += 1\n \n # Append any remaining elements\n merged.extend(prefix_sum[left:mid+1])\n merged.extend(prefix_sum[right:end+1])\n \n # Copy merged array back to prefix_sum\n for i, val in enumerate(merged):\n prefix_sum[start + i] = val\n \n return count\n \n # Start the merge sort process on the entire prefix sum array\n return mergeSort(0, len(prefix_sum) - 1)\n","runtime":"1930"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = nums.copy()\n for i in range(1, len(nums)):\n prefix[i] += prefix[i-1]\n self.count = 0\n for n in prefix:\n if lower <= n <= upper:\n self.count += 1\n \n def merge(left_arr, right_arr):\n # Step 1: counting pairs i, j\n start, end = 0, 0 # index of right_arr\n # loop though left_arr to fix i index\n for i in range(len(left_arr)):\n # find the interval of start to end in right_arr\n # sliding windows [start, end]\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\n start += 1\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\n end += 1\n self.count += end - start\n\n # Step 2: merge 2 sorted arr\n l, r = 0, 0\n sorted_arr = []\n while l < len(left_arr) and r < len(right_arr):\n if left_arr[l] < right_arr[r]:\n sorted_arr.append(left_arr[l])\n l += 1\n else:\n sorted_arr.append(right_arr[r])\n r += 1\n return sorted_arr + left_arr[l:] + right_arr[r:]\n \n def divide(arr):\n if len(arr) <= 1: return arr\n mid = len(arr)//2\n left_arr = divide(arr[:mid])\n right_arr = divide(arr[mid:])\n return merge(left_arr, right_arr)\n\n divide(prefix)\n return self.count","runtime":"1930"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = nums.copy()\n for i in range(1, len(nums)):\n prefix[i] += prefix[i-1]\n self.count = 0\n for n in prefix:\n if lower <= n <= upper:\n self.count += 1\n \n def merge(left_arr, right_arr):\n # Step 1: counting pairs i, j\n start, end = 0, 0 # index of right_arr\n # loop though left_arr to fix i index\n for i in range(len(left_arr)):\n # find the interval of start to end in right_arr\n # sliding windows [start, end]\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\n start += 1\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\n end += 1\n self.count += end - start\n\n # Step 2: merge 2 sorted arr\n l, r = 0, 0\n sorted_arr = []\n while l < len(left_arr) and r < len(right_arr):\n if left_arr[l] < right_arr[r]:\n sorted_arr.append(left_arr[l])\n l += 1\n else:\n sorted_arr.append(right_arr[r])\n r += 1\n return sorted_arr + left_arr[l:] + right_arr[r:]\n \n def divide(arr):\n if len(arr) <= 1: return arr\n mid = len(arr)//2\n left_arr = divide(arr[:mid])\n right_arr = divide(arr[mid:])\n return merge(left_arr, right_arr)\n\n divide(prefix)\n return self.count","runtime":"1998"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = nums.copy()\n for i in range(1, len(nums)):\n prefix[i] += prefix[i-1]\n self.count = 0\n for n in prefix:\n if lower <= n <= upper:\n self.count += 1\n \n def merge(left_arr, right_arr):\n # Step 1: counting pairs i, j\n start, end = 0, 0 # index of right_arr\n # loop though left_arr to fix i index\n for i in range(len(left_arr)):\n # find the interval of start to end in right_arr\n # sliding windows [start, end]\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\n start += 1\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\n end += 1\n self.count += end - start\n\n # Step 2: merge 2 sorted arr\n l, r = 0, 0\n sorted_arr = []\n while l < len(left_arr) and r < len(right_arr):\n if left_arr[l] < right_arr[r]:\n sorted_arr.append(left_arr[l])\n l += 1\n else:\n sorted_arr.append(right_arr[r])\n r += 1\n return sorted_arr + left_arr[l:] + right_arr[r:]\n \n def divide(arr):\n if len(arr) <= 1: return arr\n mid = len(arr)//2\n left_arr = divide(arr[:mid])\n right_arr = divide(arr[mid:])\n return merge(left_arr, right_arr)\n\n divide(prefix)\n return self.count","runtime":"1998"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = nums.copy()\n for i in range(1, len(nums)):\n prefix[i] += prefix[i-1]\n self.count = 0\n for n in prefix:\n if lower <= n <= upper:\n self.count += 1\n \n def merge(left_arr, right_arr):\n # Step 1: counting pairs i, j\n start, end = 0, 0 # index of right_arr\n # loop though left_arr to fix i index\n for i in range(len(left_arr)):\n # find the interval of start to end in right_arr\n # sliding windows [start, end]\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\n start += 1\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\n end += 1\n self.count += end - start\n\n # Step 2: merge 2 sorted arr\n l, r = 0, 0\n sorted_arr = []\n while l < len(left_arr) and r < len(right_arr):\n if left_arr[l] < right_arr[r]:\n sorted_arr.append(left_arr[l])\n l += 1\n else:\n sorted_arr.append(right_arr[r])\n r += 1\n return sorted_arr + left_arr[l:] + right_arr[r:]\n \n def divide(arr):\n if len(arr) <= 1: return arr\n mid = len(arr)//2\n left_arr = divide(arr[:mid])\n right_arr = divide(arr[mid:])\n return merge(left_arr, right_arr)\n\n divide(prefix)\n return self.count\n\n\n ","runtime":"2067"},{"code":"class BIT:\n\n def __init__(self, n: int) -> None:\n self.bit = [0 for _ in range(n + 1)]\n\n def update(self, i: int, val: int = 1) -> None:\n i += 1\n while i < len(self.bit):\n self.bit[i] += val\n i += self._find_RSB(i)\n \n def prefix_sum(self, i: int) -> int:\n i += 1\n s = 0\n while i > 0:\n s += self.bit[i]\n i -= self._find_RSB(i)\n return s\n\n def _find_RSB(self, i: int) -> int:\n return i & -i\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n ps = [0]\n for i in range(n): ps.append(ps[-1] + nums[i])\n bit = BIT(n + 2)\n sort_ps, res = sorted(ps), 0\n for sum_j in ps:\n res += bit.prefix_sum(bisect.bisect_right(sort_ps, sum_j - lower) - 1) - \\\n bit.prefix_sum(bisect.bisect_left(sort_ps, sum_j - upper) - 1)\n bit.update(bisect.bisect_left(sort_ps, sum_j))\n return res","runtime":"2067"},{"code":"class Solution:\n bit=[]\n def getRSB(self, i):\n return i & -i\n def getSum(self, i):\n s = 0\n while i > 0:\n s += self.bit[i]\n i -= self.getRSB(i)\n return s\n \n def update(self, i):\n while i < len(self.bit):\n self.bit[i] += 1\n i += self.getRSB(i)\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n psum = [0 for i in range(n+1)]\n for i in range(n):\n psum[i+1] = psum[i] + nums[i]\n \n sorted_psum = sorted(psum)\n sorted_psum_map = {val: idx for idx, val in enumerate(sorted_psum)}\n\n res = 0\n self.bit = [0 for i in range(n+2)]\n\n print(sorted_psum)\n\n for i in range(n+1):\n pleft = psum[i] - upper\n pright = psum[i] - lower\n x = bisect.bisect_left(sorted_psum, pleft)\n y = bisect.bisect_right(sorted_psum, pright)\n\n lsum = self.getSum(x)\n rsum = self.getSum(y)\n\n res += rsum - lsum\n\n index = sorted_psum_map[psum[i]]\n self.update(index+1)\n\n return res\n\n\n \n ","runtime":"2135"},{"code":"class Solution:\n def __init__(self):\n self.tmp = None\n self.count = 0\n self.lower = float('inf')\n self.upper = -float('inf')\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n self.tmp = [0] * (n + 1)\n pre_sum = [0] * (n + 1)\n self.lower = lower\n self.upper = upper\n for i in range(n):\n pre_sum[i + 1] += nums[i] + pre_sum[i]\n self.m_sort(pre_sum, 0, n)\n return self.count\n \n def m_sort(self, sums: List[int], lo: int, hi: int) -> None:\n if lo >= hi:\n return\n mid = lo + (hi - lo) // 2\n self.m_sort(sums, lo, mid)\n self.m_sort(sums, mid + 1, hi)\n self.merge(sums, lo, mid, hi)\n \n def merge(self, sums: List[int], lo: int, mid: int, hi: int) -> None:\n for i in range(lo, hi + 1):\n self.tmp[i] = sums[i]\n start = end = mid + 1\n for i in range(lo, mid + 1):\n while start <= hi and sums[start] - sums[i] < self.lower:\n start += 1\n while end <= hi and sums[end] - sums[i] <= self.upper:\n end += 1\n self.count += end - start\n i, j = lo, mid + 1\n for k in range(lo, hi + 1):\n if i > mid:\n sums[k] = self.tmp[j]\n j += 1\n elif j > hi:\n sums[k] = self.tmp[i]\n i += 1\n elif self.tmp[i] > self.tmp[j]:\n sums[k] = self.tmp[j]\n j += 1\n else:\n sums[k] = self.tmp[i]\n i += 1\n ","runtime":"2135"},{"code":"class BinaryIndexedTree:\n def __init__(self, size):\n self.size = size\n self.tree = [0] * (size + 1)\n\n def update(self, index, val):\n while index <= self.size:\n self.tree[index] += val\n index += index & -index\n\n def query(self, index):\n sum_ = 0\n while index > 0:\n sum_ += self.tree[index]\n index -= index & -index\n return sum_\n\nclass Solution:\n def countRangeSum(self, nums, lower, upper):\n prefix_sums = list(accumulate(nums, initial=0))\n sorted_arr = sorted(set(x for sum_ in prefix_sums for x in (sum_, sum_ - lower, sum_ - upper)))\n tree = BinaryIndexedTree(len(sorted_arr))\n count = 0\n for sum_ in prefix_sums:\n left = bisect_left(sorted_arr, sum_ - upper) + 1\n right = bisect_left(sorted_arr, sum_ - lower) + 1\n count += tree.query(right) - tree.query(left - 1)\n tree.update(bisect_left(sorted_arr, sum_) + 1, 1)\n return count","runtime":"2203"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = nums.copy()\n for i in range(1, len(nums)):\n prefix[i] += prefix[i - 1]\n\n self.count = 0\n for n in prefix:\n if lower <= n <= upper:\n self.count += 1\n\n def merge(left_arr, right_arr):\n start, end = 0, 0\n for i in range(len(left_arr)):\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\n start += 1\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\n end += 1\n self.count += end - start\n\n l, r = 0, 0\n sorted_arr = []\n while l < len(left_arr) or r < len(right_arr):\n if r >= len(right_arr) or (l < len(left_arr) and left_arr[l] < right_arr[r]):\n sorted_arr.append(left_arr[l])\n l += 1\n else:\n sorted_arr.append(right_arr[r])\n r += 1\n return sorted_arr\n\n def divide(arr):\n if len(arr) <= 1: return arr\n mid = len(arr)//2\n left_arr = divide(arr[:mid])\n right_arr = divide(arr[mid:])\n return merge(left_arr, right_arr)\n\n divide(prefix)\n return self.count","runtime":"2203"},{"code":"class SegmentTree:\n def __init__(self, data):\n self.n = len(data)\n self.tree = [0] * (2 * self.n)\n \n def update(self, index, value):\n index += self.n\n self.tree[index] += value\n while index > 1:\n index //= 2\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\n \n def query(self, left, right):\n result = 0\n left += self.n\n right += self.n\n while left < right:\n if left % 2:\n result += self.tree[left]\n left += 1\n if right % 2:\n right -= 1\n result += self.tree[right]\n left //= 2\n right //= 2\n return result\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n \n all_sums = sorted(set(prefix_sums + [x - lower for x in prefix_sums] + [x - upper for x in prefix_sums]))\n sum_index = {v: i for i, v in enumerate(all_sums)}\n \n seg_tree = SegmentTree([0] * len(all_sums))\n count = 0\n \n for sum_val in prefix_sums:\n left_index = sum_index[sum_val - upper]\n right_index = sum_index[sum_val - lower]\n count += seg_tree.query(left_index, right_index + 1)\n seg_tree.update(sum_index[sum_val], 1)\n \n return count\n","runtime":"2272"},{"code":"class Solution:\n temp = [];\n count = 0;\n\n def isInRange(self, num: int, lower: int, higher: int):\n return lower <= num and num <= higher;\n\n def getPreSums(self, nums: List[int]) -> List[int]:\n presums = [0]*len(nums);\n acc = 0;\n for i, num in enumerate(nums):\n acc += num;\n presums[i] = acc;\n return presums;\n\n def merge(self, presums: List[int], lower: int, upper: int, lo: int, mid: int, hi: int):\n start = mid + 1\n end = mid + 1\n for i in range(lo, mid + 1):\n while start <= hi and presums[start] - presums[i] < lower:\n start += 1\n while end <= hi and presums[end] - presums[i] <= upper:\n end += 1\n self.count += end - start\n\n # Sort presums\n for i in range(lo, hi+1):\n self.temp[i] = presums[i];\n\n i, j = lo, mid+1;\n for pos in range(lo, hi+1):\n if i == mid + 1:\n presums[pos] = self.temp[j];\n j += 1;\n elif j == hi + 1:\n presums[pos] = self.temp[i];\n i += 1;\n elif self.temp[i] <= self.temp[j]:\n presums[pos] = self.temp[i];\n i += 1;\n else:\n presums[pos] = self.temp[j];\n j += 1;\n\n def _countRangeSum(self, presums: List[int], lower: int, upper: int, lo: int, hi: int) -> int:\n if lo == hi:\n if self.isInRange(presums[lo], lower, upper):\n print('c', presums[lo])\n self.count += 1;\n return;\n \n mid = lo + (hi-lo)//2;\n self._countRangeSum(presums, lower, upper, lo, mid);\n self._countRangeSum(presums, lower, upper, mid+1, hi);\n self.merge(presums, lower, upper, lo, mid, hi)\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = self.getPreSums(nums);\n self.temp = [0]*len(nums);\n self.count = 0;\n self._countRangeSum(presums, lower, upper, 0, len(nums)-1);\n return self.count;\n\n\n ","runtime":"2272"},{"code":"'''\nprefixSum == pS\n\npS[i] = sum(0:(i-1)) (i-1) is inclusive\n\nduring mergesort\n\n[low,mid] [mid+1, high]\n\nfor i in [low,mid] and j in [mid+1, high] -->\n count pairs such that lower <= pS[j+1] - pS[i] <= upper\n\nfor each i \nfind j1 such that pS[j+1] >= pS[i] + lower\nfind j2 such that pS[j+1] <= pS[i] + upper\n\nBest Explanation is here – https://leetcode.com/problems/count-of-range-sum/solutions/1267104/c-simple-explanation-for-beginners-to-hard-problems\n\n'''\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n\n prefixSums = [0 for _ in range(n+1)]\n for i in range(n):\n prefixSums[i+1] = prefixSums[i] + nums[i]\n\n # print(prefixSums)\n\n\n def count_while_mergesort(prefixSums, left, right):\n if left >= right:\n return 0\n \n # if left + 1 == right:\n # if prefixSums[right] - prefixSums[left] >= lower and prefixSums[right] - prefixSums[left] <= upper:\n # return 1\n # else:\n # return 0\n\n mid = (left+right)//2\n \n left_count = count_while_mergesort(prefixSums, left, mid)\n right_count = count_while_mergesort(prefixSums, mid+1, right)\n\n merge_count = merge(prefixSums, left, mid, right)\n\n # print(left, right)\n # print(left_count, right_count, merge_count)\n\n return left_count + right_count + merge_count\n\n\n def merge(prefixSums, left, mid, right):\n # print('merge', left, mid, right)\n arr_left = [prefixSums[k] for k in range(left, mid+1)]\n arr_right = [prefixSums[k] for k in range(mid+1, right+1)]\n\n p1, p2, p3, p4, count = 0, 0, 0, 0, 0\n\n n1, n2 = mid-left+1, right-mid\n\n curr_p = left\n\n while p1 <= n1-1:\n while p3 <= n2-1 and arr_right[p3] < arr_left[p1] + lower:\n p3 += 1\n\n while p4 <= n2-1 and arr_right[p4] <= arr_left[p1] + upper:\n p4 += 1\n\n while p2 <= n2-1 and arr_right[p2] < arr_left[p1]:\n prefixSums[curr_p] = arr_right[p2]\n p2 += 1\n curr_p += 1\n\n prefixSums[curr_p] = arr_left[p1]\n p1 += 1\n curr_p += 1\n count += p4-p3\n\n while p2 <= n2-1:\n prefixSums[curr_p] = arr_right[p2]\n p2 += 1\n curr_p += 1\n\n return count\n\n\n return count_while_mergesort(prefixSums, 0, n)\n \n\n\n \n\n\n\n # def divide_And_Conquer(start, end):\n # if start == end:\n # return 0\n\n # mid = (start + end)//2\n # leftCount = divide_And_Conquer(start, mid)\n # rightCount = divide_And_Conquer(mid+1, end)\n # count = leftCount + rightCount\n\n # for i in range(start,mid+1):\n # # p1 = mid+1\n # # while p1 <= end and prefixSums[p1] < prefixSums[i]+lower:\n # # p1 += 1\n \n # # p2 = p1\n # # while p2 <= end and prefixSums[p2] <= prefixSums[i]+upper:\n # # p2 += 1\n\n # p1 = mid+1 + bisect.bisect_left(prefixSums[(mid+1):(end+1)], prefixSums[i]+lower)\n # p2 = mid+1 + bisect.bisect_right(prefixSums[(mid+1):(end+1)], prefixSums[i]+upper)\n # count += p2 - p1\n \n # i = start\n # j = mid+1\n # k = 0\n # mergedArray = [0 for _ in range(end-start+1)]\n # while i <= mid and j <= end:\n # if prefixSums[i] <= prefixSums[j]:\n # mergedArray[k] = prefixSums[i]\n # i += 1\n # else:\n # mergedArray[k] = prefixSums[j]\n # j += 1\n # k += 1\n\n # while i <= mid:\n # mergedArray[k] = prefixSums[i]\n # i += 1\n # k += 1\n\n # while j <= end:\n # mergedArray[k] = prefixSums[j]\n # j += 1\n # k += 1\n\n # prefixSums[start:(end+1)] = mergedArray\n\n # return count\n\n \n # return divide_And_Conquer(0,n)","runtime":"2340"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Divide and Conquer\n n = len(nums)\n if n <= 1:\n # Doesn't actually have to convert to int, but for clarity\n return int(nums and lower <= nums[0] <= upper)\n else:\n mid = n // 2\n\n # Suffix sum of the left array\n suffix = [0] * (mid + 1)\n for i in range(mid - 1, -1, -1):\n suffix[i] = suffix[i + 1] + nums[i]\n\n # We exclude index mid from suffix\n suffix = suffix[:-1]\n\n # Prefix sum of the right array\n prefix = [0] * (n - mid + 1)\n for i in range(mid, n):\n prefix[i - mid + 1] = prefix[i - mid] + nums[i]\n\n # Again, we exclude index mid from prefix\n # We also want to sort prefix, excluding mid\n prefix = sorted(prefix[1:])\n\n # Find count when start index is on the left array, and right index is on the right array\n count = 0\n for suf in suffix:\n count += bisect.bisect_right(prefix, upper - suf) - bisect.bisect_left(prefix, lower - suf)\n\n return count + self.countRangeSum(nums[:mid], lower, upper) + self.countRangeSum(nums[mid:], lower, upper)","runtime":"2340"},{"code":"import copy\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # based on merge sort\n\n def _merge_sort(res, arr, left, right, lower, upper):\n # exclusive of the right end\n if right - left >= 2:\n mid = left + (right - left) // 2\n res, arr = _merge_sort(res, arr, left, mid, lower, upper)\n res, arr = _merge_sort(res, arr, mid, right, lower, upper)\n res, arr = _merge(res, arr, left, mid, right, lower, upper)\n elif right - left == 1:\n if (arr[left][0] >= lower) and (arr[left][0] <= upper):\n res[arr[left][1]] += 1\n return res, arr\n \n def _merge(res, arr, left, mid, right, lower, upper):\n # we use two separate points to process merging and counting range sums\n # \n # NOTE: merge sort ensure that indices for arr's elements from [mid, right)\n # are larger than elements from [left, mid)\n i = left\n j = mid\n k_lower = mid\n k_upper = mid\n\n sorted_arr = []\n while i < mid:\n lower_bound = arr[i][0] + lower\n upper_bound = arr[i][0] + upper\n\n # we find how many are in the range of [lower_bound, upper_bound]\n\n # NOTE: we use \"< lower_bound\" to include the left end\n while (k_lower < right) and (arr[k_lower][0] < lower_bound):\n k_lower += 1\n\n # NOTE: we use \"<= upper_bound\" to include the right end\n while (k_upper < right) and (arr[k_upper][0] <= upper_bound):\n k_upper += 1\n \n # print('merge: ', (left, mid, right), 'arr: ', [_[0] for _ in arr[left:right]], 'bound: ', (lower_bound, upper_bound), (k_lower, k_upper))\n\n res[arr[i][1]] += k_upper - k_lower\n # print(f'{res=}')\n\n while (j < right) and (arr[i][0] > arr[j][0]):\n sorted_arr.append(arr[j])\n j += 1\n \n sorted_arr.append(arr[i])\n i += 1\n \n while j < right:\n sorted_arr.append(arr[j])\n j += 1\n \n for tmp_i in range(len(sorted_arr)):\n arr[left + tmp_i] = sorted_arr[tmp_i]\n \n return res, arr\n\n arr = copy.deepcopy(nums)\n for tmp_i, tmp_val in enumerate(nums):\n if tmp_i == 0:\n arr[tmp_i] = (arr[0], 0)\n else:\n arr[tmp_i] = (arr[tmp_i] + arr[tmp_i - 1][0], tmp_i)\n \n # result for #range_sums when starting from i\n res = [0 for _ in nums]\n\n # print('arr before: ', [_[0] for _ in arr])\n\n res, arr = _merge_sort(res, arr, 0, len(nums), lower, upper)\n\n # print('arr after: ', [_[0] for _ in arr])\n # print('res: ', res)\n\n return sum(res)\n ","runtime":"2408"},{"code":"import copy\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # based on merge sort\n\n def _merge_sort(res, arr, left, right, lower, upper):\n # exclusive of the right end\n if right - left >= 2:\n mid = left + (right - left) // 2\n res, arr = _merge_sort(res, arr, left, mid, lower, upper)\n res, arr = _merge_sort(res, arr, mid, right, lower, upper)\n res, arr = _merge(res, arr, left, mid, right, lower, upper)\n elif right - left == 1:\n if (arr[left][0] >= lower) and (arr[left][0] <= upper):\n res[arr[left][1]] += 1\n return res, arr\n \n def _merge(res, arr, left, mid, right, lower, upper):\n # we use two separate points to process merging and counting range sums\n # \n # NOTE: merge sort ensure that indices for arr's elements from [mid, right)\n # are larger than elements from [left, mid)\n i = left\n j = mid\n k_lower = mid\n k_upper = mid\n\n sorted_arr = []\n while i < mid:\n lower_bound = arr[i][0] + lower\n upper_bound = arr[i][0] + upper\n\n # we find how many are in the range of [lower_bound, upper_bound]\n\n # NOTE: we use \"< lower_bound\" to include the left end\n while (k_lower < right) and (arr[k_lower][0] < lower_bound):\n k_lower += 1\n\n # NOTE: we use \"<= upper_bound\" to include the right end\n while (k_upper < right) and (arr[k_upper][0] <= upper_bound):\n k_upper += 1\n \n # print('merge: ', (left, mid, right), 'arr: ', [_[0] for _ in arr[left:right]], 'bound: ', (lower_bound, upper_bound), (k_lower, k_upper))\n\n res[arr[i][1]] += k_upper - k_lower\n # print(f'{res=}')\n\n while (j < right) and (arr[i][0] > arr[j][0]):\n sorted_arr.append(arr[j])\n j += 1\n \n sorted_arr.append(arr[i])\n i += 1\n \n while j < right:\n sorted_arr.append(arr[j])\n j += 1\n \n for tmp_i in range(len(sorted_arr)):\n arr[left + tmp_i] = sorted_arr[tmp_i]\n \n return res, arr\n\n arr = copy.deepcopy(nums)\n for tmp_i, tmp_val in enumerate(nums):\n if tmp_i == 0:\n arr[tmp_i] = (arr[0], 0)\n else:\n arr[tmp_i] = (arr[tmp_i] + arr[tmp_i - 1][0], tmp_i)\n \n # result for #range_sums when starting from i\n res = [0 for _ in nums]\n\n # print('arr before: ', [_[0] for _ in arr])\n\n res, arr = _merge_sort(res, arr, 0, len(nums), lower, upper)\n\n # print('arr after: ', [_[0] for _ in arr])\n # print('res: ', res)\n\n return sum(res)\n ","runtime":"2408"},{"code":"from sortedcontainers import SortedList\n\nclass BIT:\n def __init__(self, size):\n self.size = size\n self.tree = [0] * (size + 1)\n\n def update(self, index, delta):\n while index <= self.size:\n self.tree[index] += delta\n index += index & -index\n\n def query(self, index):\n total = 0\n while index > 0:\n total += self.tree[index]\n index -= index & -index\n return total\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Step 1: Calculate prefix sums\n prefix_sum = 0\n prefix_sums = [prefix_sum]\n for num in nums:\n prefix_sum += num\n prefix_sums.append(prefix_sum)\n\n # Step 2: Discretize prefix sums (rank compression)\n sorted_sums = SortedList(prefix_sums)\n bit = BIT(len(sorted_sums))\n\n count = 0\n for sum_j in prefix_sums:\n # Step 3: Count valid prefix sums using BIT\n left_bound = sorted_sums.bisect_right(sum_j - lower)\n right_bound = sorted_sums.bisect_left(sum_j - upper)\n count += bit.query(left_bound) - bit.query(right_bound)\n\n # Step 4: Update BIT with the rank of current prefix sum\n rank = sorted_sums.index(sum_j) + 1\n bit.update(rank, 1)\n\n return count","runtime":"2477"},{"code":"from sortedcontainers import SortedList\n\nclass BIT:\n def __init__(self, size):\n self.size = size\n self.tree = [0] * (size + 1)\n\n def update(self, index, delta):\n while index <= self.size:\n self.tree[index] += delta\n index += index & -index\n\n def query(self, index):\n total = 0\n while index > 0:\n total += self.tree[index]\n index -= index & -index\n return total\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Step 1: Calculate prefix sums\n prefix_sum = 0\n prefix_sums = [prefix_sum]\n for num in nums:\n prefix_sum += num\n prefix_sums.append(prefix_sum)\n\n # Step 2: Discretize prefix sums (rank compression)\n sorted_sums = SortedList(prefix_sums)\n bit = BIT(len(sorted_sums))\n\n count = 0\n for sum_j in prefix_sums:\n # Step 3: Count valid prefix sums using BIT\n left_bound = sorted_sums.bisect_right(sum_j - lower)\n right_bound = sorted_sums.bisect_left(sum_j - upper)\n count += bit.query(left_bound) - bit.query(right_bound)\n\n # Step 4: Update BIT with the rank of current prefix sum\n rank = sorted_sums.index(sum_j) + 1\n bit.update(rank, 1)\n\n return count","runtime":"2477"},{"code":"# from collections import defaultdict\nfrom itertools import accumulate, chain\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n nums = list(chain([0], accumulate(nums)))\n # print(nums)\n self.result = 0\n\n def f(lst):\n if len(lst) == 0:\n return []\n if len(lst) == 1:\n return lst\n n = len(lst) // 2\n left, right = f(lst[:n]), f(lst[n:])\n \n min_j, max_j = -1, -1\n for i in range(len(left)):\n for j in range(min_j+1, len(right)):\n if right[j] - left[i] < lower:\n min_j = j\n else:\n break\n for j in range(max_j+1, len(right)):\n if right[j] - left[i] <= upper:\n max_j = j\n else:\n break\n self.result += max_j - min_j\n\n lst, i, j = [], 0, 0\n while i < len(left) and j < len(right):\n if left[i] < right[j]:\n lst.append(left[i])\n i += 1\n else:\n lst.append(right[j])\n j += 1\n if i == len(left):\n return lst + right[j:]\n else:\n return lst + left[i:]\n\n f(nums)\n return self.result","runtime":"2545"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n if not nums:\n return 0\n\n n = len(nums)\n if n == 1:\n return int(lower <= nums[0] <= upper)\n\n mid = n >> 1\n count = sum([\n self.countRangeSum(array, lower, upper)\n for array in [nums[:mid], nums[mid:]]\n ])\n\n suffix, prefix = [0] * (mid + 1), [0] * (n - mid + 1)\n for i in range(mid - 1, -1, -1):\n suffix[i] = suffix[i + 1] + nums[i]\n\n for i in range(mid, n):\n prefix[i - mid + 1] = prefix[i - mid] + nums[i]\n\n suffix, prefix = suffix[:-1], sorted(prefix[1:])\n count += sum([\n bisect.bisect_right(prefix, upper - s) -\n bisect.bisect_left(prefix, lower - s)\n for s in suffix\n ])\n\n return count","runtime":"2545"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # self.counts = 0 \n # def dfs(il, total):\n # if not il:\n # return \n # for i in range(len(il)):\n # total += il[i]\n # if lower<=total<=upper:\n # self.counts +=1 \n # dfs(il[i+1:], total)\n # total -= il[i]\n\n # dfs(nums, 0)\n # return self.counts\n \n ##### divide and conque\n \n def countRangeSub(nums, l, r):\n if l==r:\n return int(nums[l] >= lower and nums[r] <= upper)\n \n m = l + (r-l)//2\n suffix, tot = [], 0\n\n for i in range(m+1,r+1):\n tot += nums[i]\n suffix.append(tot)\n\n suffix.sort()\n tot, C = 0, 0\n for j in range(m, l-1, -1):\n tot += nums[j]\n C += bisect.bisect_right(suffix, upper-tot+0.5)-bisect.bisect_left(suffix, lower-tot-0.5)\n \n return countRangeSub(nums, l, m) + countRangeSub(nums, m+1, r) + C\n \n return countRangeSub(nums, 0, len(nums)-1) \n \n \n \n\n \n \n \n\n \n\n \n\n","runtime":"2613"},{"code":"from collections import defaultdict\n\n\nclass Solution:\n def __init__(self):\n self.count = 0\n\n def get_presum(self, nums):\n pre_sum = [0] * (len(nums) + 1)\n\n for i in range(len(nums)):\n pre_sum[i + 1] = pre_sum[i] + nums[i]\n\n return pre_sum\n\n def merge(self, left, right, lower, upper):\n start = 0\n end = 0\n for val in left:\n # origi_start_index = right[start][1]\n # origi_end_index = right[end][1]\n while start < len(right) and right[start] - val < lower:\n start += 1\n while end < len(right) and right[end] - val <= upper:\n end += 1\n self.count += end - start\n\n # 合并后的数组\n result = []\n while left and right:\n # 对比两个数组的第一个元素\n # 小的数字弹出并放进去结果数组\n if left[0] <= right[0]:\n result.append(left.pop(0))\n else:\n result.append(right.pop(0))\n\n # 如果左边还有数字，一定是有序的直接加到结果后面\n if left:\n result.extend(left)\n # 同理右边\n if right:\n result.extend(right)\n\n return result\n\n def merge_sort(self, nums, lower, upper):\n if len(nums) < 2:\n return nums\n\n mid = len(nums) // 2\n left = self.merge_sort(nums[:mid], lower, upper)\n right = self.merge_sort(nums[mid:], lower, upper)\n sub_res = self.merge(left, right, lower, upper)\n\n return sub_res\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n pre_sum = self.get_presum(nums)\n\n res = self.merge_sort(pre_sum, lower, upper)\n\n return self.count\n\n\n \n\n ","runtime":"2750"},{"code":"from collections import defaultdict\n\n\nclass Solution:\n def __init__(self):\n self.count = 0\n\n def get_presum(self, nums):\n pre_sum = [0] * (len(nums) + 1)\n\n for i in range(len(nums)):\n pre_sum[i + 1] = pre_sum[i] + nums[i]\n\n return pre_sum\n\n def merge(self, left, right, lower, upper):\n start = 0\n end = 0\n for val in left:\n # origi_start_index = right[start][1]\n # origi_end_index = right[end][1]\n while start < len(right) and right[start] - val < lower:\n start += 1\n while end < len(right) and right[end] - val <= upper:\n end += 1\n self.count += end - start\n\n # 合并后的数组\n result = []\n while left and right:\n # 对比两个数组的第一个元素\n # 小的数字弹出并放进去结果数组\n if left[0] <= right[0]:\n result.append(left.pop(0))\n else:\n result.append(right.pop(0))\n\n # 如果左边还有数字，一定是有序的直接加到结果后面\n if left:\n result.extend(left)\n # 同理右边\n if right:\n result.extend(right)\n\n return result\n\n def merge_sort(self, nums, lower, upper):\n if len(nums) < 2:\n return nums\n\n mid = len(nums) // 2\n left = self.merge_sort(nums[:mid], lower, upper)\n right = self.merge_sort(nums[mid:], lower, upper)\n sub_res = self.merge(left, right, lower, upper)\n\n return sub_res\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n pre_sum = self.get_presum(nums)\n\n res = self.merge_sort(pre_sum, lower, upper)\n\n return self.count\n\n\n \n\n ","runtime":"2750"},{"code":"from collections import defaultdict\n\n\nclass Solution:\n def __init__(self):\n self.count = 0\n\n def get_presum(self, nums):\n pre_sum = [0] * (len(nums) + 1)\n\n for i in range(len(nums)):\n pre_sum[i + 1] = pre_sum[i] + nums[i]\n\n return pre_sum\n\n def merge(self, left, right, lower, upper):\n start = 0\n end = 0\n for val in left:\n while start < len(right) and right[start] - val < lower:\n start += 1\n while end < len(right) and right[end] - val <= upper:\n end += 1\n self.count += end - start\n\n # 合并后的数组\n result = []\n while left and right:\n # 对比两个数组的第一个元素\n # 小的数字弹出并放进去结果数组\n if left[0] <= right[0]:\n result.append(left.pop(0))\n else:\n result.append(right.pop(0))\n\n # 如果左边还有数字，一定是有序的直接加到结果后面\n if left:\n result.extend(left)\n # 同理右边\n if right:\n result.extend(right)\n\n return result\n\n def merge_sort(self, nums, lower, upper):\n if len(nums) < 2:\n return nums\n\n mid = len(nums) // 2\n left = self.merge_sort(nums[:mid], lower, upper)\n right = self.merge_sort(nums[mid:], lower, upper)\n sub_res = self.merge(left, right, lower, upper)\n\n return sub_res\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n pre_sum = self.get_presum(nums)\n\n res = self.merge_sort(pre_sum, lower, upper)\n\n return self.count\n\n\n \n\n ","runtime":"2818"},{"code":"class Solution:\n def merger(self, a, b, reverse=False):\n aptr = 0\n bptr = 0\n lst = []\n while aptr < len(a) or bptr < len(b):\n if aptr == len(a):\n lst.append(b[bptr])\n bptr += 1\n elif bptr == len(b):\n lst.append(a[aptr])\n aptr += 1\n else:\n if a[aptr] <= b[bptr]:\n lst.append(a[aptr])\n aptr += 1\n else:\n lst.append(b[bptr])\n bptr += 1\n if reverse:\n return lst[::-1]\n return lst\n\n def sorter(self, nums, lower, upper, L, R):\n # return a tuple of amount, sortedPrefixSum, sortedSuffixSum\n if L == R:\n if nums[L] >= lower and nums[L] <= upper:\n # print(L,R,1)\n return (1, [nums[L]], [nums[L]])\n # print(L,R,0)\n return (0, [nums[L]], [nums[L]])\n mid = int((L+R)/2)\n recLeft = self.sorter(nums, lower, upper, L, mid)\n recRight = self.sorter(nums, lower, upper, mid+1, R)\n # do calculations\n tot = 0\n leftPrefixes, rightPrefixes = recLeft[1], recRight[1]\n leftSuffixes, rightSuffixes = recLeft[2], recRight[2]\n\n # if L == 0 and R == 5:\n # print(\"------\")\n # print(leftPrefixes)\n # print(rightPrefixes)\n # print(leftSuffixes)\n # print(rightSuffixes)\n # print(\"------\")\n\n l = 0\n r = -1\n for leftSuffix in leftSuffixes[::-1]:\n while l < len(rightPrefixes) and leftSuffix + rightPrefixes[l] < lower:\n l += 1\n if l == len(rightPrefixes):\n break\n \n r = max(l-1,r)\n while r+1 < len(rightPrefixes) and leftSuffix + rightPrefixes[r+1] <= upper:\n r += 1\n \n if r >= l and r < len(rightPrefixes) and leftSuffix + rightPrefixes[r] <= upper and l >= 0:\n tot += r-l+1\n # if L == 0 and R == 5:\n # print(leftSuffix, r-l+1)\n # else:\n # if L == 0 and R == 5:\n # print(leftSuffix, 0)\n \n\n # do the merging\n totLeft = sum(nums[L:mid+1])\n rightPrefixesAdjusted = [(totLeft + num) for num in rightPrefixes]\n prefixes = self.merger(leftPrefixes, rightPrefixesAdjusted)\n\n totRight = sum(nums[mid+1:R+1])\n leftSuffixesAdjusted = [(totRight + num) for num in leftSuffixes]\n suffixes = self.merger(leftSuffixesAdjusted, rightSuffixes)\n\n # print(L,R,tot + recLeft[0] + recRight[0])\n return (tot + recLeft[0] + recRight[0], prefixes, suffixes)\n\n\n\n\n \n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n '''\n Break into range nums[L...mid], nums[mid+1...R]\n solve the problem on each side\n when combining, assume you have sortedPrefixSum for mid+1...R (and for L ... mid)\n do a 2 pointer technique on the sorted suffix sums on the left sums for keeping track of >= lower and <= upper\n add sum(L...mid) to each of sortedSum[mid+1 ... R]\n merge sorted Sum and return that as well as the amount\n '''\n return self.sorter(nums, lower, upper, 0, len(nums)-1)[0]","runtime":"2887"},{"code":"from typing import List\n\nclass Solution:\n def __init__(self):\n self.ans = 0\n\n def add(self, a, b):\n j, k = 0, 0\n while j < len(a) and k < len(b):\n if a[j] < b[k]:\n j += 1\n else:\n self.ans += len(a) - j\n k += 1\n\n def merge(self, a, b):\n c = []\n j, k = 0, 0\n while j < len(a) and k < len(b):\n if a[j] < b[k]:\n c.append(a[j])\n j += 1\n else:\n self.ans += len(a) - j\n c.append(b[k])\n k += 1\n while j < len(a):\n c.append(a[j])\n j += 1\n while k < len(b):\n c.append(b[k])\n k += 1\n return c\n\n def sorts(self, a, x):\n if len(a) <= 1:\n return a\n n = len(a)\n b = a[:n//2]\n c = a[n//2:]\n \n xx = self.sorts(b, x)\n yy = self.sorts(c, x)\n \n d = [val - x for val in yy]\n self.add(xx, d)\n \n return self.merge(xx, yy)\n\n def func(self, a, x):\n self.ans = 0\n self.sorts(a, x)\n return self.ans\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n num = [0] * len(nums)\n for i in range(len(nums)):\n num[i] = nums[i]\n \n n = len(nums)\n for i in range(1, n):\n num[i] += num[i - 1]\n\n key1 = self.func(num, lower - 1)\n key2 = self.func(num, upper)\n \n key3 = sum(1 for val in num if lower <= val <= upper)\n \n return -key1 + key2 + key3\n","runtime":"2955"},{"code":"class BinaryIndexedTree:\n def __init__(self, n):\n self.n = n\n self.c = [0] * (n + 1)\n \n def update(self, x, v):\n while x <= self.n:\n self.c[x] += v\n x += x & -x\n \n def query(self, x):\n s = 0\n while x > 0:\n s += self.c[x]\n x -= x & -x\n return s\n\nclass Solution:\n def countRangeSum(self, nums, lower, upper):\n n = len(nums)\n s = [0] * (n + 1)\n for i in range(n):\n s[i + 1] = s[i] + nums[i]\n \n arr = []\n for i in range(n + 1):\n arr.append(s[i])\n arr.append(s[i] - lower)\n arr.append(s[i] - upper)\n \n arr = sorted(set(arr))\n m = len(arr)\n \n tree = BinaryIndexedTree(m)\n ans = 0\n \n def search(x):\n l, r = 0, m\n while l < r:\n mid = (l + r) // 2\n if arr[mid] >= x:\n r = mid\n else:\n l = mid + 1\n return l + 1\n \n for x in s:\n l = search(x - upper)\n r = search(x - lower)\n ans += tree.query(r) - tree.query(l - 1)\n tree.update(search(x), 1)\n \n return ans\n","runtime":"3023"},{"code":"import bisect\n\nclass Solution:\n \"\"\"\n Calculate Prefix Sum: \n Given an array arr[] of size n, \n its prefix sum is another array prefixSum[] of the same size, \n such that the value of prefixSum[i] is arr[0] + arr[1] + arr[2] … arr[i].\n \n Input : arr[] = {1, 2, 1}, lower = 2; upper = 3\n Output : prefixSum[] = {1, 3, 4}\n\n Count pairs where its sums is in range\n (i = 0, j = 0) = 1 - 1 = 0 -> not in range (2,3)\n \n (i = 1, j = 0) = 3 - 1 = 2 -> in range (2,3)\n (i = 1, j = 1) = 3 - 3 = 0 -> not in range (2,3)\n\n (i = 2, j = 0) = 4 - 1 = 3 -> in range (2,3)\n (i = 2, j = 1) = 4 - 2 = 2 -> in range (2,3)\n (i = 2, j = 2) = 4 - 4 = 0 -> not in range (2,3)\n \"\"\"\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Initialize the countPairs, curSum\n countPairs, curSum = 0, 0\n\n # Initialize the prefixSum, with middle value of 0\n # there can be negateive and positive values too\n prefixSum = [0]\n for num in nums:\n \n # prefix sum\n curSum += num\n \n # bisect_left(list value)\n # Returns an index (left of same value) to insert given value to make the list sorted.\n left_index = bisect.bisect_left(prefixSum, curSum - upper)\n\n # bisect_right(list value)\n # Returns an index (right of same values) to insert given value to make the list sorted.\n right_index = bisect.bisect_right(prefixSum, curSum - lower)\n\n # count such pairs\n countPairs += right_index - left_index\n\n # add curSum into prefixSum so that prefixSum is still sorted\n # it is needed to handle negative values\n bisect.insort(prefixSum, curSum)\n\n return countPairs","runtime":"3092"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n ps, ret = [0], 0\n for s in accumulate(nums):\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\n bisect.insort(ps, s)\n return ret","runtime":"3160"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n ps, ret = [0], 0\n for s in accumulate(nums):\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\n bisect.insort(ps, s)\n return ret","runtime":"3229"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n cum_sum, cur_sum, res = [0], 0, 0\n for i in nums:\n cur_sum += i\n res += bisect_right(cum_sum, cur_sum - lower) - bisect_left(cum_sum, cur_sum - upper)\n bisect.insort(cum_sum, cur_sum)\n return res\n ","runtime":"3297"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n countPairs, curSum = 0, 0\n prefixSum = [0]\n for num in nums:\n \n\n curSum += num\n \n\n left_index = bisect_left(prefixSum, curSum - upper)\n\n right_index = bisect_right(prefixSum, curSum - lower)\n\n countPairs += right_index - left_index\n \n insort(prefixSum,curSum)\n # ind=bisect_left(prefixSum,curSum)\n # prefixSum.insert(ind,curSum)\n\n return countPairs\n","runtime":"3365"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n sl = [0]\n ans, p = 0, 0\n \n for x in nums:\n p += x\n left = bisect.bisect_left(sl, p - upper)\n right = bisect.bisect_right(sl, p - lower)\n ans += right - left\n insort(sl, p)\n\n return ans","runtime":"3434"},{"code":"import bisect\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefixArr = list(itertools.accumulate(nums))\n # print(f\"{prefixArr=}\")\n left = [0]\n counter = 0\n for num in prefixArr:\n i = bisect.bisect_left(left, num - upper)\n j = bisect.bisect_right(left, num - lower)\n counter += j-i\n # lower <= num - x <= upper\n # -upper <= x - num <= -lower\n # -upper + num <= x <= -lower + num\n bisect.insort(left, num)\n return counter","runtime":"3502"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n ps, ret = [0], 0\n for s in accumulate(nums):\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\n bisect.insort(ps, s)\n return ret","runtime":"3570"},{"code":"import bisect\n\nclass Solution:\n \"\"\"\n Calculate Prefix Sum: \n Given an array arr[] of size n, \n its prefix sum is another array prefixSum[] of the same size, \n such that the value of prefixSum[i] is arr[0] + arr[1] + arr[2] … arr[i].\n \n Input : arr[] = {1, 2, 1}, lower = 2; upper = 3\n Output : prefixSum[] = {1, 3, 4}\n\n Count pairs where its sums is in range\n (i = 0, j = 0) = 1 - 1 = 0 -> not in range (2,3)\n \n (i = 1, j = 0) = 3 - 1 = 2 -> in range (2,3)\n (i = 1, j = 1) = 3 - 3 = 0 -> not in range (2,3)\n\n (i = 2, j = 0) = 4 - 1 = 3 -> in range (2,3)\n (i = 2, j = 1) = 4 - 2 = 2 -> in range (2,3)\n (i = 2, j = 2) = 4 - 4 = 0 -> not in range (2,3)\n \"\"\"\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Initialize the countPairs, curSum\n countPairs, curSum = 0, 0\n\n # Initialize the prefixSum, with middle value of 0\n # there can be negateive and positive values too\n prefixSum = [0]\n for num in nums:\n \n # prefix sum\n curSum += num\n \n # bisect_left(list value)\n # Returns an index (left of same value) to insert given value to make the list sorted.\n left_index = bisect.bisect_left(prefixSum, curSum - upper)\n\n # bisect_right(list value)\n # Returns an index (right of same values) to insert given value to make the list sorted.\n right_index = bisect.bisect_right(prefixSum, curSum - lower)\n\n # count such pairs\n countPairs += right_index - left_index\n\n # add curSum into prefixSum so that prefixSum is still sorted\n # it is needed to handle negative values\n bisect.insort(prefixSum, curSum)\n\n return countPairs","runtime":"3639"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n ps, ret = [0], 0\n for s in accumulate(nums):\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\n bisect.insort(ps, s)\n return ret","runtime":"3707"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n record = []\n cnt = 0\n import bisect\n\n cur_sum = 0\n for num in nums:\n cur_sum += num\n idx_right = bisect.bisect_right(record, cur_sum-lower)\n idx_left = bisect.bisect_left(record, cur_sum-upper)\n cnt += (idx_right-idx_left)\n\n if lower <= cur_sum <= upper:\n cnt += 1\n\n bisect.insort(record, cur_sum)\n \n return cnt\n\n\n\n\n\n \n ","runtime":"3707"},{"code":"class Bit:\n def __init__(self, n):\n self.bit = [0] * (n + 1)\n self.length = n + 1\n def update(self, i, val):\n while i < self.length:\n self.bit[i] += val\n i += self._find_LSB(i)\n def prefix_sum(self, i):\n res = 0\n while i > 0:\n res += self.bit[i]\n i -= self._find_LSB(i)\n return res\n def _find_LSB(self, i):\n return i & (-i)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n \n \"\"\"\n reference from Solutions: [Python3] 4 solutions @ye15\n\n Concepts:\n 1. range sum -> BIT\n 2. lower, upper -> binary search (我沒有反應過來導致暴力窮舉，使最下面的解為 TLE)\n \n \"\"\"\n\n res = prefix = 0\n seen = [0]\n\n for x in nums:\n \"\"\"\n lower <= prefix - seen[i] <= upper\n 求 seen[i] 的有效區間 -> 求 seen[i] 的範圍\n prefix - upper <= seen[i] <= prefix - lower\n \"\"\"\n prefix += x\n a = bisect_left(seen, prefix - upper)\n b = bisect_right(seen, prefix - lower)\n res += b - a\n bisect.insort(seen, prefix)\n \n return res\n\n prefix = [0]\n for x in nums:\n prefix.append(prefix[-1] + x)\n \n def recur(lo, hi):\n\n if lo + 1 >= hi:\n return 0\n\n mid = (lo + hi) >> 1\n res = recur(lo, mid) + recur(mid, hi)\n k1 = k2 = mid\n for i in range(lo, mid):\n while k1 < hi and prefix[k1] - prefix[i] < lower:\n k1 += 1\n while k2 < hi and prefix[k2] - prefix[i] <= upper:\n k2 += 1\n if k2 > k1:\n res += (k2 - k1)\n\n prefix[lo: hi] = sorted(prefix[lo: hi])\n return res\n \n return recur(0, len(prefix))\n\n \"\"\"\n reference from Solutions: [Python3] 4 solutions @ye15\n\n Concepts:\n 1. range sum -> BIT\n 2. lower, upper -> binary search (我沒有反應過來導致暴力窮舉，使最下面的解為 TLE)\n 3. 不斷拆解區間去計算 range sum \n -> divide and conquer 我完全沒有想到這個算法 = =\n 應該說，我直接被“拆解區間“這邊徹底難住了\n \"\"\"\n\n # prefix and hashmap\n # (1) condition: lower <= prefix[i] - prefix[j] <= upper\n # -> target = prefix[i] - prefix[j]\n # (target exists in [lower, upper])\n # -> prefix[i] - target = prefix[j]\n # (2) use hashmap to record the prefix[i]\n # if prefix[i] - target (as prefix[j]) exists in hashmap,\n # then prefix[i] - prefix[j] = target exists\n\n prefix = [0]\n for x in nums:\n prefix.append(prefix[-1] + x)\n \n hashmap = defaultdict(int)\n res = 0\n for pre_sum in prefix:\n for target in range(lower, upper + 1):\n if pre_sum - target in hashmap:\n res += hashmap[pre_sum - target]\n hashmap[pre_sum] += 1\n \n return res\n\n\n # divide and conquer\n prefix_sum = [0]\n for x in nums:\n prefix.append(prefix[-1] + x)\n \n def recur(lo, hi):\n if lo + 1 >= hi:\n return 0\n mid = (lo + hi) // 2\n res = recur(lo, mid) + recur(mid, hi)\n k1 = k2 = mid\n for i in range(lo, mid):\n while k1 < hi and prefix[k1] - prefix[i] < lower:\n k1 += 1\n while k2 < hi and prefix[k2] - prefix[i] <= upper:\n k2 += 1\n res += (k2 - k1)\n prefix[lo: hi] = sorted(prefix[lo: hi])\n return res\n \n return recur(0, len(prefix))\n\n # TLE: O((nlogn) ^ 2)\n n = len(nums)\n bit_tree = Bit(n)\n for i, x in enumerate(nums):\n bit_tree.update(i + 1, x)\n \n res = 0\n for i in range(1, n + 1):\n a = bit_tree.prefix_sum(i)\n for j in range(i):\n b = bit_tree.prefix_sum(j)\n if lower <= a - b <= upper:\n res += 1\n \n return res\n\n # TLE: O((nlogn) ^ 2)\n n = len(nums)\n bit_tree = Bit(n)\n for i, x in enumerate(nums):\n bit_tree.update(i + 1, x)\n \n res = 0\n for i in range(1, n + 1):\n a = bit_tree.prefix_sum(i)\n for j in range(i):\n b = bit_tree.prefix_sum(j)\n if lower <= a - b <= upper:\n res += 1\n \n return res","runtime":"3775"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n ps, ret = [0], 0\n for s in accumulate(nums):\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\n bisect.insort(ps, s)\n return ret","runtime":"3844"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix,cur,res = [0],0,0\n for n in nums:\n cur += n\n A = bisect.bisect_right(prefix, cur-lower)\n B = bisect.bisect_left(prefix, cur-upper)\n res += A - B\n bisect.insort(prefix, cur)\n return res\n ","runtime":"3844"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n ans = prefix = 0\n seen = [0]\n for c in nums:\n prefix+=c\n lo = bisect.bisect_left(seen,prefix-upper)\n hi = bisect.bisect_left(seen,prefix-lower+1)\n ans+= hi -lo\n bisect.insort(seen,prefix)\n return ans","runtime":"3912"},{"code":"class Solution:\n \"\"\"\n Input : arr[] = {1, 2, 1}, lower = 2; upper = 3\n Output : prefixSum[] = {1, 3, 4}\n\n Count pairs where their sums are in the range [lower, upper]:\n (i = 0, j = 0) = 1 - 1 = 0 -> not in range [2, 3]\n (i = 1, j = 0) = 3 - 1 = 2 -> in range [2, 3]\n (i = 1, j = 1) = 3 - 3 = 0 -> not in range [2, 3]\n (i = 2, j = 0) = 4 - 1 = 3 -> in range [2, 3]\n (i = 2, j = 1) = 4 - 2 = 2 -> in range [2, 3]\n (i = 2, j = 2) = 4 - 4 = 0 -> not in range [2, 3]\n \"\"\"\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Initialize the count of valid pairs and the current cumulative sum.\n countPairs, curSum = 0, 0\n\n # Initialize the prefix sum list with an initial value of 0.\n # This is because a subarray sum can start from the beginning of the array.\n prefixSum = [0]\n \n for num in nums:\n # Add the current number to the cumulative sum.\n curSum += num\n \n # Find the leftmost index where curSum - upper can be inserted in prefixSum\n # and still maintain the sorted order. This index represents the first\n # valid prefix that, when subtracted from curSum, gives a value within the range.\n left_index = bisect.bisect_left(prefixSum, curSum - upper)\n\n # Find the rightmost index where curSum - lower can be inserted in prefixSum\n # and still maintain the sorted order. This index represents the last\n # valid prefix that, when subtracted from curSum, gives a value within the range.\n right_index = bisect.bisect_right(prefixSum, curSum - lower)\n\n # The difference between right_index and left_index gives the number of valid\n # subarrays that have a sum within the range [lower, upper].\n countPairs += right_index - left_index\n\n # Insert the current cumulative sum into the prefixSum list while keeping it sorted.\n # This allows us to efficiently find valid prefix sums for future iterations.\n bisect.insort(prefixSum, curSum)\n\n # Return the total count of valid pairs.\n return countPairs\n","runtime":"3912"},{"code":"class SegmentTreeNode:\n\tdef __init__(self,low,high):\n\t\tself.low = low\n\t\tself.high = high\n\t\tself.left = None\n\t\tself.right = None\n\t\tself.cnt = 0 \n \nclass Solution: \n def _bulid(self, left, right): \n root = SegmentTreeNode(self.cumsum[left],self.cumsum[right])\n if left == right:\n return root\n \n mid = (left+right)//2\n root.left = self._bulid(left, mid)\n root.right = self._bulid(mid+1, right)\n return root\n \n def _update(self, root, val):\n if not root:\n return \n if root.low<=val<=root.high:\n root.cnt += 1\n self._update(root.left, val)\n self._update(root.right, val)\n \n def _query(self, root, lower, upper):\n if lower <= root.low and root.high <= upper:\n return root.cnt\n if upper < root.low or root.high < lower:\n return 0\n return self._query(root.left, lower, upper) + self._query(root.right, lower, upper)\n \n # prefix-sum + SegmentTree | O(nlogn) \n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n cumsum = [0]\n for n in nums:\n cumsum.append(cumsum[-1]+n)\n \n self.cumsum = sorted(list(set(cumsum))) # need sorted\n root = self._bulid(0,len(self.cumsum)-1)\n \n res = 0\n for csum in cumsum:\n res += self._query(root, csum-upper, csum-lower)\n self._update(root, csum) \n return res","runtime":"3980"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n record = []\n cnt = 0\n import bisect\n\n cur_sum = 0\n for num in nums:\n cur_sum += num\n idx_right = bisect.bisect_right(record, cur_sum-lower)\n idx_left = bisect.bisect_left(record, cur_sum-upper)\n cnt += (idx_right-idx_left)\n\n if lower <= cur_sum <= upper:\n cnt += 1\n\n bisect.insort(record, cur_sum)\n print(idx_right, idx_left)\n \n return cnt\n\n\n\n\n\n \n ","runtime":"3980"},{"code":"class Solution:\n def merger(self, a, b, reverse=False):\n aptr = 0\n bptr = 0\n lst = []\n while aptr < len(a) or bptr < len(b):\n if aptr == len(a):\n lst.append(b[bptr])\n bptr += 1\n elif bptr == len(b):\n lst.append(a[aptr])\n aptr += 1\n else:\n if a[aptr] <= b[bptr]:\n lst.append(a[aptr])\n aptr += 1\n else:\n lst.append(b[bptr])\n bptr += 1\n if reverse:\n return lst[::-1]\n return lst\n\n def sorter(self, nums, lower, upper, L, R):\n # return a tuple of amount, sortedPrefixSum, sortedSuffixSum\n if L == R:\n if nums[L] >= lower and nums[L] <= upper:\n print(L,R,1)\n return (1, [nums[L]], [nums[L]])\n print(L,R,0)\n return (0, [nums[L]], [nums[L]])\n mid = int((L+R)/2)\n recLeft = self.sorter(nums, lower, upper, L, mid)\n recRight = self.sorter(nums, lower, upper, mid+1, R)\n # do calculations\n tot = 0\n leftPrefixes, rightPrefixes = recLeft[1], recRight[1]\n leftSuffixes, rightSuffixes = recLeft[2], recRight[2]\n\n # if L == 0 and R == 5:\n # print(\"------\")\n # print(leftPrefixes)\n # print(rightPrefixes)\n # print(leftSuffixes)\n # print(rightSuffixes)\n # print(\"------\")\n\n l = 0\n r = -1\n for leftSuffix in leftSuffixes[::-1]:\n while l < len(rightPrefixes) and leftSuffix + rightPrefixes[l] < lower:\n l += 1\n if l == len(rightPrefixes):\n break\n \n r = max(l-1,r)\n while r+1 < len(rightPrefixes) and leftSuffix + rightPrefixes[r+1] <= upper:\n r += 1\n \n if r >= l and r < len(rightPrefixes) and leftSuffix + rightPrefixes[r] <= upper and l >= 0:\n tot += r-l+1\n if L == 0 and R == 5:\n print(leftSuffix, r-l+1)\n else:\n if L == 0 and R == 5:\n print(leftSuffix, 0)\n \n\n # do the merging\n totLeft = sum(nums[L:mid+1])\n rightPrefixesAdjusted = [(totLeft + num) for num in rightPrefixes]\n prefixes = self.merger(leftPrefixes, rightPrefixesAdjusted)\n\n totRight = sum(nums[mid+1:R+1])\n leftSuffixesAdjusted = [(totRight + num) for num in leftSuffixes]\n suffixes = self.merger(leftSuffixesAdjusted, rightSuffixes)\n\n print(L,R,tot + recLeft[0] + recRight[0])\n return (tot + recLeft[0] + recRight[0], prefixes, suffixes)\n\n\n\n\n \n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n '''\n Break into range nums[L...mid], nums[mid+1...R]\n solve the problem on each side\n when combining, assume you have sortedPrefixSum for mid+1...R (and for L ... mid)\n do a 2 pointer technique on the sorted suffix sums on the left sums for keeping track of >= lower and <= upper\n add sum(L...mid) to each of sortedSum[mid+1 ... R]\n merge sorted Sum and return that as well as the amount\n '''\n return self.sorter(nums, lower, upper, 0, len(nums)-1)[0]","runtime":"4049"},{"code":"class Solution:\n SEG = []\n N = 0\n def add_point(self, ind: int, l: int, r: int, pos: int):\n if not r - l == 1:\n if pos < (r + l) // 2:\n self.add_point(2 * ind, l, (r + l) // 2, pos)\n else:\n self.add_point(2 * ind + 1, (r + l) // 2, r, pos)\n self.SEG[ind] += 1\n \n def range_sum(self, ind: int, l: int, r: int, b: int, e: int):\n if l >= b and r <= e:\n return self.SEG[ind]\n if l >= e or r <= b:\n return 0\n return self.range_sum(2 * ind, l, (r + l) // 2, b, e) + self.range_sum(2 * ind + 1, (r + l) // 2, r, b, e)\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n all_point = set([0])\n sm = 0\n for num in nums:\n sm += num\n all_point.add(sm)\n all_point.add(sm - lower)\n all_point.add(sm - upper)\n all_point = list(all_point)\n all_point = sorted(all_point)\n mp = {}\n sm = 0\n for pt in all_point:\n mp[pt] = sm\n sm += 1\n self.N = len(all_point)\n self.SEG = [0] * (4 * (self.N + 1))\n self.add_point(1, 0, self.N, mp[0])\n res = 0\n sm = 0\n for num in nums:\n sm += num\n res += self.range_sum(1, 0, self.N, mp[sm - upper], mp[sm - lower] + 1)\n self.add_point(1, 0, self.N, mp[sm])\n return res","runtime":"4117"},{"code":"class TreeNode:\n def __init__(self, val, left = None, right = None):\n self.val = val\n self.count = 1\n self.left = left\n self.right = right\n self.height = 1\n\nclass AVLTree:\n def __init__(self):\n self.root = None\n \n def add_value(self, value):\n self.root = self.add(self.root, value)\n\n def add(self, root, value):\n if not root:\n return TreeNode(value)\n\n if value == root.val:\n root.count += 1\n elif value < root.val:\n root.left = self.add(root.left, value)\n root.count += 1\n elif value > root.val:\n root.right = self.add(root.right, value)\n root.height = 1 + max(self.height(root.left), self.height(root.right))\n\n bal = self.balance(root)\n if bal > 1:\n if value > root.left.val:\n root.left = self.left_rotate(root.left)\n root = self.right_rotate(root)\n elif bal < -1:\n if value < root.right.val:\n root.right = self.right_rotate(root.right)\n root = self.left_rotate(root)\n\n return root\n\n def height(self, root):\n return root.height if root else 0\n \n def adjust_height(self, root):\n\t\t root.height = 1 + max(self.height(root.left), self.height(root.right))\n\n def balance(self, root):\n return self.height(root.left) - self.height(root.right) if root else 0\n\n def left_rotate(self, pivot):\n pivot_next = pivot.right\n pivot_next.left, pivot.right = pivot, pivot_next.left\n pivot_next.count += pivot.count\n self.adjust_height(pivot)\n self.adjust_height(pivot_next)\n return pivot_next\n\n def right_rotate(self, pivot):\n pivot_next = pivot.left\n pivot_next.right, pivot.left = pivot, pivot_next.right\n pivot.count -= pivot_next.count\n self.adjust_height(pivot)\n self.adjust_height(pivot_next)\n return pivot_next\n \n def find_value(self, val):\n return self.find(self.root, val)\n \n def find(self, root, val):\n if not root:\n return 0\n \n if root.val == val:\n return root.count\n elif root.val <= val:\n return root.count + self.find(root.right, val)\n else:\n return self.find(root.left, val)\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n res = 0\n tree = AVLTree()\n tree.add_value(0)\n total = 0\n for i in range(len(nums)):\n total += nums[i]\n res += tree.find_value(total - lower) - tree.find_value(total - upper - 1)\n tree.add_value(total)\n return res\n","runtime":"4185"},{"code":"class SegmentTree:\n def __init__(self, size):\n self.size = size\n self.tree = [0] * (4 * size)\n \n def update(self, node, start, end, idx, val):\n if start == end:\n self.tree[node] += val\n else:\n mid = (start + end) // 2\n if start <= idx <= mid:\n self.update(2 * node + 1, start, mid, idx, val)\n else:\n self.update(2 * node + 2, mid + 1, end, idx, val)\n self.tree[node] = self.tree[2 * node + 1] + self.tree[2 * node + 2]\n \n def query(self, node, start, end, l, r):\n if r < start or end < l:\n return 0\n if l <= start and end <= r:\n return self.tree[node]\n mid = (start + end) // 2\n left_query = self.query(2 * node + 1, start, mid, l, r)\n right_query = self.query(2 * node + 2, mid + 1, end, l, r)\n return left_query + right_query\n \n def range_query(self, l, r):\n return self.query(0, 0, self.size - 1, l, r)\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n \n # Coordinate compression\n all_sums = sorted(set(prefix_sums + [x - lower for x in prefix_sums] + [x - upper for x in prefix_sums]))\n sum_index = {v: i for i, v in enumerate(all_sums)}\n \n # Initialize segment tree\n seg_tree = SegmentTree(len(all_sums))\n count = 0\n \n for sum_val in prefix_sums:\n # Query the number of prefix sums in the range [sum_val - upper, sum_val - lower]\n left_index = sum_index[sum_val - upper] if (sum_val - upper) in sum_index else 0\n right_index = sum_index[sum_val - lower] if (sum_val - lower) in sum_index else len(all_sums) - 1\n count += seg_tree.range_query(left_index, right_index)\n \n # Update the segment tree with the current prefix sum\n seg_tree.update(0, 0, len(all_sums) - 1, sum_index[sum_val], 1)\n \n return count","runtime":"4254"},{"code":"class SegTreeNode:\n def __init__(self, left=-1, right=-1, val=0, lazy_tag=None, left_node=None, right_node=None):\n self.left = left # 区间左边界\n self.right = right # 区间右边界\n self.mid = left + (right - left) // 2 # 区间中间点\n self.left_node = left_node # 区间左节点\n self.right_node = right_node # 区间右节点\n self.val = val # 节点值（区间值）\n self.lazy_tag = lazy_tag # 区间问题的延迟更新标记\n\n\n# 动态开点线段树类\nclass SegmentTree:\n # 初始化线段树接口\n def __init__(self, function):\n self.tree = SegTreeNode(-2 ** 31, 2 ** 31 - 1)\n self.function = function # function 是一个函数，左右区间的聚合方法\n\n # 单点更新，将 nums[i] 更改为 val\n def update_point(self, i, val):\n self._update_point(i, val, self.tree)\n\n # 区间查询，查询区间为 [q_left, q_right] 的区间值\n def query_interval(self, q_left, q_right):\n return self._query_interval(q_left, q_right, self.tree)\n\n # 以下为内部实现方法\n\n # 单点更新，将 nums[i] 更改为 val。node 节点的区间为 [node.left, node.right]\n def _update_point(self, i, val, node):\n if node.left == node.right:\n node.val += val # 叶子节点，节点值修改为 val\n return\n\n if i <= node.mid: # 在左子树中更新节点值\n if node.left_node is None:\n node.left_node = SegTreeNode(node.left, node.mid)\n self._update_point(i, val, node.left_node)\n else: # 在右子树中更新节点值\n if node.right_node is None:\n node.right_node = SegTreeNode(node.mid + 1, node.right)\n self._update_point(i, val, node.right_node)\n self._push_up(node) # 向上更新节点的区间值\n\n # 区间查询，在线段树的 [left, right] 区间范围中搜索区间为 [q_left, q_right] 的区间值\n def _query_interval(self, q_left, q_right, node):\n if node.left >= q_left and node.right <= q_right: # 节点所在区间被 [q_left, q_right] 所覆盖\n return node.val # 直接返回节点值\n if node.right < q_left or node.left > q_right: # 节点所在区间与 [q_left, q_right] 无关\n return 0\n\n res_left = 0 # 左子树查询结果\n res_right = 0 # 右子树查询结果\n if q_left <= node.mid: # 在左子树中查询\n if node.left_node is None:\n node.left_node = SegTreeNode(node.left, node.mid)\n res_left = self._query_interval(q_left, q_right, node.left_node)\n if q_right > node.mid: # 在右子树中查询\n if node.right_node is None:\n node.right_node = SegTreeNode(node.mid + 1, node.right)\n res_right = self._query_interval(q_left, q_right, node.right_node)\n return self.function(res_left, res_right) # 返回左右子树元素值的聚合计算结果\n\n # 向上更新 node 节点区间值，节点的区间值等于该节点左右子节点元素值的聚合计算结果\n def _push_up(self, node):\n left_node = node.left_node\n right_node = node.right_node\n left_node_val = left_node.val if left_node else 0\n right_node_val = right_node.val if right_node else 0\n\n node.val = self.function(left_node_val, right_node_val)\n\n\nclass Solution:\n def get_presum(self, nums):\n pre_sum = [0] * (len(nums) + 1)\n\n for i in range(len(nums)):\n pre_sum[i + 1] = pre_sum[i] + nums[i]\n\n return pre_sum\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n pre_sum = self.get_presum(nums)\n # 平移的距离\n # offset = 10\n # 初始化线段数\n segment_tree = SegmentTree(lambda x, y: x + y)\n\n res = 0\n for val in pre_sum:\n left = val - upper\n right = val - lower\n res += segment_tree.query_interval(left, right)\n # 更新当前数对应的线段数内的index的值\n if -2 ** 31 <= val <= 2 ** 31 - 1:\n segment_tree.update_point(val, 1)\n\n return res","runtime":"4322"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4390"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4459"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4527"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4596"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4664"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4732"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4801"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4869"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"4937"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5006"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5074"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n\n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n\n mid = (start + end) //2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n\n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n\n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n\n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n\n return _query(node.left) + _query(node.right)\n return _query(self.root)\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sum_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sum_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sum_to_ind[presum - upper]\n high = sum_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sum_to_ind[presum])\n return result","runtime":"5142"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5211"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result\n","runtime":"5279"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = build(start, mid)\n node.right = build(mid + 1, end)\n return node\n self.root = build(start, end)\n \n def update(self, index):\n def updateNode(node):\n if not node or node.start > index or node.end < index:\n return\n if node.start == node.end == index:\n node.count += 1\n return\n \n updateNode(node.left)\n updateNode(node.right)\n node.count = node.left.count + node.right.count\n\n updateNode(self.root)\n \n def query(self, queryStart, queryEnd):\n def queryNode(node):\n if not node or node.start > queryEnd or node.end < queryStart:\n return 0\n if node.start >= queryStart and node.end <= queryEnd:\n return node.count\n \n return queryNode(node.left) + queryNode(node.right)\n return queryNode(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n possibleAllSums = []\n for presum in presums:\n possibleAllSums.append(presum)\n possibleAllSums.append(presum - upper)\n possibleAllSums.append(presum - lower)\n sumsToIndex = {s: ind for ind, s in enumerate(sorted(set(possibleAllSums)))}\n\n segmentTree = SegmentTree(0, len(sumsToIndex) - 1)\n\n result = 0\n for presum in presums:\n low = sumsToIndex[presum - upper]\n high = sumsToIndex[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sumsToIndex[presum])\n return result","runtime":"5347"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5416"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5484"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5552"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5621"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5689"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5757"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5826"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","runtime":"5894"},{"code":"class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n\nclass SegmentTree:\n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return Node(start, end)\n \n mid = (start + end) // 2\n node = Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result\n","runtime":"5963"}],"string":"[\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n st = SortedList([])\\n l = len(nums)\\n p = nums.copy()\\n for i in range(1, l):\\n p[i] += p[i - 1]\\n ans = 0\\n for i in range(l - 1, -1, -1):\\n st.add(p[i])\\n prev = p[i - 1] if i - 1 >= 0 else 0\\n lw, up = lower + prev, upper + prev\\n l, r = st.bisect_left(lw), st.bisect_right(up)\\n ans += (r - l)\\n return ans\\n \",\n \"runtime\": \"1110\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # ans = prefix = 0\\n # seen = [0]\\n # for c in nums:\\n # prefix+=c\\n # lo = bisect.bisect_left(seen,prefix-upper)\\n # hi = bisect.bisect_left(seen,prefix-lower+1)\\n # ans+= hi -lo\\n # bisect.insort(seen,prefix)\\n # return ans\\n cnt = 0\\n sl = SortedList()\\n range_offset = 0\\n for num in nums:\\n sl.add(range_offset)\\n range_offset += -num\\n l = sl.bisect_left(lower + range_offset)\\n r = sl.bisect_right(upper + range_offset)\\n cnt += (r - l)\\n return cnt\",\n \"runtime\": \"1110\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n res = 0\\n\\n prevSums = SortedList()\\n currSum = 0\\n for n in nums:\\n prevSums.add(currSum)\\n currSum += n\\n\\n res += prevSums.bisect_right(currSum - lower) - prevSums.bisect_left(currSum - upper)\\n\\n return res\\n\",\n \"runtime\": \"1178\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n from sortedcontainers import SortedList\\n\\n # Initialize a sorted list to maintain prefix sums\\n prefix_sums = SortedList([0])\\n current_sum = 0\\n count = 0\\n\\n for num in nums:\\n current_sum += num\\n # We need to find the valid range of sums\\n range_start = current_sum - upper\\n range_end = current_sum - lower\\n # Count the number of prefix sums in this valid range\\n count += prefix_sums.bisect_right(range_end) - prefix_sums.bisect_left(range_start)\\n # Add the current prefix sum to the sorted list\\n prefix_sums.add(current_sum)\\n\\n return count\",\n \"runtime\": \"1178\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n curr_sum = 0\\n count = 0\\n sorted_list = SortedList()\\n sorted_list.add(0)\\n for i in range(len(nums)):\\n curr_sum += nums[i]\\n #the prefix sum changes depending on what the curr_sum is. e.g. if curr_sum is -2,\\n #then to be within -2 and 2, we want to find the range -4 and 0, so that when we add to -2, we fall within the range\\n count += sorted_list.bisect_right(curr_sum-lower) - sorted_list.bisect_left(curr_sum-upper)\\n #bisectr has bigger index, bisectl is smaller. we want the number of sums inbetween, \\n #so get index of bright - index of bleft\\n sorted_list.add(curr_sum)\\n return count\\n\",\n \"runtime\": \"1246\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n sums = []\\n for num in nums:\\n sums.append(num+(sums[-1] if sums else 0))\\n sorted_list = SortedList([0])\\n res = 0\\n for sum in sums:\\n res+=sorted_list.bisect_right(sum-lower) - sorted_list.bisect_left(sum-upper)\\n sorted_list.add(sum)\\n return res\",\n \"runtime\": \"1246\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = [0]\\n sum = 0\\n for num in nums:\\n sum += num\\n prefix.append(sum)\\n return self.merge(prefix, 0, len(prefix), lower, upper)\\n \\n def merge(self, prefix, lo, hi, lower, upper):\\n mid = (lo+hi) // 2\\n if mid == lo:\\n return 0\\n count = self.merge(prefix, lo, mid, lower, upper) + self.merge(prefix, mid, hi, lower, upper) \\n i = j = mid\\n for left in prefix[lo:mid]:\\n while i < hi and prefix[i] - left < lower: i += 1\\n while j < hi and prefix[j] - left <= upper: j += 1\\n count += j - i\\n prefix[lo:hi] = sorted(prefix[lo:hi])\\n return count\\n \",\n \"runtime\": \"1315\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n def countWhileMerging(prefix_sums, start, end):\\n if end - start <= 1:\\n return 0\\n mid = (start + end) // 2\\n count = countWhileMerging(prefix_sums, start, mid) + countWhileMerging(prefix_sums, mid, end)\\n \\n j = k = mid\\n for left in prefix_sums[start:mid]:\\n while k < end and prefix_sums[k] - left < lower:\\n k += 1\\n while j < end and prefix_sums[j] - left <= upper:\\n j += 1\\n count += j - k\\n \\n # Merge step\\n prefix_sums[start:end] = sorted(prefix_sums[start:end])\\n return count\\n \\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n \\n return countWhileMerging(prefix_sums, 0, len(prefix_sums))\",\n \"runtime\": \"1315\"\n },\n {\n \"code\": \"class Solution:\\n # prefix-sum + merge-sort | time complexity: O(nlogn)\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Initialize prefix sum array with an initial value of 0\\n cumulsum = [0]\\n ## Compute prefix sums for the given nums array for n in nums\\n for n in nums:\\n cumulsum.append(cumulsum[-1]+n)\\n \\n\\t\\t# Define a helper function for the merge sort \\n # This function will also count the valid ranges during the merging process\\n def mergesort(left,right):\\n # Base case\\n if left == right:\\n return 0\\n # Calculate the middle index for the current range \\n mid = (left+right)//2\\n # Recursively sort and count the left and right halves\\n cnt = mergesort(left,mid) + mergesort(mid+1,right)\\n \\n\\t\\t\\t# Initialize pointers for the current left and right subarrays\\n i = j = mid+1\\n \\n # Iterate through the left subarray to count valid ranges\\n for l in cumulsum[left:mid+1]:\\n \\n # Move the pointer i to find the first valid range\\n while i <= right and cumulsum[i] - l < lower:\\n i+=1\\n \\n # Move the pointer j to find the last valid range \\n while j <= right and cumulsum[j] - l <= upper:\\n j+=1\\n \\n # Increment count by the number of valid ranges found\\n cnt += j-i\\n \\n # Merge the two sorted halves\\n cumulsum[left:right+1] = sorted(cumulsum[left:right+1])\\n return cnt\\n\\t\\t# Call the mergesort function on the entire prefix sum array\\n return mergesort(0,len(cumulsum)-1)\\n \\n \\n # Time :O(N)+ O(nlogn) = O(nlogn)\\n # Space : O(n)\\n \",\n \"runtime\": \"1383\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix_sum = [0]\\n\\n for n in nums:\\n prefix_sum.append(prefix_sum[-1]+n)\\n\\n def mergeSort(low,high):\\n if low == high:\\n return 0\\n \\n middle = low + (high-low)//2\\n solution = 0\\n\\n solution += mergeSort(low,middle) # left sub-array\\n solution += mergeSort(middle+1,high) # right sub-array\\n\\n right_start = middle+1\\n\\n i = j = right_start\\n\\n # for each element in the left sub-array\\n # counter how many prefix sums in the right \\n # satisfy the given condition\\n\\n for prefix in prefix_sum[low:middle+1]:\\n while i <= high and prefix_sum[i] - prefix < lower:\\n i += 1\\n while j <= high and prefix_sum[j] - prefix <= upper:\\n j += 1\\n\\n solution += j - i\\n \\n prefix_sum[low:high+1] = sorted(prefix_sum[low:high+1])\\n\\n return solution\\n \\n return mergeSort(0,len(nums))\\n\\n\\n\",\n \"runtime\": \"1383\"\n },\n {\n \"code\": \"from itertools import accumulate \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presum = [0] + list(accumulate(nums))\\n def mergeSort(left, right):\\n if right == left:\\n return 0\\n # print(left, right, presum)\\n mid = (left + right) // 2\\n cnt = mergeSort(left, mid) + mergeSort(mid + 1, right)\\n j = k = mid + 1\\n for i in range(left, mid + 1):\\n while j <= right and presum[j] - presum[i] <= upper:\\n j += 1\\n while k <= right and presum[k] - presum[i] < lower:\\n k += 1\\n # print(i, j, k)\\n cnt += j - k\\n presum[left:right+1] = sorted(presum[left:right+1])\\n # print(presum)\\n return cnt\\n return mergeSort(0, len(presum) - 1)\\n\\n \",\n \"runtime\": \"1451\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: list[int], lower: int, upper: int) -> int:\\n prefix_sums = [0] \\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n def count_while_sorting(prefix_sums, start, end):\\n if end - start <= 1:\\n return 0\\n mid = (start + end) // 2\\n count = count_while_sorting(prefix_sums, start, mid) + count_while_sorting(prefix_sums, mid, end)\\n j = k = mid\\n for i in range(start, mid):\\n while j < end and prefix_sums[j] - prefix_sums[i] < lower:\\n j += 1\\n while k < end and prefix_sums[k] - prefix_sums[i] <= upper:\\n k += 1\\n count += k - j\\n prefix_sums[start:end] = sorted(prefix_sums[start:end])\\n return count\\n return count_while_sorting(prefix_sums, 0, len(prefix_sums))\\n\",\n \"runtime\": \"1451\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefixes = [0]*(len(nums))\\n for i in range(len(prefixes)):\\n prefixes[i] = prefixes[i - 1] + nums[i]\\n\\n def recurse(l, r):\\n if l == r:\\n return 1 if lower <= prefixes[l] <= upper else 0\\n mid = (l + r)//2\\n\\n currval = recurse(l, mid) + recurse(mid + 1, r)\\n start, end = mid + 1, mid + 1\\n for left in prefixes[l: mid + 1]:\\n \\n \\n while start < r + 1 and prefixes[start] - left < lower:\\n start += 1\\n\\n while end < r + 1 and prefixes[end] - left <= upper:\\n end += 1\\n currval += end - start\\n \\n # lp, rp = l, mid + 1\\n # ret = []\\n # while lp < mid + 1 and rp < r + 1:\\n # if prefixes[lp] <= prefixes[rp]:\\n # ret.append(prefixes[lp])\\n # lp += 1\\n # else:\\n # ret.append(prefixes[rp])\\n # rp += 1\\n # ret.extend(prefixes[lp:mid + 1])\\n # ret.extend(prefixes[rp:r + 1])\\n prefixes[l: r + 1] = sorted(prefixes[l: r + 1])\\n return currval\\n\\n val = recurse(0, len(nums) - 1)\\n return val\\n\\n\\n \",\n \"runtime\": \"1520\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums, lower, upper):\\n def countWhileMergeSort(sums, start, end, lower, upper):\\n if end - start <= 1:\\n return 0\\n mid = (start + end) // 2\\n count = countWhileMergeSort(sums, start, mid, lower, upper) + countWhileMergeSort(sums, mid, end, lower, upper)\\n j, k, t = mid, mid, mid\\n temp = []\\n for left in sums[start:mid]:\\n while k < end and sums[k] - left <= upper:\\n k += 1\\n while j < end and sums[j] - left < lower:\\n j += 1\\n count += k - j\\n while t < end and sums[t] < left:\\n temp.append(sums[t])\\n t += 1\\n temp.append(left)\\n sums[start:start+len(temp)] = temp\\n return count\\n \\n sums = [0] * (len(nums) + 1)\\n for i in range(len(nums)):\\n sums[i + 1] = sums[i] + nums[i]\\n \\n return countWhileMergeSort(sums, 0, len(sums), lower, upper)\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.countRangeSum([-2, 5, -1], -2, 2)) # Output: 3\\nprint(solution.countRangeSum([0], 0, 0)) # Output: 1\",\n \"runtime\": \"1520\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Initialize prefix sums\\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n \\n def merge_count(start: int, end: int) -> int:\\n if end - start <= 1:\\n return 0\\n \\n mid = (start + end) // 2\\n count = merge_count(start, mid) + merge_count(mid, end)\\n \\n # Counting the ranges in a sorted fashion\\n j = k = mid\\n temp = []\\n r = mid\\n \\n for left in prefix_sums[start:mid]:\\n # Count the ranges [k, j) where the sum lies within [lower, upper]\\n while k < end and prefix_sums[k] - left < lower:\\n k += 1\\n while j < end and prefix_sums[j] - left <= upper:\\n j += 1\\n count += j - k\\n \\n # Merge process\\n while r < end and prefix_sums[r] < left:\\n temp.append(prefix_sums[r])\\n r += 1\\n temp.append(left)\\n \\n # Complete the merge by appending any remaining elements\\n while r < end:\\n temp.append(prefix_sums[r])\\n r += 1\\n \\n # Copy back the merged and sorted subarray into the original array\\n prefix_sums[start:start+len(temp)] = temp\\n \\n return count\\n \\n return merge_count(0, len(prefix_sums))\\n\",\n \"runtime\": \"1588\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums, lower, upper):\\n def merge_sort(sums, left, right, lower, upper):\\n if right - left <= 1:\\n return 0\\n mid = (left + right) // 2\\n count = merge_sort(sums, left, mid, lower, upper) + merge_sort(sums, mid, right, lower, upper)\\n j, k, t = mid, mid, mid\\n temp = []\\n for i in range(left, mid):\\n while k < right and sums[k] - sums[i] < lower:\\n k += 1\\n while j < right and sums[j] - sums[i] <= upper:\\n j += 1\\n count += j - k\\n while t < right and sums[t] < sums[i]:\\n temp.append(sums[t])\\n t += 1\\n temp.append(sums[i])\\n sums[left:left+len(temp)] = temp\\n return count\\n \\n sums = [0] * (len(nums) + 1)\\n for i in range(len(nums)):\\n sums[i + 1] = sums[i] + nums[i]\\n return merge_sort(sums, 0, len(sums), lower, upper)\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.countRangeSum([-2, 5, -1], -2, 2)) # Output: 3\\nprint(solution.countRangeSum([0], 0, 0)) # Output: 1\",\n \"runtime\": \"1588\"\n },\n {\n \"code\": \"class Solution:\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # merge sort\\n prefix_sum = [0]\\n for num in nums:\\n prefix_sum.append(prefix_sum[-1] + num)\\n \\n return self.mergesort(prefix_sum, lower, upper, 0, len(prefix_sum) - 1)\\n \\n def mergesort(self, prefix_sum, lower, upper, left, right):\\n if left == right:\\n return 0\\n mid = (left + right) // 2\\n count = self.mergesort(prefix_sum, lower, upper, left, mid) + self.mergesort(prefix_sum, lower, upper, mid + 1, right)\\n i = j = mid + 1\\n for left_value in prefix_sum[left : mid + 1]:\\n while i <= right and prefix_sum[i] - left_value < lower:\\n i += 1\\n while j <= right and prefix_sum[j] - left_value <= upper:\\n j += 1\\n count += j - i\\n \\n tmp = []\\n p1, p2 = left, mid + 1\\n\\n while p1 <= mid and p2 <= right:\\n if prefix_sum[p1] < prefix_sum[p2]:\\n tmp.append(prefix_sum[p1])\\n p1 += 1\\n else:\\n tmp.append(prefix_sum[p2])\\n p2 += 1\\n\\n \\n while p1 <= mid:\\n tmp.append(prefix_sum[p1]) \\n p1 += 1\\n\\n while p2 <= right:\\n tmp.append(prefix_sum[p2]) \\n p2 += 1\\n\\n prefix_sum[left:right+1] = tmp[:]\\n return count\",\n \"runtime\": \"1656\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n Sum, BITree = [0] * (n + 1), [0] * (n + 2)\\n \\n def count(x):\\n s = 0\\n while x:\\n s += BITree[x]\\n x -= (x & -x)\\n return s\\n \\n def update(x):\\n while x <= n + 1:\\n BITree[x] += 1\\n x += (x & -x)\\n \\n for i in range(n):\\n Sum[i + 1] = Sum[i] + nums[i]\\n sortSum, res = sorted(Sum), 0\\n for sum_j in Sum:\\n sum_i_count = count(bisect.bisect_right(sortSum, sum_j - lower)) - count(bisect.bisect_left(sortSum, sum_j - upper))\\n res += sum_i_count\\n update(bisect.bisect_left(sortSum, sum_j) + 1)\\n return res\",\n \"runtime\": \"1656\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n pref = [0] * (n+1)\\n for i in range(n):\\n pref[i+1] = pref[i] + nums[i]\\n \\n \\n def count(arr,l,m,r):\\n cnt = 0\\n k,j = m+1,m+1\\n for i in range(l,m+1):\\n while j <= r and arr[j] - arr[i] <= upper:\\n j+=1\\n while k <= r and arr[k] - arr[i] < lower:\\n k+=1\\n cnt += j-k\\n return cnt\\n\\n \\n def merge(arr,l,m,r):\\n cnt = count(arr,l,m,r)\\n i,j = l,m+1\\n res = []\\n while i <= m and j <= r:\\n if arr[i] <= arr[j]:\\n res.append(arr[i])\\n i+=1\\n else:\\n res.append(arr[j])\\n j+=1\\n while i <= m:\\n res.append(arr[i])\\n i+=1\\n while j <= r:\\n res.append(arr[j])\\n j+=1\\n arr[l:r+1] = res\\n return cnt\\n \\n def divide(arr,l,r):\\n if r <= l:\\n return 0\\n mid = (r+l) // 2\\n left = divide(arr,l,mid)\\n right = divide(arr,mid+1,r)\\n cnt = merge(arr,l,mid,r)\\n return left+right+cnt\\n\\n cnt = divide(pref,0,n)\\n return cnt\",\n \"runtime\": \"1725\"\n },\n {\n \"code\": \"class Solution:\\n # def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # n = len(nums)\\n\\n # prefix = [0]\\n # prefix_sum = 0\\n # for i in range(n):\\n # prefix_sum += nums[i]\\n # prefix.append(prefix_sum)\\n\\n # # use modified merge-sort to count the number of valid ranges\\n # return self.countAndMergeSort(prefix, 0, n+1, lower, upper)\\n\\n # def countAndMergeSort(self, prefix, start, end, lower, upper):\\n # # print(f\\\"The start of a new function, prefix is {prefix}\\\")\\n # # base case: no array (end not reachable)\\n # if end - start - 1 <= 0:\\n # return 0\\n\\n # mid = (start + end) // 2\\n\\n # # recursive -> count valid ranges in left and right halves\\n # count = self.countAndMergeSort(prefix, start, mid, lower, upper) + \\\\\\n # self.countAndMergeSort(prefix, mid, end, lower, upper)\\n\\n # # count the valid ranges in current two SORTED halves:\\n # mergeOutput = [None] * (end - start)\\n # idx = 0 # used to put values in mergeOutput\\n\\n # ##### @@@@@ FROM HERE ON DID NOT SEE CLEARLY... #####\\n # for i in range(start, mid):\\n # # print(f\\\"The start of a loop, prefix is {prefix}\\\")\\n # smallPtr = mid\\n # while smallPtr < end and prefix[smallPtr] - prefix[i] < lower:\\n # smallPtr += 1\\n\\n # upperPtr = mid\\n # while upperPtr < end and prefix[upperPtr] - prefix[i] <= upper:\\n # upperPtr += 1\\n\\n # mergePtr = mid\\n # while mergePtr < end and prefix[mergePtr] < prefix[i]:\\n # mergeOutput[idx] = prefix[mergePtr]\\n # idx += 1\\n # mergePtr += 1\\n\\n # mergeOutput[idx] = prefix[i]\\n # idx += 1\\n\\n # count += upperPtr - smallPtr\\n\\n # # print(f\\\"The end of a loop, prefix is {prefix}\\\")\\n\\n # # UPDATE the prefix list!!\\n # prefix[start : start + idx] = mergeOutput[: idx]\\n\\n # return count\\n\\n def countRangeSum(self, nums, lower, upper):\\n n = len(nums)\\n \\n # Create a prefix sums array (sums[i] = sum of nums[0] to nums[i-1])\\n sums = [0] * (n + 1)\\n for i in range(n):\\n sums[i + 1] = sums[i] + nums[i]\\n \\n # Use modified merge sort to count the number of valid ranges\\n return self.countWhileMergeSort(sums, 0, n + 1, lower, upper)\\n\\n def countWhileMergeSort(self, sums, start, end, lower, upper):\\n # Base case: when the range is too small to form a valid subarray\\n if end - start <= 1:\\n return 0\\n \\n # Find the midpoint to divide the sums array\\n mid = (start + end) // 2\\n \\n # Recursively count the valid ranges in both halves\\n count = self.countWhileMergeSort(sums, start, mid, lower, upper) \\\\\\n + self.countWhileMergeSort(sums, mid, end, lower, upper)\\n \\n # Initialize pointers and cache for the merge process\\n j = mid\\n k = mid\\n t = mid\\n cache = [0] * (end - start) # Temporary array for merge\\n r = 0 # Index for the cache\\n \\n # For each prefix sum in the left half (from start to mid)\\n for i in range(start, mid):\\n # Move `k` to find the smallest index in the right half\\n # such that sums[k] - sums[i] >= lower\\n while k < end and sums[k] - sums[i] < lower:\\n k += 1\\n \\n # Move `j` to find the smallest index in the right half\\n # such that sums[j] - sums[i] > upper\\n while j < end and sums[j] - sums[i] <= upper:\\n j += 1\\n \\n # Move `t` to merge the sorted halves\\n while t < end and sums[t] < sums[i]:\\n cache[r] = sums[t]\\n t += 1\\n r += 1\\n \\n # Copy the current sum[i] to the cache\\n cache[r] = sums[i]\\n r += 1\\n \\n # Count the number of valid subarray sums for this prefix sum[i]\\n count += j - k\\n \\n # Copy the sorted sums back into the original array\\n sums[start:start + r] = cache[:r]\\n \\n return count\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"1725\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums, lower, upper):\\n # Function to merge two halves and count valid range sums\\n def merge_and_count(start, end):\\n if start == end:\\n return [prefix[start]], 0\\n\\n mid = (start + end) // 2\\n left, count_left = merge_and_count(start, mid)\\n right, count_right = merge_and_count(mid + 1, end)\\n\\n merged, count = merge(left, right, start, mid, end, lower, upper)\\n return merged, count + count_left + count_right\\n\\n # Function to merge two sorted halves and count valid range sums\\n def merge(left, right, start, mid, end, lower, upper):\\n i = j = 0\\n count = 0\\n merged = []\\n\\n # Count valid range sums\\n for left_sum in left:\\n while i < len(right) and right[i] - left_sum < lower:\\n i += 1\\n while j < len(right) and right[j] - left_sum <= upper:\\n j += 1\\n count += j - i\\n\\n # Merge two sorted arrays\\n i = j = 0\\n while i < len(left) and j < len(right):\\n if left[i] <= right[j]:\\n merged.append(left[i])\\n i += 1\\n else:\\n merged.append(right[j])\\n j += 1\\n merged.extend(left[i:] or right[j:])\\n\\n return merged, count\\n\\n n = len(nums)\\n prefix = [0] * (n + 1)\\n for i in range(1, n + 1):\\n prefix[i] = prefix[i - 1] + nums[i - 1]\\n\\n _, count = merge_and_count(0, n)\\n return count\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [-2, 5, -1]\\nlower = -2\\nupper = 2\\nprint(solution.countRangeSum(nums, lower, upper)) # Output: 3\",\n \"runtime\": \"1793\"\n },\n {\n \"code\": \"class Solution:\\n count = 0\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n def mergeSort(pref, l, r):\\n if l == r:\\n if lower <= pref[l] <= upper:\\n return 1\\n if l >= r:\\n return 0\\n\\n mid = l + (r - l) // 2\\n count = mergeSort(pref, l, mid) + mergeSort(pref, mid + 1, r)\\n\\n right = pref[mid + 1: r+ 1]\\n for left in pref[l:mid+1]:\\n i = bisect_left(right, lower + left) # values at >= i will be >= lower val\\n j = bisect_right(right, upper + left) - 1 # values at <= j will be <= upper val\\n if i <= j:\\n count += (j - i + 1)\\n\\n pref[l:r + 1] = sorted(pref[l:r + 1])\\n\\n return count\\n\\n \\n prefix_arr = [0]*(len(nums))\\n prefix_arr[0] = nums[0]\\n for i in range(1, len(nums)):\\n prefix_arr[i] = prefix_arr[i-1] + nums[i]\\n\\n count = mergeSort(prefix_arr, 0, len(nums) - 1)\\n\\n return count\",\n \"runtime\": \"1793\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n self.ans = 0\\n prefix = [0] + list(itertools.accumulate(nums))\\n\\n self._mergeSort(prefix, 0, n, lower, upper)\\n return self.ans\\n\\n def _mergeSort(self, prefix: List[int], l: int, r: int, lower: int, upper: int) -> None:\\n if l >= r:\\n return\\n\\n m = (l + r) // 2\\n self._mergeSort(prefix, l, m, lower, upper)\\n self._mergeSort(prefix, m + 1, r, lower, upper)\\n self._merge(prefix, l, m, r, lower, upper)\\n\\n def _merge(self, prefix: List[int], l: int, m: int, r: int, lower: int, upper: int) -> None:\\n lo = m + 1 # the first index s.t. prefix[lo] - prefix[i] >= lower\\n hi = m + 1 # the first index s.t. prefix[hi] - prefix[i] > upper\\n\\n # For each index i in range [l, m], add hi - lo to `ans`.\\n for i in range(l, m + 1):\\n while lo <= r and prefix[lo] - prefix[i] < lower:\\n lo += 1\\n while hi <= r and prefix[hi] - prefix[i] <= upper:\\n hi += 1\\n self.ans += hi - lo\\n\\n sorted = [0] * (r - l + 1)\\n k = 0 # sorted's index\\n i = l # left's index\\n j = m + 1 # right's index\\n\\n while i <= m and j <= r:\\n if prefix[i] < prefix[j]:\\n sorted[k] = prefix[i]\\n k += 1\\n i += 1\\n else:\\n sorted[k] = prefix[j]\\n k += 1\\n j += 1\\n\\n # Put the possible remaining left part into the sorted array.\\n while i <= m:\\n sorted[k] = prefix[i]\\n k += 1\\n i += 1\\n\\n # Put the possible remaining right part into the sorted array.\\n while j <= r:\\n sorted[k] = prefix[j]\\n k += 1\\n j += 1\\n\\n prefix[l:l + len(sorted)] = sorted\",\n \"runtime\": \"1862\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n #tried to work from my solution to someone else's solution, ended up copying most of their code\\n prefixes = [0]*(len(nums))\\n for i in range(len(prefixes)):\\n prefixes[i] = prefixes[i - 1] + nums[i]\\n\\n def recurse(l, r):\\n if l == r:\\n return 1 if lower <= prefixes[l] <= upper else 0\\n mid = (l + r)//2\\n\\n currval = recurse(l, mid) + recurse(mid + 1, r)\\n start = end = mid + 1 # from this line to the end of the for loop is the key part\\n for left in prefixes[l: mid + 1]:\\n \\n \\n while start < r + 1 and prefixes[start] - left < lower:\\n start += 1\\n\\n while end < r + 1 and prefixes[end] - left <= upper:\\n end += 1\\n currval += end - start\\n \\n lp, rp = l, mid + 1\\n ret = []\\n while lp < mid + 1 and rp < r + 1:\\n if prefixes[lp] <= prefixes[rp]:\\n ret.append(prefixes[lp])\\n lp += 1\\n else:\\n ret.append(prefixes[rp])\\n rp += 1\\n ret.extend(prefixes[lp:mid + 1])\\n ret.extend(prefixes[rp:r + 1])\\n prefixes[l: r + 1] = ret\\n return currval\\n\\n val = recurse(0, len(nums) - 1)\\n return val\\n\\n\\n \",\n \"runtime\": \"1862\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Step 1: Create prefix sum array\\n # This allows us to quickly calculate the sum of any range [i, j] as prefix_sum[j+1] - prefix_sum[i]\\n prefix_sum = [0] # Start with 0 to handle cases where we need the sum from the beginning\\n for num in nums:\\n prefix_sum.append(prefix_sum[-1] + num)\\n \\n def mergeSort(start, end):\\n # Base case: if the range has 0 or 1 element, there's nothing to sort or count\\n if start >= end:\\n return 0\\n \\n mid = (start + end) // 2\\n \\n # Recursively sort and count in left and right halves\\n count = mergeSort(start, mid) + mergeSort(mid + 1, end)\\n \\n # Count range sums that span across the two halves\\n j = k = mid + 1 # Initialize two pointers for the right half\\n for i in range(start, mid + 1): # For each element in left half\\n # Find the first element in right half where the range sum >= lower\\n while j <= end and prefix_sum[j] - prefix_sum[i] < lower:\\n j += 1\\n # Find the first element in right half where the range sum > upper\\n while k <= end and prefix_sum[k] - prefix_sum[i] <= upper:\\n k += 1\\n # The difference k - j gives the count of elements in [lower, upper]\\n count += k - j\\n \\n # Merge the two sorted halves\\n merged = []\\n left, right = start, mid + 1\\n while left <= mid and right <= end:\\n if prefix_sum[left] <= prefix_sum[right]:\\n merged.append(prefix_sum[left])\\n left += 1\\n else:\\n merged.append(prefix_sum[right])\\n right += 1\\n \\n # Append any remaining elements\\n merged.extend(prefix_sum[left:mid+1])\\n merged.extend(prefix_sum[right:end+1])\\n \\n # Copy merged array back to prefix_sum\\n for i, val in enumerate(merged):\\n prefix_sum[start + i] = val\\n \\n return count\\n \\n # Start the merge sort process on the entire prefix sum array\\n return mergeSort(0, len(prefix_sum) - 1)\\n\",\n \"runtime\": \"1930\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = nums.copy()\\n for i in range(1, len(nums)):\\n prefix[i] += prefix[i-1]\\n self.count = 0\\n for n in prefix:\\n if lower <= n <= upper:\\n self.count += 1\\n \\n def merge(left_arr, right_arr):\\n # Step 1: counting pairs i, j\\n start, end = 0, 0 # index of right_arr\\n # loop though left_arr to fix i index\\n for i in range(len(left_arr)):\\n # find the interval of start to end in right_arr\\n # sliding windows [start, end]\\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\\n start += 1\\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\\n end += 1\\n self.count += end - start\\n\\n # Step 2: merge 2 sorted arr\\n l, r = 0, 0\\n sorted_arr = []\\n while l < len(left_arr) and r < len(right_arr):\\n if left_arr[l] < right_arr[r]:\\n sorted_arr.append(left_arr[l])\\n l += 1\\n else:\\n sorted_arr.append(right_arr[r])\\n r += 1\\n return sorted_arr + left_arr[l:] + right_arr[r:]\\n \\n def divide(arr):\\n if len(arr) <= 1: return arr\\n mid = len(arr)//2\\n left_arr = divide(arr[:mid])\\n right_arr = divide(arr[mid:])\\n return merge(left_arr, right_arr)\\n\\n divide(prefix)\\n return self.count\",\n \"runtime\": \"1930\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = nums.copy()\\n for i in range(1, len(nums)):\\n prefix[i] += prefix[i-1]\\n self.count = 0\\n for n in prefix:\\n if lower <= n <= upper:\\n self.count += 1\\n \\n def merge(left_arr, right_arr):\\n # Step 1: counting pairs i, j\\n start, end = 0, 0 # index of right_arr\\n # loop though left_arr to fix i index\\n for i in range(len(left_arr)):\\n # find the interval of start to end in right_arr\\n # sliding windows [start, end]\\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\\n start += 1\\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\\n end += 1\\n self.count += end - start\\n\\n # Step 2: merge 2 sorted arr\\n l, r = 0, 0\\n sorted_arr = []\\n while l < len(left_arr) and r < len(right_arr):\\n if left_arr[l] < right_arr[r]:\\n sorted_arr.append(left_arr[l])\\n l += 1\\n else:\\n sorted_arr.append(right_arr[r])\\n r += 1\\n return sorted_arr + left_arr[l:] + right_arr[r:]\\n \\n def divide(arr):\\n if len(arr) <= 1: return arr\\n mid = len(arr)//2\\n left_arr = divide(arr[:mid])\\n right_arr = divide(arr[mid:])\\n return merge(left_arr, right_arr)\\n\\n divide(prefix)\\n return self.count\",\n \"runtime\": \"1998\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = nums.copy()\\n for i in range(1, len(nums)):\\n prefix[i] += prefix[i-1]\\n self.count = 0\\n for n in prefix:\\n if lower <= n <= upper:\\n self.count += 1\\n \\n def merge(left_arr, right_arr):\\n # Step 1: counting pairs i, j\\n start, end = 0, 0 # index of right_arr\\n # loop though left_arr to fix i index\\n for i in range(len(left_arr)):\\n # find the interval of start to end in right_arr\\n # sliding windows [start, end]\\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\\n start += 1\\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\\n end += 1\\n self.count += end - start\\n\\n # Step 2: merge 2 sorted arr\\n l, r = 0, 0\\n sorted_arr = []\\n while l < len(left_arr) and r < len(right_arr):\\n if left_arr[l] < right_arr[r]:\\n sorted_arr.append(left_arr[l])\\n l += 1\\n else:\\n sorted_arr.append(right_arr[r])\\n r += 1\\n return sorted_arr + left_arr[l:] + right_arr[r:]\\n \\n def divide(arr):\\n if len(arr) <= 1: return arr\\n mid = len(arr)//2\\n left_arr = divide(arr[:mid])\\n right_arr = divide(arr[mid:])\\n return merge(left_arr, right_arr)\\n\\n divide(prefix)\\n return self.count\",\n \"runtime\": \"1998\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = nums.copy()\\n for i in range(1, len(nums)):\\n prefix[i] += prefix[i-1]\\n self.count = 0\\n for n in prefix:\\n if lower <= n <= upper:\\n self.count += 1\\n \\n def merge(left_arr, right_arr):\\n # Step 1: counting pairs i, j\\n start, end = 0, 0 # index of right_arr\\n # loop though left_arr to fix i index\\n for i in range(len(left_arr)):\\n # find the interval of start to end in right_arr\\n # sliding windows [start, end]\\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\\n start += 1\\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\\n end += 1\\n self.count += end - start\\n\\n # Step 2: merge 2 sorted arr\\n l, r = 0, 0\\n sorted_arr = []\\n while l < len(left_arr) and r < len(right_arr):\\n if left_arr[l] < right_arr[r]:\\n sorted_arr.append(left_arr[l])\\n l += 1\\n else:\\n sorted_arr.append(right_arr[r])\\n r += 1\\n return sorted_arr + left_arr[l:] + right_arr[r:]\\n \\n def divide(arr):\\n if len(arr) <= 1: return arr\\n mid = len(arr)//2\\n left_arr = divide(arr[:mid])\\n right_arr = divide(arr[mid:])\\n return merge(left_arr, right_arr)\\n\\n divide(prefix)\\n return self.count\\n\\n\\n \",\n \"runtime\": \"2067\"\n },\n {\n \"code\": \"class BIT:\\n\\n def __init__(self, n: int) -> None:\\n self.bit = [0 for _ in range(n + 1)]\\n\\n def update(self, i: int, val: int = 1) -> None:\\n i += 1\\n while i < len(self.bit):\\n self.bit[i] += val\\n i += self._find_RSB(i)\\n \\n def prefix_sum(self, i: int) -> int:\\n i += 1\\n s = 0\\n while i > 0:\\n s += self.bit[i]\\n i -= self._find_RSB(i)\\n return s\\n\\n def _find_RSB(self, i: int) -> int:\\n return i & -i\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n ps = [0]\\n for i in range(n): ps.append(ps[-1] + nums[i])\\n bit = BIT(n + 2)\\n sort_ps, res = sorted(ps), 0\\n for sum_j in ps:\\n res += bit.prefix_sum(bisect.bisect_right(sort_ps, sum_j - lower) - 1) - \\\\\\n bit.prefix_sum(bisect.bisect_left(sort_ps, sum_j - upper) - 1)\\n bit.update(bisect.bisect_left(sort_ps, sum_j))\\n return res\",\n \"runtime\": \"2067\"\n },\n {\n \"code\": \"class Solution:\\n bit=[]\\n def getRSB(self, i):\\n return i & -i\\n def getSum(self, i):\\n s = 0\\n while i > 0:\\n s += self.bit[i]\\n i -= self.getRSB(i)\\n return s\\n \\n def update(self, i):\\n while i < len(self.bit):\\n self.bit[i] += 1\\n i += self.getRSB(i)\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n psum = [0 for i in range(n+1)]\\n for i in range(n):\\n psum[i+1] = psum[i] + nums[i]\\n \\n sorted_psum = sorted(psum)\\n sorted_psum_map = {val: idx for idx, val in enumerate(sorted_psum)}\\n\\n res = 0\\n self.bit = [0 for i in range(n+2)]\\n\\n print(sorted_psum)\\n\\n for i in range(n+1):\\n pleft = psum[i] - upper\\n pright = psum[i] - lower\\n x = bisect.bisect_left(sorted_psum, pleft)\\n y = bisect.bisect_right(sorted_psum, pright)\\n\\n lsum = self.getSum(x)\\n rsum = self.getSum(y)\\n\\n res += rsum - lsum\\n\\n index = sorted_psum_map[psum[i]]\\n self.update(index+1)\\n\\n return res\\n\\n\\n \\n \",\n \"runtime\": \"2135\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.tmp = None\\n self.count = 0\\n self.lower = float('inf')\\n self.upper = -float('inf')\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n self.tmp = [0] * (n + 1)\\n pre_sum = [0] * (n + 1)\\n self.lower = lower\\n self.upper = upper\\n for i in range(n):\\n pre_sum[i + 1] += nums[i] + pre_sum[i]\\n self.m_sort(pre_sum, 0, n)\\n return self.count\\n \\n def m_sort(self, sums: List[int], lo: int, hi: int) -> None:\\n if lo >= hi:\\n return\\n mid = lo + (hi - lo) // 2\\n self.m_sort(sums, lo, mid)\\n self.m_sort(sums, mid + 1, hi)\\n self.merge(sums, lo, mid, hi)\\n \\n def merge(self, sums: List[int], lo: int, mid: int, hi: int) -> None:\\n for i in range(lo, hi + 1):\\n self.tmp[i] = sums[i]\\n start = end = mid + 1\\n for i in range(lo, mid + 1):\\n while start <= hi and sums[start] - sums[i] < self.lower:\\n start += 1\\n while end <= hi and sums[end] - sums[i] <= self.upper:\\n end += 1\\n self.count += end - start\\n i, j = lo, mid + 1\\n for k in range(lo, hi + 1):\\n if i > mid:\\n sums[k] = self.tmp[j]\\n j += 1\\n elif j > hi:\\n sums[k] = self.tmp[i]\\n i += 1\\n elif self.tmp[i] > self.tmp[j]:\\n sums[k] = self.tmp[j]\\n j += 1\\n else:\\n sums[k] = self.tmp[i]\\n i += 1\\n \",\n \"runtime\": \"2135\"\n },\n {\n \"code\": \"class BinaryIndexedTree:\\n def __init__(self, size):\\n self.size = size\\n self.tree = [0] * (size + 1)\\n\\n def update(self, index, val):\\n while index <= self.size:\\n self.tree[index] += val\\n index += index & -index\\n\\n def query(self, index):\\n sum_ = 0\\n while index > 0:\\n sum_ += self.tree[index]\\n index -= index & -index\\n return sum_\\n\\nclass Solution:\\n def countRangeSum(self, nums, lower, upper):\\n prefix_sums = list(accumulate(nums, initial=0))\\n sorted_arr = sorted(set(x for sum_ in prefix_sums for x in (sum_, sum_ - lower, sum_ - upper)))\\n tree = BinaryIndexedTree(len(sorted_arr))\\n count = 0\\n for sum_ in prefix_sums:\\n left = bisect_left(sorted_arr, sum_ - upper) + 1\\n right = bisect_left(sorted_arr, sum_ - lower) + 1\\n count += tree.query(right) - tree.query(left - 1)\\n tree.update(bisect_left(sorted_arr, sum_) + 1, 1)\\n return count\",\n \"runtime\": \"2203\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = nums.copy()\\n for i in range(1, len(nums)):\\n prefix[i] += prefix[i - 1]\\n\\n self.count = 0\\n for n in prefix:\\n if lower <= n <= upper:\\n self.count += 1\\n\\n def merge(left_arr, right_arr):\\n start, end = 0, 0\\n for i in range(len(left_arr)):\\n while start < len(right_arr) and right_arr[start] - left_arr[i] < lower:\\n start += 1\\n while end < len(right_arr) and right_arr[end] - left_arr[i] <= upper:\\n end += 1\\n self.count += end - start\\n\\n l, r = 0, 0\\n sorted_arr = []\\n while l < len(left_arr) or r < len(right_arr):\\n if r >= len(right_arr) or (l < len(left_arr) and left_arr[l] < right_arr[r]):\\n sorted_arr.append(left_arr[l])\\n l += 1\\n else:\\n sorted_arr.append(right_arr[r])\\n r += 1\\n return sorted_arr\\n\\n def divide(arr):\\n if len(arr) <= 1: return arr\\n mid = len(arr)//2\\n left_arr = divide(arr[:mid])\\n right_arr = divide(arr[mid:])\\n return merge(left_arr, right_arr)\\n\\n divide(prefix)\\n return self.count\",\n \"runtime\": \"2203\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, data):\\n self.n = len(data)\\n self.tree = [0] * (2 * self.n)\\n \\n def update(self, index, value):\\n index += self.n\\n self.tree[index] += value\\n while index > 1:\\n index //= 2\\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\\n \\n def query(self, left, right):\\n result = 0\\n left += self.n\\n right += self.n\\n while left < right:\\n if left % 2:\\n result += self.tree[left]\\n left += 1\\n if right % 2:\\n right -= 1\\n result += self.tree[right]\\n left //= 2\\n right //= 2\\n return result\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n \\n all_sums = sorted(set(prefix_sums + [x - lower for x in prefix_sums] + [x - upper for x in prefix_sums]))\\n sum_index = {v: i for i, v in enumerate(all_sums)}\\n \\n seg_tree = SegmentTree([0] * len(all_sums))\\n count = 0\\n \\n for sum_val in prefix_sums:\\n left_index = sum_index[sum_val - upper]\\n right_index = sum_index[sum_val - lower]\\n count += seg_tree.query(left_index, right_index + 1)\\n seg_tree.update(sum_index[sum_val], 1)\\n \\n return count\\n\",\n \"runtime\": \"2272\"\n },\n {\n \"code\": \"class Solution:\\n temp = [];\\n count = 0;\\n\\n def isInRange(self, num: int, lower: int, higher: int):\\n return lower <= num and num <= higher;\\n\\n def getPreSums(self, nums: List[int]) -> List[int]:\\n presums = [0]*len(nums);\\n acc = 0;\\n for i, num in enumerate(nums):\\n acc += num;\\n presums[i] = acc;\\n return presums;\\n\\n def merge(self, presums: List[int], lower: int, upper: int, lo: int, mid: int, hi: int):\\n start = mid + 1\\n end = mid + 1\\n for i in range(lo, mid + 1):\\n while start <= hi and presums[start] - presums[i] < lower:\\n start += 1\\n while end <= hi and presums[end] - presums[i] <= upper:\\n end += 1\\n self.count += end - start\\n\\n # Sort presums\\n for i in range(lo, hi+1):\\n self.temp[i] = presums[i];\\n\\n i, j = lo, mid+1;\\n for pos in range(lo, hi+1):\\n if i == mid + 1:\\n presums[pos] = self.temp[j];\\n j += 1;\\n elif j == hi + 1:\\n presums[pos] = self.temp[i];\\n i += 1;\\n elif self.temp[i] <= self.temp[j]:\\n presums[pos] = self.temp[i];\\n i += 1;\\n else:\\n presums[pos] = self.temp[j];\\n j += 1;\\n\\n def _countRangeSum(self, presums: List[int], lower: int, upper: int, lo: int, hi: int) -> int:\\n if lo == hi:\\n if self.isInRange(presums[lo], lower, upper):\\n print('c', presums[lo])\\n self.count += 1;\\n return;\\n \\n mid = lo + (hi-lo)//2;\\n self._countRangeSum(presums, lower, upper, lo, mid);\\n self._countRangeSum(presums, lower, upper, mid+1, hi);\\n self.merge(presums, lower, upper, lo, mid, hi)\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = self.getPreSums(nums);\\n self.temp = [0]*len(nums);\\n self.count = 0;\\n self._countRangeSum(presums, lower, upper, 0, len(nums)-1);\\n return self.count;\\n\\n\\n \",\n \"runtime\": \"2272\"\n },\n {\n \"code\": \"'''\\nprefixSum == pS\\n\\npS[i] = sum(0:(i-1)) (i-1) is inclusive\\n\\nduring mergesort\\n\\n[low,mid] [mid+1, high]\\n\\nfor i in [low,mid] and j in [mid+1, high] -->\\n count pairs such that lower <= pS[j+1] - pS[i] <= upper\\n\\nfor each i \\nfind j1 such that pS[j+1] >= pS[i] + lower\\nfind j2 such that pS[j+1] <= pS[i] + upper\\n\\nBest Explanation is here – https://leetcode.com/problems/count-of-range-sum/solutions/1267104/c-simple-explanation-for-beginners-to-hard-problems\\n\\n'''\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n\\n prefixSums = [0 for _ in range(n+1)]\\n for i in range(n):\\n prefixSums[i+1] = prefixSums[i] + nums[i]\\n\\n # print(prefixSums)\\n\\n\\n def count_while_mergesort(prefixSums, left, right):\\n if left >= right:\\n return 0\\n \\n # if left + 1 == right:\\n # if prefixSums[right] - prefixSums[left] >= lower and prefixSums[right] - prefixSums[left] <= upper:\\n # return 1\\n # else:\\n # return 0\\n\\n mid = (left+right)//2\\n \\n left_count = count_while_mergesort(prefixSums, left, mid)\\n right_count = count_while_mergesort(prefixSums, mid+1, right)\\n\\n merge_count = merge(prefixSums, left, mid, right)\\n\\n # print(left, right)\\n # print(left_count, right_count, merge_count)\\n\\n return left_count + right_count + merge_count\\n\\n\\n def merge(prefixSums, left, mid, right):\\n # print('merge', left, mid, right)\\n arr_left = [prefixSums[k] for k in range(left, mid+1)]\\n arr_right = [prefixSums[k] for k in range(mid+1, right+1)]\\n\\n p1, p2, p3, p4, count = 0, 0, 0, 0, 0\\n\\n n1, n2 = mid-left+1, right-mid\\n\\n curr_p = left\\n\\n while p1 <= n1-1:\\n while p3 <= n2-1 and arr_right[p3] < arr_left[p1] + lower:\\n p3 += 1\\n\\n while p4 <= n2-1 and arr_right[p4] <= arr_left[p1] + upper:\\n p4 += 1\\n\\n while p2 <= n2-1 and arr_right[p2] < arr_left[p1]:\\n prefixSums[curr_p] = arr_right[p2]\\n p2 += 1\\n curr_p += 1\\n\\n prefixSums[curr_p] = arr_left[p1]\\n p1 += 1\\n curr_p += 1\\n count += p4-p3\\n\\n while p2 <= n2-1:\\n prefixSums[curr_p] = arr_right[p2]\\n p2 += 1\\n curr_p += 1\\n\\n return count\\n\\n\\n return count_while_mergesort(prefixSums, 0, n)\\n \\n\\n\\n \\n\\n\\n\\n # def divide_And_Conquer(start, end):\\n # if start == end:\\n # return 0\\n\\n # mid = (start + end)//2\\n # leftCount = divide_And_Conquer(start, mid)\\n # rightCount = divide_And_Conquer(mid+1, end)\\n # count = leftCount + rightCount\\n\\n # for i in range(start,mid+1):\\n # # p1 = mid+1\\n # # while p1 <= end and prefixSums[p1] < prefixSums[i]+lower:\\n # # p1 += 1\\n \\n # # p2 = p1\\n # # while p2 <= end and prefixSums[p2] <= prefixSums[i]+upper:\\n # # p2 += 1\\n\\n # p1 = mid+1 + bisect.bisect_left(prefixSums[(mid+1):(end+1)], prefixSums[i]+lower)\\n # p2 = mid+1 + bisect.bisect_right(prefixSums[(mid+1):(end+1)], prefixSums[i]+upper)\\n # count += p2 - p1\\n \\n # i = start\\n # j = mid+1\\n # k = 0\\n # mergedArray = [0 for _ in range(end-start+1)]\\n # while i <= mid and j <= end:\\n # if prefixSums[i] <= prefixSums[j]:\\n # mergedArray[k] = prefixSums[i]\\n # i += 1\\n # else:\\n # mergedArray[k] = prefixSums[j]\\n # j += 1\\n # k += 1\\n\\n # while i <= mid:\\n # mergedArray[k] = prefixSums[i]\\n # i += 1\\n # k += 1\\n\\n # while j <= end:\\n # mergedArray[k] = prefixSums[j]\\n # j += 1\\n # k += 1\\n\\n # prefixSums[start:(end+1)] = mergedArray\\n\\n # return count\\n\\n \\n # return divide_And_Conquer(0,n)\",\n \"runtime\": \"2340\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Divide and Conquer\\n n = len(nums)\\n if n <= 1:\\n # Doesn't actually have to convert to int, but for clarity\\n return int(nums and lower <= nums[0] <= upper)\\n else:\\n mid = n // 2\\n\\n # Suffix sum of the left array\\n suffix = [0] * (mid + 1)\\n for i in range(mid - 1, -1, -1):\\n suffix[i] = suffix[i + 1] + nums[i]\\n\\n # We exclude index mid from suffix\\n suffix = suffix[:-1]\\n\\n # Prefix sum of the right array\\n prefix = [0] * (n - mid + 1)\\n for i in range(mid, n):\\n prefix[i - mid + 1] = prefix[i - mid] + nums[i]\\n\\n # Again, we exclude index mid from prefix\\n # We also want to sort prefix, excluding mid\\n prefix = sorted(prefix[1:])\\n\\n # Find count when start index is on the left array, and right index is on the right array\\n count = 0\\n for suf in suffix:\\n count += bisect.bisect_right(prefix, upper - suf) - bisect.bisect_left(prefix, lower - suf)\\n\\n return count + self.countRangeSum(nums[:mid], lower, upper) + self.countRangeSum(nums[mid:], lower, upper)\",\n \"runtime\": \"2340\"\n },\n {\n \"code\": \"import copy\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # based on merge sort\\n\\n def _merge_sort(res, arr, left, right, lower, upper):\\n # exclusive of the right end\\n if right - left >= 2:\\n mid = left + (right - left) // 2\\n res, arr = _merge_sort(res, arr, left, mid, lower, upper)\\n res, arr = _merge_sort(res, arr, mid, right, lower, upper)\\n res, arr = _merge(res, arr, left, mid, right, lower, upper)\\n elif right - left == 1:\\n if (arr[left][0] >= lower) and (arr[left][0] <= upper):\\n res[arr[left][1]] += 1\\n return res, arr\\n \\n def _merge(res, arr, left, mid, right, lower, upper):\\n # we use two separate points to process merging and counting range sums\\n # \\n # NOTE: merge sort ensure that indices for arr's elements from [mid, right)\\n # are larger than elements from [left, mid)\\n i = left\\n j = mid\\n k_lower = mid\\n k_upper = mid\\n\\n sorted_arr = []\\n while i < mid:\\n lower_bound = arr[i][0] + lower\\n upper_bound = arr[i][0] + upper\\n\\n # we find how many are in the range of [lower_bound, upper_bound]\\n\\n # NOTE: we use \\\"< lower_bound\\\" to include the left end\\n while (k_lower < right) and (arr[k_lower][0] < lower_bound):\\n k_lower += 1\\n\\n # NOTE: we use \\\"<= upper_bound\\\" to include the right end\\n while (k_upper < right) and (arr[k_upper][0] <= upper_bound):\\n k_upper += 1\\n \\n # print('merge: ', (left, mid, right), 'arr: ', [_[0] for _ in arr[left:right]], 'bound: ', (lower_bound, upper_bound), (k_lower, k_upper))\\n\\n res[arr[i][1]] += k_upper - k_lower\\n # print(f'{res=}')\\n\\n while (j < right) and (arr[i][0] > arr[j][0]):\\n sorted_arr.append(arr[j])\\n j += 1\\n \\n sorted_arr.append(arr[i])\\n i += 1\\n \\n while j < right:\\n sorted_arr.append(arr[j])\\n j += 1\\n \\n for tmp_i in range(len(sorted_arr)):\\n arr[left + tmp_i] = sorted_arr[tmp_i]\\n \\n return res, arr\\n\\n arr = copy.deepcopy(nums)\\n for tmp_i, tmp_val in enumerate(nums):\\n if tmp_i == 0:\\n arr[tmp_i] = (arr[0], 0)\\n else:\\n arr[tmp_i] = (arr[tmp_i] + arr[tmp_i - 1][0], tmp_i)\\n \\n # result for #range_sums when starting from i\\n res = [0 for _ in nums]\\n\\n # print('arr before: ', [_[0] for _ in arr])\\n\\n res, arr = _merge_sort(res, arr, 0, len(nums), lower, upper)\\n\\n # print('arr after: ', [_[0] for _ in arr])\\n # print('res: ', res)\\n\\n return sum(res)\\n \",\n \"runtime\": \"2408\"\n },\n {\n \"code\": \"import copy\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # based on merge sort\\n\\n def _merge_sort(res, arr, left, right, lower, upper):\\n # exclusive of the right end\\n if right - left >= 2:\\n mid = left + (right - left) // 2\\n res, arr = _merge_sort(res, arr, left, mid, lower, upper)\\n res, arr = _merge_sort(res, arr, mid, right, lower, upper)\\n res, arr = _merge(res, arr, left, mid, right, lower, upper)\\n elif right - left == 1:\\n if (arr[left][0] >= lower) and (arr[left][0] <= upper):\\n res[arr[left][1]] += 1\\n return res, arr\\n \\n def _merge(res, arr, left, mid, right, lower, upper):\\n # we use two separate points to process merging and counting range sums\\n # \\n # NOTE: merge sort ensure that indices for arr's elements from [mid, right)\\n # are larger than elements from [left, mid)\\n i = left\\n j = mid\\n k_lower = mid\\n k_upper = mid\\n\\n sorted_arr = []\\n while i < mid:\\n lower_bound = arr[i][0] + lower\\n upper_bound = arr[i][0] + upper\\n\\n # we find how many are in the range of [lower_bound, upper_bound]\\n\\n # NOTE: we use \\\"< lower_bound\\\" to include the left end\\n while (k_lower < right) and (arr[k_lower][0] < lower_bound):\\n k_lower += 1\\n\\n # NOTE: we use \\\"<= upper_bound\\\" to include the right end\\n while (k_upper < right) and (arr[k_upper][0] <= upper_bound):\\n k_upper += 1\\n \\n # print('merge: ', (left, mid, right), 'arr: ', [_[0] for _ in arr[left:right]], 'bound: ', (lower_bound, upper_bound), (k_lower, k_upper))\\n\\n res[arr[i][1]] += k_upper - k_lower\\n # print(f'{res=}')\\n\\n while (j < right) and (arr[i][0] > arr[j][0]):\\n sorted_arr.append(arr[j])\\n j += 1\\n \\n sorted_arr.append(arr[i])\\n i += 1\\n \\n while j < right:\\n sorted_arr.append(arr[j])\\n j += 1\\n \\n for tmp_i in range(len(sorted_arr)):\\n arr[left + tmp_i] = sorted_arr[tmp_i]\\n \\n return res, arr\\n\\n arr = copy.deepcopy(nums)\\n for tmp_i, tmp_val in enumerate(nums):\\n if tmp_i == 0:\\n arr[tmp_i] = (arr[0], 0)\\n else:\\n arr[tmp_i] = (arr[tmp_i] + arr[tmp_i - 1][0], tmp_i)\\n \\n # result for #range_sums when starting from i\\n res = [0 for _ in nums]\\n\\n # print('arr before: ', [_[0] for _ in arr])\\n\\n res, arr = _merge_sort(res, arr, 0, len(nums), lower, upper)\\n\\n # print('arr after: ', [_[0] for _ in arr])\\n # print('res: ', res)\\n\\n return sum(res)\\n \",\n \"runtime\": \"2408\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass BIT:\\n def __init__(self, size):\\n self.size = size\\n self.tree = [0] * (size + 1)\\n\\n def update(self, index, delta):\\n while index <= self.size:\\n self.tree[index] += delta\\n index += index & -index\\n\\n def query(self, index):\\n total = 0\\n while index > 0:\\n total += self.tree[index]\\n index -= index & -index\\n return total\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Step 1: Calculate prefix sums\\n prefix_sum = 0\\n prefix_sums = [prefix_sum]\\n for num in nums:\\n prefix_sum += num\\n prefix_sums.append(prefix_sum)\\n\\n # Step 2: Discretize prefix sums (rank compression)\\n sorted_sums = SortedList(prefix_sums)\\n bit = BIT(len(sorted_sums))\\n\\n count = 0\\n for sum_j in prefix_sums:\\n # Step 3: Count valid prefix sums using BIT\\n left_bound = sorted_sums.bisect_right(sum_j - lower)\\n right_bound = sorted_sums.bisect_left(sum_j - upper)\\n count += bit.query(left_bound) - bit.query(right_bound)\\n\\n # Step 4: Update BIT with the rank of current prefix sum\\n rank = sorted_sums.index(sum_j) + 1\\n bit.update(rank, 1)\\n\\n return count\",\n \"runtime\": \"2477\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass BIT:\\n def __init__(self, size):\\n self.size = size\\n self.tree = [0] * (size + 1)\\n\\n def update(self, index, delta):\\n while index <= self.size:\\n self.tree[index] += delta\\n index += index & -index\\n\\n def query(self, index):\\n total = 0\\n while index > 0:\\n total += self.tree[index]\\n index -= index & -index\\n return total\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Step 1: Calculate prefix sums\\n prefix_sum = 0\\n prefix_sums = [prefix_sum]\\n for num in nums:\\n prefix_sum += num\\n prefix_sums.append(prefix_sum)\\n\\n # Step 2: Discretize prefix sums (rank compression)\\n sorted_sums = SortedList(prefix_sums)\\n bit = BIT(len(sorted_sums))\\n\\n count = 0\\n for sum_j in prefix_sums:\\n # Step 3: Count valid prefix sums using BIT\\n left_bound = sorted_sums.bisect_right(sum_j - lower)\\n right_bound = sorted_sums.bisect_left(sum_j - upper)\\n count += bit.query(left_bound) - bit.query(right_bound)\\n\\n # Step 4: Update BIT with the rank of current prefix sum\\n rank = sorted_sums.index(sum_j) + 1\\n bit.update(rank, 1)\\n\\n return count\",\n \"runtime\": \"2477\"\n },\n {\n \"code\": \"# from collections import defaultdict\\nfrom itertools import accumulate, chain\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n nums = list(chain([0], accumulate(nums)))\\n # print(nums)\\n self.result = 0\\n\\n def f(lst):\\n if len(lst) == 0:\\n return []\\n if len(lst) == 1:\\n return lst\\n n = len(lst) // 2\\n left, right = f(lst[:n]), f(lst[n:])\\n \\n min_j, max_j = -1, -1\\n for i in range(len(left)):\\n for j in range(min_j+1, len(right)):\\n if right[j] - left[i] < lower:\\n min_j = j\\n else:\\n break\\n for j in range(max_j+1, len(right)):\\n if right[j] - left[i] <= upper:\\n max_j = j\\n else:\\n break\\n self.result += max_j - min_j\\n\\n lst, i, j = [], 0, 0\\n while i < len(left) and j < len(right):\\n if left[i] < right[j]:\\n lst.append(left[i])\\n i += 1\\n else:\\n lst.append(right[j])\\n j += 1\\n if i == len(left):\\n return lst + right[j:]\\n else:\\n return lst + left[i:]\\n\\n f(nums)\\n return self.result\",\n \"runtime\": \"2545\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n if not nums:\\n return 0\\n\\n n = len(nums)\\n if n == 1:\\n return int(lower <= nums[0] <= upper)\\n\\n mid = n >> 1\\n count = sum([\\n self.countRangeSum(array, lower, upper)\\n for array in [nums[:mid], nums[mid:]]\\n ])\\n\\n suffix, prefix = [0] * (mid + 1), [0] * (n - mid + 1)\\n for i in range(mid - 1, -1, -1):\\n suffix[i] = suffix[i + 1] + nums[i]\\n\\n for i in range(mid, n):\\n prefix[i - mid + 1] = prefix[i - mid] + nums[i]\\n\\n suffix, prefix = suffix[:-1], sorted(prefix[1:])\\n count += sum([\\n bisect.bisect_right(prefix, upper - s) -\\n bisect.bisect_left(prefix, lower - s)\\n for s in suffix\\n ])\\n\\n return count\",\n \"runtime\": \"2545\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # self.counts = 0 \\n # def dfs(il, total):\\n # if not il:\\n # return \\n # for i in range(len(il)):\\n # total += il[i]\\n # if lower<=total<=upper:\\n # self.counts +=1 \\n # dfs(il[i+1:], total)\\n # total -= il[i]\\n\\n # dfs(nums, 0)\\n # return self.counts\\n \\n ##### divide and conque\\n \\n def countRangeSub(nums, l, r):\\n if l==r:\\n return int(nums[l] >= lower and nums[r] <= upper)\\n \\n m = l + (r-l)//2\\n suffix, tot = [], 0\\n\\n for i in range(m+1,r+1):\\n tot += nums[i]\\n suffix.append(tot)\\n\\n suffix.sort()\\n tot, C = 0, 0\\n for j in range(m, l-1, -1):\\n tot += nums[j]\\n C += bisect.bisect_right(suffix, upper-tot+0.5)-bisect.bisect_left(suffix, lower-tot-0.5)\\n \\n return countRangeSub(nums, l, m) + countRangeSub(nums, m+1, r) + C\\n \\n return countRangeSub(nums, 0, len(nums)-1) \\n \\n \\n \\n\\n \\n \\n \\n\\n \\n\\n \\n\\n\",\n \"runtime\": \"2613\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.count = 0\\n\\n def get_presum(self, nums):\\n pre_sum = [0] * (len(nums) + 1)\\n\\n for i in range(len(nums)):\\n pre_sum[i + 1] = pre_sum[i] + nums[i]\\n\\n return pre_sum\\n\\n def merge(self, left, right, lower, upper):\\n start = 0\\n end = 0\\n for val in left:\\n # origi_start_index = right[start][1]\\n # origi_end_index = right[end][1]\\n while start < len(right) and right[start] - val < lower:\\n start += 1\\n while end < len(right) and right[end] - val <= upper:\\n end += 1\\n self.count += end - start\\n\\n # 合并后的数组\\n result = []\\n while left and right:\\n # 对比两个数组的第一个元素\\n # 小的数字弹出并放进去结果数组\\n if left[0] <= right[0]:\\n result.append(left.pop(0))\\n else:\\n result.append(right.pop(0))\\n\\n # 如果左边还有数字，一定是有序的直接加到结果后面\\n if left:\\n result.extend(left)\\n # 同理右边\\n if right:\\n result.extend(right)\\n\\n return result\\n\\n def merge_sort(self, nums, lower, upper):\\n if len(nums) < 2:\\n return nums\\n\\n mid = len(nums) // 2\\n left = self.merge_sort(nums[:mid], lower, upper)\\n right = self.merge_sort(nums[mid:], lower, upper)\\n sub_res = self.merge(left, right, lower, upper)\\n\\n return sub_res\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n pre_sum = self.get_presum(nums)\\n\\n res = self.merge_sort(pre_sum, lower, upper)\\n\\n return self.count\\n\\n\\n \\n\\n \",\n \"runtime\": \"2750\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.count = 0\\n\\n def get_presum(self, nums):\\n pre_sum = [0] * (len(nums) + 1)\\n\\n for i in range(len(nums)):\\n pre_sum[i + 1] = pre_sum[i] + nums[i]\\n\\n return pre_sum\\n\\n def merge(self, left, right, lower, upper):\\n start = 0\\n end = 0\\n for val in left:\\n # origi_start_index = right[start][1]\\n # origi_end_index = right[end][1]\\n while start < len(right) and right[start] - val < lower:\\n start += 1\\n while end < len(right) and right[end] - val <= upper:\\n end += 1\\n self.count += end - start\\n\\n # 合并后的数组\\n result = []\\n while left and right:\\n # 对比两个数组的第一个元素\\n # 小的数字弹出并放进去结果数组\\n if left[0] <= right[0]:\\n result.append(left.pop(0))\\n else:\\n result.append(right.pop(0))\\n\\n # 如果左边还有数字，一定是有序的直接加到结果后面\\n if left:\\n result.extend(left)\\n # 同理右边\\n if right:\\n result.extend(right)\\n\\n return result\\n\\n def merge_sort(self, nums, lower, upper):\\n if len(nums) < 2:\\n return nums\\n\\n mid = len(nums) // 2\\n left = self.merge_sort(nums[:mid], lower, upper)\\n right = self.merge_sort(nums[mid:], lower, upper)\\n sub_res = self.merge(left, right, lower, upper)\\n\\n return sub_res\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n pre_sum = self.get_presum(nums)\\n\\n res = self.merge_sort(pre_sum, lower, upper)\\n\\n return self.count\\n\\n\\n \\n\\n \",\n \"runtime\": \"2750\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.count = 0\\n\\n def get_presum(self, nums):\\n pre_sum = [0] * (len(nums) + 1)\\n\\n for i in range(len(nums)):\\n pre_sum[i + 1] = pre_sum[i] + nums[i]\\n\\n return pre_sum\\n\\n def merge(self, left, right, lower, upper):\\n start = 0\\n end = 0\\n for val in left:\\n while start < len(right) and right[start] - val < lower:\\n start += 1\\n while end < len(right) and right[end] - val <= upper:\\n end += 1\\n self.count += end - start\\n\\n # 合并后的数组\\n result = []\\n while left and right:\\n # 对比两个数组的第一个元素\\n # 小的数字弹出并放进去结果数组\\n if left[0] <= right[0]:\\n result.append(left.pop(0))\\n else:\\n result.append(right.pop(0))\\n\\n # 如果左边还有数字，一定是有序的直接加到结果后面\\n if left:\\n result.extend(left)\\n # 同理右边\\n if right:\\n result.extend(right)\\n\\n return result\\n\\n def merge_sort(self, nums, lower, upper):\\n if len(nums) < 2:\\n return nums\\n\\n mid = len(nums) // 2\\n left = self.merge_sort(nums[:mid], lower, upper)\\n right = self.merge_sort(nums[mid:], lower, upper)\\n sub_res = self.merge(left, right, lower, upper)\\n\\n return sub_res\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n pre_sum = self.get_presum(nums)\\n\\n res = self.merge_sort(pre_sum, lower, upper)\\n\\n return self.count\\n\\n\\n \\n\\n \",\n \"runtime\": \"2818\"\n },\n {\n \"code\": \"class Solution:\\n def merger(self, a, b, reverse=False):\\n aptr = 0\\n bptr = 0\\n lst = []\\n while aptr < len(a) or bptr < len(b):\\n if aptr == len(a):\\n lst.append(b[bptr])\\n bptr += 1\\n elif bptr == len(b):\\n lst.append(a[aptr])\\n aptr += 1\\n else:\\n if a[aptr] <= b[bptr]:\\n lst.append(a[aptr])\\n aptr += 1\\n else:\\n lst.append(b[bptr])\\n bptr += 1\\n if reverse:\\n return lst[::-1]\\n return lst\\n\\n def sorter(self, nums, lower, upper, L, R):\\n # return a tuple of amount, sortedPrefixSum, sortedSuffixSum\\n if L == R:\\n if nums[L] >= lower and nums[L] <= upper:\\n # print(L,R,1)\\n return (1, [nums[L]], [nums[L]])\\n # print(L,R,0)\\n return (0, [nums[L]], [nums[L]])\\n mid = int((L+R)/2)\\n recLeft = self.sorter(nums, lower, upper, L, mid)\\n recRight = self.sorter(nums, lower, upper, mid+1, R)\\n # do calculations\\n tot = 0\\n leftPrefixes, rightPrefixes = recLeft[1], recRight[1]\\n leftSuffixes, rightSuffixes = recLeft[2], recRight[2]\\n\\n # if L == 0 and R == 5:\\n # print(\\\"------\\\")\\n # print(leftPrefixes)\\n # print(rightPrefixes)\\n # print(leftSuffixes)\\n # print(rightSuffixes)\\n # print(\\\"------\\\")\\n\\n l = 0\\n r = -1\\n for leftSuffix in leftSuffixes[::-1]:\\n while l < len(rightPrefixes) and leftSuffix + rightPrefixes[l] < lower:\\n l += 1\\n if l == len(rightPrefixes):\\n break\\n \\n r = max(l-1,r)\\n while r+1 < len(rightPrefixes) and leftSuffix + rightPrefixes[r+1] <= upper:\\n r += 1\\n \\n if r >= l and r < len(rightPrefixes) and leftSuffix + rightPrefixes[r] <= upper and l >= 0:\\n tot += r-l+1\\n # if L == 0 and R == 5:\\n # print(leftSuffix, r-l+1)\\n # else:\\n # if L == 0 and R == 5:\\n # print(leftSuffix, 0)\\n \\n\\n # do the merging\\n totLeft = sum(nums[L:mid+1])\\n rightPrefixesAdjusted = [(totLeft + num) for num in rightPrefixes]\\n prefixes = self.merger(leftPrefixes, rightPrefixesAdjusted)\\n\\n totRight = sum(nums[mid+1:R+1])\\n leftSuffixesAdjusted = [(totRight + num) for num in leftSuffixes]\\n suffixes = self.merger(leftSuffixesAdjusted, rightSuffixes)\\n\\n # print(L,R,tot + recLeft[0] + recRight[0])\\n return (tot + recLeft[0] + recRight[0], prefixes, suffixes)\\n\\n\\n\\n\\n \\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n '''\\n Break into range nums[L...mid], nums[mid+1...R]\\n solve the problem on each side\\n when combining, assume you have sortedPrefixSum for mid+1...R (and for L ... mid)\\n do a 2 pointer technique on the sorted suffix sums on the left sums for keeping track of >= lower and <= upper\\n add sum(L...mid) to each of sortedSum[mid+1 ... R]\\n merge sorted Sum and return that as well as the amount\\n '''\\n return self.sorter(nums, lower, upper, 0, len(nums)-1)[0]\",\n \"runtime\": \"2887\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def __init__(self):\\n self.ans = 0\\n\\n def add(self, a, b):\\n j, k = 0, 0\\n while j < len(a) and k < len(b):\\n if a[j] < b[k]:\\n j += 1\\n else:\\n self.ans += len(a) - j\\n k += 1\\n\\n def merge(self, a, b):\\n c = []\\n j, k = 0, 0\\n while j < len(a) and k < len(b):\\n if a[j] < b[k]:\\n c.append(a[j])\\n j += 1\\n else:\\n self.ans += len(a) - j\\n c.append(b[k])\\n k += 1\\n while j < len(a):\\n c.append(a[j])\\n j += 1\\n while k < len(b):\\n c.append(b[k])\\n k += 1\\n return c\\n\\n def sorts(self, a, x):\\n if len(a) <= 1:\\n return a\\n n = len(a)\\n b = a[:n//2]\\n c = a[n//2:]\\n \\n xx = self.sorts(b, x)\\n yy = self.sorts(c, x)\\n \\n d = [val - x for val in yy]\\n self.add(xx, d)\\n \\n return self.merge(xx, yy)\\n\\n def func(self, a, x):\\n self.ans = 0\\n self.sorts(a, x)\\n return self.ans\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n num = [0] * len(nums)\\n for i in range(len(nums)):\\n num[i] = nums[i]\\n \\n n = len(nums)\\n for i in range(1, n):\\n num[i] += num[i - 1]\\n\\n key1 = self.func(num, lower - 1)\\n key2 = self.func(num, upper)\\n \\n key3 = sum(1 for val in num if lower <= val <= upper)\\n \\n return -key1 + key2 + key3\\n\",\n \"runtime\": \"2955\"\n },\n {\n \"code\": \"class BinaryIndexedTree:\\n def __init__(self, n):\\n self.n = n\\n self.c = [0] * (n + 1)\\n \\n def update(self, x, v):\\n while x <= self.n:\\n self.c[x] += v\\n x += x & -x\\n \\n def query(self, x):\\n s = 0\\n while x > 0:\\n s += self.c[x]\\n x -= x & -x\\n return s\\n\\nclass Solution:\\n def countRangeSum(self, nums, lower, upper):\\n n = len(nums)\\n s = [0] * (n + 1)\\n for i in range(n):\\n s[i + 1] = s[i] + nums[i]\\n \\n arr = []\\n for i in range(n + 1):\\n arr.append(s[i])\\n arr.append(s[i] - lower)\\n arr.append(s[i] - upper)\\n \\n arr = sorted(set(arr))\\n m = len(arr)\\n \\n tree = BinaryIndexedTree(m)\\n ans = 0\\n \\n def search(x):\\n l, r = 0, m\\n while l < r:\\n mid = (l + r) // 2\\n if arr[mid] >= x:\\n r = mid\\n else:\\n l = mid + 1\\n return l + 1\\n \\n for x in s:\\n l = search(x - upper)\\n r = search(x - lower)\\n ans += tree.query(r) - tree.query(l - 1)\\n tree.update(search(x), 1)\\n \\n return ans\\n\",\n \"runtime\": \"3023\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n \\\"\\\"\\\"\\n Calculate Prefix Sum: \\n Given an array arr[] of size n, \\n its prefix sum is another array prefixSum[] of the same size, \\n such that the value of prefixSum[i] is arr[0] + arr[1] + arr[2] … arr[i].\\n \\n Input : arr[] = {1, 2, 1}, lower = 2; upper = 3\\n Output : prefixSum[] = {1, 3, 4}\\n\\n Count pairs where its sums is in range\\n (i = 0, j = 0) = 1 - 1 = 0 -> not in range (2,3)\\n \\n (i = 1, j = 0) = 3 - 1 = 2 -> in range (2,3)\\n (i = 1, j = 1) = 3 - 3 = 0 -> not in range (2,3)\\n\\n (i = 2, j = 0) = 4 - 1 = 3 -> in range (2,3)\\n (i = 2, j = 1) = 4 - 2 = 2 -> in range (2,3)\\n (i = 2, j = 2) = 4 - 4 = 0 -> not in range (2,3)\\n \\\"\\\"\\\"\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Initialize the countPairs, curSum\\n countPairs, curSum = 0, 0\\n\\n # Initialize the prefixSum, with middle value of 0\\n # there can be negateive and positive values too\\n prefixSum = [0]\\n for num in nums:\\n \\n # prefix sum\\n curSum += num\\n \\n # bisect_left(list value)\\n # Returns an index (left of same value) to insert given value to make the list sorted.\\n left_index = bisect.bisect_left(prefixSum, curSum - upper)\\n\\n # bisect_right(list value)\\n # Returns an index (right of same values) to insert given value to make the list sorted.\\n right_index = bisect.bisect_right(prefixSum, curSum - lower)\\n\\n # count such pairs\\n countPairs += right_index - left_index\\n\\n # add curSum into prefixSum so that prefixSum is still sorted\\n # it is needed to handle negative values\\n bisect.insort(prefixSum, curSum)\\n\\n return countPairs\",\n \"runtime\": \"3092\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n ps, ret = [0], 0\\n for s in accumulate(nums):\\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\\n bisect.insort(ps, s)\\n return ret\",\n \"runtime\": \"3160\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n ps, ret = [0], 0\\n for s in accumulate(nums):\\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\\n bisect.insort(ps, s)\\n return ret\",\n \"runtime\": \"3229\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n cum_sum, cur_sum, res = [0], 0, 0\\n for i in nums:\\n cur_sum += i\\n res += bisect_right(cum_sum, cur_sum - lower) - bisect_left(cum_sum, cur_sum - upper)\\n bisect.insort(cum_sum, cur_sum)\\n return res\\n \",\n \"runtime\": \"3297\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n countPairs, curSum = 0, 0\\n prefixSum = [0]\\n for num in nums:\\n \\n\\n curSum += num\\n \\n\\n left_index = bisect_left(prefixSum, curSum - upper)\\n\\n right_index = bisect_right(prefixSum, curSum - lower)\\n\\n countPairs += right_index - left_index\\n \\n insort(prefixSum,curSum)\\n # ind=bisect_left(prefixSum,curSum)\\n # prefixSum.insert(ind,curSum)\\n\\n return countPairs\\n\",\n \"runtime\": \"3365\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n sl = [0]\\n ans, p = 0, 0\\n \\n for x in nums:\\n p += x\\n left = bisect.bisect_left(sl, p - upper)\\n right = bisect.bisect_right(sl, p - lower)\\n ans += right - left\\n insort(sl, p)\\n\\n return ans\",\n \"runtime\": \"3434\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefixArr = list(itertools.accumulate(nums))\\n # print(f\\\"{prefixArr=}\\\")\\n left = [0]\\n counter = 0\\n for num in prefixArr:\\n i = bisect.bisect_left(left, num - upper)\\n j = bisect.bisect_right(left, num - lower)\\n counter += j-i\\n # lower <= num - x <= upper\\n # -upper <= x - num <= -lower\\n # -upper + num <= x <= -lower + num\\n bisect.insort(left, num)\\n return counter\",\n \"runtime\": \"3502\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n ps, ret = [0], 0\\n for s in accumulate(nums):\\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\\n bisect.insort(ps, s)\\n return ret\",\n \"runtime\": \"3570\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n \\\"\\\"\\\"\\n Calculate Prefix Sum: \\n Given an array arr[] of size n, \\n its prefix sum is another array prefixSum[] of the same size, \\n such that the value of prefixSum[i] is arr[0] + arr[1] + arr[2] … arr[i].\\n \\n Input : arr[] = {1, 2, 1}, lower = 2; upper = 3\\n Output : prefixSum[] = {1, 3, 4}\\n\\n Count pairs where its sums is in range\\n (i = 0, j = 0) = 1 - 1 = 0 -> not in range (2,3)\\n \\n (i = 1, j = 0) = 3 - 1 = 2 -> in range (2,3)\\n (i = 1, j = 1) = 3 - 3 = 0 -> not in range (2,3)\\n\\n (i = 2, j = 0) = 4 - 1 = 3 -> in range (2,3)\\n (i = 2, j = 1) = 4 - 2 = 2 -> in range (2,3)\\n (i = 2, j = 2) = 4 - 4 = 0 -> not in range (2,3)\\n \\\"\\\"\\\"\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Initialize the countPairs, curSum\\n countPairs, curSum = 0, 0\\n\\n # Initialize the prefixSum, with middle value of 0\\n # there can be negateive and positive values too\\n prefixSum = [0]\\n for num in nums:\\n \\n # prefix sum\\n curSum += num\\n \\n # bisect_left(list value)\\n # Returns an index (left of same value) to insert given value to make the list sorted.\\n left_index = bisect.bisect_left(prefixSum, curSum - upper)\\n\\n # bisect_right(list value)\\n # Returns an index (right of same values) to insert given value to make the list sorted.\\n right_index = bisect.bisect_right(prefixSum, curSum - lower)\\n\\n # count such pairs\\n countPairs += right_index - left_index\\n\\n # add curSum into prefixSum so that prefixSum is still sorted\\n # it is needed to handle negative values\\n bisect.insort(prefixSum, curSum)\\n\\n return countPairs\",\n \"runtime\": \"3639\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n ps, ret = [0], 0\\n for s in accumulate(nums):\\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\\n bisect.insort(ps, s)\\n return ret\",\n \"runtime\": \"3707\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n record = []\\n cnt = 0\\n import bisect\\n\\n cur_sum = 0\\n for num in nums:\\n cur_sum += num\\n idx_right = bisect.bisect_right(record, cur_sum-lower)\\n idx_left = bisect.bisect_left(record, cur_sum-upper)\\n cnt += (idx_right-idx_left)\\n\\n if lower <= cur_sum <= upper:\\n cnt += 1\\n\\n bisect.insort(record, cur_sum)\\n \\n return cnt\\n\\n\\n\\n\\n\\n \\n \",\n \"runtime\": \"3707\"\n },\n {\n \"code\": \"class Bit:\\n def __init__(self, n):\\n self.bit = [0] * (n + 1)\\n self.length = n + 1\\n def update(self, i, val):\\n while i < self.length:\\n self.bit[i] += val\\n i += self._find_LSB(i)\\n def prefix_sum(self, i):\\n res = 0\\n while i > 0:\\n res += self.bit[i]\\n i -= self._find_LSB(i)\\n return res\\n def _find_LSB(self, i):\\n return i & (-i)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n \\n \\\"\\\"\\\"\\n reference from Solutions: [Python3] 4 solutions @ye15\\n\\n Concepts:\\n 1. range sum -> BIT\\n 2. lower, upper -> binary search (我沒有反應過來導致暴力窮舉，使最下面的解為 TLE)\\n \\n \\\"\\\"\\\"\\n\\n res = prefix = 0\\n seen = [0]\\n\\n for x in nums:\\n \\\"\\\"\\\"\\n lower <= prefix - seen[i] <= upper\\n 求 seen[i] 的有效區間 -> 求 seen[i] 的範圍\\n prefix - upper <= seen[i] <= prefix - lower\\n \\\"\\\"\\\"\\n prefix += x\\n a = bisect_left(seen, prefix - upper)\\n b = bisect_right(seen, prefix - lower)\\n res += b - a\\n bisect.insort(seen, prefix)\\n \\n return res\\n\\n prefix = [0]\\n for x in nums:\\n prefix.append(prefix[-1] + x)\\n \\n def recur(lo, hi):\\n\\n if lo + 1 >= hi:\\n return 0\\n\\n mid = (lo + hi) >> 1\\n res = recur(lo, mid) + recur(mid, hi)\\n k1 = k2 = mid\\n for i in range(lo, mid):\\n while k1 < hi and prefix[k1] - prefix[i] < lower:\\n k1 += 1\\n while k2 < hi and prefix[k2] - prefix[i] <= upper:\\n k2 += 1\\n if k2 > k1:\\n res += (k2 - k1)\\n\\n prefix[lo: hi] = sorted(prefix[lo: hi])\\n return res\\n \\n return recur(0, len(prefix))\\n\\n \\\"\\\"\\\"\\n reference from Solutions: [Python3] 4 solutions @ye15\\n\\n Concepts:\\n 1. range sum -> BIT\\n 2. lower, upper -> binary search (我沒有反應過來導致暴力窮舉，使最下面的解為 TLE)\\n 3. 不斷拆解區間去計算 range sum \\n -> divide and conquer 我完全沒有想到這個算法 = =\\n 應該說，我直接被“拆解區間“這邊徹底難住了\\n \\\"\\\"\\\"\\n\\n # prefix and hashmap\\n # (1) condition: lower <= prefix[i] - prefix[j] <= upper\\n # -> target = prefix[i] - prefix[j]\\n # (target exists in [lower, upper])\\n # -> prefix[i] - target = prefix[j]\\n # (2) use hashmap to record the prefix[i]\\n # if prefix[i] - target (as prefix[j]) exists in hashmap,\\n # then prefix[i] - prefix[j] = target exists\\n\\n prefix = [0]\\n for x in nums:\\n prefix.append(prefix[-1] + x)\\n \\n hashmap = defaultdict(int)\\n res = 0\\n for pre_sum in prefix:\\n for target in range(lower, upper + 1):\\n if pre_sum - target in hashmap:\\n res += hashmap[pre_sum - target]\\n hashmap[pre_sum] += 1\\n \\n return res\\n\\n\\n # divide and conquer\\n prefix_sum = [0]\\n for x in nums:\\n prefix.append(prefix[-1] + x)\\n \\n def recur(lo, hi):\\n if lo + 1 >= hi:\\n return 0\\n mid = (lo + hi) // 2\\n res = recur(lo, mid) + recur(mid, hi)\\n k1 = k2 = mid\\n for i in range(lo, mid):\\n while k1 < hi and prefix[k1] - prefix[i] < lower:\\n k1 += 1\\n while k2 < hi and prefix[k2] - prefix[i] <= upper:\\n k2 += 1\\n res += (k2 - k1)\\n prefix[lo: hi] = sorted(prefix[lo: hi])\\n return res\\n \\n return recur(0, len(prefix))\\n\\n # TLE: O((nlogn) ^ 2)\\n n = len(nums)\\n bit_tree = Bit(n)\\n for i, x in enumerate(nums):\\n bit_tree.update(i + 1, x)\\n \\n res = 0\\n for i in range(1, n + 1):\\n a = bit_tree.prefix_sum(i)\\n for j in range(i):\\n b = bit_tree.prefix_sum(j)\\n if lower <= a - b <= upper:\\n res += 1\\n \\n return res\\n\\n # TLE: O((nlogn) ^ 2)\\n n = len(nums)\\n bit_tree = Bit(n)\\n for i, x in enumerate(nums):\\n bit_tree.update(i + 1, x)\\n \\n res = 0\\n for i in range(1, n + 1):\\n a = bit_tree.prefix_sum(i)\\n for j in range(i):\\n b = bit_tree.prefix_sum(j)\\n if lower <= a - b <= upper:\\n res += 1\\n \\n return res\",\n \"runtime\": \"3775\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n ps, ret = [0], 0\\n for s in accumulate(nums):\\n ret += bisect_right(ps, s - lower) - bisect_left(ps, s - upper)\\n bisect.insort(ps, s)\\n return ret\",\n \"runtime\": \"3844\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix,cur,res = [0],0,0\\n for n in nums:\\n cur += n\\n A = bisect.bisect_right(prefix, cur-lower)\\n B = bisect.bisect_left(prefix, cur-upper)\\n res += A - B\\n bisect.insort(prefix, cur)\\n return res\\n \",\n \"runtime\": \"3844\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n ans = prefix = 0\\n seen = [0]\\n for c in nums:\\n prefix+=c\\n lo = bisect.bisect_left(seen,prefix-upper)\\n hi = bisect.bisect_left(seen,prefix-lower+1)\\n ans+= hi -lo\\n bisect.insort(seen,prefix)\\n return ans\",\n \"runtime\": \"3912\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\"\\n Input : arr[] = {1, 2, 1}, lower = 2; upper = 3\\n Output : prefixSum[] = {1, 3, 4}\\n\\n Count pairs where their sums are in the range [lower, upper]:\\n (i = 0, j = 0) = 1 - 1 = 0 -> not in range [2, 3]\\n (i = 1, j = 0) = 3 - 1 = 2 -> in range [2, 3]\\n (i = 1, j = 1) = 3 - 3 = 0 -> not in range [2, 3]\\n (i = 2, j = 0) = 4 - 1 = 3 -> in range [2, 3]\\n (i = 2, j = 1) = 4 - 2 = 2 -> in range [2, 3]\\n (i = 2, j = 2) = 4 - 4 = 0 -> not in range [2, 3]\\n \\\"\\\"\\\"\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Initialize the count of valid pairs and the current cumulative sum.\\n countPairs, curSum = 0, 0\\n\\n # Initialize the prefix sum list with an initial value of 0.\\n # This is because a subarray sum can start from the beginning of the array.\\n prefixSum = [0]\\n \\n for num in nums:\\n # Add the current number to the cumulative sum.\\n curSum += num\\n \\n # Find the leftmost index where curSum - upper can be inserted in prefixSum\\n # and still maintain the sorted order. This index represents the first\\n # valid prefix that, when subtracted from curSum, gives a value within the range.\\n left_index = bisect.bisect_left(prefixSum, curSum - upper)\\n\\n # Find the rightmost index where curSum - lower can be inserted in prefixSum\\n # and still maintain the sorted order. This index represents the last\\n # valid prefix that, when subtracted from curSum, gives a value within the range.\\n right_index = bisect.bisect_right(prefixSum, curSum - lower)\\n\\n # The difference between right_index and left_index gives the number of valid\\n # subarrays that have a sum within the range [lower, upper].\\n countPairs += right_index - left_index\\n\\n # Insert the current cumulative sum into the prefixSum list while keeping it sorted.\\n # This allows us to efficiently find valid prefix sums for future iterations.\\n bisect.insort(prefixSum, curSum)\\n\\n # Return the total count of valid pairs.\\n return countPairs\\n\",\n \"runtime\": \"3912\"\n },\n {\n \"code\": \"class SegmentTreeNode:\\n\\tdef __init__(self,low,high):\\n\\t\\tself.low = low\\n\\t\\tself.high = high\\n\\t\\tself.left = None\\n\\t\\tself.right = None\\n\\t\\tself.cnt = 0 \\n \\nclass Solution: \\n def _bulid(self, left, right): \\n root = SegmentTreeNode(self.cumsum[left],self.cumsum[right])\\n if left == right:\\n return root\\n \\n mid = (left+right)//2\\n root.left = self._bulid(left, mid)\\n root.right = self._bulid(mid+1, right)\\n return root\\n \\n def _update(self, root, val):\\n if not root:\\n return \\n if root.low<=val<=root.high:\\n root.cnt += 1\\n self._update(root.left, val)\\n self._update(root.right, val)\\n \\n def _query(self, root, lower, upper):\\n if lower <= root.low and root.high <= upper:\\n return root.cnt\\n if upper < root.low or root.high < lower:\\n return 0\\n return self._query(root.left, lower, upper) + self._query(root.right, lower, upper)\\n \\n # prefix-sum + SegmentTree | O(nlogn) \\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n cumsum = [0]\\n for n in nums:\\n cumsum.append(cumsum[-1]+n)\\n \\n self.cumsum = sorted(list(set(cumsum))) # need sorted\\n root = self._bulid(0,len(self.cumsum)-1)\\n \\n res = 0\\n for csum in cumsum:\\n res += self._query(root, csum-upper, csum-lower)\\n self._update(root, csum) \\n return res\",\n \"runtime\": \"3980\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n record = []\\n cnt = 0\\n import bisect\\n\\n cur_sum = 0\\n for num in nums:\\n cur_sum += num\\n idx_right = bisect.bisect_right(record, cur_sum-lower)\\n idx_left = bisect.bisect_left(record, cur_sum-upper)\\n cnt += (idx_right-idx_left)\\n\\n if lower <= cur_sum <= upper:\\n cnt += 1\\n\\n bisect.insort(record, cur_sum)\\n print(idx_right, idx_left)\\n \\n return cnt\\n\\n\\n\\n\\n\\n \\n \",\n \"runtime\": \"3980\"\n },\n {\n \"code\": \"class Solution:\\n def merger(self, a, b, reverse=False):\\n aptr = 0\\n bptr = 0\\n lst = []\\n while aptr < len(a) or bptr < len(b):\\n if aptr == len(a):\\n lst.append(b[bptr])\\n bptr += 1\\n elif bptr == len(b):\\n lst.append(a[aptr])\\n aptr += 1\\n else:\\n if a[aptr] <= b[bptr]:\\n lst.append(a[aptr])\\n aptr += 1\\n else:\\n lst.append(b[bptr])\\n bptr += 1\\n if reverse:\\n return lst[::-1]\\n return lst\\n\\n def sorter(self, nums, lower, upper, L, R):\\n # return a tuple of amount, sortedPrefixSum, sortedSuffixSum\\n if L == R:\\n if nums[L] >= lower and nums[L] <= upper:\\n print(L,R,1)\\n return (1, [nums[L]], [nums[L]])\\n print(L,R,0)\\n return (0, [nums[L]], [nums[L]])\\n mid = int((L+R)/2)\\n recLeft = self.sorter(nums, lower, upper, L, mid)\\n recRight = self.sorter(nums, lower, upper, mid+1, R)\\n # do calculations\\n tot = 0\\n leftPrefixes, rightPrefixes = recLeft[1], recRight[1]\\n leftSuffixes, rightSuffixes = recLeft[2], recRight[2]\\n\\n # if L == 0 and R == 5:\\n # print(\\\"------\\\")\\n # print(leftPrefixes)\\n # print(rightPrefixes)\\n # print(leftSuffixes)\\n # print(rightSuffixes)\\n # print(\\\"------\\\")\\n\\n l = 0\\n r = -1\\n for leftSuffix in leftSuffixes[::-1]:\\n while l < len(rightPrefixes) and leftSuffix + rightPrefixes[l] < lower:\\n l += 1\\n if l == len(rightPrefixes):\\n break\\n \\n r = max(l-1,r)\\n while r+1 < len(rightPrefixes) and leftSuffix + rightPrefixes[r+1] <= upper:\\n r += 1\\n \\n if r >= l and r < len(rightPrefixes) and leftSuffix + rightPrefixes[r] <= upper and l >= 0:\\n tot += r-l+1\\n if L == 0 and R == 5:\\n print(leftSuffix, r-l+1)\\n else:\\n if L == 0 and R == 5:\\n print(leftSuffix, 0)\\n \\n\\n # do the merging\\n totLeft = sum(nums[L:mid+1])\\n rightPrefixesAdjusted = [(totLeft + num) for num in rightPrefixes]\\n prefixes = self.merger(leftPrefixes, rightPrefixesAdjusted)\\n\\n totRight = sum(nums[mid+1:R+1])\\n leftSuffixesAdjusted = [(totRight + num) for num in leftSuffixes]\\n suffixes = self.merger(leftSuffixesAdjusted, rightSuffixes)\\n\\n print(L,R,tot + recLeft[0] + recRight[0])\\n return (tot + recLeft[0] + recRight[0], prefixes, suffixes)\\n\\n\\n\\n\\n \\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n '''\\n Break into range nums[L...mid], nums[mid+1...R]\\n solve the problem on each side\\n when combining, assume you have sortedPrefixSum for mid+1...R (and for L ... mid)\\n do a 2 pointer technique on the sorted suffix sums on the left sums for keeping track of >= lower and <= upper\\n add sum(L...mid) to each of sortedSum[mid+1 ... R]\\n merge sorted Sum and return that as well as the amount\\n '''\\n return self.sorter(nums, lower, upper, 0, len(nums)-1)[0]\",\n \"runtime\": \"4049\"\n },\n {\n \"code\": \"class Solution:\\n SEG = []\\n N = 0\\n def add_point(self, ind: int, l: int, r: int, pos: int):\\n if not r - l == 1:\\n if pos < (r + l) // 2:\\n self.add_point(2 * ind, l, (r + l) // 2, pos)\\n else:\\n self.add_point(2 * ind + 1, (r + l) // 2, r, pos)\\n self.SEG[ind] += 1\\n \\n def range_sum(self, ind: int, l: int, r: int, b: int, e: int):\\n if l >= b and r <= e:\\n return self.SEG[ind]\\n if l >= e or r <= b:\\n return 0\\n return self.range_sum(2 * ind, l, (r + l) // 2, b, e) + self.range_sum(2 * ind + 1, (r + l) // 2, r, b, e)\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n all_point = set([0])\\n sm = 0\\n for num in nums:\\n sm += num\\n all_point.add(sm)\\n all_point.add(sm - lower)\\n all_point.add(sm - upper)\\n all_point = list(all_point)\\n all_point = sorted(all_point)\\n mp = {}\\n sm = 0\\n for pt in all_point:\\n mp[pt] = sm\\n sm += 1\\n self.N = len(all_point)\\n self.SEG = [0] * (4 * (self.N + 1))\\n self.add_point(1, 0, self.N, mp[0])\\n res = 0\\n sm = 0\\n for num in nums:\\n sm += num\\n res += self.range_sum(1, 0, self.N, mp[sm - upper], mp[sm - lower] + 1)\\n self.add_point(1, 0, self.N, mp[sm])\\n return res\",\n \"runtime\": \"4117\"\n },\n {\n \"code\": \"class TreeNode:\\n def __init__(self, val, left = None, right = None):\\n self.val = val\\n self.count = 1\\n self.left = left\\n self.right = right\\n self.height = 1\\n\\nclass AVLTree:\\n def __init__(self):\\n self.root = None\\n \\n def add_value(self, value):\\n self.root = self.add(self.root, value)\\n\\n def add(self, root, value):\\n if not root:\\n return TreeNode(value)\\n\\n if value == root.val:\\n root.count += 1\\n elif value < root.val:\\n root.left = self.add(root.left, value)\\n root.count += 1\\n elif value > root.val:\\n root.right = self.add(root.right, value)\\n root.height = 1 + max(self.height(root.left), self.height(root.right))\\n\\n bal = self.balance(root)\\n if bal > 1:\\n if value > root.left.val:\\n root.left = self.left_rotate(root.left)\\n root = self.right_rotate(root)\\n elif bal < -1:\\n if value < root.right.val:\\n root.right = self.right_rotate(root.right)\\n root = self.left_rotate(root)\\n\\n return root\\n\\n def height(self, root):\\n return root.height if root else 0\\n \\n def adjust_height(self, root):\\n\\t\\t root.height = 1 + max(self.height(root.left), self.height(root.right))\\n\\n def balance(self, root):\\n return self.height(root.left) - self.height(root.right) if root else 0\\n\\n def left_rotate(self, pivot):\\n pivot_next = pivot.right\\n pivot_next.left, pivot.right = pivot, pivot_next.left\\n pivot_next.count += pivot.count\\n self.adjust_height(pivot)\\n self.adjust_height(pivot_next)\\n return pivot_next\\n\\n def right_rotate(self, pivot):\\n pivot_next = pivot.left\\n pivot_next.right, pivot.left = pivot, pivot_next.right\\n pivot.count -= pivot_next.count\\n self.adjust_height(pivot)\\n self.adjust_height(pivot_next)\\n return pivot_next\\n \\n def find_value(self, val):\\n return self.find(self.root, val)\\n \\n def find(self, root, val):\\n if not root:\\n return 0\\n \\n if root.val == val:\\n return root.count\\n elif root.val <= val:\\n return root.count + self.find(root.right, val)\\n else:\\n return self.find(root.left, val)\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n res = 0\\n tree = AVLTree()\\n tree.add_value(0)\\n total = 0\\n for i in range(len(nums)):\\n total += nums[i]\\n res += tree.find_value(total - lower) - tree.find_value(total - upper - 1)\\n tree.add_value(total)\\n return res\\n\",\n \"runtime\": \"4185\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, size):\\n self.size = size\\n self.tree = [0] * (4 * size)\\n \\n def update(self, node, start, end, idx, val):\\n if start == end:\\n self.tree[node] += val\\n else:\\n mid = (start + end) // 2\\n if start <= idx <= mid:\\n self.update(2 * node + 1, start, mid, idx, val)\\n else:\\n self.update(2 * node + 2, mid + 1, end, idx, val)\\n self.tree[node] = self.tree[2 * node + 1] + self.tree[2 * node + 2]\\n \\n def query(self, node, start, end, l, r):\\n if r < start or end < l:\\n return 0\\n if l <= start and end <= r:\\n return self.tree[node]\\n mid = (start + end) // 2\\n left_query = self.query(2 * node + 1, start, mid, l, r)\\n right_query = self.query(2 * node + 2, mid + 1, end, l, r)\\n return left_query + right_query\\n \\n def range_query(self, l, r):\\n return self.query(0, 0, self.size - 1, l, r)\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n \\n # Coordinate compression\\n all_sums = sorted(set(prefix_sums + [x - lower for x in prefix_sums] + [x - upper for x in prefix_sums]))\\n sum_index = {v: i for i, v in enumerate(all_sums)}\\n \\n # Initialize segment tree\\n seg_tree = SegmentTree(len(all_sums))\\n count = 0\\n \\n for sum_val in prefix_sums:\\n # Query the number of prefix sums in the range [sum_val - upper, sum_val - lower]\\n left_index = sum_index[sum_val - upper] if (sum_val - upper) in sum_index else 0\\n right_index = sum_index[sum_val - lower] if (sum_val - lower) in sum_index else len(all_sums) - 1\\n count += seg_tree.range_query(left_index, right_index)\\n \\n # Update the segment tree with the current prefix sum\\n seg_tree.update(0, 0, len(all_sums) - 1, sum_index[sum_val], 1)\\n \\n return count\",\n \"runtime\": \"4254\"\n },\n {\n \"code\": \"class SegTreeNode:\\n def __init__(self, left=-1, right=-1, val=0, lazy_tag=None, left_node=None, right_node=None):\\n self.left = left # 区间左边界\\n self.right = right # 区间右边界\\n self.mid = left + (right - left) // 2 # 区间中间点\\n self.left_node = left_node # 区间左节点\\n self.right_node = right_node # 区间右节点\\n self.val = val # 节点值（区间值）\\n self.lazy_tag = lazy_tag # 区间问题的延迟更新标记\\n\\n\\n# 动态开点线段树类\\nclass SegmentTree:\\n # 初始化线段树接口\\n def __init__(self, function):\\n self.tree = SegTreeNode(-2 ** 31, 2 ** 31 - 1)\\n self.function = function # function 是一个函数，左右区间的聚合方法\\n\\n # 单点更新，将 nums[i] 更改为 val\\n def update_point(self, i, val):\\n self._update_point(i, val, self.tree)\\n\\n # 区间查询，查询区间为 [q_left, q_right] 的区间值\\n def query_interval(self, q_left, q_right):\\n return self._query_interval(q_left, q_right, self.tree)\\n\\n # 以下为内部实现方法\\n\\n # 单点更新，将 nums[i] 更改为 val。node 节点的区间为 [node.left, node.right]\\n def _update_point(self, i, val, node):\\n if node.left == node.right:\\n node.val += val # 叶子节点，节点值修改为 val\\n return\\n\\n if i <= node.mid: # 在左子树中更新节点值\\n if node.left_node is None:\\n node.left_node = SegTreeNode(node.left, node.mid)\\n self._update_point(i, val, node.left_node)\\n else: # 在右子树中更新节点值\\n if node.right_node is None:\\n node.right_node = SegTreeNode(node.mid + 1, node.right)\\n self._update_point(i, val, node.right_node)\\n self._push_up(node) # 向上更新节点的区间值\\n\\n # 区间查询，在线段树的 [left, right] 区间范围中搜索区间为 [q_left, q_right] 的区间值\\n def _query_interval(self, q_left, q_right, node):\\n if node.left >= q_left and node.right <= q_right: # 节点所在区间被 [q_left, q_right] 所覆盖\\n return node.val # 直接返回节点值\\n if node.right < q_left or node.left > q_right: # 节点所在区间与 [q_left, q_right] 无关\\n return 0\\n\\n res_left = 0 # 左子树查询结果\\n res_right = 0 # 右子树查询结果\\n if q_left <= node.mid: # 在左子树中查询\\n if node.left_node is None:\\n node.left_node = SegTreeNode(node.left, node.mid)\\n res_left = self._query_interval(q_left, q_right, node.left_node)\\n if q_right > node.mid: # 在右子树中查询\\n if node.right_node is None:\\n node.right_node = SegTreeNode(node.mid + 1, node.right)\\n res_right = self._query_interval(q_left, q_right, node.right_node)\\n return self.function(res_left, res_right) # 返回左右子树元素值的聚合计算结果\\n\\n # 向上更新 node 节点区间值，节点的区间值等于该节点左右子节点元素值的聚合计算结果\\n def _push_up(self, node):\\n left_node = node.left_node\\n right_node = node.right_node\\n left_node_val = left_node.val if left_node else 0\\n right_node_val = right_node.val if right_node else 0\\n\\n node.val = self.function(left_node_val, right_node_val)\\n\\n\\nclass Solution:\\n def get_presum(self, nums):\\n pre_sum = [0] * (len(nums) + 1)\\n\\n for i in range(len(nums)):\\n pre_sum[i + 1] = pre_sum[i] + nums[i]\\n\\n return pre_sum\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n pre_sum = self.get_presum(nums)\\n # 平移的距离\\n # offset = 10\\n # 初始化线段数\\n segment_tree = SegmentTree(lambda x, y: x + y)\\n\\n res = 0\\n for val in pre_sum:\\n left = val - upper\\n right = val - lower\\n res += segment_tree.query_interval(left, right)\\n # 更新当前数对应的线段数内的index的值\\n if -2 ** 31 <= val <= 2 ** 31 - 1:\\n segment_tree.update_point(val, 1)\\n\\n return res\",\n \"runtime\": \"4322\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4390\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4459\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4527\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4596\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4664\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4732\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4801\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4869\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"4937\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5006\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5074\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n\\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n\\n mid = (start + end) //2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n\\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n\\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n\\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n\\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sum_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sum_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sum_to_ind[presum - upper]\\n high = sum_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sum_to_ind[presum])\\n return result\",\n \"runtime\": \"5142\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5211\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\\n\",\n \"runtime\": \"5279\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = build(start, mid)\\n node.right = build(mid + 1, end)\\n return node\\n self.root = build(start, end)\\n \\n def update(self, index):\\n def updateNode(node):\\n if not node or node.start > index or node.end < index:\\n return\\n if node.start == node.end == index:\\n node.count += 1\\n return\\n \\n updateNode(node.left)\\n updateNode(node.right)\\n node.count = node.left.count + node.right.count\\n\\n updateNode(self.root)\\n \\n def query(self, queryStart, queryEnd):\\n def queryNode(node):\\n if not node or node.start > queryEnd or node.end < queryStart:\\n return 0\\n if node.start >= queryStart and node.end <= queryEnd:\\n return node.count\\n \\n return queryNode(node.left) + queryNode(node.right)\\n return queryNode(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n possibleAllSums = []\\n for presum in presums:\\n possibleAllSums.append(presum)\\n possibleAllSums.append(presum - upper)\\n possibleAllSums.append(presum - lower)\\n sumsToIndex = {s: ind for ind, s in enumerate(sorted(set(possibleAllSums)))}\\n\\n segmentTree = SegmentTree(0, len(sumsToIndex) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sumsToIndex[presum - upper]\\n high = sumsToIndex[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sumsToIndex[presum])\\n return result\",\n \"runtime\": \"5347\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5416\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5484\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5552\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5621\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5689\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5757\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5826\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"runtime\": \"5894\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n\\nclass SegmentTree:\\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return Node(start, end)\\n \\n mid = (start + end) // 2\\n node = Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\\n\",\n \"runtime\": \"5963\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":98,"string":"98"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def countRangeSum(self, nums: list[int], lower: int, upper: int) -> int:\n prefix_sums = [0] \n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n def count_while_sorting(prefix_sums, start, end):\n if end - start <= 1:\n return 0\n mid = (start + end) // 2\n count = count_while_sorting(prefix_sums, start, mid) + count_while_sorting(prefix_sums, mid, end)\n j = k = mid\n for i in range(start, mid):\n while j < end and prefix_sums[j] - prefix_sums[i] < lower:\n j += 1\n while k < end and prefix_sums[k] - prefix_sums[i] <= upper:\n k += 1\n count += k - j\n prefix_sums[start:end] = sorted(prefix_sums[start:end])\n return count\n return count_while_sorting(prefix_sums, 0, len(prefix_sums))\n","memory":"30033"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n #count = 0\n #ranges = []\n #def check(num):\n # return (lower <= num <= upper)\n \n #for i in range(len(nums)):\n # for j in range(i, len(nums)):\n # s = sum(nums[i: j + 1])\n # if check(s):\n # count += 1\n # #ranges.append([i, j])\n #print(ranges)\n #return count\n\n prefix, ret = [0], 0\n for s in accumulate(nums):\n ret += bisect_right(prefix, s - lower) - bisect_left(prefix, s - upper)\n bisect.insort(prefix, s)\n return ret","memory":"30033"},{"code":"from typing import List\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n if len(nums) == 1:\n return 1 if nums[0] >= lower and nums[0] <= upper else 0\n prefix = [0]\n sum = 0\n for num in nums:\n sum += num\n prefix.append(sum)\n self.cnt = 0\n self.merge(prefix, lower, upper)\n return self.cnt\n \n def merge(self, prefix, lower, upper):\n if len(prefix) == 1:\n return\n mid = len(prefix) // 2 \n l = prefix[:mid]\n r = prefix[mid:]\n self.merge(l, lower, upper)\n self.merge(r, lower, upper)\n # binary search r[j] - l[i] >= lower, r[j] - l[i] <= upper, r[j\n for i in range (0, len(l)):\n lo = 0\n hi = len(r) - 1\n while lo < hi:\n mid = (lo + hi + 1) // 2\n if r[mid] <= l[i] + upper:\n lo = mid\n else:\n hi = mid - 1\n last = lo\n lo = 0\n hi = len(r) - 1\n while lo < hi:\n mid = (lo + hi) // 2\n if r[mid] >= l[i] + lower:\n hi = mid\n else:\n lo = mid + 1\n first = lo\n # print(i, first, last)\n if r[last] <= l[i] + upper and r[first] >= l[i] + lower:\n self.cnt += (last - first + 1)\n # merge 2 sorted parts\n idx1 = 0\n idx2 = 0\n while idx1 < len(l) or idx2 < len(r):\n if idx1 == len(l):\n prefix[idx1+idx2] = r[idx2]\n idx2 += 1\n elif idx2 == len(r):\n prefix[idx1+idx2] = l[idx1]\n idx1 += 1\n elif l[idx1] < r[idx2]:\n prefix[idx1+idx2] = l[idx1]\n idx1 += 1\n else:\n prefix[idx1+idx2] = r[idx2]\n idx2 += 1\n\n \n \n ","memory":"31701"},{"code":"from typing import List\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = [0]\n sum = 0\n for num in nums:\n sum += num\n prefix.append(sum)\n return self.merge(prefix, 0, len(prefix), lower, upper)\n \n def merge(self, prefix, lo, hi, lower, upper):\n mid = (lo+hi) // 2\n if mid == lo:\n return 0\n count = self.merge(prefix, lo, mid, lower, upper) + self.merge(prefix, mid, hi, lower, upper) \n i = j = mid\n for left in prefix[lo:mid]:\n while i < hi and prefix[i] - left < lower: i += 1\n while j < hi and prefix[j] - left <= upper: j += 1\n count += j - i\n prefix[lo:hi] = sorted(prefix[lo:hi])\n return count\n ","memory":"31701"},{"code":"from typing import List\n\nclass Solution:\n def __init__(self):\n self.ans = 0\n\n def add(self, a, b):\n j, k = 0, 0\n while j < len(a) and k < len(b):\n if a[j] < b[k]:\n j += 1\n else:\n self.ans += len(a) - j\n k += 1\n\n def merge(self, a, b):\n c = []\n j, k = 0, 0\n while j < len(a) and k < len(b):\n if a[j] < b[k]:\n c.append(a[j])\n j += 1\n else:\n self.ans += len(a) - j\n c.append(b[k])\n k += 1\n while j < len(a):\n c.append(a[j])\n j += 1\n while k < len(b):\n c.append(b[k])\n k += 1\n return c\n\n def sorts(self, a, x):\n if len(a) <= 1:\n return a\n n = len(a)\n b = a[:n//2]\n c = a[n//2:]\n \n xx = self.sorts(b, x)\n yy = self.sorts(c, x)\n \n d = [val - x for val in yy]\n self.add(xx, d)\n \n return self.merge(xx, yy)\n\n def func(self, a, x):\n self.ans = 0\n self.sorts(a, x)\n return self.ans\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n num = [0] * len(nums)\n for i in range(len(nums)):\n num[i] = nums[i]\n \n n = len(nums)\n for i in range(1, n):\n num[i] += num[i - 1]\n\n key1 = self.func(num, lower - 1)\n key2 = self.func(num, upper)\n \n key3 = sum(1 for val in num if lower <= val <= upper)\n \n return -key1 + key2 + key3\n","memory":"33368"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n from sortedcontainers import SortedList\n for i in range(1, len(nums)):\n nums[i] += nums[i-1]\n\n ret = 0\n lst = SortedList()\n lst.add(0)\n for i in range(len(nums)):\n right = lst.bisect(nums[i] - lower +0.1)\n left = lst.bisect(nums[i] - upper -0.1)\n ret += right - left\n lst.add(nums[i])\n return ret","memory":"33368"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Divide and Conquer\n n = len(nums)\n if n <= 1:\n # Doesn't actually have to convert to int, but for clarity\n return int(nums and lower <= nums[0] <= upper)\n else:\n mid = n // 2\n\n # Suffix sum of the left array\n suffix = [0] * (mid + 1)\n for i in range(mid - 1, -1, -1):\n suffix[i] = suffix[i + 1] + nums[i]\n\n # We exclude index mid from suffix\n suffix = suffix[:-1]\n\n # Prefix sum of the right array\n prefix = [0] * (n - mid + 1)\n for i in range(mid, n):\n prefix[i - mid + 1] = prefix[i - mid] + nums[i]\n\n # Again, we exclude index mid from prefix\n # We also want to sort prefix, excluding mid\n prefix = sorted(prefix[1:])\n\n # Find count when start index is on the left array, and right index is on the right array\n count = 0\n for suf in suffix:\n count += bisect.bisect_right(prefix, upper - suf) - bisect.bisect_left(prefix, lower - suf)\n\n return count + self.countRangeSum(nums[:mid], lower, upper) + self.countRangeSum(nums[mid:], lower, upper)","memory":"35036"},{"code":"import copy\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # based on merge sort\n\n def _merge_sort(res, arr, left, right, lower, upper):\n # exclusive of the right end\n if right - left >= 2:\n mid = left + (right - left) // 2\n res, arr = _merge_sort(res, arr, left, mid, lower, upper)\n res, arr = _merge_sort(res, arr, mid, right, lower, upper)\n res, arr = _merge(res, arr, left, mid, right, lower, upper)\n elif right - left == 1:\n if (arr[left][0] >= lower) and (arr[left][0] <= upper):\n res[arr[left][1]] += 1\n return res, arr\n \n def _merge(res, arr, left, mid, right, lower, upper):\n # we use two separate points to process merging and counting range sums\n # \n # NOTE: merge sort ensure that indices for arr's elements from [mid, right)\n # are larger than elements from [left, mid)\n i = left\n j = mid\n k_lower = mid\n k_upper = mid\n\n sorted_arr = []\n while i < mid:\n lower_bound = arr[i][0] + lower\n upper_bound = arr[i][0] + upper\n\n # we find how many are in the range of [lower_bound, upper_bound]\n\n # NOTE: we use \"< lower_bound\" to include the left end\n while (k_lower < right) and (arr[k_lower][0] < lower_bound):\n k_lower += 1\n\n # NOTE: we use \"<= upper_bound\" to include the right end\n while (k_upper < right) and (arr[k_upper][0] <= upper_bound):\n k_upper += 1\n \n # print('merge: ', (left, mid, right), 'arr: ', [_[0] for _ in arr[left:right]], 'bound: ', (lower_bound, upper_bound), (k_lower, k_upper))\n\n res[arr[i][1]] += k_upper - k_lower\n # print(f'{res=}')\n\n while (j < right) and (arr[i][0] > arr[j][0]):\n sorted_arr.append(arr[j])\n j += 1\n \n sorted_arr.append(arr[i])\n i += 1\n \n while j < right:\n sorted_arr.append(arr[j])\n j += 1\n \n for tmp_i in range(len(sorted_arr)):\n arr[left + tmp_i] = sorted_arr[tmp_i]\n \n return res, arr\n\n arr = copy.deepcopy(nums)\n for tmp_i, tmp_val in enumerate(nums):\n if tmp_i == 0:\n arr[tmp_i] = (arr[0], 0)\n else:\n arr[tmp_i] = (arr[tmp_i] + arr[tmp_i - 1][0], tmp_i)\n \n # result for #range_sums when starting from i\n res = [0 for _ in nums]\n\n # print('arr before: ', [_[0] for _ in arr])\n\n res, arr = _merge_sort(res, arr, 0, len(nums), lower, upper)\n\n # print('arr after: ', [_[0] for _ in arr])\n # print('res: ', res)\n\n return sum(res)\n ","memory":"38371"},{"code":"import bisect\n\nclass FenwickTree:\n def __init__(self, n: int) -> None:\n self.BIT = [0] * (n+1)\n \n def sum(self, n: int) -> int:\n rv = 0\n while n > 0:\n rv += self.BIT[n]\n n -= n & -n\n return rv\n \n def increment(self, n: int) -> None:\n while n < len(self.BIT):\n self.BIT[n] += 1\n n += n & -n\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n sums = [0] * (len(nums)+1)\n for i, n in enumerate(nums):\n sums[i+1] = sums[i] + n\n sortedSums = sorted(sums)\n ranks = {s: i+1 for i, s in enumerate(sortedSums)}\n ft = FenwickTree(len(sums))\n rv = 0\n for s in sums:\n rv += (ft.sum(bisect.bisect_right(sortedSums, s-lower)) -\n ft.sum(bisect.bisect_left(sortedSums, s-upper)))\n ft.increment(ranks[s])\n return rv","memory":"38371"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n pre = [0]*(len(nums)+1)\n for i in range(1,len(nums)+1):\n pre[i] = pre[i-1] + nums[i-1]\n\n for i in pre:\n print(i,\" \",end=\"\")\n \n self.ans = 0\n\n def merge(l,mid,h):\n\n start,end = mid+1 , mid+1\n\n for i in range(l,mid+1):\n while start <= h and pre[start] - pre[i] < lower :\n start += 1\n while end <= h and pre[end] - pre[i] <= upper:\n end+=1\n self.ans += (end-start)\n\n s = []\n i,j = l,mid+1\n while i <= mid and j <= h :\n if pre[i] < pre[j]:\n s.append(pre[i])\n i += 1\n else:\n s.append(pre[j])\n j+= 1\n s += pre[i:mid+1] + pre[j:h+1]\n for i in range(len(s)):\n pre[i+l] = s[i]\n \n\n\n def sort(l,h):\n if l < h :\n mid = l + (h-l)//2 \n sort(l,mid)\n sort(mid+1,h)\n merge(l,mid,h)\n\n \n sort(0,len(nums))\n\n print()\n for i in pre:\n print( i , \" \",end =\"\" )\n\n return self.ans\n\n \n ","memory":"40038"},{"code":"class TreeNode:\n def __init__(self, val, left = None, right = None):\n self.val = val\n self.count = 1\n self.left = left\n self.right = right\n self.height = 1\n\nclass AVLTree:\n def __init__(self):\n self.root = None\n \n def add_value(self, value):\n self.root = self.add(self.root, value)\n\n def add(self, root, value):\n if not root:\n return TreeNode(value)\n\n if value == root.val:\n root.count += 1\n elif value < root.val:\n root.left = self.add(root.left, value)\n root.count += 1\n elif value > root.val:\n root.right = self.add(root.right, value)\n root.height = 1 + max(self.height(root.left), self.height(root.right))\n\n bal = self.balance(root)\n if bal > 1:\n if value > root.left.val:\n root.left = self.left_rotate(root.left)\n root = self.right_rotate(root)\n elif bal < -1:\n if value < root.right.val:\n root.right = self.right_rotate(root.right)\n root = self.left_rotate(root)\n\n return root\n\n def height(self, root):\n return root.height if root else 0\n \n def adjust_height(self, root):\n\t\t root.height = 1 + max(self.height(root.left), self.height(root.right))\n\n def balance(self, root):\n return self.height(root.left) - self.height(root.right) if root else 0\n\n def left_rotate(self, pivot):\n pivot_next = pivot.right\n pivot_next.left, pivot.right = pivot, pivot_next.left\n pivot_next.count += pivot.count\n self.adjust_height(pivot)\n self.adjust_height(pivot_next)\n return pivot_next\n\n def right_rotate(self, pivot):\n pivot_next = pivot.left\n pivot_next.right, pivot.left = pivot, pivot_next.right\n pivot.count -= pivot_next.count\n self.adjust_height(pivot)\n self.adjust_height(pivot_next)\n return pivot_next\n \n def find_value(self, val):\n return self.find(self.root, val)\n \n def find(self, root, val):\n if not root:\n return 0\n \n if root.val == val:\n return root.count\n elif root.val <= val:\n return root.count + self.find(root.right, val)\n else:\n return self.find(root.left, val)\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n res = 0\n tree = AVLTree()\n tree.add_value(0)\n total = 0\n for i in range(len(nums)):\n total += nums[i]\n res += tree.find_value(total - lower) - tree.find_value(total - upper - 1)\n tree.add_value(total)\n return res\n","memory":"40038"},{"code":"class Solution:\n bit=[]\n def getRSB(self, i):\n return i & -i\n def getSum(self, i):\n s = 0\n while i > 0:\n s += self.bit[i]\n i -= self.getRSB(i)\n return s\n \n def update(self, i):\n while i < len(self.bit):\n self.bit[i] += 1\n i += self.getRSB(i)\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n psum = [0 for i in range(n+1)]\n for i in range(n):\n psum[i+1] = psum[i] + nums[i]\n \n sorted_psum = sorted(psum)\n sorted_psum_map = {val: idx for idx, val in enumerate(sorted_psum)}\n\n res = 0\n self.bit = [0 for i in range(n+2)]\n\n print(sorted_psum)\n\n for i in range(n+1):\n pleft = psum[i] - upper\n pright = psum[i] - lower\n x = bisect.bisect_left(sorted_psum, pleft)\n y = bisect.bisect_right(sorted_psum, pright)\n\n lsum = self.getSum(x)\n rsum = self.getSum(y)\n\n res += rsum - lsum\n\n index = sorted_psum_map[psum[i]]\n self.update(index+1)\n\n return res\n\n\n \n ","memory":"41706"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n def countRangeSum(l, r):\n if l == r:\n return int(nums[l] >= lower and nums[r] <= upper)\n\n mid = l + (r - l) // 2\n prefix = [0] * (r - mid)\n currSum = 0\n for i in range(mid + 1, r + 1):\n currSum += nums[i]\n prefix[i - (mid + 1)] += currSum\n\n prefix.sort()\n\n count = 0\n currSum = 0\n for i in range(mid, l - 1, -1):\n currSum += nums[i]\n count += bisect.bisect_right(prefix, upper - currSum) - bisect.bisect_left(prefix, lower - currSum)\n\n return countRangeSum(l, mid) + countRangeSum(mid + 1, r) + count\n\n return countRangeSum(0, len(nums) - 1)\n ","memory":"41706"},{"code":"from sortedcontainers import SortedSet\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n prefixes = [0]\n for num in nums:\n prefixes.append(prefixes[-1] + num)\n \n def get_less(bound, strict):\n ss = SortedSet()\n ss.add((0, 0))\n ans = 0\n for i in range(1, n+1):\n cur_prefix = prefixes[i]\n val_to_check = cur_prefix - bound\n delimiter = float('inf') if strict else -1\n idx = ss.bisect_left((val_to_check, delimiter))\n ans += i - idx\n ss.add((cur_prefix, i))\n return ans\n\n return get_less(upper, False) - get_less(lower, True)","memory":"43373"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n from sortedcontainers import SortedSet\n\n s = SortedSet()\n\n pre = []\n pre2 = []\n tot = 0\n\n for i, num in enumerate(nums):\n pre.append((i, tot))\n tot += num\n pre2.append((i, tot))\n \n pre.sort(key = lambda x: x[1])\n pre2.sort(key = lambda x: x[1])\n\n n = len(pre)\n\n l = r = 0\n ans = 0\n for i in range(n):\n while r < n and pre[r][1] <= pre2[i][1] - lower:\n s.add(pre[r][0])\n r += 1\n while l < r and pre[l][1] < pre2[i][1] - upper:\n s.discard(pre[l][0])\n l += 1\n ans += s.bisect_right(pre2[i][0])\n\n return ans","memory":"45041"},{"code":"from itertools import accumulate\nfrom bisect import bisect_left\n\n# Define a class for Binary Indexed Tree (Fenwick Tree) data structure.\nclass BinaryIndexedTree:\n # Initialize the Binary Indexed Tree with `size` elements.\n def __init__(self, size):\n self.size = size\n self.tree = [0] * (size + 1)\n\n # Update the tree by adding a value `val` to the element at index `index`.\n def update(self, index, val):\n # Propagate the update up the tree.\n while index <= self.size:\n self.tree[index] += val\n index += index & -index\n\n # Query the cumulative sum from index 1 to `index`.\n def query(self, index):\n sum_ = 0\n # Aggregate the sums.\n while index > 0:\n sum_ += self.tree[index]\n index -= index & -index\n return sum_\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # ans = 0\n # for i in range(len(nums)):\n # for j in range(i , len(nums)+1):\n # a = sum(nums[i:j])\n # if i < j and a >= lower and a <= upper:\n # ans+= 1\n # return ans\n # Compute the prefix sums of the input array `nums`.\n prefix_sums = list(accumulate(nums, initial=0))\n # Flatten and sort the unique sums for tree construction.\n sorted_arr = sorted(set(x for sum_ in prefix_sums for x in (sum_, sum_ - lower, sum_ - upper)))\n # Initialize the Binary Indexed Tree with the length of the sorted unique sums.\n tree = BinaryIndexedTree(len(sorted_arr))\n count = 0 # Initialize the count of ranges.\n \n # Iterate over the prefix sums.\n for sum_ in prefix_sums:\n # Find the indices for the current sum minus the upper and lower bounds.\n # +1 because our BIT is 1-indexed.\n left = bisect_left(sorted_arr, sum_ - upper) + 1\n right = bisect_left(sorted_arr, sum_ - lower) + 1\n # Calculate the number of sums in the range [lower, upper].\n count += tree.query(right) - tree.query(left - 1)\n # Update the BIT for the current prefix sum.\n tree.update(bisect_left(sorted_arr, sum_) + 1, 1)\n \n # Return the total count of sums in the range.\n return count","memory":"45041"},{"code":"from itertools import accumulate\nfrom bisect import bisect_left\n\n# Define a class for Binary Indexed Tree (Fenwick Tree) data structure.\nclass BinaryIndexedTree:\n # Initialize the Binary Indexed Tree with `size` elements.\n def __init__(self, size):\n self.size = size\n self.tree = [0] * (size + 1)\n\n # Update the tree by adding a value `val` to the element at index `index`.\n def update(self, index, val):\n # Propagate the update up the tree.\n while index <= self.size:\n self.tree[index] += val\n index += index & -index\n\n # Query the cumulative sum from index 1 to `index`.\n def query(self, index):\n sum_ = 0\n # Aggregate the sums.\n while index > 0:\n sum_ += self.tree[index]\n index -= index & -index\n return sum_\n\n\n# Solution class to solve the problem.\nclass Solution:\n def countRangeSum(self, nums, lower, upper):\n # Compute the prefix sums of the input array `nums`.\n prefix_sums = list(accumulate(nums, initial=0))\n # Flatten and sort the unique sums for tree construction.\n sorted_arr = sorted(set(x for sum_ in prefix_sums for x in (sum_, sum_ - lower, sum_ - upper)))\n # Initialize the Binary Indexed Tree with the length of the sorted unique sums.\n tree = BinaryIndexedTree(len(sorted_arr))\n count = 0 # Initialize the count of ranges.\n \n # Iterate over the prefix sums.\n for sum_ in prefix_sums:\n # Find the indices for the current sum minus the upper and lower bounds.\n # +1 because our BIT is 1-indexed.\n left = bisect_left(sorted_arr, sum_ - upper) + 1\n right = bisect_left(sorted_arr, sum_ - lower) + 1\n # Calculate the number of sums in the range [lower, upper].\n count += tree.query(right) - tree.query(left - 1)\n # Update the BIT for the current prefix sum.\n tree.update(bisect_left(sorted_arr, sum_) + 1, 1)\n \n # Return the total count of sums in the range.\n return count ","memory":"46708"},{"code":"class BinaryIndexedTree:\n def __init__(self, n):\n self.n = n\n self.c = [0] * (n + 1)\n\n def update(self, x, v):\n while x <= self.n:\n self.c[x] += v\n x += x & -x\n\n def query(self, x):\n s = 0\n while x > 0:\n s += self.c[x]\n x -= x & -x\n return s\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n s = list(accumulate(nums, initial=0))\n arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))\n tree = BinaryIndexedTree(len(arr))\n ans = 0\n for x in s:\n l = bisect_left(arr, x - upper) + 1\n r = bisect_left(arr, x - lower) + 1\n ans += tree.query(r) - tree.query(l - 1)\n tree.update(bisect_left(arr, x) + 1, 1)\n return ans\n ","memory":"48376"},{"code":"class BinaryIndexedTree:\n def __init__(self, n):\n self.n = n\n self.c = [0] * (n + 1)\n\n def update(self, x, v):\n while x <= self.n:\n self.c[x] += v\n x += x & -x\n\n def query(self, x):\n s = 0\n while x > 0:\n s += self.c[x]\n x -= x & -x\n return s\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int: \n s = list(accumulate(nums, initial=0))\n arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))\n tree = BinaryIndexedTree(len(arr))\n ans = 0\n for x in s:\n l = bisect_left(arr, x - upper) + 1\n r = bisect_left(arr, x - lower) + 1\n ans += tree.query(r) - tree.query(l - 1)\n tree.update(bisect_left(arr, x) + 1, 1)\n return ans ","memory":"50043"},{"code":"class BinaryIndexedTree:\n def __init__(self, n):\n self.n = n\n self.c = [0] * (n + 1)\n\n def update(self, x, v):\n while x <= self.n:\n self.c[x] += v\n x += x & -x\n\n def query(self, x):\n s = 0\n while x > 0:\n s += self.c[x]\n x -= x & -x\n return s\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n s = list(accumulate(nums, initial=0))\n arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))\n tree = BinaryIndexedTree(len(arr))\n ans = 0\n for x in s:\n l = bisect_left(arr, x - upper) + 1\n r = bisect_left(arr, x - lower) + 1\n ans += tree.query(r) - tree.query(l - 1)\n tree.update(bisect_left(arr, x) + 1, 1)\n return ans","memory":"50043"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n cumsums = [0]\n for n in nums:\n cumsums.append(cumsums[-1] + n)\n\n def mergesort(l,r):\n if l == r:\n return 0\n mid = (l+r)//2\n cnt = mergesort(l,mid) + mergesort(mid+1,r)\n\t\t\t\n i = j = mid+1\n # O(n)\n for left in cumsums[l:mid+1]:\n while i <= r and cumsums[i] - left < lower:\n i+=1\n while j <= r and cumsums[j] - left <= upper:\n j+=1\n cnt += j-i\n \n cumsums[l:r+1] = sorted(cumsums[l:r+1])\n return cnt\n\t\t\t\n return mergesort(0,len(cumsums)-1)","memory":"51711"},{"code":"class Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n pref=[0]\n for x in nums:\n pref.append(pref[-1]+x)\n print(pref)\n def mergesort(l,r):\n if l==r:\n return 0\n mid = (l+r)//2\n cnt = mergesort(l,mid)+mergesort(mid+1,r)\n\n i=j=mid+1\n\n for left in pref[l:mid+1]:\n while i<=r and pref[i] - left < lower:\n i+=1\n while j<=r and pref[j] - left <= upper:\n j+=1\n cnt+=j-i\n pref[l:r+1] = sorted(pref[l:r+1])\n return cnt\n return mergesort(0,len(pref)-1)\n\n\n\n\n\n\n ","memory":"51711"},{"code":"class Solution:\n # prefix-sum + hashmap | time complexity: O(n+(upper-lower+1)*n)\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n cumsum = [0]\n for n in nums:\n cumsum.append(cumsum[-1]+n)\n \n import collections\n record = collections.defaultdict(int)\n \n res = 0\n for csum in cumsum:\n for target in range(lower,upper+1):\n if csum - target in record:\n res += record[csum - target]\n record[csum] +=1\n return res\n\n\nclass SegmentTreeNode:\n\tdef __init__(self,low,high):\n\t\tself.low = low\n\t\tself.high = high\n\t\tself.left = None\n\t\tself.right = None\n\t\tself.cnt = 0 \n \nclass Solution: \n def _bulid(self, left, right): \n root = SegmentTreeNode(self.cumsum[left],self.cumsum[right])\n if left == right:\n return root\n \n mid = (left+right)//2\n root.left = self._bulid(left, mid)\n root.right = self._bulid(mid+1, right)\n return root\n \n def _update(self, root, val):\n if not root:\n return \n if root.low<=val<=root.high:\n root.cnt += 1\n self._update(root.left, val)\n self._update(root.right, val)\n \n def _query(self, root, lower, upper):\n if lower <= root.low and root.high <= upper:\n return root.cnt\n if upper < root.low or root.high < lower:\n return 0\n return self._query(root.left, lower, upper) + self._query(root.right, lower, upper)\n \n # prefix-sum + SegmentTree | O(nlogn) \n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n cumsum = [0]\n for n in nums:\n cumsum.append(cumsum[-1]+n)\n \n self.cumsum = sorted(list(set(cumsum))) # need sorted\n root = self._bulid(0,len(self.cumsum)-1)\n \n res = 0\n for csum in cumsum:\n res += self._query(root, csum-upper, csum-lower)\n self._update(root, csum) \n return res","memory":"53378"},{"code":"class segTree:\n def __init__(self, low, high):\n self.low = low\n self.high = high\n self.left = None\n self.right = None\n self.cnt = 0\n\nclass Solution:\n def build(self, l, r):\n root = segTree(self.prefix[l], self.prefix[r])\n if l == r:\n return root\n\n mid = (l + r) // 2\n root.left = self.build(l, mid)\n root.right = self.build(mid + 1, r)\n return root\n\n def update(self, root, val):\n if not root:\n return\n\n if root.low <= val <= root.high:\n root.cnt += 1\n self.update(root.left, val)\n self.update(root.right, val)\n return\n \n def query(self, root, lower, upper):\n if lower <= root.low and root.high <= upper:\n return root.cnt\n \n if root.high < lower or upper < root.low:\n return 0\n\n return self.query(root.left, lower, upper) + self.query(root.right, lower, upper)\n\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = [0]\n for num in nums:\n prefix.append(prefix[-1] + num)\n \n self.prefix = sorted(list(set(prefix)))\n root = self.build(0, len(self.prefix) - 1)\n\n ans = 0\n for pre in prefix:\n ans += self.query(root, pre - upper, pre - lower)\n self.update(root, pre)\n \n return ans\n\n\n ","memory":"55046"},{"code":"class SegmentTreeNode:\n\tdef __init__(self,low,high):\n\t\tself.low = low\n\t\tself.high = high\n\t\tself.left = None\n\t\tself.right = None\n\t\tself.cnt = 0 \n \nclass Solution: \n def _bulid(self, left, right): \n root = SegmentTreeNode(self.cumsum[left],self.cumsum[right])\n if left == right:\n return root\n \n mid = (left+right)//2\n root.left = self._bulid(left, mid)\n root.right = self._bulid(mid+1, right)\n return root\n \n def _update(self, root, val):\n if not root:\n return \n if root.low<=val<=root.high:\n root.cnt += 1\n self._update(root.left, val)\n self._update(root.right, val)\n \n def _query(self, root, lower, upper):\n if lower <= root.low and root.high <= upper:\n return root.cnt\n if upper < root.low or root.high < lower:\n return 0\n return self._query(root.left, lower, upper) + self._query(root.right, lower, upper)\n \n # prefix-sum + SegmentTree | O(nlogn) \n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n cumsum = [0]\n for n in nums:\n cumsum.append(cumsum[-1]+n)\n \n self.cumsum = sorted(list(set(cumsum))) # need sorted\n root = self._bulid(0,len(self.cumsum)-1)\n \n res = 0\n for csum in cumsum:\n res += self._query(root, csum-upper, csum-lower)\n self._update(root, csum) \n return res","memory":"56713"},{"code":"# lower <= presum[j]-presum[i-1] <= upper\n# lower + presum[i-1] <= presum[j] <= upper + presum[i-1]\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n n = len(nums)\n track = set()\n presum = nums.copy()\n for i in range(1, n):\n presum[i] += presum[i-1]\n\n for ele in nums:\n track.add(ele)\n\n track.add(lower)\n track.add(upper)\n for ele in presum:\n track.add(ele)\n track.add(ele+lower)\n track.add(ele+upper)\n \n track = list(track)\n track.sort()\n m = {}\n for i, num in enumerate(track):\n m[num] = i+1\n\n N = len(track)\n bit = [0]*(N+1)\n\n def update(x, val):\n while x <= N:\n bit[x] += val\n x += (x&-x)\n \n def query(x):\n res = 0\n while x > 0:\n res += bit[x]\n x -= (x&-x)\n return res\n\n # print(m)\n ans = 0\n for i in range(n-1, -1, -1):\n update(m[presum[i]], 1)\n prev = 0\n if i > 0:\n prev = presum[i-1]\n # print(i, bit, m[prev+upper], m[prev+lower]-1)\n r = query(m[prev+upper])\n l = query(m[prev+lower]-1)\n if r > 0:\n ans += (r-l)\n return ans","memory":"58381"},{"code":"class SegmentTree:\n def __init__(self, data):\n self.n = len(data)\n self.tree = [0] * (2 * self.n)\n \n def update(self, index, value):\n index += self.n\n self.tree[index] += value\n while index > 1:\n index //= 2\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\n \n def query(self, left, right):\n result = 0\n left += self.n\n right += self.n\n while left < right:\n if left % 2:\n result += self.tree[left]\n left += 1\n if right % 2:\n right -= 1\n result += self.tree[right]\n left //= 2\n right //= 2\n return result\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n \n all_sums = sorted(set(prefix_sums + [x - lower for x in prefix_sums] + [x - upper for x in prefix_sums]))\n sum_index = {v: i for i, v in enumerate(all_sums)}\n \n seg_tree = SegmentTree([0] * len(all_sums))\n count = 0\n \n for sum_val in prefix_sums:\n left_index = sum_index[sum_val - upper]\n right_index = sum_index[sum_val - lower]\n count += seg_tree.query(left_index, right_index + 1)\n seg_tree.update(sum_index[sum_val], 1)\n \n return count\n","memory":"60048"},{"code":"class SegmentTree:\n def __init__(self, n):\n self.n = n\n self.tree = [0] * (2 * n)\n \n def update(self, index, value):\n index += self.n\n self.tree[index] += value\n while index > 1:\n index //= 2\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\n \n def query(self, left, right):\n left += self.n\n right += self.n + 1\n sum_ = 0\n while left < right:\n if left % 2 == 1:\n sum_ += self.tree[left]\n left += 1\n if right % 2 == 1:\n right -= 1\n sum_ += self.tree[right]\n left //= 2\n right //= 2\n return sum_\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n # Step 1: Calculate prefix sums\n prefix_sum = [0]\n for num in nums:\n prefix_sum.append(prefix_sum[-1] + num)\n \n # Step 2: Coordinate compression\n all_values = sorted(set(prefix_sum + [ps - lower for ps in prefix_sum] + [ps - upper for ps in prefix_sum]))\n value_to_index = {value: index for index, value in enumerate(all_values)}\n \n # Step 3: Initialize Segment Tree\n seg_tree = SegmentTree(len(all_values))\n result = 0\n \n # Step 4: Process each prefix sum\n for ps in prefix_sum:\n left_bound = value_to_index[ps - upper]\n right_bound = value_to_index[ps - lower]\n result += seg_tree.query(left_bound, right_bound)\n seg_tree.update(value_to_index[ps], 1)\n \n return result","memory":"61716"},{"code":"class Solution:\n SEG = []\n N = 0\n def add_point(self, ind: int, l: int, r: int, pos: int):\n if not r - l == 1:\n if pos < (r + l) // 2:\n self.add_point(2 * ind, l, (r + l) // 2, pos)\n else:\n self.add_point(2 * ind + 1, (r + l) // 2, r, pos)\n self.SEG[ind] += 1\n \n def range_sum(self, ind: int, l: int, r: int, b: int, e: int):\n if l >= b and r <= e:\n return self.SEG[ind]\n if l >= e or r <= b:\n return 0\n return self.range_sum(2 * ind, l, (r + l) // 2, b, e) + self.range_sum(2 * ind + 1, (r + l) // 2, r, b, e)\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n all_point = set([0])\n sm = 0\n for num in nums:\n sm += num\n all_point.add(sm)\n all_point.add(sm - lower)\n all_point.add(sm - upper)\n all_point = list(all_point)\n all_point = sorted(all_point)\n mp = {}\n sm = 0\n for pt in all_point:\n mp[pt] = sm\n sm += 1\n self.N = len(all_point)\n self.SEG = [0] * (4 * (self.N + 1))\n self.add_point(1, 0, self.N, mp[0])\n res = 0\n sm = 0\n for num in nums:\n sm += num\n res += self.range_sum(1, 0, self.N, mp[sm - upper], mp[sm - lower] + 1)\n self.add_point(1, 0, self.N, mp[sm])\n return res","memory":"63383"},{"code":"class SegmentTree:\n def __init__(self, n):\n self.n = n\n self.tree = [0] * (2 * n)\n\n def update(self, index, value):\n index += self.n\n self.tree[index] += value\n while index > 1:\n index //= 2\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\n\n def query(self, left, right):\n left += self.n\n right += self.n\n s = 0\n while left < right:\n if left % 2 == 1:\n s += self.tree[left]\n left += 1\n if right % 2 == 1:\n right -= 1\n s += self.tree[right]\n left //= 2\n right //= 2\n return s\n\nclass Solution:\n def countRangeSum(self, nums, lower, upper):\n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n\n all_sums = set(prefix_sums)\n for s in prefix_sums:\n all_sums.add(s - lower)\n all_sums.add(s - upper)\n\n sorted_sums = sorted(all_sums)\n rank = {v: i for i, v in enumerate(sorted_sums)}\n\n\n tree = SegmentTree(len(sorted_sums))\n count = 0\n\n for s in prefix_sums:\n left = rank[s - upper]\n right = rank[s - lower] + 1\n count += tree.query(left, right)\n tree.update(rank[s], 1)\n\n return count","memory":"65051"},{"code":"class SegmentTree:\n def __init__(self, n):\n self.n = n\n self.tree = [0] * (2 * n)\n\n def update(self, index, value):\n index += self.n\n self.tree[index] += value\n while index > 1:\n index //= 2\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\n\n def query(self, left, right):\n left += self.n\n right += self.n\n s = 0\n while left < right:\n if left % 2 == 1:\n s += self.tree[left]\n left += 1\n if right % 2 == 1:\n right -= 1\n s += self.tree[right]\n left //= 2\n right //= 2\n return s\n\nclass Solution:\n def countRangeSum(self, nums, lower, upper):\n prefix_sums = [0]\n for num in nums:\n prefix_sums.append(prefix_sums[-1] + num)\n\n all_sums = set(prefix_sums)\n for s in prefix_sums:\n all_sums.add(s - lower)\n all_sums.add(s - upper)\n\n sorted_sums = sorted(all_sums)\n rank = {v: i for i, v in enumerate(sorted_sums)}\n\n\n tree = SegmentTree(len(sorted_sums))\n count = 0\n\n for sum_ in prefix_sums:\n left = rank[sum_ - upper]\n right = rank[sum_ - lower] + 1\n count += tree.query(left, right)\n tree.update(rank[sum_], 1)\n\n return count","memory":"66718"},{"code":"class SegmentTree:\n def __init__(self, size: int):\n self.size = size\n self.tree = [0] * 2 * self.size\n\n def update(self, idx: int):\n idx += self.size\n while idx > 0:\n self.tree[idx] += 1\n idx //= 2\n\n def query(self, left: int, right: int) -> int:\n if left == 0 and right == 2:\n print(left + self.size, right + self.size + 1)\n left += self.size\n right += self.size + 1\n count = 0\n\n while left < right:\n if left % 2 == 1:\n count += self.tree[left]\n left += 1\n\n if right % 2 == 1:\n right -= 1\n count += self.tree[right]\n\n left //= 2\n right //= 2\n\n return count\n\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix_sums = {0, -lower, -upper}\n curr_ps = 0\n for num in nums:\n curr_ps += num\n prefix_sums.add(curr_ps)\n prefix_sums.add(curr_ps - lower)\n prefix_sums.add(curr_ps - upper)\n\n sorted_ps = sorted(list(prefix_sums))\n\n sgmnt_tree = SegmentTree(size=len(sorted_ps) + 1)\n\n ps_idx_map = {v: i for i, v in enumerate(sorted_ps)}\n\n ans = 0\n curr_ps = 0\n sgmnt_tree.update(ps_idx_map[curr_ps])\n\n for num in nums:\n curr_ps += num\n left = ps_idx_map[curr_ps - upper]\n right = ps_idx_map[curr_ps - lower]\n ans += sgmnt_tree.query(left, right)\n\n sgmnt_tree.update(ps_idx_map[curr_ps])\n\n return ans\n","memory":"68386"},{"code":"class SegmentTree:\n def __init__(self, n: int) -> None:\n self.n = n\n self.tree = [0]*(4*n)\n self.tags = [0]*(4*n)\n \n def _pushdown(self, idx: int, s: int, mid: int, e: int) -> None:\n if self.tags[idx] != 0:\n self.tags[idx*2] += self.tags[idx]\n self.tags[idx*2+1] += self.tags[idx]\n self.tree[idx*2] += (mid-s+1)*self.tags[idx]\n self.tree[idx*2+1] += (e-mid)*self.tags[idx]\n self.tags[idx] = 0\n \n def update(self, t_s: int, t_e: int, s: int, e: int, idx: int, val: int) -> None:\n if t_s <= s and t_e >= e:\n self.tree[idx] += val*(e-s+1)\n self.tags[idx] += val\n elif t_e < s or t_s > e:\n return\n else:\n mid = (s+e)//2\n self._pushdown(idx, s, mid, e)\n self.update(t_s, t_e, s, mid, 2*idx, val)\n self.update(t_s, t_e, mid+1, e, 2*idx+1, val)\n self.tree[idx] = self.tree[2*idx] + self.tree[2*idx+1]\n \n def query(self, t_s: int, t_e: int, s: int, e: int, idx: int) -> int:\n if t_s <= s and t_e >= e:\n return self.tree[idx]\n elif t_e < s or t_s > e:\n return 0\n else:\n mid = (s+e)//2\n self._pushdown(idx, s, mid, e)\n left = self.query(t_s, t_e, s, mid, 2*idx)\n right = self.query(t_s, t_e, mid+1, e, 2*idx+1)\n return left+right\n\nclass Solution:\n def preprocess(self, prefix: List[int], lower: int, upper: int) -> Dict[int, int]:\n points = set()\n for p in prefix:\n points.add(p)\n points.add(p-lower)\n points.add(p-upper)\n points = sorted(list(points))\n map_prefix = {}\n for idx, p in enumerate(points):\n map_prefix[p] = idx\n return map_prefix\n \n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n prefix = [0]*len(nums)\n n = len(nums)*3+3\n sg_tree = SegmentTree(n)\n for i in range(len(nums)):\n if i==0:\n prefix[i] = nums[i]\n else:\n prefix[i] = nums[i]+prefix[i-1]\n map_prefix = self.preprocess(prefix, lower, upper)\n ans = 0\n for i in range(len(nums)):\n p = prefix[i]\n if lower <= p <= upper:\n ans += 1\n p_idx = map_prefix[p]\n lo, hi = map_prefix[p-upper], map_prefix[p-lower]\n res = sg_tree.query(lo, hi, 0, n-1, 1)\n ans += res\n sg_tree.update(p_idx, p_idx, 0, n-1, 1, 1)\n \n return ans\n \n ","memory":"70053"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","memory":"71721"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","memory":"73388"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n\n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n\n mid = (start + end) //2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n\n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n\n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n\n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n\n return _query(node.left) + _query(node.right)\n return _query(self.root)\n\nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sum_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sum_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sum_to_ind[presum - upper]\n high = sum_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sum_to_ind[presum])\n return result","memory":"75056"},{"code":"class SegmentTree:\n class Node:\n def __init__(self, start, end):\n self.start = start\n self.end = end\n self.left = None\n self.right = None\n self.count = 0\n \n def __init__(self, start, end):\n def _build(start, end):\n if start > end:\n return None\n if start == end:\n return SegmentTree.Node(start, end)\n \n mid = (start + end) // 2\n node = SegmentTree.Node(start, end)\n node.left = _build(start, mid)\n node.right = _build(mid + 1, end)\n return node\n self.root = _build(start, end)\n \n def update(self, ind):\n def _update(node):\n if not node or node.start > ind or node.end < ind:\n return\n if node.start == node.end == ind:\n node.count += 1\n return\n \n _update(node.left)\n _update(node.right)\n node.count = node.left.count + node.right.count\n\n _update(self.root)\n \n def query(self, query_start, query_end):\n def _query(node):\n if not node or node.start > query_end or node.end < query_start:\n return 0\n if node.start >= query_start and node.end <= query_end:\n return node.count\n \n return _query(node.left) + _query(node.right)\n return _query(self.root)\n \nclass Solution:\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\n presums = [0]\n for num in nums:\n presums.append(presums[-1] + num)\n \n # compress all possible presums, and potential query bounds to index\n possible_all_sums = []\n for presum in presums:\n possible_all_sums.append(presum)\n possible_all_sums.append(presum - upper)\n possible_all_sums.append(presum - lower)\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\n\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\n\n result = 0\n for presum in presums:\n low = sums_to_ind[presum - upper]\n high = sums_to_ind[presum - lower]\n result += segmentTree.query(low, high)\n segmentTree.update(sums_to_ind[presum])\n return result","memory":"76723"}],"string":"[\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: list[int], lower: int, upper: int) -> int:\\n prefix_sums = [0] \\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n def count_while_sorting(prefix_sums, start, end):\\n if end - start <= 1:\\n return 0\\n mid = (start + end) // 2\\n count = count_while_sorting(prefix_sums, start, mid) + count_while_sorting(prefix_sums, mid, end)\\n j = k = mid\\n for i in range(start, mid):\\n while j < end and prefix_sums[j] - prefix_sums[i] < lower:\\n j += 1\\n while k < end and prefix_sums[k] - prefix_sums[i] <= upper:\\n k += 1\\n count += k - j\\n prefix_sums[start:end] = sorted(prefix_sums[start:end])\\n return count\\n return count_while_sorting(prefix_sums, 0, len(prefix_sums))\\n\",\n \"memory\": \"30033\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n #count = 0\\n #ranges = []\\n #def check(num):\\n # return (lower <= num <= upper)\\n \\n #for i in range(len(nums)):\\n # for j in range(i, len(nums)):\\n # s = sum(nums[i: j + 1])\\n # if check(s):\\n # count += 1\\n # #ranges.append([i, j])\\n #print(ranges)\\n #return count\\n\\n prefix, ret = [0], 0\\n for s in accumulate(nums):\\n ret += bisect_right(prefix, s - lower) - bisect_left(prefix, s - upper)\\n bisect.insort(prefix, s)\\n return ret\",\n \"memory\": \"30033\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n if len(nums) == 1:\\n return 1 if nums[0] >= lower and nums[0] <= upper else 0\\n prefix = [0]\\n sum = 0\\n for num in nums:\\n sum += num\\n prefix.append(sum)\\n self.cnt = 0\\n self.merge(prefix, lower, upper)\\n return self.cnt\\n \\n def merge(self, prefix, lower, upper):\\n if len(prefix) == 1:\\n return\\n mid = len(prefix) // 2 \\n l = prefix[:mid]\\n r = prefix[mid:]\\n self.merge(l, lower, upper)\\n self.merge(r, lower, upper)\\n # binary search r[j] - l[i] >= lower, r[j] - l[i] <= upper, r[j\\n for i in range (0, len(l)):\\n lo = 0\\n hi = len(r) - 1\\n while lo < hi:\\n mid = (lo + hi + 1) // 2\\n if r[mid] <= l[i] + upper:\\n lo = mid\\n else:\\n hi = mid - 1\\n last = lo\\n lo = 0\\n hi = len(r) - 1\\n while lo < hi:\\n mid = (lo + hi) // 2\\n if r[mid] >= l[i] + lower:\\n hi = mid\\n else:\\n lo = mid + 1\\n first = lo\\n # print(i, first, last)\\n if r[last] <= l[i] + upper and r[first] >= l[i] + lower:\\n self.cnt += (last - first + 1)\\n # merge 2 sorted parts\\n idx1 = 0\\n idx2 = 0\\n while idx1 < len(l) or idx2 < len(r):\\n if idx1 == len(l):\\n prefix[idx1+idx2] = r[idx2]\\n idx2 += 1\\n elif idx2 == len(r):\\n prefix[idx1+idx2] = l[idx1]\\n idx1 += 1\\n elif l[idx1] < r[idx2]:\\n prefix[idx1+idx2] = l[idx1]\\n idx1 += 1\\n else:\\n prefix[idx1+idx2] = r[idx2]\\n idx2 += 1\\n\\n \\n \\n \",\n \"memory\": \"31701\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = [0]\\n sum = 0\\n for num in nums:\\n sum += num\\n prefix.append(sum)\\n return self.merge(prefix, 0, len(prefix), lower, upper)\\n \\n def merge(self, prefix, lo, hi, lower, upper):\\n mid = (lo+hi) // 2\\n if mid == lo:\\n return 0\\n count = self.merge(prefix, lo, mid, lower, upper) + self.merge(prefix, mid, hi, lower, upper) \\n i = j = mid\\n for left in prefix[lo:mid]:\\n while i < hi and prefix[i] - left < lower: i += 1\\n while j < hi and prefix[j] - left <= upper: j += 1\\n count += j - i\\n prefix[lo:hi] = sorted(prefix[lo:hi])\\n return count\\n \",\n \"memory\": \"31701\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def __init__(self):\\n self.ans = 0\\n\\n def add(self, a, b):\\n j, k = 0, 0\\n while j < len(a) and k < len(b):\\n if a[j] < b[k]:\\n j += 1\\n else:\\n self.ans += len(a) - j\\n k += 1\\n\\n def merge(self, a, b):\\n c = []\\n j, k = 0, 0\\n while j < len(a) and k < len(b):\\n if a[j] < b[k]:\\n c.append(a[j])\\n j += 1\\n else:\\n self.ans += len(a) - j\\n c.append(b[k])\\n k += 1\\n while j < len(a):\\n c.append(a[j])\\n j += 1\\n while k < len(b):\\n c.append(b[k])\\n k += 1\\n return c\\n\\n def sorts(self, a, x):\\n if len(a) <= 1:\\n return a\\n n = len(a)\\n b = a[:n//2]\\n c = a[n//2:]\\n \\n xx = self.sorts(b, x)\\n yy = self.sorts(c, x)\\n \\n d = [val - x for val in yy]\\n self.add(xx, d)\\n \\n return self.merge(xx, yy)\\n\\n def func(self, a, x):\\n self.ans = 0\\n self.sorts(a, x)\\n return self.ans\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n num = [0] * len(nums)\\n for i in range(len(nums)):\\n num[i] = nums[i]\\n \\n n = len(nums)\\n for i in range(1, n):\\n num[i] += num[i - 1]\\n\\n key1 = self.func(num, lower - 1)\\n key2 = self.func(num, upper)\\n \\n key3 = sum(1 for val in num if lower <= val <= upper)\\n \\n return -key1 + key2 + key3\\n\",\n \"memory\": \"33368\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n from sortedcontainers import SortedList\\n for i in range(1, len(nums)):\\n nums[i] += nums[i-1]\\n\\n ret = 0\\n lst = SortedList()\\n lst.add(0)\\n for i in range(len(nums)):\\n right = lst.bisect(nums[i] - lower +0.1)\\n left = lst.bisect(nums[i] - upper -0.1)\\n ret += right - left\\n lst.add(nums[i])\\n return ret\",\n \"memory\": \"33368\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Divide and Conquer\\n n = len(nums)\\n if n <= 1:\\n # Doesn't actually have to convert to int, but for clarity\\n return int(nums and lower <= nums[0] <= upper)\\n else:\\n mid = n // 2\\n\\n # Suffix sum of the left array\\n suffix = [0] * (mid + 1)\\n for i in range(mid - 1, -1, -1):\\n suffix[i] = suffix[i + 1] + nums[i]\\n\\n # We exclude index mid from suffix\\n suffix = suffix[:-1]\\n\\n # Prefix sum of the right array\\n prefix = [0] * (n - mid + 1)\\n for i in range(mid, n):\\n prefix[i - mid + 1] = prefix[i - mid] + nums[i]\\n\\n # Again, we exclude index mid from prefix\\n # We also want to sort prefix, excluding mid\\n prefix = sorted(prefix[1:])\\n\\n # Find count when start index is on the left array, and right index is on the right array\\n count = 0\\n for suf in suffix:\\n count += bisect.bisect_right(prefix, upper - suf) - bisect.bisect_left(prefix, lower - suf)\\n\\n return count + self.countRangeSum(nums[:mid], lower, upper) + self.countRangeSum(nums[mid:], lower, upper)\",\n \"memory\": \"35036\"\n },\n {\n \"code\": \"import copy\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # based on merge sort\\n\\n def _merge_sort(res, arr, left, right, lower, upper):\\n # exclusive of the right end\\n if right - left >= 2:\\n mid = left + (right - left) // 2\\n res, arr = _merge_sort(res, arr, left, mid, lower, upper)\\n res, arr = _merge_sort(res, arr, mid, right, lower, upper)\\n res, arr = _merge(res, arr, left, mid, right, lower, upper)\\n elif right - left == 1:\\n if (arr[left][0] >= lower) and (arr[left][0] <= upper):\\n res[arr[left][1]] += 1\\n return res, arr\\n \\n def _merge(res, arr, left, mid, right, lower, upper):\\n # we use two separate points to process merging and counting range sums\\n # \\n # NOTE: merge sort ensure that indices for arr's elements from [mid, right)\\n # are larger than elements from [left, mid)\\n i = left\\n j = mid\\n k_lower = mid\\n k_upper = mid\\n\\n sorted_arr = []\\n while i < mid:\\n lower_bound = arr[i][0] + lower\\n upper_bound = arr[i][0] + upper\\n\\n # we find how many are in the range of [lower_bound, upper_bound]\\n\\n # NOTE: we use \\\"< lower_bound\\\" to include the left end\\n while (k_lower < right) and (arr[k_lower][0] < lower_bound):\\n k_lower += 1\\n\\n # NOTE: we use \\\"<= upper_bound\\\" to include the right end\\n while (k_upper < right) and (arr[k_upper][0] <= upper_bound):\\n k_upper += 1\\n \\n # print('merge: ', (left, mid, right), 'arr: ', [_[0] for _ in arr[left:right]], 'bound: ', (lower_bound, upper_bound), (k_lower, k_upper))\\n\\n res[arr[i][1]] += k_upper - k_lower\\n # print(f'{res=}')\\n\\n while (j < right) and (arr[i][0] > arr[j][0]):\\n sorted_arr.append(arr[j])\\n j += 1\\n \\n sorted_arr.append(arr[i])\\n i += 1\\n \\n while j < right:\\n sorted_arr.append(arr[j])\\n j += 1\\n \\n for tmp_i in range(len(sorted_arr)):\\n arr[left + tmp_i] = sorted_arr[tmp_i]\\n \\n return res, arr\\n\\n arr = copy.deepcopy(nums)\\n for tmp_i, tmp_val in enumerate(nums):\\n if tmp_i == 0:\\n arr[tmp_i] = (arr[0], 0)\\n else:\\n arr[tmp_i] = (arr[tmp_i] + arr[tmp_i - 1][0], tmp_i)\\n \\n # result for #range_sums when starting from i\\n res = [0 for _ in nums]\\n\\n # print('arr before: ', [_[0] for _ in arr])\\n\\n res, arr = _merge_sort(res, arr, 0, len(nums), lower, upper)\\n\\n # print('arr after: ', [_[0] for _ in arr])\\n # print('res: ', res)\\n\\n return sum(res)\\n \",\n \"memory\": \"38371\"\n },\n {\n \"code\": \"import bisect\\n\\nclass FenwickTree:\\n def __init__(self, n: int) -> None:\\n self.BIT = [0] * (n+1)\\n \\n def sum(self, n: int) -> int:\\n rv = 0\\n while n > 0:\\n rv += self.BIT[n]\\n n -= n & -n\\n return rv\\n \\n def increment(self, n: int) -> None:\\n while n < len(self.BIT):\\n self.BIT[n] += 1\\n n += n & -n\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n sums = [0] * (len(nums)+1)\\n for i, n in enumerate(nums):\\n sums[i+1] = sums[i] + n\\n sortedSums = sorted(sums)\\n ranks = {s: i+1 for i, s in enumerate(sortedSums)}\\n ft = FenwickTree(len(sums))\\n rv = 0\\n for s in sums:\\n rv += (ft.sum(bisect.bisect_right(sortedSums, s-lower)) -\\n ft.sum(bisect.bisect_left(sortedSums, s-upper)))\\n ft.increment(ranks[s])\\n return rv\",\n \"memory\": \"38371\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n pre = [0]*(len(nums)+1)\\n for i in range(1,len(nums)+1):\\n pre[i] = pre[i-1] + nums[i-1]\\n\\n for i in pre:\\n print(i,\\\" \\\",end=\\\"\\\")\\n \\n self.ans = 0\\n\\n def merge(l,mid,h):\\n\\n start,end = mid+1 , mid+1\\n\\n for i in range(l,mid+1):\\n while start <= h and pre[start] - pre[i] < lower :\\n start += 1\\n while end <= h and pre[end] - pre[i] <= upper:\\n end+=1\\n self.ans += (end-start)\\n\\n s = []\\n i,j = l,mid+1\\n while i <= mid and j <= h :\\n if pre[i] < pre[j]:\\n s.append(pre[i])\\n i += 1\\n else:\\n s.append(pre[j])\\n j+= 1\\n s += pre[i:mid+1] + pre[j:h+1]\\n for i in range(len(s)):\\n pre[i+l] = s[i]\\n \\n\\n\\n def sort(l,h):\\n if l < h :\\n mid = l + (h-l)//2 \\n sort(l,mid)\\n sort(mid+1,h)\\n merge(l,mid,h)\\n\\n \\n sort(0,len(nums))\\n\\n print()\\n for i in pre:\\n print( i , \\\" \\\",end =\\\"\\\" )\\n\\n return self.ans\\n\\n \\n \",\n \"memory\": \"40038\"\n },\n {\n \"code\": \"class TreeNode:\\n def __init__(self, val, left = None, right = None):\\n self.val = val\\n self.count = 1\\n self.left = left\\n self.right = right\\n self.height = 1\\n\\nclass AVLTree:\\n def __init__(self):\\n self.root = None\\n \\n def add_value(self, value):\\n self.root = self.add(self.root, value)\\n\\n def add(self, root, value):\\n if not root:\\n return TreeNode(value)\\n\\n if value == root.val:\\n root.count += 1\\n elif value < root.val:\\n root.left = self.add(root.left, value)\\n root.count += 1\\n elif value > root.val:\\n root.right = self.add(root.right, value)\\n root.height = 1 + max(self.height(root.left), self.height(root.right))\\n\\n bal = self.balance(root)\\n if bal > 1:\\n if value > root.left.val:\\n root.left = self.left_rotate(root.left)\\n root = self.right_rotate(root)\\n elif bal < -1:\\n if value < root.right.val:\\n root.right = self.right_rotate(root.right)\\n root = self.left_rotate(root)\\n\\n return root\\n\\n def height(self, root):\\n return root.height if root else 0\\n \\n def adjust_height(self, root):\\n\\t\\t root.height = 1 + max(self.height(root.left), self.height(root.right))\\n\\n def balance(self, root):\\n return self.height(root.left) - self.height(root.right) if root else 0\\n\\n def left_rotate(self, pivot):\\n pivot_next = pivot.right\\n pivot_next.left, pivot.right = pivot, pivot_next.left\\n pivot_next.count += pivot.count\\n self.adjust_height(pivot)\\n self.adjust_height(pivot_next)\\n return pivot_next\\n\\n def right_rotate(self, pivot):\\n pivot_next = pivot.left\\n pivot_next.right, pivot.left = pivot, pivot_next.right\\n pivot.count -= pivot_next.count\\n self.adjust_height(pivot)\\n self.adjust_height(pivot_next)\\n return pivot_next\\n \\n def find_value(self, val):\\n return self.find(self.root, val)\\n \\n def find(self, root, val):\\n if not root:\\n return 0\\n \\n if root.val == val:\\n return root.count\\n elif root.val <= val:\\n return root.count + self.find(root.right, val)\\n else:\\n return self.find(root.left, val)\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n res = 0\\n tree = AVLTree()\\n tree.add_value(0)\\n total = 0\\n for i in range(len(nums)):\\n total += nums[i]\\n res += tree.find_value(total - lower) - tree.find_value(total - upper - 1)\\n tree.add_value(total)\\n return res\\n\",\n \"memory\": \"40038\"\n },\n {\n \"code\": \"class Solution:\\n bit=[]\\n def getRSB(self, i):\\n return i & -i\\n def getSum(self, i):\\n s = 0\\n while i > 0:\\n s += self.bit[i]\\n i -= self.getRSB(i)\\n return s\\n \\n def update(self, i):\\n while i < len(self.bit):\\n self.bit[i] += 1\\n i += self.getRSB(i)\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n psum = [0 for i in range(n+1)]\\n for i in range(n):\\n psum[i+1] = psum[i] + nums[i]\\n \\n sorted_psum = sorted(psum)\\n sorted_psum_map = {val: idx for idx, val in enumerate(sorted_psum)}\\n\\n res = 0\\n self.bit = [0 for i in range(n+2)]\\n\\n print(sorted_psum)\\n\\n for i in range(n+1):\\n pleft = psum[i] - upper\\n pright = psum[i] - lower\\n x = bisect.bisect_left(sorted_psum, pleft)\\n y = bisect.bisect_right(sorted_psum, pright)\\n\\n lsum = self.getSum(x)\\n rsum = self.getSum(y)\\n\\n res += rsum - lsum\\n\\n index = sorted_psum_map[psum[i]]\\n self.update(index+1)\\n\\n return res\\n\\n\\n \\n \",\n \"memory\": \"41706\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n def countRangeSum(l, r):\\n if l == r:\\n return int(nums[l] >= lower and nums[r] <= upper)\\n\\n mid = l + (r - l) // 2\\n prefix = [0] * (r - mid)\\n currSum = 0\\n for i in range(mid + 1, r + 1):\\n currSum += nums[i]\\n prefix[i - (mid + 1)] += currSum\\n\\n prefix.sort()\\n\\n count = 0\\n currSum = 0\\n for i in range(mid, l - 1, -1):\\n currSum += nums[i]\\n count += bisect.bisect_right(prefix, upper - currSum) - bisect.bisect_left(prefix, lower - currSum)\\n\\n return countRangeSum(l, mid) + countRangeSum(mid + 1, r) + count\\n\\n return countRangeSum(0, len(nums) - 1)\\n \",\n \"memory\": \"41706\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n prefixes = [0]\\n for num in nums:\\n prefixes.append(prefixes[-1] + num)\\n \\n def get_less(bound, strict):\\n ss = SortedSet()\\n ss.add((0, 0))\\n ans = 0\\n for i in range(1, n+1):\\n cur_prefix = prefixes[i]\\n val_to_check = cur_prefix - bound\\n delimiter = float('inf') if strict else -1\\n idx = ss.bisect_left((val_to_check, delimiter))\\n ans += i - idx\\n ss.add((cur_prefix, i))\\n return ans\\n\\n return get_less(upper, False) - get_less(lower, True)\",\n \"memory\": \"43373\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n from sortedcontainers import SortedSet\\n\\n s = SortedSet()\\n\\n pre = []\\n pre2 = []\\n tot = 0\\n\\n for i, num in enumerate(nums):\\n pre.append((i, tot))\\n tot += num\\n pre2.append((i, tot))\\n \\n pre.sort(key = lambda x: x[1])\\n pre2.sort(key = lambda x: x[1])\\n\\n n = len(pre)\\n\\n l = r = 0\\n ans = 0\\n for i in range(n):\\n while r < n and pre[r][1] <= pre2[i][1] - lower:\\n s.add(pre[r][0])\\n r += 1\\n while l < r and pre[l][1] < pre2[i][1] - upper:\\n s.discard(pre[l][0])\\n l += 1\\n ans += s.bisect_right(pre2[i][0])\\n\\n return ans\",\n \"memory\": \"45041\"\n },\n {\n \"code\": \"from itertools import accumulate\\nfrom bisect import bisect_left\\n\\n# Define a class for Binary Indexed Tree (Fenwick Tree) data structure.\\nclass BinaryIndexedTree:\\n # Initialize the Binary Indexed Tree with `size` elements.\\n def __init__(self, size):\\n self.size = size\\n self.tree = [0] * (size + 1)\\n\\n # Update the tree by adding a value `val` to the element at index `index`.\\n def update(self, index, val):\\n # Propagate the update up the tree.\\n while index <= self.size:\\n self.tree[index] += val\\n index += index & -index\\n\\n # Query the cumulative sum from index 1 to `index`.\\n def query(self, index):\\n sum_ = 0\\n # Aggregate the sums.\\n while index > 0:\\n sum_ += self.tree[index]\\n index -= index & -index\\n return sum_\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # ans = 0\\n # for i in range(len(nums)):\\n # for j in range(i , len(nums)+1):\\n # a = sum(nums[i:j])\\n # if i < j and a >= lower and a <= upper:\\n # ans+= 1\\n # return ans\\n # Compute the prefix sums of the input array `nums`.\\n prefix_sums = list(accumulate(nums, initial=0))\\n # Flatten and sort the unique sums for tree construction.\\n sorted_arr = sorted(set(x for sum_ in prefix_sums for x in (sum_, sum_ - lower, sum_ - upper)))\\n # Initialize the Binary Indexed Tree with the length of the sorted unique sums.\\n tree = BinaryIndexedTree(len(sorted_arr))\\n count = 0 # Initialize the count of ranges.\\n \\n # Iterate over the prefix sums.\\n for sum_ in prefix_sums:\\n # Find the indices for the current sum minus the upper and lower bounds.\\n # +1 because our BIT is 1-indexed.\\n left = bisect_left(sorted_arr, sum_ - upper) + 1\\n right = bisect_left(sorted_arr, sum_ - lower) + 1\\n # Calculate the number of sums in the range [lower, upper].\\n count += tree.query(right) - tree.query(left - 1)\\n # Update the BIT for the current prefix sum.\\n tree.update(bisect_left(sorted_arr, sum_) + 1, 1)\\n \\n # Return the total count of sums in the range.\\n return count\",\n \"memory\": \"45041\"\n },\n {\n \"code\": \"from itertools import accumulate\\nfrom bisect import bisect_left\\n\\n# Define a class for Binary Indexed Tree (Fenwick Tree) data structure.\\nclass BinaryIndexedTree:\\n # Initialize the Binary Indexed Tree with `size` elements.\\n def __init__(self, size):\\n self.size = size\\n self.tree = [0] * (size + 1)\\n\\n # Update the tree by adding a value `val` to the element at index `index`.\\n def update(self, index, val):\\n # Propagate the update up the tree.\\n while index <= self.size:\\n self.tree[index] += val\\n index += index & -index\\n\\n # Query the cumulative sum from index 1 to `index`.\\n def query(self, index):\\n sum_ = 0\\n # Aggregate the sums.\\n while index > 0:\\n sum_ += self.tree[index]\\n index -= index & -index\\n return sum_\\n\\n\\n# Solution class to solve the problem.\\nclass Solution:\\n def countRangeSum(self, nums, lower, upper):\\n # Compute the prefix sums of the input array `nums`.\\n prefix_sums = list(accumulate(nums, initial=0))\\n # Flatten and sort the unique sums for tree construction.\\n sorted_arr = sorted(set(x for sum_ in prefix_sums for x in (sum_, sum_ - lower, sum_ - upper)))\\n # Initialize the Binary Indexed Tree with the length of the sorted unique sums.\\n tree = BinaryIndexedTree(len(sorted_arr))\\n count = 0 # Initialize the count of ranges.\\n \\n # Iterate over the prefix sums.\\n for sum_ in prefix_sums:\\n # Find the indices for the current sum minus the upper and lower bounds.\\n # +1 because our BIT is 1-indexed.\\n left = bisect_left(sorted_arr, sum_ - upper) + 1\\n right = bisect_left(sorted_arr, sum_ - lower) + 1\\n # Calculate the number of sums in the range [lower, upper].\\n count += tree.query(right) - tree.query(left - 1)\\n # Update the BIT for the current prefix sum.\\n tree.update(bisect_left(sorted_arr, sum_) + 1, 1)\\n \\n # Return the total count of sums in the range.\\n return count \",\n \"memory\": \"46708\"\n },\n {\n \"code\": \"class BinaryIndexedTree:\\n def __init__(self, n):\\n self.n = n\\n self.c = [0] * (n + 1)\\n\\n def update(self, x, v):\\n while x <= self.n:\\n self.c[x] += v\\n x += x & -x\\n\\n def query(self, x):\\n s = 0\\n while x > 0:\\n s += self.c[x]\\n x -= x & -x\\n return s\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n s = list(accumulate(nums, initial=0))\\n arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))\\n tree = BinaryIndexedTree(len(arr))\\n ans = 0\\n for x in s:\\n l = bisect_left(arr, x - upper) + 1\\n r = bisect_left(arr, x - lower) + 1\\n ans += tree.query(r) - tree.query(l - 1)\\n tree.update(bisect_left(arr, x) + 1, 1)\\n return ans\\n \",\n \"memory\": \"48376\"\n },\n {\n \"code\": \"class BinaryIndexedTree:\\n def __init__(self, n):\\n self.n = n\\n self.c = [0] * (n + 1)\\n\\n def update(self, x, v):\\n while x <= self.n:\\n self.c[x] += v\\n x += x & -x\\n\\n def query(self, x):\\n s = 0\\n while x > 0:\\n s += self.c[x]\\n x -= x & -x\\n return s\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int: \\n s = list(accumulate(nums, initial=0))\\n arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))\\n tree = BinaryIndexedTree(len(arr))\\n ans = 0\\n for x in s:\\n l = bisect_left(arr, x - upper) + 1\\n r = bisect_left(arr, x - lower) + 1\\n ans += tree.query(r) - tree.query(l - 1)\\n tree.update(bisect_left(arr, x) + 1, 1)\\n return ans \",\n \"memory\": \"50043\"\n },\n {\n \"code\": \"class BinaryIndexedTree:\\n def __init__(self, n):\\n self.n = n\\n self.c = [0] * (n + 1)\\n\\n def update(self, x, v):\\n while x <= self.n:\\n self.c[x] += v\\n x += x & -x\\n\\n def query(self, x):\\n s = 0\\n while x > 0:\\n s += self.c[x]\\n x -= x & -x\\n return s\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n s = list(accumulate(nums, initial=0))\\n arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))\\n tree = BinaryIndexedTree(len(arr))\\n ans = 0\\n for x in s:\\n l = bisect_left(arr, x - upper) + 1\\n r = bisect_left(arr, x - lower) + 1\\n ans += tree.query(r) - tree.query(l - 1)\\n tree.update(bisect_left(arr, x) + 1, 1)\\n return ans\",\n \"memory\": \"50043\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n cumsums = [0]\\n for n in nums:\\n cumsums.append(cumsums[-1] + n)\\n\\n def mergesort(l,r):\\n if l == r:\\n return 0\\n mid = (l+r)//2\\n cnt = mergesort(l,mid) + mergesort(mid+1,r)\\n\\t\\t\\t\\n i = j = mid+1\\n # O(n)\\n for left in cumsums[l:mid+1]:\\n while i <= r and cumsums[i] - left < lower:\\n i+=1\\n while j <= r and cumsums[j] - left <= upper:\\n j+=1\\n cnt += j-i\\n \\n cumsums[l:r+1] = sorted(cumsums[l:r+1])\\n return cnt\\n\\t\\t\\t\\n return mergesort(0,len(cumsums)-1)\",\n \"memory\": \"51711\"\n },\n {\n \"code\": \"class Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n pref=[0]\\n for x in nums:\\n pref.append(pref[-1]+x)\\n print(pref)\\n def mergesort(l,r):\\n if l==r:\\n return 0\\n mid = (l+r)//2\\n cnt = mergesort(l,mid)+mergesort(mid+1,r)\\n\\n i=j=mid+1\\n\\n for left in pref[l:mid+1]:\\n while i<=r and pref[i] - left < lower:\\n i+=1\\n while j<=r and pref[j] - left <= upper:\\n j+=1\\n cnt+=j-i\\n pref[l:r+1] = sorted(pref[l:r+1])\\n return cnt\\n return mergesort(0,len(pref)-1)\\n\\n\\n\\n\\n\\n\\n \",\n \"memory\": \"51711\"\n },\n {\n \"code\": \"class Solution:\\n # prefix-sum + hashmap | time complexity: O(n+(upper-lower+1)*n)\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n cumsum = [0]\\n for n in nums:\\n cumsum.append(cumsum[-1]+n)\\n \\n import collections\\n record = collections.defaultdict(int)\\n \\n res = 0\\n for csum in cumsum:\\n for target in range(lower,upper+1):\\n if csum - target in record:\\n res += record[csum - target]\\n record[csum] +=1\\n return res\\n\\n\\nclass SegmentTreeNode:\\n\\tdef __init__(self,low,high):\\n\\t\\tself.low = low\\n\\t\\tself.high = high\\n\\t\\tself.left = None\\n\\t\\tself.right = None\\n\\t\\tself.cnt = 0 \\n \\nclass Solution: \\n def _bulid(self, left, right): \\n root = SegmentTreeNode(self.cumsum[left],self.cumsum[right])\\n if left == right:\\n return root\\n \\n mid = (left+right)//2\\n root.left = self._bulid(left, mid)\\n root.right = self._bulid(mid+1, right)\\n return root\\n \\n def _update(self, root, val):\\n if not root:\\n return \\n if root.low<=val<=root.high:\\n root.cnt += 1\\n self._update(root.left, val)\\n self._update(root.right, val)\\n \\n def _query(self, root, lower, upper):\\n if lower <= root.low and root.high <= upper:\\n return root.cnt\\n if upper < root.low or root.high < lower:\\n return 0\\n return self._query(root.left, lower, upper) + self._query(root.right, lower, upper)\\n \\n # prefix-sum + SegmentTree | O(nlogn) \\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n cumsum = [0]\\n for n in nums:\\n cumsum.append(cumsum[-1]+n)\\n \\n self.cumsum = sorted(list(set(cumsum))) # need sorted\\n root = self._bulid(0,len(self.cumsum)-1)\\n \\n res = 0\\n for csum in cumsum:\\n res += self._query(root, csum-upper, csum-lower)\\n self._update(root, csum) \\n return res\",\n \"memory\": \"53378\"\n },\n {\n \"code\": \"class segTree:\\n def __init__(self, low, high):\\n self.low = low\\n self.high = high\\n self.left = None\\n self.right = None\\n self.cnt = 0\\n\\nclass Solution:\\n def build(self, l, r):\\n root = segTree(self.prefix[l], self.prefix[r])\\n if l == r:\\n return root\\n\\n mid = (l + r) // 2\\n root.left = self.build(l, mid)\\n root.right = self.build(mid + 1, r)\\n return root\\n\\n def update(self, root, val):\\n if not root:\\n return\\n\\n if root.low <= val <= root.high:\\n root.cnt += 1\\n self.update(root.left, val)\\n self.update(root.right, val)\\n return\\n \\n def query(self, root, lower, upper):\\n if lower <= root.low and root.high <= upper:\\n return root.cnt\\n \\n if root.high < lower or upper < root.low:\\n return 0\\n\\n return self.query(root.left, lower, upper) + self.query(root.right, lower, upper)\\n\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = [0]\\n for num in nums:\\n prefix.append(prefix[-1] + num)\\n \\n self.prefix = sorted(list(set(prefix)))\\n root = self.build(0, len(self.prefix) - 1)\\n\\n ans = 0\\n for pre in prefix:\\n ans += self.query(root, pre - upper, pre - lower)\\n self.update(root, pre)\\n \\n return ans\\n\\n\\n \",\n \"memory\": \"55046\"\n },\n {\n \"code\": \"class SegmentTreeNode:\\n\\tdef __init__(self,low,high):\\n\\t\\tself.low = low\\n\\t\\tself.high = high\\n\\t\\tself.left = None\\n\\t\\tself.right = None\\n\\t\\tself.cnt = 0 \\n \\nclass Solution: \\n def _bulid(self, left, right): \\n root = SegmentTreeNode(self.cumsum[left],self.cumsum[right])\\n if left == right:\\n return root\\n \\n mid = (left+right)//2\\n root.left = self._bulid(left, mid)\\n root.right = self._bulid(mid+1, right)\\n return root\\n \\n def _update(self, root, val):\\n if not root:\\n return \\n if root.low<=val<=root.high:\\n root.cnt += 1\\n self._update(root.left, val)\\n self._update(root.right, val)\\n \\n def _query(self, root, lower, upper):\\n if lower <= root.low and root.high <= upper:\\n return root.cnt\\n if upper < root.low or root.high < lower:\\n return 0\\n return self._query(root.left, lower, upper) + self._query(root.right, lower, upper)\\n \\n # prefix-sum + SegmentTree | O(nlogn) \\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n cumsum = [0]\\n for n in nums:\\n cumsum.append(cumsum[-1]+n)\\n \\n self.cumsum = sorted(list(set(cumsum))) # need sorted\\n root = self._bulid(0,len(self.cumsum)-1)\\n \\n res = 0\\n for csum in cumsum:\\n res += self._query(root, csum-upper, csum-lower)\\n self._update(root, csum) \\n return res\",\n \"memory\": \"56713\"\n },\n {\n \"code\": \"# lower <= presum[j]-presum[i-1] <= upper\\n# lower + presum[i-1] <= presum[j] <= upper + presum[i-1]\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n n = len(nums)\\n track = set()\\n presum = nums.copy()\\n for i in range(1, n):\\n presum[i] += presum[i-1]\\n\\n for ele in nums:\\n track.add(ele)\\n\\n track.add(lower)\\n track.add(upper)\\n for ele in presum:\\n track.add(ele)\\n track.add(ele+lower)\\n track.add(ele+upper)\\n \\n track = list(track)\\n track.sort()\\n m = {}\\n for i, num in enumerate(track):\\n m[num] = i+1\\n\\n N = len(track)\\n bit = [0]*(N+1)\\n\\n def update(x, val):\\n while x <= N:\\n bit[x] += val\\n x += (x&-x)\\n \\n def query(x):\\n res = 0\\n while x > 0:\\n res += bit[x]\\n x -= (x&-x)\\n return res\\n\\n # print(m)\\n ans = 0\\n for i in range(n-1, -1, -1):\\n update(m[presum[i]], 1)\\n prev = 0\\n if i > 0:\\n prev = presum[i-1]\\n # print(i, bit, m[prev+upper], m[prev+lower]-1)\\n r = query(m[prev+upper])\\n l = query(m[prev+lower]-1)\\n if r > 0:\\n ans += (r-l)\\n return ans\",\n \"memory\": \"58381\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, data):\\n self.n = len(data)\\n self.tree = [0] * (2 * self.n)\\n \\n def update(self, index, value):\\n index += self.n\\n self.tree[index] += value\\n while index > 1:\\n index //= 2\\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\\n \\n def query(self, left, right):\\n result = 0\\n left += self.n\\n right += self.n\\n while left < right:\\n if left % 2:\\n result += self.tree[left]\\n left += 1\\n if right % 2:\\n right -= 1\\n result += self.tree[right]\\n left //= 2\\n right //= 2\\n return result\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n \\n all_sums = sorted(set(prefix_sums + [x - lower for x in prefix_sums] + [x - upper for x in prefix_sums]))\\n sum_index = {v: i for i, v in enumerate(all_sums)}\\n \\n seg_tree = SegmentTree([0] * len(all_sums))\\n count = 0\\n \\n for sum_val in prefix_sums:\\n left_index = sum_index[sum_val - upper]\\n right_index = sum_index[sum_val - lower]\\n count += seg_tree.query(left_index, right_index + 1)\\n seg_tree.update(sum_index[sum_val], 1)\\n \\n return count\\n\",\n \"memory\": \"60048\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, n):\\n self.n = n\\n self.tree = [0] * (2 * n)\\n \\n def update(self, index, value):\\n index += self.n\\n self.tree[index] += value\\n while index > 1:\\n index //= 2\\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\\n \\n def query(self, left, right):\\n left += self.n\\n right += self.n + 1\\n sum_ = 0\\n while left < right:\\n if left % 2 == 1:\\n sum_ += self.tree[left]\\n left += 1\\n if right % 2 == 1:\\n right -= 1\\n sum_ += self.tree[right]\\n left //= 2\\n right //= 2\\n return sum_\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n # Step 1: Calculate prefix sums\\n prefix_sum = [0]\\n for num in nums:\\n prefix_sum.append(prefix_sum[-1] + num)\\n \\n # Step 2: Coordinate compression\\n all_values = sorted(set(prefix_sum + [ps - lower for ps in prefix_sum] + [ps - upper for ps in prefix_sum]))\\n value_to_index = {value: index for index, value in enumerate(all_values)}\\n \\n # Step 3: Initialize Segment Tree\\n seg_tree = SegmentTree(len(all_values))\\n result = 0\\n \\n # Step 4: Process each prefix sum\\n for ps in prefix_sum:\\n left_bound = value_to_index[ps - upper]\\n right_bound = value_to_index[ps - lower]\\n result += seg_tree.query(left_bound, right_bound)\\n seg_tree.update(value_to_index[ps], 1)\\n \\n return result\",\n \"memory\": \"61716\"\n },\n {\n \"code\": \"class Solution:\\n SEG = []\\n N = 0\\n def add_point(self, ind: int, l: int, r: int, pos: int):\\n if not r - l == 1:\\n if pos < (r + l) // 2:\\n self.add_point(2 * ind, l, (r + l) // 2, pos)\\n else:\\n self.add_point(2 * ind + 1, (r + l) // 2, r, pos)\\n self.SEG[ind] += 1\\n \\n def range_sum(self, ind: int, l: int, r: int, b: int, e: int):\\n if l >= b and r <= e:\\n return self.SEG[ind]\\n if l >= e or r <= b:\\n return 0\\n return self.range_sum(2 * ind, l, (r + l) // 2, b, e) + self.range_sum(2 * ind + 1, (r + l) // 2, r, b, e)\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n all_point = set([0])\\n sm = 0\\n for num in nums:\\n sm += num\\n all_point.add(sm)\\n all_point.add(sm - lower)\\n all_point.add(sm - upper)\\n all_point = list(all_point)\\n all_point = sorted(all_point)\\n mp = {}\\n sm = 0\\n for pt in all_point:\\n mp[pt] = sm\\n sm += 1\\n self.N = len(all_point)\\n self.SEG = [0] * (4 * (self.N + 1))\\n self.add_point(1, 0, self.N, mp[0])\\n res = 0\\n sm = 0\\n for num in nums:\\n sm += num\\n res += self.range_sum(1, 0, self.N, mp[sm - upper], mp[sm - lower] + 1)\\n self.add_point(1, 0, self.N, mp[sm])\\n return res\",\n \"memory\": \"63383\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, n):\\n self.n = n\\n self.tree = [0] * (2 * n)\\n\\n def update(self, index, value):\\n index += self.n\\n self.tree[index] += value\\n while index > 1:\\n index //= 2\\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\\n\\n def query(self, left, right):\\n left += self.n\\n right += self.n\\n s = 0\\n while left < right:\\n if left % 2 == 1:\\n s += self.tree[left]\\n left += 1\\n if right % 2 == 1:\\n right -= 1\\n s += self.tree[right]\\n left //= 2\\n right //= 2\\n return s\\n\\nclass Solution:\\n def countRangeSum(self, nums, lower, upper):\\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n\\n all_sums = set(prefix_sums)\\n for s in prefix_sums:\\n all_sums.add(s - lower)\\n all_sums.add(s - upper)\\n\\n sorted_sums = sorted(all_sums)\\n rank = {v: i for i, v in enumerate(sorted_sums)}\\n\\n\\n tree = SegmentTree(len(sorted_sums))\\n count = 0\\n\\n for s in prefix_sums:\\n left = rank[s - upper]\\n right = rank[s - lower] + 1\\n count += tree.query(left, right)\\n tree.update(rank[s], 1)\\n\\n return count\",\n \"memory\": \"65051\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, n):\\n self.n = n\\n self.tree = [0] * (2 * n)\\n\\n def update(self, index, value):\\n index += self.n\\n self.tree[index] += value\\n while index > 1:\\n index //= 2\\n self.tree[index] = self.tree[2 * index] + self.tree[2 * index + 1]\\n\\n def query(self, left, right):\\n left += self.n\\n right += self.n\\n s = 0\\n while left < right:\\n if left % 2 == 1:\\n s += self.tree[left]\\n left += 1\\n if right % 2 == 1:\\n right -= 1\\n s += self.tree[right]\\n left //= 2\\n right //= 2\\n return s\\n\\nclass Solution:\\n def countRangeSum(self, nums, lower, upper):\\n prefix_sums = [0]\\n for num in nums:\\n prefix_sums.append(prefix_sums[-1] + num)\\n\\n all_sums = set(prefix_sums)\\n for s in prefix_sums:\\n all_sums.add(s - lower)\\n all_sums.add(s - upper)\\n\\n sorted_sums = sorted(all_sums)\\n rank = {v: i for i, v in enumerate(sorted_sums)}\\n\\n\\n tree = SegmentTree(len(sorted_sums))\\n count = 0\\n\\n for sum_ in prefix_sums:\\n left = rank[sum_ - upper]\\n right = rank[sum_ - lower] + 1\\n count += tree.query(left, right)\\n tree.update(rank[sum_], 1)\\n\\n return count\",\n \"memory\": \"66718\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, size: int):\\n self.size = size\\n self.tree = [0] * 2 * self.size\\n\\n def update(self, idx: int):\\n idx += self.size\\n while idx > 0:\\n self.tree[idx] += 1\\n idx //= 2\\n\\n def query(self, left: int, right: int) -> int:\\n if left == 0 and right == 2:\\n print(left + self.size, right + self.size + 1)\\n left += self.size\\n right += self.size + 1\\n count = 0\\n\\n while left < right:\\n if left % 2 == 1:\\n count += self.tree[left]\\n left += 1\\n\\n if right % 2 == 1:\\n right -= 1\\n count += self.tree[right]\\n\\n left //= 2\\n right //= 2\\n\\n return count\\n\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix_sums = {0, -lower, -upper}\\n curr_ps = 0\\n for num in nums:\\n curr_ps += num\\n prefix_sums.add(curr_ps)\\n prefix_sums.add(curr_ps - lower)\\n prefix_sums.add(curr_ps - upper)\\n\\n sorted_ps = sorted(list(prefix_sums))\\n\\n sgmnt_tree = SegmentTree(size=len(sorted_ps) + 1)\\n\\n ps_idx_map = {v: i for i, v in enumerate(sorted_ps)}\\n\\n ans = 0\\n curr_ps = 0\\n sgmnt_tree.update(ps_idx_map[curr_ps])\\n\\n for num in nums:\\n curr_ps += num\\n left = ps_idx_map[curr_ps - upper]\\n right = ps_idx_map[curr_ps - lower]\\n ans += sgmnt_tree.query(left, right)\\n\\n sgmnt_tree.update(ps_idx_map[curr_ps])\\n\\n return ans\\n\",\n \"memory\": \"68386\"\n },\n {\n \"code\": \"class SegmentTree:\\n def __init__(self, n: int) -> None:\\n self.n = n\\n self.tree = [0]*(4*n)\\n self.tags = [0]*(4*n)\\n \\n def _pushdown(self, idx: int, s: int, mid: int, e: int) -> None:\\n if self.tags[idx] != 0:\\n self.tags[idx*2] += self.tags[idx]\\n self.tags[idx*2+1] += self.tags[idx]\\n self.tree[idx*2] += (mid-s+1)*self.tags[idx]\\n self.tree[idx*2+1] += (e-mid)*self.tags[idx]\\n self.tags[idx] = 0\\n \\n def update(self, t_s: int, t_e: int, s: int, e: int, idx: int, val: int) -> None:\\n if t_s <= s and t_e >= e:\\n self.tree[idx] += val*(e-s+1)\\n self.tags[idx] += val\\n elif t_e < s or t_s > e:\\n return\\n else:\\n mid = (s+e)//2\\n self._pushdown(idx, s, mid, e)\\n self.update(t_s, t_e, s, mid, 2*idx, val)\\n self.update(t_s, t_e, mid+1, e, 2*idx+1, val)\\n self.tree[idx] = self.tree[2*idx] + self.tree[2*idx+1]\\n \\n def query(self, t_s: int, t_e: int, s: int, e: int, idx: int) -> int:\\n if t_s <= s and t_e >= e:\\n return self.tree[idx]\\n elif t_e < s or t_s > e:\\n return 0\\n else:\\n mid = (s+e)//2\\n self._pushdown(idx, s, mid, e)\\n left = self.query(t_s, t_e, s, mid, 2*idx)\\n right = self.query(t_s, t_e, mid+1, e, 2*idx+1)\\n return left+right\\n\\nclass Solution:\\n def preprocess(self, prefix: List[int], lower: int, upper: int) -> Dict[int, int]:\\n points = set()\\n for p in prefix:\\n points.add(p)\\n points.add(p-lower)\\n points.add(p-upper)\\n points = sorted(list(points))\\n map_prefix = {}\\n for idx, p in enumerate(points):\\n map_prefix[p] = idx\\n return map_prefix\\n \\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n prefix = [0]*len(nums)\\n n = len(nums)*3+3\\n sg_tree = SegmentTree(n)\\n for i in range(len(nums)):\\n if i==0:\\n prefix[i] = nums[i]\\n else:\\n prefix[i] = nums[i]+prefix[i-1]\\n map_prefix = self.preprocess(prefix, lower, upper)\\n ans = 0\\n for i in range(len(nums)):\\n p = prefix[i]\\n if lower <= p <= upper:\\n ans += 1\\n p_idx = map_prefix[p]\\n lo, hi = map_prefix[p-upper], map_prefix[p-lower]\\n res = sg_tree.query(lo, hi, 0, n-1, 1)\\n ans += res\\n sg_tree.update(p_idx, p_idx, 0, n-1, 1, 1)\\n \\n return ans\\n \\n \",\n \"memory\": \"70053\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"memory\": \"71721\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"memory\": \"73388\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n\\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n\\n mid = (start + end) //2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n\\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n\\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n\\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n\\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n\\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sum_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sum_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sum_to_ind[presum - upper]\\n high = sum_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sum_to_ind[presum])\\n return result\",\n \"memory\": \"75056\"\n },\n {\n \"code\": \"class SegmentTree:\\n class Node:\\n def __init__(self, start, end):\\n self.start = start\\n self.end = end\\n self.left = None\\n self.right = None\\n self.count = 0\\n \\n def __init__(self, start, end):\\n def _build(start, end):\\n if start > end:\\n return None\\n if start == end:\\n return SegmentTree.Node(start, end)\\n \\n mid = (start + end) // 2\\n node = SegmentTree.Node(start, end)\\n node.left = _build(start, mid)\\n node.right = _build(mid + 1, end)\\n return node\\n self.root = _build(start, end)\\n \\n def update(self, ind):\\n def _update(node):\\n if not node or node.start > ind or node.end < ind:\\n return\\n if node.start == node.end == ind:\\n node.count += 1\\n return\\n \\n _update(node.left)\\n _update(node.right)\\n node.count = node.left.count + node.right.count\\n\\n _update(self.root)\\n \\n def query(self, query_start, query_end):\\n def _query(node):\\n if not node or node.start > query_end or node.end < query_start:\\n return 0\\n if node.start >= query_start and node.end <= query_end:\\n return node.count\\n \\n return _query(node.left) + _query(node.right)\\n return _query(self.root)\\n \\nclass Solution:\\n def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int:\\n presums = [0]\\n for num in nums:\\n presums.append(presums[-1] + num)\\n \\n # compress all possible presums, and potential query bounds to index\\n possible_all_sums = []\\n for presum in presums:\\n possible_all_sums.append(presum)\\n possible_all_sums.append(presum - upper)\\n possible_all_sums.append(presum - lower)\\n sums_to_ind = {s:ind for ind, s in enumerate(sorted(set(possible_all_sums)))}\\n\\n segmentTree = SegmentTree(0, len(sums_to_ind) - 1)\\n\\n result = 0\\n for presum in presums:\\n low = sums_to_ind[presum - upper]\\n high = sums_to_ind[presum - lower]\\n result += segmentTree.query(low, high)\\n segmentTree.update(sums_to_ind[presum])\\n return result\",\n \"memory\": \"76723\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":37,"string":"37"}}},{"rowIdx":256,"cells":{"question_id":{"kind":"number","value":313,"string":"313"},"name":{"kind":"string","value":"super-ugly-number"},"content":{"kind":"string","value":"<p>A <strong>super ugly number</strong> is a positive integer whose prime factors are in the array <code>primes</code>.</p>\n\n<p>Given an integer <code>n</code> and an array of integers <code>primes</code>, return <em>the</em> <code>n<sup>th</sup></code> <em><strong>super ugly number</strong></em>.</p>\n\n<p>The <code>n<sup>th</sup></code> <strong>super ugly number</strong> is <strong>guaranteed</strong> to fit in a <strong>32-bit</strong> signed integer.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 12, primes = [2,7,13,19]\n<strong>Output:</strong> 32\n<strong>Explanation:</strong> [1,2,4,7,8,13,14,16,19,26,28,32] is the sequence of the first 12 super ugly numbers given primes = [2,7,13,19].\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 1, primes = [2,3,5]\n<strong>Output:</strong> 1\n<strong>Explanation:</strong> 1 has no prime factors, therefore all of its prime factors are in the array primes = [2,3,5].\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 10<sup>5</sup></code></li>\n\t<li><code>1 <= primes.length <= 100</code></li>\n\t<li><code>2 <= primes[i] <= 1000</code></li>\n\t<li><code>primes[i]</code> is <strong>guaranteed</strong> to be a prime number.</li>\n\t<li>All the values of <code>primes</code> are <strong>unique</strong> and sorted in <strong>ascending order</strong>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":45.35598623192092,"string":"45.355986"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","math","dynamic-programming"],"string":"[\n \"array\",\n \"math\",\n \"dynamic-programming\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"152\", 2.4191], [\"197\", 7.3616], [\"242\", 0.7363999999999999], [\"287\", 6.940600000000002], [\"333\", 5.889200000000001], [\"378\", 0.3155], [\"423\", 0.2103], [\"468\", 8.728300000000003], [\"513\", 2.1034999999999995], [\"558\", 1.1569999999999998], [\"603\", 0.8415999999999999], [\"648\", 0.3156], [\"694\", 0.2103], [\"739\", 0.1052], [\"784\", 0.1052], [\"829\", 0.1052], [\"874\", 0.1052], [\"919\", 0.2104], [\"964\", 0.1052], [\"1009\", 2.6294999999999997], [\"1055\", 1.2621999999999998], [\"1100\", 1.3674999999999997], [\"1145\", 0.526], [\"1190\", 0.4208], [\"1235\", 0.526], [\"1280\", 0.526], [\"1325\", 0.2104], [\"1370\", 0.8415999999999999], [\"1416\", 1.8933999999999995], [\"1461\", 2.8398999999999996], [\"1506\", 0.9466999999999999], [\"1551\", 1.6828999999999996], [\"1596\", 1.0518999999999998], [\"1641\", 0.526], [\"1686\", 0.8415999999999999], [\"1731\", 1.1571999999999998], [\"1777\", 0.4208], [\"1822\", 0.7363999999999999], [\"1867\", 0.2104], [\"1912\", 0.2104], [\"1957\", 0.2104], [\"2002\", 1.3672999999999997], [\"2047\", 1.7882999999999996], [\"2092\", 1.2621999999999998], [\"2138\", 1.7882999999999996], [\"2183\", 0.3156], [\"2228\", 0.2103], [\"2273\", 0.2104], [\"2318\", 0.1052], [\"2363\", 0.2104], [\"2408\", 0.3156], [\"2453\", 0.2104], [\"2499\", 0.2104], [\"2544\", 0.1052], [\"2589\", 0.1052], [\"2634\", 0.1052], [\"2679\", 0.2103], [\"2724\", 0.1052], [\"2769\", 0.1052], [\"2814\", 0.1052], [\"2860\", 0.1052], [\"2905\", 0.1052], [\"2950\", 0.1052], [\"2995\", 0.6312], [\"3040\", 1.0518999999999998], [\"3085\", 1.7881999999999996], [\"3130\", 1.2621999999999998], [\"3175\", 2.2088999999999994], [\"3221\", 2.6293999999999995], [\"3266\", 2.4191999999999996], [\"3311\", 2.1035999999999997], [\"3356\", 2.5241], [\"3401\", 2.6294], [\"3446\", 1.1570999999999998], [\"3491\", 1.3674999999999997], [\"3536\", 1.0518999999999998], [\"3582\", 1.2621999999999998], [\"3627\", 1.1569999999999998], [\"3672\", 0.8415999999999999], [\"3717\", 0.7363999999999999]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"23436\", 58.88610000000001], [\"33110\", 1.5777999999999996], [\"42784\", 0.6312], [\"52458\", 0.1052], [\"62131\", 0.1052], [\"71805\", 0.1052], [\"81479\", 0.1052], [\"91153\", 0.1052], [\"100826\", 0.1052], [\"110500\", 0.1052], [\"120174\", 0.1052], [\"129848\", 0.1052], [\"139521\", 0.1052], [\"149195\", 0.1052], [\"158869\", 0.1052], [\"168543\", 0.1052], [\"178216\", 0.1052], [\"187890\", 0.1052], [\"197564\", 0.2103], [\"207238\", 0.1052], [\"216911\", 0.1052], [\"226585\", 0.5258], [\"236259\", 0.6309], [\"245933\", 0.1052], [\"255606\", 0.1052], [\"265280\", 0.1052], [\"274954\", 0.1052], [\"284628\", 0.2103], [\"294301\", 0.1052], [\"303975\", 0.1052], [\"313649\", 0.1052], [\"323323\", 0.1052], [\"332996\", 0.1052], [\"342670\", 0.1052], [\"352344\", 0.1052], [\"362018\", 0.1052], [\"371691\", 0.3155], [\"381365\", 0.6309], [\"391039\", 0.2103], [\"400713\", 0.1052], [\"410386\", 0.1052], [\"420060\", 0.2103], [\"429734\", 0.3156], [\"439408\", 0.3156], [\"449081\", 0.2103], [\"458755\", 0.1052], [\"468429\", 0.1052], [\"478103\", 0.1052], [\"487776\", 0.1052], [\"497450\", 0.1052], [\"507124\", 0.4206], [\"516798\", 0.2103], [\"526471\", 0.1052], [\"536145\", 0.1052], [\"545819\", 0.1052], [\"555493\", 0.1052], [\"565166\", 0.1052], [\"574840\", 0.1052], [\"584514\", 0.1052], [\"594188\", 0.1052], [\"603861\", 0.1052], [\"613535\", 0.2103], [\"623209\", 0.1052], [\"632883\", 20.715300000000003], [\"642556\", 0.7362], [\"652230\", 0.1052], [\"661904\", 0.2103], [\"671578\", 0.1052], [\"681251\", 0.1052], [\"690925\", 0.2103], [\"700599\", 0.1052], [\"710273\", 0.2103], [\"719946\", 0.3155], [\"729620\", 0.1052], [\"739294\", 0.1052], [\"748968\", 0.1052], [\"758641\", 0.1052], [\"768315\", 0.1052], [\"777989\", 0.3155], [\"787663\", 0.6309]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans = [1]\n ans_idx = [0]\n primes_idx = [0 for _ in range(len(primes))]\n pq = [(prime, idx) for idx, prime in enumerate(primes)]\n heapq.heapify(pq)\n for _ in range(n - 1):\n prime, idx = heapq.heappop(pq)\n ans.append(prime)\n ans_idx.append(idx)\n primes_idx[idx] += 1\n while ans_idx[primes_idx[idx]] > idx:\n primes_idx[idx] += 1\n heapq.heappush(pq, (primes[idx] * ans[primes_idx[idx]], idx))\n return ans[-1]","runtime":"152"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) :\n \n \n ans = [1]\n ans_idx = [0]\n primes_idx = [0 for _ in range(len(primes))]\n pq = [(prime, idx) for idx, prime in enumerate(primes)]\n heapq.heapify(pq)\n for _ in range(n - 1):\n prime, idx = heapq.heappop(pq)\n ans.append(prime)\n ans_idx.append(idx)\n primes_idx[idx] += 1\n while ans_idx[primes_idx[idx]] > idx:\n primes_idx[idx] += 1\n heapq.heappush(pq, (primes[idx] * ans[primes_idx[idx]], idx))\n return ans[-1]","runtime":"152"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n nums = primes.copy()\n heapq.heapify(nums)\n p = 1\n for i in range(n - 1):\n p = heapq.heappop(nums)\n for prime in primes:\n heapq.heappush(nums, p*prime)\n if p % prime == 0:\n break\n return p ","runtime":"197"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n nums = primes.copy() # do a deep copy \n heapq.heapify(nums) #create a heap\n p = 1\n for i in range(n - 1):\n p = heapq.heappop(nums) #take the smallest element\n for prime in primes:\n heapq.heappush(nums, p * prime) #add all those multiples with the smallest number\n if p % prime == 0:\n break\n return p","runtime":"197"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n primes=sorted(primes)\n hp=[1]\n ans=set()\n for _ in range(n):\n val=heapq.heappop(hp)\n for prime in primes: \n heapq.heappush(hp,val*prime)\n if val%prime==0: break\n ans.add(val)\n return sorted(list(set(ans)))[n-1]","runtime":"242"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n nums = primes.copy()\n heapq.heapify(nums)\n s=1\n for i in range(n-1):\n s = heapq.heappop(nums)\n for j in primes:\n heapq.heappush(nums,s*j)\n if s % j == 0:\n break\n print(nums)\n return s","runtime":"242"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1:return 1\n h = [(primes[0], 0)]\n l = len(primes)\n count = 1\n visited = set()\n while count < n:\n (temp, ind) = heappop(h)\n if temp in visited:continue\n visited.add(temp)\n heappush(h, (temp * primes[0], 0))\n if ind < (l - 1):\n heappush(h, ((temp // primes[ind]) * primes[ind + 1], ind + 1))\n count += 1\n return temp\n\n\n ","runtime":"287"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n res = [1]\n candidates = [(p, p, 0) for p in primes]\n heapq.heapify(candidates)\n for _ in range(n-1):\n v = candidates[0][0]\n res.append(v)\n\n # there could be duplicates in the candidates\n while candidates[0][0] == v:\n v, p, i = candidates[0]\n # move i\n i += 1\n heapq.heapreplace(candidates, (p * res[i], p, i))\n return res[-1]\n ","runtime":"287"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minPQ=[]\n for prime in primes:\n heapq.heappush(minPQ,(prime,0,prime))\n res=[1]\n while len(res)<n:\n value,index,prime=heapq.heappop(minPQ)\n if value!=res[-1]:\n res.append(value)\n heapq.heappush(minPQ,(res[index+1]*prime,index+1,prime))\n return res[-1]\n","runtime":"333"},{"code":"from typing import List\nimport heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # The initial super ugly number is 1\n ugly_numbers = [1]\n # Initialize a min-heap\n heap = []\n \n # Add the initial primes into the heap\n for prime in primes:\n heapq.heappush(heap, (prime, prime, 0)) # (next_value, prime, index_in_ugly_numbers)\n\n while len(ugly_numbers) < n:\n # Pop the smallest element from the heap\n next_ugly, prime, index = heapq.heappop(heap)\n # Only add this new number if it's different from the last added to ugly_numbers\n if next_ugly != ugly_numbers[-1]:\n ugly_numbers.append(next_ugly)\n # Push the next value derived from this prime\n heapq.heappush(heap, (prime * ugly_numbers[index + 1], prime, index + 1))\n \n return ugly_numbers[-1]","runtime":"333"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n l = [1]\n count = 1\n pcount = len(primes)\n pointers = [0] * pcount\n heap = []\n for i in range(pcount):\n heapq.heappush(heap, (primes[i], i))\n while count < n:\n minimum, i = heapq.heappop(heap)\n if minimum > l[-1]:\n l.append(minimum)\n count += 1\n if count < n:\n while l[pointers[i]] * primes[i] <= l[-1]:\n pointers[i] += 1\n heapq.heappush(heap, (l[pointers[i]] * primes[i], i))\n return l[-1]\n \n\n ","runtime":"378"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n l = [1]\n count = 1\n pcount = len(primes)\n pointers = [0] * pcount\n heap = []\n for i in range(pcount):\n heapq.heappush(heap, (primes[i], i))\n while count < n:\n minimum, i = heapq.heappop(heap)\n while l[pointers[i]] * primes[i] <= l[-1]:\n pointers[i] += 1\n heapq.heappush(heap, (l[pointers[i]] * primes[i], i))\n if minimum > l[-1]:\n l.append(minimum)\n count += 1\n return l[-1]\n \n\n ","runtime":"378"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly = [1] * n\n indices = [0] * len(primes) \n next_multiple = primes[:] \n \n for i in range(1, n):\n next_ugly = min(next_multiple)\n ugly[i] = next_ugly\n \n for j in range(len(primes)):\n if next_ugly == next_multiple[j]:\n indices[j] += 1 \n next_multiple[j] = ugly[indices[j]] * primes[j]\n \n return ugly[-1]","runtime":"423"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n k = len(primes)\n indices = [0] * k\n candidates = [primes[i] for i in range(k)]\n uglyNumbers = [0] * n\n uglyNumbers[0] = 1\n \n for i in range(1, n):\n minCandidate = min(candidates)\n uglyNumbers[i] = minCandidate\n \n for j in range(k):\n if candidates[j] == minCandidate:\n indices[j] += 1\n candidates[j] = uglyNumbers[indices[j]] * primes[j]\n \n return uglyNumbers[-1]","runtime":"468"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n\n # create a list to store the super ugly numbers, initialize with 1\n super_ugly = [1]\n # create a list to store the indices for each prime number\n idx = [0] * len(primes)\n # create a list to store the product of prime numbers with their corresponding indices\n # this will be used to find the next super ugly number\n prod = [p for p in primes]\n \n # loop until we find the nth super ugly number\n while len(super_ugly) < n:\n # find the minimum value in prod, which will be the next super ugly number\n next_ugly = min(prod)\n # append it to the list of super ugly numbers\n super_ugly.append(next_ugly)\n \n # update the index for each prime number whose product is equal to next_ugly\n for i in range(len(primes)):\n if next_ugly == prod[i]:\n idx[i] += 1\n #prod is the exact next iteration of the super ugly number that uses primes[i] in its prime factorization\n prod[i] = primes[i] * super_ugly[idx[i]]\n \n #print(prod)\n \n # return the last element in the list of super ugly numbers, which is the nth super ugly number\n return super_ugly[-1]","runtime":"468"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1] # Initialize the list with the first super ugly number\n pointers = [0] * len(primes) # Initialize pointers for each prime factor\n candidates = primes[:] # Initialize candidates with each prime factor\n\n while len(ugly_numbers) < n:\n next_ugly = min(candidates) # Find the next smallest super ugly number\n ugly_numbers.append(next_ugly) # Append the next super ugly number to the list\n\n # Update the pointers and candidates for the next iteration\n for i in range(len(candidates)):\n if candidates[i] == next_ugly:\n pointers[i] += 1\n candidates[i] = ugly_numbers[pointers[i]] * primes[i]\n\n return ugly_numbers[-1] # Return the nth super ugly number","runtime":"513"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1] * n\n m = len(primes)\n indexes = [0] * m\n uglys = primes[:]\n for i in range(1, n):\n nxt_ugly = min(uglys)\n dp[i] = nxt_ugly\n for j in range(m):\n if nxt_ugly == uglys[j]:\n indexes[j] += 1\n uglys[j] = dp[indexes[j]] * primes[j]\n return dp[n - 1]","runtime":"513"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [0] * n \n dp[0] = 1 \n index = [0] * len(primes)\n values = primes[:]\n for i in range(1,n):\n dp[i] = min(values)\n for j in range(len(primes)):\n if values[j] == dp[i]:\n index[j] += 1 \n values[j] = dp[index[j]] * primes[j]\n \n return dp[-1]","runtime":"558"},{"code":"class Solution:\n\n\tdef _Hamming(self, size: int, primes: list[int]) -> list[int]:\n\t\tres = [0]*size\n\t\tres[0] = 1\n\n\t\tnext = primes[:]\n\t\tindicies = [0]*len(primes)\n\t\tfor m in range(1, size):\n\t\t\tres[m] = min(next)\n\t\t\tfor i in range(0, len(indicies)):\n\t\t\t\tif res[m] == next[i]:\n\t\t\t\t\tindicies[i] += 1\n\t\t\t\t\tnext[i] = primes[i]*res[indicies[i]]\n\t\treturn res\n\n\tdef nthSuperUglyNumber(self, n: int, primes: list[int]) -> int:\n\t\treturn self._Hamming(n, primes)[n - 1]\n","runtime":"558"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n dp = [1] * (n)\n\n\n indexes = defaultdict(int)\n\n\n copy = primes[:]\n\n\n for i in range(1,n):\n dp[i] = min(copy)\n\n for j in range(len(primes)): \n prime = copy[j]\n if dp[i] == prime:\n indexes[j] += 1\n copy[j] = primes[j] * dp[indexes[j]]\n\n\n return dp[n-1]","runtime":"603"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # https://leetcode.com/problems/super-ugly-number/solutions/169815/python-dp-solution-beats-93-7-extremely-detailed-explanation\n size = len(primes)\n num, dp, index, ugly_nums = 1, [1], [0]*size, primes[:]\n for i in range(1, n):\n dp.append(min(ugly_nums))\n for j in range(size):\n if ugly_nums[j] == dp[-1]:\n index[j] += 1\n ugly_nums[j] = dp[index[j]] * primes[j]\n \n return dp[-1]","runtime":"603"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n l=len(primes)\n nex=[]\n for i in range(l):\n nex.append(primes[i])\n i=[0]*l\n res=[1]\n while len(res)<n:\n n1=min(nex)\n if res[-1]!=n1: \n res.append(n1)\n j=nex.index(n1)\n i[j]+=1\n nex[j]=res[i[j]]*primes[j]\n return res[-1]","runtime":"648"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n\n ugly_numbers = [1]\n\n count = 0\n seen = set()\n\n while len(ugly_numbers) < n and count < n:\n mini = heapq.heappop(ugly_numbers)\n for p in primes:\n if p*mini not in seen:\n heapq.heappush(ugly_numbers, p * mini)\n seen.add(p*mini)\n count += 1\n\n maxi = max(ugly_numbers)\n\n while count < n:\n mini = heapq.heappop(ugly_numbers)\n for p in primes:\n if p * mini < maxi and p*mini not in seen:\n heapq.heappush(ugly_numbers, p * mini)\n seen.add(p*mini)\n count += 1\n\n print(ugly_numbers)\n\n return mini\n\n # ugly_numbers = [1]\n \n # last_used = 0\n # while len(ugly_numbers) < n:\n # temp = []\n # for p in primes:\n # ugly_numbers.heappush(p * ugly_numbers[last_used])\n # ugly_numbers = merge(temp, ugly_numbers)\n # last_used += 1\n\n # ugly_numbers = ugly_numbers[:n]\n # count = 0\n # while last_used < n:\n # temp = []\n # for p in primes:\n # if p * ugly_numbers[last_used] < ugly_numbers[-1]:\n # temp.append(p * ugly_numbers[last_used])\n # if temp != []:\n # count += 1\n # ugly_numbers = merge(temp, ugly_numbers)\n\n # last_used += 1\n\n # print(len(ugly_numbers))\n # print(ugly_numbers)\n # return ugly_numbers[last_used-1]\n\n\n\n","runtime":"648"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n n_primes = len(primes)\n pointers = [0 for _ in range(n_primes)]\n nums = [1]\n candidates = [nums[pointers[i]]*primes[i] for i in range(n_primes)]\n for _ in range(1, n):\n next_num = min(candidates)\n nums.append(next_num)\n for i, prime in enumerate(primes):\n if next_num == prime * nums[pointers[i]]:\n pointers[i] += 1\n candidates[i] = nums[pointers[i]]*prime\n return nums[-1]\n","runtime":"694"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes) -> int:\n from queue import PriorityQueue\n q = PriorityQueue()\n for i in range(n):\n if i < 1:\n q.put(1) # p_1**0 * .. p_n**0\n continue\n x = q.get()\n for _, p in enumerate(primes):\n q.put(p * x)\n if not x % p: break\n return q.get()","runtime":"739"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1: return 1\n multiples = list()\n for i in range(len(primes)):\n multiples.append(0)\n uglies = [1]\n while len(uglies) < n:\n multiples, uglies = self.getNext(primes, multiples, uglies)\n return uglies[n - 1]\n\n def getNext(self, primes, multiples, uglies):\n indices = []\n low = 2147483647\n for i in range(len(primes)):\n curr = primes[i] * uglies[multiples[i]]\n if curr < low:\n indices = [i]\n low = curr\n elif curr == low:\n indices.append(i)\n for i in indices:\n multiples[i] += 1\n uglies.append(low)\n return multiples, uglies","runtime":"784"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1] * n\n m = len(primes)\n indexes = [0] * m\n uglys = primes[:]\n for i in range(1, n):\n nxt_ugly = min(uglys)\n dp[i] = nxt_ugly\n for j in range(m):\n if nxt_ugly == uglys[j]:\n indexes[j] += 1\n uglys[j] = dp[indexes[j]] * primes[j]\n return dp[n - 1]\n\n\nfrom heapq import heappop, heappush\n\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n pq = [1]\n m = len(primes)\n for _ in range(n):\n ans = heappop(pq)\n for i in range(m - 1, 0, -1):\n if ans % primes[i] == 0:\n for j in range(i, m):\n heappush(pq, ans * primes[j])\n break\n else:\n for j in range(m):\n heappush(pq, ans * primes[j])\n return ans\n","runtime":"829"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1] * n \n\n size = len(primes)\n idx = [0] * size\n ugly_by_prime = [prime for prime in primes]\n\n for i in range(1, n):\n next_ugly_prime = min(ugly_by_prime)\n dp[i] = next_ugly_prime\n\n for j in range(size):\n if next_ugly_prime == ugly_by_prime[j]:\n idx[j] += 1\n ugly_by_prime[j] = dp[idx[j]] * primes[j]\n return dp[-1] \n","runtime":"874"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n num = len(primes)\n index = [0 for i in range(num)]\n ans = [1]\n \n for i in range(n-1):\n temp = ans[index[0]] * primes[0]\n temp_idx = 0\n for j in range(1, num):\n temp_res = ans[index[j]] * primes[j]\n if temp_res == ans[-1]:\n index[j] += 1\n temp_res = ans[index[j]] * primes[j]\n if temp_res < temp:\n temp = temp_res\n temp_idx = j\n index[temp_idx] += 1\n ans.append(temp)\n #print(ans)\n \n return ans[-1]\n ","runtime":"919"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n <= 0:\n return -1\n elif n == 1:\n return 1\n dp, pos = [0] * n, defaultdict(int)\n dp[0] = 1\n for prime in primes:\n pos[prime] = 0 # initial position for all prime numbers\n\n for i in range(1, n):\n minv, target_primes = None, []\n for prime in primes:\n index = pos[prime]\n v = dp[index] * prime\n if not minv or minv > v:\n minv = v\n target_primes = [prime]\n elif minv == v:\n target_primes.append(prime)\n dp[i] = minv\n for prime in target_primes:\n pos[prime] += 1\n return dp[n - 1]","runtime":"919"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = []\n heapq.heappush(heap, 1)\n uglyNumber = -1\n \n while n != 0:\n uglyNumber = heapq.heappop(heap)\n\n heapq.heappush(heap, uglyNumber * primes[-1])\n for index in range(len(primes) - 2, -1, -1):\n if uglyNumber % primes[index + 1] == 0: break\n heapq.heappush(heap, uglyNumber * primes[index])\n n -= 1\n \n return uglyNumber","runtime":"964"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n k = len(primes)\n nums = [1]\n indices = [0] * k\n\n while len(nums) < n:\n nexts = [0] * k\n for i in range(k):\n nexts[i] = nums[indices[i]] * primes[i]\n next = min(nexts)\n for i in range(k):\n if next == nexts[i]:\n indices[i] += 1\n nums.append(next)\n\n return nums[-1]\n ","runtime":"1009"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: list[int]) -> int:\n k = len(primes)\n nums = [1]\n indices = [0] * k\n\n while len(nums) < n:\n nexts = [0] * k\n for i in range(k):\n nexts[i] = nums[indices[i]] * primes[i]\n next = min(nexts)\n for i in range(k):\n if next == nexts[i]:\n indices[i] += 1\n nums.append(next)\n\n return nums[-1]","runtime":"1009"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1] * n\n indices = [0] * len(primes)\n \n for i in range(1, n):\n next_numbers = [0] * len(primes)\n for j in range(len(primes)):\n next_numbers[j] = ugly_numbers[indices[j]] * primes[j]\n ugly_numbers[i] = min(next_numbers)\n for j in range(len(primes)): \n if ugly_numbers[i] == next_numbers[j]:\n indices[j] += 1\n \n return ugly_numbers[n - 1]","runtime":"1055"},{"code":"from typing import List\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Initialize dp array and pointers for each prime\n dp = [0] * n\n dp[0] = 1\n pointers = [0] * len(primes)\n \n for i in range(1, n):\n # Calculate the next super ugly numbers based on current pointers\n next_values = [dp[pointers[j]] * primes[j] for j in range(len(primes))]\n next_ugly = min(next_values)\n dp[i] = next_ugly\n \n # Update pointers\n for j in range(len(primes)):\n if next_ugly == next_values[j]:\n pointers[j] += 1\n \n return dp[-1]\n","runtime":"1055"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n <= 0:\n return -1\n ugly = [1]\n indexes = [0] * len(primes)\n values = []\n while len(ugly) < n:\n values = [ugly[indexes[i]] * primes[i] for i in range(len(primes))]\n next_val = min(values)\n ugly.append(next_val)\n for i in range(len(primes)):\n if values[i] == next_val:\n indexes[i] += 1\n return ugly[-1]","runtime":"1100"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1]\n pointers = [0] * len(primes)\n while len(ugly_numbers) < n:\n candidates = [ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes))]\n next_ugly = min(candidates)\n ugly_numbers.append(next_ugly)\n for i in range(len(primes)):\n if candidates[i] == next_ugly:\n pointers[i] += 1\n return ugly_numbers[-1]","runtime":"1100"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n res=[1]\n m=len(primes)\n pointers=[0]*m\n for i in range(n-1):\n values=[]\n for j in range(m):\n values.append(res[pointers[j]]*primes[j])\n minValue=min(values)\n res.append(minValue)\n for j in range(m):\n if values[j]==minValue:\n pointers[j]+=1\n return res[-1]\n","runtime":"1145"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n arr = [1]\n l = len(primes)\n pointers = [0] * l\n for _ in range(n - 1):\n next_num = []\n for i in range(l):\n next_num.append(arr[pointers[i]] * primes[i])\n min_num = min(next_num)\n arr.append(min_num)\n for i in range(l):\n if next_num[i] == min_num:\n pointers[i] +=1\n return arr[-1]\n","runtime":"1145"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n pq = [1]\n m = len(primes)\n idx = [0] * m\n for _ in range(n - 1):\n tmp = [primes[j] * pq[idx[j]] for j in range(m)]\n b = min(tmp)\n pq.append(b)\n for j, c in enumerate(tmp):\n if c == b:\n idx[j] += 1\n return pq[-1]","runtime":"1190"},{"code":"from sortedcontainers import SortedSet\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n uglyNumbers = [0] * n\n uglyNumbers[0] = 1\n indexes = [0] * len(primes)\n maxContained = 1\n\n for i in range(1, len(uglyNumbers)):\n minIdx = -1\n minUglyNumber = float(\"inf\")\n for idx, p in enumerate(primes):\n while primes[idx] * uglyNumbers[indexes[idx]] <= maxContained:\n indexes[idx] +=1\n \n if primes[idx] * uglyNumbers[indexes[idx]] < minUglyNumber:\n minUglyNumber = primes[idx] * uglyNumbers[indexes[idx]]\n minIdx = idx\n\n uglyNumbers[i] = primes[minIdx] * uglyNumbers[indexes[minIdx]]\n maxContained= max(maxContained, uglyNumbers[i])\n indexes[minIdx] +=1\n \n return uglyNumbers[-1]","runtime":"1190"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n super_ugly = [1]\n l = len(primes)\n idx = [0] * l\n while len(super_ugly) < n:\n nxt = [super_ugly[i] * p for i, p in zip(idx, primes)]\n super_ugly.append(min(nxt))\n for i in range(l):\n if nxt[i] == super_ugly[-1]:\n idx[i] += 1\n return super_ugly[-1]\n","runtime":"1235"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n\n uglyNums = [0] * n\n uglyNums[0] = 1\n candidate = [0] * (max(primes) + 1)\n\n for i in range(1, n):\n uglyNums[i] = min([uglyNums[candidate[x]]*x for x in primes])\n for x in primes:\n if uglyNums[i] == uglyNums[candidate[x]]*x:\n candidate[x] += 1\n\n return uglyNums[n - 1]","runtime":"1235"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n pointers = [0 for i in range(len(primes))]\n uglyList = [0 for i in range(n + 1)]\n uglyList[0] = 1\n for i in range(1, n + 1):\n nextUgly = primes[0] * uglyList[pointers[0]]\n pointerIndex = 0\n for j in range(len(primes)):\n if primes[j] * uglyList[pointers[j]] == uglyList[i - 1]:\n pointers[j] += 1\n if primes[j] * uglyList[pointers[j]] < nextUgly:\n nextUgly = ( primes[j] * uglyList[pointers[j]] )\n pointerIndex= j\n uglyList[i] = nextUgly\n pointers[pointerIndex] += 1\n #print(uglyList)\n return uglyList[n - 1]","runtime":"1280"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n dp=[0]*(n)\n dp[0]=1\n \n \n l1=[0]*len(primes)\n \n for i in range(1,n):\n min1=float('inf')\n for j in range(len(primes)):\n if(primes[j]*dp[l1[j]]<min1):\n min1=primes[j]*dp[l1[j]]\n dp[i]=min1\n for p in range(len(primes)):\n if(primes[p]*dp[l1[p]]==min1):\n l1[p]+=1\n return dp[n-1]\n\n","runtime":"1280"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n\n dp = [1] * (n+1)\n primes_index = [1] * len(primes)\n\n # loop\n for i in range(2, n+1):\n dp[i] = min([dp[j]*primes[idx] for idx, j in enumerate(primes_index)])\n for idx, j in enumerate(primes):\n if dp[i] % j == 0:\n primes_index[idx] += 1\n \n return dp[-1]\n \n ","runtime":"1325"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans = [1]\n p = len(primes)\n pm = [0]*(p+1)\n while len(ans) != n:\n mm = float('inf')\n pv = []\n for i in range(p):\n if ans[-1] < primes[i]*ans[pm[i]] < mm:\n mm = primes[i]*ans[pm[i]]\n pv = [i]\n elif primes[i]*ans[pm[i]] == mm:\n pv.append(i)\n # print(mm, pv, primes[pv], pm)\n ans.append(mm)\n for ppv in pv:\n pm[ppv] += 1\n # print(ans)\n return ans[-1]","runtime":"1325"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n '''\n curr = [0] * len(primes)\n '''\n res = [1]\n curr = [0] * len(primes)\n while len(res) < n:\n min_value = min([res[curr[i]]*primes[i] for i in range(len(primes))])\n res.append(min_value)\n for i in range(len(primes)):\n if res[curr[i]]*primes[i] == min_value:\n curr[i] += 1\n\n return res[-1] \n ","runtime":"1370"},{"code":"from heapq import heappop, heappush\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [(1, 0)]\n while n:\n if n == 1:\n return heap[0][0]\n element, start_index = heappop(heap)\n for current_index, prime in enumerate(primes[start_index:], start=start_index):\n heappush(heap, (element * prime, current_index))\n n -= 1\n return -1","runtime":"1370"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1]\n pointers = [0] * len(primes)\n while len(ugly_numbers) < n:\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\n ugly_numbers.append(next_ugly)\n for i in range(len(primes)):\n if next_ugly == ugly_numbers[pointers[i]] * primes[i]:\n pointers[i] += 1\n return ugly_numbers[-1]","runtime":"1416"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1]\n pointers = [0] * len(primes)\n while len(ugly_numbers) < n:\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\n ugly_numbers.append(next_ugly)\n for i in range(len(primes)):\n if next_ugly == ugly_numbers[pointers[i]] * primes[i]:\n pointers[i] += 1\n return ugly_numbers[-1]","runtime":"1416"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans = [1]\n ans_set = set()\n ans_set.add(1)\n prime_multipliers = [0 for _ in range(len(primes))]\n count = 0\n while n > len(ans):\n min_val = None\n i_next = None\n for i in range(len(primes)):\n # while primes[i]*ans[prime_multipliers[i]] in ans_set:\n # prime_multipliers[i]+=1\n if primes[i]*ans[prime_multipliers[i]] == ans[-1]:\n prime_multipliers[i]+=1\n prime_mul = primes[i]*ans[prime_multipliers[i]]\n if (min_val == None or prime_mul<min_val):\n min_val = prime_mul\n i_next = i\n ans.append(min_val)\n ans_set.add(min_val)\n prime_multipliers[i_next]+=1\n return ans[n-1]\n","runtime":"1461"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans = [1]\n prime_multipliers = [0 for _ in range(len(primes))]\n count = 0\n while n > len(ans):\n min_val = None\n i_next = None\n for i in range(len(primes)):\n if primes[i]*ans[prime_multipliers[i]] == ans[-1]:\n prime_multipliers[i]+=1\n prime_mul = primes[i]*ans[prime_multipliers[i]]\n if (min_val == None or prime_mul<min_val):\n min_val = prime_mul\n i_next = i\n ans.append(min_val)\n prime_multipliers[i_next]+=1\n return ans[n-1]\n","runtime":"1461"},{"code":"import heapq\nfrom collections import deque\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n primes.sort()\n lists = []\n q = []\n for i, p in enumerate(primes):\n lists.append(deque([p]))\n q.append((p, i))\n heapq.heapify(q)\n qsize = len(primes)\n\n i = 1\n s = 1\n while i < n:\n t = heapq.heappop(q)\n lists[t[1]].popleft()\n\n if t[0] == s:\n if lists[t[1]]:\n heapq.heappush(q, (lists[t[1]][0], t[1]))\n continue\n s = t[0]\n # print(i, s, t[1])\n \n for j, p in enumerate(primes):\n if i + len(lists[j]) <= n:\n lists[j].append(s * p)\n\n if len(lists[j]) == 1:\n heapq.heappush(q, (lists[j][0], j))\n\n if len(lists[t[1]]) > 1:\n heapq.heappush(q, (lists[t[1]][0], t[1]))\n # print(q)\n i += 1\n\n return s\n ","runtime":"1506"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n uglies = [1]\n ptrs = [0] * len(primes)\n \n for curr in range(1, n):\n min_n = min([primes[i] * uglies[ptrs[i]] for i in range(len(primes))])\n uglies.append(min_n)\n for i, p in enumerate(primes):\n if uglies[curr] == p * uglies[ptrs[i]]: ptrs[i] += 1\n \n return uglies[-1]\n\n\"\"\"\nuglies := make([]int, n)\n uglies[0] = 1\n ptrs := make([]int, len(primes))\n curr := 1\n\n for curr < n {\n uglies[curr] = min(a * uglies[ia], b * uglies[ib], c * uglies[ic])\n if uglies[curr] == a * uglies[ia] { ia++ }\n if uglies[curr] == b * uglies[ib] { ib++ }\n if uglies[curr] == c * uglies[ic] { ic++ }\n curr++\n }\n fmt.Println(uglies)\n return uglies[n]\n\"\"\"","runtime":"1506"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [0]*n\n dp[0] = 1\n pointer = [0]*len(primes)\n for i in range(1,n):\n dp[i] = min([dp[pointer[k]]*primes[k] for k in range(len(primes))])\n for k in range(len(primes)):\n if dp[i]==dp[pointer[k]]*primes[k]:\n pointer[k]+=1\n \n return dp[n-1]","runtime":"1551"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n factors = dict.fromkeys(primes, 0)\n ugly_nums = [1]\n for count in range(n-1):\n new_num = min(map(lambda x: x[0]*ugly_nums[x[1]], factors.items()))\n for prime, idx in factors.items():\n if new_num == prime*ugly_nums[idx]:\n factors[prime] += 1\n ugly_nums.append(new_num)\n return ugly_nums[-1]\n\n ","runtime":"1551"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly = [(1, 1)]\n indice = [0] * len(primes)\n\n for _ in range(n):\n for i in range(len(primes)):\n prime = primes[i]\n mult = ugly[indice[i]][0]\n if i == 0:\n ugly.append((prime * mult, i))\n else:\n if prime * mult < ugly[-1][0]:\n ugly[-1] = (prime * mult, i)\n elif prime * mult == ugly[-1][0]:\n indice[i] += 1\n indice[ugly[-1][1]] += 1\n\n return ugly[n - 1][0]\n","runtime":"1596"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans = [1]\n ptr = [0]*len(primes) \n for _ in range(1, n): \n ans.append(min(ans[ptr[i]]*p for i, p in enumerate(primes)))\n for i, p in enumerate(primes):\n if ans[ptr[i]] * p == ans[-1]: ptr[i] += 1\n return ans[-1]","runtime":"1596"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap=[1]\n c=1\n prev=0\n while(heap and c<=n):\n num=heapq.heappop(heap)\n if(prev!=num):\n for i in primes:\n heapq.heappush(heap,num*i)\n c+=1\n prev=num\n return num","runtime":"1641"},{"code":"# key idea. the brute force inefficiently goes from one super ugly\n# number to the next, by just going through every number and \n# checking it. however, there might be a shortcut with this key idea.\n# every super ugly number in the sequence has the same set of prime \n# factors. wait. so we know if we take a super ugly number and \n# multiply it by those factors, we get a bigger super ugly number.\n# but we don't know if it is necessarily the next super ugly number.\n# so using a heap allows us to repeatedly find the next super ugly number.\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\n# But that is way way way better in terms of time. and space probably a bit worse\n# but that's okay. this is kind of like how we use a heap to merge \n# k sorted lists. prime factorization theorem is also useful in visualizing this.\n\n\n# [2,7,13,19]\n# [1,2,4,7,8,13,14,16,19,26,28,32]\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\n\n# [8 13 14 19 26 28 38 49 52 76]\n# 1 2 4 7\n\nfrom heapq import *\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [1]\n res = []\n while len(res) != n:\n curr = heappop(min_heap)\n while res and curr == res[-1]:\n curr = heappop(min_heap)\n res.append(curr)\n for prime in primes:\n heappush(min_heap, prime * curr)\n print(res)\n return res[-1]","runtime":"1641"},{"code":"import heapq as hq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n h = [1]\n c = 0\n x = 0\n while c < n:\n while h[0] == x:\n hq.heappop(h)\n x = hq.heappop(h)\n c += 1\n for p in primes:\n hq.heappush(h, x * p)\n return x","runtime":"1686"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n prev = 1\n if n == 1: return prev\n heap = primes[:]\n heapq.heapify(heap)\n n -= 1\n while n > 0:\n val = heapq.heappop(heap)\n if val != prev:\n prev = val\n for prime in primes:\n heapq.heappush(heap, prime*prev)\n n -= 1\n return prev\n","runtime":"1686"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n<=2:\n return n\n lp = len(primes)\n ne = [ [p] for p in primes ]\n cand = [ (p,i) for i,p in enumerate(primes) ]\n heapq.heapify(cand)\n cnt = 2\n while True:\n #print(\"\\n\", cnt)\n #print(ne)\n #print(cand)\n pv,ps = heapq.heappop(cand)\n if cnt == n:\n return pv\n cnt += 1\n ne[ps].pop(0)\n for psi in range(ps,lp):\n v = pv*primes[psi]\n ne[psi].append(v)\n heapq.heappush(cand, (ne[ps][0],ps))\n \n ","runtime":"1731"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n pointers = [0 for _ in range(len(primes))]\n nums = [0 for _ in range(n)]\n nums[0] = 1\n\n for i in range(1, n):\n minIdx = 0\n\n for j in range(len(pointers)):\n if (nums[pointers[j]] * primes[j]) < (nums[pointers[minIdx]] * primes[minIdx]):\n minIdx = j\n \n minValue = nums[pointers[minIdx]] * primes[minIdx]\n\n for j in range(len(pointers)):\n if nums[pointers[j]] * primes[j] == minValue:\n pointers[j] += 1\n\n nums[i] = minValue\n\n return nums[-1]\n ","runtime":"1731"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1: return 1\n \n hq = [1]\n heapq.heapify(hq)\n last = None\n while n > 0:\n now = heapq.heappop(hq)\n while len(hq) and last == now:\n now = heapq.heappop(hq)\n last = now\n for p in primes:\n heapq.heappush(hq, p * now)\n n -= 1\n \n return last\n\n","runtime":"1777"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Build a min-heap of all ugly numbers, starting with 1\n ug_nums = [1]\n # Track duplicates\n seen = set()\n count = 0\n while True:\n # use the minimum ugly number as a seed\n seed = heapq.heappop(ug_nums)\n # check that the seed hasn't been used before\n while seed in seen:\n seed = heapq.heappop(ug_nums)\n count +=1\n seen.add(seed)\n if count == n:\n return seed\n # Multiply the seed by each prime and add results to min-heap\n for prime in primes:\n heapq.heappush(ug_nums,seed*prime)\n","runtime":"1777"},{"code":"import heapq as hq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n h = [1]\n c = 0\n x = 0\n while c < n:\n while h[0] == x:\n hq.heappop(h)\n x = hq.heappop(h)\n c += 1\n for p in primes:\n hq.heappush(h, x * p)\n return x","runtime":"1822"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n a = [1]\n heapq.heapify(a)\n ans = 1\n s =set()\n while n>0:\n ans = heapq.heappop(a)\n if(ans in s):\n continue\n s.add(ans)\n n-=1\n for p in primes:\n heapq.heappush(a,ans*p)\n return ans\n\n ","runtime":"1822"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) :\n \n memo = [1] \n pointers = [0] * len(primes) \n\n def recursive_find(k):\n if k < len(memo):\n return memo[k]\n \n next_vals = [primes[i] * memo[pointers[i]] for i in range(len(primes))]\n next_val = min(next_vals)\n memo.append(next_val)\n \n for i in range(len(primes)):\n if next_val == primes[i] * memo[pointers[i]]:\n pointers[i] += 1\n \n return recursive_find(k)\n \n return recursive_find(n - 1)\n","runtime":"1867"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n numbers = [1]\n candidates = []\n \n for _ in range(n):\n for p in primes:\n heapq.heappush(candidates, numbers[-1] * p)\n while len(candidates) > 0:\n new_number = heapq.heappop(candidates)\n if numbers[-1] != new_number:\n numbers.append(new_number)\n break\n \n return numbers[n-1]\n","runtime":"1867"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n queue=[1]\n visited=set()\n \n for i in primes:\n \n heapq.heappush(queue,i)\n \n i=0\n while queue:\n \n node=heapq.heappop(queue)\n if node>2147483647 or node in visited:\n continue\n \n i+=1\n if i==n:\n return node\n visited.add(node)\n for p in primes:\n heapq.heappush(queue,p*node)\n\n ","runtime":"1912"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n m = len(primes)\n primesMulti =[0] * m\n res = [1]\n for i in range(1, n):\n current = res[primesMulti[0]] * primes[0]\n for j in range(1,m):\n current = min(res[primesMulti[j]] * primes[j], current)\n for j in range(m):\n if current == res[primesMulti[j]] * primes[j]:\n primesMulti[j] +=1\n res.append(current)\n return res[-1]\n\n ","runtime":"1912"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n arr=[1]\n d={}\n for i in primes:\n d[i]=[0,0]\n for i in range(1,n):\n m=float('inf')\n for i,j in d.items():\n j[1]=i*arr[j[0]]\n m=min(m,j[1])\n arr.append(m)\n for i,j in d.items():\n if m==j[1]:\n j[0]+=1\n return arr[-1]","runtime":"1957"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n assert(n > 0)\n\n pows = [0] * len(primes)\n\n ugs = [1]\n for _ in range(n - 1):\n next_ug = float('inf')\n for i in range(len(primes)):\n next_ug = min(next_ug, primes[i] * ugs[pows[i]])\n \n for i in range(len(pows)):\n if primes[i] * ugs[pows[i]] == next_ug:\n pows[i] += 1\n\n ugs.append(next_ug)\n \n return ugs[-1]","runtime":"1957"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n p=len(primes)\n idx=[0]*p\n dp=[0]*n\n dp[0]=1\n for i in range(1,n):\n uglynum=float('inf')\n for j in range(p):\n uglynum=min(uglynum,dp[idx[j]]*primes[j])\n dp[i]=uglynum\n for j in range(p):\n if uglynum==dp[idx[j]]*primes[j]:\n idx[j]+=1\n return dp[-1]","runtime":"2002"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n m = len(primes)\n factors = [0 for i in range(m)]\n ans = [1]\n x = 1\n while x < n :\n minx = float(\"inf\")\n for i in range(m):\n minx = min(minx,ans[factors[i]]*primes[i] )\n for i in range(m):\n if ans[factors[i]]*primes[i] == minx:\n factors[i] += 1\n ans.append(minx) \n x = len(ans)\n # print(ans)\n return ans[n-1]","runtime":"2002"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1]*(n+1)\n m = len(primes)\n primesIdx = [1]*m\n \n for i in range(2,n+1):\n minimum = sys.maxsize\n for j,prime in enumerate(primes):\n minimum = min(minimum,prime*dp[primesIdx[j]])\n dp[i] = minimum\n for j,prime in enumerate(primes):\n if prime*dp[primesIdx[j]] == minimum:\n primesIdx[j]+=1\n \n return dp[-1] \n # dp = [1]*(n+1)\n # minH = [[prime,1,prime] for prime in primes]\n # i = 2\n # while i<=n:\n # val,idx,prime = heapq.heappop(minH)\n # if dp[i-1]!=val:\n # dp[i] = val\n # i+=1\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\n\n # return dp[-1] \n\n '''\n dp = [1]*(1+n)\n minHeap = []\n for i,prime in enumerate(primes):\n heapq.heappush(minHeap,[prime,1,prime]) #(val,idx,prime)\n \n i = 2\n while i<=n:\n val,idx,prime = heapq.heappop(minHeap)\n if dp[i-1]!=val:\n dp[i] = val\n i+=1\n heapq.heappush(minHeap,[prime*dp[idx+1],idx+1,prime])\n return dp[-1] \n '''\n '''\n dp = [1]*(n+1)\n m = len(primes)\n primesIdx = [1]*m\n \n for i in range(2,n+1):\n minimum = float('inf')\n for j,prime in enumerate(primes):\n minimum = min(minimum,prime*dp[primesIdx[j]])\n dp[i] = minimum\n for j,prime in enumerate(primes):\n if prime*dp[primesIdx[j]] == minimum:\n primesIdx[j]+=1\n \n return dp[-1]\n ''' \n \n \n ","runtime":"2047"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n indices = [0] * len(primes)\n dp = [1] * n\n for i in range(1, n):\n minimum = inf\n for j in range(len(primes)):\n minimum = min(minimum, primes[j] * dp[indices[j]])\n\n dp[i] = minimum\n for j in range(len(primes)):\n if primes[j] * dp[indices[j]] == minimum:\n indices[j] += 1\n\n return dp[n-1]","runtime":"2047"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1]*(n+1)\n m = len(primes)\n primeIdx = [1]*m\n\n for i in range(2,n+1):\n minimum = sys.maxsize\n for j,p in enumerate(primes): minimum = min(minimum,p*dp[primeIdx[j]])\n dp[i] = minimum\n for j,p in enumerate(primes):\n if p*dp[primeIdx[j]] == minimum: primeIdx[j]+=1\n\n return dp[-1] \n\n # dp = [1]*(n+1)\n # i = 2\n # minH = [[p,1,p] for p in primes]\n # while i<=n:\n # val,idx,prime = heapq.heappop(minH)\n # if dp[i-1]!= val:\n # dp[i] = val\n # i+=1\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\n # return dp[-1] \n\n # dp = [1]*(n+1)\n # minH = [[prime,1,prime] for prime in primes]\n # i = 2\n # while i<=n:\n # val,idx,prime = heapq.heappop(minH)\n # if dp[i-1]!=val:\n # dp[i] = val\n # i+=1\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\n\n # return dp[-1] \n\n '''\n dp = [1]*(1+n)\n minHeap = []\n for i,prime in enumerate(primes):\n heapq.heappush(minHeap,[prime,1,prime]) #(val,idx,prime)\n \n i = 2\n while i<=n:\n val,idx,prime = heapq.heappop(minHeap)\n if dp[i-1]!=val:\n dp[i] = val\n i+=1\n heapq.heappush(minHeap,[prime*dp[idx+1],idx+1,prime])\n return dp[-1] \n '''\n '''\n dp = [1]*(n+1)\n m = len(primes)\n primesIdx = [1]*m\n \n for i in range(2,n+1):\n minimum = float('inf')\n for j,prime in enumerate(primes):\n minimum = min(minimum,prime*dp[primesIdx[j]])\n dp[i] = minimum\n for j,prime in enumerate(primes):\n if prime*dp[primesIdx[j]] == minimum:\n primesIdx[j]+=1\n \n return dp[-1]\n ''' \n \n \n ","runtime":"2092"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [0] * n\n dp[0] = 1\n resArr = [0] * len(primes)\n for i in range(1, n):\n res = float(\"inf\")\n for j, v in enumerate(primes):\n res = min(res, dp[resArr[j]] * v)\n\n dp[i] = res\n for k, v in enumerate(primes):\n if dp[i] == dp[resArr[k]] * v:\n resArr[k] += 1\n\n return dp[n - 1]","runtime":"2092"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int: \n dp = [1]*(n+1)\n m = len(primes)\n primeIdx = [1]*m\n\n for i in range(2,n+1):\n minimum = sys.maxsize\n for j,p in enumerate(primes): minimum = min(minimum,p*dp[primeIdx[j]])\n for j,p in enumerate(primes):\n if p*dp[primeIdx[j]]==minimum: primeIdx[j]+=1\n dp[i] = minimum \n return dp[-1] \n\n # dp = [1]*(n+1)\n # i = 2\n # minH = [[p,1,p] for p in primes]\n # while i<=n:\n # val,idx,prime = heapq.heappop(minH)\n # if dp[i-1]!= val:\n # dp[i] = val\n # i+=1\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\n # return dp[-1] \n\n # dp = [1]*(n+1)\n # minH = [[prime,1,prime] for prime in primes]\n # i = 2\n # while i<=n:\n # val,idx,prime = heapq.heappop(minH)\n # if dp[i-1]!=val:\n # dp[i] = val\n # i+=1\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\n\n # return dp[-1] \n\n '''\n dp = [1]*(1+n)\n minHeap = []\n for i,prime in enumerate(primes):\n heapq.heappush(minHeap,[prime,1,prime]) #(val,idx,prime)\n \n i = 2\n while i<=n:\n val,idx,prime = heapq.heappop(minHeap)\n if dp[i-1]!=val:\n dp[i] = val\n i+=1\n heapq.heappush(minHeap,[prime*dp[idx+1],idx+1,prime])\n return dp[-1] \n '''\n '''\n dp = [1]*(n+1)\n m = len(primes)\n primesIdx = [1]*m\n \n for i in range(2,n+1):\n minimum = float('inf')\n for j,prime in enumerate(primes):\n minimum = min(minimum,prime*dp[primesIdx[j]])\n dp[i] = minimum\n for j,prime in enumerate(primes):\n if prime*dp[primesIdx[j]] == minimum:\n primesIdx[j]+=1\n \n return dp[-1]\n ''' \n \n \n ","runtime":"2138"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n res = [0]*n\n ptrs = defaultdict(int)\n res[0]=1\n for i in range(1,n):\n nxt = float(\"inf\")\n for prime in primes:\n nxt = min(res[ptrs[prime]]*prime,nxt)\n for prime in primes:\n if nxt==res[ptrs[prime]]*prime:\n ptrs[prime]+=1\n res[i]=nxt\n return res[n-1]\n\n ","runtime":"2138"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n helper=[0]*len(primes)\n res=[float('inf')]*n\n res[0]=1\n for i in range(1, n):\n for j in range(len(primes)):\n res[i]=min(res[i], res[helper[j]]*primes[j])\n for j in range(len(primes)):\n if res[i]==res[helper[j]]*primes[j]:\n helper[j]+=1\n return res[-1]","runtime":"2183"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n l = [1]\n count = 1\n pcount = len(primes)\n pointers = [0] * pcount\n while count < n:\n minimum = l[-1] * primes[-1]\n for i in range(pcount):\n while l[pointers[i]] * primes[i] <= l[-1]:\n pointers[i] += 1\n minimum = min(minimum, l[pointers[i]] * primes[i])\n l.append(minimum)\n count += 1\n return l[-1]\n \n\n ","runtime":"2183"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n for i in range(len(primes)):\n primes[i] = [primes[i], 0]\n\n\n\n\n dp = [1]\n\n while len(dp) < n:\n\n next = float(\"inf\")\n\n for i in range(len(primes)):\n next = min(next, dp[primes[i][1]] * primes[i][0])\n\n dp.append(next)\n\n for i in range(len(primes)):\n\n if next == dp[primes[i][1]] * primes[i][0]:\n primes[i][1] += 1\n\n\n return dp[-1]","runtime":"2228"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n '''\n Use the index of the preivous prime numbers we have processed\n\n '''\n state = [1]\n size = len(primes)\n inds = [0 for _ in range(size)]\n\n while len(state) < n:\n minVal = float('inf')\n for i in range(size):\n prime = primes[i]\n ind = inds[i]\n prevPrime = state[ind]\n minVal = min(minVal, prevPrime * prime)\n \n for i in range(size):\n prime = primes[i]\n ind = inds[i]\n prevPrime = state[ind]\n if minVal == prevPrime * prime:\n inds[i] += 1\n \n state.append(minVal)\n \n \n return state[-1]","runtime":"2273"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n sugly=[]\n sugly.append(1)\n p_ind=[0]*len(primes)\n while(len(sugly)<n):\n p=-1\n mi=sugly[-1]*primes[-1]+5\n for i in range(len(primes)):\n if(sugly[p_ind[i]]*primes[i]<mi):\n mi=sugly[p_ind[i]]*primes[i]\n p=i\n if(mi>sugly[-1]):\n sugly.append(mi)\n p_ind[p]+=1\n return sugly[-1]\n\n\n","runtime":"2273"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n==1:\n return 1\n pointers=[-1]*len(primes)\n minheap=[]\n heapq.heapify(minheap)\n out=[1]\n outset=set(out)\n pointers[0]=0\n\n while True:\n i=0\n minval=float('inf')\n while i<len(primes) and pointers[i]>=0:\n if pointers[i]<len(out):\n val=out[pointers[i]]*primes[i]\n minval=min(minval,val)\n heapq.heappush(minheap,val)\n pointers[i]+=1\n i+=1\n while minheap and minheap[0]<=minval:\n elem=heapq.heappop(minheap)\n if elem not in outset:\n out.append(elem)\n outset.add(elem)\n if len(out)>=n:\n return out[n-1]\n if i<len(primes):\n pointers[i]=0\n","runtime":"2318"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minHeap=[]\n ans=[1]\n no=len(primes)\n count=1\n while count<n:\n for i in range(1,no+1):\n if count>=i:\n heapq.heappush(minHeap,ans[-i]*primes[i-1])\n else:\n break\n while minHeap[0]==ans[-1]:\n heapq.heappop(minHeap)\n ans.append(minHeap[0])\n heapq.heappop(minHeap)\n count+=1\n return ans[-1]","runtime":"2363"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n nums = set()\n q = [1]\n while len(nums) < n:\n v = heappop(q)\n if v not in nums:\n nums.add(v)\n for p in primes:\n if v * p not in nums:\n heappush(q, v * p)\n return max(nums)\n\n\n ","runtime":"2363"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n cache = set([1])\n options = primes.copy()\n heapq.heapify(options)\n\n while len(cache) < n:\n minVal = heapq.heappop(options)\n if minVal in cache: continue\n cache.add(minVal)\n for prime in primes:\n if not minVal * prime in cache:\n heapq.heappush(options, minVal * prime)\n return max(cache)\n","runtime":"2408"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n res=[1]\n l=[0 for _ in range(len(primes))]\n\n while len(res)<n:\n mini=float('inf')\n ind=-1\n \n for i in range(len(primes)):\n tmp=primes[i]*res[l[i]]\n if tmp<mini:\n mini=tmp\n ind=i\n \n l[ind]+=1\n if mini!=res[-1]:\n res.append(mini)\n print(res)\n return res[-1]\n\n\n\n","runtime":"2408"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n res = [float('inf')] * (n)\n res[0] = 1\n idx = [0] * len(primes)\n\n\n\n for i in range(1, n):\n for (j, p) in enumerate(primes):\n res[i] = min(res[i], p * res[idx[j]])\n for (j, p) in enumerate(primes):\n if res[i] == p * res[idx[j]]:\n idx[j] += 1\n return res[-1]\n\n #Time complexity = len(primes) * n ","runtime":"2453"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1]\n \n # indexes[p]: last index i where dp[i]*p <= dp[-1]\n indexes= {p : 0 for p in primes}\n\n for (i) in range(n-1):\n next = 1e10\n for p,j in indexes.items():\n next = min(next, p*dp[j])\n\n for p,j in indexes.items():\n indexes[p] += dp[j] * p <= next\n\n dp.append(next)\n\n return dp[-1]\n\n ","runtime":"2453"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1] * n\n pos = [0] * len(primes)\n\n for i in range(1, n):\n minVal = float('inf')\n for j in range(len(primes)):\n minVal = min(minVal, primes[j] * dp[pos[j]])\n for j in range(len(primes)):\n pos[j] += (primes[j] * dp[pos[j]] == minVal)\n dp[i] = minVal\n return dp[-1]","runtime":"2499"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n==1:\n return 1\n pointers=[-1]*len(primes)\n minheap=[]\n heapq.heapify(minheap)\n out=[1]\n outset=set(out)\n pointers[0]=0\n\n while True:\n i=0\n minval=float('inf')\n while i<len(primes) and pointers[i]>=0:\n if pointers[i]<len(out):\n val=out[pointers[i]]*primes[i]\n minval=min(minval,val)\n heapq.heappush(minheap,val)\n pointers[i]+=1\n i+=1\n while minheap and minheap[0]<=minval:\n elem=heapq.heappop(minheap)\n if elem not in outset:\n out.append(elem)\n outset.add(elem)\n if len(out)>=n:\n return out[n-1]\n if i<len(primes):\n pointers[i]=0\n","runtime":"2499"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n res = []\n\n listx = [1]\n\n heapq.heapify(listx)\n dictx = {}\n\n while n > 0:\n x = heapq.heappop(listx)\n if x not in dictx.keys():\n for each in primes:\n x1 = x*each\n if x1 not in dictx.keys():\n heapq.heappush(listx, x1)\n res.append(x)\n dictx[x] = 1\n n -= 1\n else:\n continue\n \n return res[-1]\n ","runtime":"2544"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n res = []\n\n listx = [1]\n\n heapq.heapify(listx)\n dictx = {}\n\n while n > 0:\n x = heapq.heappop(listx)\n if x not in dictx.keys():\n for each in primes:\n x1 = x*each\n if x1 not in dictx.keys():\n heapq.heappush(listx, x1)\n res.append(x)\n dictx[x] = 1\n n -= 1\n else:\n continue\n \n return res[-1]\n ","runtime":"2589"},{"code":"from heapq import heapify, heappush, heappop\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n minheap = [1]\n heapify(minheap)\n\n visited = {1}\n\n for i in range(n):\n top = heappop(minheap)\n for prime in primes:\n prod = prime*top\n if(prod not in visited):\n heappush(minheap,prod)\n visited.add(prod)\n return top","runtime":"2634"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr\n","runtime":"2679"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n return self.approach_priorityqueue(n, primes)\n\n def approach_priorityqueue(self, n, primes):\n count = 0\n visited = set({1})\n pq = [1]\n\n while count < n:\n answer = heappop(pq)\n\n for prime in primes:\n new_answer = answer * prime\n if new_answer not in visited:\n visited.add(new_answer)\n heappush(pq, new_answer)\n\n count += 1\n\n return answer\n ","runtime":"2724"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Initialize the heap with the number 1\n heap = [1]\n seen = {1} # Use a set to keep track of seen numbers\n \n for _ in range(n):\n # Extract the smallest number from the heap\n current_ugly = heapq.heappop(heap)\n \n # Generate new candidates by multiplying the current ugly number with each prime\n for prime in primes:\n new_ugly = current_ugly * prime\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n \n return current_ugly","runtime":"2769"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n seen = {1}\n heap = [1]\n ugly = 1\n for _ in range(n):\n ugly = heapq.heappop(heap)\n for factor in primes:\n new_ugly = ugly * factor\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n return ugly\n","runtime":"2814"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","runtime":"2860"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1:\n return 1\n\n heap = []\n heapq.heappush(heap, 1)\n\n seen = set()\n seen.add(1)\n\n su = 1\n for _ in range(n):\n su = heapq.heappop(heap)\n for f in primes:\n add_f = su * f\n if add_f not in seen:\n seen.add(add_f)\n heapq.heappush(heap, add_f)\n\n return su","runtime":"2905"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n numbers_seen = 0\n potentials = [1] + primes\n numbers_tried = set(potentials)\n heapq.heapify(potentials)\n\n while True:\n smallest = heapq.heappop(potentials)\n numbers_seen += 1\n if numbers_seen == n:\n return smallest\n for x in primes:\n new_candidate = smallest*x\n if new_candidate not in numbers_tried:\n numbers_tried.add(new_candidate)\n heapq.heappush(potentials, new_candidate)\n","runtime":"2950"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","runtime":"2995"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n uglyHeap = [1]\n visited = set()\n visited.add(1)\n for _ in range(n):\n curr = heappop(uglyHeap)\n for prime in primes:\n new_ugly = curr * prime\n if new_ugly not in visited:\n heappush(uglyHeap, new_ugly)\n visited.add(new_ugly)\n return curr","runtime":"2995"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n h, visited = [1], {1}\n\n ugly = 0\n for _ in range(n):\n ugly = heappop(h)\n for prime in primes:\n new_ugly = ugly * prime\n if new_ugly not in visited:\n visited.add(new_ugly)\n heappush(h, new_ugly)\n \n return ugly","runtime":"3040"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minHeap = [1]\n seen = set()\n seen.add(1)\n current = 1\n for _ in range(n):\n current = heapq.heappop(minHeap)\n for prime in primes:\n next_ugly = current * prime\n if next_ugly not in seen:\n heapq.heappush(minHeap, next_ugly)\n seen.add(next_ugly)\n return current","runtime":"3040"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","runtime":"3085"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [1]\n visited = set(min_heap)\n heapq.heapify(min_heap)\n\n for _ in range(n):\n element = heapq.heappop(min_heap)\n for prime in primes:\n new_element = element * prime\n if new_element not in visited:\n visited.add(new_element)\n heapq.heappush(min_heap, new_element)\n return element\n ","runtime":"3130"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n l = [1]\n v = set()\n v.add(1)\n for i in range(n):\n nn = heappop(l)\n if i == n-1:\n return nn\n for p in primes:\n np = nn * p\n if np not in v:\n v.add(np)\n heappush(l, np)\n \n return 0\n\n\n\n\n","runtime":"3130"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n seen = {1}\n pq = [1]\n\n while n:\n num = heapq.heappop(pq)\n if n == 1:\n return num\n \n for prime in primes:\n new_num = num * prime\n if not new_num in seen:\n heapq.heappush(pq, new_num)\n seen.add(new_num)\n \n n -= 1\n\n","runtime":"3175"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n h = []\n heapq.heappush(h,1)\n visited = {1}\n for i in range(n):\n cur = heapq.heappop(h)\n for p in primes:\n temp = p * cur\n if temp not in visited:\n visited.add(temp)\n heapq.heappush(h,temp)\n return cur\n\n \n","runtime":"3175"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Initialize the heap with the first element (1)\n heap = [1]\n # Initialize a set to keep track of numbers we've already seen\n seen = set([1])\n\n for _ in range(n):\n # Extract the smallest number from the heap\n ugly = heapq.heappop(heap)\n # Generate the next possible super ugly numbers\n for prime in primes:\n next_ugly = ugly * prime\n # If we haven't seen this number before, add it to the heap and seen set\n if next_ugly not in seen:\n seen.add(next_ugly)\n heapq.heappush(heap, next_ugly)\n\n return ugly\n\n# Example usage:\nsolution = Solution()\nn = 12\nprimes = [2, 7, 13, 19]\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32","runtime":"3221"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = []\n seen = set()\n\n heappush(heap, 1)\n seen.add(1)\n\n ans = 1\n for _ in range(n):\n ans = heappop(heap)\n\n for prime in primes:\n new_ugly = ans * prime\n if new_ugly not in seen:\n heappush(heap, new_ugly)\n seen.add(new_ugly)\n \n return ans","runtime":"3221"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_set = set([1])\n # Init the heap.\n hq = [1]\n curr = 0\n \n for i in range(n):\n curr = heapq.heappop(hq)\n for prime in primes:\n new = prime * curr\n if new not in ugly_set:\n ugly_set.add(new)\n heapq.heappush(hq, new)\n \n return curr\n \n return ugly_set[n-1]\n","runtime":"3266"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","runtime":"3266"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minHeap = []\n\n heapq.heappush(minHeap,1)\n seen = set()\n ugly = 1\n\n for _ in range(n): \n ugly = heapq.heappop(minHeap)\n for prime in primes: \n newUgly = ugly * prime\n if newUgly not in seen: \n seen.add(newUgly)\n heapq.heappush(minHeap,newUgly)\n\n\n return ugly\n \n ","runtime":"3311"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = []\n min_heap.append(1)\n vis = set()\n vis.add(1)\n cur = 0\n heapq.heapify(min_heap)\n for i in range(n):\n cur = heappop(min_heap)\n for p in primes:\n new = cur*p\n if new not in vis:\n vis.add(new)\n heappush(min_heap, new)\n return cur","runtime":"3311"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1] # Initialize the heap with 1\n seen = set() # To keep track of seen numbers\n ugly = [] # To store the super ugly numbers\n \n for _ in range(n):\n current_ugly = heapq.heappop(heap) # Get the smallest number\n ugly.append(current_ugly)\n for prime in primes:\n new_ugly = current_ugly * prime\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n \n return ugly[-1]\n\n# Example usage:\nsolution = Solution()\nn = 12\nprimes = [2, 7, 13, 19]\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32","runtime":"3356"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","runtime":"3356"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_number = 1\n next_numbers = []\n set_next_numbers = set()\n for _ in range(n-1):\n for factor in primes:\n if (next_ := ugly_number*factor) not in set_next_numbers:\n heappush(next_numbers, next_)\n set_next_numbers.add(next_)\n ugly_number = heappop(next_numbers)\n set_next_numbers.remove(ugly_number)\n \n return ugly_number","runtime":"3401"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Initialize the heap with the first super ugly number (1)\n heap = [1]\n # Set to keep track of unique numbers added to the heap\n seen = set([1])\n\n # Repeat the process n-1 times to get the nth super ugly number\n for _ in range(n - 1):\n # Extract the smallest element from the heap\n current_ugly = heapq.heappop(heap)\n # Generate new super ugly numbers by multiplying the current ugly number with each prime\n for prime in primes:\n new_ugly = current_ugly * prime\n # Add new ugly number to the heap if it hasn't been seen before\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n\n # The nth super ugly number is the smallest element remaining in the heap\n return heap[0]\n\n# Example usage:\nsolution = Solution()\nn = 12\nprimes = [2, 7, 13, 19]\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32","runtime":"3401"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n import heapq\n if n==1:\n return 1\n \n ret = [ele for ele in primes]\n s = set(primes)\n heapq.heapify(ret)\n\n for i in range(n-1):\n ele = heapq.heappop(ret)\n for prime in primes:\n if ele*prime not in s:\n heapq.heappush(ret, ele*prime)\n s.add(ele*prime)\n return ele","runtime":"3446"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Min-heap to keep track of the smallest numbers\n min_heap = [1]\n # Set to keep track of the numbers we have added to the heap\n seen = {1}\n \n # Variable to store the current super ugly number\n ugly_number = 1\n \n for _ in range(n):\n # Get the smallest number from the heap\n ugly_number = heapq.heappop(min_heap)\n \n # For each prime, generate new super ugly numbers\n for prime in primes:\n new_ugly = ugly_number * prime\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(min_heap, new_ugly)\n \n return ugly_number\n","runtime":"3446"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minHeap = []\n\n heapq.heappush(minHeap,1)\n seen = set()\n ugly = 1\n\n for _ in range(n): \n ugly = heapq.heappop(minHeap)\n for prime in primes: \n newUgly = ugly * prime\n if newUgly not in seen: \n seen.add(newUgly)\n heapq.heappush(minHeap,newUgly)\n\n\n return ugly\n \n ","runtime":"3491"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n setto = set([1])\n heapq.heapify(heap)\n\n while True:\n #print(heap)\n val = heapq.heappop(heap)\n if n == 1:\n return val\n for prime in primes:\n if val*prime not in setto:\n setto.add(val*prime)\n heapq.heappush(heap, val*prime)\n n -= 1\n \n \n \n ","runtime":"3491"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1:\n return 1\n i = 1\n found = set(primes)\n heap = primes[:]\n heapq.heapify(heap)\n while i < n: \n num = heapq.heappop(heap)\n for prime in primes:\n if num*prime not in found:\n found.add(num*prime)\n heapq.heappush(heap, num*prime)\n i+=1\n return num\n \n \n","runtime":"3536"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = []\n min_heap.append(1)\n visi = set()\n visi.add(1)\n cur = 0\n heapq.heapify(min_heap)\n for i in range(n):\n cur = heappop(min_heap)\n for p in primes:\n new = cur*p\n if new not in visi:\n visi.add(new)\n heappush(min_heap, new)\n return cur","runtime":"3536"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1:\n return 1\n uglies = primes[:]\n num = 1\n seen = {1}\n\n for _ in range(n-1):\n num = heapq.heappop(uglies)\n for p in primes:\n if p * num not in seen:\n heapq.heappush(uglies, p * num)\n seen.add(p * num)\n\n return num\n ","runtime":"3582"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n\n seen = set([1])\n heap = [1]\n heapify(heap)\n\n for i in range(n):\n curr = heappop(heap)\n\n if i == n-1:\n return curr\n \n for factor in primes:\n if (factor * curr) not in seen:\n seen.add(factor * curr)\n heappush(heap, factor * curr)\n \n return 1","runtime":"3582"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n visit = set()\n for _ in range(n):\n curr = heappop(heap)\n for p in primes:\n if p*curr not in visit:\n heappush(heap, p*curr)\n visit.add(p*curr)\n return curr","runtime":"3627"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap=[1]\n heapq.heapify(heap)\n visited=set()\n for i in range(n):\n num=heapq.heappop(heap)\n if i==n-1:\n return num\n for fact in primes:\n if fact*num not in visited:\n heapq.heappush(heap,fact*num)\n visited.add(fact*num)","runtime":"3627"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minHeap = [1]\n a = 0\n visited = {1}\n for i in range(n):\n a = heapq.heappop(minHeap)\n for p in primes:\n if p * a not in visited:\n heapq.heappush(minHeap, p * a)\n visited.add(p * a)\n return a","runtime":"3672"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n hp = [1]\n seen = set([1])\n\n for _ in range(n):\n var = heapq.heappop(hp)\n \n for p in primes:\n if p*var not in seen:\n seen.add(p*var)\n heapq.heappush(hp, p*var)\n return var","runtime":"3672"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n cur = 0\n num = [1]\n seen = set([1])\n while n:\n cur = heappop(num)\n n -= 1\n for i in primes:\n if i * cur not in seen:\n heappush(num, i * cur)\n seen.add(i * cur)\n return cur\n","runtime":"3717"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n heapq.heapify(heap)\n visited = set()\n \n res = []\n\n while len(res) < n:\n res.append(heapq.heappop(heap))\n \n for j in range(len(primes)):\n num = res[-1] * primes[j]\n if num not in visited:\n heapq.heappush(heap, num)\n visited.add(num)\n \n return res[-1]\n ","runtime":"3717"}],"string":"[\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans = [1]\\n ans_idx = [0]\\n primes_idx = [0 for _ in range(len(primes))]\\n pq = [(prime, idx) for idx, prime in enumerate(primes)]\\n heapq.heapify(pq)\\n for _ in range(n - 1):\\n prime, idx = heapq.heappop(pq)\\n ans.append(prime)\\n ans_idx.append(idx)\\n primes_idx[idx] += 1\\n while ans_idx[primes_idx[idx]] > idx:\\n primes_idx[idx] += 1\\n heapq.heappush(pq, (primes[idx] * ans[primes_idx[idx]], idx))\\n return ans[-1]\",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) :\\n \\n \\n ans = [1]\\n ans_idx = [0]\\n primes_idx = [0 for _ in range(len(primes))]\\n pq = [(prime, idx) for idx, prime in enumerate(primes)]\\n heapq.heapify(pq)\\n for _ in range(n - 1):\\n prime, idx = heapq.heappop(pq)\\n ans.append(prime)\\n ans_idx.append(idx)\\n primes_idx[idx] += 1\\n while ans_idx[primes_idx[idx]] > idx:\\n primes_idx[idx] += 1\\n heapq.heappush(pq, (primes[idx] * ans[primes_idx[idx]], idx))\\n return ans[-1]\",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n nums = primes.copy()\\n heapq.heapify(nums)\\n p = 1\\n for i in range(n - 1):\\n p = heapq.heappop(nums)\\n for prime in primes:\\n heapq.heappush(nums, p*prime)\\n if p % prime == 0:\\n break\\n return p \",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n nums = primes.copy() # do a deep copy \\n heapq.heapify(nums) #create a heap\\n p = 1\\n for i in range(n - 1):\\n p = heapq.heappop(nums) #take the smallest element\\n for prime in primes:\\n heapq.heappush(nums, p * prime) #add all those multiples with the smallest number\\n if p % prime == 0:\\n break\\n return p\",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n primes=sorted(primes)\\n hp=[1]\\n ans=set()\\n for _ in range(n):\\n val=heapq.heappop(hp)\\n for prime in primes: \\n heapq.heappush(hp,val*prime)\\n if val%prime==0: break\\n ans.add(val)\\n return sorted(list(set(ans)))[n-1]\",\n \"runtime\": \"242\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n nums = primes.copy()\\n heapq.heapify(nums)\\n s=1\\n for i in range(n-1):\\n s = heapq.heappop(nums)\\n for j in primes:\\n heapq.heappush(nums,s*j)\\n if s % j == 0:\\n break\\n print(nums)\\n return s\",\n \"runtime\": \"242\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1:return 1\\n h = [(primes[0], 0)]\\n l = len(primes)\\n count = 1\\n visited = set()\\n while count < n:\\n (temp, ind) = heappop(h)\\n if temp in visited:continue\\n visited.add(temp)\\n heappush(h, (temp * primes[0], 0))\\n if ind < (l - 1):\\n heappush(h, ((temp // primes[ind]) * primes[ind + 1], ind + 1))\\n count += 1\\n return temp\\n\\n\\n \",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n res = [1]\\n candidates = [(p, p, 0) for p in primes]\\n heapq.heapify(candidates)\\n for _ in range(n-1):\\n v = candidates[0][0]\\n res.append(v)\\n\\n # there could be duplicates in the candidates\\n while candidates[0][0] == v:\\n v, p, i = candidates[0]\\n # move i\\n i += 1\\n heapq.heapreplace(candidates, (p * res[i], p, i))\\n return res[-1]\\n \",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minPQ=[]\\n for prime in primes:\\n heapq.heappush(minPQ,(prime,0,prime))\\n res=[1]\\n while len(res)<n:\\n value,index,prime=heapq.heappop(minPQ)\\n if value!=res[-1]:\\n res.append(value)\\n heapq.heappush(minPQ,(res[index+1]*prime,index+1,prime))\\n return res[-1]\\n\",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"from typing import List\\nimport heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # The initial super ugly number is 1\\n ugly_numbers = [1]\\n # Initialize a min-heap\\n heap = []\\n \\n # Add the initial primes into the heap\\n for prime in primes:\\n heapq.heappush(heap, (prime, prime, 0)) # (next_value, prime, index_in_ugly_numbers)\\n\\n while len(ugly_numbers) < n:\\n # Pop the smallest element from the heap\\n next_ugly, prime, index = heapq.heappop(heap)\\n # Only add this new number if it's different from the last added to ugly_numbers\\n if next_ugly != ugly_numbers[-1]:\\n ugly_numbers.append(next_ugly)\\n # Push the next value derived from this prime\\n heapq.heappush(heap, (prime * ugly_numbers[index + 1], prime, index + 1))\\n \\n return ugly_numbers[-1]\",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n l = [1]\\n count = 1\\n pcount = len(primes)\\n pointers = [0] * pcount\\n heap = []\\n for i in range(pcount):\\n heapq.heappush(heap, (primes[i], i))\\n while count < n:\\n minimum, i = heapq.heappop(heap)\\n if minimum > l[-1]:\\n l.append(minimum)\\n count += 1\\n if count < n:\\n while l[pointers[i]] * primes[i] <= l[-1]:\\n pointers[i] += 1\\n heapq.heappush(heap, (l[pointers[i]] * primes[i], i))\\n return l[-1]\\n \\n\\n \",\n \"runtime\": \"378\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n l = [1]\\n count = 1\\n pcount = len(primes)\\n pointers = [0] * pcount\\n heap = []\\n for i in range(pcount):\\n heapq.heappush(heap, (primes[i], i))\\n while count < n:\\n minimum, i = heapq.heappop(heap)\\n while l[pointers[i]] * primes[i] <= l[-1]:\\n pointers[i] += 1\\n heapq.heappush(heap, (l[pointers[i]] * primes[i], i))\\n if minimum > l[-1]:\\n l.append(minimum)\\n count += 1\\n return l[-1]\\n \\n\\n \",\n \"runtime\": \"378\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly = [1] * n\\n indices = [0] * len(primes) \\n next_multiple = primes[:] \\n \\n for i in range(1, n):\\n next_ugly = min(next_multiple)\\n ugly[i] = next_ugly\\n \\n for j in range(len(primes)):\\n if next_ugly == next_multiple[j]:\\n indices[j] += 1 \\n next_multiple[j] = ugly[indices[j]] * primes[j]\\n \\n return ugly[-1]\",\n \"runtime\": \"423\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n k = len(primes)\\n indices = [0] * k\\n candidates = [primes[i] for i in range(k)]\\n uglyNumbers = [0] * n\\n uglyNumbers[0] = 1\\n \\n for i in range(1, n):\\n minCandidate = min(candidates)\\n uglyNumbers[i] = minCandidate\\n \\n for j in range(k):\\n if candidates[j] == minCandidate:\\n indices[j] += 1\\n candidates[j] = uglyNumbers[indices[j]] * primes[j]\\n \\n return uglyNumbers[-1]\",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n\\n # create a list to store the super ugly numbers, initialize with 1\\n super_ugly = [1]\\n # create a list to store the indices for each prime number\\n idx = [0] * len(primes)\\n # create a list to store the product of prime numbers with their corresponding indices\\n # this will be used to find the next super ugly number\\n prod = [p for p in primes]\\n \\n # loop until we find the nth super ugly number\\n while len(super_ugly) < n:\\n # find the minimum value in prod, which will be the next super ugly number\\n next_ugly = min(prod)\\n # append it to the list of super ugly numbers\\n super_ugly.append(next_ugly)\\n \\n # update the index for each prime number whose product is equal to next_ugly\\n for i in range(len(primes)):\\n if next_ugly == prod[i]:\\n idx[i] += 1\\n #prod is the exact next iteration of the super ugly number that uses primes[i] in its prime factorization\\n prod[i] = primes[i] * super_ugly[idx[i]]\\n \\n #print(prod)\\n \\n # return the last element in the list of super ugly numbers, which is the nth super ugly number\\n return super_ugly[-1]\",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1] # Initialize the list with the first super ugly number\\n pointers = [0] * len(primes) # Initialize pointers for each prime factor\\n candidates = primes[:] # Initialize candidates with each prime factor\\n\\n while len(ugly_numbers) < n:\\n next_ugly = min(candidates) # Find the next smallest super ugly number\\n ugly_numbers.append(next_ugly) # Append the next super ugly number to the list\\n\\n # Update the pointers and candidates for the next iteration\\n for i in range(len(candidates)):\\n if candidates[i] == next_ugly:\\n pointers[i] += 1\\n candidates[i] = ugly_numbers[pointers[i]] * primes[i]\\n\\n return ugly_numbers[-1] # Return the nth super ugly number\",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1] * n\\n m = len(primes)\\n indexes = [0] * m\\n uglys = primes[:]\\n for i in range(1, n):\\n nxt_ugly = min(uglys)\\n dp[i] = nxt_ugly\\n for j in range(m):\\n if nxt_ugly == uglys[j]:\\n indexes[j] += 1\\n uglys[j] = dp[indexes[j]] * primes[j]\\n return dp[n - 1]\",\n \"runtime\": \"513\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [0] * n \\n dp[0] = 1 \\n index = [0] * len(primes)\\n values = primes[:]\\n for i in range(1,n):\\n dp[i] = min(values)\\n for j in range(len(primes)):\\n if values[j] == dp[i]:\\n index[j] += 1 \\n values[j] = dp[index[j]] * primes[j]\\n \\n return dp[-1]\",\n \"runtime\": \"558\"\n },\n {\n \"code\": \"class Solution:\\n\\n\\tdef _Hamming(self, size: int, primes: list[int]) -> list[int]:\\n\\t\\tres = [0]*size\\n\\t\\tres[0] = 1\\n\\n\\t\\tnext = primes[:]\\n\\t\\tindicies = [0]*len(primes)\\n\\t\\tfor m in range(1, size):\\n\\t\\t\\tres[m] = min(next)\\n\\t\\t\\tfor i in range(0, len(indicies)):\\n\\t\\t\\t\\tif res[m] == next[i]:\\n\\t\\t\\t\\t\\tindicies[i] += 1\\n\\t\\t\\t\\t\\tnext[i] = primes[i]*res[indicies[i]]\\n\\t\\treturn res\\n\\n\\tdef nthSuperUglyNumber(self, n: int, primes: list[int]) -> int:\\n\\t\\treturn self._Hamming(n, primes)[n - 1]\\n\",\n \"runtime\": \"558\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n dp = [1] * (n)\\n\\n\\n indexes = defaultdict(int)\\n\\n\\n copy = primes[:]\\n\\n\\n for i in range(1,n):\\n dp[i] = min(copy)\\n\\n for j in range(len(primes)): \\n prime = copy[j]\\n if dp[i] == prime:\\n indexes[j] += 1\\n copy[j] = primes[j] * dp[indexes[j]]\\n\\n\\n return dp[n-1]\",\n \"runtime\": \"603\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # https://leetcode.com/problems/super-ugly-number/solutions/169815/python-dp-solution-beats-93-7-extremely-detailed-explanation\\n size = len(primes)\\n num, dp, index, ugly_nums = 1, [1], [0]*size, primes[:]\\n for i in range(1, n):\\n dp.append(min(ugly_nums))\\n for j in range(size):\\n if ugly_nums[j] == dp[-1]:\\n index[j] += 1\\n ugly_nums[j] = dp[index[j]] * primes[j]\\n \\n return dp[-1]\",\n \"runtime\": \"603\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n l=len(primes)\\n nex=[]\\n for i in range(l):\\n nex.append(primes[i])\\n i=[0]*l\\n res=[1]\\n while len(res)<n:\\n n1=min(nex)\\n if res[-1]!=n1: \\n res.append(n1)\\n j=nex.index(n1)\\n i[j]+=1\\n nex[j]=res[i[j]]*primes[j]\\n return res[-1]\",\n \"runtime\": \"648\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n\\n ugly_numbers = [1]\\n\\n count = 0\\n seen = set()\\n\\n while len(ugly_numbers) < n and count < n:\\n mini = heapq.heappop(ugly_numbers)\\n for p in primes:\\n if p*mini not in seen:\\n heapq.heappush(ugly_numbers, p * mini)\\n seen.add(p*mini)\\n count += 1\\n\\n maxi = max(ugly_numbers)\\n\\n while count < n:\\n mini = heapq.heappop(ugly_numbers)\\n for p in primes:\\n if p * mini < maxi and p*mini not in seen:\\n heapq.heappush(ugly_numbers, p * mini)\\n seen.add(p*mini)\\n count += 1\\n\\n print(ugly_numbers)\\n\\n return mini\\n\\n # ugly_numbers = [1]\\n \\n # last_used = 0\\n # while len(ugly_numbers) < n:\\n # temp = []\\n # for p in primes:\\n # ugly_numbers.heappush(p * ugly_numbers[last_used])\\n # ugly_numbers = merge(temp, ugly_numbers)\\n # last_used += 1\\n\\n # ugly_numbers = ugly_numbers[:n]\\n # count = 0\\n # while last_used < n:\\n # temp = []\\n # for p in primes:\\n # if p * ugly_numbers[last_used] < ugly_numbers[-1]:\\n # temp.append(p * ugly_numbers[last_used])\\n # if temp != []:\\n # count += 1\\n # ugly_numbers = merge(temp, ugly_numbers)\\n\\n # last_used += 1\\n\\n # print(len(ugly_numbers))\\n # print(ugly_numbers)\\n # return ugly_numbers[last_used-1]\\n\\n\\n\\n\",\n \"runtime\": \"648\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n n_primes = len(primes)\\n pointers = [0 for _ in range(n_primes)]\\n nums = [1]\\n candidates = [nums[pointers[i]]*primes[i] for i in range(n_primes)]\\n for _ in range(1, n):\\n next_num = min(candidates)\\n nums.append(next_num)\\n for i, prime in enumerate(primes):\\n if next_num == prime * nums[pointers[i]]:\\n pointers[i] += 1\\n candidates[i] = nums[pointers[i]]*prime\\n return nums[-1]\\n\",\n \"runtime\": \"694\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes) -> int:\\n from queue import PriorityQueue\\n q = PriorityQueue()\\n for i in range(n):\\n if i < 1:\\n q.put(1) # p_1**0 * .. p_n**0\\n continue\\n x = q.get()\\n for _, p in enumerate(primes):\\n q.put(p * x)\\n if not x % p: break\\n return q.get()\",\n \"runtime\": \"739\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1: return 1\\n multiples = list()\\n for i in range(len(primes)):\\n multiples.append(0)\\n uglies = [1]\\n while len(uglies) < n:\\n multiples, uglies = self.getNext(primes, multiples, uglies)\\n return uglies[n - 1]\\n\\n def getNext(self, primes, multiples, uglies):\\n indices = []\\n low = 2147483647\\n for i in range(len(primes)):\\n curr = primes[i] * uglies[multiples[i]]\\n if curr < low:\\n indices = [i]\\n low = curr\\n elif curr == low:\\n indices.append(i)\\n for i in indices:\\n multiples[i] += 1\\n uglies.append(low)\\n return multiples, uglies\",\n \"runtime\": \"784\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1] * n\\n m = len(primes)\\n indexes = [0] * m\\n uglys = primes[:]\\n for i in range(1, n):\\n nxt_ugly = min(uglys)\\n dp[i] = nxt_ugly\\n for j in range(m):\\n if nxt_ugly == uglys[j]:\\n indexes[j] += 1\\n uglys[j] = dp[indexes[j]] * primes[j]\\n return dp[n - 1]\\n\\n\\nfrom heapq import heappop, heappush\\n\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n pq = [1]\\n m = len(primes)\\n for _ in range(n):\\n ans = heappop(pq)\\n for i in range(m - 1, 0, -1):\\n if ans % primes[i] == 0:\\n for j in range(i, m):\\n heappush(pq, ans * primes[j])\\n break\\n else:\\n for j in range(m):\\n heappush(pq, ans * primes[j])\\n return ans\\n\",\n \"runtime\": \"829\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1] * n \\n\\n size = len(primes)\\n idx = [0] * size\\n ugly_by_prime = [prime for prime in primes]\\n\\n for i in range(1, n):\\n next_ugly_prime = min(ugly_by_prime)\\n dp[i] = next_ugly_prime\\n\\n for j in range(size):\\n if next_ugly_prime == ugly_by_prime[j]:\\n idx[j] += 1\\n ugly_by_prime[j] = dp[idx[j]] * primes[j]\\n return dp[-1] \\n\",\n \"runtime\": \"874\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n num = len(primes)\\n index = [0 for i in range(num)]\\n ans = [1]\\n \\n for i in range(n-1):\\n temp = ans[index[0]] * primes[0]\\n temp_idx = 0\\n for j in range(1, num):\\n temp_res = ans[index[j]] * primes[j]\\n if temp_res == ans[-1]:\\n index[j] += 1\\n temp_res = ans[index[j]] * primes[j]\\n if temp_res < temp:\\n temp = temp_res\\n temp_idx = j\\n index[temp_idx] += 1\\n ans.append(temp)\\n #print(ans)\\n \\n return ans[-1]\\n \",\n \"runtime\": \"919\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n <= 0:\\n return -1\\n elif n == 1:\\n return 1\\n dp, pos = [0] * n, defaultdict(int)\\n dp[0] = 1\\n for prime in primes:\\n pos[prime] = 0 # initial position for all prime numbers\\n\\n for i in range(1, n):\\n minv, target_primes = None, []\\n for prime in primes:\\n index = pos[prime]\\n v = dp[index] * prime\\n if not minv or minv > v:\\n minv = v\\n target_primes = [prime]\\n elif minv == v:\\n target_primes.append(prime)\\n dp[i] = minv\\n for prime in target_primes:\\n pos[prime] += 1\\n return dp[n - 1]\",\n \"runtime\": \"919\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = []\\n heapq.heappush(heap, 1)\\n uglyNumber = -1\\n \\n while n != 0:\\n uglyNumber = heapq.heappop(heap)\\n\\n heapq.heappush(heap, uglyNumber * primes[-1])\\n for index in range(len(primes) - 2, -1, -1):\\n if uglyNumber % primes[index + 1] == 0: break\\n heapq.heappush(heap, uglyNumber * primes[index])\\n n -= 1\\n \\n return uglyNumber\",\n \"runtime\": \"964\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n k = len(primes)\\n nums = [1]\\n indices = [0] * k\\n\\n while len(nums) < n:\\n nexts = [0] * k\\n for i in range(k):\\n nexts[i] = nums[indices[i]] * primes[i]\\n next = min(nexts)\\n for i in range(k):\\n if next == nexts[i]:\\n indices[i] += 1\\n nums.append(next)\\n\\n return nums[-1]\\n \",\n \"runtime\": \"1009\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: list[int]) -> int:\\n k = len(primes)\\n nums = [1]\\n indices = [0] * k\\n\\n while len(nums) < n:\\n nexts = [0] * k\\n for i in range(k):\\n nexts[i] = nums[indices[i]] * primes[i]\\n next = min(nexts)\\n for i in range(k):\\n if next == nexts[i]:\\n indices[i] += 1\\n nums.append(next)\\n\\n return nums[-1]\",\n \"runtime\": \"1009\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1] * n\\n indices = [0] * len(primes)\\n \\n for i in range(1, n):\\n next_numbers = [0] * len(primes)\\n for j in range(len(primes)):\\n next_numbers[j] = ugly_numbers[indices[j]] * primes[j]\\n ugly_numbers[i] = min(next_numbers)\\n for j in range(len(primes)): \\n if ugly_numbers[i] == next_numbers[j]:\\n indices[j] += 1\\n \\n return ugly_numbers[n - 1]\",\n \"runtime\": \"1055\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Initialize dp array and pointers for each prime\\n dp = [0] * n\\n dp[0] = 1\\n pointers = [0] * len(primes)\\n \\n for i in range(1, n):\\n # Calculate the next super ugly numbers based on current pointers\\n next_values = [dp[pointers[j]] * primes[j] for j in range(len(primes))]\\n next_ugly = min(next_values)\\n dp[i] = next_ugly\\n \\n # Update pointers\\n for j in range(len(primes)):\\n if next_ugly == next_values[j]:\\n pointers[j] += 1\\n \\n return dp[-1]\\n\",\n \"runtime\": \"1055\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n <= 0:\\n return -1\\n ugly = [1]\\n indexes = [0] * len(primes)\\n values = []\\n while len(ugly) < n:\\n values = [ugly[indexes[i]] * primes[i] for i in range(len(primes))]\\n next_val = min(values)\\n ugly.append(next_val)\\n for i in range(len(primes)):\\n if values[i] == next_val:\\n indexes[i] += 1\\n return ugly[-1]\",\n \"runtime\": \"1100\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1]\\n pointers = [0] * len(primes)\\n while len(ugly_numbers) < n:\\n candidates = [ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes))]\\n next_ugly = min(candidates)\\n ugly_numbers.append(next_ugly)\\n for i in range(len(primes)):\\n if candidates[i] == next_ugly:\\n pointers[i] += 1\\n return ugly_numbers[-1]\",\n \"runtime\": \"1100\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n res=[1]\\n m=len(primes)\\n pointers=[0]*m\\n for i in range(n-1):\\n values=[]\\n for j in range(m):\\n values.append(res[pointers[j]]*primes[j])\\n minValue=min(values)\\n res.append(minValue)\\n for j in range(m):\\n if values[j]==minValue:\\n pointers[j]+=1\\n return res[-1]\\n\",\n \"runtime\": \"1145\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n arr = [1]\\n l = len(primes)\\n pointers = [0] * l\\n for _ in range(n - 1):\\n next_num = []\\n for i in range(l):\\n next_num.append(arr[pointers[i]] * primes[i])\\n min_num = min(next_num)\\n arr.append(min_num)\\n for i in range(l):\\n if next_num[i] == min_num:\\n pointers[i] +=1\\n return arr[-1]\\n\",\n \"runtime\": \"1145\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n pq = [1]\\n m = len(primes)\\n idx = [0] * m\\n for _ in range(n - 1):\\n tmp = [primes[j] * pq[idx[j]] for j in range(m)]\\n b = min(tmp)\\n pq.append(b)\\n for j, c in enumerate(tmp):\\n if c == b:\\n idx[j] += 1\\n return pq[-1]\",\n \"runtime\": \"1190\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n uglyNumbers = [0] * n\\n uglyNumbers[0] = 1\\n indexes = [0] * len(primes)\\n maxContained = 1\\n\\n for i in range(1, len(uglyNumbers)):\\n minIdx = -1\\n minUglyNumber = float(\\\"inf\\\")\\n for idx, p in enumerate(primes):\\n while primes[idx] * uglyNumbers[indexes[idx]] <= maxContained:\\n indexes[idx] +=1\\n \\n if primes[idx] * uglyNumbers[indexes[idx]] < minUglyNumber:\\n minUglyNumber = primes[idx] * uglyNumbers[indexes[idx]]\\n minIdx = idx\\n\\n uglyNumbers[i] = primes[minIdx] * uglyNumbers[indexes[minIdx]]\\n maxContained= max(maxContained, uglyNumbers[i])\\n indexes[minIdx] +=1\\n \\n return uglyNumbers[-1]\",\n \"runtime\": \"1190\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n super_ugly = [1]\\n l = len(primes)\\n idx = [0] * l\\n while len(super_ugly) < n:\\n nxt = [super_ugly[i] * p for i, p in zip(idx, primes)]\\n super_ugly.append(min(nxt))\\n for i in range(l):\\n if nxt[i] == super_ugly[-1]:\\n idx[i] += 1\\n return super_ugly[-1]\\n\",\n \"runtime\": \"1235\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n\\n uglyNums = [0] * n\\n uglyNums[0] = 1\\n candidate = [0] * (max(primes) + 1)\\n\\n for i in range(1, n):\\n uglyNums[i] = min([uglyNums[candidate[x]]*x for x in primes])\\n for x in primes:\\n if uglyNums[i] == uglyNums[candidate[x]]*x:\\n candidate[x] += 1\\n\\n return uglyNums[n - 1]\",\n \"runtime\": \"1235\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n pointers = [0 for i in range(len(primes))]\\n uglyList = [0 for i in range(n + 1)]\\n uglyList[0] = 1\\n for i in range(1, n + 1):\\n nextUgly = primes[0] * uglyList[pointers[0]]\\n pointerIndex = 0\\n for j in range(len(primes)):\\n if primes[j] * uglyList[pointers[j]] == uglyList[i - 1]:\\n pointers[j] += 1\\n if primes[j] * uglyList[pointers[j]] < nextUgly:\\n nextUgly = ( primes[j] * uglyList[pointers[j]] )\\n pointerIndex= j\\n uglyList[i] = nextUgly\\n pointers[pointerIndex] += 1\\n #print(uglyList)\\n return uglyList[n - 1]\",\n \"runtime\": \"1280\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n dp=[0]*(n)\\n dp[0]=1\\n \\n \\n l1=[0]*len(primes)\\n \\n for i in range(1,n):\\n min1=float('inf')\\n for j in range(len(primes)):\\n if(primes[j]*dp[l1[j]]<min1):\\n min1=primes[j]*dp[l1[j]]\\n dp[i]=min1\\n for p in range(len(primes)):\\n if(primes[p]*dp[l1[p]]==min1):\\n l1[p]+=1\\n return dp[n-1]\\n\\n\",\n \"runtime\": \"1280\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n\\n dp = [1] * (n+1)\\n primes_index = [1] * len(primes)\\n\\n # loop\\n for i in range(2, n+1):\\n dp[i] = min([dp[j]*primes[idx] for idx, j in enumerate(primes_index)])\\n for idx, j in enumerate(primes):\\n if dp[i] % j == 0:\\n primes_index[idx] += 1\\n \\n return dp[-1]\\n \\n \",\n \"runtime\": \"1325\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans = [1]\\n p = len(primes)\\n pm = [0]*(p+1)\\n while len(ans) != n:\\n mm = float('inf')\\n pv = []\\n for i in range(p):\\n if ans[-1] < primes[i]*ans[pm[i]] < mm:\\n mm = primes[i]*ans[pm[i]]\\n pv = [i]\\n elif primes[i]*ans[pm[i]] == mm:\\n pv.append(i)\\n # print(mm, pv, primes[pv], pm)\\n ans.append(mm)\\n for ppv in pv:\\n pm[ppv] += 1\\n # print(ans)\\n return ans[-1]\",\n \"runtime\": \"1325\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n '''\\n curr = [0] * len(primes)\\n '''\\n res = [1]\\n curr = [0] * len(primes)\\n while len(res) < n:\\n min_value = min([res[curr[i]]*primes[i] for i in range(len(primes))])\\n res.append(min_value)\\n for i in range(len(primes)):\\n if res[curr[i]]*primes[i] == min_value:\\n curr[i] += 1\\n\\n return res[-1] \\n \",\n \"runtime\": \"1370\"\n },\n {\n \"code\": \"from heapq import heappop, heappush\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [(1, 0)]\\n while n:\\n if n == 1:\\n return heap[0][0]\\n element, start_index = heappop(heap)\\n for current_index, prime in enumerate(primes[start_index:], start=start_index):\\n heappush(heap, (element * prime, current_index))\\n n -= 1\\n return -1\",\n \"runtime\": \"1370\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1]\\n pointers = [0] * len(primes)\\n while len(ugly_numbers) < n:\\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\\n ugly_numbers.append(next_ugly)\\n for i in range(len(primes)):\\n if next_ugly == ugly_numbers[pointers[i]] * primes[i]:\\n pointers[i] += 1\\n return ugly_numbers[-1]\",\n \"runtime\": \"1416\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1]\\n pointers = [0] * len(primes)\\n while len(ugly_numbers) < n:\\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\\n ugly_numbers.append(next_ugly)\\n for i in range(len(primes)):\\n if next_ugly == ugly_numbers[pointers[i]] * primes[i]:\\n pointers[i] += 1\\n return ugly_numbers[-1]\",\n \"runtime\": \"1416\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans = [1]\\n ans_set = set()\\n ans_set.add(1)\\n prime_multipliers = [0 for _ in range(len(primes))]\\n count = 0\\n while n > len(ans):\\n min_val = None\\n i_next = None\\n for i in range(len(primes)):\\n # while primes[i]*ans[prime_multipliers[i]] in ans_set:\\n # prime_multipliers[i]+=1\\n if primes[i]*ans[prime_multipliers[i]] == ans[-1]:\\n prime_multipliers[i]+=1\\n prime_mul = primes[i]*ans[prime_multipliers[i]]\\n if (min_val == None or prime_mul<min_val):\\n min_val = prime_mul\\n i_next = i\\n ans.append(min_val)\\n ans_set.add(min_val)\\n prime_multipliers[i_next]+=1\\n return ans[n-1]\\n\",\n \"runtime\": \"1461\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans = [1]\\n prime_multipliers = [0 for _ in range(len(primes))]\\n count = 0\\n while n > len(ans):\\n min_val = None\\n i_next = None\\n for i in range(len(primes)):\\n if primes[i]*ans[prime_multipliers[i]] == ans[-1]:\\n prime_multipliers[i]+=1\\n prime_mul = primes[i]*ans[prime_multipliers[i]]\\n if (min_val == None or prime_mul<min_val):\\n min_val = prime_mul\\n i_next = i\\n ans.append(min_val)\\n prime_multipliers[i_next]+=1\\n return ans[n-1]\\n\",\n \"runtime\": \"1461\"\n },\n {\n \"code\": \"import heapq\\nfrom collections import deque\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n primes.sort()\\n lists = []\\n q = []\\n for i, p in enumerate(primes):\\n lists.append(deque([p]))\\n q.append((p, i))\\n heapq.heapify(q)\\n qsize = len(primes)\\n\\n i = 1\\n s = 1\\n while i < n:\\n t = heapq.heappop(q)\\n lists[t[1]].popleft()\\n\\n if t[0] == s:\\n if lists[t[1]]:\\n heapq.heappush(q, (lists[t[1]][0], t[1]))\\n continue\\n s = t[0]\\n # print(i, s, t[1])\\n \\n for j, p in enumerate(primes):\\n if i + len(lists[j]) <= n:\\n lists[j].append(s * p)\\n\\n if len(lists[j]) == 1:\\n heapq.heappush(q, (lists[j][0], j))\\n\\n if len(lists[t[1]]) > 1:\\n heapq.heappush(q, (lists[t[1]][0], t[1]))\\n # print(q)\\n i += 1\\n\\n return s\\n \",\n \"runtime\": \"1506\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n uglies = [1]\\n ptrs = [0] * len(primes)\\n \\n for curr in range(1, n):\\n min_n = min([primes[i] * uglies[ptrs[i]] for i in range(len(primes))])\\n uglies.append(min_n)\\n for i, p in enumerate(primes):\\n if uglies[curr] == p * uglies[ptrs[i]]: ptrs[i] += 1\\n \\n return uglies[-1]\\n\\n\\\"\\\"\\\"\\nuglies := make([]int, n)\\n uglies[0] = 1\\n ptrs := make([]int, len(primes))\\n curr := 1\\n\\n for curr < n {\\n uglies[curr] = min(a * uglies[ia], b * uglies[ib], c * uglies[ic])\\n if uglies[curr] == a * uglies[ia] { ia++ }\\n if uglies[curr] == b * uglies[ib] { ib++ }\\n if uglies[curr] == c * uglies[ic] { ic++ }\\n curr++\\n }\\n fmt.Println(uglies)\\n return uglies[n]\\n\\\"\\\"\\\"\",\n \"runtime\": \"1506\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [0]*n\\n dp[0] = 1\\n pointer = [0]*len(primes)\\n for i in range(1,n):\\n dp[i] = min([dp[pointer[k]]*primes[k] for k in range(len(primes))])\\n for k in range(len(primes)):\\n if dp[i]==dp[pointer[k]]*primes[k]:\\n pointer[k]+=1\\n \\n return dp[n-1]\",\n \"runtime\": \"1551\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n factors = dict.fromkeys(primes, 0)\\n ugly_nums = [1]\\n for count in range(n-1):\\n new_num = min(map(lambda x: x[0]*ugly_nums[x[1]], factors.items()))\\n for prime, idx in factors.items():\\n if new_num == prime*ugly_nums[idx]:\\n factors[prime] += 1\\n ugly_nums.append(new_num)\\n return ugly_nums[-1]\\n\\n \",\n \"runtime\": \"1551\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly = [(1, 1)]\\n indice = [0] * len(primes)\\n\\n for _ in range(n):\\n for i in range(len(primes)):\\n prime = primes[i]\\n mult = ugly[indice[i]][0]\\n if i == 0:\\n ugly.append((prime * mult, i))\\n else:\\n if prime * mult < ugly[-1][0]:\\n ugly[-1] = (prime * mult, i)\\n elif prime * mult == ugly[-1][0]:\\n indice[i] += 1\\n indice[ugly[-1][1]] += 1\\n\\n return ugly[n - 1][0]\\n\",\n \"runtime\": \"1596\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans = [1]\\n ptr = [0]*len(primes) \\n for _ in range(1, n): \\n ans.append(min(ans[ptr[i]]*p for i, p in enumerate(primes)))\\n for i, p in enumerate(primes):\\n if ans[ptr[i]] * p == ans[-1]: ptr[i] += 1\\n return ans[-1]\",\n \"runtime\": \"1596\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap=[1]\\n c=1\\n prev=0\\n while(heap and c<=n):\\n num=heapq.heappop(heap)\\n if(prev!=num):\\n for i in primes:\\n heapq.heappush(heap,num*i)\\n c+=1\\n prev=num\\n return num\",\n \"runtime\": \"1641\"\n },\n {\n \"code\": \"# key idea. the brute force inefficiently goes from one super ugly\\n# number to the next, by just going through every number and \\n# checking it. however, there might be a shortcut with this key idea.\\n# every super ugly number in the sequence has the same set of prime \\n# factors. wait. so we know if we take a super ugly number and \\n# multiply it by those factors, we get a bigger super ugly number.\\n# but we don't know if it is necessarily the next super ugly number.\\n# so using a heap allows us to repeatedly find the next super ugly number.\\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\\n# But that is way way way better in terms of time. and space probably a bit worse\\n# but that's okay. this is kind of like how we use a heap to merge \\n# k sorted lists. prime factorization theorem is also useful in visualizing this.\\n\\n\\n# [2,7,13,19]\\n# [1,2,4,7,8,13,14,16,19,26,28,32]\\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\\n\\n# [8 13 14 19 26 28 38 49 52 76]\\n# 1 2 4 7\\n\\nfrom heapq import *\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [1]\\n res = []\\n while len(res) != n:\\n curr = heappop(min_heap)\\n while res and curr == res[-1]:\\n curr = heappop(min_heap)\\n res.append(curr)\\n for prime in primes:\\n heappush(min_heap, prime * curr)\\n print(res)\\n return res[-1]\",\n \"runtime\": \"1641\"\n },\n {\n \"code\": \"import heapq as hq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n h = [1]\\n c = 0\\n x = 0\\n while c < n:\\n while h[0] == x:\\n hq.heappop(h)\\n x = hq.heappop(h)\\n c += 1\\n for p in primes:\\n hq.heappush(h, x * p)\\n return x\",\n \"runtime\": \"1686\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n prev = 1\\n if n == 1: return prev\\n heap = primes[:]\\n heapq.heapify(heap)\\n n -= 1\\n while n > 0:\\n val = heapq.heappop(heap)\\n if val != prev:\\n prev = val\\n for prime in primes:\\n heapq.heappush(heap, prime*prev)\\n n -= 1\\n return prev\\n\",\n \"runtime\": \"1686\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n<=2:\\n return n\\n lp = len(primes)\\n ne = [ [p] for p in primes ]\\n cand = [ (p,i) for i,p in enumerate(primes) ]\\n heapq.heapify(cand)\\n cnt = 2\\n while True:\\n #print(\\\"\\\\n\\\", cnt)\\n #print(ne)\\n #print(cand)\\n pv,ps = heapq.heappop(cand)\\n if cnt == n:\\n return pv\\n cnt += 1\\n ne[ps].pop(0)\\n for psi in range(ps,lp):\\n v = pv*primes[psi]\\n ne[psi].append(v)\\n heapq.heappush(cand, (ne[ps][0],ps))\\n \\n \",\n \"runtime\": \"1731\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n pointers = [0 for _ in range(len(primes))]\\n nums = [0 for _ in range(n)]\\n nums[0] = 1\\n\\n for i in range(1, n):\\n minIdx = 0\\n\\n for j in range(len(pointers)):\\n if (nums[pointers[j]] * primes[j]) < (nums[pointers[minIdx]] * primes[minIdx]):\\n minIdx = j\\n \\n minValue = nums[pointers[minIdx]] * primes[minIdx]\\n\\n for j in range(len(pointers)):\\n if nums[pointers[j]] * primes[j] == minValue:\\n pointers[j] += 1\\n\\n nums[i] = minValue\\n\\n return nums[-1]\\n \",\n \"runtime\": \"1731\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1: return 1\\n \\n hq = [1]\\n heapq.heapify(hq)\\n last = None\\n while n > 0:\\n now = heapq.heappop(hq)\\n while len(hq) and last == now:\\n now = heapq.heappop(hq)\\n last = now\\n for p in primes:\\n heapq.heappush(hq, p * now)\\n n -= 1\\n \\n return last\\n\\n\",\n \"runtime\": \"1777\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Build a min-heap of all ugly numbers, starting with 1\\n ug_nums = [1]\\n # Track duplicates\\n seen = set()\\n count = 0\\n while True:\\n # use the minimum ugly number as a seed\\n seed = heapq.heappop(ug_nums)\\n # check that the seed hasn't been used before\\n while seed in seen:\\n seed = heapq.heappop(ug_nums)\\n count +=1\\n seen.add(seed)\\n if count == n:\\n return seed\\n # Multiply the seed by each prime and add results to min-heap\\n for prime in primes:\\n heapq.heappush(ug_nums,seed*prime)\\n\",\n \"runtime\": \"1777\"\n },\n {\n \"code\": \"import heapq as hq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n h = [1]\\n c = 0\\n x = 0\\n while c < n:\\n while h[0] == x:\\n hq.heappop(h)\\n x = hq.heappop(h)\\n c += 1\\n for p in primes:\\n hq.heappush(h, x * p)\\n return x\",\n \"runtime\": \"1822\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n a = [1]\\n heapq.heapify(a)\\n ans = 1\\n s =set()\\n while n>0:\\n ans = heapq.heappop(a)\\n if(ans in s):\\n continue\\n s.add(ans)\\n n-=1\\n for p in primes:\\n heapq.heappush(a,ans*p)\\n return ans\\n\\n \",\n \"runtime\": \"1822\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) :\\n \\n memo = [1] \\n pointers = [0] * len(primes) \\n\\n def recursive_find(k):\\n if k < len(memo):\\n return memo[k]\\n \\n next_vals = [primes[i] * memo[pointers[i]] for i in range(len(primes))]\\n next_val = min(next_vals)\\n memo.append(next_val)\\n \\n for i in range(len(primes)):\\n if next_val == primes[i] * memo[pointers[i]]:\\n pointers[i] += 1\\n \\n return recursive_find(k)\\n \\n return recursive_find(n - 1)\\n\",\n \"runtime\": \"1867\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n numbers = [1]\\n candidates = []\\n \\n for _ in range(n):\\n for p in primes:\\n heapq.heappush(candidates, numbers[-1] * p)\\n while len(candidates) > 0:\\n new_number = heapq.heappop(candidates)\\n if numbers[-1] != new_number:\\n numbers.append(new_number)\\n break\\n \\n return numbers[n-1]\\n\",\n \"runtime\": \"1867\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n queue=[1]\\n visited=set()\\n \\n for i in primes:\\n \\n heapq.heappush(queue,i)\\n \\n i=0\\n while queue:\\n \\n node=heapq.heappop(queue)\\n if node>2147483647 or node in visited:\\n continue\\n \\n i+=1\\n if i==n:\\n return node\\n visited.add(node)\\n for p in primes:\\n heapq.heappush(queue,p*node)\\n\\n \",\n \"runtime\": \"1912\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n m = len(primes)\\n primesMulti =[0] * m\\n res = [1]\\n for i in range(1, n):\\n current = res[primesMulti[0]] * primes[0]\\n for j in range(1,m):\\n current = min(res[primesMulti[j]] * primes[j], current)\\n for j in range(m):\\n if current == res[primesMulti[j]] * primes[j]:\\n primesMulti[j] +=1\\n res.append(current)\\n return res[-1]\\n\\n \",\n \"runtime\": \"1912\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n arr=[1]\\n d={}\\n for i in primes:\\n d[i]=[0,0]\\n for i in range(1,n):\\n m=float('inf')\\n for i,j in d.items():\\n j[1]=i*arr[j[0]]\\n m=min(m,j[1])\\n arr.append(m)\\n for i,j in d.items():\\n if m==j[1]:\\n j[0]+=1\\n return arr[-1]\",\n \"runtime\": \"1957\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n assert(n > 0)\\n\\n pows = [0] * len(primes)\\n\\n ugs = [1]\\n for _ in range(n - 1):\\n next_ug = float('inf')\\n for i in range(len(primes)):\\n next_ug = min(next_ug, primes[i] * ugs[pows[i]])\\n \\n for i in range(len(pows)):\\n if primes[i] * ugs[pows[i]] == next_ug:\\n pows[i] += 1\\n\\n ugs.append(next_ug)\\n \\n return ugs[-1]\",\n \"runtime\": \"1957\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n p=len(primes)\\n idx=[0]*p\\n dp=[0]*n\\n dp[0]=1\\n for i in range(1,n):\\n uglynum=float('inf')\\n for j in range(p):\\n uglynum=min(uglynum,dp[idx[j]]*primes[j])\\n dp[i]=uglynum\\n for j in range(p):\\n if uglynum==dp[idx[j]]*primes[j]:\\n idx[j]+=1\\n return dp[-1]\",\n \"runtime\": \"2002\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n m = len(primes)\\n factors = [0 for i in range(m)]\\n ans = [1]\\n x = 1\\n while x < n :\\n minx = float(\\\"inf\\\")\\n for i in range(m):\\n minx = min(minx,ans[factors[i]]*primes[i] )\\n for i in range(m):\\n if ans[factors[i]]*primes[i] == minx:\\n factors[i] += 1\\n ans.append(minx) \\n x = len(ans)\\n # print(ans)\\n return ans[n-1]\",\n \"runtime\": \"2002\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1]*(n+1)\\n m = len(primes)\\n primesIdx = [1]*m\\n \\n for i in range(2,n+1):\\n minimum = sys.maxsize\\n for j,prime in enumerate(primes):\\n minimum = min(minimum,prime*dp[primesIdx[j]])\\n dp[i] = minimum\\n for j,prime in enumerate(primes):\\n if prime*dp[primesIdx[j]] == minimum:\\n primesIdx[j]+=1\\n \\n return dp[-1] \\n # dp = [1]*(n+1)\\n # minH = [[prime,1,prime] for prime in primes]\\n # i = 2\\n # while i<=n:\\n # val,idx,prime = heapq.heappop(minH)\\n # if dp[i-1]!=val:\\n # dp[i] = val\\n # i+=1\\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\\n\\n # return dp[-1] \\n\\n '''\\n dp = [1]*(1+n)\\n minHeap = []\\n for i,prime in enumerate(primes):\\n heapq.heappush(minHeap,[prime,1,prime]) #(val,idx,prime)\\n \\n i = 2\\n while i<=n:\\n val,idx,prime = heapq.heappop(minHeap)\\n if dp[i-1]!=val:\\n dp[i] = val\\n i+=1\\n heapq.heappush(minHeap,[prime*dp[idx+1],idx+1,prime])\\n return dp[-1] \\n '''\\n '''\\n dp = [1]*(n+1)\\n m = len(primes)\\n primesIdx = [1]*m\\n \\n for i in range(2,n+1):\\n minimum = float('inf')\\n for j,prime in enumerate(primes):\\n minimum = min(minimum,prime*dp[primesIdx[j]])\\n dp[i] = minimum\\n for j,prime in enumerate(primes):\\n if prime*dp[primesIdx[j]] == minimum:\\n primesIdx[j]+=1\\n \\n return dp[-1]\\n ''' \\n \\n \\n \",\n \"runtime\": \"2047\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n indices = [0] * len(primes)\\n dp = [1] * n\\n for i in range(1, n):\\n minimum = inf\\n for j in range(len(primes)):\\n minimum = min(minimum, primes[j] * dp[indices[j]])\\n\\n dp[i] = minimum\\n for j in range(len(primes)):\\n if primes[j] * dp[indices[j]] == minimum:\\n indices[j] += 1\\n\\n return dp[n-1]\",\n \"runtime\": \"2047\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1]*(n+1)\\n m = len(primes)\\n primeIdx = [1]*m\\n\\n for i in range(2,n+1):\\n minimum = sys.maxsize\\n for j,p in enumerate(primes): minimum = min(minimum,p*dp[primeIdx[j]])\\n dp[i] = minimum\\n for j,p in enumerate(primes):\\n if p*dp[primeIdx[j]] == minimum: primeIdx[j]+=1\\n\\n return dp[-1] \\n\\n # dp = [1]*(n+1)\\n # i = 2\\n # minH = [[p,1,p] for p in primes]\\n # while i<=n:\\n # val,idx,prime = heapq.heappop(minH)\\n # if dp[i-1]!= val:\\n # dp[i] = val\\n # i+=1\\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\\n # return dp[-1] \\n\\n # dp = [1]*(n+1)\\n # minH = [[prime,1,prime] for prime in primes]\\n # i = 2\\n # while i<=n:\\n # val,idx,prime = heapq.heappop(minH)\\n # if dp[i-1]!=val:\\n # dp[i] = val\\n # i+=1\\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\\n\\n # return dp[-1] \\n\\n '''\\n dp = [1]*(1+n)\\n minHeap = []\\n for i,prime in enumerate(primes):\\n heapq.heappush(minHeap,[prime,1,prime]) #(val,idx,prime)\\n \\n i = 2\\n while i<=n:\\n val,idx,prime = heapq.heappop(minHeap)\\n if dp[i-1]!=val:\\n dp[i] = val\\n i+=1\\n heapq.heappush(minHeap,[prime*dp[idx+1],idx+1,prime])\\n return dp[-1] \\n '''\\n '''\\n dp = [1]*(n+1)\\n m = len(primes)\\n primesIdx = [1]*m\\n \\n for i in range(2,n+1):\\n minimum = float('inf')\\n for j,prime in enumerate(primes):\\n minimum = min(minimum,prime*dp[primesIdx[j]])\\n dp[i] = minimum\\n for j,prime in enumerate(primes):\\n if prime*dp[primesIdx[j]] == minimum:\\n primesIdx[j]+=1\\n \\n return dp[-1]\\n ''' \\n \\n \\n \",\n \"runtime\": \"2092\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [0] * n\\n dp[0] = 1\\n resArr = [0] * len(primes)\\n for i in range(1, n):\\n res = float(\\\"inf\\\")\\n for j, v in enumerate(primes):\\n res = min(res, dp[resArr[j]] * v)\\n\\n dp[i] = res\\n for k, v in enumerate(primes):\\n if dp[i] == dp[resArr[k]] * v:\\n resArr[k] += 1\\n\\n return dp[n - 1]\",\n \"runtime\": \"2092\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int: \\n dp = [1]*(n+1)\\n m = len(primes)\\n primeIdx = [1]*m\\n\\n for i in range(2,n+1):\\n minimum = sys.maxsize\\n for j,p in enumerate(primes): minimum = min(minimum,p*dp[primeIdx[j]])\\n for j,p in enumerate(primes):\\n if p*dp[primeIdx[j]]==minimum: primeIdx[j]+=1\\n dp[i] = minimum \\n return dp[-1] \\n\\n # dp = [1]*(n+1)\\n # i = 2\\n # minH = [[p,1,p] for p in primes]\\n # while i<=n:\\n # val,idx,prime = heapq.heappop(minH)\\n # if dp[i-1]!= val:\\n # dp[i] = val\\n # i+=1\\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\\n # return dp[-1] \\n\\n # dp = [1]*(n+1)\\n # minH = [[prime,1,prime] for prime in primes]\\n # i = 2\\n # while i<=n:\\n # val,idx,prime = heapq.heappop(minH)\\n # if dp[i-1]!=val:\\n # dp[i] = val\\n # i+=1\\n # heapq.heappush(minH,[prime*dp[idx+1],idx+1,prime])\\n\\n # return dp[-1] \\n\\n '''\\n dp = [1]*(1+n)\\n minHeap = []\\n for i,prime in enumerate(primes):\\n heapq.heappush(minHeap,[prime,1,prime]) #(val,idx,prime)\\n \\n i = 2\\n while i<=n:\\n val,idx,prime = heapq.heappop(minHeap)\\n if dp[i-1]!=val:\\n dp[i] = val\\n i+=1\\n heapq.heappush(minHeap,[prime*dp[idx+1],idx+1,prime])\\n return dp[-1] \\n '''\\n '''\\n dp = [1]*(n+1)\\n m = len(primes)\\n primesIdx = [1]*m\\n \\n for i in range(2,n+1):\\n minimum = float('inf')\\n for j,prime in enumerate(primes):\\n minimum = min(minimum,prime*dp[primesIdx[j]])\\n dp[i] = minimum\\n for j,prime in enumerate(primes):\\n if prime*dp[primesIdx[j]] == minimum:\\n primesIdx[j]+=1\\n \\n return dp[-1]\\n ''' \\n \\n \\n \",\n \"runtime\": \"2138\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n res = [0]*n\\n ptrs = defaultdict(int)\\n res[0]=1\\n for i in range(1,n):\\n nxt = float(\\\"inf\\\")\\n for prime in primes:\\n nxt = min(res[ptrs[prime]]*prime,nxt)\\n for prime in primes:\\n if nxt==res[ptrs[prime]]*prime:\\n ptrs[prime]+=1\\n res[i]=nxt\\n return res[n-1]\\n\\n \",\n \"runtime\": \"2138\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n helper=[0]*len(primes)\\n res=[float('inf')]*n\\n res[0]=1\\n for i in range(1, n):\\n for j in range(len(primes)):\\n res[i]=min(res[i], res[helper[j]]*primes[j])\\n for j in range(len(primes)):\\n if res[i]==res[helper[j]]*primes[j]:\\n helper[j]+=1\\n return res[-1]\",\n \"runtime\": \"2183\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n l = [1]\\n count = 1\\n pcount = len(primes)\\n pointers = [0] * pcount\\n while count < n:\\n minimum = l[-1] * primes[-1]\\n for i in range(pcount):\\n while l[pointers[i]] * primes[i] <= l[-1]:\\n pointers[i] += 1\\n minimum = min(minimum, l[pointers[i]] * primes[i])\\n l.append(minimum)\\n count += 1\\n return l[-1]\\n \\n\\n \",\n \"runtime\": \"2183\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n for i in range(len(primes)):\\n primes[i] = [primes[i], 0]\\n\\n\\n\\n\\n dp = [1]\\n\\n while len(dp) < n:\\n\\n next = float(\\\"inf\\\")\\n\\n for i in range(len(primes)):\\n next = min(next, dp[primes[i][1]] * primes[i][0])\\n\\n dp.append(next)\\n\\n for i in range(len(primes)):\\n\\n if next == dp[primes[i][1]] * primes[i][0]:\\n primes[i][1] += 1\\n\\n\\n return dp[-1]\",\n \"runtime\": \"2228\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n '''\\n Use the index of the preivous prime numbers we have processed\\n\\n '''\\n state = [1]\\n size = len(primes)\\n inds = [0 for _ in range(size)]\\n\\n while len(state) < n:\\n minVal = float('inf')\\n for i in range(size):\\n prime = primes[i]\\n ind = inds[i]\\n prevPrime = state[ind]\\n minVal = min(minVal, prevPrime * prime)\\n \\n for i in range(size):\\n prime = primes[i]\\n ind = inds[i]\\n prevPrime = state[ind]\\n if minVal == prevPrime * prime:\\n inds[i] += 1\\n \\n state.append(minVal)\\n \\n \\n return state[-1]\",\n \"runtime\": \"2273\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n sugly=[]\\n sugly.append(1)\\n p_ind=[0]*len(primes)\\n while(len(sugly)<n):\\n p=-1\\n mi=sugly[-1]*primes[-1]+5\\n for i in range(len(primes)):\\n if(sugly[p_ind[i]]*primes[i]<mi):\\n mi=sugly[p_ind[i]]*primes[i]\\n p=i\\n if(mi>sugly[-1]):\\n sugly.append(mi)\\n p_ind[p]+=1\\n return sugly[-1]\\n\\n\\n\",\n \"runtime\": \"2273\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n==1:\\n return 1\\n pointers=[-1]*len(primes)\\n minheap=[]\\n heapq.heapify(minheap)\\n out=[1]\\n outset=set(out)\\n pointers[0]=0\\n\\n while True:\\n i=0\\n minval=float('inf')\\n while i<len(primes) and pointers[i]>=0:\\n if pointers[i]<len(out):\\n val=out[pointers[i]]*primes[i]\\n minval=min(minval,val)\\n heapq.heappush(minheap,val)\\n pointers[i]+=1\\n i+=1\\n while minheap and minheap[0]<=minval:\\n elem=heapq.heappop(minheap)\\n if elem not in outset:\\n out.append(elem)\\n outset.add(elem)\\n if len(out)>=n:\\n return out[n-1]\\n if i<len(primes):\\n pointers[i]=0\\n\",\n \"runtime\": \"2318\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minHeap=[]\\n ans=[1]\\n no=len(primes)\\n count=1\\n while count<n:\\n for i in range(1,no+1):\\n if count>=i:\\n heapq.heappush(minHeap,ans[-i]*primes[i-1])\\n else:\\n break\\n while minHeap[0]==ans[-1]:\\n heapq.heappop(minHeap)\\n ans.append(minHeap[0])\\n heapq.heappop(minHeap)\\n count+=1\\n return ans[-1]\",\n \"runtime\": \"2363\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n nums = set()\\n q = [1]\\n while len(nums) < n:\\n v = heappop(q)\\n if v not in nums:\\n nums.add(v)\\n for p in primes:\\n if v * p not in nums:\\n heappush(q, v * p)\\n return max(nums)\\n\\n\\n \",\n \"runtime\": \"2363\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n cache = set([1])\\n options = primes.copy()\\n heapq.heapify(options)\\n\\n while len(cache) < n:\\n minVal = heapq.heappop(options)\\n if minVal in cache: continue\\n cache.add(minVal)\\n for prime in primes:\\n if not minVal * prime in cache:\\n heapq.heappush(options, minVal * prime)\\n return max(cache)\\n\",\n \"runtime\": \"2408\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n res=[1]\\n l=[0 for _ in range(len(primes))]\\n\\n while len(res)<n:\\n mini=float('inf')\\n ind=-1\\n \\n for i in range(len(primes)):\\n tmp=primes[i]*res[l[i]]\\n if tmp<mini:\\n mini=tmp\\n ind=i\\n \\n l[ind]+=1\\n if mini!=res[-1]:\\n res.append(mini)\\n print(res)\\n return res[-1]\\n\\n\\n\\n\",\n \"runtime\": \"2408\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n res = [float('inf')] * (n)\\n res[0] = 1\\n idx = [0] * len(primes)\\n\\n\\n\\n for i in range(1, n):\\n for (j, p) in enumerate(primes):\\n res[i] = min(res[i], p * res[idx[j]])\\n for (j, p) in enumerate(primes):\\n if res[i] == p * res[idx[j]]:\\n idx[j] += 1\\n return res[-1]\\n\\n #Time complexity = len(primes) * n \",\n \"runtime\": \"2453\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1]\\n \\n # indexes[p]: last index i where dp[i]*p <= dp[-1]\\n indexes= {p : 0 for p in primes}\\n\\n for (i) in range(n-1):\\n next = 1e10\\n for p,j in indexes.items():\\n next = min(next, p*dp[j])\\n\\n for p,j in indexes.items():\\n indexes[p] += dp[j] * p <= next\\n\\n dp.append(next)\\n\\n return dp[-1]\\n\\n \",\n \"runtime\": \"2453\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1] * n\\n pos = [0] * len(primes)\\n\\n for i in range(1, n):\\n minVal = float('inf')\\n for j in range(len(primes)):\\n minVal = min(minVal, primes[j] * dp[pos[j]])\\n for j in range(len(primes)):\\n pos[j] += (primes[j] * dp[pos[j]] == minVal)\\n dp[i] = minVal\\n return dp[-1]\",\n \"runtime\": \"2499\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n==1:\\n return 1\\n pointers=[-1]*len(primes)\\n minheap=[]\\n heapq.heapify(minheap)\\n out=[1]\\n outset=set(out)\\n pointers[0]=0\\n\\n while True:\\n i=0\\n minval=float('inf')\\n while i<len(primes) and pointers[i]>=0:\\n if pointers[i]<len(out):\\n val=out[pointers[i]]*primes[i]\\n minval=min(minval,val)\\n heapq.heappush(minheap,val)\\n pointers[i]+=1\\n i+=1\\n while minheap and minheap[0]<=minval:\\n elem=heapq.heappop(minheap)\\n if elem not in outset:\\n out.append(elem)\\n outset.add(elem)\\n if len(out)>=n:\\n return out[n-1]\\n if i<len(primes):\\n pointers[i]=0\\n\",\n \"runtime\": \"2499\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n res = []\\n\\n listx = [1]\\n\\n heapq.heapify(listx)\\n dictx = {}\\n\\n while n > 0:\\n x = heapq.heappop(listx)\\n if x not in dictx.keys():\\n for each in primes:\\n x1 = x*each\\n if x1 not in dictx.keys():\\n heapq.heappush(listx, x1)\\n res.append(x)\\n dictx[x] = 1\\n n -= 1\\n else:\\n continue\\n \\n return res[-1]\\n \",\n \"runtime\": \"2544\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n res = []\\n\\n listx = [1]\\n\\n heapq.heapify(listx)\\n dictx = {}\\n\\n while n > 0:\\n x = heapq.heappop(listx)\\n if x not in dictx.keys():\\n for each in primes:\\n x1 = x*each\\n if x1 not in dictx.keys():\\n heapq.heappush(listx, x1)\\n res.append(x)\\n dictx[x] = 1\\n n -= 1\\n else:\\n continue\\n \\n return res[-1]\\n \",\n \"runtime\": \"2589\"\n },\n {\n \"code\": \"from heapq import heapify, heappush, heappop\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n minheap = [1]\\n heapify(minheap)\\n\\n visited = {1}\\n\\n for i in range(n):\\n top = heappop(minheap)\\n for prime in primes:\\n prod = prime*top\\n if(prod not in visited):\\n heappush(minheap,prod)\\n visited.add(prod)\\n return top\",\n \"runtime\": \"2634\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\\n\",\n \"runtime\": \"2679\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n return self.approach_priorityqueue(n, primes)\\n\\n def approach_priorityqueue(self, n, primes):\\n count = 0\\n visited = set({1})\\n pq = [1]\\n\\n while count < n:\\n answer = heappop(pq)\\n\\n for prime in primes:\\n new_answer = answer * prime\\n if new_answer not in visited:\\n visited.add(new_answer)\\n heappush(pq, new_answer)\\n\\n count += 1\\n\\n return answer\\n \",\n \"runtime\": \"2724\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Initialize the heap with the number 1\\n heap = [1]\\n seen = {1} # Use a set to keep track of seen numbers\\n \\n for _ in range(n):\\n # Extract the smallest number from the heap\\n current_ugly = heapq.heappop(heap)\\n \\n # Generate new candidates by multiplying the current ugly number with each prime\\n for prime in primes:\\n new_ugly = current_ugly * prime\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n \\n return current_ugly\",\n \"runtime\": \"2769\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n seen = {1}\\n heap = [1]\\n ugly = 1\\n for _ in range(n):\\n ugly = heapq.heappop(heap)\\n for factor in primes:\\n new_ugly = ugly * factor\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n return ugly\\n\",\n \"runtime\": \"2814\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"runtime\": \"2860\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1:\\n return 1\\n\\n heap = []\\n heapq.heappush(heap, 1)\\n\\n seen = set()\\n seen.add(1)\\n\\n su = 1\\n for _ in range(n):\\n su = heapq.heappop(heap)\\n for f in primes:\\n add_f = su * f\\n if add_f not in seen:\\n seen.add(add_f)\\n heapq.heappush(heap, add_f)\\n\\n return su\",\n \"runtime\": \"2905\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n numbers_seen = 0\\n potentials = [1] + primes\\n numbers_tried = set(potentials)\\n heapq.heapify(potentials)\\n\\n while True:\\n smallest = heapq.heappop(potentials)\\n numbers_seen += 1\\n if numbers_seen == n:\\n return smallest\\n for x in primes:\\n new_candidate = smallest*x\\n if new_candidate not in numbers_tried:\\n numbers_tried.add(new_candidate)\\n heapq.heappush(potentials, new_candidate)\\n\",\n \"runtime\": \"2950\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"runtime\": \"2995\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n uglyHeap = [1]\\n visited = set()\\n visited.add(1)\\n for _ in range(n):\\n curr = heappop(uglyHeap)\\n for prime in primes:\\n new_ugly = curr * prime\\n if new_ugly not in visited:\\n heappush(uglyHeap, new_ugly)\\n visited.add(new_ugly)\\n return curr\",\n \"runtime\": \"2995\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n h, visited = [1], {1}\\n\\n ugly = 0\\n for _ in range(n):\\n ugly = heappop(h)\\n for prime in primes:\\n new_ugly = ugly * prime\\n if new_ugly not in visited:\\n visited.add(new_ugly)\\n heappush(h, new_ugly)\\n \\n return ugly\",\n \"runtime\": \"3040\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minHeap = [1]\\n seen = set()\\n seen.add(1)\\n current = 1\\n for _ in range(n):\\n current = heapq.heappop(minHeap)\\n for prime in primes:\\n next_ugly = current * prime\\n if next_ugly not in seen:\\n heapq.heappush(minHeap, next_ugly)\\n seen.add(next_ugly)\\n return current\",\n \"runtime\": \"3040\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"runtime\": \"3085\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [1]\\n visited = set(min_heap)\\n heapq.heapify(min_heap)\\n\\n for _ in range(n):\\n element = heapq.heappop(min_heap)\\n for prime in primes:\\n new_element = element * prime\\n if new_element not in visited:\\n visited.add(new_element)\\n heapq.heappush(min_heap, new_element)\\n return element\\n \",\n \"runtime\": \"3130\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n l = [1]\\n v = set()\\n v.add(1)\\n for i in range(n):\\n nn = heappop(l)\\n if i == n-1:\\n return nn\\n for p in primes:\\n np = nn * p\\n if np not in v:\\n v.add(np)\\n heappush(l, np)\\n \\n return 0\\n\\n\\n\\n\\n\",\n \"runtime\": \"3130\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n seen = {1}\\n pq = [1]\\n\\n while n:\\n num = heapq.heappop(pq)\\n if n == 1:\\n return num\\n \\n for prime in primes:\\n new_num = num * prime\\n if not new_num in seen:\\n heapq.heappush(pq, new_num)\\n seen.add(new_num)\\n \\n n -= 1\\n\\n\",\n \"runtime\": \"3175\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n h = []\\n heapq.heappush(h,1)\\n visited = {1}\\n for i in range(n):\\n cur = heapq.heappop(h)\\n for p in primes:\\n temp = p * cur\\n if temp not in visited:\\n visited.add(temp)\\n heapq.heappush(h,temp)\\n return cur\\n\\n \\n\",\n \"runtime\": \"3175\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Initialize the heap with the first element (1)\\n heap = [1]\\n # Initialize a set to keep track of numbers we've already seen\\n seen = set([1])\\n\\n for _ in range(n):\\n # Extract the smallest number from the heap\\n ugly = heapq.heappop(heap)\\n # Generate the next possible super ugly numbers\\n for prime in primes:\\n next_ugly = ugly * prime\\n # If we haven't seen this number before, add it to the heap and seen set\\n if next_ugly not in seen:\\n seen.add(next_ugly)\\n heapq.heappush(heap, next_ugly)\\n\\n return ugly\\n\\n# Example usage:\\nsolution = Solution()\\nn = 12\\nprimes = [2, 7, 13, 19]\\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32\",\n \"runtime\": \"3221\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = []\\n seen = set()\\n\\n heappush(heap, 1)\\n seen.add(1)\\n\\n ans = 1\\n for _ in range(n):\\n ans = heappop(heap)\\n\\n for prime in primes:\\n new_ugly = ans * prime\\n if new_ugly not in seen:\\n heappush(heap, new_ugly)\\n seen.add(new_ugly)\\n \\n return ans\",\n \"runtime\": \"3221\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_set = set([1])\\n # Init the heap.\\n hq = [1]\\n curr = 0\\n \\n for i in range(n):\\n curr = heapq.heappop(hq)\\n for prime in primes:\\n new = prime * curr\\n if new not in ugly_set:\\n ugly_set.add(new)\\n heapq.heappush(hq, new)\\n \\n return curr\\n \\n return ugly_set[n-1]\\n\",\n \"runtime\": \"3266\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"runtime\": \"3266\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minHeap = []\\n\\n heapq.heappush(minHeap,1)\\n seen = set()\\n ugly = 1\\n\\n for _ in range(n): \\n ugly = heapq.heappop(minHeap)\\n for prime in primes: \\n newUgly = ugly * prime\\n if newUgly not in seen: \\n seen.add(newUgly)\\n heapq.heappush(minHeap,newUgly)\\n\\n\\n return ugly\\n \\n \",\n \"runtime\": \"3311\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = []\\n min_heap.append(1)\\n vis = set()\\n vis.add(1)\\n cur = 0\\n heapq.heapify(min_heap)\\n for i in range(n):\\n cur = heappop(min_heap)\\n for p in primes:\\n new = cur*p\\n if new not in vis:\\n vis.add(new)\\n heappush(min_heap, new)\\n return cur\",\n \"runtime\": \"3311\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1] # Initialize the heap with 1\\n seen = set() # To keep track of seen numbers\\n ugly = [] # To store the super ugly numbers\\n \\n for _ in range(n):\\n current_ugly = heapq.heappop(heap) # Get the smallest number\\n ugly.append(current_ugly)\\n for prime in primes:\\n new_ugly = current_ugly * prime\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n \\n return ugly[-1]\\n\\n# Example usage:\\nsolution = Solution()\\nn = 12\\nprimes = [2, 7, 13, 19]\\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32\",\n \"runtime\": \"3356\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"runtime\": \"3356\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_number = 1\\n next_numbers = []\\n set_next_numbers = set()\\n for _ in range(n-1):\\n for factor in primes:\\n if (next_ := ugly_number*factor) not in set_next_numbers:\\n heappush(next_numbers, next_)\\n set_next_numbers.add(next_)\\n ugly_number = heappop(next_numbers)\\n set_next_numbers.remove(ugly_number)\\n \\n return ugly_number\",\n \"runtime\": \"3401\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Initialize the heap with the first super ugly number (1)\\n heap = [1]\\n # Set to keep track of unique numbers added to the heap\\n seen = set([1])\\n\\n # Repeat the process n-1 times to get the nth super ugly number\\n for _ in range(n - 1):\\n # Extract the smallest element from the heap\\n current_ugly = heapq.heappop(heap)\\n # Generate new super ugly numbers by multiplying the current ugly number with each prime\\n for prime in primes:\\n new_ugly = current_ugly * prime\\n # Add new ugly number to the heap if it hasn't been seen before\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n\\n # The nth super ugly number is the smallest element remaining in the heap\\n return heap[0]\\n\\n# Example usage:\\nsolution = Solution()\\nn = 12\\nprimes = [2, 7, 13, 19]\\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32\",\n \"runtime\": \"3401\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n import heapq\\n if n==1:\\n return 1\\n \\n ret = [ele for ele in primes]\\n s = set(primes)\\n heapq.heapify(ret)\\n\\n for i in range(n-1):\\n ele = heapq.heappop(ret)\\n for prime in primes:\\n if ele*prime not in s:\\n heapq.heappush(ret, ele*prime)\\n s.add(ele*prime)\\n return ele\",\n \"runtime\": \"3446\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Min-heap to keep track of the smallest numbers\\n min_heap = [1]\\n # Set to keep track of the numbers we have added to the heap\\n seen = {1}\\n \\n # Variable to store the current super ugly number\\n ugly_number = 1\\n \\n for _ in range(n):\\n # Get the smallest number from the heap\\n ugly_number = heapq.heappop(min_heap)\\n \\n # For each prime, generate new super ugly numbers\\n for prime in primes:\\n new_ugly = ugly_number * prime\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(min_heap, new_ugly)\\n \\n return ugly_number\\n\",\n \"runtime\": \"3446\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minHeap = []\\n\\n heapq.heappush(minHeap,1)\\n seen = set()\\n ugly = 1\\n\\n for _ in range(n): \\n ugly = heapq.heappop(minHeap)\\n for prime in primes: \\n newUgly = ugly * prime\\n if newUgly not in seen: \\n seen.add(newUgly)\\n heapq.heappush(minHeap,newUgly)\\n\\n\\n return ugly\\n \\n \",\n \"runtime\": \"3491\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n setto = set([1])\\n heapq.heapify(heap)\\n\\n while True:\\n #print(heap)\\n val = heapq.heappop(heap)\\n if n == 1:\\n return val\\n for prime in primes:\\n if val*prime not in setto:\\n setto.add(val*prime)\\n heapq.heappush(heap, val*prime)\\n n -= 1\\n \\n \\n \\n \",\n \"runtime\": \"3491\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1:\\n return 1\\n i = 1\\n found = set(primes)\\n heap = primes[:]\\n heapq.heapify(heap)\\n while i < n: \\n num = heapq.heappop(heap)\\n for prime in primes:\\n if num*prime not in found:\\n found.add(num*prime)\\n heapq.heappush(heap, num*prime)\\n i+=1\\n return num\\n \\n \\n\",\n \"runtime\": \"3536\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = []\\n min_heap.append(1)\\n visi = set()\\n visi.add(1)\\n cur = 0\\n heapq.heapify(min_heap)\\n for i in range(n):\\n cur = heappop(min_heap)\\n for p in primes:\\n new = cur*p\\n if new not in visi:\\n visi.add(new)\\n heappush(min_heap, new)\\n return cur\",\n \"runtime\": \"3536\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1:\\n return 1\\n uglies = primes[:]\\n num = 1\\n seen = {1}\\n\\n for _ in range(n-1):\\n num = heapq.heappop(uglies)\\n for p in primes:\\n if p * num not in seen:\\n heapq.heappush(uglies, p * num)\\n seen.add(p * num)\\n\\n return num\\n \",\n \"runtime\": \"3582\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n\\n seen = set([1])\\n heap = [1]\\n heapify(heap)\\n\\n for i in range(n):\\n curr = heappop(heap)\\n\\n if i == n-1:\\n return curr\\n \\n for factor in primes:\\n if (factor * curr) not in seen:\\n seen.add(factor * curr)\\n heappush(heap, factor * curr)\\n \\n return 1\",\n \"runtime\": \"3582\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n visit = set()\\n for _ in range(n):\\n curr = heappop(heap)\\n for p in primes:\\n if p*curr not in visit:\\n heappush(heap, p*curr)\\n visit.add(p*curr)\\n return curr\",\n \"runtime\": \"3627\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap=[1]\\n heapq.heapify(heap)\\n visited=set()\\n for i in range(n):\\n num=heapq.heappop(heap)\\n if i==n-1:\\n return num\\n for fact in primes:\\n if fact*num not in visited:\\n heapq.heappush(heap,fact*num)\\n visited.add(fact*num)\",\n \"runtime\": \"3627\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minHeap = [1]\\n a = 0\\n visited = {1}\\n for i in range(n):\\n a = heapq.heappop(minHeap)\\n for p in primes:\\n if p * a not in visited:\\n heapq.heappush(minHeap, p * a)\\n visited.add(p * a)\\n return a\",\n \"runtime\": \"3672\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n hp = [1]\\n seen = set([1])\\n\\n for _ in range(n):\\n var = heapq.heappop(hp)\\n \\n for p in primes:\\n if p*var not in seen:\\n seen.add(p*var)\\n heapq.heappush(hp, p*var)\\n return var\",\n \"runtime\": \"3672\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n cur = 0\\n num = [1]\\n seen = set([1])\\n while n:\\n cur = heappop(num)\\n n -= 1\\n for i in primes:\\n if i * cur not in seen:\\n heappush(num, i * cur)\\n seen.add(i * cur)\\n return cur\\n\",\n \"runtime\": \"3717\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n heapq.heapify(heap)\\n visited = set()\\n \\n res = []\\n\\n while len(res) < n:\\n res.append(heapq.heappop(heap))\\n \\n for j in range(len(primes)):\\n num = res[-1] * primes[j]\\n if num not in visited:\\n heapq.heappush(heap, num)\\n visited.add(num)\\n \\n return res[-1]\\n \",\n \"runtime\": \"3717\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":140,"string":"140"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1]\n pointers = [0] * len(primes)\n\n while len(ugly_numbers) < n:\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\n ugly_numbers.append(next_ugly)\n\n for i in range(len(primes)):\n if ugly_numbers[pointers[i]] * primes[i] == next_ugly:\n pointers[i] += 1\n\n return ugly_numbers[-1]\n \n ","memory":"23436"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = [1]\n pointers = [0] * len(primes)\n while len(ugly_numbers) < n:\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\n ugly_numbers.append(next_ugly)\n for i in range(len(primes)):\n if next_ugly == ugly_numbers[pointers[i]] * primes[i]:\n pointers[i] += 1\n return ugly_numbers[-1]","memory":"23436"},{"code":"from heapq import heappop, heappush\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [(1, 0, -1)]\n while n:\n if n == 1:\n return heap[0][0]\n element, start_index, last_generating_value = heappop(heap)\n heappush(heap, (element * primes[start_index], start_index, element))\n if start_index + 1 < len(primes) and last_generating_value != -1:\n heappush(heap, (last_generating_value * primes[start_index + 1], start_index + 1, last_generating_value))\n n -= 1\n return -1","memory":"33110"},{"code":"from heapq import heappop, heappush\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [(1, 0, -1)]\n while n:\n if n == 1:\n return heap[0][0]\n element, start_index, last_generating_value = heappop(heap)\n heappush(heap, (element * primes[start_index], start_index, element))\n if start_index + 1 < len(primes) and last_generating_value != -1:\n heappush(heap, (last_generating_value * primes[start_index + 1], start_index + 1, last_generating_value))\n n -= 1\n return -1","memory":"33110"},{"code":"from sortedcontainers import SortedSet\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n v = SortedSet()\n for p in primes:\n v.add(p)\n ans = [1]\n k = len(primes)\n while len(ans) <=n:\n a = v[0]\n v.remove(a)\n ans.append(a)\n p = 0\n while p<k:\n if len(v)+len(ans)>n and v and a*primes[p]>v[-1]:\n break\n v.add(a*primes[p])\n p+=1\n print(ans)\n return ans[n-1]","memory":"42784"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n primes=sorted(primes)\n hp=[1]\n ans=set()\n for _ in range(n):\n val=heapq.heappop(hp)\n for prime in primes: \n heapq.heappush(hp,val*prime)\n if val%prime==0: break\n ans.add(val)\n return sorted(list(set(ans)))[n-1]","memory":"42784"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n queues = [deque([1]) for _ in primes]\n ugly_nums = [1]\n while len(ugly_nums) < n:\n for i,q in enumerate(queues):\n p = primes[i]\n while p * q[0] <= ugly_nums[-1]:\n q.popleft()\n t = float(\"inf\")\n t_ind = None\n for i,q in enumerate(queues):\n p = primes[i]\n if p * q[0] < t:\n t = p * q[0]\n t_ind = i\n queues[t_ind].popleft()\n for q in queues:\n q.append(t)\n ugly_nums.append(t)\n return ugly_nums[-1]\n ","memory":"52458"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n plist = [[1] for _ in range(len(primes))]\n\n candidates = [None]* len(primes)\n for i in range(len(primes)):\n candidates[i] = plist[i][0] * primes[i]\n output = [None]*n\n output[0] = 1\n\n for i in range(1, n):\n minval = min(candidates)\n for j in range(len(plist)):\n plist[j].append(minval)\n\n for j in range(len(candidates)):\n if candidates[j] == minval:\n plist[j].pop(0)\n candidates[j] = plist[j][0]*primes[j]\n output[i] = minval\n \n #print(output)\n\n return output[n-1]\n \n \n\n ","memory":"62131"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n m = len(primes)\n helper = [[1] for _ in range(m)]\n indices = [0 for _ in range(m)]\n\n for i in range(n-1):\n nextUglyNumber = min([helper[j][indices[j]] * primes[j] for j in range(m)])\n for j in range(m):\n helper[j].append(nextUglyNumber)\n if nextUglyNumber % primes[j] == 0:\n indices[j] += 1\n return helper[0][-1]\n\n\n\n ","memory":"71805"},{"code":"import heapq\nfrom collections import deque\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n primes.sort()\n lists = []\n q = []\n for i, p in enumerate(primes):\n lists.append(deque([p]))\n q.append((p, i))\n heapq.heapify(q)\n qsize = len(primes)\n\n i = 1\n s = 1\n while i < n:\n t = heapq.heappop(q)\n lists[t[1]].popleft()\n\n if t[0] == s:\n if lists[t[1]]:\n heapq.heappush(q, (lists[t[1]][0], t[1]))\n continue\n s = t[0]\n # print(i, s, t[1])\n \n for j, p in enumerate(primes):\n if i + len(lists[j]) <= n:\n lists[j].append(s * p)\n\n if len(lists[j]) == 1:\n heapq.heappush(q, (lists[j][0], j))\n\n if len(lists[t[1]]) > 1:\n heapq.heappush(q, (lists[t[1]][0], t[1]))\n # print(q)\n i += 1\n\n return s\n ","memory":"81479"},{"code":"import heapq\nfrom collections import deque\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n primes.sort()\n lists = []\n q = []\n for i, p in enumerate(primes):\n lists.append(deque([p]))\n q.append((p, i))\n heapq.heapify(q)\n qsize = len(primes)\n\n i = 1\n s = 1\n while i < n:\n t = heapq.heappop(q)\n lists[t[1]].popleft()\n\n if t[0] == s:\n if lists[t[1]]:\n heapq.heappush(q, (lists[t[1]][0], t[1]))\n continue\n s = t[0]\n # print(i, s, t[1])\n \n for j, p in enumerate(primes):\n if i + len(lists[j]) <= n:\n lists[j].append(s * p)\n\n if len(lists[j]) == 1:\n heapq.heappush(q, (lists[j][0], j))\n\n if len(lists[t[1]]) > 1:\n heapq.heappush(q, (lists[t[1]][0], t[1]))\n # print(q)\n i += 1\n\n return s\n ","memory":"91153"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n==1:\n return 1\n pointers=[-1]*len(primes)\n minheap=[]\n heapq.heapify(minheap)\n out=[1]\n outset=set(out)\n pointers[0]=0\n\n while True:\n i=0\n minval=float('inf')\n while i<len(primes) and pointers[i]>=0:\n if pointers[i]<len(out):\n val=out[pointers[i]]*primes[i]\n minval=min(minval,val)\n heapq.heappush(minheap,val)\n pointers[i]+=1\n i+=1\n while minheap and minheap[0]<=minval:\n elem=heapq.heappop(minheap)\n if elem not in outset:\n out.append(elem)\n outset.add(elem)\n if len(out)>=n:\n return out[n-1]\n if i<len(primes):\n pointers[i]=0\n","memory":"100826"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n==1:\n return 1\n pointers=[-1]*len(primes)\n minheap=[]\n heapq.heapify(minheap)\n out=[1]\n outset=set(out)\n pointers[0]=0\n\n while True:\n i=0\n minval=float('inf')\n while i<len(primes) and pointers[i]>=0:\n if pointers[i]<len(out):\n val=out[pointers[i]]*primes[i]\n minval=min(minval,val)\n heapq.heappush(minheap,val)\n pointers[i]+=1\n i+=1\n while minheap and minheap[0]<=minval:\n elem=heapq.heappop(minheap)\n if elem not in outset:\n out.append(elem)\n outset.add(elem)\n if len(out)>=n:\n return out[n-1]\n if i<len(primes):\n pointers[i]=0\n","memory":"110500"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = []\n heapq.heappush(heap, 1)\n uglyNumber = -1\n \n while n != 0:\n uglyNumber = heapq.heappop(heap)\n\n heapq.heappush(heap, uglyNumber * primes[-1])\n for index in range(len(primes) - 2, -1, -1):\n if uglyNumber % primes[index + 1] == 0: break\n heapq.heappush(heap, uglyNumber * primes[index])\n n -= 1\n \n return uglyNumber","memory":"120174"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = []\n heapq.heappush(heap, 1)\n uglyNumber = -1\n \n for _ in range(n):\n uglyNumber = heapq.heappop(heap)\n heapq.heappush(heap, uglyNumber * primes[-1])\n for index in range(len(primes) - 2, -1, -1):\n if uglyNumber % primes[index + 1] == 0: break\n heapq.heappush(heap, uglyNumber * primes[index])\n \n return uglyNumber","memory":"129848"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n dp = [1] * n\n m = len(primes)\n indexes = [0] * m\n uglys = primes[:]\n for i in range(1, n):\n nxt_ugly = min(uglys)\n dp[i] = nxt_ugly\n for j in range(m):\n if nxt_ugly == uglys[j]:\n indexes[j] += 1\n uglys[j] = dp[indexes[j]] * primes[j]\n return dp[n - 1]\n\n\nfrom heapq import heappop, heappush\n\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n pq = [1]\n m = len(primes)\n for _ in range(n):\n ans = heappop(pq)\n for i in range(m - 1, 0, -1):\n if ans % primes[i] == 0:\n for j in range(i, m):\n heappush(pq, ans * primes[j])\n break\n else:\n for j in range(m):\n heappush(pq, ans * primes[j])\n return ans\n","memory":"139521"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n<=2:\n return n\n lp = len(primes)\n ne = [ [p] for p in primes ]\n cand = [ (p,i) for i,p in enumerate(primes) ]\n heapq.heapify(cand)\n cnt = 2\n while True:\n #print(\"\\n\", cnt)\n #print(ne)\n #print(cand)\n pv,ps = heapq.heappop(cand)\n if cnt == n:\n return pv\n cnt += 1\n ne[ps].pop(0)\n for psi in range(ps,lp):\n v = pv*primes[psi]\n ne[psi].append(v)\n heapq.heappush(cand, (ne[ps][0],ps))\n \n ","memory":"149195"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = []\n heapq.heappush(heap, 1)\n uglyNumber = -1\n \n for _ in range(n):\n uglyNumber = heapq.heappop(heap)\n heapq.heappush(heap, uglyNumber * primes[-1])\n for index in range(len(primes) - 2, -1, -1):\n if uglyNumber % primes[index + 1] == 0: break\n heapq.heappush(heap, uglyNumber * primes[index])\n \n return uglyNumber","memory":"158869"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n numbers = [1]\n candidates = []\n \n for _ in range(n):\n for p in primes:\n heapq.heappush(candidates, numbers[-1] * p)\n while len(candidates) > 0:\n new_number = heapq.heappop(candidates)\n if numbers[-1] != new_number:\n numbers.append(new_number)\n break\n \n return numbers[n-1]\n","memory":"168543"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n from heapq import heappush,heappop\n res = 1\n lp = [deque([p]) for p in primes]\n count = 1\n while count < n:\n m = lp[0][0]\n for q in lp:\n if q[0] < m:\n m = q[0]\n res = m\n for i,q in enumerate(lp):\n q.append(res*primes[i])\n if q[0] == res:\n q.popleft()\n count += 1\n return res","memory":"178216"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n x = 1\n queues = [deque([i]) for i in primes]\n for _ in range(n - 1):\n i = 0\n x = queues[0][0]\n for k in range(1, len(queues)):\n if queues[k][0] < x:\n i = k\n x = queues[k][0]\n for k in range(len(queues)):\n if queues[k][0] == x:\n queues[k].popleft()\n queues[k].append(primes[k] * x)\n return x\n","memory":"187890"},{"code":"# key idea. the brute force inefficiently goes from one super ugly\n# number to the next, by just going through every number and \n# checking it. however, there might be a shortcut with this key idea.\n# every super ugly number in the sequence has the same set of prime \n# factors. wait. so we know if we take a super ugly number and \n# multiply it by those factors, we get a bigger super ugly number.\n# but we don't know if it is necessarily the next super ugly number.\n# so using a heap allows us to repeatedly find the next super ugly number.\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\n# But that is way way way better in terms of time. and space probably a bit worse\n# but that's okay.\n\n\n# [2,7,13,19]\n# [1,2,4,7,8,13,14,16,19,26,28,32]\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\n\n# [8 13 14 19 26 28 38 49 52 76]\n# 1 2 4 7\n\nfrom heapq import *\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [1]\n res = []\n while len(res) != n:\n curr = heappop(min_heap)\n while res and curr == res[-1]:\n curr = heappop(min_heap)\n res.append(curr)\n for prime in primes:\n heappush(min_heap, prime * curr)\n print(res)\n return res[-1]","memory":"197564"},{"code":"# key idea. the brute force inefficiently goes from one super ugly\n# number to the next, by just going through every number and \n# checking it. however, there might be a shortcut with this key idea.\n# every super ugly number in the sequence has the same set of prime \n# factors. wait. so we know if we take a super ugly number and \n# multiply it by those factors, we get a bigger super ugly number.\n# but we don't know if it is necessarily the next super ugly number.\n# so using a heap allows us to repeatedly find the next super ugly number.\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\n# But that is way way way better in terms of time. and space probably a bit worse\n# but that's okay. this is kind of like how we use a heap to merge \n# k sorted lists. prime factorization theorem is also useful in visualizing this.\n\n\n# [2,7,13,19]\n# [1,2,4,7,8,13,14,16,19,26,28,32]\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\n\n# [8 13 14 19 26 28 38 49 52 76]\n# 1 2 4 7\n\nfrom heapq import *\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [1]\n res = []\n while len(res) != n:\n curr = heappop(min_heap)\n while res and curr == res[-1]:\n curr = heappop(min_heap)\n res.append(curr)\n for prime in primes:\n heappush(min_heap, prime * curr)\n print(res)\n return res[-1]","memory":"197564"},{"code":"# key idea. the brute force inefficiently goes from one super ugly\n# number to the next, by just going through every number and \n# checking it. however, there might be a shortcut with this key idea.\n# every super ugly number in the sequence has the same set of prime \n# factors. wait. so we know if we take a super ugly number and \n# multiply it by those factors, we get a bigger super ugly number.\n# but we don't know if it is necessarily the next super ugly number.\n# so using a heap allows us to repeatedly find the next super ugly number.\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\n# But that is way way way better in terms of time. and space probably a bit worse\n# but that's okay.\n\n\n# [2,7,13,19]\n# [1,2,4,7,8,13,14,16,19,26,28,32]\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\n\n# [8 13 14 19 26 28 38 49 52 76]\n# 1 2 4 7\n\nfrom heapq import *\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [1]\n res = []\n while len(res) != n:\n curr = heappop(min_heap)\n while res and curr == res[-1]:\n curr = heappop(min_heap)\n res.append(curr)\n for prime in primes:\n heappush(min_heap, prime * curr)\n print(res)\n return res[-1]","memory":"207238"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n a = [1]\n heapq.heapify(a)\n ans = 1\n s =set()\n while n>0:\n ans = heapq.heappop(a)\n if(ans in s):\n continue\n s.add(ans)\n n-=1\n for p in primes:\n heapq.heappush(a,ans*p)\n return ans\n\n ","memory":"216911"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n print(primes)\n boundary = primes.copy()\n heapq.heapify(boundary)\n seen = set()\n count = 1\n\n while count < n:\n val = heapq.heappop(boundary)\n \n if val in seen: continue\n count += 1\n seen.add(val)\n\n if count == n:\n return val\n\n for prime in primes:\n heapq.heappush(boundary, prime * val)\n\n return 1","memory":"226585"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n cache = set([1])\n options = primes.copy()\n heapq.heapify(options)\n\n while len(cache) < n:\n minVal = heapq.heappop(options)\n if minVal in cache: continue\n cache.add(minVal)\n for prime in primes:\n if not minVal * prime in cache:\n heapq.heappush(options, minVal * prime)\n return max(cache)\n","memory":"236259"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n nums = set()\n q = [1]\n while len(nums) < n:\n v = heappop(q)\n if v not in nums:\n nums.add(v)\n for p in primes:\n if v * p not in nums:\n heappush(q, v * p)\n return max(nums)\n\n\n ","memory":"245933"},{"code":"#Attempt 1:\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n q = [[] for _ in range(0, len(primes))]\n curr = 1\n\n #generate ugly numbers 2 to n\n for i in range(2, n+1):\n #append ugly number candidates to queues\n for j in range(0, len(primes)):\n q[j].append(curr*primes[j])\n\n #find and pop the minimum candidate from all queues\n curr = min([q[j][0] for j in range(0, len(primes))])\n for j in range(0, len(primes)):\n if q[j][0] == curr:\n q[j].pop(0)\n\n\n #return nth super ugly number\n return curr","memory":"255606"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n diruses = {}\n q = [1]\n iterr = 0 \n t = 0\n \n while iterr < n:\n\n t = heappop(q)\n while t in diruses:\n t = heappop(q)\n \n diruses[t] = 1\n\n for p in primes:\n heappush(q,p*t) \n\n iterr += 1\n\n return t","memory":"265280"},{"code":"#Attempt 1 (Accepted on August 19, 2024):\n#Runtime: 7886 ms, faster than 5.14% of Python3 online submissions for Super Ugly Number.\n#Memory Usage: 402.78 MB, less than 41.32% of Python3 online submissions for Super Ugly Number.\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n q = [[] for _ in range(0, len(primes))]\n curr = 1\n\n #generate ugly numbers 2 to n\n for i in range(2, n+1):\n #append ugly number candidates to queues\n for j in range(0, len(primes)):\n q[j].append(curr*primes[j])\n\n #find and pop the minimum candidate from all queues\n curr = min([q[j][0] for j in range(0, len(primes))])\n for j in range(0, len(primes)):\n if q[j][0] == curr:\n q[j].pop(0)\n\n #return nth super ugly number\n return curr","memory":"274954"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n import heapq\n #minheap\n nums={}\n heap=[1]\n cnum=0\n counter=0\n while counter<n:\n cnum=heappop(heap)\n if cnum not in nums:\n counter+=1\n nums[cnum]=1\n for prime in primes:\n heappush(heap,cnum*prime)\n return cnum \n ","memory":"284628"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n res = []\n\n listx = [1]\n\n heapq.heapify(listx)\n dictx = {}\n\n while n > 0:\n x = heapq.heappop(listx)\n if x not in dictx.keys():\n for each in primes:\n x1 = x*each\n if x1 not in dictx.keys():\n heapq.heappush(listx, x1)\n res.append(x)\n dictx[x] = 1\n n -= 1\n else:\n continue\n \n return res[-1]\n ","memory":"303975"},{"code":"from queue import PriorityQueue\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n prior = PriorityQueue()\n prior.put(1)\n ugly = -1\n for i in range(n):\n num = prior.get()\n while num <= ugly:\n num = prior.get()\n ugly = num\n for num in primes:\n prior.put(ugly*num)\n return ugly\n","memory":"313649"},{"code":"from queue import PriorityQueue\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n prior = PriorityQueue()\n prior.put(1)\n ugly = -1\n for i in range(n):\n num = prior.get()\n while num <= ugly:\n num = prior.get()\n ugly = num\n for num in primes:\n prior.put(ugly*num)\n return ugly\n","memory":"323323"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = []\n heapq.heappush(heap, 1)\n uglyNumber = -1\n prevUglyNumber = -1\n \n while n != 0:\n uglyNumber = heapq.heappop(heap)\n if uglyNumber == prevUglyNumber: continue\n for prime in primes:\n heapq.heappush(heap, uglyNumber * prime)\n prevUglyNumber = uglyNumber\n n -= 1\n \n return uglyNumber","memory":"332996"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n hq = [1]\n\n for _ in range(n - 1):\n n = heappop(hq)\n while len(hq) > 0 and hq[0] == n:\n heappop(hq)\n for prime in primes:\n heappush(hq, prime * n)\n\n return heappop(hq)\n\n\n\"\"\"\n\n8 28 52 46 14 26 38 7 13 19\n\n1 2 4\n\n\"\"\"","memory":"342670"},{"code":"from queue import PriorityQueue\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n prior = PriorityQueue()\n prior.put(1)\n ugly = -1\n for i in range(n):\n num = prior.get()\n while num <= ugly:\n num = prior.get()\n ugly = num\n for num in primes:\n prior.put(ugly*num)\n return ugly\n","memory":"352344"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n from heapq import heappush,heappop\n res = 0\n heap = [1]\n count = 0\n while count < n:\n res = heappop(heap)\n count += 1\n for prime in primes:\n heappush(heap,prime*res)\n while heap[0] == res:\n heappop(heap)\n return res","memory":"362018"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1: return 1\n \n hq = [1]\n heapq.heapify(hq)\n last = None\n while n > 0:\n now = heapq.heappop(hq)\n while len(hq) and last == now:\n now = heapq.heappop(hq)\n last = now\n for p in primes:\n heapq.heappush(hq, p * now)\n n -= 1\n \n return last\n\n","memory":"371691"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n value = 1\n minHeap = [value]\n\n while n:\n value = heapq.heappop(minHeap)\n while minHeap and minHeap[0] == value:\n heapq.heappop(minHeap)\n\n for p in primes:\n heapq.heappush(minHeap, p * value)\n\n n -= 1 \n\n return value","memory":"381365"},{"code":"from heapq import heappop,heappush\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap=[1]\n c=1\n prv=0\n while c<=n:\n curr=heappop(heap)\n if curr!=prv:\n for p in primes:\n heappush(heap,curr*p)\n c=c+1\n prv=curr\n return curr\n ","memory":"391039"},{"code":"from queue import PriorityQueue\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans=-1\n q=[1]\n while(n>0):\n a=heappop(q)\n if(ans==a):\n continue\n ans=a\n n-=1\n for i in primes:\n heappush(q,i*a)\n return ans","memory":"400713"},{"code":"from queue import PriorityQueue\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n prior = PriorityQueue()\n prior.put(1)\n ugly = -1\n for i in range(n):\n num = prior.get()\n while num <= ugly:\n num = prior.get()\n ugly = num\n for num in primes:\n prior.put(ugly*num)\n return ugly\n","memory":"410386"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = list(primes)\n heapify(heap)\n if n == 1:\n return 1\n while True:\n u = heappop(heap)\n while heap and heap[0] == u:\n heappop(heap)\n # print(u)\n n -= 1\n if n == 1:\n return u\n for p in primes:\n if p > u:\n break\n heappush(heap, u*p)","memory":"420060"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n prev = 1\n if n == 1: return prev\n heap = primes[:]\n heapq.heapify(heap)\n n -= 1\n while n > 0:\n val = heapq.heappop(heap)\n if val != prev:\n prev = val\n for prime in primes:\n heapq.heappush(heap, prime*prev)\n n -= 1\n return prev\n","memory":"429734"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minHeap=[]\n ans=[1]\n no=len(primes)\n count=1\n while count<n:\n for i in range(1,no+1):\n if count>=i:\n heapq.heappush(minHeap,ans[-i]*primes[i-1])\n else:\n break\n while minHeap[0]==ans[-1]:\n heapq.heappop(minHeap)\n ans.append(minHeap[0])\n heapq.heappop(minHeap)\n count+=1\n return ans[-1]","memory":"429734"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) :\n \n memo = [1] \n pointers = [0] * len(primes) \n\n def recursive_find(k):\n if k < len(memo):\n return memo[k]\n \n next_vals = [primes[i] * memo[pointers[i]] for i in range(len(primes))]\n next_val = min(next_vals)\n memo.append(next_val)\n \n for i in range(len(primes)):\n if next_val == primes[i] * memo[pointers[i]]:\n pointers[i] += 1\n \n return recursive_find(k)\n \n return recursive_find(n - 1)\n","memory":"439408"},{"code":"# key idea. the brute force inefficiently goes from one super ugly\n# number to the next, by just going through every number and \n# checking it. however, there might be a shortcut with this key idea.\n# every super ugly number in the sequence has the same set of prime \n# factors. wait. \n\n# [2,7,13,19]\n# [1,2,4,7,8,13,14,16,19,26,28,32]\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\n\n# [8 13 14 19 26 28 38 49 52 76]\n# 1 2 4 7\n\nfrom heapq import *\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n seen = set()\n min_heap = [1]\n res = []\n while len(res) != n:\n curr = heappop(min_heap)\n while curr in seen:\n curr = heappop(min_heap)\n res.append(curr)\n seen.add(curr)\n for prime in primes:\n heappush(min_heap, prime * curr)\n print(res)\n return res[-1]","memory":"439408"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = primes[:]\n heapq.heapify(heap)\n \n # Set to keep track of the generated ugly numbers\n ugly_numbers = {1}\n \n # Initialize the first ugly number\n ugly = 1\n \n for _ in range(n - 1):\n # Extract the smallest number from the heap\n ugly = heapq.heappop(heap)\n \n # For each prime, multiply it by the extracted number and push the result back to the heap\n for prime in primes:\n new_ugly = ugly * prime\n if new_ugly not in ugly_numbers:\n ugly_numbers.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n \n return ugly","memory":"449081"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = primes[:]\n heapq.heapify(heap)\n \n # Set to keep track of the generated ugly numbers\n ugly_numbers = {1}\n \n # Initialize the first ugly number\n ugly = 1\n \n for _ in range(n - 1):\n # Extract the smallest number from the heap\n ugly = heapq.heappop(heap)\n \n # For each prime, multiply it by the extracted number and push the result back to the heap\n for prime in primes:\n new_ugly = ugly * prime\n if new_ugly not in ugly_numbers:\n ugly_numbers.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n \n return ugly","memory":"449081"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n curr = 1\n vis = set()\n heap = primes.copy()\n heapify(heap)\n \n for i in range(n-1):\n curr = heappop(heap)\n for j in primes:\n alpha = curr * j\n if alpha not in vis:\n heappush(heap, alpha)\n vis.add(alpha)\n return curr","memory":"458755"},{"code":"from heapq import heappop, heappush\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [(1, 0)]\n while n:\n if n == 1:\n return heap[0][0]\n element, start_index = heappop(heap)\n for current_index, prime in enumerate(primes[start_index:], start=start_index):\n heappush(heap, (element * prime, current_index))\n n -= 1\n return -1","memory":"468429"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n q = [(1,0)]\n cnt = 0\n m = len(primes)\n while cnt < n:\n curr, max_p_idx = heapq.heappop(q)\n for i in range(max_p_idx,m):\n heapq.heappush(q, (curr*primes[i], i))\n cnt += 1\n return curr","memory":"478103"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n candidates = [(1,1)] #min_heap, (candidate, last_factor)\n\n cur = -1\n while n > 0:\n n -= 1\n cur, last_factor = heapq.heappop(candidates)\n\n for factor in primes:\n if factor < last_factor:\n continue\n heapq.heappush(candidates, (cur*factor, factor))\n return cur","memory":"487776"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n u_nums = [1]\n pn = len(primes)\n candidates = [deque([prime]) for prime in primes]\n visited = set()\n\n while len(u_nums) < n:\n candi_heads = [candi[0] for candi in candidates]\n min_candi_head = min(candi_heads)\n u_nums.append(min_candi_head)\n\n for i in range(pn):\n if candidates[i][0] == min_candi_head:\n candidates[i].popleft()\n next_candi = min_candi_head * primes[i]\n if next_candi not in visited:\n candidates[i].append(next_candi)\n visited.add(next_candi)\n \n return u_nums[n-1]\n","memory":"497450"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n candidates = [(1,0)] #min_heap, (candidate, last_factor_i)\n\n cur = -1\n while n > 0:\n n -= 1\n cur, last_factor_i = heapq.heappop(candidates)\n\n for i in range(last_factor_i, len(primes)):\n heapq.heappush(candidates, (cur*primes[i], i))\n return cur","memory":"507124"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n import heapq\n q = [(1, 1)]\n total = 0\n while total < n:\n curr, mf = heappop(q)\n total += 1\n for f in primes:\n if f >= mf: heappush(q, (f*curr, f))\n return curr","memory":"516798"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n u_nums = [1]\n pn = len(primes)\n candidates = [deque([prime]) for prime in primes]\n visited = set()\n\n while len(u_nums) < n:\n candi_heads = [candi[0] for candi in candidates]\n min_candi_head = min(candi_heads)\n u_nums.append(min_candi_head)\n\n for i in range(pn):\n if candidates[i][0] == min_candi_head:\n candidates[i].popleft()\n next_candi = min_candi_head * primes[i]\n if next_candi not in visited:\n candidates[i].append(next_candi)\n visited.add(next_candi)\n \n return u_nums[n-1]\n","memory":"526471"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n seen = {1}\n pq = [1]\n\n while n:\n num = heapq.heappop(pq)\n if n == 1:\n return num\n \n for prime in primes:\n new_num = num * prime\n if not new_num in seen:\n heapq.heappush(pq, new_num)\n seen.add(new_num)\n \n n -= 1\n\n","memory":"536145"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Initialize a min-heap to keep track of the smallest ugly numbers\n min_heap = []\n # Start with the first ugly number, which is 1\n min_heap.append(1)\n # A set to keep track of visited numbers to avoid duplicates\n vis = {1}\n # Variable to store the current smallest ugly number\n curr = 0\n\n # Iterate n times to find the nth super ugly number\n for i in range(n):\n # Pop the smallest number from the heap\n curr = heapq.heappop(min_heap)\n # Generate new ugly numbers by multiplying the current smallest number with each prime\n for prime in primes:\n new = curr * prime\n # If the generated number has not been visited yet, add it to the set and the heap\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n # Return the nth super ugly number\n return curr\n","memory":"545819"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","memory":"555493"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n res = set([1])\n h = [1]\n curr = 1\n for i in range(n):\n curr = heappop((h))\n for p in primes:\n val = curr * p\n if val not in res:\n heappush(h, val)\n res.add(val)\n return curr\n ","memory":"565166"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n visited = {1}\n curr = 0\n\n for _ in range(n - 1):\n curr = heappop(heap)\n for prime in primes:\n new = curr * prime\n if new not in visited:\n heappush(heap, new)\n visited.add(new)\n\n return heap[0]","memory":"574840"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n == 1:\n return 1\n \n the_heap = [1]\n populated = set([1])\n counter = 0\n the_number = 0\n while counter < n:\n the_one = heapq.heappop(the_heap)\n the_number = the_one\n\n temp = [i*the_one for i in primes]\n for t in temp:\n\n if t not in populated:\n heapq.heappush(the_heap, t)\n populated.add(t)\n counter += 1\n #print(populated)\n #print(the_heap)\n return the_number","memory":"584514"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap=[1]\n visited=set()\n visited.add(1)\n for i in range(n):\n tmp=heappop(heap)\n for prime in primes:\n newugly=prime*tmp\n if newugly not in visited:\n heappush(heap,newugly)\n visited.add(newugly)\n return tmp\n ","memory":"594188"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n seen = {1}\n u = 1\n for _ in range(n):\n u = heapq.heappop(heap)\n for i in primes:\n nu = u * i\n if nu not in seen:\n seen.add(nu)\n heapq.heappush(heap, nu)\n \n return u","memory":"603861"},{"code":"\"\"\"\nfor each p in prime\n(p1^n_1*p2*n_2 * .... * pn*n_n), (n_i >0)\n\n2^(a)*7^(b)*13^(c)*19^(d)\n\n_ _ _ _\nabcd\n0000\n\n1\n\n7,13,19\n\n2*2, 2*7, 2*13 2*19\n\n1000\n0100\n0010\n0001\n\n1100\n1010\n1001\n0110\n0101\n0011\n\n2000\n\n0000\n\n\n12 12 12 12\n\nn^4\n\n\n......\nIterate from 1 ....\nCHeck if prime factors are all in primes\nreturn the nths\n\n[2,7,13,19]\n\nugly_numbers = [1]\ni = 0\n\nsmallest = 1\ni = 1\n\nugly_numbers=[2,7,13,19]\n\nsmallest = 2\ni = 2\n\nugly_numbers = [4, 14, 26, 38]\nsmallest\n\n\"\"\"\n\nfrom bisect import insort\nimport heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ugly_numbers = []\n heapq.heappush(ugly_numbers, 1)\n seen = set()\n i = 0\n while True:\n smallest = heapq.heappop(ugly_numbers)\n i += 1\n if i == n:\n return smallest\n\n for num in primes:\n next_num = smallest * num\n if next_num not in seen:\n heapq.heappush(ugly_numbers, next_num)\n seen.add(next_num)\n\n\n \n ","memory":"613535"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n hp=[1]\n dc={1}\n i=1\n while n:\n mn=heapq.heappop(hp)\n if n==1: return mn\n for p in primes:\n newno=mn*p\n if newno in dc:\n continue\n heapq.heappush(hp,newno)\n dc.add(newno)\n n-=1","memory":"623209"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap = [] # similar to ugly number 2 approach\n min_heap.append(1) # first ugly number\n vis = {1} # 1 already visited\n curr = 0\n\n for i in range(n):\n curr = heapq.heappop(min_heap)\n for prime in primes:\n new = curr * prime\n if new not in vis:\n vis.add(new)\n heapq.heappush(min_heap, new)\n \n return curr","memory":"632883"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap, seen, ugly = [1],{1}, 1\n \n for _ in range(n):\n ugly = heapq.heappop(heap)\n for prime in primes:\n new_ugly = ugly* prime\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(heap,new_ugly)\n \n return ugly\n","memory":"632883"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n heapq.heapify(heap)\n visited = set()\n \n res = []\n\n while len(res) < n:\n res.append(heapq.heappop(heap))\n \n for j in range(len(primes)):\n num = res[-1] * primes[j]\n if num not in visited:\n heapq.heappush(heap, num)\n visited.add(num)\n \n return res[-1]\n ","memory":"642556"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # Initialize the heap with the first super ugly number (1)\n heap = [1]\n seen = {1}\n ugly_numbers = []\n\n for _ in range(n):\n # Pop the smallest number from the heap\n current_ugly = heapq.heappop(heap)\n ugly_numbers.append(current_ugly)\n\n # Generate new candidates by multiplying current ugly number with primes\n for prime in primes:\n new_ugly = current_ugly * prime\n if new_ugly not in seen:\n seen.add(new_ugly)\n heapq.heappush(heap, new_ugly)\n\n # Return the nth super ugly number\n return ugly_numbers[-1]\n\n# Example usage:\nsolution = Solution()\nn = 12\nprimes = [2, 7, 13, 19]\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32","memory":"642556"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n pending = [[1, 0]]\n count = 0\n while True:\n count += 1\n p, i = heappop(pending)\n if count == n:\n return p\n for j in range(i, len(primes)):\n heappush(pending, [p*primes[j], j])\n ","memory":"652230"},{"code":"import heapq as hq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n ans = []\n superUglyCandidates = [1]\n hq.heapify(superUglyCandidates)\n numDict = dict() # keep track of number ever present in heap\n numDict[1] = 1\n\n while True:\n\n heapMin = hq.heappop(superUglyCandidates)\n ans.append(heapMin)\n\n if len(ans) == n:\n break\n\n currCandidates = [heapMin * basePrime for basePrime in primes]\n for c in currCandidates:\n\n if numDict.get(c) is None:\n hq.heappush(superUglyCandidates, c)\n numDict[c] = 1\n\n return ans[-1]","memory":"661904"},{"code":"import heapq\n\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n minH = [1]\n visit = set()\n\n for i in range(n):\n numb = heapq.heappop(minH) \n if i == n - 1:\n return numb\n \n for p in primes:\n if numb*p not in visit:\n visit.add(numb * p)\n heapq.heappush(minH, numb*p)","memory":"671578"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = [1] + [p for p in primes]\n\n heapq.heapify(heap)\n visited = set(heap)\n\n q=-1\n\n while(n):\n q = heapq.heappop(heap)\n for p in primes:\n if q*p not in visited:\n visited.add(q*p)\n heapq.heappush(heap,q*p)\n\n n-=1\n\n return q\n\n\n # def dfs(i,cur,rem):\n # if rem==0:\n # return\n\n # heapq.heappush(heap,cur)\n\n # same_take = dfs(i,cur*primes[i],rem-1)\n # next_take = dfs(i+1,cur*primes[i],rem-1)\n # skip = dfs(i+1,cur,rem-1)\n\n # re\n\n\n","memory":"681251"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n minheap = [1]\n visit = set()\n for i in range(n):\n num = heapq.heappop(minheap)\n if i==n-1:\n return num\n for x in primes:\n if num*x not in visit:\n heapq.heappush(minheap,num*x)\n visit.add(num*x)\n\n\n","memory":"690925"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n if n==1:\n return 1\n pq=[1]\n self.n=n\n cache={1}\n while n-1>0:\n cur= heapq.heappop(pq)\n for prime in primes:\n if cur*prime not in cache :\n cache.add(cur*prime)\n heapq.heappush(pq,cur*prime )\n n-=1\n return heapq.heappop(pq)","memory":"700599"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n cur = 0\n num = [1]\n seen = set([1])\n while n:\n cur = heappop(num)\n n -= 1\n for i in primes:\n if i * cur not in seen:\n heappush(num, i * cur)\n seen.add(i * cur)\n return cur\n","memory":"710273"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n \n heap = [1] + [p for p in primes]\n\n heapq.heapify(heap)\n visited = set(heap)\n\n q=-1\n\n while(n):\n q = heapq.heappop(heap)\n for p in primes:\n if q*p not in visited:\n visited.add(q*p)\n heapq.heappush(heap,q*p)\n\n n-=1\n\n return q\n\n\n # def dfs(i,cur,rem):\n # if rem==0:\n # return\n\n # heapq.heappush(heap,cur)\n\n # same_take = dfs(i,cur*primes[i],rem-1)\n # next_take = dfs(i+1,cur*primes[i],rem-1)\n # skip = dfs(i+1,cur,rem-1)\n\n # re\n\n\n","memory":"719946"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n nextmin = [ 1 ]\n visited = set()\n for i in range(n) :\n ugly = heapq.heappop(nextmin)\n if i == n - 1:\n return ugly\n for prime in primes :\n if prime * ugly not in visited :\n visited.add(prime*ugly)\n heapq.heappush(nextmin,prime*ugly)","memory":"729620"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n h = [1]\n heapq.heapify(h)\n vis = {1}\n for i in range(n):\n cur = heapq.heappop(h)\n for p in primes:\n if p*cur not in vis:\n vis.add(p*cur)\n heapq.heappush(h, p*cur)\n return cur","memory":"739294"},{"code":"import heapq\nclass Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n #using a heap - similar to prims algorithm\n n_primes = len(primes)\n h = [1,]\n heapq.heapify(h)\n visited = set([1,])\n \n for _ in range(n):\n num = heapq.heappop(h)\n #add its neighbours to the heap\n for i in range(n_primes):\n if primes[i]*num not in visited:\n heapq.heappush(h, num*primes[i])\n visited.add(num*primes[i])\n return num","memory":"748968"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n min_heap=[1]\n seen=set()\n seen.add(1)\n\n for _ in range(n):\n number=heapq.heappop(min_heap)\n \n for p in primes:\n if p*number not in seen:\n heapq.heappush(min_heap,p*number)\n seen.add(p*number)\n \n return number","memory":"758641"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n # use a heap?\n if n == 1:\n return 1\n\n heap = [1]\n visited = set()\n visited.add(1)\n\n for _ in range(n-1):\n # get the smallest to work on\n small = heappop(heap)\n for p in primes:\n if p * small not in visited:\n visited.add(p*small)\n heappush(heap, p*small)\n # get the smallest\n return heap[0]","memory":"768315"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int: \n visited = set()\n ans = 1\n if n == 1:\n return ans \n heap = primes[:]\n for x in heap:\n visited.add(x) \n n -= 1\n heapq.heapify(heap)\n while heap and n > 0:\n ans = heapq.heappop(heap) \n for f in primes:\n if ans*f not in visited:\n visited.add(ans * f)\n heapq.heappush(heap, ans*f)\n n -= 1 \n return ans","memory":"777989"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n heap = [1]\n setto = set([1])\n heapq.heapify(heap)\n\n while True:\n #print(heap)\n val = heapq.heappop(heap)\n if n == 1:\n return val\n for prime in primes:\n if val*prime not in setto:\n setto.add(val*prime)\n heapq.heappush(heap, val*prime)\n n -= 1\n \n \n \n ","memory":"787663"},{"code":"class Solution:\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\n count = 0\n heap = [1] \n seen = set([1])\n answer = 1\n while count < n:\n #print(answer)\n answer = heappop(heap)\n count += 1\n for i in primes:\n if answer * i not in seen:\n seen.add(answer * i)\n heappush(heap, answer * i)\n return answer","memory":"787663"}],"string":"[\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1]\\n pointers = [0] * len(primes)\\n\\n while len(ugly_numbers) < n:\\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\\n ugly_numbers.append(next_ugly)\\n\\n for i in range(len(primes)):\\n if ugly_numbers[pointers[i]] * primes[i] == next_ugly:\\n pointers[i] += 1\\n\\n return ugly_numbers[-1]\\n \\n \",\n \"memory\": \"23436\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = [1]\\n pointers = [0] * len(primes)\\n while len(ugly_numbers) < n:\\n next_ugly = min(ugly_numbers[pointers[i]] * primes[i] for i in range(len(primes)))\\n ugly_numbers.append(next_ugly)\\n for i in range(len(primes)):\\n if next_ugly == ugly_numbers[pointers[i]] * primes[i]:\\n pointers[i] += 1\\n return ugly_numbers[-1]\",\n \"memory\": \"23436\"\n },\n {\n \"code\": \"from heapq import heappop, heappush\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [(1, 0, -1)]\\n while n:\\n if n == 1:\\n return heap[0][0]\\n element, start_index, last_generating_value = heappop(heap)\\n heappush(heap, (element * primes[start_index], start_index, element))\\n if start_index + 1 < len(primes) and last_generating_value != -1:\\n heappush(heap, (last_generating_value * primes[start_index + 1], start_index + 1, last_generating_value))\\n n -= 1\\n return -1\",\n \"memory\": \"33110\"\n },\n {\n \"code\": \"from heapq import heappop, heappush\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [(1, 0, -1)]\\n while n:\\n if n == 1:\\n return heap[0][0]\\n element, start_index, last_generating_value = heappop(heap)\\n heappush(heap, (element * primes[start_index], start_index, element))\\n if start_index + 1 < len(primes) and last_generating_value != -1:\\n heappush(heap, (last_generating_value * primes[start_index + 1], start_index + 1, last_generating_value))\\n n -= 1\\n return -1\",\n \"memory\": \"33110\"\n },\n {\n \"code\": \"from sortedcontainers import SortedSet\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n v = SortedSet()\\n for p in primes:\\n v.add(p)\\n ans = [1]\\n k = len(primes)\\n while len(ans) <=n:\\n a = v[0]\\n v.remove(a)\\n ans.append(a)\\n p = 0\\n while p<k:\\n if len(v)+len(ans)>n and v and a*primes[p]>v[-1]:\\n break\\n v.add(a*primes[p])\\n p+=1\\n print(ans)\\n return ans[n-1]\",\n \"memory\": \"42784\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n primes=sorted(primes)\\n hp=[1]\\n ans=set()\\n for _ in range(n):\\n val=heapq.heappop(hp)\\n for prime in primes: \\n heapq.heappush(hp,val*prime)\\n if val%prime==0: break\\n ans.add(val)\\n return sorted(list(set(ans)))[n-1]\",\n \"memory\": \"42784\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n queues = [deque([1]) for _ in primes]\\n ugly_nums = [1]\\n while len(ugly_nums) < n:\\n for i,q in enumerate(queues):\\n p = primes[i]\\n while p * q[0] <= ugly_nums[-1]:\\n q.popleft()\\n t = float(\\\"inf\\\")\\n t_ind = None\\n for i,q in enumerate(queues):\\n p = primes[i]\\n if p * q[0] < t:\\n t = p * q[0]\\n t_ind = i\\n queues[t_ind].popleft()\\n for q in queues:\\n q.append(t)\\n ugly_nums.append(t)\\n return ugly_nums[-1]\\n \",\n \"memory\": \"52458\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n plist = [[1] for _ in range(len(primes))]\\n\\n candidates = [None]* len(primes)\\n for i in range(len(primes)):\\n candidates[i] = plist[i][0] * primes[i]\\n output = [None]*n\\n output[0] = 1\\n\\n for i in range(1, n):\\n minval = min(candidates)\\n for j in range(len(plist)):\\n plist[j].append(minval)\\n\\n for j in range(len(candidates)):\\n if candidates[j] == minval:\\n plist[j].pop(0)\\n candidates[j] = plist[j][0]*primes[j]\\n output[i] = minval\\n \\n #print(output)\\n\\n return output[n-1]\\n \\n \\n\\n \",\n \"memory\": \"62131\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n m = len(primes)\\n helper = [[1] for _ in range(m)]\\n indices = [0 for _ in range(m)]\\n\\n for i in range(n-1):\\n nextUglyNumber = min([helper[j][indices[j]] * primes[j] for j in range(m)])\\n for j in range(m):\\n helper[j].append(nextUglyNumber)\\n if nextUglyNumber % primes[j] == 0:\\n indices[j] += 1\\n return helper[0][-1]\\n\\n\\n\\n \",\n \"memory\": \"71805\"\n },\n {\n \"code\": \"import heapq\\nfrom collections import deque\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n primes.sort()\\n lists = []\\n q = []\\n for i, p in enumerate(primes):\\n lists.append(deque([p]))\\n q.append((p, i))\\n heapq.heapify(q)\\n qsize = len(primes)\\n\\n i = 1\\n s = 1\\n while i < n:\\n t = heapq.heappop(q)\\n lists[t[1]].popleft()\\n\\n if t[0] == s:\\n if lists[t[1]]:\\n heapq.heappush(q, (lists[t[1]][0], t[1]))\\n continue\\n s = t[0]\\n # print(i, s, t[1])\\n \\n for j, p in enumerate(primes):\\n if i + len(lists[j]) <= n:\\n lists[j].append(s * p)\\n\\n if len(lists[j]) == 1:\\n heapq.heappush(q, (lists[j][0], j))\\n\\n if len(lists[t[1]]) > 1:\\n heapq.heappush(q, (lists[t[1]][0], t[1]))\\n # print(q)\\n i += 1\\n\\n return s\\n \",\n \"memory\": \"81479\"\n },\n {\n \"code\": \"import heapq\\nfrom collections import deque\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n primes.sort()\\n lists = []\\n q = []\\n for i, p in enumerate(primes):\\n lists.append(deque([p]))\\n q.append((p, i))\\n heapq.heapify(q)\\n qsize = len(primes)\\n\\n i = 1\\n s = 1\\n while i < n:\\n t = heapq.heappop(q)\\n lists[t[1]].popleft()\\n\\n if t[0] == s:\\n if lists[t[1]]:\\n heapq.heappush(q, (lists[t[1]][0], t[1]))\\n continue\\n s = t[0]\\n # print(i, s, t[1])\\n \\n for j, p in enumerate(primes):\\n if i + len(lists[j]) <= n:\\n lists[j].append(s * p)\\n\\n if len(lists[j]) == 1:\\n heapq.heappush(q, (lists[j][0], j))\\n\\n if len(lists[t[1]]) > 1:\\n heapq.heappush(q, (lists[t[1]][0], t[1]))\\n # print(q)\\n i += 1\\n\\n return s\\n \",\n \"memory\": \"91153\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n==1:\\n return 1\\n pointers=[-1]*len(primes)\\n minheap=[]\\n heapq.heapify(minheap)\\n out=[1]\\n outset=set(out)\\n pointers[0]=0\\n\\n while True:\\n i=0\\n minval=float('inf')\\n while i<len(primes) and pointers[i]>=0:\\n if pointers[i]<len(out):\\n val=out[pointers[i]]*primes[i]\\n minval=min(minval,val)\\n heapq.heappush(minheap,val)\\n pointers[i]+=1\\n i+=1\\n while minheap and minheap[0]<=minval:\\n elem=heapq.heappop(minheap)\\n if elem not in outset:\\n out.append(elem)\\n outset.add(elem)\\n if len(out)>=n:\\n return out[n-1]\\n if i<len(primes):\\n pointers[i]=0\\n\",\n \"memory\": \"100826\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n==1:\\n return 1\\n pointers=[-1]*len(primes)\\n minheap=[]\\n heapq.heapify(minheap)\\n out=[1]\\n outset=set(out)\\n pointers[0]=0\\n\\n while True:\\n i=0\\n minval=float('inf')\\n while i<len(primes) and pointers[i]>=0:\\n if pointers[i]<len(out):\\n val=out[pointers[i]]*primes[i]\\n minval=min(minval,val)\\n heapq.heappush(minheap,val)\\n pointers[i]+=1\\n i+=1\\n while minheap and minheap[0]<=minval:\\n elem=heapq.heappop(minheap)\\n if elem not in outset:\\n out.append(elem)\\n outset.add(elem)\\n if len(out)>=n:\\n return out[n-1]\\n if i<len(primes):\\n pointers[i]=0\\n\",\n \"memory\": \"110500\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = []\\n heapq.heappush(heap, 1)\\n uglyNumber = -1\\n \\n while n != 0:\\n uglyNumber = heapq.heappop(heap)\\n\\n heapq.heappush(heap, uglyNumber * primes[-1])\\n for index in range(len(primes) - 2, -1, -1):\\n if uglyNumber % primes[index + 1] == 0: break\\n heapq.heappush(heap, uglyNumber * primes[index])\\n n -= 1\\n \\n return uglyNumber\",\n \"memory\": \"120174\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = []\\n heapq.heappush(heap, 1)\\n uglyNumber = -1\\n \\n for _ in range(n):\\n uglyNumber = heapq.heappop(heap)\\n heapq.heappush(heap, uglyNumber * primes[-1])\\n for index in range(len(primes) - 2, -1, -1):\\n if uglyNumber % primes[index + 1] == 0: break\\n heapq.heappush(heap, uglyNumber * primes[index])\\n \\n return uglyNumber\",\n \"memory\": \"129848\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n dp = [1] * n\\n m = len(primes)\\n indexes = [0] * m\\n uglys = primes[:]\\n for i in range(1, n):\\n nxt_ugly = min(uglys)\\n dp[i] = nxt_ugly\\n for j in range(m):\\n if nxt_ugly == uglys[j]:\\n indexes[j] += 1\\n uglys[j] = dp[indexes[j]] * primes[j]\\n return dp[n - 1]\\n\\n\\nfrom heapq import heappop, heappush\\n\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n pq = [1]\\n m = len(primes)\\n for _ in range(n):\\n ans = heappop(pq)\\n for i in range(m - 1, 0, -1):\\n if ans % primes[i] == 0:\\n for j in range(i, m):\\n heappush(pq, ans * primes[j])\\n break\\n else:\\n for j in range(m):\\n heappush(pq, ans * primes[j])\\n return ans\\n\",\n \"memory\": \"139521\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n<=2:\\n return n\\n lp = len(primes)\\n ne = [ [p] for p in primes ]\\n cand = [ (p,i) for i,p in enumerate(primes) ]\\n heapq.heapify(cand)\\n cnt = 2\\n while True:\\n #print(\\\"\\\\n\\\", cnt)\\n #print(ne)\\n #print(cand)\\n pv,ps = heapq.heappop(cand)\\n if cnt == n:\\n return pv\\n cnt += 1\\n ne[ps].pop(0)\\n for psi in range(ps,lp):\\n v = pv*primes[psi]\\n ne[psi].append(v)\\n heapq.heappush(cand, (ne[ps][0],ps))\\n \\n \",\n \"memory\": \"149195\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = []\\n heapq.heappush(heap, 1)\\n uglyNumber = -1\\n \\n for _ in range(n):\\n uglyNumber = heapq.heappop(heap)\\n heapq.heappush(heap, uglyNumber * primes[-1])\\n for index in range(len(primes) - 2, -1, -1):\\n if uglyNumber % primes[index + 1] == 0: break\\n heapq.heappush(heap, uglyNumber * primes[index])\\n \\n return uglyNumber\",\n \"memory\": \"158869\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n numbers = [1]\\n candidates = []\\n \\n for _ in range(n):\\n for p in primes:\\n heapq.heappush(candidates, numbers[-1] * p)\\n while len(candidates) > 0:\\n new_number = heapq.heappop(candidates)\\n if numbers[-1] != new_number:\\n numbers.append(new_number)\\n break\\n \\n return numbers[n-1]\\n\",\n \"memory\": \"168543\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n from heapq import heappush,heappop\\n res = 1\\n lp = [deque([p]) for p in primes]\\n count = 1\\n while count < n:\\n m = lp[0][0]\\n for q in lp:\\n if q[0] < m:\\n m = q[0]\\n res = m\\n for i,q in enumerate(lp):\\n q.append(res*primes[i])\\n if q[0] == res:\\n q.popleft()\\n count += 1\\n return res\",\n \"memory\": \"178216\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n x = 1\\n queues = [deque([i]) for i in primes]\\n for _ in range(n - 1):\\n i = 0\\n x = queues[0][0]\\n for k in range(1, len(queues)):\\n if queues[k][0] < x:\\n i = k\\n x = queues[k][0]\\n for k in range(len(queues)):\\n if queues[k][0] == x:\\n queues[k].popleft()\\n queues[k].append(primes[k] * x)\\n return x\\n\",\n \"memory\": \"187890\"\n },\n {\n \"code\": \"# key idea. the brute force inefficiently goes from one super ugly\\n# number to the next, by just going through every number and \\n# checking it. however, there might be a shortcut with this key idea.\\n# every super ugly number in the sequence has the same set of prime \\n# factors. wait. so we know if we take a super ugly number and \\n# multiply it by those factors, we get a bigger super ugly number.\\n# but we don't know if it is necessarily the next super ugly number.\\n# so using a heap allows us to repeatedly find the next super ugly number.\\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\\n# But that is way way way better in terms of time. and space probably a bit worse\\n# but that's okay.\\n\\n\\n# [2,7,13,19]\\n# [1,2,4,7,8,13,14,16,19,26,28,32]\\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\\n\\n# [8 13 14 19 26 28 38 49 52 76]\\n# 1 2 4 7\\n\\nfrom heapq import *\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [1]\\n res = []\\n while len(res) != n:\\n curr = heappop(min_heap)\\n while res and curr == res[-1]:\\n curr = heappop(min_heap)\\n res.append(curr)\\n for prime in primes:\\n heappush(min_heap, prime * curr)\\n print(res)\\n return res[-1]\",\n \"memory\": \"197564\"\n },\n {\n \"code\": \"# key idea. the brute force inefficiently goes from one super ugly\\n# number to the next, by just going through every number and \\n# checking it. however, there might be a shortcut with this key idea.\\n# every super ugly number in the sequence has the same set of prime \\n# factors. wait. so we know if we take a super ugly number and \\n# multiply it by those factors, we get a bigger super ugly number.\\n# but we don't know if it is necessarily the next super ugly number.\\n# so using a heap allows us to repeatedly find the next super ugly number.\\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\\n# But that is way way way better in terms of time. and space probably a bit worse\\n# but that's okay. this is kind of like how we use a heap to merge \\n# k sorted lists. prime factorization theorem is also useful in visualizing this.\\n\\n\\n# [2,7,13,19]\\n# [1,2,4,7,8,13,14,16,19,26,28,32]\\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\\n\\n# [8 13 14 19 26 28 38 49 52 76]\\n# 1 2 4 7\\n\\nfrom heapq import *\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [1]\\n res = []\\n while len(res) != n:\\n curr = heappop(min_heap)\\n while res and curr == res[-1]:\\n curr = heappop(min_heap)\\n res.append(curr)\\n for prime in primes:\\n heappush(min_heap, prime * curr)\\n print(res)\\n return res[-1]\",\n \"memory\": \"197564\"\n },\n {\n \"code\": \"# key idea. the brute force inefficiently goes from one super ugly\\n# number to the next, by just going through every number and \\n# checking it. however, there might be a shortcut with this key idea.\\n# every super ugly number in the sequence has the same set of prime \\n# factors. wait. so we know if we take a super ugly number and \\n# multiply it by those factors, we get a bigger super ugly number.\\n# but we don't know if it is necessarily the next super ugly number.\\n# so using a heap allows us to repeatedly find the next super ugly number.\\n# Compare time complexities with brute force: O(N^3) VS O(NlogN) highly approximated\\n# But that is way way way better in terms of time. and space probably a bit worse\\n# but that's okay.\\n\\n\\n# [2,7,13,19]\\n# [1,2,4,7,8,13,14,16,19,26,28,32]\\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\\n\\n# [8 13 14 19 26 28 38 49 52 76]\\n# 1 2 4 7\\n\\nfrom heapq import *\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [1]\\n res = []\\n while len(res) != n:\\n curr = heappop(min_heap)\\n while res and curr == res[-1]:\\n curr = heappop(min_heap)\\n res.append(curr)\\n for prime in primes:\\n heappush(min_heap, prime * curr)\\n print(res)\\n return res[-1]\",\n \"memory\": \"207238\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n a = [1]\\n heapq.heapify(a)\\n ans = 1\\n s =set()\\n while n>0:\\n ans = heapq.heappop(a)\\n if(ans in s):\\n continue\\n s.add(ans)\\n n-=1\\n for p in primes:\\n heapq.heappush(a,ans*p)\\n return ans\\n\\n \",\n \"memory\": \"216911\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n print(primes)\\n boundary = primes.copy()\\n heapq.heapify(boundary)\\n seen = set()\\n count = 1\\n\\n while count < n:\\n val = heapq.heappop(boundary)\\n \\n if val in seen: continue\\n count += 1\\n seen.add(val)\\n\\n if count == n:\\n return val\\n\\n for prime in primes:\\n heapq.heappush(boundary, prime * val)\\n\\n return 1\",\n \"memory\": \"226585\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n cache = set([1])\\n options = primes.copy()\\n heapq.heapify(options)\\n\\n while len(cache) < n:\\n minVal = heapq.heappop(options)\\n if minVal in cache: continue\\n cache.add(minVal)\\n for prime in primes:\\n if not minVal * prime in cache:\\n heapq.heappush(options, minVal * prime)\\n return max(cache)\\n\",\n \"memory\": \"236259\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n nums = set()\\n q = [1]\\n while len(nums) < n:\\n v = heappop(q)\\n if v not in nums:\\n nums.add(v)\\n for p in primes:\\n if v * p not in nums:\\n heappush(q, v * p)\\n return max(nums)\\n\\n\\n \",\n \"memory\": \"245933\"\n },\n {\n \"code\": \"#Attempt 1:\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n q = [[] for _ in range(0, len(primes))]\\n curr = 1\\n\\n #generate ugly numbers 2 to n\\n for i in range(2, n+1):\\n #append ugly number candidates to queues\\n for j in range(0, len(primes)):\\n q[j].append(curr*primes[j])\\n\\n #find and pop the minimum candidate from all queues\\n curr = min([q[j][0] for j in range(0, len(primes))])\\n for j in range(0, len(primes)):\\n if q[j][0] == curr:\\n q[j].pop(0)\\n\\n\\n #return nth super ugly number\\n return curr\",\n \"memory\": \"255606\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n diruses = {}\\n q = [1]\\n iterr = 0 \\n t = 0\\n \\n while iterr < n:\\n\\n t = heappop(q)\\n while t in diruses:\\n t = heappop(q)\\n \\n diruses[t] = 1\\n\\n for p in primes:\\n heappush(q,p*t) \\n\\n iterr += 1\\n\\n return t\",\n \"memory\": \"265280\"\n },\n {\n \"code\": \"#Attempt 1 (Accepted on August 19, 2024):\\n#Runtime: 7886 ms, faster than 5.14% of Python3 online submissions for Super Ugly Number.\\n#Memory Usage: 402.78 MB, less than 41.32% of Python3 online submissions for Super Ugly Number.\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n q = [[] for _ in range(0, len(primes))]\\n curr = 1\\n\\n #generate ugly numbers 2 to n\\n for i in range(2, n+1):\\n #append ugly number candidates to queues\\n for j in range(0, len(primes)):\\n q[j].append(curr*primes[j])\\n\\n #find and pop the minimum candidate from all queues\\n curr = min([q[j][0] for j in range(0, len(primes))])\\n for j in range(0, len(primes)):\\n if q[j][0] == curr:\\n q[j].pop(0)\\n\\n #return nth super ugly number\\n return curr\",\n \"memory\": \"274954\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n import heapq\\n #minheap\\n nums={}\\n heap=[1]\\n cnum=0\\n counter=0\\n while counter<n:\\n cnum=heappop(heap)\\n if cnum not in nums:\\n counter+=1\\n nums[cnum]=1\\n for prime in primes:\\n heappush(heap,cnum*prime)\\n return cnum \\n \",\n \"memory\": \"284628\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n res = []\\n\\n listx = [1]\\n\\n heapq.heapify(listx)\\n dictx = {}\\n\\n while n > 0:\\n x = heapq.heappop(listx)\\n if x not in dictx.keys():\\n for each in primes:\\n x1 = x*each\\n if x1 not in dictx.keys():\\n heapq.heappush(listx, x1)\\n res.append(x)\\n dictx[x] = 1\\n n -= 1\\n else:\\n continue\\n \\n return res[-1]\\n \",\n \"memory\": \"303975\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n prior = PriorityQueue()\\n prior.put(1)\\n ugly = -1\\n for i in range(n):\\n num = prior.get()\\n while num <= ugly:\\n num = prior.get()\\n ugly = num\\n for num in primes:\\n prior.put(ugly*num)\\n return ugly\\n\",\n \"memory\": \"313649\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n prior = PriorityQueue()\\n prior.put(1)\\n ugly = -1\\n for i in range(n):\\n num = prior.get()\\n while num <= ugly:\\n num = prior.get()\\n ugly = num\\n for num in primes:\\n prior.put(ugly*num)\\n return ugly\\n\",\n \"memory\": \"323323\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = []\\n heapq.heappush(heap, 1)\\n uglyNumber = -1\\n prevUglyNumber = -1\\n \\n while n != 0:\\n uglyNumber = heapq.heappop(heap)\\n if uglyNumber == prevUglyNumber: continue\\n for prime in primes:\\n heapq.heappush(heap, uglyNumber * prime)\\n prevUglyNumber = uglyNumber\\n n -= 1\\n \\n return uglyNumber\",\n \"memory\": \"332996\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n hq = [1]\\n\\n for _ in range(n - 1):\\n n = heappop(hq)\\n while len(hq) > 0 and hq[0] == n:\\n heappop(hq)\\n for prime in primes:\\n heappush(hq, prime * n)\\n\\n return heappop(hq)\\n\\n\\n\\\"\\\"\\\"\\n\\n8 28 52 46 14 26 38 7 13 19\\n\\n1 2 4\\n\\n\\\"\\\"\\\"\",\n \"memory\": \"342670\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n prior = PriorityQueue()\\n prior.put(1)\\n ugly = -1\\n for i in range(n):\\n num = prior.get()\\n while num <= ugly:\\n num = prior.get()\\n ugly = num\\n for num in primes:\\n prior.put(ugly*num)\\n return ugly\\n\",\n \"memory\": \"352344\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n from heapq import heappush,heappop\\n res = 0\\n heap = [1]\\n count = 0\\n while count < n:\\n res = heappop(heap)\\n count += 1\\n for prime in primes:\\n heappush(heap,prime*res)\\n while heap[0] == res:\\n heappop(heap)\\n return res\",\n \"memory\": \"362018\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1: return 1\\n \\n hq = [1]\\n heapq.heapify(hq)\\n last = None\\n while n > 0:\\n now = heapq.heappop(hq)\\n while len(hq) and last == now:\\n now = heapq.heappop(hq)\\n last = now\\n for p in primes:\\n heapq.heappush(hq, p * now)\\n n -= 1\\n \\n return last\\n\\n\",\n \"memory\": \"371691\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n value = 1\\n minHeap = [value]\\n\\n while n:\\n value = heapq.heappop(minHeap)\\n while minHeap and minHeap[0] == value:\\n heapq.heappop(minHeap)\\n\\n for p in primes:\\n heapq.heappush(minHeap, p * value)\\n\\n n -= 1 \\n\\n return value\",\n \"memory\": \"381365\"\n },\n {\n \"code\": \"from heapq import heappop,heappush\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap=[1]\\n c=1\\n prv=0\\n while c<=n:\\n curr=heappop(heap)\\n if curr!=prv:\\n for p in primes:\\n heappush(heap,curr*p)\\n c=c+1\\n prv=curr\\n return curr\\n \",\n \"memory\": \"391039\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans=-1\\n q=[1]\\n while(n>0):\\n a=heappop(q)\\n if(ans==a):\\n continue\\n ans=a\\n n-=1\\n for i in primes:\\n heappush(q,i*a)\\n return ans\",\n \"memory\": \"400713\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n prior = PriorityQueue()\\n prior.put(1)\\n ugly = -1\\n for i in range(n):\\n num = prior.get()\\n while num <= ugly:\\n num = prior.get()\\n ugly = num\\n for num in primes:\\n prior.put(ugly*num)\\n return ugly\\n\",\n \"memory\": \"410386\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = list(primes)\\n heapify(heap)\\n if n == 1:\\n return 1\\n while True:\\n u = heappop(heap)\\n while heap and heap[0] == u:\\n heappop(heap)\\n # print(u)\\n n -= 1\\n if n == 1:\\n return u\\n for p in primes:\\n if p > u:\\n break\\n heappush(heap, u*p)\",\n \"memory\": \"420060\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n prev = 1\\n if n == 1: return prev\\n heap = primes[:]\\n heapq.heapify(heap)\\n n -= 1\\n while n > 0:\\n val = heapq.heappop(heap)\\n if val != prev:\\n prev = val\\n for prime in primes:\\n heapq.heappush(heap, prime*prev)\\n n -= 1\\n return prev\\n\",\n \"memory\": \"429734\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minHeap=[]\\n ans=[1]\\n no=len(primes)\\n count=1\\n while count<n:\\n for i in range(1,no+1):\\n if count>=i:\\n heapq.heappush(minHeap,ans[-i]*primes[i-1])\\n else:\\n break\\n while minHeap[0]==ans[-1]:\\n heapq.heappop(minHeap)\\n ans.append(minHeap[0])\\n heapq.heappop(minHeap)\\n count+=1\\n return ans[-1]\",\n \"memory\": \"429734\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) :\\n \\n memo = [1] \\n pointers = [0] * len(primes) \\n\\n def recursive_find(k):\\n if k < len(memo):\\n return memo[k]\\n \\n next_vals = [primes[i] * memo[pointers[i]] for i in range(len(primes))]\\n next_val = min(next_vals)\\n memo.append(next_val)\\n \\n for i in range(len(primes)):\\n if next_val == primes[i] * memo[pointers[i]]:\\n pointers[i] += 1\\n \\n return recursive_find(k)\\n \\n return recursive_find(n - 1)\\n\",\n \"memory\": \"439408\"\n },\n {\n \"code\": \"# key idea. the brute force inefficiently goes from one super ugly\\n# number to the next, by just going through every number and \\n# checking it. however, there might be a shortcut with this key idea.\\n# every super ugly number in the sequence has the same set of prime \\n# factors. wait. \\n\\n# [2,7,13,19]\\n# [1,2,4,7,8,13,14,16,19,26,28,32]\\n# [1,2,2^2,7,2^3,13,2*7,2^4,19,2*13,2^2*7,2^5]\\n\\n# [8 13 14 19 26 28 38 49 52 76]\\n# 1 2 4 7\\n\\nfrom heapq import *\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n seen = set()\\n min_heap = [1]\\n res = []\\n while len(res) != n:\\n curr = heappop(min_heap)\\n while curr in seen:\\n curr = heappop(min_heap)\\n res.append(curr)\\n seen.add(curr)\\n for prime in primes:\\n heappush(min_heap, prime * curr)\\n print(res)\\n return res[-1]\",\n \"memory\": \"439408\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = primes[:]\\n heapq.heapify(heap)\\n \\n # Set to keep track of the generated ugly numbers\\n ugly_numbers = {1}\\n \\n # Initialize the first ugly number\\n ugly = 1\\n \\n for _ in range(n - 1):\\n # Extract the smallest number from the heap\\n ugly = heapq.heappop(heap)\\n \\n # For each prime, multiply it by the extracted number and push the result back to the heap\\n for prime in primes:\\n new_ugly = ugly * prime\\n if new_ugly not in ugly_numbers:\\n ugly_numbers.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n \\n return ugly\",\n \"memory\": \"449081\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = primes[:]\\n heapq.heapify(heap)\\n \\n # Set to keep track of the generated ugly numbers\\n ugly_numbers = {1}\\n \\n # Initialize the first ugly number\\n ugly = 1\\n \\n for _ in range(n - 1):\\n # Extract the smallest number from the heap\\n ugly = heapq.heappop(heap)\\n \\n # For each prime, multiply it by the extracted number and push the result back to the heap\\n for prime in primes:\\n new_ugly = ugly * prime\\n if new_ugly not in ugly_numbers:\\n ugly_numbers.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n \\n return ugly\",\n \"memory\": \"449081\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n curr = 1\\n vis = set()\\n heap = primes.copy()\\n heapify(heap)\\n \\n for i in range(n-1):\\n curr = heappop(heap)\\n for j in primes:\\n alpha = curr * j\\n if alpha not in vis:\\n heappush(heap, alpha)\\n vis.add(alpha)\\n return curr\",\n \"memory\": \"458755\"\n },\n {\n \"code\": \"from heapq import heappop, heappush\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [(1, 0)]\\n while n:\\n if n == 1:\\n return heap[0][0]\\n element, start_index = heappop(heap)\\n for current_index, prime in enumerate(primes[start_index:], start=start_index):\\n heappush(heap, (element * prime, current_index))\\n n -= 1\\n return -1\",\n \"memory\": \"468429\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n q = [(1,0)]\\n cnt = 0\\n m = len(primes)\\n while cnt < n:\\n curr, max_p_idx = heapq.heappop(q)\\n for i in range(max_p_idx,m):\\n heapq.heappush(q, (curr*primes[i], i))\\n cnt += 1\\n return curr\",\n \"memory\": \"478103\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n candidates = [(1,1)] #min_heap, (candidate, last_factor)\\n\\n cur = -1\\n while n > 0:\\n n -= 1\\n cur, last_factor = heapq.heappop(candidates)\\n\\n for factor in primes:\\n if factor < last_factor:\\n continue\\n heapq.heappush(candidates, (cur*factor, factor))\\n return cur\",\n \"memory\": \"487776\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n u_nums = [1]\\n pn = len(primes)\\n candidates = [deque([prime]) for prime in primes]\\n visited = set()\\n\\n while len(u_nums) < n:\\n candi_heads = [candi[0] for candi in candidates]\\n min_candi_head = min(candi_heads)\\n u_nums.append(min_candi_head)\\n\\n for i in range(pn):\\n if candidates[i][0] == min_candi_head:\\n candidates[i].popleft()\\n next_candi = min_candi_head * primes[i]\\n if next_candi not in visited:\\n candidates[i].append(next_candi)\\n visited.add(next_candi)\\n \\n return u_nums[n-1]\\n\",\n \"memory\": \"497450\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n candidates = [(1,0)] #min_heap, (candidate, last_factor_i)\\n\\n cur = -1\\n while n > 0:\\n n -= 1\\n cur, last_factor_i = heapq.heappop(candidates)\\n\\n for i in range(last_factor_i, len(primes)):\\n heapq.heappush(candidates, (cur*primes[i], i))\\n return cur\",\n \"memory\": \"507124\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n import heapq\\n q = [(1, 1)]\\n total = 0\\n while total < n:\\n curr, mf = heappop(q)\\n total += 1\\n for f in primes:\\n if f >= mf: heappush(q, (f*curr, f))\\n return curr\",\n \"memory\": \"516798\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n u_nums = [1]\\n pn = len(primes)\\n candidates = [deque([prime]) for prime in primes]\\n visited = set()\\n\\n while len(u_nums) < n:\\n candi_heads = [candi[0] for candi in candidates]\\n min_candi_head = min(candi_heads)\\n u_nums.append(min_candi_head)\\n\\n for i in range(pn):\\n if candidates[i][0] == min_candi_head:\\n candidates[i].popleft()\\n next_candi = min_candi_head * primes[i]\\n if next_candi not in visited:\\n candidates[i].append(next_candi)\\n visited.add(next_candi)\\n \\n return u_nums[n-1]\\n\",\n \"memory\": \"526471\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n seen = {1}\\n pq = [1]\\n\\n while n:\\n num = heapq.heappop(pq)\\n if n == 1:\\n return num\\n \\n for prime in primes:\\n new_num = num * prime\\n if not new_num in seen:\\n heapq.heappush(pq, new_num)\\n seen.add(new_num)\\n \\n n -= 1\\n\\n\",\n \"memory\": \"536145\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Initialize a min-heap to keep track of the smallest ugly numbers\\n min_heap = []\\n # Start with the first ugly number, which is 1\\n min_heap.append(1)\\n # A set to keep track of visited numbers to avoid duplicates\\n vis = {1}\\n # Variable to store the current smallest ugly number\\n curr = 0\\n\\n # Iterate n times to find the nth super ugly number\\n for i in range(n):\\n # Pop the smallest number from the heap\\n curr = heapq.heappop(min_heap)\\n # Generate new ugly numbers by multiplying the current smallest number with each prime\\n for prime in primes:\\n new = curr * prime\\n # If the generated number has not been visited yet, add it to the set and the heap\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n # Return the nth super ugly number\\n return curr\\n\",\n \"memory\": \"545819\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"memory\": \"555493\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n res = set([1])\\n h = [1]\\n curr = 1\\n for i in range(n):\\n curr = heappop((h))\\n for p in primes:\\n val = curr * p\\n if val not in res:\\n heappush(h, val)\\n res.add(val)\\n return curr\\n \",\n \"memory\": \"565166\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n visited = {1}\\n curr = 0\\n\\n for _ in range(n - 1):\\n curr = heappop(heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in visited:\\n heappush(heap, new)\\n visited.add(new)\\n\\n return heap[0]\",\n \"memory\": \"574840\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n == 1:\\n return 1\\n \\n the_heap = [1]\\n populated = set([1])\\n counter = 0\\n the_number = 0\\n while counter < n:\\n the_one = heapq.heappop(the_heap)\\n the_number = the_one\\n\\n temp = [i*the_one for i in primes]\\n for t in temp:\\n\\n if t not in populated:\\n heapq.heappush(the_heap, t)\\n populated.add(t)\\n counter += 1\\n #print(populated)\\n #print(the_heap)\\n return the_number\",\n \"memory\": \"584514\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap=[1]\\n visited=set()\\n visited.add(1)\\n for i in range(n):\\n tmp=heappop(heap)\\n for prime in primes:\\n newugly=prime*tmp\\n if newugly not in visited:\\n heappush(heap,newugly)\\n visited.add(newugly)\\n return tmp\\n \",\n \"memory\": \"594188\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n seen = {1}\\n u = 1\\n for _ in range(n):\\n u = heapq.heappop(heap)\\n for i in primes:\\n nu = u * i\\n if nu not in seen:\\n seen.add(nu)\\n heapq.heappush(heap, nu)\\n \\n return u\",\n \"memory\": \"603861\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nfor each p in prime\\n(p1^n_1*p2*n_2 * .... * pn*n_n), (n_i >0)\\n\\n2^(a)*7^(b)*13^(c)*19^(d)\\n\\n_ _ _ _\\nabcd\\n0000\\n\\n1\\n\\n7,13,19\\n\\n2*2, 2*7, 2*13 2*19\\n\\n1000\\n0100\\n0010\\n0001\\n\\n1100\\n1010\\n1001\\n0110\\n0101\\n0011\\n\\n2000\\n\\n0000\\n\\n\\n12 12 12 12\\n\\nn^4\\n\\n\\n......\\nIterate from 1 ....\\nCHeck if prime factors are all in primes\\nreturn the nths\\n\\n[2,7,13,19]\\n\\nugly_numbers = [1]\\ni = 0\\n\\nsmallest = 1\\ni = 1\\n\\nugly_numbers=[2,7,13,19]\\n\\nsmallest = 2\\ni = 2\\n\\nugly_numbers = [4, 14, 26, 38]\\nsmallest\\n\\n\\\"\\\"\\\"\\n\\nfrom bisect import insort\\nimport heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ugly_numbers = []\\n heapq.heappush(ugly_numbers, 1)\\n seen = set()\\n i = 0\\n while True:\\n smallest = heapq.heappop(ugly_numbers)\\n i += 1\\n if i == n:\\n return smallest\\n\\n for num in primes:\\n next_num = smallest * num\\n if next_num not in seen:\\n heapq.heappush(ugly_numbers, next_num)\\n seen.add(next_num)\\n\\n\\n \\n \",\n \"memory\": \"613535\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n hp=[1]\\n dc={1}\\n i=1\\n while n:\\n mn=heapq.heappop(hp)\\n if n==1: return mn\\n for p in primes:\\n newno=mn*p\\n if newno in dc:\\n continue\\n heapq.heappush(hp,newno)\\n dc.add(newno)\\n n-=1\",\n \"memory\": \"623209\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap = [] # similar to ugly number 2 approach\\n min_heap.append(1) # first ugly number\\n vis = {1} # 1 already visited\\n curr = 0\\n\\n for i in range(n):\\n curr = heapq.heappop(min_heap)\\n for prime in primes:\\n new = curr * prime\\n if new not in vis:\\n vis.add(new)\\n heapq.heappush(min_heap, new)\\n \\n return curr\",\n \"memory\": \"632883\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap, seen, ugly = [1],{1}, 1\\n \\n for _ in range(n):\\n ugly = heapq.heappop(heap)\\n for prime in primes:\\n new_ugly = ugly* prime\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(heap,new_ugly)\\n \\n return ugly\\n\",\n \"memory\": \"632883\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n heapq.heapify(heap)\\n visited = set()\\n \\n res = []\\n\\n while len(res) < n:\\n res.append(heapq.heappop(heap))\\n \\n for j in range(len(primes)):\\n num = res[-1] * primes[j]\\n if num not in visited:\\n heapq.heappush(heap, num)\\n visited.add(num)\\n \\n return res[-1]\\n \",\n \"memory\": \"642556\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # Initialize the heap with the first super ugly number (1)\\n heap = [1]\\n seen = {1}\\n ugly_numbers = []\\n\\n for _ in range(n):\\n # Pop the smallest number from the heap\\n current_ugly = heapq.heappop(heap)\\n ugly_numbers.append(current_ugly)\\n\\n # Generate new candidates by multiplying current ugly number with primes\\n for prime in primes:\\n new_ugly = current_ugly * prime\\n if new_ugly not in seen:\\n seen.add(new_ugly)\\n heapq.heappush(heap, new_ugly)\\n\\n # Return the nth super ugly number\\n return ugly_numbers[-1]\\n\\n# Example usage:\\nsolution = Solution()\\nn = 12\\nprimes = [2, 7, 13, 19]\\nprint(solution.nthSuperUglyNumber(n, primes)) # Output: 32\",\n \"memory\": \"642556\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n pending = [[1, 0]]\\n count = 0\\n while True:\\n count += 1\\n p, i = heappop(pending)\\n if count == n:\\n return p\\n for j in range(i, len(primes)):\\n heappush(pending, [p*primes[j], j])\\n \",\n \"memory\": \"652230\"\n },\n {\n \"code\": \"import heapq as hq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n ans = []\\n superUglyCandidates = [1]\\n hq.heapify(superUglyCandidates)\\n numDict = dict() # keep track of number ever present in heap\\n numDict[1] = 1\\n\\n while True:\\n\\n heapMin = hq.heappop(superUglyCandidates)\\n ans.append(heapMin)\\n\\n if len(ans) == n:\\n break\\n\\n currCandidates = [heapMin * basePrime for basePrime in primes]\\n for c in currCandidates:\\n\\n if numDict.get(c) is None:\\n hq.heappush(superUglyCandidates, c)\\n numDict[c] = 1\\n\\n return ans[-1]\",\n \"memory\": \"661904\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n minH = [1]\\n visit = set()\\n\\n for i in range(n):\\n numb = heapq.heappop(minH) \\n if i == n - 1:\\n return numb\\n \\n for p in primes:\\n if numb*p not in visit:\\n visit.add(numb * p)\\n heapq.heappush(minH, numb*p)\",\n \"memory\": \"671578\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = [1] + [p for p in primes]\\n\\n heapq.heapify(heap)\\n visited = set(heap)\\n\\n q=-1\\n\\n while(n):\\n q = heapq.heappop(heap)\\n for p in primes:\\n if q*p not in visited:\\n visited.add(q*p)\\n heapq.heappush(heap,q*p)\\n\\n n-=1\\n\\n return q\\n\\n\\n # def dfs(i,cur,rem):\\n # if rem==0:\\n # return\\n\\n # heapq.heappush(heap,cur)\\n\\n # same_take = dfs(i,cur*primes[i],rem-1)\\n # next_take = dfs(i+1,cur*primes[i],rem-1)\\n # skip = dfs(i+1,cur,rem-1)\\n\\n # re\\n\\n\\n\",\n \"memory\": \"681251\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n minheap = [1]\\n visit = set()\\n for i in range(n):\\n num = heapq.heappop(minheap)\\n if i==n-1:\\n return num\\n for x in primes:\\n if num*x not in visit:\\n heapq.heappush(minheap,num*x)\\n visit.add(num*x)\\n\\n\\n\",\n \"memory\": \"690925\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n if n==1:\\n return 1\\n pq=[1]\\n self.n=n\\n cache={1}\\n while n-1>0:\\n cur= heapq.heappop(pq)\\n for prime in primes:\\n if cur*prime not in cache :\\n cache.add(cur*prime)\\n heapq.heappush(pq,cur*prime )\\n n-=1\\n return heapq.heappop(pq)\",\n \"memory\": \"700599\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n cur = 0\\n num = [1]\\n seen = set([1])\\n while n:\\n cur = heappop(num)\\n n -= 1\\n for i in primes:\\n if i * cur not in seen:\\n heappush(num, i * cur)\\n seen.add(i * cur)\\n return cur\\n\",\n \"memory\": \"710273\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n \\n heap = [1] + [p for p in primes]\\n\\n heapq.heapify(heap)\\n visited = set(heap)\\n\\n q=-1\\n\\n while(n):\\n q = heapq.heappop(heap)\\n for p in primes:\\n if q*p not in visited:\\n visited.add(q*p)\\n heapq.heappush(heap,q*p)\\n\\n n-=1\\n\\n return q\\n\\n\\n # def dfs(i,cur,rem):\\n # if rem==0:\\n # return\\n\\n # heapq.heappush(heap,cur)\\n\\n # same_take = dfs(i,cur*primes[i],rem-1)\\n # next_take = dfs(i+1,cur*primes[i],rem-1)\\n # skip = dfs(i+1,cur,rem-1)\\n\\n # re\\n\\n\\n\",\n \"memory\": \"719946\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n nextmin = [ 1 ]\\n visited = set()\\n for i in range(n) :\\n ugly = heapq.heappop(nextmin)\\n if i == n - 1:\\n return ugly\\n for prime in primes :\\n if prime * ugly not in visited :\\n visited.add(prime*ugly)\\n heapq.heappush(nextmin,prime*ugly)\",\n \"memory\": \"729620\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n h = [1]\\n heapq.heapify(h)\\n vis = {1}\\n for i in range(n):\\n cur = heapq.heappop(h)\\n for p in primes:\\n if p*cur not in vis:\\n vis.add(p*cur)\\n heapq.heappush(h, p*cur)\\n return cur\",\n \"memory\": \"739294\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n #using a heap - similar to prims algorithm\\n n_primes = len(primes)\\n h = [1,]\\n heapq.heapify(h)\\n visited = set([1,])\\n \\n for _ in range(n):\\n num = heapq.heappop(h)\\n #add its neighbours to the heap\\n for i in range(n_primes):\\n if primes[i]*num not in visited:\\n heapq.heappush(h, num*primes[i])\\n visited.add(num*primes[i])\\n return num\",\n \"memory\": \"748968\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n min_heap=[1]\\n seen=set()\\n seen.add(1)\\n\\n for _ in range(n):\\n number=heapq.heappop(min_heap)\\n \\n for p in primes:\\n if p*number not in seen:\\n heapq.heappush(min_heap,p*number)\\n seen.add(p*number)\\n \\n return number\",\n \"memory\": \"758641\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n # use a heap?\\n if n == 1:\\n return 1\\n\\n heap = [1]\\n visited = set()\\n visited.add(1)\\n\\n for _ in range(n-1):\\n # get the smallest to work on\\n small = heappop(heap)\\n for p in primes:\\n if p * small not in visited:\\n visited.add(p*small)\\n heappush(heap, p*small)\\n # get the smallest\\n return heap[0]\",\n \"memory\": \"768315\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int: \\n visited = set()\\n ans = 1\\n if n == 1:\\n return ans \\n heap = primes[:]\\n for x in heap:\\n visited.add(x) \\n n -= 1\\n heapq.heapify(heap)\\n while heap and n > 0:\\n ans = heapq.heappop(heap) \\n for f in primes:\\n if ans*f not in visited:\\n visited.add(ans * f)\\n heapq.heappush(heap, ans*f)\\n n -= 1 \\n return ans\",\n \"memory\": \"777989\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n heap = [1]\\n setto = set([1])\\n heapq.heapify(heap)\\n\\n while True:\\n #print(heap)\\n val = heapq.heappop(heap)\\n if n == 1:\\n return val\\n for prime in primes:\\n if val*prime not in setto:\\n setto.add(val*prime)\\n heapq.heappush(heap, val*prime)\\n n -= 1\\n \\n \\n \\n \",\n \"memory\": \"787663\"\n },\n {\n \"code\": \"class Solution:\\n def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:\\n count = 0\\n heap = [1] \\n seen = set([1])\\n answer = 1\\n while count < n:\\n #print(answer)\\n answer = heappop(heap)\\n count += 1\\n for i in primes:\\n if answer * i not in seen:\\n seen.add(answer * i)\\n heappush(heap, answer * i)\\n return answer\",\n \"memory\": \"787663\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":89,"string":"89"}}},{"rowIdx":257,"cells":{"question_id":{"kind":"number","value":328,"string":"328"},"name":{"kind":"string","value":"odd-even-linked-list"},"content":{"kind":"string","value":"<p>Given the <code>head</code> of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return <em>the reordered list</em>.</p>\n\n<p>The <strong>first</strong> node is considered <strong>odd</strong>, and the <strong>second</strong> node is <strong>even</strong>, and so on.</p>\n\n<p>Note that the relative order inside both the even and odd groups should remain as it was in the input.</p>\n\n<p>You must solve the problem in <code>O(1)</code> extra space complexity and <code>O(n)</code> time complexity.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/10/oddeven-linked-list.jpg\" style=\"width: 300px; height: 123px;\" />\n<pre>\n<strong>Input:</strong> head = [1,2,3,4,5]\n<strong>Output:</strong> [1,3,5,2,4]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/10/oddeven2-linked-list.jpg\" style=\"width: 500px; height: 142px;\" />\n<pre>\n<strong>Input:</strong> head = [2,1,3,5,6,4,7]\n<strong>Output:</strong> [2,3,6,7,1,5,4]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li>The number of nodes in the linked list is in the range <code>[0, 10<sup>4</sup>]</code>.</li>\n\t<li><code>-10<sup>6</sup> <= Node.val <= 10<sup>6</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":61.6188067768909,"string":"61.618807"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["linked-list"],"string":"[\n \"linked-list\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17\", 0.0095], [\"19\", 0.0285], [\"20\", 0.0095], [\"21\", 0.0095], [\"22\", 0.0759], [\"23\", 0.1329], [\"24\", 0.1709], [\"25\", 0.1139], [\"26\", 0.3418], [\"27\", 1.0063], [\"28\", 0.4747], [\"29\", 0.8069], [\"30\", 1.2626], [\"31\", 2.7435], [\"32\", 1.5758], [\"33\", 1.8322], [\"34\", 3.1517], [\"35\", 6.5122], [\"36\", 4.2149], [\"37\", 4.3004], [\"38\", 6.4268], [\"39\", 9.2178], [\"40\", 6.142], [\"41\", 5.7718], [\"42\", 7.471], [\"43\", 8.4014], [\"44\", 5.8003], [\"45\", 4.6421], [\"46\", 4.2054], [\"47\", 3.6738], [\"48\", 2.9903]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16900\", 0.0095], [\"17000\", 0.019], [\"17900\", 0.0095], [\"18000\", 0.0095], [\"18100\", 0.019], [\"18200\", 0.0475], [\"18300\", 1.0632], [\"18400\", 16.6129], [\"18500\", 43.4878], [\"18600\", 30.2354]]}"},"rt_list":{"kind":"list like","value":[{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n \n odd = head\n evenHead = even = head.next\n\n while even and even.next:\n odd.next = odd.next.next\n odd = odd.next\n\n even.next = even.next.next\n even = even.next\n\n odd.next = evenHead\n\n return head\n ","runtime":"17"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n \n odd = head\n even = head.next\n even_head = even\n \n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n \n odd.next = even_head\n return head\n\n\n\n ","runtime":"19"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n\n # if head.next is None or head is None:\n # return None\n\n temp=head\n current=head\n previous=None\n\n n=0\n\n while temp!=None:\n previous=temp\n n=n+1 \n temp=temp.next\n \n if n<=2:\n return head\n # print(\"previous inside while\",previous) \n middle=n//2\n # print(\"Length of LinkedList:\",n) \n # print(\"Middle of LinkedList:\",middle) \n n=1\n\n while n<=middle:\n second=current.next\n # print(\"second:\",second)\n current.next=current.next.next\n second.next=None\n previous.next=second\n previous=previous.next \n current=current.next\n n=n+1\n\n # print(\"head of LinkedList:\",head) \n return head \n\n ","runtime":"20"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\n# 1 2 3 4 5\n# 1 3 2 4 5\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return head\n elif not head.next:\n return head\n odd, even = head, head.next\n evenHead = even\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n odd.next = evenHead\n return head","runtime":"21"},{"code":"class Solution:\n def oddEvenList(self, head: ListNode) -> ListNode:\n if not head or not head.next or not head.next.next:\n return head\n \n odd = head\n even = head.next\n even_head = even\n odd_increment = True\n even_increment = True\n \n while odd and even and (odd_increment or even_increment):\n if odd.next and odd.next.next:\n odd.next = odd.next.next\n odd = odd.next\n else:\n odd_increment = False\n \n if even.next and even.next.next:\n even.next = even.next.next\n even = even.next\n else:\n even_increment = False\n \n odd.next = even_head\n even.next = None\n \n return head","runtime":"22"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n \n odd = head\n even = head.next\n even_head = even\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n odd.next = even_head\n return head\n ","runtime":"23"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n \n odd = head\n even = head.next\n even_head = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n\n even.next = odd.next\n even = even.next\n odd.next = even_head\n\n return head","runtime":"24"},{"code":"class Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next: return head\n\n even = head\n odd = oddhead = head.next\n\n while odd.next:\n even.next = odd.next\n even = even.next\n odd.next = even.next\n odd = odd.next\n if not odd: break\n\n even.next = oddhead\n\n return head\n","runtime":"25"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n lp = head\n rp = head.next\n rref = rp\n\n while rp and rp.next:\n lp.next = lp.next.next\n lp = lp.next\n\n rp.next = rp.next.next\n rp = rp.next\n lp.next = rref\n\n return head \n\n ","runtime":"26"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n \n p = head\n q = head.next\n\n odd, even = head, head.next\n while even.next and even.next.next:\n odd.next = even.next\n even.next = even.next.next\n\n odd = odd.next\n even = even.next\n \n if even.next:\n odd.next = even.next\n odd = odd.next\n even.next = None\n\n odd.next = q\n return p","runtime":"26"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next or not head.next.next:\n return head\n oddptr=current=head\n evenptr=evenhead=head.next\n i=1\n while current:\n if i>2 and i%2!=0:\n oddptr.next=current\n oddptr=oddptr.next\n elif i>2 and i%2==0:\n evenptr.next=current\n evenptr=evenptr.next\n current=current.next\n i+=1\n evenptr.next=None\n oddptr.next=evenhead\n return head\n ","runtime":"27"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head \n odd = head\n even = head.next\n even_head = even\n while even and even.next:\n odd.next = odd.next.next\n odd = odd.next\n even.next = even.next.next\n even = even.next\n odd.next = even_head\n return head\n\n\n\n ","runtime":"27"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n # pointers for odd and even lists\n odd = head\n even = head.next\n evenHead = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n\n odd.next = evenHead\n return head\n\n","runtime":"28"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head: return None\n if not head.next: return head\n\n odd = head\n even = odd.next\n evenHead = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n \n odd.next = evenHead\n\n return head\n ","runtime":"29"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n\n if head == None:\n return None\n\n odd = head\n even = head.next\n evenTop = head.next\n \n\n while even != None and even.next != None:\n\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n\n odd.next = evenTop\n \n return head","runtime":"29"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None or head.next is None:\n return head\n head1 = head\n head2 = head.next\n node1 = head1\n node2 = head2\n while (node1.next is not None and node1.next.next is not None) or (node2.next is not None and node2.next.next is not None):\n if node1.next.next is not None:\n node1.next = node1.next.next\n node1 = node1.next\n if node2.next.next is not None:\n node2.next = node2.next.next\n node2 = node2.next\n node1.next = head2\n node2.next = None\n return head1\n \n\n\n\n \n","runtime":"30"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n odd = head\n even_head = head.next\n even = head.next\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n odd.next = even_head\n return head\n \n\n\n\n ","runtime":"30"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head == None or head.next == None or head.next.next == None:\n return head\n\n odd = head\n even = head.next\n firstEven = even\n\n while odd.next != None and even.next != None:\n odd.next = even.next\n odd = odd.next\n\n even.next = odd.next\n even = even.next\n odd.next = firstEven\n return head","runtime":"31"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None or head.next is None :\n return head \n temp1 = head\n temp3 = temp1\n\n temp2 = head.next\n temp4 = temp2\n while temp1.next.next and temp2.next.next:\n temp1.next = temp1.next.next\n temp2.next = temp2.next.next \n \n temp1 = temp1.next\n temp2 = temp2.next\n \n if temp1.next and temp1.next.next:\n temp1.next = temp1.next.next\n temp1 = temp1.next\n if temp2.next and temp2.next.next:\n temp2.next = temp2.next.next\n temp2 = temp2.next\n\n if temp2.next :\n temp2.next = None\n if temp1.next :\n temp1.next = None\n\n temp1.next = temp4\n\n return temp3\n\n\n","runtime":"31"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n odd,even = ListNode(1),ListNode(0)\n odd_curr,even_curr = odd,even\n check = True\n while head:\n if check:\n odd_curr.next = head\n odd_curr = odd_curr.next\n check = False\n head = head.next\n else:\n even_curr.next = head\n even_curr = even_curr.next\n check = True\n head = head.next\n\n even_curr.next = None\n odd_curr.next = even.next\n return odd.next","runtime":"32"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n # curr odd\n # curr even\n # get the odd next next val and store\n # get the even next next val and store\n # then do next next again\n # once then end is reach connect curr odd with even head\n curr_odd = head\n curr_even = head.next\n even_head = curr_even\n \n \n while curr_even and curr_even.next:\n curr_odd.next = curr_even.next\n curr_odd = curr_odd.next\n curr_even.next = curr_odd.next\n curr_even = curr_even.next\n \n curr_odd.next = even_head\n return head\n \n ","runtime":"32"},{"code":"class Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n\n odd = head\n even = head.next\n even_head = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n \n even.next = odd.next\n even = even.next\n \n odd.next = even_head\n return head\n\n ","runtime":"33"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n elements = []\n p = head\n while p != None:\n elements.append(p)\n p = p.next\n if len(elements) <= 2: return head\n last_node_odd = elements[0]\n last_node_even = elements[1]\n for i in range(0, len(elements) - 2, 2):\n elements[i].next = elements[i+2]\n last_node_odd = elements[i+2]\n for i in range(1, len(elements)-2, 2):\n elements[i].next = elements[i+2]\n last_node_even = elements[i+2]\n last_node_odd.next = elements[1]\n last_node_even.next = None\n p = head\n while p != None:\n print(p.val, end = ' ')\n p = p.next \n return head\n ","runtime":"33"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n oddList = ListNode()\n oddCuNode = oddList\n evenList = ListNode()\n evenCuNode = evenList\n cuNode = head\n while cuNode:\n if cuNode:\n oddCuNode.next = cuNode\n oddCuNode = oddCuNode.next\n if cuNode.next:\n evenCuNode.next = cuNode.next\n evenCuNode = evenCuNode.next\n if cuNode.next.next:\n cuNode = cuNode.next.next\n else:\n cuNode = None \n else:\n cuNode = None \n \n \n\n evenCuNode.next = None\n oddCuNode.next = evenList.next\n return oddList.next \n\n","runtime":"34"},{"code":"class Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head: return None\n \n # odd points to the first node \n odd = head\n # even points to the second node\n # evenHead will be used at the end to connect odd and even nodes\n evenHead = even = head.next\n \n # This condition makes sure odd can never be None, since the odd node will always be the one before the even node.\n # If even is not None, then odd is not None. (odd before even)\n # If even.next is not None, then after we update odd to the next odd node, it cannot be None. (The next odd node is even.next)\n while even and even.next:\n \n # Connect the current odd node to the next odd node\n odd.next = odd.next.next\n # Move the current odd node to the next odd node\n odd = odd.next\n \n #Same thing for even node\n even.next = even.next.next\n even = even.next\n \n # Connect the last odd node to the start of the even node\n odd.next = evenHead\n\n # head never changed, so return it\n return head ","runtime":"34"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n \n cur1 = dummy1 = ListNode(0)\n cur2 = dummy2 = ListNode(0)\n cnt = 0\n \n while head:\n if cnt % 2 == 0:\n cur1.next = head\n cur1 = cur1.next\n else:\n cur2.next = head\n cur2 = cur2.next\n \n cnt += 1\n head = head.next\n \n cur2.next = None\n cur1.next = dummy2.next\n \n return dummy1.next\n \n ","runtime":"35"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None:\n return head\n odd = head\n second_head = even = head.next\n \n while odd and even and odd.next and even.next:\n odd.next = odd.next.next\n even.next = even.next.next\n odd = odd.next\n even = even.next\n odd.next = second_head\n return head","runtime":"35"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n\n odd = head\n even = head.next\n evenHead = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n\n odd.next = evenHead\n\n return head\n \n","runtime":"36"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n \n odd, even = head, head.next\n even_head = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n \n odd.next = even_head\n\n return head","runtime":"36"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n\n odd = head\n even = head.next\n evenHead = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n\n odd.next = evenHead\n\n return head\n \n","runtime":"37"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head == None:\n return head\n\n odd = head\n even = head.next\n even_head = even\n\n while odd.next != None and even.next != None:\n odd.next = odd.next.next\n odd = odd.next\n even.next = even.next.next\n even = even.next\n\n odd.next = even_head\n\n return head","runtime":"37"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None or head.next is None:\n return head\n no = head\n he = head.next\n ne = he\n while no.next is not None and ne.next is not None:\n no.next = no.next.next\n no = no.next\n ne.next = ne.next.next\n ne = ne.next\n no.next = he\n return head","runtime":"38"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n \n new_odd_head = None\n new_odd_tail = None\n new_even_head = None\n new_even_tail = None\n current = head\n index = 0\n \n while current:\n if index % 2 == 0: # Check if the index is odd\n new_odd = ListNode(current.val)\n if not new_odd_head:\n new_odd_head = new_odd\n new_odd_tail = new_odd\n else:\n new_odd_tail.next = new_odd\n new_odd_tail = new_odd\n else:\n new_even = ListNode(current.val)\n if not new_even_head:\n new_even_head = new_even\n new_even_tail = new_even\n else:\n new_even_tail.next = new_even\n new_even_tail = new_even\n\n current = current.next\n index += 1\n new_odd_tail.next = new_even_head\n return new_odd_head\n","runtime":"38"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val;\n# self.next = next\n\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n\n odd = head\n even = head.next\n even_head = even\n\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n\n odd.next = even_head\n return head","runtime":"39"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: ListNode) -> ListNode:\n if not head or not head.next:\n return head\n \n odd = head # Pointer for the odd indexed nodes\n even = head.next # Pointer for the even indexed nodes\n even_head = even # Store the head of the even indexed nodes\n\n # Rearranging the nodes\n while even and even.next:\n odd.next = even.next # Link odd indexed node to the next odd indexed node\n odd = odd.next # Move the odd pointer forward\n even.next = odd.next # Link even indexed node to the next even indexed node\n even = even.next # Move the even pointer forward\n\n odd.next = even_head # Connect the end of odd indexed list to the head of even indexed list\n\n return head","runtime":"39"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n # if not head:\n # return None\n \n # new_odd_head = None\n # new_odd_tail = None\n # new_even_head = None\n # new_even_tail = None\n # current = head\n # index = 0\n \n # while current:\n # if index % 2 == 0: # Check if the index is odd\n # new_odd = ListNode(current.val)\n # if not new_odd_head:\n # new_odd_head = new_odd\n # new_odd_tail = new_odd\n # else:\n # new_odd_tail.next = new_odd\n # new_odd_tail = new_odd\n # else:\n # new_even = ListNode(current.val)\n # if not new_even_head:\n # new_even_head = new_even\n # new_even_tail = new_even\n # else:\n # new_even_tail.next = new_even\n # new_even_tail = new_even\n\n # current = current.next\n # index += 1\n # new_odd_tail.next = new_even_head\n # return new_odd_head\n\n # working but 50% runtime and 40% memory\n if not head:\n return None\n \n odd = head\n even = head.next\n even_head = even\n \n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n \n odd.next = even_head\n return head\n","runtime":"40"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n c = 0\n\n odd = ListNode()\n even = ListNode()\n o, e = odd, even\n\n p = head\n\n while p:\n c += 1\n if c % 2 != 0:\n o.next = p\n o = o.next\n else:\n e.next = p\n e = e.next\n p = p.next\n e.next = None\n\n o.next = even.next\n\n return odd.next\n \n","runtime":"40"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n # if not head:\n # return None\n \n # new_odd_head = None\n # new_odd_tail = None\n # new_even_head = None\n # new_even_tail = None\n # current = head\n # index = 0\n \n # while current:\n # if index % 2 == 0: # Check if the index is odd\n # new_odd = ListNode(current.val)\n # if not new_odd_head:\n # new_odd_head = new_odd\n # new_odd_tail = new_odd\n # else:\n # new_odd_tail.next = new_odd\n # new_odd_tail = new_odd\n # else:\n # new_even = ListNode(current.val)\n # if not new_even_head:\n # new_even_head = new_even\n # new_even_tail = new_even\n # else:\n # new_even_tail.next = new_even\n # new_even_tail = new_even\n\n # current = current.next\n # index += 1\n # new_odd_tail.next = new_even_head\n # return new_odd_head\n\n if not head:\n return None\n \n odd = head\n even = head.next\n even_head = even\n \n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n \n odd.next = even_head\n return head\n","runtime":"41"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n c = 0\n\n odd = ListNode()\n even = ListNode()\n o, e = odd, even\n\n p = head\n\n while p:\n c += 1\n if c % 2 != 0:\n o.next = p\n o = o.next\n else:\n e.next = p\n e = e.next\n p = p.next\n e.next = None\n\n o.next = even.next\n\n return odd.next\n \n","runtime":"41"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None or head.next is None:\n return head\n no = head\n he = head.next\n ne = he\n while no.next is not None and ne.next is not None:\n no.next = no.next.next\n no = no.next\n ne.next = ne.next.next\n ne = ne.next\n no.next = he\n return head","runtime":"42"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n oddList = ListNode()\n oddCuNode = oddList\n evenList = ListNode()\n evenCuNode = evenList\n cuNode = head\n while cuNode:\n if cuNode:\n oddCuNode.next = cuNode\n oddCuNode = oddCuNode.next\n if cuNode.next:\n evenCuNode.next = cuNode.next\n evenCuNode = evenCuNode.next\n if cuNode.next.next:\n cuNode = cuNode.next.next\n else:\n cuNode = None \n else:\n cuNode = None \n \n \n\n evenCuNode.next = None\n oddCuNode.next = evenList.next\n return oddList.next \n\n","runtime":"42"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return head\n if not head.next:\n return head\n odd_even = 0\n first = head\n second = head.next\n saved = head.next\n while first and second.next:\n odd_even += 1\n first.next = second.next\n first = second\n second = second.next\n \n if odd_even % 2 == 1:\n second.next = saved\n first.next = None\n else:\n first.next = saved\n return head\n","runtime":"43"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n c = 0\n\n odd = ListNode()\n even = ListNode()\n o, e = odd, even\n\n p = head\n\n while p:\n c += 1\n if c % 2 != 0:\n o.next = p\n o = o.next\n else:\n e.next = p\n e = e.next\n p = p.next\n e.next = None\n\n o.next = even.next\n\n return odd.next\n \n","runtime":"43"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None or head.next is None:\n return head\n \n os = head # Original head of the list\n es = head.next # First even node\n odd = os\n even = es\n \n while odd.next and even.next:\n odd.next = odd.next.next # Move odd pointer\n even.next = even.next.next # Move even pointer\n odd = odd.next # Advance odd\n even = even.next # Advance even\n \n odd.next = es # Connect odd list with even list\n return os\n\n ","runtime":"44"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n odd = head\n if not odd:\n return\n even = head.next\n even_head = head.next\n while even and even.next:\n odd.next = even.next\n even.next = even.next.next\n odd = odd.next\n even = even.next\n odd.next = even_head\n return head","runtime":"44"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n odd=ListNode()\n ho=odd\n even=ListNode()\n he=even\n\n p=head\n n=1\n while(p!=None):\n if n%2==1:\n odd.next=p\n p=p.next \n odd=odd.next\n else:\n even.next=p\n p=p.next\n even=even.next\n \n n+=1\n odd.next=he.next\n even.next=None\n return ho.next","runtime":"45"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n c = 0\n\n odd = ListNode()\n even = ListNode()\n o, e = odd, even\n\n p = head\n\n while p:\n c += 1\n if c % 2 != 0:\n o.next = p\n o = o.next\n else:\n e.next = p\n e = e.next\n p = p.next\n e.next = None\n\n o.next = even.next\n\n return odd.next\n \n","runtime":"45"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n odd=ListNode()\n ho=odd\n even=ListNode()\n he=even\n\n p=head\n n=1\n while(p!=None):\n if n%2==1:\n odd.next=p\n p=p.next \n odd=odd.next\n else:\n even.next=p\n p=p.next\n even=even.next\n \n n+=1\n odd.next=he.next\n even.next=None\n return ho.next","runtime":"46"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n \n new_odd_head = None\n new_odd_tail = None\n new_even_head = None\n new_even_tail = None\n current = head\n index = 0\n \n while current:\n if index % 2 == 0: # Check if the index is odd\n new_odd = ListNode(current.val)\n if not new_odd_head:\n new_odd_head = new_odd\n new_odd_tail = new_odd\n else:\n new_odd_tail.next = new_odd\n new_odd_tail = new_odd\n else:\n new_even = ListNode(current.val)\n if not new_even_head:\n new_even_head = new_even\n new_even_tail = new_even\n else:\n new_even_tail.next = new_even\n new_even_tail = new_even\n\n current = current.next\n index += 1\n new_odd_tail.next = new_even_head\n return new_odd_head\n\n # working but 50% runtime and 40% memory\n # if not head:\n # return None\n \n # odd = head\n # even = head.next\n # even_head = even\n \n # while even and even.next:\n # odd.next = even.next\n # odd = odd.next\n # even.next = odd.next\n # even = even.next\n \n # odd.next = even_head\n # return head\n","runtime":"46"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head == None or head.next == None : return head \n odd = ListNode(0) \n odd_ptr = odd\n even = ListNode(0)\n even_ptr = even \n idx = 1 \n while head != None :\n if idx % 2 == 0:\n even_ptr.next = head\n even_ptr = even_ptr.next\n else:\n odd_ptr.next = head\n odd_ptr = odd_ptr.next\n head = head.next\n idx+=1\n even_ptr.next = None\n odd_ptr.next = even.next\n return odd.next\n ","runtime":"47"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head: return None\n odd = head\n evenHead = even = head.next\n while even and even.next:\n odd.next = odd.next.next\n odd = odd.next\n even.next = even.next.next\n even = even.next\n odd.next = evenHead\n return head","runtime":"47"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return head\n if not head.next:\n return head\n odd_even = 0\n first = head\n second = head.next\n saved = head.next\n while second.next:\n odd_even += 1\n first.next = second.next\n first = second\n second = second.next\n \n if odd_even % 2 == 1:\n second.next = saved\n first.next = None\n else:\n first.next = saved\n return head\n","runtime":"48"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n curr = head \n evenhead = even = head.next\n while even and even.next:\n curr.next = curr.next.next\n curr = curr.next\n even.next = even.next.next\n even = even.next\n\n curr.next = evenhead\n return head\n\n","runtime":"48"}],"string":"[\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n \\n odd = head\\n evenHead = even = head.next\\n\\n while even and even.next:\\n odd.next = odd.next.next\\n odd = odd.next\\n\\n even.next = even.next.next\\n even = even.next\\n\\n odd.next = evenHead\\n\\n return head\\n \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n \\n odd = head\\n even = head.next\\n even_head = even\\n \\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n \\n odd.next = even_head\\n return head\\n\\n\\n\\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n\\n # if head.next is None or head is None:\\n # return None\\n\\n temp=head\\n current=head\\n previous=None\\n\\n n=0\\n\\n while temp!=None:\\n previous=temp\\n n=n+1 \\n temp=temp.next\\n \\n if n<=2:\\n return head\\n # print(\\\"previous inside while\\\",previous) \\n middle=n//2\\n # print(\\\"Length of LinkedList:\\\",n) \\n # print(\\\"Middle of LinkedList:\\\",middle) \\n n=1\\n\\n while n<=middle:\\n second=current.next\\n # print(\\\"second:\\\",second)\\n current.next=current.next.next\\n second.next=None\\n previous.next=second\\n previous=previous.next \\n current=current.next\\n n=n+1\\n\\n # print(\\\"head of LinkedList:\\\",head) \\n return head \\n\\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\n# 1 2 3 4 5\\n# 1 3 2 4 5\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return head\\n elif not head.next:\\n return head\\n odd, even = head, head.next\\n evenHead = even\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n odd.next = evenHead\\n return head\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def oddEvenList(self, head: ListNode) -> ListNode:\\n if not head or not head.next or not head.next.next:\\n return head\\n \\n odd = head\\n even = head.next\\n even_head = even\\n odd_increment = True\\n even_increment = True\\n \\n while odd and even and (odd_increment or even_increment):\\n if odd.next and odd.next.next:\\n odd.next = odd.next.next\\n odd = odd.next\\n else:\\n odd_increment = False\\n \\n if even.next and even.next.next:\\n even.next = even.next.next\\n even = even.next\\n else:\\n even_increment = False\\n \\n odd.next = even_head\\n even.next = None\\n \\n return head\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n \\n odd = head\\n even = head.next\\n even_head = even\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n odd.next = even_head\\n return head\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n \\n odd = head\\n even = head.next\\n even_head = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n\\n even.next = odd.next\\n even = even.next\\n odd.next = even_head\\n\\n return head\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next: return head\\n\\n even = head\\n odd = oddhead = head.next\\n\\n while odd.next:\\n even.next = odd.next\\n even = even.next\\n odd.next = even.next\\n odd = odd.next\\n if not odd: break\\n\\n even.next = oddhead\\n\\n return head\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n lp = head\\n rp = head.next\\n rref = rp\\n\\n while rp and rp.next:\\n lp.next = lp.next.next\\n lp = lp.next\\n\\n rp.next = rp.next.next\\n rp = rp.next\\n lp.next = rref\\n\\n return head \\n\\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n \\n p = head\\n q = head.next\\n\\n odd, even = head, head.next\\n while even.next and even.next.next:\\n odd.next = even.next\\n even.next = even.next.next\\n\\n odd = odd.next\\n even = even.next\\n \\n if even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = None\\n\\n odd.next = q\\n return p\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next or not head.next.next:\\n return head\\n oddptr=current=head\\n evenptr=evenhead=head.next\\n i=1\\n while current:\\n if i>2 and i%2!=0:\\n oddptr.next=current\\n oddptr=oddptr.next\\n elif i>2 and i%2==0:\\n evenptr.next=current\\n evenptr=evenptr.next\\n current=current.next\\n i+=1\\n evenptr.next=None\\n oddptr.next=evenhead\\n return head\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head \\n odd = head\\n even = head.next\\n even_head = even\\n while even and even.next:\\n odd.next = odd.next.next\\n odd = odd.next\\n even.next = even.next.next\\n even = even.next\\n odd.next = even_head\\n return head\\n\\n\\n\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n # pointers for odd and even lists\\n odd = head\\n even = head.next\\n evenHead = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n\\n odd.next = evenHead\\n return head\\n\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head: return None\\n if not head.next: return head\\n\\n odd = head\\n even = odd.next\\n evenHead = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n \\n odd.next = evenHead\\n\\n return head\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n\\n if head == None:\\n return None\\n\\n odd = head\\n even = head.next\\n evenTop = head.next\\n \\n\\n while even != None and even.next != None:\\n\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n\\n odd.next = evenTop\\n \\n return head\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None or head.next is None:\\n return head\\n head1 = head\\n head2 = head.next\\n node1 = head1\\n node2 = head2\\n while (node1.next is not None and node1.next.next is not None) or (node2.next is not None and node2.next.next is not None):\\n if node1.next.next is not None:\\n node1.next = node1.next.next\\n node1 = node1.next\\n if node2.next.next is not None:\\n node2.next = node2.next.next\\n node2 = node2.next\\n node1.next = head2\\n node2.next = None\\n return head1\\n \\n\\n\\n\\n \\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n odd = head\\n even_head = head.next\\n even = head.next\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n odd.next = even_head\\n return head\\n \\n\\n\\n\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head == None or head.next == None or head.next.next == None:\\n return head\\n\\n odd = head\\n even = head.next\\n firstEven = even\\n\\n while odd.next != None and even.next != None:\\n odd.next = even.next\\n odd = odd.next\\n\\n even.next = odd.next\\n even = even.next\\n odd.next = firstEven\\n return head\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None or head.next is None :\\n return head \\n temp1 = head\\n temp3 = temp1\\n\\n temp2 = head.next\\n temp4 = temp2\\n while temp1.next.next and temp2.next.next:\\n temp1.next = temp1.next.next\\n temp2.next = temp2.next.next \\n \\n temp1 = temp1.next\\n temp2 = temp2.next\\n \\n if temp1.next and temp1.next.next:\\n temp1.next = temp1.next.next\\n temp1 = temp1.next\\n if temp2.next and temp2.next.next:\\n temp2.next = temp2.next.next\\n temp2 = temp2.next\\n\\n if temp2.next :\\n temp2.next = None\\n if temp1.next :\\n temp1.next = None\\n\\n temp1.next = temp4\\n\\n return temp3\\n\\n\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n odd,even = ListNode(1),ListNode(0)\\n odd_curr,even_curr = odd,even\\n check = True\\n while head:\\n if check:\\n odd_curr.next = head\\n odd_curr = odd_curr.next\\n check = False\\n head = head.next\\n else:\\n even_curr.next = head\\n even_curr = even_curr.next\\n check = True\\n head = head.next\\n\\n even_curr.next = None\\n odd_curr.next = even.next\\n return odd.next\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n # curr odd\\n # curr even\\n # get the odd next next val and store\\n # get the even next next val and store\\n # then do next next again\\n # once then end is reach connect curr odd with even head\\n curr_odd = head\\n curr_even = head.next\\n even_head = curr_even\\n \\n \\n while curr_even and curr_even.next:\\n curr_odd.next = curr_even.next\\n curr_odd = curr_odd.next\\n curr_even.next = curr_odd.next\\n curr_even = curr_even.next\\n \\n curr_odd.next = even_head\\n return head\\n \\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n\\n odd = head\\n even = head.next\\n even_head = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n \\n even.next = odd.next\\n even = even.next\\n \\n odd.next = even_head\\n return head\\n\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n elements = []\\n p = head\\n while p != None:\\n elements.append(p)\\n p = p.next\\n if len(elements) <= 2: return head\\n last_node_odd = elements[0]\\n last_node_even = elements[1]\\n for i in range(0, len(elements) - 2, 2):\\n elements[i].next = elements[i+2]\\n last_node_odd = elements[i+2]\\n for i in range(1, len(elements)-2, 2):\\n elements[i].next = elements[i+2]\\n last_node_even = elements[i+2]\\n last_node_odd.next = elements[1]\\n last_node_even.next = None\\n p = head\\n while p != None:\\n print(p.val, end = ' ')\\n p = p.next \\n return head\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n oddList = ListNode()\\n oddCuNode = oddList\\n evenList = ListNode()\\n evenCuNode = evenList\\n cuNode = head\\n while cuNode:\\n if cuNode:\\n oddCuNode.next = cuNode\\n oddCuNode = oddCuNode.next\\n if cuNode.next:\\n evenCuNode.next = cuNode.next\\n evenCuNode = evenCuNode.next\\n if cuNode.next.next:\\n cuNode = cuNode.next.next\\n else:\\n cuNode = None \\n else:\\n cuNode = None \\n \\n \\n\\n evenCuNode.next = None\\n oddCuNode.next = evenList.next\\n return oddList.next \\n\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head: return None\\n \\n # odd points to the first node \\n odd = head\\n # even points to the second node\\n # evenHead will be used at the end to connect odd and even nodes\\n evenHead = even = head.next\\n \\n # This condition makes sure odd can never be None, since the odd node will always be the one before the even node.\\n # If even is not None, then odd is not None. (odd before even)\\n # If even.next is not None, then after we update odd to the next odd node, it cannot be None. (The next odd node is even.next)\\n while even and even.next:\\n \\n # Connect the current odd node to the next odd node\\n odd.next = odd.next.next\\n # Move the current odd node to the next odd node\\n odd = odd.next\\n \\n #Same thing for even node\\n even.next = even.next.next\\n even = even.next\\n \\n # Connect the last odd node to the start of the even node\\n odd.next = evenHead\\n\\n # head never changed, so return it\\n return head \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n \\n cur1 = dummy1 = ListNode(0)\\n cur2 = dummy2 = ListNode(0)\\n cnt = 0\\n \\n while head:\\n if cnt % 2 == 0:\\n cur1.next = head\\n cur1 = cur1.next\\n else:\\n cur2.next = head\\n cur2 = cur2.next\\n \\n cnt += 1\\n head = head.next\\n \\n cur2.next = None\\n cur1.next = dummy2.next\\n \\n return dummy1.next\\n \\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None:\\n return head\\n odd = head\\n second_head = even = head.next\\n \\n while odd and even and odd.next and even.next:\\n odd.next = odd.next.next\\n even.next = even.next.next\\n odd = odd.next\\n even = even.next\\n odd.next = second_head\\n return head\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n\\n odd = head\\n even = head.next\\n evenHead = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n\\n odd.next = evenHead\\n\\n return head\\n \\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n \\n odd, even = head, head.next\\n even_head = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n \\n odd.next = even_head\\n\\n return head\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n\\n odd = head\\n even = head.next\\n evenHead = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n\\n odd.next = evenHead\\n\\n return head\\n \\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head == None:\\n return head\\n\\n odd = head\\n even = head.next\\n even_head = even\\n\\n while odd.next != None and even.next != None:\\n odd.next = odd.next.next\\n odd = odd.next\\n even.next = even.next.next\\n even = even.next\\n\\n odd.next = even_head\\n\\n return head\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None or head.next is None:\\n return head\\n no = head\\n he = head.next\\n ne = he\\n while no.next is not None and ne.next is not None:\\n no.next = no.next.next\\n no = no.next\\n ne.next = ne.next.next\\n ne = ne.next\\n no.next = he\\n return head\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n \\n new_odd_head = None\\n new_odd_tail = None\\n new_even_head = None\\n new_even_tail = None\\n current = head\\n index = 0\\n \\n while current:\\n if index % 2 == 0: # Check if the index is odd\\n new_odd = ListNode(current.val)\\n if not new_odd_head:\\n new_odd_head = new_odd\\n new_odd_tail = new_odd\\n else:\\n new_odd_tail.next = new_odd\\n new_odd_tail = new_odd\\n else:\\n new_even = ListNode(current.val)\\n if not new_even_head:\\n new_even_head = new_even\\n new_even_tail = new_even\\n else:\\n new_even_tail.next = new_even\\n new_even_tail = new_even\\n\\n current = current.next\\n index += 1\\n new_odd_tail.next = new_even_head\\n return new_odd_head\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val;\\n# self.next = next\\n\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n\\n odd = head\\n even = head.next\\n even_head = even\\n\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n\\n odd.next = even_head\\n return head\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: ListNode) -> ListNode:\\n if not head or not head.next:\\n return head\\n \\n odd = head # Pointer for the odd indexed nodes\\n even = head.next # Pointer for the even indexed nodes\\n even_head = even # Store the head of the even indexed nodes\\n\\n # Rearranging the nodes\\n while even and even.next:\\n odd.next = even.next # Link odd indexed node to the next odd indexed node\\n odd = odd.next # Move the odd pointer forward\\n even.next = odd.next # Link even indexed node to the next even indexed node\\n even = even.next # Move the even pointer forward\\n\\n odd.next = even_head # Connect the end of odd indexed list to the head of even indexed list\\n\\n return head\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n # if not head:\\n # return None\\n \\n # new_odd_head = None\\n # new_odd_tail = None\\n # new_even_head = None\\n # new_even_tail = None\\n # current = head\\n # index = 0\\n \\n # while current:\\n # if index % 2 == 0: # Check if the index is odd\\n # new_odd = ListNode(current.val)\\n # if not new_odd_head:\\n # new_odd_head = new_odd\\n # new_odd_tail = new_odd\\n # else:\\n # new_odd_tail.next = new_odd\\n # new_odd_tail = new_odd\\n # else:\\n # new_even = ListNode(current.val)\\n # if not new_even_head:\\n # new_even_head = new_even\\n # new_even_tail = new_even\\n # else:\\n # new_even_tail.next = new_even\\n # new_even_tail = new_even\\n\\n # current = current.next\\n # index += 1\\n # new_odd_tail.next = new_even_head\\n # return new_odd_head\\n\\n # working but 50% runtime and 40% memory\\n if not head:\\n return None\\n \\n odd = head\\n even = head.next\\n even_head = even\\n \\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n \\n odd.next = even_head\\n return head\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n c = 0\\n\\n odd = ListNode()\\n even = ListNode()\\n o, e = odd, even\\n\\n p = head\\n\\n while p:\\n c += 1\\n if c % 2 != 0:\\n o.next = p\\n o = o.next\\n else:\\n e.next = p\\n e = e.next\\n p = p.next\\n e.next = None\\n\\n o.next = even.next\\n\\n return odd.next\\n \\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n # if not head:\\n # return None\\n \\n # new_odd_head = None\\n # new_odd_tail = None\\n # new_even_head = None\\n # new_even_tail = None\\n # current = head\\n # index = 0\\n \\n # while current:\\n # if index % 2 == 0: # Check if the index is odd\\n # new_odd = ListNode(current.val)\\n # if not new_odd_head:\\n # new_odd_head = new_odd\\n # new_odd_tail = new_odd\\n # else:\\n # new_odd_tail.next = new_odd\\n # new_odd_tail = new_odd\\n # else:\\n # new_even = ListNode(current.val)\\n # if not new_even_head:\\n # new_even_head = new_even\\n # new_even_tail = new_even\\n # else:\\n # new_even_tail.next = new_even\\n # new_even_tail = new_even\\n\\n # current = current.next\\n # index += 1\\n # new_odd_tail.next = new_even_head\\n # return new_odd_head\\n\\n if not head:\\n return None\\n \\n odd = head\\n even = head.next\\n even_head = even\\n \\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n \\n odd.next = even_head\\n return head\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n c = 0\\n\\n odd = ListNode()\\n even = ListNode()\\n o, e = odd, even\\n\\n p = head\\n\\n while p:\\n c += 1\\n if c % 2 != 0:\\n o.next = p\\n o = o.next\\n else:\\n e.next = p\\n e = e.next\\n p = p.next\\n e.next = None\\n\\n o.next = even.next\\n\\n return odd.next\\n \\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None or head.next is None:\\n return head\\n no = head\\n he = head.next\\n ne = he\\n while no.next is not None and ne.next is not None:\\n no.next = no.next.next\\n no = no.next\\n ne.next = ne.next.next\\n ne = ne.next\\n no.next = he\\n return head\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n oddList = ListNode()\\n oddCuNode = oddList\\n evenList = ListNode()\\n evenCuNode = evenList\\n cuNode = head\\n while cuNode:\\n if cuNode:\\n oddCuNode.next = cuNode\\n oddCuNode = oddCuNode.next\\n if cuNode.next:\\n evenCuNode.next = cuNode.next\\n evenCuNode = evenCuNode.next\\n if cuNode.next.next:\\n cuNode = cuNode.next.next\\n else:\\n cuNode = None \\n else:\\n cuNode = None \\n \\n \\n\\n evenCuNode.next = None\\n oddCuNode.next = evenList.next\\n return oddList.next \\n\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return head\\n if not head.next:\\n return head\\n odd_even = 0\\n first = head\\n second = head.next\\n saved = head.next\\n while first and second.next:\\n odd_even += 1\\n first.next = second.next\\n first = second\\n second = second.next\\n \\n if odd_even % 2 == 1:\\n second.next = saved\\n first.next = None\\n else:\\n first.next = saved\\n return head\\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n c = 0\\n\\n odd = ListNode()\\n even = ListNode()\\n o, e = odd, even\\n\\n p = head\\n\\n while p:\\n c += 1\\n if c % 2 != 0:\\n o.next = p\\n o = o.next\\n else:\\n e.next = p\\n e = e.next\\n p = p.next\\n e.next = None\\n\\n o.next = even.next\\n\\n return odd.next\\n \\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None or head.next is None:\\n return head\\n \\n os = head # Original head of the list\\n es = head.next # First even node\\n odd = os\\n even = es\\n \\n while odd.next and even.next:\\n odd.next = odd.next.next # Move odd pointer\\n even.next = even.next.next # Move even pointer\\n odd = odd.next # Advance odd\\n even = even.next # Advance even\\n \\n odd.next = es # Connect odd list with even list\\n return os\\n\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n odd = head\\n if not odd:\\n return\\n even = head.next\\n even_head = head.next\\n while even and even.next:\\n odd.next = even.next\\n even.next = even.next.next\\n odd = odd.next\\n even = even.next\\n odd.next = even_head\\n return head\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n odd=ListNode()\\n ho=odd\\n even=ListNode()\\n he=even\\n\\n p=head\\n n=1\\n while(p!=None):\\n if n%2==1:\\n odd.next=p\\n p=p.next \\n odd=odd.next\\n else:\\n even.next=p\\n p=p.next\\n even=even.next\\n \\n n+=1\\n odd.next=he.next\\n even.next=None\\n return ho.next\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n c = 0\\n\\n odd = ListNode()\\n even = ListNode()\\n o, e = odd, even\\n\\n p = head\\n\\n while p:\\n c += 1\\n if c % 2 != 0:\\n o.next = p\\n o = o.next\\n else:\\n e.next = p\\n e = e.next\\n p = p.next\\n e.next = None\\n\\n o.next = even.next\\n\\n return odd.next\\n \\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n odd=ListNode()\\n ho=odd\\n even=ListNode()\\n he=even\\n\\n p=head\\n n=1\\n while(p!=None):\\n if n%2==1:\\n odd.next=p\\n p=p.next \\n odd=odd.next\\n else:\\n even.next=p\\n p=p.next\\n even=even.next\\n \\n n+=1\\n odd.next=he.next\\n even.next=None\\n return ho.next\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n \\n new_odd_head = None\\n new_odd_tail = None\\n new_even_head = None\\n new_even_tail = None\\n current = head\\n index = 0\\n \\n while current:\\n if index % 2 == 0: # Check if the index is odd\\n new_odd = ListNode(current.val)\\n if not new_odd_head:\\n new_odd_head = new_odd\\n new_odd_tail = new_odd\\n else:\\n new_odd_tail.next = new_odd\\n new_odd_tail = new_odd\\n else:\\n new_even = ListNode(current.val)\\n if not new_even_head:\\n new_even_head = new_even\\n new_even_tail = new_even\\n else:\\n new_even_tail.next = new_even\\n new_even_tail = new_even\\n\\n current = current.next\\n index += 1\\n new_odd_tail.next = new_even_head\\n return new_odd_head\\n\\n # working but 50% runtime and 40% memory\\n # if not head:\\n # return None\\n \\n # odd = head\\n # even = head.next\\n # even_head = even\\n \\n # while even and even.next:\\n # odd.next = even.next\\n # odd = odd.next\\n # even.next = odd.next\\n # even = even.next\\n \\n # odd.next = even_head\\n # return head\\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head == None or head.next == None : return head \\n odd = ListNode(0) \\n odd_ptr = odd\\n even = ListNode(0)\\n even_ptr = even \\n idx = 1 \\n while head != None :\\n if idx % 2 == 0:\\n even_ptr.next = head\\n even_ptr = even_ptr.next\\n else:\\n odd_ptr.next = head\\n odd_ptr = odd_ptr.next\\n head = head.next\\n idx+=1\\n even_ptr.next = None\\n odd_ptr.next = even.next\\n return odd.next\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head: return None\\n odd = head\\n evenHead = even = head.next\\n while even and even.next:\\n odd.next = odd.next.next\\n odd = odd.next\\n even.next = even.next.next\\n even = even.next\\n odd.next = evenHead\\n return head\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return head\\n if not head.next:\\n return head\\n odd_even = 0\\n first = head\\n second = head.next\\n saved = head.next\\n while second.next:\\n odd_even += 1\\n first.next = second.next\\n first = second\\n second = second.next\\n \\n if odd_even % 2 == 1:\\n second.next = saved\\n first.next = None\\n else:\\n first.next = saved\\n return head\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n curr = head \\n evenhead = even = head.next\\n while even and even.next:\\n curr.next = curr.next.next\\n curr = curr.next\\n even.next = even.next.next\\n even = even.next\\n\\n curr.next = evenhead\\n return head\\n\\n\",\n \"runtime\": \"48\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":53,"string":"53"},"mm_list":{"kind":"list like","value":[{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n pass\n\nsys.stdout=open('user.out','w')\n\nfor nums in map(loads,stdin):\n ans=str(nums[::2]+nums[1::2]).replace(' ','')\n print(ans)\nexit()","memory":"16900"},{"code":"class Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n pass\n\nsys.stdout=open('user.out','w')\n\nfor nums in map(loads,stdin):\n ans=str(nums[::2]+nums[1::2]).replace(' ','')\n print(ans)\nexit()","memory":"17000"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if(head == None or head.next == None):\n return head\n odd = head\n even = head.next\n evenHead = head.next\n\n while(even != None and even.next != None):\n odd.next = odd.next.next\n even.next = even.next.next\n\n odd = odd.next\n even = even.next\n\n odd.next = evenHead\n return head","memory":"17900"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return head\n\n odd = head\n even = head.next\n even_head = even\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n odd.next = even_head\n return head","memory":"18000"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head is None or head.next is None:\n return head\n odd = head\n even = head.next\n dummy = even\n # modify odd will modifiy even also, cannot separate\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n # need pointer to keep the start node for even list\n odd.next = dummy\n return head","memory":"18100"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n s_odd = odd = ListNode(None)\n s_even = even = ListNode(None)\n while head and head.next:\n odd.next = head\n even.next = head.next\n head = head.next.next\n odd = odd.next\n even = even.next\n\n if head:\n odd.next = head\n odd = odd.next\n odd.next = s_even.next\n even.next = None\n return s_odd.next\n","memory":"18200"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n oddList = ListNode()\n oddCuNode = oddList\n evenList = ListNode()\n evenCuNode = evenList\n cuNode = head\n while cuNode:\n if cuNode:\n oddCuNode.next = cuNode\n oddCuNode = oddCuNode.next\n if cuNode.next:\n evenCuNode.next = cuNode.next\n evenCuNode = evenCuNode.next\n if cuNode.next.next:\n cuNode = cuNode.next.next\n else:\n cuNode = None \n else:\n cuNode = None \n \n \n\n evenCuNode.next = None\n oddCuNode.next = evenList.next\n return oddList.next \n\n","memory":"18300"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\n'''\nGoal:\n- regroup the nodes in place where odd nodes are in front and even nodes are in back\n- first node = odd, second = even\n\nApproach: O(N) linear time, O(1) space \n- Split apart the LL by defining an odd head and an even head\n- iterate through the original linked list -> splice together the odd and even heads\n- reconnect the odd and even linked lists together at the end.\n\n'''\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n\n # oddDum = ListNode(-1)\n # evenDum = ListNode(-1)\n\n oddDum = head\n evenDum = head.next\n\n oddHead = oddDum\n evenHead = evenDum\n\n while oddDum and oddDum.next and evenDum and evenDum.next:\n oddDum.next = oddDum.next.next\n evenDum.next = evenDum.next.next\n\n oddDum = oddDum.next\n evenDum = evenDum.next\n\n oddDum.next = evenHead\n return head\n\n\n ","memory":"18300"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head:\n return None\n\n h = head\n odd = head\n even = head.next\n even_odd = even\n\n while even and even.next:\n odd.next = odd.next.next\n even.next = even.next.next\n even = even.next\n odd = odd.next\n \n odd.next = even_odd\n\n return h\n","memory":"18400"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head: return None\n odd = head\n evenHead = even = head.next\n while even and even.next:\n odd.next = odd.next.next\n odd = odd.next\n even.next = even.next.next\n even = even.next\n odd.next = evenHead\n return head","memory":"18400"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next or not head.next.next:\n return head\n\n \n\n ## Odd:\n\n odd = head\n\n even_head = head.next\n even = even_head\n\n \n while even and even.next:\n odd.next = odd.next.next\n even.next = even.next.next\n\n # if odd.next:\n odd = odd.next\n # if even.next:\n even = even.next\n\n \n odd.next = even_head\n\n return head\n\n\n odd.next = even_head\n\n return head","memory":"18500"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if not head or not head.next:\n return head\n \n odd = head\n even = head.next\n even_head = even\n while even and even.next:\n odd.next = even.next\n odd = odd.next\n even.next = odd.next\n even = even.next\n odd.next = even_head\n return head\n ","memory":"18500"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n odds, evens = ListNode(), ListNode()\n oddsCurr, evensCurr = odds, evens\n curr = head\n i = 1\n while curr:\n if i % 2 == 0:\n evensCurr.next = curr\n evensCurr = evensCurr.next\n else:\n oddsCurr.next = curr\n oddsCurr = oddsCurr.next\n curr = curr.next\n i += 1\n oddsCurr.next = evens.next\n evensCurr.next = None\n return odds.next\n","memory":"18600"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n if head == None or head.next == None: \n return head\n odd = head\n even = head.next\n ehead = even\n while even != None and even.next != None:\n odd.next = odd.next.next\n even.next = even.next.next\n odd=odd.next\n even= even.next\n odd.next = ehead\n return head\n ","memory":"18600"}],"string":"[\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n pass\\n\\nsys.stdout=open('user.out','w')\\n\\nfor nums in map(loads,stdin):\\n ans=str(nums[::2]+nums[1::2]).replace(' ','')\\n print(ans)\\nexit()\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n pass\\n\\nsys.stdout=open('user.out','w')\\n\\nfor nums in map(loads,stdin):\\n ans=str(nums[::2]+nums[1::2]).replace(' ','')\\n print(ans)\\nexit()\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if(head == None or head.next == None):\\n return head\\n odd = head\\n even = head.next\\n evenHead = head.next\\n\\n while(even != None and even.next != None):\\n odd.next = odd.next.next\\n even.next = even.next.next\\n\\n odd = odd.next\\n even = even.next\\n\\n odd.next = evenHead\\n return head\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return head\\n\\n odd = head\\n even = head.next\\n even_head = even\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n odd.next = even_head\\n return head\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head is None or head.next is None:\\n return head\\n odd = head\\n even = head.next\\n dummy = even\\n # modify odd will modifiy even also, cannot separate\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n # need pointer to keep the start node for even list\\n odd.next = dummy\\n return head\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n s_odd = odd = ListNode(None)\\n s_even = even = ListNode(None)\\n while head and head.next:\\n odd.next = head\\n even.next = head.next\\n head = head.next.next\\n odd = odd.next\\n even = even.next\\n\\n if head:\\n odd.next = head\\n odd = odd.next\\n odd.next = s_even.next\\n even.next = None\\n return s_odd.next\\n\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n oddList = ListNode()\\n oddCuNode = oddList\\n evenList = ListNode()\\n evenCuNode = evenList\\n cuNode = head\\n while cuNode:\\n if cuNode:\\n oddCuNode.next = cuNode\\n oddCuNode = oddCuNode.next\\n if cuNode.next:\\n evenCuNode.next = cuNode.next\\n evenCuNode = evenCuNode.next\\n if cuNode.next.next:\\n cuNode = cuNode.next.next\\n else:\\n cuNode = None \\n else:\\n cuNode = None \\n \\n \\n\\n evenCuNode.next = None\\n oddCuNode.next = evenList.next\\n return oddList.next \\n\\n\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\n'''\\nGoal:\\n- regroup the nodes in place where odd nodes are in front and even nodes are in back\\n- first node = odd, second = even\\n\\nApproach: O(N) linear time, O(1) space \\n- Split apart the LL by defining an odd head and an even head\\n- iterate through the original linked list -> splice together the odd and even heads\\n- reconnect the odd and even linked lists together at the end.\\n\\n'''\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n\\n # oddDum = ListNode(-1)\\n # evenDum = ListNode(-1)\\n\\n oddDum = head\\n evenDum = head.next\\n\\n oddHead = oddDum\\n evenHead = evenDum\\n\\n while oddDum and oddDum.next and evenDum and evenDum.next:\\n oddDum.next = oddDum.next.next\\n evenDum.next = evenDum.next.next\\n\\n oddDum = oddDum.next\\n evenDum = evenDum.next\\n\\n oddDum.next = evenHead\\n return head\\n\\n\\n \",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head:\\n return None\\n\\n h = head\\n odd = head\\n even = head.next\\n even_odd = even\\n\\n while even and even.next:\\n odd.next = odd.next.next\\n even.next = even.next.next\\n even = even.next\\n odd = odd.next\\n \\n odd.next = even_odd\\n\\n return h\\n\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head: return None\\n odd = head\\n evenHead = even = head.next\\n while even and even.next:\\n odd.next = odd.next.next\\n odd = odd.next\\n even.next = even.next.next\\n even = even.next\\n odd.next = evenHead\\n return head\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next or not head.next.next:\\n return head\\n\\n \\n\\n ## Odd:\\n\\n odd = head\\n\\n even_head = head.next\\n even = even_head\\n\\n \\n while even and even.next:\\n odd.next = odd.next.next\\n even.next = even.next.next\\n\\n # if odd.next:\\n odd = odd.next\\n # if even.next:\\n even = even.next\\n\\n \\n odd.next = even_head\\n\\n return head\\n\\n\\n odd.next = even_head\\n\\n return head\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if not head or not head.next:\\n return head\\n \\n odd = head\\n even = head.next\\n even_head = even\\n while even and even.next:\\n odd.next = even.next\\n odd = odd.next\\n even.next = odd.next\\n even = even.next\\n odd.next = even_head\\n return head\\n \",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n odds, evens = ListNode(), ListNode()\\n oddsCurr, evensCurr = odds, evens\\n curr = head\\n i = 1\\n while curr:\\n if i % 2 == 0:\\n evensCurr.next = curr\\n evensCurr = evensCurr.next\\n else:\\n oddsCurr.next = curr\\n oddsCurr = oddsCurr.next\\n curr = curr.next\\n i += 1\\n oddsCurr.next = evens.next\\n evensCurr.next = None\\n return odds.next\\n\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\\n if head == None or head.next == None: \\n return head\\n odd = head\\n even = head.next\\n ehead = even\\n while even != None and even.next != None:\\n odd.next = odd.next.next\\n even.next = even.next.next\\n odd=odd.next\\n even= even.next\\n odd.next = ehead\\n return head\\n \",\n \"memory\": \"18600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":14,"string":"14"}}},{"rowIdx":258,"cells":{"question_id":{"kind":"number","value":329,"string":"329"},"name":{"kind":"string","value":"longest-increasing-path-in-a-matrix"},"content":{"kind":"string","value":"<p>Given an <code>m x n</code> integers <code>matrix</code>, return <em>the length of the longest increasing path in </em><code>matrix</code>.</p>\n\n<p>From each cell, you can either move in four directions: left, right, up, or down. You <strong>may not</strong> move <strong>diagonally</strong> or move <strong>outside the boundary</strong> (i.e., wrap-around is not allowed).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/01/05/grid1.jpg\" style=\"width: 242px; height: 242px;\" />\n<pre>\n<strong>Input:</strong> matrix = [[9,9,4],[6,6,8],[2,1,1]]\n<strong>Output:</strong> 4\n<strong>Explanation:</strong> The longest increasing path is <code>[1, 2, 6, 9]</code>.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/01/27/tmp-grid.jpg\" style=\"width: 253px; height: 253px;\" />\n<pre>\n<strong>Input:</strong> matrix = [[3,4,5],[3,2,6],[2,2,1]]\n<strong>Output:</strong> 4\n<strong>Explanation: </strong>The longest increasing path is <code>[3, 4, 5, 6]</code>. Moving diagonally is not allowed.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> matrix = [[1]]\n<strong>Output:</strong> 1\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>m == matrix.length</code></li>\n\t<li><code>n == matrix[i].length</code></li>\n\t<li><code>1 <= m, n <= 200</code></li>\n\t<li><code>0 <= matrix[i][j] <= 2<sup>31</sup> - 1</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":54.10180419173032,"string":"54.101804"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","dynamic-programming","depth-first-search","breadth-first-search","graph","topological-sort","memoization","matrix"],"string":"[\n \"array\",\n \"dynamic-programming\",\n \"depth-first-search\",\n \"breadth-first-search\",\n \"graph\",\n \"topological-sort\",\n \"memoization\",\n \"matrix\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"218\", 0.08990000000000001], [\"222\", 0.1437], [\"226\", 0.4131], [\"230\", 0.2515], [\"233\", 0.5747], [\"237\", 0.43100000000000005], [\"241\", 0.6285999999999999], [\"245\", 0.5209], [\"248\", 0.9158999999999999], [\"252\", 0.8441], [\"256\", 0.7901999999999999], [\"259\", 0.6646], [\"263\", 0.8981], [\"267\", 1.2213], [\"271\", 1.4189], [\"274\", 1.6522999999999999], [\"278\", 2.6401], [\"282\", 3.5381], [\"286\", 3.4841], [\"289\", 2.7298999999999998], [\"293\", 3.0352], [\"297\", 3.4123], [\"301\", 2.4245], [\"304\", 2.4964], [\"308\", 2.8197], [\"312\", 3.6997], [\"316\", 2.2271], [\"319\", 2.8377000000000003], [\"323\", 3.1609999999999996], [\"327\", 3.4124], [\"330\", 2.9274], [\"334\", 3.6639], [\"338\", 3.0531], [\"342\", 2.6761], [\"345\", 1.8679000000000001], [\"349\", 1.8499], [\"353\", 1.6882000000000001], [\"357\", 1.6523], [\"360\", 1.3829], [\"364\", 1.5984], [\"368\", 1.3470000000000002], [\"372\", 0.8441000000000001], [\"375\", 1.2212999999999998], [\"379\", 1.1135], [\"383\", 0.8801], [\"387\", 0.7363], [\"390\", 0.8801], [\"394\", 0.6287], [\"398\", 0.4669], [\"402\", 0.3771], [\"405\", 0.5029], [\"409\", 0.7364], [\"413\", 0.7543000000000001], [\"416\", 0.4131], [\"420\", 0.449], [\"424\", 0.5207999999999999], [\"428\", 0.5388], [\"431\", 0.3951], [\"435\", 0.3591], [\"439\", 0.5928], [\"443\", 0.3591], [\"446\", 0.3771], [\"450\", 0.3952], [\"454\", 0.34130000000000005], [\"458\", 0.32330000000000003], [\"461\", 0.4131], [\"465\", 0.21559999999999999], [\"469\", 0.41300000000000003], [\"473\", 0.2695], [\"476\", 0.485], [\"480\", 0.16160000000000002], [\"484\", 0.3053], [\"487\", 0.1796], [\"491\", 0.21550000000000002], [\"495\", 0.2515], [\"499\", 0.1617], [\"502\", 0.1257], [\"506\", 0.08990000000000001], [\"510\", 0.23349999999999999], [\"514\", 0.1796]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17165\", 0.8980000000000001], [\"17295\", 1.5984], [\"17425\", 2.694], [\"17555\", 8.5489], [\"17685\", 6.1961], [\"17815\", 6.268], [\"17945\", 5.8549], [\"18075\", 0.5029], [\"18205\", 0.3592], [\"18335\", 1.4009], [\"18465\", 2.2629], [\"18595\", 0.6286], [\"18725\", 0.3592], [\"18855\", 1.5266000000000002], [\"18985\", 1.6882], [\"19115\", 1.1135], [\"19245\", 1.0596], [\"19375\", 0.2335], [\"19505\", 0.2155], [\"19635\", 0.3233], [\"19765\", 0.5747], [\"19895\", 0.1976], [\"20025\", 0.0718], [\"20155\", 0.2156], [\"20285\", 0.1437], [\"20415\", 0.1257], [\"20545\", 0.23349999999999999], [\"20675\", 0.1616], [\"20805\", 0.2874], [\"20935\", 2.5862], [\"21065\", 23.3477], [\"21195\", 4.7593], [\"21325\", 0.9698], [\"21455\", 2.658], [\"21585\", 0.9878], [\"21715\", 0.8441], [\"21845\", 0.9158999999999999], [\"21975\", 0.8082], [\"22105\", 1.2572], [\"22235\", 0.88], [\"22365\", 1.2392], [\"22495\", 0.5388], [\"22625\", 0.3412], [\"22755\", 0.7902], [\"22885\", 0.5208], [\"23015\", 0.1437], [\"23145\", 0.5208], [\"23275\", 0.1437], [\"23405\", 0.2155], [\"23535\", 0.0898], [\"23665\", 0.1078], [\"23795\", 0.1078], [\"23925\", 0.1257], [\"24055\", 0.1257], [\"24185\", 0.1257], [\"24315\", 0.0898], [\"24445\", 0.23349999999999999], [\"24575\", 0.0359], [\"24705\", 0.0898], [\"24835\", 0.2155], [\"24965\", 0.1436], [\"25095\", 0.018], [\"25225\", 0.0359], [\"25355\", 0.0719], [\"25485\", 0.1257], [\"25615\", 0.1437], [\"25745\", 0.1257], [\"25875\", 0.0359], [\"26005\", 0.1078], [\"26135\", 0.0359], [\"26265\", 0.0539], [\"26395\", 0.1976], [\"26525\", 0.0898], [\"26655\", 0.0898], [\"26785\", 0.1437], [\"26915\", 0.0359], [\"27045\", 0.1796], [\"27175\", 0.7004], [\"27305\", 0.8082]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n if not matrix or not matrix[0]:\n return 0\n rows, cols = len(matrix), len(matrix[0])\n\n dp = [[0] * cols for _ in range(rows)]\n\n def dfs(i, j):\n\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0)\n return dp[i][j]\n \n for i in range(rows):\n for j in range(cols):\n dfs(i, j)\n\n return max(max(x) for x in dp)\n \n\n \n\n","runtime":"218"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n rows, cols = len(matrix), len(matrix[0])\n dp =[[0] * cols for i in range(rows)]\n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0)\n return dp[i][j]\n \n for r in range(rows):\n for c in range(cols):\n dfs(r,c)\n return max(max(x) for x in dp)","runtime":"218"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < M - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < N - 1 and val > matrix[i][j + 1] else 0)\n return dp[i][j]\n\n if not matrix or not matrix[0]: return 0\n M, N = len(matrix), len(matrix[0])\n dp = [[0] * N for i in range(M)]\n return max(dfs(x, y) for x in range(M) for y in range(N)) ","runtime":"222"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n, m = len(matrix), len(matrix[0])\n # dp[i][j] = Length of longest increasing path starting at (i, j)\n dp = [[0]*m for _ in range(n)]\n\n def dfs(i, j):\n if dp[i][j] == 0: # (i, j) not visited yet\n val = matrix[i][j]\n dp[i][j] = 1\n # Recurse on possible cardinal directions if \n # doing so creates an increasing path and take the max\n # of the directions\n dp[i][j] += max(\n dfs(i-1, j) if i > 0 and val < matrix[i-1][j] else 0,\n dfs(i+1, j) if i < n-1 and val < matrix[i+1][j] else 0,\n dfs(i, j-1) if j > 0 and val < matrix[i][j-1] else 0, \n dfs(i, j+1) if j < m-1 and val < matrix[i][j+1] else 0\n )\n return dp[i][j]\n \n for i in range(n):\n for j in range(m):\n if dp[i][j] == 0: # (i, j) not visited yet\n dfs(i, j)\n return max(max(dp[r]) for r in range(n))","runtime":"222"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n dp = [[0] * n for _ in range(m)]\n \n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i > 0 and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < m - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j > 0 and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < n - 1 and val > matrix[i][j + 1] else 0\n )\n return dp[i][j]\n \n return max(dfs(i, j) for i in range(m) for j in range(n))\n\n# Example usage:\nsolution = Solution()\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\nprint(solution.longestIncreasingPath(matrix)) # Output: 4","runtime":"226"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]: return 0\n rows, cols = len(matrix), len(matrix[0])\n dp = [[0] * cols for i in range(rows)]\n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i-1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i+1, j) if i < rows - 1 and val > matrix[i+1][j] else 0,\n dfs(i, j-1) if j and val > matrix[i][j-1] else 0,\n dfs(i, j+1) if j < cols - 1 and val > matrix[i][j+1] else 0\n )\n return dp[i][j]\n for r in range(rows):\n for c in range(cols):\n dfs(r,c)\n return max(max(x) for x in dp)","runtime":"226"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < M - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < N - 1 and val > matrix[i][j + 1] else 0)\n return dp[i][j]\n\n \n if not matrix or not matrix[0]:\n return 0\n \n M, N = len(matrix), len(matrix[0])\n dp = [[0] * N for i in range(M)]\n return max(dfs(x, y) for x in range(M) for y in range(N))","runtime":"230"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]: \n return 0\n\n rows, cols = len(matrix), len(matrix[0])\n dp = [[0] * cols for i in range(rows)]\n def dfs(i, j): \n if not dp[i][j]: \n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0\n )\n return dp[i][j]\n\n for r in range(rows): \n for c in range(cols): \n dfs(r, c)\n\n return max(max(x) for x in dp)","runtime":"230"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n def dfs(i, j, dp, M, N):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j, dp, M, N) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j, dp, M, N) if i < M - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1, dp, M, N) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1, dp, M, N) if j < N - 1 and val > matrix[i][j + 1] else 0)\n return dp[i][j]\n\n if not matrix or not matrix[0]: return 0\n M, N = len(matrix), len(matrix[0])\n dp = [[0] * N for i in range(M)]\n return max(dfs(x, y, dp, M, N) for x in range(M) for y in range(N))","runtime":"233"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n rows, cols = len(matrix), len(matrix[0])\n dp =[[0] * cols for i in range(rows)]\n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0)\n return dp[i][j]\n \n for r in range(rows):\n for c in range(cols):\n dfs(r,c)\n return max(max(x) for x in dp)","runtime":"233"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n rows = len(matrix)\n cols = len(matrix[0])\n\n dp = [[0]*cols for _ in range(rows)]\n res = 0\n\n def dfs(i, j):\n if not dp[i][j]:\n curr = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i+1, j) if i < rows-1 and curr > matrix[i+1][j] else 0,\n dfs(i-1, j) if i > 0 and curr > matrix[i-1][j] else 0,\n dfs(i, j+1) if j < cols-1 and curr > matrix[i][j+1] else 0,\n dfs(i, j-1) if j > 0 and curr > matrix[i][j-1] else 0\n )\n return dp[i][j]\n \n for r in range(rows):\n for c in range(cols):\n res = max(res, dfs(r, c))\n return res","runtime":"237"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n h = len(matrix)\n w = len(matrix[0])\n memo = [[0]*w for _ in range(h)]\n # source = [[None]*w for _ in range(h)]\n # end = (0,0)\n path = 0\n\n def dfs(i, j):\n if memo[i][j] == 0:\n add = 0\n # direc = (0,0)\n if(i+1 < h and matrix[i+1][j] > matrix[i][j]):\n up = dfs(i+1, j)\n if up > add:\n add = up\n # direc = (i+1,j)\n if(i-1 >= 0 and matrix[i-1][j] > matrix[i][j]):\n down = dfs(i-1, j)\n if down > add:\n add = down\n # direc = (i-1,j)\n if(j+1 < w and matrix[i][j+1] > matrix[i][j]):\n right = dfs(i, j+1)\n if right > add:\n add = right\n # direc = (i, j+1)\n if(j-1 >= 0 and matrix[i][j-1] > matrix[i][j]):\n left = dfs(i, j-1)\n if left > add:\n add = left\n # direc = (i, j-1)\n memo[i][j] = add + 1\n # source[i][j] = direc\n return memo[i][j]\n\n for i in range(h):\n for j in range(w):\n curr = dfs(i,j)\n if curr > path:\n path = curr\n # end = (i,j)\n\n # route = []\n # point = end\n # while point:\n # route.append(point)\n # point = source[point[0]][point[1]]\n # route.reversed()\n # print(route)\n \n return path","runtime":"237"},{"code":"import random\n\nclass Solution:\n def longestIncreasingPath(self, m: List[List[int]]) -> int:\n rm = len(m)\n cm = len(m[0])\n mxc = [[0]*cm for _ in range(rm)]\n rl = rm-1\n cl = cm-1\n def dfs(r,c):\n if not mxc[r][c]:\n v = m[r][c]\n mxc[r][c] = 1 + max(\n dfs(r+1,c) if r<rl and m[r+1][c]>v else 0,\n dfs(r-1,c) if r>0 and m[r-1][c]>v else 0,\n dfs(r,c+1) if c<cl and m[r][c+1]>v else 0,\n dfs(r,c-1) if c>0 and m[r][c-1]>v else 0\n )\n return mxc[r][c]\n mxx = 1\n for r in range(rm):\n for c in range(cm):\n mxx = max(mxx,dfs(r,c))\n return mxx","runtime":"241"},{"code":"import random\n\nclass Solution:\n def longestIncreasingPath(self, m: List[List[int]]) -> int:\n rm = len(m)\n cm = len(m[0])\n mxc = [[0]*cm for _ in range(rm)]\n def dfs(r,c):\n if not mxc[r][c]:\n v = m[r][c]\n mxc[r][c] = 1 + max(\n dfs(r+1,c) if r+1<rm and m[r+1][c]>v else 0,\n dfs(r-1,c) if r>0 and m[r-1][c]>v else 0,\n dfs(r,c+1) if c+1<cm and m[r][c+1]>v else 0,\n dfs(r,c-1) if c>0 and m[r][c-1]>v else 0\n )\n return mxc[r][c]\n mxx = 1\n for r in range(rm):\n for c in range(cm):\n mxx = max(mxx,dfs(r,c))\n return mxx","runtime":"241"},{"code":"class Solution:\n\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n return ans","runtime":"245"},{"code":"class Solution:\n\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n\n # up\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n # right\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n # down\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n # left\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n \n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n return ans","runtime":"245"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n dp = [[0] * n for _ in range(m)]\n \n def dfs(i, j):\n if not dp[i][j]:\n val = matrix[i][j]\n dp[i][j] = 1 + max(\n dfs(i - 1, j) if i > 0 and val > matrix[i - 1][j] else 0,\n dfs(i + 1, j) if i < m - 1 and val > matrix[i + 1][j] else 0,\n dfs(i, j - 1) if j > 0 and val > matrix[i][j - 1] else 0,\n dfs(i, j + 1) if j < n - 1 and val > matrix[i][j + 1] else 0\n )\n return dp[i][j]\n \n return max(dfs(x, y) for x in range(m) for y in range(n))\n\n# Example usage:\nsolution = Solution()\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\nprint(solution.longestIncreasingPath(matrix)) # Output: 4","runtime":"248"},{"code":"def dfs(matrix: list[list[int]], memo: list[list[int]], x: int, y: int) -> int:\n if memo[x][y] is not None:\n return memo[x][y]\n\n options = []\n\n if x + 1 < len(matrix) and matrix[x + 1][y] > matrix[x][y]:\n options.append(dfs(matrix, memo, x + 1, y))\n \n if x - 1 >= 0 and matrix[x - 1][y] > matrix[x][y]:\n options.append(dfs(matrix, memo, x - 1, y))\n\n if y + 1 < len(matrix[0]) and matrix[x][y + 1] > matrix[x][y]:\n options.append(dfs(matrix, memo, x, y + 1))\n\n if y - 1 >= 0 and matrix[x][y - 1] > matrix[x][y]:\n options.append(dfs(matrix, memo, x, y - 1))\n\n res = (max(options) if len(options) > 0 else 0) + 1\n memo[x][y] = res\n\n return res\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n memo = [[None] * len(matrix[0]) for _ in range(len(matrix))]\n\n\n max_ = 0\n\n for i, row in enumerate(matrix):\n for j, start in enumerate(row):\n max_ = max(max_, dfs(matrix, memo, i, j))\n\n return max_\n # return max([max(l) for l in memo])\n","runtime":"248"},{"code":"class Solution:\n\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n\n # up\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n # right\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n # down\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n # left\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n \n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n return ans","runtime":"252"},{"code":"class Solution:\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n\n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n\n return ans\n","runtime":"252"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n = len(matrix)\n m = len(matrix[0])\n dp = [[0 for x in range(m)] for y in range(n)]\n \n def dfs(r, c):\n res = 1\n if dp[r][c] != 0:\n return dp[r][c]\n if r - 1 >= 0 and matrix[r - 1][c] > matrix[r][c]:\n res = max(dfs(r - 1, c) + 1, res) \n if r + 1 < n and matrix[r + 1][c] > matrix[r][c]:\n res = max(dfs(r + 1, c) + 1, res)\n if c - 1 >= 0 and matrix[r][c - 1] > matrix[r][c]:\n res = max(dfs(r, c - 1) + 1, res)\n if c + 1 < m and matrix[r][c + 1] > matrix[r][c]:\n res = max(dfs(r, c + 1) + 1, res)\n dp[r][c] = res\n return res\n return max(dfs(r,c) for r in range(n) for c in range(m)) \n","runtime":"256"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n n = len(matrix)\n m = len(matrix[0])\n # dp[i][j] means LIP at (i,j)\n dp = [[0 for i in range(m)] for i in range(n)]\n def dfs(i,j):\n if dp[i][j]>0:\n return dp[i][j]\n \n res = 1\n if (i-1>=0) and matrix[i-1][j]>matrix[i][j]:\n res = max(res,dfs(i-1,j)+1)\n if (j-1>=0) and matrix[i][j-1]>matrix[i][j]:\n res = max(res,dfs(i,j-1)+1)\n if (i+1<n) and matrix[i+1][j]>matrix[i][j]:\n res = max(res,dfs(i+1,j)+1)\n if (j+1<m) and matrix[i][j+1]>matrix[i][j]:\n res = max(res,dfs(i,j+1)+1)\n dp[i][j] = res\n return dp[i][j]\n # def dfs(i,j):\n # # memorization\n # if dp[i][j]>0:\n # return dp[i][j]\n # res = 1\n # if (i-1>=0) and matrix[i-1][j]<matrix[i][j]:\n # res = max(dfs(i-1,j)+1,res)\n # if (j-1>=0) and matrix[i][j-1]<matrix[i][j]:\n # res = max(dfs(i,j-1)+1,res)\n # if (i+1<n) and matrix[i+1][j]<matrix[i][j]:\n # res = max(dfs(i+1,j)+1,res)\n # if (j+1)<m and matrix[i][j+1]<matrix[i][j]:\n # res = max(dfs(i,j+1)+1,res)\n \n # dp[i][j] = res\n # return res\n \n res = 0\n for i in range(n):\n for j in range(m):\n res = max(res,dfs(i,j))\n \n return res ","runtime":"259"},{"code":"class Solution:\n\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n\n # up\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n # right\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n # down\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n # left\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n return ans","runtime":"259"},{"code":"class Solution:\n\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n\n # up\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n # right\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n # down\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n # left\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n \n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n return ans","runtime":"263"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n @lru_cache(maxsize=None)\n def dp(i, j):\n\n if i < 0 or i >= len(matrix):\n return 0\n elif j < 0 or j >= len(matrix[0]):\n return 0\n\n return 1 + max(\n dp(i + 1, j) if i + 1 < len(matrix) and matrix[i][j] > matrix[i + 1][j] else 0,\n dp(i - 1, j) if i > 0 and matrix[i][j] > matrix[i - 1][j] else 0,\n dp(i, j + 1) if j + 1 < len(matrix[0]) and matrix[i][j] > matrix[i][j + 1] else 0,\n dp(i, j - 1) if j > 0 and matrix[i][j] > matrix[i][j - 1] else 0\n )\n\n return max([dp(i, j) for i in range(len(matrix)) for j in range(len(matrix[0]))])","runtime":"263"},{"code":"class Solution:\n def dfs(self,i,j,matrix,rows,cols,currLen,dp:list[List[int]])->int:\n if not(0<=i<rows or 0<=j<cols):\n return currLen\n if dp[i][j]>0:\n return dp[i][j]\n maxLen=0\n if i-1 >=0 and matrix[i][j] < matrix[i-1][j]:\n upLen=self.dfs(i-1,j,matrix,rows,cols,currLen,dp)\n maxLen=max(maxLen,upLen)\n if i+1 < rows and matrix[i][j] < matrix[i+1][j]:\n downLen=self.dfs(i+1,j,matrix,rows,cols,currLen,dp)\n maxLen=max(maxLen,downLen)\n if j-1 >=0 and matrix[i][j] < matrix[i][j-1]:\n leftLen=self.dfs(i,j-1,matrix,rows,cols,currLen,dp)\n maxLen=max(maxLen,leftLen)\n if j+1 <cols and matrix[i][j] < matrix[i][j+1]:\n rightLen=self.dfs(i,j+1,matrix,rows,cols,currLen,dp)\n maxLen=max(maxLen,rightLen)\n dp[i][j]=currLen+maxLen\n return currLen+maxLen\n \n\n\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not len(matrix) and not len(matrix[0]):\n return 0\n rows = len(matrix)\n cols = len(matrix[0])\n dp = [[0 for _ in range(cols)] for _ in range(rows)]\n maxLen=0\n for i in range(rows):\n for j in range(cols):\n currLen =self.dfs(i,j,matrix,rows,cols,1,dp)\n maxLen=max(maxLen,currLen)\n return maxLen","runtime":"267"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n memo = [[0] * n for _ in range(m)]\n def dfs(i, j):\n if memo[i][j]: return memo[i][j]\n val = matrix[i][j]\n path = 0\n for di, dj in [(0, -1), (0, 1), (-1, 0), (1, 0)]:\n ni, nj = i + di, j + dj\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > val:\n path = max(path, dfs(ni, nj))\n memo[i][j] = 1 + path\n return memo[i][j]\n res = 0\n for i in range(m):\n for j in range(n):\n res = max(res, dfs(i, j))\n # # Follow-up part: print the longest path\n # longest_paths = []\n # def find_longest_paths(i, j, max_length, cur_path, paths):\n # cur_path.append(matrix[i][j])\n # if len(cur_path) == max_length:\n # paths.append(cur_path)\n # return\n # for di, dj in [(0, -1), (0, 1), (-1, 0), (1, 0)]:\n # ni, nj = i + di, j + dj\n # if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j] and memo[ni][nj] == memo[i][j] - 1:\n # find_longest_paths(ni, nj, max_length, cur_path, paths)\n # for i in range(m):\n # for j in range(n):\n # if memo[i][j] == res:\n # find_longest_paths(i, j, res, [], longest_paths)\n # print(f\"The longest increasing path is {longest_paths}\")\n return res","runtime":"267"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n dire = [[0,1], [1,0], [-1,0], [0,-1]]\n memo = [[-1 for _ in range(n)] for _ in range(m)]\n \n def dfs(i, j):\n if memo[i][j] != -1:\n return memo[i][j]\n \n count = 1\n for dx, dy in dire:\n nr, nc = i + dx, j + dy\n if 0 <= nr < m and 0 <= nc < n and matrix[nr][nc] > matrix[i][j]:\n count = max(count, 1 + dfs(nr, nc))\n \n memo[i][j] = count\n return count\n \n return max(dfs(i, j) for i in range(m) for j in range(n))","runtime":"271"},{"code":"class Solution:\n def longestIncreasingPath(self, mat: List[List[int]]) -> int:\n\n m=len(mat)\n n=len(mat[0])\n dp=[[0]*(n+1) for _ in range(m+1)]\n m1=[0]\n def dfs(i,j,pr):\n if i>=m or j>=n or i<0 or j<0 or mat[i][j]<=pr:\n return 0\n if dp[i][j]!=0:\n return dp[i][j]\n\n r=1+max(dfs(i+1,j,mat[i][j]), dfs(i-1,j,mat[i][j]), dfs(i,j+1,mat[i][j]), dfs(i,j-1,mat[i][j]))\n dp[i][j]=r\n m1[0]=max(r,m1[0])\n return dp[i][j]\n\n for i in range(m):\n for j in range(n):\n dfs(i,j,-1)\n \n return m1[0]\n\n \n \n \n\n ","runtime":"271"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n rows, cols = len(matrix), len(matrix[0])\n memo = [[-1] * cols for _ in range(rows)]\n \n def dfs(i, j):\n if memo[i][j] != -1:\n return memo[i][j]\n \n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n max_path = 1\n \n for dir_x, dir_y in directions:\n x, y = i + dir_x, j + dir_y\n if 0 <= x < rows and 0 <= y < cols and matrix[x][y] > matrix[i][j]:\n max_path = max(max_path, 1 + dfs(x, y))\n \n memo[i][j] = max_path\n return memo[i][j]\n \n return max(dfs(i, j) for i in range(rows) for j in range(cols))","runtime":"274"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n memo = [[-1] * n for _ in range(m)] \n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]\n \n def dfs(i, j):\n if memo[i][j] != -1:\n return memo[i][j] \n \n max_len = 1\n for di, dj in directions:\n ni, nj = i + di, j + dj\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\n max_len = max(max_len, 1 + dfs(ni, nj))\n \n memo[i][j] = max_len \n return max_len\n \n longest = 0\n for i in range(m):\n for j in range(n):\n longest = max(longest, dfs(i, j)) \n \n return longest\n","runtime":"274"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # let dfs(i, j) return the longest increasing path from (i, j)\n # maintain a memory dp[i][j] represents the longest increasing path from (i, j)\n # DFS and do not dfs if it exists already in memory, O(n^2) Time O(n^2) space\n n, m = len(matrix), len(matrix[0])\n dp = [[0] * m for _ in range(n)]\n def dfs(i, j):\n if dp[i][j] != 0:\n return dp[i][j]\n \n dirs = [(0, 1), (1, 0), (0, -1), (-1, 0)]\n _max = 0\n for d in dirs:\n nr, nc = i + d[0], j + d[1]\n if nr < 0 or nr >= n or nc < 0 or nc >= m:\n continue\n if matrix[nr][nc] <= matrix[i][j]:\n continue\n _max = max(dfs(nr, nc), _max)\n\n dp[i][j] = 1 + _max\n return dp[i][j]\n \n output = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n output = max(dfs(i, j), output)\n\n return output\n\n \n ","runtime":"278"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n, m = len(matrix), len(matrix[0])\n mem = [[-1] * m for _ in range(n)]\n def dp(x: int, y: int) -> int:\n nonlocal matrix, mem, n, m\n if mem[x][y] != -1:\n return mem[x][y]\n max_neighbor = 0\n for dx, dy in [(-1, 0), (0, -1), (1, 0), (0, 1)]:\n nx, ny = x + dx, y + dy\n if 0 <= nx < n and 0 <= ny < m and matrix[nx][ny] > matrix[x][y]:\n max_neighbor = max(max_neighbor, dp(nx, ny))\n ret = max_neighbor + 1\n mem[x][y] = ret\n return ret\n ret = 0\n for i in range(n):\n for j in range(m):\n ret = max(ret, dp(i, j))\n return ret","runtime":"278"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n m, n = len(matrix), len(matrix[0])\n dp = [[0] * n for _ in range(m)]\n \n def dfs(x, y):\n if dp[x][y] != 0:\n return dp[x][y]\n \n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]\n max_length = 1\n \n for dx, dy in directions:\n nx, ny = x + dx, y + dy\n if 0 <= nx < m and 0 <= ny < n and matrix[nx][ny] > matrix[x][y]:\n max_length = max(max_length, 1 + dfs(nx, ny))\n \n dp[x][y] = max_length\n return max_length\n \n return max(dfs(x, y) for x in range(m) for y in range(n))\n\n","runtime":"282"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n mem = [[-1 for _ in range(n)]for _ in range(m)]\n choices = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n def rec(i, j):\n \n if mem[i][j] != -1:\n return mem[i][j]\n ans = 1\n for choice in choices:\n nxt_i, nxt_j = i + choice[0], j + choice[1]\n if 0 <= nxt_i <m and 0 <= nxt_j < n and matrix[i][j] > matrix[nxt_i][nxt_j]:\n ans = max(ans, 1+ rec(nxt_i, nxt_j))\n \n mem[i][j] = ans\n return ans\n \n ans = 1\n for i in range(m):\n for j in range(n):\n if mem[i][j] == -1:\n rec(i, j)\n ans = max(ans, mem[i][j])\n return ans\n \n\n \n \n\n ","runtime":"282"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n directions = lambda x, y : [(x + 1, y), (x, y + 1), (x - 1, y), (x, y - 1)]\n dp = [ [None] * n for _ in range(m) ]\n \n def dfs(r, c):\n if dp[r][c]:\n return dp[r][c]\n dp[r][c] = 1\n for nr, nc in directions(r, c):\n if 0 <= nr < m and 0 <= nc < n and matrix[r][c] < matrix[nr][nc]:\n dp[r][c] = max(dp[r][c], 1 + dfs(nr, nc))\n return dp[r][c]\n\n return max(dfs(r, c) for r in range(m) for c in range(n))","runtime":"286"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix):\n if not matrix or not matrix[0]:\n return 0\n\n m, n = len(matrix), len(matrix[0])\n memo = [[0]*n for _ in range(m)]\n\n def dfs(i, j):\n if memo[i][j]:\n return memo[i][j]\n max_length = 1\n for dx, dy in [(-1,0),(1,0),(0,-1),(0,1)]:\n x, y = i + dx, j + dy\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]:\n length = 1 + dfs(x, y)\n max_length = max(max_length, length)\n memo[i][j] = max_length\n return max_length\n\n max_path = 0\n for i in range(m):\n for j in range(n):\n max_path = max(max_path, dfs(i, j))\n\n return max_path\n","runtime":"286"},{"code":"class Solution:\n def longestIncreasingPath(self, grid: List[List[int]]) -> int:\n m,n=len(grid),len(grid[0])\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\n \n # using python cache lib for memoization\n @lru_cache(maxsize=None)\n def dfs(r,c):\n ans=1 \n\t\t\t# iterating through all 4 directions\n for x,y in directions: \n # calculating the new cell\n new_row,new_col=r+x, c+y\n\t\t\t\t# check if new cell is within the grid bounds and is an increasing sequence\n if 0<=new_row<m and 0<=new_col<n and grid[new_row][new_col]>grid[r][c]: \n # finding the max length of valid path from the current cell\n ans = max(ans, dfs(new_row, new_col) + 1 ) \n return ans\n \n return max(dfs(r,c) for r in range(m) for c in range(n)) ","runtime":"289"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n, me = len(matrix), len(matrix[0]), {}\n @cache\n def dp(u, v, m, n):\n # if me.setdefault((u, v), 0) != 0:\n # return me[(u, v)]\n res = 1\n for i, j in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\n x, y = u+i, v+j\n if x < 0 or x >= m or y < 0 or y >= n :\n continue\n if matrix[u][v] <= matrix[x][y]:\n continue\n res = max(res, dp(x, y, m, n)+1)\n # me[(u, v)] = res\n return res\n return max([dp(i, j, m, n) for i in range(m) for j in range(n)])","runtime":"289"},{"code":"# class Solution:\n# def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n# visited=[]\n# for row in range(len(matrix)):\n# row_list=[]\n# for col in range(len(matrix[row])):\n# row_list.append(0)\n# visited.append(row_list)\n \n# def BFS(i,j,mat):\n# stk=[[i,j]]\n# visited[i][j]=1\n# distance=[[-1 for j in range(len(mat[i]))] for i in range(len(mat))]\n# distance[i][j]=1\n# while (len(stk)>=1):\n# square=stk[0]\n# stk.pop(0)\n# i = square[0]\n# j = square[1]\n# m = len(mat)\n# n = len(mat[0])\n# if (j+1<n and visited[i][j+1]==0 and mat[i][j+1]>mat[i][j]):\n# visited[i][j+1]=1\n# distance[i][j+1]=distance[i][j]+1\n# stk.append([i,j+1])\n# # print(\"(\",i,\",\",j+1,\")\",1)\n# if (i-1>=0 and visited[i-1][j]==0 and mat[i-1][j]>mat[i][j]):\n# visited[i-1][j]=1\n# distance[i-1][j]=distance[i][j]+1\n# stk.append([i-1,j])\n# # print(\"(\",i-1,\",\",j,\")\",2)\n# if (j-1>=0 and visited[i][j-1]==0 and mat[i][j-1]>mat[i][j]):\n# visited[i][j-1]=1\n# distance[i][j-1]=distance[i][j]+1\n# stk.append([i,j-1])\n# # print(\"(\",i,\",\",j-1,\")\",3)\n# if (i+1<m and visited[i+1][j]==0 and mat[i+1][j]>mat[i][j]):\n# visited[i+1][j]=1\n# distance[i+1][j]=distance[i][j]+1\n# stk.append([i+1,j])\n# # print(\"(\",i+1,\",\",j,\")\",4)\n\n# curr_max=-1\n# for row in distance:\n# for col in row:\n# curr_max=max(curr_max,col)\n\n# return curr_max\n\n# lip=1\n# for i in range(len(matrix)):\n# for j in range(len(matrix[i])):\n# # if (visited[i][j]==0):\n# visited=[]\n# for row in range(len(matrix)):\n# row_list=[]\n# for col in range(len(matrix[row])):\n# row_list.append(0)\n# visited.append(row_list)\n \n# # print(f\"dfs{(i,j):}\")\n# # DFS(i,j,matrix,curr_len)\n# lip_candidate = BFS(i,j,matrix)\n# lip = max(lip,lip_candidate)\n \n# return lip\n \nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n memo = [[-1] * n for _ in range(m)] # Memoization table to store the longest path from each cell\n \n def dfs(i, j):\n if memo[i][j] != -1:\n return memo[i][j]\n \n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)] # Right, Down, Left, Up\n max_path = 1 # Every cell is at least a path of length 1\n \n for direction in directions:\n x, y = i + direction[0], j + direction[1]\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]:\n max_path = max(max_path, 1 + dfs(x, y))\n \n memo[i][j] = max_path\n return memo[i][j]\n \n lip = 0 # Longest Increasing Path\n for i in range(m):\n for j in range(n):\n lip = max(lip, dfs(i, j))\n \n return lip","runtime":"293"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n sys.setrecursionlimit(1000000) # Increase recursion limit\n\n m, n = len(matrix), len(matrix[0])\n dp = [[0] * n for _ in range(m)] # Memoization table\n\n def dfs(i, j):\n if dp[i][j]:\n return dp[i][j]\n max_length = 1 # Minimum path length is 1 (the cell itself)\n # Explore all four directions\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n x, y = i + dx, j + dy\n # Check boundaries and increasing condition\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]:\n length = 1 + dfs(x, y)\n max_length = max(max_length, length)\n dp[i][j] = max_length\n return max_length\n\n max_path = 0\n for i in range(m):\n for j in range(n):\n max_path = max(max_path, dfs(i, j))\n return max_path\n ","runtime":"293"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n, m = len(matrix), len(matrix[0])\n dp = [[0] * m for _ in range(n)]\n\n def dfs(r, c):\n if dp[r][c] != 0:\n return dp[r][c]\n \n dirs = [(0, 1), (1, 0), (0, -1), (-1, 0)]\n _max = 0\n for d in dirs:\n nr, nc = r + d[0], c + d[1]\n if nr < 0 or nr >= n or nc < 0 or nc >= m:\n continue\n\n if matrix[nr][nc] > matrix[r][c]:\n _max = max(_max, dfs(nr, nc))\n \n res = 1 + _max\n if dp[r][c] == 0:\n dp[r][c] = res\n\n return res\n \n for i, row in enumerate(matrix):\n for j, _ in enumerate(row):\n dfs(i, j)\n \n _max = 0\n for i, row in enumerate(dp):\n for _, v in enumerate(row):\n _max = max(_max, v)\n\n # print(dp)\n return _max","runtime":"297"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n '''\n 1) make cache\n 2) make DFS method\n marks when DFS called at another cell\n 3) keep track of max as you update\n '''\n dp = [[0 for x in range(len(matrix[0]))] for y in range(len(matrix))]\n\n x_dir = [1,-1,0,0]\n y_dir = [0,0,1,-1]\n \n def DFS(x,y):\n if dp[x][y] != 0:\n return dp[x][y]\n else:\n dp[x][y] = 1\n for i in range(4):\n new_x = x + x_dir[i]\n new_y = y + y_dir[i]\n if new_x >= 0 and len(matrix) > new_x and new_y >= 0 and len(matrix[0]) > new_y \\\n and matrix[new_x][new_y] > matrix[x][y]:\n if dp[new_x][new_y] != 0:\n dp[x][y] = max(dp[x][y], dp[new_x][new_y] + 1)\n else:\n value = DFS(new_x, new_y) + 1\n dp[x][y] = max(dp[x][y], value)\n return dp[x][y]\n\n max_len = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if dp[i][j] == 0:\n DFS(i,j)\n max_len = max(max_len, dp[i][j])\n return max_len\n \n\n\n\n \n","runtime":"297"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n m, n = len(matrix), len(matrix[0])\n res = 0\n memo = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n path = self.dfs(matrix, memo, m, n, i, j)\n res = max(res, path)\n return res\n\n def dfs(self, matrix, memo, m, n, i, j):\n if memo[i][j] != -1:\n return memo[i][j]\n dirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n res = 1\n for dir in dirs:\n x, y = i+dir[0], j+dir[1]\n if x < 0 or x >= m or y < 0 or y >= n or matrix[x][y] <= matrix[i][j]:\n continue\n path = 1 + self.dfs(matrix, memo, m, n, x, y)\n res = max(path, res)\n memo[i][j] = res\n return memo[i][j]\n ","runtime":"301"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ans = 0\n dp = [[0 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\n\n def dfs(i, j):\n nonlocal ans\n if dp[i][j] != 0:\n return dp[i][j]\n longest = 1\n for m, n in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\n if 0 <= m < len(matrix) and 0 <= n < len(matrix[0]) and matrix[i][j] > matrix[m][n]:\n longest = max(longest, dfs(m, n) + 1)\n dp[i][j] = longest\n ans = max(ans, dp[i][j])\n return dp[i][j]\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dfs(i, j)\n return ans","runtime":"301"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n res = 0\n dirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n cached = [[0]*n for _ in range(m)]\n\n def dfs(x, y):\n if cached[x][y] != 0:\n return cached[x][y]\n val = 0\n for shift_x, shift_y in dirs:\n row = x + shift_x\n col = y + shift_y\n if m-1 >= row >= 0 and n-1 >= col >= 0 and matrix[row][col] > matrix[x][y]:\n val = max(val, dfs(row, col))\n val += 1\n cached[x][y] = val\n return val\n \n for i in range(m):\n for j in range(n):\n val = dfs(i, j)\n res = max(res, val)\n \n return res","runtime":"304"},{"code":"from functools import lru_cache\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n M, N = len(matrix), len(matrix[0])\n @lru_cache(None)\n def dfs(x, y):\n res = 0\n for xx, yy in [(x+1, y), (x-1, y), (x, y+1), (x, y-1)]:\n if 0<=xx<M and 0<=yy<N and matrix[xx][yy] > matrix[x][y]:\n res = max(res, 1 + dfs(xx, yy))\n return res\n\n\n res = 0\n for i in range(M):\n for j in range(N):\n res = max(res, 1 + dfs(i, j))\n return res\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # M, N = len(matrix), len(matrix[0])\n # @lru_cache(None)\n # def length(i, j):\n # # starting from i,j the longest increasing path\n # res = 0\n # for ii, jj in [(i+1, j), (i-1, j), (i, j+1), (i, j-1)]:\n # if 0 <= ii < M and 0 <= jj < N and matrix[ii][jj] > matrix[i][j]:\n # res = max(res, 1 + length(ii, jj))\n # return res\n\n # ans = 0\n # for i in range(M):\n # for j in range(N):\n # ans = max(ans, 1 + length(i,j))\n # return ans","runtime":"304"},{"code":"class Solution:\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n naive, start BFS from each initial cell - this is very expensive - O(n^4)\n\n better: for each initial grid point, store the length of the longest increasing path with\n from that grid. this number doesn't change. we can use DFS and similarly find the longest\n path for all other cells reachable from the initial grid point.\n\n we only visit a cell once, so will be O(n^2) complexity.\n \"\"\"\n # init\n m, n = len(matrix), len(matrix[0])\n longest_paths = []\n for _ in range(m):\n longest_paths.append([0] * n)\n\n # init DFS over matrix cells if not already visited\n visited = set()\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n\n # inline helper method - check all 4 directions\n def dfs(i, j):\n res = [0] # no-op when computing max later\n\n for _di, _dj in directions:\n _i = i+_di\n _j = j+_dj\n if _i >= 0 and _i < m and _j >= 0 and _j < n:\n # next node must be greater than current node\n if matrix[_i][_j] > matrix[i][j]:\n if (_i, _j) in visited:\n # reuse previously computed max length\n res.append(longest_paths[_i][_j]) \n else:\n visited.add((_i, _j))\n res.append(dfs(_i, _j))\n\n # get max_path and set in grid\n max_path = max(res) + 1 # add 1 for current cell\n longest_paths[i][j] = max_path\n\n return max_path\n \n max_path_len = 1\n for i in range(m):\n for j in range(n):\n if (i, j) not in visited:\n visited.add((i, j))\n\n path_len = dfs(i, j)\n longest_paths[i][j] = path_len\n\n # update \n max_path_len = max(max_path_len, path_len)\n \n return max_path_len\n\n# tests\n# solution = Solution()\n\n# test_cases = [\n# {'input': matrix, 'expected': 4},\n# ...\n# ]\n\n# for test_case in test_cases:\n# assert(solution.solve(test_case['input']) == test_case['expected'])","runtime":"308"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n dp = [[0] * n for _ in range(m)]\n moves = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n\n def valid(i, j):\n return i >= 0 and j >= 0 and i < m and j < n\n\n def dfs(i, j):\n if dp[i][j]:\n return dp[i][j]\n res = 1\n for a, b in moves:\n if valid(i + a, j + b) and matrix[i + a][j + b] > matrix[i][j]:\n res = max(1 + dfs(i + a, j + b), res)\n dp[i][j] = res\n return res\n \n for i in range(m):\n for j in range(n):\n dfs(i, j)\n \n return max(max(row) for row in dp)\n \n\n \n","runtime":"308"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n self.n = len(matrix)\n self.m = len(matrix[0])\n max_len = 0\n cache = [[0 for _ in range(self.m)] for _ in range(self.n)]\n for i in range(self.n):\n for j in range(self.m):\n max_len = max(self.dfs(i, j, matrix, cache), max_len)\n return max_len\n \n def dfs(self, i:int, j:int, matrix: List[List[int]], cache:List[List[int]])-> int:\n dir_list = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n \n if (cache[i][j] != 0):\n return cache[i][j]\n \n for d in dir_list:\n x = i + d[0]\n y = j + d[1]\n if (0 <= x and x < self.n and 0 <= y and y < self.m and matrix[x][y] > matrix[i][j]):\n cache[i][j] = max(self.dfs(x, y, matrix, cache), cache[i][j])\n \n cache[i][j] +=1\n \n return cache[i][j]\n ","runtime":"312"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n [\n [9,9,4],\n [6,6,8],\n [2,1,1]\n ]\n \n [\n [1,1,2],\n [2,2,1],\n [3,4,2]\n ]\n \"\"\"\n n = len(matrix)\n m = len(matrix[0])\n visited = [[0] * m for _ in range(n)]\n \n def findInceasingPath(r, c, prev):\n nonlocal n\n nonlocal m\n \n if r < 0 or r == n or c < 0 or c == m:\n return 0\n \n if matrix[r][c] <= prev:\n return 0\n \n if visited[r][c] > 0:\n return visited[r][c]\n \n maxLen = 0\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\n \n visited[r][c] = maxLen + 1\n \n return visited[r][c]\n \n \n maxPathLen = 0\n for r in range(n):\n for c in range(m):\n pathLen = findInceasingPath(r, c, -1)\n maxPathLen = max(maxPathLen, pathLen)\n \n return maxPathLen\n \n \n ","runtime":"312"},{"code":"class Solution:\n\n def helper(self,i,j,c,m,s):\n\n\n\n if(i >= 0 and i < len(m) and j >= 0 and j < len(m[0]) and m[i][j] > c ):\n\n if((i,j) in s):\n\n return s[(i,j)]\n\n s[(i,j)] = max(self.helper(i+1,j,m[i][j],m,s),\n self.helper(i-1,j,m[i][j],m,s),\n self.helper(i,j+1,m[i][j],m,s),\n self.helper(i,j-1,m[i][j],m,s)) + 1 \n \n return s[(i,j)]\n \n else:\n\n return 0 \n\n \n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n s = {}\n max_ = float('-inf')\n for i in range(0,len(matrix)):\n for j in range(0,len(matrix[0])):\n max_ = max(max_,self.helper(i,j,-1,matrix,s))\n \n return max_ \n ","runtime":"316"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n, me = len(matrix), len(matrix[0]), {}\n def dp(u, v, m, n):\n if me.setdefault((u, v), 0) != 0:\n return me[(u, v)]\n res = 1\n for i, j in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\n x, y = u+i, v+j\n if x < 0 or x >= m or y < 0 or y >= n :\n continue\n if matrix[u][v] <= matrix[x][y]:\n continue\n res = max(res, dp(x, y, m, n)+1)\n me[(u, v)] = res\n return res\n return max([dp(i, j, m, n) for i in range(m) for j in range(n)])","runtime":"316"},{"code":"class Solution:\n DIRS = [[0, 1], [1, 0], [0, -1], [-1, 0]]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n\n memo: Dict[Tuple[int, int], int] = {}\n\n def dfs(r: int, c: int) -> int:\n if (r, c) in memo:\n return memo[(r, c)]\n \n total = 1\n for dr, dc in self.DIRS:\n nr = r + dr\n nc = c + dc\n\n if nr < 0 or nc < 0 or nr >= rows or nc >= cols:\n continue\n \n if matrix[r][c] < matrix[nr][nc]:\n total = max(total, 1 + dfs(nr, nc))\n\n memo[(r, c)] = total\n return total\n \n max_total = 0\n for r in range(rows):\n for c in range(cols):\n max_total = max(max_total, dfs(r, c))\n return max_total\n\n \n","runtime":"319"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n done={}\n\n def dfs(i,j,prev):\n\n if i<0 or i>=len(matrix) or j<0 or j>=len(matrix[0]):\n return 0\n \n current=matrix[i][j]\n if current<=prev:\n return 0\n \n if (i,j) in done:\n return done[(i,j)]\n\n path=1+max(dfs(i+1,j,current) , dfs(i-1,j,current) , dfs(i,j+1,current) , dfs(i,j-1,current))\n \n done[(i,j)]=path\n return path\n\n\n\n\n path=0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n path=max(path, dfs(i,j,-inf))\n \n return path","runtime":"319"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n max_length = 0 \n y_len = len(matrix)\n x_len = len(matrix[0])\n\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\n\n cache = {}\n\n def dfs(y,x):\n if (y,x) in cache:\n return cache[(y,x)]\n curr_len = 1\n for dy, dx in directions:\n new_y = y + dy\n new_x = x + dx\n if 0 <= new_y < y_len and 0 <= new_x < x_len and matrix[new_y][new_x] > matrix[y][x]:\n curr_len = max(1 + dfs(new_y, new_x), curr_len)\n cache[(y,x)] = curr_len\n return curr_len\n \n for i in range(y_len):\n for j in range(x_len):\n max_length = max(dfs(i,j), max_length)\n return max_length\n \n\n\n ","runtime":"323"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # Getting the number of rows and columns\n ROWS, COLS = len(matrix), len(matrix[0])\n\n # Create a hashmap so we don't have to recalculate the same cell\n hashmap = {}\n\n # Setting up DFS on matrix\n def dfs(row: int, col: int) -> int:\n # Base case: If we have already stored the result, return it\n if (row, col) in hashmap:\n return hashmap[(row, col)]\n \n # Create res to store the longest path we find for the current cell\n res = 1\n\n # Getting ready to move down, up, right, and left\n for dx, dy in [[1, 0], [-1, 0], [0, 1], [0, -1]]:\n r, c = row + dx, col + dy\n # Move to the next cell if its in bounds, and increasing\n if (0 <= r < ROWS and 0 <= c < COLS and matrix[r][c] > matrix[row][col]):\n length = 1 + dfs(r, c)\n res = max(res, length)\n \n hashmap[(row, col)] = res\n return res\n \n # Call the DFS function\n res = 0\n for r in range(ROWS):\n for c in range(COLS):\n if dfs(r, c) > res:\n res = dfs(r, c)\n \n return res","runtime":"323"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n, m = len(matrix), len(matrix[0])\n dp = {}\n\n def dfs(i, j, prev):\n if i < 0 or i >= n or j < 0 or j >= m or matrix[i][j] <= prev: return 0\n if (i, j) in dp: return dp[(i, j)]\n dp[(i, j)] = 1 + max(dfs(i+1, j, matrix[i][j]), dfs(i-1, j, matrix[i][j]), dfs(i, j+1, matrix[i][j]), dfs(i, j-1, matrix[i][j]))\n return dp[(i, j)] \n\n \n for i in range(n):\n for j in range(m):\n dfs(i, j, -1)\n print(dp)\n return max(dp.values())","runtime":"327"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m,n = len(matrix), len(matrix[0]) if matrix else 0\n\n memo = {}\n visited = set()\n maxi = 0\n\n def solve(i,j):\n if (i,j) in memo:\n return memo[(i,j)]\n ans = 1\n for di,dj in [(0,1),(0,-1),(1,0),(-1,0)]:\n ni,nj = i+di, j+dj\n if 0 <= ni < m and 0 <= nj < n and matrix[i][j] < matrix[ni][nj]:\n ans = max(ans, 1 + solve(ni,nj))\n \n memo[(i,j)] = ans\n return memo[(i,j)]\n \n for i in range(m):\n for j in range(n):\n maxi = max(maxi, solve(i,j))\n \n return maxi\n\n\n ","runtime":"327"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n pathMap = dict()\n nrows = len(matrix)\n ncols = len(matrix[0])\n res = 1\n def dfs(r, c, count, res):\n curr = 1\n for (x,y) in [(r+1,c), (r-1,c), (r,c+1), (r,c-1)]:\n if 0 <= x < nrows and 0 <= y < ncols and matrix[r][c] < matrix[x][y]:\n if (x,y) in pathMap:\n curr = max(curr, 1+pathMap[(x,y)])\n else:\n pathMap[(x,y)], res = dfs(x,y, count+1, res)\n curr = max(1+pathMap[(x,y)], curr)\n res = max(res, curr)\n return (curr, res)\n\n for row in range(nrows):\n for col in range(ncols):\n if (row,col) not in pathMap:\n pathMap[(row,col)], res = dfs(row,col, 1, res)\n\n return res","runtime":"330"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n h = len(matrix)\n w = len(matrix[0])\n\n dp = [[-1 for _ in range(w)] for _ in range(h)] # Initialize with -1 to indicate unvisited\n dc = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n def dfs(i, j, pr = -1):\n if i < 0 or i >= h or j < 0 or j >= w or matrix[i][j] <= pr:\n return 0 # Invalid move, so return 0 as no path\n\n if dp[i][j] != -1:\n return dp[i][j] # Return the cached value if it exists\n\n max_path = 1 # Start with length 1 (the current cell)\n \n for d in dc:\n max_path = max(max_path, 1 + dfs(i + d[0], j + d[1], matrix[i][j]))\n\n dp[i][j] = max_path # Cache the result in dp table\n return max_path\n \n res = 0\n for i in range(h):\n for j in range(w):\n res = max(res, dfs(i, j))\n \n return res\n","runtime":"330"},{"code":"dirs = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n @cache\n def dfs(i, j):\n if i < 0 or i >= m or j < 0 or j >= n:\n return 0\n cand = [dfs(i+x, j+y) for x, y in dirs if 0 <= i+x < m and 0 <= j+y < n and matrix[i+x][j+y] > matrix[i][j]]\n return 1 + max(cand) if cand else 1\n self.res = float('-inf')\n for i in range(m):\n for j in range(n):\n self.res = max(self.res, dfs(i, j))\n return self.res\n","runtime":"334"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n dp = {}\n def dfs(i, j):\n if (i, j) in dp:\n return dp[(i, j)]\n a = 0\n for dr, dc in [(0, 1), (1, 0), (-1, 0), (0, -1)]:\n nr, nc = i+dr, j+dc\n if 0 <= nr < m and 0 <= nc < n and matrix[nr][nc] > matrix[i][j]:\n a = max(a, dfs(nr, nc))\n \n dp[(i, j)] = 1 + a\n return dp[(i, j)]\n \n res = 0\n for i in range(m):\n for j in range(n):\n res = max(res, dfs(i, j))\n \n return res\n","runtime":"334"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n @cache\n def dfs(x, y):\n count = 1\n seen.add((x, y))\n for xx, yy in ((-1, 0), (1, 0), (0, -1), (0, 1)):\n nx, ny = x + xx, y + yy\n if (nx, ny) not in seen and 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] < matrix[x][y]:\n count = max(count, 1 + dfs(nx, ny))\n seen.remove((x, y))\n return count\n seen = set()\n count = 0\n for a in range(len(matrix)):\n for b in range(len(matrix[0])):\n count = max(count, dfs(a, b))\n return count\n ","runtime":"338"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = {} # (r, c) -> LIP\n\n def dfs(r, c, prevVal):\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prevVal:\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n\n res = 1\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n dp[(r, c)] = res\n return res\n\n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1)\n return max(dp.values())\n","runtime":"338"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = {}\n neighbors = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n def dfs(r, c, prev):\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prev:\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n\n result = 1\n for x, y in neighbors:\n result = max(result, 1 + dfs(r + x, c + y, matrix[r][c]))\n dp[(r, c)] = result\n return result\n \n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1)\n return max(dp.values())","runtime":"342"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n #creating 2d dp (or hash) to store LIP for each index\n\n #run dfs for each index if index not in dp, return the max value\n R = len(matrix)\n C = len(matrix[0])\n\n dp = {}\n\n #def dfs()\n def dfs(r,c,prev):\n #base: out of bounds and number is smaller or equal to prev number\n if r >= R or c >= C or r < 0 or c < 0 or matrix[r][c] <= prev:\n return 0\n #if index in dp: return that\n if (r,c) in dp:\n return dp[(r,c)]\n\n #keep calling on 4 adj sides and store which one gave max path into dp\n res = 1\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n\n dp[(r,c)] = res\n return dp[(r,c)]\n\n #loop through and call on indexes\n for r in range(R):\n for c in range(C):\n dfs(r,c,-1)\n\n #return max value\n return max(dp.values())","runtime":"342"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n m, n = len(matrix), len(matrix[0])\n directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n dp = [[0] * n for _ in range(m)]\n\n def dfs(r, c, prev):\n if r < 0 or r >= m or c < 0 or c >= n or matrix[r][c] <= prev:\n return 0\n if dp[r][c] > 0:\n return dp[r][c]\n \n dp[r][c] = 1\n for x, y in directions:\n nr, nc = r + x, c + y\n dp[r][c] = max(dp[r][c], 1 + dfs(nr, nc, matrix[r][c]))\n return dp[r][c]\n res = -1\n for i in range(m):\n for j in range(n):\n dp[i][j] = dfs(i, j, -1)\n res = max(res, dp[i][j])\n return res","runtime":"345"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n directions = [[0,-1], [0,1], [1,0], [-1,0]]\n def _dfs(r, c, memo):\n if (r, c) in memo:\n return memo[(r, c)]\n \n m = 1\n for rn, cn in directions:\n if (\n r + rn < len(matrix) and r + rn >= 0 and\n c + cn < len(matrix[0]) and c + cn >= 0 and\n matrix[r + rn][c + cn] > matrix[r][c]\n ):\n steps = 1 + _dfs(r + rn, c + cn, memo)\n m = max(m, steps)\n \n memo[(r, c)] = m\n return m\n \n if not matrix:\n return 0\n \n res = 1\n memo = {}\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n res = max(res, _dfs(r, c, memo))\n \n return res\n \n \n \n ","runtime":"345"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS = len(matrix)\n COLS = len(matrix[0])\n dp = {} #(r, c) -> lip\n \n def dfs(r, c, prevVal):\n if (r < 0 or r == ROWS) or (c < 0 or c == COLS) or matrix[r][c] <= prevVal:\n return 0\n \n if (r, c) in dp:\n return dp[(r, c)]\n curr = matrix[r][c]\n res = 1\n res = max(res, 1 + dfs(r + 1, c, curr))\n res = max(res, 1 + dfs(r - 1, c, curr))\n res = max(res, 1 + dfs(r, c + 1, curr))\n res = max(res, 1 + dfs(r, c - 1, curr))\n\n dp[(r, c)] = res\n\n return res\n\n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1)\n\n return max(dp.values())","runtime":"349"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or len(matrix) == 0 or not matrix[0] or len(matrix[0]) == 0:\n return -1\n\n row, col = len(matrix), len(matrix[0])\n res = 0\n visited = {}\n for i in range(row):\n for j in range(col):\n res = max(res, self.dfs(matrix, i, j, -1, visited))\n\n return res\n\n def dfs(self, matrix, i, j, preV, visited):\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]) or matrix[i][j] <= preV:\n return 0\n\n if (i, j) in visited:\n return visited[(i, j)]\n\n ans = 1\n ans = max(ans, 1 + self.dfs(matrix, 1 + i, j, matrix[i][j], visited))\n ans = max(ans, 1 + self.dfs(matrix, -1 + i, j, matrix[i][j], visited))\n ans = max(ans, 1 + self.dfs(matrix, i, j + 1, matrix[i][j], visited))\n ans = max(ans, 1 + self.dfs(matrix, i, j - 1, matrix[i][j], visited))\n\n visited[(i, j)] = ans\n return ans","runtime":"349"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n adj = defaultdict(list)\n ins = [0] * (m * n)\n\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\n\n for i in range(m):\n for j in range(n):\n value = matrix[i][j]\n currIdx = i * n + j\n\n for d in dir:\n x, y = i + d[0], j + d[1]\n\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\n newIdx = x * n + y\n\n adj[currIdx].append(newIdx)\n ins[newIdx] += 1\n \n q = deque()\n for i in range(m*n):\n if ins[i] == 0:\n q.append((i, 1))\n \n ans = 0\n\n while q:\n node, dst = q.popleft()\n ans = max(ans, dst)\n\n for u in adj[node]:\n ins[u] -= 1\n\n if ins[u] == 0:\n q.append((u, dst + 1))\n \n return ans\n\n \n def isValid(self, x, y, m, n):\n return 0 <= x < m and 0 <= y < n","runtime":"353"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]\n dists, max_dist = dict(), 0\n\n def is_valid_position(i, j):\n return 0 <= i < len(matrix) and 0 <= j < len(matrix[i])\n\n def dfs(i, j):\n nonlocal max_dist\n\n max_dists = [1]\n for d in directions:\n new_i, new_j = i + d[0], j + d[1]\n if is_valid_position(new_i, new_j) and matrix[new_i][new_j] > matrix[i][j]:\n if (new_i, new_j) not in dists:\n dir_max_dist = dfs(new_i, new_j)\n else:\n dir_max_dist = dists[(new_i, new_j)]\n\n max_dists.append(dir_max_dist + 1)\n\n dists[(i, j)] = max(max_dists)\n max_dist = max(dists[(i, j)], max_dist)\n return dists[(i, j)]\n\n for i in range(len(matrix)):\n for j in range(len(matrix[i])):\n if (i, j) in dists:\n continue\n\n dfs(i, j)\n\n return max_dist\n","runtime":"353"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n M, N = len(matrix), len(matrix[0])\n memo = {}\n def move(i, j):\n for x, y in [[0,1], [0,-1], [1,0], [-1,0]]:\n ni = i + x\n nj = j + y\n if 0 <= ni < M and 0 <= nj < N:\n yield ni, nj\n \n def dfs(i, j):\n nonlocal memo\n idx = i * N + j\n if idx in memo:\n return memo[idx]\n \n length = 1\n for ni, nj in move(i, j):\n if matrix[ni][nj] > matrix[i][j]:\n length = max(length, dfs(ni, nj) + 1)\n\n memo[idx] = length\n return length\n \n res = 1\n for i in range(M):\n for j in range(N):\n res = max(res, dfs(i, j))\n return res\n ","runtime":"357"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n def isvalid(row,col):\n return 0<=row<len(matrix) and 0<=col<len(matrix[0])\n directions = ((1,0),(0,1),(0,-1),(-1,0))\n memo = {}\n def dp(i,j):\n if (i,j) in memo:\n return memo[(i,j)]\n maxi = 0\n for dx,dy in directions:\n next_row,next_col = i+dx,j+dy\n if isvalid(next_row,next_col) and matrix[next_row][next_col]>matrix[i][j]:\n maxi = max(maxi, dp(next_row,next_col))\n memo[(i,j)] = 1+maxi\n return memo[(i,j)]\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n res = max(res,dp(i,j))\n return res\n\n\n \n ","runtime":"357"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n M, N = len(matrix), len(matrix[0])\n memo = {} \n def move(i, j):\n for x, y in [[0,1], [0,-1], [1,0], [-1,0]]:\n ni = i + x\n nj = j + y\n if 0 <= ni < M and 0 <= nj < N:\n yield ni, nj\n \n def dfs(i, j):\n idx = i * N + j\n if idx in memo:\n return memo[idx][0]\n \n length = 1\n next_cell = None\n for ni, nj in move(i, j):\n if matrix[ni][nj] > matrix[i][j]:\n l = dfs(ni, nj)\n if l + 1 > length:\n length = l + 1\n next_cell = (ni, nj)\n\n memo[idx] = (length, next_cell)\n return memo[idx][0]\n \n res = 0\n start_cell = None\n for i in range(M):\n for j in range(N):\n l = dfs(i, j)\n if l > res:\n res = l\n start_cell = (i, j)\n\n\n path = []\n i, j = start_cell\n while True:\n path.append((i, j))\n _, next_cell = memo[i * N + j]\n if not next_cell:\n break\n i, j = next_cell\n # print(path)\n return res\n ","runtime":"360"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n cache = {} \n\n def backtrack(r, c, prev):\n if (\n r < 0 or\n c < 0 or\n r == rows or\n c == cols or\n (r, c) in visit or\n matrix[r][c] <= prev \n ):\n return 0\n\n if (r, c) in cache:\n return cache[(r, c)]\n\n max_path = 1 + max(\n backtrack(r + 1, c, matrix[r][c]),\n backtrack(r - 1, c, matrix[r][c]),\n backtrack(r, c + 1, matrix[r][c]),\n backtrack(r, c - 1, matrix[r][c])\n )\n\n cache[(r, c)] = max_path\n return max_path\n\n res = 0\n for r in range(rows):\n for c in range(cols):\n visit = set()\n res = max(res, backtrack(r, c, float('-inf')))\n\n return res\n","runtime":"360"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n dp = {} #{(i, j) => maxLength}\n\n def helper(i, j, prev):\n if i < 0 or i >= m or j < 0 or j >= n or matrix[i][j] <= prev:\n return 0\n if (i,j) in dp:\n return dp[(i,j)]\n \n newPrev = matrix[i][j]\n # matrix[i][j] = -1\n maxL = 0\n for d in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n newI = i + d[0]\n newJ = j + d[1]\n maxL = max(maxL, helper(newI, newJ, newPrev))\n # matrix[i][j] = newPrev\n\n dp[(i,j)] = 1 + maxL\n return dp[(i,j)]\n \n\n res = 0\n for i in range(m):\n for j in range(n):\n res = max(res, helper(i, j, -1))\n \n return res\n","runtime":"364"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n longestPaths = [[0] * COLS for _ in range(ROWS)]\n\n def getLongestPath(r, c, prev):\n if min(r, c) < 0 or r == ROWS or c == COLS or matrix[r][c] <= prev:\n return 0 \n if longestPaths[r][c] != 0:\n return longestPaths[r][c]\n\n curLongestPath = 0\n for dr, dc in [(0, 1), (0, -1), (-1, 0), (1, 0)]:\n curLongestPath = max(curLongestPath,\n getLongestPath(r + dr, c + dc, matrix[r][c]))\n longestPaths[r][c] = 1 + curLongestPath\n return longestPaths[r][c]\n \n res = 1\n for r in range(ROWS):\n for c in range(COLS):\n res = max(res, getLongestPath(r, c, -1))\n return res","runtime":"364"},{"code":"class Solution:\n dictionary = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = [[-1 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n self.longestIncreasingPathHelper(matrix, dp, i, j)\n res = max(res, dp[i][j])\n return res\n \n \n def longestIncreasingPathHelper(self, matrix: List[List[int]], dp: List[List[int]], r: int, c: int):\n dp[r][c] = 1\n for dir_x, dir_y in self.dictionary:\n new_r, new_c = dir_x + r, dir_y + c\n if (0 <= new_r < len(matrix) and 0 <= new_c < len(matrix[0])):\n if matrix[new_r][new_c] > matrix[r][c]:\n if dp[new_r][new_c] == -1:\n self.longestIncreasingPathHelper(matrix, dp, new_r, new_c)\n dp[r][c] = max(dp[r][c], 1 + dp[new_r][new_c])","runtime":"368"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n cache = {}\n\n def dfs(r, c, prev):\n if min(r, c) < 0 or r == ROWS or c == COLS or matrix[r][c] <= prev:\n return 0\n if (r, c) in cache:\n return cache[(r, c)]\n res = 1 + dfs(r + 1, c, matrix[r][c])\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n cache[(r, c)] = res\n\n return res\n\n res = 0\n for r in range(ROWS):\n for c in range(COLS):\n res = max(res, dfs(r, c, -1))\n\n return res","runtime":"368"},{"code":"from collections import defaultdict\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n memo = {}\n def dfs(i, j):\n if (i, j) in memo:\n return memo[(i, j)]\n memo[(i, j)] = 1\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n for direction in directions:\n new_x, new_y = i + direction[0], j + direction[1]\n if new_x >= 0 and new_x < len(matrix) and new_y >= 0 and new_y < len(matrix[0]) and matrix[new_x][new_y] > matrix[i][j]:\n memo[(i, j)] = max(memo[(i, j)], 1+ dfs(new_x, new_y))\n return memo[(i, j)]\n ans = 0\n for i in range (len(matrix)):\n for j in range (len(matrix[0])):\n ans = max(ans, dfs(i, j))\n return ans\n ","runtime":"379"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n # Initialize memoization dictionary\n seen = {}\n \n # Dimensions of the matrix\n m, n = len(matrix), len(matrix[0])\n \n def inBounds(i, j):\n # Check if the indices are within the matrix bounds\n return 0 <= i < m and 0 <= j < n\n\n def dfs(i, j):\n # If already computed the result for this cell, return it\n if (i, j) in seen:\n return seen[(i, j)]\n \n # Define the possible directions (up, down, left, right)\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n max_path = 1 # The path length at least includes the current cell\n \n for di, dj in directions:\n ni, nj = i + di, j + dj\n if inBounds(ni, nj) and matrix[ni][nj] > matrix[i][j]:\n max_path = max(max_path, 1 + dfs(ni, nj))\n \n # Memoize the result for the current cell\n seen[(i, j)] = max_path\n return max_path\n \n # Find the longest increasing path starting from each cell\n longest_path = 0\n for i in range(m):\n for j in range(n):\n longest_path = max(longest_path, dfs(i, j))\n \n return longest_path\n","runtime":"379"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n longestPaths = {}\n\n def isValid(r,c):\n return 0 <= r < m and 0 <= c < n\n\n def get_neighbors(r,c):\n neighbors = []\n directions = [(0,1),(1,0),(0,-1),(-1,0)]\n for dx, dy in directions:\n if isValid(r+dx, c+dy):\n neighbors.append((r+dx, c+dy))\n \n return neighbors\n\n def backtracking(r, c):\n curr_val = matrix[r][c]\n max_neighbor_len = 0\n\n for n in get_neighbors(r,c):\n if matrix[n[0]][n[1]] > curr_val:\n if (n[0], n[1]) in longestPaths:\n neighbor_len = longestPaths[(n[0], n[1])]\n else:\n neighbor_len = backtracking(n[0], n[1])\n max_neighbor_len = max(max_neighbor_len, neighbor_len)\n \n longestPaths[(r,c)] = max_neighbor_len + 1\n return max_neighbor_len + 1\n \n for i in range(m):\n for j in range(n):\n if (i,j) not in longestPaths:\n backtracking(i, j)\n \n return max(longestPaths.values())\n \n\n\n\n\n ","runtime":"383"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows = len(matrix)\n cols = len(matrix[0])\n directions = [(-1, 0), (1, 0), (0, 1), (0, -1)]\n indegrees = [[0 for _ in range(cols)] for _ in range(rows)]\n queue = deque()\n\n for i in range(rows):\n for j in range(cols):\n curr_val = matrix[i][j]\n for direction in directions:\n new_i, new_j = i + direction[0], j + direction[1]\n if new_i < 0 or new_i >= rows or new_j < 0 or new_j >= cols:\n continue \n \n if matrix[new_i][new_j] > curr_val:\n indegrees[new_i][new_j] += 1 \n \n #print(indegrees)\n \n for i in range(rows):\n for j in range(cols):\n if indegrees[i][j] == 0:\n queue.append((1, i, j))\n \n max_length = 1\n while queue:\n length, i, j = queue.popleft()\n print(str(i) + \" \" + str(j))\n max_length = max(max_length, length)\n\n for direction in directions:\n new_i, new_j = direction[0] + i, direction[1] + j \n if new_i < 0 or new_i >= rows or new_j < 0 or new_j >= cols:\n continue \n\n if matrix[new_i][new_j] > matrix[i][j]:\n indegrees[new_i][new_j] -= 1\n if indegrees[new_i][new_j] == 0:\n queue.append((length + 1, new_i, new_j)) \n \n return max_length\n\n ","runtime":"383"},{"code":"from typing import List\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n n, m = len(matrix), len(matrix[0])\n memo = [[-1] * m for _ in range(n)] # 初始化记忆化数组\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)] # 四个方向：右、左、下、上\n result = 0 # 存储全局最大值\n\n def dfs_iterative(i, j):\n if memo[i][j] != -1:\n return memo[i][j]\n\n stack = [(i, j)] # 栈存储坐标\n path_lengths = {} # 用来存储每个坐标的路径长度\n\n while stack:\n x, y = stack[-1]\n if (x, y) not in path_lengths: # 初始化路径长度\n path_lengths[(x, y)] = 1\n\n can_expand = False\n for dx, dy in directions:\n nx, ny = x + dx, y + dy\n if 0 <= nx < n and 0 <= ny < m and matrix[nx][ny] > matrix[x][y]:\n if memo[nx][ny] == -1: # 如果该邻居没有被计算过\n stack.append((nx, ny)) # 继续往深处探索\n can_expand = True\n else:\n # 更新当前路径的最大长度\n path_lengths[(x, y)] = max(path_lengths[(x, y)], 1 + memo[nx][ny])\n\n if not can_expand: # 如果不能再扩展，更新 memo 和栈顶元素\n x, y = stack.pop() # 当前节点完成探索，弹出栈\n memo[x][y] = path_lengths[(x, y)] # 记录该点的最长路径\n\n return memo[i][j]\n\n # 遍历矩阵中的每个点，使用迭代版 DFS 计算最长递增路径\n for i in range(n):\n for j in range(m):\n result = max(result, dfs_iterative(i, j))\n \n return result","runtime":"387"},{"code":"# 2024/09/15\n# 面试前刷Doordash高频题\n#\n# 这题有点意思，相当于longest increasing subset的二维变种\n# 能否用DP，关键问题\n# 应该没问题，首先不会有使用同一个元素的情况，因为是严格increasing\n# 接下去问题是如何填表了，如果用Bottom up的话\n# 感觉这题用top down更合适，不用考虑填表问题\n# 那就DFS，这里问题是去重怎么弄？想起来应该是之前有讨论DFS怎么detect cycle，需要有一个visited表示当前这个path的parents，和传统的DFS的visited有点不一样\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n memo = {}\n global_max = [0]\n\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if (i, j) not in memo:\n visited = set()\n visited.add((i, j))\n self.helper(i, j, visited, memo, matrix, global_max)\n\n return global_max[0]\n\n def helper(self, row, col, visited, memo, matrix, global_max):\n if (row, col) in memo:\n return memo[(row, col)]\n\n local_max = 1\n for dx, dy in [1, 0], [-1, 0], [0, 1], [0, -1]:\n x = row + dx\n y = col + dy\n if 0 <= x < len(matrix) and 0 <= y < len(matrix[0]):\n if (x, y) in visited:\n continue\n \n if matrix[x][y] < matrix[row][col]:\n visited.add((x, y))\n local_max = max(local_max, 1 + self.helper(x, y, visited, memo, matrix, global_max))\n visited.remove((x, y))\n\n memo[(row, col)] = local_max\n global_max[0] = max(global_max[0], local_max)\n\n return local_max","runtime":"387"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = {}\n def dfs(r, c, prev):\n if min(r, c) < 0 or r >= len(matrix) or c >= len(matrix[0]) or matrix[r][c] <= prev:\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n res = 1\n curr = matrix[r][c]\n res = max(res, 1 + dfs(r + 1, c, curr))\n res = max(res, 1 + dfs(r - 1, c, curr))\n res = max(res, 1 + dfs(r, c + 1, curr))\n res = max(res, 1 + dfs(r, c - 1, curr))\n dp[(r, c)] = res\n\n return dp[(r, c)]\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n dfs(r, c, -1)\n return max(dp.values())","runtime":"390"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n _dir =[(-1,0),(1,0),(0,1),(0,-1)]\n def isValid(i,j):\n return i >=0 and j>=0 and i<len(matrix) and j<len(matrix[0])\n def dfs(i,j):\n if (i,j) in dp:\n return dp[(i,j)]\n _max=0\n for dr,dc in _dir:\n if isValid(i+dr,j+dc):\n if matrix[i+dr][j+dc]> matrix[i][j]:\n _max=max(_max,dfs(i+dr,j+dc))\n dp[(i,j)]=1+_max\n return dp[(i,j)]\n dp={}\n _max=0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n _max=max(_max,dfs(i,j))\n\n return _max\n\n\n \n\n ","runtime":"390"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n cache = {}\n ans = 0\n def dfs(i,j, parent):\n if i<0 or i>=len(matrix) or j<0 or j>=len(matrix[0]) or matrix[i][j]<=parent:\n print('yes')\n return 0\n if (i,j) in cache:\n return cache[(i,j)]\n cur_parent = matrix[i][j]\n longest_path = max(dfs(i+1, j, cur_parent), dfs(i-1, j, cur_parent), dfs(i, j+1, cur_parent), dfs(i, j-1, cur_parent))\n cache[(i,j)] = longest_path + 1\n return longest_path+1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n ans = max(ans, dfs(i,j, -float('inf')))\n return ans","runtime":"394"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m=len(matrix)\n n=len(matrix[0])\n\n memo=defaultdict(int)\n self.sol=1\n \n def findLongest(i, j):\n if (i, j) in memo:\n return\n for dir in [(1,0), (-1,0),(0,1),(0,-1)]:\n i2=i+dir[0]\n j2=j+dir[1]\n\n if 0<=i2<m and 0<=j2<n and matrix[i2][j2]>matrix[i][j]:\n if (i2, j2) not in memo:\n findLongest(i2, j2)\n memo[(i, j)]=max(memo[(i2, j2)]+1, memo[(i, j)])\n self.sol=max(memo[(i, j)], self.sol)\n memo[(i, j)]=max(memo[(i, j)], 1)\n\n for i in range(m):\n for j in range(n):\n findLongest(i, j)\n return self.sol\n ","runtime":"394"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n def cache(fn):\n memo = {}\n def wrapper(r : int, c : int) -> int:\n if (r, c) in memo:\n return memo[(r,c)]\n res = fn(r, c)\n memo[(r,c)] = res\n return res\n \n return wrapper\n\n\n def valid_rc(r, c) -> bool:\n return r >= 0 and c >= 0 and r < len(matrix) and c < len(matrix[0])\n\n @cache\n def max_path_length(r : int, c : int) -> int:\n if not valid_rc(r, c):\n return 0\n \n max_path = 1\n for nr, nc in [(r+1, c), (r-1, c), (r, c+1), (r, c-1)]: \n if valid_rc(nr, nc) and matrix[nr][nc] > matrix[r][c]:\n max_path = max(1 +max_path_length(nr, nc), max_path)\n\n return max_path\n\n \n longestPath = 0\n\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n longestPath = max(max_path_length(r, c), longestPath)\n\n \n return longestPath","runtime":"398"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n memo = {}\n directions = [[-1, 0], [1, 0], [0, 1], [0, -1]]\n res = 0\n\n def dfs(i, j):\n if (i, j) in memo:\n return memo[(i, j)]\n\n path = 1\n for d in directions:\n # get the next coord in direction\n r = i + d[0]\n c = j + d[1]\n # chk conditions\n if (0<=r<len(matrix) and 0<=c<len(matrix[0]) and\n matrix[r][c] != 'X' and matrix[r][c] > matrix[i][j]):\n # add to visited\n # recursive call to dfs while adding to curPath + path\n oldVal = matrix[i][j]\n matrix[i][j] = 'X'\n path = max(path, dfs(r, c) + 1)\n matrix[i][j] = oldVal\n\n memo[(i, j)] = path\n return memo[(i, j)]\n\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n res = max(res, dfs(i, j))\n print(memo)\n return res","runtime":"398"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m,n = len(matrix), len(matrix[0])\n\n @cache\n def near(start):\n res = []\n i,j = start\n for pos in [(i+1,j), (i,j+1), (i-1, j), (i,j-1)]:\n x,y = pos\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]: \n res.append(pos)\n return res\n\n def dfs(start, depth):\n i,j = start\n if dp[i][j]:\n return (depth-1) + dp[i][j]\n res = depth\n for node in near(start):\n res = max(res, dfs(node, depth+1))\n dp[i][j] = res - depth + 1\n return res\n \n dp = [[None]*n for _ in range(m)]\n res = 1\n for i in range(m):\n for j in range(n):\n dfs((i,j), 1)\n res = max(res, dp[i][j])\n print(dp)\n return res\n\n \n","runtime":"402"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dirs = [(-1,0),(1,0),(0,1),(0,-1)]\n dp = {}\n def dfs(x,y):\n ans = 1 \n if (x,y) in dp:\n return dp[(x,y)]\n for dx, dy in dirs:\n xx, yy = x+dx, y+dy \n if xx in range(m) and yy in range(n) and matrix[xx][yy]>matrix[x][y]:\n if (xx,yy) in dp:\n ans = max(ans, 1+dp[(xx,yy)])\n else:\n ans = max(ans, 1+dfs(xx,yy))\n dp[(x,y)] = ans \n return ans \n \n ans = 0 \n for i in range(m):\n for j in range(n):\n ans = max(ans, dfs(i,j))\n return ans ","runtime":"402"},{"code":"from collections import deque\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = {}\n ROWS, COLS = len(matrix), len(matrix[0])\n\n def dfs(i,j):\n if (i,j) in dp:\n return dp[(i,j)]\n \n ROWS, COLS = len(matrix), len(matrix[0])\n DIRS = [(1,0), (-1,0), (0,1), (0,-1)]\n\n path_len = 0\n for dr, dc in DIRS:\n new_i, new_j = dr+i, dc+j\n if new_i in range(ROWS) and new_j in range(COLS) and matrix[i][j] < matrix[new_i][new_j]:\n path_len = max(path_len, dfs(new_i, new_j))\n \n dp[(i,j)] = path_len+1\n return path_len+1\n \n res = 0\n for r in range(ROWS):\n for c in range(COLS):\n res = max(res, dfs(r,c))\n \n return res","runtime":"405"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ans = 0\n visited = set()\n M = len(matrix)\n N = len(matrix[0])\n longest = {}\n\n # create an array which has longest inc path starting at (i, j)\n # need to pop the answer back through the dfs calls\n\n def dfs(i, j, prev):\n # check\n if (i < 0 or j < 0 or\n i >= M or j >= N or\n matrix[i][j] <= prev):\n return 0\n \n # if we already searched this path\n if (i, j) in longest:\n return longest[(i, j)]\n\n max_len = 0\n \n # search directions\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n for d1, d2 in directions:\n # need to return max path\n temp = dfs(i + d1, j + d2, matrix[i][j])\n max_len = max(temp, max_len)\n \n longest[(i, j)] = 1 + max_len\n \n return 1 + max_len\n \n ans = 0\n\n for i in range(M):\n for j in range(N):\n temp = dfs(i, j, -1)\n ans = max(ans, temp)\n\n print(longest)\n return ans\n\n \n\n\n\n ","runtime":"405"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n adj_dict = defaultdict(list)\n in_deg = defaultdict(int)\n\n def within(y, x):\n return y >= 0 and y < len(matrix) and x >= 0 and x < len(matrix[y])\n\n for y in range(len(matrix)):\n for x in range(len(matrix[y])):\n val = matrix[y][x]\n in_deg[(y,x)] = 0\n if within(y+1, x):\n if matrix[y+1][x] < val:\n adj_dict[(y+1, x)].append((y, x))\n if within(y-1, x):\n if matrix[y-1][x] < val:\n adj_dict[(y-1, x)].append((y, x))\n if within(y, x+1):\n if matrix[y][x+1] < val:\n adj_dict[(y, x+1)].append((y, x))\n if within(y, x-1):\n if matrix[y][x-1] < val:\n adj_dict[(y, x-1)].append((y, x))\n \n for point, deps in adj_dict.items():\n for dep in deps:\n in_deg[dep] += 1\n \n queue = []\n for point, degree in in_deg.items():\n if degree == 0:\n queue.append(point)\n \n sol = 0\n while len(queue) > 0:\n sol += 1\n nextqueue = []\n \n for point in queue:\n for nextpoint in adj_dict[point]:\n in_deg[nextpoint] -= 1\n if in_deg[nextpoint] == 0:\n nextqueue.append(nextpoint)\n \n queue = nextqueue\n return sol\n ","runtime":"409"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n visited = set()\n node_visited = {}\n def dfs(root, visited):\n x, y = root\n if (x, y) in visited:\n return 0\n if (x, y) in node_visited:\n return node_visited[(x,y)]\n record_path = 0\n visited.add((x, y))\n for dx, dy in directions:\n if x+dx >= 0 and x+dx < len(matrix) and y+dy >= 0 and y+dy < len(matrix[0]) and (x+dx, y+dy) not in visited:\n if matrix[x+dx][y+dy] > matrix[x][y]:\n \n record_path = max(record_path, dfs((x+dx, y+dy), visited))\n visited.remove((x, y))\n node_visited[(x,y)] = record_path + 1\n return record_path + 1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dfs((i, j), visited)\n return max(node_visited.values())","runtime":"409"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n '''\n given a starting point A, there are four possible directions, \n find the one that lead to increasing path, then searching from that particular point\n '''\n m, n = len(matrix), len(matrix[0])\n memo = [[0 for _ in range(201)] for _ in range(201)]\n\n def dfs(matrix, i, j):\n if memo[i][j] != 0:\n return memo[i][j]\n \n directions = [[0,1], [0,-1], [1,0], [-1,0]]\n res = 0\n for d in directions:\n dx, dy = d\n x = i + dx\n y = j + dy\n\n if x < 0 or x >= m or y < 0 or y >= n:\n continue\n if matrix[x][y] <= matrix[i][j]:\n continue\n res = max(res, dfs(matrix, x, y))\n memo[i][j] = 1+res\n return 1+res\n\n ret = 0 \n for i in range(m):\n for j in range(n):\n ret = max(ret, dfs(matrix, i, j)) # find the max ret for every point in this matrix\n return ret\n","runtime":"413"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix),len(matrix[0])\n cache = defaultdict(int)\n directions = [(0,1), (0, -1), (1,0),(-1,0)]\n\n def checkInBounds(i, j):\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]):\n return False\n return True\n\n def dfs(i, j):\n if (i, j) in cache:\n return cache[(i,j)]\n \n \n\n for direction in directions:\n next_i, next_j = i + direction[0], j+direction[1]\n if checkInBounds(next_i, next_j) and matrix[i][j] > matrix[next_i][next_j]:\n cache[(i, j)] = max(cache[(i, j)], dfs(next_i, next_j))\n cache[(i, j)] += 1\n return cache[(i, j)]\n\n res = 0\n for r in range(ROWS):\n for c in range(COLS):\n res = max(dfs(r,c), res)\n return res\n \n","runtime":"413"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n def dfs(row, col):\n def within_bounds(r, c):\n return 0 <= r < len(matrix) and 0 <= c < len(matrix[0])\n if (row, col) in memo:\n return memo[(row, col)]\n ans = 1\n for nr, nc in neighbors:\n newr, newc = row + nr, col + nc\n if within_bounds(newr, newc) and matrix[newr][newc] != \"#\" and matrix[newr][newc] > matrix[row][col]:\n tmp = matrix[row][col]\n matrix[row][col] = \"#\"\n ans = max(ans, dfs(newr, newc) + 1)\n matrix[row][col] = tmp\n memo[(row, col)] = ans\n return ans\n\n neighbors = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n memo = {}\n max_result = 0\n for row in range(len(matrix)):\n for col in range(len(matrix[0])):\n max_result = max(max_result, dfs(row, col))\n return max_result","runtime":"416"},{"code":"class Solution:\n \n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # topo sort\n def inBound(x, y, m, n):\n return 0 <= x < m and 0 <= y < n\n\n m, n = len(matrix), len(matrix[0])\n indegree = defaultdict(int)\n dirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n for i in range(m):\n for j in range(n):\n for dx, dy in dirs:\n nx, ny = i + dx, j + dy\n if inBound(nx, ny, m, n) and matrix[nx][ny] < matrix[i][j]:\n indegree[(i, j)] += 1\n \n q = deque()\n for i in range(m):\n for j in range(n):\n if indegree[(i, j)] == 0:\n q.append((i, j))\n\n res = 0\n while q:\n for _ in range(len(q)):\n cx, cy = q.popleft()\n for dx, dy in dirs:\n nx, ny = cx + dx, cy + dy\n if inBound(nx, ny, m, n) and matrix[nx][ny] > matrix[cx][cy]:\n indegree[(nx, ny)] -= 1\n if indegree[(nx, ny)] == 0:\n q.append((nx, ny))\n res += 1\n return res","runtime":"416"},{"code":"class Solution:\n def update(self,graph,matrix,i,j,i_start,j_start):\n m=len(matrix)\n n=len(matrix[0])\n if i<0 or i>=m or j<0 or j>=n:\n return\n if matrix[i][j]>matrix[i_start][j_start]:\n graph[(i_start,j_start)].append((i,j))\n return\n def dfs(self,source,graph,seq_length_from):\n if source in seq_length_from:\n return seq_length_from[source]\n length=1\n for target in graph[source]:\n length=max(length,1+self.dfs(target,graph,seq_length_from))\n seq_length_from[source]=length\n return length\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n graph=collections.defaultdict(lambda:[])\n m=len(matrix)\n n=len(matrix[0])\n for i in range(m):\n for j in range(n):\n self.update(graph,matrix,i+1,j,i,j)\n self.update(graph,matrix,i-1,j,i,j)\n self.update(graph,matrix,i,j+1,i,j)\n self.update(graph,matrix,i,j-1,i,j)\n ans=1\n seq_length_from={}\n for source in [(i,j) for i in range(m) for j in range(n)]:\n ans=max(ans, self.dfs(source, graph, seq_length_from))\n return ans","runtime":"420"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\n result = 0\n cache = {}\n\n def dfs(row: int, col: int, count: int, maxSoFar: int) -> int:\n nonlocal result\n if (row < 0 or row == len(matrix)) or (col < 0 or col == len(matrix[row])) or (matrix[row][col] <= maxSoFar):\n result = max(result, count)\n return 0\n maxSoFar = max(maxSoFar, matrix[row][col])\n if (row, col) in cache:\n result = max(result, count+cache[(row, col)])\n return cache[(row, col)]\n maxPath = 0\n one = dfs(row-1, col, count+1, maxSoFar)\n two = dfs(row+1, col, count+1, maxSoFar)\n three = dfs(row, col-1, count+1, maxSoFar)\n four = dfs(row, col+1, count+1, maxSoFar)\n maxPath = 1+max(maxPath, one, two, three, four)\n cache[(row, col)] = maxPath\n result = max(result, count+maxPath)\n return maxPath\n\n for row in range(len(matrix)):\n for col in range(len(matrix[row])):\n dfs(row, col, 0, -1)\n\n return result","runtime":"420"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n adj_list = ((0,1),(0,-1),(1,0),(-1,0))\n R, C = len(matrix), len(matrix[0])\n cache = {}\n\n def in_range(r, c):\n return 0 <= r < R and 0 <= c < C\n\n def traverse(r, c, prev):\n if not in_range(r, c): return 0\n \n this = matrix[r][c]\n if this <= prev: return 0\n\n key = (r, c)\n if key in cache: return cache[key]\n\n length_here = 1\n matrix[r][c] = -1\n for ra, ca in adj_list:\n length_here = max(length_here, traverse(r+ra,c+ca,this)+1)\n\n matrix[r][c] = this\n cache[key] =length_here \n return cache[key]\n\n longest = 0\n for r in range(R):\n for c in range(C):\n longest = max(longest, traverse(r,c,-1))\n\n return longest","runtime":"424"},{"code":"from math import inf\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n dp = [[0 for _ in range(n)] for _ in range(m)]\n\n mi, mj = 0, 0\n memo = set()\n for i in range(m):\n for j in range(n):\n dx = [0, 0, -1, 1]\n dy = [-1, 1, 0, 0]\n ok = True\n for k in range(4):\n ci = i + dx[k]\n cj = j + dy[k]\n if -1 < ci < m and -1 < cj < n:\n if matrix[ci][cj] <= matrix[i][j]:\n ok = False\n if ok:\n mi, mj = i, j\n memo.add((i, j))\n dp[i][j] = 1\n\n def solve(i, j):\n if (i, j) in memo:\n return dp[i][j]\n dx = [-1, 1, 0, 0]\n dy = [0, 0, -1, 1]\n ans = 1\n for k in range(4):\n ci = i + dx[k]\n cj = j + dy[k]\n if -1 < ci < m and -1 < cj < n and matrix[ci][cj] < matrix[i][j]:\n ans = max(ans, solve(ci, cj) + 1)\n dp[i][j] = ans\n memo.add((i, j))\n return dp[i][j]\n for i in range(m):\n for j in range(n):\n solve(i, j)\n longest = 0\n for i in range(m):\n for j in range(n):\n longest = max(longest, dp[i][j])\n return longest\n\n \n ","runtime":"424"},{"code":"# class Solution:\n# def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n# directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n# m, n = len(matrix), len(matrix[0])\n# adj = {}\n# indegree = {}\n# q = deque()\n# max_path = 0\n\n# for row, col in product(range(m), range(n)):\n# adj[(row, col)] = []\n# indegree[(row, col)] = 0\n# for delta_row, delta_col in directions:\n# i, j = row + delta_row, col + delta_col\n# if matrix[row][col] < matrix[i][j]:\n# adj[(row, col)].append((i, j))\n# indegree[(i, j)] += 1\n\n# for (i, j), val in indegree.items():\n# if val == 0:\n# q.append((i, j, 1))\n\n# while q:\n# i, j, path = q.popleft()\n# max_path = max(max_path, path)\n# for row, col in adj[(i, j)]:\n\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n m, n = len(matrix), len(matrix[0])\n adj = {}\n self.max_path = 0\n\n for row, col in product(range(m), range(n)):\n adj[(row, col)] = []\n for delta_row, delta_col in directions:\n i, j = row + delta_row, col + delta_col\n if not (0 <= i < m and 0 <= j < n):\n continue\n if matrix[row][col] < matrix[i][j]:\n adj[(row, col)].append((i, j))\n \n def dfs(row, col, paths):\n if paths[row][col] is not None:\n return paths[row][col]\n nei = adj[(row, col)]\n if nei:\n paths[row][col] = max(dfs(i, j, paths) for i, j in nei) + 1\n else:\n paths[row][col] = 1\n self.max_path = max(self.max_path, paths[row][col])\n return paths[row][col]\n\n paths = [[None] * n for _ in range(m)]\n for i, j in product(range(m), range(n)):\n dfs(i, j, paths)\n\n return self.max_path","runtime":"428"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n seen = {}\n \n @cache\n def dfs(i, j, count):\n if (i, j) in seen:\n return count + seen[(i, j)]\n ans = 0\n for dx, dy in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\n x = i + dx\n y = j + dy\n\n if x in range(m) and y in range(n) and matrix[x][y] > matrix[i][j]:\n ans = max(ans, dfs(x, y, count + 1))\n if ans:\n seen[(i, j)] = ans - count\n return ans\n else:\n seen[(i, j)] = 1\n return 1 + count\n \n result = 0\n for i in range(m):\n for j in range(n):\n if (i, j) not in seen:\n result = max(result, dfs(i, j, 0))\n \n return result\n\n ","runtime":"428"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n #i,j holds the longest increasing path in any direction\n # we can check if the one before us is smaller, if so then we do something with it\n # we check to our left and upwards\n dp = {}\n ROWS, COLS = len(matrix), len(matrix[0])\n # if its left and up then its smaller, otherwise its bigger\n directions = [(-1,0), (1,0), (0, -1), (0,1)]\n def dfs(i,j):\n if (i,j) in dp:\n return dp[(i,j)]\n max_val = 1\n for direction in directions:\n hor, vert = direction\n new_row, new_col = i + vert, j + hor\n if new_row not in range(0, ROWS) or new_col not in range(0, COLS):\n continue\n if matrix[new_row][new_col] > matrix[i][j]:\n max_val = max(1 + dfs(new_row, new_col), max_val)\n \n dp[(i,j)] = max_val\n return dp[(i,j)]\n \n max_so_far = 0\n for i in range(ROWS):\n for j in range(COLS):\n max_so_far = max(max_so_far, dfs(i,j))\n \n return max_so_far\n ","runtime":"431"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n for i in range(rows):\n for j in range(cols):\n dfs(i, j)\n \n return max(dp.values())\n\n\n ","runtime":"431"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n if i in range(rows) and j in range(cols) and matrix[i][j] > prev:\n return True\n return False\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n max_path = 0\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j))\n \n return max_path\n\n\n ","runtime":"435"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n rows, cols = len(matrix), len(matrix[0])\n dp = defaultdict(int)\n res = 0\n\n def dfs(i, j, prev):\n \n if i not in range(rows) or j not in range(cols) or prev >= matrix[i][j]:\n return 0\n \n if (i, j) in dp:\n return dp[(i, j)]\n \n dp[(i, j)] = 1 + max(dfs(i + 1, j, matrix[i][j]), dfs(i , j + 1, matrix[i][j]), \n dfs(i - 1, j, matrix[i][j]), dfs(i, j - 1, matrix[i][j]))\n\n return dp[(i, j)]\n \n for i in range(rows):\n for j in range(cols):\n res = max(res, dfs(i, j, float(\"-inf\")))\n \n return res","runtime":"435"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0]) \n dp = {} # (row, col) = longest increasing path \n\n # need current coordinates and previous value \n def dfs(r, c, prevVal):\n if (r not in range(rows) or c not in range(cols) or matrix[r][c] <= prevVal):\n return 0 \n \n if (r, c) in dp:\n return dp[(r, c)] \n res = 1\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n\n dp[(r, c)] = res\n\n return res\n \n # prev val should be -1 since by default first call should not hit base case\n ans = -1\n for r in range(rows):\n for c in range(cols):\n res = dfs(r, c, -1) \n if res > ans:\n ans = res\n\n\n return ans\n\n\n\n\n ","runtime":"439"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n memo = {}\n\n\n def dfs(r, c, prev):\n if r not in range(m) or c not in range(n) or matrix[r][c] <= prev:\n return 0\n\n if (r, c) in memo:\n return memo[(r, c)]\n \n res = 0\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n memo[(r, c)] = res\n return memo[(r, c)]\n\n for r in range(m):\n for c in range(n):\n dfs(r, c, -1)\n \n return max(memo.values())","runtime":"439"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n if i in range(rows) and j in range(cols) and matrix[i][j] > prev:\n return True\n return False\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n max_path = 0\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j))\n \n return max_path\n\n\n ","runtime":"443"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n max_path = 0\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j))\n \n return max_path\n\n\n ","runtime":"443"},{"code":"from functools import lru_cache\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0]) # Get the number of rows and columns in the matrix\n memory = {} # Initialize a memoization dictionary\n @lru_cache\n def dfs(r, c, prevVal):\n # Base cases: Check if out of bounds or current cell value is not increasing\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prevVal:\n return 0\n # Memoization check: If result for current cell already computed, return it\n if (r, c) in memory:\n return memory[(r, c)]\n\n ans = 1 # Initialize the answer to 1 (minimum length of increasing path)\n # Explore all four directions from the current cell\n ans = max(ans, 1 + dfs(r + 1, c, matrix[r][c])) # Down\n ans = max(ans, 1 + dfs(r - 1, c, matrix[r][c])) # Up\n ans = max(ans, 1 + dfs(r, c + 1, matrix[r][c])) # Right\n ans = max(ans, 1 + dfs(r, c - 1, matrix[r][c])) # Left\n memory[(r, c)] = ans # Memoize the result for the current cell\n return ans # Return the length of the longest increasing path starting from the current cell\n\n # Iterate through each cell in the matrix and call the DFS function\n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1) # Start DFS from each cell with initial previous value -1\n return max(memory.values()) # Return the maximum value stored in the memoization dictionary","runtime":"446"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = [[-1] * COLS for _ in range(ROWS)]\n\n def dfs(r, c, prev):\n if (r not in range(len(matrix))\n or c not in range(len(matrix[0]))\n or matrix[r][c] <= prev):\n return 0\n if dp[r][c] != -1:\n return dp[r][c]\n\n longest = 1\n directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]\n for dr, dc in directions:\n longest = max(longest, 1 + dfs(r + dr, c + dc, matrix[r][c]))\n\n dp[r][c] = longest\n return longest\n\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n dfs(r, c, -1)\n\n return max(max(length) for length in dp)","runtime":"446"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n '''\n Longest increasing using Graph this is kind of topological sort problem \n '''\n\n rows , cols = len(matrix) , len(matrix[0])\n dp = {}\n\n #constructing the depth first search \n def dfs(r , c, prevValue):\n \n if ((r not in range(rows))\n or (c not in range(cols))\n or (matrix[r][c]<= prevValue)):\n\n return 0\n\n if (r,c) in dp:\n return dp[(r,c)]\n\n res = 1 \n res = max(res , 1+ dfs(r+1,c,matrix[r][c])) \n res = max(res , 1+ dfs(r-1,c,matrix[r][c]))\n res = max(res , 1+ dfs(r,c+1,matrix[r][c])) \n res = max(res , 1+ dfs(r,c-1,matrix[r][c]))\n\n dp[(r,c)] = res\n return res\n\n\n for r in range(rows):\n for c in range(cols):\n dfs(r,c,-1)\n\n return max(dp.values())","runtime":"450"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n memo = {}\n m, n = len(matrix), len(matrix[0])\n \n def dfs(r, c, prev):\n if r not in range(m) or c not in range(n) or matrix[r][c] <= prev:\n return 0\n \n if (r, c) in memo:\n return memo[(r, c)]\n \n res = 0\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n \n memo[(r, c)] = res\n return memo[(r, c)]\n \n \n for r in range(m):\n for c in range(n):\n dfs(r, c, -1)\n \n return max(memo.values())","runtime":"450"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # Build a graph: smaller -> larger\n # An in-degree array -> To find the start point\n m, n = len(matrix), len(matrix[0])\n if m * n == 1:\n return 1\n\n graph = defaultdict(list)\n indegree = defaultdict(int)\n for i in range(m):\n for j in range(n):\n if j + 1 < n:\n if matrix[i][j] < matrix[i][j+1]:\n graph[(i, j)].append((i, j+1))\n indegree[(i,j+1)] +=1\n elif matrix[i][j] > matrix[i][j+1]:\n graph[(i, j+1)].append((i, j))\n indegree[(i,j)] +=1\n if i + 1 < m:\n if matrix[i][j] < matrix[i+1][j]:\n graph[(i, j)].append((i+1, j))\n indegree[(i+1,j)] +=1\n elif matrix[i][j] > matrix[i+1][j]:\n graph[(i+1, j)].append((i, j))\n indegree[(i,j)] +=1\n \n # Use DFS to find the longest path\n memo = {}\n def dfs(i, j):\n if (i, j) not in graph:\n return 1\n \n if (i, j) not in memo:\n memo[(i, j)] = 1 + max([dfs(ni, nj) for ni, nj in graph[(i, j)]])\n return memo[(i, j)]\n \n return max([dfs(i, j) for i, j in graph if indegree[(i,j)] == 0])\n ","runtime":"454"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n dp = {} # (x, y): max depth\n r = len(matrix)\n c = len(matrix[0])\n\n def dfs(x, y, prevVal):\n # out of bounds or currval is not bigger than prev val\n if x not in range(r) or y not in range(c) or matrix[x][y] <= prevVal:\n return 0\n if (x, y) in dp:\n return dp[(x, y)]\n \n depth = 1\n for dx, dy in directions:\n xNew = x + dx\n yNew = y + dy\n depth = max(depth, 1 + dfs(xNew, yNew, matrix[x][y]))\n \n dp[(x, y)] = depth\n return dp[(x, y)]\n \n maxDepth = 0\n for i in range(r):\n for j in range(c):\n if (i, j) in dp:\n maxDepth = max(maxDepth, dp[(i, j)])\n else:\n maxDepth = max(maxDepth, dfs(i, j, -1))\n \n return maxDepth","runtime":"454"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n rows = len(matrix)\n cols = len(matrix[0])\n \n dp = {}\n \n \n \n \n def dfs(r,c,prev):\n \n if(r not in range(rows)or\n c not in range(cols) or\n matrix[r][c] <= prev \n ):\n return 0\n if (r,c) in dp:\n return dp[(r,c)]\n res=1 \n dirs = [[0,1],(0,-1),(1,0),(-1,0)]\n for dr, dc in dirs:\n res = max(res, 1+ dfs(r+dr,c+dc,matrix[r][c]))\n dp[(r,c)]=res\n return res\n \n \n for r in range(rows):\n for c in range(cols):\n dfs(r,c,-1)\n return max(dp.values())\n\n\n \n \n \n \n ","runtime":"458"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n Visited = []\n dp = {}\n def dfs(i,j):\n if (i,j) in dp:\n return dp[(i,j)]\n directions = [[-1,0],[1,0], [0,1], [0,-1]]\n L = []\n max_path = 1\n for di, dj in directions:\n new_I = i+ di\n new_J = j+ dj\n if (new_I in range(len(matrix))) and (new_J in range(len(matrix[0]))) and matrix[i][j]<matrix[new_I][new_J]:\n max_path = max(max_path,1+dfs(new_I, new_J))\n dp[(i,j)] =max_path\n return dp[(i,j)]\n\n maxC = 1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n maxC = max(maxC, dfs(i,j))\n return maxC\n \n \n \n \n \n ","runtime":"458"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n def dp(i, j):\n if (i, j) in memo:\n return memo[(i, j)]\n memo[(i, j)] = 1\n directions = [[-1, 0], [1, 0], [0, 1], [0, -1]]\n for (dr, dc) in directions:\n row, col = i + dr, j + dc\n if row in range(ROWS) and col in range(COLS) and matrix[i][j] < matrix[row][col]:\n memo[(i, j)] = max(memo[(i, j)], 1 + dp(row, col))\n return memo[(i, j)]\n\n memo = {}\n max_path_length = 1\n for i in range(ROWS):\n for j in range(COLS):\n max_path_length = max(max_path_length, dp(i, j))\n return max_path_length","runtime":"461"},{"code":"class Node:\n def __init__(self, val=None, pos = None):\n self.val = val\n self.pos = pos\n self.neighbors = []\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n node_mapper = []\n m = len(matrix)\n n = len(matrix[0])\n for i in range(m):\n row = []\n for j in range(n):\n val = matrix[i][j]\n new_node = Node(val , (i, j))\n row.append([new_node, None])\n\n for k, l in ((i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)):\n if 0 <= k and k < m and 0 <= l and l < n and matrix[k][l] > val:\n new_node.neighbors.append((k, l))\n node_mapper.append(row)\n\n def traverse(i, j):\n maybe_calculated_length = node_mapper[i][j][1]\n if maybe_calculated_length is not None:\n return maybe_calculated_length\n \n max_length = 0\n for k, l in node_mapper[i][j][0].neighbors:\n max_length = max(max_length, traverse(k, l))\n node_mapper[i][j][1] = max_length + 1\n return max_length + 1\n\n output = 0\n for a in range(m):\n for b in range(n):\n output = max(output, traverse(a, b))\n return output","runtime":"461"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\n result = 0\n cache = {}\n\n def dfs(row: int, col: int, count: int, maxSoFar: int) -> int:\n nonlocal result\n if (row < 0 or row == len(matrix)) or (col < 0 or col == len(matrix[row])) or (matrix[row][col] <= maxSoFar):\n result = max(result, count)\n return 0\n maxSoFar = max(maxSoFar, matrix[row][col])\n if (row, col) in cache:\n result = max(result, count+cache[(row, col)])\n return cache[(row, col)]\n maxPath = 1\n maxPath = max(maxPath, 1+dfs(row-1, col, count+1, maxSoFar))\n maxPath = max(maxPath, 1+dfs(row+1, col, count+1, maxSoFar))\n maxPath = max(maxPath, 1+dfs(row, col-1, count+1, maxSoFar))\n maxPath = max(maxPath, 1+dfs(row, col+1, count+1, maxSoFar))\n cache[(row, col)] = maxPath\n result = max(result, count+maxPath)\n return maxPath\n\n for row in range(len(matrix)):\n for col in range(len(matrix[row])):\n dfs(row, col, 0, -1)\n\n return result","runtime":"465"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n longest = [[1 for _ in range(n)] for _ in range(m)]\n def getLongestPath(i, j):\n if longest[i][j] != 1:\n return longest[i][j]\n for k, l in [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)]:\n if k in range(m) and l in range(n) and matrix[k][l] > matrix[i][j]:\n length = getLongestPath(k, l)\n longest[i][j] = max(longest[i][j], length + 1)\n return longest[i][j]\n longestPath = 0\n for i in range(m):\n for j in range(n):\n longestPath = max(longestPath, getLongestPath(i, j))\n return longestPath\n","runtime":"465"},{"code":"class Solution:\n def longestIncreasingPath(self, arr: List[List[int]]) -> int:\n direction, out, dp = [[0, 1], [0, -1], [1, 0], [-1, 0]], 0, {}\n def isvalid(i: int, j: int) -> bool:\n return 0 <= i < len(arr) and 0 <= j < len(arr[0])\n\n def dfs(i, j, visited = set(), prev = -1):\n if not isvalid(i, j) or (i, j) in visited or arr[i][j] <= prev:\n return 0\n if (i, j) in dp:return dp[(i, j)]\n \n out = 0\n visited.add((i, j))\n\n for x, y in direction:\n out = max(out, 1 + dfs(x + i, y + j, visited, arr[i][j]))\n \n visited.remove((i, j))\n dp[(i, j)] = out\n return out\n\n for i in range(len(arr)):\n for j in range(len(arr[0])):\n out = max(out, dfs(i, j))\n\n return out","runtime":"469"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n dp = {} # (x, y): max depth\n r = len(matrix)\n c = len(matrix[0])\n\n def dfs(x, y, prevVal):\n # out of bounds or currval is not bigger than prev val\n if x not in range(r) or y not in range(c) or matrix[x][y] <= prevVal:\n return 0\n if (x, y) in dp:\n return dp[(x, y)]\n \n depth = 1\n for dx, dy in directions:\n xNew = x + dx\n yNew = y + dy\n depth = max(depth, 1 + dfs(xNew, yNew, matrix[x][y]))\n \n dp[(x, y)] = depth\n return dp[(x, y)]\n \n maxDepth = 0\n for i in range(r):\n for j in range(c):\n if (i, j) in dp:\n maxDepth = max(maxDepth, dp[(i, j)])\n else:\n maxDepth = max(maxDepth, dfs(i, j, -1))\n \n return maxDepth","runtime":"469"},{"code":"from typing import List\nfrom functools import cache\n\n\n\nclass Solution:\n def __init__(self):\n self.directions = ((0, 1), (0, -1), (1, 0), (-1, 0))\n\n def valid(self, row: int, col: int) -> bool:\n return 0 <= row < len(self.matrix) and 0 <= col < len(self.matrix[0])\n\n @cache\n def find_path(self, row: int, col: int) -> int:\n possible_paths: List = []\n for delta_row, delta_col in self.directions:\n next_row, next_col = row + delta_row, col + delta_col\n if self.valid(row=next_row, col=next_col) and self.matrix[next_row][next_col] < self.matrix[row][col]:\n possible_paths.append((next_row, next_col))\n if not possible_paths:\n return 1\n else:\n return max([self.find_path(row=each[0], col=each[1]) for each in possible_paths]) + 1\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n self.matrix: List[List[int]] = matrix\n longest_path: None | int = None\n for row in range(len(matrix)):\n for col in range(len(matrix[0])):\n path_length: int = self.find_path(row=row, col=col)\n longest_path = path_length if longest_path is None else max(longest_path, path_length)\n return longest_path\n","runtime":"473"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n @functools.lru_cache(None)\n def dfs(i: int, j: int, prev: int) -> int:\n if i < 0 or i == m or j < 0 or j == n:\n return 0\n if matrix[i][j] <= prev:\n return 0\n\n curr = matrix[i][j]\n return 1 + max(dfs(i + 1, j, curr),\n dfs(i - 1, j, curr),\n dfs(i, j + 1, curr),\n dfs(i, j - 1, curr))\n\n return max(dfs(i, j, -math.inf) for i in range(m) for j in range(n))","runtime":"473"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROW, COL = len(matrix), len(matrix[0])\n dp = {}\n def dfs(r, c, prev):\n if r not in range(ROW) or c not in range(COL) or matrix[r][c] <= prev:\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n \n res = 1\n direction = [[1,0], [-1,0], [0,-1], [0,1]]\n for dr, dc in direction:\n res = max(res, 1 + dfs(r+dr, c+dc, matrix[r][c]))\n dp[(r, c)] = res\n return res\n\n\n\n for r in range(ROW):\n for c in range(COL):\n dfs(r, c , -1)\n return max(dp.values())","runtime":"476"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = {}\n R = len(matrix)\n C = len(matrix[0])\n\n dirs = [[-1, 0], [1, 0], [0, 1], [0, -1]]\n\n ans = 1\n\n dp = {}\n\n def dfs(r, c, prev_val):\n nonlocal ans\n if r not in range(R) or c not in range(C) or matrix[r][c] <= prev_val:\n return 0\n\n if (r,c) in dp:\n return dp[(r, c)]\n\n res = 1\n for dr in dirs:\n new_r = r+dr[0]\n new_c = c+dr[1]\n res = max(res, 1 + dfs(new_r, new_c, matrix[r][c]))\n \n ans = max(ans, res)\n dp[(r,c)] = res\n return res\n \n for r in range(R):\n for c in range(C):\n dfs(r, c, -1)\n \n return ans\n\n\n\n \n\n ","runtime":"476"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n cache = {}\n res = [0]\n def dfs(i, j):\n if i not in range(m) or j not in range(n):\n return 0\n if (i, j) in cache:\n return cache[(i,j)]\n\n directions = [(i+1, j), (i-1, j), (i, j+1), (i, j-1)]\n longest = 1\n for p,q in directions:\n if p not in range(m) or q not in range(n) or matrix[p][q] <= matrix[i][j]:\n continue\n longest = max(longest, 1+dfs(p, q))\n res[0] = max(res[0], longest)\n cache[(i, j)] = longest\n return longest\n for i in range(m):\n for j in range(n):\n dfs(i, j)\n return res[0]","runtime":"480"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n @functools.lru_cache(None)\n def dfs(i: int, j: int, prev: int) -> int:\n if i < 0 or i == m or j < 0 or j == n:\n return 0\n if matrix[i][j] <= prev:\n return 0\n\n curr = matrix[i][j]\n return 1 + max(dfs(i + 1, j, curr),\n dfs(i - 1, j, curr),\n dfs(i, j + 1, curr),\n dfs(i, j - 1, curr))\n\n return max(dfs(i, j, -math.inf) for i in range(m) for j in range(n))","runtime":"480"},{"code":"from functools import lru_cache\n\nclass Solution:\n def longestIncreasingPath(self, matrix):\n if not matrix or not matrix[0]:\n return 0\n m, n = len(matrix), len(matrix[0])\n\n @lru_cache(None)\n def dfs(i, j, pre):\n if not (0 <= i < m and 0 <= j < n) or matrix[i][j] <= pre:\n return 0\n val = matrix[i][j]\n return 1 + max(\n dfs(i - 1, j, val),\n dfs(i + 1, j, val),\n dfs(i, j - 1, val),\n dfs(i, j + 1, val)\n )\n \n return max(dfs(x, y, -1) for x in range(m) for y in range(n))\n\n# Example usage:\n# sol = Solution()\n# print(sol.longestIncreasingPath([[9,9,4],[6,6,8],[2,1,1]])) # Output: 4\n# print(sol.longestIncreasingPath([[3,4,5],[3,2,6],[2,2,1]])) # Output: 4","runtime":"484"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n Visited = []\n dp = {}\n def dfs(i,j):\n if (i,j) in dp:\n return dp[(i,j)]\n directions = [[-1,0],[1,0], [0,1], [0,-1]]\n L = []\n Visited.append((i,j))\n for di, dj in directions:\n new_I = i+ di\n new_J = j+ dj\n if (new_I in range(len(matrix))) and (new_J in range(len(matrix[0]))) and matrix[i][j]<matrix[new_I][new_J] and (new_I, new_J) not in Visited:\n L.append(1+dfs(new_I, new_J))\n Visited.pop(-1)\n dp[(i,j)] = max(L) if L else 1 \n return dp[(i,j)]\n\n maxC = 1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n maxC = max(maxC, dfs(i,j))\n return maxC\n \n \n \n \n \n ","runtime":"484"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dirs = [(0,1), (0,-1), (1,0), (-1,0)]\n def inBounds(x,y):\n return 0 <= x < ROWS and 0 <= y < COLS\n\n ROWS, COLS = len(matrix), len(matrix[0])\n outDegrees = {}\n for x in range(ROWS):\n for y in range(COLS):\n for dx, dy in dirs:\n if (x,y) not in outDegrees: outDegrees[(x,y)] = 0\n if inBounds(x+dx, y+dy) and matrix[x+dx][y+dy] > matrix[x][y]:\n outDegrees[(x,y)] += 1\n \n q = deque([k for k, v in outDegrees.items() if v == 0])\n print(q)\n print(outDegrees)\n res = 0\n\n while q:\n res += 1\n for _ in range(len(q)):\n x,y = q.popleft()\n for dx, dy in dirs:\n if inBounds(x+dx, y+dy) and matrix[x][y] > matrix[x+dx][y+dy]:\n outDegrees[(x+dx, y+dy)] -= 1\n if outDegrees[(x+dx,y+dy)] == 0:\n q.append((x+dx, y+dy))\n\n return res\n","runtime":"487"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n Visited = []\n dp = {}\n def dfs(i,j):\n if (i,j) in dp:\n return dp[(i,j)]\n directions = [[-1,0],[1,0], [0,1], [0,-1]]\n L = []\n Visited.append((i,j))\n for di, dj in directions:\n new_I = i+ di\n new_J = j+ dj\n \n if (new_I in range(len(matrix))) and (new_J in range(len(matrix[0]))) and matrix[i][j]<matrix[new_I][new_J] and (new_I, new_J) not in Visited:\n L.append(1+dfs(new_I, new_J))\n Visited.pop(-1)\n dp[(i,j)] = max(L) if L else 1 \n return dp[(i,j)]\n\n maxC = 1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n maxC = max(maxC, dfs(i,j))\n return maxC\n \n \n \n \n \n ","runtime":"487"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n @functools.lru_cache(None)\n def dfs(i: int, j: int, prev: int) -> int:\n if i < 0 or i == m or j < 0 or j == n:\n return 0\n if matrix[i][j] <= prev:\n return 0\n\n curr = matrix[i][j]\n return 1 + max(dfs(i + 1, j, curr),\n dfs(i - 1, j, curr),\n dfs(i, j + 1, curr),\n dfs(i, j - 1, curr))\n\n return max(dfs(i, j, -math.inf) for i in range(m) for j in range(n))","runtime":"495"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n @cache\n def dp(i, j, prev):\n if not (0 <= i < m and 0 <= j < n) or matrix[i][j] <= prev:\n return 0\n ans = 1\n ans = max(ans, dp(i + 1, j, matrix[i][j]) + 1, dp(i - 1, j, matrix[i][j]) + 1, dp(i, j + 1, matrix[i][j]) + 1, dp(i, j - 1, matrix[i][j]) + 1)\n return ans\n\n m, n = len(matrix), len(matrix[0])\n ans = 0\n for r in range(m):\n for c in range(n):\n ans = max(ans, dp(r, c, -1))\n return ans\n\n","runtime":"495"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = [[0 for j in range(len(matrix[0]))] for i in range(len(matrix))]\n\n def dfs(i,j): \n print(i,j, matrix[i][j])\n if (dp[i][j] != 0):\n return dp[i][j]\n cur = 0\n if i > 0 and matrix[i-1][j] > matrix[i][j] : \n cur = max(cur, dfs(i-1,j))\n if j > 0 and matrix[i][j-1] > matrix[i][j] : \n cur = max(cur, dfs(i,j-1))\n if i < len(matrix) - 1 and matrix[i+1][j] > matrix[i][j] : \n cur = max(cur, dfs(i+1,j))\n if j < len(matrix[0]) - 1 and matrix[i][j+1] > matrix[i][j] : \n cur = max(cur, dfs(i,j+1))\n dp[i][j] = cur + 1\n return dp[i][j] \n ret = 0\n \n for i in range(len(matrix)): \n for j in range(len(matrix[0])): \n ret = max(ret, dfs(i,j)) \n return ret\n\n","runtime":"499"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n seen = set()\n ROWS, COLS = len(matrix), len(matrix[0])\n self.maxLen = 0\n cache = {}\n\n def dfs(row, col, currLen, prev):\n if (row, col) in cache:\n return cache[(row, col)]\n \n currMaxLen = 1\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n for dr, dc in directions:\n r = row + dr\n c = col + dc\n if r in range(ROWS) and c in range(COLS) and matrix[r][c] < matrix[row][col]:\n seen.add((r, c))\n currMaxLen = max(currMaxLen, 1 + dfs(r, c, 1, matrix[r][c]))\n seen.remove((r, c))\n\n cache[(row, col)] = currMaxLen\n return cache[(row, col)]\n \n for r in range(ROWS):\n for c in range(COLS):\n self.maxLen = max(self.maxLen, dfs(r, c, 1, float(\"inf\")))\n \n return self.maxLen","runtime":"499"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n row, col = len(matrix), len(matrix[0])\n @functools.lru_cache(None)\n def dfs(r: int, c: int, prev: int):\n if r==row or r<0 or c==col or c<0:\n return 0\n if matrix[r][c]<=prev:\n return 0\n curr = matrix[r][c]\n return 1 + max(dfs(r+1,c,curr),\n dfs(r-1,c,curr),\n dfs(r,c+1,curr),\n dfs(r,c-1,curr))\n\n return max(dfs(r, c, -math.inf) for r in range(row) for c in range(col))\n\n ","runtime":"502"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n ROWS, COLS = len(matrix), len(matrix[0])\n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]\n def gen_newrc(r, c):\n return [[r + move_row, c + move_col] for move_row, move_col in directions]\n def check(new_row, new_col):\n return 0 <= new_row < ROWS and 0 <= new_col < COLS and matrix[new_row][new_col] > matrix[r][c]\n \n indegree = [[0] * COLS for _ in range(ROWS)]\n\n for r, c in itertools.product(range(ROWS), range(COLS)):\n for new_row, new_col in gen_newrc(r, c):\n if check(new_row, new_col):\n indegree[new_row][new_col] += 1\n\n start_nodes = []\n for r, c in itertools.product(range(ROWS), range(COLS)):\n if indegree[r][c] == 0:\n start_nodes.append((r, c))\n\n max_path = 0\n while start_nodes:\n max_path += 1\n next_level = []\n for r, c in start_nodes:\n for new_row, new_col in gen_newrc(r, c):\n if check(new_row, new_col):\n indegree[new_row][new_col] -= 1\n if indegree[new_row][new_col] == 0:\n next_level.append((new_row, new_col))\n start_nodes = next_level\n\n return max_path","runtime":"502"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dirs = [(-1,0),(1,0),(0,1),(0,-1)]\n dp = {}\n def dfs(x,y):\n ans = 1 \n for dx, dy in dirs:\n xx, yy = x+dx, y+dy \n if xx in range(m) and yy in range(n) and matrix[xx][yy]>matrix[x][y]:\n if (xx,yy) in dp:\n ans = max(ans, 1+dp[(xx,yy)])\n else:\n ans = max(ans, 1+dfs(xx,yy))\n dp[(x,y)] = ans \n return ans \n \n ans = 0 \n for i in range(m):\n for j in range(n):\n ans = max(ans, dfs(i,j))\n return ans ","runtime":"506"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n res = 0\n @cache\n def dfs(prev,r,c):\n if (not 0 <= r < len(matrix)) or (not 0 <= c < len(matrix[0]) or matrix[r][c] <= prev):\n return 0\n else:\n return max(dfs(matrix[r][c], r+1,c), dfs(matrix[r][c], r-1,c),dfs(matrix[r][c], r,c+1),dfs(matrix[r][c], r,c-1)) + 1\n \n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n res = max(res,dfs(-1,r,c)) \n return res\n \n\n ","runtime":"506"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n 1. build adjacency graph\n 2. follow path from 0 incoming nodes\n \"\"\"\n\n graph = collections.defaultdict(list)\n indegree = collections.defaultdict(int)\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n num = matrix[i][j]\n for di, dj in [(0,1), (0,-1), (1,0), (-1,0)]:\n if i + di < 0 or i + di >= len(matrix) or j + dj < 0 or j + dj >= len(matrix[0]):\n continue\n if matrix[i+di][j+dj] > num:\n graph[(i, j)].append((i+di, j+dj))\n indegree[(i+di, j+dj)] += 1\n\n seen = {}\n def depth(i, j):\n if (i, j) in seen:\n return seen[(i, j)]\n res = 1\n for child in graph[(i, j)]:\n res = max(res, depth(child[0], child[1]) + 1)\n \n seen[(i, j)] = res \n return res\n\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n res = max(res, depth(i, j))\n\n return res\n","runtime":"510"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n n = len(matrix)\n m = len(matrix[0])\n\n memo = {}\n\n def traverse(i,j,p):\n\n if i < 0 or i >= n or j < 0 or j >= m or matrix[i][j] <= p:\n\n return 0\n\n if (i,j,p) in memo:\n\n return memo[(i,j,p)]\n\n memo[(i,j,p)] = 1 + max(traverse(i+1,j,matrix[i][j]),\n traverse(i,j+1,matrix[i][j]),\n traverse(i,j-1,matrix[i][j]),\n traverse(i-1,j,matrix[i][j]))\n\n return memo[(i,j,p)]\n \n max_length = 0\n for i in range(n):\n for j in range(m):\n\n max_length = max(max_length,traverse(i,j,-1))\n\n \n return max_length\n\n\n\n\n","runtime":"510"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n res = 0\n @cache\n def dfs(prev,r,c):\n if (not 0 <= r < len(matrix)) or (not 0 <= c < len(matrix[0]) or matrix[r][c] <= prev):\n return 0\n else:\n return max(dfs(matrix[r][c], r+1,c), dfs(matrix[r][c], r-1,c),dfs(matrix[r][c], r,c+1),dfs(matrix[r][c], r,c-1)) + 1\n \n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n res = max(res,dfs(-1,r,c)) \n return res\n \n\n ","runtime":"514"},{"code":"# Given an m x n integers matrix\n# - rectangle\n\n# 1 <= m, n <= 200\n# small number of rows and cols\n# 0 <= matrix[i][j] <= 2**31 - 1\n# values in each of these rows can be extremely large\n\n# return the length of the longest increasing path in matrix.\n# - strictly increasing\n# - consistent increasing sequence of numbers where i > i -1\n# - 1 2 3 or 1 4 7\n# - once we take a number, the next number we can take after it must be strictly greater\n# - keep track using a threshold to represent the number the following number needs to be greater than\n# - \n\n# until each cell, you can either move --> left, right up down\n\n# no diagonals, no move outside boundary (no combos and must stay in bounds)\n\n# Using a matrix[][] of size m x n find the length of the ongest increasing path\n\n\n# Input: matrix = [[9,9,4],[6,6,8],[2,1,1]]\n\n# Decision: find the length of the longest increasing path in the matrix [[9,9,4],[6,6,8],[2,1,1]]\n# threshold start at -1 as matrix values can be 0 <= matrix[i][j] <= 2**31 - 1\n\n# Starting with ith node what are my actions?\n# if node > threshold, Take the ith node --> length + 1, threshold == ith node, dfs --> up, down, left, or right if possible\n# else, Skip the ith node --> length = length, threshold is same, return the length for that node\n\n# avenues: [dfs(matrix[row-1][col]), dfs(matrix[row+1][col]), dfs(matrix[row][col+1], dfs(matrix[row][col-1])]\n# take ith node --> threhold = ith node, length+1 actions: for x in avenues: take x, skip x\n# skip the ith node --> return length, end route\n\n\n\nclass Solution:\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n @lru_cache(None)\n def longest_path_until_row_col(row, col, threshold):\n #skip, return\n if row >= len(matrix) or col >= len(matrix[0]) or row < 0 or col < 0 or matrix[row][col] <= threshold:\n return 0\n #take\n threshold = matrix[row][col]\n down = longest_path_until_row_col(row + 1, col, threshold)\n right = longest_path_until_row_col(row, col + 1, threshold)\n left = longest_path_until_row_col(row, col - 1, threshold)\n up = longest_path_until_row_col(row - 1, col, threshold)\n return 1 + max(left, right, up, down)\n max_length = 0\n for row in range(len(matrix)):\n for col in range(len(matrix[0])):\n length = 0\n threshold = -1\n found_len = longest_path_until_row_col(row, col, threshold)\n max_length = max(max_length, found_len)\n return max_length\n\n \n ","runtime":"514"}],"string":"[\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n if not matrix or not matrix[0]:\\n return 0\\n rows, cols = len(matrix), len(matrix[0])\\n\\n dp = [[0] * cols for _ in range(rows)]\\n\\n def dfs(i, j):\\n\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0)\\n return dp[i][j]\\n \\n for i in range(rows):\\n for j in range(cols):\\n dfs(i, j)\\n\\n return max(max(x) for x in dp)\\n \\n\\n \\n\\n\",\n \"runtime\": \"218\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n rows, cols = len(matrix), len(matrix[0])\\n dp =[[0] * cols for i in range(rows)]\\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0)\\n return dp[i][j]\\n \\n for r in range(rows):\\n for c in range(cols):\\n dfs(r,c)\\n return max(max(x) for x in dp)\",\n \"runtime\": \"218\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < M - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < N - 1 and val > matrix[i][j + 1] else 0)\\n return dp[i][j]\\n\\n if not matrix or not matrix[0]: return 0\\n M, N = len(matrix), len(matrix[0])\\n dp = [[0] * N for i in range(M)]\\n return max(dfs(x, y) for x in range(M) for y in range(N)) \",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n # dp[i][j] = Length of longest increasing path starting at (i, j)\\n dp = [[0]*m for _ in range(n)]\\n\\n def dfs(i, j):\\n if dp[i][j] == 0: # (i, j) not visited yet\\n val = matrix[i][j]\\n dp[i][j] = 1\\n # Recurse on possible cardinal directions if \\n # doing so creates an increasing path and take the max\\n # of the directions\\n dp[i][j] += max(\\n dfs(i-1, j) if i > 0 and val < matrix[i-1][j] else 0,\\n dfs(i+1, j) if i < n-1 and val < matrix[i+1][j] else 0,\\n dfs(i, j-1) if j > 0 and val < matrix[i][j-1] else 0, \\n dfs(i, j+1) if j < m-1 and val < matrix[i][j+1] else 0\\n )\\n return dp[i][j]\\n \\n for i in range(n):\\n for j in range(m):\\n if dp[i][j] == 0: # (i, j) not visited yet\\n dfs(i, j)\\n return max(max(dp[r]) for r in range(n))\",\n \"runtime\": \"222\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n dp = [[0] * n for _ in range(m)]\\n \\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i > 0 and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < m - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j > 0 and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < n - 1 and val > matrix[i][j + 1] else 0\\n )\\n return dp[i][j]\\n \\n return max(dfs(i, j) for i in range(m) for j in range(n))\\n\\n# Example usage:\\nsolution = Solution()\\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\",\n \"runtime\": \"226\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]: return 0\\n rows, cols = len(matrix), len(matrix[0])\\n dp = [[0] * cols for i in range(rows)]\\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i-1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i+1, j) if i < rows - 1 and val > matrix[i+1][j] else 0,\\n dfs(i, j-1) if j and val > matrix[i][j-1] else 0,\\n dfs(i, j+1) if j < cols - 1 and val > matrix[i][j+1] else 0\\n )\\n return dp[i][j]\\n for r in range(rows):\\n for c in range(cols):\\n dfs(r,c)\\n return max(max(x) for x in dp)\",\n \"runtime\": \"226\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < M - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < N - 1 and val > matrix[i][j + 1] else 0)\\n return dp[i][j]\\n\\n \\n if not matrix or not matrix[0]:\\n return 0\\n \\n M, N = len(matrix), len(matrix[0])\\n dp = [[0] * N for i in range(M)]\\n return max(dfs(x, y) for x in range(M) for y in range(N))\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]: \\n return 0\\n\\n rows, cols = len(matrix), len(matrix[0])\\n dp = [[0] * cols for i in range(rows)]\\n def dfs(i, j): \\n if not dp[i][j]: \\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0\\n )\\n return dp[i][j]\\n\\n for r in range(rows): \\n for c in range(cols): \\n dfs(r, c)\\n\\n return max(max(x) for x in dp)\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n def dfs(i, j, dp, M, N):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j, dp, M, N) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j, dp, M, N) if i < M - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1, dp, M, N) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1, dp, M, N) if j < N - 1 and val > matrix[i][j + 1] else 0)\\n return dp[i][j]\\n\\n if not matrix or not matrix[0]: return 0\\n M, N = len(matrix), len(matrix[0])\\n dp = [[0] * N for i in range(M)]\\n return max(dfs(x, y, dp, M, N) for x in range(M) for y in range(N))\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n rows, cols = len(matrix), len(matrix[0])\\n dp =[[0] * cols for i in range(rows)]\\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < rows - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < cols - 1 and val > matrix[i][j + 1] else 0)\\n return dp[i][j]\\n \\n for r in range(rows):\\n for c in range(cols):\\n dfs(r,c)\\n return max(max(x) for x in dp)\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n rows = len(matrix)\\n cols = len(matrix[0])\\n\\n dp = [[0]*cols for _ in range(rows)]\\n res = 0\\n\\n def dfs(i, j):\\n if not dp[i][j]:\\n curr = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i+1, j) if i < rows-1 and curr > matrix[i+1][j] else 0,\\n dfs(i-1, j) if i > 0 and curr > matrix[i-1][j] else 0,\\n dfs(i, j+1) if j < cols-1 and curr > matrix[i][j+1] else 0,\\n dfs(i, j-1) if j > 0 and curr > matrix[i][j-1] else 0\\n )\\n return dp[i][j]\\n \\n for r in range(rows):\\n for c in range(cols):\\n res = max(res, dfs(r, c))\\n return res\",\n \"runtime\": \"237\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n h = len(matrix)\\n w = len(matrix[0])\\n memo = [[0]*w for _ in range(h)]\\n # source = [[None]*w for _ in range(h)]\\n # end = (0,0)\\n path = 0\\n\\n def dfs(i, j):\\n if memo[i][j] == 0:\\n add = 0\\n # direc = (0,0)\\n if(i+1 < h and matrix[i+1][j] > matrix[i][j]):\\n up = dfs(i+1, j)\\n if up > add:\\n add = up\\n # direc = (i+1,j)\\n if(i-1 >= 0 and matrix[i-1][j] > matrix[i][j]):\\n down = dfs(i-1, j)\\n if down > add:\\n add = down\\n # direc = (i-1,j)\\n if(j+1 < w and matrix[i][j+1] > matrix[i][j]):\\n right = dfs(i, j+1)\\n if right > add:\\n add = right\\n # direc = (i, j+1)\\n if(j-1 >= 0 and matrix[i][j-1] > matrix[i][j]):\\n left = dfs(i, j-1)\\n if left > add:\\n add = left\\n # direc = (i, j-1)\\n memo[i][j] = add + 1\\n # source[i][j] = direc\\n return memo[i][j]\\n\\n for i in range(h):\\n for j in range(w):\\n curr = dfs(i,j)\\n if curr > path:\\n path = curr\\n # end = (i,j)\\n\\n # route = []\\n # point = end\\n # while point:\\n # route.append(point)\\n # point = source[point[0]][point[1]]\\n # route.reversed()\\n # print(route)\\n \\n return path\",\n \"runtime\": \"237\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n def longestIncreasingPath(self, m: List[List[int]]) -> int:\\n rm = len(m)\\n cm = len(m[0])\\n mxc = [[0]*cm for _ in range(rm)]\\n rl = rm-1\\n cl = cm-1\\n def dfs(r,c):\\n if not mxc[r][c]:\\n v = m[r][c]\\n mxc[r][c] = 1 + max(\\n dfs(r+1,c) if r<rl and m[r+1][c]>v else 0,\\n dfs(r-1,c) if r>0 and m[r-1][c]>v else 0,\\n dfs(r,c+1) if c<cl and m[r][c+1]>v else 0,\\n dfs(r,c-1) if c>0 and m[r][c-1]>v else 0\\n )\\n return mxc[r][c]\\n mxx = 1\\n for r in range(rm):\\n for c in range(cm):\\n mxx = max(mxx,dfs(r,c))\\n return mxx\",\n \"runtime\": \"241\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n def longestIncreasingPath(self, m: List[List[int]]) -> int:\\n rm = len(m)\\n cm = len(m[0])\\n mxc = [[0]*cm for _ in range(rm)]\\n def dfs(r,c):\\n if not mxc[r][c]:\\n v = m[r][c]\\n mxc[r][c] = 1 + max(\\n dfs(r+1,c) if r+1<rm and m[r+1][c]>v else 0,\\n dfs(r-1,c) if r>0 and m[r-1][c]>v else 0,\\n dfs(r,c+1) if c+1<cm and m[r][c+1]>v else 0,\\n dfs(r,c-1) if c>0 and m[r][c-1]>v else 0\\n )\\n return mxc[r][c]\\n mxx = 1\\n for r in range(rm):\\n for c in range(cm):\\n mxx = max(mxx,dfs(r,c))\\n return mxx\",\n \"runtime\": \"241\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n return ans\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n\\n # up\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n # right\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n # down\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n # left\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n \\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n return ans\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n dp = [[0] * n for _ in range(m)]\\n \\n def dfs(i, j):\\n if not dp[i][j]:\\n val = matrix[i][j]\\n dp[i][j] = 1 + max(\\n dfs(i - 1, j) if i > 0 and val > matrix[i - 1][j] else 0,\\n dfs(i + 1, j) if i < m - 1 and val > matrix[i + 1][j] else 0,\\n dfs(i, j - 1) if j > 0 and val > matrix[i][j - 1] else 0,\\n dfs(i, j + 1) if j < n - 1 and val > matrix[i][j + 1] else 0\\n )\\n return dp[i][j]\\n \\n return max(dfs(x, y) for x in range(m) for y in range(n))\\n\\n# Example usage:\\nsolution = Solution()\\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"def dfs(matrix: list[list[int]], memo: list[list[int]], x: int, y: int) -> int:\\n if memo[x][y] is not None:\\n return memo[x][y]\\n\\n options = []\\n\\n if x + 1 < len(matrix) and matrix[x + 1][y] > matrix[x][y]:\\n options.append(dfs(matrix, memo, x + 1, y))\\n \\n if x - 1 >= 0 and matrix[x - 1][y] > matrix[x][y]:\\n options.append(dfs(matrix, memo, x - 1, y))\\n\\n if y + 1 < len(matrix[0]) and matrix[x][y + 1] > matrix[x][y]:\\n options.append(dfs(matrix, memo, x, y + 1))\\n\\n if y - 1 >= 0 and matrix[x][y - 1] > matrix[x][y]:\\n options.append(dfs(matrix, memo, x, y - 1))\\n\\n res = (max(options) if len(options) > 0 else 0) + 1\\n memo[x][y] = res\\n\\n return res\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n memo = [[None] * len(matrix[0]) for _ in range(len(matrix))]\\n\\n\\n max_ = 0\\n\\n for i, row in enumerate(matrix):\\n for j, start in enumerate(row):\\n max_ = max(max_, dfs(matrix, memo, i, j))\\n\\n return max_\\n # return max([max(l) for l in memo])\\n\",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n\\n # up\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n # right\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n # down\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n # left\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n \\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n return ans\",\n \"runtime\": \"252\"\n },\n {\n \"code\": \"class Solution:\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n\\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n\\n return ans\\n\",\n \"runtime\": \"252\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n = len(matrix)\\n m = len(matrix[0])\\n dp = [[0 for x in range(m)] for y in range(n)]\\n \\n def dfs(r, c):\\n res = 1\\n if dp[r][c] != 0:\\n return dp[r][c]\\n if r - 1 >= 0 and matrix[r - 1][c] > matrix[r][c]:\\n res = max(dfs(r - 1, c) + 1, res) \\n if r + 1 < n and matrix[r + 1][c] > matrix[r][c]:\\n res = max(dfs(r + 1, c) + 1, res)\\n if c - 1 >= 0 and matrix[r][c - 1] > matrix[r][c]:\\n res = max(dfs(r, c - 1) + 1, res)\\n if c + 1 < m and matrix[r][c + 1] > matrix[r][c]:\\n res = max(dfs(r, c + 1) + 1, res)\\n dp[r][c] = res\\n return res\\n return max(dfs(r,c) for r in range(n) for c in range(m)) \\n\",\n \"runtime\": \"256\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n n = len(matrix)\\n m = len(matrix[0])\\n # dp[i][j] means LIP at (i,j)\\n dp = [[0 for i in range(m)] for i in range(n)]\\n def dfs(i,j):\\n if dp[i][j]>0:\\n return dp[i][j]\\n \\n res = 1\\n if (i-1>=0) and matrix[i-1][j]>matrix[i][j]:\\n res = max(res,dfs(i-1,j)+1)\\n if (j-1>=0) and matrix[i][j-1]>matrix[i][j]:\\n res = max(res,dfs(i,j-1)+1)\\n if (i+1<n) and matrix[i+1][j]>matrix[i][j]:\\n res = max(res,dfs(i+1,j)+1)\\n if (j+1<m) and matrix[i][j+1]>matrix[i][j]:\\n res = max(res,dfs(i,j+1)+1)\\n dp[i][j] = res\\n return dp[i][j]\\n # def dfs(i,j):\\n # # memorization\\n # if dp[i][j]>0:\\n # return dp[i][j]\\n # res = 1\\n # if (i-1>=0) and matrix[i-1][j]<matrix[i][j]:\\n # res = max(dfs(i-1,j)+1,res)\\n # if (j-1>=0) and matrix[i][j-1]<matrix[i][j]:\\n # res = max(dfs(i,j-1)+1,res)\\n # if (i+1<n) and matrix[i+1][j]<matrix[i][j]:\\n # res = max(dfs(i+1,j)+1,res)\\n # if (j+1)<m and matrix[i][j+1]<matrix[i][j]:\\n # res = max(dfs(i,j+1)+1,res)\\n \\n # dp[i][j] = res\\n # return res\\n \\n res = 0\\n for i in range(n):\\n for j in range(m):\\n res = max(res,dfs(i,j))\\n \\n return res \",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n\\n # up\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n # right\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n # down\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n # left\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n return ans\",\n \"runtime\": \"259\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n\\n # up\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n # right\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n # down\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n # left\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n \\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n return ans\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n @lru_cache(maxsize=None)\\n def dp(i, j):\\n\\n if i < 0 or i >= len(matrix):\\n return 0\\n elif j < 0 or j >= len(matrix[0]):\\n return 0\\n\\n return 1 + max(\\n dp(i + 1, j) if i + 1 < len(matrix) and matrix[i][j] > matrix[i + 1][j] else 0,\\n dp(i - 1, j) if i > 0 and matrix[i][j] > matrix[i - 1][j] else 0,\\n dp(i, j + 1) if j + 1 < len(matrix[0]) and matrix[i][j] > matrix[i][j + 1] else 0,\\n dp(i, j - 1) if j > 0 and matrix[i][j] > matrix[i][j - 1] else 0\\n )\\n\\n return max([dp(i, j) for i in range(len(matrix)) for j in range(len(matrix[0]))])\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self,i,j,matrix,rows,cols,currLen,dp:list[List[int]])->int:\\n if not(0<=i<rows or 0<=j<cols):\\n return currLen\\n if dp[i][j]>0:\\n return dp[i][j]\\n maxLen=0\\n if i-1 >=0 and matrix[i][j] < matrix[i-1][j]:\\n upLen=self.dfs(i-1,j,matrix,rows,cols,currLen,dp)\\n maxLen=max(maxLen,upLen)\\n if i+1 < rows and matrix[i][j] < matrix[i+1][j]:\\n downLen=self.dfs(i+1,j,matrix,rows,cols,currLen,dp)\\n maxLen=max(maxLen,downLen)\\n if j-1 >=0 and matrix[i][j] < matrix[i][j-1]:\\n leftLen=self.dfs(i,j-1,matrix,rows,cols,currLen,dp)\\n maxLen=max(maxLen,leftLen)\\n if j+1 <cols and matrix[i][j] < matrix[i][j+1]:\\n rightLen=self.dfs(i,j+1,matrix,rows,cols,currLen,dp)\\n maxLen=max(maxLen,rightLen)\\n dp[i][j]=currLen+maxLen\\n return currLen+maxLen\\n \\n\\n\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not len(matrix) and not len(matrix[0]):\\n return 0\\n rows = len(matrix)\\n cols = len(matrix[0])\\n dp = [[0 for _ in range(cols)] for _ in range(rows)]\\n maxLen=0\\n for i in range(rows):\\n for j in range(cols):\\n currLen =self.dfs(i,j,matrix,rows,cols,1,dp)\\n maxLen=max(maxLen,currLen)\\n return maxLen\",\n \"runtime\": \"267\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n memo = [[0] * n for _ in range(m)]\\n def dfs(i, j):\\n if memo[i][j]: return memo[i][j]\\n val = matrix[i][j]\\n path = 0\\n for di, dj in [(0, -1), (0, 1), (-1, 0), (1, 0)]:\\n ni, nj = i + di, j + dj\\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > val:\\n path = max(path, dfs(ni, nj))\\n memo[i][j] = 1 + path\\n return memo[i][j]\\n res = 0\\n for i in range(m):\\n for j in range(n):\\n res = max(res, dfs(i, j))\\n # # Follow-up part: print the longest path\\n # longest_paths = []\\n # def find_longest_paths(i, j, max_length, cur_path, paths):\\n # cur_path.append(matrix[i][j])\\n # if len(cur_path) == max_length:\\n # paths.append(cur_path)\\n # return\\n # for di, dj in [(0, -1), (0, 1), (-1, 0), (1, 0)]:\\n # ni, nj = i + di, j + dj\\n # if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j] and memo[ni][nj] == memo[i][j] - 1:\\n # find_longest_paths(ni, nj, max_length, cur_path, paths)\\n # for i in range(m):\\n # for j in range(n):\\n # if memo[i][j] == res:\\n # find_longest_paths(i, j, res, [], longest_paths)\\n # print(f\\\"The longest increasing path is {longest_paths}\\\")\\n return res\",\n \"runtime\": \"267\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n dire = [[0,1], [1,0], [-1,0], [0,-1]]\\n memo = [[-1 for _ in range(n)] for _ in range(m)]\\n \\n def dfs(i, j):\\n if memo[i][j] != -1:\\n return memo[i][j]\\n \\n count = 1\\n for dx, dy in dire:\\n nr, nc = i + dx, j + dy\\n if 0 <= nr < m and 0 <= nc < n and matrix[nr][nc] > matrix[i][j]:\\n count = max(count, 1 + dfs(nr, nc))\\n \\n memo[i][j] = count\\n return count\\n \\n return max(dfs(i, j) for i in range(m) for j in range(n))\",\n \"runtime\": \"271\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, mat: List[List[int]]) -> int:\\n\\n m=len(mat)\\n n=len(mat[0])\\n dp=[[0]*(n+1) for _ in range(m+1)]\\n m1=[0]\\n def dfs(i,j,pr):\\n if i>=m or j>=n or i<0 or j<0 or mat[i][j]<=pr:\\n return 0\\n if dp[i][j]!=0:\\n return dp[i][j]\\n\\n r=1+max(dfs(i+1,j,mat[i][j]), dfs(i-1,j,mat[i][j]), dfs(i,j+1,mat[i][j]), dfs(i,j-1,mat[i][j]))\\n dp[i][j]=r\\n m1[0]=max(r,m1[0])\\n return dp[i][j]\\n\\n for i in range(m):\\n for j in range(n):\\n dfs(i,j,-1)\\n \\n return m1[0]\\n\\n \\n \\n \\n\\n \",\n \"runtime\": \"271\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n rows, cols = len(matrix), len(matrix[0])\\n memo = [[-1] * cols for _ in range(rows)]\\n \\n def dfs(i, j):\\n if memo[i][j] != -1:\\n return memo[i][j]\\n \\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\\n max_path = 1\\n \\n for dir_x, dir_y in directions:\\n x, y = i + dir_x, j + dir_y\\n if 0 <= x < rows and 0 <= y < cols and matrix[x][y] > matrix[i][j]:\\n max_path = max(max_path, 1 + dfs(x, y))\\n \\n memo[i][j] = max_path\\n return memo[i][j]\\n \\n return max(dfs(i, j) for i in range(rows) for j in range(cols))\",\n \"runtime\": \"274\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n memo = [[-1] * n for _ in range(m)] \\n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]\\n \\n def dfs(i, j):\\n if memo[i][j] != -1:\\n return memo[i][j] \\n \\n max_len = 1\\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\\n max_len = max(max_len, 1 + dfs(ni, nj))\\n \\n memo[i][j] = max_len \\n return max_len\\n \\n longest = 0\\n for i in range(m):\\n for j in range(n):\\n longest = max(longest, dfs(i, j)) \\n \\n return longest\\n\",\n \"runtime\": \"274\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # let dfs(i, j) return the longest increasing path from (i, j)\\n # maintain a memory dp[i][j] represents the longest increasing path from (i, j)\\n # DFS and do not dfs if it exists already in memory, O(n^2) Time O(n^2) space\\n n, m = len(matrix), len(matrix[0])\\n dp = [[0] * m for _ in range(n)]\\n def dfs(i, j):\\n if dp[i][j] != 0:\\n return dp[i][j]\\n \\n dirs = [(0, 1), (1, 0), (0, -1), (-1, 0)]\\n _max = 0\\n for d in dirs:\\n nr, nc = i + d[0], j + d[1]\\n if nr < 0 or nr >= n or nc < 0 or nc >= m:\\n continue\\n if matrix[nr][nc] <= matrix[i][j]:\\n continue\\n _max = max(dfs(nr, nc), _max)\\n\\n dp[i][j] = 1 + _max\\n return dp[i][j]\\n \\n output = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n output = max(dfs(i, j), output)\\n\\n return output\\n\\n \\n \",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n mem = [[-1] * m for _ in range(n)]\\n def dp(x: int, y: int) -> int:\\n nonlocal matrix, mem, n, m\\n if mem[x][y] != -1:\\n return mem[x][y]\\n max_neighbor = 0\\n for dx, dy in [(-1, 0), (0, -1), (1, 0), (0, 1)]:\\n nx, ny = x + dx, y + dy\\n if 0 <= nx < n and 0 <= ny < m and matrix[nx][ny] > matrix[x][y]:\\n max_neighbor = max(max_neighbor, dp(nx, ny))\\n ret = max_neighbor + 1\\n mem[x][y] = ret\\n return ret\\n ret = 0\\n for i in range(n):\\n for j in range(m):\\n ret = max(ret, dp(i, j))\\n return ret\",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n m, n = len(matrix), len(matrix[0])\\n dp = [[0] * n for _ in range(m)]\\n \\n def dfs(x, y):\\n if dp[x][y] != 0:\\n return dp[x][y]\\n \\n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]\\n max_length = 1\\n \\n for dx, dy in directions:\\n nx, ny = x + dx, y + dy\\n if 0 <= nx < m and 0 <= ny < n and matrix[nx][ny] > matrix[x][y]:\\n max_length = max(max_length, 1 + dfs(nx, ny))\\n \\n dp[x][y] = max_length\\n return max_length\\n \\n return max(dfs(x, y) for x in range(m) for y in range(n))\\n\\n\",\n \"runtime\": \"282\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n mem = [[-1 for _ in range(n)]for _ in range(m)]\\n choices = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n def rec(i, j):\\n \\n if mem[i][j] != -1:\\n return mem[i][j]\\n ans = 1\\n for choice in choices:\\n nxt_i, nxt_j = i + choice[0], j + choice[1]\\n if 0 <= nxt_i <m and 0 <= nxt_j < n and matrix[i][j] > matrix[nxt_i][nxt_j]:\\n ans = max(ans, 1+ rec(nxt_i, nxt_j))\\n \\n mem[i][j] = ans\\n return ans\\n \\n ans = 1\\n for i in range(m):\\n for j in range(n):\\n if mem[i][j] == -1:\\n rec(i, j)\\n ans = max(ans, mem[i][j])\\n return ans\\n \\n\\n \\n \\n\\n \",\n \"runtime\": \"282\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n directions = lambda x, y : [(x + 1, y), (x, y + 1), (x - 1, y), (x, y - 1)]\\n dp = [ [None] * n for _ in range(m) ]\\n \\n def dfs(r, c):\\n if dp[r][c]:\\n return dp[r][c]\\n dp[r][c] = 1\\n for nr, nc in directions(r, c):\\n if 0 <= nr < m and 0 <= nc < n and matrix[r][c] < matrix[nr][nc]:\\n dp[r][c] = max(dp[r][c], 1 + dfs(nr, nc))\\n return dp[r][c]\\n\\n return max(dfs(r, c) for r in range(m) for c in range(n))\",\n \"runtime\": \"286\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix):\\n if not matrix or not matrix[0]:\\n return 0\\n\\n m, n = len(matrix), len(matrix[0])\\n memo = [[0]*n for _ in range(m)]\\n\\n def dfs(i, j):\\n if memo[i][j]:\\n return memo[i][j]\\n max_length = 1\\n for dx, dy in [(-1,0),(1,0),(0,-1),(0,1)]:\\n x, y = i + dx, j + dy\\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]:\\n length = 1 + dfs(x, y)\\n max_length = max(max_length, length)\\n memo[i][j] = max_length\\n return max_length\\n\\n max_path = 0\\n for i in range(m):\\n for j in range(n):\\n max_path = max(max_path, dfs(i, j))\\n\\n return max_path\\n\",\n \"runtime\": \"286\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, grid: List[List[int]]) -> int:\\n m,n=len(grid),len(grid[0])\\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\\n \\n # using python cache lib for memoization\\n @lru_cache(maxsize=None)\\n def dfs(r,c):\\n ans=1 \\n\\t\\t\\t# iterating through all 4 directions\\n for x,y in directions: \\n # calculating the new cell\\n new_row,new_col=r+x, c+y\\n\\t\\t\\t\\t# check if new cell is within the grid bounds and is an increasing sequence\\n if 0<=new_row<m and 0<=new_col<n and grid[new_row][new_col]>grid[r][c]: \\n # finding the max length of valid path from the current cell\\n ans = max(ans, dfs(new_row, new_col) + 1 ) \\n return ans\\n \\n return max(dfs(r,c) for r in range(m) for c in range(n)) \",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n, me = len(matrix), len(matrix[0]), {}\\n @cache\\n def dp(u, v, m, n):\\n # if me.setdefault((u, v), 0) != 0:\\n # return me[(u, v)]\\n res = 1\\n for i, j in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\\n x, y = u+i, v+j\\n if x < 0 or x >= m or y < 0 or y >= n :\\n continue\\n if matrix[u][v] <= matrix[x][y]:\\n continue\\n res = max(res, dp(x, y, m, n)+1)\\n # me[(u, v)] = res\\n return res\\n return max([dp(i, j, m, n) for i in range(m) for j in range(n)])\",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"# class Solution:\\n# def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n# visited=[]\\n# for row in range(len(matrix)):\\n# row_list=[]\\n# for col in range(len(matrix[row])):\\n# row_list.append(0)\\n# visited.append(row_list)\\n \\n# def BFS(i,j,mat):\\n# stk=[[i,j]]\\n# visited[i][j]=1\\n# distance=[[-1 for j in range(len(mat[i]))] for i in range(len(mat))]\\n# distance[i][j]=1\\n# while (len(stk)>=1):\\n# square=stk[0]\\n# stk.pop(0)\\n# i = square[0]\\n# j = square[1]\\n# m = len(mat)\\n# n = len(mat[0])\\n# if (j+1<n and visited[i][j+1]==0 and mat[i][j+1]>mat[i][j]):\\n# visited[i][j+1]=1\\n# distance[i][j+1]=distance[i][j]+1\\n# stk.append([i,j+1])\\n# # print(\\\"(\\\",i,\\\",\\\",j+1,\\\")\\\",1)\\n# if (i-1>=0 and visited[i-1][j]==0 and mat[i-1][j]>mat[i][j]):\\n# visited[i-1][j]=1\\n# distance[i-1][j]=distance[i][j]+1\\n# stk.append([i-1,j])\\n# # print(\\\"(\\\",i-1,\\\",\\\",j,\\\")\\\",2)\\n# if (j-1>=0 and visited[i][j-1]==0 and mat[i][j-1]>mat[i][j]):\\n# visited[i][j-1]=1\\n# distance[i][j-1]=distance[i][j]+1\\n# stk.append([i,j-1])\\n# # print(\\\"(\\\",i,\\\",\\\",j-1,\\\")\\\",3)\\n# if (i+1<m and visited[i+1][j]==0 and mat[i+1][j]>mat[i][j]):\\n# visited[i+1][j]=1\\n# distance[i+1][j]=distance[i][j]+1\\n# stk.append([i+1,j])\\n# # print(\\\"(\\\",i+1,\\\",\\\",j,\\\")\\\",4)\\n\\n# curr_max=-1\\n# for row in distance:\\n# for col in row:\\n# curr_max=max(curr_max,col)\\n\\n# return curr_max\\n\\n# lip=1\\n# for i in range(len(matrix)):\\n# for j in range(len(matrix[i])):\\n# # if (visited[i][j]==0):\\n# visited=[]\\n# for row in range(len(matrix)):\\n# row_list=[]\\n# for col in range(len(matrix[row])):\\n# row_list.append(0)\\n# visited.append(row_list)\\n \\n# # print(f\\\"dfs{(i,j):}\\\")\\n# # DFS(i,j,matrix,curr_len)\\n# lip_candidate = BFS(i,j,matrix)\\n# lip = max(lip,lip_candidate)\\n \\n# return lip\\n \\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n memo = [[-1] * n for _ in range(m)] # Memoization table to store the longest path from each cell\\n \\n def dfs(i, j):\\n if memo[i][j] != -1:\\n return memo[i][j]\\n \\n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)] # Right, Down, Left, Up\\n max_path = 1 # Every cell is at least a path of length 1\\n \\n for direction in directions:\\n x, y = i + direction[0], j + direction[1]\\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]:\\n max_path = max(max_path, 1 + dfs(x, y))\\n \\n memo[i][j] = max_path\\n return memo[i][j]\\n \\n lip = 0 # Longest Increasing Path\\n for i in range(m):\\n for j in range(n):\\n lip = max(lip, dfs(i, j))\\n \\n return lip\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n sys.setrecursionlimit(1000000) # Increase recursion limit\\n\\n m, n = len(matrix), len(matrix[0])\\n dp = [[0] * n for _ in range(m)] # Memoization table\\n\\n def dfs(i, j):\\n if dp[i][j]:\\n return dp[i][j]\\n max_length = 1 # Minimum path length is 1 (the cell itself)\\n # Explore all four directions\\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n x, y = i + dx, j + dy\\n # Check boundaries and increasing condition\\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]:\\n length = 1 + dfs(x, y)\\n max_length = max(max_length, length)\\n dp[i][j] = max_length\\n return max_length\\n\\n max_path = 0\\n for i in range(m):\\n for j in range(n):\\n max_path = max(max_path, dfs(i, j))\\n return max_path\\n \",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n dp = [[0] * m for _ in range(n)]\\n\\n def dfs(r, c):\\n if dp[r][c] != 0:\\n return dp[r][c]\\n \\n dirs = [(0, 1), (1, 0), (0, -1), (-1, 0)]\\n _max = 0\\n for d in dirs:\\n nr, nc = r + d[0], c + d[1]\\n if nr < 0 or nr >= n or nc < 0 or nc >= m:\\n continue\\n\\n if matrix[nr][nc] > matrix[r][c]:\\n _max = max(_max, dfs(nr, nc))\\n \\n res = 1 + _max\\n if dp[r][c] == 0:\\n dp[r][c] = res\\n\\n return res\\n \\n for i, row in enumerate(matrix):\\n for j, _ in enumerate(row):\\n dfs(i, j)\\n \\n _max = 0\\n for i, row in enumerate(dp):\\n for _, v in enumerate(row):\\n _max = max(_max, v)\\n\\n # print(dp)\\n return _max\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n '''\\n 1) make cache\\n 2) make DFS method\\n marks when DFS called at another cell\\n 3) keep track of max as you update\\n '''\\n dp = [[0 for x in range(len(matrix[0]))] for y in range(len(matrix))]\\n\\n x_dir = [1,-1,0,0]\\n y_dir = [0,0,1,-1]\\n \\n def DFS(x,y):\\n if dp[x][y] != 0:\\n return dp[x][y]\\n else:\\n dp[x][y] = 1\\n for i in range(4):\\n new_x = x + x_dir[i]\\n new_y = y + y_dir[i]\\n if new_x >= 0 and len(matrix) > new_x and new_y >= 0 and len(matrix[0]) > new_y \\\\\\n and matrix[new_x][new_y] > matrix[x][y]:\\n if dp[new_x][new_y] != 0:\\n dp[x][y] = max(dp[x][y], dp[new_x][new_y] + 1)\\n else:\\n value = DFS(new_x, new_y) + 1\\n dp[x][y] = max(dp[x][y], value)\\n return dp[x][y]\\n\\n max_len = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if dp[i][j] == 0:\\n DFS(i,j)\\n max_len = max(max_len, dp[i][j])\\n return max_len\\n \\n\\n\\n\\n \\n\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n m, n = len(matrix), len(matrix[0])\\n res = 0\\n memo = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n path = self.dfs(matrix, memo, m, n, i, j)\\n res = max(res, path)\\n return res\\n\\n def dfs(self, matrix, memo, m, n, i, j):\\n if memo[i][j] != -1:\\n return memo[i][j]\\n dirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\\n res = 1\\n for dir in dirs:\\n x, y = i+dir[0], j+dir[1]\\n if x < 0 or x >= m or y < 0 or y >= n or matrix[x][y] <= matrix[i][j]:\\n continue\\n path = 1 + self.dfs(matrix, memo, m, n, x, y)\\n res = max(path, res)\\n memo[i][j] = res\\n return memo[i][j]\\n \",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ans = 0\\n dp = [[0 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\\n\\n def dfs(i, j):\\n nonlocal ans\\n if dp[i][j] != 0:\\n return dp[i][j]\\n longest = 1\\n for m, n in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\\n if 0 <= m < len(matrix) and 0 <= n < len(matrix[0]) and matrix[i][j] > matrix[m][n]:\\n longest = max(longest, dfs(m, n) + 1)\\n dp[i][j] = longest\\n ans = max(ans, dp[i][j])\\n return dp[i][j]\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dfs(i, j)\\n return ans\",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n res = 0\\n dirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\\n cached = [[0]*n for _ in range(m)]\\n\\n def dfs(x, y):\\n if cached[x][y] != 0:\\n return cached[x][y]\\n val = 0\\n for shift_x, shift_y in dirs:\\n row = x + shift_x\\n col = y + shift_y\\n if m-1 >= row >= 0 and n-1 >= col >= 0 and matrix[row][col] > matrix[x][y]:\\n val = max(val, dfs(row, col))\\n val += 1\\n cached[x][y] = val\\n return val\\n \\n for i in range(m):\\n for j in range(n):\\n val = dfs(i, j)\\n res = max(res, val)\\n \\n return res\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n M, N = len(matrix), len(matrix[0])\\n @lru_cache(None)\\n def dfs(x, y):\\n res = 0\\n for xx, yy in [(x+1, y), (x-1, y), (x, y+1), (x, y-1)]:\\n if 0<=xx<M and 0<=yy<N and matrix[xx][yy] > matrix[x][y]:\\n res = max(res, 1 + dfs(xx, yy))\\n return res\\n\\n\\n res = 0\\n for i in range(M):\\n for j in range(N):\\n res = max(res, 1 + dfs(i, j))\\n return res\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # M, N = len(matrix), len(matrix[0])\\n # @lru_cache(None)\\n # def length(i, j):\\n # # starting from i,j the longest increasing path\\n # res = 0\\n # for ii, jj in [(i+1, j), (i-1, j), (i, j+1), (i, j-1)]:\\n # if 0 <= ii < M and 0 <= jj < N and matrix[ii][jj] > matrix[i][j]:\\n # res = max(res, 1 + length(ii, jj))\\n # return res\\n\\n # ans = 0\\n # for i in range(M):\\n # for j in range(N):\\n # ans = max(ans, 1 + length(i,j))\\n # return ans\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n naive, start BFS from each initial cell - this is very expensive - O(n^4)\\n\\n better: for each initial grid point, store the length of the longest increasing path with\\n from that grid. this number doesn't change. we can use DFS and similarly find the longest\\n path for all other cells reachable from the initial grid point.\\n\\n we only visit a cell once, so will be O(n^2) complexity.\\n \\\"\\\"\\\"\\n # init\\n m, n = len(matrix), len(matrix[0])\\n longest_paths = []\\n for _ in range(m):\\n longest_paths.append([0] * n)\\n\\n # init DFS over matrix cells if not already visited\\n visited = set()\\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\\n\\n # inline helper method - check all 4 directions\\n def dfs(i, j):\\n res = [0] # no-op when computing max later\\n\\n for _di, _dj in directions:\\n _i = i+_di\\n _j = j+_dj\\n if _i >= 0 and _i < m and _j >= 0 and _j < n:\\n # next node must be greater than current node\\n if matrix[_i][_j] > matrix[i][j]:\\n if (_i, _j) in visited:\\n # reuse previously computed max length\\n res.append(longest_paths[_i][_j]) \\n else:\\n visited.add((_i, _j))\\n res.append(dfs(_i, _j))\\n\\n # get max_path and set in grid\\n max_path = max(res) + 1 # add 1 for current cell\\n longest_paths[i][j] = max_path\\n\\n return max_path\\n \\n max_path_len = 1\\n for i in range(m):\\n for j in range(n):\\n if (i, j) not in visited:\\n visited.add((i, j))\\n\\n path_len = dfs(i, j)\\n longest_paths[i][j] = path_len\\n\\n # update \\n max_path_len = max(max_path_len, path_len)\\n \\n return max_path_len\\n\\n# tests\\n# solution = Solution()\\n\\n# test_cases = [\\n# {'input': matrix, 'expected': 4},\\n# ...\\n# ]\\n\\n# for test_case in test_cases:\\n# assert(solution.solve(test_case['input']) == test_case['expected'])\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n dp = [[0] * n for _ in range(m)]\\n moves = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n\\n def valid(i, j):\\n return i >= 0 and j >= 0 and i < m and j < n\\n\\n def dfs(i, j):\\n if dp[i][j]:\\n return dp[i][j]\\n res = 1\\n for a, b in moves:\\n if valid(i + a, j + b) and matrix[i + a][j + b] > matrix[i][j]:\\n res = max(1 + dfs(i + a, j + b), res)\\n dp[i][j] = res\\n return res\\n \\n for i in range(m):\\n for j in range(n):\\n dfs(i, j)\\n \\n return max(max(row) for row in dp)\\n \\n\\n \\n\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n self.n = len(matrix)\\n self.m = len(matrix[0])\\n max_len = 0\\n cache = [[0 for _ in range(self.m)] for _ in range(self.n)]\\n for i in range(self.n):\\n for j in range(self.m):\\n max_len = max(self.dfs(i, j, matrix, cache), max_len)\\n return max_len\\n \\n def dfs(self, i:int, j:int, matrix: List[List[int]], cache:List[List[int]])-> int:\\n dir_list = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n \\n if (cache[i][j] != 0):\\n return cache[i][j]\\n \\n for d in dir_list:\\n x = i + d[0]\\n y = j + d[1]\\n if (0 <= x and x < self.n and 0 <= y and y < self.m and matrix[x][y] > matrix[i][j]):\\n cache[i][j] = max(self.dfs(x, y, matrix, cache), cache[i][j])\\n \\n cache[i][j] +=1\\n \\n return cache[i][j]\\n \",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n [\\n [9,9,4],\\n [6,6,8],\\n [2,1,1]\\n ]\\n \\n [\\n [1,1,2],\\n [2,2,1],\\n [3,4,2]\\n ]\\n \\\"\\\"\\\"\\n n = len(matrix)\\n m = len(matrix[0])\\n visited = [[0] * m for _ in range(n)]\\n \\n def findInceasingPath(r, c, prev):\\n nonlocal n\\n nonlocal m\\n \\n if r < 0 or r == n or c < 0 or c == m:\\n return 0\\n \\n if matrix[r][c] <= prev:\\n return 0\\n \\n if visited[r][c] > 0:\\n return visited[r][c]\\n \\n maxLen = 0\\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\\n \\n visited[r][c] = maxLen + 1\\n \\n return visited[r][c]\\n \\n \\n maxPathLen = 0\\n for r in range(n):\\n for c in range(m):\\n pathLen = findInceasingPath(r, c, -1)\\n maxPathLen = max(maxPathLen, pathLen)\\n \\n return maxPathLen\\n \\n \\n \",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class Solution:\\n\\n def helper(self,i,j,c,m,s):\\n\\n\\n\\n if(i >= 0 and i < len(m) and j >= 0 and j < len(m[0]) and m[i][j] > c ):\\n\\n if((i,j) in s):\\n\\n return s[(i,j)]\\n\\n s[(i,j)] = max(self.helper(i+1,j,m[i][j],m,s),\\n self.helper(i-1,j,m[i][j],m,s),\\n self.helper(i,j+1,m[i][j],m,s),\\n self.helper(i,j-1,m[i][j],m,s)) + 1 \\n \\n return s[(i,j)]\\n \\n else:\\n\\n return 0 \\n\\n \\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n s = {}\\n max_ = float('-inf')\\n for i in range(0,len(matrix)):\\n for j in range(0,len(matrix[0])):\\n max_ = max(max_,self.helper(i,j,-1,matrix,s))\\n \\n return max_ \\n \",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n, me = len(matrix), len(matrix[0]), {}\\n def dp(u, v, m, n):\\n if me.setdefault((u, v), 0) != 0:\\n return me[(u, v)]\\n res = 1\\n for i, j in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\\n x, y = u+i, v+j\\n if x < 0 or x >= m or y < 0 or y >= n :\\n continue\\n if matrix[u][v] <= matrix[x][y]:\\n continue\\n res = max(res, dp(x, y, m, n)+1)\\n me[(u, v)] = res\\n return res\\n return max([dp(i, j, m, n) for i in range(m) for j in range(n)])\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n DIRS = [[0, 1], [1, 0], [0, -1], [-1, 0]]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n\\n memo: Dict[Tuple[int, int], int] = {}\\n\\n def dfs(r: int, c: int) -> int:\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n total = 1\\n for dr, dc in self.DIRS:\\n nr = r + dr\\n nc = c + dc\\n\\n if nr < 0 or nc < 0 or nr >= rows or nc >= cols:\\n continue\\n \\n if matrix[r][c] < matrix[nr][nc]:\\n total = max(total, 1 + dfs(nr, nc))\\n\\n memo[(r, c)] = total\\n return total\\n \\n max_total = 0\\n for r in range(rows):\\n for c in range(cols):\\n max_total = max(max_total, dfs(r, c))\\n return max_total\\n\\n \\n\",\n \"runtime\": \"319\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n done={}\\n\\n def dfs(i,j,prev):\\n\\n if i<0 or i>=len(matrix) or j<0 or j>=len(matrix[0]):\\n return 0\\n \\n current=matrix[i][j]\\n if current<=prev:\\n return 0\\n \\n if (i,j) in done:\\n return done[(i,j)]\\n\\n path=1+max(dfs(i+1,j,current) , dfs(i-1,j,current) , dfs(i,j+1,current) , dfs(i,j-1,current))\\n \\n done[(i,j)]=path\\n return path\\n\\n\\n\\n\\n path=0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n path=max(path, dfs(i,j,-inf))\\n \\n return path\",\n \"runtime\": \"319\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n max_length = 0 \\n y_len = len(matrix)\\n x_len = len(matrix[0])\\n\\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\\n\\n cache = {}\\n\\n def dfs(y,x):\\n if (y,x) in cache:\\n return cache[(y,x)]\\n curr_len = 1\\n for dy, dx in directions:\\n new_y = y + dy\\n new_x = x + dx\\n if 0 <= new_y < y_len and 0 <= new_x < x_len and matrix[new_y][new_x] > matrix[y][x]:\\n curr_len = max(1 + dfs(new_y, new_x), curr_len)\\n cache[(y,x)] = curr_len\\n return curr_len\\n \\n for i in range(y_len):\\n for j in range(x_len):\\n max_length = max(dfs(i,j), max_length)\\n return max_length\\n \\n\\n\\n \",\n \"runtime\": \"323\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # Getting the number of rows and columns\\n ROWS, COLS = len(matrix), len(matrix[0])\\n\\n # Create a hashmap so we don't have to recalculate the same cell\\n hashmap = {}\\n\\n # Setting up DFS on matrix\\n def dfs(row: int, col: int) -> int:\\n # Base case: If we have already stored the result, return it\\n if (row, col) in hashmap:\\n return hashmap[(row, col)]\\n \\n # Create res to store the longest path we find for the current cell\\n res = 1\\n\\n # Getting ready to move down, up, right, and left\\n for dx, dy in [[1, 0], [-1, 0], [0, 1], [0, -1]]:\\n r, c = row + dx, col + dy\\n # Move to the next cell if its in bounds, and increasing\\n if (0 <= r < ROWS and 0 <= c < COLS and matrix[r][c] > matrix[row][col]):\\n length = 1 + dfs(r, c)\\n res = max(res, length)\\n \\n hashmap[(row, col)] = res\\n return res\\n \\n # Call the DFS function\\n res = 0\\n for r in range(ROWS):\\n for c in range(COLS):\\n if dfs(r, c) > res:\\n res = dfs(r, c)\\n \\n return res\",\n \"runtime\": \"323\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n, m = len(matrix), len(matrix[0])\\n dp = {}\\n\\n def dfs(i, j, prev):\\n if i < 0 or i >= n or j < 0 or j >= m or matrix[i][j] <= prev: return 0\\n if (i, j) in dp: return dp[(i, j)]\\n dp[(i, j)] = 1 + max(dfs(i+1, j, matrix[i][j]), dfs(i-1, j, matrix[i][j]), dfs(i, j+1, matrix[i][j]), dfs(i, j-1, matrix[i][j]))\\n return dp[(i, j)] \\n\\n \\n for i in range(n):\\n for j in range(m):\\n dfs(i, j, -1)\\n print(dp)\\n return max(dp.values())\",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m,n = len(matrix), len(matrix[0]) if matrix else 0\\n\\n memo = {}\\n visited = set()\\n maxi = 0\\n\\n def solve(i,j):\\n if (i,j) in memo:\\n return memo[(i,j)]\\n ans = 1\\n for di,dj in [(0,1),(0,-1),(1,0),(-1,0)]:\\n ni,nj = i+di, j+dj\\n if 0 <= ni < m and 0 <= nj < n and matrix[i][j] < matrix[ni][nj]:\\n ans = max(ans, 1 + solve(ni,nj))\\n \\n memo[(i,j)] = ans\\n return memo[(i,j)]\\n \\n for i in range(m):\\n for j in range(n):\\n maxi = max(maxi, solve(i,j))\\n \\n return maxi\\n\\n\\n \",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n pathMap = dict()\\n nrows = len(matrix)\\n ncols = len(matrix[0])\\n res = 1\\n def dfs(r, c, count, res):\\n curr = 1\\n for (x,y) in [(r+1,c), (r-1,c), (r,c+1), (r,c-1)]:\\n if 0 <= x < nrows and 0 <= y < ncols and matrix[r][c] < matrix[x][y]:\\n if (x,y) in pathMap:\\n curr = max(curr, 1+pathMap[(x,y)])\\n else:\\n pathMap[(x,y)], res = dfs(x,y, count+1, res)\\n curr = max(1+pathMap[(x,y)], curr)\\n res = max(res, curr)\\n return (curr, res)\\n\\n for row in range(nrows):\\n for col in range(ncols):\\n if (row,col) not in pathMap:\\n pathMap[(row,col)], res = dfs(row,col, 1, res)\\n\\n return res\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n h = len(matrix)\\n w = len(matrix[0])\\n\\n dp = [[-1 for _ in range(w)] for _ in range(h)] # Initialize with -1 to indicate unvisited\\n dc = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n\\n def dfs(i, j, pr = -1):\\n if i < 0 or i >= h or j < 0 or j >= w or matrix[i][j] <= pr:\\n return 0 # Invalid move, so return 0 as no path\\n\\n if dp[i][j] != -1:\\n return dp[i][j] # Return the cached value if it exists\\n\\n max_path = 1 # Start with length 1 (the current cell)\\n \\n for d in dc:\\n max_path = max(max_path, 1 + dfs(i + d[0], j + d[1], matrix[i][j]))\\n\\n dp[i][j] = max_path # Cache the result in dp table\\n return max_path\\n \\n res = 0\\n for i in range(h):\\n for j in range(w):\\n res = max(res, dfs(i, j))\\n \\n return res\\n\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"dirs = [(-1, 0), (1, 0), (0, -1), (0, 1)]\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n @cache\\n def dfs(i, j):\\n if i < 0 or i >= m or j < 0 or j >= n:\\n return 0\\n cand = [dfs(i+x, j+y) for x, y in dirs if 0 <= i+x < m and 0 <= j+y < n and matrix[i+x][j+y] > matrix[i][j]]\\n return 1 + max(cand) if cand else 1\\n self.res = float('-inf')\\n for i in range(m):\\n for j in range(n):\\n self.res = max(self.res, dfs(i, j))\\n return self.res\\n\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n dp = {}\\n def dfs(i, j):\\n if (i, j) in dp:\\n return dp[(i, j)]\\n a = 0\\n for dr, dc in [(0, 1), (1, 0), (-1, 0), (0, -1)]:\\n nr, nc = i+dr, j+dc\\n if 0 <= nr < m and 0 <= nc < n and matrix[nr][nc] > matrix[i][j]:\\n a = max(a, dfs(nr, nc))\\n \\n dp[(i, j)] = 1 + a\\n return dp[(i, j)]\\n \\n res = 0\\n for i in range(m):\\n for j in range(n):\\n res = max(res, dfs(i, j))\\n \\n return res\\n\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n @cache\\n def dfs(x, y):\\n count = 1\\n seen.add((x, y))\\n for xx, yy in ((-1, 0), (1, 0), (0, -1), (0, 1)):\\n nx, ny = x + xx, y + yy\\n if (nx, ny) not in seen and 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] < matrix[x][y]:\\n count = max(count, 1 + dfs(nx, ny))\\n seen.remove((x, y))\\n return count\\n seen = set()\\n count = 0\\n for a in range(len(matrix)):\\n for b in range(len(matrix[0])):\\n count = max(count, dfs(a, b))\\n return count\\n \",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = {} # (r, c) -> LIP\\n\\n def dfs(r, c, prevVal):\\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prevVal:\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n\\n res = 1\\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n dp[(r, c)] = res\\n return res\\n\\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1)\\n return max(dp.values())\\n\",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = {}\\n neighbors = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n\\n def dfs(r, c, prev):\\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prev:\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n\\n result = 1\\n for x, y in neighbors:\\n result = max(result, 1 + dfs(r + x, c + y, matrix[r][c]))\\n dp[(r, c)] = result\\n return result\\n \\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1)\\n return max(dp.values())\",\n \"runtime\": \"342\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n #creating 2d dp (or hash) to store LIP for each index\\n\\n #run dfs for each index if index not in dp, return the max value\\n R = len(matrix)\\n C = len(matrix[0])\\n\\n dp = {}\\n\\n #def dfs()\\n def dfs(r,c,prev):\\n #base: out of bounds and number is smaller or equal to prev number\\n if r >= R or c >= C or r < 0 or c < 0 or matrix[r][c] <= prev:\\n return 0\\n #if index in dp: return that\\n if (r,c) in dp:\\n return dp[(r,c)]\\n\\n #keep calling on 4 adj sides and store which one gave max path into dp\\n res = 1\\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n\\n dp[(r,c)] = res\\n return dp[(r,c)]\\n\\n #loop through and call on indexes\\n for r in range(R):\\n for c in range(C):\\n dfs(r,c,-1)\\n\\n #return max value\\n return max(dp.values())\",\n \"runtime\": \"342\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n m, n = len(matrix), len(matrix[0])\\n directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]\\n dp = [[0] * n for _ in range(m)]\\n\\n def dfs(r, c, prev):\\n if r < 0 or r >= m or c < 0 or c >= n or matrix[r][c] <= prev:\\n return 0\\n if dp[r][c] > 0:\\n return dp[r][c]\\n \\n dp[r][c] = 1\\n for x, y in directions:\\n nr, nc = r + x, c + y\\n dp[r][c] = max(dp[r][c], 1 + dfs(nr, nc, matrix[r][c]))\\n return dp[r][c]\\n res = -1\\n for i in range(m):\\n for j in range(n):\\n dp[i][j] = dfs(i, j, -1)\\n res = max(res, dp[i][j])\\n return res\",\n \"runtime\": \"345\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n directions = [[0,-1], [0,1], [1,0], [-1,0]]\\n def _dfs(r, c, memo):\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n m = 1\\n for rn, cn in directions:\\n if (\\n r + rn < len(matrix) and r + rn >= 0 and\\n c + cn < len(matrix[0]) and c + cn >= 0 and\\n matrix[r + rn][c + cn] > matrix[r][c]\\n ):\\n steps = 1 + _dfs(r + rn, c + cn, memo)\\n m = max(m, steps)\\n \\n memo[(r, c)] = m\\n return m\\n \\n if not matrix:\\n return 0\\n \\n res = 1\\n memo = {}\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n res = max(res, _dfs(r, c, memo))\\n \\n return res\\n \\n \\n \\n \",\n \"runtime\": \"345\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n dp = {} #(r, c) -> lip\\n \\n def dfs(r, c, prevVal):\\n if (r < 0 or r == ROWS) or (c < 0 or c == COLS) or matrix[r][c] <= prevVal:\\n return 0\\n \\n if (r, c) in dp:\\n return dp[(r, c)]\\n curr = matrix[r][c]\\n res = 1\\n res = max(res, 1 + dfs(r + 1, c, curr))\\n res = max(res, 1 + dfs(r - 1, c, curr))\\n res = max(res, 1 + dfs(r, c + 1, curr))\\n res = max(res, 1 + dfs(r, c - 1, curr))\\n\\n dp[(r, c)] = res\\n\\n return res\\n\\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1)\\n\\n return max(dp.values())\",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or len(matrix) == 0 or not matrix[0] or len(matrix[0]) == 0:\\n return -1\\n\\n row, col = len(matrix), len(matrix[0])\\n res = 0\\n visited = {}\\n for i in range(row):\\n for j in range(col):\\n res = max(res, self.dfs(matrix, i, j, -1, visited))\\n\\n return res\\n\\n def dfs(self, matrix, i, j, preV, visited):\\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]) or matrix[i][j] <= preV:\\n return 0\\n\\n if (i, j) in visited:\\n return visited[(i, j)]\\n\\n ans = 1\\n ans = max(ans, 1 + self.dfs(matrix, 1 + i, j, matrix[i][j], visited))\\n ans = max(ans, 1 + self.dfs(matrix, -1 + i, j, matrix[i][j], visited))\\n ans = max(ans, 1 + self.dfs(matrix, i, j + 1, matrix[i][j], visited))\\n ans = max(ans, 1 + self.dfs(matrix, i, j - 1, matrix[i][j], visited))\\n\\n visited[(i, j)] = ans\\n return ans\",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n adj = defaultdict(list)\\n ins = [0] * (m * n)\\n\\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\\n\\n for i in range(m):\\n for j in range(n):\\n value = matrix[i][j]\\n currIdx = i * n + j\\n\\n for d in dir:\\n x, y = i + d[0], j + d[1]\\n\\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\\n newIdx = x * n + y\\n\\n adj[currIdx].append(newIdx)\\n ins[newIdx] += 1\\n \\n q = deque()\\n for i in range(m*n):\\n if ins[i] == 0:\\n q.append((i, 1))\\n \\n ans = 0\\n\\n while q:\\n node, dst = q.popleft()\\n ans = max(ans, dst)\\n\\n for u in adj[node]:\\n ins[u] -= 1\\n\\n if ins[u] == 0:\\n q.append((u, dst + 1))\\n \\n return ans\\n\\n \\n def isValid(self, x, y, m, n):\\n return 0 <= x < m and 0 <= y < n\",\n \"runtime\": \"353\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]\\n dists, max_dist = dict(), 0\\n\\n def is_valid_position(i, j):\\n return 0 <= i < len(matrix) and 0 <= j < len(matrix[i])\\n\\n def dfs(i, j):\\n nonlocal max_dist\\n\\n max_dists = [1]\\n for d in directions:\\n new_i, new_j = i + d[0], j + d[1]\\n if is_valid_position(new_i, new_j) and matrix[new_i][new_j] > matrix[i][j]:\\n if (new_i, new_j) not in dists:\\n dir_max_dist = dfs(new_i, new_j)\\n else:\\n dir_max_dist = dists[(new_i, new_j)]\\n\\n max_dists.append(dir_max_dist + 1)\\n\\n dists[(i, j)] = max(max_dists)\\n max_dist = max(dists[(i, j)], max_dist)\\n return dists[(i, j)]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[i])):\\n if (i, j) in dists:\\n continue\\n\\n dfs(i, j)\\n\\n return max_dist\\n\",\n \"runtime\": \"353\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n M, N = len(matrix), len(matrix[0])\\n memo = {}\\n def move(i, j):\\n for x, y in [[0,1], [0,-1], [1,0], [-1,0]]:\\n ni = i + x\\n nj = j + y\\n if 0 <= ni < M and 0 <= nj < N:\\n yield ni, nj\\n \\n def dfs(i, j):\\n nonlocal memo\\n idx = i * N + j\\n if idx in memo:\\n return memo[idx]\\n \\n length = 1\\n for ni, nj in move(i, j):\\n if matrix[ni][nj] > matrix[i][j]:\\n length = max(length, dfs(ni, nj) + 1)\\n\\n memo[idx] = length\\n return length\\n \\n res = 1\\n for i in range(M):\\n for j in range(N):\\n res = max(res, dfs(i, j))\\n return res\\n \",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n def isvalid(row,col):\\n return 0<=row<len(matrix) and 0<=col<len(matrix[0])\\n directions = ((1,0),(0,1),(0,-1),(-1,0))\\n memo = {}\\n def dp(i,j):\\n if (i,j) in memo:\\n return memo[(i,j)]\\n maxi = 0\\n for dx,dy in directions:\\n next_row,next_col = i+dx,j+dy\\n if isvalid(next_row,next_col) and matrix[next_row][next_col]>matrix[i][j]:\\n maxi = max(maxi, dp(next_row,next_col))\\n memo[(i,j)] = 1+maxi\\n return memo[(i,j)]\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n res = max(res,dp(i,j))\\n return res\\n\\n\\n \\n \",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n M, N = len(matrix), len(matrix[0])\\n memo = {} \\n def move(i, j):\\n for x, y in [[0,1], [0,-1], [1,0], [-1,0]]:\\n ni = i + x\\n nj = j + y\\n if 0 <= ni < M and 0 <= nj < N:\\n yield ni, nj\\n \\n def dfs(i, j):\\n idx = i * N + j\\n if idx in memo:\\n return memo[idx][0]\\n \\n length = 1\\n next_cell = None\\n for ni, nj in move(i, j):\\n if matrix[ni][nj] > matrix[i][j]:\\n l = dfs(ni, nj)\\n if l + 1 > length:\\n length = l + 1\\n next_cell = (ni, nj)\\n\\n memo[idx] = (length, next_cell)\\n return memo[idx][0]\\n \\n res = 0\\n start_cell = None\\n for i in range(M):\\n for j in range(N):\\n l = dfs(i, j)\\n if l > res:\\n res = l\\n start_cell = (i, j)\\n\\n\\n path = []\\n i, j = start_cell\\n while True:\\n path.append((i, j))\\n _, next_cell = memo[i * N + j]\\n if not next_cell:\\n break\\n i, j = next_cell\\n # print(path)\\n return res\\n \",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n cache = {} \\n\\n def backtrack(r, c, prev):\\n if (\\n r < 0 or\\n c < 0 or\\n r == rows or\\n c == cols or\\n (r, c) in visit or\\n matrix[r][c] <= prev \\n ):\\n return 0\\n\\n if (r, c) in cache:\\n return cache[(r, c)]\\n\\n max_path = 1 + max(\\n backtrack(r + 1, c, matrix[r][c]),\\n backtrack(r - 1, c, matrix[r][c]),\\n backtrack(r, c + 1, matrix[r][c]),\\n backtrack(r, c - 1, matrix[r][c])\\n )\\n\\n cache[(r, c)] = max_path\\n return max_path\\n\\n res = 0\\n for r in range(rows):\\n for c in range(cols):\\n visit = set()\\n res = max(res, backtrack(r, c, float('-inf')))\\n\\n return res\\n\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n dp = {} #{(i, j) => maxLength}\\n\\n def helper(i, j, prev):\\n if i < 0 or i >= m or j < 0 or j >= n or matrix[i][j] <= prev:\\n return 0\\n if (i,j) in dp:\\n return dp[(i,j)]\\n \\n newPrev = matrix[i][j]\\n # matrix[i][j] = -1\\n maxL = 0\\n for d in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n newI = i + d[0]\\n newJ = j + d[1]\\n maxL = max(maxL, helper(newI, newJ, newPrev))\\n # matrix[i][j] = newPrev\\n\\n dp[(i,j)] = 1 + maxL\\n return dp[(i,j)]\\n \\n\\n res = 0\\n for i in range(m):\\n for j in range(n):\\n res = max(res, helper(i, j, -1))\\n \\n return res\\n\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n longestPaths = [[0] * COLS for _ in range(ROWS)]\\n\\n def getLongestPath(r, c, prev):\\n if min(r, c) < 0 or r == ROWS or c == COLS or matrix[r][c] <= prev:\\n return 0 \\n if longestPaths[r][c] != 0:\\n return longestPaths[r][c]\\n\\n curLongestPath = 0\\n for dr, dc in [(0, 1), (0, -1), (-1, 0), (1, 0)]:\\n curLongestPath = max(curLongestPath,\\n getLongestPath(r + dr, c + dc, matrix[r][c]))\\n longestPaths[r][c] = 1 + curLongestPath\\n return longestPaths[r][c]\\n \\n res = 1\\n for r in range(ROWS):\\n for c in range(COLS):\\n res = max(res, getLongestPath(r, c, -1))\\n return res\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"class Solution:\\n dictionary = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = [[-1 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n self.longestIncreasingPathHelper(matrix, dp, i, j)\\n res = max(res, dp[i][j])\\n return res\\n \\n \\n def longestIncreasingPathHelper(self, matrix: List[List[int]], dp: List[List[int]], r: int, c: int):\\n dp[r][c] = 1\\n for dir_x, dir_y in self.dictionary:\\n new_r, new_c = dir_x + r, dir_y + c\\n if (0 <= new_r < len(matrix) and 0 <= new_c < len(matrix[0])):\\n if matrix[new_r][new_c] > matrix[r][c]:\\n if dp[new_r][new_c] == -1:\\n self.longestIncreasingPathHelper(matrix, dp, new_r, new_c)\\n dp[r][c] = max(dp[r][c], 1 + dp[new_r][new_c])\",\n \"runtime\": \"368\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n cache = {}\\n\\n def dfs(r, c, prev):\\n if min(r, c) < 0 or r == ROWS or c == COLS or matrix[r][c] <= prev:\\n return 0\\n if (r, c) in cache:\\n return cache[(r, c)]\\n res = 1 + dfs(r + 1, c, matrix[r][c])\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n cache[(r, c)] = res\\n\\n return res\\n\\n res = 0\\n for r in range(ROWS):\\n for c in range(COLS):\\n res = max(res, dfs(r, c, -1))\\n\\n return res\",\n \"runtime\": \"368\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n memo = {}\\n def dfs(i, j):\\n if (i, j) in memo:\\n return memo[(i, j)]\\n memo[(i, j)] = 1\\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\\n for direction in directions:\\n new_x, new_y = i + direction[0], j + direction[1]\\n if new_x >= 0 and new_x < len(matrix) and new_y >= 0 and new_y < len(matrix[0]) and matrix[new_x][new_y] > matrix[i][j]:\\n memo[(i, j)] = max(memo[(i, j)], 1+ dfs(new_x, new_y))\\n return memo[(i, j)]\\n ans = 0\\n for i in range (len(matrix)):\\n for j in range (len(matrix[0])):\\n ans = max(ans, dfs(i, j))\\n return ans\\n \",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n # Initialize memoization dictionary\\n seen = {}\\n \\n # Dimensions of the matrix\\n m, n = len(matrix), len(matrix[0])\\n \\n def inBounds(i, j):\\n # Check if the indices are within the matrix bounds\\n return 0 <= i < m and 0 <= j < n\\n\\n def dfs(i, j):\\n # If already computed the result for this cell, return it\\n if (i, j) in seen:\\n return seen[(i, j)]\\n \\n # Define the possible directions (up, down, left, right)\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n max_path = 1 # The path length at least includes the current cell\\n \\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n if inBounds(ni, nj) and matrix[ni][nj] > matrix[i][j]:\\n max_path = max(max_path, 1 + dfs(ni, nj))\\n \\n # Memoize the result for the current cell\\n seen[(i, j)] = max_path\\n return max_path\\n \\n # Find the longest increasing path starting from each cell\\n longest_path = 0\\n for i in range(m):\\n for j in range(n):\\n longest_path = max(longest_path, dfs(i, j))\\n \\n return longest_path\\n\",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n longestPaths = {}\\n\\n def isValid(r,c):\\n return 0 <= r < m and 0 <= c < n\\n\\n def get_neighbors(r,c):\\n neighbors = []\\n directions = [(0,1),(1,0),(0,-1),(-1,0)]\\n for dx, dy in directions:\\n if isValid(r+dx, c+dy):\\n neighbors.append((r+dx, c+dy))\\n \\n return neighbors\\n\\n def backtracking(r, c):\\n curr_val = matrix[r][c]\\n max_neighbor_len = 0\\n\\n for n in get_neighbors(r,c):\\n if matrix[n[0]][n[1]] > curr_val:\\n if (n[0], n[1]) in longestPaths:\\n neighbor_len = longestPaths[(n[0], n[1])]\\n else:\\n neighbor_len = backtracking(n[0], n[1])\\n max_neighbor_len = max(max_neighbor_len, neighbor_len)\\n \\n longestPaths[(r,c)] = max_neighbor_len + 1\\n return max_neighbor_len + 1\\n \\n for i in range(m):\\n for j in range(n):\\n if (i,j) not in longestPaths:\\n backtracking(i, j)\\n \\n return max(longestPaths.values())\\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows = len(matrix)\\n cols = len(matrix[0])\\n directions = [(-1, 0), (1, 0), (0, 1), (0, -1)]\\n indegrees = [[0 for _ in range(cols)] for _ in range(rows)]\\n queue = deque()\\n\\n for i in range(rows):\\n for j in range(cols):\\n curr_val = matrix[i][j]\\n for direction in directions:\\n new_i, new_j = i + direction[0], j + direction[1]\\n if new_i < 0 or new_i >= rows or new_j < 0 or new_j >= cols:\\n continue \\n \\n if matrix[new_i][new_j] > curr_val:\\n indegrees[new_i][new_j] += 1 \\n \\n #print(indegrees)\\n \\n for i in range(rows):\\n for j in range(cols):\\n if indegrees[i][j] == 0:\\n queue.append((1, i, j))\\n \\n max_length = 1\\n while queue:\\n length, i, j = queue.popleft()\\n print(str(i) + \\\" \\\" + str(j))\\n max_length = max(max_length, length)\\n\\n for direction in directions:\\n new_i, new_j = direction[0] + i, direction[1] + j \\n if new_i < 0 or new_i >= rows or new_j < 0 or new_j >= cols:\\n continue \\n\\n if matrix[new_i][new_j] > matrix[i][j]:\\n indegrees[new_i][new_j] -= 1\\n if indegrees[new_i][new_j] == 0:\\n queue.append((length + 1, new_i, new_j)) \\n \\n return max_length\\n\\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n n, m = len(matrix), len(matrix[0])\\n memo = [[-1] * m for _ in range(n)] # 初始化记忆化数组\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)] # 四个方向：右、左、下、上\\n result = 0 # 存储全局最大值\\n\\n def dfs_iterative(i, j):\\n if memo[i][j] != -1:\\n return memo[i][j]\\n\\n stack = [(i, j)] # 栈存储坐标\\n path_lengths = {} # 用来存储每个坐标的路径长度\\n\\n while stack:\\n x, y = stack[-1]\\n if (x, y) not in path_lengths: # 初始化路径长度\\n path_lengths[(x, y)] = 1\\n\\n can_expand = False\\n for dx, dy in directions:\\n nx, ny = x + dx, y + dy\\n if 0 <= nx < n and 0 <= ny < m and matrix[nx][ny] > matrix[x][y]:\\n if memo[nx][ny] == -1: # 如果该邻居没有被计算过\\n stack.append((nx, ny)) # 继续往深处探索\\n can_expand = True\\n else:\\n # 更新当前路径的最大长度\\n path_lengths[(x, y)] = max(path_lengths[(x, y)], 1 + memo[nx][ny])\\n\\n if not can_expand: # 如果不能再扩展，更新 memo 和栈顶元素\\n x, y = stack.pop() # 当前节点完成探索，弹出栈\\n memo[x][y] = path_lengths[(x, y)] # 记录该点的最长路径\\n\\n return memo[i][j]\\n\\n # 遍历矩阵中的每个点，使用迭代版 DFS 计算最长递增路径\\n for i in range(n):\\n for j in range(m):\\n result = max(result, dfs_iterative(i, j))\\n \\n return result\",\n \"runtime\": \"387\"\n },\n {\n \"code\": \"# 2024/09/15\\n# 面试前刷Doordash高频题\\n#\\n# 这题有点意思，相当于longest increasing subset的二维变种\\n# 能否用DP，关键问题\\n# 应该没问题，首先不会有使用同一个元素的情况，因为是严格increasing\\n# 接下去问题是如何填表了，如果用Bottom up的话\\n# 感觉这题用top down更合适，不用考虑填表问题\\n# 那就DFS，这里问题是去重怎么弄？想起来应该是之前有讨论DFS怎么detect cycle，需要有一个visited表示当前这个path的parents，和传统的DFS的visited有点不一样\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n memo = {}\\n global_max = [0]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if (i, j) not in memo:\\n visited = set()\\n visited.add((i, j))\\n self.helper(i, j, visited, memo, matrix, global_max)\\n\\n return global_max[0]\\n\\n def helper(self, row, col, visited, memo, matrix, global_max):\\n if (row, col) in memo:\\n return memo[(row, col)]\\n\\n local_max = 1\\n for dx, dy in [1, 0], [-1, 0], [0, 1], [0, -1]:\\n x = row + dx\\n y = col + dy\\n if 0 <= x < len(matrix) and 0 <= y < len(matrix[0]):\\n if (x, y) in visited:\\n continue\\n \\n if matrix[x][y] < matrix[row][col]:\\n visited.add((x, y))\\n local_max = max(local_max, 1 + self.helper(x, y, visited, memo, matrix, global_max))\\n visited.remove((x, y))\\n\\n memo[(row, col)] = local_max\\n global_max[0] = max(global_max[0], local_max)\\n\\n return local_max\",\n \"runtime\": \"387\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = {}\\n def dfs(r, c, prev):\\n if min(r, c) < 0 or r >= len(matrix) or c >= len(matrix[0]) or matrix[r][c] <= prev:\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n res = 1\\n curr = matrix[r][c]\\n res = max(res, 1 + dfs(r + 1, c, curr))\\n res = max(res, 1 + dfs(r - 1, c, curr))\\n res = max(res, 1 + dfs(r, c + 1, curr))\\n res = max(res, 1 + dfs(r, c - 1, curr))\\n dp[(r, c)] = res\\n\\n return dp[(r, c)]\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n dfs(r, c, -1)\\n return max(dp.values())\",\n \"runtime\": \"390\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n _dir =[(-1,0),(1,0),(0,1),(0,-1)]\\n def isValid(i,j):\\n return i >=0 and j>=0 and i<len(matrix) and j<len(matrix[0])\\n def dfs(i,j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n _max=0\\n for dr,dc in _dir:\\n if isValid(i+dr,j+dc):\\n if matrix[i+dr][j+dc]> matrix[i][j]:\\n _max=max(_max,dfs(i+dr,j+dc))\\n dp[(i,j)]=1+_max\\n return dp[(i,j)]\\n dp={}\\n _max=0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n _max=max(_max,dfs(i,j))\\n\\n return _max\\n\\n\\n \\n\\n \",\n \"runtime\": \"390\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n cache = {}\\n ans = 0\\n def dfs(i,j, parent):\\n if i<0 or i>=len(matrix) or j<0 or j>=len(matrix[0]) or matrix[i][j]<=parent:\\n print('yes')\\n return 0\\n if (i,j) in cache:\\n return cache[(i,j)]\\n cur_parent = matrix[i][j]\\n longest_path = max(dfs(i+1, j, cur_parent), dfs(i-1, j, cur_parent), dfs(i, j+1, cur_parent), dfs(i, j-1, cur_parent))\\n cache[(i,j)] = longest_path + 1\\n return longest_path+1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n ans = max(ans, dfs(i,j, -float('inf')))\\n return ans\",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m=len(matrix)\\n n=len(matrix[0])\\n\\n memo=defaultdict(int)\\n self.sol=1\\n \\n def findLongest(i, j):\\n if (i, j) in memo:\\n return\\n for dir in [(1,0), (-1,0),(0,1),(0,-1)]:\\n i2=i+dir[0]\\n j2=j+dir[1]\\n\\n if 0<=i2<m and 0<=j2<n and matrix[i2][j2]>matrix[i][j]:\\n if (i2, j2) not in memo:\\n findLongest(i2, j2)\\n memo[(i, j)]=max(memo[(i2, j2)]+1, memo[(i, j)])\\n self.sol=max(memo[(i, j)], self.sol)\\n memo[(i, j)]=max(memo[(i, j)], 1)\\n\\n for i in range(m):\\n for j in range(n):\\n findLongest(i, j)\\n return self.sol\\n \",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n def cache(fn):\\n memo = {}\\n def wrapper(r : int, c : int) -> int:\\n if (r, c) in memo:\\n return memo[(r,c)]\\n res = fn(r, c)\\n memo[(r,c)] = res\\n return res\\n \\n return wrapper\\n\\n\\n def valid_rc(r, c) -> bool:\\n return r >= 0 and c >= 0 and r < len(matrix) and c < len(matrix[0])\\n\\n @cache\\n def max_path_length(r : int, c : int) -> int:\\n if not valid_rc(r, c):\\n return 0\\n \\n max_path = 1\\n for nr, nc in [(r+1, c), (r-1, c), (r, c+1), (r, c-1)]: \\n if valid_rc(nr, nc) and matrix[nr][nc] > matrix[r][c]:\\n max_path = max(1 +max_path_length(nr, nc), max_path)\\n\\n return max_path\\n\\n \\n longestPath = 0\\n\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n longestPath = max(max_path_length(r, c), longestPath)\\n\\n \\n return longestPath\",\n \"runtime\": \"398\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n memo = {}\\n directions = [[-1, 0], [1, 0], [0, 1], [0, -1]]\\n res = 0\\n\\n def dfs(i, j):\\n if (i, j) in memo:\\n return memo[(i, j)]\\n\\n path = 1\\n for d in directions:\\n # get the next coord in direction\\n r = i + d[0]\\n c = j + d[1]\\n # chk conditions\\n if (0<=r<len(matrix) and 0<=c<len(matrix[0]) and\\n matrix[r][c] != 'X' and matrix[r][c] > matrix[i][j]):\\n # add to visited\\n # recursive call to dfs while adding to curPath + path\\n oldVal = matrix[i][j]\\n matrix[i][j] = 'X'\\n path = max(path, dfs(r, c) + 1)\\n matrix[i][j] = oldVal\\n\\n memo[(i, j)] = path\\n return memo[(i, j)]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n res = max(res, dfs(i, j))\\n print(memo)\\n return res\",\n \"runtime\": \"398\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m,n = len(matrix), len(matrix[0])\\n\\n @cache\\n def near(start):\\n res = []\\n i,j = start\\n for pos in [(i+1,j), (i,j+1), (i-1, j), (i,j-1)]:\\n x,y = pos\\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]: \\n res.append(pos)\\n return res\\n\\n def dfs(start, depth):\\n i,j = start\\n if dp[i][j]:\\n return (depth-1) + dp[i][j]\\n res = depth\\n for node in near(start):\\n res = max(res, dfs(node, depth+1))\\n dp[i][j] = res - depth + 1\\n return res\\n \\n dp = [[None]*n for _ in range(m)]\\n res = 1\\n for i in range(m):\\n for j in range(n):\\n dfs((i,j), 1)\\n res = max(res, dp[i][j])\\n print(dp)\\n return res\\n\\n \\n\",\n \"runtime\": \"402\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dirs = [(-1,0),(1,0),(0,1),(0,-1)]\\n dp = {}\\n def dfs(x,y):\\n ans = 1 \\n if (x,y) in dp:\\n return dp[(x,y)]\\n for dx, dy in dirs:\\n xx, yy = x+dx, y+dy \\n if xx in range(m) and yy in range(n) and matrix[xx][yy]>matrix[x][y]:\\n if (xx,yy) in dp:\\n ans = max(ans, 1+dp[(xx,yy)])\\n else:\\n ans = max(ans, 1+dfs(xx,yy))\\n dp[(x,y)] = ans \\n return ans \\n \\n ans = 0 \\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, dfs(i,j))\\n return ans \",\n \"runtime\": \"402\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = {}\\n ROWS, COLS = len(matrix), len(matrix[0])\\n\\n def dfs(i,j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n \\n ROWS, COLS = len(matrix), len(matrix[0])\\n DIRS = [(1,0), (-1,0), (0,1), (0,-1)]\\n\\n path_len = 0\\n for dr, dc in DIRS:\\n new_i, new_j = dr+i, dc+j\\n if new_i in range(ROWS) and new_j in range(COLS) and matrix[i][j] < matrix[new_i][new_j]:\\n path_len = max(path_len, dfs(new_i, new_j))\\n \\n dp[(i,j)] = path_len+1\\n return path_len+1\\n \\n res = 0\\n for r in range(ROWS):\\n for c in range(COLS):\\n res = max(res, dfs(r,c))\\n \\n return res\",\n \"runtime\": \"405\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ans = 0\\n visited = set()\\n M = len(matrix)\\n N = len(matrix[0])\\n longest = {}\\n\\n # create an array which has longest inc path starting at (i, j)\\n # need to pop the answer back through the dfs calls\\n\\n def dfs(i, j, prev):\\n # check\\n if (i < 0 or j < 0 or\\n i >= M or j >= N or\\n matrix[i][j] <= prev):\\n return 0\\n \\n # if we already searched this path\\n if (i, j) in longest:\\n return longest[(i, j)]\\n\\n max_len = 0\\n \\n # search directions\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n for d1, d2 in directions:\\n # need to return max path\\n temp = dfs(i + d1, j + d2, matrix[i][j])\\n max_len = max(temp, max_len)\\n \\n longest[(i, j)] = 1 + max_len\\n \\n return 1 + max_len\\n \\n ans = 0\\n\\n for i in range(M):\\n for j in range(N):\\n temp = dfs(i, j, -1)\\n ans = max(ans, temp)\\n\\n print(longest)\\n return ans\\n\\n \\n\\n\\n\\n \",\n \"runtime\": \"405\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n adj_dict = defaultdict(list)\\n in_deg = defaultdict(int)\\n\\n def within(y, x):\\n return y >= 0 and y < len(matrix) and x >= 0 and x < len(matrix[y])\\n\\n for y in range(len(matrix)):\\n for x in range(len(matrix[y])):\\n val = matrix[y][x]\\n in_deg[(y,x)] = 0\\n if within(y+1, x):\\n if matrix[y+1][x] < val:\\n adj_dict[(y+1, x)].append((y, x))\\n if within(y-1, x):\\n if matrix[y-1][x] < val:\\n adj_dict[(y-1, x)].append((y, x))\\n if within(y, x+1):\\n if matrix[y][x+1] < val:\\n adj_dict[(y, x+1)].append((y, x))\\n if within(y, x-1):\\n if matrix[y][x-1] < val:\\n adj_dict[(y, x-1)].append((y, x))\\n \\n for point, deps in adj_dict.items():\\n for dep in deps:\\n in_deg[dep] += 1\\n \\n queue = []\\n for point, degree in in_deg.items():\\n if degree == 0:\\n queue.append(point)\\n \\n sol = 0\\n while len(queue) > 0:\\n sol += 1\\n nextqueue = []\\n \\n for point in queue:\\n for nextpoint in adj_dict[point]:\\n in_deg[nextpoint] -= 1\\n if in_deg[nextpoint] == 0:\\n nextqueue.append(nextpoint)\\n \\n queue = nextqueue\\n return sol\\n \",\n \"runtime\": \"409\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n visited = set()\\n node_visited = {}\\n def dfs(root, visited):\\n x, y = root\\n if (x, y) in visited:\\n return 0\\n if (x, y) in node_visited:\\n return node_visited[(x,y)]\\n record_path = 0\\n visited.add((x, y))\\n for dx, dy in directions:\\n if x+dx >= 0 and x+dx < len(matrix) and y+dy >= 0 and y+dy < len(matrix[0]) and (x+dx, y+dy) not in visited:\\n if matrix[x+dx][y+dy] > matrix[x][y]:\\n \\n record_path = max(record_path, dfs((x+dx, y+dy), visited))\\n visited.remove((x, y))\\n node_visited[(x,y)] = record_path + 1\\n return record_path + 1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dfs((i, j), visited)\\n return max(node_visited.values())\",\n \"runtime\": \"409\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n '''\\n given a starting point A, there are four possible directions, \\n find the one that lead to increasing path, then searching from that particular point\\n '''\\n m, n = len(matrix), len(matrix[0])\\n memo = [[0 for _ in range(201)] for _ in range(201)]\\n\\n def dfs(matrix, i, j):\\n if memo[i][j] != 0:\\n return memo[i][j]\\n \\n directions = [[0,1], [0,-1], [1,0], [-1,0]]\\n res = 0\\n for d in directions:\\n dx, dy = d\\n x = i + dx\\n y = j + dy\\n\\n if x < 0 or x >= m or y < 0 or y >= n:\\n continue\\n if matrix[x][y] <= matrix[i][j]:\\n continue\\n res = max(res, dfs(matrix, x, y))\\n memo[i][j] = 1+res\\n return 1+res\\n\\n ret = 0 \\n for i in range(m):\\n for j in range(n):\\n ret = max(ret, dfs(matrix, i, j)) # find the max ret for every point in this matrix\\n return ret\\n\",\n \"runtime\": \"413\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix),len(matrix[0])\\n cache = defaultdict(int)\\n directions = [(0,1), (0, -1), (1,0),(-1,0)]\\n\\n def checkInBounds(i, j):\\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]):\\n return False\\n return True\\n\\n def dfs(i, j):\\n if (i, j) in cache:\\n return cache[(i,j)]\\n \\n \\n\\n for direction in directions:\\n next_i, next_j = i + direction[0], j+direction[1]\\n if checkInBounds(next_i, next_j) and matrix[i][j] > matrix[next_i][next_j]:\\n cache[(i, j)] = max(cache[(i, j)], dfs(next_i, next_j))\\n cache[(i, j)] += 1\\n return cache[(i, j)]\\n\\n res = 0\\n for r in range(ROWS):\\n for c in range(COLS):\\n res = max(dfs(r,c), res)\\n return res\\n \\n\",\n \"runtime\": \"413\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n def dfs(row, col):\\n def within_bounds(r, c):\\n return 0 <= r < len(matrix) and 0 <= c < len(matrix[0])\\n if (row, col) in memo:\\n return memo[(row, col)]\\n ans = 1\\n for nr, nc in neighbors:\\n newr, newc = row + nr, col + nc\\n if within_bounds(newr, newc) and matrix[newr][newc] != \\\"#\\\" and matrix[newr][newc] > matrix[row][col]:\\n tmp = matrix[row][col]\\n matrix[row][col] = \\\"#\\\"\\n ans = max(ans, dfs(newr, newc) + 1)\\n matrix[row][col] = tmp\\n memo[(row, col)] = ans\\n return ans\\n\\n neighbors = [(-1, 0), (1, 0), (0, -1), (0, 1)]\\n memo = {}\\n max_result = 0\\n for row in range(len(matrix)):\\n for col in range(len(matrix[0])):\\n max_result = max(max_result, dfs(row, col))\\n return max_result\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n \\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # topo sort\\n def inBound(x, y, m, n):\\n return 0 <= x < m and 0 <= y < n\\n\\n m, n = len(matrix), len(matrix[0])\\n indegree = defaultdict(int)\\n dirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\\n for i in range(m):\\n for j in range(n):\\n for dx, dy in dirs:\\n nx, ny = i + dx, j + dy\\n if inBound(nx, ny, m, n) and matrix[nx][ny] < matrix[i][j]:\\n indegree[(i, j)] += 1\\n \\n q = deque()\\n for i in range(m):\\n for j in range(n):\\n if indegree[(i, j)] == 0:\\n q.append((i, j))\\n\\n res = 0\\n while q:\\n for _ in range(len(q)):\\n cx, cy = q.popleft()\\n for dx, dy in dirs:\\n nx, ny = cx + dx, cy + dy\\n if inBound(nx, ny, m, n) and matrix[nx][ny] > matrix[cx][cy]:\\n indegree[(nx, ny)] -= 1\\n if indegree[(nx, ny)] == 0:\\n q.append((nx, ny))\\n res += 1\\n return res\",\n \"runtime\": \"416\"\n },\n {\n \"code\": \"class Solution:\\n def update(self,graph,matrix,i,j,i_start,j_start):\\n m=len(matrix)\\n n=len(matrix[0])\\n if i<0 or i>=m or j<0 or j>=n:\\n return\\n if matrix[i][j]>matrix[i_start][j_start]:\\n graph[(i_start,j_start)].append((i,j))\\n return\\n def dfs(self,source,graph,seq_length_from):\\n if source in seq_length_from:\\n return seq_length_from[source]\\n length=1\\n for target in graph[source]:\\n length=max(length,1+self.dfs(target,graph,seq_length_from))\\n seq_length_from[source]=length\\n return length\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n graph=collections.defaultdict(lambda:[])\\n m=len(matrix)\\n n=len(matrix[0])\\n for i in range(m):\\n for j in range(n):\\n self.update(graph,matrix,i+1,j,i,j)\\n self.update(graph,matrix,i-1,j,i,j)\\n self.update(graph,matrix,i,j+1,i,j)\\n self.update(graph,matrix,i,j-1,i,j)\\n ans=1\\n seq_length_from={}\\n for source in [(i,j) for i in range(m) for j in range(n)]:\\n ans=max(ans, self.dfs(source, graph, seq_length_from))\\n return ans\",\n \"runtime\": \"420\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\\n result = 0\\n cache = {}\\n\\n def dfs(row: int, col: int, count: int, maxSoFar: int) -> int:\\n nonlocal result\\n if (row < 0 or row == len(matrix)) or (col < 0 or col == len(matrix[row])) or (matrix[row][col] <= maxSoFar):\\n result = max(result, count)\\n return 0\\n maxSoFar = max(maxSoFar, matrix[row][col])\\n if (row, col) in cache:\\n result = max(result, count+cache[(row, col)])\\n return cache[(row, col)]\\n maxPath = 0\\n one = dfs(row-1, col, count+1, maxSoFar)\\n two = dfs(row+1, col, count+1, maxSoFar)\\n three = dfs(row, col-1, count+1, maxSoFar)\\n four = dfs(row, col+1, count+1, maxSoFar)\\n maxPath = 1+max(maxPath, one, two, three, four)\\n cache[(row, col)] = maxPath\\n result = max(result, count+maxPath)\\n return maxPath\\n\\n for row in range(len(matrix)):\\n for col in range(len(matrix[row])):\\n dfs(row, col, 0, -1)\\n\\n return result\",\n \"runtime\": \"420\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n adj_list = ((0,1),(0,-1),(1,0),(-1,0))\\n R, C = len(matrix), len(matrix[0])\\n cache = {}\\n\\n def in_range(r, c):\\n return 0 <= r < R and 0 <= c < C\\n\\n def traverse(r, c, prev):\\n if not in_range(r, c): return 0\\n \\n this = matrix[r][c]\\n if this <= prev: return 0\\n\\n key = (r, c)\\n if key in cache: return cache[key]\\n\\n length_here = 1\\n matrix[r][c] = -1\\n for ra, ca in adj_list:\\n length_here = max(length_here, traverse(r+ra,c+ca,this)+1)\\n\\n matrix[r][c] = this\\n cache[key] =length_here \\n return cache[key]\\n\\n longest = 0\\n for r in range(R):\\n for c in range(C):\\n longest = max(longest, traverse(r,c,-1))\\n\\n return longest\",\n \"runtime\": \"424\"\n },\n {\n \"code\": \"from math import inf\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n dp = [[0 for _ in range(n)] for _ in range(m)]\\n\\n mi, mj = 0, 0\\n memo = set()\\n for i in range(m):\\n for j in range(n):\\n dx = [0, 0, -1, 1]\\n dy = [-1, 1, 0, 0]\\n ok = True\\n for k in range(4):\\n ci = i + dx[k]\\n cj = j + dy[k]\\n if -1 < ci < m and -1 < cj < n:\\n if matrix[ci][cj] <= matrix[i][j]:\\n ok = False\\n if ok:\\n mi, mj = i, j\\n memo.add((i, j))\\n dp[i][j] = 1\\n\\n def solve(i, j):\\n if (i, j) in memo:\\n return dp[i][j]\\n dx = [-1, 1, 0, 0]\\n dy = [0, 0, -1, 1]\\n ans = 1\\n for k in range(4):\\n ci = i + dx[k]\\n cj = j + dy[k]\\n if -1 < ci < m and -1 < cj < n and matrix[ci][cj] < matrix[i][j]:\\n ans = max(ans, solve(ci, cj) + 1)\\n dp[i][j] = ans\\n memo.add((i, j))\\n return dp[i][j]\\n for i in range(m):\\n for j in range(n):\\n solve(i, j)\\n longest = 0\\n for i in range(m):\\n for j in range(n):\\n longest = max(longest, dp[i][j])\\n return longest\\n\\n \\n \",\n \"runtime\": \"424\"\n },\n {\n \"code\": \"# class Solution:\\n# def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n# directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n# m, n = len(matrix), len(matrix[0])\\n# adj = {}\\n# indegree = {}\\n# q = deque()\\n# max_path = 0\\n\\n# for row, col in product(range(m), range(n)):\\n# adj[(row, col)] = []\\n# indegree[(row, col)] = 0\\n# for delta_row, delta_col in directions:\\n# i, j = row + delta_row, col + delta_col\\n# if matrix[row][col] < matrix[i][j]:\\n# adj[(row, col)].append((i, j))\\n# indegree[(i, j)] += 1\\n\\n# for (i, j), val in indegree.items():\\n# if val == 0:\\n# q.append((i, j, 1))\\n\\n# while q:\\n# i, j, path = q.popleft()\\n# max_path = max(max_path, path)\\n# for row, col in adj[(i, j)]:\\n\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n m, n = len(matrix), len(matrix[0])\\n adj = {}\\n self.max_path = 0\\n\\n for row, col in product(range(m), range(n)):\\n adj[(row, col)] = []\\n for delta_row, delta_col in directions:\\n i, j = row + delta_row, col + delta_col\\n if not (0 <= i < m and 0 <= j < n):\\n continue\\n if matrix[row][col] < matrix[i][j]:\\n adj[(row, col)].append((i, j))\\n \\n def dfs(row, col, paths):\\n if paths[row][col] is not None:\\n return paths[row][col]\\n nei = adj[(row, col)]\\n if nei:\\n paths[row][col] = max(dfs(i, j, paths) for i, j in nei) + 1\\n else:\\n paths[row][col] = 1\\n self.max_path = max(self.max_path, paths[row][col])\\n return paths[row][col]\\n\\n paths = [[None] * n for _ in range(m)]\\n for i, j in product(range(m), range(n)):\\n dfs(i, j, paths)\\n\\n return self.max_path\",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n seen = {}\\n \\n @cache\\n def dfs(i, j, count):\\n if (i, j) in seen:\\n return count + seen[(i, j)]\\n ans = 0\\n for dx, dy in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n x = i + dx\\n y = j + dy\\n\\n if x in range(m) and y in range(n) and matrix[x][y] > matrix[i][j]:\\n ans = max(ans, dfs(x, y, count + 1))\\n if ans:\\n seen[(i, j)] = ans - count\\n return ans\\n else:\\n seen[(i, j)] = 1\\n return 1 + count\\n \\n result = 0\\n for i in range(m):\\n for j in range(n):\\n if (i, j) not in seen:\\n result = max(result, dfs(i, j, 0))\\n \\n return result\\n\\n \",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n #i,j holds the longest increasing path in any direction\\n # we can check if the one before us is smaller, if so then we do something with it\\n # we check to our left and upwards\\n dp = {}\\n ROWS, COLS = len(matrix), len(matrix[0])\\n # if its left and up then its smaller, otherwise its bigger\\n directions = [(-1,0), (1,0), (0, -1), (0,1)]\\n def dfs(i,j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n max_val = 1\\n for direction in directions:\\n hor, vert = direction\\n new_row, new_col = i + vert, j + hor\\n if new_row not in range(0, ROWS) or new_col not in range(0, COLS):\\n continue\\n if matrix[new_row][new_col] > matrix[i][j]:\\n max_val = max(1 + dfs(new_row, new_col), max_val)\\n \\n dp[(i,j)] = max_val\\n return dp[(i,j)]\\n \\n max_so_far = 0\\n for i in range(ROWS):\\n for j in range(COLS):\\n max_so_far = max(max_so_far, dfs(i,j))\\n \\n return max_so_far\\n \",\n \"runtime\": \"431\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n for i in range(rows):\\n for j in range(cols):\\n dfs(i, j)\\n \\n return max(dp.values())\\n\\n\\n \",\n \"runtime\": \"431\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n if i in range(rows) and j in range(cols) and matrix[i][j] > prev:\\n return True\\n return False\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n max_path = 0\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j))\\n \\n return max_path\\n\\n\\n \",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n rows, cols = len(matrix), len(matrix[0])\\n dp = defaultdict(int)\\n res = 0\\n\\n def dfs(i, j, prev):\\n \\n if i not in range(rows) or j not in range(cols) or prev >= matrix[i][j]:\\n return 0\\n \\n if (i, j) in dp:\\n return dp[(i, j)]\\n \\n dp[(i, j)] = 1 + max(dfs(i + 1, j, matrix[i][j]), dfs(i , j + 1, matrix[i][j]), \\n dfs(i - 1, j, matrix[i][j]), dfs(i, j - 1, matrix[i][j]))\\n\\n return dp[(i, j)]\\n \\n for i in range(rows):\\n for j in range(cols):\\n res = max(res, dfs(i, j, float(\\\"-inf\\\")))\\n \\n return res\",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0]) \\n dp = {} # (row, col) = longest increasing path \\n\\n # need current coordinates and previous value \\n def dfs(r, c, prevVal):\\n if (r not in range(rows) or c not in range(cols) or matrix[r][c] <= prevVal):\\n return 0 \\n \\n if (r, c) in dp:\\n return dp[(r, c)] \\n res = 1\\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n\\n dp[(r, c)] = res\\n\\n return res\\n \\n # prev val should be -1 since by default first call should not hit base case\\n ans = -1\\n for r in range(rows):\\n for c in range(cols):\\n res = dfs(r, c, -1) \\n if res > ans:\\n ans = res\\n\\n\\n return ans\\n\\n\\n\\n\\n \",\n \"runtime\": \"439\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n memo = {}\\n\\n\\n def dfs(r, c, prev):\\n if r not in range(m) or c not in range(n) or matrix[r][c] <= prev:\\n return 0\\n\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n res = 0\\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n memo[(r, c)] = res\\n return memo[(r, c)]\\n\\n for r in range(m):\\n for c in range(n):\\n dfs(r, c, -1)\\n \\n return max(memo.values())\",\n \"runtime\": \"439\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n if i in range(rows) and j in range(cols) and matrix[i][j] > prev:\\n return True\\n return False\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n max_path = 0\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j))\\n \\n return max_path\\n\\n\\n \",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n max_path = 0\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j))\\n \\n return max_path\\n\\n\\n \",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"from functools import lru_cache\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0]) # Get the number of rows and columns in the matrix\\n memory = {} # Initialize a memoization dictionary\\n @lru_cache\\n def dfs(r, c, prevVal):\\n # Base cases: Check if out of bounds or current cell value is not increasing\\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prevVal:\\n return 0\\n # Memoization check: If result for current cell already computed, return it\\n if (r, c) in memory:\\n return memory[(r, c)]\\n\\n ans = 1 # Initialize the answer to 1 (minimum length of increasing path)\\n # Explore all four directions from the current cell\\n ans = max(ans, 1 + dfs(r + 1, c, matrix[r][c])) # Down\\n ans = max(ans, 1 + dfs(r - 1, c, matrix[r][c])) # Up\\n ans = max(ans, 1 + dfs(r, c + 1, matrix[r][c])) # Right\\n ans = max(ans, 1 + dfs(r, c - 1, matrix[r][c])) # Left\\n memory[(r, c)] = ans # Memoize the result for the current cell\\n return ans # Return the length of the longest increasing path starting from the current cell\\n\\n # Iterate through each cell in the matrix and call the DFS function\\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1) # Start DFS from each cell with initial previous value -1\\n return max(memory.values()) # Return the maximum value stored in the memoization dictionary\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = [[-1] * COLS for _ in range(ROWS)]\\n\\n def dfs(r, c, prev):\\n if (r not in range(len(matrix))\\n or c not in range(len(matrix[0]))\\n or matrix[r][c] <= prev):\\n return 0\\n if dp[r][c] != -1:\\n return dp[r][c]\\n\\n longest = 1\\n directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]\\n for dr, dc in directions:\\n longest = max(longest, 1 + dfs(r + dr, c + dc, matrix[r][c]))\\n\\n dp[r][c] = longest\\n return longest\\n\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n dfs(r, c, -1)\\n\\n return max(max(length) for length in dp)\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n '''\\n Longest increasing using Graph this is kind of topological sort problem \\n '''\\n\\n rows , cols = len(matrix) , len(matrix[0])\\n dp = {}\\n\\n #constructing the depth first search \\n def dfs(r , c, prevValue):\\n \\n if ((r not in range(rows))\\n or (c not in range(cols))\\n or (matrix[r][c]<= prevValue)):\\n\\n return 0\\n\\n if (r,c) in dp:\\n return dp[(r,c)]\\n\\n res = 1 \\n res = max(res , 1+ dfs(r+1,c,matrix[r][c])) \\n res = max(res , 1+ dfs(r-1,c,matrix[r][c]))\\n res = max(res , 1+ dfs(r,c+1,matrix[r][c])) \\n res = max(res , 1+ dfs(r,c-1,matrix[r][c]))\\n\\n dp[(r,c)] = res\\n return res\\n\\n\\n for r in range(rows):\\n for c in range(cols):\\n dfs(r,c,-1)\\n\\n return max(dp.values())\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n memo = {}\\n m, n = len(matrix), len(matrix[0])\\n \\n def dfs(r, c, prev):\\n if r not in range(m) or c not in range(n) or matrix[r][c] <= prev:\\n return 0\\n \\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n res = 0\\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n \\n memo[(r, c)] = res\\n return memo[(r, c)]\\n \\n \\n for r in range(m):\\n for c in range(n):\\n dfs(r, c, -1)\\n \\n return max(memo.values())\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # Build a graph: smaller -> larger\\n # An in-degree array -> To find the start point\\n m, n = len(matrix), len(matrix[0])\\n if m * n == 1:\\n return 1\\n\\n graph = defaultdict(list)\\n indegree = defaultdict(int)\\n for i in range(m):\\n for j in range(n):\\n if j + 1 < n:\\n if matrix[i][j] < matrix[i][j+1]:\\n graph[(i, j)].append((i, j+1))\\n indegree[(i,j+1)] +=1\\n elif matrix[i][j] > matrix[i][j+1]:\\n graph[(i, j+1)].append((i, j))\\n indegree[(i,j)] +=1\\n if i + 1 < m:\\n if matrix[i][j] < matrix[i+1][j]:\\n graph[(i, j)].append((i+1, j))\\n indegree[(i+1,j)] +=1\\n elif matrix[i][j] > matrix[i+1][j]:\\n graph[(i+1, j)].append((i, j))\\n indegree[(i,j)] +=1\\n \\n # Use DFS to find the longest path\\n memo = {}\\n def dfs(i, j):\\n if (i, j) not in graph:\\n return 1\\n \\n if (i, j) not in memo:\\n memo[(i, j)] = 1 + max([dfs(ni, nj) for ni, nj in graph[(i, j)]])\\n return memo[(i, j)]\\n \\n return max([dfs(i, j) for i, j in graph if indegree[(i,j)] == 0])\\n \",\n \"runtime\": \"454\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n dp = {} # (x, y): max depth\\n r = len(matrix)\\n c = len(matrix[0])\\n\\n def dfs(x, y, prevVal):\\n # out of bounds or currval is not bigger than prev val\\n if x not in range(r) or y not in range(c) or matrix[x][y] <= prevVal:\\n return 0\\n if (x, y) in dp:\\n return dp[(x, y)]\\n \\n depth = 1\\n for dx, dy in directions:\\n xNew = x + dx\\n yNew = y + dy\\n depth = max(depth, 1 + dfs(xNew, yNew, matrix[x][y]))\\n \\n dp[(x, y)] = depth\\n return dp[(x, y)]\\n \\n maxDepth = 0\\n for i in range(r):\\n for j in range(c):\\n if (i, j) in dp:\\n maxDepth = max(maxDepth, dp[(i, j)])\\n else:\\n maxDepth = max(maxDepth, dfs(i, j, -1))\\n \\n return maxDepth\",\n \"runtime\": \"454\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n rows = len(matrix)\\n cols = len(matrix[0])\\n \\n dp = {}\\n \\n \\n \\n \\n def dfs(r,c,prev):\\n \\n if(r not in range(rows)or\\n c not in range(cols) or\\n matrix[r][c] <= prev \\n ):\\n return 0\\n if (r,c) in dp:\\n return dp[(r,c)]\\n res=1 \\n dirs = [[0,1],(0,-1),(1,0),(-1,0)]\\n for dr, dc in dirs:\\n res = max(res, 1+ dfs(r+dr,c+dc,matrix[r][c]))\\n dp[(r,c)]=res\\n return res\\n \\n \\n for r in range(rows):\\n for c in range(cols):\\n dfs(r,c,-1)\\n return max(dp.values())\\n\\n\\n \\n \\n \\n \\n \",\n \"runtime\": \"458\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n Visited = []\\n dp = {}\\n def dfs(i,j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n directions = [[-1,0],[1,0], [0,1], [0,-1]]\\n L = []\\n max_path = 1\\n for di, dj in directions:\\n new_I = i+ di\\n new_J = j+ dj\\n if (new_I in range(len(matrix))) and (new_J in range(len(matrix[0]))) and matrix[i][j]<matrix[new_I][new_J]:\\n max_path = max(max_path,1+dfs(new_I, new_J))\\n dp[(i,j)] =max_path\\n return dp[(i,j)]\\n\\n maxC = 1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n maxC = max(maxC, dfs(i,j))\\n return maxC\\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"458\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n def dp(i, j):\\n if (i, j) in memo:\\n return memo[(i, j)]\\n memo[(i, j)] = 1\\n directions = [[-1, 0], [1, 0], [0, 1], [0, -1]]\\n for (dr, dc) in directions:\\n row, col = i + dr, j + dc\\n if row in range(ROWS) and col in range(COLS) and matrix[i][j] < matrix[row][col]:\\n memo[(i, j)] = max(memo[(i, j)], 1 + dp(row, col))\\n return memo[(i, j)]\\n\\n memo = {}\\n max_path_length = 1\\n for i in range(ROWS):\\n for j in range(COLS):\\n max_path_length = max(max_path_length, dp(i, j))\\n return max_path_length\",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self, val=None, pos = None):\\n self.val = val\\n self.pos = pos\\n self.neighbors = []\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n node_mapper = []\\n m = len(matrix)\\n n = len(matrix[0])\\n for i in range(m):\\n row = []\\n for j in range(n):\\n val = matrix[i][j]\\n new_node = Node(val , (i, j))\\n row.append([new_node, None])\\n\\n for k, l in ((i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)):\\n if 0 <= k and k < m and 0 <= l and l < n and matrix[k][l] > val:\\n new_node.neighbors.append((k, l))\\n node_mapper.append(row)\\n\\n def traverse(i, j):\\n maybe_calculated_length = node_mapper[i][j][1]\\n if maybe_calculated_length is not None:\\n return maybe_calculated_length\\n \\n max_length = 0\\n for k, l in node_mapper[i][j][0].neighbors:\\n max_length = max(max_length, traverse(k, l))\\n node_mapper[i][j][1] = max_length + 1\\n return max_length + 1\\n\\n output = 0\\n for a in range(m):\\n for b in range(n):\\n output = max(output, traverse(a, b))\\n return output\",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\\n result = 0\\n cache = {}\\n\\n def dfs(row: int, col: int, count: int, maxSoFar: int) -> int:\\n nonlocal result\\n if (row < 0 or row == len(matrix)) or (col < 0 or col == len(matrix[row])) or (matrix[row][col] <= maxSoFar):\\n result = max(result, count)\\n return 0\\n maxSoFar = max(maxSoFar, matrix[row][col])\\n if (row, col) in cache:\\n result = max(result, count+cache[(row, col)])\\n return cache[(row, col)]\\n maxPath = 1\\n maxPath = max(maxPath, 1+dfs(row-1, col, count+1, maxSoFar))\\n maxPath = max(maxPath, 1+dfs(row+1, col, count+1, maxSoFar))\\n maxPath = max(maxPath, 1+dfs(row, col-1, count+1, maxSoFar))\\n maxPath = max(maxPath, 1+dfs(row, col+1, count+1, maxSoFar))\\n cache[(row, col)] = maxPath\\n result = max(result, count+maxPath)\\n return maxPath\\n\\n for row in range(len(matrix)):\\n for col in range(len(matrix[row])):\\n dfs(row, col, 0, -1)\\n\\n return result\",\n \"runtime\": \"465\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n longest = [[1 for _ in range(n)] for _ in range(m)]\\n def getLongestPath(i, j):\\n if longest[i][j] != 1:\\n return longest[i][j]\\n for k, l in [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)]:\\n if k in range(m) and l in range(n) and matrix[k][l] > matrix[i][j]:\\n length = getLongestPath(k, l)\\n longest[i][j] = max(longest[i][j], length + 1)\\n return longest[i][j]\\n longestPath = 0\\n for i in range(m):\\n for j in range(n):\\n longestPath = max(longestPath, getLongestPath(i, j))\\n return longestPath\\n\",\n \"runtime\": \"465\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, arr: List[List[int]]) -> int:\\n direction, out, dp = [[0, 1], [0, -1], [1, 0], [-1, 0]], 0, {}\\n def isvalid(i: int, j: int) -> bool:\\n return 0 <= i < len(arr) and 0 <= j < len(arr[0])\\n\\n def dfs(i, j, visited = set(), prev = -1):\\n if not isvalid(i, j) or (i, j) in visited or arr[i][j] <= prev:\\n return 0\\n if (i, j) in dp:return dp[(i, j)]\\n \\n out = 0\\n visited.add((i, j))\\n\\n for x, y in direction:\\n out = max(out, 1 + dfs(x + i, y + j, visited, arr[i][j]))\\n \\n visited.remove((i, j))\\n dp[(i, j)] = out\\n return out\\n\\n for i in range(len(arr)):\\n for j in range(len(arr[0])):\\n out = max(out, dfs(i, j))\\n\\n return out\",\n \"runtime\": \"469\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n dp = {} # (x, y): max depth\\n r = len(matrix)\\n c = len(matrix[0])\\n\\n def dfs(x, y, prevVal):\\n # out of bounds or currval is not bigger than prev val\\n if x not in range(r) or y not in range(c) or matrix[x][y] <= prevVal:\\n return 0\\n if (x, y) in dp:\\n return dp[(x, y)]\\n \\n depth = 1\\n for dx, dy in directions:\\n xNew = x + dx\\n yNew = y + dy\\n depth = max(depth, 1 + dfs(xNew, yNew, matrix[x][y]))\\n \\n dp[(x, y)] = depth\\n return dp[(x, y)]\\n \\n maxDepth = 0\\n for i in range(r):\\n for j in range(c):\\n if (i, j) in dp:\\n maxDepth = max(maxDepth, dp[(i, j)])\\n else:\\n maxDepth = max(maxDepth, dfs(i, j, -1))\\n \\n return maxDepth\",\n \"runtime\": \"469\"\n },\n {\n \"code\": \"from typing import List\\nfrom functools import cache\\n\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.directions = ((0, 1), (0, -1), (1, 0), (-1, 0))\\n\\n def valid(self, row: int, col: int) -> bool:\\n return 0 <= row < len(self.matrix) and 0 <= col < len(self.matrix[0])\\n\\n @cache\\n def find_path(self, row: int, col: int) -> int:\\n possible_paths: List = []\\n for delta_row, delta_col in self.directions:\\n next_row, next_col = row + delta_row, col + delta_col\\n if self.valid(row=next_row, col=next_col) and self.matrix[next_row][next_col] < self.matrix[row][col]:\\n possible_paths.append((next_row, next_col))\\n if not possible_paths:\\n return 1\\n else:\\n return max([self.find_path(row=each[0], col=each[1]) for each in possible_paths]) + 1\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n self.matrix: List[List[int]] = matrix\\n longest_path: None | int = None\\n for row in range(len(matrix)):\\n for col in range(len(matrix[0])):\\n path_length: int = self.find_path(row=row, col=col)\\n longest_path = path_length if longest_path is None else max(longest_path, path_length)\\n return longest_path\\n\",\n \"runtime\": \"473\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n @functools.lru_cache(None)\\n def dfs(i: int, j: int, prev: int) -> int:\\n if i < 0 or i == m or j < 0 or j == n:\\n return 0\\n if matrix[i][j] <= prev:\\n return 0\\n\\n curr = matrix[i][j]\\n return 1 + max(dfs(i + 1, j, curr),\\n dfs(i - 1, j, curr),\\n dfs(i, j + 1, curr),\\n dfs(i, j - 1, curr))\\n\\n return max(dfs(i, j, -math.inf) for i in range(m) for j in range(n))\",\n \"runtime\": \"473\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROW, COL = len(matrix), len(matrix[0])\\n dp = {}\\n def dfs(r, c, prev):\\n if r not in range(ROW) or c not in range(COL) or matrix[r][c] <= prev:\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n \\n res = 1\\n direction = [[1,0], [-1,0], [0,-1], [0,1]]\\n for dr, dc in direction:\\n res = max(res, 1 + dfs(r+dr, c+dc, matrix[r][c]))\\n dp[(r, c)] = res\\n return res\\n\\n\\n\\n for r in range(ROW):\\n for c in range(COL):\\n dfs(r, c , -1)\\n return max(dp.values())\",\n \"runtime\": \"476\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = {}\\n R = len(matrix)\\n C = len(matrix[0])\\n\\n dirs = [[-1, 0], [1, 0], [0, 1], [0, -1]]\\n\\n ans = 1\\n\\n dp = {}\\n\\n def dfs(r, c, prev_val):\\n nonlocal ans\\n if r not in range(R) or c not in range(C) or matrix[r][c] <= prev_val:\\n return 0\\n\\n if (r,c) in dp:\\n return dp[(r, c)]\\n\\n res = 1\\n for dr in dirs:\\n new_r = r+dr[0]\\n new_c = c+dr[1]\\n res = max(res, 1 + dfs(new_r, new_c, matrix[r][c]))\\n \\n ans = max(ans, res)\\n dp[(r,c)] = res\\n return res\\n \\n for r in range(R):\\n for c in range(C):\\n dfs(r, c, -1)\\n \\n return ans\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"476\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n cache = {}\\n res = [0]\\n def dfs(i, j):\\n if i not in range(m) or j not in range(n):\\n return 0\\n if (i, j) in cache:\\n return cache[(i,j)]\\n\\n directions = [(i+1, j), (i-1, j), (i, j+1), (i, j-1)]\\n longest = 1\\n for p,q in directions:\\n if p not in range(m) or q not in range(n) or matrix[p][q] <= matrix[i][j]:\\n continue\\n longest = max(longest, 1+dfs(p, q))\\n res[0] = max(res[0], longest)\\n cache[(i, j)] = longest\\n return longest\\n for i in range(m):\\n for j in range(n):\\n dfs(i, j)\\n return res[0]\",\n \"runtime\": \"480\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: list[list[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n @functools.lru_cache(None)\\n def dfs(i: int, j: int, prev: int) -> int:\\n if i < 0 or i == m or j < 0 or j == n:\\n return 0\\n if matrix[i][j] <= prev:\\n return 0\\n\\n curr = matrix[i][j]\\n return 1 + max(dfs(i + 1, j, curr),\\n dfs(i - 1, j, curr),\\n dfs(i, j + 1, curr),\\n dfs(i, j - 1, curr))\\n\\n return max(dfs(i, j, -math.inf) for i in range(m) for j in range(n))\",\n \"runtime\": \"480\"\n },\n {\n \"code\": \"from functools import lru_cache\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix):\\n if not matrix or not matrix[0]:\\n return 0\\n m, n = len(matrix), len(matrix[0])\\n\\n @lru_cache(None)\\n def dfs(i, j, pre):\\n if not (0 <= i < m and 0 <= j < n) or matrix[i][j] <= pre:\\n return 0\\n val = matrix[i][j]\\n return 1 + max(\\n dfs(i - 1, j, val),\\n dfs(i + 1, j, val),\\n dfs(i, j - 1, val),\\n dfs(i, j + 1, val)\\n )\\n \\n return max(dfs(x, y, -1) for x in range(m) for y in range(n))\\n\\n# Example usage:\\n# sol = Solution()\\n# print(sol.longestIncreasingPath([[9,9,4],[6,6,8],[2,1,1]])) # Output: 4\\n# print(sol.longestIncreasingPath([[3,4,5],[3,2,6],[2,2,1]])) # Output: 4\",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n Visited = []\\n dp = {}\\n def dfs(i,j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n directions = [[-1,0],[1,0], [0,1], [0,-1]]\\n L = []\\n Visited.append((i,j))\\n for di, dj in directions:\\n new_I = i+ di\\n new_J = j+ dj\\n if (new_I in range(len(matrix))) and (new_J in range(len(matrix[0]))) and matrix[i][j]<matrix[new_I][new_J] and (new_I, new_J) not in Visited:\\n L.append(1+dfs(new_I, new_J))\\n Visited.pop(-1)\\n dp[(i,j)] = max(L) if L else 1 \\n return dp[(i,j)]\\n\\n maxC = 1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n maxC = max(maxC, dfs(i,j))\\n return maxC\\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dirs = [(0,1), (0,-1), (1,0), (-1,0)]\\n def inBounds(x,y):\\n return 0 <= x < ROWS and 0 <= y < COLS\\n\\n ROWS, COLS = len(matrix), len(matrix[0])\\n outDegrees = {}\\n for x in range(ROWS):\\n for y in range(COLS):\\n for dx, dy in dirs:\\n if (x,y) not in outDegrees: outDegrees[(x,y)] = 0\\n if inBounds(x+dx, y+dy) and matrix[x+dx][y+dy] > matrix[x][y]:\\n outDegrees[(x,y)] += 1\\n \\n q = deque([k for k, v in outDegrees.items() if v == 0])\\n print(q)\\n print(outDegrees)\\n res = 0\\n\\n while q:\\n res += 1\\n for _ in range(len(q)):\\n x,y = q.popleft()\\n for dx, dy in dirs:\\n if inBounds(x+dx, y+dy) and matrix[x][y] > matrix[x+dx][y+dy]:\\n outDegrees[(x+dx, y+dy)] -= 1\\n if outDegrees[(x+dx,y+dy)] == 0:\\n q.append((x+dx, y+dy))\\n\\n return res\\n\",\n \"runtime\": \"487\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n Visited = []\\n dp = {}\\n def dfs(i,j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n directions = [[-1,0],[1,0], [0,1], [0,-1]]\\n L = []\\n Visited.append((i,j))\\n for di, dj in directions:\\n new_I = i+ di\\n new_J = j+ dj\\n \\n if (new_I in range(len(matrix))) and (new_J in range(len(matrix[0]))) and matrix[i][j]<matrix[new_I][new_J] and (new_I, new_J) not in Visited:\\n L.append(1+dfs(new_I, new_J))\\n Visited.pop(-1)\\n dp[(i,j)] = max(L) if L else 1 \\n return dp[(i,j)]\\n\\n maxC = 1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n maxC = max(maxC, dfs(i,j))\\n return maxC\\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"487\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n @functools.lru_cache(None)\\n def dfs(i: int, j: int, prev: int) -> int:\\n if i < 0 or i == m or j < 0 or j == n:\\n return 0\\n if matrix[i][j] <= prev:\\n return 0\\n\\n curr = matrix[i][j]\\n return 1 + max(dfs(i + 1, j, curr),\\n dfs(i - 1, j, curr),\\n dfs(i, j + 1, curr),\\n dfs(i, j - 1, curr))\\n\\n return max(dfs(i, j, -math.inf) for i in range(m) for j in range(n))\",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n @cache\\n def dp(i, j, prev):\\n if not (0 <= i < m and 0 <= j < n) or matrix[i][j] <= prev:\\n return 0\\n ans = 1\\n ans = max(ans, dp(i + 1, j, matrix[i][j]) + 1, dp(i - 1, j, matrix[i][j]) + 1, dp(i, j + 1, matrix[i][j]) + 1, dp(i, j - 1, matrix[i][j]) + 1)\\n return ans\\n\\n m, n = len(matrix), len(matrix[0])\\n ans = 0\\n for r in range(m):\\n for c in range(n):\\n ans = max(ans, dp(r, c, -1))\\n return ans\\n\\n\",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = [[0 for j in range(len(matrix[0]))] for i in range(len(matrix))]\\n\\n def dfs(i,j): \\n print(i,j, matrix[i][j])\\n if (dp[i][j] != 0):\\n return dp[i][j]\\n cur = 0\\n if i > 0 and matrix[i-1][j] > matrix[i][j] : \\n cur = max(cur, dfs(i-1,j))\\n if j > 0 and matrix[i][j-1] > matrix[i][j] : \\n cur = max(cur, dfs(i,j-1))\\n if i < len(matrix) - 1 and matrix[i+1][j] > matrix[i][j] : \\n cur = max(cur, dfs(i+1,j))\\n if j < len(matrix[0]) - 1 and matrix[i][j+1] > matrix[i][j] : \\n cur = max(cur, dfs(i,j+1))\\n dp[i][j] = cur + 1\\n return dp[i][j] \\n ret = 0\\n \\n for i in range(len(matrix)): \\n for j in range(len(matrix[0])): \\n ret = max(ret, dfs(i,j)) \\n return ret\\n\\n\",\n \"runtime\": \"499\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n seen = set()\\n ROWS, COLS = len(matrix), len(matrix[0])\\n self.maxLen = 0\\n cache = {}\\n\\n def dfs(row, col, currLen, prev):\\n if (row, col) in cache:\\n return cache[(row, col)]\\n \\n currMaxLen = 1\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n for dr, dc in directions:\\n r = row + dr\\n c = col + dc\\n if r in range(ROWS) and c in range(COLS) and matrix[r][c] < matrix[row][col]:\\n seen.add((r, c))\\n currMaxLen = max(currMaxLen, 1 + dfs(r, c, 1, matrix[r][c]))\\n seen.remove((r, c))\\n\\n cache[(row, col)] = currMaxLen\\n return cache[(row, col)]\\n \\n for r in range(ROWS):\\n for c in range(COLS):\\n self.maxLen = max(self.maxLen, dfs(r, c, 1, float(\\\"inf\\\")))\\n \\n return self.maxLen\",\n \"runtime\": \"499\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n row, col = len(matrix), len(matrix[0])\\n @functools.lru_cache(None)\\n def dfs(r: int, c: int, prev: int):\\n if r==row or r<0 or c==col or c<0:\\n return 0\\n if matrix[r][c]<=prev:\\n return 0\\n curr = matrix[r][c]\\n return 1 + max(dfs(r+1,c,curr),\\n dfs(r-1,c,curr),\\n dfs(r,c+1,curr),\\n dfs(r,c-1,curr))\\n\\n return max(dfs(r, c, -math.inf) for r in range(row) for c in range(col))\\n\\n \",\n \"runtime\": \"502\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n ROWS, COLS = len(matrix), len(matrix[0])\\n directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]\\n def gen_newrc(r, c):\\n return [[r + move_row, c + move_col] for move_row, move_col in directions]\\n def check(new_row, new_col):\\n return 0 <= new_row < ROWS and 0 <= new_col < COLS and matrix[new_row][new_col] > matrix[r][c]\\n \\n indegree = [[0] * COLS for _ in range(ROWS)]\\n\\n for r, c in itertools.product(range(ROWS), range(COLS)):\\n for new_row, new_col in gen_newrc(r, c):\\n if check(new_row, new_col):\\n indegree[new_row][new_col] += 1\\n\\n start_nodes = []\\n for r, c in itertools.product(range(ROWS), range(COLS)):\\n if indegree[r][c] == 0:\\n start_nodes.append((r, c))\\n\\n max_path = 0\\n while start_nodes:\\n max_path += 1\\n next_level = []\\n for r, c in start_nodes:\\n for new_row, new_col in gen_newrc(r, c):\\n if check(new_row, new_col):\\n indegree[new_row][new_col] -= 1\\n if indegree[new_row][new_col] == 0:\\n next_level.append((new_row, new_col))\\n start_nodes = next_level\\n\\n return max_path\",\n \"runtime\": \"502\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dirs = [(-1,0),(1,0),(0,1),(0,-1)]\\n dp = {}\\n def dfs(x,y):\\n ans = 1 \\n for dx, dy in dirs:\\n xx, yy = x+dx, y+dy \\n if xx in range(m) and yy in range(n) and matrix[xx][yy]>matrix[x][y]:\\n if (xx,yy) in dp:\\n ans = max(ans, 1+dp[(xx,yy)])\\n else:\\n ans = max(ans, 1+dfs(xx,yy))\\n dp[(x,y)] = ans \\n return ans \\n \\n ans = 0 \\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, dfs(i,j))\\n return ans \",\n \"runtime\": \"506\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n res = 0\\n @cache\\n def dfs(prev,r,c):\\n if (not 0 <= r < len(matrix)) or (not 0 <= c < len(matrix[0]) or matrix[r][c] <= prev):\\n return 0\\n else:\\n return max(dfs(matrix[r][c], r+1,c), dfs(matrix[r][c], r-1,c),dfs(matrix[r][c], r,c+1),dfs(matrix[r][c], r,c-1)) + 1\\n \\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n res = max(res,dfs(-1,r,c)) \\n return res\\n \\n\\n \",\n \"runtime\": \"506\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n 1. build adjacency graph\\n 2. follow path from 0 incoming nodes\\n \\\"\\\"\\\"\\n\\n graph = collections.defaultdict(list)\\n indegree = collections.defaultdict(int)\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n num = matrix[i][j]\\n for di, dj in [(0,1), (0,-1), (1,0), (-1,0)]:\\n if i + di < 0 or i + di >= len(matrix) or j + dj < 0 or j + dj >= len(matrix[0]):\\n continue\\n if matrix[i+di][j+dj] > num:\\n graph[(i, j)].append((i+di, j+dj))\\n indegree[(i+di, j+dj)] += 1\\n\\n seen = {}\\n def depth(i, j):\\n if (i, j) in seen:\\n return seen[(i, j)]\\n res = 1\\n for child in graph[(i, j)]:\\n res = max(res, depth(child[0], child[1]) + 1)\\n \\n seen[(i, j)] = res \\n return res\\n\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n res = max(res, depth(i, j))\\n\\n return res\\n\",\n \"runtime\": \"510\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n n = len(matrix)\\n m = len(matrix[0])\\n\\n memo = {}\\n\\n def traverse(i,j,p):\\n\\n if i < 0 or i >= n or j < 0 or j >= m or matrix[i][j] <= p:\\n\\n return 0\\n\\n if (i,j,p) in memo:\\n\\n return memo[(i,j,p)]\\n\\n memo[(i,j,p)] = 1 + max(traverse(i+1,j,matrix[i][j]),\\n traverse(i,j+1,matrix[i][j]),\\n traverse(i,j-1,matrix[i][j]),\\n traverse(i-1,j,matrix[i][j]))\\n\\n return memo[(i,j,p)]\\n \\n max_length = 0\\n for i in range(n):\\n for j in range(m):\\n\\n max_length = max(max_length,traverse(i,j,-1))\\n\\n \\n return max_length\\n\\n\\n\\n\\n\",\n \"runtime\": \"510\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n res = 0\\n @cache\\n def dfs(prev,r,c):\\n if (not 0 <= r < len(matrix)) or (not 0 <= c < len(matrix[0]) or matrix[r][c] <= prev):\\n return 0\\n else:\\n return max(dfs(matrix[r][c], r+1,c), dfs(matrix[r][c], r-1,c),dfs(matrix[r][c], r,c+1),dfs(matrix[r][c], r,c-1)) + 1\\n \\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n res = max(res,dfs(-1,r,c)) \\n return res\\n \\n\\n \",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"# Given an m x n integers matrix\\n# - rectangle\\n\\n# 1 <= m, n <= 200\\n# small number of rows and cols\\n# 0 <= matrix[i][j] <= 2**31 - 1\\n# values in each of these rows can be extremely large\\n\\n# return the length of the longest increasing path in matrix.\\n# - strictly increasing\\n# - consistent increasing sequence of numbers where i > i -1\\n# - 1 2 3 or 1 4 7\\n# - once we take a number, the next number we can take after it must be strictly greater\\n# - keep track using a threshold to represent the number the following number needs to be greater than\\n# - \\n\\n# until each cell, you can either move --> left, right up down\\n\\n# no diagonals, no move outside boundary (no combos and must stay in bounds)\\n\\n# Using a matrix[][] of size m x n find the length of the ongest increasing path\\n\\n\\n# Input: matrix = [[9,9,4],[6,6,8],[2,1,1]]\\n\\n# Decision: find the length of the longest increasing path in the matrix [[9,9,4],[6,6,8],[2,1,1]]\\n# threshold start at -1 as matrix values can be 0 <= matrix[i][j] <= 2**31 - 1\\n\\n# Starting with ith node what are my actions?\\n# if node > threshold, Take the ith node --> length + 1, threshold == ith node, dfs --> up, down, left, or right if possible\\n# else, Skip the ith node --> length = length, threshold is same, return the length for that node\\n\\n# avenues: [dfs(matrix[row-1][col]), dfs(matrix[row+1][col]), dfs(matrix[row][col+1], dfs(matrix[row][col-1])]\\n# take ith node --> threhold = ith node, length+1 actions: for x in avenues: take x, skip x\\n# skip the ith node --> return length, end route\\n\\n\\n\\nclass Solution:\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n @lru_cache(None)\\n def longest_path_until_row_col(row, col, threshold):\\n #skip, return\\n if row >= len(matrix) or col >= len(matrix[0]) or row < 0 or col < 0 or matrix[row][col] <= threshold:\\n return 0\\n #take\\n threshold = matrix[row][col]\\n down = longest_path_until_row_col(row + 1, col, threshold)\\n right = longest_path_until_row_col(row, col + 1, threshold)\\n left = longest_path_until_row_col(row, col - 1, threshold)\\n up = longest_path_until_row_col(row - 1, col, threshold)\\n return 1 + max(left, right, up, down)\\n max_length = 0\\n for row in range(len(matrix)):\\n for col in range(len(matrix[0])):\\n length = 0\\n threshold = -1\\n found_len = longest_path_until_row_col(row, col, threshold)\\n max_length = max(max_length, found_len)\\n return max_length\\n\\n \\n \",\n \"runtime\": \"514\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":153,"string":"153"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ln_i = len(matrix)\n ln_j = len(matrix[0])\n\n path_matrix = [[1 for _ in range(ln_j)] for _ in range(ln_i)]\n\n flag = True\n while flag:\n flag = False\n for ind_i in range(ln_i):\n for ind_j in range(ln_j):\n i = matrix[ind_i][ind_j]\n prev_path_ln_i = path_matrix[ind_i][ind_j]\n path_ln_i = 1\n\n if ind_i != 0 and matrix[ind_i-1][ind_j] > i:\n path_ln_i = max(path_ln_i, path_matrix[ind_i-1][ind_j]+1)\n if ind_j != ln_j-1 and matrix[ind_i][ind_j+1] > i:\n path_ln_i = max(path_ln_i, path_matrix[ind_i][ind_j+1]+1)\n if ind_i != ln_i-1 and matrix[ind_i+1][ind_j] > i:\n path_ln_i = max(path_ln_i, path_matrix[ind_i+1][ind_j]+1)\n if ind_j != 0 and matrix[ind_i][ind_j-1] > i:\n path_ln_i = max(path_ln_i, path_matrix[ind_i][ind_j-1]+1)\n \n path_matrix[ind_i][ind_j] = path_ln_i\n if prev_path_ln_i != path_ln_i:\n flag = True\n \n Max = 0\n for ind_i in range(ln_i):\n for ind_j in range(ln_j):\n Max = max(Max, path_matrix[ind_i][ind_j])\n return Max","memory":"17165"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not len(matrix):\n return 0\n maxVal = 0\n rows = len(matrix)\n cols = len(matrix[0])\n cache = [[0 for _ in range(cols)] for _ in range(rows)]\n print(cache)\n for i in range(rows):\n for j in range(cols):\n maxVal = max(maxVal, self.subPath(matrix, i, j, rows, cols, cache))\n return maxVal\n \n def subPath(self, matrix, row, col, rows, cols, cache):\n if cache[row][col] != 0:\n return cache[row][col]\n for x, y in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n xval = row + x\n yval = col + y\n if xval >= 0 and xval < rows and yval >= 0 and yval < cols and matrix[xval][yval] > matrix[row][col]:\n cache[row][col] = max(cache[row][col], self.subPath(matrix, xval, yval, rows, cols, cache))\n cache[row][col] += 1\n return cache[row][col]\n ","memory":"17165"},{"code":"import collections\nclass Solution:\n\n def dfs(self,r,c):\n m=self.m\n n=self.n\n matrix=self.matrix\n val=matrix[r][c]\n if r >= m or r<0 or c >=n or c<0:\n return 0\n\n if self.nodes[r][c]>0:\n return self.nodes[r][c]\n\n moves=[[r+1,c],[r-1,c],[r,c+1],[r,c-1]]\n\n curr_max=0\n\n for i in range(4): # 4 moves\n next_r,next_c = moves[i]\n if next_r>=0 and next_r<m and next_c>=0 and next_c<n and matrix[next_r][next_c]>val:\n curr_max=max(curr_max, self.dfs(next_r,next_c))\n \n\n self.nodes[r][c]=curr_max+1\n\n if curr_max+1>self.max_path:\n self.max_path=curr_max+1\n\n return curr_max+1\n \n \n \n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # solution idea: dfs with each matrix block as a node\n m=self.m=len(matrix) # rows \n n=self.n=len(matrix[0]) # columns \n self.matrix=matrix\n self.nodes=[[0 for i in range(self.n)] for i in range(self.m)]\n self.max_path=0\n for i in range(m*n):\n self.dfs(i//n, i%n) # pass in row and column \n\n return self.max_path\n \n \n \n \n\n\n \n\n\n\n ","memory":"17295"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if len(matrix) == 0: return 0\n m, n = len(matrix), len(matrix[0])\n cache = [[0] * n for _ in range(m)]\n longest = 1\n for i in range(m):\n for j in range(n):\n cur_longest = self.dfs(matrix, i, j, m, n, cache)\n longest = max(longest, cur_longest)\n \n return longest\n\n def dfs(self, matrix, i, j, m, n, cache):\n if cache[i][j] != 0: return cache[i][j]\n cur_longest = 1\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n nx, ny = i+dx, j+dy\n if nx < 0 or nx >= m or ny < 0 or ny >= n or matrix[nx][ny] <= matrix[i][j]:\n continue\n length = 1 + self.dfs(matrix, nx, ny, m, n, cache)\n cur_longest = max(cur_longest, length)\n cache[i][j] = cur_longest\n return cur_longest\n ","memory":"17295"},{"code":"class Solution:\n\n def solve(self, i, j, matrix, m, n, dp):\n if dp[i][j]!=-1:\n return dp[i][j]\n ans = 0\n\n # up\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\n # right\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\n # down\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\n # left\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\n \n dp[i][j] = ans+1\n return dp[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n ans = -1\n dp = [[-1]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\n return ans","memory":"17425"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n a cell in the matrix as a node,\na directed edge from node x to node y if x and y are adjacent and x's value < y's value\nThen a graph is formed.\n\nNo cycles can exist in the graph, i.e. a DAG is formed.\n\nThe problem becomes to get the longest path in the DAG.\n\nTopological sort can iterate the vertices of a DAG in the linear ordering.\n\nUsing Kahn's algorithm(BFS) to implement topological sort while counting the levels can give us the longest chain of nodes in the DAG.\n \"\"\"\n m, n = len(matrix), len(matrix[0])\n ind = [[0] * n for _ in range(m)]\n dirs = [(1, 0), (0, 1), (-1, 0), (0, -1)]\n for i in range(m):\n for j in range(n):\n for dx, dy in dirs:\n ni, nj = i + dx, j + dy\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\n ind[ni][nj] += 1\n \n q = deque([(x, y) for x in range(m) for y in range(n) if ind[x][y] == 0])\n max_path = 0\n while q:\n max_path += 1\n for _ in range(len(q)):\n i, j = q.popleft()\n for dx, dy in dirs:\n ni, nj = i + dx, j + dy\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\n ind[ni][nj] -= 1\n if ind[ni][nj] == 0:\n q.append((ni, nj))\n return max_path\n\n\n","memory":"17425"},{"code":"class Solution:\n def dpizer(self,matrix,dp,i,j):\n val = 1\n if i != len(matrix)-1:\n if matrix[i][j] < matrix[i+1][j]:\n if dp[i+1][j] == -1:\n self.dpizer(matrix,dp,i+1,j)\n if dp[i+1][j] +1 > val:\n val = dp[i+1][j] +1\n if i != 0:\n if matrix[i][j] < matrix[i-1][j]:\n if dp[i-1][j] == -1:\n self.dpizer(matrix,dp,i-1,j)\n if dp[i-1][j] +1 > val:\n val = dp[i-1][j] +1\n if j != 0:\n if matrix[i][j] < matrix[i][j-1]:\n if dp[i][j-1] == -1:\n self.dpizer(matrix,dp,i,j-1)\n if dp[i][j-1] +1 > val:\n val = dp[i][j-1] + 1\n if j != len(matrix[0])-1:\n if matrix[i][j] < matrix[i][j+1]:\n if dp[i][j+1] == -1:\n self.dpizer(matrix,dp,i,j+1)\n if dp[i][j+1] +1 > val:\n val = dp[i][j+1] +1\n dp[i][j] = val\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = [[-1 for i in range(len(matrix[0]))] for i in range(len(matrix))]\n maxs = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if dp[i][j] != -1:\n continue\n self.dpizer(matrix,dp,i,j)\n if dp[i][j] > maxs:\n maxs = dp[i][j]\n return maxs\n\n ","memory":"17555"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n path = [[1,0], [-1, 0], [0, 1], [0, -1]]\n global record\n record = []\n for i in range(len(matrix)):\n record.append([-1]*len(matrix[0]))\n def dfs(matrix, x, y):\n step = 0\n for i in path:\n if len(matrix) > (x + i[0]) >=0 and len(matrix[0]) > (y + i[1]) >=0 and \\\n matrix[x + i[0]][y + i[1]] > matrix[x][y]:\n if record[x + i[0]][y + i[1]] == -1:\n step = max(step, 1 + dfs(matrix, x + i[0], y + i[1]))\n else:\n step = max(step,1 + record[x + i[0]][y + i[1]])\n record[x][y] = step\n return record[x][y]\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if record[i][j] == -1:\n dfs(matrix, i, j)\n output = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])): \n output = max(output, record[i][j]) \n return output + 1\n","memory":"17555"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n [\n [9,9,4],\n [6,6,8],\n [2,1,1]\n ]\n \n [\n [1,1,2],\n [2,2,1],\n [3,4,2]\n ]\n \"\"\"\n n = len(matrix)\n m = len(matrix[0])\n visited = [[0] * m for _ in range(n)]\n \n def findInceasingPath(r, c, prev):\n nonlocal n\n nonlocal m\n \n if r < 0 or r == n or c < 0 or c == m:\n return 0\n \n if matrix[r][c] <= prev:\n return 0\n \n if visited[r][c] > 0:\n return visited[r][c]\n \n maxLen = 0\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\n \n visited[r][c] = maxLen + 1\n \n return visited[r][c]\n \n \n maxPathLen = 0\n for r in range(n):\n for c in range(m):\n pathLen = findInceasingPath(r, c, -1)\n maxPathLen = max(maxPathLen, pathLen)\n \n return maxPathLen\n \n \n ","memory":"17685"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n directions = lambda x, y : [(x + 1, y), (x, y + 1), (x - 1, y), (x, y - 1)]\n dp = [ [None] * n for _ in range(m) ]\n \n def dfs(r, c):\n if dp[r][c]:\n return dp[r][c]\n dp[r][c] = 1\n for nr, nc in directions(r, c):\n if 0 <= nr < m and 0 <= nc < n and matrix[r][c] < matrix[nr][nc]:\n dp[r][c] = max(dp[r][c], 1 + dfs(nr, nc))\n return dp[r][c]\n\n return max(dfs(r, c) for r in range(m) for c in range(n))","memory":"17685"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n [\n [9,9,4],\n [6,6,8],\n [2,1,1]\n ]\n \n [\n [1,1,2],\n [2,2,1],\n [3,4,2]\n ]\n \"\"\"\n n = len(matrix)\n m = len(matrix[0])\n visited = [[0] * m for _ in range(n)]\n \n def findInceasingPath(r, c, prev):\n nonlocal n\n nonlocal m\n \n if r < 0 or r == n or c < 0 or c == m:\n return 0\n \n if matrix[r][c] <= prev:\n return 0\n \n if visited[r][c] > 0:\n return visited[r][c]\n \n maxLen = 0\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\n \n visited[r][c] = maxLen + 1\n \n return visited[r][c]\n \n \n maxPathLen = 0\n for r in range(n):\n for c in range(m):\n pathLen = findInceasingPath(r, c, -1)\n maxPathLen = max(maxPathLen, pathLen)\n \n return maxPathLen\n \n \n ","memory":"17815"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n [\n [9,9,4],\n [6,6,8],\n [2,1,1]\n ]\n \n [\n [1,1,2],\n [2,2,1],\n [3,4,2]\n ]\n \"\"\"\n n = len(matrix)\n m = len(matrix[0])\n visited = [[0] * m for _ in range(n)]\n \n def findInceasingPath(r, c, prev):\n nonlocal n\n nonlocal m\n \n if r < 0 or r == n or c < 0 or c == m:\n return 0\n \n if matrix[r][c] <= prev:\n return 0\n \n if visited[r][c] > 0:\n return visited[r][c]\n \n maxLen = 0\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\n \n visited[r][c] = maxLen + 1\n \n return visited[r][c]\n \n \n maxPathLen = 0\n for r in range(n):\n for c in range(m):\n pathLen = findInceasingPath(r, c, -1)\n maxPathLen = max(maxPathLen, pathLen)\n \n return maxPathLen\n \n \n ","memory":"17815"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n dp = [[1] * n for _ in range(m)]\n directions = ((0, 1), (1, 0), (0, -1), (-1, 0))\n def dfs(x, y):\n for ax, ay in directions:\n nx = ax + x\n ny = ay + y\n if 0 <= nx < m and 0 <= ny < n and matrix[nx][ny] > matrix[x][y]:\n if dp[nx][ny] > 1:\n dp[x][y] = max(dp[x][y], dp[nx][ny] + 1)\n else:\n dp[x][y] = max(dp[x][y], dfs(nx, ny) + 1)\n return dp[x][y]\n ans = 0\n for i in range(m):\n for j in range(n):\n if dp[i][j] == 1:\n ans = max(ans, dfs(i, j))\n return ans\n # dp = [[1] * n for _ in range(m)]\n\n # for i in range(m):\n # for j in range(n):","memory":"17945"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n m, n = len(matrix), len(matrix[0])\n # Memoization table to store the longest increasing path starting from each cell\n memo = [[-1] * n for _ in range(m)]\n \n def dfs(i, j):\n # If the result for this cell is already computed, return it\n if memo[i][j] != -1:\n return memo[i][j]\n \n # Start with length 1 (the current cell itself)\n max_len = 1\n for x, y in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n ni, nj = i + x, j + y\n # Check if the new position is valid and the value is greater than the current cell\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\n # Explore the new cell and update the max length\n max_len = max(max_len, 1 + dfs(ni, nj))\n \n # Memoize the result for the current cell\n memo[i][j] = max_len\n return memo[i][j]\n \n # Iterate over all cells and compute the longest increasing path starting from each one\n longest_path = 0\n for i in range(m):\n for j in range(n):\n longest_path = max(longest_path, dfs(i, j))\n \n return longest_path","memory":"17945"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m,n=len(matrix), len(matrix[0])\n res=[[-1]*n for _ in range(m)]\n dir=[[-1,0],[1,0],[0,-1],[0,1]]\n def dfs(x,y, visited):\n if visited[x][y]:\n return res[x][y]\n visited[x][y]=True\n path=0\n for d in dir:\n dx,dy=x+d[0],y+d[1] \n if dx>=0 and dx<m and dy>=0 and dy<n and matrix[dx][dy]>matrix[x][y]:\n path=max(path,dfs(dx,dy,visited))\n res[x][y]=path+1\n return path+1\n ret=0\n visited=[[False]*n for _ in range(m)]\n for i in range(m):\n for j in range(n):\n ret=max(ret,dfs(i,j,visited))\n return ret\n\n ","memory":"18075"},{"code":"import heapq\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [(1, 0), (-1, 0), (0, 1), (0, - 1)]\n ans = 1\n nr, nc = len(matrix), len(matrix[0])\n pq = []\n\n for r in range(nr):\n for c in range(nc):\n heapq.heappush(pq, (matrix[r][c], r, c))\n \n dp = [[1] * nc for _ in range(nr)]\n\n for val, r, c in heapq.nsmallest(len(pq), pq):\n for dr, dc in directions: \n row, col = r + dr, c + dc\n\n if nr > row >= 0 and nc > col >= 0 and matrix[row][col] < matrix[r][c]:\n dp[r][c] = max(1 + dp[row][col], dp[r][c])\n ans = max(ans, dp[r][c])\n \n return ans\n","memory":"18075"},{"code":"class Solution:\n def dfs(self, matrix, i, j):\n if not (0 <= i < len(matrix) and 0 <= j < len(matrix[0])):\n return 0\n\n if (i, j) in self.cache:\n return self.cache[(i, j)]\n\n max_path = 0\n for x, y in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n if 0 <= i+x < len(matrix) and 0 <= j+y < len(matrix[0]) and matrix[i+x][j+y] > matrix[i][j]:\n max_path = max(max_path, self.dfs(matrix, i+x, j+y))\n self.cache[(i, j)] = max_path + 1\n return max_path + 1\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n self.cache = {}\n max_so_far = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n max_so_far = max(self.dfs(matrix, i, j), max_so_far)\n return max_so_far","memory":"18205"},{"code":"# 2024/09/15\n# 面试前刷Doordash高频题\n#\n# 这题有点意思，相当于longest increasing subset的二维变种\n# 能否用DP，关键问题\n# 应该没问题，首先不会有使用同一个元素的情况，因为是严格increasing\n# 接下去问题是如何填表了，如果用Bottom up的话\n# 感觉这题用top down更合适，不用考虑填表问题\n# 那就DFS，这里问题是去重怎么弄？想起来应该是之前有讨论DFS怎么detect cycle，需要有一个visited表示当前这个path的parents，和传统的DFS的visited有点不一样\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n memo = {}\n global_max = [0]\n\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if (i, j) not in memo:\n visited = set()\n visited.add((i, j))\n self.helper(i, j, visited, memo, matrix, global_max)\n\n return global_max[0]\n\n def helper(self, row, col, visited, memo, matrix, global_max):\n if (row, col) in memo:\n return memo[(row, col)]\n\n local_max = 1\n for dx, dy in [1, 0], [-1, 0], [0, 1], [0, -1]:\n x = row + dx\n y = col + dy\n if 0 <= x < len(matrix) and 0 <= y < len(matrix[0]):\n if (x, y) in visited:\n continue\n \n if matrix[x][y] < matrix[row][col]:\n visited.add((x, y))\n local_max = max(local_max, 1 + self.helper(x, y, visited, memo, matrix, global_max))\n visited.remove((x, y))\n\n memo[(row, col)] = local_max\n global_max[0] = max(global_max[0], local_max)\n\n return local_max","memory":"18335"},{"code":"class Solution:\n def dp(self, i, j):\n key = (i, j)\n if key in self.cache:\n return self.cache[key]\n ans = 0\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0]]:\n a = i + di\n b = j + dj\n if a < 0 or a >= self.m or b < 0 or b >= self.n:\n continue\n if self.matrix[i][j] <= self.matrix[a][b]:\n continue\n ans = max(ans, self.dp(a, b))\n ans += 1\n self.cache[key] = ans\n return ans\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n self.matrix = matrix\n self.m = len(matrix)\n self.n = len(matrix[0])\n self.cache = {}\n ans = 0\n for i in range(self.m):\n for j in range(self.n):\n ans = max(ans, self.dp(i, j))\n return ans","memory":"18335"},{"code":"class Solution:\n\n def helper(self,i,j,c,m,s):\n\n\n\n if(i >= 0 and i < len(m) and j >= 0 and j < len(m[0]) and m[i][j] > c ):\n\n if((i,j) in s):\n\n return s[(i,j)]\n\n s[(i,j)] = max(self.helper(i+1,j,m[i][j],m,s),\n self.helper(i-1,j,m[i][j],m,s),\n self.helper(i,j+1,m[i][j],m,s),\n self.helper(i,j-1,m[i][j],m,s)) + 1 \n \n return s[(i,j)]\n \n else:\n\n return 0 \n\n \n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n s = {}\n max_ = float('-inf')\n for i in range(0,len(matrix)):\n for j in range(0,len(matrix[0])):\n max_ = max(max_,self.helper(i,j,-1,matrix,s))\n \n return max_ \n ","memory":"18465"},{"code":"class Solution:\n dictionary = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dp = [[-1 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n self.longestIncreasingPathHelper(matrix, dp, i, j)\n res = max(res, dp[i][j])\n return res\n \n \n def longestIncreasingPathHelper(self, matrix: List[List[int]], dp: List[List[int]], r: int, c: int):\n dp[r][c] = 1\n for dir_x, dir_y in self.dictionary:\n new_r, new_c = dir_x + r, dir_y + c\n if (0 <= new_r < len(matrix) and 0 <= new_c < len(matrix[0])):\n if matrix[new_r][new_c] > matrix[r][c]:\n if dp[new_r][new_c] == -1:\n self.longestIncreasingPathHelper(matrix, dp, new_r, new_c)\n dp[r][c] = max(dp[r][c], 1 + dp[new_r][new_c])","memory":"18465"},{"code":"class Solution:\n def checkValid(self, i, j, n, m):\n if i>=0 and i<n and j>=0 and j<m:\n return True\n return False\n\n def dp(self, matrix, i, j): # longest incr path starting at (i, j)\n if self.mat[i][j] != -1:\n return self.mat[i][j]\n n = len(matrix)\n m = len(matrix[0])\n longestPath = 1\n for dir in self.dirs:\n x = i + dir[0]\n y = j + dir[1]\n if self.checkValid(x, y, n, m) and matrix[x][y] > matrix[i][j]:\n longestPath = max(longestPath, 1 + self.dp(matrix, x, y))\n self.mat[i][j] = longestPath\n return self.mat[i][j]\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n self.dirs = [[0, -1], [0, 1], [1, 0], [-1, 0]]\n self.mat = []\n n = len(matrix)\n m = len(matrix[0])\n for i in range(n):\n row = []\n for j in range(m):\n row.append(-1)\n self.mat.append(row)\n maxLen = 1\n for i in range(n):\n for j in range(m):\n maxLen = max(maxLen, self.dp(matrix, i, j))\n # print (self.mat)\n return maxLen\n \n\n\n\n\n ","memory":"18595"},{"code":"from typing import List\n\nclass Solution:\n def __init__(self):\n self.dirs = ((0, 1), (0, -1), (1, 0), (-1, 0))\n self.n = 0\n self.m = 0\n self.cache = []\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n self.n, self.m = len(matrix), len(matrix[0])\n self.cache = [[0] * self.m for _ in range(self.n)]\n\n ans = 0\n\n for i in range(self.n):\n for j in range(self.m):\n ans = max(ans, self.dfs(matrix, i, j))\n return ans\n\n def dfs(self, matrix: List[List[int]], i: int, j: int) -> int:\n if self.cache[i][j] != 0:\n return self.cache[i][j]\n \n max_length = 1\n for dir in self.dirs:\n x, y = dir[0] + i, dir[1] + j\n if 0 <= x < self.n and 0 <= y < self.m and matrix[x][y] > matrix[i][j]:\n max_length = max(max_length, 1 + self.dfs(matrix, x, y))\n \n self.cache[i][j] = max_length\n return self.cache[i][j]\n","memory":"18725"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n mem_matrix = [[0 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n largest_count = 0\n \n def dfs(i, j):\n if mem_matrix[i][j] != 0:\n return mem_matrix[i][j]\n \n max_count = 1\n \n for direction in directions:\n new_i, new_j = i+direction[0], j+direction[1]\n if new_i < 0 or new_i==len(matrix):\n continue\n if new_j < 0 or new_j==len(matrix[0]):\n continue\n if matrix[i][j] >= matrix[new_i][new_j]:\n continue\n max_count = max(max_count, dfs(new_i, new_j) + 1)\n \n \n mem_matrix[i][j] = max_count\n \n return max_count\n \n \n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n largest_count = max(largest_count, dfs(i, j))\n \n \n \n return largest_count\n \n \n ","memory":"18725"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n longestPaths = [[0] * COLS for _ in range(ROWS)]\n\n def getLongestPath(r, c, prev):\n if min(r, c) < 0 or r == ROWS or c == COLS or matrix[r][c] <= prev:\n return 0 \n if longestPaths[r][c] != 0:\n return longestPaths[r][c]\n\n longestPaths[r][c] = 1\n for dr, dc in [(0, 1), (0, -1), (-1, 0), (1, 0)]:\n longestPaths[r][c] = max(longestPaths[r][c],\n 1 + getLongestPath(r + dr, c + dc, matrix[r][c]))\n return longestPaths[r][c]\n \n res = 1\n for r in range(ROWS):\n for c in range(COLS):\n res = max(res, getLongestPath(r, c, -1))\n return res","memory":"18855"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [(0,1), (0,-1), (1,0), (-1,0)]\n \n m, n = len(matrix), len(matrix[0])\n \n dp = [[-1 for _ in range(n)] for _ in range(m)]\n \n def dfs(x, y):\n if dp[x][y] != -1:\n return dp[x][y]\n \n max_path = 1\n \n for direction in directions:\n new_x, new_y = x + direction[0], y + direction[1]\n \n if 0 <= new_x < m and 0 <= new_y < n:\n if matrix[new_x][new_y] > matrix[x][y]:\n max_path = max(max_path, 1 + dfs(new_x, new_y))\n \n dp[x][y] = max_path\n return dp[x][y]\n \n max_length = 0\n for i in range(m):\n for j in range(n):\n max_length = max(max_length, dfs(i, j))\n \n return max_length","memory":"18855"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n longest_path = 0\n rows = len(matrix)\n cols = len(matrix[0])\n cache = [[None] * cols for _ in range(rows)]\n \n def dfs(x: int, y: int) -> int:\n if cache[x][y]:\n return cache[x][y]\n longest_path = 0\n for i, j in [(0,1),(0,-1),(1,0),(-1,0)]:\n newX, newY = x+i, y+j\n if newX >= 0 and newX < rows and newY >= 0 and newY < cols and matrix[newX][newY] > matrix[x][y]:\n longest_path = max(longest_path, dfs(newX, newY))\n cache[x][y] = longest_path + 1\n return cache[x][y]\n \n for x in range(rows):\n for y in range(cols):\n longest_path = max(longest_path, dfs(x, y))\n \n return longest_path","memory":"18985"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n \n memo = [[0] * cols for _ in range(rows)]\n longest = 0\n \n def dfs(r,c):\n if memo[r][c] != 0:\n return memo[r][c]\n \n length = 1\n \n for dx, dy in (0,1), (0,-1), (1,0), (-1,0):\n nr = dx + r\n nc = dy + c\n if (0 <= nr < rows and 0 <= nc < cols and\n matrix[nr][nc] > matrix[r][c]):\n length = max(length, 1 + dfs(nr,nc))\n memo[r][c] = length\n return length\n \n for r in range(rows):\n for c in range(cols):\n longest = max(longest, dfs(r,c))\n \n return longest\n \n \n ","memory":"18985"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n h = len(matrix)\n w = len(matrix[0])\n\n dp = [[-1 for _ in range(w)] for _ in range(h)] # Initialize with -1 to indicate unvisited\n dc = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n def dfs(i, j, pr = -1):\n if i < 0 or i >= h or j < 0 or j >= w or matrix[i][j] <= pr:\n return 0 # Invalid move, so return 0 as no path\n\n if dp[i][j] != -1:\n return dp[i][j] # Return the cached value if it exists\n\n max_path = 1 # Start with length 1 (the current cell)\n \n for d in dc:\n max_path = max(max_path, 1 + dfs(i + d[0], j + d[1], matrix[i][j]))\n\n dp[i][j] = max_path # Cache the result in dp table\n return max_path\n \n res = 0\n for i in range(h):\n for j in range(w):\n res = max(res, dfs(i, j))\n \n return res\n","memory":"19115"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n h = len(matrix)\n w = len(matrix[0])\n\n dp = [[-1 for _ in range(w)] for _ in range(h)] # Initialize with -1 to indicate unvisited\n dc = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n def dfs(i, j, pr = -1):\n if i < 0 or i >= h or j < 0 or j >= w or matrix[i][j] <= pr:\n return 0 # Invalid move, so return 0 as no path\n\n if dp[i][j] != -1:\n return dp[i][j] # Return the cached value if it exists\n\n max_path = 1 # Start with length 1 (the current cell)\n \n for d in dc:\n max_path = max(max_path, 1 + dfs(i + d[0], j + d[1], matrix[i][j]))\n\n dp[i][j] = max_path # Cache the result in dp table\n return max_path\n \n res = 0\n for i in range(h):\n for j in range(w):\n res = max(res, dfs(i, j))\n \n return res\n","memory":"19115"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n self.n = len(matrix)\n self.m = len(matrix[0])\n max_len = 0\n cache = [[0 for _ in range(self.m)] for _ in range(self.n)]\n for i in range(self.n):\n for j in range(self.m):\n max_len = max(self.dfs(i, j, matrix, cache), max_len)\n return max_len\n \n def dfs(self, i:int, j:int, matrix: List[List[int]], cache:List[List[int]])-> int:\n dir_list = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n \n if (cache[i][j] != 0):\n return cache[i][j]\n \n for d in dir_list:\n x = i + d[0]\n y = j + d[1]\n if (0 <= x and x < self.n and 0 <= y and y < self.m and matrix[x][y] > matrix[i][j]):\n cache[i][j] = max(self.dfs(x, y, matrix, cache), cache[i][j])\n \n cache[i][j] +=1\n \n return cache[i][j]\n ","memory":"19245"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n directions = [[0,-1], [0,1], [1,0], [-1,0]]\n def _dfs(r, c, memo):\n if (r, c) in memo:\n return memo[(r, c)]\n \n m = 1\n for rn, cn in directions:\n if (\n r + rn < len(matrix) and r + rn >= 0 and\n c + cn < len(matrix[0]) and c + cn >= 0 and\n matrix[r + rn][c + cn] > matrix[r][c]\n ):\n steps = 1 + _dfs(r + rn, c + cn, memo)\n m = max(m, steps)\n \n memo[(r, c)] = m\n return memo[(r, c)]\n \n if not matrix:\n return 0\n \n res = []\n memo = {}\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n res.append(_dfs(r, c, memo))\n \n return max(res)\n \n \n \n ","memory":"19245"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n c_long = 1\n memeoize = {}\n\n def dfs(i, j, memoize):\n nonlocal c_long\n if (i, j) not in memoize:\n \n res = 0\n for x,y in [(0,1), (0, -1), (1, 0), (-1, 0)]:\n nx, ny = x + i, y + j\n if 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] > matrix[i][j]:\n res = max(res, dfs(nx, ny, memoize))\n memoize[(i,j)] = 1 + res\n c_long = max(c_long, memoize[(i,j)])\n return memoize[(i,j)]\n \n\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dfs(i, j, memeoize)\n\n \n return c_long\n ","memory":"19375"},{"code":"r'''\n# Requirements\n\nm = len(matrix), n = len(matrix[i])\n1 <= m, n <= 200\n0 <= matrix[i] <= 2^31 - 1\n\n# Edge cases\n\n1. No increasing paths\n\n# Solutions\n\n1. Brute force, backtracking\n - O(mn * mn) time, O(mn) auxiliary space\n2. Topological sort\n - O(mn) time, O(mn) auxiliary space\n\n9 9 4\n6 8 8\n2 1 1\n'''\nDIRECTIONS = [(1, 0), (0, -1), (-1, 0), (0, 1)]\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n # Construct adjacency lists and count indegrees\n adj_lists = [[[] for _ in range(cols)] for _ in range(rows)]\n indegrees = [[0 for _ in range(cols)] for _ in range(rows)]\n\n for r in range(rows):\n for c in range(cols):\n for dr, dc in DIRECTIONS:\n nr, nc = r + dr, c + dc\n if nr < 0 or nr >= rows or nc < 0 or nc >= cols or matrix[nr][nc] <= matrix[r][c]:\n continue\n\n adj_lists[r][c].append((nr, nc))\n indegrees[nr][nc] += 1\n\n # Find longest increasing path\n sources, max_length = deque(), 0\n\n for r in range(rows):\n for c in range(cols):\n if indegrees[r][c] == 0 and adj_lists[r][c]:\n sources.append((r, c))\n\n while sources:\n max_length += 1\n for _ in range(len(sources)):\n r, c = sources.popleft()\n\n for nr, nc in adj_lists[r][c]:\n indegrees[nr][nc] -= 1\n\n if indegrees[nr][nc] == 0:\n sources.append((nr, nc))\n\n return max(max_length, 1)","memory":"19505"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n 1. Brute force: DFS from every node and calc the length of increasing path\n O(n^2)\n\n 2. just memoize the result before returning to avoid re-computation O(n)\n \"\"\"\n\n visited = set()\n ans = 0\n m = len(matrix)\n n = len(matrix[0])\n memo = {}\n\n for i in range(m):\n for j in range(n):\n if (i,j) not in memo:\n currLen = self.dfs(i,j, matrix, memo)\n ans = max(currLen, ans)\n return ans\n \n def dfs(self, row, col, matrix, memo):\n m, n = len(matrix), len(matrix[0])\n if (row, col) not in memo:\n currLen = 1\n ans = 1\n directions = [(0,1),(0,-1),(-1,0), (1,0)]\n # explore children\n for dx,dy in directions:\n nx,ny = row+dx, col+dy\n if 0<=nx<m and 0<=ny<n and (nx,ny) and matrix[nx][ny]>matrix[row][col]:\n currLen = 1 + self.dfs(nx,ny, matrix, memo)\n ans = max(ans, currLen)\n memo[(row,col)] = ans\n return memo[(row,col)]\n \n ","memory":"19635"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n # Initialize memoization dictionary\n seen = {}\n \n # Dimensions of the matrix\n m, n = len(matrix), len(matrix[0])\n\n # Find the longest increasing path starting from each cell\n longest_path = 0\n for i in range(m):\n for j in range(n):\n longest_path = max(longest_path, self.dfs(matrix, i, j, seen))\n \n return longest_path\n\n def inBounds(self, matrix: List[List[int]], i: int, j: int) -> bool:\n # Check if the indices are within the matrix bounds\n return 0 <= i < len(matrix) and 0 <= j < len(matrix[0])\n\n def dfs(self, matrix: List[List[int]], i: int, j: int, seen: dict) -> int:\n # If already computed the result for this cell, return it\n if (i, j) in seen:\n return seen[(i, j)]\n \n # Define the possible directions (up, down, left, right)\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n max_path = 1 # The path length at least includes the current cell\n \n for di, dj in directions:\n ni, nj = i + di, j + dj\n if self.inBounds(matrix, ni, nj) and matrix[ni][nj] > matrix[i][j]:\n max_path = max(max_path, 1 + self.dfs(matrix, ni, nj, seen))\n \n # Memoize the result for the current cell\n seen[(i, j)] = max_path\n return max_path\n","memory":"19765"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n directions = [[0,-1], [0,1], [1,0], [-1,0]]\n def _dfs(r, c, memo):\n if (r, c) in memo:\n return memo[(r, c)]\n \n paths = [1]\n for rn, cn in directions:\n if (\n r + rn < len(matrix) and r + rn >= 0 and\n c + cn < len(matrix[0]) and c + cn >= 0 and\n matrix[r + rn][c + cn] > matrix[r][c]\n ):\n curr = 1 + _dfs(r + rn, c + cn, memo)\n paths.append(curr)\n \n memo[(r, c)] = max(paths)\n return memo[(r, c)]\n \n if not matrix:\n return 0\n \n res = []\n memo = {}\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n res.append(_dfs(r, c, memo))\n \n # print(res)\n # print(memo)\n return max(res)\n \n \n \n ","memory":"19765"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n m, n = len(matrix), len(matrix[0])\n cache = [[-1] * n for _ in range(m)]\n \n def dfs(i, j, prev_val):\n if i < 0 or i >= m or j < 0 or j >= n or matrix[i][j] <= prev_val:\n return 0\n \n if cache[i][j] != -1:\n return cache[i][j]\n \n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n max_path = 1\n \n for dx, dy in directions:\n x, y = i + dx, j + dy\n max_path = max(max_path, 1 + dfs(x, y, matrix[i][j]))\n \n cache[i][j] = max_path\n return max_path\n \n max_length = 0\n for i in range(m):\n for j in range(n):\n max_length = max(max_length, dfs(i, j, -1))\n \n return max_length\n\n# Example usage:\nsolution = Solution()\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\nprint(solution.longestIncreasingPath(matrix)) # Output: 4","memory":"19895"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix:\n return 0\n \n rows, cols = len(matrix), len(matrix[0])\n cache = [[-1] * cols for _ in range(rows)]\n \n def dfs(i, j, prev):\n if i < 0 or i >= rows or j < 0 or j >= cols or matrix[i][j] <= prev:\n return 0\n \n if cache[i][j] != -1:\n return cache[i][j]\n \n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n max_length = 1\n for dx, dy in directions:\n x, y = i + dx, j + dy\n max_length = max(max_length, 1 + dfs(x, y, matrix[i][j]))\n \n cache[i][j] = max_length\n return max_length\n \n max_path = 1\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j, -1))\n \n return max_path\n\n# Example usage:\nsolution = Solution()\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\n\nmatrix = [[3,4,5],[3,2,6],[2,2,1]]\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\n\nmatrix = [[1]]\nprint(solution.longestIncreasingPath(matrix)) # Output: 1","memory":"19895"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n graph = defaultdict(list)\n indegrees = [0] * (m * n)\n\n for r in range(m):\n for c in range(n):\n for nr, nc in [(r, c-1), (r, c+1), (r-1, c), (r+1, c)]:\n if 0 <= nr < m and 0 <= nc < n and matrix[nr][nc] > matrix[r][c]:\n graph[r*n+c].append(nr*n+nc)\n indegrees[nr*n+nc] += 1\n \n queue = deque([i for i in range(m*n) if indegrees[i] == 0])\n path_lengths = [1] * (m * n)\n\n while queue:\n u = queue.popleft()\n for v in graph[u]:\n indegrees[v] -= 1\n if indegrees[v] == 0:\n queue.append(v)\n path_lengths[v] = max(path_lengths[v], path_lengths[u] + 1)\n\n return max(path_lengths)","memory":"20025"},{"code":"from collections import deque\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n def get_neighbors(matrix, node):\n m, n = len(matrix), len(matrix[0])\n i, j = node\n neighbors = []\n if (i+1 < m) and (matrix[i+1][j] > matrix[i][j]):\n neighbors.append((i+1, j))\n\n if (i-1 >= 0) and (matrix[i-1][j] > matrix[i][j]):\n neighbors.append((i-1, j))\n\n if (j+1 < n) and (matrix[i][j+1] > matrix[i][j]):\n neighbors.append((i, j+1))\n\n if (j-1 >= 0) and (matrix[i][j-1] > matrix[i][j]):\n neighbors.append((i, j-1))\n \n return neighbors\n\n\n def dfs(source, finishing_time, visited):\n \n visited.add(source)\n\n for neighbor in get_neighbors(matrix, source):\n if neighbor not in visited:\n dfs(neighbor, finishing_time, visited)\n\n finishing_time.append(source)\n\n\n def find_topological_order(matrix):\n m, n = len(matrix), len(matrix[0])\n visited = set()\n finishing_time = []\n \n for i in range(m):\n for j in range(n):\n if (i,j) not in visited:\n dfs((i,j), finishing_time, visited)\n\n return list(reversed(finishing_time))\n\n\n\n # Find The Longest Path in DAG\n topological_order = find_topological_order(matrix)\n\n m, n = len(matrix), len(matrix[0])\n longest_path = {}\n for i in range(m):\n for j in range(n):\n longest_path[(i,j)] = 1\n\n for u in topological_order:\n for v in get_neighbors(matrix, u):\n if longest_path[v] < 1 + longest_path[u]:\n longest_path[v] = 1 + longest_path[u]\n \n return max(longest_path.values())\n\n\n\n\n\n\n\n\n\n\n","memory":"20155"},{"code":"class Solution:\n def longestIncreasingPath(self, g: List[List[int]]) -> int:\n def dfs(g,i,j,e):\n if i<0 or j<0 or i>=len(g) or j>=len(g[0]) or g[i][j]<=e:\n return 0\n if (i,j) in d:\n return d[(i,j)]\n k1=1+dfs(g,i-1,j,g[i][j])\n k2=1+dfs(g,i+1,j,g[i][j])\n k3=1+dfs(g,i,j+1,g[i][j])\n k4=1+dfs(g,i,j-1,g[i][j])\n d[(i,j)]=max(k1,k2,k3,k4)\n return max(k1,k2,k3,k4)\n \n \n \n max_len=1\n d={}\n for i in range(len(g)):\n for j in range(len(g[0])):\n \n c1=1+dfs(g,i-1,j,g[i][j])\n c2=1+dfs(g,i+1,j,g[i][j])\n c3=1+dfs(g,i,j+1,g[i][j])\n c4=1+dfs(g,i,j-1,g[i][j])\n \n if max(c1,c2,c3,c4)>max_len:\n max_len=max(c1,c2,c3,c4)\n return max_len","memory":"20155"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n size = m * n\n g = defaultdict(list)\n\n def add(a,b):\n g[a].append(b)\n \n def toSingle(i,j):\n return i * n + j\n \n for i in range(m):\n for j in range(n):\n if i - 1 >= 0 and matrix[i-1][j] > matrix[i][j]:\n add(toSingle(i,j), toSingle(i-1,j))\n if i + 1 < m and matrix[i+1][j] > matrix[i][j]:\n add(toSingle(i,j), toSingle(i+1,j))\n if j - 1 >= 0 and matrix[i][j-1] > matrix[i][j]:\n add(toSingle(i,j), toSingle(i,j-1))\n if j+1 < n and matrix[i][j+1] > matrix[i][j]:\n add(toSingle(i,j), toSingle(i,j+1))\n degree = [0]*size\n q = deque()\n for k,arr in g.items():\n # print(k,arr)\n for v in arr:\n degree[v] += 1\n dis = [1]*size\n for i, cnt in enumerate(degree):\n if cnt == 0:\n q.append((i, 1))\n dis[i] = 1\n \n while q:\n node, distance = q.popleft()\n for nei in g[node]:\n if distance + 1 > dis[nei]:\n dis[nei] = distance + 1\n q.append((nei, dis[nei]))\n # print(dis)\n return max(dis)\n\n \n","memory":"20285"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n adj = defaultdict(list)\n ins = [0] * (m * n)\n\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\n\n for i in range(m):\n for j in range(n):\n value = matrix[i][j]\n currIdx = i * n + j\n\n for d in dir:\n x, y = i + d[0], j + d[1]\n\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\n newIdx = x * n + y\n\n adj[currIdx].append(newIdx)\n ins[newIdx] += 1\n \n q = deque()\n for i in range(m*n):\n if ins[i] == 0:\n q.append((i, 1))\n \n ans = 0\n\n while q:\n node, dst = q.popleft()\n ans = max(ans, dst)\n\n for u in adj[node]:\n ins[u] -= 1\n\n if ins[u] == 0:\n q.append((u, dst + 1))\n \n return ans\n\n \n def isValid(self, x, y, m, n):\n return 0 <= x < m and 0 <= y < n","memory":"20415"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n adj = defaultdict(list)\n ins = [0] * (m * n)\n\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\n\n for i in range(m):\n for j in range(n):\n value = matrix[i][j]\n currIdx = i * n + j\n\n for d in dir:\n x, y = i + d[0], j + d[1]\n\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\n newIdx = x * n + y\n\n adj[currIdx].append(newIdx)\n ins[newIdx] += 1\n \n q = deque()\n for i in range(m*n):\n if ins[i] == 0:\n q.append((i, 1))\n \n ans = 0\n\n while q:\n node, dst = q.popleft()\n ans = max(ans, dst)\n\n for u in adj[node]:\n ins[u] -= 1\n\n if ins[u] == 0:\n q.append((u, dst + 1))\n \n return ans\n\n \n def isValid(self, x, y, m, n):\n return 0 <= x < m and 0 <= y < n","memory":"20415"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n adj = defaultdict(list)\n ins = [0] * (m * n)\n\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\n\n for i in range(m):\n for j in range(n):\n value = matrix[i][j]\n currIdx = i * n + j\n\n for d in dir:\n x, y = i + d[0], j + d[1]\n\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\n newIdx = x * n + y\n\n adj[currIdx].append(newIdx)\n ins[newIdx] += 1\n \n q = deque()\n for i in range(m * n):\n if ins[i] == 0:\n q.append((i, 1))\n \n ans = 0\n\n while q:\n node, dst = q.popleft()\n ans = dst\n\n for u in adj[node]:\n ins[u] -= 1\n\n if ins[u] == 0:\n q.append((u, dst + 1))\n \n return ans\n\n \n def isValid(self, x, y, m, n):\n return 0 <= x < m and 0 <= y < n","memory":"20545"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n UNPROCCESSED = 0\n PROCESSED = 1\n m,n = len(matrix), len(matrix[0])\n dirs = [(1,0), (-1,0), (0,1), (0,-1)]\n state = [[UNPROCCESSED] * n for i in range(m)]\n toposort = []\n def dfs(i,j):\n for dx,dy in dirs:\n newI,newJ = i+dx,j+dy\n if 0 <= newI < m and 0 <= newJ < n:\n if state[newI][newJ] == UNPROCCESSED and matrix[newI][newJ] > matrix[i][j]:\n state[newI][newJ] = PROCESSED\n dfs(newI, newJ)\n toposort.append((i,j))\n for i in range(m):\n for j in range(n):\n if state[i][j] == UNPROCCESSED:\n state[i][j] = PROCESSED\n dfs(i,j)\n dp = [[0] * n for i in range(m)]\n ans = 0\n for i,j in toposort:\n for dx,dy in dirs:\n newI,newJ = i+dx,j+dy\n if 0 <= newI < m and 0 <= newJ < n and matrix[newI][newJ] > matrix[i][j]:\n dp[i][j] = max(dp[i][j], dp[newI][newJ])\n dp[i][j] += 1\n ans = max(dp[i][j], ans)\n return ans","memory":"20545"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n directions = [[0,-1], [0,1], [1,0], [-1,0]]\n def _dfs(r, c, memo):\n if (r, c) in memo:\n return memo[(r, c)]\n \n paths = {1}\n for rn, cn in directions:\n if (\n r + rn < len(matrix) and r + rn >= 0 and\n c + cn < len(matrix[0]) and c + cn >= 0 and\n matrix[r + rn][c + cn] > matrix[r][c]\n ):\n curr = 1 + _dfs(r + rn, c + cn, memo)\n paths.add(curr)\n \n memo[(r, c)] = max(paths)\n return memo[(r, c)]\n \n if not matrix:\n return 0\n \n res = []\n memo = {}\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n res.append(_dfs(r, c, memo))\n \n return max(res)\n \n \n \n ","memory":"20675"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows,cols=len(matrix),len(matrix[0])\n dp={}\n def dfs(r,c,pre):\n if (r<0 or r==rows or c==cols or c<0 or matrix[r][c]<=pre):\n return 0\n if (r,c) in dp:\n return dp[(r,c)]\n res=1\n res=max(res,1+dfs(r+1,c,matrix[r][c]))\n res=max(res,1+dfs(r,c+1,matrix[r][c]))\n res=max(res,1+dfs(r-1,c,matrix[r][c]))\n res=max(res,1+dfs(r,c-1,matrix[r][c]))\n dp[(r,c)]=res\n return res\n for r in range(rows):\n for c in range(cols):\n dfs(r,c,-1)\n return max(dp.values())\n\n \n\n\n ","memory":"20935"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n dp = {}\n def dfs(r, c, prevVal):\n if r < 0 or r == rows or c < 0 or c == cols or matrix[r][c] <= prevVal:\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n res = 1\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\n dp[(r, c)] = res\n return res\n for r in range(rows):\n for c in range(cols):\n dfs(r, c, -1)\n return max(dp.values())\n\n\n \"\"\"rows, cols in the using matrix, matrix[0]\n dp = {} storing the values r, c, max values return values.\n res = 1 atleast 1 is possible to the longest incresing path\n same like res = max(res, 1 + dfs(r + 1, c, matrix[r][c])) ->> 1 + dfs means add 1\n after that dp[(r, c)] = res .. dp rows, cols values are the res\n LAST max(dp.values) which path logest then print.\n \"\"\"\n","memory":"21065"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n dirs = [-1,0,1,0,-1]\n dp = {} # (row, col)\n def dfs(row: int, col: int) -> int:\n if (row, col) in dp:\n return dp[(row, col)]\n length = 1\n for d in range(4):\n r, c = row+dirs[d], col+dirs[d+1]\n if 0<=r<m and 0<=c<n and matrix[r][c] > matrix[row][col]:\n length = max(length, 1 + dfs(r, c))\n dp[(row, col)] = length\n return length\n length = 1\n for row in range(m):\n for col in range(n):\n length = max(length, dfs(row, col))\n return length","memory":"21065"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n @cache\n def dfs(x, y):\n count = 1\n seen.add((x, y))\n for xx, yy in ((-1, 0), (1, 0), (0, -1), (0, 1)):\n nx, ny = x + xx, y + yy\n if (nx, ny) not in seen and 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] < matrix[x][y]:\n count = max(count, 1 + dfs(nx, ny))\n seen.remove((x, y))\n return count\n seen = set()\n count = 0\n for a in range(len(matrix)):\n for b in range(len(matrix[0])):\n count = max(count, dfs(a, b))\n return count\n ","memory":"21195"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = {}\n\n def dfs(r, c, prev):\n if (\n r not in range(ROWS) or\n c not in range(COLS) or\n matrix[r][c] <= prev\n ):\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n \n dp[(r, c)] = (\n 1 + max(\n dfs(r + 1, c, matrix[r][c]),\n dfs(r - 1, c, matrix[r][c]),\n dfs(r, c + 1, matrix[r][c]),\n dfs(r, c - 1, matrix[r][c]),\n )\n )\n return dp[(r, c)]\n \n res = 0\n for r in range(ROWS):\n for c in range(COLS):\n res = max(res, dfs(r, c, -1))\n return res","memory":"21195"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS = len(matrix)\n COLS = len(matrix[0])\n dp = {} #(r, c) -> lip\n \n def dfs(r, c, prevVal):\n if (r < 0 or r == ROWS) or (c < 0 or c == COLS) or matrix[r][c] <= prevVal:\n return 0\n \n if (r, c) in dp:\n return dp[(r, c)]\n curr = matrix[r][c]\n res = 1\n res = max(res, 1 + dfs(r + 1, c, curr))\n res = max(res, 1 + dfs(r - 1, c, curr))\n res = max(res, 1 + dfs(r, c + 1, curr))\n res = max(res, 1 + dfs(r, c - 1, curr))\n\n dp[(r, c)] = res\n\n return res\n\n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1)\n\n return max(dp.values())","memory":"21325"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n dirs=[[0,1],[1,0],[0,-1],[-1,0]]\n m,n=len(matrix),len(matrix[0])\n\n @cache\n def dfs(r,c):\n steps=1\n for d in dirs:\n nr,nc=r+d[0],c+d[1]\n if nr<0 or nr>m-1 or nc<0 or nc>n-1: continue\n if matrix[r][c]>=matrix[nr][nc]: continue\n steps=max(steps, 1+dfs(nr,nc))\n return steps\n\n res=-1\n for r in range(m):\n for c in range(n):\n res=max(res, dfs(r,c))\n return res","memory":"21325"},{"code":"class Solution:\n def __init__(self):\n self.cache = {}\n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n longestPath = 0\n for i in range(m):\n for j in range(n):\n longestPath = max(longestPath, self.exploreOptions(matrix, i, j, -1)) # (matrix, i, j, prevValue)\n\n return longestPath\n \n def exploreOptions(self, matrix, i, j, prevValue):\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]) or matrix[i][j] <= prevValue:\n return 0\n\n if (i,j,prevValue) in self.cache:\n return self.cache[(i,j,prevValue)]\n\n left = self.exploreOptions(matrix, i, j-1, matrix[i][j])\n right = self.exploreOptions(matrix, i, j+1, matrix[i][j])\n up = self.exploreOptions(matrix, i-1, j, matrix[i][j])\n down = self.exploreOptions(matrix, i+1, j, matrix[i][j])\n\n self.cache[(i,j,prevValue)] = max(left, right, up, down) + 1\n return self.cache[(i,j,prevValue)]","memory":"21455"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n dp = {} # Dictionary to store the length of the longest path starting from each cell\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]] # Possible directions (down, up, right, left)\n \n def dfs(r, c):\n if (r, c) in dp:\n return dp[(r, c)]\n \n longest = 1 # The path starting from the current cell is at least 1 (itself)\n for dr, dc in directions:\n nr, nc = r + dr, c + dc\n if 0 <= nr < rows and 0 <= nc < cols and matrix[nr][nc] > matrix[r][c]:\n longest = max(longest, 1 + dfs(nr, nc))\n \n dp[(r, c)] = longest\n return longest \n \n res = 0\n for r in range(rows):\n for c in range(cols):\n res = max(res, dfs(r, c))\n \n return res\n","memory":"21455"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n def findMax(i, j): \n if dp[i][j] != -1:\n return dp[i][j]\n dir = [[0,1], [0,-1], [1,0], [-1,0]]\n max_neighbour = 0\n for x, y in dir:\n a = i + x\n b = j + y\n if not (0 <= a < m) or not (0 <= b < n):\n continue\n if matrix[a][b] > matrix[i][j]:\n max_neighbour = max(max_neighbour, findMax(a,b))\n dp[i][j] = 1 + max_neighbour\n return dp[i][j]\n\n m = len(matrix)\n n = len(matrix[0])\n max_len = 0\n dp = [[-1 for _ in range(n)] for _ in range(m)]\n for i in range(m):\n for j in range(n):\n max_len = max (max_len, findMax(i, j))\n \n return max_len\n ","memory":"21585"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ans = 0\n visited = set()\n M = len(matrix)\n N = len(matrix[0])\n longest = {}\n\n # create an array which has longest inc path starting at (i, j)\n # need to pop the answer back through the dfs calls\n\n def dfs(i, j, prev):\n # check\n if (i < 0 or j < 0 or\n i >= M or j >= N or\n matrix[i][j] <= prev):\n return 0\n \n # if we already searched this path\n if (i, j) in longest:\n return longest[(i, j)]\n\n max_len = 0\n \n # search directions\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n for d1, d2 in directions:\n # need to return max path\n temp = dfs(i + d1, j + d2, matrix[i][j])\n max_len = max(temp, max_len)\n \n longest[(i, j)] = 1 + max_len\n \n return 1 + max_len\n \n ans = 0\n\n for i in range(M):\n for j in range(N):\n temp = dfs(i, j, -1)\n ans = max(ans, temp)\n\n print(longest)\n return ans\n\n \n\n\n\n ","memory":"21715"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n M, N = len(matrix), len(matrix[0])\n dirs = [(0,1), (1,0), (0,-1), (-1,0)]\n @cache\n def dfs(r,c):\n curr = matrix[r][c]\n ans = 1\n for dr, dc in dirs:\n nr = r+dr\n nc = c+dc\n if 0 <= nr < M and 0 <= nc < N and matrix[nr][nc] > curr:\n ans = max(ans, 1 + dfs(nr,nc))\n return ans\n return max(dfs(i,j) for j in range(N) for i in range(M)) \n\n ","memory":"21845"},{"code":"dirs = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n @cache\n def dfs(i, j):\n if i < 0 or i >= m or j < 0 or j >= n:\n return 0\n cand = [dfs(i+x, j+y) for x, y in dirs if 0 <= i+x < m and 0 <= j+y < n and matrix[i+x][j+y] > matrix[i][j]]\n return 1 + max(cand) if cand else 1\n self.res = float('-inf')\n for i in range(m):\n for j in range(n):\n self.res = max(self.res, dfs(i, j))\n return self.res\n","memory":"21845"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n res = [[1 for j in range(len(matrix[0]))] for i in range(len(matrix))] # longest starting from i,j\n\n visit = set()\n def dfs(prev, i, j):\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]):\n return 0\n\n if matrix[i][j] <= prev:\n return 0\n\n if (i,j) in visit:\n return res[i][j]\n\n visit.add((i,j))\n val = matrix[i][j]\n\n result = 1 + max(dfs(val,i+1,j) , dfs(val,i-1,j) , dfs(val,i,j+1) , dfs(val,i,j-1))\n res[i][j] = result\n \n return result\n\n maxPath = 1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if (i,j) not in visit:\n dfs(float(\"-inf\"), i, j)\n maxPath = max(maxPath, res[i][j])\n \n return maxPath","memory":"21975"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n, me = len(matrix), len(matrix[0]), {}\n @cache\n def dp(u, v, m, n):\n # if me.setdefault((u, v), 0) != 0:\n # return me[(u, v)]\n res = 1\n for i, j in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\n x, y = u+i, v+j\n if x < 0 or x >= m or y < 0 or y >= n :\n continue\n if matrix[u][v] <= matrix[x][y]:\n continue\n res = max(res, dp(x, y, m, n)+1)\n # me[(u, v)] = res\n return res\n return max([dp(i, j, m, n) for i in range(m) for j in range(n)])","memory":"22105"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n ROWS, COLS = len(matrix), len(matrix[0])\n\n directions = [(0, 1), (0, -1), (-1, 0), (1, 0)]\n\n memo = {}\n\n def getLIPath(currY, currX):\n if (currY, currX) in memo:\n return memo[(currY, currX)]\n\n maxPathLen = -1\n for direction in directions:\n addY, addX = currY + direction[0], currX + direction[1]\n if addY >= ROWS or addX >= COLS or addY < 0 or addX < 0 or matrix[addY][addX] <= matrix[currY][currX]:\n continue\n maxPathLen = max(maxPathLen, getLIPath(addY, addX))\n \n memo[(currY, currX)] = 1 + maxPathLen\n\n return memo[(currY, currX)]\n \n maxOut = -1\n\n for i in range(ROWS):\n for j in range(COLS):\n maxOut = max(maxOut, getLIPath(i, j))\n \n return 1 + maxOut\n","memory":"22235"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n d = [(0,1), (-1,0), (0,-1), (1,0)]\n visited = set()\n cache = {}\n def dfs(r,c):\n if (r,c) in cache:\n return cache[(r,c)]\n longest = 1\n for x, y in d:\n newr, newc = x + r, y + c\n if(0 <= newr < len(matrix) and 0 <= newc < len(matrix[0]) and matrix[newr][newc] > matrix[r][c] and (newr,newc) not in visited):\n \n longest = max(longest, 1 + dfs(newr, newc))\n cache[(r,c)] = longest\n return longest\n for i in range(len(matrix)):\n for j in range(len(matrix[0])): \n dfs(i, j)\n return max(cache.values())","memory":"22365"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m,n = len(matrix), len(matrix[0]) if matrix else 0\n\n memo = {}\n visited = set()\n maxi = 0\n\n def solve(i,j):\n if (i,j) in memo:\n return memo[(i,j)]\n ans = 1\n for di,dj in [(0,1),(0,-1),(1,0),(-1,0)]:\n ni,nj = i+di, j+dj\n if 0 <= ni < m and 0 <= nj < n and matrix[i][j] < matrix[ni][nj]:\n ans = max(ans, 1 + solve(ni,nj))\n \n memo[(i,j)] = ans\n return memo[(i,j)]\n \n for i in range(m):\n for j in range(n):\n maxi = max(maxi, solve(i,j))\n \n return maxi\n\n\n ","memory":"22365"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = {}\n neighbors = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n LIP = 1\n\n def dfs(r, c, prev):\n nonlocal LIP\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prev:\n return 0\n if (r, c) in dp:\n LIP = max(LIP, dp[(r, c)])\n return dp[(r, c)]\n\n result = 1\n for x, y in neighbors:\n result = max(result, 1 + dfs(r + x, c + y, matrix[r][c]))\n dp[(r, c)] = result\n LIP = max(LIP, result)\n return result\n \n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1)\n return LIP","memory":"22495"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n adj_list = ((0,1),(0,-1),(1,0),(-1,0))\n R, C = len(matrix), len(matrix[0])\n cache = {}\n\n def in_range(r, c):\n return 0 <= r < R and 0 <= c < C\n\n def traverse(r, c, prev):\n if not in_range(r, c): return 0\n \n this = matrix[r][c]\n if this <= prev: return 0\n\n key = (r, c)\n if key in cache: return cache[key]\n\n length_here = 1\n matrix[r][c] = -1\n for ra, ca in adj_list:\n length_here = max(length_here, traverse(r+ra,c+ca,this)+1)\n\n matrix[r][c] = this\n cache[key] =length_here \n return cache[key]\n\n longest = 0\n for r in range(R):\n for c in range(C):\n longest = max(longest, traverse(r,c,-1))\n\n return longest","memory":"22625"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n ROWS, COLS = len(matrix), len(matrix[0])\n dp = {}\n neighbors = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n\n def dfs(r, c, prev):\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prev:\n return 0\n if (r, c) in dp:\n return dp[(r, c)]\n\n result = 1\n for x, y in neighbors:\n result = max(result, 1 + dfs(r + x, c + y, matrix[r][c]))\n dp[(r, c)] = result\n return result\n \n for r in range(ROWS):\n for c in range(COLS):\n dfs(r, c, -1)\n return max(dp.values())","memory":"22755"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m=len(matrix)\n n=len(matrix[0])\n visited=set()\n copy=[[1 for j in range(n)] for i in range(m)]\n directions=[[-1,0],[1,0],[0,-1],[0,1]]\n\n def dfs(i,j):\n nonlocal copy\n nonlocal visited\n res=copy[i][j]\n for d in directions:\n if 0<=i+d[0]<=m-1 and 0<=j+d[1]<=n-1 and matrix[i+d[0]][j+d[1]]<matrix[i][j]:\n if (i+d[0],j+d[1]) not in visited:\n dfs(i+d[0],j+d[1])\n res=max(res,copy[i][j]+copy[i+d[0]][j+d[1]])\n copy[i][j]=res\n visited.add((i,j))\n \n \n \n \n for i in range(m):\n for j in range(n):\n x=(i,j)\n if x not in visited:\n dfs(x[0],x[1])\n \n \n return max([max(copy[i]) for i in range(m)])\n \n\n \n ","memory":"22755"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m=len(matrix)\n n=len(matrix[0])\n visited=set()\n copy=[[1 for j in range(n)] for i in range(m)]\n directions=[[-1,0],[1,0],[0,-1],[0,1]]\n\n def dfs(i,j):\n nonlocal copy\n nonlocal visited\n res=copy[i][j]\n for d in directions:\n if 0<=i+d[0]<=m-1 and 0<=j+d[1]<=n-1 and matrix[i+d[0]][j+d[1]]<matrix[i][j]:\n if (i+d[0],j+d[1]) not in visited:\n dfs(i+d[0],j+d[1])\n res=max(res,copy[i][j]+copy[i+d[0]][j+d[1]])\n copy[i][j]=res\n visited.add((i,j))\n \n \n \n \n for i in range(m):\n for j in range(n):\n x=(i,j)\n if x not in visited:\n dfs(x[0],x[1])\n \n \n return max([max(copy[i]) for i in range(m)])\n \n\n \n ","memory":"22885"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n if not matrix or not matrix[0]:\n return 0\n \n # Initialize memoization dictionary\n seen = {}\n \n # Dimensions of the matrix\n m, n = len(matrix), len(matrix[0])\n \n def inBounds(i, j):\n # Check if the indices are within the matrix bounds\n return 0 <= i < m and 0 <= j < n\n\n def dfs(i, j):\n # If already computed the result for this cell, return it\n if (i, j) in seen:\n return seen[(i, j)]\n \n # Define the possible directions (up, down, left, right)\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n max_path = 1 # The path length at least includes the current cell\n \n for di, dj in directions:\n ni, nj = i + di, j + dj\n if inBounds(ni, nj) and matrix[ni][nj] > matrix[i][j]:\n max_path = max(max_path, 1 + dfs(ni, nj))\n \n # Memoize the result for the current cell\n seen[(i, j)] = max_path\n return max_path\n \n # Find the longest increasing path starting from each cell\n longest_path = 0\n for i in range(m):\n for j in range(n):\n longest_path = max(longest_path, dfs(i, j))\n \n return longest_path\n","memory":"22885"},{"code":"from math import inf\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n dp = [[0 for _ in range(n)] for _ in range(m)]\n\n mi, mj = 0, 0\n memo = set()\n for i in range(m):\n for j in range(n):\n dx = [0, 0, -1, 1]\n dy = [-1, 1, 0, 0]\n ok = True\n for k in range(4):\n ci = i + dx[k]\n cj = j + dy[k]\n if -1 < ci < m and -1 < cj < n:\n if matrix[ci][cj] <= matrix[i][j]:\n ok = False\n if ok:\n mi, mj = i, j\n memo.add((i, j))\n dp[i][j] = 1\n\n def solve(i, j):\n if (i, j) in memo:\n return dp[i][j]\n dx = [-1, 1, 0, 0]\n dy = [0, 0, -1, 1]\n ans = 1\n for k in range(4):\n ci = i + dx[k]\n cj = j + dy[k]\n if -1 < ci < m and -1 < cj < n and matrix[ci][cj] < matrix[i][j]:\n ans = max(ans, solve(ci, cj) + 1)\n dp[i][j] = ans\n memo.add((i, j))\n return dp[i][j]\n for i in range(m):\n for j in range(n):\n solve(i, j)\n longest = 0\n for i in range(m):\n for j in range(n):\n longest = max(longest, dp[i][j])\n return longest\n\n \n ","memory":"23015"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n,m=len(matrix),len(matrix[0]);\n dp=[[-1]*201 for i in range(201)];\n ans=0;\n def isValid(i,j):\n return i>=0 and j>=0 and i<n and j<m;\n directions=[(0,-1),(0,1),(-1,0),(1,0)]\n def solve(i,j):\n if dp[i][j]!=-1:\n return dp[i][j];\n cur_ans=1;\n for cur_i,cur_j in directions:\n nxt_i,nxt_j=cur_i+i,cur_j+j;\n if isValid(nxt_i,nxt_j) and matrix[nxt_i][nxt_j]>matrix[i][j]:\n cur_ans=max(cur_ans,solve(nxt_i,nxt_j)+1);\n dp[i][j]=cur_ans;\n return cur_ans;\n for i in range(n):\n for j in range(m):\n ans=max(ans,solve(i,j));\n return ans;","memory":"23145"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n,m=len(matrix),len(matrix[0]);\n dp=[[-1]*201 for i in range(201)];\n ans=0;\n def isValid(i,j):\n return i>=0 and j>=0 and i<n and j<m;\n directions=[(0,-1),(0,1),(-1,0),(1,0)]\n def solve(i,j):\n if dp[i][j]!=-1:\n return dp[i][j];\n cur_ans=1;\n for cur_i,cur_j in directions:\n nxt_i,nxt_j=cur_i+i,cur_j+j;\n if isValid(nxt_i,nxt_j) and matrix[nxt_i][nxt_j]>matrix[i][j]:\n cur_ans=max(cur_ans,solve(nxt_i,nxt_j)+1);\n dp[i][j]=cur_ans;\n return cur_ans;\n for i in range(n):\n for j in range(m):\n ans=max(ans,solve(i,j));\n return ans;","memory":"23145"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n adj_map = defaultdict(list)\n indegrees = defaultdict(int)\n \n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n indegrees[(r, c)] = 0\n\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n for dir in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n n = (r + dir[0], c + dir[1])\n if 0 <= n[0] < len(matrix) and 0 <= n[1] < len(matrix[0]):\n # if neighbor greater than curr, then edge from curr to neighbor\n if matrix[n[0]][n[1]] > matrix[r][c]:\n adj_map[(r, c)].append(n)\n indegrees[n] += 1\n \n cells = []\n for k, v in indegrees.items():\n if v == 0:\n cells.append((k, 1)) # cells contains coord and length of path to that cell\n\n print(adj_map)\n print('\\n' + str(indegrees))\n print(cells)\n max_path = 1\n while cells:\n cell, length = cells.pop(0)\n max_path = max(length, max_path)\n # visit neighbors of this cell with indegree 0 by decrementing neighbors indegrees\n for n in adj_map[cell]:\n indegrees[n] -= 1\n if indegrees[n] == 0:\n cells.append((n, length + 1))\n \n return max_path\n \n\n\n\n\n \n \n","memory":"23275"},{"code":"class Solution:\n def longestIncreasingPath(self, city: List[List[int]]) -> int:\n g = collections.defaultdict(list)\n direction =[[0,1], [0,-1], [-1,0],[1,0]]\n indegree = collections.defaultdict(int)\n \n m = len(city)\n n = len(city[0])\n \n # build a graph\n for i in range(m):\n for j in range(n):\n start_x, start_y = i, j\n for dx, dy in direction:\n new_x, new_y = start_x+dx, start_y+dy\n if new_x>=0 and new_x<m and new_y>=0 and new_y<n and city[new_x][new_y]>city[start_x][start_y]:\n g[str([start_x, start_y])].append(str([new_x, new_y]))\n v = indegree[str([new_x, new_y])]\n v+=1\n indegree[str([new_x, new_y])]=v\n \n \n all_keys = {str([i, j]) for i in range(m) for j in range(n)}\n queue = []\n for key in all_keys:\n if indegree[key]==0:\n queue.append([key, 1])\n \n res = float('-inf')\n out = []\n while queue:\n cur, cur_cnt = queue.pop(0)\n for adj in g[cur]:\n indegree[adj]-=1\n if indegree[adj]==0:\n queue.append([adj, cur_cnt+1]) \n \n res = max(res, cur_cnt)\n return res\n # if cur_cnt>res:\n # out.append(cur)\n # res = cur_cnt","memory":"23405"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n visited = set()\n node_visited = {}\n def dfs(root, visited):\n x, y = root\n if (x, y) in visited:\n return 0\n if (x, y) in node_visited:\n return node_visited[(x,y)]\n record_path = 0\n visited.add((x, y))\n for dx, dy in directions:\n if x+dx >= 0 and x+dx < len(matrix) and y+dy >= 0 and y+dy < len(matrix[0]) and (x+dx, y+dy) not in visited:\n if matrix[x+dx][y+dy] > matrix[x][y]:\n \n record_path = max(record_path, dfs((x+dx, y+dy), visited))\n visited.remove((x, y))\n node_visited[(x,y)] = record_path + 1\n return record_path + 1\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dfs((i, j), visited)\n return max(node_visited.values())","memory":"23535"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n cache = {}\n ROW, COL = len(matrix), len(matrix[0])\n \n def dfs(r,c, prev):\n if r < 0 or r >= ROW or c < 0 or c >= COL:\n return 0\n \n if matrix[r][c] <= prev:\n return 0\n \n if (r,c) in cache:\n return cache[(r,c)]\n \n cache[(r,c)] = 1 + max(dfs(r+1, c, matrix[r][c]), dfs(r-1, c, matrix[r][c]), dfs(r, c+1, matrix[r][c]), dfs(r, c-1, matrix[r][c]))\n return cache[(r,c)]\n \n max_lip = 0\n origin = (-1,-1)\n for r in range(ROW):\n for c in range(COL):\n if (r,c) not in cache:\n dfs(r,c,-1)\n \n if cache[(r,c)] > max_lip:\n max_lip = cache[(r,c)]\n origin = (r,c)\n\n def findPath(r, c, count, path):\n if len(path) == max_lip:\n return path\n \n if r < 0 or r >= ROW or c < 0 or c >= COL or cache[(r,c)] != count:\n return []\n \n path.append(matrix[r][c])\n\n up = findPath(r-1, c, count-1, path)\n down = findPath(r+1, c, count-1, path)\n left = findPath(r, c-1, count-1, path)\n right = findPath(r, c+1, count-1, path)\n\n if up: return up\n if down: return down\n if left: return left\n if right: return right\n\n print(findPath(origin[0], origin[1], max_lip, [])) \n return max_lip\n\n\n # follow up: print the path","memory":"23665"},{"code":"class Solution:\n def valid(self, i, j, m, n):\n return 0 <= i < m and 0 <= j < n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n seen = set()\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n res = 0\n\n @cache\n def dp(i, j):\n maxResult = 1\n for direction in directions:\n dy = direction[0]\n dx = direction[1]\n if self.valid(i + dy, j + dx, m , n) and matrix[i + dy][j + dx] > matrix[i][j]:\n maxResult = max(maxResult, 1 + dp(i + dy, j + dx))\n return maxResult\n\n for i in range(m):\n for j in range(n):\n if (i, j) not in seen:\n seen.add((i, j))\n res = max(res, dp(i, j))\n return res\n","memory":"23795"},{"code":"class Solution:\n def valid(self, i, j, m, n):\n return 0 <= i < m and 0 <= j < n\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n seen = set()\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n res = 0\n\n @cache\n def dp(i, j):\n maxResult = 1\n for direction in directions:\n dy = direction[0]\n dx = direction[1]\n if self.valid(i + dy, j + dx, m , n) and matrix[i + dy][j + dx] > matrix[i][j]:\n maxResult = max(maxResult, 1 + dp(i + dy, j + dx))\n return maxResult\n\n for i in range(m):\n for j in range(n):\n if (i, j) not in seen:\n seen.add((i, j))\n res = max(res, dp(i, j))\n return res\n","memory":"23925"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n max_row=len(matrix)\n max_col=len(matrix[0])\n @cache\n def dfs(curr):\n out=[1]\n if curr[0]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]-1][curr[1]]:\n out.append(dfs((curr[0]-1,curr[1]))+1)\n if curr[1]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]-1]:\n out.append(dfs((curr[0],curr[1]-1))+1)\n if curr[0]<max_row-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]+1][curr[1]]:\n out.append(dfs((curr[0]+1,curr[1]))+1)\n if curr[1]<max_col-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]+1]:\n out.append(dfs((curr[0],curr[1]+1))+1)\n return max(out)\n curr_max=1\n for i in range(max_row):\n for j in range(max_col):\n if (i==0 or matrix[i][j]<=matrix[i-1][j])and (j==0 or matrix[i][j]<=matrix[i][j-1]) and(i==max_row-1 or matrix[i][j]<=matrix[i+1][j])and (j==max_col-1 or matrix[i][j]<=matrix[i][j+1]):\n curr_max=max(dfs((i,j)),curr_max)\n return curr_max","memory":"24055"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n max_row=len(matrix)\n max_col=len(matrix[0])\n @cache\n def dfs(curr):\n out=[1]\n if curr[0]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]-1][curr[1]]:\n out.append(dfs((curr[0]-1,curr[1]))+1)\n if curr[1]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]-1]:\n out.append(dfs((curr[0],curr[1]-1))+1)\n if curr[0]<max_row-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]+1][curr[1]]:\n out.append(dfs((curr[0]+1,curr[1]))+1)\n if curr[1]<max_col-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]+1]:\n out.append(dfs((curr[0],curr[1]+1))+1)\n return max(out)\n curr_max=1\n for i in range(max_row):\n for j in range(max_col):\n if (i==0 or matrix[i][j]<=matrix[i-1][j])and (j==0 or matrix[i][j]<=matrix[i][j-1]) and(i==max_row-1 or matrix[i][j]<=matrix[i+1][j])and (j==max_col-1 or matrix[i][j]<=matrix[i][j+1]):\n curr_max=max(dfs((i,j)),curr_max)\n return curr_max","memory":"24055"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n max_path = 0\n visited = defaultdict(int)\n\n def dfs(i, j, prev, curr_visited):\n if i < 0 or j < 0 or i >= len(matrix) or j >= len(matrix[0]):\n return 0\n if matrix[i][j] <= prev:\n return 0\n if (i, j) in curr_visited:\n return 0\n if (i, j) in visited:\n return visited[(i, j)]\n curr_visited.add((i,j))\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\n max_val = 0\n for x, y in directions:\n max_val = max(max_val, dfs(i+x, j+y, matrix[i][j], curr_visited))\n curr_visited.remove((i,j))\n visited[(i,j)] = 1 + max_val\n return visited[(i,j)]\n\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if (i, j) not in visited:\n curr_visited = set()\n length = dfs(i, j, -1, curr_visited)\n max_path = max(max_path, length)\n return max_path ","memory":"24185"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n M, N = len(matrix), len(matrix[0])\n memo = {}\n def move(i, j):\n for x, y in [[0,1], [0,-1], [1,0], [-1,0]]:\n ni = i + x\n nj = j + y\n if 0 <= ni < M and 0 <= nj < N:\n yield ni, nj\n \n def dfs(i, j):\n nonlocal memo\n idx = i * N + j\n if idx in memo:\n return memo[idx]\n \n length = 1\n for ni, nj in move(i, j):\n if matrix[ni][nj] > matrix[i][j]:\n length = max(length, dfs(ni, nj) + 1)\n\n memo[idx] = length\n return length\n \n res = 1\n for i in range(M):\n for j in range(N):\n res = max(res, dfs(i, j))\n return res\n ","memory":"24315"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n max_path = 0\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j))\n \n return max_path\n\n\n ","memory":"24445"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n max_path = 0\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j))\n \n return max_path\n\n\n ","memory":"24445"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # Initialize the longest path counter\n longest_path = 0\n cache = {} # To cache results of the longest path starting from each cell\n \n # Helper function for backtracking\n def recursive_backtrack(c, r, visited):\n # Check the cache to avoid recomputation\n if (c, r) in cache:\n return cache[(c, r)]\n \n # Calculate possible moves based on the current position\n possible_moves = [(c+1, r), (c-1, r), (c, r-1), (c, r+1)]\n max_path_length = 1 # Start with length 1 (the current cell itself)\n \n # Explore the possible moves (down, up, left, right)\n for move in possible_moves:\n new_c = move[0]\n new_r = move[1]\n \n # Check if the new position is within bounds and the value is increasing\n if 0 <= new_c < len(matrix[0]) and 0 <= new_r < len(matrix) and matrix[new_r][new_c] > matrix[r][c]:\n # Recurse to the next cell and get the length of the path from there\n path_length = 1 + recursive_backtrack(new_c, new_r, visited)\n max_path_length = max(max_path_length, path_length)\n \n # Update the cache with the result for the current cell\n cache[(c, r)] = max_path_length\n return max_path_length\n \n # Initialize the visited array (not needed with memoization, but kept for reference)\n visited = [[0] * len(matrix[0]) for _ in range(len(matrix))]\n \n # Start backtracking from every cell and calculate the longest path\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n longest_path = max(longest_path, recursive_backtrack(c, r, visited))\n \n return longest_path # Return the longest path found\n","memory":"24575"},{"code":"# Recursive\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n R, C = len(matrix), len(matrix[0])\n \n def recursive(r, c):\n if (r,c) in memo:\n return memo[(r, c)]\n res = 0\n for dr, dc in [[0, 1], [0, -1], [1, 0], [-1, 0]]:\n row = r + dr\n col = c + dc\n\n if (row < 0 or col < 0 or\n row >= R or col >= C or\n matrix[row][col] <= matrix[r][c] ):\n continue\n \n res = max(res, recursive(row, col))\n memo[(r, c)] = (1 + res)\n return memo[(r, c)]\n \n memo = {}\n for r in range(R):\n for c in range(C):\n recursive(r, c)\n\n return max(memo.values())\n \n","memory":"24705"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n \n \n 3. return the max travel distance\n \"\"\"\n m = len(matrix)\n n = len(matrix[0])\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] \n neighbors = {} # key: (i, j); value: list of neighbors\n\n # 1. compute adjacency dictionary\n for i in range(m):\n for j in range(n):\n for incrementI, incrementJ in directions:\n if self.isValid(matrix[i][j], i + incrementI, j + incrementJ, matrix):\n neighbor = (i + incrementI, j + incrementJ)\n if (i, j) in neighbors:\n neighbors[(i, j)].append(neighbor)\n else:\n neighbors[(i, j)] = [neighbor]\n \n \"\"\"\n 2. do a dfs for each element in the matrix\n each element in the stack = ((i, j), curCount), where curCount is how much we have traveled so far to get to the point (i, j), which is a neighbor of the current node\n \"\"\"\n dic = {} # key: (i, j); value: longest distance that we can travel from the node (i, j)\n ans = 1\n def dfs(i, j):\n if (i, j) in dic:\n return dic[(i, j)]\n elif (i, j) not in neighbors:\n return 1\n \n counts = []\n for newI, newJ in neighbors[(i, j)]:\n counts.append(dfs(newI, newJ) + 1)\n \n dic[(i, j)] = max(counts)\n nonlocal ans\n ans = max(ans, dic[(i, j)])\n return dic[(i, j)]\n \n for i in range(m):\n for j in range(n):\n dfs(i, j)\n \n return ans\n \n \n def isValid(self, curValue, i, j, matrix):\n \"\"\"\n Returns True if matrix[i][j] is within matrix boundaries and matrix[i][j] > curValue\n \"\"\"\n return i >= 0 and j >= 0 and i < len(matrix) and j < len(matrix[0]) and matrix[i][j] > curValue\n\n","memory":"24835"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n rows, cols = len(matrix), len(matrix[0])\n\n def is_valid(i, j, prev):\n #We only need to check if its in bound and if the value is greater for allowing a path\n if i in range(rows) and j in range(cols) and matrix[i][j] > prev:\n return True\n return False\n\n dp = {}\n def dfs(i, j):\n #Base case: check dp and check for each direction if its valid\n if (i, j) in dp: return dp[(i, j)]\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\n max_path = 1\n for x, y in directions:\n if is_valid(i + x, j + y, matrix[i][j]):\n max_path = max(max_path, dfs(i + x, j + y) + 1)\n dp[(i, j)] = max_path\n return max_path\n\n #Do a dfs for each cell (Time complexity will be O(n * m))\n max_path = 0\n for i in range(rows):\n for j in range(cols):\n max_path = max(max_path, dfs(i, j))\n \n return max_path\n\n\n ","memory":"24965"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m,n = len(matrix), len(matrix[0])\n\n @cache\n def near(start):\n res = []\n i,j = start\n for pos in [(i+1,j), (i,j+1), (i-1, j), (i,j-1)]:\n x,y = pos\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]: \n res.append(pos)\n return res\n\n def dfs(start, depth):\n i,j = start\n if dp[i][j]:\n return (depth-1) + dp[i][j]\n res = depth\n for node in near(start):\n res = max(res, dfs(node, depth+1))\n dp[i][j] = res - depth + 1\n return res\n \n dp = [[None]*n for _ in range(m)]\n res = 1\n for i in range(m):\n for j in range(n):\n dfs((i,j), 1)\n res = max(res, dp[i][j])\n print(dp)\n return res\n\n \n","memory":"24965"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # build graph, if the number next to it is larger, create an edge\n edges = []\n nrow = len(matrix); ncol = len(matrix[0])\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n cur = matrix[i][j]\n n1 = i * ncol + j\n if i > 0 and matrix[i-1][j] > cur:\n n2 = (i - 1) * ncol + j\n edges.append((n1, n2))\n if i < nrow - 1 and matrix[i+1][j] > cur:\n n2 = (i + 1) * ncol + j\n edges.append((n1, n2))\n if j > 0 and matrix[i][j-1] > cur:\n n2 = i * ncol + j - 1\n edges.append((n1, n2))\n if j < ncol - 1 and matrix[i][j+1] > cur:\n n2 = i * ncol + j + 1\n edges.append((n1, n2))\n\n childToParents = {}; parentToChildren = {}\n for edge in edges:\n child = edge[0]\n parent = edge[1]\n if child in childToParents:\n childToParents[child].append(parent)\n else:\n childToParents[child] = [parent]\n if parent in parentToChildren:\n parentToChildren[parent].append(child)\n else:\n parentToChildren[parent] = [child]\n\n lengths = [0] * ncol * nrow\n while len(childToParents) > 0:\n removeParents = []\n for parent in parentToChildren:\n if len(parentToChildren[parent]) == 0:\n removeParents.append(parent)\n for parent in removeParents:\n del parentToChildren[parent]\n # find the leaves first, update the leaves iteratively\n notleaves = set(childToParents.keys()).intersection(set(parentToChildren.keys()))\n leaves = [node for node in childToParents.keys() if node not in notleaves]\n for leaf in leaves:\n parents = childToParents[leaf]\n for parent in parents:\n lengths[parent] = max(1 + lengths[leaf], lengths[parent])\n # remove leaf from both childToParents and parentToChildren\n del childToParents[leaf]\n for parent in parents:\n parentToChildren[parent].remove(leaf)\n return max(lengths) + 1","memory":"25095"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \"\"\"\n \n \n 3. return the max travel distance\n \"\"\"\n m = len(matrix)\n n = len(matrix[0])\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] \n neighbors = {} # key: (i, j); value: list of neighbors\n\n # 1. compute adjacency dictionary\n for i in range(m):\n for j in range(n):\n for incrementI, incrementJ in directions:\n if self.isValid(matrix[i][j], i + incrementI, j + incrementJ, matrix):\n neighbor = (i + incrementI, j + incrementJ)\n if (i, j) in neighbors:\n neighbors[(i, j)].append(neighbor)\n else:\n neighbors[(i, j)] = [neighbor]\n \n \"\"\"\n 2. do a dfs for each element in the matrix\n each element in the stack = ((i, j), curCount), where curCount is how much we have traveled so far to get to the point (i, j), which is a neighbor of the current node\n \"\"\"\n dic = {} # key: (i, j); value: longest distance that we can travel from the node (i, j)\n def dfs(i, j):\n if (i, j) in dic:\n return dic[(i, j)]\n elif (i, j) not in neighbors:\n return 1\n \n counts = []\n for newI, newJ in neighbors[(i, j)]:\n counts.append(dfs(newI, newJ) + 1)\n \n dic[(i, j)] = max(counts)\n return dic[(i, j)]\n \n for i in range(m):\n for j in range(n):\n dfs(i, j)\n \n print(dic)\n print(neighbors)\n ans = 1\n for k in dic:\n ans = max(ans, dic[k])\n \n return ans\n\n\n\n\n \n \n\n \n\n \n \n def isValid(self, curValue, i, j, matrix):\n \"\"\"\n Returns True if matrix[i][j] is within matrix boundaries and matrix[i][j] > curValue\n \"\"\"\n return i >= 0 and j >= 0 and i < len(matrix) and j < len(matrix[0]) and matrix[i][j] > curValue\n\n","memory":"25225"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n indeg, adj_mat, dist = {}, {}, {}\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n indeg[(i, j)] = 0\n adj_mat[(i, j)] = set() # u:v indicates path from u to v\n dist[(i, j)] = 1\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n ni, nj = i+di, j+dj\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\n adj_mat[(i, j)].add((ni, nj))\n indeg[(ni, nj)] += 1\n \n to_remove = [u for u in indeg if indeg[u] == 0]\n result = 1\n while len(to_remove) != 0:\n new_to_remove = []\n for u in to_remove:\n del indeg[u]\n for v in adj_mat[u]:\n indeg[v] -= 1\n if indeg[v] == 0:\n new_to_remove.append(v)\n dist[v] = max(dist[v], 1+dist[u])\n result = max(result, 1+dist[u])\n to_remove = new_to_remove\n return result\n \n \n \n \n \n \n ","memory":"25355"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # build map\n m = defaultdict(list)\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if j+1<len(matrix[0]):\n if matrix[i][j]<matrix[i][j+1]:\n m[(i,j)].append((i,j+1))\n elif matrix[i][j]>matrix[i][j+1]:\n m[(i,j+1)].append((i,j))\n if i+1<len(matrix):\n if matrix[i][j]<matrix[i+1][j]:\n m[(i,j)].append((i+1,j))\n elif matrix[i][j]>matrix[i+1][j]:\n m[(i+1,j)].append((i,j))\n # build mem to hold length of longest path starting from the node\n dp = {}\n def getLength(i, j):\n if (i,j) in dp:\n return dp[(i,j)]\n l = 0\n for x, y in m[(i,j)]:\n l = max(l, 1+getLength(x, y))\n dp[(i,j)] = l\n return l\n res = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n res = max(res, 1+getLength(i, j))\n return res","memory":"25355"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n \n adj_mat, dist, indeg = {}, {}, {}\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dist[(i, j)] = 1\n adj_mat[(i, j)] = set()\n indeg[(i, j)] = 0\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n ni, nj = i+di, j+dj\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\n adj_mat[(i, j)].add((ni, nj))\n indeg[(ni, nj)] += 1\n \n from collections import deque\n q = deque([u for u in indeg if indeg[u]==0])\n while len(q) > 0:\n u = q.popleft()\n for v in adj_mat[u]:\n if 1+dist[u] > dist[v]:\n dist[v] = 1+dist[u]\n q.append(v)\n return max([v for v in dist.values()])\n \n\n# for u in indeg:\n# if indeg[u] == 0:\n# dist[u] = 1\n# def recur(u):\n# for v in adj_mat[u]:\n# if v not in dist:\n# dist[v] = dist[u]+1\n# else:\n# dist[v] = max(dist[v], dist[u]+1)\n \n \n# for u in dist:\n \n \n \n# for i in range(len(matrix)):\n# for j in range(len(matrix[0])):\n# for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n# ni, nj = i+di, j+dj\n# if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\n# adj_mat[(i, j)].add((ni, nj))\n# indeg[(ni, nj)] += 1\n \n# to_remove = set([u for u in indeg if indeg[u] == 0])\n# result = 1\n# while len(to_remove) != 0:\n# u = to_remove.pop()\n# del indeg[u]\n# for v in adj_mat[u]:\n# indeg[v] -= 1\n# if indeg[v] == 0:\n# to_remove.add(v)\n# dist[v] = max(dist[v], 1+dist[u])\n# result = max(result, 1+dist[u])\n# return result\n \n \n \n \n \n \n ","memory":"25485"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n \n adj_mat, dist, indeg = {}, {}, {}\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n dist[(i, j)] = 1\n adj_mat[(i, j)] = set()\n indeg[(i, j)] = 0\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n ni, nj = i+di, j+dj\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\n adj_mat[(i, j)].add((ni, nj))\n indeg[(ni, nj)] += 1\n \n from collections import deque\n q = deque([u for u in indeg if indeg[u]==0])\n while len(q) > 0:\n u = q.popleft()\n for v in adj_mat[u]:\n if 1+dist[u] > dist[v]:\n dist[v] = 1+dist[u]\n q.append(v)\n return max([v for v in dist.values()])\n \n\n# for u in indeg:\n# if indeg[u] == 0:\n# dist[u] = 1\n# def recur(u):\n# for v in adj_mat[u]:\n# if v not in dist:\n# dist[v] = dist[u]+1\n# else:\n# dist[v] = max(dist[v], dist[u]+1)\n \n \n# for u in dist:\n \n \n \n# for i in range(len(matrix)):\n# for j in range(len(matrix[0])):\n# for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n# ni, nj = i+di, j+dj\n# if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\n# adj_mat[(i, j)].add((ni, nj))\n# indeg[(ni, nj)] += 1\n \n# to_remove = set([u for u in indeg if indeg[u] == 0])\n# result = 1\n# while len(to_remove) != 0:\n# u = to_remove.pop()\n# del indeg[u]\n# for v in adj_mat[u]:\n# indeg[v] -= 1\n# if indeg[v] == 0:\n# to_remove.add(v)\n# dist[v] = max(dist[v], 1+dist[u])\n# result = max(result, 1+dist[u])\n# return result\n \n \n \n \n \n \n ","memory":"25485"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n R = len(matrix)\n C = len(matrix[0])\n memo = {}\n def helper(r,c,prevValue):\n if r>=R or c >=C or r<0 or c<0 or prevValue >= matrix[r][c]:\n return 0\n\n if (r,c) in memo:\n return memo[(r,c)]\n maxLen = 0\n directions = [[0,1],[0,-1],[1,0],[-1,0]]\n\n # print(r,c,prevValue)\n for nR,nC in directions:\n newR,newC = r+nR,c+nC\n maxLen = max(maxLen,helper(newR,newC,matrix[r][c]))\n temp = 1+maxLen\n memo[(r,c)] = temp\n return temp\n out =1\n for i in range(R):\n for j in range(C):\n out=max(out,helper(i,j,float('-inf')))\n \n return out\n","memory":"25615"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n indeg, adj_mat, dist = {}, {}, {}\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n indeg[(i, j)] = 0\n adj_mat[(i, j)] = set() # u:v indicates path from u to v\n dist[(i, j)] = 1\n \n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n ni, nj = i+di, j+dj\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\n adj_mat[(i, j)].add((ni, nj))\n indeg[(ni, nj)] += 1\n \n to_remove = set([u for u in indeg if indeg[u] == 0])\n result = 1\n while len(to_remove) != 0:\n u = to_remove.pop()\n del indeg[u]\n for v in adj_mat[u]:\n indeg[v] -= 1\n if indeg[v] == 0:\n to_remove.add(v)\n dist[v] = max(dist[v], 1+dist[u])\n result = max(result, 1+dist[u])\n return result\n \n \n \n \n \n \n ","memory":"25745"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: 'List[List[int]]') -> int:\n visit = set()\n self.res = 0\n ROWS, COLS = len(matrix), len(matrix[0])\n self.cache = [[1] * COLS for _ in range(ROWS)]\n\n neigh = [(0, -1), (-1, 0), (0, 1), (1, 0)]\n \n \n def dfs(r, c, prev):\n if (\n r < 0 or c < 0 or r > (ROWS - 1) or c > (COLS - 1) or\n matrix[r][c] <= prev\n ):\n return 0\n\n if (r,c) in visit:\n return self.cache[r][c]\n\n visit.add((r,c ))\n count=1\n re = []\n for dr, dc in neigh:\n re.append(dfs(r + dr, c + dc, matrix[r][c]))\n count += max(re)\n self.cache[r][c] = count\n self.res = max(self.res, count)\n return count\n \n \n for r in range(ROWS):\n for c in range(COLS):\n if (r, c) in visit:\n continue\n dfs(r, c, float('-inf'))\n\n return self.res","memory":"25745"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n graph = defaultdict(list)\n deg = [[0 for j in range(n)] for i in range(m)]\n for i in range(m):\n for j in range(n):\n dirs = [(0, 1), (1, 0), (-1, 0), (0, -1)]\n for dx, dy in dirs:\n new_i = i + dx\n new_j = j + dy\n if 0 <= new_i < m and 0 <= new_j < n and matrix[new_i][new_j] > matrix[i][j]:\n graph[(i, j)].append((new_i, new_j))\n deg[new_i][new_j] += 1\n \n dp = [[-1 for i in range(n)] for j in range(m)]\n def height(i, j):\n if dp[i][j] != -1:\n return dp[i][j]\n max_children_height = 0\n for new_i, new_j in graph[(i, j)]:\n max_children_height = max(max_children_height, height(new_i, new_j))\n dp[i][j] = max_children_height + 1\n return max_children_height + 1\n \n ret = float('-inf')\n\n for i in range(m):\n for j in range(n):\n if deg[i][j] == 0:\n ret = max(ret, height(i, j))\n \n return ret","memory":"25875"},{"code":"'''\nAt any (r, c), we have 4 (technically 3) allowed moves:\nGo right: c + 1.\nGo left: c - 1\nGo up: r + 1.\nGo down: r - 1.\n\nBefore each move, verify the following:\nNext move's value HAS TO BE greater than current (also ensures we don't go back)\nNext move within bounds\n'''\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n @cache\n def longestIncreasingPathStartingFrom(r: int, c: int) -> int:\n left = 0\n right = 0\n up = 0\n down = 0\n\n if c > 0 and matrix[r][c - 1] > matrix[r][c]:\n left = longestIncreasingPathStartingFrom(r, c - 1)\n\n if c < len(matrix[0]) - 1 and matrix[r][c + 1] > matrix[r][c]:\n right = longestIncreasingPathStartingFrom(r, c + 1)\n\n if r > 0 and matrix[r - 1][c] > matrix[r][c]:\n up = longestIncreasingPathStartingFrom(r - 1, c)\n\n if r < len(matrix) - 1 and matrix[r + 1][c] > matrix[r][c]:\n down = longestIncreasingPathStartingFrom(r + 1, c)\n\n\n return 1 + max(left, right, up, down)\n\n curMax = 1\n\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n curMax = max(curMax, longestIncreasingPathStartingFrom(r, c))\n\n return curMax\n ","memory":"26005"},{"code":"'''\nAt any (r, c), we have 4 (technically 3) allowed moves:\nGo right: c + 1.\nGo left: c - 1\nGo up: r + 1.\nGo down: r - 1.\n\nBefore each move, verify the following:\nNext move's value HAS TO BE greater than current (also ensures we don't go back)\nNext move within bounds\n'''\n\nclass Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n\n @cache\n def longestIncreasingPathStartingFrom(r: int, c: int) -> int:\n left = 0\n right = 0\n up = 0\n down = 0\n\n if c > 0 and matrix[r][c - 1] > matrix[r][c]:\n left = longestIncreasingPathStartingFrom(r, c - 1)\n\n if c < len(matrix[0]) - 1 and matrix[r][c + 1] > matrix[r][c]:\n right = longestIncreasingPathStartingFrom(r, c + 1)\n\n if r > 0 and matrix[r - 1][c] > matrix[r][c]:\n up = longestIncreasingPathStartingFrom(r - 1, c)\n\n if r < len(matrix) - 1 and matrix[r + 1][c] > matrix[r][c]:\n down = longestIncreasingPathStartingFrom(r + 1, c)\n\n\n return 1 + max(left, right, up, down)\n\n curMax = 1\n\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n curMax = max(curMax, longestIncreasingPathStartingFrom(r, c))\n\n return curMax\n ","memory":"26005"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n n = len(matrix)\n m = len(matrix[0])\n\n @cache\n def dfs(row: int, col: int) -> int:\n res = 0\n if col > 0 and matrix[row][col - 1] > matrix[row][col]:\n res = max(res, dfs(row, col - 1))\n if row > 0 and matrix[row - 1][col] > matrix[row][col]:\n res = max(res, dfs(row - 1, col))\n if col + 1 < m and matrix[row][col + 1] > matrix[row][col]:\n res = max(res, dfs(row, col + 1))\n if row + 1 < n and matrix[row + 1][col] > matrix[row][col]:\n res = max(res, dfs(row + 1, col))\n\n return res + 1\n \n res = 0\n for row in range(n):\n for col in range(m):\n res = max(res, dfs(row, col))\n return res","memory":"26135"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n seen = {}\n # (prev coord, coord, len of remaing path)\n if not matrix: return 0\n m = len(matrix)\n n = len(matrix[0])\n def dfs(prev,coord,cur):\n\n x,y = coord\n if not (0<=x<n and 0<=y<m):\n return cur\n if prev and matrix[y][x] <= matrix[prev[1]][prev[0]]:\n return cur\n if (prev,coord) in seen:\n return cur + seen[(prev,coord)]\n path = max(\n dfs(coord,(x,y+1),cur+1),\n dfs(coord,(x,y-1),cur+1),\n dfs(coord,(x-1,y),cur+1),\n dfs(coord,(x+1,y),cur+1)\n )\n if prev:\n seen[(prev,coord)]=path-cur\n\n # res = max(res,path)\n return path\n\n res = 0\n for x in range(n):\n for y in range(m): \n \n res = max(res,dfs(None,(x,y),0))\n\n return max(1,res)\n","memory":"26265"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n \n \n # Create graph\n m,n = len(matrix), len(matrix[0])\n graph = {}\n \n for i in range(m):\n for j in range(n):\n source = (i,j)\n graph[source] = [] \n if i > 0:\n if matrix[i][j] < matrix[i-1][j]:\n graph[source].append((i-1,j))\n if i < m - 1:\n if matrix[i][j] < matrix[i+1][j]:\n graph[source].append((i+1,j))\n if j > 0:\n if matrix[i][j] < matrix[i][j-1]:\n graph[source].append((i,j-1))\n if j < n - 1:\n if matrix[i][j] < matrix[i][j+1]:\n graph[source].append((i,j+1))\n \n \n def dfs(start):\n nonlocal graph, cache\n\n if start in cache:\n return cache[start]\n \n max_length = 1\n \n for neighbor in graph[start]:\n max_length = max(max_length, 1 + dfs(neighbor))\n \n cache[start] = max_length\n \n return max_length\n \n # Apply dfs on each square, caching results along the way\n cache = {}\n longest_path = 0\n for start in graph.keys():\n longest_path = max(longest_path, dfs(start)) \n\n return longest_path\n \n \n ","memory":"26395"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n\n @cache\n def dfs(i, j):\n res = 1\n for di, dj in ((0, 1), (0, -1), (1, 0), (-1, 0)):\n ii = i + di\n jj = j + dj\n\n if 0 <= ii < m and 0 <= jj < n and matrix[ii][jj] > matrix[i][j]:\n res = max(res, 1 + dfs(ii, jj))\n return res\n \n res = 1\n for i in range(m):\n for j in range(n):\n res = max(res, dfs(i, j))\n return res\n","memory":"26525"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m = len(matrix)\n n = len(matrix[0])\n\n @cache\n def dfs(r, c):\n answer = 1\n dirs = [(0, -1), (0, 1), (1, 0), (-1, 0)]\n for dir in dirs:\n new_r = r + dir[0]\n new_c = c + dir[1]\n if new_r>=0 and new_r < m and new_c >=0 and new_c < n and (new_r, new_c) and matrix[new_r][new_c] > matrix[r][c]:\n answer = max(answer, 1 + dfs(new_r, new_c))\n\n return answer\n\n result = 0\n for i in range(m):\n for j in range(n):\n result = max(result, dfs(i, j))\n return result","memory":"26915"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n m, n = len(matrix), len(matrix[0])\n\n @cache\n def dfs(i, j):\n length = 1\n pre_length = 0\n direction = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n for dx, dy in direction:\n x = i + dx\n y = j + dy\n if x >= 0 and x < m and y >= 0 and y < n and matrix[x][y] > matrix[i][j]:\n pre_length = max(pre_length, dfs(x, y))\n return length + pre_length\n \n max_length = 1\n for i in range(m):\n for j in range(n):\n max_length = max(max_length, dfs(i, j))\n \n return max_length\n ","memory":"27045"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n parents = defaultdict(set)\n adj = defaultdict(list)\n m = len(matrix)\n n = len(matrix[0])\n offs = [(0,1), (1,0), (0,-1), (-1,0)]\n for i1 in range(m):\n for j1 in range(n):\n for off_i, off_j in offs:\n i2 = i1+off_i\n j2 = j1+off_j\n if 0<=i2<m and 0<=j2<n and matrix[i2][j2]>matrix[i1][j1]:\n parents[(i2,j2)].add((i1,j1))\n adj[(i1,j1)].append((i2,j2))\n # print(parents)\n q = deque([])\n for i in range(m):\n for j in range(n):\n node = (i,j)\n if len(parents[node])==0:\n q.append(node)\n\n degree = defaultdict(lambda: 1)\n cur_degree = 0\n while q:\n new_q = deque([])\n while q:\n node = q.popleft()\n for neigh in adj[node]:\n degree[neigh] = max(degree[neigh], 1+cur_degree)\n parents[neigh].remove(node)\n if len(parents[neigh])==0:\n new_q.append(neigh)\n cur_degree += 1\n q = new_q\n\n return cur_degree","memory":"27045"},{"code":"class Solution:\n def longestIncreasingPath(self, grid: List[List[int]]) -> int:\n m,n=len(grid),len(grid[0])\n # directions = [0, 1, 0, -1, 0] # four directions \n directions = [(0,1),(0,-1),(1,0),(-1,0)]\n \n @lru_cache(maxsize=None) # using python cache lib for memoization\n def dfs(r,c):\n ans=1 \n\t\t\t# iterating through all 4 directions\n for x,y in directions: \n new_row,new_col=r+x, c+y # calculating the new cell\n\t\t\t\t# check if new cell is within the grid bounds and is an increasing sequence\n if 0<=new_row<m and 0<=new_col<n and grid[new_row][new_col]>grid[r][c]: \n ans = max(ans, dfs(new_row, new_col) + 1 ) # finding the max length of valid path from the current cell \n return ans\n \n return max(dfs(r,c) for r in range(m) for c in range(n)) ","memory":"27175"},{"code":"class Solution:\n def longestIncreasingPath(self, grid: List[List[int]]) -> int:\n m,n=len(grid),len(grid[0])\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\n \n @lru_cache(maxsize=None) # using python cache lib for memoization\n def dfs(r,c):\n ans=1 \n\t\t\t# iterating through all 4 directions\n for x,y in directions: \n new_row,new_col=r+x, c+y # calculating the new cell\n\t\t\t\t# check if new cell is within the grid bounds and is an increasing sequence\n if 0<=new_row<m and 0<=new_col<n and grid[new_row][new_col]>grid[r][c]: \n ans = max(ans, dfs(new_row, new_col) + 1 ) # finding the max length of valid path from the current cell \n return ans\n \n return max(dfs(r,c) for r in range(m) for c in range(n)) ","memory":"27175"},{"code":"class Solution:\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\n # # if len(matrix) == 1 and len(matrix[0]) ==1:\n # # return 1\n # rows = len(matrix)\n # cols = len(matrix[0])\n # max_length = 0\n # directions = [(0,1),(0,-1),(1,0),(-1,0)] #right, left, down, up\n\n # def dfs( i, j, sequence, visited):\n # nonlocal max_length\n # if max_length <len(sequence):\n # max_length = len(sequence)\n # for w,z in directions:\n # x, y = i+w, j+z\n # if 0<= x< rows and 0 <= y < cols and matrix[i][j]<matrix[x][y] and (x,y) not in visited:\n # sequence.append(matrix[x][y])\n # visited.add((x,y))\n # dfs(x, y, sequence, visited)\n # sequence.pop()\n # visited.remove((x,y))\n # visited = set()\n # for i in range(0, rows):\n # for j in range(0,cols):\n # visited.add((i,j))\n # dfs(i, j, [matrix[i][j]], visited)\n # visited.remove((i,j))\n # return max_length\n\n if not matrix or not matrix[0]:\n return 0\n \n rows, cols = len(matrix), len(matrix[0])\n directions = [(0,1),(0,-1),(1,0),(-1,0)] # right, left, down, up\n \n @lru_cache(None)\n def dfs(i, j):\n max_length = 1\n for di, dj in directions:\n ni, nj = i + di, j + dj\n if 0 <= ni < rows and 0 <= nj < cols and matrix[ni][nj] > matrix[i][j]:\n max_length = max(max_length, 1 + dfs(ni, nj))\n return max_length\n \n return max(dfs(i, j) for i in range(rows) for j in range(cols))\n\n\n\n ","memory":"27305"}],"string":"[\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ln_i = len(matrix)\\n ln_j = len(matrix[0])\\n\\n path_matrix = [[1 for _ in range(ln_j)] for _ in range(ln_i)]\\n\\n flag = True\\n while flag:\\n flag = False\\n for ind_i in range(ln_i):\\n for ind_j in range(ln_j):\\n i = matrix[ind_i][ind_j]\\n prev_path_ln_i = path_matrix[ind_i][ind_j]\\n path_ln_i = 1\\n\\n if ind_i != 0 and matrix[ind_i-1][ind_j] > i:\\n path_ln_i = max(path_ln_i, path_matrix[ind_i-1][ind_j]+1)\\n if ind_j != ln_j-1 and matrix[ind_i][ind_j+1] > i:\\n path_ln_i = max(path_ln_i, path_matrix[ind_i][ind_j+1]+1)\\n if ind_i != ln_i-1 and matrix[ind_i+1][ind_j] > i:\\n path_ln_i = max(path_ln_i, path_matrix[ind_i+1][ind_j]+1)\\n if ind_j != 0 and matrix[ind_i][ind_j-1] > i:\\n path_ln_i = max(path_ln_i, path_matrix[ind_i][ind_j-1]+1)\\n \\n path_matrix[ind_i][ind_j] = path_ln_i\\n if prev_path_ln_i != path_ln_i:\\n flag = True\\n \\n Max = 0\\n for ind_i in range(ln_i):\\n for ind_j in range(ln_j):\\n Max = max(Max, path_matrix[ind_i][ind_j])\\n return Max\",\n \"memory\": \"17165\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not len(matrix):\\n return 0\\n maxVal = 0\\n rows = len(matrix)\\n cols = len(matrix[0])\\n cache = [[0 for _ in range(cols)] for _ in range(rows)]\\n print(cache)\\n for i in range(rows):\\n for j in range(cols):\\n maxVal = max(maxVal, self.subPath(matrix, i, j, rows, cols, cache))\\n return maxVal\\n \\n def subPath(self, matrix, row, col, rows, cols, cache):\\n if cache[row][col] != 0:\\n return cache[row][col]\\n for x, y in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n xval = row + x\\n yval = col + y\\n if xval >= 0 and xval < rows and yval >= 0 and yval < cols and matrix[xval][yval] > matrix[row][col]:\\n cache[row][col] = max(cache[row][col], self.subPath(matrix, xval, yval, rows, cols, cache))\\n cache[row][col] += 1\\n return cache[row][col]\\n \",\n \"memory\": \"17165\"\n },\n {\n \"code\": \"import collections\\nclass Solution:\\n\\n def dfs(self,r,c):\\n m=self.m\\n n=self.n\\n matrix=self.matrix\\n val=matrix[r][c]\\n if r >= m or r<0 or c >=n or c<0:\\n return 0\\n\\n if self.nodes[r][c]>0:\\n return self.nodes[r][c]\\n\\n moves=[[r+1,c],[r-1,c],[r,c+1],[r,c-1]]\\n\\n curr_max=0\\n\\n for i in range(4): # 4 moves\\n next_r,next_c = moves[i]\\n if next_r>=0 and next_r<m and next_c>=0 and next_c<n and matrix[next_r][next_c]>val:\\n curr_max=max(curr_max, self.dfs(next_r,next_c))\\n \\n\\n self.nodes[r][c]=curr_max+1\\n\\n if curr_max+1>self.max_path:\\n self.max_path=curr_max+1\\n\\n return curr_max+1\\n \\n \\n \\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # solution idea: dfs with each matrix block as a node\\n m=self.m=len(matrix) # rows \\n n=self.n=len(matrix[0]) # columns \\n self.matrix=matrix\\n self.nodes=[[0 for i in range(self.n)] for i in range(self.m)]\\n self.max_path=0\\n for i in range(m*n):\\n self.dfs(i//n, i%n) # pass in row and column \\n\\n return self.max_path\\n \\n \\n \\n \\n\\n\\n \\n\\n\\n\\n \",\n \"memory\": \"17295\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if len(matrix) == 0: return 0\\n m, n = len(matrix), len(matrix[0])\\n cache = [[0] * n for _ in range(m)]\\n longest = 1\\n for i in range(m):\\n for j in range(n):\\n cur_longest = self.dfs(matrix, i, j, m, n, cache)\\n longest = max(longest, cur_longest)\\n \\n return longest\\n\\n def dfs(self, matrix, i, j, m, n, cache):\\n if cache[i][j] != 0: return cache[i][j]\\n cur_longest = 1\\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n nx, ny = i+dx, j+dy\\n if nx < 0 or nx >= m or ny < 0 or ny >= n or matrix[nx][ny] <= matrix[i][j]:\\n continue\\n length = 1 + self.dfs(matrix, nx, ny, m, n, cache)\\n cur_longest = max(cur_longest, length)\\n cache[i][j] = cur_longest\\n return cur_longest\\n \",\n \"memory\": \"17295\"\n },\n {\n \"code\": \"class Solution:\\n\\n def solve(self, i, j, matrix, m, n, dp):\\n if dp[i][j]!=-1:\\n return dp[i][j]\\n ans = 0\\n\\n # up\\n if (i-1>=0 and matrix[i][j]<matrix[i-1][j]):\\n ans = max(ans, self.solve(i-1, j, matrix, m, n, dp))\\n # right\\n if(j+1<n and matrix[i][j]<matrix[i][j+1]):\\n ans = max(ans, self.solve(i, j+1, matrix, m, n, dp))\\n # down\\n if(i+1<m and matrix[i][j]<matrix[i+1][j]):\\n ans = max(ans, self.solve(i+1, j, matrix, m, n, dp))\\n # left\\n if(j-1>=0 and matrix[i][j]<matrix[i][j-1]):\\n ans = max(ans, self.solve(i, j-1, matrix, m, n, dp))\\n \\n dp[i][j] = ans+1\\n return dp[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n ans = -1\\n dp = [[-1]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ans = max(ans, self.solve(i, j, matrix, m, n, dp))\\n return ans\",\n \"memory\": \"17425\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n a cell in the matrix as a node,\\na directed edge from node x to node y if x and y are adjacent and x's value < y's value\\nThen a graph is formed.\\n\\nNo cycles can exist in the graph, i.e. a DAG is formed.\\n\\nThe problem becomes to get the longest path in the DAG.\\n\\nTopological sort can iterate the vertices of a DAG in the linear ordering.\\n\\nUsing Kahn's algorithm(BFS) to implement topological sort while counting the levels can give us the longest chain of nodes in the DAG.\\n \\\"\\\"\\\"\\n m, n = len(matrix), len(matrix[0])\\n ind = [[0] * n for _ in range(m)]\\n dirs = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\n for i in range(m):\\n for j in range(n):\\n for dx, dy in dirs:\\n ni, nj = i + dx, j + dy\\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\\n ind[ni][nj] += 1\\n \\n q = deque([(x, y) for x in range(m) for y in range(n) if ind[x][y] == 0])\\n max_path = 0\\n while q:\\n max_path += 1\\n for _ in range(len(q)):\\n i, j = q.popleft()\\n for dx, dy in dirs:\\n ni, nj = i + dx, j + dy\\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\\n ind[ni][nj] -= 1\\n if ind[ni][nj] == 0:\\n q.append((ni, nj))\\n return max_path\\n\\n\\n\",\n \"memory\": \"17425\"\n },\n {\n \"code\": \"class Solution:\\n def dpizer(self,matrix,dp,i,j):\\n val = 1\\n if i != len(matrix)-1:\\n if matrix[i][j] < matrix[i+1][j]:\\n if dp[i+1][j] == -1:\\n self.dpizer(matrix,dp,i+1,j)\\n if dp[i+1][j] +1 > val:\\n val = dp[i+1][j] +1\\n if i != 0:\\n if matrix[i][j] < matrix[i-1][j]:\\n if dp[i-1][j] == -1:\\n self.dpizer(matrix,dp,i-1,j)\\n if dp[i-1][j] +1 > val:\\n val = dp[i-1][j] +1\\n if j != 0:\\n if matrix[i][j] < matrix[i][j-1]:\\n if dp[i][j-1] == -1:\\n self.dpizer(matrix,dp,i,j-1)\\n if dp[i][j-1] +1 > val:\\n val = dp[i][j-1] + 1\\n if j != len(matrix[0])-1:\\n if matrix[i][j] < matrix[i][j+1]:\\n if dp[i][j+1] == -1:\\n self.dpizer(matrix,dp,i,j+1)\\n if dp[i][j+1] +1 > val:\\n val = dp[i][j+1] +1\\n dp[i][j] = val\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = [[-1 for i in range(len(matrix[0]))] for i in range(len(matrix))]\\n maxs = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if dp[i][j] != -1:\\n continue\\n self.dpizer(matrix,dp,i,j)\\n if dp[i][j] > maxs:\\n maxs = dp[i][j]\\n return maxs\\n\\n \",\n \"memory\": \"17555\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n path = [[1,0], [-1, 0], [0, 1], [0, -1]]\\n global record\\n record = []\\n for i in range(len(matrix)):\\n record.append([-1]*len(matrix[0]))\\n def dfs(matrix, x, y):\\n step = 0\\n for i in path:\\n if len(matrix) > (x + i[0]) >=0 and len(matrix[0]) > (y + i[1]) >=0 and \\\\\\n matrix[x + i[0]][y + i[1]] > matrix[x][y]:\\n if record[x + i[0]][y + i[1]] == -1:\\n step = max(step, 1 + dfs(matrix, x + i[0], y + i[1]))\\n else:\\n step = max(step,1 + record[x + i[0]][y + i[1]])\\n record[x][y] = step\\n return record[x][y]\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if record[i][j] == -1:\\n dfs(matrix, i, j)\\n output = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])): \\n output = max(output, record[i][j]) \\n return output + 1\\n\",\n \"memory\": \"17555\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n [\\n [9,9,4],\\n [6,6,8],\\n [2,1,1]\\n ]\\n \\n [\\n [1,1,2],\\n [2,2,1],\\n [3,4,2]\\n ]\\n \\\"\\\"\\\"\\n n = len(matrix)\\n m = len(matrix[0])\\n visited = [[0] * m for _ in range(n)]\\n \\n def findInceasingPath(r, c, prev):\\n nonlocal n\\n nonlocal m\\n \\n if r < 0 or r == n or c < 0 or c == m:\\n return 0\\n \\n if matrix[r][c] <= prev:\\n return 0\\n \\n if visited[r][c] > 0:\\n return visited[r][c]\\n \\n maxLen = 0\\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\\n \\n visited[r][c] = maxLen + 1\\n \\n return visited[r][c]\\n \\n \\n maxPathLen = 0\\n for r in range(n):\\n for c in range(m):\\n pathLen = findInceasingPath(r, c, -1)\\n maxPathLen = max(maxPathLen, pathLen)\\n \\n return maxPathLen\\n \\n \\n \",\n \"memory\": \"17685\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n directions = lambda x, y : [(x + 1, y), (x, y + 1), (x - 1, y), (x, y - 1)]\\n dp = [ [None] * n for _ in range(m) ]\\n \\n def dfs(r, c):\\n if dp[r][c]:\\n return dp[r][c]\\n dp[r][c] = 1\\n for nr, nc in directions(r, c):\\n if 0 <= nr < m and 0 <= nc < n and matrix[r][c] < matrix[nr][nc]:\\n dp[r][c] = max(dp[r][c], 1 + dfs(nr, nc))\\n return dp[r][c]\\n\\n return max(dfs(r, c) for r in range(m) for c in range(n))\",\n \"memory\": \"17685\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n [\\n [9,9,4],\\n [6,6,8],\\n [2,1,1]\\n ]\\n \\n [\\n [1,1,2],\\n [2,2,1],\\n [3,4,2]\\n ]\\n \\\"\\\"\\\"\\n n = len(matrix)\\n m = len(matrix[0])\\n visited = [[0] * m for _ in range(n)]\\n \\n def findInceasingPath(r, c, prev):\\n nonlocal n\\n nonlocal m\\n \\n if r < 0 or r == n or c < 0 or c == m:\\n return 0\\n \\n if matrix[r][c] <= prev:\\n return 0\\n \\n if visited[r][c] > 0:\\n return visited[r][c]\\n \\n maxLen = 0\\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\\n \\n visited[r][c] = maxLen + 1\\n \\n return visited[r][c]\\n \\n \\n maxPathLen = 0\\n for r in range(n):\\n for c in range(m):\\n pathLen = findInceasingPath(r, c, -1)\\n maxPathLen = max(maxPathLen, pathLen)\\n \\n return maxPathLen\\n \\n \\n \",\n \"memory\": \"17815\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n [\\n [9,9,4],\\n [6,6,8],\\n [2,1,1]\\n ]\\n \\n [\\n [1,1,2],\\n [2,2,1],\\n [3,4,2]\\n ]\\n \\\"\\\"\\\"\\n n = len(matrix)\\n m = len(matrix[0])\\n visited = [[0] * m for _ in range(n)]\\n \\n def findInceasingPath(r, c, prev):\\n nonlocal n\\n nonlocal m\\n \\n if r < 0 or r == n or c < 0 or c == m:\\n return 0\\n \\n if matrix[r][c] <= prev:\\n return 0\\n \\n if visited[r][c] > 0:\\n return visited[r][c]\\n \\n maxLen = 0\\n maxLen = max(maxLen, findInceasingPath(r + 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c + 1, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r - 1, c, matrix[r][c]))\\n maxLen = max(maxLen, findInceasingPath(r, c - 1, matrix[r][c]))\\n \\n visited[r][c] = maxLen + 1\\n \\n return visited[r][c]\\n \\n \\n maxPathLen = 0\\n for r in range(n):\\n for c in range(m):\\n pathLen = findInceasingPath(r, c, -1)\\n maxPathLen = max(maxPathLen, pathLen)\\n \\n return maxPathLen\\n \\n \\n \",\n \"memory\": \"17815\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n dp = [[1] * n for _ in range(m)]\\n directions = ((0, 1), (1, 0), (0, -1), (-1, 0))\\n def dfs(x, y):\\n for ax, ay in directions:\\n nx = ax + x\\n ny = ay + y\\n if 0 <= nx < m and 0 <= ny < n and matrix[nx][ny] > matrix[x][y]:\\n if dp[nx][ny] > 1:\\n dp[x][y] = max(dp[x][y], dp[nx][ny] + 1)\\n else:\\n dp[x][y] = max(dp[x][y], dfs(nx, ny) + 1)\\n return dp[x][y]\\n ans = 0\\n for i in range(m):\\n for j in range(n):\\n if dp[i][j] == 1:\\n ans = max(ans, dfs(i, j))\\n return ans\\n # dp = [[1] * n for _ in range(m)]\\n\\n # for i in range(m):\\n # for j in range(n):\",\n \"memory\": \"17945\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n m, n = len(matrix), len(matrix[0])\\n # Memoization table to store the longest increasing path starting from each cell\\n memo = [[-1] * n for _ in range(m)]\\n \\n def dfs(i, j):\\n # If the result for this cell is already computed, return it\\n if memo[i][j] != -1:\\n return memo[i][j]\\n \\n # Start with length 1 (the current cell itself)\\n max_len = 1\\n for x, y in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n ni, nj = i + x, j + y\\n # Check if the new position is valid and the value is greater than the current cell\\n if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] > matrix[i][j]:\\n # Explore the new cell and update the max length\\n max_len = max(max_len, 1 + dfs(ni, nj))\\n \\n # Memoize the result for the current cell\\n memo[i][j] = max_len\\n return memo[i][j]\\n \\n # Iterate over all cells and compute the longest increasing path starting from each one\\n longest_path = 0\\n for i in range(m):\\n for j in range(n):\\n longest_path = max(longest_path, dfs(i, j))\\n \\n return longest_path\",\n \"memory\": \"17945\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m,n=len(matrix), len(matrix[0])\\n res=[[-1]*n for _ in range(m)]\\n dir=[[-1,0],[1,0],[0,-1],[0,1]]\\n def dfs(x,y, visited):\\n if visited[x][y]:\\n return res[x][y]\\n visited[x][y]=True\\n path=0\\n for d in dir:\\n dx,dy=x+d[0],y+d[1] \\n if dx>=0 and dx<m and dy>=0 and dy<n and matrix[dx][dy]>matrix[x][y]:\\n path=max(path,dfs(dx,dy,visited))\\n res[x][y]=path+1\\n return path+1\\n ret=0\\n visited=[[False]*n for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n ret=max(ret,dfs(i,j,visited))\\n return ret\\n\\n \",\n \"memory\": \"18075\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [(1, 0), (-1, 0), (0, 1), (0, - 1)]\\n ans = 1\\n nr, nc = len(matrix), len(matrix[0])\\n pq = []\\n\\n for r in range(nr):\\n for c in range(nc):\\n heapq.heappush(pq, (matrix[r][c], r, c))\\n \\n dp = [[1] * nc for _ in range(nr)]\\n\\n for val, r, c in heapq.nsmallest(len(pq), pq):\\n for dr, dc in directions: \\n row, col = r + dr, c + dc\\n\\n if nr > row >= 0 and nc > col >= 0 and matrix[row][col] < matrix[r][c]:\\n dp[r][c] = max(1 + dp[row][col], dp[r][c])\\n ans = max(ans, dp[r][c])\\n \\n return ans\\n\",\n \"memory\": \"18075\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, matrix, i, j):\\n if not (0 <= i < len(matrix) and 0 <= j < len(matrix[0])):\\n return 0\\n\\n if (i, j) in self.cache:\\n return self.cache[(i, j)]\\n\\n max_path = 0\\n for x, y in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n if 0 <= i+x < len(matrix) and 0 <= j+y < len(matrix[0]) and matrix[i+x][j+y] > matrix[i][j]:\\n max_path = max(max_path, self.dfs(matrix, i+x, j+y))\\n self.cache[(i, j)] = max_path + 1\\n return max_path + 1\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n self.cache = {}\\n max_so_far = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n max_so_far = max(self.dfs(matrix, i, j), max_so_far)\\n return max_so_far\",\n \"memory\": \"18205\"\n },\n {\n \"code\": \"# 2024/09/15\\n# 面试前刷Doordash高频题\\n#\\n# 这题有点意思，相当于longest increasing subset的二维变种\\n# 能否用DP，关键问题\\n# 应该没问题，首先不会有使用同一个元素的情况，因为是严格increasing\\n# 接下去问题是如何填表了，如果用Bottom up的话\\n# 感觉这题用top down更合适，不用考虑填表问题\\n# 那就DFS，这里问题是去重怎么弄？想起来应该是之前有讨论DFS怎么detect cycle，需要有一个visited表示当前这个path的parents，和传统的DFS的visited有点不一样\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n memo = {}\\n global_max = [0]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if (i, j) not in memo:\\n visited = set()\\n visited.add((i, j))\\n self.helper(i, j, visited, memo, matrix, global_max)\\n\\n return global_max[0]\\n\\n def helper(self, row, col, visited, memo, matrix, global_max):\\n if (row, col) in memo:\\n return memo[(row, col)]\\n\\n local_max = 1\\n for dx, dy in [1, 0], [-1, 0], [0, 1], [0, -1]:\\n x = row + dx\\n y = col + dy\\n if 0 <= x < len(matrix) and 0 <= y < len(matrix[0]):\\n if (x, y) in visited:\\n continue\\n \\n if matrix[x][y] < matrix[row][col]:\\n visited.add((x, y))\\n local_max = max(local_max, 1 + self.helper(x, y, visited, memo, matrix, global_max))\\n visited.remove((x, y))\\n\\n memo[(row, col)] = local_max\\n global_max[0] = max(global_max[0], local_max)\\n\\n return local_max\",\n \"memory\": \"18335\"\n },\n {\n \"code\": \"class Solution:\\n def dp(self, i, j):\\n key = (i, j)\\n if key in self.cache:\\n return self.cache[key]\\n ans = 0\\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0]]:\\n a = i + di\\n b = j + dj\\n if a < 0 or a >= self.m or b < 0 or b >= self.n:\\n continue\\n if self.matrix[i][j] <= self.matrix[a][b]:\\n continue\\n ans = max(ans, self.dp(a, b))\\n ans += 1\\n self.cache[key] = ans\\n return ans\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n self.matrix = matrix\\n self.m = len(matrix)\\n self.n = len(matrix[0])\\n self.cache = {}\\n ans = 0\\n for i in range(self.m):\\n for j in range(self.n):\\n ans = max(ans, self.dp(i, j))\\n return ans\",\n \"memory\": \"18335\"\n },\n {\n \"code\": \"class Solution:\\n\\n def helper(self,i,j,c,m,s):\\n\\n\\n\\n if(i >= 0 and i < len(m) and j >= 0 and j < len(m[0]) and m[i][j] > c ):\\n\\n if((i,j) in s):\\n\\n return s[(i,j)]\\n\\n s[(i,j)] = max(self.helper(i+1,j,m[i][j],m,s),\\n self.helper(i-1,j,m[i][j],m,s),\\n self.helper(i,j+1,m[i][j],m,s),\\n self.helper(i,j-1,m[i][j],m,s)) + 1 \\n \\n return s[(i,j)]\\n \\n else:\\n\\n return 0 \\n\\n \\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n s = {}\\n max_ = float('-inf')\\n for i in range(0,len(matrix)):\\n for j in range(0,len(matrix[0])):\\n max_ = max(max_,self.helper(i,j,-1,matrix,s))\\n \\n return max_ \\n \",\n \"memory\": \"18465\"\n },\n {\n \"code\": \"class Solution:\\n dictionary = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dp = [[-1 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n self.longestIncreasingPathHelper(matrix, dp, i, j)\\n res = max(res, dp[i][j])\\n return res\\n \\n \\n def longestIncreasingPathHelper(self, matrix: List[List[int]], dp: List[List[int]], r: int, c: int):\\n dp[r][c] = 1\\n for dir_x, dir_y in self.dictionary:\\n new_r, new_c = dir_x + r, dir_y + c\\n if (0 <= new_r < len(matrix) and 0 <= new_c < len(matrix[0])):\\n if matrix[new_r][new_c] > matrix[r][c]:\\n if dp[new_r][new_c] == -1:\\n self.longestIncreasingPathHelper(matrix, dp, new_r, new_c)\\n dp[r][c] = max(dp[r][c], 1 + dp[new_r][new_c])\",\n \"memory\": \"18465\"\n },\n {\n \"code\": \"class Solution:\\n def checkValid(self, i, j, n, m):\\n if i>=0 and i<n and j>=0 and j<m:\\n return True\\n return False\\n\\n def dp(self, matrix, i, j): # longest incr path starting at (i, j)\\n if self.mat[i][j] != -1:\\n return self.mat[i][j]\\n n = len(matrix)\\n m = len(matrix[0])\\n longestPath = 1\\n for dir in self.dirs:\\n x = i + dir[0]\\n y = j + dir[1]\\n if self.checkValid(x, y, n, m) and matrix[x][y] > matrix[i][j]:\\n longestPath = max(longestPath, 1 + self.dp(matrix, x, y))\\n self.mat[i][j] = longestPath\\n return self.mat[i][j]\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n self.dirs = [[0, -1], [0, 1], [1, 0], [-1, 0]]\\n self.mat = []\\n n = len(matrix)\\n m = len(matrix[0])\\n for i in range(n):\\n row = []\\n for j in range(m):\\n row.append(-1)\\n self.mat.append(row)\\n maxLen = 1\\n for i in range(n):\\n for j in range(m):\\n maxLen = max(maxLen, self.dp(matrix, i, j))\\n # print (self.mat)\\n return maxLen\\n \\n\\n\\n\\n\\n \",\n \"memory\": \"18595\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def __init__(self):\\n self.dirs = ((0, 1), (0, -1), (1, 0), (-1, 0))\\n self.n = 0\\n self.m = 0\\n self.cache = []\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n self.n, self.m = len(matrix), len(matrix[0])\\n self.cache = [[0] * self.m for _ in range(self.n)]\\n\\n ans = 0\\n\\n for i in range(self.n):\\n for j in range(self.m):\\n ans = max(ans, self.dfs(matrix, i, j))\\n return ans\\n\\n def dfs(self, matrix: List[List[int]], i: int, j: int) -> int:\\n if self.cache[i][j] != 0:\\n return self.cache[i][j]\\n \\n max_length = 1\\n for dir in self.dirs:\\n x, y = dir[0] + i, dir[1] + j\\n if 0 <= x < self.n and 0 <= y < self.m and matrix[x][y] > matrix[i][j]:\\n max_length = max(max_length, 1 + self.dfs(matrix, x, y))\\n \\n self.cache[i][j] = max_length\\n return self.cache[i][j]\\n\",\n \"memory\": \"18725\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n mem_matrix = [[0 for _ in range(len(matrix[0]))] for _ in range(len(matrix))]\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n largest_count = 0\\n \\n def dfs(i, j):\\n if mem_matrix[i][j] != 0:\\n return mem_matrix[i][j]\\n \\n max_count = 1\\n \\n for direction in directions:\\n new_i, new_j = i+direction[0], j+direction[1]\\n if new_i < 0 or new_i==len(matrix):\\n continue\\n if new_j < 0 or new_j==len(matrix[0]):\\n continue\\n if matrix[i][j] >= matrix[new_i][new_j]:\\n continue\\n max_count = max(max_count, dfs(new_i, new_j) + 1)\\n \\n \\n mem_matrix[i][j] = max_count\\n \\n return max_count\\n \\n \\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n largest_count = max(largest_count, dfs(i, j))\\n \\n \\n \\n return largest_count\\n \\n \\n \",\n \"memory\": \"18725\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n longestPaths = [[0] * COLS for _ in range(ROWS)]\\n\\n def getLongestPath(r, c, prev):\\n if min(r, c) < 0 or r == ROWS or c == COLS or matrix[r][c] <= prev:\\n return 0 \\n if longestPaths[r][c] != 0:\\n return longestPaths[r][c]\\n\\n longestPaths[r][c] = 1\\n for dr, dc in [(0, 1), (0, -1), (-1, 0), (1, 0)]:\\n longestPaths[r][c] = max(longestPaths[r][c],\\n 1 + getLongestPath(r + dr, c + dc, matrix[r][c]))\\n return longestPaths[r][c]\\n \\n res = 1\\n for r in range(ROWS):\\n for c in range(COLS):\\n res = max(res, getLongestPath(r, c, -1))\\n return res\",\n \"memory\": \"18855\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [(0,1), (0,-1), (1,0), (-1,0)]\\n \\n m, n = len(matrix), len(matrix[0])\\n \\n dp = [[-1 for _ in range(n)] for _ in range(m)]\\n \\n def dfs(x, y):\\n if dp[x][y] != -1:\\n return dp[x][y]\\n \\n max_path = 1\\n \\n for direction in directions:\\n new_x, new_y = x + direction[0], y + direction[1]\\n \\n if 0 <= new_x < m and 0 <= new_y < n:\\n if matrix[new_x][new_y] > matrix[x][y]:\\n max_path = max(max_path, 1 + dfs(new_x, new_y))\\n \\n dp[x][y] = max_path\\n return dp[x][y]\\n \\n max_length = 0\\n for i in range(m):\\n for j in range(n):\\n max_length = max(max_length, dfs(i, j))\\n \\n return max_length\",\n \"memory\": \"18855\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n longest_path = 0\\n rows = len(matrix)\\n cols = len(matrix[0])\\n cache = [[None] * cols for _ in range(rows)]\\n \\n def dfs(x: int, y: int) -> int:\\n if cache[x][y]:\\n return cache[x][y]\\n longest_path = 0\\n for i, j in [(0,1),(0,-1),(1,0),(-1,0)]:\\n newX, newY = x+i, y+j\\n if newX >= 0 and newX < rows and newY >= 0 and newY < cols and matrix[newX][newY] > matrix[x][y]:\\n longest_path = max(longest_path, dfs(newX, newY))\\n cache[x][y] = longest_path + 1\\n return cache[x][y]\\n \\n for x in range(rows):\\n for y in range(cols):\\n longest_path = max(longest_path, dfs(x, y))\\n \\n return longest_path\",\n \"memory\": \"18985\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n \\n memo = [[0] * cols for _ in range(rows)]\\n longest = 0\\n \\n def dfs(r,c):\\n if memo[r][c] != 0:\\n return memo[r][c]\\n \\n length = 1\\n \\n for dx, dy in (0,1), (0,-1), (1,0), (-1,0):\\n nr = dx + r\\n nc = dy + c\\n if (0 <= nr < rows and 0 <= nc < cols and\\n matrix[nr][nc] > matrix[r][c]):\\n length = max(length, 1 + dfs(nr,nc))\\n memo[r][c] = length\\n return length\\n \\n for r in range(rows):\\n for c in range(cols):\\n longest = max(longest, dfs(r,c))\\n \\n return longest\\n \\n \\n \",\n \"memory\": \"18985\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n h = len(matrix)\\n w = len(matrix[0])\\n\\n dp = [[-1 for _ in range(w)] for _ in range(h)] # Initialize with -1 to indicate unvisited\\n dc = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n\\n def dfs(i, j, pr = -1):\\n if i < 0 or i >= h or j < 0 or j >= w or matrix[i][j] <= pr:\\n return 0 # Invalid move, so return 0 as no path\\n\\n if dp[i][j] != -1:\\n return dp[i][j] # Return the cached value if it exists\\n\\n max_path = 1 # Start with length 1 (the current cell)\\n \\n for d in dc:\\n max_path = max(max_path, 1 + dfs(i + d[0], j + d[1], matrix[i][j]))\\n\\n dp[i][j] = max_path # Cache the result in dp table\\n return max_path\\n \\n res = 0\\n for i in range(h):\\n for j in range(w):\\n res = max(res, dfs(i, j))\\n \\n return res\\n\",\n \"memory\": \"19115\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n h = len(matrix)\\n w = len(matrix[0])\\n\\n dp = [[-1 for _ in range(w)] for _ in range(h)] # Initialize with -1 to indicate unvisited\\n dc = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n\\n def dfs(i, j, pr = -1):\\n if i < 0 or i >= h or j < 0 or j >= w or matrix[i][j] <= pr:\\n return 0 # Invalid move, so return 0 as no path\\n\\n if dp[i][j] != -1:\\n return dp[i][j] # Return the cached value if it exists\\n\\n max_path = 1 # Start with length 1 (the current cell)\\n \\n for d in dc:\\n max_path = max(max_path, 1 + dfs(i + d[0], j + d[1], matrix[i][j]))\\n\\n dp[i][j] = max_path # Cache the result in dp table\\n return max_path\\n \\n res = 0\\n for i in range(h):\\n for j in range(w):\\n res = max(res, dfs(i, j))\\n \\n return res\\n\",\n \"memory\": \"19115\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n self.n = len(matrix)\\n self.m = len(matrix[0])\\n max_len = 0\\n cache = [[0 for _ in range(self.m)] for _ in range(self.n)]\\n for i in range(self.n):\\n for j in range(self.m):\\n max_len = max(self.dfs(i, j, matrix, cache), max_len)\\n return max_len\\n \\n def dfs(self, i:int, j:int, matrix: List[List[int]], cache:List[List[int]])-> int:\\n dir_list = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n \\n if (cache[i][j] != 0):\\n return cache[i][j]\\n \\n for d in dir_list:\\n x = i + d[0]\\n y = j + d[1]\\n if (0 <= x and x < self.n and 0 <= y and y < self.m and matrix[x][y] > matrix[i][j]):\\n cache[i][j] = max(self.dfs(x, y, matrix, cache), cache[i][j])\\n \\n cache[i][j] +=1\\n \\n return cache[i][j]\\n \",\n \"memory\": \"19245\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n directions = [[0,-1], [0,1], [1,0], [-1,0]]\\n def _dfs(r, c, memo):\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n m = 1\\n for rn, cn in directions:\\n if (\\n r + rn < len(matrix) and r + rn >= 0 and\\n c + cn < len(matrix[0]) and c + cn >= 0 and\\n matrix[r + rn][c + cn] > matrix[r][c]\\n ):\\n steps = 1 + _dfs(r + rn, c + cn, memo)\\n m = max(m, steps)\\n \\n memo[(r, c)] = m\\n return memo[(r, c)]\\n \\n if not matrix:\\n return 0\\n \\n res = []\\n memo = {}\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n res.append(_dfs(r, c, memo))\\n \\n return max(res)\\n \\n \\n \\n \",\n \"memory\": \"19245\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n c_long = 1\\n memeoize = {}\\n\\n def dfs(i, j, memoize):\\n nonlocal c_long\\n if (i, j) not in memoize:\\n \\n res = 0\\n for x,y in [(0,1), (0, -1), (1, 0), (-1, 0)]:\\n nx, ny = x + i, y + j\\n if 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] > matrix[i][j]:\\n res = max(res, dfs(nx, ny, memoize))\\n memoize[(i,j)] = 1 + res\\n c_long = max(c_long, memoize[(i,j)])\\n return memoize[(i,j)]\\n \\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dfs(i, j, memeoize)\\n\\n \\n return c_long\\n \",\n \"memory\": \"19375\"\n },\n {\n \"code\": \"r'''\\n# Requirements\\n\\nm = len(matrix), n = len(matrix[i])\\n1 <= m, n <= 200\\n0 <= matrix[i] <= 2^31 - 1\\n\\n# Edge cases\\n\\n1. No increasing paths\\n\\n# Solutions\\n\\n1. Brute force, backtracking\\n - O(mn * mn) time, O(mn) auxiliary space\\n2. Topological sort\\n - O(mn) time, O(mn) auxiliary space\\n\\n9 9 4\\n6 8 8\\n2 1 1\\n'''\\nDIRECTIONS = [(1, 0), (0, -1), (-1, 0), (0, 1)]\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n # Construct adjacency lists and count indegrees\\n adj_lists = [[[] for _ in range(cols)] for _ in range(rows)]\\n indegrees = [[0 for _ in range(cols)] for _ in range(rows)]\\n\\n for r in range(rows):\\n for c in range(cols):\\n for dr, dc in DIRECTIONS:\\n nr, nc = r + dr, c + dc\\n if nr < 0 or nr >= rows or nc < 0 or nc >= cols or matrix[nr][nc] <= matrix[r][c]:\\n continue\\n\\n adj_lists[r][c].append((nr, nc))\\n indegrees[nr][nc] += 1\\n\\n # Find longest increasing path\\n sources, max_length = deque(), 0\\n\\n for r in range(rows):\\n for c in range(cols):\\n if indegrees[r][c] == 0 and adj_lists[r][c]:\\n sources.append((r, c))\\n\\n while sources:\\n max_length += 1\\n for _ in range(len(sources)):\\n r, c = sources.popleft()\\n\\n for nr, nc in adj_lists[r][c]:\\n indegrees[nr][nc] -= 1\\n\\n if indegrees[nr][nc] == 0:\\n sources.append((nr, nc))\\n\\n return max(max_length, 1)\",\n \"memory\": \"19505\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n 1. Brute force: DFS from every node and calc the length of increasing path\\n O(n^2)\\n\\n 2. just memoize the result before returning to avoid re-computation O(n)\\n \\\"\\\"\\\"\\n\\n visited = set()\\n ans = 0\\n m = len(matrix)\\n n = len(matrix[0])\\n memo = {}\\n\\n for i in range(m):\\n for j in range(n):\\n if (i,j) not in memo:\\n currLen = self.dfs(i,j, matrix, memo)\\n ans = max(currLen, ans)\\n return ans\\n \\n def dfs(self, row, col, matrix, memo):\\n m, n = len(matrix), len(matrix[0])\\n if (row, col) not in memo:\\n currLen = 1\\n ans = 1\\n directions = [(0,1),(0,-1),(-1,0), (1,0)]\\n # explore children\\n for dx,dy in directions:\\n nx,ny = row+dx, col+dy\\n if 0<=nx<m and 0<=ny<n and (nx,ny) and matrix[nx][ny]>matrix[row][col]:\\n currLen = 1 + self.dfs(nx,ny, matrix, memo)\\n ans = max(ans, currLen)\\n memo[(row,col)] = ans\\n return memo[(row,col)]\\n \\n \",\n \"memory\": \"19635\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n # Initialize memoization dictionary\\n seen = {}\\n \\n # Dimensions of the matrix\\n m, n = len(matrix), len(matrix[0])\\n\\n # Find the longest increasing path starting from each cell\\n longest_path = 0\\n for i in range(m):\\n for j in range(n):\\n longest_path = max(longest_path, self.dfs(matrix, i, j, seen))\\n \\n return longest_path\\n\\n def inBounds(self, matrix: List[List[int]], i: int, j: int) -> bool:\\n # Check if the indices are within the matrix bounds\\n return 0 <= i < len(matrix) and 0 <= j < len(matrix[0])\\n\\n def dfs(self, matrix: List[List[int]], i: int, j: int, seen: dict) -> int:\\n # If already computed the result for this cell, return it\\n if (i, j) in seen:\\n return seen[(i, j)]\\n \\n # Define the possible directions (up, down, left, right)\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n max_path = 1 # The path length at least includes the current cell\\n \\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n if self.inBounds(matrix, ni, nj) and matrix[ni][nj] > matrix[i][j]:\\n max_path = max(max_path, 1 + self.dfs(matrix, ni, nj, seen))\\n \\n # Memoize the result for the current cell\\n seen[(i, j)] = max_path\\n return max_path\\n\",\n \"memory\": \"19765\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n directions = [[0,-1], [0,1], [1,0], [-1,0]]\\n def _dfs(r, c, memo):\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n paths = [1]\\n for rn, cn in directions:\\n if (\\n r + rn < len(matrix) and r + rn >= 0 and\\n c + cn < len(matrix[0]) and c + cn >= 0 and\\n matrix[r + rn][c + cn] > matrix[r][c]\\n ):\\n curr = 1 + _dfs(r + rn, c + cn, memo)\\n paths.append(curr)\\n \\n memo[(r, c)] = max(paths)\\n return memo[(r, c)]\\n \\n if not matrix:\\n return 0\\n \\n res = []\\n memo = {}\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n res.append(_dfs(r, c, memo))\\n \\n # print(res)\\n # print(memo)\\n return max(res)\\n \\n \\n \\n \",\n \"memory\": \"19765\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n m, n = len(matrix), len(matrix[0])\\n cache = [[-1] * n for _ in range(m)]\\n \\n def dfs(i, j, prev_val):\\n if i < 0 or i >= m or j < 0 or j >= n or matrix[i][j] <= prev_val:\\n return 0\\n \\n if cache[i][j] != -1:\\n return cache[i][j]\\n \\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n max_path = 1\\n \\n for dx, dy in directions:\\n x, y = i + dx, j + dy\\n max_path = max(max_path, 1 + dfs(x, y, matrix[i][j]))\\n \\n cache[i][j] = max_path\\n return max_path\\n \\n max_length = 0\\n for i in range(m):\\n for j in range(n):\\n max_length = max(max_length, dfs(i, j, -1))\\n \\n return max_length\\n\\n# Example usage:\\nsolution = Solution()\\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\",\n \"memory\": \"19895\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix:\\n return 0\\n \\n rows, cols = len(matrix), len(matrix[0])\\n cache = [[-1] * cols for _ in range(rows)]\\n \\n def dfs(i, j, prev):\\n if i < 0 or i >= rows or j < 0 or j >= cols or matrix[i][j] <= prev:\\n return 0\\n \\n if cache[i][j] != -1:\\n return cache[i][j]\\n \\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n max_length = 1\\n for dx, dy in directions:\\n x, y = i + dx, j + dy\\n max_length = max(max_length, 1 + dfs(x, y, matrix[i][j]))\\n \\n cache[i][j] = max_length\\n return max_length\\n \\n max_path = 1\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j, -1))\\n \\n return max_path\\n\\n# Example usage:\\nsolution = Solution()\\nmatrix = [[9,9,4],[6,6,8],[2,1,1]]\\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\\n\\nmatrix = [[3,4,5],[3,2,6],[2,2,1]]\\nprint(solution.longestIncreasingPath(matrix)) # Output: 4\\n\\nmatrix = [[1]]\\nprint(solution.longestIncreasingPath(matrix)) # Output: 1\",\n \"memory\": \"19895\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n graph = defaultdict(list)\\n indegrees = [0] * (m * n)\\n\\n for r in range(m):\\n for c in range(n):\\n for nr, nc in [(r, c-1), (r, c+1), (r-1, c), (r+1, c)]:\\n if 0 <= nr < m and 0 <= nc < n and matrix[nr][nc] > matrix[r][c]:\\n graph[r*n+c].append(nr*n+nc)\\n indegrees[nr*n+nc] += 1\\n \\n queue = deque([i for i in range(m*n) if indegrees[i] == 0])\\n path_lengths = [1] * (m * n)\\n\\n while queue:\\n u = queue.popleft()\\n for v in graph[u]:\\n indegrees[v] -= 1\\n if indegrees[v] == 0:\\n queue.append(v)\\n path_lengths[v] = max(path_lengths[v], path_lengths[u] + 1)\\n\\n return max(path_lengths)\",\n \"memory\": \"20025\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n def get_neighbors(matrix, node):\\n m, n = len(matrix), len(matrix[0])\\n i, j = node\\n neighbors = []\\n if (i+1 < m) and (matrix[i+1][j] > matrix[i][j]):\\n neighbors.append((i+1, j))\\n\\n if (i-1 >= 0) and (matrix[i-1][j] > matrix[i][j]):\\n neighbors.append((i-1, j))\\n\\n if (j+1 < n) and (matrix[i][j+1] > matrix[i][j]):\\n neighbors.append((i, j+1))\\n\\n if (j-1 >= 0) and (matrix[i][j-1] > matrix[i][j]):\\n neighbors.append((i, j-1))\\n \\n return neighbors\\n\\n\\n def dfs(source, finishing_time, visited):\\n \\n visited.add(source)\\n\\n for neighbor in get_neighbors(matrix, source):\\n if neighbor not in visited:\\n dfs(neighbor, finishing_time, visited)\\n\\n finishing_time.append(source)\\n\\n\\n def find_topological_order(matrix):\\n m, n = len(matrix), len(matrix[0])\\n visited = set()\\n finishing_time = []\\n \\n for i in range(m):\\n for j in range(n):\\n if (i,j) not in visited:\\n dfs((i,j), finishing_time, visited)\\n\\n return list(reversed(finishing_time))\\n\\n\\n\\n # Find The Longest Path in DAG\\n topological_order = find_topological_order(matrix)\\n\\n m, n = len(matrix), len(matrix[0])\\n longest_path = {}\\n for i in range(m):\\n for j in range(n):\\n longest_path[(i,j)] = 1\\n\\n for u in topological_order:\\n for v in get_neighbors(matrix, u):\\n if longest_path[v] < 1 + longest_path[u]:\\n longest_path[v] = 1 + longest_path[u]\\n \\n return max(longest_path.values())\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"memory\": \"20155\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, g: List[List[int]]) -> int:\\n def dfs(g,i,j,e):\\n if i<0 or j<0 or i>=len(g) or j>=len(g[0]) or g[i][j]<=e:\\n return 0\\n if (i,j) in d:\\n return d[(i,j)]\\n k1=1+dfs(g,i-1,j,g[i][j])\\n k2=1+dfs(g,i+1,j,g[i][j])\\n k3=1+dfs(g,i,j+1,g[i][j])\\n k4=1+dfs(g,i,j-1,g[i][j])\\n d[(i,j)]=max(k1,k2,k3,k4)\\n return max(k1,k2,k3,k4)\\n \\n \\n \\n max_len=1\\n d={}\\n for i in range(len(g)):\\n for j in range(len(g[0])):\\n \\n c1=1+dfs(g,i-1,j,g[i][j])\\n c2=1+dfs(g,i+1,j,g[i][j])\\n c3=1+dfs(g,i,j+1,g[i][j])\\n c4=1+dfs(g,i,j-1,g[i][j])\\n \\n if max(c1,c2,c3,c4)>max_len:\\n max_len=max(c1,c2,c3,c4)\\n return max_len\",\n \"memory\": \"20155\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n size = m * n\\n g = defaultdict(list)\\n\\n def add(a,b):\\n g[a].append(b)\\n \\n def toSingle(i,j):\\n return i * n + j\\n \\n for i in range(m):\\n for j in range(n):\\n if i - 1 >= 0 and matrix[i-1][j] > matrix[i][j]:\\n add(toSingle(i,j), toSingle(i-1,j))\\n if i + 1 < m and matrix[i+1][j] > matrix[i][j]:\\n add(toSingle(i,j), toSingle(i+1,j))\\n if j - 1 >= 0 and matrix[i][j-1] > matrix[i][j]:\\n add(toSingle(i,j), toSingle(i,j-1))\\n if j+1 < n and matrix[i][j+1] > matrix[i][j]:\\n add(toSingle(i,j), toSingle(i,j+1))\\n degree = [0]*size\\n q = deque()\\n for k,arr in g.items():\\n # print(k,arr)\\n for v in arr:\\n degree[v] += 1\\n dis = [1]*size\\n for i, cnt in enumerate(degree):\\n if cnt == 0:\\n q.append((i, 1))\\n dis[i] = 1\\n \\n while q:\\n node, distance = q.popleft()\\n for nei in g[node]:\\n if distance + 1 > dis[nei]:\\n dis[nei] = distance + 1\\n q.append((nei, dis[nei]))\\n # print(dis)\\n return max(dis)\\n\\n \\n\",\n \"memory\": \"20285\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n adj = defaultdict(list)\\n ins = [0] * (m * n)\\n\\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\\n\\n for i in range(m):\\n for j in range(n):\\n value = matrix[i][j]\\n currIdx = i * n + j\\n\\n for d in dir:\\n x, y = i + d[0], j + d[1]\\n\\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\\n newIdx = x * n + y\\n\\n adj[currIdx].append(newIdx)\\n ins[newIdx] += 1\\n \\n q = deque()\\n for i in range(m*n):\\n if ins[i] == 0:\\n q.append((i, 1))\\n \\n ans = 0\\n\\n while q:\\n node, dst = q.popleft()\\n ans = max(ans, dst)\\n\\n for u in adj[node]:\\n ins[u] -= 1\\n\\n if ins[u] == 0:\\n q.append((u, dst + 1))\\n \\n return ans\\n\\n \\n def isValid(self, x, y, m, n):\\n return 0 <= x < m and 0 <= y < n\",\n \"memory\": \"20415\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n adj = defaultdict(list)\\n ins = [0] * (m * n)\\n\\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\\n\\n for i in range(m):\\n for j in range(n):\\n value = matrix[i][j]\\n currIdx = i * n + j\\n\\n for d in dir:\\n x, y = i + d[0], j + d[1]\\n\\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\\n newIdx = x * n + y\\n\\n adj[currIdx].append(newIdx)\\n ins[newIdx] += 1\\n \\n q = deque()\\n for i in range(m*n):\\n if ins[i] == 0:\\n q.append((i, 1))\\n \\n ans = 0\\n\\n while q:\\n node, dst = q.popleft()\\n ans = max(ans, dst)\\n\\n for u in adj[node]:\\n ins[u] -= 1\\n\\n if ins[u] == 0:\\n q.append((u, dst + 1))\\n \\n return ans\\n\\n \\n def isValid(self, x, y, m, n):\\n return 0 <= x < m and 0 <= y < n\",\n \"memory\": \"20415\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n adj = defaultdict(list)\\n ins = [0] * (m * n)\\n\\n dir = [[0, -1], [0, 1], [1, 0], [-1, 0]]\\n\\n for i in range(m):\\n for j in range(n):\\n value = matrix[i][j]\\n currIdx = i * n + j\\n\\n for d in dir:\\n x, y = i + d[0], j + d[1]\\n\\n if self.isValid(x, y, m, n) and value < matrix[x][y]:\\n newIdx = x * n + y\\n\\n adj[currIdx].append(newIdx)\\n ins[newIdx] += 1\\n \\n q = deque()\\n for i in range(m * n):\\n if ins[i] == 0:\\n q.append((i, 1))\\n \\n ans = 0\\n\\n while q:\\n node, dst = q.popleft()\\n ans = dst\\n\\n for u in adj[node]:\\n ins[u] -= 1\\n\\n if ins[u] == 0:\\n q.append((u, dst + 1))\\n \\n return ans\\n\\n \\n def isValid(self, x, y, m, n):\\n return 0 <= x < m and 0 <= y < n\",\n \"memory\": \"20545\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n UNPROCCESSED = 0\\n PROCESSED = 1\\n m,n = len(matrix), len(matrix[0])\\n dirs = [(1,0), (-1,0), (0,1), (0,-1)]\\n state = [[UNPROCCESSED] * n for i in range(m)]\\n toposort = []\\n def dfs(i,j):\\n for dx,dy in dirs:\\n newI,newJ = i+dx,j+dy\\n if 0 <= newI < m and 0 <= newJ < n:\\n if state[newI][newJ] == UNPROCCESSED and matrix[newI][newJ] > matrix[i][j]:\\n state[newI][newJ] = PROCESSED\\n dfs(newI, newJ)\\n toposort.append((i,j))\\n for i in range(m):\\n for j in range(n):\\n if state[i][j] == UNPROCCESSED:\\n state[i][j] = PROCESSED\\n dfs(i,j)\\n dp = [[0] * n for i in range(m)]\\n ans = 0\\n for i,j in toposort:\\n for dx,dy in dirs:\\n newI,newJ = i+dx,j+dy\\n if 0 <= newI < m and 0 <= newJ < n and matrix[newI][newJ] > matrix[i][j]:\\n dp[i][j] = max(dp[i][j], dp[newI][newJ])\\n dp[i][j] += 1\\n ans = max(dp[i][j], ans)\\n return ans\",\n \"memory\": \"20545\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n directions = [[0,-1], [0,1], [1,0], [-1,0]]\\n def _dfs(r, c, memo):\\n if (r, c) in memo:\\n return memo[(r, c)]\\n \\n paths = {1}\\n for rn, cn in directions:\\n if (\\n r + rn < len(matrix) and r + rn >= 0 and\\n c + cn < len(matrix[0]) and c + cn >= 0 and\\n matrix[r + rn][c + cn] > matrix[r][c]\\n ):\\n curr = 1 + _dfs(r + rn, c + cn, memo)\\n paths.add(curr)\\n \\n memo[(r, c)] = max(paths)\\n return memo[(r, c)]\\n \\n if not matrix:\\n return 0\\n \\n res = []\\n memo = {}\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n res.append(_dfs(r, c, memo))\\n \\n return max(res)\\n \\n \\n \\n \",\n \"memory\": \"20675\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows,cols=len(matrix),len(matrix[0])\\n dp={}\\n def dfs(r,c,pre):\\n if (r<0 or r==rows or c==cols or c<0 or matrix[r][c]<=pre):\\n return 0\\n if (r,c) in dp:\\n return dp[(r,c)]\\n res=1\\n res=max(res,1+dfs(r+1,c,matrix[r][c]))\\n res=max(res,1+dfs(r,c+1,matrix[r][c]))\\n res=max(res,1+dfs(r-1,c,matrix[r][c]))\\n res=max(res,1+dfs(r,c-1,matrix[r][c]))\\n dp[(r,c)]=res\\n return res\\n for r in range(rows):\\n for c in range(cols):\\n dfs(r,c,-1)\\n return max(dp.values())\\n\\n \\n\\n\\n \",\n \"memory\": \"20935\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n dp = {}\\n def dfs(r, c, prevVal):\\n if r < 0 or r == rows or c < 0 or c == cols or matrix[r][c] <= prevVal:\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n res = 1\\n res = max(res, 1 + dfs(r + 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r - 1, c, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c + 1, matrix[r][c]))\\n res = max(res, 1 + dfs(r, c - 1, matrix[r][c]))\\n dp[(r, c)] = res\\n return res\\n for r in range(rows):\\n for c in range(cols):\\n dfs(r, c, -1)\\n return max(dp.values())\\n\\n\\n \\\"\\\"\\\"rows, cols in the using matrix, matrix[0]\\n dp = {} storing the values r, c, max values return values.\\n res = 1 atleast 1 is possible to the longest incresing path\\n same like res = max(res, 1 + dfs(r + 1, c, matrix[r][c])) ->> 1 + dfs means add 1\\n after that dp[(r, c)] = res .. dp rows, cols values are the res\\n LAST max(dp.values) which path logest then print.\\n \\\"\\\"\\\"\\n\",\n \"memory\": \"21065\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n dirs = [-1,0,1,0,-1]\\n dp = {} # (row, col)\\n def dfs(row: int, col: int) -> int:\\n if (row, col) in dp:\\n return dp[(row, col)]\\n length = 1\\n for d in range(4):\\n r, c = row+dirs[d], col+dirs[d+1]\\n if 0<=r<m and 0<=c<n and matrix[r][c] > matrix[row][col]:\\n length = max(length, 1 + dfs(r, c))\\n dp[(row, col)] = length\\n return length\\n length = 1\\n for row in range(m):\\n for col in range(n):\\n length = max(length, dfs(row, col))\\n return length\",\n \"memory\": \"21065\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n @cache\\n def dfs(x, y):\\n count = 1\\n seen.add((x, y))\\n for xx, yy in ((-1, 0), (1, 0), (0, -1), (0, 1)):\\n nx, ny = x + xx, y + yy\\n if (nx, ny) not in seen and 0 <= nx < len(matrix) and 0 <= ny < len(matrix[0]) and matrix[nx][ny] < matrix[x][y]:\\n count = max(count, 1 + dfs(nx, ny))\\n seen.remove((x, y))\\n return count\\n seen = set()\\n count = 0\\n for a in range(len(matrix)):\\n for b in range(len(matrix[0])):\\n count = max(count, dfs(a, b))\\n return count\\n \",\n \"memory\": \"21195\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = {}\\n\\n def dfs(r, c, prev):\\n if (\\n r not in range(ROWS) or\\n c not in range(COLS) or\\n matrix[r][c] <= prev\\n ):\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n \\n dp[(r, c)] = (\\n 1 + max(\\n dfs(r + 1, c, matrix[r][c]),\\n dfs(r - 1, c, matrix[r][c]),\\n dfs(r, c + 1, matrix[r][c]),\\n dfs(r, c - 1, matrix[r][c]),\\n )\\n )\\n return dp[(r, c)]\\n \\n res = 0\\n for r in range(ROWS):\\n for c in range(COLS):\\n res = max(res, dfs(r, c, -1))\\n return res\",\n \"memory\": \"21195\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n dp = {} #(r, c) -> lip\\n \\n def dfs(r, c, prevVal):\\n if (r < 0 or r == ROWS) or (c < 0 or c == COLS) or matrix[r][c] <= prevVal:\\n return 0\\n \\n if (r, c) in dp:\\n return dp[(r, c)]\\n curr = matrix[r][c]\\n res = 1\\n res = max(res, 1 + dfs(r + 1, c, curr))\\n res = max(res, 1 + dfs(r - 1, c, curr))\\n res = max(res, 1 + dfs(r, c + 1, curr))\\n res = max(res, 1 + dfs(r, c - 1, curr))\\n\\n dp[(r, c)] = res\\n\\n return res\\n\\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1)\\n\\n return max(dp.values())\",\n \"memory\": \"21325\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n dirs=[[0,1],[1,0],[0,-1],[-1,0]]\\n m,n=len(matrix),len(matrix[0])\\n\\n @cache\\n def dfs(r,c):\\n steps=1\\n for d in dirs:\\n nr,nc=r+d[0],c+d[1]\\n if nr<0 or nr>m-1 or nc<0 or nc>n-1: continue\\n if matrix[r][c]>=matrix[nr][nc]: continue\\n steps=max(steps, 1+dfs(nr,nc))\\n return steps\\n\\n res=-1\\n for r in range(m):\\n for c in range(n):\\n res=max(res, dfs(r,c))\\n return res\",\n \"memory\": \"21325\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.cache = {}\\n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n longestPath = 0\\n for i in range(m):\\n for j in range(n):\\n longestPath = max(longestPath, self.exploreOptions(matrix, i, j, -1)) # (matrix, i, j, prevValue)\\n\\n return longestPath\\n \\n def exploreOptions(self, matrix, i, j, prevValue):\\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]) or matrix[i][j] <= prevValue:\\n return 0\\n\\n if (i,j,prevValue) in self.cache:\\n return self.cache[(i,j,prevValue)]\\n\\n left = self.exploreOptions(matrix, i, j-1, matrix[i][j])\\n right = self.exploreOptions(matrix, i, j+1, matrix[i][j])\\n up = self.exploreOptions(matrix, i-1, j, matrix[i][j])\\n down = self.exploreOptions(matrix, i+1, j, matrix[i][j])\\n\\n self.cache[(i,j,prevValue)] = max(left, right, up, down) + 1\\n return self.cache[(i,j,prevValue)]\",\n \"memory\": \"21455\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n dp = {} # Dictionary to store the length of the longest path starting from each cell\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]] # Possible directions (down, up, right, left)\\n \\n def dfs(r, c):\\n if (r, c) in dp:\\n return dp[(r, c)]\\n \\n longest = 1 # The path starting from the current cell is at least 1 (itself)\\n for dr, dc in directions:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < rows and 0 <= nc < cols and matrix[nr][nc] > matrix[r][c]:\\n longest = max(longest, 1 + dfs(nr, nc))\\n \\n dp[(r, c)] = longest\\n return longest \\n \\n res = 0\\n for r in range(rows):\\n for c in range(cols):\\n res = max(res, dfs(r, c))\\n \\n return res\\n\",\n \"memory\": \"21455\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n def findMax(i, j): \\n if dp[i][j] != -1:\\n return dp[i][j]\\n dir = [[0,1], [0,-1], [1,0], [-1,0]]\\n max_neighbour = 0\\n for x, y in dir:\\n a = i + x\\n b = j + y\\n if not (0 <= a < m) or not (0 <= b < n):\\n continue\\n if matrix[a][b] > matrix[i][j]:\\n max_neighbour = max(max_neighbour, findMax(a,b))\\n dp[i][j] = 1 + max_neighbour\\n return dp[i][j]\\n\\n m = len(matrix)\\n n = len(matrix[0])\\n max_len = 0\\n dp = [[-1 for _ in range(n)] for _ in range(m)]\\n for i in range(m):\\n for j in range(n):\\n max_len = max (max_len, findMax(i, j))\\n \\n return max_len\\n \",\n \"memory\": \"21585\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ans = 0\\n visited = set()\\n M = len(matrix)\\n N = len(matrix[0])\\n longest = {}\\n\\n # create an array which has longest inc path starting at (i, j)\\n # need to pop the answer back through the dfs calls\\n\\n def dfs(i, j, prev):\\n # check\\n if (i < 0 or j < 0 or\\n i >= M or j >= N or\\n matrix[i][j] <= prev):\\n return 0\\n \\n # if we already searched this path\\n if (i, j) in longest:\\n return longest[(i, j)]\\n\\n max_len = 0\\n \\n # search directions\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n for d1, d2 in directions:\\n # need to return max path\\n temp = dfs(i + d1, j + d2, matrix[i][j])\\n max_len = max(temp, max_len)\\n \\n longest[(i, j)] = 1 + max_len\\n \\n return 1 + max_len\\n \\n ans = 0\\n\\n for i in range(M):\\n for j in range(N):\\n temp = dfs(i, j, -1)\\n ans = max(ans, temp)\\n\\n print(longest)\\n return ans\\n\\n \\n\\n\\n\\n \",\n \"memory\": \"21715\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n M, N = len(matrix), len(matrix[0])\\n dirs = [(0,1), (1,0), (0,-1), (-1,0)]\\n @cache\\n def dfs(r,c):\\n curr = matrix[r][c]\\n ans = 1\\n for dr, dc in dirs:\\n nr = r+dr\\n nc = c+dc\\n if 0 <= nr < M and 0 <= nc < N and matrix[nr][nc] > curr:\\n ans = max(ans, 1 + dfs(nr,nc))\\n return ans\\n return max(dfs(i,j) for j in range(N) for i in range(M)) \\n\\n \",\n \"memory\": \"21845\"\n },\n {\n \"code\": \"dirs = [(-1, 0), (1, 0), (0, -1), (0, 1)]\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n @cache\\n def dfs(i, j):\\n if i < 0 or i >= m or j < 0 or j >= n:\\n return 0\\n cand = [dfs(i+x, j+y) for x, y in dirs if 0 <= i+x < m and 0 <= j+y < n and matrix[i+x][j+y] > matrix[i][j]]\\n return 1 + max(cand) if cand else 1\\n self.res = float('-inf')\\n for i in range(m):\\n for j in range(n):\\n self.res = max(self.res, dfs(i, j))\\n return self.res\\n\",\n \"memory\": \"21845\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n res = [[1 for j in range(len(matrix[0]))] for i in range(len(matrix))] # longest starting from i,j\\n\\n visit = set()\\n def dfs(prev, i, j):\\n if i < 0 or i >= len(matrix) or j < 0 or j >= len(matrix[0]):\\n return 0\\n\\n if matrix[i][j] <= prev:\\n return 0\\n\\n if (i,j) in visit:\\n return res[i][j]\\n\\n visit.add((i,j))\\n val = matrix[i][j]\\n\\n result = 1 + max(dfs(val,i+1,j) , dfs(val,i-1,j) , dfs(val,i,j+1) , dfs(val,i,j-1))\\n res[i][j] = result\\n \\n return result\\n\\n maxPath = 1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if (i,j) not in visit:\\n dfs(float(\\\"-inf\\\"), i, j)\\n maxPath = max(maxPath, res[i][j])\\n \\n return maxPath\",\n \"memory\": \"21975\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n, me = len(matrix), len(matrix[0]), {}\\n @cache\\n def dp(u, v, m, n):\\n # if me.setdefault((u, v), 0) != 0:\\n # return me[(u, v)]\\n res = 1\\n for i, j in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\\n x, y = u+i, v+j\\n if x < 0 or x >= m or y < 0 or y >= n :\\n continue\\n if matrix[u][v] <= matrix[x][y]:\\n continue\\n res = max(res, dp(x, y, m, n)+1)\\n # me[(u, v)] = res\\n return res\\n return max([dp(i, j, m, n) for i in range(m) for j in range(n)])\",\n \"memory\": \"22105\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n ROWS, COLS = len(matrix), len(matrix[0])\\n\\n directions = [(0, 1), (0, -1), (-1, 0), (1, 0)]\\n\\n memo = {}\\n\\n def getLIPath(currY, currX):\\n if (currY, currX) in memo:\\n return memo[(currY, currX)]\\n\\n maxPathLen = -1\\n for direction in directions:\\n addY, addX = currY + direction[0], currX + direction[1]\\n if addY >= ROWS or addX >= COLS or addY < 0 or addX < 0 or matrix[addY][addX] <= matrix[currY][currX]:\\n continue\\n maxPathLen = max(maxPathLen, getLIPath(addY, addX))\\n \\n memo[(currY, currX)] = 1 + maxPathLen\\n\\n return memo[(currY, currX)]\\n \\n maxOut = -1\\n\\n for i in range(ROWS):\\n for j in range(COLS):\\n maxOut = max(maxOut, getLIPath(i, j))\\n \\n return 1 + maxOut\\n\",\n \"memory\": \"22235\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n d = [(0,1), (-1,0), (0,-1), (1,0)]\\n visited = set()\\n cache = {}\\n def dfs(r,c):\\n if (r,c) in cache:\\n return cache[(r,c)]\\n longest = 1\\n for x, y in d:\\n newr, newc = x + r, y + c\\n if(0 <= newr < len(matrix) and 0 <= newc < len(matrix[0]) and matrix[newr][newc] > matrix[r][c] and (newr,newc) not in visited):\\n \\n longest = max(longest, 1 + dfs(newr, newc))\\n cache[(r,c)] = longest\\n return longest\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])): \\n dfs(i, j)\\n return max(cache.values())\",\n \"memory\": \"22365\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m,n = len(matrix), len(matrix[0]) if matrix else 0\\n\\n memo = {}\\n visited = set()\\n maxi = 0\\n\\n def solve(i,j):\\n if (i,j) in memo:\\n return memo[(i,j)]\\n ans = 1\\n for di,dj in [(0,1),(0,-1),(1,0),(-1,0)]:\\n ni,nj = i+di, j+dj\\n if 0 <= ni < m and 0 <= nj < n and matrix[i][j] < matrix[ni][nj]:\\n ans = max(ans, 1 + solve(ni,nj))\\n \\n memo[(i,j)] = ans\\n return memo[(i,j)]\\n \\n for i in range(m):\\n for j in range(n):\\n maxi = max(maxi, solve(i,j))\\n \\n return maxi\\n\\n\\n \",\n \"memory\": \"22365\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = {}\\n neighbors = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n LIP = 1\\n\\n def dfs(r, c, prev):\\n nonlocal LIP\\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prev:\\n return 0\\n if (r, c) in dp:\\n LIP = max(LIP, dp[(r, c)])\\n return dp[(r, c)]\\n\\n result = 1\\n for x, y in neighbors:\\n result = max(result, 1 + dfs(r + x, c + y, matrix[r][c]))\\n dp[(r, c)] = result\\n LIP = max(LIP, result)\\n return result\\n \\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1)\\n return LIP\",\n \"memory\": \"22495\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n adj_list = ((0,1),(0,-1),(1,0),(-1,0))\\n R, C = len(matrix), len(matrix[0])\\n cache = {}\\n\\n def in_range(r, c):\\n return 0 <= r < R and 0 <= c < C\\n\\n def traverse(r, c, prev):\\n if not in_range(r, c): return 0\\n \\n this = matrix[r][c]\\n if this <= prev: return 0\\n\\n key = (r, c)\\n if key in cache: return cache[key]\\n\\n length_here = 1\\n matrix[r][c] = -1\\n for ra, ca in adj_list:\\n length_here = max(length_here, traverse(r+ra,c+ca,this)+1)\\n\\n matrix[r][c] = this\\n cache[key] =length_here \\n return cache[key]\\n\\n longest = 0\\n for r in range(R):\\n for c in range(C):\\n longest = max(longest, traverse(r,c,-1))\\n\\n return longest\",\n \"memory\": \"22625\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n ROWS, COLS = len(matrix), len(matrix[0])\\n dp = {}\\n neighbors = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n\\n def dfs(r, c, prev):\\n if r < 0 or r == ROWS or c < 0 or c == COLS or matrix[r][c] <= prev:\\n return 0\\n if (r, c) in dp:\\n return dp[(r, c)]\\n\\n result = 1\\n for x, y in neighbors:\\n result = max(result, 1 + dfs(r + x, c + y, matrix[r][c]))\\n dp[(r, c)] = result\\n return result\\n \\n for r in range(ROWS):\\n for c in range(COLS):\\n dfs(r, c, -1)\\n return max(dp.values())\",\n \"memory\": \"22755\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m=len(matrix)\\n n=len(matrix[0])\\n visited=set()\\n copy=[[1 for j in range(n)] for i in range(m)]\\n directions=[[-1,0],[1,0],[0,-1],[0,1]]\\n\\n def dfs(i,j):\\n nonlocal copy\\n nonlocal visited\\n res=copy[i][j]\\n for d in directions:\\n if 0<=i+d[0]<=m-1 and 0<=j+d[1]<=n-1 and matrix[i+d[0]][j+d[1]]<matrix[i][j]:\\n if (i+d[0],j+d[1]) not in visited:\\n dfs(i+d[0],j+d[1])\\n res=max(res,copy[i][j]+copy[i+d[0]][j+d[1]])\\n copy[i][j]=res\\n visited.add((i,j))\\n \\n \\n \\n \\n for i in range(m):\\n for j in range(n):\\n x=(i,j)\\n if x not in visited:\\n dfs(x[0],x[1])\\n \\n \\n return max([max(copy[i]) for i in range(m)])\\n \\n\\n \\n \",\n \"memory\": \"22755\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m=len(matrix)\\n n=len(matrix[0])\\n visited=set()\\n copy=[[1 for j in range(n)] for i in range(m)]\\n directions=[[-1,0],[1,0],[0,-1],[0,1]]\\n\\n def dfs(i,j):\\n nonlocal copy\\n nonlocal visited\\n res=copy[i][j]\\n for d in directions:\\n if 0<=i+d[0]<=m-1 and 0<=j+d[1]<=n-1 and matrix[i+d[0]][j+d[1]]<matrix[i][j]:\\n if (i+d[0],j+d[1]) not in visited:\\n dfs(i+d[0],j+d[1])\\n res=max(res,copy[i][j]+copy[i+d[0]][j+d[1]])\\n copy[i][j]=res\\n visited.add((i,j))\\n \\n \\n \\n \\n for i in range(m):\\n for j in range(n):\\n x=(i,j)\\n if x not in visited:\\n dfs(x[0],x[1])\\n \\n \\n return max([max(copy[i]) for i in range(m)])\\n \\n\\n \\n \",\n \"memory\": \"22885\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n \\n # Initialize memoization dictionary\\n seen = {}\\n \\n # Dimensions of the matrix\\n m, n = len(matrix), len(matrix[0])\\n \\n def inBounds(i, j):\\n # Check if the indices are within the matrix bounds\\n return 0 <= i < m and 0 <= j < n\\n\\n def dfs(i, j):\\n # If already computed the result for this cell, return it\\n if (i, j) in seen:\\n return seen[(i, j)]\\n \\n # Define the possible directions (up, down, left, right)\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n max_path = 1 # The path length at least includes the current cell\\n \\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n if inBounds(ni, nj) and matrix[ni][nj] > matrix[i][j]:\\n max_path = max(max_path, 1 + dfs(ni, nj))\\n \\n # Memoize the result for the current cell\\n seen[(i, j)] = max_path\\n return max_path\\n \\n # Find the longest increasing path starting from each cell\\n longest_path = 0\\n for i in range(m):\\n for j in range(n):\\n longest_path = max(longest_path, dfs(i, j))\\n \\n return longest_path\\n\",\n \"memory\": \"22885\"\n },\n {\n \"code\": \"from math import inf\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n dp = [[0 for _ in range(n)] for _ in range(m)]\\n\\n mi, mj = 0, 0\\n memo = set()\\n for i in range(m):\\n for j in range(n):\\n dx = [0, 0, -1, 1]\\n dy = [-1, 1, 0, 0]\\n ok = True\\n for k in range(4):\\n ci = i + dx[k]\\n cj = j + dy[k]\\n if -1 < ci < m and -1 < cj < n:\\n if matrix[ci][cj] <= matrix[i][j]:\\n ok = False\\n if ok:\\n mi, mj = i, j\\n memo.add((i, j))\\n dp[i][j] = 1\\n\\n def solve(i, j):\\n if (i, j) in memo:\\n return dp[i][j]\\n dx = [-1, 1, 0, 0]\\n dy = [0, 0, -1, 1]\\n ans = 1\\n for k in range(4):\\n ci = i + dx[k]\\n cj = j + dy[k]\\n if -1 < ci < m and -1 < cj < n and matrix[ci][cj] < matrix[i][j]:\\n ans = max(ans, solve(ci, cj) + 1)\\n dp[i][j] = ans\\n memo.add((i, j))\\n return dp[i][j]\\n for i in range(m):\\n for j in range(n):\\n solve(i, j)\\n longest = 0\\n for i in range(m):\\n for j in range(n):\\n longest = max(longest, dp[i][j])\\n return longest\\n\\n \\n \",\n \"memory\": \"23015\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n,m=len(matrix),len(matrix[0]);\\n dp=[[-1]*201 for i in range(201)];\\n ans=0;\\n def isValid(i,j):\\n return i>=0 and j>=0 and i<n and j<m;\\n directions=[(0,-1),(0,1),(-1,0),(1,0)]\\n def solve(i,j):\\n if dp[i][j]!=-1:\\n return dp[i][j];\\n cur_ans=1;\\n for cur_i,cur_j in directions:\\n nxt_i,nxt_j=cur_i+i,cur_j+j;\\n if isValid(nxt_i,nxt_j) and matrix[nxt_i][nxt_j]>matrix[i][j]:\\n cur_ans=max(cur_ans,solve(nxt_i,nxt_j)+1);\\n dp[i][j]=cur_ans;\\n return cur_ans;\\n for i in range(n):\\n for j in range(m):\\n ans=max(ans,solve(i,j));\\n return ans;\",\n \"memory\": \"23145\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n,m=len(matrix),len(matrix[0]);\\n dp=[[-1]*201 for i in range(201)];\\n ans=0;\\n def isValid(i,j):\\n return i>=0 and j>=0 and i<n and j<m;\\n directions=[(0,-1),(0,1),(-1,0),(1,0)]\\n def solve(i,j):\\n if dp[i][j]!=-1:\\n return dp[i][j];\\n cur_ans=1;\\n for cur_i,cur_j in directions:\\n nxt_i,nxt_j=cur_i+i,cur_j+j;\\n if isValid(nxt_i,nxt_j) and matrix[nxt_i][nxt_j]>matrix[i][j]:\\n cur_ans=max(cur_ans,solve(nxt_i,nxt_j)+1);\\n dp[i][j]=cur_ans;\\n return cur_ans;\\n for i in range(n):\\n for j in range(m):\\n ans=max(ans,solve(i,j));\\n return ans;\",\n \"memory\": \"23145\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n adj_map = defaultdict(list)\\n indegrees = defaultdict(int)\\n \\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n indegrees[(r, c)] = 0\\n\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n for dir in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n n = (r + dir[0], c + dir[1])\\n if 0 <= n[0] < len(matrix) and 0 <= n[1] < len(matrix[0]):\\n # if neighbor greater than curr, then edge from curr to neighbor\\n if matrix[n[0]][n[1]] > matrix[r][c]:\\n adj_map[(r, c)].append(n)\\n indegrees[n] += 1\\n \\n cells = []\\n for k, v in indegrees.items():\\n if v == 0:\\n cells.append((k, 1)) # cells contains coord and length of path to that cell\\n\\n print(adj_map)\\n print('\\\\n' + str(indegrees))\\n print(cells)\\n max_path = 1\\n while cells:\\n cell, length = cells.pop(0)\\n max_path = max(length, max_path)\\n # visit neighbors of this cell with indegree 0 by decrementing neighbors indegrees\\n for n in adj_map[cell]:\\n indegrees[n] -= 1\\n if indegrees[n] == 0:\\n cells.append((n, length + 1))\\n \\n return max_path\\n \\n\\n\\n\\n\\n \\n \\n\",\n \"memory\": \"23275\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, city: List[List[int]]) -> int:\\n g = collections.defaultdict(list)\\n direction =[[0,1], [0,-1], [-1,0],[1,0]]\\n indegree = collections.defaultdict(int)\\n \\n m = len(city)\\n n = len(city[0])\\n \\n # build a graph\\n for i in range(m):\\n for j in range(n):\\n start_x, start_y = i, j\\n for dx, dy in direction:\\n new_x, new_y = start_x+dx, start_y+dy\\n if new_x>=0 and new_x<m and new_y>=0 and new_y<n and city[new_x][new_y]>city[start_x][start_y]:\\n g[str([start_x, start_y])].append(str([new_x, new_y]))\\n v = indegree[str([new_x, new_y])]\\n v+=1\\n indegree[str([new_x, new_y])]=v\\n \\n \\n all_keys = {str([i, j]) for i in range(m) for j in range(n)}\\n queue = []\\n for key in all_keys:\\n if indegree[key]==0:\\n queue.append([key, 1])\\n \\n res = float('-inf')\\n out = []\\n while queue:\\n cur, cur_cnt = queue.pop(0)\\n for adj in g[cur]:\\n indegree[adj]-=1\\n if indegree[adj]==0:\\n queue.append([adj, cur_cnt+1]) \\n \\n res = max(res, cur_cnt)\\n return res\\n # if cur_cnt>res:\\n # out.append(cur)\\n # res = cur_cnt\",\n \"memory\": \"23405\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n visited = set()\\n node_visited = {}\\n def dfs(root, visited):\\n x, y = root\\n if (x, y) in visited:\\n return 0\\n if (x, y) in node_visited:\\n return node_visited[(x,y)]\\n record_path = 0\\n visited.add((x, y))\\n for dx, dy in directions:\\n if x+dx >= 0 and x+dx < len(matrix) and y+dy >= 0 and y+dy < len(matrix[0]) and (x+dx, y+dy) not in visited:\\n if matrix[x+dx][y+dy] > matrix[x][y]:\\n \\n record_path = max(record_path, dfs((x+dx, y+dy), visited))\\n visited.remove((x, y))\\n node_visited[(x,y)] = record_path + 1\\n return record_path + 1\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dfs((i, j), visited)\\n return max(node_visited.values())\",\n \"memory\": \"23535\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n cache = {}\\n ROW, COL = len(matrix), len(matrix[0])\\n \\n def dfs(r,c, prev):\\n if r < 0 or r >= ROW or c < 0 or c >= COL:\\n return 0\\n \\n if matrix[r][c] <= prev:\\n return 0\\n \\n if (r,c) in cache:\\n return cache[(r,c)]\\n \\n cache[(r,c)] = 1 + max(dfs(r+1, c, matrix[r][c]), dfs(r-1, c, matrix[r][c]), dfs(r, c+1, matrix[r][c]), dfs(r, c-1, matrix[r][c]))\\n return cache[(r,c)]\\n \\n max_lip = 0\\n origin = (-1,-1)\\n for r in range(ROW):\\n for c in range(COL):\\n if (r,c) not in cache:\\n dfs(r,c,-1)\\n \\n if cache[(r,c)] > max_lip:\\n max_lip = cache[(r,c)]\\n origin = (r,c)\\n\\n def findPath(r, c, count, path):\\n if len(path) == max_lip:\\n return path\\n \\n if r < 0 or r >= ROW or c < 0 or c >= COL or cache[(r,c)] != count:\\n return []\\n \\n path.append(matrix[r][c])\\n\\n up = findPath(r-1, c, count-1, path)\\n down = findPath(r+1, c, count-1, path)\\n left = findPath(r, c-1, count-1, path)\\n right = findPath(r, c+1, count-1, path)\\n\\n if up: return up\\n if down: return down\\n if left: return left\\n if right: return right\\n\\n print(findPath(origin[0], origin[1], max_lip, [])) \\n return max_lip\\n\\n\\n # follow up: print the path\",\n \"memory\": \"23665\"\n },\n {\n \"code\": \"class Solution:\\n def valid(self, i, j, m, n):\\n return 0 <= i < m and 0 <= j < n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n seen = set()\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n res = 0\\n\\n @cache\\n def dp(i, j):\\n maxResult = 1\\n for direction in directions:\\n dy = direction[0]\\n dx = direction[1]\\n if self.valid(i + dy, j + dx, m , n) and matrix[i + dy][j + dx] > matrix[i][j]:\\n maxResult = max(maxResult, 1 + dp(i + dy, j + dx))\\n return maxResult\\n\\n for i in range(m):\\n for j in range(n):\\n if (i, j) not in seen:\\n seen.add((i, j))\\n res = max(res, dp(i, j))\\n return res\\n\",\n \"memory\": \"23795\"\n },\n {\n \"code\": \"class Solution:\\n def valid(self, i, j, m, n):\\n return 0 <= i < m and 0 <= j < n\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n seen = set()\\n directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\\n res = 0\\n\\n @cache\\n def dp(i, j):\\n maxResult = 1\\n for direction in directions:\\n dy = direction[0]\\n dx = direction[1]\\n if self.valid(i + dy, j + dx, m , n) and matrix[i + dy][j + dx] > matrix[i][j]:\\n maxResult = max(maxResult, 1 + dp(i + dy, j + dx))\\n return maxResult\\n\\n for i in range(m):\\n for j in range(n):\\n if (i, j) not in seen:\\n seen.add((i, j))\\n res = max(res, dp(i, j))\\n return res\\n\",\n \"memory\": \"23925\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n max_row=len(matrix)\\n max_col=len(matrix[0])\\n @cache\\n def dfs(curr):\\n out=[1]\\n if curr[0]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]-1][curr[1]]:\\n out.append(dfs((curr[0]-1,curr[1]))+1)\\n if curr[1]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]-1]:\\n out.append(dfs((curr[0],curr[1]-1))+1)\\n if curr[0]<max_row-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]+1][curr[1]]:\\n out.append(dfs((curr[0]+1,curr[1]))+1)\\n if curr[1]<max_col-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]+1]:\\n out.append(dfs((curr[0],curr[1]+1))+1)\\n return max(out)\\n curr_max=1\\n for i in range(max_row):\\n for j in range(max_col):\\n if (i==0 or matrix[i][j]<=matrix[i-1][j])and (j==0 or matrix[i][j]<=matrix[i][j-1]) and(i==max_row-1 or matrix[i][j]<=matrix[i+1][j])and (j==max_col-1 or matrix[i][j]<=matrix[i][j+1]):\\n curr_max=max(dfs((i,j)),curr_max)\\n return curr_max\",\n \"memory\": \"24055\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n max_row=len(matrix)\\n max_col=len(matrix[0])\\n @cache\\n def dfs(curr):\\n out=[1]\\n if curr[0]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]-1][curr[1]]:\\n out.append(dfs((curr[0]-1,curr[1]))+1)\\n if curr[1]>0 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]-1]:\\n out.append(dfs((curr[0],curr[1]-1))+1)\\n if curr[0]<max_row-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]+1][curr[1]]:\\n out.append(dfs((curr[0]+1,curr[1]))+1)\\n if curr[1]<max_col-1 and matrix[curr[0]][curr[1]]<matrix[curr[0]][curr[1]+1]:\\n out.append(dfs((curr[0],curr[1]+1))+1)\\n return max(out)\\n curr_max=1\\n for i in range(max_row):\\n for j in range(max_col):\\n if (i==0 or matrix[i][j]<=matrix[i-1][j])and (j==0 or matrix[i][j]<=matrix[i][j-1]) and(i==max_row-1 or matrix[i][j]<=matrix[i+1][j])and (j==max_col-1 or matrix[i][j]<=matrix[i][j+1]):\\n curr_max=max(dfs((i,j)),curr_max)\\n return curr_max\",\n \"memory\": \"24055\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n max_path = 0\\n visited = defaultdict(int)\\n\\n def dfs(i, j, prev, curr_visited):\\n if i < 0 or j < 0 or i >= len(matrix) or j >= len(matrix[0]):\\n return 0\\n if matrix[i][j] <= prev:\\n return 0\\n if (i, j) in curr_visited:\\n return 0\\n if (i, j) in visited:\\n return visited[(i, j)]\\n curr_visited.add((i,j))\\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\\n max_val = 0\\n for x, y in directions:\\n max_val = max(max_val, dfs(i+x, j+y, matrix[i][j], curr_visited))\\n curr_visited.remove((i,j))\\n visited[(i,j)] = 1 + max_val\\n return visited[(i,j)]\\n\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if (i, j) not in visited:\\n curr_visited = set()\\n length = dfs(i, j, -1, curr_visited)\\n max_path = max(max_path, length)\\n return max_path \",\n \"memory\": \"24185\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n M, N = len(matrix), len(matrix[0])\\n memo = {}\\n def move(i, j):\\n for x, y in [[0,1], [0,-1], [1,0], [-1,0]]:\\n ni = i + x\\n nj = j + y\\n if 0 <= ni < M and 0 <= nj < N:\\n yield ni, nj\\n \\n def dfs(i, j):\\n nonlocal memo\\n idx = i * N + j\\n if idx in memo:\\n return memo[idx]\\n \\n length = 1\\n for ni, nj in move(i, j):\\n if matrix[ni][nj] > matrix[i][j]:\\n length = max(length, dfs(ni, nj) + 1)\\n\\n memo[idx] = length\\n return length\\n \\n res = 1\\n for i in range(M):\\n for j in range(N):\\n res = max(res, dfs(i, j))\\n return res\\n \",\n \"memory\": \"24315\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n max_path = 0\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j))\\n \\n return max_path\\n\\n\\n \",\n \"memory\": \"24445\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n return i in range(rows) and j in range(cols) and matrix[i][j] > prev\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n max_path = 0\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j))\\n \\n return max_path\\n\\n\\n \",\n \"memory\": \"24445\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # Initialize the longest path counter\\n longest_path = 0\\n cache = {} # To cache results of the longest path starting from each cell\\n \\n # Helper function for backtracking\\n def recursive_backtrack(c, r, visited):\\n # Check the cache to avoid recomputation\\n if (c, r) in cache:\\n return cache[(c, r)]\\n \\n # Calculate possible moves based on the current position\\n possible_moves = [(c+1, r), (c-1, r), (c, r-1), (c, r+1)]\\n max_path_length = 1 # Start with length 1 (the current cell itself)\\n \\n # Explore the possible moves (down, up, left, right)\\n for move in possible_moves:\\n new_c = move[0]\\n new_r = move[1]\\n \\n # Check if the new position is within bounds and the value is increasing\\n if 0 <= new_c < len(matrix[0]) and 0 <= new_r < len(matrix) and matrix[new_r][new_c] > matrix[r][c]:\\n # Recurse to the next cell and get the length of the path from there\\n path_length = 1 + recursive_backtrack(new_c, new_r, visited)\\n max_path_length = max(max_path_length, path_length)\\n \\n # Update the cache with the result for the current cell\\n cache[(c, r)] = max_path_length\\n return max_path_length\\n \\n # Initialize the visited array (not needed with memoization, but kept for reference)\\n visited = [[0] * len(matrix[0]) for _ in range(len(matrix))]\\n \\n # Start backtracking from every cell and calculate the longest path\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n longest_path = max(longest_path, recursive_backtrack(c, r, visited))\\n \\n return longest_path # Return the longest path found\\n\",\n \"memory\": \"24575\"\n },\n {\n \"code\": \"# Recursive\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n R, C = len(matrix), len(matrix[0])\\n \\n def recursive(r, c):\\n if (r,c) in memo:\\n return memo[(r, c)]\\n res = 0\\n for dr, dc in [[0, 1], [0, -1], [1, 0], [-1, 0]]:\\n row = r + dr\\n col = c + dc\\n\\n if (row < 0 or col < 0 or\\n row >= R or col >= C or\\n matrix[row][col] <= matrix[r][c] ):\\n continue\\n \\n res = max(res, recursive(row, col))\\n memo[(r, c)] = (1 + res)\\n return memo[(r, c)]\\n \\n memo = {}\\n for r in range(R):\\n for c in range(C):\\n recursive(r, c)\\n\\n return max(memo.values())\\n \\n\",\n \"memory\": \"24705\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n \\n \\n 3. return the max travel distance\\n \\\"\\\"\\\"\\n m = len(matrix)\\n n = len(matrix[0])\\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] \\n neighbors = {} # key: (i, j); value: list of neighbors\\n\\n # 1. compute adjacency dictionary\\n for i in range(m):\\n for j in range(n):\\n for incrementI, incrementJ in directions:\\n if self.isValid(matrix[i][j], i + incrementI, j + incrementJ, matrix):\\n neighbor = (i + incrementI, j + incrementJ)\\n if (i, j) in neighbors:\\n neighbors[(i, j)].append(neighbor)\\n else:\\n neighbors[(i, j)] = [neighbor]\\n \\n \\\"\\\"\\\"\\n 2. do a dfs for each element in the matrix\\n each element in the stack = ((i, j), curCount), where curCount is how much we have traveled so far to get to the point (i, j), which is a neighbor of the current node\\n \\\"\\\"\\\"\\n dic = {} # key: (i, j); value: longest distance that we can travel from the node (i, j)\\n ans = 1\\n def dfs(i, j):\\n if (i, j) in dic:\\n return dic[(i, j)]\\n elif (i, j) not in neighbors:\\n return 1\\n \\n counts = []\\n for newI, newJ in neighbors[(i, j)]:\\n counts.append(dfs(newI, newJ) + 1)\\n \\n dic[(i, j)] = max(counts)\\n nonlocal ans\\n ans = max(ans, dic[(i, j)])\\n return dic[(i, j)]\\n \\n for i in range(m):\\n for j in range(n):\\n dfs(i, j)\\n \\n return ans\\n \\n \\n def isValid(self, curValue, i, j, matrix):\\n \\\"\\\"\\\"\\n Returns True if matrix[i][j] is within matrix boundaries and matrix[i][j] > curValue\\n \\\"\\\"\\\"\\n return i >= 0 and j >= 0 and i < len(matrix) and j < len(matrix[0]) and matrix[i][j] > curValue\\n\\n\",\n \"memory\": \"24835\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n rows, cols = len(matrix), len(matrix[0])\\n\\n def is_valid(i, j, prev):\\n #We only need to check if its in bound and if the value is greater for allowing a path\\n if i in range(rows) and j in range(cols) and matrix[i][j] > prev:\\n return True\\n return False\\n\\n dp = {}\\n def dfs(i, j):\\n #Base case: check dp and check for each direction if its valid\\n if (i, j) in dp: return dp[(i, j)]\\n directions = [[0, 1], [0, -1], [1, 0], [-1, 0]]\\n max_path = 1\\n for x, y in directions:\\n if is_valid(i + x, j + y, matrix[i][j]):\\n max_path = max(max_path, dfs(i + x, j + y) + 1)\\n dp[(i, j)] = max_path\\n return max_path\\n\\n #Do a dfs for each cell (Time complexity will be O(n * m))\\n max_path = 0\\n for i in range(rows):\\n for j in range(cols):\\n max_path = max(max_path, dfs(i, j))\\n \\n return max_path\\n\\n\\n \",\n \"memory\": \"24965\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m,n = len(matrix), len(matrix[0])\\n\\n @cache\\n def near(start):\\n res = []\\n i,j = start\\n for pos in [(i+1,j), (i,j+1), (i-1, j), (i,j-1)]:\\n x,y = pos\\n if 0 <= x < m and 0 <= y < n and matrix[x][y] > matrix[i][j]: \\n res.append(pos)\\n return res\\n\\n def dfs(start, depth):\\n i,j = start\\n if dp[i][j]:\\n return (depth-1) + dp[i][j]\\n res = depth\\n for node in near(start):\\n res = max(res, dfs(node, depth+1))\\n dp[i][j] = res - depth + 1\\n return res\\n \\n dp = [[None]*n for _ in range(m)]\\n res = 1\\n for i in range(m):\\n for j in range(n):\\n dfs((i,j), 1)\\n res = max(res, dp[i][j])\\n print(dp)\\n return res\\n\\n \\n\",\n \"memory\": \"24965\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # build graph, if the number next to it is larger, create an edge\\n edges = []\\n nrow = len(matrix); ncol = len(matrix[0])\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n cur = matrix[i][j]\\n n1 = i * ncol + j\\n if i > 0 and matrix[i-1][j] > cur:\\n n2 = (i - 1) * ncol + j\\n edges.append((n1, n2))\\n if i < nrow - 1 and matrix[i+1][j] > cur:\\n n2 = (i + 1) * ncol + j\\n edges.append((n1, n2))\\n if j > 0 and matrix[i][j-1] > cur:\\n n2 = i * ncol + j - 1\\n edges.append((n1, n2))\\n if j < ncol - 1 and matrix[i][j+1] > cur:\\n n2 = i * ncol + j + 1\\n edges.append((n1, n2))\\n\\n childToParents = {}; parentToChildren = {}\\n for edge in edges:\\n child = edge[0]\\n parent = edge[1]\\n if child in childToParents:\\n childToParents[child].append(parent)\\n else:\\n childToParents[child] = [parent]\\n if parent in parentToChildren:\\n parentToChildren[parent].append(child)\\n else:\\n parentToChildren[parent] = [child]\\n\\n lengths = [0] * ncol * nrow\\n while len(childToParents) > 0:\\n removeParents = []\\n for parent in parentToChildren:\\n if len(parentToChildren[parent]) == 0:\\n removeParents.append(parent)\\n for parent in removeParents:\\n del parentToChildren[parent]\\n # find the leaves first, update the leaves iteratively\\n notleaves = set(childToParents.keys()).intersection(set(parentToChildren.keys()))\\n leaves = [node for node in childToParents.keys() if node not in notleaves]\\n for leaf in leaves:\\n parents = childToParents[leaf]\\n for parent in parents:\\n lengths[parent] = max(1 + lengths[leaf], lengths[parent])\\n # remove leaf from both childToParents and parentToChildren\\n del childToParents[leaf]\\n for parent in parents:\\n parentToChildren[parent].remove(leaf)\\n return max(lengths) + 1\",\n \"memory\": \"25095\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\\"\\\"\\\"\\n \\n \\n 3. return the max travel distance\\n \\\"\\\"\\\"\\n m = len(matrix)\\n n = len(matrix[0])\\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] \\n neighbors = {} # key: (i, j); value: list of neighbors\\n\\n # 1. compute adjacency dictionary\\n for i in range(m):\\n for j in range(n):\\n for incrementI, incrementJ in directions:\\n if self.isValid(matrix[i][j], i + incrementI, j + incrementJ, matrix):\\n neighbor = (i + incrementI, j + incrementJ)\\n if (i, j) in neighbors:\\n neighbors[(i, j)].append(neighbor)\\n else:\\n neighbors[(i, j)] = [neighbor]\\n \\n \\\"\\\"\\\"\\n 2. do a dfs for each element in the matrix\\n each element in the stack = ((i, j), curCount), where curCount is how much we have traveled so far to get to the point (i, j), which is a neighbor of the current node\\n \\\"\\\"\\\"\\n dic = {} # key: (i, j); value: longest distance that we can travel from the node (i, j)\\n def dfs(i, j):\\n if (i, j) in dic:\\n return dic[(i, j)]\\n elif (i, j) not in neighbors:\\n return 1\\n \\n counts = []\\n for newI, newJ in neighbors[(i, j)]:\\n counts.append(dfs(newI, newJ) + 1)\\n \\n dic[(i, j)] = max(counts)\\n return dic[(i, j)]\\n \\n for i in range(m):\\n for j in range(n):\\n dfs(i, j)\\n \\n print(dic)\\n print(neighbors)\\n ans = 1\\n for k in dic:\\n ans = max(ans, dic[k])\\n \\n return ans\\n\\n\\n\\n\\n \\n \\n\\n \\n\\n \\n \\n def isValid(self, curValue, i, j, matrix):\\n \\\"\\\"\\\"\\n Returns True if matrix[i][j] is within matrix boundaries and matrix[i][j] > curValue\\n \\\"\\\"\\\"\\n return i >= 0 and j >= 0 and i < len(matrix) and j < len(matrix[0]) and matrix[i][j] > curValue\\n\\n\",\n \"memory\": \"25225\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n indeg, adj_mat, dist = {}, {}, {}\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n indeg[(i, j)] = 0\\n adj_mat[(i, j)] = set() # u:v indicates path from u to v\\n dist[(i, j)] = 1\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n ni, nj = i+di, j+dj\\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\\n adj_mat[(i, j)].add((ni, nj))\\n indeg[(ni, nj)] += 1\\n \\n to_remove = [u for u in indeg if indeg[u] == 0]\\n result = 1\\n while len(to_remove) != 0:\\n new_to_remove = []\\n for u in to_remove:\\n del indeg[u]\\n for v in adj_mat[u]:\\n indeg[v] -= 1\\n if indeg[v] == 0:\\n new_to_remove.append(v)\\n dist[v] = max(dist[v], 1+dist[u])\\n result = max(result, 1+dist[u])\\n to_remove = new_to_remove\\n return result\\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"25355\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # build map\\n m = defaultdict(list)\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if j+1<len(matrix[0]):\\n if matrix[i][j]<matrix[i][j+1]:\\n m[(i,j)].append((i,j+1))\\n elif matrix[i][j]>matrix[i][j+1]:\\n m[(i,j+1)].append((i,j))\\n if i+1<len(matrix):\\n if matrix[i][j]<matrix[i+1][j]:\\n m[(i,j)].append((i+1,j))\\n elif matrix[i][j]>matrix[i+1][j]:\\n m[(i+1,j)].append((i,j))\\n # build mem to hold length of longest path starting from the node\\n dp = {}\\n def getLength(i, j):\\n if (i,j) in dp:\\n return dp[(i,j)]\\n l = 0\\n for x, y in m[(i,j)]:\\n l = max(l, 1+getLength(x, y))\\n dp[(i,j)] = l\\n return l\\n res = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n res = max(res, 1+getLength(i, j))\\n return res\",\n \"memory\": \"25355\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n \\n adj_mat, dist, indeg = {}, {}, {}\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dist[(i, j)] = 1\\n adj_mat[(i, j)] = set()\\n indeg[(i, j)] = 0\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n ni, nj = i+di, j+dj\\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\\n adj_mat[(i, j)].add((ni, nj))\\n indeg[(ni, nj)] += 1\\n \\n from collections import deque\\n q = deque([u for u in indeg if indeg[u]==0])\\n while len(q) > 0:\\n u = q.popleft()\\n for v in adj_mat[u]:\\n if 1+dist[u] > dist[v]:\\n dist[v] = 1+dist[u]\\n q.append(v)\\n return max([v for v in dist.values()])\\n \\n\\n# for u in indeg:\\n# if indeg[u] == 0:\\n# dist[u] = 1\\n# def recur(u):\\n# for v in adj_mat[u]:\\n# if v not in dist:\\n# dist[v] = dist[u]+1\\n# else:\\n# dist[v] = max(dist[v], dist[u]+1)\\n \\n \\n# for u in dist:\\n \\n \\n \\n# for i in range(len(matrix)):\\n# for j in range(len(matrix[0])):\\n# for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n# ni, nj = i+di, j+dj\\n# if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\\n# adj_mat[(i, j)].add((ni, nj))\\n# indeg[(ni, nj)] += 1\\n \\n# to_remove = set([u for u in indeg if indeg[u] == 0])\\n# result = 1\\n# while len(to_remove) != 0:\\n# u = to_remove.pop()\\n# del indeg[u]\\n# for v in adj_mat[u]:\\n# indeg[v] -= 1\\n# if indeg[v] == 0:\\n# to_remove.add(v)\\n# dist[v] = max(dist[v], 1+dist[u])\\n# result = max(result, 1+dist[u])\\n# return result\\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"25485\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n \\n adj_mat, dist, indeg = {}, {}, {}\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n dist[(i, j)] = 1\\n adj_mat[(i, j)] = set()\\n indeg[(i, j)] = 0\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n ni, nj = i+di, j+dj\\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\\n adj_mat[(i, j)].add((ni, nj))\\n indeg[(ni, nj)] += 1\\n \\n from collections import deque\\n q = deque([u for u in indeg if indeg[u]==0])\\n while len(q) > 0:\\n u = q.popleft()\\n for v in adj_mat[u]:\\n if 1+dist[u] > dist[v]:\\n dist[v] = 1+dist[u]\\n q.append(v)\\n return max([v for v in dist.values()])\\n \\n\\n# for u in indeg:\\n# if indeg[u] == 0:\\n# dist[u] = 1\\n# def recur(u):\\n# for v in adj_mat[u]:\\n# if v not in dist:\\n# dist[v] = dist[u]+1\\n# else:\\n# dist[v] = max(dist[v], dist[u]+1)\\n \\n \\n# for u in dist:\\n \\n \\n \\n# for i in range(len(matrix)):\\n# for j in range(len(matrix[0])):\\n# for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n# ni, nj = i+di, j+dj\\n# if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\\n# adj_mat[(i, j)].add((ni, nj))\\n# indeg[(ni, nj)] += 1\\n \\n# to_remove = set([u for u in indeg if indeg[u] == 0])\\n# result = 1\\n# while len(to_remove) != 0:\\n# u = to_remove.pop()\\n# del indeg[u]\\n# for v in adj_mat[u]:\\n# indeg[v] -= 1\\n# if indeg[v] == 0:\\n# to_remove.add(v)\\n# dist[v] = max(dist[v], 1+dist[u])\\n# result = max(result, 1+dist[u])\\n# return result\\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"25485\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n R = len(matrix)\\n C = len(matrix[0])\\n memo = {}\\n def helper(r,c,prevValue):\\n if r>=R or c >=C or r<0 or c<0 or prevValue >= matrix[r][c]:\\n return 0\\n\\n if (r,c) in memo:\\n return memo[(r,c)]\\n maxLen = 0\\n directions = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\n # print(r,c,prevValue)\\n for nR,nC in directions:\\n newR,newC = r+nR,c+nC\\n maxLen = max(maxLen,helper(newR,newC,matrix[r][c]))\\n temp = 1+maxLen\\n memo[(r,c)] = temp\\n return temp\\n out =1\\n for i in range(R):\\n for j in range(C):\\n out=max(out,helper(i,j,float('-inf')))\\n \\n return out\\n\",\n \"memory\": \"25615\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n indeg, adj_mat, dist = {}, {}, {}\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n indeg[(i, j)] = 0\\n adj_mat[(i, j)] = set() # u:v indicates path from u to v\\n dist[(i, j)] = 1\\n \\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n ni, nj = i+di, j+dj\\n if 0<=ni<len(matrix) and 0<=nj<len(matrix[0]) and matrix[ni][nj] > matrix[i][j]:\\n adj_mat[(i, j)].add((ni, nj))\\n indeg[(ni, nj)] += 1\\n \\n to_remove = set([u for u in indeg if indeg[u] == 0])\\n result = 1\\n while len(to_remove) != 0:\\n u = to_remove.pop()\\n del indeg[u]\\n for v in adj_mat[u]:\\n indeg[v] -= 1\\n if indeg[v] == 0:\\n to_remove.add(v)\\n dist[v] = max(dist[v], 1+dist[u])\\n result = max(result, 1+dist[u])\\n return result\\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"25745\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: 'List[List[int]]') -> int:\\n visit = set()\\n self.res = 0\\n ROWS, COLS = len(matrix), len(matrix[0])\\n self.cache = [[1] * COLS for _ in range(ROWS)]\\n\\n neigh = [(0, -1), (-1, 0), (0, 1), (1, 0)]\\n \\n \\n def dfs(r, c, prev):\\n if (\\n r < 0 or c < 0 or r > (ROWS - 1) or c > (COLS - 1) or\\n matrix[r][c] <= prev\\n ):\\n return 0\\n\\n if (r,c) in visit:\\n return self.cache[r][c]\\n\\n visit.add((r,c ))\\n count=1\\n re = []\\n for dr, dc in neigh:\\n re.append(dfs(r + dr, c + dc, matrix[r][c]))\\n count += max(re)\\n self.cache[r][c] = count\\n self.res = max(self.res, count)\\n return count\\n \\n \\n for r in range(ROWS):\\n for c in range(COLS):\\n if (r, c) in visit:\\n continue\\n dfs(r, c, float('-inf'))\\n\\n return self.res\",\n \"memory\": \"25745\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n graph = defaultdict(list)\\n deg = [[0 for j in range(n)] for i in range(m)]\\n for i in range(m):\\n for j in range(n):\\n dirs = [(0, 1), (1, 0), (-1, 0), (0, -1)]\\n for dx, dy in dirs:\\n new_i = i + dx\\n new_j = j + dy\\n if 0 <= new_i < m and 0 <= new_j < n and matrix[new_i][new_j] > matrix[i][j]:\\n graph[(i, j)].append((new_i, new_j))\\n deg[new_i][new_j] += 1\\n \\n dp = [[-1 for i in range(n)] for j in range(m)]\\n def height(i, j):\\n if dp[i][j] != -1:\\n return dp[i][j]\\n max_children_height = 0\\n for new_i, new_j in graph[(i, j)]:\\n max_children_height = max(max_children_height, height(new_i, new_j))\\n dp[i][j] = max_children_height + 1\\n return max_children_height + 1\\n \\n ret = float('-inf')\\n\\n for i in range(m):\\n for j in range(n):\\n if deg[i][j] == 0:\\n ret = max(ret, height(i, j))\\n \\n return ret\",\n \"memory\": \"25875\"\n },\n {\n \"code\": \"'''\\nAt any (r, c), we have 4 (technically 3) allowed moves:\\nGo right: c + 1.\\nGo left: c - 1\\nGo up: r + 1.\\nGo down: r - 1.\\n\\nBefore each move, verify the following:\\nNext move's value HAS TO BE greater than current (also ensures we don't go back)\\nNext move within bounds\\n'''\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n @cache\\n def longestIncreasingPathStartingFrom(r: int, c: int) -> int:\\n left = 0\\n right = 0\\n up = 0\\n down = 0\\n\\n if c > 0 and matrix[r][c - 1] > matrix[r][c]:\\n left = longestIncreasingPathStartingFrom(r, c - 1)\\n\\n if c < len(matrix[0]) - 1 and matrix[r][c + 1] > matrix[r][c]:\\n right = longestIncreasingPathStartingFrom(r, c + 1)\\n\\n if r > 0 and matrix[r - 1][c] > matrix[r][c]:\\n up = longestIncreasingPathStartingFrom(r - 1, c)\\n\\n if r < len(matrix) - 1 and matrix[r + 1][c] > matrix[r][c]:\\n down = longestIncreasingPathStartingFrom(r + 1, c)\\n\\n\\n return 1 + max(left, right, up, down)\\n\\n curMax = 1\\n\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n curMax = max(curMax, longestIncreasingPathStartingFrom(r, c))\\n\\n return curMax\\n \",\n \"memory\": \"26005\"\n },\n {\n \"code\": \"'''\\nAt any (r, c), we have 4 (technically 3) allowed moves:\\nGo right: c + 1.\\nGo left: c - 1\\nGo up: r + 1.\\nGo down: r - 1.\\n\\nBefore each move, verify the following:\\nNext move's value HAS TO BE greater than current (also ensures we don't go back)\\nNext move within bounds\\n'''\\n\\nclass Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n\\n @cache\\n def longestIncreasingPathStartingFrom(r: int, c: int) -> int:\\n left = 0\\n right = 0\\n up = 0\\n down = 0\\n\\n if c > 0 and matrix[r][c - 1] > matrix[r][c]:\\n left = longestIncreasingPathStartingFrom(r, c - 1)\\n\\n if c < len(matrix[0]) - 1 and matrix[r][c + 1] > matrix[r][c]:\\n right = longestIncreasingPathStartingFrom(r, c + 1)\\n\\n if r > 0 and matrix[r - 1][c] > matrix[r][c]:\\n up = longestIncreasingPathStartingFrom(r - 1, c)\\n\\n if r < len(matrix) - 1 and matrix[r + 1][c] > matrix[r][c]:\\n down = longestIncreasingPathStartingFrom(r + 1, c)\\n\\n\\n return 1 + max(left, right, up, down)\\n\\n curMax = 1\\n\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n curMax = max(curMax, longestIncreasingPathStartingFrom(r, c))\\n\\n return curMax\\n \",\n \"memory\": \"26005\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n n = len(matrix)\\n m = len(matrix[0])\\n\\n @cache\\n def dfs(row: int, col: int) -> int:\\n res = 0\\n if col > 0 and matrix[row][col - 1] > matrix[row][col]:\\n res = max(res, dfs(row, col - 1))\\n if row > 0 and matrix[row - 1][col] > matrix[row][col]:\\n res = max(res, dfs(row - 1, col))\\n if col + 1 < m and matrix[row][col + 1] > matrix[row][col]:\\n res = max(res, dfs(row, col + 1))\\n if row + 1 < n and matrix[row + 1][col] > matrix[row][col]:\\n res = max(res, dfs(row + 1, col))\\n\\n return res + 1\\n \\n res = 0\\n for row in range(n):\\n for col in range(m):\\n res = max(res, dfs(row, col))\\n return res\",\n \"memory\": \"26135\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n seen = {}\\n # (prev coord, coord, len of remaing path)\\n if not matrix: return 0\\n m = len(matrix)\\n n = len(matrix[0])\\n def dfs(prev,coord,cur):\\n\\n x,y = coord\\n if not (0<=x<n and 0<=y<m):\\n return cur\\n if prev and matrix[y][x] <= matrix[prev[1]][prev[0]]:\\n return cur\\n if (prev,coord) in seen:\\n return cur + seen[(prev,coord)]\\n path = max(\\n dfs(coord,(x,y+1),cur+1),\\n dfs(coord,(x,y-1),cur+1),\\n dfs(coord,(x-1,y),cur+1),\\n dfs(coord,(x+1,y),cur+1)\\n )\\n if prev:\\n seen[(prev,coord)]=path-cur\\n\\n # res = max(res,path)\\n return path\\n\\n res = 0\\n for x in range(n):\\n for y in range(m): \\n \\n res = max(res,dfs(None,(x,y),0))\\n\\n return max(1,res)\\n\",\n \"memory\": \"26265\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n \\n \\n # Create graph\\n m,n = len(matrix), len(matrix[0])\\n graph = {}\\n \\n for i in range(m):\\n for j in range(n):\\n source = (i,j)\\n graph[source] = [] \\n if i > 0:\\n if matrix[i][j] < matrix[i-1][j]:\\n graph[source].append((i-1,j))\\n if i < m - 1:\\n if matrix[i][j] < matrix[i+1][j]:\\n graph[source].append((i+1,j))\\n if j > 0:\\n if matrix[i][j] < matrix[i][j-1]:\\n graph[source].append((i,j-1))\\n if j < n - 1:\\n if matrix[i][j] < matrix[i][j+1]:\\n graph[source].append((i,j+1))\\n \\n \\n def dfs(start):\\n nonlocal graph, cache\\n\\n if start in cache:\\n return cache[start]\\n \\n max_length = 1\\n \\n for neighbor in graph[start]:\\n max_length = max(max_length, 1 + dfs(neighbor))\\n \\n cache[start] = max_length\\n \\n return max_length\\n \\n # Apply dfs on each square, caching results along the way\\n cache = {}\\n longest_path = 0\\n for start in graph.keys():\\n longest_path = max(longest_path, dfs(start)) \\n\\n return longest_path\\n \\n \\n \",\n \"memory\": \"26395\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n\\n @cache\\n def dfs(i, j):\\n res = 1\\n for di, dj in ((0, 1), (0, -1), (1, 0), (-1, 0)):\\n ii = i + di\\n jj = j + dj\\n\\n if 0 <= ii < m and 0 <= jj < n and matrix[ii][jj] > matrix[i][j]:\\n res = max(res, 1 + dfs(ii, jj))\\n return res\\n \\n res = 1\\n for i in range(m):\\n for j in range(n):\\n res = max(res, dfs(i, j))\\n return res\\n\",\n \"memory\": \"26525\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m = len(matrix)\\n n = len(matrix[0])\\n\\n @cache\\n def dfs(r, c):\\n answer = 1\\n dirs = [(0, -1), (0, 1), (1, 0), (-1, 0)]\\n for dir in dirs:\\n new_r = r + dir[0]\\n new_c = c + dir[1]\\n if new_r>=0 and new_r < m and new_c >=0 and new_c < n and (new_r, new_c) and matrix[new_r][new_c] > matrix[r][c]:\\n answer = max(answer, 1 + dfs(new_r, new_c))\\n\\n return answer\\n\\n result = 0\\n for i in range(m):\\n for j in range(n):\\n result = max(result, dfs(i, j))\\n return result\",\n \"memory\": \"26915\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n m, n = len(matrix), len(matrix[0])\\n\\n @cache\\n def dfs(i, j):\\n length = 1\\n pre_length = 0\\n direction = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n for dx, dy in direction:\\n x = i + dx\\n y = j + dy\\n if x >= 0 and x < m and y >= 0 and y < n and matrix[x][y] > matrix[i][j]:\\n pre_length = max(pre_length, dfs(x, y))\\n return length + pre_length\\n \\n max_length = 1\\n for i in range(m):\\n for j in range(n):\\n max_length = max(max_length, dfs(i, j))\\n \\n return max_length\\n \",\n \"memory\": \"27045\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n parents = defaultdict(set)\\n adj = defaultdict(list)\\n m = len(matrix)\\n n = len(matrix[0])\\n offs = [(0,1), (1,0), (0,-1), (-1,0)]\\n for i1 in range(m):\\n for j1 in range(n):\\n for off_i, off_j in offs:\\n i2 = i1+off_i\\n j2 = j1+off_j\\n if 0<=i2<m and 0<=j2<n and matrix[i2][j2]>matrix[i1][j1]:\\n parents[(i2,j2)].add((i1,j1))\\n adj[(i1,j1)].append((i2,j2))\\n # print(parents)\\n q = deque([])\\n for i in range(m):\\n for j in range(n):\\n node = (i,j)\\n if len(parents[node])==0:\\n q.append(node)\\n\\n degree = defaultdict(lambda: 1)\\n cur_degree = 0\\n while q:\\n new_q = deque([])\\n while q:\\n node = q.popleft()\\n for neigh in adj[node]:\\n degree[neigh] = max(degree[neigh], 1+cur_degree)\\n parents[neigh].remove(node)\\n if len(parents[neigh])==0:\\n new_q.append(neigh)\\n cur_degree += 1\\n q = new_q\\n\\n return cur_degree\",\n \"memory\": \"27045\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, grid: List[List[int]]) -> int:\\n m,n=len(grid),len(grid[0])\\n # directions = [0, 1, 0, -1, 0] # four directions \\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\\n \\n @lru_cache(maxsize=None) # using python cache lib for memoization\\n def dfs(r,c):\\n ans=1 \\n\\t\\t\\t# iterating through all 4 directions\\n for x,y in directions: \\n new_row,new_col=r+x, c+y # calculating the new cell\\n\\t\\t\\t\\t# check if new cell is within the grid bounds and is an increasing sequence\\n if 0<=new_row<m and 0<=new_col<n and grid[new_row][new_col]>grid[r][c]: \\n ans = max(ans, dfs(new_row, new_col) + 1 ) # finding the max length of valid path from the current cell \\n return ans\\n \\n return max(dfs(r,c) for r in range(m) for c in range(n)) \",\n \"memory\": \"27175\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, grid: List[List[int]]) -> int:\\n m,n=len(grid),len(grid[0])\\n directions = [(0,1),(0,-1),(1,0),(-1,0)]\\n \\n @lru_cache(maxsize=None) # using python cache lib for memoization\\n def dfs(r,c):\\n ans=1 \\n\\t\\t\\t# iterating through all 4 directions\\n for x,y in directions: \\n new_row,new_col=r+x, c+y # calculating the new cell\\n\\t\\t\\t\\t# check if new cell is within the grid bounds and is an increasing sequence\\n if 0<=new_row<m and 0<=new_col<n and grid[new_row][new_col]>grid[r][c]: \\n ans = max(ans, dfs(new_row, new_col) + 1 ) # finding the max length of valid path from the current cell \\n return ans\\n \\n return max(dfs(r,c) for r in range(m) for c in range(n)) \",\n \"memory\": \"27175\"\n },\n {\n \"code\": \"class Solution:\\n def longestIncreasingPath(self, matrix: List[List[int]]) -> int:\\n # # if len(matrix) == 1 and len(matrix[0]) ==1:\\n # # return 1\\n # rows = len(matrix)\\n # cols = len(matrix[0])\\n # max_length = 0\\n # directions = [(0,1),(0,-1),(1,0),(-1,0)] #right, left, down, up\\n\\n # def dfs( i, j, sequence, visited):\\n # nonlocal max_length\\n # if max_length <len(sequence):\\n # max_length = len(sequence)\\n # for w,z in directions:\\n # x, y = i+w, j+z\\n # if 0<= x< rows and 0 <= y < cols and matrix[i][j]<matrix[x][y] and (x,y) not in visited:\\n # sequence.append(matrix[x][y])\\n # visited.add((x,y))\\n # dfs(x, y, sequence, visited)\\n # sequence.pop()\\n # visited.remove((x,y))\\n # visited = set()\\n # for i in range(0, rows):\\n # for j in range(0,cols):\\n # visited.add((i,j))\\n # dfs(i, j, [matrix[i][j]], visited)\\n # visited.remove((i,j))\\n # return max_length\\n\\n if not matrix or not matrix[0]:\\n return 0\\n \\n rows, cols = len(matrix), len(matrix[0])\\n directions = [(0,1),(0,-1),(1,0),(-1,0)] # right, left, down, up\\n \\n @lru_cache(None)\\n def dfs(i, j):\\n max_length = 1\\n for di, dj in directions:\\n ni, nj = i + di, j + dj\\n if 0 <= ni < rows and 0 <= nj < cols and matrix[ni][nj] > matrix[i][j]:\\n max_length = max(max_length, 1 + dfs(ni, nj))\\n return max_length\\n \\n return max(dfs(i, j) for i in range(rows) for j in range(cols))\\n\\n\\n\\n \",\n \"memory\": \"27305\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":114,"string":"114"}}},{"rowIdx":259,"cells":{"question_id":{"kind":"number","value":330,"string":"330"},"name":{"kind":"string","value":"patching-array"},"content":{"kind":"string","value":"<p>Given a sorted integer array <code>nums</code> and an integer <code>n</code>, add/patch elements to the array such that any number in the range <code>[1, n]</code> inclusive can be formed by the sum of some elements in the array.</p>\n\n<p>Return <em>the minimum number of patches required</em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,3], n = 6\n<strong>Output:</strong> 1\nExplanation:\nCombinations of nums are [1], [3], [1,3], which form possible sums of: 1, 3, 4.\nNow if we add/patch 2 to nums, the combinations are: [1], [2], [3], [1,3], [2,3], [1,2,3].\nPossible sums are 1, 2, 3, 4, 5, 6, which now covers the range [1, 6].\nSo we only need 1 patch.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,5,10], n = 20\n<strong>Output:</strong> 2\nExplanation: The two patches can be [2, 4].\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,2,2], n = 5\n<strong>Output:</strong> 0\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 1000</code></li>\n\t<li><code>1 <= nums[i] <= 10<sup>4</sup></code></li>\n\t<li><code>nums</code> is sorted in <strong>ascending order</strong>.</li>\n\t<li><code>1 <= n <= 2<sup>31</sup> - 1</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":53.172961541266396,"string":"53.172962"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","greedy"],"string":"[\n \"array\",\n \"greedy\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"31\", 0.13], [\"38\", 0.13], [\"39\", 0.13], [\"42\", 0.3901], [\"44\", 0.3901], [\"45\", 0.5202], [\"46\", 1.0403], [\"47\", 0.7802], [\"48\", 1.6905], [\"49\", 1.3004], [\"50\", 2.8609], [\"51\", 4.0312], [\"52\", 4.4213], [\"53\", 4.0312], [\"54\", 4.5514], [\"55\", 7.8023], [\"56\", 5.7217], [\"57\", 6.3719], [\"58\", 7.5423], [\"59\", 10.013], [\"60\", 6.3719], [\"61\", 4.8114], [\"62\", 4.2913], [\"63\", 6.1118], [\"64\", 4.1612], [\"65\", 3.5111]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.13], [\"16400\", 0.2601], [\"16500\", 6.8921], [\"16600\", 27.4382], [\"16700\", 48.5046]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n miss, result, i, l = 1, 0, 0, len(nums)\n\n while miss <= n:\n if i < l and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n result += 1\n\n return result\n\nif __name__ == \"__main__\":\n sol = Solution()\n with open(\"user.out\", \"w\") as f:\n for nums, n in zip(map(loads, stdin), map(loads, stdin)):\n print(sol.minPatches(nums, n), file=f)\n exit()","runtime":"31"},{"code":"# 贪心算法\n\n# 时间复杂度: O(m + log n)。这里 m 是数组长度，而 log n 是我们需要补丁的次数上限。\n# 空间复杂度: O(1)，只需要常数的额外空间。\n\n# 使用贪心的策略，尽量使用当前已有的数字去覆盖更多的区间，然后在无法覆盖的区间补上新的数字。\n# 核心思路：跟踪当前能覆盖的最大范围，若当前数字 nums[i] 大于当前能覆盖的范围，则需要添加新的数字。\n\n# 具体分析：\n# 1. 我们跟踪一个变量 miss，表示当前我们能够覆盖的范围是 [1, miss-1]。\n# 2. 对于数组中的每个数字 nums[i]，如果它小于等于 miss，则我们能够继续扩展覆盖的范围；否则，我们需要添加数字 miss，并将范围扩展至 2 * miss - 1。\n# 3. 一旦 miss 大于 n，任务就完成了。\n\nclass Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n miss = 1 # 【即覆盖不到的范围的第一个值】【覆盖范围为 [0, miss) 】\n i = 0\n while miss <= n: #【 保证结束循环的时候 miss > n 了，因为是覆盖范围[0, miss) 左闭右开的】\n if i < len(nums) and nums[i] <= miss: # 【这里极易出错：nums[i] == miss的时候，不能加patch的！！】\n # 当前能覆盖的范围扩展至 miss + nums[i] - 1\n miss += nums[i]\n i += 1\n else:\n # 需要添加 miss\n miss += miss # # 【当前能覆盖的范围扩展至 miss + miss - 1】\n patches += 1\n return patches\n","runtime":"38"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n n_ = len(nums)\n maxx = 0\n patches = 0\n i = 0\n while(maxx < n):\n if i < n_ and maxx+1 >= nums[i]:\n maxx += nums[i]\n i+=1\n else:\n patches += 1\n maxx += maxx+1\n return patches","runtime":"39"},{"code":"# 贪心算法\n\n# 时间复杂度: O(m + log n)。这里 m 是数组长度，而 log n 是我们需要补丁的次数上限。\n# 空间复杂度: O(1)，只需要常数的额外空间。\n\n# 使用贪心的策略，尽量使用当前已有的数字去覆盖更多的区间，然后在无法覆盖的区间补上新的数字。\n# 核心思路：跟踪当前能覆盖的最大范围，若当前数字 nums[i] 大于当前能覆盖的范围，则需要添加新的数字。\n\n# 具体分析：\n# 1. 我们跟踪一个变量 miss，表示当前我们能够覆盖的范围是 [1, miss-1]。\n# 2. 对于数组中的每个数字 nums[i]，如果它小于等于 miss，则我们能够继续扩展覆盖的范围；否则，我们需要添加数字 miss，并将范围扩展至 2 * miss - 1。\n# 3. 一旦 miss 大于 n，任务就完成了。\n\nclass Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n miss = 1 # 【即覆盖不到的范围的第一个值】【覆盖范围为 [0, miss) 】\n i = 0\n while miss <= n: #【 保证结束循环的时候 miss > n 了，因为是覆盖范围[0, miss) 左闭右开的】\n if i < len(nums) and nums[i] <= miss:\n # 当前能覆盖的范围扩展至 miss + nums[i] - 1\n miss += nums[i]\n i += 1\n else:\n # 需要添加 miss\n miss += miss # # 【当前能覆盖的范围扩展至 miss + miss - 1】\n patches += 1\n return patches\n","runtime":"42"},{"code":"from typing import List\n\nclass Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n miss = 1\n i = 0\n \n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n \n return patches","runtime":"44"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n miss = 1\n res = 0\n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n res +=1\n \n return res","runtime":"45"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n current_target = 1\n patches = 0\n\n for num in nums:\n while current_target < num:\n if current_target > n:\n break\n patches += 1\n current_target = current_target * 2\n current_target = current_target + num\n \n while current_target <= n:\n patches += 1\n current_target = current_target * 2\n \n return patches\n \n\n'''\n\nnums = [1,12,15], n = 43\n |\npatches = 3\ntar = 16\n\n[1, 2, 3, 4, ]\n\n'''","runtime":"46"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n coverage = 0\n cnt = 0\n patch = 0\n i = 0\n while coverage < n and i < len(nums):\n if nums[i] > coverage+1:\n patch = coverage+1\n #print(patch)\n coverage = coverage + patch\n cnt +=1\n else:\n coverage = coverage + nums[i]\n i+=1\n while coverage <n:\n coverage += coverage +1\n cnt +=1\n return cnt","runtime":"47"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n max_num=0\n pat=0\n i=0\n while max_num<n:\n if i<len(nums) and max_num+1>=nums[i]:\n max_num+=nums[i]\n i+=1\n else:\n max_num+=max_num+1\n pat+=1\n return pat\n ","runtime":"48"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n miss = 1\n patches = 0 \n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n return patches","runtime":"49"},{"code":"# Data Structures: Array\n# Algorithm: Greedy approach to minimize the number of patches required to cover all numbers in the range [1, n].\n\n# Short Intuition:\n# - Use a greedy approach by always covering the smallest number that is currently uncovered (`miss`).\n# - If a number in `nums` can cover `miss`, use it; otherwise, add `miss` to the array (patch it) and double `miss`.\n\n# Detailed Intuition:\n# - Initialize `miss` to 1, which represents the smallest number that cannot be formed by the sum of the elements seen so far.\n# - Traverse through the array `nums`:\n# - If `nums[i]` is less than or equal to `miss`, it can cover `miss`, so update `miss` to `miss + nums[i]`.\n# - If `nums[i]` is greater than `miss`, add `miss` as a patch to cover it, increment the `patches`, and double `miss`.\n# - Continue until `miss` exceeds `n`.\n# - Return the number of patches required.\n\n# Pseudocode:\n# 1. Initialize `miss` to 1, `patches` to 0, and index `i` to 0.\n# 2. While `miss <= n`:\n# - If `nums[i] <= miss`, update `miss = miss + nums[i]` and increment `i`.\n# - If `nums[i] > miss`, add `miss` as a patch, increment `patches`, and update `miss = miss * 2`.\n# 3. Return the number of patches required.\n\n# Example for complex step:\n# - Given `nums = [1, 3]` and `n = 6`, we find that by adding `2` to the array, we can cover all numbers from `1` to `6`.\n\nclass Solution:\n def minPatches(self, nums: list[int], n: int) -> int:\n patches = 0\n miss = 1\n i = 0\n \n # Continue until `miss` exceeds `n`\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n # Add `miss` to cover the gap\n miss += miss\n patches += 1\n \n return patches\n\n# Time Complexity:\n# - The time complexity is O(m + log n), where `m` is the number of elements in `nums` and `log n` accounts for the patching process.\n\n# Space Complexity:\n# - The space complexity is O(1), since only a few extra variables are used.\n","runtime":"50"},{"code":"class Solution:\n def minPatches(self, nums, n):\n patches = []\n missing = 1\n i = 0\n \n while missing <= n:\n if i < len(nums) and nums[i] <= missing:\n missing += nums[i]\n i += 1\n else:\n patches.append(missing)\n missing += missing\n \n return len(patches)\n\n# Example usage:\nsolution = Solution()\nnums = [1, 3]\nn = 6\nprint(solution.minPatches(nums, n)) # Output: 1","runtime":"51"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n miss, added, index = 1, 0, 0\n while miss <= n:\n if index < len(nums) and nums[index] <= miss:\n miss += nums[index]\n index += 1\n else:\n miss += miss\n added += 1\n return added ","runtime":"51"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n miss = 1\n i = 0\n \n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n \n return patches\n\n# Example usage:\nsolution = Solution()\nnums = [1, 3]\nn = 6\nprint(solution.minPatches(nums, n)) # Output: 1","runtime":"52"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n max_reach = 0\n index = 0\n \n while max_reach < n:\n if index < len(nums) and nums[index] <= max_reach + 1:\n max_reach += nums[index]\n index += 1\n else:\n max_reach += max_reach + 1\n patches += 1\n\n return patches\n\n# Example usage:\nsolution = Solution()\nnums = [1, 3]\nn = 6\nprint(solution.minPatches(nums, n)) # Output: 1\n\nnums = [1, 5, 10]\nn = 20\nprint(solution.minPatches(nums, n)) # Output: 2\n\nnums = [1, 2, 2]\nn = 5\nprint(solution.minPatches(nums, n)) # Output: 0","runtime":"52"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n canForm = 0\n i = 0\n ans = 0\n while i < len(nums):\n if canForm >= n:\n return ans\n if nums[i] <= canForm+1:\n canForm += nums[i]\n i += 1\n else:\n canForm += canForm+1\n ans += 1\n while canForm < n:\n canForm += canForm+1\n ans += 1\n return ans\n \n ","runtime":"53"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n \n miss = 1\n i = 0\n patches= 0\n\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n return patches","runtime":"54"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n\n missing = 1\n result = 0\n idx = 0\n\n while missing <= n:\n if idx < len(nums) and nums[idx] <= missing:\n missing += nums[idx]\n idx += 1\n else:\n missing += missing\n result += 1\n return result\n","runtime":"55"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n # 2024 sept 15\n target = 1\n patches = 0\n i = 0\n target = 1\n while target <= n:\n if i >= len(nums) or target < nums[i]:\n patches += 1 # add target\n target += target\n else:\n target += nums[i]\n i += 1\n \n return patches\n\n","runtime":"55"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n\n output = 0\n max_covered = 0\n\n i = 0\n while max_covered < n:\n if i < len(nums):\n if nums[i] <= max_covered + 1:\n max_covered += nums[i]\n i += 1\n else:\n while max_covered < n and nums[i] > max_covered + 1:\n # patching nums[i]\n output += 1\n x = max_covered + 1\n max_covered += x\n print(\"A: added\", x, \", now covered until \", max_covered)\n else:\n x = max_covered + 1\n max_covered += x\n output += 1\n print(\"B: added\", x, \"now covered until \", max_covered)\n\n return output","runtime":"56"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n missing = 1\n cnt = 0\n i = 0\n while missing <= n:\n if i < len(nums) and nums[i] <= missing:\n missing += nums[i]\n i += 1\n else:\n missing += missing\n cnt += 1\n return cnt\n\n \n ","runtime":"57"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n sum_found_till = 1\n i = 0\n patches = 0\n while sum_found_till <= n:\n if i < len(nums) and nums[i] <= sum_found_till:\n sum_found_till += nums[i]\n i += 1\n else:\n sum_found_till += sum_found_till\n patches += 1\n \n return patches\n ","runtime":"58"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n miss = 1\n patches = 0\n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n patches += 1\n miss += miss\n return patches\n\n\n\"\"\"\n[1,2,4,5,10]\n\n[1, 2, 3, 4, 5, ]\n\"\"\"","runtime":"59"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches=0\n csum=1\n i=0\n while csum<=n:\n if i<len(nums) and nums[i]<=csum:\n csum+=nums[i]\n i+=1\n else:\n csum+=csum\n patches+=1\n return patches","runtime":"60"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n #is there some property we can leverage to determine if a subseq exists in a array to form a sum\n #backtracking 1-> n \n top = 1\n count_added = 0\n ptr = 0\n while top <= n:\n if ptr < len(nums) and nums[ptr] <= top:\n top += nums[ptr]\n ptr += 1\n else:\n count_added += 1\n top *= 2\n return count_added","runtime":"61"},{"code":"class Solution(object):\n def minPatches(self, nums, n):\n \"\"\"\n :type nums: List[int]\n :type n: int\n :rtype: int\n \"\"\"\n \n l = len(nums)\n d = defaultdict(lambda : float(\"inf\"))\n for i in range(l):\n d[i] = nums[i]\n\n ans = 0 \n baseSum = 0\n\n i = 0\n while True:\n if baseSum >= n:\n return ans \n\n elif d[i] > baseSum + 1:\n ans += 1\n baseSum += baseSum + 1\n\n else:\n baseSum += d[i]\n i+=1\n return i","runtime":"61"},{"code":"class Solution:\n def minPatches(self, nums, n):\n index = 0 # Index to iterate through the given array\n reach = 0 # Maximum sum we can achieve with the current elements\n patches = 0 # Number of patches required\n\n while reach < n:\n if index < len(nums) and nums[index] <= reach + 1:\n # If the next number in the array is within the current reach + 1,\n # update the reach to include this number\n reach += nums[index]\n index += 1\n else:\n # If the next number is greater than the current reach + 1,\n # we need to patch the array with reach + 1\n reach += reach + 1\n patches += 1\n\n return patches\n\n# Example usage:\nsolution = Solution()\nnums = [1, 3]\nn = 6\nprint(solution.minPatches(nums, n)) # Output: 1\n\nnums = [1, 5, 10]\nn = 20\nprint(solution.minPatches(nums, n)) # Output: 2\n\nnums = [1, 2, 2]\nn = 5\nprint(solution.minPatches(nums, n)) # Output: 0","runtime":"62"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n reach = 1\n i = 0\n patches = 0\n while reach <= n:\n if i < len(nums) and nums[i] <= reach:\n reach += nums[i]\n i += 1\n else:\n reach += reach\n patches += 1\n return patches","runtime":"62"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n \"\"\"\n https://leetcode.com/problems/patching-array/solutions/78488/solution-explanation/\n \n Let miss be the smallest sum in [0,n] that we might be missing. Meaning we already know we can build all sums in [0,miss). Then if we have a number num <= miss in the given array, we can add it to those smaller sums to build all sums in [0,miss+num). If we don't, then we must add such a number to the array, and it's best to add miss itself, to maximize the reach.\n \"\"\"\n miss = 1\n added = 0\n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n added += 1\n return added","runtime":"63"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n miss = 1\n i = 0\n \n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n # miss is covered\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n \n return patches\n","runtime":"64"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n total = 0\n x = 1\n nums.sort()\n for num in nums:\n if num <= x:\n x += num\n else:\n while x < num:\n total += 1\n x += x\n if x > n:\n return total\n x += num\n if x > n:\n return total\n while x <= n:\n x += x\n total += 1\n return total","runtime":"64"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n cur = 0\n largest_sum = 0\n patches = 0\n while cur < len(nums):\n if nums[cur] > n:\n break\n\n if nums[cur] - largest_sum > 1:\n patches += 1\n largest_sum = (largest_sum * 2) + 1\n continue\n\n largest_sum = largest_sum + nums[cur]\n cur += 1\n \n while largest_sum < n:\n patches += 1\n largest_sum = (largest_sum * 2) + 1\n \n return patches\n","runtime":"65"}],"string":"[\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n miss, result, i, l = 1, 0, 0, len(nums)\\n\\n while miss <= n:\\n if i < l and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n result += 1\\n\\n return result\\n\\nif __name__ == \\\"__main__\\\":\\n sol = Solution()\\n with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for nums, n in zip(map(loads, stdin), map(loads, stdin)):\\n print(sol.minPatches(nums, n), file=f)\\n exit()\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"# 贪心算法\\n\\n# 时间复杂度: O(m + log n)。这里 m 是数组长度，而 log n 是我们需要补丁的次数上限。\\n# 空间复杂度: O(1)，只需要常数的额外空间。\\n\\n# 使用贪心的策略，尽量使用当前已有的数字去覆盖更多的区间，然后在无法覆盖的区间补上新的数字。\\n# 核心思路：跟踪当前能覆盖的最大范围，若当前数字 nums[i] 大于当前能覆盖的范围，则需要添加新的数字。\\n\\n# 具体分析：\\n# 1. 我们跟踪一个变量 miss，表示当前我们能够覆盖的范围是 [1, miss-1]。\\n# 2. 对于数组中的每个数字 nums[i]，如果它小于等于 miss，则我们能够继续扩展覆盖的范围；否则，我们需要添加数字 miss，并将范围扩展至 2 * miss - 1。\\n# 3. 一旦 miss 大于 n，任务就完成了。\\n\\nclass Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n miss = 1 # 【即覆盖不到的范围的第一个值】【覆盖范围为 [0, miss) 】\\n i = 0\\n while miss <= n: #【 保证结束循环的时候 miss > n 了，因为是覆盖范围[0, miss) 左闭右开的】\\n if i < len(nums) and nums[i] <= miss: # 【这里极易出错：nums[i] == miss的时候，不能加patch的！！】\\n # 当前能覆盖的范围扩展至 miss + nums[i] - 1\\n miss += nums[i]\\n i += 1\\n else:\\n # 需要添加 miss\\n miss += miss # # 【当前能覆盖的范围扩展至 miss + miss - 1】\\n patches += 1\\n return patches\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n n_ = len(nums)\\n maxx = 0\\n patches = 0\\n i = 0\\n while(maxx < n):\\n if i < n_ and maxx+1 >= nums[i]:\\n maxx += nums[i]\\n i+=1\\n else:\\n patches += 1\\n maxx += maxx+1\\n return patches\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# 贪心算法\\n\\n# 时间复杂度: O(m + log n)。这里 m 是数组长度，而 log n 是我们需要补丁的次数上限。\\n# 空间复杂度: O(1)，只需要常数的额外空间。\\n\\n# 使用贪心的策略，尽量使用当前已有的数字去覆盖更多的区间，然后在无法覆盖的区间补上新的数字。\\n# 核心思路：跟踪当前能覆盖的最大范围，若当前数字 nums[i] 大于当前能覆盖的范围，则需要添加新的数字。\\n\\n# 具体分析：\\n# 1. 我们跟踪一个变量 miss，表示当前我们能够覆盖的范围是 [1, miss-1]。\\n# 2. 对于数组中的每个数字 nums[i]，如果它小于等于 miss，则我们能够继续扩展覆盖的范围；否则，我们需要添加数字 miss，并将范围扩展至 2 * miss - 1。\\n# 3. 一旦 miss 大于 n，任务就完成了。\\n\\nclass Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n miss = 1 # 【即覆盖不到的范围的第一个值】【覆盖范围为 [0, miss) 】\\n i = 0\\n while miss <= n: #【 保证结束循环的时候 miss > n 了，因为是覆盖范围[0, miss) 左闭右开的】\\n if i < len(nums) and nums[i] <= miss:\\n # 当前能覆盖的范围扩展至 miss + nums[i] - 1\\n miss += nums[i]\\n i += 1\\n else:\\n # 需要添加 miss\\n miss += miss # # 【当前能覆盖的范围扩展至 miss + miss - 1】\\n patches += 1\\n return patches\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n miss = 1\\n i = 0\\n \\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n \\n return patches\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n miss = 1\\n res = 0\\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n res +=1\\n \\n return res\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n current_target = 1\\n patches = 0\\n\\n for num in nums:\\n while current_target < num:\\n if current_target > n:\\n break\\n patches += 1\\n current_target = current_target * 2\\n current_target = current_target + num\\n \\n while current_target <= n:\\n patches += 1\\n current_target = current_target * 2\\n \\n return patches\\n \\n\\n'''\\n\\nnums = [1,12,15], n = 43\\n |\\npatches = 3\\ntar = 16\\n\\n[1, 2, 3, 4, ]\\n\\n'''\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n coverage = 0\\n cnt = 0\\n patch = 0\\n i = 0\\n while coverage < n and i < len(nums):\\n if nums[i] > coverage+1:\\n patch = coverage+1\\n #print(patch)\\n coverage = coverage + patch\\n cnt +=1\\n else:\\n coverage = coverage + nums[i]\\n i+=1\\n while coverage <n:\\n coverage += coverage +1\\n cnt +=1\\n return cnt\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n max_num=0\\n pat=0\\n i=0\\n while max_num<n:\\n if i<len(nums) and max_num+1>=nums[i]:\\n max_num+=nums[i]\\n i+=1\\n else:\\n max_num+=max_num+1\\n pat+=1\\n return pat\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n miss = 1\\n patches = 0 \\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n return patches\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"# Data Structures: Array\\n# Algorithm: Greedy approach to minimize the number of patches required to cover all numbers in the range [1, n].\\n\\n# Short Intuition:\\n# - Use a greedy approach by always covering the smallest number that is currently uncovered (`miss`).\\n# - If a number in `nums` can cover `miss`, use it; otherwise, add `miss` to the array (patch it) and double `miss`.\\n\\n# Detailed Intuition:\\n# - Initialize `miss` to 1, which represents the smallest number that cannot be formed by the sum of the elements seen so far.\\n# - Traverse through the array `nums`:\\n# - If `nums[i]` is less than or equal to `miss`, it can cover `miss`, so update `miss` to `miss + nums[i]`.\\n# - If `nums[i]` is greater than `miss`, add `miss` as a patch to cover it, increment the `patches`, and double `miss`.\\n# - Continue until `miss` exceeds `n`.\\n# - Return the number of patches required.\\n\\n# Pseudocode:\\n# 1. Initialize `miss` to 1, `patches` to 0, and index `i` to 0.\\n# 2. While `miss <= n`:\\n# - If `nums[i] <= miss`, update `miss = miss + nums[i]` and increment `i`.\\n# - If `nums[i] > miss`, add `miss` as a patch, increment `patches`, and update `miss = miss * 2`.\\n# 3. Return the number of patches required.\\n\\n# Example for complex step:\\n# - Given `nums = [1, 3]` and `n = 6`, we find that by adding `2` to the array, we can cover all numbers from `1` to `6`.\\n\\nclass Solution:\\n def minPatches(self, nums: list[int], n: int) -> int:\\n patches = 0\\n miss = 1\\n i = 0\\n \\n # Continue until `miss` exceeds `n`\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n # Add `miss` to cover the gap\\n miss += miss\\n patches += 1\\n \\n return patches\\n\\n# Time Complexity:\\n# - The time complexity is O(m + log n), where `m` is the number of elements in `nums` and `log n` accounts for the patching process.\\n\\n# Space Complexity:\\n# - The space complexity is O(1), since only a few extra variables are used.\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums, n):\\n patches = []\\n missing = 1\\n i = 0\\n \\n while missing <= n:\\n if i < len(nums) and nums[i] <= missing:\\n missing += nums[i]\\n i += 1\\n else:\\n patches.append(missing)\\n missing += missing\\n \\n return len(patches)\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 3]\\nn = 6\\nprint(solution.minPatches(nums, n)) # Output: 1\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n miss, added, index = 1, 0, 0\\n while miss <= n:\\n if index < len(nums) and nums[index] <= miss:\\n miss += nums[index]\\n index += 1\\n else:\\n miss += miss\\n added += 1\\n return added \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n miss = 1\\n i = 0\\n \\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n \\n return patches\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 3]\\nn = 6\\nprint(solution.minPatches(nums, n)) # Output: 1\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n max_reach = 0\\n index = 0\\n \\n while max_reach < n:\\n if index < len(nums) and nums[index] <= max_reach + 1:\\n max_reach += nums[index]\\n index += 1\\n else:\\n max_reach += max_reach + 1\\n patches += 1\\n\\n return patches\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 3]\\nn = 6\\nprint(solution.minPatches(nums, n)) # Output: 1\\n\\nnums = [1, 5, 10]\\nn = 20\\nprint(solution.minPatches(nums, n)) # Output: 2\\n\\nnums = [1, 2, 2]\\nn = 5\\nprint(solution.minPatches(nums, n)) # Output: 0\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n canForm = 0\\n i = 0\\n ans = 0\\n while i < len(nums):\\n if canForm >= n:\\n return ans\\n if nums[i] <= canForm+1:\\n canForm += nums[i]\\n i += 1\\n else:\\n canForm += canForm+1\\n ans += 1\\n while canForm < n:\\n canForm += canForm+1\\n ans += 1\\n return ans\\n \\n \",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n \\n miss = 1\\n i = 0\\n patches= 0\\n\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n return patches\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n\\n missing = 1\\n result = 0\\n idx = 0\\n\\n while missing <= n:\\n if idx < len(nums) and nums[idx] <= missing:\\n missing += nums[idx]\\n idx += 1\\n else:\\n missing += missing\\n result += 1\\n return result\\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n # 2024 sept 15\\n target = 1\\n patches = 0\\n i = 0\\n target = 1\\n while target <= n:\\n if i >= len(nums) or target < nums[i]:\\n patches += 1 # add target\\n target += target\\n else:\\n target += nums[i]\\n i += 1\\n \\n return patches\\n\\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n\\n output = 0\\n max_covered = 0\\n\\n i = 0\\n while max_covered < n:\\n if i < len(nums):\\n if nums[i] <= max_covered + 1:\\n max_covered += nums[i]\\n i += 1\\n else:\\n while max_covered < n and nums[i] > max_covered + 1:\\n # patching nums[i]\\n output += 1\\n x = max_covered + 1\\n max_covered += x\\n print(\\\"A: added\\\", x, \\\", now covered until \\\", max_covered)\\n else:\\n x = max_covered + 1\\n max_covered += x\\n output += 1\\n print(\\\"B: added\\\", x, \\\"now covered until \\\", max_covered)\\n\\n return output\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n missing = 1\\n cnt = 0\\n i = 0\\n while missing <= n:\\n if i < len(nums) and nums[i] <= missing:\\n missing += nums[i]\\n i += 1\\n else:\\n missing += missing\\n cnt += 1\\n return cnt\\n\\n \\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n sum_found_till = 1\\n i = 0\\n patches = 0\\n while sum_found_till <= n:\\n if i < len(nums) and nums[i] <= sum_found_till:\\n sum_found_till += nums[i]\\n i += 1\\n else:\\n sum_found_till += sum_found_till\\n patches += 1\\n \\n return patches\\n \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n miss = 1\\n patches = 0\\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n patches += 1\\n miss += miss\\n return patches\\n\\n\\n\\\"\\\"\\\"\\n[1,2,4,5,10]\\n\\n[1, 2, 3, 4, 5, ]\\n\\\"\\\"\\\"\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches=0\\n csum=1\\n i=0\\n while csum<=n:\\n if i<len(nums) and nums[i]<=csum:\\n csum+=nums[i]\\n i+=1\\n else:\\n csum+=csum\\n patches+=1\\n return patches\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n #is there some property we can leverage to determine if a subseq exists in a array to form a sum\\n #backtracking 1-> n \\n top = 1\\n count_added = 0\\n ptr = 0\\n while top <= n:\\n if ptr < len(nums) and nums[ptr] <= top:\\n top += nums[ptr]\\n ptr += 1\\n else:\\n count_added += 1\\n top *= 2\\n return count_added\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution(object):\\n def minPatches(self, nums, n):\\n \\\"\\\"\\\"\\n :type nums: List[int]\\n :type n: int\\n :rtype: int\\n \\\"\\\"\\\"\\n \\n l = len(nums)\\n d = defaultdict(lambda : float(\\\"inf\\\"))\\n for i in range(l):\\n d[i] = nums[i]\\n\\n ans = 0 \\n baseSum = 0\\n\\n i = 0\\n while True:\\n if baseSum >= n:\\n return ans \\n\\n elif d[i] > baseSum + 1:\\n ans += 1\\n baseSum += baseSum + 1\\n\\n else:\\n baseSum += d[i]\\n i+=1\\n return i\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums, n):\\n index = 0 # Index to iterate through the given array\\n reach = 0 # Maximum sum we can achieve with the current elements\\n patches = 0 # Number of patches required\\n\\n while reach < n:\\n if index < len(nums) and nums[index] <= reach + 1:\\n # If the next number in the array is within the current reach + 1,\\n # update the reach to include this number\\n reach += nums[index]\\n index += 1\\n else:\\n # If the next number is greater than the current reach + 1,\\n # we need to patch the array with reach + 1\\n reach += reach + 1\\n patches += 1\\n\\n return patches\\n\\n# Example usage:\\nsolution = Solution()\\nnums = [1, 3]\\nn = 6\\nprint(solution.minPatches(nums, n)) # Output: 1\\n\\nnums = [1, 5, 10]\\nn = 20\\nprint(solution.minPatches(nums, n)) # Output: 2\\n\\nnums = [1, 2, 2]\\nn = 5\\nprint(solution.minPatches(nums, n)) # Output: 0\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n reach = 1\\n i = 0\\n patches = 0\\n while reach <= n:\\n if i < len(nums) and nums[i] <= reach:\\n reach += nums[i]\\n i += 1\\n else:\\n reach += reach\\n patches += 1\\n return patches\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n \\\"\\\"\\\"\\n https://leetcode.com/problems/patching-array/solutions/78488/solution-explanation/\\n \\n Let miss be the smallest sum in [0,n] that we might be missing. Meaning we already know we can build all sums in [0,miss). Then if we have a number num <= miss in the given array, we can add it to those smaller sums to build all sums in [0,miss+num). If we don't, then we must add such a number to the array, and it's best to add miss itself, to maximize the reach.\\n \\\"\\\"\\\"\\n miss = 1\\n added = 0\\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n added += 1\\n return added\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n miss = 1\\n i = 0\\n \\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n # miss is covered\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n \\n return patches\\n\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n total = 0\\n x = 1\\n nums.sort()\\n for num in nums:\\n if num <= x:\\n x += num\\n else:\\n while x < num:\\n total += 1\\n x += x\\n if x > n:\\n return total\\n x += num\\n if x > n:\\n return total\\n while x <= n:\\n x += x\\n total += 1\\n return total\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n cur = 0\\n largest_sum = 0\\n patches = 0\\n while cur < len(nums):\\n if nums[cur] > n:\\n break\\n\\n if nums[cur] - largest_sum > 1:\\n patches += 1\\n largest_sum = (largest_sum * 2) + 1\\n continue\\n\\n largest_sum = largest_sum + nums[cur]\\n cur += 1\\n \\n while largest_sum < n:\\n patches += 1\\n largest_sum = (largest_sum * 2) + 1\\n \\n return patches\\n\",\n \"runtime\": \"65\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":32,"string":"32"},"mm_list":{"kind":"list like","value":[{"code":"from typing import List\n\nclass Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches = 0\n miss = 1\n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n return patches\n\n# Example usage for testing:\nnums = [1, 3]\nn = 6\nsolution = Solution()\nprint(solution.minPatches(nums, n)) # Output: 1\n","memory":"16200"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n ans = 0\n missing = 1\n i = 0\n while missing <= n:\n if i < len(nums) and nums[i] <= missing:\n missing += nums[i]\n i += 1\n else:\n missing += missing\n ans += 1\n return ans","memory":"16400"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n patches=0\n csum=1\n i=0\n while csum<=n:\n if i<len(nums) and nums[i]<=csum:\n csum+=nums[i]\n i+=1\n else:\n csum+=csum\n patches+=1\n return patches","memory":"16500"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n #is there some property we can leverage to determine if a subseq exists in a array to form a sum\n #backtracking 1-> n \n top = 1\n count_added = 0\n ptr = 0\n while top <= n:\n if ptr < len(nums) and nums[ptr] <= top:\n top += nums[ptr]\n ptr += 1\n else:\n count_added += 1\n top *= 2\n return count_added","memory":"16600"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n miss = 1\n patches = 0\n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n patches += 1\n miss += miss\n return patches\n\n\n\"\"\"\n[1,2,4,5,10]\n\n[1, 2, 3, 4, 5, ]\n\"\"\"","memory":"16600"},{"code":"class Solution:\n def minPatches(self, nums: List[int], n: int) -> int:\n missing = 1\n cnt = 0\n i = 0\n while missing <= n:\n if i < len(nums) and nums[i] <= missing:\n missing += nums[i]\n i += 1\n else:\n missing += missing\n cnt += 1\n return cnt\n\n \n ","memory":"16700"},{"code":"class Solution:\n def minPatches(self, nums: list[int], n: int) -> int:\n patches = 0\n miss = 1\n i = 0\n while miss <= n:\n if i < len(nums) and nums[i] <= miss:\n miss += nums[i]\n i += 1\n else:\n miss += miss\n patches += 1\n return patches\n\n# Example usage:\nsol = Solution()\n\n# Example 1\nnums = [1, 3]\nn = 6\nprint(sol.minPatches(nums, n)) # Output: 1\n\n# Example 2\nnums = [1, 5, 10]\nn = 20\nprint(sol.minPatches(nums, n)) # Output: 2\n\n# Example 3\nnums = [1, 2, 2]\nn = 5\nprint(sol.minPatches(nums, n)) # Output: 0\n","memory":"16700"}],"string":"[\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches = 0\\n miss = 1\\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n return patches\\n\\n# Example usage for testing:\\nnums = [1, 3]\\nn = 6\\nsolution = Solution()\\nprint(solution.minPatches(nums, n)) # Output: 1\\n\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n ans = 0\\n missing = 1\\n i = 0\\n while missing <= n:\\n if i < len(nums) and nums[i] <= missing:\\n missing += nums[i]\\n i += 1\\n else:\\n missing += missing\\n ans += 1\\n return ans\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n patches=0\\n csum=1\\n i=0\\n while csum<=n:\\n if i<len(nums) and nums[i]<=csum:\\n csum+=nums[i]\\n i+=1\\n else:\\n csum+=csum\\n patches+=1\\n return patches\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n #is there some property we can leverage to determine if a subseq exists in a array to form a sum\\n #backtracking 1-> n \\n top = 1\\n count_added = 0\\n ptr = 0\\n while top <= n:\\n if ptr < len(nums) and nums[ptr] <= top:\\n top += nums[ptr]\\n ptr += 1\\n else:\\n count_added += 1\\n top *= 2\\n return count_added\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n miss = 1\\n patches = 0\\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n patches += 1\\n miss += miss\\n return patches\\n\\n\\n\\\"\\\"\\\"\\n[1,2,4,5,10]\\n\\n[1, 2, 3, 4, 5, ]\\n\\\"\\\"\\\"\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: List[int], n: int) -> int:\\n missing = 1\\n cnt = 0\\n i = 0\\n while missing <= n:\\n if i < len(nums) and nums[i] <= missing:\\n missing += nums[i]\\n i += 1\\n else:\\n missing += missing\\n cnt += 1\\n return cnt\\n\\n \\n \",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def minPatches(self, nums: list[int], n: int) -> int:\\n patches = 0\\n miss = 1\\n i = 0\\n while miss <= n:\\n if i < len(nums) and nums[i] <= miss:\\n miss += nums[i]\\n i += 1\\n else:\\n miss += miss\\n patches += 1\\n return patches\\n\\n# Example usage:\\nsol = Solution()\\n\\n# Example 1\\nnums = [1, 3]\\nn = 6\\nprint(sol.minPatches(nums, n)) # Output: 1\\n\\n# Example 2\\nnums = [1, 5, 10]\\nn = 20\\nprint(sol.minPatches(nums, n)) # Output: 2\\n\\n# Example 3\\nnums = [1, 2, 2]\\nn = 5\\nprint(sol.minPatches(nums, n)) # Output: 0\\n\",\n \"memory\": \"16700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":260,"cells":{"question_id":{"kind":"number","value":331,"string":"331"},"name":{"kind":"string","value":"verify-preorder-serialization-of-a-binary-tree"},"content":{"kind":"string","value":"<p>One way to serialize a binary tree is to use <strong>preorder traversal</strong>. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as <code>'#'</code>.</p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/12/pre-tree.jpg\" style=\"width: 362px; height: 293px;\" />\n<p>For example, the above binary tree can be serialized to the string <code>"9,3,4,#,#,1,#,#,2,#,6,#,#"</code>, where <code>'#'</code> represents a null node.</p>\n\n<p>Given a string of comma-separated values <code>preorder</code>, return <code>true</code> if it is a correct preorder traversal serialization of a binary tree.</p>\n\n<p>It is <strong>guaranteed</strong> that each comma-separated value in the string must be either an integer or a character <code>'#'</code> representing null pointer.</p>\n\n<p>You may assume that the input format is always valid.</p>\n\n<ul>\n\t<li>For example, it could never contain two consecutive commas, such as <code>"1,,3"</code>.</li>\n</ul>\n\n<p><strong>Note: </strong>You are not allowed to reconstruct the tree.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> preorder = \"9,3,4,#,#,1,#,#,2,#,6,#,#\"\n<strong>Output:</strong> true\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> preorder = \"1,#\"\n<strong>Output:</strong> false\n</pre><p><strong class=\"example\">Example 3:</strong></p>\n<pre><strong>Input:</strong> preorder = \"9,#,#,1\"\n<strong>Output:</strong> false\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= preorder.length <= 10<sup>4</sup></code></li>\n\t<li><code>preorder</code> consist of integers in the range <code>[0, 100]</code> and <code>'#'</code> separated by commas <code>','</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":45.52512846221331,"string":"45.525128"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["string","stack","tree","binary-tree"],"string":"[\n \"string\",\n \"stack\",\n \"tree\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"19\", 0.1927], [\"20\", 0.1927], [\"22\", 0.1927], [\"23\", 0.578], [\"24\", 0.7707], [\"25\", 0.1927], [\"26\", 1.1561], [\"27\", 2.3121], [\"28\", 1.3487], [\"29\", 1.3487], [\"30\", 2.3121], [\"31\", 3.6609], [\"32\", 5.0096], [\"33\", 4.2389], [\"34\", 7.1291], [\"35\", 6.7437], [\"36\", 6.3584], [\"37\", 4.4316], [\"38\", 6.5511], [\"39\", 7.5145], [\"40\", 6.5511], [\"41\", 5.5877], [\"42\", 4.2389], [\"43\", 4.2389], [\"44\", 2.6975], [\"45\", 4.2389], [\"46\", 2.5048], [\"47\", 1.1561], [\"48\", 1.5414]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.1927], [\"16300\", 0.9634], [\"16400\", 7.1291], [\"16500\", 28.5164], [\"16600\", 38.7283], [\"16700\", 18.1118]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n stack_ = []\n N = 0\n preorder = preorder.split(\",\")\n\n if len(preorder)==1 and preorder[0]!=\"#\":\n return False\n\n if preorder[0]==\"#\" and len(preorder)>1:\n return False\n preorder = preorder[:-1]\n \n\n for str_ in preorder:\n if str_==\"#\":\n if N==0:\n return False \n if stack_[0]!=\"#\":\n stack_=stack_[1:]\n N-=1\n else:\n return False\n else:\n N+=1\n stack_ = [str_] + stack_\n\n if N==0 :\n return True\n\n return False\n \n\n ","runtime":"19"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n stack = []\n for x in preorder.split(','):\n stack.append(x)\n while len(stack) > 2 and stack[-1] == stack[-2] == '#' and stack[-3] != '#':\n stack[-3] = '#'\n stack[-2:] = []\n return stack == ['#']","runtime":"20"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n def dfs(tokens):\n if tokens == []: return False\n \n left = tokens.pop(0)\n if not tokens: return False\n right = tokens.pop(0)\n \n if left != \"#\" and not dfs(tokens):\n return False\n \n if right != \"#\" and not dfs(tokens):\n return False\n return True\n\n tokens = preorder.split(',')\n if tokens.pop(0) == \"#\":\n return tokens == []\n return dfs(tokens) and tokens == []\n \n","runtime":"22"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # Split the preorder string into a list of nodes\n nodes = preorder.split(',')\n \n # Initialize the stack\n stack = []\n \n for node in nodes:\n # Push the current node onto the stack\n stack.append(node)\n \n # Check if the top of the stack is forming a complete subtree\n while len(stack) >= 3 and stack[-1] == '#' and stack[-2] == '#' and stack[-3] != '#':\n # Pop the two '#' and the parent node\n stack.pop()\n stack.pop()\n stack.pop()\n \n # Push a '#' to represent the completed subtree\n stack.append('#')\n \n # After processing all nodes, the stack should contain exactly one '#'\n return len(stack) == 1 and stack[0] == '#'\n\n# Example usage:\nsolution = Solution()\npreorder1 = \"9,3,4,#,#,1,#,#,2,#,6,#,#\"\npreorder2 = \"1,#\"\npreorder3 = \"9,#,#,1\"\n\nprint(solution.isValidSerialization(preorder1)) # Output: True\nprint(solution.isValidSerialization(preorder2)) # Output: False\nprint(solution.isValidSerialization(preorder3)) # Output: False","runtime":"23"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = preorder.split(',')\n stack = []\n node, left, right, cur = preorder[0], None, None, 'L'\n n = len(preorder)\n if n == 1:\n return node == '#'\n elif node == '#':\n return False\n\n for i in range(1, n):\n if preorder[i] == '#':\n if cur == 'L':\n cur = 'R'\n left = '#'\n else:\n if stack:\n node = stack.pop()\n left = \"#\"\n cur = 'R'\n else:\n return i == n - 1\n else:\n stack.append(node)\n node, left, right = preorder[i], None, None\n\n return stack == [] and left == '#' and right == '#'","runtime":"24"},{"code":"class Solution(object):\n def isValidSerialization(self, preorder):\n \"\"\"\n :type preorder: str\n :rtype: bool\n \"\"\"\n # remember how many empty slots we have\n # non-null nodes occupy one slot but create two new slots\n # null nodes occupy one slot\n \n p = preorder.split(',')\n \n #initially we have one empty slot to put the root in it\n slot = 1\n for node in p:\n \n # no empty slot to put the current node\n if slot == 0:\n return False\n \n # a null node?\n if node == '#':\n # ocuppy slot\n slot -= 1\n else:\n # create new slot\n slot += 1\n \n #we don't allow empty slots at the end\n return slot==0","runtime":"25"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n nodes = preorder.split(',')\n slots = 1 # Start with one slot for the root\n \n for node in nodes:\n slots -= 1 # Every node (whether null or not) consumes one slot\n \n if slots < 0: # If slots go negative, it means more nodes than slots\n return False\n \n if node != '#':\n slots += 2 # Non-null nodes create two new slots for their children\n \n return slots == 0 # All slots must be exactly used up\n\n# Example usage:\nsol = Solution()\n\n# Example 1\npreorder = \"9,3,4,#,#,1,#,#,2,#,6,#,#\"\nprint(sol.isValidSerialization(preorder)) # Output: true\n\n# Example 2\npreorder = \"1,#\"\nprint(sol.isValidSerialization(preorder)) # Output: false\n\n# Example 3\npreorder = \"9,#,#,1\"\nprint(sol.isValidSerialization(preorder)) # Output: false\n","runtime":"26"},{"code":"class Solution: \n def isValidSerialization(self, preorder: str) -> bool: \n # Split the preorder string by commas.\n nodes = preorder.split(',') \n # Initialize a slot count to 1 (for the root).\n slots = 1 \n # Traverse each node value in the preorder list.\n for node in nodes: \n # A node (non-null or null) takes one slot.\n slots -= 1 \n # If at any time the number of slots becomes negative,\n # it means the serialization is invalid.\n if slots < 0: \n return False \n # Non-null nodes add two more slots (for its children).\n if node != '#': \n slots += 2 \n # In the end, all slots should be used up for the serialization to be valid.\n return slots == 0","runtime":"27"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n if preorder[0] == '#': return preorder == '#'\n open_leaves = 2\n for val in preorder.split(',')[1:]:\n if not open_leaves: return False\n if val == '#':\n open_leaves -= 1\n else:\n open_leaves += 1\n return open_leaves == 0","runtime":"28"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n balance=1\n for node in preorder.split(','):\n if balance<=0:\n return False\n if node=='#':\n balance-=1\n else:\n balance+=1\n return balance==0","runtime":"29"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n bal = 1\n for ele in preorder.split(','):\n if bal <= 0:\n return False\n if ele == \"#\":\n bal -= 1\n else:\n bal += 1\n \n \n return bal == 0","runtime":"30"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n\n balance = 1\n for node in preorder.split(','):\n if balance <= 0:\n return False\n if node == '#':\n balance -= 1\n else:\n balance += 1\n return balance == 0\n ","runtime":"30"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n balance = 1\n nodes = preorder.split(',')\n for node in nodes:\n if balance<=0:\n return False\n if node=='#':\n balance-=1\n else:\n balance+=1\n return balance==0","runtime":"31"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # Split the input string by commas to get the nodes\n nodes = preorder.split(',')\n \n # Start with one slot for the root\n slots = 1\n \n # Traverse each node in the preorder serialization\n for node in nodes:\n # Use one slot for the current node\n slots -= 1\n \n # If at any point slots become negative, the serialization is invalid\n if slots < 0:\n return False\n \n # If the node is not a null node, it provides two additional slots\n if node != '#':\n slots += 2\n \n # For a valid serialization, all slots should be used up\n return slots == 0","runtime":"32"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # null node has 0 kids\n # non-null node has 2 kids: null or non-null\n # valid if u follow both!\n # track the number of kids, (slots for kids!)\n\n # null node: 0 kids, takes 1 space: - 1\n # non-null node: consumes 1 slot, makes 2 new spots: -1 + 2 = 1\n\n # count slots: Must > 0 the whole time?\n # at the end there should be 0 slots.\n # initially we have 1 slot for the root node (which cannot be null)\n slots = 1\n arr = preorder.split(\",\")\n\n for c in arr:\n if slots <= 0:\n return False\n \n if c == '#':\n slots -= 1\n else:\n slots += 1\n\n return slots == 0","runtime":"33"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n arr = preorder.split(',')\n if arr[0] == '#' and len(arr)>1:\n return False\n\n def find_end(i):\n\n if i >= len(arr):\n return -1\n if arr[i] == '#':\n return i\n #print(i)\n end_of_left = find_end(i+1)\n if end_of_left == -1:\n return -1\n end_of_right = find_end(end_of_left + 1)\n #print(i, end_of_left, end_of_right)\n return end_of_right\n \n end = find_end(0)\n print(end)\n if end != len(arr)-1:\n return False\n return True\n ","runtime":"33"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # stack\n # if encounter a number, push it to the stack\n # if encounter a #, check if the top of the stack is also #\n # if yes, pop the top of the stack and push a #\n # if no, push the # to the stack\n # if the stack is empty after the whole string is looped, return True\n \n stack = []\n for node in preorder.split(\",\"):\n stack.append(node)\n while len(stack) >= 3 and stack[-1] == stack[-2] == \"#\" and stack[-3] != \"#\":\n stack.pop()\n stack.pop()\n stack.pop()\n stack.append(\"#\")\n return len(stack) == 1 and stack[0] == \"#\"\n ","runtime":"34"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = list(preorder.split(','))\n check = 0\n counter = 1\n for data in preorder:\n if data == '#':\n counter -= 1\n if counter <= 0:\n check += 1\n else:\n counter += 1\n if check > 1:\n return False\n return counter == 0\n ","runtime":"35"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n bal = 1\n for ele in preorder.split(','):\n if bal <= 0:\n return False\n if ele == \"#\":\n bal -= 1\n else:\n bal += 1\n \n \n return bal == 0","runtime":"35"},{"code":"class Solution:\n def findNode(self,curI:int):\n self.cnt+=1\n if self.ans==False:\n return 0\n leftI= curI+1\n if leftI >= self.lenn: \n self.ans= False\n return 0\n countLeft= self.findNode(leftI) if self.preorder[leftI]!='#' else 0\n self.cnt+=1 if countLeft==0 else 0\n\n rightI = curI+2+countLeft*2\n if rightI >= self.lenn:\n self.ans= False\n return 0\n countRight= self.findNode(rightI) if self.preorder[rightI]!='#' else 0\n self.cnt+=1 if countRight==0 else 0\n\n return countLeft+countRight+1\n\n def isValidSerialization(self, preorder: str) -> bool:\n if preorder[0]==\"#\":\n return True if len(preorder)==1 else False\n self.ans,self.preorder,self.cnt= True,preorder.split(','),0\n self.lenn= len(self.preorder)\n self.findNode(0)\n return self.ans if self.cnt== self.lenn else False","runtime":"36"},{"code":"class Solution:\n \n def isValidSerialization(self, input: str) -> bool:\n preorder = input.split(\",\")\n stack = []\n ix = 0\n\n while ix < len(preorder):\n\n if len(stack) > 0:\n stack[-1] += 1\n if stack[-1] == 2:\n stack.pop()\n \n if preorder[ix] != '#':\n stack.append(0)\n \n if len(stack) == 0:\n return ix == len(preorder) - 1\n\n ix += 1\n\n\n\n return len(stack) == 0\n\n\n\n\n\n\n\n\n ","runtime":"37"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n arr=preorder.split(',')\n parent_stack=[]\n child_stack=[[]]\n\n for i in range(len(arr)):\n if arr[i]!=\"#\":\n parent_stack.append(arr[i])\n child_stack.append([])\n else:\n child_stack[-1].append(\"#\")\n while len(child_stack[-1])==2:\n if len(parent_stack)==0:\n return False\n else:\n child_stack.pop()\n c=parent_stack.pop()\n child_stack[-1].append(c)\n return len(parent_stack)==0 and len(child_stack)==1","runtime":"38"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = preorder.split(\",\")\n stack = []\n for c in preorder:\n while stack and stack[-1] == \"#\" and c == \"#\":\n stack.pop()\n if not stack or stack[-1] == \"#\":\n return False\n stack.pop()\n stack.append(c)\n return len(stack) == 1 and stack[0] == \"#\"","runtime":"39"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = preorder.split(\",\")\n null_slots = 1\n for c in preorder:\n if null_slots == 0:\n return False\n if c == \"#\":\n null_slots -= 1\n else:\n null_slots += 1\n return null_slots == 0","runtime":"40"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n nodes = preorder.split(',')\n stack = []\n \n for node in nodes:\n stack.append(node)\n \n while len(stack) >= 3 and stack[-1] == '#' and stack[-2] == '#':\n stack.pop() # Remove the second '#'\n stack.pop() # Remove the first '#'\n \n if stack[-1] == '#':\n return False # If the parent is also a '#', it's invalid\n \n stack.pop() # Remove the parent node\n stack.append('#') # Add a '#' to indicate a null node\n \n return len(stack) == 1 and stack[0] == '#'\n\n# Example usage:\nsolution = Solution()\npreorder = \"9,3,4,#,#,1,#,#,2,#,6,#,#\"\nprint(solution.isValidSerialization(preorder)) # Output: True","runtime":"41"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n slots = 1\n for node in preorder.split(\",\"):\n slots -= 1\n if slots < 0:\n return False\n if node != \"#\":\n slots += 2\n return slots == 0\n","runtime":"42"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n if preorder[0] == '#':\n return len(preorder) == 1\n stack = []\n time = 0\n childrenCount = []\n preorderArr = preorder.split(',')\n for i in range(len(preorderArr)):\n if time > 0 and len(stack) == 0:\n return False\n if preorderArr[i].isdigit():\n childrenCount.append(0)\n stack.append(time)\n if time > 0:\n childrenCount[stack[-1]] += 1\n if childrenCount[stack[-1]] > 2:\n return False\n time += 1\n else:\n if len(stack) == 0:\n return False\n childrenCount[stack[-1]] += 1\n while len(stack) > 0 and childrenCount[stack[-1]] == 2:\n stack.pop(-1)\n return len(stack) == 0","runtime":"42"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n arr = preorder.split(',')\n if arr[0] == '#' and len(arr)>1:\n return False\n\n def find_end(i):\n\n if i >= len(arr):\n return -1\n if arr[i] == '#':\n return i\n #print(i)\n end_of_left = find_end(i+1)\n if end_of_left == -1:\n return -1\n end_of_right = find_end(end_of_left + 1)\n #print(i, end_of_left, end_of_right)\n return end_of_right\n \n end = find_end(0)\n #print(end)\n if end != len(arr)-1:\n return False\n return True\n ","runtime":"43"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n arr = preorder.split(',')\n if arr[0] == '#' and len(arr)>1:\n return False\n\n def find_end(i):\n\n if i >= len(arr):\n return -1\n if arr[i] == '#':\n return i\n #print(i)\n end_of_left = find_end(i+1)\n if end_of_left == -1:\n return -1\n end_of_right = find_end(end_of_left + 1)\n #print(i, end_of_left, end_of_right)\n return end_of_right\n \n end = find_end(0)\n #print(end)\n if end != len(arr)-1:\n return False\n return True\n ","runtime":"43"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n current = preorder\n while current != '#':\n new = re.sub(r\"\\d+,#,#\", \"#\", current)\n if new == current:\n return False\n current = new\n return True","runtime":"44"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # stack\n # if encounter a number, push it to the stack\n # if encounter a #, check if the \"top\" of stack is num, #, #\n # if yes, pop the 3 elements and push a #\n # if no, push the # to the stack\n # finally, check if the stack has only 1 element and it is #\n\n stack = []\n for node in preorder.split(\",\"):\n stack.append(node)\n while (\n len(stack) >= 3 and stack[-1] == stack[-2] == \"#\" and stack[-3] != \"#\"\n ):\n stack.pop(), stack.pop(), stack.pop()\n stack.append(\"#\")\n return len(stack) == 1 and stack[0] == \"#\"\n\n","runtime":"44"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n degree = 1 # out-degree (children) - in-degree (parent)\n\n for node in preorder.split(','):\n degree -= 1\n if degree < 0:\n return False\n if node != '#':\n degree += 2\n\n return degree == 0","runtime":"45"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # Split the preorder string into a list of values\n nodes = preorder.split(',')\n \n # Stack to keep track of nodes\n stack = []\n \n for node in nodes:\n # Push the node to the stack\n stack.append(node)\n \n # Check if the top of the stack is a valid end of a subtree\n while len(stack) >= 3 and stack[-1] == '#' and stack[-2] == '#' and stack[-3] != '#':\n # Pop the null nodes and their parent\n stack.pop()\n stack.pop()\n stack.pop()\n \n # Replace the parent with a null node\n stack.append('#')\n \n # After processing all nodes, the stack should contain exactly one null node ('#')\n return len(stack) == 1 and stack[0] == '#'\n\n# Example usage:\nsolution = Solution()\nprint(solution.isValidSerialization(\"9,3,4,#,#,1,#,#,2,#,6,#,#\")) # Output: True\nprint(solution.isValidSerialization(\"1,#\")) # Output: False\nprint(solution.isValidSerialization(\"9,#,#,1\")) # Output: False","runtime":"46"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n arr = preorder.split(',')\n if arr[0] == '#' and len(arr)>1:\n return False\n\n def find_end(i):\n\n if i >= len(arr):\n return -1\n if arr[i] == '#':\n return i\n #print(i)\n end_of_left = find_end(i+1)\n if end_of_left == -1:\n return -1\n end_of_right = find_end(end_of_left + 1)\n #print(i, end_of_left, end_of_right)\n return end_of_right\n \n end = find_end(0)\n #print(end)\n if end != len(arr)-1:\n return False\n return True\n ","runtime":"47"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n lst = preorder.split(\",\")\n for i in range(len(lst)):\n if lst[i].isdigit():\n lst[i] = int(lst[i])\n\n last_len = -1\n while len(lst) > 1:\n if len(lst) % 2 == 0 or len(lst) == last_len:\n return False\n\n last_len = len(lst)\n i = len(lst) - 1\n while i >= 2:\n if lst[i-2] != \"#\" and lst[i-1] == \"#\" and lst[i] == \"#\":\n lst.pop(i)\n lst.pop(i-1)\n lst[i-2] = \"#\"\n break\n else:\n i -= 1\n\n return lst[0] == \"#\"","runtime":"48"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n self.i = -1\n def dfs():\n self.i += 1\n if self.i >= len(preorder) or preorder[self.i] == '#':\n return\n else:\n dfs()\n dfs()\n \n preorder = preorder.split(',')\n dfs()\n\n return self.i == len(preorder) - 1","runtime":"48"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n stack_ = []\\n N = 0\\n preorder = preorder.split(\\\",\\\")\\n\\n if len(preorder)==1 and preorder[0]!=\\\"#\\\":\\n return False\\n\\n if preorder[0]==\\\"#\\\" and len(preorder)>1:\\n return False\\n preorder = preorder[:-1]\\n \\n\\n for str_ in preorder:\\n if str_==\\\"#\\\":\\n if N==0:\\n return False \\n if stack_[0]!=\\\"#\\\":\\n stack_=stack_[1:]\\n N-=1\\n else:\\n return False\\n else:\\n N+=1\\n stack_ = [str_] + stack_\\n\\n if N==0 :\\n return True\\n\\n return False\\n \\n\\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n stack = []\\n for x in preorder.split(','):\\n stack.append(x)\\n while len(stack) > 2 and stack[-1] == stack[-2] == '#' and stack[-3] != '#':\\n stack[-3] = '#'\\n stack[-2:] = []\\n return stack == ['#']\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n def dfs(tokens):\\n if tokens == []: return False\\n \\n left = tokens.pop(0)\\n if not tokens: return False\\n right = tokens.pop(0)\\n \\n if left != \\\"#\\\" and not dfs(tokens):\\n return False\\n \\n if right != \\\"#\\\" and not dfs(tokens):\\n return False\\n return True\\n\\n tokens = preorder.split(',')\\n if tokens.pop(0) == \\\"#\\\":\\n return tokens == []\\n return dfs(tokens) and tokens == []\\n \\n\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # Split the preorder string into a list of nodes\\n nodes = preorder.split(',')\\n \\n # Initialize the stack\\n stack = []\\n \\n for node in nodes:\\n # Push the current node onto the stack\\n stack.append(node)\\n \\n # Check if the top of the stack is forming a complete subtree\\n while len(stack) >= 3 and stack[-1] == '#' and stack[-2] == '#' and stack[-3] != '#':\\n # Pop the two '#' and the parent node\\n stack.pop()\\n stack.pop()\\n stack.pop()\\n \\n # Push a '#' to represent the completed subtree\\n stack.append('#')\\n \\n # After processing all nodes, the stack should contain exactly one '#'\\n return len(stack) == 1 and stack[0] == '#'\\n\\n# Example usage:\\nsolution = Solution()\\npreorder1 = \\\"9,3,4,#,#,1,#,#,2,#,6,#,#\\\"\\npreorder2 = \\\"1,#\\\"\\npreorder3 = \\\"9,#,#,1\\\"\\n\\nprint(solution.isValidSerialization(preorder1)) # Output: True\\nprint(solution.isValidSerialization(preorder2)) # Output: False\\nprint(solution.isValidSerialization(preorder3)) # Output: False\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = preorder.split(',')\\n stack = []\\n node, left, right, cur = preorder[0], None, None, 'L'\\n n = len(preorder)\\n if n == 1:\\n return node == '#'\\n elif node == '#':\\n return False\\n\\n for i in range(1, n):\\n if preorder[i] == '#':\\n if cur == 'L':\\n cur = 'R'\\n left = '#'\\n else:\\n if stack:\\n node = stack.pop()\\n left = \\\"#\\\"\\n cur = 'R'\\n else:\\n return i == n - 1\\n else:\\n stack.append(node)\\n node, left, right = preorder[i], None, None\\n\\n return stack == [] and left == '#' and right == '#'\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution(object):\\n def isValidSerialization(self, preorder):\\n \\\"\\\"\\\"\\n :type preorder: str\\n :rtype: bool\\n \\\"\\\"\\\"\\n # remember how many empty slots we have\\n # non-null nodes occupy one slot but create two new slots\\n # null nodes occupy one slot\\n \\n p = preorder.split(',')\\n \\n #initially we have one empty slot to put the root in it\\n slot = 1\\n for node in p:\\n \\n # no empty slot to put the current node\\n if slot == 0:\\n return False\\n \\n # a null node?\\n if node == '#':\\n # ocuppy slot\\n slot -= 1\\n else:\\n # create new slot\\n slot += 1\\n \\n #we don't allow empty slots at the end\\n return slot==0\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n nodes = preorder.split(',')\\n slots = 1 # Start with one slot for the root\\n \\n for node in nodes:\\n slots -= 1 # Every node (whether null or not) consumes one slot\\n \\n if slots < 0: # If slots go negative, it means more nodes than slots\\n return False\\n \\n if node != '#':\\n slots += 2 # Non-null nodes create two new slots for their children\\n \\n return slots == 0 # All slots must be exactly used up\\n\\n# Example usage:\\nsol = Solution()\\n\\n# Example 1\\npreorder = \\\"9,3,4,#,#,1,#,#,2,#,6,#,#\\\"\\nprint(sol.isValidSerialization(preorder)) # Output: true\\n\\n# Example 2\\npreorder = \\\"1,#\\\"\\nprint(sol.isValidSerialization(preorder)) # Output: false\\n\\n# Example 3\\npreorder = \\\"9,#,#,1\\\"\\nprint(sol.isValidSerialization(preorder)) # Output: false\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution: \\n def isValidSerialization(self, preorder: str) -> bool: \\n # Split the preorder string by commas.\\n nodes = preorder.split(',') \\n # Initialize a slot count to 1 (for the root).\\n slots = 1 \\n # Traverse each node value in the preorder list.\\n for node in nodes: \\n # A node (non-null or null) takes one slot.\\n slots -= 1 \\n # If at any time the number of slots becomes negative,\\n # it means the serialization is invalid.\\n if slots < 0: \\n return False \\n # Non-null nodes add two more slots (for its children).\\n if node != '#': \\n slots += 2 \\n # In the end, all slots should be used up for the serialization to be valid.\\n return slots == 0\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n if preorder[0] == '#': return preorder == '#'\\n open_leaves = 2\\n for val in preorder.split(',')[1:]:\\n if not open_leaves: return False\\n if val == '#':\\n open_leaves -= 1\\n else:\\n open_leaves += 1\\n return open_leaves == 0\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n balance=1\\n for node in preorder.split(','):\\n if balance<=0:\\n return False\\n if node=='#':\\n balance-=1\\n else:\\n balance+=1\\n return balance==0\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n bal = 1\\n for ele in preorder.split(','):\\n if bal <= 0:\\n return False\\n if ele == \\\"#\\\":\\n bal -= 1\\n else:\\n bal += 1\\n \\n \\n return bal == 0\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n\\n balance = 1\\n for node in preorder.split(','):\\n if balance <= 0:\\n return False\\n if node == '#':\\n balance -= 1\\n else:\\n balance += 1\\n return balance == 0\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n balance = 1\\n nodes = preorder.split(',')\\n for node in nodes:\\n if balance<=0:\\n return False\\n if node=='#':\\n balance-=1\\n else:\\n balance+=1\\n return balance==0\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # Split the input string by commas to get the nodes\\n nodes = preorder.split(',')\\n \\n # Start with one slot for the root\\n slots = 1\\n \\n # Traverse each node in the preorder serialization\\n for node in nodes:\\n # Use one slot for the current node\\n slots -= 1\\n \\n # If at any point slots become negative, the serialization is invalid\\n if slots < 0:\\n return False\\n \\n # If the node is not a null node, it provides two additional slots\\n if node != '#':\\n slots += 2\\n \\n # For a valid serialization, all slots should be used up\\n return slots == 0\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # null node has 0 kids\\n # non-null node has 2 kids: null or non-null\\n # valid if u follow both!\\n # track the number of kids, (slots for kids!)\\n\\n # null node: 0 kids, takes 1 space: - 1\\n # non-null node: consumes 1 slot, makes 2 new spots: -1 + 2 = 1\\n\\n # count slots: Must > 0 the whole time?\\n # at the end there should be 0 slots.\\n # initially we have 1 slot for the root node (which cannot be null)\\n slots = 1\\n arr = preorder.split(\\\",\\\")\\n\\n for c in arr:\\n if slots <= 0:\\n return False\\n \\n if c == '#':\\n slots -= 1\\n else:\\n slots += 1\\n\\n return slots == 0\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n arr = preorder.split(',')\\n if arr[0] == '#' and len(arr)>1:\\n return False\\n\\n def find_end(i):\\n\\n if i >= len(arr):\\n return -1\\n if arr[i] == '#':\\n return i\\n #print(i)\\n end_of_left = find_end(i+1)\\n if end_of_left == -1:\\n return -1\\n end_of_right = find_end(end_of_left + 1)\\n #print(i, end_of_left, end_of_right)\\n return end_of_right\\n \\n end = find_end(0)\\n print(end)\\n if end != len(arr)-1:\\n return False\\n return True\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # stack\\n # if encounter a number, push it to the stack\\n # if encounter a #, check if the top of the stack is also #\\n # if yes, pop the top of the stack and push a #\\n # if no, push the # to the stack\\n # if the stack is empty after the whole string is looped, return True\\n \\n stack = []\\n for node in preorder.split(\\\",\\\"):\\n stack.append(node)\\n while len(stack) >= 3 and stack[-1] == stack[-2] == \\\"#\\\" and stack[-3] != \\\"#\\\":\\n stack.pop()\\n stack.pop()\\n stack.pop()\\n stack.append(\\\"#\\\")\\n return len(stack) == 1 and stack[0] == \\\"#\\\"\\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = list(preorder.split(','))\\n check = 0\\n counter = 1\\n for data in preorder:\\n if data == '#':\\n counter -= 1\\n if counter <= 0:\\n check += 1\\n else:\\n counter += 1\\n if check > 1:\\n return False\\n return counter == 0\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n bal = 1\\n for ele in preorder.split(','):\\n if bal <= 0:\\n return False\\n if ele == \\\"#\\\":\\n bal -= 1\\n else:\\n bal += 1\\n \\n \\n return bal == 0\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def findNode(self,curI:int):\\n self.cnt+=1\\n if self.ans==False:\\n return 0\\n leftI= curI+1\\n if leftI >= self.lenn: \\n self.ans= False\\n return 0\\n countLeft= self.findNode(leftI) if self.preorder[leftI]!='#' else 0\\n self.cnt+=1 if countLeft==0 else 0\\n\\n rightI = curI+2+countLeft*2\\n if rightI >= self.lenn:\\n self.ans= False\\n return 0\\n countRight= self.findNode(rightI) if self.preorder[rightI]!='#' else 0\\n self.cnt+=1 if countRight==0 else 0\\n\\n return countLeft+countRight+1\\n\\n def isValidSerialization(self, preorder: str) -> bool:\\n if preorder[0]==\\\"#\\\":\\n return True if len(preorder)==1 else False\\n self.ans,self.preorder,self.cnt= True,preorder.split(','),0\\n self.lenn= len(self.preorder)\\n self.findNode(0)\\n return self.ans if self.cnt== self.lenn else False\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n \\n def isValidSerialization(self, input: str) -> bool:\\n preorder = input.split(\\\",\\\")\\n stack = []\\n ix = 0\\n\\n while ix < len(preorder):\\n\\n if len(stack) > 0:\\n stack[-1] += 1\\n if stack[-1] == 2:\\n stack.pop()\\n \\n if preorder[ix] != '#':\\n stack.append(0)\\n \\n if len(stack) == 0:\\n return ix == len(preorder) - 1\\n\\n ix += 1\\n\\n\\n\\n return len(stack) == 0\\n\\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n arr=preorder.split(',')\\n parent_stack=[]\\n child_stack=[[]]\\n\\n for i in range(len(arr)):\\n if arr[i]!=\\\"#\\\":\\n parent_stack.append(arr[i])\\n child_stack.append([])\\n else:\\n child_stack[-1].append(\\\"#\\\")\\n while len(child_stack[-1])==2:\\n if len(parent_stack)==0:\\n return False\\n else:\\n child_stack.pop()\\n c=parent_stack.pop()\\n child_stack[-1].append(c)\\n return len(parent_stack)==0 and len(child_stack)==1\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = preorder.split(\\\",\\\")\\n stack = []\\n for c in preorder:\\n while stack and stack[-1] == \\\"#\\\" and c == \\\"#\\\":\\n stack.pop()\\n if not stack or stack[-1] == \\\"#\\\":\\n return False\\n stack.pop()\\n stack.append(c)\\n return len(stack) == 1 and stack[0] == \\\"#\\\"\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = preorder.split(\\\",\\\")\\n null_slots = 1\\n for c in preorder:\\n if null_slots == 0:\\n return False\\n if c == \\\"#\\\":\\n null_slots -= 1\\n else:\\n null_slots += 1\\n return null_slots == 0\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n nodes = preorder.split(',')\\n stack = []\\n \\n for node in nodes:\\n stack.append(node)\\n \\n while len(stack) >= 3 and stack[-1] == '#' and stack[-2] == '#':\\n stack.pop() # Remove the second '#'\\n stack.pop() # Remove the first '#'\\n \\n if stack[-1] == '#':\\n return False # If the parent is also a '#', it's invalid\\n \\n stack.pop() # Remove the parent node\\n stack.append('#') # Add a '#' to indicate a null node\\n \\n return len(stack) == 1 and stack[0] == '#'\\n\\n# Example usage:\\nsolution = Solution()\\npreorder = \\\"9,3,4,#,#,1,#,#,2,#,6,#,#\\\"\\nprint(solution.isValidSerialization(preorder)) # Output: True\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n slots = 1\\n for node in preorder.split(\\\",\\\"):\\n slots -= 1\\n if slots < 0:\\n return False\\n if node != \\\"#\\\":\\n slots += 2\\n return slots == 0\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n if preorder[0] == '#':\\n return len(preorder) == 1\\n stack = []\\n time = 0\\n childrenCount = []\\n preorderArr = preorder.split(',')\\n for i in range(len(preorderArr)):\\n if time > 0 and len(stack) == 0:\\n return False\\n if preorderArr[i].isdigit():\\n childrenCount.append(0)\\n stack.append(time)\\n if time > 0:\\n childrenCount[stack[-1]] += 1\\n if childrenCount[stack[-1]] > 2:\\n return False\\n time += 1\\n else:\\n if len(stack) == 0:\\n return False\\n childrenCount[stack[-1]] += 1\\n while len(stack) > 0 and childrenCount[stack[-1]] == 2:\\n stack.pop(-1)\\n return len(stack) == 0\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n arr = preorder.split(',')\\n if arr[0] == '#' and len(arr)>1:\\n return False\\n\\n def find_end(i):\\n\\n if i >= len(arr):\\n return -1\\n if arr[i] == '#':\\n return i\\n #print(i)\\n end_of_left = find_end(i+1)\\n if end_of_left == -1:\\n return -1\\n end_of_right = find_end(end_of_left + 1)\\n #print(i, end_of_left, end_of_right)\\n return end_of_right\\n \\n end = find_end(0)\\n #print(end)\\n if end != len(arr)-1:\\n return False\\n return True\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n arr = preorder.split(',')\\n if arr[0] == '#' and len(arr)>1:\\n return False\\n\\n def find_end(i):\\n\\n if i >= len(arr):\\n return -1\\n if arr[i] == '#':\\n return i\\n #print(i)\\n end_of_left = find_end(i+1)\\n if end_of_left == -1:\\n return -1\\n end_of_right = find_end(end_of_left + 1)\\n #print(i, end_of_left, end_of_right)\\n return end_of_right\\n \\n end = find_end(0)\\n #print(end)\\n if end != len(arr)-1:\\n return False\\n return True\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n current = preorder\\n while current != '#':\\n new = re.sub(r\\\"\\\\d+,#,#\\\", \\\"#\\\", current)\\n if new == current:\\n return False\\n current = new\\n return True\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # stack\\n # if encounter a number, push it to the stack\\n # if encounter a #, check if the \\\"top\\\" of stack is num, #, #\\n # if yes, pop the 3 elements and push a #\\n # if no, push the # to the stack\\n # finally, check if the stack has only 1 element and it is #\\n\\n stack = []\\n for node in preorder.split(\\\",\\\"):\\n stack.append(node)\\n while (\\n len(stack) >= 3 and stack[-1] == stack[-2] == \\\"#\\\" and stack[-3] != \\\"#\\\"\\n ):\\n stack.pop(), stack.pop(), stack.pop()\\n stack.append(\\\"#\\\")\\n return len(stack) == 1 and stack[0] == \\\"#\\\"\\n\\n\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n degree = 1 # out-degree (children) - in-degree (parent)\\n\\n for node in preorder.split(','):\\n degree -= 1\\n if degree < 0:\\n return False\\n if node != '#':\\n degree += 2\\n\\n return degree == 0\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # Split the preorder string into a list of values\\n nodes = preorder.split(',')\\n \\n # Stack to keep track of nodes\\n stack = []\\n \\n for node in nodes:\\n # Push the node to the stack\\n stack.append(node)\\n \\n # Check if the top of the stack is a valid end of a subtree\\n while len(stack) >= 3 and stack[-1] == '#' and stack[-2] == '#' and stack[-3] != '#':\\n # Pop the null nodes and their parent\\n stack.pop()\\n stack.pop()\\n stack.pop()\\n \\n # Replace the parent with a null node\\n stack.append('#')\\n \\n # After processing all nodes, the stack should contain exactly one null node ('#')\\n return len(stack) == 1 and stack[0] == '#'\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.isValidSerialization(\\\"9,3,4,#,#,1,#,#,2,#,6,#,#\\\")) # Output: True\\nprint(solution.isValidSerialization(\\\"1,#\\\")) # Output: False\\nprint(solution.isValidSerialization(\\\"9,#,#,1\\\")) # Output: False\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n arr = preorder.split(',')\\n if arr[0] == '#' and len(arr)>1:\\n return False\\n\\n def find_end(i):\\n\\n if i >= len(arr):\\n return -1\\n if arr[i] == '#':\\n return i\\n #print(i)\\n end_of_left = find_end(i+1)\\n if end_of_left == -1:\\n return -1\\n end_of_right = find_end(end_of_left + 1)\\n #print(i, end_of_left, end_of_right)\\n return end_of_right\\n \\n end = find_end(0)\\n #print(end)\\n if end != len(arr)-1:\\n return False\\n return True\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n lst = preorder.split(\\\",\\\")\\n for i in range(len(lst)):\\n if lst[i].isdigit():\\n lst[i] = int(lst[i])\\n\\n last_len = -1\\n while len(lst) > 1:\\n if len(lst) % 2 == 0 or len(lst) == last_len:\\n return False\\n\\n last_len = len(lst)\\n i = len(lst) - 1\\n while i >= 2:\\n if lst[i-2] != \\\"#\\\" and lst[i-1] == \\\"#\\\" and lst[i] == \\\"#\\\":\\n lst.pop(i)\\n lst.pop(i-1)\\n lst[i-2] = \\\"#\\\"\\n break\\n else:\\n i -= 1\\n\\n return lst[0] == \\\"#\\\"\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n self.i = -1\\n def dfs():\\n self.i += 1\\n if self.i >= len(preorder) or preorder[self.i] == '#':\\n return\\n else:\\n dfs()\\n dfs()\\n \\n preorder = preorder.split(',')\\n dfs()\\n\\n return self.i == len(preorder) - 1\",\n \"runtime\": \"48\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":36,"string":"36"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n pre = preorder.split(\",\")\n stack = []\n \n for node in pre:\n while stack and node == \"#\" and stack[-1] == \"#\":\n stack.pop()\n if not stack:\n return False\n stack.pop() # Pop the parent node of the null node\n \n stack.append(node)\n \n return len(stack) == 1 and stack[0] == \"#\"\n\n ","memory":"16100"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n balance = 1\n nodes = preorder.split(',')\n for node in nodes:\n if balance<=0:\n return False\n if node=='#':\n balance-=1\n else:\n balance+=1\n return balance==0","memory":"16300"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = preorder.split(',')\n slot = 1\n for node in preorder:\n if slot==0:return False\n if node =='#':\n slot-=1\n else:\n slot+=1\n return slot==0\n ","memory":"16400"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n stk = []\n for c in preorder.split(\",\"):\n stk.append(c)\n while len(stk) > 2 and stk[-1] == stk[-2] == \"#\" and stk[-3] != \"#\":\n stk = stk[:-3]\n stk.append(\"#\")\n return len(stk) == 1 and stk[0] == \"#\"\n ","memory":"16400"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n current = preorder\n while current != '#':\n new = re.sub(r\"\\d+,#,#\", \"#\", current)\n if new == current:\n return False\n current = new\n return True","memory":"16500"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n nodes = preorder.split(',')\n slots = 1 # Start with one slot for the root\n \n for node in nodes:\n slots -= 1 # Every node (whether null or not) consumes one slot\n \n if slots < 0: # If slots go negative, it means more nodes than slots\n return False\n \n if node != '#':\n slots += 2 # Non-null nodes create two new slots for their children\n \n return slots == 0 # All slots must be exactly used up\n\n# Example usage:\nsol = Solution()\n\n# Example 1\npreorder = \"9,3,4,#,#,1,#,#,2,#,6,#,#\"\nprint(sol.isValidSerialization(preorder)) # Output: true\n\n# Example 2\npreorder = \"1,#\"\nprint(sol.isValidSerialization(preorder)) # Output: false\n\n# Example 3\npreorder = \"9,#,#,1\"\nprint(sol.isValidSerialization(preorder)) # Output: false\n","memory":"16500"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = preorder.split(\",\")\n stack = []\n for c in preorder:\n while stack and stack[-1] == \"#\" and c == \"#\":\n stack.pop()\n if not stack or stack[-1] == \"#\":\n return False\n stack.pop()\n stack.append(c)\n return len(stack) == 1 and stack[0] == \"#\"","memory":"16600"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n preorder = preorder.split(\",\")\n null_slots = 1\n for c in preorder:\n if null_slots == 0:\n return False\n if c == \"#\":\n null_slots -= 1\n else:\n null_slots += 1\n return null_slots == 0","memory":"16600"},{"code":"class Solution:\n def isValidSerialization(self, preorder: str) -> bool:\n # stack\n # if encounter a number, push it to the stack\n # if encounter a #, check if the top of the stack is also #\n # if yes, pop the top of the stack and push a #\n # if no, push the # to the stack\n # if the stack is empty after the whole string is looped, return True\n \n stack = []\n for node in preorder.split(\",\"):\n stack.append(node)\n while len(stack) >= 3 and stack[-1] == stack[-2] == \"#\" and stack[-3] != \"#\":\n stack.pop()\n stack.pop()\n stack.pop()\n stack.append(\"#\")\n return len(stack) == 1 and stack[0] == \"#\"\n ","memory":"16700"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n pre = preorder.split(\\\",\\\")\\n stack = []\\n \\n for node in pre:\\n while stack and node == \\\"#\\\" and stack[-1] == \\\"#\\\":\\n stack.pop()\\n if not stack:\\n return False\\n stack.pop() # Pop the parent node of the null node\\n \\n stack.append(node)\\n \\n return len(stack) == 1 and stack[0] == \\\"#\\\"\\n\\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n balance = 1\\n nodes = preorder.split(',')\\n for node in nodes:\\n if balance<=0:\\n return False\\n if node=='#':\\n balance-=1\\n else:\\n balance+=1\\n return balance==0\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = preorder.split(',')\\n slot = 1\\n for node in preorder:\\n if slot==0:return False\\n if node =='#':\\n slot-=1\\n else:\\n slot+=1\\n return slot==0\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n stk = []\\n for c in preorder.split(\\\",\\\"):\\n stk.append(c)\\n while len(stk) > 2 and stk[-1] == stk[-2] == \\\"#\\\" and stk[-3] != \\\"#\\\":\\n stk = stk[:-3]\\n stk.append(\\\"#\\\")\\n return len(stk) == 1 and stk[0] == \\\"#\\\"\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n current = preorder\\n while current != '#':\\n new = re.sub(r\\\"\\\\d+,#,#\\\", \\\"#\\\", current)\\n if new == current:\\n return False\\n current = new\\n return True\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n nodes = preorder.split(',')\\n slots = 1 # Start with one slot for the root\\n \\n for node in nodes:\\n slots -= 1 # Every node (whether null or not) consumes one slot\\n \\n if slots < 0: # If slots go negative, it means more nodes than slots\\n return False\\n \\n if node != '#':\\n slots += 2 # Non-null nodes create two new slots for their children\\n \\n return slots == 0 # All slots must be exactly used up\\n\\n# Example usage:\\nsol = Solution()\\n\\n# Example 1\\npreorder = \\\"9,3,4,#,#,1,#,#,2,#,6,#,#\\\"\\nprint(sol.isValidSerialization(preorder)) # Output: true\\n\\n# Example 2\\npreorder = \\\"1,#\\\"\\nprint(sol.isValidSerialization(preorder)) # Output: false\\n\\n# Example 3\\npreorder = \\\"9,#,#,1\\\"\\nprint(sol.isValidSerialization(preorder)) # Output: false\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = preorder.split(\\\",\\\")\\n stack = []\\n for c in preorder:\\n while stack and stack[-1] == \\\"#\\\" and c == \\\"#\\\":\\n stack.pop()\\n if not stack or stack[-1] == \\\"#\\\":\\n return False\\n stack.pop()\\n stack.append(c)\\n return len(stack) == 1 and stack[0] == \\\"#\\\"\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n preorder = preorder.split(\\\",\\\")\\n null_slots = 1\\n for c in preorder:\\n if null_slots == 0:\\n return False\\n if c == \\\"#\\\":\\n null_slots -= 1\\n else:\\n null_slots += 1\\n return null_slots == 0\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def isValidSerialization(self, preorder: str) -> bool:\\n # stack\\n # if encounter a number, push it to the stack\\n # if encounter a #, check if the top of the stack is also #\\n # if yes, pop the top of the stack and push a #\\n # if no, push the # to the stack\\n # if the stack is empty after the whole string is looped, return True\\n \\n stack = []\\n for node in preorder.split(\\\",\\\"):\\n stack.append(node)\\n while len(stack) >= 3 and stack[-1] == stack[-2] == \\\"#\\\" and stack[-3] != \\\"#\\\":\\n stack.pop()\\n stack.pop()\\n stack.pop()\\n stack.append(\\\"#\\\")\\n return len(stack) == 1 and stack[0] == \\\"#\\\"\\n \",\n \"memory\": \"16700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":9,"string":"9"}}},{"rowIdx":261,"cells":{"question_id":{"kind":"number","value":332,"string":"332"},"name":{"kind":"string","value":"reconstruct-itinerary"},"content":{"kind":"string","value":"<p>You are given a list of airline <code>tickets</code> where <code>tickets[i] = [from<sub>i</sub>, to<sub>i</sub>]</code> represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.</p>\n\n<p>All of the tickets belong to a man who departs from <code>"JFK"</code>, thus, the itinerary must begin with <code>"JFK"</code>. If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string.</p>\n\n<ul>\n\t<li>For example, the itinerary <code>["JFK", "LGA"]</code> has a smaller lexical order than <code>["JFK", "LGB"]</code>.</li>\n</ul>\n\n<p>You may assume all tickets form at least one valid itinerary. You must use all the tickets once and only once.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/14/itinerary1-graph.jpg\" style=\"width: 382px; height: 222px;\" />\n<pre>\n<strong>Input:</strong> tickets = [["MUC","LHR"],["JFK","MUC"],["SFO","SJC"],["LHR","SFO"]]\n<strong>Output:</strong> ["JFK","MUC","LHR","SFO","SJC"]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/14/itinerary2-graph.jpg\" style=\"width: 222px; height: 230px;\" />\n<pre>\n<strong>Input:</strong> tickets = [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]\n<strong>Output:</strong> ["JFK","ATL","JFK","SFO","ATL","SFO"]\n<strong>Explanation:</strong> Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"] but it is larger in lexical order.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= tickets.length <= 300</code></li>\n\t<li><code>tickets[i].length == 2</code></li>\n\t<li><code>from<sub>i</sub>.length == 3</code></li>\n\t<li><code>to<sub>i</sub>.length == 3</code></li>\n\t<li><code>from<sub>i</sub></code> and <code>to<sub>i</sub></code> consist of uppercase English letters.</li>\n\t<li><code>from<sub>i</sub> != to<sub>i</sub></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":43.29477964883329,"string":"43.29478"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["depth-first-search","graph","eulerian-circuit"],"string":"[\n \"depth-first-search\",\n \"graph\",\n \"eulerian-circuit\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"53\", 0.0213], [\"54\", 0.0213], [\"55\", 0.0851], [\"56\", 0.0851], [\"57\", 0.1276], [\"58\", 0.0851], [\"59\", 0.2126], [\"60\", 0.2977], [\"61\", 0.5741], [\"62\", 0.489], [\"63\", 0.7229], [\"64\", 1.1695], [\"65\", 1.5309], [\"66\", 1.6373], [\"67\", 2.4878], [\"68\", 3.1682], [\"69\", 3.0406], [\"70\", 3.9762], [\"71\", 4.6991], [\"72\", 5.2094], [\"73\", 5.7198], [\"74\", 5.6347], [\"75\", 6.5703], [\"76\", 6.2726], [\"77\", 6.2939], [\"78\", 5.6134], [\"79\", 5.656], [\"80\", 4.6566], [\"81\", 4.5716], [\"82\", 3.2107], [\"83\", 2.5941], [\"84\", 2.6366], [\"85\", 1.7223], [\"86\", 1.4671], [\"87\", 0.9781], [\"88\", 0.7442], [\"89\", 0.3827], [\"90\", 0.5103]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16300\", 0.0213], [\"16500\", 0.0851], [\"16600\", 1.701], [\"16700\", 8.8029], [\"16800\", 24.495], [\"16900\", 28.1097], [\"17000\", 21.3906], [\"17100\", 7.2294]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n graph = defaultdict(list)\n\n for src, dest in sorted(tickets, reverse = True):\n graph[src].append(dest)\n \n itinerary = []\n\n def dfs(node):\n while graph[node]:\n dfs(graph[node].pop())\n itinerary.append(node)\n \n dfs(\"JFK\")\n\n return itinerary[::-1]","runtime":"53"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n from collections import defaultdict\n graph = defaultdict(list)\n for start, end in sorted(tickets, reverse=True):\n graph[start].append(end)\n res = []\n def dfs(airport):\n while graph[airport]:\n next_airport = graph[airport].pop()\n dfs(next_airport)\n res.append(airport)\n dfs(\"JFK\")\n\n return res[::-1]\n ","runtime":"54"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = defaultdict(list)\n for org, dst in tickets:\n heappush(adj[org], dst)\n\n res = []\n\n def dfs(adj, res, node):\n\n while adj[node]:\n nei = heappop(adj[node])\n dfs(adj, res, nei)\n res.append(node)\n \n dfs(adj, res, \"JFK\")\n res.reverse()\n return res","runtime":"55"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n itinerary = []\n graph = defaultdict(deque)\n\n for origin, destination in tickets:\n graph[origin].append(destination)\n\n for origin in graph:\n graph[origin] = deque(sorted(graph[origin]))\n\n def dfs(curr_airport):\n destinations = graph[curr_airport]\n while destinations:\n next_dest = destinations.popleft()\n dfs(next_dest)\n itinerary.append(curr_airport)\n\n dfs(\"JFK\")\n return itinerary[::-1]","runtime":"56"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n flight_map = collections.defaultdict(list)\n result = []\n\n # Populate the flight map with each departure and arrival\n for departure, arrival in tickets:\n flight_map[departure].append(arrival)\n\n # Sort each list of destinations in reverse lexicographical order\n for departure in flight_map:\n flight_map[departure].sort(reverse=True)\n\n # Perform DFS traversal\n def dfsTraversal(current):\n destinations = flight_map[current]\n \n # Traverse all destinations in the order of their lexicographical\n # sorting\n while destinations:\n next_destination = destinations.pop()\n dfsTraversal(next_destination)\n\n # Append the current airport to the result after all destinations\n # are visited\n result.append(current)\n \n\n dfsTraversal(\"JFK\")\n return result[::-1]","runtime":"57"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n \n tickets = sorted(tickets,reverse=True)\n graph = defaultdict(list)\n for frm, to in tickets:\n graph[frm].append(to)\n \n itineary = []\n def dfs(airport, itineary):\n while graph[airport]:\n dfs(graph[airport].pop(), itineary)\n itineary.append(airport)\n return itineary\n\n return dfs(\"JFK\",[])[::-1]\n","runtime":"58"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n m = {}\n for t,f in tickets:\n if t not in m:\n m[t] = []\n if f not in m:\n m[f] = []\n m[t].append(f)\n for a in m:\n m[a].sort(reverse = True)\n ans = []\n def dfs(a):\n while m[a]:\n dfs(m[a].pop())\n ans.append(a)\n dfs(\"JFK\")\n ans.reverse()\n return ans\n ","runtime":"59"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n \n self.res = []\n self.dfs(\"JFK\")\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n","runtime":"60"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = collections.defaultdict(list)\n\n for s, d in tickets:\n self.graph[s].append(d)\n\n for s, d in self.graph.items():\n d.sort(reverse=True)\n\n self.ans = []\n self.dfs(\"JFK\")\n return self.ans[::-1]\n\n def dfs(self, node):\n while self.graph[node]:\n next_des = self.graph[node].pop()\n self.dfs(next_des)\n self.ans.append(node)\n","runtime":"61"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res\n","runtime":"62"},{"code":"from collections import defaultdict\n\nclass Solution:\n def findItinerary(self, tickets):\n targets = defaultdict(list) # 创建默认字典，用于存储机场映射关系\n for [depart, arrive] in tickets:\n targets[depart].append(arrive) # 将机票输入到字典中\n \n for depart in targets:\n targets[depart].sort(reverse=True) # 对到达机场列表进行字母逆序排序\n\n result = []\n self.backtracking(\"JFK\", targets, result) # 调用回溯函数开始搜索路径\n return result[::-1] # 返回逆序的行程路径\n \n def backtracking(self, airport, targets, result):\n while targets[airport]: # 当机场还有可到达的机场时\n next_airport = targets[airport].pop() # 弹出下一个机场\n self.backtracking(next_airport, targets, result) # 递归调用回溯函数进行深度优先搜索\n result.append(airport) # 将当前机场添加到行程路径中\n ","runtime":"63"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = defaultdict(list)\n res = []\n for src, des in tickets:\n adj[src].append(des)\n for key in adj:\n adj[key].sort(reverse=True)\n def dfs(src):\n if src in adj:\n while adj[src]:\n dfs(adj[src].pop())\n res.append(src)\n dfs('JFK')\n\n return res[::-1]","runtime":"64"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adjlist = defaultdict(list)\n for a, b in tickets:\n adjlist[a].append(b)\n # Sort in reverese for lexical ordering convert to deque\n for arpt in adjlist:\n adjlist[arpt].sort(reverse=True)\n topo_sorted = []\n def dfs(arpt):\n if arpt in adjlist:\n dests = adjlist[arpt]\n # All paths start at JFK, so basically pop from dests,\n # and keep traversing DFS\n while dests:\n dest = dests.pop()\n dfs(dest)\n topo_sorted.append(arpt)\n dfs(\"JFK\")\n return reversed(topo_sorted)","runtime":"64"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n \n self.res = []\n self.dfs(\"JFK\")\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","runtime":"65"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n # because a path exists, we are basically trying to find the \"end\" node. From there we do like a postorder traversal. If you can get to the end node that means the current \"path\" is correct\n m = {}\n # largest first bc eventually we reverse the final list so want to do biggest first (aka last)\n tickets.sort(reverse=True)\n for ticket in tickets:\n origin, dest = ticket[0], ticket[1]\n if origin not in m:\n m[origin] = []\n m[origin].append(dest)\n\n res = []\n self.dfs(\"JFK\", m, res)\n\n return res[::-1]\n\n \n def dfs(self, origin, m, res):\n if origin not in m:\n res.append(origin)\n return\n\n destinations = m[origin]\n while destinations:\n dest = destinations.pop()\n self.dfs(dest, m, res)\n res.append(origin)","runtime":"66"},{"code":"from collections import defaultdict\nfrom typing import List\n\nclass Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n # Create the adjacency list (maps)\n maps = defaultdict(list)\n \n # Construct the adjacency list\n for start, end in tickets:\n maps[start].append(end)\n \n for start in maps :\n maps[start].sort(reverse = True)\n \n stack = [\"JFK\"]\n res = []\n while stack :\n el = stack[-1]\n if el in maps and len(maps[el]) > 0 :\n stack.append(maps[el].pop())\n\n else :\n res.append(stack.pop())\n return res[::-1]\n\n","runtime":"67"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj_list = defaultdict(list)\n for origin,dest in tickets:\n adj_list[origin].append(dest)\n \n for k,v in adj_list.items():\n adj_list[k] = sorted(v, reverse=True)\n\n res = []\n \n def dfs(city):\n nonlocal res\n while adj_list[city]:\n val = adj_list[city].pop()\n dfs(val)\n res.append(city)\n \n dfs('JFK')\n return res[::-1]","runtime":"67"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res\n\n \n\n\n ","runtime":"68"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res\n","runtime":"68"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n for u,v in graph.items():\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","runtime":"69"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res\n\n ","runtime":"69"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res\n","runtime":"70"},{"code":"class Solution:\n def findItinerary(self, t: List[List[str]]) -> List[str]:\n g = {}\n for f,_t in t:\n if f not in g:\n g[f] = [_t]\n else:\n g[f].append(_t)\n for _,v in g.items():\n v.sort(reverse=True)\n def fp(frm):\n path = []\n q = [frm]\n while q:\n n = q.pop()\n path.append(n)\n if n in g:\n if g[n]:\n m = g[n].pop()\n q.append(m)\n if not g[n]:\n del g[n]\n else:\n del g[n]\n return path\n p = fp(\"JFK\")\n while g:\n for i in range(len(p)-1,-1,-1):\n if p[i] in g:\n p = p[:i]+fp(p[i])[:-1]+p[i:]\n break\n return p \n \n ","runtime":"70"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n graph = collections.defaultdict(list)\n result = []\n\n # Sort the tickets in reverse lexicographical order\n # enables graph lists to also be sorted in reverse\n tickets.sort(reverse=True)\n\n # Populate the flight map with each source and destination\n for src, dst in tickets:\n graph[src].append(dst)\n\n # Perform DFS traversal\n def dfs(curr):\n destinations = graph[curr]\n\n # Traverse all destinations in the order of their lexicographical\n # sorting\n while destinations:\n next_destination = destinations.pop()\n dfs(next_destination)\n\n # Append the current airport to the result after all destinations\n # are visited\n result.append(curr)\n\n dfs(\"JFK\")\n return result[::-1]","runtime":"71"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res","runtime":"71"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n tickets.sort(reverse=True)\n adj = defaultdict(list)\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n res = []\n def dfs(src):\n while adj[src]:\n dfs(adj[src].pop())\n res.append(src)\n\n dfs(\"JFK\")\n\n return res[::-1]","runtime":"72"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n graph = {}\n for edge in tickets:\n start, end = edge\n if start not in graph:\n graph[start] = []\n graph[start].append(end)\n for start in graph:\n graph[start].sort(reverse = True)\n\n result = []\n def dfsTraversal(current):\n if current not in graph:\n result.append(current)\n return\n des = graph[current]\n while des:\n nextdes = des.pop()\n dfsTraversal(nextdes)\n result.append(current)\n dfsTraversal(\"JFK\")\n return result[::-1]","runtime":"72"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n \n self.res = []\n self.dfs(\"JFK\")\n print(src_dst)\n print(False)\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","runtime":"74"},{"code":"class Solution:\n def findItinerary(self, t: List[List[str]]) -> List[str]:\n g = { f: [] for f,_ in t }\n for f,_t in t:\n g[f].append(_t)\n for _,v in g.items():\n v.sort(reverse=True)\n def fp(frm):\n path = []\n q = [frm]\n while q:\n n = q.pop()\n path.append(n)\n if n in g:\n if len(g[n])>0:\n m = g[n].pop()\n q.append(m)\n if not g[n]:\n del g[n]\n else:\n del g[n]\n return path\n p = fp(\"JFK\")\n while g:\n for i in range(len(p)-1,-1,-1):\n if p[i] in g:\n p = p[:i]+fp(p[i])[:-1]+p[i:]\n break\n return p \n \n ","runtime":"74"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n for u,v in graph.items():\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","runtime":"75"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = defaultdict(list)\n for src, dst in sorted(tickets, reverse=True):\n adj[src].append(dst)\n \n stack = [\"JFK\"]\n res = []\n\n while stack:\n airport = stack[-1]\n if adj[airport]:\n # get the smallest lexographical airport and add it to the stack\n stack.append(adj[airport].pop())\n else:\n # if we the final airport then we can start appending to the stack\n res.append(stack.pop())\n return res[::-1]","runtime":"75"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(airport: str) -> None:\n if airport not in adj_list:\n itinerary.append(airport)\n return\n \n while adj_list[airport]:\n arrival = adj_list[airport].pop()\n dfs(arrival)\n\n itinerary.append(airport)\n\n if not tickets:\n return [] \n \n adj_list, itinerary = {}, []\n\n for departure, arrival in tickets:\n if departure in adj_list:\n adj_list[departure].append(arrival)\n else:\n adj_list[departure] = [arrival]\n \n for arrivals in adj_list.values():\n arrivals.sort()\n arrivals.reverse()\n \n dfs(\"JFK\")\n\n return itinerary[::-1]","runtime":"76"},{"code":"import collections\n\n\nclass Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n graph = collections.defaultdict(list)\n\n for src, dest in tickets:\n graph[src].append(dest)\n\n for src in graph:\n graph[src].sort(reverse=True)\n\n itinery = []\n\n def dfs(src):\n while graph[src]:\n # Recursively explore the lexicographically smallest destination first\n dfs(graph[src].pop())\n\n # Add current airport to itinerary after exploring all its destinations\n itinery.append(src)\n\n dfs(\"JFK\")\n\n return itinery[::-1]\n","runtime":"76"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = defaultdict(list)\n res = []\n for src, des in tickets:\n adj[src].append(des)\n for key in adj:\n adj[key].sort()\n def dfs(src):\n if src in adj:\n dests = adj[src]\n while dests:\n dest = dests[0]\n dests.pop(0)\n dfs(dest)\n res.append(src)\n dfs('JFK')\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res","runtime":"77"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adjacencylist = {}\n\n for i in tickets:\n adjacencylist[i[0]] = adjacencylist.get(i[0], []) + [i[1]]\n \n for i in adjacencylist.keys():\n adjacencylist[i].sort()\n adjacencylist[i] = adjacencylist[i][::-1]\n \n found = []\n def dfs(current):\n while current in adjacencylist and len(adjacencylist[current]) > 0:\n dfs(adjacencylist[current].pop())\n found.append(current)\n\n dfs(\"JFK\")\n return found[::-1]\n\n ","runtime":"77"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n graph = defaultdict(list)\n \n for from_city, to_city in tickets:\n graph[from_city].append(to_city)\n \n for city in graph:\n graph[city].sort()\n \n itenerary = []\n \n def dfs(city):\n while graph[city]:\n next_city = graph[city].pop(0)\n dfs(next_city)\n itenerary.append(city)\n \n dfs(\"JFK\")\n return itenerary[::-1]","runtime":"78"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n \n self.res = []\n self.dfs(\"JFK\")\n print(src_dst)\n 1 == 2\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","runtime":"78"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n for u,v in graph.items():\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","runtime":"79"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adjlist = defaultdict(list)\n arpts = set()\n for a, b in tickets:\n arpts.add(a)\n arpts.add(b)\n adjlist[a].append(b)\n # Sort for lexical ordering\n for arpt in adjlist:\n adjlist[arpt].sort()\n\n arpts = sorted(list(arpts))\n topo_sorted = []\n def dfs(arpt):\n if arpt in adjlist:\n dests = adjlist[arpt][:]\n while dests:\n dest = dests[0]\n adjlist[arpt].pop(0)\n dfs(dest)\n dests = adjlist[arpt][:]\n topo_sorted.append(arpt)\n \n dfs(\"JFK\")\n return reversed(topo_sorted)","runtime":"79"},{"code":"from collections import defaultdict\nfrom typing import List\n\n\nclass Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n tickets.sort()\n adj_list = defaultdict(list)\n for src, dest in tickets:\n adj_list[src].append(dest)\n\n print(adj_list)\n\n stack = [\"JFK\"]\n # while stack:\n\n res = []\n\n while stack:\n while adj_list[stack[-1]]:\n stack.append(adj_list[stack[-1]].pop(0))\n\n res.append(stack.pop())\n\n print(res)\n\n # helper(\"JFK\")\n return res[::-1]","runtime":"80"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n tickets.sort(reverse = True)\n adj = defaultdict(list)\n for a, b in tickets:\n adj[a].append(b)\n \n ret = []\n def dfs(n):\n while adj[n]:\n dfs(adj[n].pop())\n ret.append(n)\n \n dfs('JFK')\n return ret[::-1]","runtime":"80"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n print(src_dst)\n self.res = []\n self.dfs(\"JFK\")\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","runtime":"81"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src_dst in self.graph.values():\n src_dst.sort(reverse=True) # sort destinations by *decreasing* lexical order\n \n self.res = []\n self.dfs(\"JFK\")\n return self.res[::-1]\n \n def dfs(self, src):\n # destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","runtime":"81"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n flight_map = collections.defaultdict(list)\n result = []\n\n # Populate the flight map with each departure and arrival\n for departure, arrival in tickets:\n flight_map[departure].append(arrival)\n\n # Sort each list of destinations in reverse lexicographical order\n for departure in flight_map:\n flight_map[departure].sort(reverse=True)\n\n # Perform DFS traversal\n def dfsTraversal(current):\n destinations = flight_map[current]\n\n # Traverse all destinations in the order of their lexicographical\n # sorting\n while destinations:\n next_destination = destinations.pop()\n dfsTraversal(next_destination)\n\n # Append the current airport to the result after all destinations\n # are visited\n result.append(current)\n\n dfsTraversal(\"JFK\")\n return result[::-1]","runtime":"82"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n from collections import defaultdict\n p_to_p = defaultdict(list)\n \n for a, b in tickets:\n p_to_p[a].append(b)\n \n for node in p_to_p:\n p_to_p[node].sort(reverse=True)\n res=[]\n queue=['JFK']\n while queue:\n node = queue[-1]\n \n if node in p_to_p and p_to_p[node]:\n queue.append(p_to_p[node].pop())\n else:\n res.append(queue.pop())\n return res[::-1]\n\n\n \n ","runtime":"82"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n # this question is not your easy DFS question. in here, there's a concept\n # called eulerian circuit/cycle which states that the trail starts and \n # ends on the same vertex. the algo consists of 2 steps:\n # 1. Starting from any vertex, we keep following the unused edges until \n # we get stuck at certain vertex where we have no more unvisited outgoing edges.\n # 2. We then backtrack to the nearest neighbor vertex in the current path that \n # has unused edges and we repeat the process until all the edges have been used.\n # The first vertex that we got stuck at would be the end point of our Eulerian \n # path. So if we follow all the stuck points backwards, we could reconstruct \n # the Eulerian path at the end.\n\n # since, we need return the itinerary that has the smallest lexical order, we have\n # to sort the tickets list so that it would be easy to form the sorted nature in\n # dfs calls, after processing each node, we pop it from the adjList since we can\n # use each ticket only once and call dfs for the nextNode. Save the curr node in the result.\n # [TC: O((V+E)LogN) SC: O(V+E)]\n if not tickets:\n return []\n tickets.sort()\n adjList = defaultdict(list)\n for a, b in tickets:\n adjList[a].append(b)\n result = []\n visited = set()\n def dfs(node):\n for i, nextNode in enumerate(adjList[node]):\n # node -> curr airport, i -> index of destination\n if (node, i) not in visited:\n visited.add((node, i))\n dfs(nextNode)\n result.append(node) \n\n # def dfs(node):\n # while adjList[node]:\n # nextNode = adjList[node].pop(0)\n # dfs(nextNode)\n # result.append(node)\n\n dfs(\"JFK\")\n return result[::-1]","runtime":"83"},{"code":"class Solution:\n\n def findItinerary_not_efficient(self, tickets: List[List[str]]) -> List[str]:\n\n self.graph = {}\n self.visited = {}\n self.res = []\n\n for departure, arrival in tickets:\n curr = self.graph.get(departure)\n if not curr:\n self.graph[departure] = [arrival]\n else:\n curr.append(arrival)\n\n for key, value in self.graph.items():\n value.sort()\n self.visited[key] = [False]*len(value)\n\n path_length = len(tickets) + 1\n \n def backtrak(curr_node, curr_path):\n\n is_any_flight_left = path_length > len(curr_path)\n\n if not is_any_flight_left:\n self.res = list(curr_path)\n return\n elif not self.graph.get(curr_node):\n return\n\n neighbors = self.graph[curr_node]\n for i, nb in enumerate(neighbors):\n if not self.visited[curr_node][i]:\n curr_path.append(nb)\n self.visited[curr_node][i] = True\n backtrak(nb, curr_path)\n if self.res:\n return\n self.visited[curr_node][i] = False\n curr_path.pop()\n\n backtrak('JFK', ['JFK'])\n\n return self.res\n\n\n def findItinerary(self, tickets):\n\n from collections import defaultdict\n self.flightMap = defaultdict(list)\n\n for ticket in tickets:\n origin, dest = ticket[0], ticket[1]\n self.flightMap[origin].append(dest)\n\n # sort the itinerary based on the lexical order\n for origin, itinerary in self.flightMap.items():\n # Note that we could have multiple identical flights, i.e. same origin and destination.\n itinerary.sort(reverse=True)\n\n self.result = []\n self.DFS('JFK')\n\n # reconstruct the route backwards\n return self.result[::-1]\n\n def DFS(self, origin):\n destList = self.flightMap[origin]\n while destList:\n #while we visit the edge, we trim it off from graph.\n nextDest = destList.pop()\n self.DFS(nextDest)\n self.result.append(origin)","runtime":"83"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adjlist = defaultdict(list)\n for a, b in tickets:\n adjlist[a].append(b)\n # Sort for lexical ordering\n for arpt in adjlist:\n adjlist[arpt].sort()\n topo_sorted = []\n def dfs(arpt):\n if arpt in adjlist:\n dests = adjlist[arpt][:]\n while dests:\n dest = dests[0]\n adjlist[arpt].pop(0)\n dfs(dest)\n dests = adjlist[arpt][:]\n topo_sorted.append(arpt)\n \n dfs(\"JFK\")\n return reversed(topo_sorted)","runtime":"84"},{"code":"class Solution:\n def traverse(self, departure):\n for arrival in self.routes[departure]:\n route = (departure, arrival)\n if self.counts[route]:\n self.itinerary.append(arrival)\n self.counts[route] -= 1\n self.traverse(arrival)\n self.itinerary.pop()\n self.counts[route] += 1\n if len(self.itinerary) == self.n:\n raise Exception(\"Itenary found\")\n\n def findItinerary(self, tickets):\n self.routes = defaultdict(list)\n self.counts = defaultdict(int)\n self.n = len(tickets) + 1\n self.itinerary = ['JFK']\n for departure, arrival in tickets:\n if arrival not in self.routes[departure]:\n bisect.insort(self.routes[departure], arrival)\n self.counts[(departure, arrival)] += 1\n try:\n self.traverse('JFK')\n except:\n return self.itinerary","runtime":"84"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n # this question is not your easy DFS question. in here, there's a concept\n # called eulerian circuit/cycle which states that the trail starts and \n # ends on the same vertex. the algo consists of 2 steps:\n # 1. Starting from any vertex, we keep following the unused edges until \n # we get stuck at certain vertex where we have no more unvisited outgoing edges.\n # 2. We then backtrack to the nearest neighbor vertex in the current path that \n # has unused edges and we repeat the process until all the edges have been used.\n # The first vertex that we got stuck at would be the end point of our Eulerian \n # path. So if we follow all the stuck points backwards, we could reconstruct \n # the Eulerian path at the end.\n\n # approach 1:\n # since, we need return the itinerary that has the smallest lexical order, we have\n # to sort the tickets list so that it would be easy to form the sorted nature in\n # dfs calls, after processing each node, we pop it from the adjList since we can\n # use each ticket only once and call dfs for the nextNode. Save the curr node in the result.\n # [TC: O((V+E)LogN) SC: O(V+E)]\n\n # approach 2:\n # Tracking individual edges ensures that even if there are multiple flights between the same two\n # airports, you can distinguish them and ensure you only use each flight once. By marking each \n # edge as visited (with visited.add((node, i)) where i is the index of the flight), you guarantee\n # that you don't reuse the same flight (edge) multiple times.\n if not tickets:\n return []\n tickets.sort()\n adjList = defaultdict(list)\n for a, b in tickets:\n adjList[a].append(b)\n result = []\n visited = set()\n # in this approach, we have to maintain the order of visiting neighbors without modifying adjList\n def dfs(node):\n # i -> index of curr destination, nextNode -> actual destination airport in adjList[node]\n # for eg: if adjList[\"JFK\"] looks like [\"ATL\", \"SFO\"], then enumerate will return \n # i = 0, nextNode = \"ATL\" and i = 1, nextNode = \"SFO\"\n # In the code, the index i is used to uniquely identify each flight (or edge) coming from node. \n # This allows us to track which specific flight (edge) has been visited using the combination \n # (node, i) in the visited set. This way, if there are multiple flights to the same destination, \n # we can differentiate between them and track which flight has been used.\n for i, nextNode in enumerate(adjList[node]):\n # node -> curr airport, i -> index of destination\n # suppose, tickets = [[\"JFK\", \"SFO\"], [\"JFK\", \"SFO\"], [\"SFO\", \"JFK\"]]\n # here are 2 flights b/w JFK and SFO. if we were only tracking nodes, we'd visit SFO only once\n # and potentially miss one of the flights. with edge tracking (node, i), The first time you \n # visit \"SFO\" via \"JFK\", you mark flight (\"JFK\", 0) as visited. The second time you visit \"SFO\" \n # via \"JFK\", you mark flight (\"JFK\", 1) as visited.\n if (node, i) not in visited:\n visited.add((node, i))\n dfs(nextNode)\n result.append(node)\n\n # def dfs(node):\n # while adjList[node]:\n # nextNode = adjList[node].pop(0)\n # dfs(nextNode)\n # result.append(node)\n\n dfs(\"JFK\")\n return result[::-1]","runtime":"85"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","runtime":"85"},{"code":"import heapq\n\nclass Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = defaultdict(list)\n \n # Build the adjacency list with a min-heap for each source\n for i, j in tickets:\n heapq.heappush(adj[i], j)\n \n res = []\n \n def dfs(src):\n # While there are outgoing flights from src\n while adj[src]:\n # Always take the smallest lexical flight (min-heap ensures this)\n next_dest = heapq.heappop(adj[src])\n dfs(next_dest)\n res.append(src)\n \n # Start DFS from 'JFK'\n dfs('JFK')\n \n # The result will be in reverse order, so reverse it\n return res[::-1]\n\n # adj = defaultdict(list)\n # tickets.sort()\n # for i,j in tickets:\n # adj[i].append(j)\n \n # res= ['JFK']\n # def dfs(src):\n # if len(res) == len(tickets) + 1:\n # return True\n # if src not in adj:\n # return False\n # temp = adj[src]\n # for i,edg in enumerate(temp):\n # #action\n # adj[src].pop(i)\n # res.append(edg)\n # #recurse\n # if dfs(edg):\n # return True\n \n # #backtrack\n # adj[src].insert(i,edg)\n # res.pop()\n # return False\n \n # dfs('JFK')\n # return res \n","runtime":"86"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]: \n # Step 1: Map each airport to an index for the adjacency matrix\n airports = sorted(set([start for start, end in tickets] + [end for start, end in tickets]))\n airport_to_idx = {airport: idx for idx, airport in enumerate(airports)}\n idx_to_airport = {idx: airport for airport, idx in airport_to_idx.items()}\n \n # Step 2: Create an adjacency matrix\n n = len(airports)\n matrix = [[0] * n for _ in range(n)] # n x n matrix\n \n # Populate the matrix with the ticket counts\n for start, end in tickets:\n matrix[airport_to_idx[start]][airport_to_idx[end]] += 1\n \n # Step 3: Find the source and destination airports using the matrix and its transpose\n out_degrees = [sum(row) for row in matrix] # Outgoing edges per airport\n in_degrees = [sum(row[i] for row in matrix) for i in range(n)] # Incoming edges per airport\n \n start_airport = None\n end_airport = None\n \n for i in range(n):\n if out_degrees[i] > in_degrees[i]:\n start_airport = i # This airport has more outgoing edges than incoming\n if in_degrees[i] > out_degrees[i]:\n end_airport = i # This airport has more incoming edges than outgoing\n \n # If no imbalanced airport is found, use the lexicographically smallest airport (JFK or smallest)\n if start_airport is None:\n start_airport = airport_to_idx[\"JFK\"] if \"JFK\" in airport_to_idx else 0\n \n itinerary = []\n \n # Step 4: Perform DFS to find the itinerary\n def dfs(airport_idx):\n for i in range(n):\n while matrix[airport_idx][i] > 0: # While there are tickets left from airport_idx to i\n matrix[airport_idx][i] -= 1\n dfs(i)\n itinerary.append(idx_to_airport[airport_idx]) # Add the airport to the itinerary\n \n # Step 5: Start DFS from the dynamically determined start airport\n dfs(start_airport)\n \n # Step 6: Return the itinerary in reverse order\n return itinerary[::-1]\n","runtime":"86"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adjlist = defaultdict(list)\n for a, b in tickets:\n adjlist[a].append(b)\n # Sort in reverese for lexical ordering convert to deque\n for arpt in adjlist:\n adjlist[arpt].sort(reverse=True)\n topo_sorted = []\n def dfs(arpt):\n if arpt in adjlist:\n dests = adjlist[arpt]\n while dests:\n dest = dests.pop()\n dfs(dest)\n topo_sorted.append(arpt)\n \n dfs(\"JFK\")\n return reversed(topo_sorted)","runtime":"87"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","runtime":"88"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n from collections import defaultdict\n g = defaultdict(list)\n outdegree = defaultdict(int)\n for f, to in tickets:\n g[f].append(to)\n outdegree[f] += 1\n\n for key, val in g.items():\n g[key].sort()\n\n seen = set()\n\n def dfs(node, path):\n for i, child in enumerate(g[node]):\n status = (node, child, i)\n if status not in seen:\n seen.add(status)\n outdegree[node] -= 1\n dfs(child, path)\n\n if outdegree[node] == 0:\n path.append(node)\n return path\n\n res = dfs(\"JFK\", [])\n #print(res)\n return res[::-1]\n\n \n\n ","runtime":"89"},{"code":"# neet150, 2/12/2024\nclass Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n # adj_list \n adj_list = defaultdict(lambda: defaultdict(int)) \n for u, v in tickets:\n adj_list[u][v] += 1 # you need to do this cuz there will be duplicated tickets\n \n # print(adj_list)\n def dfs(start, cur_path): # used one will get removed \n nonlocal itineary\n if itineary: return\n if len(cur_path) == len(tickets)+1: # used all \n itineary = cur_path[:] \n return \n \n for dest in sorted(adj_list[start]): # for lexcographid soritng \n adj_list[start][dest] -= 1\n if adj_list[start][dest] == 0: adj_list[start].pop(dest) # pop the key if 0\n cur_path.append(dest)\n\n dfs(dest, cur_path)\n if itineary: return # first one out\n\n # backtracking\n cur_path.pop()\n adj_list[start][dest] += 1\n\n\n itineary = []\n dfs(\"JFK\", [\"JFK\"])\n return itineary\n\n # time: O(n^n), but probablty converge faster, n is maximum flight from any airport\n # space: O(n) for the adjust list","runtime":"90"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n graph = defaultdict(list)\\n\\n for src, dest in sorted(tickets, reverse = True):\\n graph[src].append(dest)\\n \\n itinerary = []\\n\\n def dfs(node):\\n while graph[node]:\\n dfs(graph[node].pop())\\n itinerary.append(node)\\n \\n dfs(\\\"JFK\\\")\\n\\n return itinerary[::-1]\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n from collections import defaultdict\\n graph = defaultdict(list)\\n for start, end in sorted(tickets, reverse=True):\\n graph[start].append(end)\\n res = []\\n def dfs(airport):\\n while graph[airport]:\\n next_airport = graph[airport].pop()\\n dfs(next_airport)\\n res.append(airport)\\n dfs(\\\"JFK\\\")\\n\\n return res[::-1]\\n \",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = defaultdict(list)\\n for org, dst in tickets:\\n heappush(adj[org], dst)\\n\\n res = []\\n\\n def dfs(adj, res, node):\\n\\n while adj[node]:\\n nei = heappop(adj[node])\\n dfs(adj, res, nei)\\n res.append(node)\\n \\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n return res\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n itinerary = []\\n graph = defaultdict(deque)\\n\\n for origin, destination in tickets:\\n graph[origin].append(destination)\\n\\n for origin in graph:\\n graph[origin] = deque(sorted(graph[origin]))\\n\\n def dfs(curr_airport):\\n destinations = graph[curr_airport]\\n while destinations:\\n next_dest = destinations.popleft()\\n dfs(next_dest)\\n itinerary.append(curr_airport)\\n\\n dfs(\\\"JFK\\\")\\n return itinerary[::-1]\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n flight_map = collections.defaultdict(list)\\n result = []\\n\\n # Populate the flight map with each departure and arrival\\n for departure, arrival in tickets:\\n flight_map[departure].append(arrival)\\n\\n # Sort each list of destinations in reverse lexicographical order\\n for departure in flight_map:\\n flight_map[departure].sort(reverse=True)\\n\\n # Perform DFS traversal\\n def dfsTraversal(current):\\n destinations = flight_map[current]\\n \\n # Traverse all destinations in the order of their lexicographical\\n # sorting\\n while destinations:\\n next_destination = destinations.pop()\\n dfsTraversal(next_destination)\\n\\n # Append the current airport to the result after all destinations\\n # are visited\\n result.append(current)\\n \\n\\n dfsTraversal(\\\"JFK\\\")\\n return result[::-1]\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n \\n tickets = sorted(tickets,reverse=True)\\n graph = defaultdict(list)\\n for frm, to in tickets:\\n graph[frm].append(to)\\n \\n itineary = []\\n def dfs(airport, itineary):\\n while graph[airport]:\\n dfs(graph[airport].pop(), itineary)\\n itineary.append(airport)\\n return itineary\\n\\n return dfs(\\\"JFK\\\",[])[::-1]\\n\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n m = {}\\n for t,f in tickets:\\n if t not in m:\\n m[t] = []\\n if f not in m:\\n m[f] = []\\n m[t].append(f)\\n for a in m:\\n m[a].sort(reverse = True)\\n ans = []\\n def dfs(a):\\n while m[a]:\\n dfs(m[a].pop())\\n ans.append(a)\\n dfs(\\\"JFK\\\")\\n ans.reverse()\\n return ans\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n \\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = collections.defaultdict(list)\\n\\n for s, d in tickets:\\n self.graph[s].append(d)\\n\\n for s, d in self.graph.items():\\n d.sort(reverse=True)\\n\\n self.ans = []\\n self.dfs(\\\"JFK\\\")\\n return self.ans[::-1]\\n\\n def dfs(self, node):\\n while self.graph[node]:\\n next_des = self.graph[node].pop()\\n self.dfs(next_des)\\n self.ans.append(node)\\n\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\\n\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def findItinerary(self, tickets):\\n targets = defaultdict(list) # 创建默认字典，用于存储机场映射关系\\n for [depart, arrive] in tickets:\\n targets[depart].append(arrive) # 将机票输入到字典中\\n \\n for depart in targets:\\n targets[depart].sort(reverse=True) # 对到达机场列表进行字母逆序排序\\n\\n result = []\\n self.backtracking(\\\"JFK\\\", targets, result) # 调用回溯函数开始搜索路径\\n return result[::-1] # 返回逆序的行程路径\\n \\n def backtracking(self, airport, targets, result):\\n while targets[airport]: # 当机场还有可到达的机场时\\n next_airport = targets[airport].pop() # 弹出下一个机场\\n self.backtracking(next_airport, targets, result) # 递归调用回溯函数进行深度优先搜索\\n result.append(airport) # 将当前机场添加到行程路径中\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = defaultdict(list)\\n res = []\\n for src, des in tickets:\\n adj[src].append(des)\\n for key in adj:\\n adj[key].sort(reverse=True)\\n def dfs(src):\\n if src in adj:\\n while adj[src]:\\n dfs(adj[src].pop())\\n res.append(src)\\n dfs('JFK')\\n\\n return res[::-1]\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adjlist = defaultdict(list)\\n for a, b in tickets:\\n adjlist[a].append(b)\\n # Sort in reverese for lexical ordering convert to deque\\n for arpt in adjlist:\\n adjlist[arpt].sort(reverse=True)\\n topo_sorted = []\\n def dfs(arpt):\\n if arpt in adjlist:\\n dests = adjlist[arpt]\\n # All paths start at JFK, so basically pop from dests,\\n # and keep traversing DFS\\n while dests:\\n dest = dests.pop()\\n dfs(dest)\\n topo_sorted.append(arpt)\\n dfs(\\\"JFK\\\")\\n return reversed(topo_sorted)\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n \\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n # because a path exists, we are basically trying to find the \\\"end\\\" node. From there we do like a postorder traversal. If you can get to the end node that means the current \\\"path\\\" is correct\\n m = {}\\n # largest first bc eventually we reverse the final list so want to do biggest first (aka last)\\n tickets.sort(reverse=True)\\n for ticket in tickets:\\n origin, dest = ticket[0], ticket[1]\\n if origin not in m:\\n m[origin] = []\\n m[origin].append(dest)\\n\\n res = []\\n self.dfs(\\\"JFK\\\", m, res)\\n\\n return res[::-1]\\n\\n \\n def dfs(self, origin, m, res):\\n if origin not in m:\\n res.append(origin)\\n return\\n\\n destinations = m[origin]\\n while destinations:\\n dest = destinations.pop()\\n self.dfs(dest, m, res)\\n res.append(origin)\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom typing import List\\n\\nclass Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n # Create the adjacency list (maps)\\n maps = defaultdict(list)\\n \\n # Construct the adjacency list\\n for start, end in tickets:\\n maps[start].append(end)\\n \\n for start in maps :\\n maps[start].sort(reverse = True)\\n \\n stack = [\\\"JFK\\\"]\\n res = []\\n while stack :\\n el = stack[-1]\\n if el in maps and len(maps[el]) > 0 :\\n stack.append(maps[el].pop())\\n\\n else :\\n res.append(stack.pop())\\n return res[::-1]\\n\\n\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj_list = defaultdict(list)\\n for origin,dest in tickets:\\n adj_list[origin].append(dest)\\n \\n for k,v in adj_list.items():\\n adj_list[k] = sorted(v, reverse=True)\\n\\n res = []\\n \\n def dfs(city):\\n nonlocal res\\n while adj_list[city]:\\n val = adj_list[city].pop()\\n dfs(val)\\n res.append(city)\\n \\n dfs('JFK')\\n return res[::-1]\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\\n\\n \\n\\n\\n \",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\\n\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n for u,v in graph.items():\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\\n\\n \",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, t: List[List[str]]) -> List[str]:\\n g = {}\\n for f,_t in t:\\n if f not in g:\\n g[f] = [_t]\\n else:\\n g[f].append(_t)\\n for _,v in g.items():\\n v.sort(reverse=True)\\n def fp(frm):\\n path = []\\n q = [frm]\\n while q:\\n n = q.pop()\\n path.append(n)\\n if n in g:\\n if g[n]:\\n m = g[n].pop()\\n q.append(m)\\n if not g[n]:\\n del g[n]\\n else:\\n del g[n]\\n return path\\n p = fp(\\\"JFK\\\")\\n while g:\\n for i in range(len(p)-1,-1,-1):\\n if p[i] in g:\\n p = p[:i]+fp(p[i])[:-1]+p[i:]\\n break\\n return p \\n \\n \",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n graph = collections.defaultdict(list)\\n result = []\\n\\n # Sort the tickets in reverse lexicographical order\\n # enables graph lists to also be sorted in reverse\\n tickets.sort(reverse=True)\\n\\n # Populate the flight map with each source and destination\\n for src, dst in tickets:\\n graph[src].append(dst)\\n\\n # Perform DFS traversal\\n def dfs(curr):\\n destinations = graph[curr]\\n\\n # Traverse all destinations in the order of their lexicographical\\n # sorting\\n while destinations:\\n next_destination = destinations.pop()\\n dfs(next_destination)\\n\\n # Append the current airport to the result after all destinations\\n # are visited\\n result.append(curr)\\n\\n dfs(\\\"JFK\\\")\\n return result[::-1]\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n tickets.sort(reverse=True)\\n adj = defaultdict(list)\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n res = []\\n def dfs(src):\\n while adj[src]:\\n dfs(adj[src].pop())\\n res.append(src)\\n\\n dfs(\\\"JFK\\\")\\n\\n return res[::-1]\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n graph = {}\\n for edge in tickets:\\n start, end = edge\\n if start not in graph:\\n graph[start] = []\\n graph[start].append(end)\\n for start in graph:\\n graph[start].sort(reverse = True)\\n\\n result = []\\n def dfsTraversal(current):\\n if current not in graph:\\n result.append(current)\\n return\\n des = graph[current]\\n while des:\\n nextdes = des.pop()\\n dfsTraversal(nextdes)\\n result.append(current)\\n dfsTraversal(\\\"JFK\\\")\\n return result[::-1]\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n \\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n print(src_dst)\\n print(False)\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, t: List[List[str]]) -> List[str]:\\n g = { f: [] for f,_ in t }\\n for f,_t in t:\\n g[f].append(_t)\\n for _,v in g.items():\\n v.sort(reverse=True)\\n def fp(frm):\\n path = []\\n q = [frm]\\n while q:\\n n = q.pop()\\n path.append(n)\\n if n in g:\\n if len(g[n])>0:\\n m = g[n].pop()\\n q.append(m)\\n if not g[n]:\\n del g[n]\\n else:\\n del g[n]\\n return path\\n p = fp(\\\"JFK\\\")\\n while g:\\n for i in range(len(p)-1,-1,-1):\\n if p[i] in g:\\n p = p[:i]+fp(p[i])[:-1]+p[i:]\\n break\\n return p \\n \\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n for u,v in graph.items():\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = defaultdict(list)\\n for src, dst in sorted(tickets, reverse=True):\\n adj[src].append(dst)\\n \\n stack = [\\\"JFK\\\"]\\n res = []\\n\\n while stack:\\n airport = stack[-1]\\n if adj[airport]:\\n # get the smallest lexographical airport and add it to the stack\\n stack.append(adj[airport].pop())\\n else:\\n # if we the final airport then we can start appending to the stack\\n res.append(stack.pop())\\n return res[::-1]\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(airport: str) -> None:\\n if airport not in adj_list:\\n itinerary.append(airport)\\n return\\n \\n while adj_list[airport]:\\n arrival = adj_list[airport].pop()\\n dfs(arrival)\\n\\n itinerary.append(airport)\\n\\n if not tickets:\\n return [] \\n \\n adj_list, itinerary = {}, []\\n\\n for departure, arrival in tickets:\\n if departure in adj_list:\\n adj_list[departure].append(arrival)\\n else:\\n adj_list[departure] = [arrival]\\n \\n for arrivals in adj_list.values():\\n arrivals.sort()\\n arrivals.reverse()\\n \\n dfs(\\\"JFK\\\")\\n\\n return itinerary[::-1]\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"import collections\\n\\n\\nclass Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n graph = collections.defaultdict(list)\\n\\n for src, dest in tickets:\\n graph[src].append(dest)\\n\\n for src in graph:\\n graph[src].sort(reverse=True)\\n\\n itinery = []\\n\\n def dfs(src):\\n while graph[src]:\\n # Recursively explore the lexicographically smallest destination first\\n dfs(graph[src].pop())\\n\\n # Add current airport to itinerary after exploring all its destinations\\n itinery.append(src)\\n\\n dfs(\\\"JFK\\\")\\n\\n return itinery[::-1]\\n\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = defaultdict(list)\\n res = []\\n for src, des in tickets:\\n adj[src].append(des)\\n for key in adj:\\n adj[key].sort()\\n def dfs(src):\\n if src in adj:\\n dests = adj[src]\\n while dests:\\n dest = dests[0]\\n dests.pop(0)\\n dfs(dest)\\n res.append(src)\\n dfs('JFK')\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adjacencylist = {}\\n\\n for i in tickets:\\n adjacencylist[i[0]] = adjacencylist.get(i[0], []) + [i[1]]\\n \\n for i in adjacencylist.keys():\\n adjacencylist[i].sort()\\n adjacencylist[i] = adjacencylist[i][::-1]\\n \\n found = []\\n def dfs(current):\\n while current in adjacencylist and len(adjacencylist[current]) > 0:\\n dfs(adjacencylist[current].pop())\\n found.append(current)\\n\\n dfs(\\\"JFK\\\")\\n return found[::-1]\\n\\n \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n graph = defaultdict(list)\\n \\n for from_city, to_city in tickets:\\n graph[from_city].append(to_city)\\n \\n for city in graph:\\n graph[city].sort()\\n \\n itenerary = []\\n \\n def dfs(city):\\n while graph[city]:\\n next_city = graph[city].pop(0)\\n dfs(next_city)\\n itenerary.append(city)\\n \\n dfs(\\\"JFK\\\")\\n return itenerary[::-1]\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n \\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n print(src_dst)\\n 1 == 2\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n for u,v in graph.items():\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adjlist = defaultdict(list)\\n arpts = set()\\n for a, b in tickets:\\n arpts.add(a)\\n arpts.add(b)\\n adjlist[a].append(b)\\n # Sort for lexical ordering\\n for arpt in adjlist:\\n adjlist[arpt].sort()\\n\\n arpts = sorted(list(arpts))\\n topo_sorted = []\\n def dfs(arpt):\\n if arpt in adjlist:\\n dests = adjlist[arpt][:]\\n while dests:\\n dest = dests[0]\\n adjlist[arpt].pop(0)\\n dfs(dest)\\n dests = adjlist[arpt][:]\\n topo_sorted.append(arpt)\\n \\n dfs(\\\"JFK\\\")\\n return reversed(topo_sorted)\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom typing import List\\n\\n\\nclass Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n tickets.sort()\\n adj_list = defaultdict(list)\\n for src, dest in tickets:\\n adj_list[src].append(dest)\\n\\n print(adj_list)\\n\\n stack = [\\\"JFK\\\"]\\n # while stack:\\n\\n res = []\\n\\n while stack:\\n while adj_list[stack[-1]]:\\n stack.append(adj_list[stack[-1]].pop(0))\\n\\n res.append(stack.pop())\\n\\n print(res)\\n\\n # helper(\\\"JFK\\\")\\n return res[::-1]\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n tickets.sort(reverse = True)\\n adj = defaultdict(list)\\n for a, b in tickets:\\n adj[a].append(b)\\n \\n ret = []\\n def dfs(n):\\n while adj[n]:\\n dfs(adj[n].pop())\\n ret.append(n)\\n \\n dfs('JFK')\\n return ret[::-1]\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n print(src_dst)\\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src_dst in self.graph.values():\\n src_dst.sort(reverse=True) # sort destinations by *decreasing* lexical order\\n \\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n # destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n flight_map = collections.defaultdict(list)\\n result = []\\n\\n # Populate the flight map with each departure and arrival\\n for departure, arrival in tickets:\\n flight_map[departure].append(arrival)\\n\\n # Sort each list of destinations in reverse lexicographical order\\n for departure in flight_map:\\n flight_map[departure].sort(reverse=True)\\n\\n # Perform DFS traversal\\n def dfsTraversal(current):\\n destinations = flight_map[current]\\n\\n # Traverse all destinations in the order of their lexicographical\\n # sorting\\n while destinations:\\n next_destination = destinations.pop()\\n dfsTraversal(next_destination)\\n\\n # Append the current airport to the result after all destinations\\n # are visited\\n result.append(current)\\n\\n dfsTraversal(\\\"JFK\\\")\\n return result[::-1]\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n from collections import defaultdict\\n p_to_p = defaultdict(list)\\n \\n for a, b in tickets:\\n p_to_p[a].append(b)\\n \\n for node in p_to_p:\\n p_to_p[node].sort(reverse=True)\\n res=[]\\n queue=['JFK']\\n while queue:\\n node = queue[-1]\\n \\n if node in p_to_p and p_to_p[node]:\\n queue.append(p_to_p[node].pop())\\n else:\\n res.append(queue.pop())\\n return res[::-1]\\n\\n\\n \\n \",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n # this question is not your easy DFS question. in here, there's a concept\\n # called eulerian circuit/cycle which states that the trail starts and \\n # ends on the same vertex. the algo consists of 2 steps:\\n # 1. Starting from any vertex, we keep following the unused edges until \\n # we get stuck at certain vertex where we have no more unvisited outgoing edges.\\n # 2. We then backtrack to the nearest neighbor vertex in the current path that \\n # has unused edges and we repeat the process until all the edges have been used.\\n # The first vertex that we got stuck at would be the end point of our Eulerian \\n # path. So if we follow all the stuck points backwards, we could reconstruct \\n # the Eulerian path at the end.\\n\\n # since, we need return the itinerary that has the smallest lexical order, we have\\n # to sort the tickets list so that it would be easy to form the sorted nature in\\n # dfs calls, after processing each node, we pop it from the adjList since we can\\n # use each ticket only once and call dfs for the nextNode. Save the curr node in the result.\\n # [TC: O((V+E)LogN) SC: O(V+E)]\\n if not tickets:\\n return []\\n tickets.sort()\\n adjList = defaultdict(list)\\n for a, b in tickets:\\n adjList[a].append(b)\\n result = []\\n visited = set()\\n def dfs(node):\\n for i, nextNode in enumerate(adjList[node]):\\n # node -> curr airport, i -> index of destination\\n if (node, i) not in visited:\\n visited.add((node, i))\\n dfs(nextNode)\\n result.append(node) \\n\\n # def dfs(node):\\n # while adjList[node]:\\n # nextNode = adjList[node].pop(0)\\n # dfs(nextNode)\\n # result.append(node)\\n\\n dfs(\\\"JFK\\\")\\n return result[::-1]\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n\\n def findItinerary_not_efficient(self, tickets: List[List[str]]) -> List[str]:\\n\\n self.graph = {}\\n self.visited = {}\\n self.res = []\\n\\n for departure, arrival in tickets:\\n curr = self.graph.get(departure)\\n if not curr:\\n self.graph[departure] = [arrival]\\n else:\\n curr.append(arrival)\\n\\n for key, value in self.graph.items():\\n value.sort()\\n self.visited[key] = [False]*len(value)\\n\\n path_length = len(tickets) + 1\\n \\n def backtrak(curr_node, curr_path):\\n\\n is_any_flight_left = path_length > len(curr_path)\\n\\n if not is_any_flight_left:\\n self.res = list(curr_path)\\n return\\n elif not self.graph.get(curr_node):\\n return\\n\\n neighbors = self.graph[curr_node]\\n for i, nb in enumerate(neighbors):\\n if not self.visited[curr_node][i]:\\n curr_path.append(nb)\\n self.visited[curr_node][i] = True\\n backtrak(nb, curr_path)\\n if self.res:\\n return\\n self.visited[curr_node][i] = False\\n curr_path.pop()\\n\\n backtrak('JFK', ['JFK'])\\n\\n return self.res\\n\\n\\n def findItinerary(self, tickets):\\n\\n from collections import defaultdict\\n self.flightMap = defaultdict(list)\\n\\n for ticket in tickets:\\n origin, dest = ticket[0], ticket[1]\\n self.flightMap[origin].append(dest)\\n\\n # sort the itinerary based on the lexical order\\n for origin, itinerary in self.flightMap.items():\\n # Note that we could have multiple identical flights, i.e. same origin and destination.\\n itinerary.sort(reverse=True)\\n\\n self.result = []\\n self.DFS('JFK')\\n\\n # reconstruct the route backwards\\n return self.result[::-1]\\n\\n def DFS(self, origin):\\n destList = self.flightMap[origin]\\n while destList:\\n #while we visit the edge, we trim it off from graph.\\n nextDest = destList.pop()\\n self.DFS(nextDest)\\n self.result.append(origin)\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adjlist = defaultdict(list)\\n for a, b in tickets:\\n adjlist[a].append(b)\\n # Sort for lexical ordering\\n for arpt in adjlist:\\n adjlist[arpt].sort()\\n topo_sorted = []\\n def dfs(arpt):\\n if arpt in adjlist:\\n dests = adjlist[arpt][:]\\n while dests:\\n dest = dests[0]\\n adjlist[arpt].pop(0)\\n dfs(dest)\\n dests = adjlist[arpt][:]\\n topo_sorted.append(arpt)\\n \\n dfs(\\\"JFK\\\")\\n return reversed(topo_sorted)\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def traverse(self, departure):\\n for arrival in self.routes[departure]:\\n route = (departure, arrival)\\n if self.counts[route]:\\n self.itinerary.append(arrival)\\n self.counts[route] -= 1\\n self.traverse(arrival)\\n self.itinerary.pop()\\n self.counts[route] += 1\\n if len(self.itinerary) == self.n:\\n raise Exception(\\\"Itenary found\\\")\\n\\n def findItinerary(self, tickets):\\n self.routes = defaultdict(list)\\n self.counts = defaultdict(int)\\n self.n = len(tickets) + 1\\n self.itinerary = ['JFK']\\n for departure, arrival in tickets:\\n if arrival not in self.routes[departure]:\\n bisect.insort(self.routes[departure], arrival)\\n self.counts[(departure, arrival)] += 1\\n try:\\n self.traverse('JFK')\\n except:\\n return self.itinerary\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n # this question is not your easy DFS question. in here, there's a concept\\n # called eulerian circuit/cycle which states that the trail starts and \\n # ends on the same vertex. the algo consists of 2 steps:\\n # 1. Starting from any vertex, we keep following the unused edges until \\n # we get stuck at certain vertex where we have no more unvisited outgoing edges.\\n # 2. We then backtrack to the nearest neighbor vertex in the current path that \\n # has unused edges and we repeat the process until all the edges have been used.\\n # The first vertex that we got stuck at would be the end point of our Eulerian \\n # path. So if we follow all the stuck points backwards, we could reconstruct \\n # the Eulerian path at the end.\\n\\n # approach 1:\\n # since, we need return the itinerary that has the smallest lexical order, we have\\n # to sort the tickets list so that it would be easy to form the sorted nature in\\n # dfs calls, after processing each node, we pop it from the adjList since we can\\n # use each ticket only once and call dfs for the nextNode. Save the curr node in the result.\\n # [TC: O((V+E)LogN) SC: O(V+E)]\\n\\n # approach 2:\\n # Tracking individual edges ensures that even if there are multiple flights between the same two\\n # airports, you can distinguish them and ensure you only use each flight once. By marking each \\n # edge as visited (with visited.add((node, i)) where i is the index of the flight), you guarantee\\n # that you don't reuse the same flight (edge) multiple times.\\n if not tickets:\\n return []\\n tickets.sort()\\n adjList = defaultdict(list)\\n for a, b in tickets:\\n adjList[a].append(b)\\n result = []\\n visited = set()\\n # in this approach, we have to maintain the order of visiting neighbors without modifying adjList\\n def dfs(node):\\n # i -> index of curr destination, nextNode -> actual destination airport in adjList[node]\\n # for eg: if adjList[\\\"JFK\\\"] looks like [\\\"ATL\\\", \\\"SFO\\\"], then enumerate will return \\n # i = 0, nextNode = \\\"ATL\\\" and i = 1, nextNode = \\\"SFO\\\"\\n # In the code, the index i is used to uniquely identify each flight (or edge) coming from node. \\n # This allows us to track which specific flight (edge) has been visited using the combination \\n # (node, i) in the visited set. This way, if there are multiple flights to the same destination, \\n # we can differentiate between them and track which flight has been used.\\n for i, nextNode in enumerate(adjList[node]):\\n # node -> curr airport, i -> index of destination\\n # suppose, tickets = [[\\\"JFK\\\", \\\"SFO\\\"], [\\\"JFK\\\", \\\"SFO\\\"], [\\\"SFO\\\", \\\"JFK\\\"]]\\n # here are 2 flights b/w JFK and SFO. if we were only tracking nodes, we'd visit SFO only once\\n # and potentially miss one of the flights. with edge tracking (node, i), The first time you \\n # visit \\\"SFO\\\" via \\\"JFK\\\", you mark flight (\\\"JFK\\\", 0) as visited. The second time you visit \\\"SFO\\\" \\n # via \\\"JFK\\\", you mark flight (\\\"JFK\\\", 1) as visited.\\n if (node, i) not in visited:\\n visited.add((node, i))\\n dfs(nextNode)\\n result.append(node)\\n\\n # def dfs(node):\\n # while adjList[node]:\\n # nextNode = adjList[node].pop(0)\\n # dfs(nextNode)\\n # result.append(node)\\n\\n dfs(\\\"JFK\\\")\\n return result[::-1]\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = defaultdict(list)\\n \\n # Build the adjacency list with a min-heap for each source\\n for i, j in tickets:\\n heapq.heappush(adj[i], j)\\n \\n res = []\\n \\n def dfs(src):\\n # While there are outgoing flights from src\\n while adj[src]:\\n # Always take the smallest lexical flight (min-heap ensures this)\\n next_dest = heapq.heappop(adj[src])\\n dfs(next_dest)\\n res.append(src)\\n \\n # Start DFS from 'JFK'\\n dfs('JFK')\\n \\n # The result will be in reverse order, so reverse it\\n return res[::-1]\\n\\n # adj = defaultdict(list)\\n # tickets.sort()\\n # for i,j in tickets:\\n # adj[i].append(j)\\n \\n # res= ['JFK']\\n # def dfs(src):\\n # if len(res) == len(tickets) + 1:\\n # return True\\n # if src not in adj:\\n # return False\\n # temp = adj[src]\\n # for i,edg in enumerate(temp):\\n # #action\\n # adj[src].pop(i)\\n # res.append(edg)\\n # #recurse\\n # if dfs(edg):\\n # return True\\n \\n # #backtrack\\n # adj[src].insert(i,edg)\\n # res.pop()\\n # return False\\n \\n # dfs('JFK')\\n # return res \\n\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]: \\n # Step 1: Map each airport to an index for the adjacency matrix\\n airports = sorted(set([start for start, end in tickets] + [end for start, end in tickets]))\\n airport_to_idx = {airport: idx for idx, airport in enumerate(airports)}\\n idx_to_airport = {idx: airport for airport, idx in airport_to_idx.items()}\\n \\n # Step 2: Create an adjacency matrix\\n n = len(airports)\\n matrix = [[0] * n for _ in range(n)] # n x n matrix\\n \\n # Populate the matrix with the ticket counts\\n for start, end in tickets:\\n matrix[airport_to_idx[start]][airport_to_idx[end]] += 1\\n \\n # Step 3: Find the source and destination airports using the matrix and its transpose\\n out_degrees = [sum(row) for row in matrix] # Outgoing edges per airport\\n in_degrees = [sum(row[i] for row in matrix) for i in range(n)] # Incoming edges per airport\\n \\n start_airport = None\\n end_airport = None\\n \\n for i in range(n):\\n if out_degrees[i] > in_degrees[i]:\\n start_airport = i # This airport has more outgoing edges than incoming\\n if in_degrees[i] > out_degrees[i]:\\n end_airport = i # This airport has more incoming edges than outgoing\\n \\n # If no imbalanced airport is found, use the lexicographically smallest airport (JFK or smallest)\\n if start_airport is None:\\n start_airport = airport_to_idx[\\\"JFK\\\"] if \\\"JFK\\\" in airport_to_idx else 0\\n \\n itinerary = []\\n \\n # Step 4: Perform DFS to find the itinerary\\n def dfs(airport_idx):\\n for i in range(n):\\n while matrix[airport_idx][i] > 0: # While there are tickets left from airport_idx to i\\n matrix[airport_idx][i] -= 1\\n dfs(i)\\n itinerary.append(idx_to_airport[airport_idx]) # Add the airport to the itinerary\\n \\n # Step 5: Start DFS from the dynamically determined start airport\\n dfs(start_airport)\\n \\n # Step 6: Return the itinerary in reverse order\\n return itinerary[::-1]\\n\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adjlist = defaultdict(list)\\n for a, b in tickets:\\n adjlist[a].append(b)\\n # Sort in reverese for lexical ordering convert to deque\\n for arpt in adjlist:\\n adjlist[arpt].sort(reverse=True)\\n topo_sorted = []\\n def dfs(arpt):\\n if arpt in adjlist:\\n dests = adjlist[arpt]\\n while dests:\\n dest = dests.pop()\\n dfs(dest)\\n topo_sorted.append(arpt)\\n \\n dfs(\\\"JFK\\\")\\n return reversed(topo_sorted)\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n from collections import defaultdict\\n g = defaultdict(list)\\n outdegree = defaultdict(int)\\n for f, to in tickets:\\n g[f].append(to)\\n outdegree[f] += 1\\n\\n for key, val in g.items():\\n g[key].sort()\\n\\n seen = set()\\n\\n def dfs(node, path):\\n for i, child in enumerate(g[node]):\\n status = (node, child, i)\\n if status not in seen:\\n seen.add(status)\\n outdegree[node] -= 1\\n dfs(child, path)\\n\\n if outdegree[node] == 0:\\n path.append(node)\\n return path\\n\\n res = dfs(\\\"JFK\\\", [])\\n #print(res)\\n return res[::-1]\\n\\n \\n\\n \",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"# neet150, 2/12/2024\\nclass Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n # adj_list \\n adj_list = defaultdict(lambda: defaultdict(int)) \\n for u, v in tickets:\\n adj_list[u][v] += 1 # you need to do this cuz there will be duplicated tickets\\n \\n # print(adj_list)\\n def dfs(start, cur_path): # used one will get removed \\n nonlocal itineary\\n if itineary: return\\n if len(cur_path) == len(tickets)+1: # used all \\n itineary = cur_path[:] \\n return \\n \\n for dest in sorted(adj_list[start]): # for lexcographid soritng \\n adj_list[start][dest] -= 1\\n if adj_list[start][dest] == 0: adj_list[start].pop(dest) # pop the key if 0\\n cur_path.append(dest)\\n\\n dfs(dest, cur_path)\\n if itineary: return # first one out\\n\\n # backtracking\\n cur_path.pop()\\n adj_list[start][dest] += 1\\n\\n\\n itineary = []\\n dfs(\\\"JFK\\\", [\\\"JFK\\\"])\\n return itineary\\n\\n # time: O(n^n), but probablty converge faster, n is maximum flight from any airport\\n # space: O(n) for the adjust list\",\n \"runtime\": \"90\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":57,"string":"57"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n targets = collections.defaultdict(list)\n for a, b in sorted(tickets)[::-1]:\n targets[a] += b,\n route, stack = [], ['JFK']\n while stack:\n while targets[stack[-1]]:\n stack += targets[stack[-1]].pop(),\n route += stack.pop(),\n return route[::-1] ","memory":"16300"},{"code":"class Solution(object):\n def findItinerary(self, tickets):\n \"\"\"\n :type tickets: List[List[str]]\n :rtype: List[str]\n \"\"\"\n from collections import defaultdict\n self.flightMap = defaultdict(list)\n\n for ticket in tickets:\n origin, dest = ticket[0], ticket[1]\n self.flightMap[origin].append(dest)\n\n # sort the itinerary based on the lexical order\n for origin, itinerary in self.flightMap.items():\n # Note that we could have multiple identical flights, i.e. same origin and destination.\n itinerary.sort()\n\n self.result = []\n self.DFS('JFK')\n\n # reconstruct the route backwards\n return self.result[::-1]\n\n def DFS(self, origin):\n destList = self.flightMap[origin]\n while destList:\n #while we visit the edge, we trim it off from graph.\n nextDest = destList.pop(0)\n self.DFS(nextDest)\n self.result.append(origin)","memory":"16500"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n print(src_dst)\n self.res = []\n self.dfs(\"JFK\")\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","memory":"16600"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = {}\n for src, dst in tickets:\n self.graph[src] = self.graph.get(src, []) + [dst]\n \n for src, src_dst in self.graph.items():\n src_dst.sort(reverse=True) # sort destinations by lexical order\n \n self.res = []\n self.dfs(\"JFK\")\n return self.res[::-1]\n \n def dfs(self, src):\n destinations = self.graph.get(src, [])\n while self.graph.get(src, []):\n dst = self.graph[src].pop(-1)\n self.dfs(dst)\n self.res.append(src)\n \n \n","memory":"16700"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n self.graph = collections.defaultdict(list)\n\n for s, d in tickets:\n self.graph[s].append(d)\n\n for s, d in self.graph.items():\n d.sort(reverse=True)\n\n self.ans = []\n self.dfs(\"JFK\")\n return self.ans[::-1]\n\n def dfs(self, node):\n while self.graph[node]:\n next_des = self.graph[node].pop()\n self.dfs(next_des)\n self.ans.append(node)\n","memory":"16700"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","memory":"16800"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","memory":"16800"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n graph = defaultdict(list)\n \n for from_city, to_city in tickets:\n graph[from_city].append(to_city)\n \n for city in graph:\n graph[city].sort()\n \n itenerary = []\n \n def dfs(city):\n while graph[city]:\n next_city = graph[city].pop(0)\n dfs(next_city)\n itenerary.append(city)\n \n dfs(\"JFK\")\n return itenerary[::-1]","memory":"16900"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n tickets.sort(reverse=True)\n adj = defaultdict(list)\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n res = []\n def dfs(src):\n while adj[src]:\n dfs(adj[src].pop())\n res.append(src)\n\n dfs(\"JFK\")\n\n return res[::-1]","memory":"16900"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n # this question is not your easy DFS question. in here, there's a concept\n # called eulerian circuit/cycle which states that the trail starts and \n # ends on the same vertex. the algo consists of 2 steps:\n # 1. Starting from any vertex, we keep following the unused edges until \n # we get stuck at certain vertex where we have no more unvisited outgoing edges.\n # 2. We then backtrack to the nearest neighbor vertex in the current path that \n # has unused edges and we repeat the process until all the edges have been used.\n # The first vertex that we got stuck at would be the end point of our Eulerian \n # path. So if we follow all the stuck points backwards, we could reconstruct \n # the Eulerian path at the end.\n\n # since, we need return the itinerary that has the smallest lexical order, we have\n # to sort the tickets list so that it would be easy to form the sorted nature in\n # dfs calls, after processing each node, we pop it from the adjList since we can\n # use each ticket only once and call dfs for the nextNode. Save the curr node in the result.\n # [TC: O((V+E)LogN) SC: O(V+E)]\n if not tickets:\n return []\n tickets.sort()\n adjList = defaultdict(list)\n for a, b in tickets:\n adjList[a].append(b)\n result = []\n visited = set()\n def dfs(node):\n for i, nextNode in enumerate(adjList[node]):\n # node -> curr airport, i -> index of destination\n if (node, i) not in visited:\n visited.add((node, i))\n dfs(nextNode)\n result.append(node) \n\n # def dfs(node):\n # while adjList[node]:\n # nextNode = adjList[node].pop(0)\n # dfs(nextNode)\n # result.append(node)\n\n dfs(\"JFK\")\n return result[::-1]","memory":"17000"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n def dfs(city):\n while(len(graph[city]) > 0):\n dfs(graph[city].pop(0))\n res.insert(0, city) # last airport\n \n graph = collections.defaultdict(list)\n for u, v in (tickets):\n graph[u].append(v)\n graph[u].sort()\n res=[] \n dfs(\"JFK\")\n return res\n # d={}\n # for elem in tickets:\n # if elem[0] not in d:\n # d[elem[0]] = []\n # d[elem[0]].append(elem[1])\n # for _,v in d.items():\n # v.sort()\n # # print(d)\n # if 'JFK' not in d.keys():\n # return []\n # res = ['JFK']\n # while res[-1] in d and len(d[res[-1]]) > 0:\n # popped = d[res[-1]].pop(0)\n # res.append(popped)\n # return res\n \n ","memory":"17000"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj = {src: [] for src, dst in tickets}\n res = []\n\n for src, dst in tickets:\n adj[src].append(dst)\n\n for key in adj:\n adj[key].sort()\n\n def dfs(adj, result, src):\n if src in adj:\n destinations = adj[src][:]\n while destinations:\n dest = destinations[0]\n adj[src].pop(0)\n dfs(adj, res, dest)\n destinations = adj[src][:]\n res.append(src)\n\n dfs(adj, res, \"JFK\")\n res.reverse()\n\n if len(res) != len(tickets) + 1:\n return []\n\n return res\n\n \n\n\n ","memory":"17100"},{"code":"class Solution:\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\n adj_list = defaultdict(list)\n counts = defaultdict(lambda: defaultdict(int))\n for i, j in tickets:\n counts[i][j] += 1\n adj_list[i].append(j)\n\n result = []\n def topo(node):\n for neighbor in sorted(adj_list[node]):\n if counts[node][neighbor] > 0:\n counts[node][neighbor] -= 1\n topo(neighbor)\n result.append(node)\n\n topo(\"JFK\")\n return reversed(result)\n ","memory":"17100"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n targets = collections.defaultdict(list)\\n for a, b in sorted(tickets)[::-1]:\\n targets[a] += b,\\n route, stack = [], ['JFK']\\n while stack:\\n while targets[stack[-1]]:\\n stack += targets[stack[-1]].pop(),\\n route += stack.pop(),\\n return route[::-1] \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution(object):\\n def findItinerary(self, tickets):\\n \\\"\\\"\\\"\\n :type tickets: List[List[str]]\\n :rtype: List[str]\\n \\\"\\\"\\\"\\n from collections import defaultdict\\n self.flightMap = defaultdict(list)\\n\\n for ticket in tickets:\\n origin, dest = ticket[0], ticket[1]\\n self.flightMap[origin].append(dest)\\n\\n # sort the itinerary based on the lexical order\\n for origin, itinerary in self.flightMap.items():\\n # Note that we could have multiple identical flights, i.e. same origin and destination.\\n itinerary.sort()\\n\\n self.result = []\\n self.DFS('JFK')\\n\\n # reconstruct the route backwards\\n return self.result[::-1]\\n\\n def DFS(self, origin):\\n destList = self.flightMap[origin]\\n while destList:\\n #while we visit the edge, we trim it off from graph.\\n nextDest = destList.pop(0)\\n self.DFS(nextDest)\\n self.result.append(origin)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n print(src_dst)\\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = {}\\n for src, dst in tickets:\\n self.graph[src] = self.graph.get(src, []) + [dst]\\n \\n for src, src_dst in self.graph.items():\\n src_dst.sort(reverse=True) # sort destinations by lexical order\\n \\n self.res = []\\n self.dfs(\\\"JFK\\\")\\n return self.res[::-1]\\n \\n def dfs(self, src):\\n destinations = self.graph.get(src, [])\\n while self.graph.get(src, []):\\n dst = self.graph[src].pop(-1)\\n self.dfs(dst)\\n self.res.append(src)\\n \\n \\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n self.graph = collections.defaultdict(list)\\n\\n for s, d in tickets:\\n self.graph[s].append(d)\\n\\n for s, d in self.graph.items():\\n d.sort(reverse=True)\\n\\n self.ans = []\\n self.dfs(\\\"JFK\\\")\\n return self.ans[::-1]\\n\\n def dfs(self, node):\\n while self.graph[node]:\\n next_des = self.graph[node].pop()\\n self.dfs(next_des)\\n self.ans.append(node)\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n graph = defaultdict(list)\\n \\n for from_city, to_city in tickets:\\n graph[from_city].append(to_city)\\n \\n for city in graph:\\n graph[city].sort()\\n \\n itenerary = []\\n \\n def dfs(city):\\n while graph[city]:\\n next_city = graph[city].pop(0)\\n dfs(next_city)\\n itenerary.append(city)\\n \\n dfs(\\\"JFK\\\")\\n return itenerary[::-1]\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n tickets.sort(reverse=True)\\n adj = defaultdict(list)\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n res = []\\n def dfs(src):\\n while adj[src]:\\n dfs(adj[src].pop())\\n res.append(src)\\n\\n dfs(\\\"JFK\\\")\\n\\n return res[::-1]\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n # this question is not your easy DFS question. in here, there's a concept\\n # called eulerian circuit/cycle which states that the trail starts and \\n # ends on the same vertex. the algo consists of 2 steps:\\n # 1. Starting from any vertex, we keep following the unused edges until \\n # we get stuck at certain vertex where we have no more unvisited outgoing edges.\\n # 2. We then backtrack to the nearest neighbor vertex in the current path that \\n # has unused edges and we repeat the process until all the edges have been used.\\n # The first vertex that we got stuck at would be the end point of our Eulerian \\n # path. So if we follow all the stuck points backwards, we could reconstruct \\n # the Eulerian path at the end.\\n\\n # since, we need return the itinerary that has the smallest lexical order, we have\\n # to sort the tickets list so that it would be easy to form the sorted nature in\\n # dfs calls, after processing each node, we pop it from the adjList since we can\\n # use each ticket only once and call dfs for the nextNode. Save the curr node in the result.\\n # [TC: O((V+E)LogN) SC: O(V+E)]\\n if not tickets:\\n return []\\n tickets.sort()\\n adjList = defaultdict(list)\\n for a, b in tickets:\\n adjList[a].append(b)\\n result = []\\n visited = set()\\n def dfs(node):\\n for i, nextNode in enumerate(adjList[node]):\\n # node -> curr airport, i -> index of destination\\n if (node, i) not in visited:\\n visited.add((node, i))\\n dfs(nextNode)\\n result.append(node) \\n\\n # def dfs(node):\\n # while adjList[node]:\\n # nextNode = adjList[node].pop(0)\\n # dfs(nextNode)\\n # result.append(node)\\n\\n dfs(\\\"JFK\\\")\\n return result[::-1]\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n def dfs(city):\\n while(len(graph[city]) > 0):\\n dfs(graph[city].pop(0))\\n res.insert(0, city) # last airport\\n \\n graph = collections.defaultdict(list)\\n for u, v in (tickets):\\n graph[u].append(v)\\n graph[u].sort()\\n res=[] \\n dfs(\\\"JFK\\\")\\n return res\\n # d={}\\n # for elem in tickets:\\n # if elem[0] not in d:\\n # d[elem[0]] = []\\n # d[elem[0]].append(elem[1])\\n # for _,v in d.items():\\n # v.sort()\\n # # print(d)\\n # if 'JFK' not in d.keys():\\n # return []\\n # res = ['JFK']\\n # while res[-1] in d and len(d[res[-1]]) > 0:\\n # popped = d[res[-1]].pop(0)\\n # res.append(popped)\\n # return res\\n \\n \",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj = {src: [] for src, dst in tickets}\\n res = []\\n\\n for src, dst in tickets:\\n adj[src].append(dst)\\n\\n for key in adj:\\n adj[key].sort()\\n\\n def dfs(adj, result, src):\\n if src in adj:\\n destinations = adj[src][:]\\n while destinations:\\n dest = destinations[0]\\n adj[src].pop(0)\\n dfs(adj, res, dest)\\n destinations = adj[src][:]\\n res.append(src)\\n\\n dfs(adj, res, \\\"JFK\\\")\\n res.reverse()\\n\\n if len(res) != len(tickets) + 1:\\n return []\\n\\n return res\\n\\n \\n\\n\\n \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def findItinerary(self, tickets: List[List[str]]) -> List[str]:\\n adj_list = defaultdict(list)\\n counts = defaultdict(lambda: defaultdict(int))\\n for i, j in tickets:\\n counts[i][j] += 1\\n adj_list[i].append(j)\\n\\n result = []\\n def topo(node):\\n for neighbor in sorted(adj_list[node]):\\n if counts[node][neighbor] > 0:\\n counts[node][neighbor] -= 1\\n topo(neighbor)\\n result.append(node)\\n\\n topo(\\\"JFK\\\")\\n return reversed(result)\\n \",\n \"memory\": \"17100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":13,"string":"13"}}},{"rowIdx":262,"cells":{"question_id":{"kind":"number","value":334,"string":"334"},"name":{"kind":"string","value":"increasing-triplet-subsequence"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i < j < k</code><em> and </em><code>nums[i] < nums[j] < nums[k]</code>. If no such indices exists, return <code>false</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [1,2,3,4,5]\n<strong>Output:</strong> true\n<strong>Explanation:</strong> Any triplet where i < j < k is valid.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [5,4,3,2,1]\n<strong>Output:</strong> false\n<strong>Explanation:</strong> No triplet exists.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [2,1,5,0,4,6]\n<strong>Output:</strong> true\n<strong>Explanation:</strong> The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 5 * 10<sup>5</sup></code></li>\n\t<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>\n</ul>\n\n<p> </p>\n<strong>Follow up:</strong> Could you implement a solution that runs in <code>O(n)</code> time complexity and <code>O(1)</code> space complexity?"},"acRate":{"kind":"number","value":39.430707250195304,"string":"39.430707"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","greedy"],"string":"[\n \"array\",\n \"greedy\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"72\", 0.0324], [\"84\", 0.2015], [\"96\", 0.1291], [\"108\", 0.0081], [\"121\", 0.0081], [\"133\", 0.0081], [\"145\", 0.0081], [\"158\", 0.0081], [\"170\", 0.0081], [\"182\", 0.0081], [\"194\", 0.0161], [\"207\", 0.0403], [\"219\", 0.0161], [\"231\", 0.0483], [\"243\", 0.0483], [\"256\", 0.0564], [\"268\", 0.0483], [\"280\", 0.0645], [\"293\", 0.0806], [\"305\", 0.0967], [\"317\", 0.1048], [\"329\", 0.1773], [\"342\", 0.1128], [\"354\", 0.2015], [\"366\", 0.3223], [\"379\", 0.3143], [\"391\", 0.411], [\"403\", 0.419], [\"415\", 0.6366], [\"428\", 0.6849], [\"440\", 0.7575], [\"452\", 0.8783], [\"464\", 0.9347], [\"477\", 0.9589], [\"489\", 0.9267], [\"501\", 1.0234], [\"514\", 1.3457], [\"526\", 1.4182], [\"538\", 1.4424], [\"550\", 1.5391], [\"563\", 1.5633], [\"575\", 1.6922], [\"587\", 1.7566], [\"599\", 1.8856], [\"612\", 2.1354], [\"624\", 1.9581], [\"636\", 2.216], [\"649\", 1.8936], [\"661\", 2.3368], [\"673\", 2.1031], [\"685\", 2.079], [\"698\", 2.0145], [\"710\", 1.8453], [\"722\", 1.8372], [\"734\", 1.7244], [\"747\", 1.8292], [\"759\", 1.6116], [\"771\", 1.5794], [\"784\", 1.7164], [\"796\", 13.1024], [\"808\", 8.8153], [\"820\", 5.3427], [\"833\", 2.8205], [\"845\", 1.7325000000000002], [\"857\", 1.386], [\"870\", 1.3458], [\"882\", 0.9668], [\"894\", 0.7091000000000001], [\"906\", 0.6929000000000001], [\"919\", 0.7252000000000001], [\"931\", 0.49960000000000004], [\"943\", 0.41900000000000004], [\"955\", 0.6527000000000001], [\"968\", 0.7171000000000001], [\"980\", 0.6205], [\"992\", 0.6686000000000001], [\"1005\", 0.7573000000000001], [\"1017\", 0.8218000000000001], [\"1029\", 0.49960000000000004], [\"1041\", 0.37050000000000005]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"26200\", 0.0242], [\"26300\", 0.0161], [\"26400\", 0.2095], [\"26500\", 0.1209], [\"26600\", 0.0081], [\"30000\", 0.0081], [\"30200\", 0.0081], [\"30300\", 0.0081], [\"30400\", 0.0081], [\"30500\", 0.0161], [\"30700\", 0.0081], [\"30900\", 0.0242], [\"31000\", 0.0161], [\"31100\", 0.0242], [\"31200\", 0.0161], [\"31300\", 0.0322], [\"31400\", 0.0564], [\"31500\", 0.1531], [\"31600\", 0.1048], [\"31700\", 0.0322], [\"31800\", 0.0967], [\"31900\", 0.0483], [\"32000\", 0.1289], [\"32100\", 0.1853], [\"32200\", 0.1692], [\"32299\", 0.3384], [\"32400\", 1.6197], [\"32500\", 25.5197], [\"32600\", 58.5254]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n f = float('inf')\n s = float('inf')\n\n for num in nums:\n if num <= f:\n f = num\n elif num <= s:\n s = num\n else:\n return True\n \n return False\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","runtime":"72"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) <= 2: return False\n first, second = float(inf), float(inf)\n for i in nums:\n if i <= first:\n first = i\n elif i <= second:\n second = i\n else:\n return True\n return False\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","runtime":"72"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a,b=float(inf),float(inf)\n for i in nums:\n if i<=a:\n a=i\n elif i<=b:\n b=i\n else:\n return True\n return False\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()\n\n","runtime":"84"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums)<3:\n return False\n f,s=float('inf'),float('inf') \n for i in nums:\n if i<=f:f=i\n elif i<=s:s=i\n else:return True\n return False \nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit() ","runtime":"84"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums)<3:\n return False\n fmin=float('inf')\n smin=float('inf')\n\n for n in nums:\n if n<=fmin:\n fmin=n\n elif n<=smin:\n smin=n\n else:\n return True\n return False\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit() ","runtime":"96"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n s = float('inf')\n l = float('inf')\n\n for x in nums:\n if x <= s:\n s = x\n elif x <= l:\n l = x\n elif x > l:\n return True\n return False\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()\n\n ","runtime":"96"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n res = []\n for num in nums:\n for i in range(len(res)):\n if num <= res[i]:\n res[i] = num\n break\n else:\n res.append(num)\n return len(res) > 2\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","runtime":"108"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n res = []\n for num in nums:\n for i in range(len(res)):\n if num <= res[i]:\n res[i] = num\n break\n else:\n res.append(num)\n return len(res) > 2\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit() \n \n\n\n\n\n \n ","runtime":"121"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n min_till = [700000] * n\n min_till[0] = nums[0]\n for i in range(1,n):\n min_till[i] = min(min_till[i-1], nums[i])\n for i in range(n-2,0,-1):\n if nums[i]>min_till[i] and nums[i]<nums[i+1]:\n return True\n nums[i] = max(nums[i],nums[i+1])\n return False\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit() \n\n","runtime":"133"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n left = [False] * n\n right = [False] * n\n mi = float('inf')\n ma = float('-inf')\n\n for i in range(1, n):\n mi = min(mi, nums[i - 1])\n if nums[i] > mi:\n left[i] = True\n\n for i in range(n - 2, -1, -1):\n ma = max(ma, nums[i + 1])\n if nums[i] < ma:\n right[i] = True\n\n for i in range(1, n - 1):\n if left[i] and right[i]:\n return 'true'\n\n return 'false'\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().increasingTriplet(nums),file=f)\nexit(0)\n","runtime":"145"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n minL = [math.inf] * len(nums)\n maxR = [-1 * math.inf] * len(nums)\n for i in range(1, len(nums)):\n minL[i] = min(minL[i-1], nums[i-1])\n inv_i = len(nums) - i - 1\n maxR[inv_i] = max(maxR[inv_i + 1], nums[inv_i+1])\n for i in range(1, len(nums)-1):\n if minL[i] < nums[i] and maxR[i] > nums[i]:\n return True\n return False\n\n\ndef main():\n input_data = sys.stdin.read().strip()\n test_cases = input_data.split('\\n')\n results = []\n \n for i in range(0, len(test_cases), 1):\n nums = json.loads(test_cases[i])\n results.append(Solution().increasingTriplet(nums))\n \n with open('user.out', 'w') as f:\n for result in results:\n f.write(f\"{str(result).lower()}\\n\")\n\nif __name__ == \"__main__\":\n main()\n exit(0)","runtime":"158"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n minL = [math.inf] * len(nums)\n maxR = [-1 * math.inf] * len(nums)\n for i in range(1, len(nums)):\n minL[i] = min(minL[i-1], nums[i-1])\n inv_i = len(nums) - i - 1\n maxR[inv_i] = max(maxR[inv_i + 1], nums[inv_i+1])\n for i in range(1, len(nums)-1):\n if minL[i] < nums[i] and maxR[i] > nums[i]:\n return True\n return False\n\n\ndef main():\n input_data = sys.stdin.read().strip()\n test_cases = input_data.split('\\n')\n results = []\n \n for i in range(0, len(test_cases), 1):\n nums = json.loads(test_cases[i])\n results.append(Solution().increasingTriplet(nums))\n \n with open('user.out', 'w') as f:\n for result in results:\n f.write(f\"{str(result).lower()}\\n\")\n\nif __name__ == \"__main__\":\n main()\n exit(0)","runtime":"170"},{"code":"import itertools\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # i=0\n # j=1\n # k=2\n # while k<len(nums):\n # if nums[i]<nums[j]<nums[k]:\n # return True\n # else:\n # i+=1\n # j+=1\n # k+=1\n # return False\n\n\n # comb=itertools.combinations(nums,3)\n # for i in comb:\n # if i[0]<i[1]<i[2]:\n # return True\n # return False\n\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False\n ","runtime":"182"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n min_num = max_num = float('inf')\n\n for n in nums:\n if n <= min_num:\n min_num = n\n elif n <= max_num:\n max_num = n\n else:\n return True\n\n return False","runtime":"194"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n '''\n len1_index = 0\n len2_indices = [0, None]\n for i in range(1, len(nums)):\n if len2_indices[1] and nums[i] > nums[len2_indices[1]]:\n return (len2_indices[0], len2_indices[1], i)\n if nums[i] < nums[len1_index]:\n len1_index = i\n\n if nums[i] > nums[len1_index]:\n if not len2_indices[1] or nums[i] < nums[len2_indices[1]]:\n len2_indices[0] = len1_index\n len2_indices[1] = i\n\n return False\n '''\n len1_min = float(\"inf\")\n len2_min = float(\"inf\")\n for n in nums:\n if n <= len1_min:\n len1_min = n\n elif n <= len2_min:\n len2_min = n\n else:\n return True\n return False\n\n \n \n \n \n ","runtime":"207"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # Initialize the smallest and second smallest numbers\n first_num = second_num = float('inf')\n \n for num in nums:\n if num <= first_num:\n first_num = num\n elif num <= second_num:\n second_num = num\n else:\n # We have found a number greater than both first_num and second_num\n return True\n \n return False\n\n# Example usage:\nsolution = Solution()\nprint(solution.increasingTriplet([1, 2, 3, 4, 5])) # Output: True\nprint(solution.increasingTriplet([5, 4, 3, 2, 1])) # Output: False\nprint(solution.increasingTriplet([2, 1, 5, 0, 4, 6])) # Output: True","runtime":"219"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n return False","runtime":"243"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n# We are to ingest nums, and in order, observe for the occurance of a window len 3, in which each index is ascending, and their values are also ascending.\n\n # We need float inf to ensure no numbers from our nums will exceed our pointers \n first_num = float(\"inf\")\n second_num = float(\"inf\")\n for n in nums:\n # Since first_num initially is + infiniti, this condition will always hit \n if n <= first_num:\n first_num = n\n elif n <= second_num:\n second_num = n\n else:\n # This gives us the correct answer as it confirms an increasing triplet \n return True\n return False\n\n# This will consume linear time, but use constant space as we only need auxilary for our pointers \n# So first pass with this input: 1,2,3,4\n# - first_num gets set to 1, second num is pos infinit.\n# - now second_num gets set to 2\n# - 3 is not < 2 or 1, so we return true\n\n# if it were an input with gaps for example: 1,2,1,3,4\n# - first_num gets set to 1\n# - second_num gets set to 2\n# - we pass through for nums[2] this doesn't meet any criteria for computation so enter back into loop again for nums[3] which is 3, this is > than first_num and second_num so return true.\n\n# -however if it was 1,2,1,1 for example, we'd have first num 1, second num 2, then we'd finish the loop without meeting the final condition and would exit the loop returning false","runtime":"256"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf')\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n return False\n\n ","runtime":"268"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first_small_num, second_small_num = float(\"inf\"), float(\"inf\")\n for i in nums:\n if i <= first_small_num:\n first_small_num = i\n elif i <= second_small_num:\n second_small_num = i\n else:\n return True\n return False\n ","runtime":"280"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf') # Smallest number so far\n second = float('inf') # Second smallest number so far\n\n for num in nums:\n if num <= first:\n # Update the smallest value\n first = num\n elif num <= second:\n # Update the second smallest value\n second = num\n else:\n # If we find a number greater than both first and second\n return True\n\n return False\n \n \n \n \n \n # [20,100,10,12,5,13]","runtime":"293"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n\n for num in nums:\n if num<=first:\n first=num\n elif num<=second:\n second=num\n else:\n return True\n return False","runtime":"305"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n first = second = float(\"inf\")\n \n for n in nums:\n if n<= first:\n first = n\n elif n<=second:\n second = n\n else:\n return True\n \n return False","runtime":"317"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n #ascending order ==> that means we return true immediately\n #best case\n #descending order ==> worst case\n # [1,2,3,4,5] \n # ^\n # ^\n # ^\n\n #[8, 9, 6, 12, 4]\n # We need to find a subsequence that [[i], [j], [k]] ==?\n #[8,9,6] ===> [8,9, 12] ==> [6]\n # a dp approach\n # nested loop howevr O(n^3), that's not eifficent\n\n # can I run in O(n^2)\n\n # subseq = []\n # for i in range(len(nums)-2):\n # for j in range(i+1, len(nums)-1):\n # if not subseq:\n # if nums[i] < nums[j] & nums[j+1] > num[j]:\n\n # return True\n\n # elif nums[i] < nums[j]:\n # subseq.append(nums[i])\n # i += 1\n\n # else:\n\n if len(nums) < 3:\n\n return False\n\n first = 100000000000\n second = 100000000000\n\n for num in nums:\n\n if num <= first:\n\n first = num # first smallest number\n\n elif num <= second:\n\n second = num #second smallest number\n\n else:\n return True\n\n return False\n\n #[8, 9, 1, 2, 0, 6]\n\n\n","runtime":"329"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n m1 = 9999999999\n m2 = 9999999999\n\n for n in nums:\n if n <= m1:\n m1 = n\n elif n <= m2:\n m2 = n\n else:\n return True\n return False","runtime":"342"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first_num = float(\"inf\")\n second_num = float(\"inf\")\n for n in nums:\n if n <= first_num:\n first_num = n\n elif n <= second_num:\n second_num = n\n else:\n return True\n return False","runtime":"354"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n \n first = float('inf')\n second = float('inf')\n \n for num in nums:\n if num <= first:\n first = num # smallest so far\n elif num <= second:\n second = num # second smallest so far\n else:\n # Found a number greater than 'second', which means\n # we have a triplet (first < second < num)\n return True\n \n return False\n\n","runtime":"366"},{"code":"from typing import List\n\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n \n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n \n return False\n","runtime":"379"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n f = s = float('inf')\n for i in nums:\n if i <= f:\n f = i\n elif i <= s:\n s = i\n else:\n return True\n else:\n return False\n","runtime":"391"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # o(n) time, o(1) space.\n # first, second (smallest and second smallest) - initially infinite\n # first < second, and first must be before second in the list\n first, second = float('inf'), float('inf')\n\n for n in nums:\n if n <= first:\n first = n\n elif n <= second:\n second = n\n else:\n return True\n \n return False","runtime":"403"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for num in nums:\n if num<= first:\n first = num\n elif num<= second:\n second = num\n else :\n return True\n return False\n\n\n \n","runtime":"415"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) <= 2:\n return False\n smaller = smallest = float(\"inf\")\n for num in nums:\n if num <= smallest:\n smallest = num\n elif num <= smaller:\n smaller = num\n else:\n return True\n return False\n","runtime":"428"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n #we try to get first second values as first < second then \n #the next value which appears is the third value\n for n in nums:\n if n <= first:\n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False","runtime":"440"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second =i\n else:\n return True\n return False\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n # for i in range(len(nums)):\n # for j in range(i+1,len(nums)):\n # for k in range(j+1,len(nums)):\n # if nums[i]<nums[j]<nums[k]:\n # return True\n # return False\n\n\n\n\n # for i in range(len(nums)-2):\n # if nums[i]<nums[i+1]<nums[i+2]:\n # return True\n # return False","runtime":"440"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for n in nums:\n if n<=first:\n first=n\n elif n<=second:\n second=n\n else:\n return True\n return False\n ","runtime":"452"},{"code":" # too slow\n # def dp(i: int, prev_max:int, cnt: int) -> bool:\n # if cnt == 3:\n # return True\n # if i == len(nums):\n # return False\n # if nums[i] > prev_max: \n # return dp(i + 1, nums[i], cnt + 1) or dp(i + 1, prev_max, cnt)\n # else:\n # return dp(i + 1, prev_max, cnt)\n \n # return dp(0, -2*10**31 -1, 0)\n\n\n\"\"\"\n20 100 10 12 5 13\n\nmin1 20,10,5\nmin2 100,12\n\"\"\"\n\nimport heapq\n\n\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n # min1 = [nums[0]]\n # min2 = []\n # for n in nums[1:]:\n # if n == min1[0]:\n # continue\n # elif n < min1[0]:\n # heapq.heappush(min1, n)\n # elif min2 == []:\n # min2.append(n)\n # elif n == min2[0]:\n # continue\n # elif n > min2[0]:\n # return True\n # else:\n # heapq.heappush(min2, n)\n # return False\n\n first = second = float('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n \n return False","runtime":"452"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n \n first = float('inf')\n second = float('inf')\n \n for n in nums:\n if n <= first:\n first = n # smallest so far\n elif n <= second:\n second = n # second smallest\n else:\n return True # found a triplet\n \n return False","runtime":"464"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float ('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second: \n second = num \n else : \n return True\n return False","runtime":"464"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n first = float('inf')\n second = float('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n return False","runtime":"477"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n return False","runtime":"489"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False\n","runtime":"501"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else: return True\n return False\n\n ","runtime":"501"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n fir,sec = float('inf'),float(\"inf\")\n \n for i in nums:\n \n if i <= fir:\n fir = i\n continue\n \n if i <= sec:\n sec = i\n \n if i > sec:\n return True\n \n return False\n \n \n \n# # more logical and easiler to follow\n# first, second = float(\"inf\"),float(\"inf\")\n \n# for move in nums:\n# if move <= first:\n# first = move\n# elif move <= second:\n# second = move\n# else:\n# return True\n \n# return False\n \n # order of operation MATTERS\n # has edge case that needs to be looked into (ipad notes)\n \n# first,second = float('inf'),float('inf')\n \n# for move in nums:\n \n# if move > second:\n# return True\n# if move <= first:\n# first = move\n# else:\n# second = move\n \n# return False\n \n \n # Gives TLE\n \n# if len(nums) < 3:\n# return False\n \n# for i in range(len(nums)-2):\n# for j in range(i+1,len(nums)-1):\n# for k in range(j+1,len(nums)):\n# if nums[i] < nums[j] < nums[k]:\n# return True\n \n# return False\n ","runtime":"514"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n first, second = float('inf'), float('inf')\n\n for n in nums:\n if n <= first:\n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False\n ","runtime":"514"},{"code":"'''\n1,2,3,4,5\n1,20,3,4,5\n1,1,2,3,5\n0,0,1,2,3\n 20,1,30,40,2\n\nf 1\ns 30\n'''\n\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n \n return False\n\n\n ","runtime":"526"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n i = j = float('inf')\n for n in nums:\n if n <= i:\n i = n\n elif n <= j:\n j = n\n else:\n return True\n return False","runtime":"526"},{"code":"from collections import defaultdict\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a, b, c = float('inf'), float('inf'), float('inf')\n for n in nums:\n if n <= a:\n a = n\n elif n <= b:\n b = n\n else:\n return True\n return False\n \n \"\"\"\n min_visited = float('inf')\n n = len(nums)\n\n curr = 0\n while curr + 2 < n:\n\n while nums[curr] >= nums[curr+1] or nums[curr] >= min_visited:\n curr += 1\n if curr + 1 == n:\n return False\n\n min_visited = nums[curr]\n new_nums, visited = [], set()\n for i in range(curr + 1, n):\n if nums[i] > min_visited and nums[i] not in visited:\n visited.add(nums[i])\n new_nums.append(nums[i])\n\n m = len(new_nums)\n for i in range(m-1):\n for j in range(i, m):\n if new_nums[i] < new_nums[j]:\n return True\n\n curr += 1\n\n return False\n \"\"\"\n\n \"\"\"\n hmap = defaultdict(list) # The first above after\n for i in range(len(nums)): # O(n^2)\n for j in range(i+1, len(nums)):\n if nums[j] > nums[i]: # Not efficient when nums = [1,2,3,....,n]\n hmap[i].append(j)\n \n for i in range(len(nums)):\n for j in hmap[i]:\n if len(hmap[j]) > 0:\n return True\n\n return False\n \"\"\"","runtime":"538"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') # 初始化为正无穷大\n \n for num in nums:\n if num <= first:\n first = num # 找到第一个最小的数\n elif num <= second:\n second = num # 找到第二个次小的数\n else:\n return True # 找到第三个比second大的数，返回True\n \n return False # 如果遍历完没有找到合适的三元组，返回False\n \n \n \n ","runtime":"538"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n a = float('inf')\n b = float('inf')\n for i in nums:\n if i<=a:\n a = i\n elif i<=b:\n b = i\n else:\n return True\n return False\n \n\n ","runtime":"550"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n m1 = 9999999999\n m2 = 9999999999\n\n for n in nums:\n if n <= m1:\n m1 = n\n elif n <= m2:\n m2 = n\n else:\n return True\n return False","runtime":"550"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf')\n \n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n \n return False","runtime":"563"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n first = float('inf')\n second = float('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True \n\n return False ","runtime":"563"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a, b = float('inf'), float('inf')\n\n for num in nums:\n if num <= a:\n a = num\n elif num <= b:\n b = num\n else:\n return True\n return False\n","runtime":"575"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n smallest = next_smallest = float('inf')\n for num in nums:\n if num <= smallest:\n smallest = num\n elif num <= next_smallest:\n next_smallest = num\n else:\n return True\n return False","runtime":"575"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float(\"inf\")\n second = float(\"inf\")\n \n for i in nums:\n if i <= first: # Find the smallest number\n first = i\n elif i <= second: # Find the second smallest number\n second = i\n else: # If you find a number larger than both first and second, return True\n return True\n \n return False\n","runtime":"587"},{"code":"\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False","runtime":"587"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n if len(nums)<3:\n return False\n for i in nums:\n if i <= first:\n first = i\n elif i <= second:\n second = i\n else:\n return True\n return False\n \n\n\n ","runtime":"599"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float(\"inf\")\n second = float(\"inf\")\n \n for i in nums:\n if i <= first: # Find the smallest number\n first = i\n elif i <= second: # Find the second smallest number\n second = i\n else: # If you find a number larger than both first and second, return True\n return True\n \n return False\n","runtime":"599"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if num <= first:\n first = num \n elif num <= second:\n second = num \n else:\n return True \n \n return False","runtime":"612"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n m1 = 9999999999\n m2 = 9999999999\n\n for n in nums:\n if n <= m1:\n m1 = n\n elif n <= m2:\n m2 = n\n else:\n return True\n return False","runtime":"612"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if num <= first:\n first = num \n elif num <= second:\n second = num \n else:\n return True \n \n return False","runtime":"624"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=float(\"inf\")\n second=float(\"inf\")\n\n for n in nums:\n if n<=first:\n first=n\n elif n<=second:\n second=n\n else:\n return True\n return False\n ","runtime":"624"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else: return True\n return False\n\n ","runtime":"636"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \"\"\"\n Brute force, O(n3)\n\n Iterate i from left to right\n Keep track of first_num and, second_num, \n if the new num is smaller or equal than first_num, point first_num to new\n if the new num is smaller or euqal than second_num, point second_num to new\n if third_num is bigger than second_num, return True\n\n 2, 5, 1, 6, 8\n first_num 1\n second_num 5\n\n 1, 2, 3, 4, 5\n first_num 1\n second_num 2\n\n 5,4,3,2,1\n first_num 1\n second_num None\n \"\"\"\n\n first_num = float(\"inf\")\n second_num = float(\"inf\")\n\n for num in nums:\n if num < first_num:\n first_num = num\n elif num > first_num and num < second_num:\n second_num = num\n elif num > second_num:\n return True\n\n return False","runtime":"636"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n #Not all my idea\n first = float('inf')\n sec = float('inf')\n\n #Done in a single pass\n for num in nums:\n if num <= first:\n first = num\n elif num <= sec:\n sec = num\n else:\n return True\n\n \n\n\n return False\n ","runtime":"649"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a = b = float('inf')\n for i in nums:\n if i <= a:\n a = i\n elif i <= b:\n b = i\n else:\n return True\n return False","runtime":"649"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n first = float('inf') # The smallest value seen so far\n second = float('inf') # The second smallest value seen so far\n\n for num in nums:\n if num <= first:\n # Update first if current num is smaller or equal\n first = num\n elif num <= second:\n # Update second if current num is smaller or equal to second but greater than first\n second = num\n else:\n # If we find a num greater than second, we have a valid increasing subsequence\n return True\n\n return False","runtime":"661"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for n in nums:\n if n<=first:\n first=n\n elif n<=second:\n second=n\n else:\n return True\n return False","runtime":"661"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n first = second = float('inf')\n\n for n in nums:\n if n <= first:\n first = n\n\n elif n <= second:\n second = n\n\n else:\n return True\n\n return False\n\"\"\"\nThis is the output\n\nThe logic behind is that we should find the third element that is bigger that second\nand second is bigger than first, if it encounters any number that is bigger than second it \nreturn TRUE\n\nFirst Iteration:\n 1\n first\n inf\n\nSecond Iteration:\n 2\n second\n inf\n\nThird Iteration:\n3\n\"\"\"","runtime":"673"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf')\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else:\n return True\n return False ","runtime":"673"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n third = float('inf')\n #we try to get first second values as first < second then \n #the next value which appears is the third value\n for n in nums:\n if n <= first:\n first = n\n elif n <= second:\n second = n\n elif n<= third:\n third = n\n print(first, second, third) \n return first < second < third and first != float('inf') and second != float('inf') and third != float('inf')","runtime":"685"},{"code":"class Solution:\n # initialize i\n # once something is larger than i, that is j\n # now if a smaller i is found, set i\n # what about j?\n # this is fine, because anything larger than j is still valid, what i and j mean don't really matter\n def increasingTriplet(self, nums: List[int]) -> bool:\n i = 2**31\n j = i\n\n for num in nums:\n if num <= i:\n i = num\n elif num <= j:\n j = num\n else:\n return True\n\n return False\n\n\n ","runtime":"685"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if num <= first:\n first = num \n elif num <= second:\n second = num \n else:\n return True \n \n return False","runtime":"698"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else: return True\n return False\n\n ","runtime":"698"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n smallest = max(nums)\n secondSmallest = max(nums)\n for num in nums:\n if (num <= smallest): \n smallest = num \n elif (num <= secondSmallest) : \n secondSmallest = num \n else: \n return True\n return False\n\n ","runtime":"710"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # 1st obs: iterate through the array\n # find nums[i] < nums[i-1] > I know to have to reset\n # >> save last\n # >> save occurrences of valid condition being met\n # = [3, 5, 1, 0, 1, 2, 0]\n # i = None, last = 3, counter = 1\n # >i = 1, nums[i] > last ? last 5, counter = 2\n # >i = 2, nums[i] > last ? last 1, counter = 1\n # >i = 3, nums[i] > last ? last 0, counter = 1\n # >i = 4 ... i = 5 counter == 3? return true\n # The complexity is that they are not necessarily beside each other\n # non-contiguous\n\n # -> sort? apply this logic\n # -> guarantee O(log n) + O(N) ~ O(log n)\n\n # -> [0 1, 2, 3, 4, 5, 6] = idx\n # -> [3, 5, 1, 0, 1, 0, 8]\n # -> | |\n # -> > |X, \n smaller, second = float('inf'), float('inf')\n\n for i in range(len(nums)):\n if nums[i] <= smaller:\n smaller = nums[i]\n elif nums[i] <= second:\n second = nums[i]\n else:\n return True\n return False","runtime":"710"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # 初始化两个变量，分别存储递增序列的前两个最小值\n first = second = float('inf')\n\n # 遍历数组中的每个元素\n for num in nums:\n # 如果当前元素小于等于 first，更新 first 为当前元素\n if num <= first:\n first = num\n # 否则，如果当前元素小于等于 second，更新 second 为当前元素\n elif num <= second:\n second = num\n # 否则，说明找到了一个比 second 大的第三个数，返回 True\n else:\n return True\n\n # 如果遍历完成后没有找到符合条件的三元子序列，返回 False\n return False\n ","runtime":"747"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False ","runtime":"747"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float(inf)\n second = float(inf)\n for i in range(len(nums)):\n if nums[i]<=first:\n first= nums[i]\n elif nums[i]<=second:\n second= nums[i]\n elif nums[i]>second:\n return True\n return False\n ","runtime":"759"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n \n for num in nums:\n if num <= first:\n first = num # Update the first smallest\n elif num <= second:\n second = num # Update the second smallest\n else:\n # We found a number greater than both 'first' and 'second'\n return True\n \n return False","runtime":"759"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n=len(nums)\n first=float('inf')\n second=float('inf')\n\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else:\n return True\n \n return False\n ","runtime":"771"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False","runtime":"771"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n if n<3:\n return False\n a = b = float('inf')\n for i in nums:\n if i<=a:\n a = i\n elif i<=b:\n b = i\n else:\n return True\n return False\n \n\n ","runtime":"784"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float(inf)\n\n for num in nums:\n if num <=first:\n first = num\n elif num <=second:\n second = num\n else:\n return True\n return False\n ","runtime":"784"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n a = b = float('inf')\n for i in nums:\n if i<=a:\n a = i\n elif i<=b:\n b = i\n else:\n return True\n return False\n \n\n ","runtime":"796"},{"code":"\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False","runtime":"796"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a = b = float('inf')\n for i in range(len(nums)):\n if nums[i] <= a:\n a = nums[i]\n elif nums[i] <= b:\n b = nums[i]\n elif nums[i] > a and nums[i] > b:\n return True\n\n return False\n ","runtime":"808"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else: return True\n return False\n\n ","runtime":"808"},{"code":"\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # keep track the smallest & the second smallest\n f = float(inf)\n s = float(inf)\n for i in nums :\n if i < f :\n f = i \n elif i > f and i < s :\n s = i\n elif i > f and i > s :\n return True\n \n return False\n \n \n'''\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n arr = [nums[0]]\n\n for i in range(1, len(nums)):\n idx = bisect.bisect_left(arr, nums[i])\n if idx >= len(arr):\n arr.append(nums[i])\n else :\n arr[idx] = nums[i]\n if len(arr) >= 3 :\n return True\n\n return False \n'''","runtime":"820"},{"code":"from collections import OrderedDict\n\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n mums=list(OrderedDict.fromkeys(nums))\n if (nums[:len(mums)] != mums and sum(nums)/len(nums)==sum(mums)/len(mums)): return False\n for i in nums:\n if i<=first:\n first=i\n elif i<=second:\n second=i\n else: return True\n return False\n\n ","runtime":"820"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n num1 = float(\"inf\")\n num2 = float(\"inf\")\n for num in nums: # 3 4 2 5\n # the main thing we want to determine is that\n # if there are 2 numbers > num.\n # the order of num1 and num2 don't matter\n if num1 >= num:\n num1 = num\n elif num2 >= num:\n num2 = num\n else:\n return True\n return False","runtime":"833"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n lenght = len(nums)\n if lenght < 3:\n return False\n first = second = (2**31)-1\n for i in range(0,lenght):\n if nums[i] <= first:\n first = nums[i]\n elif nums[i] <= second:\n second = nums[i]\n else:\n return True\n\n return False","runtime":"833"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = None\n second = None\n third = None\n for i in range(len(nums)):\n # print(first, second, third)\n \n if first==None:\n first = nums[i]\n continue\n else:\n # print(nums[i])\n if first > nums[i]:\n first = nums[i]\n # second = None\n # third = None\n continue\n\n if second==None:\n if first<nums[i]:\n second = nums[i]\n continue\n else:\n if second > nums[i] and first < nums[i]:\n second = nums[i]\n # third = None\n continue\n\n if third==None:\n if second < nums[i]:\n third = nums[i]\n return True\n # else:\n # if third > nums[i]:\n # third = nums[i]\n # return True \n\n return first and second and third\n\n \n \n ","runtime":"845"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n\n for num in nums:\n if num <= first:\n first = num\n elif num <= second:\n second = num\n else:\n return True\n return False\n\n ","runtime":"845"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n n_i = math.inf\n n_j = math.inf\n\n for n in nums:\n if n < n_i:\n n_i = n\n elif n_i < n < n_j:\n n_j = n\n elif n_i < n_j < n:\n return True \n \n return False\n\n\n","runtime":"857"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) <= 2:\n return False\n else:\n first_smallest = float('inf')\n second_smallest = float('inf')\n for i in range(len(nums)):\n if nums[i] < first_smallest:\n first_smallest = nums[i]\n elif nums[i] > first_smallest and nums[i] < second_smallest:\n second_smallest = nums[i]\n elif nums[i] > second_smallest:\n return True\n\n ","runtime":"857"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n firstNum, secondNum, i = 2**32, 2**32, 0\n while i < len(nums):\n if nums[i] <= firstNum:\n firstNum = nums[i]\n\n if nums[i] <= secondNum and nums[i] > firstNum:\n secondNum = nums[i]\n\n if nums[i] > firstNum and nums[i] > secondNum:\n return True\n \n i += 1;\n\n return False\n","runtime":"870"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a = float('inf')\n b = float(\"inf\")\n for n in nums:\n a = min(a, n)\n if a < n < b:\n b = n\n\n if a < b < n: return True\n\n return False\n\n \n\n\n ","runtime":"870"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n Min, Mid = float('inf'), float('inf')\n\n for i in nums:\n if i > Mid:\n return True\n if i > Min:\n Mid = min(i, Mid)\n Min = min(i, Min)\n \n return False\n","runtime":"882"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n smallestFromFront = nums.copy()\n largestFromRear = nums.copy()\n\n smallest = nums[0]\n for i in range(1, len(nums)):\n if nums[i] < smallest:\n smallest = nums[i]\n smallestFromFront[i] = smallest\n\n largest = nums[len(nums) - 1]\n for i in range(len(nums) - 2, -1, -1):\n if nums[i] > largest:\n largest = nums[i]\n largestFromRear[i] = largest\n\n for i in range(1, len(nums) - 1):\n if nums[i] > smallestFromFront[i] and nums[i] < largestFromRear[i]:\n return True\n\n return False","runtime":"882"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n rolling_indicies = [0]\n backup_indicies = []\n \n for idx in range(1, len(nums)):\n if nums[idx] > nums[rolling_indicies[-1]]: \n rolling_indicies.append(idx)\n if len(rolling_indicies) == 3 or (len(backup_indicies) > 0 and nums[idx] > nums[backup_indicies[-1]]):\n return True\n elif len(rolling_indicies) == 1:\n rolling_indicies = [idx]\n elif len(rolling_indicies) == 2:\n backup_indicies = rolling_indicies\n if nums[idx] > nums[rolling_indicies[0]]:\n rolling_indicies[-1] = idx\n else:\n rolling_indicies = [idx]\n \n return False","runtime":"894"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n res = [nums[0]]\n for i in range(1, len(nums)):\n if nums[i] > res[-1]:\n res.append(nums[i])\n if len(res) >= 3:\n return True\n else:\n for j in range(len(res)):\n if nums[i] <= res[j]:\n res[j] = nums[i]\n break\n return False\n","runtime":"894"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n c = float('inf')\n s = nums[0]\n\n for i in range(1, len(nums)):\n if nums[i] > c:\n return True\n if s < nums[i]:\n c = min(c, nums[i])\n s = min(s, nums[i])\n return False","runtime":"906"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \"\"\"\n Stack\n \n - Scan from left to right\n - Maintain two component, one is the smallest element, another one is the smallest increasing pair\n \"\"\"\n\n smallest_num = None\n smallest_pair = None\n\n for num in nums:\n \n # Update the smallest pair\n if smallest_pair is None:\n # Add one value\n smallest_pair = [num]\n elif len(smallest_pair) == 1:\n # Add one value if increases\n if num > smallest_pair[-1]:\n smallest_pair.append(num)\n\n # Can we update it?\n if num < smallest_pair[-1]:\n smallest_pair[-1] = num\n else:\n # Did we find a triplet?\n if num > smallest_pair[-1]:\n return True\n \n # Can we update it?\n if min(smallest_num, smallest_pair[0]) < num < smallest_pair[1]:\n smallest_pair = [\n min(smallest_num, smallest_pair[0]),\n num\n ]\n \n # Update the smallest element\n if smallest_num is None:\n smallest_num = num\n smallest_num = min(smallest_num, num)\n\n return False\n \n ","runtime":"906"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if(len(nums) == 0):\n return False\n arr1 = [True for t in nums]\n arr2 = [True for t in nums]\n arr1[0] = False\n arr2[0] = False\n arr1[len(nums)-1]= False\n arr2[len(nums)-1] = False\n minx = nums[0]\n maxy = nums[len(nums)-1]\n for p1 in range(1,len(nums)-1):\n num = nums[p1]\n othernum = nums[len(nums)-1 - p1] \n if(num<= minx):\n arr1[p1] = False\n minx = num\n if(othernum >= maxy):\n arr2[len(nums)-1-p1] = False\n maxy = othernum\n both = [arr1[i] and arr2[i] for i in range(len(arr1))]\n for t in both:\n if(t):\n return True\n\n return False \n\n \n\n \n return False \n \n\n \n ","runtime":"919"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \"\"\"\n Stack\n \n - Scan from left to right\n - Maintain two component, one is the smallest element, another one is the smallest increasing pair\n \"\"\"\n\n smallest_num = None\n smallest_pair = None\n\n for num in nums:\n \n # Update the smallest pair\n if smallest_pair is None:\n # Add one value\n smallest_pair = [num]\n elif len(smallest_pair) == 1:\n # Add one value if increases\n if num > smallest_pair[-1]:\n smallest_pair.append(num)\n\n # Can we update it?\n if num < smallest_pair[-1]:\n smallest_pair[-1] = num\n else:\n # Did we find a triplet?\n if num > smallest_pair[-1]:\n return True\n \n # Can we update it?\n if min(smallest_num, smallest_pair[0]) < num < smallest_pair[1]:\n smallest_pair = [\n min(smallest_num, smallest_pair[0]),\n num\n ]\n \n # Update the smallest element\n if smallest_num is None:\n smallest_num = num\n smallest_num = min(smallest_num, num)\n\n return False\n \n ","runtime":"919"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n \n i, j, k = 0, 1, 2\n l, m, r = nums[0], nums[1], nums[2]\n\n if l < m < r:\n return True\n print(l, m, r)\n\n while k < len(nums):\n \n r = nums[k]\n l = min(l, nums[i])\n # temp = max(nums[j], l)\n # if (nums[j] > l and nums[j] < r):\n if (nums[j] > l):\n m = nums[j]\n # elif nums[j] > m:\n # m = nums[j]\n if l < m < r:\n print(l, m, r)\n return True\n\n k += 1\n j += 1\n i += 1\n # print(l, m, r)\n # print(l, m, r)\n return False\n ","runtime":"931"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n min_arr, max_arr = [nums[0]], [nums[len(nums)-1]]\n\n for left in range(1, len(nums)):\n n_left = nums[left]\n n_right = nums[len(nums)-1-left]\n\n min_v, max_v = min_arr[-1], max_arr[-1]\n\n if n_left < min_v:\n min_v = n_left\n\n if n_right > max_v:\n max_v = n_right\n\n min_arr.append(min_v)\n max_arr.append(max_v)\n\n max_arr = max_arr[::-1]\n\n for i,n in enumerate(nums):\n if min_arr[i] < n < max_arr[i]:\n return True\n\n return False\n\n\n \n ","runtime":"931"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n if n < 3:\n return False\n\n if n == 3:\n return (nums[0] < nums[1]) and (nums[1] < nums[2])\n\n minTo = []\n currMin = nums[0]\n for num in nums:\n currMin = min(num, currMin)\n minTo.append(currMin)\n\n maxFrom = []\n currMax = nums[-1]\n for num in nums[::-1]:\n currMax = max(num, currMax)\n maxFrom.append(currMax)\n # maxFrom = [currMax] + maxFrom\n \n for i in range(n):\n # if minTo[i] < nums[i] and nums[i] < maxFrom[i]:\n if minTo[i] < nums[i] and nums[i] < maxFrom[n - i - 1]:\n return True\n\n return False\n\n","runtime":"943"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n # n = len(nums)\n # if n<3:\n # return False\n\n # for i in range(1,n-1):\n # # print(nums[i])\n # if min(nums[:i])<nums[i]<max(nums[i+1:]):\n # return True\n # if i==n-2:\n # if min(nums[:i])<nums[i]<nums[-1]:\n # return True\n\n # return False\n if len(nums) < 2:\n return False\n\n min_arr = []\n for num in nums:\n if min_arr and num > min_arr[-1]:\n min_arr.append(min_arr[-1])\n else:\n min_arr.append(num)\n\n max_arr = []\n for num in nums[::-1]:\n if max_arr and num < max_arr[-1]:\n max_arr.append(max_arr[-1])\n else:\n max_arr.append(num)\n max_arr = max_arr[::-1]\n\n for i in range(1, len(nums) - 1):\n if min_arr[i] < nums[i] < max_arr[i]:\n return True\n\n return False","runtime":"943"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n max_num = [float(\"-inf\")] * (len(nums) + 1)\n for i in range(len(nums)-1, -1, -1):\n max_num[i] = max(nums[i], max_num[i+1])\n \n smallest = nums[0]\n for i in range(1, len(nums)):\n if smallest < nums[i] and nums[i] < max_num[i]:\n return True\n elif smallest > nums[i]:\n smallest = nums[i]\n return False\n","runtime":"955"},{"code":"import numpy as np \nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n first = np.inf\n second = np.inf \n for num in nums:\n if num <= first:\n first = num \n elif num <= second: # bigger than first, smaller than second\n second = num \n else:\n if first < second and num > second:\n return True \n return False \n","runtime":"955"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n size=len(nums)\n mini=[0]*size\n maxi=[0]*size\n mx=float('inf')\n mn=float('-inf')\n for i in range(size):\n mx=min(mx,nums[i])\n mini[i]=mx\n for j in range(size-1,-1,-1):\n mn=max(mn,nums[j])\n maxi[j]=mn\n for i in range(size):\n if mini[i]<nums[i] and nums[i]<maxi[i]:\n return True\n return False","runtime":"968"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n# sorted_nums = nums.sort()\n# index_list = [0] * len(nums)\n# for i in range(len(nums)):\n# index_list[i] = sorted_nums.index(nums[i])\n n = len(nums)\n max_num = [0]*n\n max_num[-1] = nums[-1]\n for i in range(n-2,-1,-1):\n max_num[i] = max(max_num[i+1],nums[i])\n \n min_num = nums[0]\n for i in range(0,n-1):\n if min_num < nums[i] < max_num[i]:\n return True\n min_num = min(nums[i],min_num)\n return False","runtime":"968"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3: return False\n \n minArray, maxArray = [], []\n minGlobal, maxGlobal = float('inf'), -float('inf')\n \n for num in nums:\n minGlobal = min(minGlobal, num)\n minArray.append(minGlobal)\n for num in reversed(nums):\n maxGlobal = max(maxGlobal, num)\n maxArray.append(maxGlobal)\n maxArray.reverse()\n \n for i in range(1, len(nums)-1):\n if minArray[i] < nums[i] and nums[i] < maxArray[i]: return True\n return False","runtime":"980"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n maxes_from_right = [nums[-1]] * n\n for i in range(n - 1)[::-1]:\n maxes_from_right[i] = max(nums[i], maxes_from_right[i+1])\n\n curr_min = nums[0]\n for i in range(1, n - 1):\n if curr_min < nums[i] < maxes_from_right[i+1]:\n return True\n curr_min = min(curr_min, nums[i])\n return False\n","runtime":"980"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n \n first = float('inf')\n second = float('inf')\n \n for n in nums:\n print(n)\n if n <= first:\n first = n # smallest so far\n elif n <= second:\n second = n # second smallest\n else:\n return True # found a triplet\n \n return False","runtime":"992"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n post_max = [0] * n\n mx = -math.inf\n for i in range(n-1, -1, -1):\n mx = max(mx, nums[i])\n post_max[i] = mx\n \n smallest_so_far = nums[0]\n \n for j in range(1, n-1):\n left = smallest_so_far\n middle = nums[j]\n right = post_max[j+1]\n \n \n if left < middle and middle < right:\n return True\n \n smallest_so_far = min(smallest_so_far, nums[j])\n \n return False\n","runtime":"992"},{"code":"import math\nimport sys\n\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n\n low = max(nums)\n _max = n * [-(1 << 32)]\n\n for i in range(1, n):\n _max[n-i-1] = max(_max[n-i], nums[n-i])\n\n for i in range(n):\n if low < nums[i] < _max[i]: return True\n low = min(low, nums[i])\n \n return False","runtime":"1005"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n lowest = [float(inf)]\n for i in range(1, len(nums)):\n lowest.append(min(nums[i-1], lowest[-1]))\n highest = [float(-inf)]\n for j in range(len(nums)-2, -1, -1):\n highest.append(max(nums[j+1], highest[-1]))\n highest.reverse()\n for i in range(0, len(nums)):\n if highest[i] > nums[i] and nums[i] > lowest[i]:\n return True\n return False\n ","runtime":"1005"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n # 7, 8, 2, 0, 2\n\n currentLongest = [nums[0]]\n currentMin = [nums[0]]\n\n for i in range(1, len(nums)):\n num = nums[i]\n if num > currentLongest[-1]:\n currentLongest.append(num)\n if len(currentLongest) >= 3:\n return True\n elif num > currentLongest[0] and num < currentLongest[-1]:\n currentLongest = [currentLongest[0], num]\n \n\n if num > currentMin[-1]:\n currentMin.append(num)\n elif num < currentMin[0]:\n currentMin = [num]\n elif num > currentMin[0] and num < currentMin[-1]:\n currentMin = [currentMin[0], num]\n\n if len(currentMin) >= len(currentLongest):\n currentLongest = [x for x in currentMin]\n\n\n \n return False\n\n\n","runtime":"1017"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums)<3:\n return False\n minArr = [0] * len(nums)\n maxArr = [0] * len(nums)\n # print(minArr)\n minimum = nums[0]\n maximum = nums[len(nums)-1]\n for i in range(0,len(nums)):\n minArr[i]=minimum\n minimum = min(minimum,nums[i])\n for i in range(len(nums)-1,-1,-1):\n maxArr[i] = maximum\n maximum = max(maximum,nums[i]) \n\n for i in range(1,len(nums)):\n if minArr[i]<nums[i]<maxArr[i]:\n return True\n return False \n\n \n\n ","runtime":"1017"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n lowest_to_left = [None] * len(nums)\n highest_to_right = [None] * len(nums)\n\n lowest = nums[0]\n for i in range(1, len(nums)):\n lowest_to_left[i] = lowest\n lowest = min(lowest, nums[i])\n \n highest = nums[-1]\n for i in range(len(nums)-2, -1, -1):\n highest_to_right[i] = highest\n highest = max(highest, nums[i])\n \n for i in range(len(nums)):\n current_num = nums[i]\n if lowest_to_left[i] is None or highest_to_right[i] is None:\n continue\n \n if lowest_to_left[i] < current_num and highest_to_right[i] > current_num:\n return True\n \n return False\n\n\n ","runtime":"1029"},{"code":"import math\nimport sys\n\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n\n low = 1 << 32\n _max = n * [-(1 << 32)]\n\n for i in range(1, n):\n _max[n-i-1] = max(_max[n-i], nums[n-i])\n\n for i in range(n):\n if low < nums[i] < _max[i]: return True\n low = min(low, nums[i])\n \n return False","runtime":"1029"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n mins = [nums[0]] * n\n maxs = [nums[-1]] * n\n\n\n for i, n in enumerate(nums[1:], 1):\n mins[i] = min(n, mins[i-1]) \n\n for i, n in enumerate(nums[::-1][1:], 1):\n maxs[i] = max(n, maxs[i-1]) \n\n maxs = maxs[::-1]\n\n for n, low, high in zip(nums, mins, maxs):\n if low< n< high:\n return True\n return False","runtime":"1041"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n left_min = [0] * len(nums)\n right_max = [0] * len(nums)\n\n left_min[0] = float(\"inf\")\n for i in range(1, len(nums)):\n left_min[i] = min(left_min[i-1], nums[i-1])\n\n right_max[-1] = float(\"-inf\")\n for i in range(len(nums)-2, -1, -1):\n right_max[i] = max(right_max[i+1], nums[i+1])\n\n\n for i in range(len(nums)):\n if nums[i] > left_min[i] and nums[i] < right_max[i]:\n return True\n\n return False\n\n # small = nums[0]\n # med = nums[0]\n # large = nums[0]\n\n # for i in range(1, len(nums)-1):\n\n # small = min(small, nums[i])\n # med = max(med, nums[i])\n # large = nums[i+1]\n\n # if small < med and med < large:\n # return True\n\n # return False","runtime":"1041"}],"string":"[\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n f = float('inf')\\n s = float('inf')\\n\\n for num in nums:\\n if num <= f:\\n f = num\\n elif num <= s:\\n s = num\\n else:\\n return True\\n \\n return False\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) <= 2: return False\\n first, second = float(inf), float(inf)\\n for i in nums:\\n if i <= first:\\n first = i\\n elif i <= second:\\n second = i\\n else:\\n return True\\n return False\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a,b=float(inf),float(inf)\\n for i in nums:\\n if i<=a:\\n a=i\\n elif i<=b:\\n b=i\\n else:\\n return True\\n return False\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\\n\\n\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums)<3:\\n return False\\n f,s=float('inf'),float('inf') \\n for i in nums:\\n if i<=f:f=i\\n elif i<=s:s=i\\n else:return True\\n return False \\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit() \",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums)<3:\\n return False\\n fmin=float('inf')\\n smin=float('inf')\\n\\n for n in nums:\\n if n<=fmin:\\n fmin=n\\n elif n<=smin:\\n smin=n\\n else:\\n return True\\n return False\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit() \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n s = float('inf')\\n l = float('inf')\\n\\n for x in nums:\\n if x <= s:\\n s = x\\n elif x <= l:\\n l = x\\n elif x > l:\\n return True\\n return False\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\\n\\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n res = []\\n for num in nums:\\n for i in range(len(res)):\\n if num <= res[i]:\\n res[i] = num\\n break\\n else:\\n res.append(num)\\n return len(res) > 2\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n res = []\\n for num in nums:\\n for i in range(len(res)):\\n if num <= res[i]:\\n res[i] = num\\n break\\n else:\\n res.append(num)\\n return len(res) > 2\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit() \\n \\n\\n\\n\\n\\n \\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n min_till = [700000] * n\\n min_till[0] = nums[0]\\n for i in range(1,n):\\n min_till[i] = min(min_till[i-1], nums[i])\\n for i in range(n-2,0,-1):\\n if nums[i]>min_till[i] and nums[i]<nums[i+1]:\\n return True\\n nums[i] = max(nums[i],nums[i+1])\\n return False\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit() \\n\\n\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n left = [False] * n\\n right = [False] * n\\n mi = float('inf')\\n ma = float('-inf')\\n\\n for i in range(1, n):\\n mi = min(mi, nums[i - 1])\\n if nums[i] > mi:\\n left[i] = True\\n\\n for i in range(n - 2, -1, -1):\\n ma = max(ma, nums[i + 1])\\n if nums[i] < ma:\\n right[i] = True\\n\\n for i in range(1, n - 1):\\n if left[i] and right[i]:\\n return 'true'\\n\\n return 'false'\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().increasingTriplet(nums),file=f)\\nexit(0)\\n\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n minL = [math.inf] * len(nums)\\n maxR = [-1 * math.inf] * len(nums)\\n for i in range(1, len(nums)):\\n minL[i] = min(minL[i-1], nums[i-1])\\n inv_i = len(nums) - i - 1\\n maxR[inv_i] = max(maxR[inv_i + 1], nums[inv_i+1])\\n for i in range(1, len(nums)-1):\\n if minL[i] < nums[i] and maxR[i] > nums[i]:\\n return True\\n return False\\n\\n\\ndef main():\\n input_data = sys.stdin.read().strip()\\n test_cases = input_data.split('\\\\n')\\n results = []\\n \\n for i in range(0, len(test_cases), 1):\\n nums = json.loads(test_cases[i])\\n results.append(Solution().increasingTriplet(nums))\\n \\n with open('user.out', 'w') as f:\\n for result in results:\\n f.write(f\\\"{str(result).lower()}\\\\n\\\")\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n exit(0)\",\n \"runtime\": \"158\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n minL = [math.inf] * len(nums)\\n maxR = [-1 * math.inf] * len(nums)\\n for i in range(1, len(nums)):\\n minL[i] = min(minL[i-1], nums[i-1])\\n inv_i = len(nums) - i - 1\\n maxR[inv_i] = max(maxR[inv_i + 1], nums[inv_i+1])\\n for i in range(1, len(nums)-1):\\n if minL[i] < nums[i] and maxR[i] > nums[i]:\\n return True\\n return False\\n\\n\\ndef main():\\n input_data = sys.stdin.read().strip()\\n test_cases = input_data.split('\\\\n')\\n results = []\\n \\n for i in range(0, len(test_cases), 1):\\n nums = json.loads(test_cases[i])\\n results.append(Solution().increasingTriplet(nums))\\n \\n with open('user.out', 'w') as f:\\n for result in results:\\n f.write(f\\\"{str(result).lower()}\\\\n\\\")\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n exit(0)\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"import itertools\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # i=0\\n # j=1\\n # k=2\\n # while k<len(nums):\\n # if nums[i]<nums[j]<nums[k]:\\n # return True\\n # else:\\n # i+=1\\n # j+=1\\n # k+=1\\n # return False\\n\\n\\n # comb=itertools.combinations(nums,3)\\n # for i in comb:\\n # if i[0]<i[1]<i[2]:\\n # return True\\n # return False\\n\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"182\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n min_num = max_num = float('inf')\\n\\n for n in nums:\\n if n <= min_num:\\n min_num = n\\n elif n <= max_num:\\n max_num = n\\n else:\\n return True\\n\\n return False\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n '''\\n len1_index = 0\\n len2_indices = [0, None]\\n for i in range(1, len(nums)):\\n if len2_indices[1] and nums[i] > nums[len2_indices[1]]:\\n return (len2_indices[0], len2_indices[1], i)\\n if nums[i] < nums[len1_index]:\\n len1_index = i\\n\\n if nums[i] > nums[len1_index]:\\n if not len2_indices[1] or nums[i] < nums[len2_indices[1]]:\\n len2_indices[0] = len1_index\\n len2_indices[1] = i\\n\\n return False\\n '''\\n len1_min = float(\\\"inf\\\")\\n len2_min = float(\\\"inf\\\")\\n for n in nums:\\n if n <= len1_min:\\n len1_min = n\\n elif n <= len2_min:\\n len2_min = n\\n else:\\n return True\\n return False\\n\\n \\n \\n \\n \\n \",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # Initialize the smallest and second smallest numbers\\n first_num = second_num = float('inf')\\n \\n for num in nums:\\n if num <= first_num:\\n first_num = num\\n elif num <= second_num:\\n second_num = num\\n else:\\n # We have found a number greater than both first_num and second_num\\n return True\\n \\n return False\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.increasingTriplet([1, 2, 3, 4, 5])) # Output: True\\nprint(solution.increasingTriplet([5, 4, 3, 2, 1])) # Output: False\\nprint(solution.increasingTriplet([2, 1, 5, 0, 4, 6])) # Output: True\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n return False\",\n \"runtime\": \"243\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n# We are to ingest nums, and in order, observe for the occurance of a window len 3, in which each index is ascending, and their values are also ascending.\\n\\n # We need float inf to ensure no numbers from our nums will exceed our pointers \\n first_num = float(\\\"inf\\\")\\n second_num = float(\\\"inf\\\")\\n for n in nums:\\n # Since first_num initially is + infiniti, this condition will always hit \\n if n <= first_num:\\n first_num = n\\n elif n <= second_num:\\n second_num = n\\n else:\\n # This gives us the correct answer as it confirms an increasing triplet \\n return True\\n return False\\n\\n# This will consume linear time, but use constant space as we only need auxilary for our pointers \\n# So first pass with this input: 1,2,3,4\\n# - first_num gets set to 1, second num is pos infinit.\\n# - now second_num gets set to 2\\n# - 3 is not < 2 or 1, so we return true\\n\\n# if it were an input with gaps for example: 1,2,1,3,4\\n# - first_num gets set to 1\\n# - second_num gets set to 2\\n# - we pass through for nums[2] this doesn't meet any criteria for computation so enter back into loop again for nums[3] which is 3, this is > than first_num and second_num so return true.\\n\\n# -however if it was 1,2,1,1 for example, we'd have first num 1, second num 2, then we'd finish the loop without meeting the final condition and would exit the loop returning false\",\n \"runtime\": \"256\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n return False\\n\\n \",\n \"runtime\": \"268\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first_small_num, second_small_num = float(\\\"inf\\\"), float(\\\"inf\\\")\\n for i in nums:\\n if i <= first_small_num:\\n first_small_num = i\\n elif i <= second_small_num:\\n second_small_num = i\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"280\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf') # Smallest number so far\\n second = float('inf') # Second smallest number so far\\n\\n for num in nums:\\n if num <= first:\\n # Update the smallest value\\n first = num\\n elif num <= second:\\n # Update the second smallest value\\n second = num\\n else:\\n # If we find a number greater than both first and second\\n return True\\n\\n return False\\n \\n \\n \\n \\n \\n # [20,100,10,12,5,13]\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n\\n for num in nums:\\n if num<=first:\\n first=num\\n elif num<=second:\\n second=num\\n else:\\n return True\\n return False\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n first = second = float(\\\"inf\\\")\\n \\n for n in nums:\\n if n<= first:\\n first = n\\n elif n<=second:\\n second = n\\n else:\\n return True\\n \\n return False\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n #ascending order ==> that means we return true immediately\\n #best case\\n #descending order ==> worst case\\n # [1,2,3,4,5] \\n # ^\\n # ^\\n # ^\\n\\n #[8, 9, 6, 12, 4]\\n # We need to find a subsequence that [[i], [j], [k]] ==?\\n #[8,9,6] ===> [8,9, 12] ==> [6]\\n # a dp approach\\n # nested loop howevr O(n^3), that's not eifficent\\n\\n # can I run in O(n^2)\\n\\n # subseq = []\\n # for i in range(len(nums)-2):\\n # for j in range(i+1, len(nums)-1):\\n # if not subseq:\\n # if nums[i] < nums[j] & nums[j+1] > num[j]:\\n\\n # return True\\n\\n # elif nums[i] < nums[j]:\\n # subseq.append(nums[i])\\n # i += 1\\n\\n # else:\\n\\n if len(nums) < 3:\\n\\n return False\\n\\n first = 100000000000\\n second = 100000000000\\n\\n for num in nums:\\n\\n if num <= first:\\n\\n first = num # first smallest number\\n\\n elif num <= second:\\n\\n second = num #second smallest number\\n\\n else:\\n return True\\n\\n return False\\n\\n #[8, 9, 1, 2, 0, 6]\\n\\n\\n\",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n m1 = 9999999999\\n m2 = 9999999999\\n\\n for n in nums:\\n if n <= m1:\\n m1 = n\\n elif n <= m2:\\n m2 = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"342\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first_num = float(\\\"inf\\\")\\n second_num = float(\\\"inf\\\")\\n for n in nums:\\n if n <= first_num:\\n first_num = n\\n elif n <= second_num:\\n second_num = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"354\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n \\n first = float('inf')\\n second = float('inf')\\n \\n for num in nums:\\n if num <= first:\\n first = num # smallest so far\\n elif num <= second:\\n second = num # second smallest so far\\n else:\\n # Found a number greater than 'second', which means\\n # we have a triplet (first < second < num)\\n return True\\n \\n return False\\n\\n\",\n \"runtime\": \"366\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n \\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n \\n return False\\n\",\n \"runtime\": \"379\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n f = s = float('inf')\\n for i in nums:\\n if i <= f:\\n f = i\\n elif i <= s:\\n s = i\\n else:\\n return True\\n else:\\n return False\\n\",\n \"runtime\": \"391\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # o(n) time, o(1) space.\\n # first, second (smallest and second smallest) - initially infinite\\n # first < second, and first must be before second in the list\\n first, second = float('inf'), float('inf')\\n\\n for n in nums:\\n if n <= first:\\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n \\n return False\",\n \"runtime\": \"403\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for num in nums:\\n if num<= first:\\n first = num\\n elif num<= second:\\n second = num\\n else :\\n return True\\n return False\\n\\n\\n \\n\",\n \"runtime\": \"415\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) <= 2:\\n return False\\n smaller = smallest = float(\\\"inf\\\")\\n for num in nums:\\n if num <= smallest:\\n smallest = num\\n elif num <= smaller:\\n smaller = num\\n else:\\n return True\\n return False\\n\",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n #we try to get first second values as first < second then \\n #the next value which appears is the third value\\n for n in nums:\\n if n <= first:\\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"440\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second =i\\n else:\\n return True\\n return False\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n # for i in range(len(nums)):\\n # for j in range(i+1,len(nums)):\\n # for k in range(j+1,len(nums)):\\n # if nums[i]<nums[j]<nums[k]:\\n # return True\\n # return False\\n\\n\\n\\n\\n # for i in range(len(nums)-2):\\n # if nums[i]<nums[i+1]<nums[i+2]:\\n # return True\\n # return False\",\n \"runtime\": \"440\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for n in nums:\\n if n<=first:\\n first=n\\n elif n<=second:\\n second=n\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"452\"\n },\n {\n \"code\": \" # too slow\\n # def dp(i: int, prev_max:int, cnt: int) -> bool:\\n # if cnt == 3:\\n # return True\\n # if i == len(nums):\\n # return False\\n # if nums[i] > prev_max: \\n # return dp(i + 1, nums[i], cnt + 1) or dp(i + 1, prev_max, cnt)\\n # else:\\n # return dp(i + 1, prev_max, cnt)\\n \\n # return dp(0, -2*10**31 -1, 0)\\n\\n\\n\\\"\\\"\\\"\\n20 100 10 12 5 13\\n\\nmin1 20,10,5\\nmin2 100,12\\n\\\"\\\"\\\"\\n\\nimport heapq\\n\\n\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n # min1 = [nums[0]]\\n # min2 = []\\n # for n in nums[1:]:\\n # if n == min1[0]:\\n # continue\\n # elif n < min1[0]:\\n # heapq.heappush(min1, n)\\n # elif min2 == []:\\n # min2.append(n)\\n # elif n == min2[0]:\\n # continue\\n # elif n > min2[0]:\\n # return True\\n # else:\\n # heapq.heappush(min2, n)\\n # return False\\n\\n first = second = float('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n \\n return False\",\n \"runtime\": \"452\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n \\n first = float('inf')\\n second = float('inf')\\n \\n for n in nums:\\n if n <= first:\\n first = n # smallest so far\\n elif n <= second:\\n second = n # second smallest\\n else:\\n return True # found a triplet\\n \\n return False\",\n \"runtime\": \"464\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float ('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second: \\n second = num \\n else : \\n return True\\n return False\",\n \"runtime\": \"464\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n first = float('inf')\\n second = float('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n return False\",\n \"runtime\": \"477\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n return False\",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\\n\",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else: return True\\n return False\\n\\n \",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n fir,sec = float('inf'),float(\\\"inf\\\")\\n \\n for i in nums:\\n \\n if i <= fir:\\n fir = i\\n continue\\n \\n if i <= sec:\\n sec = i\\n \\n if i > sec:\\n return True\\n \\n return False\\n \\n \\n \\n# # more logical and easiler to follow\\n# first, second = float(\\\"inf\\\"),float(\\\"inf\\\")\\n \\n# for move in nums:\\n# if move <= first:\\n# first = move\\n# elif move <= second:\\n# second = move\\n# else:\\n# return True\\n \\n# return False\\n \\n # order of operation MATTERS\\n # has edge case that needs to be looked into (ipad notes)\\n \\n# first,second = float('inf'),float('inf')\\n \\n# for move in nums:\\n \\n# if move > second:\\n# return True\\n# if move <= first:\\n# first = move\\n# else:\\n# second = move\\n \\n# return False\\n \\n \\n # Gives TLE\\n \\n# if len(nums) < 3:\\n# return False\\n \\n# for i in range(len(nums)-2):\\n# for j in range(i+1,len(nums)-1):\\n# for k in range(j+1,len(nums)):\\n# if nums[i] < nums[j] < nums[k]:\\n# return True\\n \\n# return False\\n \",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n first, second = float('inf'), float('inf')\\n\\n for n in nums:\\n if n <= first:\\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"'''\\n1,2,3,4,5\\n1,20,3,4,5\\n1,1,2,3,5\\n0,0,1,2,3\\n 20,1,30,40,2\\n\\nf 1\\ns 30\\n'''\\n\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n \\n return False\\n\\n\\n \",\n \"runtime\": \"526\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n i = j = float('inf')\\n for n in nums:\\n if n <= i:\\n i = n\\n elif n <= j:\\n j = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"526\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a, b, c = float('inf'), float('inf'), float('inf')\\n for n in nums:\\n if n <= a:\\n a = n\\n elif n <= b:\\n b = n\\n else:\\n return True\\n return False\\n \\n \\\"\\\"\\\"\\n min_visited = float('inf')\\n n = len(nums)\\n\\n curr = 0\\n while curr + 2 < n:\\n\\n while nums[curr] >= nums[curr+1] or nums[curr] >= min_visited:\\n curr += 1\\n if curr + 1 == n:\\n return False\\n\\n min_visited = nums[curr]\\n new_nums, visited = [], set()\\n for i in range(curr + 1, n):\\n if nums[i] > min_visited and nums[i] not in visited:\\n visited.add(nums[i])\\n new_nums.append(nums[i])\\n\\n m = len(new_nums)\\n for i in range(m-1):\\n for j in range(i, m):\\n if new_nums[i] < new_nums[j]:\\n return True\\n\\n curr += 1\\n\\n return False\\n \\\"\\\"\\\"\\n\\n \\\"\\\"\\\"\\n hmap = defaultdict(list) # The first above after\\n for i in range(len(nums)): # O(n^2)\\n for j in range(i+1, len(nums)):\\n if nums[j] > nums[i]: # Not efficient when nums = [1,2,3,....,n]\\n hmap[i].append(j)\\n \\n for i in range(len(nums)):\\n for j in hmap[i]:\\n if len(hmap[j]) > 0:\\n return True\\n\\n return False\\n \\\"\\\"\\\"\",\n \"runtime\": \"538\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') # 初始化为正无穷大\\n \\n for num in nums:\\n if num <= first:\\n first = num # 找到第一个最小的数\\n elif num <= second:\\n second = num # 找到第二个次小的数\\n else:\\n return True # 找到第三个比second大的数，返回True\\n \\n return False # 如果遍历完没有找到合适的三元组，返回False\\n \\n \\n \\n \",\n \"runtime\": \"538\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n a = float('inf')\\n b = float('inf')\\n for i in nums:\\n if i<=a:\\n a = i\\n elif i<=b:\\n b = i\\n else:\\n return True\\n return False\\n \\n\\n \",\n \"runtime\": \"550\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n m1 = 9999999999\\n m2 = 9999999999\\n\\n for n in nums:\\n if n <= m1:\\n m1 = n\\n elif n <= m2:\\n m2 = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"550\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf')\\n \\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n \\n return False\",\n \"runtime\": \"563\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n first = float('inf')\\n second = float('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True \\n\\n return False \",\n \"runtime\": \"563\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a, b = float('inf'), float('inf')\\n\\n for num in nums:\\n if num <= a:\\n a = num\\n elif num <= b:\\n b = num\\n else:\\n return True\\n return False\\n\",\n \"runtime\": \"575\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n smallest = next_smallest = float('inf')\\n for num in nums:\\n if num <= smallest:\\n smallest = num\\n elif num <= next_smallest:\\n next_smallest = num\\n else:\\n return True\\n return False\",\n \"runtime\": \"575\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float(\\\"inf\\\")\\n second = float(\\\"inf\\\")\\n \\n for i in nums:\\n if i <= first: # Find the smallest number\\n first = i\\n elif i <= second: # Find the second smallest number\\n second = i\\n else: # If you find a number larger than both first and second, return True\\n return True\\n \\n return False\\n\",\n \"runtime\": \"587\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"587\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n if len(nums)<3:\\n return False\\n for i in nums:\\n if i <= first:\\n first = i\\n elif i <= second:\\n second = i\\n else:\\n return True\\n return False\\n \\n\\n\\n \",\n \"runtime\": \"599\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float(\\\"inf\\\")\\n second = float(\\\"inf\\\")\\n \\n for i in nums:\\n if i <= first: # Find the smallest number\\n first = i\\n elif i <= second: # Find the second smallest number\\n second = i\\n else: # If you find a number larger than both first and second, return True\\n return True\\n \\n return False\\n\",\n \"runtime\": \"599\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num \\n elif num <= second:\\n second = num \\n else:\\n return True \\n \\n return False\",\n \"runtime\": \"612\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n m1 = 9999999999\\n m2 = 9999999999\\n\\n for n in nums:\\n if n <= m1:\\n m1 = n\\n elif n <= m2:\\n m2 = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"612\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num \\n elif num <= second:\\n second = num \\n else:\\n return True \\n \\n return False\",\n \"runtime\": \"624\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=float(\\\"inf\\\")\\n second=float(\\\"inf\\\")\\n\\n for n in nums:\\n if n<=first:\\n first=n\\n elif n<=second:\\n second=n\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"624\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else: return True\\n return False\\n\\n \",\n \"runtime\": \"636\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\\"\\\"\\\"\\n Brute force, O(n3)\\n\\n Iterate i from left to right\\n Keep track of first_num and, second_num, \\n if the new num is smaller or equal than first_num, point first_num to new\\n if the new num is smaller or euqal than second_num, point second_num to new\\n if third_num is bigger than second_num, return True\\n\\n 2, 5, 1, 6, 8\\n first_num 1\\n second_num 5\\n\\n 1, 2, 3, 4, 5\\n first_num 1\\n second_num 2\\n\\n 5,4,3,2,1\\n first_num 1\\n second_num None\\n \\\"\\\"\\\"\\n\\n first_num = float(\\\"inf\\\")\\n second_num = float(\\\"inf\\\")\\n\\n for num in nums:\\n if num < first_num:\\n first_num = num\\n elif num > first_num and num < second_num:\\n second_num = num\\n elif num > second_num:\\n return True\\n\\n return False\",\n \"runtime\": \"636\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n #Not all my idea\\n first = float('inf')\\n sec = float('inf')\\n\\n #Done in a single pass\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= sec:\\n sec = num\\n else:\\n return True\\n\\n \\n\\n\\n return False\\n \",\n \"runtime\": \"649\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a = b = float('inf')\\n for i in nums:\\n if i <= a:\\n a = i\\n elif i <= b:\\n b = i\\n else:\\n return True\\n return False\",\n \"runtime\": \"649\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n first = float('inf') # The smallest value seen so far\\n second = float('inf') # The second smallest value seen so far\\n\\n for num in nums:\\n if num <= first:\\n # Update first if current num is smaller or equal\\n first = num\\n elif num <= second:\\n # Update second if current num is smaller or equal to second but greater than first\\n second = num\\n else:\\n # If we find a num greater than second, we have a valid increasing subsequence\\n return True\\n\\n return False\",\n \"runtime\": \"661\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for n in nums:\\n if n<=first:\\n first=n\\n elif n<=second:\\n second=n\\n else:\\n return True\\n return False\",\n \"runtime\": \"661\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n first = second = float('inf')\\n\\n for n in nums:\\n if n <= first:\\n first = n\\n\\n elif n <= second:\\n second = n\\n\\n else:\\n return True\\n\\n return False\\n\\\"\\\"\\\"\\nThis is the output\\n\\nThe logic behind is that we should find the third element that is bigger that second\\nand second is bigger than first, if it encounters any number that is bigger than second it \\nreturn TRUE\\n\\nFirst Iteration:\\n 1\\n first\\n inf\\n\\nSecond Iteration:\\n 2\\n second\\n inf\\n\\nThird Iteration:\\n3\\n\\\"\\\"\\\"\",\n \"runtime\": \"673\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else:\\n return True\\n return False \",\n \"runtime\": \"673\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n third = float('inf')\\n #we try to get first second values as first < second then \\n #the next value which appears is the third value\\n for n in nums:\\n if n <= first:\\n first = n\\n elif n <= second:\\n second = n\\n elif n<= third:\\n third = n\\n print(first, second, third) \\n return first < second < third and first != float('inf') and second != float('inf') and third != float('inf')\",\n \"runtime\": \"685\"\n },\n {\n \"code\": \"class Solution:\\n # initialize i\\n # once something is larger than i, that is j\\n # now if a smaller i is found, set i\\n # what about j?\\n # this is fine, because anything larger than j is still valid, what i and j mean don't really matter\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n i = 2**31\\n j = i\\n\\n for num in nums:\\n if num <= i:\\n i = num\\n elif num <= j:\\n j = num\\n else:\\n return True\\n\\n return False\\n\\n\\n \",\n \"runtime\": \"685\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num \\n elif num <= second:\\n second = num \\n else:\\n return True \\n \\n return False\",\n \"runtime\": \"698\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else: return True\\n return False\\n\\n \",\n \"runtime\": \"698\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n smallest = max(nums)\\n secondSmallest = max(nums)\\n for num in nums:\\n if (num <= smallest): \\n smallest = num \\n elif (num <= secondSmallest) : \\n secondSmallest = num \\n else: \\n return True\\n return False\\n\\n \",\n \"runtime\": \"710\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # 1st obs: iterate through the array\\n # find nums[i] < nums[i-1] > I know to have to reset\\n # >> save last\\n # >> save occurrences of valid condition being met\\n # = [3, 5, 1, 0, 1, 2, 0]\\n # i = None, last = 3, counter = 1\\n # >i = 1, nums[i] > last ? last 5, counter = 2\\n # >i = 2, nums[i] > last ? last 1, counter = 1\\n # >i = 3, nums[i] > last ? last 0, counter = 1\\n # >i = 4 ... i = 5 counter == 3? return true\\n # The complexity is that they are not necessarily beside each other\\n # non-contiguous\\n\\n # -> sort? apply this logic\\n # -> guarantee O(log n) + O(N) ~ O(log n)\\n\\n # -> [0 1, 2, 3, 4, 5, 6] = idx\\n # -> [3, 5, 1, 0, 1, 0, 8]\\n # -> | |\\n # -> > |X, \\n smaller, second = float('inf'), float('inf')\\n\\n for i in range(len(nums)):\\n if nums[i] <= smaller:\\n smaller = nums[i]\\n elif nums[i] <= second:\\n second = nums[i]\\n else:\\n return True\\n return False\",\n \"runtime\": \"710\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # 初始化两个变量，分别存储递增序列的前两个最小值\\n first = second = float('inf')\\n\\n # 遍历数组中的每个元素\\n for num in nums:\\n # 如果当前元素小于等于 first，更新 first 为当前元素\\n if num <= first:\\n first = num\\n # 否则，如果当前元素小于等于 second，更新 second 为当前元素\\n elif num <= second:\\n second = num\\n # 否则，说明找到了一个比 second 大的第三个数，返回 True\\n else:\\n return True\\n\\n # 如果遍历完成后没有找到符合条件的三元子序列，返回 False\\n return False\\n \",\n \"runtime\": \"747\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False \",\n \"runtime\": \"747\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float(inf)\\n second = float(inf)\\n for i in range(len(nums)):\\n if nums[i]<=first:\\n first= nums[i]\\n elif nums[i]<=second:\\n second= nums[i]\\n elif nums[i]>second:\\n return True\\n return False\\n \",\n \"runtime\": \"759\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n \\n for num in nums:\\n if num <= first:\\n first = num # Update the first smallest\\n elif num <= second:\\n second = num # Update the second smallest\\n else:\\n # We found a number greater than both 'first' and 'second'\\n return True\\n \\n return False\",\n \"runtime\": \"759\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n=len(nums)\\n first=float('inf')\\n second=float('inf')\\n\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else:\\n return True\\n \\n return False\\n \",\n \"runtime\": \"771\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"771\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n if n<3:\\n return False\\n a = b = float('inf')\\n for i in nums:\\n if i<=a:\\n a = i\\n elif i<=b:\\n b = i\\n else:\\n return True\\n return False\\n \\n\\n \",\n \"runtime\": \"784\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float(inf)\\n\\n for num in nums:\\n if num <=first:\\n first = num\\n elif num <=second:\\n second = num\\n else:\\n return True\\n return False\\n \",\n \"runtime\": \"784\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n a = b = float('inf')\\n for i in nums:\\n if i<=a:\\n a = i\\n elif i<=b:\\n b = i\\n else:\\n return True\\n return False\\n \\n\\n \",\n \"runtime\": \"796\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\",\n \"runtime\": \"796\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a = b = float('inf')\\n for i in range(len(nums)):\\n if nums[i] <= a:\\n a = nums[i]\\n elif nums[i] <= b:\\n b = nums[i]\\n elif nums[i] > a and nums[i] > b:\\n return True\\n\\n return False\\n \",\n \"runtime\": \"808\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else: return True\\n return False\\n\\n \",\n \"runtime\": \"808\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # keep track the smallest & the second smallest\\n f = float(inf)\\n s = float(inf)\\n for i in nums :\\n if i < f :\\n f = i \\n elif i > f and i < s :\\n s = i\\n elif i > f and i > s :\\n return True\\n \\n return False\\n \\n \\n'''\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n arr = [nums[0]]\\n\\n for i in range(1, len(nums)):\\n idx = bisect.bisect_left(arr, nums[i])\\n if idx >= len(arr):\\n arr.append(nums[i])\\n else :\\n arr[idx] = nums[i]\\n if len(arr) >= 3 :\\n return True\\n\\n return False \\n'''\",\n \"runtime\": \"820\"\n },\n {\n \"code\": \"from collections import OrderedDict\\n\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n mums=list(OrderedDict.fromkeys(nums))\\n if (nums[:len(mums)] != mums and sum(nums)/len(nums)==sum(mums)/len(mums)): return False\\n for i in nums:\\n if i<=first:\\n first=i\\n elif i<=second:\\n second=i\\n else: return True\\n return False\\n\\n \",\n \"runtime\": \"820\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n num1 = float(\\\"inf\\\")\\n num2 = float(\\\"inf\\\")\\n for num in nums: # 3 4 2 5\\n # the main thing we want to determine is that\\n # if there are 2 numbers > num.\\n # the order of num1 and num2 don't matter\\n if num1 >= num:\\n num1 = num\\n elif num2 >= num:\\n num2 = num\\n else:\\n return True\\n return False\",\n \"runtime\": \"833\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n lenght = len(nums)\\n if lenght < 3:\\n return False\\n first = second = (2**31)-1\\n for i in range(0,lenght):\\n if nums[i] <= first:\\n first = nums[i]\\n elif nums[i] <= second:\\n second = nums[i]\\n else:\\n return True\\n\\n return False\",\n \"runtime\": \"833\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = None\\n second = None\\n third = None\\n for i in range(len(nums)):\\n # print(first, second, third)\\n \\n if first==None:\\n first = nums[i]\\n continue\\n else:\\n # print(nums[i])\\n if first > nums[i]:\\n first = nums[i]\\n # second = None\\n # third = None\\n continue\\n\\n if second==None:\\n if first<nums[i]:\\n second = nums[i]\\n continue\\n else:\\n if second > nums[i] and first < nums[i]:\\n second = nums[i]\\n # third = None\\n continue\\n\\n if third==None:\\n if second < nums[i]:\\n third = nums[i]\\n return True\\n # else:\\n # if third > nums[i]:\\n # third = nums[i]\\n # return True \\n\\n return first and second and third\\n\\n \\n \\n \",\n \"runtime\": \"845\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n\\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second:\\n second = num\\n else:\\n return True\\n return False\\n\\n \",\n \"runtime\": \"845\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n n_i = math.inf\\n n_j = math.inf\\n\\n for n in nums:\\n if n < n_i:\\n n_i = n\\n elif n_i < n < n_j:\\n n_j = n\\n elif n_i < n_j < n:\\n return True \\n \\n return False\\n\\n\\n\",\n \"runtime\": \"857\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) <= 2:\\n return False\\n else:\\n first_smallest = float('inf')\\n second_smallest = float('inf')\\n for i in range(len(nums)):\\n if nums[i] < first_smallest:\\n first_smallest = nums[i]\\n elif nums[i] > first_smallest and nums[i] < second_smallest:\\n second_smallest = nums[i]\\n elif nums[i] > second_smallest:\\n return True\\n\\n \",\n \"runtime\": \"857\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n firstNum, secondNum, i = 2**32, 2**32, 0\\n while i < len(nums):\\n if nums[i] <= firstNum:\\n firstNum = nums[i]\\n\\n if nums[i] <= secondNum and nums[i] > firstNum:\\n secondNum = nums[i]\\n\\n if nums[i] > firstNum and nums[i] > secondNum:\\n return True\\n \\n i += 1;\\n\\n return False\\n\",\n \"runtime\": \"870\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a = float('inf')\\n b = float(\\\"inf\\\")\\n for n in nums:\\n a = min(a, n)\\n if a < n < b:\\n b = n\\n\\n if a < b < n: return True\\n\\n return False\\n\\n \\n\\n\\n \",\n \"runtime\": \"870\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n Min, Mid = float('inf'), float('inf')\\n\\n for i in nums:\\n if i > Mid:\\n return True\\n if i > Min:\\n Mid = min(i, Mid)\\n Min = min(i, Min)\\n \\n return False\\n\",\n \"runtime\": \"882\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n smallestFromFront = nums.copy()\\n largestFromRear = nums.copy()\\n\\n smallest = nums[0]\\n for i in range(1, len(nums)):\\n if nums[i] < smallest:\\n smallest = nums[i]\\n smallestFromFront[i] = smallest\\n\\n largest = nums[len(nums) - 1]\\n for i in range(len(nums) - 2, -1, -1):\\n if nums[i] > largest:\\n largest = nums[i]\\n largestFromRear[i] = largest\\n\\n for i in range(1, len(nums) - 1):\\n if nums[i] > smallestFromFront[i] and nums[i] < largestFromRear[i]:\\n return True\\n\\n return False\",\n \"runtime\": \"882\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n rolling_indicies = [0]\\n backup_indicies = []\\n \\n for idx in range(1, len(nums)):\\n if nums[idx] > nums[rolling_indicies[-1]]: \\n rolling_indicies.append(idx)\\n if len(rolling_indicies) == 3 or (len(backup_indicies) > 0 and nums[idx] > nums[backup_indicies[-1]]):\\n return True\\n elif len(rolling_indicies) == 1:\\n rolling_indicies = [idx]\\n elif len(rolling_indicies) == 2:\\n backup_indicies = rolling_indicies\\n if nums[idx] > nums[rolling_indicies[0]]:\\n rolling_indicies[-1] = idx\\n else:\\n rolling_indicies = [idx]\\n \\n return False\",\n \"runtime\": \"894\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n res = [nums[0]]\\n for i in range(1, len(nums)):\\n if nums[i] > res[-1]:\\n res.append(nums[i])\\n if len(res) >= 3:\\n return True\\n else:\\n for j in range(len(res)):\\n if nums[i] <= res[j]:\\n res[j] = nums[i]\\n break\\n return False\\n\",\n \"runtime\": \"894\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n c = float('inf')\\n s = nums[0]\\n\\n for i in range(1, len(nums)):\\n if nums[i] > c:\\n return True\\n if s < nums[i]:\\n c = min(c, nums[i])\\n s = min(s, nums[i])\\n return False\",\n \"runtime\": \"906\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\\"\\\"\\\"\\n Stack\\n \\n - Scan from left to right\\n - Maintain two component, one is the smallest element, another one is the smallest increasing pair\\n \\\"\\\"\\\"\\n\\n smallest_num = None\\n smallest_pair = None\\n\\n for num in nums:\\n \\n # Update the smallest pair\\n if smallest_pair is None:\\n # Add one value\\n smallest_pair = [num]\\n elif len(smallest_pair) == 1:\\n # Add one value if increases\\n if num > smallest_pair[-1]:\\n smallest_pair.append(num)\\n\\n # Can we update it?\\n if num < smallest_pair[-1]:\\n smallest_pair[-1] = num\\n else:\\n # Did we find a triplet?\\n if num > smallest_pair[-1]:\\n return True\\n \\n # Can we update it?\\n if min(smallest_num, smallest_pair[0]) < num < smallest_pair[1]:\\n smallest_pair = [\\n min(smallest_num, smallest_pair[0]),\\n num\\n ]\\n \\n # Update the smallest element\\n if smallest_num is None:\\n smallest_num = num\\n smallest_num = min(smallest_num, num)\\n\\n return False\\n \\n \",\n \"runtime\": \"906\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if(len(nums) == 0):\\n return False\\n arr1 = [True for t in nums]\\n arr2 = [True for t in nums]\\n arr1[0] = False\\n arr2[0] = False\\n arr1[len(nums)-1]= False\\n arr2[len(nums)-1] = False\\n minx = nums[0]\\n maxy = nums[len(nums)-1]\\n for p1 in range(1,len(nums)-1):\\n num = nums[p1]\\n othernum = nums[len(nums)-1 - p1] \\n if(num<= minx):\\n arr1[p1] = False\\n minx = num\\n if(othernum >= maxy):\\n arr2[len(nums)-1-p1] = False\\n maxy = othernum\\n both = [arr1[i] and arr2[i] for i in range(len(arr1))]\\n for t in both:\\n if(t):\\n return True\\n\\n return False \\n\\n \\n\\n \\n return False \\n \\n\\n \\n \",\n \"runtime\": \"919\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\\"\\\"\\\"\\n Stack\\n \\n - Scan from left to right\\n - Maintain two component, one is the smallest element, another one is the smallest increasing pair\\n \\\"\\\"\\\"\\n\\n smallest_num = None\\n smallest_pair = None\\n\\n for num in nums:\\n \\n # Update the smallest pair\\n if smallest_pair is None:\\n # Add one value\\n smallest_pair = [num]\\n elif len(smallest_pair) == 1:\\n # Add one value if increases\\n if num > smallest_pair[-1]:\\n smallest_pair.append(num)\\n\\n # Can we update it?\\n if num < smallest_pair[-1]:\\n smallest_pair[-1] = num\\n else:\\n # Did we find a triplet?\\n if num > smallest_pair[-1]:\\n return True\\n \\n # Can we update it?\\n if min(smallest_num, smallest_pair[0]) < num < smallest_pair[1]:\\n smallest_pair = [\\n min(smallest_num, smallest_pair[0]),\\n num\\n ]\\n \\n # Update the smallest element\\n if smallest_num is None:\\n smallest_num = num\\n smallest_num = min(smallest_num, num)\\n\\n return False\\n \\n \",\n \"runtime\": \"919\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n \\n i, j, k = 0, 1, 2\\n l, m, r = nums[0], nums[1], nums[2]\\n\\n if l < m < r:\\n return True\\n print(l, m, r)\\n\\n while k < len(nums):\\n \\n r = nums[k]\\n l = min(l, nums[i])\\n # temp = max(nums[j], l)\\n # if (nums[j] > l and nums[j] < r):\\n if (nums[j] > l):\\n m = nums[j]\\n # elif nums[j] > m:\\n # m = nums[j]\\n if l < m < r:\\n print(l, m, r)\\n return True\\n\\n k += 1\\n j += 1\\n i += 1\\n # print(l, m, r)\\n # print(l, m, r)\\n return False\\n \",\n \"runtime\": \"931\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n min_arr, max_arr = [nums[0]], [nums[len(nums)-1]]\\n\\n for left in range(1, len(nums)):\\n n_left = nums[left]\\n n_right = nums[len(nums)-1-left]\\n\\n min_v, max_v = min_arr[-1], max_arr[-1]\\n\\n if n_left < min_v:\\n min_v = n_left\\n\\n if n_right > max_v:\\n max_v = n_right\\n\\n min_arr.append(min_v)\\n max_arr.append(max_v)\\n\\n max_arr = max_arr[::-1]\\n\\n for i,n in enumerate(nums):\\n if min_arr[i] < n < max_arr[i]:\\n return True\\n\\n return False\\n\\n\\n \\n \",\n \"runtime\": \"931\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n if n < 3:\\n return False\\n\\n if n == 3:\\n return (nums[0] < nums[1]) and (nums[1] < nums[2])\\n\\n minTo = []\\n currMin = nums[0]\\n for num in nums:\\n currMin = min(num, currMin)\\n minTo.append(currMin)\\n\\n maxFrom = []\\n currMax = nums[-1]\\n for num in nums[::-1]:\\n currMax = max(num, currMax)\\n maxFrom.append(currMax)\\n # maxFrom = [currMax] + maxFrom\\n \\n for i in range(n):\\n # if minTo[i] < nums[i] and nums[i] < maxFrom[i]:\\n if minTo[i] < nums[i] and nums[i] < maxFrom[n - i - 1]:\\n return True\\n\\n return False\\n\\n\",\n \"runtime\": \"943\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n # n = len(nums)\\n # if n<3:\\n # return False\\n\\n # for i in range(1,n-1):\\n # # print(nums[i])\\n # if min(nums[:i])<nums[i]<max(nums[i+1:]):\\n # return True\\n # if i==n-2:\\n # if min(nums[:i])<nums[i]<nums[-1]:\\n # return True\\n\\n # return False\\n if len(nums) < 2:\\n return False\\n\\n min_arr = []\\n for num in nums:\\n if min_arr and num > min_arr[-1]:\\n min_arr.append(min_arr[-1])\\n else:\\n min_arr.append(num)\\n\\n max_arr = []\\n for num in nums[::-1]:\\n if max_arr and num < max_arr[-1]:\\n max_arr.append(max_arr[-1])\\n else:\\n max_arr.append(num)\\n max_arr = max_arr[::-1]\\n\\n for i in range(1, len(nums) - 1):\\n if min_arr[i] < nums[i] < max_arr[i]:\\n return True\\n\\n return False\",\n \"runtime\": \"943\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n max_num = [float(\\\"-inf\\\")] * (len(nums) + 1)\\n for i in range(len(nums)-1, -1, -1):\\n max_num[i] = max(nums[i], max_num[i+1])\\n \\n smallest = nums[0]\\n for i in range(1, len(nums)):\\n if smallest < nums[i] and nums[i] < max_num[i]:\\n return True\\n elif smallest > nums[i]:\\n smallest = nums[i]\\n return False\\n\",\n \"runtime\": \"955\"\n },\n {\n \"code\": \"import numpy as np \\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n first = np.inf\\n second = np.inf \\n for num in nums:\\n if num <= first:\\n first = num \\n elif num <= second: # bigger than first, smaller than second\\n second = num \\n else:\\n if first < second and num > second:\\n return True \\n return False \\n\",\n \"runtime\": \"955\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n size=len(nums)\\n mini=[0]*size\\n maxi=[0]*size\\n mx=float('inf')\\n mn=float('-inf')\\n for i in range(size):\\n mx=min(mx,nums[i])\\n mini[i]=mx\\n for j in range(size-1,-1,-1):\\n mn=max(mn,nums[j])\\n maxi[j]=mn\\n for i in range(size):\\n if mini[i]<nums[i] and nums[i]<maxi[i]:\\n return True\\n return False\",\n \"runtime\": \"968\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n# sorted_nums = nums.sort()\\n# index_list = [0] * len(nums)\\n# for i in range(len(nums)):\\n# index_list[i] = sorted_nums.index(nums[i])\\n n = len(nums)\\n max_num = [0]*n\\n max_num[-1] = nums[-1]\\n for i in range(n-2,-1,-1):\\n max_num[i] = max(max_num[i+1],nums[i])\\n \\n min_num = nums[0]\\n for i in range(0,n-1):\\n if min_num < nums[i] < max_num[i]:\\n return True\\n min_num = min(nums[i],min_num)\\n return False\",\n \"runtime\": \"968\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3: return False\\n \\n minArray, maxArray = [], []\\n minGlobal, maxGlobal = float('inf'), -float('inf')\\n \\n for num in nums:\\n minGlobal = min(minGlobal, num)\\n minArray.append(minGlobal)\\n for num in reversed(nums):\\n maxGlobal = max(maxGlobal, num)\\n maxArray.append(maxGlobal)\\n maxArray.reverse()\\n \\n for i in range(1, len(nums)-1):\\n if minArray[i] < nums[i] and nums[i] < maxArray[i]: return True\\n return False\",\n \"runtime\": \"980\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n maxes_from_right = [nums[-1]] * n\\n for i in range(n - 1)[::-1]:\\n maxes_from_right[i] = max(nums[i], maxes_from_right[i+1])\\n\\n curr_min = nums[0]\\n for i in range(1, n - 1):\\n if curr_min < nums[i] < maxes_from_right[i+1]:\\n return True\\n curr_min = min(curr_min, nums[i])\\n return False\\n\",\n \"runtime\": \"980\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n \\n first = float('inf')\\n second = float('inf')\\n \\n for n in nums:\\n print(n)\\n if n <= first:\\n first = n # smallest so far\\n elif n <= second:\\n second = n # second smallest\\n else:\\n return True # found a triplet\\n \\n return False\",\n \"runtime\": \"992\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n post_max = [0] * n\\n mx = -math.inf\\n for i in range(n-1, -1, -1):\\n mx = max(mx, nums[i])\\n post_max[i] = mx\\n \\n smallest_so_far = nums[0]\\n \\n for j in range(1, n-1):\\n left = smallest_so_far\\n middle = nums[j]\\n right = post_max[j+1]\\n \\n \\n if left < middle and middle < right:\\n return True\\n \\n smallest_so_far = min(smallest_so_far, nums[j])\\n \\n return False\\n\",\n \"runtime\": \"992\"\n },\n {\n \"code\": \"import math\\nimport sys\\n\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n\\n low = max(nums)\\n _max = n * [-(1 << 32)]\\n\\n for i in range(1, n):\\n _max[n-i-1] = max(_max[n-i], nums[n-i])\\n\\n for i in range(n):\\n if low < nums[i] < _max[i]: return True\\n low = min(low, nums[i])\\n \\n return False\",\n \"runtime\": \"1005\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n lowest = [float(inf)]\\n for i in range(1, len(nums)):\\n lowest.append(min(nums[i-1], lowest[-1]))\\n highest = [float(-inf)]\\n for j in range(len(nums)-2, -1, -1):\\n highest.append(max(nums[j+1], highest[-1]))\\n highest.reverse()\\n for i in range(0, len(nums)):\\n if highest[i] > nums[i] and nums[i] > lowest[i]:\\n return True\\n return False\\n \",\n \"runtime\": \"1005\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n # 7, 8, 2, 0, 2\\n\\n currentLongest = [nums[0]]\\n currentMin = [nums[0]]\\n\\n for i in range(1, len(nums)):\\n num = nums[i]\\n if num > currentLongest[-1]:\\n currentLongest.append(num)\\n if len(currentLongest) >= 3:\\n return True\\n elif num > currentLongest[0] and num < currentLongest[-1]:\\n currentLongest = [currentLongest[0], num]\\n \\n\\n if num > currentMin[-1]:\\n currentMin.append(num)\\n elif num < currentMin[0]:\\n currentMin = [num]\\n elif num > currentMin[0] and num < currentMin[-1]:\\n currentMin = [currentMin[0], num]\\n\\n if len(currentMin) >= len(currentLongest):\\n currentLongest = [x for x in currentMin]\\n\\n\\n \\n return False\\n\\n\\n\",\n \"runtime\": \"1017\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums)<3:\\n return False\\n minArr = [0] * len(nums)\\n maxArr = [0] * len(nums)\\n # print(minArr)\\n minimum = nums[0]\\n maximum = nums[len(nums)-1]\\n for i in range(0,len(nums)):\\n minArr[i]=minimum\\n minimum = min(minimum,nums[i])\\n for i in range(len(nums)-1,-1,-1):\\n maxArr[i] = maximum\\n maximum = max(maximum,nums[i]) \\n\\n for i in range(1,len(nums)):\\n if minArr[i]<nums[i]<maxArr[i]:\\n return True\\n return False \\n\\n \\n\\n \",\n \"runtime\": \"1017\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n lowest_to_left = [None] * len(nums)\\n highest_to_right = [None] * len(nums)\\n\\n lowest = nums[0]\\n for i in range(1, len(nums)):\\n lowest_to_left[i] = lowest\\n lowest = min(lowest, nums[i])\\n \\n highest = nums[-1]\\n for i in range(len(nums)-2, -1, -1):\\n highest_to_right[i] = highest\\n highest = max(highest, nums[i])\\n \\n for i in range(len(nums)):\\n current_num = nums[i]\\n if lowest_to_left[i] is None or highest_to_right[i] is None:\\n continue\\n \\n if lowest_to_left[i] < current_num and highest_to_right[i] > current_num:\\n return True\\n \\n return False\\n\\n\\n \",\n \"runtime\": \"1029\"\n },\n {\n \"code\": \"import math\\nimport sys\\n\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n\\n low = 1 << 32\\n _max = n * [-(1 << 32)]\\n\\n for i in range(1, n):\\n _max[n-i-1] = max(_max[n-i], nums[n-i])\\n\\n for i in range(n):\\n if low < nums[i] < _max[i]: return True\\n low = min(low, nums[i])\\n \\n return False\",\n \"runtime\": \"1029\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n mins = [nums[0]] * n\\n maxs = [nums[-1]] * n\\n\\n\\n for i, n in enumerate(nums[1:], 1):\\n mins[i] = min(n, mins[i-1]) \\n\\n for i, n in enumerate(nums[::-1][1:], 1):\\n maxs[i] = max(n, maxs[i-1]) \\n\\n maxs = maxs[::-1]\\n\\n for n, low, high in zip(nums, mins, maxs):\\n if low< n< high:\\n return True\\n return False\",\n \"runtime\": \"1041\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n left_min = [0] * len(nums)\\n right_max = [0] * len(nums)\\n\\n left_min[0] = float(\\\"inf\\\")\\n for i in range(1, len(nums)):\\n left_min[i] = min(left_min[i-1], nums[i-1])\\n\\n right_max[-1] = float(\\\"-inf\\\")\\n for i in range(len(nums)-2, -1, -1):\\n right_max[i] = max(right_max[i+1], nums[i+1])\\n\\n\\n for i in range(len(nums)):\\n if nums[i] > left_min[i] and nums[i] < right_max[i]:\\n return True\\n\\n return False\\n\\n # small = nums[0]\\n # med = nums[0]\\n # large = nums[0]\\n\\n # for i in range(1, len(nums)-1):\\n\\n # small = min(small, nums[i])\\n # med = max(med, nums[i])\\n # large = nums[i+1]\\n\\n # if small < med and med < large:\\n # return True\\n\\n # return False\",\n \"runtime\": \"1041\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":126,"string":"126"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n \n \n for num in nums:\n\n if num <= first:\n first = num\n \n elif num <= second:\n second= num\n \n else :\n return True \n return False\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","memory":"26200"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first, sec = float(\"inf\"), float(\"inf\")\n for n in nums:\n if n <= first :\n first = n\n elif n <= sec:\n sec = n\n else :\n return True\n return False\n \nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit() \n \n\n\n\n\n \n ","memory":"26300"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n f = float('inf')\n s = float('inf')\n\n for num in nums:\n if num <= f:\n f = num\n elif num <= s:\n s = num\n else:\n return True\n \n return False\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","memory":"26400"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n\n f = float('inf')\n s = float('inf')\n\n for num in nums:\n if num <= f:\n f = num\n continue\n #i\n if num <= s:\n \n s = num\n continue\n \n return True\n \n return False\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","memory":"26400"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) <= 2:\n return False\n\n f, s = float(inf), float(inf)\n\n for num in nums:\n if num <= f:\n f = num\n elif num <= s:\n s = num\n else:\n return True\n return False\n\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","memory":"26500"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) <= 2: return False\n first, second = float(inf), float(inf)\n for i in nums:\n if i <= first:\n first = i\n elif i <= second:\n second = i\n else:\n return True\n return False\nwith open('user.out', 'w') as f:\n for case in map(loads, stdin):\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\n')\nexit()","memory":"26600"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = 2 ** 31\n\n for num in nums:\n if num < first:\n first = num\n elif first < num < second:\n second = num\n elif num > second:\n return True\n \n return False","memory":"30000"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n left = [False] * n\n right = [False] * n\n mi = float('inf')\n ma = float('-inf')\n\n for i in range(1, n):\n mi = min(mi, nums[i - 1])\n if nums[i] > mi:\n left[i] = True\n\n for i in range(n - 2, -1, -1):\n ma = max(ma, nums[i + 1])\n if nums[i] < ma:\n right[i] = True\n\n for i in range(1, n - 1):\n if left[i] and right[i]:\n return 'true'\n\n return 'false'\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().increasingTriplet(nums),file=f)\nexit(0)\n","memory":"30200"},{"code":"import math\nclass Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = nums[0]\n second = -math.inf\n for i in range(1, len(nums)):\n if nums[i] < first:\n first = nums[i]\n elif nums[i] > first:\n if (second == -math.inf) or (nums[i] < second):\n second = nums[i]\n elif nums[i] > second:\n return True \n return False","memory":"30300"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n triplet = [None,None,None]\n for i in range(len(nums)-1):\n if triplet[1] != None:\n if triplet[2] > nums[i+1] and triplet[1] < nums[i+1]:\n triplet[2] = nums[i+1]\n if triplet [2] < nums[i+1]:\n return True\n if nums[i] < nums[i+1]:\n triplet[1] = nums[i]\n triplet[2] = nums[i+1]\n return False\n #5,6,3,4,1,2,3\n \n\n\n \n ","memory":"30400"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n firstMin = 2147483647\n secondMin = 2147483647\n\n for num in nums:\n if num <= firstMin:\n firstMin = num\n elif num <= secondMin:\n secondMin = num\n else:\n return True\n\n return False","memory":"30700"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(set(nums))<3:\n return False\n\n N = len(nums)\n\n st = 0\n while st < N:\n stack = []\n for i in range(st, N):\n n = nums[i]\n if not stack:\n stack.append(n)\n else:\n if n>stack[-1]:\n stack.append(n)\n elif len(stack)==1 and n<stack[-1]:\n stack[-1]=n\n st = i\n elif len(stack)>1 and n<stack[-1] and n>stack[-2]:\n stack[-1]=n\n \n if len(stack)>=3:\n return True\n st += 1\n \n return False","memory":"30900"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n start = 0\n counter = 1\n total = len(nums)\n max_repitition_count = total - 2\n repition = 0\n last_greater = nums[start]\n if len(set(nums)) < 3:\n return False\n while repition < max_repitition_count:\n if start == len(nums) - 1:\n repition += 1\n start = repition\n last_greater = nums[repition]\n counter = 1\n if start < len(nums):\n if nums[repition] < nums[start + 1]:\n if last_greater < nums[start + 1]:\n counter += 1\n last_greater = nums[start + 1]\n if nums[start + 1] < last_greater:\n last_greater = nums[start + 1]\n if counter == 3:\n return True\n start += 1\n return False\n","memory":"31000"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n\n prev1 = float('inf')\n prev2 = float('inf')\n\n for num in nums:\n if num > prev2 and prev2 > prev1:\n return True\n\n if num > prev1:\n prev2 = num\n else:\n prev1 = num\n\n return False","memory":"31100"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n \n if len(nums) < 3:\n return False\n inf = float('inf')\n i = 0\n sub = [inf,inf,inf]\n for num in nums:\n if num <= sub[0]:\n sub[0] = num\n elif num <= sub[1]:\n sub[1] = num\n elif num <= sub[2]:\n return True\n \n return False","memory":"31200"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if len(nums) < 3:\n return False\n first = second = float('inf')\n for i in nums:\n if i <= first:\n first = i\n elif i <= second:\n second = i\n else:\n return True\n return False\n\n","memory":"31300"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if (num <= first):\n first = num\n elif (num <= second):\n second = num\n else:\n return True\n return False","memory":"31400"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n #Brute force approach\n \n # for i in range(len(nums)-2):\n # for j in range(i,len(nums)-1):\n # if nums[i] < nums[j]:\n # for k in range(j, len(nums)):\n # if nums[j] < nums[k]:\n # return True\n # return False\n\n if len(nums) < 3:\n return False\n\n i = j = float('inf')\n\n for num in nums:\n if num <= i:\n i = num\n elif num <= j:\n j = num\n else:\n return True\n \n return False\n\n ","memory":"31500"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n\n for num in nums:\n if num > second:\n return True\n elif num > first:\n second = num\n elif num < first:\n first = num\n print(first,second)\n return False","memory":"31600"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if num <= first:\n first = num \n elif num <= second:\n second = num \n else:\n return True \n \n return False","memory":"31700"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n ans=[nums[0]]\n for i in nums:\n j=0\n while(j<len(ans) and i>ans[j]):\n j+=1\n if(j<len(ans)):\n ans[j]=i\n else:\n ans+=[i]\n if(len(ans)==3):\n break\n print(ans)\n return len(ans)==3\n \n ","memory":"31800"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n=len(nums)\n minv=1e12\n bar=1e12\n flag=False\n for i in range(n):\n if nums[i]<minv:\n minv=nums[i]\n if nums[i]>minv and nums[i]<bar:\n bar=nums[i]\n if nums[i]>bar:\n flag=True\n break\n print(bar)\n return flag","memory":"31900"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for i in nums:\n if first >= i:\n first = i\n elif second >= i:\n second = i\n else:\n return True\n return False","memory":"32000"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n a = b = float('inf')\n for i in range(len(nums)):\n if nums[i] <= a:\n a = nums[i]\n elif nums[i] <= b:\n b = nums[i]\n elif nums[i] > a and nums[i] > b:\n return True\n\n return False\n ","memory":"32100"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n min1 = float('inf')\n min2 = float('inf')\n \n for num in nums:\n if num <= min1:\n min1 = num\n elif num <= min2:\n min2 = num\n else:\n return True\n \n return False","memory":"32200"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n lenght = len(nums)\n if lenght < 3:\n return False\n first = second = (2**31)-1\n for i in range(0,lenght):\n if nums[i] <= first:\n first = nums[i]\n elif nums[i] <= second:\n second = nums[i]\n else:\n return True\n\n return False","memory":"32299"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n m = None\n m2 = None\n m3 = None\n for i in range(len(nums) - 1, -1, -1):\n if m is None or m <= nums[i]:\n m = nums[i]\n elif m2 is None or m2 <= nums[i]:\n m2 = nums[i]\n elif m3 is None or m3 <= nums[i]:\n return True\n return False\n\n\n","memory":"32299"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float('inf')\n second = float('inf')\n for num in nums:\n if num <= first:\n first = num \n elif num <= second:\n second = num \n else:\n return True \n \n return False","memory":"32400"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = second = float('inf') \n for n in nums: \n if n <= first: \n first = n\n elif n <= second:\n second = n\n else:\n return True\n return False\n","memory":"32400"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first=second=float('inf')\n for i in nums:\n if i<=first:\n first=i\n continue\n elif i<=second:\n second=i\n continue\n else: return True\n return False\n\n ","memory":"32500"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n first = float(\"inf\")\n second = float(\"inf\")\n \n for i in nums:\n if i <= first: # Find the smallest number\n first = i\n elif i <= second: # Find the second smallest number\n second = i\n else: # If you find a number larger than both first and second, return True\n return True\n \n return False\n","memory":"32500"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n if nums == [] or len(nums) < 3:\n return False\n \n first = float('inf')\n second = float('inf')\n \n for num in nums:\n if num <= first:\n first = num\n elif num <= second and num > first:\n second = num\n else:\n return True\n return False ","memory":"32600"},{"code":"class Solution:\n def increasingTriplet(self, nums: List[int]) -> bool:\n n = len(nums)\n a = sys.maxsize\n b = sys.maxsize\n for x in nums:\n # print(f\"a={a} b={b} x={x}\")\n if a < b < x:\n return True\n elif x <= a:\n a = x\n elif x < b:\n b = x\n return False","memory":"32600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n \\n \\n for num in nums:\\n\\n if num <= first:\\n first = num\\n \\n elif num <= second:\\n second= num\\n \\n else :\\n return True \\n return False\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"memory\": \"26200\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first, sec = float(\\\"inf\\\"), float(\\\"inf\\\")\\n for n in nums:\\n if n <= first :\\n first = n\\n elif n <= sec:\\n sec = n\\n else :\\n return True\\n return False\\n \\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit() \\n \\n\\n\\n\\n\\n \\n \",\n \"memory\": \"26300\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n f = float('inf')\\n s = float('inf')\\n\\n for num in nums:\\n if num <= f:\\n f = num\\n elif num <= s:\\n s = num\\n else:\\n return True\\n \\n return False\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"memory\": \"26400\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n\\n f = float('inf')\\n s = float('inf')\\n\\n for num in nums:\\n if num <= f:\\n f = num\\n continue\\n #i\\n if num <= s:\\n \\n s = num\\n continue\\n \\n return True\\n \\n return False\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"memory\": \"26400\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) <= 2:\\n return False\\n\\n f, s = float(inf), float(inf)\\n\\n for num in nums:\\n if num <= f:\\n f = num\\n elif num <= s:\\n s = num\\n else:\\n return True\\n return False\\n\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"memory\": \"26500\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) <= 2: return False\\n first, second = float(inf), float(inf)\\n for i in nums:\\n if i <= first:\\n first = i\\n elif i <= second:\\n second = i\\n else:\\n return True\\n return False\\nwith open('user.out', 'w') as f:\\n for case in map(loads, stdin):\\n f.write(f'{str(Solution().increasingTriplet(case)).lower()}\\\\n')\\nexit()\",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = 2 ** 31\\n\\n for num in nums:\\n if num < first:\\n first = num\\n elif first < num < second:\\n second = num\\n elif num > second:\\n return True\\n \\n return False\",\n \"memory\": \"30000\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n left = [False] * n\\n right = [False] * n\\n mi = float('inf')\\n ma = float('-inf')\\n\\n for i in range(1, n):\\n mi = min(mi, nums[i - 1])\\n if nums[i] > mi:\\n left[i] = True\\n\\n for i in range(n - 2, -1, -1):\\n ma = max(ma, nums[i + 1])\\n if nums[i] < ma:\\n right[i] = True\\n\\n for i in range(1, n - 1):\\n if left[i] and right[i]:\\n return 'true'\\n\\n return 'false'\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().increasingTriplet(nums),file=f)\\nexit(0)\\n\",\n \"memory\": \"30200\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = nums[0]\\n second = -math.inf\\n for i in range(1, len(nums)):\\n if nums[i] < first:\\n first = nums[i]\\n elif nums[i] > first:\\n if (second == -math.inf) or (nums[i] < second):\\n second = nums[i]\\n elif nums[i] > second:\\n return True \\n return False\",\n \"memory\": \"30300\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n triplet = [None,None,None]\\n for i in range(len(nums)-1):\\n if triplet[1] != None:\\n if triplet[2] > nums[i+1] and triplet[1] < nums[i+1]:\\n triplet[2] = nums[i+1]\\n if triplet [2] < nums[i+1]:\\n return True\\n if nums[i] < nums[i+1]:\\n triplet[1] = nums[i]\\n triplet[2] = nums[i+1]\\n return False\\n #5,6,3,4,1,2,3\\n \\n\\n\\n \\n \",\n \"memory\": \"30400\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n firstMin = 2147483647\\n secondMin = 2147483647\\n\\n for num in nums:\\n if num <= firstMin:\\n firstMin = num\\n elif num <= secondMin:\\n secondMin = num\\n else:\\n return True\\n\\n return False\",\n \"memory\": \"30700\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(set(nums))<3:\\n return False\\n\\n N = len(nums)\\n\\n st = 0\\n while st < N:\\n stack = []\\n for i in range(st, N):\\n n = nums[i]\\n if not stack:\\n stack.append(n)\\n else:\\n if n>stack[-1]:\\n stack.append(n)\\n elif len(stack)==1 and n<stack[-1]:\\n stack[-1]=n\\n st = i\\n elif len(stack)>1 and n<stack[-1] and n>stack[-2]:\\n stack[-1]=n\\n \\n if len(stack)>=3:\\n return True\\n st += 1\\n \\n return False\",\n \"memory\": \"30900\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n start = 0\\n counter = 1\\n total = len(nums)\\n max_repitition_count = total - 2\\n repition = 0\\n last_greater = nums[start]\\n if len(set(nums)) < 3:\\n return False\\n while repition < max_repitition_count:\\n if start == len(nums) - 1:\\n repition += 1\\n start = repition\\n last_greater = nums[repition]\\n counter = 1\\n if start < len(nums):\\n if nums[repition] < nums[start + 1]:\\n if last_greater < nums[start + 1]:\\n counter += 1\\n last_greater = nums[start + 1]\\n if nums[start + 1] < last_greater:\\n last_greater = nums[start + 1]\\n if counter == 3:\\n return True\\n start += 1\\n return False\\n\",\n \"memory\": \"31000\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n\\n prev1 = float('inf')\\n prev2 = float('inf')\\n\\n for num in nums:\\n if num > prev2 and prev2 > prev1:\\n return True\\n\\n if num > prev1:\\n prev2 = num\\n else:\\n prev1 = num\\n\\n return False\",\n \"memory\": \"31100\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n \\n if len(nums) < 3:\\n return False\\n inf = float('inf')\\n i = 0\\n sub = [inf,inf,inf]\\n for num in nums:\\n if num <= sub[0]:\\n sub[0] = num\\n elif num <= sub[1]:\\n sub[1] = num\\n elif num <= sub[2]:\\n return True\\n \\n return False\",\n \"memory\": \"31200\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if len(nums) < 3:\\n return False\\n first = second = float('inf')\\n for i in nums:\\n if i <= first:\\n first = i\\n elif i <= second:\\n second = i\\n else:\\n return True\\n return False\\n\\n\",\n \"memory\": \"31300\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if (num <= first):\\n first = num\\n elif (num <= second):\\n second = num\\n else:\\n return True\\n return False\",\n \"memory\": \"31400\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n #Brute force approach\\n \\n # for i in range(len(nums)-2):\\n # for j in range(i,len(nums)-1):\\n # if nums[i] < nums[j]:\\n # for k in range(j, len(nums)):\\n # if nums[j] < nums[k]:\\n # return True\\n # return False\\n\\n if len(nums) < 3:\\n return False\\n\\n i = j = float('inf')\\n\\n for num in nums:\\n if num <= i:\\n i = num\\n elif num <= j:\\n j = num\\n else:\\n return True\\n \\n return False\\n\\n \",\n \"memory\": \"31500\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n\\n for num in nums:\\n if num > second:\\n return True\\n elif num > first:\\n second = num\\n elif num < first:\\n first = num\\n print(first,second)\\n return False\",\n \"memory\": \"31600\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num \\n elif num <= second:\\n second = num \\n else:\\n return True \\n \\n return False\",\n \"memory\": \"31700\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n ans=[nums[0]]\\n for i in nums:\\n j=0\\n while(j<len(ans) and i>ans[j]):\\n j+=1\\n if(j<len(ans)):\\n ans[j]=i\\n else:\\n ans+=[i]\\n if(len(ans)==3):\\n break\\n print(ans)\\n return len(ans)==3\\n \\n \",\n \"memory\": \"31800\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n=len(nums)\\n minv=1e12\\n bar=1e12\\n flag=False\\n for i in range(n):\\n if nums[i]<minv:\\n minv=nums[i]\\n if nums[i]>minv and nums[i]<bar:\\n bar=nums[i]\\n if nums[i]>bar:\\n flag=True\\n break\\n print(bar)\\n return flag\",\n \"memory\": \"31900\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for i in nums:\\n if first >= i:\\n first = i\\n elif second >= i:\\n second = i\\n else:\\n return True\\n return False\",\n \"memory\": \"32000\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n a = b = float('inf')\\n for i in range(len(nums)):\\n if nums[i] <= a:\\n a = nums[i]\\n elif nums[i] <= b:\\n b = nums[i]\\n elif nums[i] > a and nums[i] > b:\\n return True\\n\\n return False\\n \",\n \"memory\": \"32100\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n min1 = float('inf')\\n min2 = float('inf')\\n \\n for num in nums:\\n if num <= min1:\\n min1 = num\\n elif num <= min2:\\n min2 = num\\n else:\\n return True\\n \\n return False\",\n \"memory\": \"32200\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n lenght = len(nums)\\n if lenght < 3:\\n return False\\n first = second = (2**31)-1\\n for i in range(0,lenght):\\n if nums[i] <= first:\\n first = nums[i]\\n elif nums[i] <= second:\\n second = nums[i]\\n else:\\n return True\\n\\n return False\",\n \"memory\": \"32299\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n m = None\\n m2 = None\\n m3 = None\\n for i in range(len(nums) - 1, -1, -1):\\n if m is None or m <= nums[i]:\\n m = nums[i]\\n elif m2 is None or m2 <= nums[i]:\\n m2 = nums[i]\\n elif m3 is None or m3 <= nums[i]:\\n return True\\n return False\\n\\n\\n\",\n \"memory\": \"32299\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float('inf')\\n second = float('inf')\\n for num in nums:\\n if num <= first:\\n first = num \\n elif num <= second:\\n second = num \\n else:\\n return True \\n \\n return False\",\n \"memory\": \"32400\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = second = float('inf') \\n for n in nums: \\n if n <= first: \\n first = n\\n elif n <= second:\\n second = n\\n else:\\n return True\\n return False\\n\",\n \"memory\": \"32400\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first=second=float('inf')\\n for i in nums:\\n if i<=first:\\n first=i\\n continue\\n elif i<=second:\\n second=i\\n continue\\n else: return True\\n return False\\n\\n \",\n \"memory\": \"32500\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n first = float(\\\"inf\\\")\\n second = float(\\\"inf\\\")\\n \\n for i in nums:\\n if i <= first: # Find the smallest number\\n first = i\\n elif i <= second: # Find the second smallest number\\n second = i\\n else: # If you find a number larger than both first and second, return True\\n return True\\n \\n return False\\n\",\n \"memory\": \"32500\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n if nums == [] or len(nums) < 3:\\n return False\\n \\n first = float('inf')\\n second = float('inf')\\n \\n for num in nums:\\n if num <= first:\\n first = num\\n elif num <= second and num > first:\\n second = num\\n else:\\n return True\\n return False \",\n \"memory\": \"32600\"\n },\n {\n \"code\": \"class Solution:\\n def increasingTriplet(self, nums: List[int]) -> bool:\\n n = len(nums)\\n a = sys.maxsize\\n b = sys.maxsize\\n for x in nums:\\n # print(f\\\"a={a} b={b} x={x}\\\")\\n if a < b < x:\\n return True\\n elif x <= a:\\n a = x\\n elif x < b:\\n b = x\\n return False\",\n \"memory\": \"32600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":33,"string":"33"}}},{"rowIdx":263,"cells":{"question_id":{"kind":"number","value":335,"string":"335"},"name":{"kind":"string","value":"self-crossing"},"content":{"kind":"string","value":"<p>You are given an array of integers <code>distance</code>.</p>\n\n<p>You start at the point <code>(0, 0)</code> on an <strong>X-Y plane,</strong> and you move <code>distance[0]</code> meters to the north, then <code>distance[1]</code> meters to the west, <code>distance[2]</code> meters to the south, <code>distance[3]</code> meters to the east, and so on. In other words, after each move, your direction changes counter-clockwise.</p>\n\n<p>Return <code>true</code> <em>if your path crosses itself or </em><code>false</code><em> if it does not</em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2022/12/21/11.jpg\" style=\"width: 400px; height: 413px;\" />\n<pre>\n<strong>Input:</strong> distance = [2,1,1,2]\n<strong>Output:</strong> true\n<strong>Explanation:</strong> The path crosses itself at the point (0, 1).\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2022/12/21/22.jpg\" style=\"width: 400px; height: 413px;\" />\n<pre>\n<strong>Input:</strong> distance = [1,2,3,4]\n<strong>Output:</strong> false\n<strong>Explanation:</strong> The path does not cross itself at any point.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2022/12/21/33.jpg\" style=\"width: 400px; height: 413px;\" />\n<pre>\n<strong>Input:</strong> distance = [1,1,1,2,1]\n<strong>Output:</strong> true\n<strong>Explanation:</strong> The path crosses itself at the point (0, 0).\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= distance.length <= 10<sup>5</sup></code></li>\n\t<li><code>1 <= distance[i] <= 10<sup>5</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":30.959405491846038,"string":"30.959405"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","math","geometry"],"string":"[\n \"array\",\n \"math\",\n \"geometry\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"102\", 0.3788], [\"104\", 0.3788], [\"106\", 0.3788], [\"108\", 0.3788], [\"109\", 1.1364], [\"110\", 0.3788], [\"111\", 1.8939], [\"112\", 1.1364], [\"113\", 0.7576], [\"114\", 1.1364], [\"115\", 0.7576], [\"116\", 1.1364], [\"117\", 2.6515], [\"118\", 2.6515], [\"119\", 1.1364], [\"120\", 0.7576], [\"121\", 1.5152], [\"122\", 2.6515], [\"123\", 1.8939], [\"124\", 1.8939], [\"125\", 2.6515], [\"126\", 4.5455], [\"127\", 4.1667], [\"128\", 2.6515], [\"129\", 2.2727], [\"130\", 4.5455], [\"131\", 3.7879], [\"132\", 3.4091], [\"133\", 5.303], [\"134\", 4.5455], [\"135\", 2.2727], [\"136\", 4.1667], [\"137\", 3.0303], [\"138\", 3.7879], [\"139\", 3.0303], [\"140\", 3.4091], [\"141\", 1.8939], [\"142\", 2.2727], [\"143\", 0.7576], [\"144\", 0.3788], [\"145\", 0.3788], [\"146\", 0.3788], [\"147\", 0.7576], [\"148\", 1.5152], [\"149\", 0.3788], [\"167\", 0.3788], [\"176\", 0.7576], [\"177\", 0.7576], [\"179\", 0.3788], [\"200\", 0.3788], [\"202\", 0.7576]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"25100\", 0.3788], [\"25200\", 0.7576], [\"25300\", 17.0455], [\"25400\", 59.0909], [\"25500\", 14.3939]]}"},"rt_list":{"kind":"list like","value":[{"code":"\n\nclass Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n x, y = 0, 0\n spiral_out = True\n bottom_y, top_y, prev_bottom_y, prev_top_y = 0, 0, 0, 0\n left_x, right_x, prev_left_x, prev_right_x = 0, 0, 0, 0\n\n for i, d in enumerate(distance):\n nxt_x, nxt_y = x, y\n if i % 4 == 0:\n # NORTH\n nxt_y += d\n if spiral_out:\n if nxt_y <= top_y:\n spiral_out = False\n if prev_bottom_y <= nxt_y:\n left_x = prev_right_x\n else:\n if top_y <= nxt_y:\n return True\n prev_top_y, top_y = top_y, nxt_y\n elif i % 4 == 1:\n # WEST\n nxt_x -= d\n if spiral_out:\n if left_x <= nxt_x:\n spiral_out = False\n bottom_y = prev_top_y\n else:\n if nxt_x <= left_x:\n return True\n prev_left_x, left_x = left_x, nxt_x\n elif i % 4 == 2:\n # SOUTH\n nxt_y -= d\n if spiral_out:\n if bottom_y <= nxt_y:\n spiral_out = False\n if 2 < i:\n right_x = prev_left_x\n else:\n if nxt_y <= bottom_y:\n return True\n prev_bottom_y, bottom_y = bottom_y, nxt_y\n else:\n # EAST\n nxt_x += d\n if spiral_out:\n if nxt_x <= right_x:\n spiral_out = False\n if 3 < i or nxt_x == right_x:\n top_y = prev_bottom_y\n else:\n if right_x <= nxt_x:\n return True\n prev_right_x, right_x = right_x, nxt_x\n\n x, y = nxt_x, nxt_y\n #print(f\"{x=} {y=} {bottom_y=} {top_y=} {left_x=} {right_x=}\")\n\n return False","runtime":"102"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n b = c = d = e = f = 0\n for a in distance:\n if d >= b >0 and (0<c <= a or (a >= c-e > 0 and f >= d-b)):\n return True\n b, c, d, e, f = a, b, c, d, e\n return False","runtime":"104"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n b = c = d = e = 0\n for a in x:\n if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):\n return True\n b, c, d, e, f = a, b, c, d, e\n return False\n ","runtime":"106"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n b = c = d = e = 0\n x = distance\n for a in x:\n if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):\n return True\n b, c, d, e, f = a, b, c, d, e\n return False","runtime":"108"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n \n if len(distance) < 4:\n return False\n \n elif distance[0] >= distance[2]:\n for i in range(3, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n \n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\n return True\n return False","runtime":"109"},{"code":"from typing import List\n\n\nclass Solution:\n '''\n Two points to note: \n 1. The Cartesian coordinate system is symmetric wih 90 degree rotations\n 2. To cross a previous path with a future step, one can cross from left, right or from below\n '''\n def isSelfCrossing(self, distance: List[int]) -> bool:\n b = c = d = e = f = 0\n for a in distance:\n # cross from left\n if d > 0 and d >= b and a >= c:\n return True\n # cross from below\n if e > 0 and c <= a + e and b == d:\n return True\n # cross from the right\n if f > 0 and b <= d <= b + f and e <= c <= a + e:\n return True\n b, c, d, e, f = a, b, c, d, e \n return False","runtime":"110"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n distance = [0, 0] + distance\n for i in range(5, n+2):\n if distance[i-1] <= distance[i-3]:\n if distance[i] >= distance[i-2]:\n return True\n if (\n distance[i-1] +(\n distance[i-5] \n if distance[i-4] <= distance[i-2] \n else 0\n ) >= distance[i-3] \n and (\n distance[i] + distance[i-4]\n ) >= distance[i-2]\n ):\n return True\n return False\n\n","runtime":"111"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n b = c=d = e = 0\n\n for a in distance:\n if d>=b>0 and ( a>=c or a>=c-e>=0 and f >=d-b):\n return True\n b,c,d,e,f = a,b,c,d,e\n ","runtime":"111"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n \n if len(distance) < 4:\n return False\n \n elif distance[0] >= distance[2]:\n for i in range(3, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n \n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\n return True\n return False","runtime":"112"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n if len(distance) < 4:\n return False\n \n distance = [0, 0, 0] + distance\n \n if distance[3] >= distance[5]:\n for i in range(6, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n return False","runtime":"112"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n \n if len(distance) < 4:\n return False\n \n elif distance[0] >= distance[2]:\n for i in range(3, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n \n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\n return True\n return False","runtime":"113"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n \n if len(distance) < 4:\n return False\n \n elif distance[0] >= distance[2]:\n for i in range(3, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n \n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\n return True\n return False","runtime":"113"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n \n if len(distance) < 4:\n return False\n \n elif distance[0] >= distance[2]:\n for i in range(3, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n \n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\n return True\n return False","runtime":"114"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n \n if len(distance) < 4:\n return False\n \n elif distance[0] >= distance[2]:\n for i in range(3, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n \n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\n return True\n return False","runtime":"114"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n b = c = d = e = 0\n for a in x:\n if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):\n return True\n b, c, d, e, f = a, b, c, d, e\n return False\n ","runtime":"115"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n if len(distance) < 4:\n return False\n \n distance = [0, 0, 0] + distance\n \n if distance[3] >= distance[5]:\n for i in range(6, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n return False","runtime":"116"},{"code":"from typing import List\n\nclass Solution:\n def isSelfCrossing(self, distances: List[int]) -> bool:\n \n \n \n for i in range(3, len(distances)):\n \n if distances[i] >= distances[i - 2] and distances[i - 1] <= distances[i - 3]:\n return True\n \n \n if i >= 4 and distances[i - 1] == distances[i - 3] and distances[i] + distances[i - 4] >= distances[i - 2]:\n return True\n \n \n if (i >= 5\n and distances[i - 2] >= distances[i - 4]\n and distances[i - 1] <= distances[i - 3]\n and distances[i] >= distances[i - 2] - distances[i - 4]\n and distances[i - 1] + distances[i - 5] >= distances[i - 3]):\n return True\n \n \n return False","runtime":"117"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n cross=0\n n=len(distance)\n i=min(2,n)\n while(i<n and distance[i]>distance[i-2]):\n i=i+1\n if i==n or i==n-1:\n return cross\n else:\n if (i<=2 and distance[i]<=distance[i-2]) or (i==3 and distance[i]<distance[i-2]):\n i=i+1\n while(i<n and distance[i]<distance[i-2]):\n i=i+1\n elif i==3 and distance[i]==distance[i-2]:\n if distance[i+1]<distance[i-1]-distance[i-3]:\n i=i+1\n while(i<n and distance[i]<distance[i-2]):\n i=i+1\n else:\n if (distance[i+1]<distance[i-1]-distance[i-3]) or (distance[i]<distance[i-2]-distance[i-4] and distance[i+1]<distance[i-1]):\n i=i+1\n while(i<n and distance[i]<distance[i-2]):\n i=i+1\n if i==n:\n return cross\n else:\n return 1\n\n \n\n ","runtime":"118"},{"code":"from enum import Enum\n\nclass State(Enum):\n GROW = 1\n SHRINK = 2\n TRANS = 3\n\nclass Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n d1 = d2 = d3 = d4 = 0\n s = State.GROW\n\n for d5 in distance:\n match s:\n case State.GROW:\n if d5 + d1 < d3:\n s = State.SHRINK\n elif d5 <= d3:\n s = State.TRANS \n case State.SHRINK:\n if d5 >= d3:\n return True\n case State.TRANS:\n if d5 + d1 < d3:\n s = State.SHRINK\n else:\n return True\n case _:\n raise ValueError(\"Undefined State!\")\n d1, d2, d3, d4 = d2, d3, d4, d5\n\n return False ","runtime":"119"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n \n # Handle base cases\n if n <= 3:\n return False\n \n for i in range(3, n):\n # Case 1: Fourth line crosses first line\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n \n # Case 2: Fifth line meets first line\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n \n # Case 3: Sixth line crosses first line\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i-3] >= distance[i-1] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] + distance[i-5] >= distance[i-3]:\n return True\n \n return False","runtime":"120"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n if len(distance) < 4:\n return False\n \n distance = [0, 0, 0] + distance\n \n if distance[3] >= distance[5]:\n for i in range(6, len(distance)):\n if distance[i] >= distance[i-2]:\n return True\n \n else:\n for i in range(4, len(distance)-1):\n if distance[i] <= distance[i-2]:\n if distance[i] < distance[i-2]-distance[i-4]:\n for j in range(i+1, len(distance)-1):\n if distance[j] >= distance[j-2]:\n return True\n else:\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\n return True\n for j in range(i+1, len(distance)):\n if distance[j] >= distance[j-2]:\n return True\n break\n return False","runtime":"121"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n top = 0\n bottom = 0\n left = 0\n right = 0\n case = 0 # 0 means longer, 1 means equal to or shorter, 2 means extremely shorter\n \n for idx, dis in enumerate(distance):\n if case == 0:\n if idx % 4 == 0:\n if dis <= left and dis >= left-right:\n case = 1\n elif dis < left-right:\n case = 2\n right = dis\n elif idx % 4 == 1:\n if dis <= bottom and dis >= bottom-top:\n case = 1\n elif dis < bottom-top:\n case = 2\n top = dis\n elif idx % 4 == 2:\n if dis <= right and dis >= right-left:\n case = 1\n elif dis < right-left:\n case = 2\n left = dis\n elif idx % 4 == 3:\n if dis <= top and dis >= top-bottom:\n case = 1\n elif dis < top-bottom:\n case = 2\n bottom = dis\n elif case == 1:\n if idx % 4 == 0:\n if dis >= left-right:\n return True\n right = dis\n elif idx % 4 == 1:\n if dis >= bottom-top:\n return True\n top = dis\n elif idx % 4 == 2:\n if dis >= right-left:\n return True\n left = dis\n elif idx % 4 == 3:\n if dis >= top-bottom:\n return True\n bottom = dis\n case = 2\n elif case == 2:\n if idx % 4 == 0:\n if dis >= left:\n return True\n right = dis\n elif idx % 4 == 1:\n if dis >= bottom:\n return True\n top = dis\n elif idx % 4 == 2:\n if dis >= right:\n return True\n right = dis\n elif idx % 4 == 3:\n if dis >= top:\n return True\n bottom = dis\n return False\n ","runtime":"122"},{"code":"class Solution:\n def isSelfCrossing(self, distance: list[int]) -> bool:\n n = len(distance)\n \n # Loop over the distances\n for i in range(3, n):\n # Case 1: Fourth line crosses first line (i.e. sharp turn cross)\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n \n # Case 2: Fifth line crosses first line\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n \n # Case 3: Sixth line crosses first line\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\n return True\n \n return False\n","runtime":"123"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n n = len(x)\n for i in range(3, n):\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]: return 1\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]: return 1\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i - 1] <= x[i - 3] and x[i] >= x[i - 2] - x[i - 4]: return 1\n return 0\n\n ","runtime":"124"},{"code":"class Solution:\n def isSelfCrossing(self, distance: list[int]) -> bool:\n # Check if the path crosses itself\n n = len(distance)\n if n < 4:\n return False\n \n # Check each possible crossing condition\n for i in range(3, n):\n # Case 1: Fourth line crosses first line\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n # Case 2: Fifth line crosses first line\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n # Case 3: Fifth line crosses second line\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\n return True\n \n return False\n\n# Example usage:\nsol = Solution()\n\n# Example 1\ndistance = [2,1,1,2]\nprint(sol.isSelfCrossing(distance)) # Output: true\n\n# Example 2\ndistance = [1,2,3,4]\nprint(sol.isSelfCrossing(distance)) # Output: false\n\n# Example 3\ndistance = [1,1,1,2,1]\nprint(sol.isSelfCrossing(distance)) # Output: true\n","runtime":"125"},{"code":"from typing import List\n\nclass Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n for i in range(3, n):\n # Case 1: Current line crosses the line 3 steps ahead.\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n # Case 2: Current line overlaps with the line 4 steps ahead.\n if i >= 4:\n if distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n # Case 3: Current line crosses the line 5 steps ahead.\n if i >= 5:\n if (distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and\n distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]):\n return True\n return False\n\n# Example Usage:\n\n# Example 1:\ndistance = [2, 1, 1, 2]\nprint(Solution().isSelfCrossing(distance)) # Output: True\n\n# Example 2:\ndistance = [1, 2, 3, 4]\nprint(Solution().isSelfCrossing(distance)) # Output: False\n\n# Example 3:\ndistance = [1, 1, 1, 2, 1]\nprint(Solution().isSelfCrossing(distance)) # Output: True\n","runtime":"126"},{"code":"class Solution:\n def isSelfCrossing(self, D: List[int]) -> bool:\n for i in range(3, len(D)):\n if D[i-3] >= D[i-1] and D[i] >= D[i-2]:\n return True\n if i >= 4 and D[i] + D[i-4] >= D[i-2] and D[i-1] == D[i-3]:\n return True\n if i >= 5 and D[i] <= D[i-2] and D[i-4] <= D[i-2] and D[i-5] <= D[i-3] and D[i-3] >= D[i-1] and D[i] + D[i-4] >= D[i-2] and D[i-1] + D[i-5] >= D[i-3]:\n return True\n return False","runtime":"127"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n N = len(x)\n for i in range(3, N):\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]:\n return True\n\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\n return True\n\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i - 1] <= x[i - 3] and x[i] >= x[i - 2] - x[i - 4]:\n return True\n\n\n \n return False\n\n ","runtime":"128"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n for i in range(3, n):\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\n return True\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\n return True\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\n return True\n return False","runtime":"129"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n N = len(x)\n for i in range(3,N):\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]:\n return True\n if i >= 4 and x[i - 1] == x[i - 3] and x[i -2] <= x[i] + x[i - 4]:\n return True\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i -1] <= x[i -3] and x[i] >= x[i - 2] - x[i - 4]:\n return True\n return False\n","runtime":"130"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n for i in range(3, n):\n # Case 1: Fourth line crosses the first line\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n # Case 2: Fifth line crosses the first line\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n # Case 3: Fifth line crosses the second line\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] + distance[i-5] >= distance[i-3] and distance[i-1] <= distance[i-3] and distance[i] <= distance[i-2]:\n return True\n return False\n","runtime":"131"},{"code":"class Solution:\n def isSelfCrossing(self, arr: List[int]) -> bool:\n for i in range(3, len(arr)):\n if arr[i - 3] >= arr[i - 1] and arr[i] >= arr[i - 2]:\n return True\n\n if i > 3 and arr[i - 3] == arr[i - 1] and arr[i - 2] <= arr[i] + arr[i - 4]:\n return True\n\n if i > 4 and arr[i - 3] >= arr[i - 5] and arr[i - 3] >= arr[i - 1] and arr[i - 3]<= arr[i - 5] + arr[i - 1] and arr[i - 2] >= arr[i - 4] and arr[i - 2] >= arr[i] and arr[i - 2] <= arr[i - 4] + arr[i]:\n return True\n \n return False","runtime":"132"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n # If there are less than 4 values in the array, the path can't cross itself\n if len(x) <= 3:\n return False\n\n # Loop through the array starting from the 3rd index\n for i in range(3, len(x)):\n # Case 1: current line crosses the line 3 steps before it\n # _______\n # | |\n # | |\n # ________|______| <-- current line\n # | |\n # | |\n # |__________| <-- line 3 steps before\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\n return True\n \n # Case 2: current line crosses the line 4 steps before it\n # _____\n # | |\n # | |\n # | |________\n # | |\n # | |\n # |_______________| <-- current line\n # line 4 steps before\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\n return True\n \n # Case 3: current line crosses the line 5 steps before it\n # ______\n # | |\n # | |\n # |______| <-- line 5 steps before\n # |\n # |\n # ______|_______\n # | |\n # | |\n # |______________| <-- current line\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\n return True\n\n # If no crossing has been found, the path does not cross itself\n return False","runtime":"133"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n \n # If the path has less than 4 movements, it cannot cross itself\n if n < 4:\n return False\n \n # Simulate the movement and check for intersections\n for i in range(3, n):\n # Case 1: Current line crosses the line 3 steps ahead of it\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n \n # Case 2: Current line crosses the line 4 steps ahead of it\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n \n # Case 3: Current line crosses the line 5 steps ahead of it\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] >= distance[i-2] - distance[i-4] and distance[i-1] >= distance[i-3] - distance[i-5] and distance[i-1] <= distance[i-3]:\n return True\n \n return False\n\n# Example usage:\nsolution = Solution()\ndistance = [2,1,1,2]\nprint(solution.isSelfCrossing(distance)) # Output: True\n\ndistance = [1,2,3,4]\nprint(solution.isSelfCrossing(distance)) # Output: False\n\ndistance = [1,1,1,2,1]\nprint(solution.isSelfCrossing(distance)) # Output: True","runtime":"134"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n if n <= 3:\n return False\n\n for i in range(3, n):\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\n return True\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\n return True\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\n return True\n return False","runtime":"135"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n n = len(x)\n for i in range(3, n):\n # Fourth line crosses first line\n if x[i] >= x[i-2] and x[i-1] <= x[i-3]:\n return True\n \n # Fifth line crosses second line\n if i >= 4 and x[i-1] == x[i-3] and x[i] + x[i-4] >= x[i-2]:\n return True\n \n # Sixth line crosses third line\n if i >= 5 and x[i-2] >= x[i-4] and x[i-1] <= x[i-3] and \\\n x[i] + x[i-4] >= x[i-2] and x[i-1] + x[i-5] >= x[i-3]:\n return True\n \n return False\n\n# Test the solution\nsolution = Solution()\nprint(solution.isSelfCrossing([2,1,1,2])) # Should print True\nprint(solution.isSelfCrossing([1,2,3,4])) # Should print False","runtime":"136"},{"code":"class Solution:\n def isSelfCrossing(self, x: list[int]) -> bool:\n if len(x) <= 3:\n return False\n\n for i in range(3, len(x)):\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\n return True\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\n return True\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\n return True\n\n return False","runtime":"138"},{"code":"class Solution:\n def isSelfCrossing(self, x: list[int]) -> bool:\n if len(x) <= 3:\n return False\n\n for i in range(3, len(x)):\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\n return True\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\n return True\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\n return True\n\n return False ","runtime":"139"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n if n <= 3:\n return False\n \n for i in range(3, n):\n if distance[i-3] >= distance[i-1] and distance[i] >= distance[i-2]:\n return True\n \n if i>3 and distance[i-3] == distance[i-1] and distance[i-2] <= distance[i] + distance[i-4]:\n return True\n \n if i>4 and distance[i-3] >= distance[i-5] and distance[i-3] >= distance[i-1] and distance[i-3] <= distance[i-5] + distance[i-1] and distance[i-2] >= distance[i-4] and distance[i-2] >= distance[i] and distance[i-2] <= distance[i-4] + distance[i]:\n return True\n return False","runtime":"140"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n if n < 4:\n return False\n\n for i in range(3, n):\n # Case 1: Current line crosses the line 3 steps ahead of it.\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n\n # Case 2: Current line crosses the line 4 steps ahead of it.\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n\n # Case 3: Current line crosses the line 5 steps ahead of it.\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\n return True\n\n return False","runtime":"141"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n if n<4:\n return False \n \n for i in range(3, n):\n if distance[i-1]<=distance[i-3] and distance[i]>=distance[i-2]:\n return True\n if i>=4 and distance[i-1]==distance[i-3] and distance[i]+distance[i-4]>=distance[i-2]:\n return True \n if i>=5 and distance[i-2]>distance[i-4] and distance[i-1]+distance[i-5]>=distance[i-3] and distance[i-2]-distance[i-4]<=distance[i] and distance[i-1]<=distance[i-3]:\n return True\n return False\n ","runtime":"142"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n n = len(x)\n\n for i in range(3, n):\n if x[i] >= x[i - 2] and x[i - 1]<= x[i - 3]:\n return True\n if i >= 4:\n if x[i - 1] == x[i - 3] and x[i]+ x[i - 4] >= x[i - 2]:\n return True\n if i >= 5:\n if x[i] + x[i - 4] >= x[i - 2] and x[i - 1] + x[i - 5] >= x[i - 3] and x[i - 2] > x[i - 4] and x[i - 3] > x[i - 1]:\n return True\n return False\n ","runtime":"143"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n n = len(x)\n for i in range(3, n):\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]: return True\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]: return True\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i - 1] <= x[i - 3] and x[i] >= x[i - 2] - x[i - 4]: return True\n return False","runtime":"144"},{"code":"class Solution:\n def isSelfCrossing(self, d: List[int]) -> bool:\n n = len(d)\n\n for i in range(3, n):\n # case 1: fourth line hits first line\n if d[i - 2] <= d[i] and d[i - 1] <= d[i - 3]:\n return True\n # case 2: fifth line hits first line\n if 3 < i and d[i - 1] == d[i - 3] and d[i - 2] <= d[i] + d[i - 4]:\n return True\n # case 3: sixth line hits first line (loop around)\n if 4 < i and d[i - 4] < d[i - 2] and d[i - 5] < d[i - 3] and d[i - 3] <= d[i - 1] + d[i - 5] and d[i - 2] <= d[i] + d[i - 4] and d[i - 1] <= d[i - 3]:\n return True\n return False","runtime":"145"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n for i in range(3, n):\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\n return True\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\n return True\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\n return True\n return False","runtime":"146"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n\n \n \"\"\"\n Determines if a given path crosses itself.\n\n Args:\n distance: List[int] - Distances moved in each direction.\n\n Returns:\n bool - True if the path crosses itself, False otherwise.\n \"\"\"\n n = len(distance)\n if n < 4:\n return False # Less than 4 moves cannot cross\n\n for i in range(3, n):\n # Case 1: Current line crosses the line 3 steps ahead\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\n return True\n\n # Case 2: Current line crosses the line 4 steps ahead\n if i >= 4:\n if (distance[i - 1] == distance[i - 3] and\n distance[i] + distance[i - 4] >= distance[i - 2]):\n return True\n\n # Case 3: Current line crosses the line 5 steps ahead\n if i >= 5:\n if (distance[i - 2] >= distance[i - 4] and\n distance[i] >= distance[i - 2] - distance[i - 4] and\n distance[i - 1] >= distance[i - 3] - distance[i - 5] and\n distance[i - 1] <= distance[i - 3]):\n return True\n\n return False\n\n ","runtime":"147"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n for i in range(3, n):\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\n return True\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\n return True\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\n return True\n return False","runtime":"148"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n\n for i in range(len(distance)):\n if i-3 >= 0:\n if abs(distance[i-1]) <= abs(distance[i-3]) and abs(distance[i]) >= abs(distance[i-2]):\n print(\"i-3\")\n return True\n\n if i-4 >= 0:\n if abs(distance[i-1]) == abs(distance[i-3]) and abs(distance[i]) >= (abs(distance[i-2])-abs(distance[i-4])):\n print(\"i-4\")\n return True\n\n if i-5 >= 0:\n if distance[i]+distance[i-4] >= distance[i-2] and distance[i-1]+distance[i-5] >= distance[i-3] and distance[i-2]>distance[i-4] and distance[i-3]>distance[i-1]:\n print(\"i-5\")\n return True\n\n return False\n # how to tell if two vectors cross? \n\n # \n # [(0,0), (2,0)]\n # [(-1,1), (1,1)]\n\n\n # vertical_walls = {}\n # horizontal_walls = {}\n\n # cur_position = (0,0)\n # for i in range(len(distance)):\n # if i % 2 == 0:\n # new_position = (cur_position[0], cur_position[1] + distance[i])\n\n # else:\n # # this is a horizontal wall, moving horizontally \n # new_position = (cur_position[0] + distance[i], cur_position[1])\n\n # for i in range(min(cur_position[1], new_position[1]), max(cur_position[1], new_position[1])+1):\n # for walls in horizontal_walls.get(i, []):\n # if min(walls[0], walls[1]) <= new_position[0] and new_position[0] <= max(walls[0], walls[1]) and cur_position != (walls[0], i) and cur_position != (walls[1], i):\n # return True\n\n # for i in range(min(cur_position[0], new_position[0]), max(cur_position[0], new_position[0])+1):\n # for walls in vertical_walls.get(i, []):\n # if min(walls[0], walls[1]) <= new_position[1] and new_position[1] <= max(walls[0], walls[1]) and cur_position != (i, walls[0]) and cur_position != (i, walls[1]):\n # return True\n \n # # add the walls \n # if i % 2 == 0: \n # # this is a vertical wall, moving vertically \n # vertical_walls[cur_position[0]] = vertical_walls.get(cur_position[0], []) + [(cur_position[1], new_position[1])]\n\n # else:\n # horizontal_walls[cur_position[1]] = horizontal_walls.get(cur_position[1], []) + [(cur_position[0], new_position[0])]\n\n # cur_position = new_position\n\n # return False","runtime":"149"},{"code":"class Solution:\n\n def isSelfCrossing(self, distance: List[int]) -> bool:\n x, y = 0, 0\n\n walls = [None, None, None, None]\n enclosed = False\n\n for idx, d in enumerate(distance):\n\n x_new, y_new = x, y\n\n if idx % 4 == 0:\n y_new += d\n elif idx % 4 == 2:\n y_new -= d\n elif idx % 4 == 1:\n x_new -= d\n else:\n x_new += d\n\n if x == x_new: # verticle movement\n wall = walls[(idx - 3) % 4]\n if wall is not None:\n x0, y0, x1, y1 = wall\n assert y0 == y1\n if min(x0, x1) <= x <= max(x0, x1) and min(y, y_new) <= y0 <= max(y, y_new):\n return True\n wall = walls[idx % 4]\n if wall is not None:\n x0, y0, x1, y1 = wall\n if (x_new, y_new) == (x0, y0):\n return True\n else: # horizontal movement\n assert y == y_new\n wall = walls[(idx - 3) % 4]\n if wall is not None:\n x0, y0, x1, y1 = wall\n assert x0 == x1\n if min(y0, y1) <= y <= max(y0, y1) and min(x, x_new) <= x0 <= max(x, x_new):\n return True\n\n # find the closest wall it would intersect if it moved infinitely in the next direction\n # if such a wall exists, then the path is enclosed\n\n if not enclosed and walls[idx % 4] is not None:\n wx0, wy0, wx1, wy1 = walls[idx % 4]\n up_case = idx % 4 == 0 and wy0 <= y_new <= wy1\n down_case = idx % 4 == 2 and wy1 <= y_new <= wy0\n left_case = idx % 4 == 1 and wx1 <= x_new <= wx0\n right_case = idx % 4 == 3 and wx0 <= x_new <= wx1\n if up_case or down_case or left_case or right_case:\n walls[(idx - 2) % 4] = walls[idx % 4]\n enclosed = True\n \n if not enclosed and walls[(idx - 2) % 4] is not None:\n wx0, wx1, wy0, wy1 = walls[(idx - 2) % 4]\n up_case = idx % 4 == 0 and wy1 <= y_new <= wy0\n down_case = idx % 4 == 2 and wy0 <= y_new <= wy1\n left_case = idx % 4 == 1 and wx0 <= x_new <= wx1\n right_case = idx % 4 == 3 and wx1 <= x_new <= wx0\n if up_case or down_case or left_case or right_case:\n enclosed = True\n\n walls[idx % 4] = (x, y, x_new, y_new)\n x, y = x_new, y_new\n\n return False\n","runtime":"167"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n edges = [(1, -1, float(\"inf\"))] * 6 # boundaries with 2 dummy ones\n x1, x2 = 0, 0\n for idx, dist in enumerate(distance):\n if (idx & 0x1) ^ (idx>>1 & 0x1): # 1 or 2, not 0, 3\n dist = -dist\n \n a, b, c, d = edges[idx % 6], edges[(idx+1) % 6], edges[(idx+2) % 6], edges[(idx+3) % 6]\n if any((\n x1 == a[2] and (x2 < a[0] and x2 + dist >= a[0] or x2 > a[0] and x2 + dist >= a[0]),\n b[0] <= -x1 <= b[1] and -x2 < b[2] and -x2 - dist >= b[2],\n x1 == c[2] and (x2 < c[0] and x2 + dist >= c[0] or x2 > c[0] and x2 + dist <= c[0]),\n d[0] <= -x1 <= d[1] and x2 < d[2] and x2 + dist >= d[2]\n )):\n return True\n edges[idx % 6] = (min(x2, x2 + dist), max(x2, x2 + dist), x1)\n x1, x2 = -x2 - dist, -x1\n return False","runtime":"176"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n current = [0, 0]\n north = [0, 0, 0]\n max_north = [0, 0, 0]\n west = [0, 0, 0]\n max_west = [0, 0, 0]\n south = [0, 0, 0]\n max_south = [0, 0, 0]\n east = [0, 0, 0]\n max_east = [0, 0, 0]\n smax_north = [0,0,0]\n smax_east = [0,0,0]\n smax_south = [0,0,0]\n smax_west = [0,0,0]\n\n direction = -1\n\n for i in distance:\n direction += 1\n\n if direction == 3:\n east[0] = current[0]\n east[1] = current[1]\n east[2] = i\n if east[1] <= max_east[1]:\n smax_east = list(max_east)\n max_east = list(east)\n\n p = current[0]\n\n current[0] += i\n\n if p < north[0] and current[0] >= north[0] and current[1] >= north[1] and current[1] <= north[1] + north[2]:\n return True\n\n if p < smax_south[0] and current[0] >= smax_south[0] and current[1] <= smax_south[1] and current[1] >= smax_south[1] - smax_south[2]:\n return True\n\n if direction == 2:\n south[0] = current[0]\n south[1] = current[1]\n south[2] = i\n if south[0] <= max_south[0]:\n smax_south = max_south.copy()\n max_south = south.copy()\n\n p = current[1]\n\n current[1] -= i\n\n if p > east[1] and current[1] <= east[1] and current[0] >= east[0] and current[0] <= east[0] + east[2]:\n return True\n\n if p > smax_west[1] and current[1] <= smax_west[1] and current[0] <= smax_west[0] and current[0] >= smax_west[0] - smax_west[2]:\n return True\n\n if direction == 1:\n west[0] = current[0]\n west[1] = current[1]\n west[2] = i\n if west[1] >= max_west[1]:\n smax_west = list(max_west)\n max_west = list(west)\n \n p = current[0]\n \n current[0] -= i\n\n print(p)\n print(current)\n print(max_north)\n print(smax_north)\n\n if p > south[0] and current[0] <= south[0] and current[1] <= south[1] and current[1] >= south[1] - south[2]:\n return True\n\n if p > smax_north[0] and current[0] <= smax_north[0] and current[1] >= smax_north[1] and current[1] <= smax_north[1] + smax_north[2]:\n return True\n\n if direction == 0:\n north[0] = current[0]\n north[1] = current[1]\n north[2] = i\n if north[0] >= max_north[0]:\n smax_north = list(max_north)\n max_north = list(north)\n\n p = current[1]\n \n current[1] += i\n \n if p < west[1] and current[1] >= west[1] and current[0] <= west[0] and current[0] >= west[0] - west[2]:\n return True\n\n if p < smax_east[1] and current[1] >= smax_east[1] and current[0] >= smax_east[0] and current[0] <= smax_east[0] + smax_east[2]:\n return True\n \n\n\n if direction == 3:\n direction = -1\n\n return False\n \n ","runtime":"177"},{"code":"def point_intersection(qa0,qb0,pc0,walls):\n for qa,qb,pc in walls[1:]:\n if pc0==pc:\n if qa<=qa0<=qb or qa<=qb0<=qb:\n return True\n return False\nposInf = float('inf')\nclass Solution:\n def isSelfCrossing(self, A: List[int]) -> bool:\n if len(A)<4:\n return False\n i,j = 0,0\n di,dj = 0,1\n iwalls, jwalls = [ [posInf]*3 for _ in range(3)], [ [posInf]*3 for _ in range(3)]\n for x in A:\n i0,j0 = i,j\n i += di*x\n j += dj*x\n #\n if di: # di: p,q = i,j\n q,p1,p2 = j, min(i0,i),max(i0,i)\n walls = iwalls[1:]\n else: # dj: p,q = j,i\n q,p1,p2 = i, min(j0,j),max(j0,j)\n walls = jwalls[1:]\n # Wall Collision Detector\n for qa,qb,pc in walls:\n if qa<=q<=qb and p1<=pc<=p2:\n return True\n # Point Collision Detector\n parallels = iwalls if dj else jwalls\n if point_intersection(p1,p2,q, parallels ):\n return True\n # Build New Walls ( dj movements span horizontal walls (iwalls) )\n if dj:\n iwalls = [ [p1,p2,q], *iwalls[:-1] ]\n else:\n jwalls = [ [p1,p2,q], *jwalls[:-1] ]\n di,dj = -dj,di\n return False","runtime":"179"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n # chord i doesnt intersect\n # If interesects, it intersects with i-3 or i-5\n\n def checkintersection(p1,p2,q1,q2):\n # Line between p1 and p2\n # Line between q1 and q2\n # Assume one is vertical and other horizontal\n\n if p1[0]==p2[0]:\n # Line p is vertical\n if min(p1[1],p2[1])<=q1[1]<=max(p1[1],p2[1]) and min(q1[0],q2[0])<=p1[0]<=max(q1[0],q2[0]):\n return True\n else:\n return checkintersection(q1,q2,p1,p2)\n return False\n\n points = []\n currposx = 0\n currposy = 0\n dirx = 0\n diry = 1\n n = len(distance)\n points.append((0,0))\n for i in range(n):\n currposx+=dirx*distance[i]\n currposy+=diry*distance[i]\n dirx,diry = -diry,dirx\n points.append((currposx,currposy))\n\n if i>=3:\n if checkintersection(points[i-3],points[i-2],points[i],points[i+1]):\n return True\n if i>=5:\n if checkintersection(points[i-5],points[i-4],points[i],points[i+1]):\n return True\n elif i==4:\n # It can overlap with chord 0. No -1 to check\n if currposx==0 and currposy>=0:\n return True\n return False\n","runtime":"200"},{"code":"class Solution:\n def intersects(self, seg1, seg2):\n # assumes south -> north, west -> east\n p1, p2 = seg1\n q1, q2 = seg2\n if p1[0] == p2[0]: # south -> north\n if q1[0] == q2[0]:\n if p1[0] != q1[0]:\n return False\n return (q1[1] <= p1[1] <= q2[1]) or (q1[1] <= p2[1] <= q2[1]) or (p1[1] <= q1[1] <= p2[1]) or (p1[1] <= q2[1] <= p2[1])\n else: # p = south -> north, q = west -> east\n return (p1[1] <= q1[1] <= p2[1]) and (q1[0] <= p1[0] <= q2[0])\n else: # west -> east\n if q1[1] == q2[1]:\n if p1[1] != q1[1]:\n return False\n return (q1[0] <= p1[0] <= q2[0]) or (q1[0] <= p2[0] <= q2[0]) or (p1[0] <= q1[0] <= p2[0]) or (p1[0] <= q2[0] <= p2[0])\n else: # q = south -> north, p = west -> east\n return (q1[1] <= p1[1] <= q2[1]) and (p1[0] <= q1[0] <= p2[0])\n\n def isSelfCrossing(self, distance: List[int]) -> bool:\n point = (0, 0)\n last_seg = None\n #traj = [point]\n segs = set()\n dir_map = {\n 0: (0, 1),\n 1: (-1, 0),\n 2: (0, -1),\n 3: (1, 0)\n }\n winding_down = False\n for i, d in enumerate(distance):\n if i >= 2 and distance[i-2] >= d and not winding_down:\n winding_down = True\n\n dx, dy = dir_map[i % 4]\n new_point = (point[0] + dx * d, point[1] + dy * d)\n \n if i % 4 in {0, 3}:\n new_seg = (point, new_point)\n elif i % 4 in {1, 2}:\n new_seg = (new_point, point)\n \n if winding_down:\n for seg in segs:\n if self.intersects(seg, new_seg) and seg != last_seg:\n return True\n #traj.append(new_point)\n segs.add(new_seg)\n last_seg = new_seg\n point = new_point\n \n return False","runtime":"202"}],"string":"[\n {\n \"code\": \"\\n\\nclass Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n x, y = 0, 0\\n spiral_out = True\\n bottom_y, top_y, prev_bottom_y, prev_top_y = 0, 0, 0, 0\\n left_x, right_x, prev_left_x, prev_right_x = 0, 0, 0, 0\\n\\n for i, d in enumerate(distance):\\n nxt_x, nxt_y = x, y\\n if i % 4 == 0:\\n # NORTH\\n nxt_y += d\\n if spiral_out:\\n if nxt_y <= top_y:\\n spiral_out = False\\n if prev_bottom_y <= nxt_y:\\n left_x = prev_right_x\\n else:\\n if top_y <= nxt_y:\\n return True\\n prev_top_y, top_y = top_y, nxt_y\\n elif i % 4 == 1:\\n # WEST\\n nxt_x -= d\\n if spiral_out:\\n if left_x <= nxt_x:\\n spiral_out = False\\n bottom_y = prev_top_y\\n else:\\n if nxt_x <= left_x:\\n return True\\n prev_left_x, left_x = left_x, nxt_x\\n elif i % 4 == 2:\\n # SOUTH\\n nxt_y -= d\\n if spiral_out:\\n if bottom_y <= nxt_y:\\n spiral_out = False\\n if 2 < i:\\n right_x = prev_left_x\\n else:\\n if nxt_y <= bottom_y:\\n return True\\n prev_bottom_y, bottom_y = bottom_y, nxt_y\\n else:\\n # EAST\\n nxt_x += d\\n if spiral_out:\\n if nxt_x <= right_x:\\n spiral_out = False\\n if 3 < i or nxt_x == right_x:\\n top_y = prev_bottom_y\\n else:\\n if right_x <= nxt_x:\\n return True\\n prev_right_x, right_x = right_x, nxt_x\\n\\n x, y = nxt_x, nxt_y\\n #print(f\\\"{x=} {y=} {bottom_y=} {top_y=} {left_x=} {right_x=}\\\")\\n\\n return False\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n b = c = d = e = f = 0\\n for a in distance:\\n if d >= b >0 and (0<c <= a or (a >= c-e > 0 and f >= d-b)):\\n return True\\n b, c, d, e, f = a, b, c, d, e\\n return False\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n b = c = d = e = 0\\n for a in x:\\n if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):\\n return True\\n b, c, d, e, f = a, b, c, d, e\\n return False\\n \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n b = c = d = e = 0\\n x = distance\\n for a in x:\\n if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):\\n return True\\n b, c, d, e, f = a, b, c, d, e\\n return False\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n \\n if len(distance) < 4:\\n return False\\n \\n elif distance[0] >= distance[2]:\\n for i in range(3, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n \\n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\\n return True\\n return False\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Solution:\\n '''\\n Two points to note: \\n 1. The Cartesian coordinate system is symmetric wih 90 degree rotations\\n 2. To cross a previous path with a future step, one can cross from left, right or from below\\n '''\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n b = c = d = e = f = 0\\n for a in distance:\\n # cross from left\\n if d > 0 and d >= b and a >= c:\\n return True\\n # cross from below\\n if e > 0 and c <= a + e and b == d:\\n return True\\n # cross from the right\\n if f > 0 and b <= d <= b + f and e <= c <= a + e:\\n return True\\n b, c, d, e, f = a, b, c, d, e \\n return False\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n distance = [0, 0] + distance\\n for i in range(5, n+2):\\n if distance[i-1] <= distance[i-3]:\\n if distance[i] >= distance[i-2]:\\n return True\\n if (\\n distance[i-1] +(\\n distance[i-5] \\n if distance[i-4] <= distance[i-2] \\n else 0\\n ) >= distance[i-3] \\n and (\\n distance[i] + distance[i-4]\\n ) >= distance[i-2]\\n ):\\n return True\\n return False\\n\\n\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n b = c=d = e = 0\\n\\n for a in distance:\\n if d>=b>0 and ( a>=c or a>=c-e>=0 and f >=d-b):\\n return True\\n b,c,d,e,f = a,b,c,d,e\\n \",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n \\n if len(distance) < 4:\\n return False\\n \\n elif distance[0] >= distance[2]:\\n for i in range(3, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n \\n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\\n return True\\n return False\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n if len(distance) < 4:\\n return False\\n \\n distance = [0, 0, 0] + distance\\n \\n if distance[3] >= distance[5]:\\n for i in range(6, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n return False\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n \\n if len(distance) < 4:\\n return False\\n \\n elif distance[0] >= distance[2]:\\n for i in range(3, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n \\n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\\n return True\\n return False\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n \\n if len(distance) < 4:\\n return False\\n \\n elif distance[0] >= distance[2]:\\n for i in range(3, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n \\n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\\n return True\\n return False\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n \\n if len(distance) < 4:\\n return False\\n \\n elif distance[0] >= distance[2]:\\n for i in range(3, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n \\n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\\n return True\\n return False\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n \\n if len(distance) < 4:\\n return False\\n \\n elif distance[0] >= distance[2]:\\n for i in range(3, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n \\n if len(distance) > 4 and distance[3] == distance[1] and (distance[4] >= distance[2]-distance[0]):\\n return True\\n return False\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n b = c = d = e = 0\\n for a in x:\\n if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):\\n return True\\n b, c, d, e, f = a, b, c, d, e\\n return False\\n \",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n if len(distance) < 4:\\n return False\\n \\n distance = [0, 0, 0] + distance\\n \\n if distance[3] >= distance[5]:\\n for i in range(6, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n return False\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def isSelfCrossing(self, distances: List[int]) -> bool:\\n \\n \\n \\n for i in range(3, len(distances)):\\n \\n if distances[i] >= distances[i - 2] and distances[i - 1] <= distances[i - 3]:\\n return True\\n \\n \\n if i >= 4 and distances[i - 1] == distances[i - 3] and distances[i] + distances[i - 4] >= distances[i - 2]:\\n return True\\n \\n \\n if (i >= 5\\n and distances[i - 2] >= distances[i - 4]\\n and distances[i - 1] <= distances[i - 3]\\n and distances[i] >= distances[i - 2] - distances[i - 4]\\n and distances[i - 1] + distances[i - 5] >= distances[i - 3]):\\n return True\\n \\n \\n return False\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n cross=0\\n n=len(distance)\\n i=min(2,n)\\n while(i<n and distance[i]>distance[i-2]):\\n i=i+1\\n if i==n or i==n-1:\\n return cross\\n else:\\n if (i<=2 and distance[i]<=distance[i-2]) or (i==3 and distance[i]<distance[i-2]):\\n i=i+1\\n while(i<n and distance[i]<distance[i-2]):\\n i=i+1\\n elif i==3 and distance[i]==distance[i-2]:\\n if distance[i+1]<distance[i-1]-distance[i-3]:\\n i=i+1\\n while(i<n and distance[i]<distance[i-2]):\\n i=i+1\\n else:\\n if (distance[i+1]<distance[i-1]-distance[i-3]) or (distance[i]<distance[i-2]-distance[i-4] and distance[i+1]<distance[i-1]):\\n i=i+1\\n while(i<n and distance[i]<distance[i-2]):\\n i=i+1\\n if i==n:\\n return cross\\n else:\\n return 1\\n\\n \\n\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"from enum import Enum\\n\\nclass State(Enum):\\n GROW = 1\\n SHRINK = 2\\n TRANS = 3\\n\\nclass Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n d1 = d2 = d3 = d4 = 0\\n s = State.GROW\\n\\n for d5 in distance:\\n match s:\\n case State.GROW:\\n if d5 + d1 < d3:\\n s = State.SHRINK\\n elif d5 <= d3:\\n s = State.TRANS \\n case State.SHRINK:\\n if d5 >= d3:\\n return True\\n case State.TRANS:\\n if d5 + d1 < d3:\\n s = State.SHRINK\\n else:\\n return True\\n case _:\\n raise ValueError(\\\"Undefined State!\\\")\\n d1, d2, d3, d4 = d2, d3, d4, d5\\n\\n return False \",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n \\n # Handle base cases\\n if n <= 3:\\n return False\\n \\n for i in range(3, n):\\n # Case 1: Fourth line crosses first line\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n \\n # Case 2: Fifth line meets first line\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n \\n # Case 3: Sixth line crosses first line\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i-3] >= distance[i-1] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] + distance[i-5] >= distance[i-3]:\\n return True\\n \\n return False\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n if len(distance) < 4:\\n return False\\n \\n distance = [0, 0, 0] + distance\\n \\n if distance[3] >= distance[5]:\\n for i in range(6, len(distance)):\\n if distance[i] >= distance[i-2]:\\n return True\\n \\n else:\\n for i in range(4, len(distance)-1):\\n if distance[i] <= distance[i-2]:\\n if distance[i] < distance[i-2]-distance[i-4]:\\n for j in range(i+1, len(distance)-1):\\n if distance[j] >= distance[j-2]:\\n return True\\n else:\\n if (distance[i+1] >= distance[i-1]-distance[i-3]):\\n return True\\n for j in range(i+1, len(distance)):\\n if distance[j] >= distance[j-2]:\\n return True\\n break\\n return False\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n top = 0\\n bottom = 0\\n left = 0\\n right = 0\\n case = 0 # 0 means longer, 1 means equal to or shorter, 2 means extremely shorter\\n \\n for idx, dis in enumerate(distance):\\n if case == 0:\\n if idx % 4 == 0:\\n if dis <= left and dis >= left-right:\\n case = 1\\n elif dis < left-right:\\n case = 2\\n right = dis\\n elif idx % 4 == 1:\\n if dis <= bottom and dis >= bottom-top:\\n case = 1\\n elif dis < bottom-top:\\n case = 2\\n top = dis\\n elif idx % 4 == 2:\\n if dis <= right and dis >= right-left:\\n case = 1\\n elif dis < right-left:\\n case = 2\\n left = dis\\n elif idx % 4 == 3:\\n if dis <= top and dis >= top-bottom:\\n case = 1\\n elif dis < top-bottom:\\n case = 2\\n bottom = dis\\n elif case == 1:\\n if idx % 4 == 0:\\n if dis >= left-right:\\n return True\\n right = dis\\n elif idx % 4 == 1:\\n if dis >= bottom-top:\\n return True\\n top = dis\\n elif idx % 4 == 2:\\n if dis >= right-left:\\n return True\\n left = dis\\n elif idx % 4 == 3:\\n if dis >= top-bottom:\\n return True\\n bottom = dis\\n case = 2\\n elif case == 2:\\n if idx % 4 == 0:\\n if dis >= left:\\n return True\\n right = dis\\n elif idx % 4 == 1:\\n if dis >= bottom:\\n return True\\n top = dis\\n elif idx % 4 == 2:\\n if dis >= right:\\n return True\\n right = dis\\n elif idx % 4 == 3:\\n if dis >= top:\\n return True\\n bottom = dis\\n return False\\n \",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: list[int]) -> bool:\\n n = len(distance)\\n \\n # Loop over the distances\\n for i in range(3, n):\\n # Case 1: Fourth line crosses first line (i.e. sharp turn cross)\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n \\n # Case 2: Fifth line crosses first line\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n \\n # Case 3: Sixth line crosses first line\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\\n return True\\n \\n return False\\n\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n n = len(x)\\n for i in range(3, n):\\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]: return 1\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]: return 1\\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i - 1] <= x[i - 3] and x[i] >= x[i - 2] - x[i - 4]: return 1\\n return 0\\n\\n \",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: list[int]) -> bool:\\n # Check if the path crosses itself\\n n = len(distance)\\n if n < 4:\\n return False\\n \\n # Check each possible crossing condition\\n for i in range(3, n):\\n # Case 1: Fourth line crosses first line\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n # Case 2: Fifth line crosses first line\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n # Case 3: Fifth line crosses second line\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\\n return True\\n \\n return False\\n\\n# Example usage:\\nsol = Solution()\\n\\n# Example 1\\ndistance = [2,1,1,2]\\nprint(sol.isSelfCrossing(distance)) # Output: true\\n\\n# Example 2\\ndistance = [1,2,3,4]\\nprint(sol.isSelfCrossing(distance)) # Output: false\\n\\n# Example 3\\ndistance = [1,1,1,2,1]\\nprint(sol.isSelfCrossing(distance)) # Output: true\\n\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n for i in range(3, n):\\n # Case 1: Current line crosses the line 3 steps ahead.\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n # Case 2: Current line overlaps with the line 4 steps ahead.\\n if i >= 4:\\n if distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n # Case 3: Current line crosses the line 5 steps ahead.\\n if i >= 5:\\n if (distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and\\n distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]):\\n return True\\n return False\\n\\n# Example Usage:\\n\\n# Example 1:\\ndistance = [2, 1, 1, 2]\\nprint(Solution().isSelfCrossing(distance)) # Output: True\\n\\n# Example 2:\\ndistance = [1, 2, 3, 4]\\nprint(Solution().isSelfCrossing(distance)) # Output: False\\n\\n# Example 3:\\ndistance = [1, 1, 1, 2, 1]\\nprint(Solution().isSelfCrossing(distance)) # Output: True\\n\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, D: List[int]) -> bool:\\n for i in range(3, len(D)):\\n if D[i-3] >= D[i-1] and D[i] >= D[i-2]:\\n return True\\n if i >= 4 and D[i] + D[i-4] >= D[i-2] and D[i-1] == D[i-3]:\\n return True\\n if i >= 5 and D[i] <= D[i-2] and D[i-4] <= D[i-2] and D[i-5] <= D[i-3] and D[i-3] >= D[i-1] and D[i] + D[i-4] >= D[i-2] and D[i-1] + D[i-5] >= D[i-3]:\\n return True\\n return False\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n N = len(x)\\n for i in range(3, N):\\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]:\\n return True\\n\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\\n return True\\n\\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i - 1] <= x[i - 3] and x[i] >= x[i - 2] - x[i - 4]:\\n return True\\n\\n\\n \\n return False\\n\\n \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n for i in range(3, n):\\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\\n return True\\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\\n return True\\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\\n return True\\n return False\",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n N = len(x)\\n for i in range(3,N):\\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]:\\n return True\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i -2] <= x[i] + x[i - 4]:\\n return True\\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i -1] <= x[i -3] and x[i] >= x[i - 2] - x[i - 4]:\\n return True\\n return False\\n\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n for i in range(3, n):\\n # Case 1: Fourth line crosses the first line\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n # Case 2: Fifth line crosses the first line\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n # Case 3: Fifth line crosses the second line\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] + distance[i-5] >= distance[i-3] and distance[i-1] <= distance[i-3] and distance[i] <= distance[i-2]:\\n return True\\n return False\\n\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, arr: List[int]) -> bool:\\n for i in range(3, len(arr)):\\n if arr[i - 3] >= arr[i - 1] and arr[i] >= arr[i - 2]:\\n return True\\n\\n if i > 3 and arr[i - 3] == arr[i - 1] and arr[i - 2] <= arr[i] + arr[i - 4]:\\n return True\\n\\n if i > 4 and arr[i - 3] >= arr[i - 5] and arr[i - 3] >= arr[i - 1] and arr[i - 3]<= arr[i - 5] + arr[i - 1] and arr[i - 2] >= arr[i - 4] and arr[i - 2] >= arr[i] and arr[i - 2] <= arr[i - 4] + arr[i]:\\n return True\\n \\n return False\",\n \"runtime\": \"132\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n # If there are less than 4 values in the array, the path can't cross itself\\n if len(x) <= 3:\\n return False\\n\\n # Loop through the array starting from the 3rd index\\n for i in range(3, len(x)):\\n # Case 1: current line crosses the line 3 steps before it\\n # _______\\n # | |\\n # | |\\n # ________|______| <-- current line\\n # | |\\n # | |\\n # |__________| <-- line 3 steps before\\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\\n return True\\n \\n # Case 2: current line crosses the line 4 steps before it\\n # _____\\n # | |\\n # | |\\n # | |________\\n # | |\\n # | |\\n # |_______________| <-- current line\\n # line 4 steps before\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\\n return True\\n \\n # Case 3: current line crosses the line 5 steps before it\\n # ______\\n # | |\\n # | |\\n # |______| <-- line 5 steps before\\n # |\\n # |\\n # ______|_______\\n # | |\\n # | |\\n # |______________| <-- current line\\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\\n return True\\n\\n # If no crossing has been found, the path does not cross itself\\n return False\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n \\n # If the path has less than 4 movements, it cannot cross itself\\n if n < 4:\\n return False\\n \\n # Simulate the movement and check for intersections\\n for i in range(3, n):\\n # Case 1: Current line crosses the line 3 steps ahead of it\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n \\n # Case 2: Current line crosses the line 4 steps ahead of it\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n \\n # Case 3: Current line crosses the line 5 steps ahead of it\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] >= distance[i-2] - distance[i-4] and distance[i-1] >= distance[i-3] - distance[i-5] and distance[i-1] <= distance[i-3]:\\n return True\\n \\n return False\\n\\n# Example usage:\\nsolution = Solution()\\ndistance = [2,1,1,2]\\nprint(solution.isSelfCrossing(distance)) # Output: True\\n\\ndistance = [1,2,3,4]\\nprint(solution.isSelfCrossing(distance)) # Output: False\\n\\ndistance = [1,1,1,2,1]\\nprint(solution.isSelfCrossing(distance)) # Output: True\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n if n <= 3:\\n return False\\n\\n for i in range(3, n):\\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\\n return True\\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\\n return True\\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\\n return True\\n return False\",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n n = len(x)\\n for i in range(3, n):\\n # Fourth line crosses first line\\n if x[i] >= x[i-2] and x[i-1] <= x[i-3]:\\n return True\\n \\n # Fifth line crosses second line\\n if i >= 4 and x[i-1] == x[i-3] and x[i] + x[i-4] >= x[i-2]:\\n return True\\n \\n # Sixth line crosses third line\\n if i >= 5 and x[i-2] >= x[i-4] and x[i-1] <= x[i-3] and \\\\\\n x[i] + x[i-4] >= x[i-2] and x[i-1] + x[i-5] >= x[i-3]:\\n return True\\n \\n return False\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.isSelfCrossing([2,1,1,2])) # Should print True\\nprint(solution.isSelfCrossing([1,2,3,4])) # Should print False\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: list[int]) -> bool:\\n if len(x) <= 3:\\n return False\\n\\n for i in range(3, len(x)):\\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\\n return True\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\\n return True\\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\\n return True\\n\\n return False\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: list[int]) -> bool:\\n if len(x) <= 3:\\n return False\\n\\n for i in range(3, len(x)):\\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\\n return True\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\\n return True\\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\\n return True\\n\\n return False \",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n if n <= 3:\\n return False\\n \\n for i in range(3, n):\\n if distance[i-3] >= distance[i-1] and distance[i] >= distance[i-2]:\\n return True\\n \\n if i>3 and distance[i-3] == distance[i-1] and distance[i-2] <= distance[i] + distance[i-4]:\\n return True\\n \\n if i>4 and distance[i-3] >= distance[i-5] and distance[i-3] >= distance[i-1] and distance[i-3] <= distance[i-5] + distance[i-1] and distance[i-2] >= distance[i-4] and distance[i-2] >= distance[i] and distance[i-2] <= distance[i-4] + distance[i]:\\n return True\\n return False\",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n if n < 4:\\n return False\\n\\n for i in range(3, n):\\n # Case 1: Current line crosses the line 3 steps ahead of it.\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n\\n # Case 2: Current line crosses the line 4 steps ahead of it.\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n\\n # Case 3: Current line crosses the line 5 steps ahead of it.\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\\n return True\\n\\n return False\",\n \"runtime\": \"141\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n if n<4:\\n return False \\n \\n for i in range(3, n):\\n if distance[i-1]<=distance[i-3] and distance[i]>=distance[i-2]:\\n return True\\n if i>=4 and distance[i-1]==distance[i-3] and distance[i]+distance[i-4]>=distance[i-2]:\\n return True \\n if i>=5 and distance[i-2]>distance[i-4] and distance[i-1]+distance[i-5]>=distance[i-3] and distance[i-2]-distance[i-4]<=distance[i] and distance[i-1]<=distance[i-3]:\\n return True\\n return False\\n \",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n n = len(x)\\n\\n for i in range(3, n):\\n if x[i] >= x[i - 2] and x[i - 1]<= x[i - 3]:\\n return True\\n if i >= 4:\\n if x[i - 1] == x[i - 3] and x[i]+ x[i - 4] >= x[i - 2]:\\n return True\\n if i >= 5:\\n if x[i] + x[i - 4] >= x[i - 2] and x[i - 1] + x[i - 5] >= x[i - 3] and x[i - 2] > x[i - 4] and x[i - 3] > x[i - 1]:\\n return True\\n return False\\n \",\n \"runtime\": \"143\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n n = len(x)\\n for i in range(3, n):\\n if i >= 3 and x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]: return True\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]: return True\\n if i >= 5 and x[i - 2] >= x[i - 4] and x[i - 3] - x[i - 5] <= x[i - 1] <= x[i - 3] and x[i] >= x[i - 2] - x[i - 4]: return True\\n return False\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, d: List[int]) -> bool:\\n n = len(d)\\n\\n for i in range(3, n):\\n # case 1: fourth line hits first line\\n if d[i - 2] <= d[i] and d[i - 1] <= d[i - 3]:\\n return True\\n # case 2: fifth line hits first line\\n if 3 < i and d[i - 1] == d[i - 3] and d[i - 2] <= d[i] + d[i - 4]:\\n return True\\n # case 3: sixth line hits first line (loop around)\\n if 4 < i and d[i - 4] < d[i - 2] and d[i - 5] < d[i - 3] and d[i - 3] <= d[i - 1] + d[i - 5] and d[i - 2] <= d[i] + d[i - 4] and d[i - 1] <= d[i - 3]:\\n return True\\n return False\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n for i in range(3, n):\\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\\n return True\\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\\n return True\\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\\n return True\\n return False\",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n\\n \\n \\\"\\\"\\\"\\n Determines if a given path crosses itself.\\n\\n Args:\\n distance: List[int] - Distances moved in each direction.\\n\\n Returns:\\n bool - True if the path crosses itself, False otherwise.\\n \\\"\\\"\\\"\\n n = len(distance)\\n if n < 4:\\n return False # Less than 4 moves cannot cross\\n\\n for i in range(3, n):\\n # Case 1: Current line crosses the line 3 steps ahead\\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\\n return True\\n\\n # Case 2: Current line crosses the line 4 steps ahead\\n if i >= 4:\\n if (distance[i - 1] == distance[i - 3] and\\n distance[i] + distance[i - 4] >= distance[i - 2]):\\n return True\\n\\n # Case 3: Current line crosses the line 5 steps ahead\\n if i >= 5:\\n if (distance[i - 2] >= distance[i - 4] and\\n distance[i] >= distance[i - 2] - distance[i - 4] and\\n distance[i - 1] >= distance[i - 3] - distance[i - 5] and\\n distance[i - 1] <= distance[i - 3]):\\n return True\\n\\n return False\\n\\n \",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n for i in range(3, n):\\n if distance[i] >= distance[i - 2] and distance[i - 1] <= distance[i - 3]:\\n return True\\n if i >= 4 and distance[i - 1] == distance[i - 3] and distance[i] + distance[i - 4] >= distance[i - 2]:\\n return True\\n if i >= 5 and distance[i - 2] >= distance[i - 4] and distance[i] >= distance[i - 2] - distance[i - 4] and distance[i - 1] >= distance[i - 3] - distance[i - 5] and distance[i - 1] <= distance[i - 3]:\\n return True\\n return False\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n\\n for i in range(len(distance)):\\n if i-3 >= 0:\\n if abs(distance[i-1]) <= abs(distance[i-3]) and abs(distance[i]) >= abs(distance[i-2]):\\n print(\\\"i-3\\\")\\n return True\\n\\n if i-4 >= 0:\\n if abs(distance[i-1]) == abs(distance[i-3]) and abs(distance[i]) >= (abs(distance[i-2])-abs(distance[i-4])):\\n print(\\\"i-4\\\")\\n return True\\n\\n if i-5 >= 0:\\n if distance[i]+distance[i-4] >= distance[i-2] and distance[i-1]+distance[i-5] >= distance[i-3] and distance[i-2]>distance[i-4] and distance[i-3]>distance[i-1]:\\n print(\\\"i-5\\\")\\n return True\\n\\n return False\\n # how to tell if two vectors cross? \\n\\n # \\n # [(0,0), (2,0)]\\n # [(-1,1), (1,1)]\\n\\n\\n # vertical_walls = {}\\n # horizontal_walls = {}\\n\\n # cur_position = (0,0)\\n # for i in range(len(distance)):\\n # if i % 2 == 0:\\n # new_position = (cur_position[0], cur_position[1] + distance[i])\\n\\n # else:\\n # # this is a horizontal wall, moving horizontally \\n # new_position = (cur_position[0] + distance[i], cur_position[1])\\n\\n # for i in range(min(cur_position[1], new_position[1]), max(cur_position[1], new_position[1])+1):\\n # for walls in horizontal_walls.get(i, []):\\n # if min(walls[0], walls[1]) <= new_position[0] and new_position[0] <= max(walls[0], walls[1]) and cur_position != (walls[0], i) and cur_position != (walls[1], i):\\n # return True\\n\\n # for i in range(min(cur_position[0], new_position[0]), max(cur_position[0], new_position[0])+1):\\n # for walls in vertical_walls.get(i, []):\\n # if min(walls[0], walls[1]) <= new_position[1] and new_position[1] <= max(walls[0], walls[1]) and cur_position != (i, walls[0]) and cur_position != (i, walls[1]):\\n # return True\\n \\n # # add the walls \\n # if i % 2 == 0: \\n # # this is a vertical wall, moving vertically \\n # vertical_walls[cur_position[0]] = vertical_walls.get(cur_position[0], []) + [(cur_position[1], new_position[1])]\\n\\n # else:\\n # horizontal_walls[cur_position[1]] = horizontal_walls.get(cur_position[1], []) + [(cur_position[0], new_position[0])]\\n\\n # cur_position = new_position\\n\\n # return False\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n x, y = 0, 0\\n\\n walls = [None, None, None, None]\\n enclosed = False\\n\\n for idx, d in enumerate(distance):\\n\\n x_new, y_new = x, y\\n\\n if idx % 4 == 0:\\n y_new += d\\n elif idx % 4 == 2:\\n y_new -= d\\n elif idx % 4 == 1:\\n x_new -= d\\n else:\\n x_new += d\\n\\n if x == x_new: # verticle movement\\n wall = walls[(idx - 3) % 4]\\n if wall is not None:\\n x0, y0, x1, y1 = wall\\n assert y0 == y1\\n if min(x0, x1) <= x <= max(x0, x1) and min(y, y_new) <= y0 <= max(y, y_new):\\n return True\\n wall = walls[idx % 4]\\n if wall is not None:\\n x0, y0, x1, y1 = wall\\n if (x_new, y_new) == (x0, y0):\\n return True\\n else: # horizontal movement\\n assert y == y_new\\n wall = walls[(idx - 3) % 4]\\n if wall is not None:\\n x0, y0, x1, y1 = wall\\n assert x0 == x1\\n if min(y0, y1) <= y <= max(y0, y1) and min(x, x_new) <= x0 <= max(x, x_new):\\n return True\\n\\n # find the closest wall it would intersect if it moved infinitely in the next direction\\n # if such a wall exists, then the path is enclosed\\n\\n if not enclosed and walls[idx % 4] is not None:\\n wx0, wy0, wx1, wy1 = walls[idx % 4]\\n up_case = idx % 4 == 0 and wy0 <= y_new <= wy1\\n down_case = idx % 4 == 2 and wy1 <= y_new <= wy0\\n left_case = idx % 4 == 1 and wx1 <= x_new <= wx0\\n right_case = idx % 4 == 3 and wx0 <= x_new <= wx1\\n if up_case or down_case or left_case or right_case:\\n walls[(idx - 2) % 4] = walls[idx % 4]\\n enclosed = True\\n \\n if not enclosed and walls[(idx - 2) % 4] is not None:\\n wx0, wx1, wy0, wy1 = walls[(idx - 2) % 4]\\n up_case = idx % 4 == 0 and wy1 <= y_new <= wy0\\n down_case = idx % 4 == 2 and wy0 <= y_new <= wy1\\n left_case = idx % 4 == 1 and wx0 <= x_new <= wx1\\n right_case = idx % 4 == 3 and wx1 <= x_new <= wx0\\n if up_case or down_case or left_case or right_case:\\n enclosed = True\\n\\n walls[idx % 4] = (x, y, x_new, y_new)\\n x, y = x_new, y_new\\n\\n return False\\n\",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n edges = [(1, -1, float(\\\"inf\\\"))] * 6 # boundaries with 2 dummy ones\\n x1, x2 = 0, 0\\n for idx, dist in enumerate(distance):\\n if (idx & 0x1) ^ (idx>>1 & 0x1): # 1 or 2, not 0, 3\\n dist = -dist\\n \\n a, b, c, d = edges[idx % 6], edges[(idx+1) % 6], edges[(idx+2) % 6], edges[(idx+3) % 6]\\n if any((\\n x1 == a[2] and (x2 < a[0] and x2 + dist >= a[0] or x2 > a[0] and x2 + dist >= a[0]),\\n b[0] <= -x1 <= b[1] and -x2 < b[2] and -x2 - dist >= b[2],\\n x1 == c[2] and (x2 < c[0] and x2 + dist >= c[0] or x2 > c[0] and x2 + dist <= c[0]),\\n d[0] <= -x1 <= d[1] and x2 < d[2] and x2 + dist >= d[2]\\n )):\\n return True\\n edges[idx % 6] = (min(x2, x2 + dist), max(x2, x2 + dist), x1)\\n x1, x2 = -x2 - dist, -x1\\n return False\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n current = [0, 0]\\n north = [0, 0, 0]\\n max_north = [0, 0, 0]\\n west = [0, 0, 0]\\n max_west = [0, 0, 0]\\n south = [0, 0, 0]\\n max_south = [0, 0, 0]\\n east = [0, 0, 0]\\n max_east = [0, 0, 0]\\n smax_north = [0,0,0]\\n smax_east = [0,0,0]\\n smax_south = [0,0,0]\\n smax_west = [0,0,0]\\n\\n direction = -1\\n\\n for i in distance:\\n direction += 1\\n\\n if direction == 3:\\n east[0] = current[0]\\n east[1] = current[1]\\n east[2] = i\\n if east[1] <= max_east[1]:\\n smax_east = list(max_east)\\n max_east = list(east)\\n\\n p = current[0]\\n\\n current[0] += i\\n\\n if p < north[0] and current[0] >= north[0] and current[1] >= north[1] and current[1] <= north[1] + north[2]:\\n return True\\n\\n if p < smax_south[0] and current[0] >= smax_south[0] and current[1] <= smax_south[1] and current[1] >= smax_south[1] - smax_south[2]:\\n return True\\n\\n if direction == 2:\\n south[0] = current[0]\\n south[1] = current[1]\\n south[2] = i\\n if south[0] <= max_south[0]:\\n smax_south = max_south.copy()\\n max_south = south.copy()\\n\\n p = current[1]\\n\\n current[1] -= i\\n\\n if p > east[1] and current[1] <= east[1] and current[0] >= east[0] and current[0] <= east[0] + east[2]:\\n return True\\n\\n if p > smax_west[1] and current[1] <= smax_west[1] and current[0] <= smax_west[0] and current[0] >= smax_west[0] - smax_west[2]:\\n return True\\n\\n if direction == 1:\\n west[0] = current[0]\\n west[1] = current[1]\\n west[2] = i\\n if west[1] >= max_west[1]:\\n smax_west = list(max_west)\\n max_west = list(west)\\n \\n p = current[0]\\n \\n current[0] -= i\\n\\n print(p)\\n print(current)\\n print(max_north)\\n print(smax_north)\\n\\n if p > south[0] and current[0] <= south[0] and current[1] <= south[1] and current[1] >= south[1] - south[2]:\\n return True\\n\\n if p > smax_north[0] and current[0] <= smax_north[0] and current[1] >= smax_north[1] and current[1] <= smax_north[1] + smax_north[2]:\\n return True\\n\\n if direction == 0:\\n north[0] = current[0]\\n north[1] = current[1]\\n north[2] = i\\n if north[0] >= max_north[0]:\\n smax_north = list(max_north)\\n max_north = list(north)\\n\\n p = current[1]\\n \\n current[1] += i\\n \\n if p < west[1] and current[1] >= west[1] and current[0] <= west[0] and current[0] >= west[0] - west[2]:\\n return True\\n\\n if p < smax_east[1] and current[1] >= smax_east[1] and current[0] >= smax_east[0] and current[0] <= smax_east[0] + smax_east[2]:\\n return True\\n \\n\\n\\n if direction == 3:\\n direction = -1\\n\\n return False\\n \\n \",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"def point_intersection(qa0,qb0,pc0,walls):\\n for qa,qb,pc in walls[1:]:\\n if pc0==pc:\\n if qa<=qa0<=qb or qa<=qb0<=qb:\\n return True\\n return False\\nposInf = float('inf')\\nclass Solution:\\n def isSelfCrossing(self, A: List[int]) -> bool:\\n if len(A)<4:\\n return False\\n i,j = 0,0\\n di,dj = 0,1\\n iwalls, jwalls = [ [posInf]*3 for _ in range(3)], [ [posInf]*3 for _ in range(3)]\\n for x in A:\\n i0,j0 = i,j\\n i += di*x\\n j += dj*x\\n #\\n if di: # di: p,q = i,j\\n q,p1,p2 = j, min(i0,i),max(i0,i)\\n walls = iwalls[1:]\\n else: # dj: p,q = j,i\\n q,p1,p2 = i, min(j0,j),max(j0,j)\\n walls = jwalls[1:]\\n # Wall Collision Detector\\n for qa,qb,pc in walls:\\n if qa<=q<=qb and p1<=pc<=p2:\\n return True\\n # Point Collision Detector\\n parallels = iwalls if dj else jwalls\\n if point_intersection(p1,p2,q, parallels ):\\n return True\\n # Build New Walls ( dj movements span horizontal walls (iwalls) )\\n if dj:\\n iwalls = [ [p1,p2,q], *iwalls[:-1] ]\\n else:\\n jwalls = [ [p1,p2,q], *jwalls[:-1] ]\\n di,dj = -dj,di\\n return False\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n # chord i doesnt intersect\\n # If interesects, it intersects with i-3 or i-5\\n\\n def checkintersection(p1,p2,q1,q2):\\n # Line between p1 and p2\\n # Line between q1 and q2\\n # Assume one is vertical and other horizontal\\n\\n if p1[0]==p2[0]:\\n # Line p is vertical\\n if min(p1[1],p2[1])<=q1[1]<=max(p1[1],p2[1]) and min(q1[0],q2[0])<=p1[0]<=max(q1[0],q2[0]):\\n return True\\n else:\\n return checkintersection(q1,q2,p1,p2)\\n return False\\n\\n points = []\\n currposx = 0\\n currposy = 0\\n dirx = 0\\n diry = 1\\n n = len(distance)\\n points.append((0,0))\\n for i in range(n):\\n currposx+=dirx*distance[i]\\n currposy+=diry*distance[i]\\n dirx,diry = -diry,dirx\\n points.append((currposx,currposy))\\n\\n if i>=3:\\n if checkintersection(points[i-3],points[i-2],points[i],points[i+1]):\\n return True\\n if i>=5:\\n if checkintersection(points[i-5],points[i-4],points[i],points[i+1]):\\n return True\\n elif i==4:\\n # It can overlap with chord 0. No -1 to check\\n if currposx==0 and currposy>=0:\\n return True\\n return False\\n\",\n \"runtime\": \"200\"\n },\n {\n \"code\": \"class Solution:\\n def intersects(self, seg1, seg2):\\n # assumes south -> north, west -> east\\n p1, p2 = seg1\\n q1, q2 = seg2\\n if p1[0] == p2[0]: # south -> north\\n if q1[0] == q2[0]:\\n if p1[0] != q1[0]:\\n return False\\n return (q1[1] <= p1[1] <= q2[1]) or (q1[1] <= p2[1] <= q2[1]) or (p1[1] <= q1[1] <= p2[1]) or (p1[1] <= q2[1] <= p2[1])\\n else: # p = south -> north, q = west -> east\\n return (p1[1] <= q1[1] <= p2[1]) and (q1[0] <= p1[0] <= q2[0])\\n else: # west -> east\\n if q1[1] == q2[1]:\\n if p1[1] != q1[1]:\\n return False\\n return (q1[0] <= p1[0] <= q2[0]) or (q1[0] <= p2[0] <= q2[0]) or (p1[0] <= q1[0] <= p2[0]) or (p1[0] <= q2[0] <= p2[0])\\n else: # q = south -> north, p = west -> east\\n return (q1[1] <= p1[1] <= q2[1]) and (p1[0] <= q1[0] <= p2[0])\\n\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n point = (0, 0)\\n last_seg = None\\n #traj = [point]\\n segs = set()\\n dir_map = {\\n 0: (0, 1),\\n 1: (-1, 0),\\n 2: (0, -1),\\n 3: (1, 0)\\n }\\n winding_down = False\\n for i, d in enumerate(distance):\\n if i >= 2 and distance[i-2] >= d and not winding_down:\\n winding_down = True\\n\\n dx, dy = dir_map[i % 4]\\n new_point = (point[0] + dx * d, point[1] + dy * d)\\n \\n if i % 4 in {0, 3}:\\n new_seg = (point, new_point)\\n elif i % 4 in {1, 2}:\\n new_seg = (new_point, point)\\n \\n if winding_down:\\n for seg in segs:\\n if self.intersects(seg, new_seg) and seg != last_seg:\\n return True\\n #traj.append(new_point)\\n segs.add(new_seg)\\n last_seg = new_seg\\n point = new_point\\n \\n return False\",\n \"runtime\": \"202\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":54,"string":"54"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n b=c=d=e=f=0\n for a in distance:\n if d>=b>0 and (a>=c or a>=c-e>=0 and f>=d-b): return True\n b,c,d,e,f=a,b,c,d,e\n return False","memory":"25100"},{"code":"class Solution:\n def isSelfCrossing(self, D: List[int]) -> bool:\n for i in range(3, len(D)):\n if D[i-3] >= D[i-1] and D[i] >= D[i-2]:\n return True\n if i >= 4 and D[i] + D[i-4] >= D[i-2] and D[i-1] == D[i-3]:\n return True\n if i >= 5 and D[i] <= D[i-2] and D[i-4] <= D[i-2] and D[i-5] <= D[i-3] and D[i-3] >= D[i-1] and D[i] + D[i-4] >= D[i-2] and D[i-1] + D[i-5] >= D[i-3]:\n return True\n return False","memory":"25200"},{"code":"class Solution:\n def isSelfCrossing(self, x: list[int]) -> bool:\n if len(x) <= 3:\n return False\n\n for i in range(3, len(x)):\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\n return True\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\n return True\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\n return True\n\n return False ","memory":"25300"},{"code":"class Solution:\n def isSelfCrossing(self, x: List[int]) -> bool:\n n = len(x)\n for i in range(3, n):\n # Fourth line crosses first line\n if x[i] >= x[i-2] and x[i-1] <= x[i-3]:\n return True\n \n # Fifth line crosses second line\n if i >= 4 and x[i-1] == x[i-3] and x[i] + x[i-4] >= x[i-2]:\n return True\n \n # Sixth line crosses third line\n if i >= 5 and x[i-2] >= x[i-4] and x[i-1] <= x[i-3] and \\\n x[i] + x[i-4] >= x[i-2] and x[i-1] + x[i-5] >= x[i-3]:\n return True\n \n return False\n\n# Test the solution\nsolution = Solution()\nprint(solution.isSelfCrossing([2,1,1,2])) # Should print True\nprint(solution.isSelfCrossing([1,2,3,4])) # Should print False","memory":"25400"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n if n <= 3:\n return False\n \n for i in range(3, n):\n if distance[i-3] >= distance[i-1] and distance[i] >= distance[i-2]:\n return True\n \n if i>3 and distance[i-3] == distance[i-1] and distance[i-2] <= distance[i] + distance[i-4]:\n return True\n \n if i>4 and distance[i-3] >= distance[i-5] and distance[i-3] >= distance[i-1] and distance[i-3] <= distance[i-5] + distance[i-1] and distance[i-2] >= distance[i-4] and distance[i-2] >= distance[i] and distance[i-2] <= distance[i-4] + distance[i]:\n return True\n return False","memory":"25400"},{"code":"class Solution:\n def isSelfCrossing(self, distance: List[int]) -> bool:\n n = len(distance)\n if n < 4:\n return False\n\n for i in range(3, n):\n # Case 1: Current line crosses the line 3 steps ahead of it.\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\n return True\n\n # Case 2: Current line crosses the line 4 steps ahead of it.\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\n return True\n\n # Case 3: Current line crosses the line 5 steps ahead of it.\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\n return True\n\n return False","memory":"25500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n b=c=d=e=f=0\\n for a in distance:\\n if d>=b>0 and (a>=c or a>=c-e>=0 and f>=d-b): return True\\n b,c,d,e,f=a,b,c,d,e\\n return False\",\n \"memory\": \"25100\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, D: List[int]) -> bool:\\n for i in range(3, len(D)):\\n if D[i-3] >= D[i-1] and D[i] >= D[i-2]:\\n return True\\n if i >= 4 and D[i] + D[i-4] >= D[i-2] and D[i-1] == D[i-3]:\\n return True\\n if i >= 5 and D[i] <= D[i-2] and D[i-4] <= D[i-2] and D[i-5] <= D[i-3] and D[i-3] >= D[i-1] and D[i] + D[i-4] >= D[i-2] and D[i-1] + D[i-5] >= D[i-3]:\\n return True\\n return False\",\n \"memory\": \"25200\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: list[int]) -> bool:\\n if len(x) <= 3:\\n return False\\n\\n for i in range(3, len(x)):\\n if x[i - 2] <= x[i] and x[i - 1] <= x[i - 3]:\\n return True\\n if i >= 4 and x[i - 1] == x[i - 3] and x[i - 2] <= x[i] + x[i - 4]:\\n return True\\n if i >= 5 and x[i - 4] <= x[i - 2] and x[i - 2] <= x[i] + x[i - 4] and x[i - 1] <= x[i - 3] and x[i - 3] <= x[i - 1] + x[i - 5]:\\n return True\\n\\n return False \",\n \"memory\": \"25300\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, x: List[int]) -> bool:\\n n = len(x)\\n for i in range(3, n):\\n # Fourth line crosses first line\\n if x[i] >= x[i-2] and x[i-1] <= x[i-3]:\\n return True\\n \\n # Fifth line crosses second line\\n if i >= 4 and x[i-1] == x[i-3] and x[i] + x[i-4] >= x[i-2]:\\n return True\\n \\n # Sixth line crosses third line\\n if i >= 5 and x[i-2] >= x[i-4] and x[i-1] <= x[i-3] and \\\\\\n x[i] + x[i-4] >= x[i-2] and x[i-1] + x[i-5] >= x[i-3]:\\n return True\\n \\n return False\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.isSelfCrossing([2,1,1,2])) # Should print True\\nprint(solution.isSelfCrossing([1,2,3,4])) # Should print False\",\n \"memory\": \"25400\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n if n <= 3:\\n return False\\n \\n for i in range(3, n):\\n if distance[i-3] >= distance[i-1] and distance[i] >= distance[i-2]:\\n return True\\n \\n if i>3 and distance[i-3] == distance[i-1] and distance[i-2] <= distance[i] + distance[i-4]:\\n return True\\n \\n if i>4 and distance[i-3] >= distance[i-5] and distance[i-3] >= distance[i-1] and distance[i-3] <= distance[i-5] + distance[i-1] and distance[i-2] >= distance[i-4] and distance[i-2] >= distance[i] and distance[i-2] <= distance[i-4] + distance[i]:\\n return True\\n return False\",\n \"memory\": \"25400\"\n },\n {\n \"code\": \"class Solution:\\n def isSelfCrossing(self, distance: List[int]) -> bool:\\n n = len(distance)\\n if n < 4:\\n return False\\n\\n for i in range(3, n):\\n # Case 1: Current line crosses the line 3 steps ahead of it.\\n if distance[i] >= distance[i-2] and distance[i-1] <= distance[i-3]:\\n return True\\n\\n # Case 2: Current line crosses the line 4 steps ahead of it.\\n if i >= 4 and distance[i-1] == distance[i-3] and distance[i] + distance[i-4] >= distance[i-2]:\\n return True\\n\\n # Case 3: Current line crosses the line 5 steps ahead of it.\\n if i >= 5 and distance[i-2] >= distance[i-4] and distance[i] + distance[i-4] >= distance[i-2] and distance[i-1] <= distance[i-3] and distance[i-1] + distance[i-5] >= distance[i-3]:\\n return True\\n\\n return False\",\n \"memory\": \"25500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":6,"string":"6"}}},{"rowIdx":264,"cells":{"question_id":{"kind":"number","value":336,"string":"336"},"name":{"kind":"string","value":"palindrome-pairs"},"content":{"kind":"string","value":"<p>You are given a <strong>0-indexed</strong> array of <strong>unique</strong> strings <code>words</code>.</p>\n\n<p>A <strong>palindrome pair</strong> is a pair of integers <code>(i, j)</code> such that:</p>\n\n<ul>\n\t<li><code>0 <= i, j < words.length</code>,</li>\n\t<li><code>i != j</code>, and</li>\n\t<li><code>words[i] + words[j]</code> (the concatenation of the two strings) is a <span data-keyword=\"palindrome-string\">palindrome</span>.</li>\n</ul>\n\n<p>Return <em>an array of all the <strong>palindrome pairs</strong> of </em><code>words</code>.</p>\n\n<p>You must write an algorithm with <code>O(sum of words[i].length)</code> runtime complexity.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> words = ["abcd","dcba","lls","s","sssll"]\n<strong>Output:</strong> [[0,1],[1,0],[3,2],[2,4]]\n<strong>Explanation:</strong> The palindromes are ["abcddcba","dcbaabcd","slls","llssssll"]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> words = ["bat","tab","cat"]\n<strong>Output:</strong> [[0,1],[1,0]]\n<strong>Explanation:</strong> The palindromes are ["battab","tabbat"]\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> words = ["a",""]\n<strong>Output:</strong> [[0,1],[1,0]]\n<strong>Explanation:</strong> The palindromes are ["a","a"]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= words.length <= 5000</code></li>\n\t<li><code>0 <= words[i].length <= 300</code></li>\n\t<li><code>words[i]</code> consists of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":35.61398523321333,"string":"35.613985"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","hash-table","string","trie"],"string":"[\n \"array\",\n \"hash-table\",\n \"string\",\n \"trie\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"363\", 0.7960000000000002], [\"444\", 0.0995], [\"525\", 0.199], [\"606\", 0.0995], [\"687\", 0.0995], [\"768\", 0.0995], [\"849\", 0.0995], [\"929\", 1.8904999999999998], [\"1010\", 15.124000000000013], [\"1091\", 0.0995], [\"1172\", 0.398], [\"1253\", 0.2985], [\"1334\", 0.199], [\"1415\", 0.2985], [\"1496\", 0.2985], [\"1577\", 1.9899999999999993], [\"1658\", 1.6914999999999998], [\"1739\", 2.3879999999999995], [\"1820\", 7.959999999999996], [\"1901\", 6.5669999999999975], [\"1981\", 2.4875], [\"2062\", 3.183999999999999], [\"2143\", 10.0495], [\"2224\", 4.875499999999998], [\"2305\", 4.079499999999999], [\"2386\", 3.780999999999999], [\"2467\", 3.0844999999999994], [\"2548\", 5.870499999999997], [\"2629\", 3.482499999999999], [\"2710\", 2.1889999999999996], [\"2791\", 1.6914999999999996], [\"2872\", 0.8955000000000002], [\"2953\", 0.5970000000000001], [\"3033\", 0.49750000000000005], [\"3114\", 0.398], [\"3195\", 0.2985], [\"3276\", 0.2985], [\"3357\", 0.398], [\"3438\", 0.2985], [\"3519\", 0.0995], [\"3600\", 0.0995], [\"3681\", 0.0995], [\"3762\", 0.199], [\"3843\", 0.6965000000000001], [\"3924\", 0.0995], [\"4005\", 0.0995], [\"4086\", 0.0995], [\"4166\", 0.0995], [\"4247\", 0.0995], [\"4328\", 0.0995], [\"4409\", 0.0995], [\"4490\", 0.0995], [\"4571\", 0.0995], [\"4652\", 0.0995], [\"4733\", 0.0995], [\"4814\", 0.0995], [\"4895\", 0.199], [\"4976\", 0.199], [\"5057\", 0.0995], [\"5138\", 0.0995], [\"5218\", 0.0995], [\"5299\", 0.0995], [\"5380\", 0.0995], [\"5461\", 0.0995], [\"5542\", 0.0995], [\"5623\", 0.199], [\"5704\", 0.0995], [\"5785\", 0.0995], [\"5866\", 0.0995], [\"5947\", 0.0995], [\"6028\", 0.0995], [\"6109\", 0.0995], [\"6190\", 0.0995], [\"6270\", 0.0995], [\"6351\", 0.0995], [\"6432\", 0.0995], [\"6513\", 0.0995], [\"6594\", 0.0995], [\"6675\", 0.49750000000000005], [\"6756\", 0.398]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"29508\", 75.12400000000001], [\"33326\", 0.8955000000000001], [\"37143\", 0.0995], [\"40961\", 0.0995], [\"44778\", 0.398], [\"48596\", 0.199], [\"52413\", 0.199], [\"56231\", 0.0995], [\"60048\", 0.0995], [\"63866\", 0.0995], [\"67683\", 0.199], [\"71501\", 0.0995], [\"75318\", 0.199], [\"79136\", 0.199], [\"82953\", 0.199], [\"86771\", 0.199], [\"90588\", 0.0995], [\"94406\", 0.199], [\"98223\", 0.0995], [\"102041\", 0.199], [\"105858\", 0.0995], [\"109676\", 0.0995], [\"113493\", 0.0995], [\"117311\", 0.199], [\"121128\", 0.0995], [\"124946\", 0.0995], [\"128763\", 0.0995], [\"132581\", 0.0995], [\"136398\", 0.0995], [\"140216\", 0.0995], [\"144033\", 0.0995], [\"147851\", 0.0995], [\"151668\", 0.0995], [\"155486\", 0.0995], [\"159303\", 0.0995], [\"163121\", 0.0995], [\"166938\", 0.199], [\"170756\", 0.0995], [\"174573\", 0.0995], [\"178391\", 0.0995], [\"182208\", 0.0995], [\"186026\", 1.0945], [\"189843\", 1.393], [\"193661\", 0.597], [\"197478\", 1.4925], [\"201296\", 0.6965], [\"205113\", 0.0995], [\"208931\", 0.0995], [\"212748\", 0.0995], [\"216566\", 0.0995], [\"220383\", 0.0995], [\"224201\", 0.0995], [\"228018\", 0.0995], [\"231836\", 0.0995], [\"235653\", 0.0995], [\"239471\", 0.0995], [\"243288\", 0.0995], [\"247106\", 0.4975], [\"250923\", 0.6965], [\"254741\", 1.2935], [\"258558\", 3.1841], [\"262376\", 0.995], [\"266193\", 0.2985], [\"270011\", 0.0995], [\"273828\", 0.0995], [\"277646\", 0.0995]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \"\"\"\n answers = list()\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n s1 = words[i] + words[j]\n s2 = words[j] + words[i]\n if s1 == s1[::-1]:\n answers.append([i, j])\n if s2 == s2[::-1]:\n answers.append([j, i])\n return answers\n\n word_dict = { word: index for index, word in enumerate(words) }\n result = []\n\n for index, word in enumerate(words):\n for j in range(len(word) + 1):\n left = word[:j]\n reversed_left = left[::-1]\n right = word[j:]\n reversed_right = right[::-1]\n\n if reversed_left in word_dict \\\n and word_dict[reversed_left] != index \\\n and right == reversed_right:\n result.append([index, word_dict[reversed_left]])\n \n if j > 0 \\\n and reversed_right in word_dict \\\n and word_dict[reversed_right] != index \\\n and left == reversed_left:\n result.append([word_dict[reversed_right], index])\n \n return result\n \"\"\"\n\n res = []\n words = sorted(chain(\n ((i, w, False) for i, w in enumerate(words)), \n ((i, w[::-1], True) for i, w in enumerate(words))),\n key=lambda x: x[1])\n \n for i, (idx1, w1, is_reversed1) in enumerate(words):\n for j in range(i + 1, len(words)):\n idx2, w2, is_reversed2 = words[j]\n if w2.startswith(w1):\n if is_reversed1 == is_reversed2:\n continue\n rest = w2[len(w1):]\n if idx1 != idx2 and rest == rest[::-1]:\n res += [(idx1, idx2) if is_reversed2 else (idx2, idx1)]\n else:\n break\n return res","runtime":"363"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \"\"\"\n answers = list()\n for i in range(len(words)):\n for j in range(i+1, len(words)):\n s1 = words[i] + words[j]\n s2 = words[j] + words[i]\n if s1 == s1[::-1]:\n answers.append([i, j])\n if s2 == s2[::-1]:\n answers.append([j, i])\n return answers\n\n word_dict = { word: index for index, word in enumerate(words) }\n result = []\n\n for index, word in enumerate(words):\n for j in range(len(word) + 1):\n left = word[:j]\n reversed_left = left[::-1]\n right = word[j:]\n reversed_right = right[::-1]\n\n if reversed_left in word_dict \\\n and word_dict[reversed_left] != index \\\n and right == reversed_right:\n result.append([index, word_dict[reversed_left]])\n \n if j > 0 \\\n and reversed_right in word_dict \\\n and word_dict[reversed_right] != index \\\n and left == reversed_left:\n result.append([word_dict[reversed_right], index])\n \n return result\n \"\"\"\n\n res = []\n words = sorted(chain(\n ((i, w, False) for i, w in enumerate(words)), \n ((i, w[::-1], True) for i, w in enumerate(words))),\n key=lambda x: x[1])\n \n for i, (idx1, w1, is_reversed1) in enumerate(words):\n for j in range(i + 1, len(words)):\n idx2, w2, is_reversed2 = words[j]\n if w2.startswith(w1):\n if is_reversed1 == is_reversed2:\n continue\n rest = w2[len(w1):]\n if idx1 != idx2 and rest == rest[::-1]:\n res += [(idx1, idx2) if is_reversed2 else (idx2, idx1)]\n else:\n break\n return res","runtime":"363"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = {}\n for i,w in enumerate(words):\n node = trie\n for letter in w[::-1]:\n node = node.setdefault(letter, {})\n node['$'] = i\n ans = []\n\n def gen(node, string):\n ans = set()\n if '$' in node and string == string[::-1]: ans.add(node['$'])\n for letter in node:\n if letter != '$':\n ans |= gen(node[letter], string + letter)\n return ans\n\n for i,w in enumerate(words):\n node = trie\n k = len(w)\n idx = 0\n while idx < k:\n letter = w[idx]\n if '$' in node:\n if w[idx:] == w[idx:][::-1] and i != node['$']:\n ans.append([i, node['$']])\n if letter in node:\n node = node[letter]\n idx += 1\n else: break\n if idx == k:\n # generate all subsequent strs\n candidates = gen(node, \"\")\n for j in candidates:\n if i != j: ans.append([i,j])\n return ans","runtime":"444"},{"code":"class Solution:\n\n # TODO: optimize by pre-computing longest palindrome substrings centered around\n # each index for all words; this can then be used when checking the unmatched\n # part of both the iterated word, and the words found from the suffix-trie\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n # build suffix-trie consisting of all given words\n suffix_trie = {}\n for i, w in enumerate(words):\n node = suffix_trie\n for c in w[::-1]:\n node = node.setdefault(c, {})\n node[\"*\"] = i\n\n res = []\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\n node = suffix_trie\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\n\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\"a\", \"\") & (\"lls\", \"ll\")\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n res.append((i, node[\"*\"]))\n \n if c in node: # keep matching current-`w` against suffix-trie\n node = node[c]\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\n break\n else: # the entire current-`w` found as a prefix in the suffix-trie\n for j in Solution.get_unmatched_palin_substring_idxs(node):\n if i != j:\n res.append((i, j))\n\n return res\n\n\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\n @staticmethod\n def get_unmatched_palin_substring_idxs(trie_node):\n ss_idxs = {}\n def _fetch(node, ss): \n for c, nn in node.items():\n if c == \"*\":\n ss_idxs[ss] = node[c]\n else:\n _fetch(nn, f\"{ss}{c}\")\n _fetch(trie_node, \"\")\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]","runtime":"525"},{"code":"class Solution:\n\n # TODO: optimize by pre-computing longest palindrome substrings centered around\n # each index for all words; this can then be used when checking the unmatched\n # part of both the iterated word, and the words found from the suffix-trie\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n # build suffix-trie consisting of all given words\n suffix_trie = {}\n for i, w in enumerate(words):\n node = suffix_trie\n for c in w[::-1]: node = node.setdefault(c, {})\n node[\"*\"] = i\n\n res = []\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\n node = suffix_trie\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\"a\", \"\") & (\"lls\", \"ll\")\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]: res.append((i, node[\"*\"]))\n \n if c in node: node = node[c]\n else: break\n else: # the entire current-`w` found as a prefix in the suffix-trie\n for j in Solution.get_unmatched_palin_substring_idxs(node):\n if i != j: res.append((i, j))\n\n return res\n\n\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\n @staticmethod\n def get_unmatched_palin_substring_idxs(trie_node):\n ss_idxs = {}\n def _fetch(node, ss): \n for c, nn in node.items():\n if c == \"*\": ss_idxs[ss] = node[c]\n else: _fetch(nn, f\"{ss}{c}\")\n _fetch(trie_node, \"\")\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]","runtime":"525"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # build suffix-trie consisting of all given words\n suffix_trie = {}\n for i, w in enumerate(words):\n node = suffix_trie\n for c in w[::-1]:\n node = node.setdefault(c, {})\n node[\"*\"] = i\n\n res = []\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\n node = suffix_trie\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\n\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\"a\", \"\") & (\"lls\", \"ll\")\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n res.append((i, node[\"*\"]))\n \n if c in node: # keep matching current-`w` against suffix-trie\n node = node[c]\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\n break\n else: # the entire current-`w` found as a prefix in the suffix-trie\n for j in Solution.get_unmatched_palin_substring_idxs(node):\n if i != j:\n res.append((i, j))\n\n return res\n\n\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\n @staticmethod\n def get_unmatched_palin_substring_idxs(trie_node):\n ss_idxs = {}\n def _fetch(node, ss): \n for c, nn in node.items():\n if c == \"*\":\n ss_idxs[ss] = node[c]\n else:\n _fetch(nn, f\"{ss}{c}\")\n _fetch(trie_node, \"\")\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]","runtime":"606"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n\n def check_palindrome(s, i, j):\n subs = s[i:j]\n return subs == subs[::-1]\n \n reverse_words_dict = {word[::-1]:i for i, word in enumerate(words)}\n reverse_words_set = set([word for word in reverse_words_dict.keys()])\n\n ret = []\n\n for i, word in enumerate(words):\n \n # 1) check if reverse of \"word\" exists\n\n if word in reverse_words_set:\n if i != reverse_words_dict[word]:\n ret.append([i, reverse_words_dict[word]])\n\n # 2) for each palindromic prefix, check if prefix exists\n # don't double count whole word prefix\n \n for j in range(1, len(word)+1):\n if (word[j:] in reverse_words_set) and check_palindrome(word, 0, j):\n if i != reverse_words_dict[word[j:]]:\n ret.append([ reverse_words_dict[word[j:]], i])\n\n # 3) for each palindromic suffix, check if rest of word exists\n # don't double count whole word prefix\n\n for j in range(0, len(word)):\n if (word[:j] in reverse_words_set) and check_palindrome(word, j, len(word)):\n if i != reverse_words_dict[word[:j]]:\n ret.append([i, reverse_words_dict[word[:j]]])\n \n return ret","runtime":"687"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n trie = {}\n\n for i in range(len(words)):\n node = trie \n for le in words[i][::-1]:\n if le not in node:\n node[le] = {}\n node = node[le]\n node['end'] = i\n \n def checkpal(word):\n i = 0 \n j = len(word)-1\n while i < j:\n if word[i] != word[j]:\n return False \n else:\n i += 1\n j -= 1\n return True\n \n\n def backtrack(node, curr):\n result = []\n if 'end' in node:\n if checkpal(curr):\n result.append(node['end'])\n \n for n in node:\n if n != 'end':\n result += backtrack(node[n], curr+n)\n\n return result\n \n \n ans = []\n\n for i in range(len(words)):\n node = trie\n valid = True\n for j in range(len(words[i])):\n if 'end' in node and checkpal(words[i][j::]):\n ans.append([i, node['end']])\n\n if words[i][j] not in node:\n valid = False\n break\n else:\n node = node[words[i][j]]\n\n if valid:\n for cand in backtrack(node, ''):\n if i != cand:\n ans.append([i, cand]) \n \n return ans\n ","runtime":"768"},{"code":"class Solution:\n\n # TODO: optimize by pre-computing longest palindrome substrings centered around\n # each index for all words; this can then be used when checking the unmatched\n # part of both the iterated word, and the words found from the suffix-trie\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n # build suffix-trie consisting of all given words\n suffix_trie = {}\n for i, w in enumerate(words):\n node = suffix_trie\n for c in w[::-1]:\n node = node.setdefault(c, {})\n node[\"*\"] = i\n\n res = []\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\n node = suffix_trie\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\n\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\"a\", \"\") & (\"lls\", \"ll\")\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n res.append((i, node[\"*\"]))\n \n if c in node: # keep matching current-`w` against suffix-trie\n node = node[c]\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\n break\n else: # the entire current-`w` found as a prefix in the suffix-trie\n for ss, j in Solution.get_unmatched_palin_substrings(node):\n if i != j:\n res.append((i, j))\n \n return res\n\n\n # finds and returns all unmatched remaining substrings that are also palindromes\n @staticmethod\n def get_unmatched_palin_substrings(trie_node):\n ss_idxs = {}\n def _fetch(node, ss): \n for c, nn in node.items():\n if c == \"*\":\n ss_idxs[ss] = node[c]\n else:\n _fetch(nn, f\"{ss}{c}\")\n _fetch(trie_node, \"\")\n return [(ss, idx) for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]","runtime":"849"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n sfx_trie = {}\n for i, w in enumerate(words):\n node = sfx_trie\n for c in w[::-1]: node = node.setdefault(c, {})\n node[\"*\"] = i\n # print(sfx_trie)\n\n res = []\n for i, w in enumerate(words):\n node = sfx_trie\n\n # if w == \"\":\n # ssm = Solution.get_unmatched_palin_substrings(node)\n # else:\n\n # if \"*\" in node and i != node[\"*\"] and w == w[::-1]:\n # res.append((i, node[\"*\"]))\n\n for k, c in enumerate(w):\n # for c in w:\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n # if \"*\" in node and i != node[\"*\"] and w[k:] == w[-1:k-2:-1]:\n res.append((i, node[\"*\"]))\n \n if c in node:\n node = node[c]\n # if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n # res.append((i, node[\"*\"]))\n else:\n # print((i, w), \"SHEEEEIT\")\n # ssm = Solution.get_unmatched_palin_substrings(node)\n # for ss, j in ssm.items():\n # if i != j and ss == ss[::-1] and w[k:] == w[k:][::-1]:\n # res.append((i, j))\n break\n # if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n # res.append((i, node[\"*\"]))\n else:\n ssm = Solution.get_unmatched_palin_substrings(node)\n # print((i, w), ssm)\n # print(\"-\"*50)\n for ss, j in ssm.items():\n if i != j and ss == ss[::-1]:\n res.append((i, j))\n \n return res\n\n\n @staticmethod\n def get_unmatched_palin_substrings(trie_node):\n ss_to_idx = {}\n \n def _fetch(node, ss):\n # print(node)\n # if len(node) == 1 and \"*\" in node:\n # ss_to_idx[ss] = node[\"*\"]\n # # return\n\n # if \"*\" in node:\n # ss_to_idx[ss] = node[\"*\"]\n \n for c, nn in node.items():\n if c == \"*\":\n ss_to_idx[ss] = node[c]\n else:\n _fetch(nn, f\"{ss}{c}\")\n \n _fetch(trie_node, \"\")\n return ss_to_idx","runtime":"929"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n backward, res = {}, []\n for i, word in enumerate(words):\n backward[word[::-1]] = i\n\n for i, word in enumerate(words):\n \n if word in backward and backward[word] != i:\n res.append([i, backward[word]])\n \n if word != \"\" and \"\" in backward and word == word[::-1]:\n res.append([i, backward[\"\"]])\n res.append([backward[\"\"], i])\n \n for j in range(len(word)):\n if word[j:] in backward and word[:j] == word[j-1::-1]:\n res.append([backward[word[j:]], i])\n if word[:j] in backward and word[j:] == word[:j-1:-1]:\n res.append([i, backward[word[:j]]])\n \n return res","runtime":"929"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n backward, res = {}, []\n for i, word in enumerate(words):\n backward[word[::-1]] = i\n\n for i, word in enumerate(words):\n \n if word in backward and backward[word] != i:\n res.append([i, backward[word]])\n \n if word != \"\" and \"\" in backward and word == word[::-1]:\n res.append([i, backward[\"\"]])\n res.append([backward[\"\"], i])\n \n for j in range(len(word)):\n if word[j:] in backward and word[:j] == word[j-1::-1]:\n res.append([backward[word[j:]], i])\n if word[:j] in backward and word[j:] == word[:j-1:-1]:\n res.append([i, backward[word[:j]]])\n \n return res","runtime":"1010"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n backward, res = {}, []\n for i, word in enumerate(words):\n backward[word[::-1]] = i\n #print(backward)\n\n for i, word in enumerate(words):\n \n if word in backward and backward[word] != i:\n res.append([i, backward[word]])\n \n if word != \"\" and \"\" in backward and word == word[::-1]:\n res.append([i, backward[\"\"]])\n res.append([backward[\"\"], i])\n \n for j in range(len(word)):\n if word[j:] in backward and word[:j] == word[j-1::-1]:\n res.append([backward[word[j:]], i])\n if word[:j] in backward and word[j:] == word[:j-1:-1]:\n res.append([i, backward[word[:j]]])\n \n return res","runtime":"1010"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n worddict = {word[::-1]: i for i, word in enumerate(words)}\n res = []\n\n def is_palindrome(s):\n l = len(s)\n for i in range(l//2):\n if s[i] != s[l-i-1]:\n return False\n return True\n\n for j, word in enumerate(words):\n n = len(word)\n for i in range(n):\n x = word[n-i:]\n y = word[:n-i]\n if worddict.get(y, j) != j and is_palindrome(x):\n res.append([j, worddict.get(y)])\n if worddict.get(x, j) != j and is_palindrome(y):\n res.append([worddict.get(x), j])\n if worddict.get('', j) != j and is_palindrome(word):\n res.append([j, worddict.get('')])\n return res","runtime":"1091"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n reverseWordIdx = {}\n emptyStringIdx = None\n for idx in range(len(words)):\n if words[idx] == \"\":\n emptyStringIdx = idx\n continue\n reverseWordIdx[words[idx][::-1]] = idx\n \n # abcddd --> abc ddd (cba)\n # bbbxyz --> (zyx) bbb xyz\n print(\"reverseWordIdx\", reverseWordIdx)\n\n results = []\n for idx in range(len(words)):\n word = words[idx]\n # print(\"word\", word)\n for divider in range(len(word)):\n left = word[:divider]\n right = word[divider:]\n # print(\"divider\", divider)\n # print(\"left\", left)\n # print(\"right\", right)\n\n if left in reverseWordIdx.keys() and right == right[::-1] and reverseWordIdx[left] != idx:\n results.append([idx, reverseWordIdx[left]])\n \n if right in reverseWordIdx.keys() and left == left[::-1] and reverseWordIdx[right] != idx:\n results.append([reverseWordIdx[right], idx])\n\n if emptyStringIdx is not None:\n for idx in range(len(words)):\n if idx == emptyStringIdx:\n continue\n\n word = words[idx]\n if word == word[::-1]:\n results.append([emptyStringIdx, idx])\n results.append([idx, emptyStringIdx])\n\n return results","runtime":"1172"},{"code":"class Trie:\n def __init__(self, words):\n self.root = {} \n for i, word in enumerate(words): \n self.insert(i, word)\n \n def insert(self, idx, word):\n curr = self.root\n for ch in word[::-1]: \n curr = curr.setdefault(ch, {})\n curr[\"$\"] = idx \n\n def get_next(self, trie):\n return {k: v for k,v in trie.items() if k != \"$\"}\n\n def is_palindrome(self, prefix):\n return prefix == prefix[::-1]\n \n def get_trie_palindrome(self, trie, exclude):\n result = []\n def visit(node, prefix):\n if \"$\" in node:\n if self.is_palindrome(prefix) and node[\"$\"] != exclude:\n result.append(node['$'])\n for next_ch, next_node in self.get_next(node).items():\n visit(next_node, prefix + next_ch)\n visit(trie, \"\")\n return result \n\n def match(self, index, word):\n curr = self.root \n result = [] \n for i, ch in enumerate(word): \n if \"$\" in curr and curr[\"$\"] != index and self.is_palindrome(word[i:]):\n result.append([index, curr[\"$\"]])\n if ch not in curr:\n return result \n curr = curr[ch]\n # print(index, word, curr)\n trie_indices = self.get_trie_palindrome(curr, index)\n for trie_index in trie_indices:\n result.append([index, trie_index])\n return result\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie(words)\n result = []\n for i, word in enumerate(words):\n group = trie.match(i, word)\n # print(i, word, group)\n if group:\n result.extend(group)\n return result ","runtime":"1172"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n worddict = {word[::-1]: i for i, word in enumerate(words)}\n res = []\n\n def is_palindrome(s):\n l = len(s)\n return all(s[i] == s[l-i-1] for i in range(l//2))\n\n for j, word in enumerate(words):\n n = len(word)\n for i in range(n):\n x = word[n-i:]\n y = word[:n-i]\n if worddict.get(y, j) != j and is_palindrome(x):\n res.append([j, worddict.get(y)])\n if worddict.get(x, j) != j and is_palindrome(y):\n res.append([worddict.get(x), j])\n if worddict.get('', j) != j and is_palindrome(word):\n res.append([j, worddict.get('')])\n return res","runtime":"1253"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ## RC ##\n ## APPROACH : GREEDY ##\n ## LOGIC ##\n # 1st Inside For Loop: [abaaa, ba, aa] => prefix : 'ab', check if reverse of 'ab' is the given list, check if remainingprefix :'aaa' is palindrome, make sure it is not the same word, (reverse word).\n\n # 2nd Inside For Loop: [ abaaa, ba, aa ] => suffix : 'aa', check if reverse of 'aa' is the given list, check if remainingsuffix :'aba' is palindrome, make sure it is not the same word, (reverse word).\n \n\t\t## TIME COMPLEXITY : O(K^2 x N) ## k -> prefix\n\t\t## SPACE COMPLEXITY : O((K + N)^2) ##\n\n # Ex : \n # words : [\"abcd\",\"dcba\",\"lls\",\"s\",\"sssll\"]\n # reversedWords: {'dcba': 0, 'abcd': 1, 'sll': 2, 's': 3, 'llsss': 4}\n # ans : [[0,1],[1,0],[3,2],[2,4]]\n\n def isPalindrome(s):\n start = 0\n end = len(s) - 1\n\n while( start < end ):\n if( s[ start ] != s[ end ] ):\n return False\n start += 1\n end -= 1\n return True\n\n results = set()\n reversedWords = { word[::-1]: index for index, word in enumerate(words) }\n\n for i, word in enumerate(words):\n for j in range(0,len(word)+1):\n prefix = word[:j]\n pfremain = word[j:]\n if prefix in reversedWords and isPalindrome(pfremain) and reversedWords[prefix] != i:\n results.add((i,reversedWords[prefix]))\n for j in range(len(word), -1, -1):\n suffix = word[j:]\n sfremain = word[:j]\n if suffix in reversedWords and isPalindrome(sfremain) and reversedWords[suffix] != i:\n results.add((reversedWords[suffix],i))\n return results","runtime":"1253"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n backwards = {words[i][::-1]: i for i in range(len(words))}\n rs = []\n\n for i in range(len(words)):\n word = words[i]\n\n if word in backwards:\n if i != backwards[word]:\n rs.append([i, backwards[word]])\n elif word and '' in backwards:\n rs.append([backwards[''], i])\n rs.append([i, backwards['']])\n\n for sz in range(1, len(word)):\n prefix, rest = word[:sz], word[sz:]\n if prefix in backwards and rest == rest[::-1]:\n rs.append([i, backwards[prefix]])\n \n rest, suffix = word[:-sz], word[-sz:]\n if suffix in backwards and rest == rest[::-1]:\n rs.append([backwards[suffix], i])\n\n\n return rs\n\n \n ","runtime":"1334"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # Naive solution\n # Check if each possible combination is a palindrome\n # O(n^2*K)\n def isPalindrome(word):\n return word==word[::-1]\n backward = {}\n res = []\n for i, word in enumerate(words):\n backward[word[::-1]]=i\n for i, word in enumerate(words):\n for j in range(len(word)):\n if isPalindrome(word[:j]) and word[j:] in backward:\n if i!=backward[word[j:]]:\n res.append([backward[word[j:]], i])\n if word[:j] in backward and isPalindrome(word[j:]):\n if i!=backward[word[:j]]:\n res.append([i, backward[word[:j]]])\n if isPalindrome(word) and \"\" in backward:\n if i!=backward[\"\"]:\n res.append([backward[\"\"], i])\n return res","runtime":"1334"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n pairs = set()\n suffix = {w[::-1]:i for i, w in enumerate(words)}\n for i, w in enumerate(words):\n for j in range(len(w)+1):\n if w[:j] in suffix and self.isPalindrome(w[j:]):\n if i != suffix[w[:j]]:\n pairs.add((i,suffix[w[:j]]))\n prefix = {w:i for i, w in enumerate(words)}\n for i, w in enumerate(words):\n for j in range(len(w)+1):\n if w[j:][::-1] in prefix and self.isPalindrome(w[:j]):\n if prefix[w[j:][::-1]] != i:\n pairs.add((prefix[w[j:][::-1]],i))\n \n return list(pairs)\n \n def isPalindrome(self, word):\n left, right = 0, len(word)-1\n while left < right:\n if word[left] != word[right]:\n return False\n left += 1\n right -= 1\n return True\n\n ","runtime":"1415"},{"code":"class Solution:\n def isPalindrome(self, word):\n return word == word[::-1]\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n d_words = dict() # k : v = word : idx\n out, hasBlank = list(), False\n for i, w in enumerate(words):\n if w == \"\": hasBlank = True\n d_words[w] = i\n # print(\"d_words=\", d_words)\n for i, word in enumerate(words):\n # d_words as prefix\n w = word[::-1] # reverse word first, then take first few chars\n N = len(w)\n # print(i, word, w)\n for j in range(1,N+1):\n _w = w[:j]\n # print(\"_w=\", _w,_w in d_words, _w+word)\n if _w in d_words and d_words[_w] != i and self.isPalindrome(_w+word):\n # print(\"found prefix=\", _w, d_words[_w] )\n out.append([d_words[_w], i])\n # d_words as suffix (need only check up to 0: N-1, because 0:N is checked in d_words as prefix\n w = word\n for j in range(1, N):\n _w = w[:j][::-1] # take first few chars, then reverse word first\n if _w in d_words and d_words[_w] != i and self.isPalindrome(word + _w):\n # print(\"found suffix=\", _w, d_words[_w] )\n out.append([i, d_words[_w]]) \n if hasBlank:\n if word != \"\" and self.isPalindrome(word):\n out.append([d_words[\"\"], i])\n out.append([i, d_words[\"\"]])\n return out","runtime":"1415"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n idx = {}\n N = len(words)\n for i in range(N):\n idx[words[i]] = i\n\n def is_palindrome(x):\n if x:\n return x[0] == x[-1] and is_palindrome(x[1:-1])\n return True\n\n rs = []\n\n # treating each word_j as y+z so part/whole of word_i is x\n for j in range(N):\n x = words[j][::-1]\n for sz in range(1, len(x) + 1):\n i = idx.get(x[:sz], j)\n if i != j and is_palindrome(words[j][:-sz]):\n rs.append([i, j])\n\n\n # treating each word i as (x+y) so part of z will match each word\n for i in range(N):\n x = words[i]\n for sz in range(1, len(x)):\n j = idx.get(x[:sz][::-1], i)\n if i != j and is_palindrome(words[i][sz:]):\n rs.append([i, j])\n\n\n if '' in idx:\n i = idx.get('')\n for j in range(N):\n if i != j and is_palindrome(words[j]):\n rs.append([i,j])\n rs.append([j,i])\n\n return rs\n\n\n '''\n # if i, j is answer, words[i] + words[j] is a palindrome\n # let it be represented by x + y + z\n # where len(x) == len(z)\n\n # if y == '', then x = words[i] and z = words[j]\n\n # for rest of 2 cases:\n # words[i] = x + y and z = words[j]\n # so we take substrings of x+y[:0], x+y[:1],..x+y[:len(z)]\n # for a successful result:\n # x + y[:k] should be in idx and x+y[k:] should be a palindrome\n # also works for '' string\n # matches whole string too\n\n # words[i] = x and y + z = words[j]\n # rev = reverse(y+z)\n # so we take substrings of rev[:0], rev[:1],....rev[:len(x)-1]\n # to avoid repeat do till [ :len(x)-1]\n # for a successful result:\n # rev[:k] should be in idx and y+z[:k] should be a palindrome\n '''\n \n\n ","runtime":"1496"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n # hash every string\n # for every suffix in every word\n # is there a hash that matches my suffix?\n \n # to make it faster we should hash the reverse of every string\n d = {}\n res = []\n for i, word in enumerate(words):\n d[word[::-1]] = i\n \n for i, word in enumerate(words):\n if word in d and d[word] != i:\n res.append([d[word], i])\n \n if word and \"\" in d and word == word[::-1]:\n res.append([i, d[\"\"]])\n res.append([d[\"\"], i])\n\n for j in range(1,len(word)):\n # s is in dict\n # lls is curr\n # since ll is a palindrome, check if s in dict\n left, right = word[:j], word[j:]\n if left == left[::-1] and right in d:\n res.append([d[right], i])\n if right == right[::-1] and left in d:\n res.append([i, d[left]])\n \n \n \n return res\n\n # brute force\n # res = []\n # for i in range(len(words)):\n # for j in range(len(words)):\n # if i == j:\n # continue\n # cand = words[i] + words[j]\n # if cand == cand[::-1]:\n # res.append([i, j])\n # return res","runtime":"1496"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n #\n class Prefix:\n def __init__(self):\n self.trie = {}\n\n def add_word(self, word, k):\n curr = self.trie\n for i in range(len(word)):\n c = word[i]\n if c not in curr:\n curr[c] = {}\n curr = curr[c]\n curr.setdefault('+', []).append(k)\n curr['*'] = k\n if '+' in curr:\n curr['+'].pop()\n return\n\n def find_prefix(self, suffix, j):\n curr = self.trie\n extra_j = []\n for i in reversed(range(len(suffix))):\n c = suffix[i]\n if c not in curr:\n return [], extra_j\n curr = curr[c]\n if curr.get('*', j) != j:\n extra_j.append(curr['*'])\n extra_i = curr.get('+', [])\n return extra_i, extra_j\n\n prefix = Prefix()\n for i in range(len(words)):\n prefix.add_word(words[i], i)\n\n is_palindrome = lambda x: x[0] == x[-1] and is_palindrome(x[1:-1]) if x else True\n\n rs = []\n for j in range(len(words)):\n if words[j] == '':\n for i in range(len(words)):\n if i != j and is_palindrome(words[i]):\n rs.append([i, j])\n rs.append([j, i])\n continue\n extra_i, extra_j = prefix.find_prefix(words[j], j)\n # print(extra_i, extra_j)\n for i in extra_i:\n if i != j:\n extra = words[i][len(words[j]):]\n if is_palindrome(extra):\n rs.append([i, j])\n\n for i in extra_j:\n if i != j:\n extra = words[j][: len(words[j])-len(words[i])]\n if is_palindrome(extra):\n rs.append([i, j])\n\n return rs\n\n\n ","runtime":"1577"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n backwards = {words[i][::-1]: i for i in range(len(words))}\n \n rs = []\n pos = backwards.get('', -1)\n\n for j in range(len(words)):\n k = backwards.get(words[j], -1)\n if k >= 0 and k != j:\n rs.append([j, k])\n if k >= 0 and k == j and pos >= 0 and pos != j:\n rs.append([j, pos])\n rs.append([pos, j])\n\n # print(backwards)\n\n for i in range(len(words)):\n for sz in range(1, len(words[i])):\n prefix, rest = words[i][:sz], words[i][sz:]\n k = backwards.get(prefix, i)\n if k == i or rest != rest[::-1]:\n continue\n rs.append([i, k])\n \n for sz in range(1, len(words[i])):\n rest, suffix = words[i][:-sz], words[i][-sz:]\n # print(rest, suffix)\n j = backwards.get(suffix, i)\n # print(i, j, rest, rest[::-1])\n if j == i or rest != rest[::-1]:\n continue\n rs.append([j, i])\n\n return rs\n\n \n ","runtime":"1577"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ans = set()\n d = {word[::-1]:i for i,word in enumerate(words)}\n for i,word in enumerate(words):\n for j in range(len(word)+1):\n first = word[:j]\n last = word[j:]\n if(last==last[::-1] and first in d and d[first]!=i):\n ans.add((i,d[first]))\n if(first==first[::-1] and last in d and d[last]!=i):\n ans.add((d[last],i))\n return ans","runtime":"1658"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ind = {}\n for i,word in enumerate(words):\n ind[word]=i\n pairs=[]\n for i,word in enumerate(words):\n l=len(word)\n for j in range(l+1):\n left = word[:j]\n right = word[j:]\n left_reverse = left[::-1]\n right_reverse = right[::-1]\n # print(f'{i=},{j=},{left=},{right=}')\n if j>0 and left == left_reverse and right_reverse in ind and ind[right_reverse]!=i:\n pairs.append((ind[right_reverse],i))\n if right == right_reverse and left_reverse in ind and ind[left_reverse]!=i:\n pairs.append((i,ind[left_reverse]))\n return pairs","runtime":"1658"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n d = {word: i for i, word in enumerate(words)}\n ans = []\n for i, word in enumerate(words):\n for idx in range(len(word) + 1):\n prefix, suffix = word[:idx], word[idx:]\n r_suffix = suffix[::-1]\n r_prefix = prefix[::-1]\n\n if prefix == r_prefix and r_suffix in d and d[r_suffix] != i:\n ans.append((d[r_suffix], i))\n\n if (\n idx != len(word)\n and suffix == r_suffix\n and r_prefix in d\n and d[r_prefix] != i\n ):\n ans.append((i, d[r_prefix]))\n return ans\n","runtime":"1739"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # brute-force method checks each pair and results in Time O(n*n)\n # Palindrome properties: A string s is a palindrome if s == s[::-1]\n # Hashmap method; Time O(n*k*k) k = length of word; Space O(k)\n # Use a HashMap (word_map) to store the reverse of each word as the key and its index as the value. \n # This allows for O(1) lookup to check if the reverse of a word exists in the list.\n # For each word in words, we:\n # Check if the reverse of the word exists in the word_map and forms a valid palindrome pair.\n # Check if there are valid palindrome pairs by splitting the word into two parts: left and right. \n # If the left part is a palindrome, then the reverse of the right part can form a palindrome pair, and vice versa.\n # Return all valid pairs of indices.\n def isPalindrome(s):\n return s == s[::-1]\n \n res = []\n word_map = {}\n for i, word in enumerate(words):\n word_map[word[::-1]] = i\n \n for i, word in enumerate(words):\n for j in range(len(word) + 1):\n left, right = word[:j], word[j:]\n # Case 1: If the left part is a palindrome, check if reverse of the right exists\n if isPalindrome(left) and right in word_map and word_map[right] != i:\n res.append([word_map[right], i])\n # Case 2: If the right part is a palindrome, check if reverse of the left exists\n # We skip the case when j == len(word) to avoid duplicates (e.g., the entire word being a palindrome)\n if isPalindrome(right) and left in word_map and word_map[left] != i and j != len(word):\n res.append([i, word_map[left]])\n return res\n\n","runtime":"1739"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def is_palindrome(word):\n return word == word[::-1]\n \n # Map each word to its index and also store the reverse of each word\n word_map = {word: i for i, word in enumerate(words)}\n reverse_map = {word[::-1]: i for i, word in enumerate(words)}\n result = []\n \n for i, word in enumerate(words):\n n = len(word)\n \n for j in range(n + 1):\n prefix, suffix = word[:j], word[j:]\n \n # If suffix is a palindrome, look for reverse of the prefix in reverse_map\n if is_palindrome(suffix) and prefix in reverse_map and reverse_map[prefix] != i:\n result.append([i, reverse_map[prefix]])\n \n # If prefix is a palindrome and j > 0 to avoid full word duplication, look for reverse of the suffix\n if j > 0 and is_palindrome(prefix) and suffix in reverse_map and reverse_map[suffix] != i:\n result.append([reverse_map[suffix], i])\n \n return result\n ","runtime":"1820"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def is_palindrome(word):\n return word == word[::-1]\n\n # 2 建立反轉辭典\n word_map = {word[::-1]: i for i, word in enumerate(words)}\n print(f'word_map = {word_map}')\n answer = []\n\n for i, word in enumerate(words):\n for j in range(len(word) + 1):\n prefix, suffix = word[:j], word[j:]\n # 前面在辭典 + 後面是回文 + 避免前半自身\n if is_palindrome(suffix) and prefix in word_map and word_map[prefix] != i:\n answer.append([i, word_map[prefix]])\n # 不是空字串 + 前面是回文 + 後面在辭典 + 避免後半自身\n if j > 0 and is_palindrome(prefix) and suffix in word_map and word_map[suffix] != i:\n answer.append([word_map[suffix], i])\n\n return answer","runtime":"1820"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n word_dict = { word: index for index, word in enumerate(words) }\n result = []\n\n for index, word in enumerate(words):\n for j in range(len(word) + 1):\n left = word[:j]\n reversed_left = left[::-1]\n right = word[j:]\n reversed_right = right[::-1]\n\n if reversed_left in word_dict \\\n and word_dict[reversed_left] != index \\\n and right == reversed_right:\n result.append([index, word_dict[reversed_left]])\n \n if j > 0 \\\n and reversed_right in word_dict \\\n and word_dict[reversed_right] != index \\\n and left == reversed_left:\n result.append([word_dict[reversed_right], index])\n \n \n return result\n\n ","runtime":"1901"},{"code":"class Solution:\n def palindromePairs(self, words):\n wordToIndex = {word: index for index, word in enumerate(words)}\n\n palindromePairs = []\n \n for index, word in enumerate(words):\n for j in range(len(word)+1):\n left = word[:j]\n right = word[j:]\n\n rLeft = left[::-1]\n rRight = right[::-1]\n\n if (rLeft in wordToIndex and wordToIndex[rLeft] != index and right == rRight):\n palindromePairs.append([index, wordToIndex[rLeft]])\n \n if (j > 0 and rRight in wordToIndex and wordToIndex[rRight] != index and left == rLeft):\n palindromePairs.append([wordToIndex[rRight], index])\n return palindromePairs\n","runtime":"1901"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n wordToIndex = {}\n\n for i, word in enumerate(words):\n wordToIndex[word] = i\n \n res = set()\n\n for i in range(len(words)):\n for j in range(len(words[i])+1):\n prefix = words[i][:j]\n suffix = words[i][j:]\n\n if prefix == prefix[::-1] and suffix[::-1] in wordToIndex and wordToIndex[suffix[::-1]]!= i:\n res.add((wordToIndex[suffix[::-1]], i))\n if prefix[::-1] in wordToIndex and suffix == suffix[::-1] and i != wordToIndex[prefix[::-1]]:\n res.add((i, wordToIndex[prefix[::-1]]))\n \n res = list([i, j] for i, j in res)\n return res","runtime":"1981"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n words_map = {word : i for i, word in enumerate(words)}\n answers = []\n for i, word in enumerate(words):\n for j in range(len(word)+1):\n prefix, suffix = word[:j], word[j:]\n \n # If prefix is palindrome, reverse the suffix and check if that exists\n if prefix == prefix[::-1]:\n reversed_suffix = suffix[::-1]\n if reversed_suffix in words_map and i != words_map[reversed_suffix]:\n answers.append([words_map[reversed_suffix],i])\n \n # To avoid duplicates, make sure j != len(word)\n if j != len(word) and suffix == suffix[::-1]:\n reversed_prefix = prefix[::-1]\n if reversed_prefix in words_map and i != words_map[reversed_prefix]:\n answers.append([i,words_map[reversed_prefix]])\n\n return answers","runtime":"2062"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n def is_palindrome(s):\n return s == s[::-1]\n\n n = len(words)\n words_dict = {}\n result = []\n\n for i in range(n):\n word = words[i]\n rev_word = word[::-1]\n words_dict[word] = i\n \n print(words_dict)\n\n for i, word in enumerate(words):\n for j in range(len(word)+1):\n prefix = word[:j]\n suffix = word[j:]\n\n if prefix == prefix[::-1]:\n reversed_suffix = suffix[::-1]\n if reversed_suffix in words_dict and i != words_dict[reversed_suffix]:\n result.append([words_dict[reversed_suffix], i])\n \n if j != len(word) and suffix == suffix[::-1]:\n reversed_prefix = prefix[::-1]\n if reversed_prefix in words_dict and i != words_dict[reversed_prefix]:\n result.append([i, words_dict[reversed_prefix]])\n return result","runtime":"2062"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def pal(w):\n return w == w[::-1]\n \n \n lookup = {word:i for i,word in enumerate(words)}\n res = []\n\n for i,word in enumerate(words):\n n = len(word)\n for j in range(n+1):\n prefix,suffix = word[:j],word[j:]\n if pal(prefix):\n if suffix[::-1] in lookup and lookup[suffix[::-1]]!=i:\n\n res.append([lookup[suffix[::-1]],i])\n if j<n and pal(suffix):\n P = prefix[::-1]\n if P in lookup and lookup[P]!=i:\n res.append([i,lookup[P]])\n return res\n\n \n\n","runtime":"2143"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n lookup = {}\n for i in range(len(words)):\n lookup[words[i]] = i\n res = []\n # remember: self does not count, make sure check that i is not the same as looked up idx\n for i in range(len(words)):\n word = words[i]\n\n\n # base: just reverse the whole word\n if word[::-1] in lookup and lookup[word[::-1]] != i:\n res.append([i, lookup[word[::-1]]])\n\n # base: prefix palindrome\n for begin_idx in range(1, len(word) + 1):\n prefix = word[:begin_idx]\n # print(f\"prefix: {prefix}\")\n if prefix == prefix[::-1]:\n valid_suffix = word[begin_idx:][::-1]\n # print(f\"valid_suffix: {valid_suffix}\")\n if valid_suffix in lookup and lookup[valid_suffix] != i:\n res.append([lookup[valid_suffix], i])\n begin_idx += 1\n # base: suffix palindrome\n for end_idx in range(len(word) - 1, -1, -1):\n suffix = word[end_idx:]\n # print(f\"suffix: {suffix}\")\n if suffix == suffix[::-1]:\n valid_prefix = word[:end_idx][::-1]\n # print(f\"valid_prefix: {valid_prefix}\")\n if valid_prefix in lookup and lookup[valid_prefix] != i:\n res.append([i, lookup[valid_prefix]])\n end_idx -= 1\n return res\n ","runtime":"2143"},{"code":"class Solution:\n def palindromePairs(self, words):\n def is_palindrome(word):\n return word == word[::-1]\n \n word_to_index = {word: i for i, word in enumerate(words)}\n result = []\n \n for i, word in enumerate(words):\n for j in range(len(word) + 1):\n prefix, suffix = word[:j], word[j:]\n \n # If prefix is a palindrome, check if reverse of suffix exists\n if is_palindrome(prefix):\n reversed_suffix = suffix[::-1]\n if reversed_suffix in word_to_index and word_to_index[reversed_suffix] != i:\n result.append([word_to_index[reversed_suffix], i])\n \n # If suffix is a palindrome, check if reverse of prefix exists\n # Check j != len(word) to avoid duplicates\n if j != len(word) and is_palindrome(suffix):\n reversed_prefix = prefix[::-1]\n if reversed_prefix in word_to_index and word_to_index[reversed_prefix] != i:\n result.append([i, word_to_index[reversed_prefix]])\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.palindromePairs([\"abcd\",\"dcba\",\"lls\",\"s\",\"sssll\"])) # Output: [[0,1],[1,0],[3,2],[2,4]]\nprint(solution.palindromePairs([\"bat\",\"tab\",\"cat\"])) # Output: [[0,1],[1,0]]\nprint(solution.palindromePairs([\"a\",\"\"])) # Output: [[0,1],[1,0]]\n","runtime":"2224"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def is_palindrome(word):\n return word == word[::-1]\n\n word_dict = {word: i for i, word in enumerate(words)}\n result = []\n\n for i, word in enumerate(words):\n for j in range(len(word) + 1):\n prefix = word[:j]\n suffix = word[j:]\n\n if is_palindrome(prefix):\n reversed_suffix = suffix[::-1]\n if reversed_suffix in word_dict and word_dict[reversed_suffix] != i:\n result.append([word_dict[reversed_suffix], i])\n\n if j != len(word) and is_palindrome(suffix):\n reversed_prefix = prefix[::-1]\n if reversed_prefix in word_dict and word_dict[reversed_prefix] != i:\n result.append([i, word_dict[reversed_prefix]])\n\n return result","runtime":"2224"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \"\"\"\n :type words: List[str]\n :rtype: List[List[int]]\n \"\"\"\n Map = {} \n for i, w in enumerate(words):\n Map[w] = i \n words = sorted(words,key = lambda i:len(i)) \n \n result = []\n Set = set()\n for w in words:\n for L in range(len(w)+1):\n if (w[0:L]==w[0:L][::-1] and w[L:][::-1] in Set): \n result.append([Map[w[L:][::-1]],Map[w]])\n if (w[L:]==w[L:][::-1] and w[0:L][::-1] in Set):\n result.append([Map[w],Map[w[0:L][::-1]]])\n Set.add(w)\n return result ","runtime":"2305"},{"code":"class Solution:\n def is_palindrome(self, wrd):\n return wrd==wrd[::-1]\n\n def add_if_valid(self, valid_pals, word_map, ind, pref, back):\n if pref!=\"\" and back in word_map and self.is_palindrome(pref):\n valid_pals.append([word_map[back], ind])\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n word_map = {word: i for i, word in enumerate(words)}\n valid_pals = []\n for (word, ind) in word_map.items():\n for i in range(len(word)+1):\n pref = word[:i]\n suff = word[i:]\n if self.is_palindrome(pref):\n back = suff[::-1]\n if back != word and back in word_map:\n valid_pals.append([word_map[back], ind])\n if i != len(word) and self.is_palindrome(suff):\n back = pref[::-1]\n if back != word and back in word_map:\n valid_pals.append([ind, word_map[back]]) \n return valid_pals\n","runtime":"2305"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n def prefix(word):\n result = []\n for i in range(len(word)):\n if word[i:] == word[i:][::-1]:\n result.append(word[:i])\n return result\n \n def suffix(word):\n result = []\n for i in range(len(word)):\n if word[:i+1] == word[:i+1][::-1]:\n result.append(word[i+1:])\n return result\n \n m = {word: i for i, word in enumerate(words)}\n s = []\n\n for word_index, word in enumerate(words):\n reversed_word = word[::-1]\n if reversed_word in m and word_index != m[reversed_word]:\n s.append([word_index, m[reversed_word]])\n \n for suf in suffix(word):\n rev_suf = suf[::-1]\n if rev_suf in m:\n s.append([m[rev_suf], word_index])\n \n for pref in prefix(word):\n rev_pref = pref[::-1]\n if rev_pref in m:\n s.append([word_index, m[rev_pref]])\n \n return s","runtime":"2386"},{"code":"\nclass Solution:\n def palindromePairs(self, words):\n\n def all_valid_prefixes(word):\n valid_prefixes = []\n for i in range(len(word)):\n if word[i:] == word[i:][::-1]:\n valid_prefixes.append(word[:i])\n return valid_prefixes\n\n def all_valid_suffixes(word):\n valid_suffixes = []\n for i in range(len(word)):\n if word[:i+1] == word[:i+1][::-1]:\n valid_suffixes.append(word[i + 1:])\n return valid_suffixes\n\n word_lookup = {word: i for i, word in enumerate(words)}\n solutions = []\n\n for word_index, word in enumerate(words):\n reversed_word = word[::-1]\n\n # Build solutions of case #1. This word will be word 1.\n if reversed_word in word_lookup and word_index != word_lookup[reversed_word]:\n solutions.append([word_index, word_lookup[reversed_word]])\n\n # Build solutions of case #2. This word will be word 2.\n for suffix in all_valid_suffixes(word):\n reversed_suffix = suffix[::-1]\n if reversed_suffix in word_lookup:\n solutions.append([word_lookup[reversed_suffix], word_index])\n\n # Build solutions of case #3. This word will be word 1.\n for prefix in all_valid_prefixes(word):\n reversed_prefix = prefix[::-1]\n if reversed_prefix in word_lookup:\n solutions.append([word_index, word_lookup[reversed_prefix]])\n\n return solutions","runtime":"2386"},{"code":"class Trie: \n def __init__(self): \n self.root = {}\n \n def insert(self, word, k): \n node = self.root \n for i, c in enumerate(word): \n if word[i:] == word[i:][::-1]: node.setdefault(\"val\", []).append(k)\n node = node.setdefault(c, {})\n node.setdefault(\"val\", []).append(k)\n node.setdefault(\"end\", []).append(k)\n \n def search(self, word): \n ans = []\n node = self.root\n for i, c in enumerate(word): \n if word[i:] == word[i:][::-1]: ans.extend(node.get(\"end\", []))\n if c not in node: break \n node = node[c]\n else: ans += node.get(\"val\", [])\n return ans \n \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n for i, word in enumerate(words): \n trie.insert(word, i)\n \n ans = set()\n for i, word in enumerate(words): \n val = trie.search(word[::-1])\n for ii in val: \n if ii != i: ans.add((ii, i))\n return ans ","runtime":"2467"},{"code":"from typing import List\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def check_palindrome(word):\n return word == word[::-1]\n \n seen = {val: i for i, val in enumerate(words)}\n ret = []\n \n for i, word in enumerate(words):\n reversed_word = word[::-1]\n\n if reversed_word in seen and i != seen[reversed_word]:\n ret.append([i, seen[reversed_word]])\n \n for j in range(len(word)):\n prefix, suffix = word[j:], word[:j + 1]\n check_prefix, check_suffix = word[:j], word[j + 1:]\n \n if check_palindrome(prefix): # j > 0 to avoid duplicates\n reversed_prefix = check_prefix[::-1]\n if reversed_prefix in seen:\n ret.append([i, seen[reversed_prefix]])\n \n if check_palindrome(suffix):\n reversed_suffix = check_suffix[::-1]\n if reversed_suffix in seen:\n ret.append([seen[reversed_suffix], i])\n\n return ret\n","runtime":"2467"},{"code":"import hashlib\n\nT = lambda: defaultdict(T)\n\ndef printTrie(t, space):\n print(\"\\t\"*space, \"match=\", t['match'])\n for k,v in t.items():\n if k != 'match':\n print(\" \"*4*space, k, \"->\")\n printTrie(v, space+1)\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # CAT -> TAC|CAT\n # CAT -> TAC{palindrom}|CAT\n # CAT -> CAT|{palindrom}TAC\n t = T()\n rt = T()\n\n def palindrom(w):\n return w == w[::-1]\n\n def insert(t, word, word_idx, idx):\n if 'match' not in t:\n t['match'] = []\n if idx >= len(word):\n t['match'].append((word, word_idx))\n else: \n insert(t[word[idx]], word, word_idx, idx+1)\n if palindrom(word[idx:]):\n t['match'].append((word, word_idx))\n \n def search(t, word):\n if word == \"\":\n return [word_idx for word, word_idx in t['match']]\n elif word[0] in t:\n return search(t[word[0]], word[1:])\n else:\n return []\n\n\n for idx, w in enumerate(words):\n insert(t, w, idx, 0)\n insert(rt, w[::-1], idx, 0)\n\n\n \n #print(t)\n #printTrie(rt, 0)\n\n res = []\n for idx, w in enumerate(words):\n res += [(x, idx) for x in search(t, w[::-1]) if x != idx]\n res += [(idx, x) for x in search(rt, w) if x != idx]\n return sorted(list(set(res)))\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # {word} --> {subword}{palindrom} | {reverse_subword}| : {palindrom}{subword} = {word}\n def sub(words):\n d = defaultdict(list)\n for i,w in enumerate(words):\n d[w].append(i)\n def palindrom(w):\n return w == w[::-1]\n \n res =[]\n for idx, w in enumerate(words):\n for i in range(len(w)+1):\n sub = w[:i]\n pal = w[i:]\n if palindrom(pal) and sub[::-1] in d:\n res += [(idx, x) for x in d[sub[::-1]] if x != idx]\n return res\n return list(set(sub(words) + list(map(lambda e:e[::-1], sub([w[::-1] for w in words])))))\n \n \n \n\n\n \n \n \n\n\n\n\n\n\n\n \n\n ","runtime":"2548"},{"code":"class TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\nclass Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions","runtime":"2548"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = []\n trie = Trie()\n for i, word in enumerate(words):\n trie.insert(word, i)\n for i, word in enumerate(words):\n res.extend(trie.search(word, i))\n return res\n\nclass TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1 # Index of the word that ends at this node\n self.palindrome_suffixes = [] # List of word indices where suffix forms a palindrome\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n # If the remaining part of the word is a palindrome, store the index\n if is_palindrome(word[:len(word) - i]):\n node.palindrome_suffixes.append(index)\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.index = index # Mark the end of the word\n node.palindrome_suffixes.append(index)\n\n def search(self, word, index):\n node = self.root\n result = []\n\n for i, char in enumerate(word):\n # If this node represents a word and the remaining suffix of the current word is a palindrome\n if node.index >= 0 and node.index != index and is_palindrome(word[i:]):\n result.append([index, node.index])\n if char not in node.children:\n return result\n node = node.children[char]\n\n # Check for words with palindromic suffixes\n for j in node.palindrome_suffixes:\n if index != j:\n result.append([index, j])\n \n return result\n \ndef is_palindrome(word):\n return word == word[::-1]","runtime":"2629"},{"code":"class TrieNode():\n def __init__(self):\n self.children=dict()\n self.idx = -1\n self.palindromeIdxs = list()\n self.end = False\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n def _ispalin(self, word):\n return word == word[::-1]\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res=list()\n \n for i in range(len(words)):\n curr = self.root\n rWord = words[i][::-1]\n for j in range(len(rWord)):\n if self._ispalin(rWord[j:]):\n curr.palindromeIdxs.append(i)\n\n if rWord[j] not in curr.children:\n curr.children[rWord[j]] = TrieNode()\n curr = curr.children[rWord[j]]\n curr.end = True\n curr.idx = i\n for i in range(len(words)):\n self.search(words[i], i, res) \n return res\n def search(self, word, idx, res):\n curr = self.root\n for i in range(len(word)):\n if curr.end and self._ispalin(word[i:]):\n res.append([idx,curr.idx])\n if word[i] not in curr.children:\n return\n curr = curr.children[word[i]]\n if curr.end and curr.idx != idx:\n res.append([curr.idx, idx])\n for pIdx in curr.palindromeIdxs:\n res.append([idx, pIdx])\n return","runtime":"2629"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.word_index = -1 # will store index of word ending at this node\n self.palindrome_suffixes = [] # will store indexes of words that are palindromes after this node\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # trie solution\n trie = TrieNode()\n # insert words into trie in reverse\n for windex, word in enumerate(words):\n word = word[::-1]\n current = trie\n for lindex, letter in enumerate(word):\n if letter not in current.children:\n current.children[letter] = TrieNode()\n \n if word[lindex:] == word[lindex:][::-1]: # if the remainder of the reversed word is a palindrome\n current.palindrome_suffixes.append(windex) # append the index of the word\n current = current.children[letter]\n # this line was the problem\n # update the palindrome suffixes before moving nodes\n current.word_index = windex\n # that should be our trie\n result = []\n for windex, word in enumerate(words):\n current = trie\n for lindex, letter in enumerate(word):\n # 3 cases\n if current.word_index != -1 and word[lindex:] == word[lindex:][::-1] \\\n and windex != current.word_index:\n result.append([windex, current.word_index])\n # if we have reached a word end node and our remaining string is a palindrome\n # why do we check that case before moving?\n if letter not in current.children:\n break\n current = current.children[letter]\n # other 2 cases\n # is the node we're on a reverse of our string?\n else:\n if current.word_index != -1 and current.word_index != windex:\n result.append([windex, current.word_index])\n # are there any words with palindromes between our string and its reversed prefix\n # iterate them\n for suffix in current.palindrome_suffixes:\n if suffix != windex:\n result.append([windex, suffix])\n return result","runtime":"2710"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1\n self.palindrome_suffix_indices = []\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def add_word(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n if self.is_palindrome(word[0:len(word)-i]):\n node.palindrome_suffix_indices.append(index)\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.index = index\n node.palindrome_suffix_indices.append(index)\n \n def search(self, word, index):\n result = []\n node = self.root\n while word:\n if node.index >= 0 and node.index != index and self.is_palindrome(word):\n result.append([index, node.index])\n if word[0] not in node.children:\n return result\n node = node.children[word[0]]\n word = word[1:]\n for pal_index in node.palindrome_suffix_indices:\n if index != pal_index:\n result.append([index, pal_index])\n return result\n \n def is_palindrome(self, word):\n return word == word[::-1]\n\nclass Solution:\n def palindromePairs(self, words):\n trie = Trie()\n for i, word in enumerate(words):\n trie.add_word(word, i)\n \n results = []\n for i, word in enumerate(words):\n results.extend(trie.search(word, i))\n return results","runtime":"2710"},{"code":"from typing import List, Tuple\n\ndef is_palindrome(s: str) -> bool:\n return s == s[::-1]\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n word_map = {word: i for i, word in enumerate(words)}\n result = []\n \n for i, word in enumerate(words):\n word_len = len(word)\n \n # Case 1: Check if there's a reversed word in the map\n for j in range(word_len + 1):\n # Split the word into two parts\n left, right = word[:j], word[j:]\n \n # Check if right part is a palindrome and left part reversed is in map\n if is_palindrome(left):\n reversed_right = right[::-1]\n if reversed_right in word_map and word_map[reversed_right] != i:\n result.append([word_map[reversed_right], i])\n \n # Check if left part is a palindrome and right part reversed is in map\n if j != word_len and is_palindrome(right): # Avoid duplication\n reversed_left = left[::-1]\n if reversed_left in word_map and word_map[reversed_left] != i:\n result.append([i, word_map[reversed_left]])\n \n return result","runtime":"2791"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1\n self.palindrome_suffix_indices = []\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def add_word(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n if self.is_palindrome(word[0:len(word)-i]):\n node.palindrome_suffix_indices.append(index)\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.index = index\n node.palindrome_suffix_indices.append(index)\n \n def search(self, word, index):\n result = []\n node = self.root\n while word:\n if node.index >= 0 and node.index != index and self.is_palindrome(word):\n result.append([index, node.index])\n if word[0] not in node.children:\n return result\n node = node.children[word[0]]\n word = word[1:]\n for pal_index in node.palindrome_suffix_indices:\n if index != pal_index:\n result.append([index, pal_index])\n return result\n \n def is_palindrome(self, word):\n return word == word[::-1]\n\nclass Solution:\n def palindromePairs(self, words):\n trie = Trie()\n for i, word in enumerate(words):\n trie.add_word(word, i)\n \n results = []\n for i, word in enumerate(words):\n results.extend(trie.search(word, i))\n return results","runtime":"2791"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n def is_palindrome(s):\n if not s:\n return True\n return s == s[::-1]\n\n suffice_check = defaultdict(list)\n for idx, word in enumerate(words):\n for i in range(len(word)+1):\n if is_palindrome(word[i:]):\n suffice_check[word[:i]].append(idx)\n \n prefix_check = defaultdict(list)\n for idx, word in enumerate(words):\n for i in range(len(word)+1):\n if is_palindrome(word[:i]):\n prefix_check[word[i:]].append(idx)\n\n # print(suffice_check)\n # print(prefix_check)\n\n out = []\n for idx, word in enumerate(words):\n if word[::-1] in suffice_check:\n for i in suffice_check[word[::-1]]:\n if i != idx:\n out.append((i,idx))\n if word[::-1] in prefix_check:\n for i in prefix_check[word[::-1]]:\n if i != idx:\n out.append((idx,i)) \n\n out = set(out)\n out = [[i,j] for (i,j) in out]\n\n return out\n","runtime":"2872"},{"code":"class TrieNode:\n def __init__(self, char):\n self.char = char\n self.children = {}\n self.index = None\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode(None)\n\n def insert(self, s, val):\n if s == \"\":\n self.root.index = val\n curr = self.root\n for char in s:\n if char not in curr.children:\n next_node = TrieNode(char)\n curr.children[char] = next_node\n curr = curr.children[char]\n curr.index = val\n return\n\n\nclass Solution:\n @staticmethod\n def is_palindrome(s):\n if s == \"\":\n return True\n return s == s[::-1]\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n n = len(words)\n\n # construct Trie for regular words and Trie for reverse words\n regular_trie, reversed_trie = Trie(), Trie()\n for i in range(n):\n word = words[i]\n regular_trie.insert(word, i)\n reversed_trie.insert(word[::-1], i)\n\n # iterate through all words, find whether i's prefix j is in reversed_trie, if so, and i's remaining substring is palindrome, words[i] + words[j] is palindrome\n # find whether the prefix of reversed i is in regular_trie, if so (get j), and i's remaining substring is palindrome, words[j] + words[i] is palindrome\n res = set()\n for i in range(n):\n word = words[i]\n if word == \"\":\n continue\n\n curr = reversed_trie.root\n for j in range(len(word)):\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\n res.add((i, curr.index))\n char = word[j]\n if char in curr.children:\n curr = curr.children[char]\n else:\n break\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\n res.add((i, curr.index))\n\n for i in range(n):\n word = words[i][::-1]\n if word == \"\":\n continue\n \n curr = regular_trie.root\n for j in range(len(word) + 1):\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\n res.add((curr.index, i))\n if j == len(word):\n break\n char = word[j]\n if char in curr.children:\n curr = curr.children[char]\n else:\n break\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\n res.add((curr.index, i))\n\n return [[i, j] for i, j in list(res)]","runtime":"2872"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.id = None\n self.words_ids = []\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n for index in range(len(words)):\n word = words[index][::-1]\n curr = self.root\n for j, w in enumerate(word):\n if not w in curr.children.keys():\n curr.children[w] = TrieNode()\n # [Jerry note]add idx to the current Trie Node then move to children.\n if word[j:] == word[j:][::-1]:\n curr.words_ids.append(index)\n curr = curr.children[w]\n curr.id = index\n # [Jerry note]words_ids should add current index as well since word int current node with suffix is empty now, it must be palindrome\n curr.words_ids.append(index)\n \n #--------------------------------------\n ans = []\n\n for i, word in enumerate(words): # case1 (word1 is word2_reverse's prefix), len(word1)<len(word2)\n curr = self.root\n isWholeWord = True\n for w in word:\n if w in curr.children.keys():\n curr = curr.children[w]\n else:\n isWholeWord = False\n break\n\n if isWholeWord:\n for id in curr.words_ids:\n if id != i:\n ans.append( [i, id])\n \n for i, word in enumerate(words): # case2 (word2 is word1 sulfix), len(word1)>len(word2)\n curr = self.root\n for c, w in enumerate(word):\n #word2R = word[:c] # exist in Trie as a full word or not\n isPalindromWord1Left = word[c:] # Is palindrom or not\n # [Jerry note] Not sure why, but we have to uset the flag curr.id != None instead curr.id. I also move curr.id != i before the palindrome check since it can save some time.\n if curr.id != None and curr.id != i and isPalindromWord1Left == isPalindromWord1Left[::-1]:\n ans.append([i, curr.id])\n if w in curr.children.keys():\n curr = curr.children[w]\n else:\n break\n return ans\n\n\n\n\n\n","runtime":"2953"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.id = None\n self.words_ids = []\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n for index in range(len(words)):\n word = words[index][::-1]\n curr = self.root\n for j, w in enumerate(word):\n if not w in curr.children.keys():\n curr.children[w] = TrieNode()\n # [Jerry note]add idx to the current Trie Node then move to children.\n if word[j:] == word[j:][::-1]:\n curr.words_ids.append(index)\n curr = curr.children[w]\n curr.id = index\n # [Jerry note]words_ids should add current index as well since word int current node with suffix is empty now, it must be palindrome\n curr.words_ids.append(index)\n \n #--------------------------------------\n ans = []\n\n for i, word in enumerate(words): # case1 (word1 is word2_reverse's prefix), len(word1)<len(word2)\n curr = self.root\n isWholeWord = True\n for w in word:\n if w in curr.children.keys():\n curr = curr.children[w]\n else:\n isWholeWord = False\n break\n\n if isWholeWord:\n for id in curr.words_ids:\n if id != i:\n ans.append( [i, id])\n \n for i, word in enumerate(words): # case2 (word2 is word1 sulfix), len(word1)>len(word2)\n curr = self.root\n for c, w in enumerate(word):\n #word2R = word[:c] # exist in Trie as a full word or not\n isPalindromWord1Left = word[c:] # Is palindrom or not\n # [Jerry note] Not sure why, but we have to uset the flag curr.id != None instead curr.id. I also move curr.id != i before the palindrome check since it can save some time.\n if curr.id != None and curr.id != i and isPalindromWord1Left == isPalindromWord1Left[::-1]:\n ans.append([i, curr.id])\n if w in curr.children.keys():\n curr = curr.children[w]\n else:\n break\n return ans\n\n\n\n\n\n","runtime":"2953"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n @cache\n def is_palindrome(w):\n return w == w[::-1]\n \n words = { w:i for i, w in enumerate(words) }\n res = []\n\n for w, i in words.items():\n n = len(w)\n\n for j in range(n + 1):\n pref = w[:j]\n suff = w[j:]\n\n if is_palindrome(pref):\n back = suff[::-1]\n if back != w and back in words:\n res.append((words[back], i))\n \n if j != n and is_palindrome(suff):\n back = pref[::-1]\n if back != w and back in words:\n res.append((i, words[back]))\n \n return res\n\n","runtime":"3033"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n\n # go through words, store them in dict\n \n # go through words again\n # 1. if word is palin andreverse in dict add pair\n # 2. if reverse of prefix in dict, and postfix is palin add pair\n # 3. if reverse of postfix in dict, and prefix is palin add pair\n word_dict = {}\n result = set()\n\n for i, word in enumerate(words):\n word_dict[word] = i\n\n\n for i, word in enumerate(words):\n # 1.\n reversed_word = word[::-1]\n if reversed_word in word_dict and i != word_dict[reversed_word]:\n result.add((i, word_dict[reversed_word]))\n\n if \"\" in word_dict and word_dict[\"\"] != i and word == reversed_word:\n result.add((i, word_dict[\"\"]))\n result.add((word_dict[\"\"], i))\n\n # 2. \n for j in range(len(word)):\n prefix = word[:j]\n r_prefix = prefix[::-1]\n postfix = word[j:]\n r_postfix = postfix[::-1]\n\n if r_prefix in word_dict and postfix == r_postfix and i != word_dict[r_prefix]:\n result.add((i, word_dict[r_prefix]))\n\n # 3.\n for j in range(len(word)):\n prefix = word[:j]\n r_prefix = prefix[::-1]\n postfix = word[j:]\n r_postfix = postfix[::-1]\n\n if r_postfix in word_dict and prefix == r_prefix and i != word_dict[r_postfix]:\n result.add((word_dict[r_postfix], i))\n\n return result","runtime":"3033"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = [{}, [], -1]\n for i, w in enumerate(words):\n w = w[::-1]\n node = root\n for j, c in enumerate(w):\n if w[j:] == w[j:][::-1]:\n node[1].append(i)\n if c not in node[0]:\n node[0][c] = [{}, [], -1]\n node = node[0][c]\n node[2] = i\n l = []\n for i, w in enumerate(words):\n node = root\n for j, c in enumerate(w):\n if w[j:] == w[j:][::-1] and node[2] != -1:\n l.append([i, node[2]])\n if c not in node[0]:\n break\n node = node[0][c]\n else:\n if node[2] != -1 and node[2] != i:\n l.append([i, node[2]])\n for j in node[1]:\n l.append([i, j])\n return l\n\n # l = []\n # m = {w[::-1]: i for i, w in enumerate(words)}\n # for i, w in enumerate(words):\n # if w in m and i != m[w]:\n # l.append([i, m[w]])\n # for j in range(len(w)):\n # s = w[j:]\n # rs = w[:j]\n # if s == s[::-1] and rs in m and i != m[rs]:\n # l.append([i, m[rs]])\n # p = w[:j + 1]\n # rp = w[j + 1:]\n # if p == p[::-1] and rp in m and i != m[rp]:\n # l.append([m[rp], i])\n # return l\n ","runtime":"3114"},{"code":"'''\na + b != b + a\n\nBrute Force - O(n^2 * k) -> Try all pairs and check if it's a palindrome\n\nabaca\n - if the prefix is a palindrome, take the suffix and and reverse it and see if it exists in words\nacabaca\n\nPseudocode\n- Make a set out of words\n- For each word in words\n - go through each prefix\n - check if the prefix is a palindrome (including the empty string which means you're looking for the reverse of the whole word)\n - check if the reverse of the suffix exists (which can be an empty string, which you're checking if the word itself is a palindrome)\n \n- aba case...\n\nHandling duplicates, for suffix don't compare for j != len(word) because of abcd and dcba case\n\nIf j == len(word) then prefix == abcd and suffix == \"\", you already have dcba + abcd from when j == 0 and you will have abcd + dcba from j == 0 from the dcba case, so you don't need to do the suffix handling again where you do abcd + dcba at abcd\n\nBut you need the suffix handling because you have \"a\" and \"ab\" and you want aba, what can you attach after and what can you attach before...\n\nTime Complexity: O(n * w^2) where n = len(words), w being length of words[i]\n\ns abas\n\nThis idea of palindrome matching where if the middle is a palindrome, then you just need to match the outer backwards...\n\nUnderstanding why duplicates are handled as palindromes\n - You have to go through the whole word1...the idea is actually fairly simple, if you append word1 and word2, you would check by having i j pointers at opposite ends and continuing on\n - The thing about a palindrome is that as you strip off the end characters, it's still a palindrome\n - I think this is the key point...you have to go through the whole of word1 and as you go, you're both increasing i which is through word1 and decreasing j, which is by traversing the trie, but the key point here is that you're doing it one by one so that means the moment you end, anything that is of suffix which is a palindrome will work because that's the thing in the middle -> visualize this\n lls sssll -> i is the lls, j is the sssll and then it becomes (i)ss(j) which is a palindrome\nWhy with Trie you don't need to look at both prefix and suffix\n - Because you just care about the ones where you append to the current word here, the other solution explored all substrings you can say\n\nPseudocode\n\nThere's a few ways to do it, if you build the Trie with the words in reverse, you don't need a index for each trie node for isWord...because you will iterate the main loop with the word in normal order and you know when it will finish\n\nBut if you want to build the Trie in normal order, then you have to iterate the words in reverse...this seems conceptually harder to grasp\n\nEdge Cases\n- If word1 is bigger, you will reach the end, but essentially you want to compare at every node that is isWord == True and then compare what you have traversed / left\n- If word1 is smaller, isWord == False, you want to use the palindrome lists in each node -> only once you reached the end of your word otherwise it doesn't make sense because you still have some letters in your word1 that may not be a palindrome with what is in the lists, so this is if the word that you have is smaller...\n- Empty string case - Trie's have a dummy node, that should be True - this should work with \"a\" and \"\" because you will start at the dummy node and the dummy node will have isWord == True, for \"\" and \"a\", again that is you will get that at \"\", the list should have \"a\" as part of its list\n- No duplicates because isWord is at the bottom of the tree, and so when you're at a shorter word and you stop in the middle and add to res from the lists, you are adding all indices that are BELOW that which you have no explored since isWord will be false for them at the top/middle \n\n'''\nclass TrieNode:\n def __init__(self):\n self.isWord = -1\n self.palindromes = []\n self.children = [None] * 26\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def addWord(self, word, j):\n '''\n As you go down, check if the suffix is a palindrome, and if so add\n '''\n temp = self.root\n for i in range(len(word) - 1, -1, -1):\n cur_char = word[i]\n\n if self.check_palindrome(word[:i + 1]):\n temp.palindromes.append(j)\n\n idx = ord(cur_char) - ord('a')\n if temp.children[idx] is None:\n temp.children[idx] = TrieNode()\n\n temp = temp.children[idx]\n\n temp.isWord = j\n temp.palindromes.append(j)\n\n def search(self, word, j, res):\n temp = self.root\n for i in range(len(word)):\n # This might be the key here...\n if temp.isWord >= 0 and temp.isWord != j and self.check_palindrome(word[i:]):\n res.append([j, temp.isWord])\n temp = temp.children[ord(word[i]) - ord('a')]\n \n if temp is None:\n return\n \n for idx in temp.palindromes:\n if idx != j:\n res.append([j, idx])\n\n def check_palindrome(self, word):\n return word == word[::-1]\n \n \nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n res = []\n for j, word in enumerate(words):\n trie.addWord(word, j)\n \n for j, word in enumerate(words):\n temp = []\n trie.search(word, j, temp)\n res.extend(temp.copy())\n return res\n \n def palindromePairs2(self, words: List[str]) -> List[List[int]]:\n word_map = {}\n for i, word in enumerate(words):\n word_map[word] = i\n\n res = []\n for i, word in enumerate(words):\n for j in range(len(word) + 1):\n prefix = word[:j]\n suffix = word[j:]\n \n if self.check_palindrome(prefix):\n suffix_reversed = suffix[::-1]\n if suffix_reversed in word_map and word_map[suffix_reversed] != i:\n res.append([word_map[suffix_reversed], i])\n \n # Handling duplicates\n if j != len(word) and self.check_palindrome(suffix):\n prefix_reversed = prefix[::-1]\n if prefix_reversed in word_map and word_map[prefix_reversed] != i:\n res.append([i, word_map[prefix_reversed]])\n \n return res\n \n def check_palindrome(self, word):\n return word == word[::-1]\n \n ","runtime":"3114"},{"code":"from functools import cache\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # @cache\n # def isPal(i, j, idx):\n # if i>=j:\n # return True\n # return isPal(i+1, j-1, idx) and words[idx][i] == words[idx][j]\n\n wordsDict = dict()\n for i in range(len(words)):\n wordsDict[words[i]] = i\n\n pairs = list()\n for idx in range(len(words)):\n for i in range(len(words[idx])):\n prefix = words[idx][:i][::-1]\n palin = words[idx][i:] == words[idx][i:][::-1]\n if palin and prefix in wordsDict:\n if idx != wordsDict[prefix]:\n pairs.append((idx, wordsDict[prefix]))\n\n for j in range(len(words[idx]), -1, -1):\n suffix = words[idx][j:][::-1]\n palin = words[idx][0:j] == words[idx][0:j][::-1]\n if palin and suffix in wordsDict:\n if idx != wordsDict[suffix]:\n pairs.append((wordsDict[suffix], idx))\n return pairs\n\n \n\n ","runtime":"3195"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n W_d, ans = defaultdict(list), []\n\n for idx, word in enumerate(words):\n W_d[word].append([0, idx])\n for i in range(1, len(word) + 1):\n suff, pref = word[:i], word[i:]\n if suff == suff[::-1]:\n W_d[pref].append([- (pref != \"\"),idx])\n if pref == pref[::-1]:\n W_d[suff].append([+ (suff != \"\"),idx])\n \n for idx, word in enumerate(words):\n for one, two in W_d[word[::-1]]:\n if idx != two and one <= 0: \n ans.append((idx, two))\n if idx != two and one >= 0: \n ans.append((two, idx))\n \n return set(ans)","runtime":"3195"},{"code":"from typing import List, DefaultDict\n\nclass TrieNode:\n def __init__(self):\n self.next: DefaultDict[str, TrieNode] = DefaultDict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n \nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions","runtime":"3276"},{"code":"class TrieNode:\n def __init__(self, val=\"\") -> None:\n self.val = val\n self.children: List[Optional[TrieNode]] = [None] * 26\n self.palindromeIdxs = []\n self.isEndIdxs = []\n\nclass Solution:\n def isPalindrome(self, s):\n return s == s[::-1]\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # first build a trie from the reverse\n tmain = TrieNode()\n for widx, word in enumerate(words):\n t = tmain\n revWord = word[::-1]\n for chidx, ch in enumerate(revWord):\n chpos = ord(ch) - ord('a')\n if self.isPalindrome(revWord[chidx:]):\n t.palindromeIdxs.append(widx)\n if t.children[chpos] == None:\n t.children[chpos] = TrieNode(ch)\n t = t.children[chpos]\n t.isEndIdxs.append(widx)\n\n self.res = []\n\n for i, word in enumerate(words):\n self.search(word, i, tmain)\n return self.res\n \n\n def search(self, word: str, idx, t: TrieNode):\n for i, ch in enumerate(word):\n chpos = ord(ch) - ord('a')\n # case 2: long word short trie word: abcdaa trie: bcda (abcd)\n if t.isEndIdxs and self.isPalindrome(word[i:]):\n for trieidx in t.isEndIdxs:\n self.res.append([idx, trieidx])\n t = t.children[chpos]\n if t == None:\n return\n \n # case 1: exact match. word: abcd, trie: dcba (abcd)\n for triendidx in t.isEndIdxs:\n if triendidx == idx:\n continue\n self.res.append([triendidx, idx]) # the other way will be form in another word\n\n # case 3: short word long trie, w: lls trie: sssll (llsss)\n for pidx in t.palindromeIdxs:\n self.res.append([idx, pidx])\n ","runtime":"3276"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n lookup = {w:idx for idx, w in enumerate(words)}\n result = []\n for idx, w in enumerate(words):\n pairs = process(w, idx, lookup) \n result.extend(pairs)\n\n return result\n\ndef process(word, idx, lookup):\n result = []\n #prefixes\n end = len(word) - 1\n for i in range(end+1):\n if is_palindrom(word, i, end):\n prefix = word[0:i]\n if (x:=lookup.get(prefix[::-1])) is not None:\n result.append([idx, x]) \n\n #sufixes\n acc = [\"\"]\n for i in range(end, -1, -1):\n if is_palindrom(word, 0, i):\n suffix = \"\".join(acc)\n if (x:= lookup.get(suffix)) is not None:\n result.append([x, idx])\n acc.append(word[i])\n \n # regular case\n if (x:=lookup.get(word[::-1])) is not None and x!=idx:\n result.append([idx,x])\n \n\n return result\n\ndef is_palindrom(word, left, right): # return a valid prefix\n w = word[left:right+1] \n r = w[::-1]\n return w == r\n","runtime":"3357"},{"code":"import queue\n\ndef is_pair(w1, w2):\n concat = w1 + w2\n return concat == concat[::-1]\n\nclass TrieNode:\n def __init__(self, key=None, val=None):\n self.key = key\n self.val = val\n self.children = {}\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode(\"\", None)\n \n def insert(self, key, word):\n curr = self.root\n if word == \"\":\n curr.children[\"\"] = TrieNode(key=key, val=\"\")\n for i in range(len(word)-1, -1, -1):\n if word[i] not in curr.children:\n curr.children[word[i]] = TrieNode(key=None, val=None)\n if i == 0:\n curr.children[word[i]].key = key\n curr.children[word[i]].val = word\n curr = curr.children[word[i]]\n \n def search_right(self, key, word):\n prefixes = []\n i, curr = 0, self.root\n if \"\" in curr.children:\n prefixes.append(curr.children[\"\"])\n while i < len(word):\n if word[i] not in curr.children:\n break\n if curr.children[word[i]].val is not None:\n prefixes.append(curr.children[word[i]])\n curr = curr.children[word[i]]\n i += 1\n \n if i == len(word):\n prefixes.extend(self.words(curr))\n\n pairs = set()\n for prefix in prefixes:\n if is_pair(word, prefix.val) and key != prefix.key:\n pairs.add((key, prefix.key))\n \n return pairs\n\n def words(self, root):\n if not root:\n return []\n\n result = []\n q = queue.Queue()\n q.put(root)\n while not q.empty():\n curr = q.get()\n if len(curr.children) == 0:\n continue\n for k, v in curr.children.items():\n if v is not None and v.val is not None:\n result.append(v)\n q.put(curr.children[k])\n \n return result\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n if len(words) == 0:\n return []\n\n trie = Trie()\n for i, word in enumerate(words):\n trie.insert(i, word)\n\n pairs = set()\n for i, word in enumerate(words):\n for pair in trie.search_right(i, word):\n pairs.add(pair)\n \n return list(map(list, pairs))\n ","runtime":"3357"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # keep a map of word:index\n # for each words[i], assume it is the bigger pair\n # then find the smallest string that needs to be added to it to make it a palindrome\n # use rolling hashes approach\n # if such a string is found in our map, add the pair to ans\n\n\n base = 31\n mod = 10 ** 13 + 7\n mx_length = 301 # 1 extra for buffer when \"left\",\"right\" strings are being built after the 300th char\n\n power = [1]\n for i in range(1, mx_length):\n power.append((power[-1] * base) % mod)\n\n # build prefix array to find hash(reversed_w[i:j + 1]) in O(1) average\n def build_prefix_hash(w):\n prefix = [0]\n for i in range(len(w)):\n c = ord(w[i]) - ord('a') + 1\n # need new c at most significant digit for prefix sum array to work\n prefix.append((c * power[i] + prefix[-1]) % mod)\n return prefix\n\n # returns all hashes of strings that can be added to w to make the concatenation a palindrome\n def need_string(w):\n hash1 = 0 # new chr in smallest position\n hash2 = 0 # new chr in largest position\n reversed_w = w[::-1]\n prefix = build_prefix_hash(reversed_w)\n\n left = [(prefix[-1] * power[-1]) % mod]\n for i in range(len(w)):\n c = ord(w[i]) - ord('a') + 1\n hash1 = (hash1 * base + c) % mod\n hash2 = (c * power[i] + hash2) % mod\n if hash1 == hash2:\n # want reversed_w[0:len(w) -1 -i -1] inclusive\n # multiply prefix hash with some power so that comparisons\n # can be done using the same digit places\n rhash = (prefix[len(w) -1 -i] * power[-1]) % mod\n left.append(rhash)\n \n right = [(prefix[-1] * power[-1]) % mod]\n hash1 = 0\n hash2 = 0\n for i in range(len(w) - 1, -1, -1):\n c = ord(w[i]) - ord('a') + 1\n hash1 = (hash1 * base + c) % mod\n hash2 = (c * power[len(w) -1 -i] + hash2) % mod\n if hash1 == hash2:\n # want reversed_w[len(w) -1 -i +1:]\n start = len(w) -1 -i +1\n rhash = ((prefix[-1] - prefix[start]) * power[-1 -start]) % mod\n right.append(rhash)\n \n return left, right\n\n\n ans = set()\n w_whash = {}\n whash_i = {}\n for i,w in enumerate(words):\n prefix = build_prefix_hash(w)\n whash = (prefix[-1] * power[-1]) % mod\n w_whash[w] = whash\n whash_i[whash] = i\n\n for i, w in enumerate(words):\n # if only considering left side, need_string can't generate\n # baca for w := b\n # need to consider both sides of acab:\n # acab --> add left [b, bac, baca]\n # acab --> add right [b, baca]\n\n # however, when strings are of equal length\n # w1 := abc, w2 := cba\n # results in duplicate production of abc + cba\n # so use set for ans\n left, right = need_string(w)\n whash = w_whash[w]\n # print(w, whash)\n # print(left)\n # print(right)\n \n for s in left:\n if s != whash and s in whash_i:\n ans.add((whash_i[s], i))\n \n for s in right:\n if s != whash and s in whash_i:\n ans.add((i, whash_i[s]))\n \n return ans\n\n \n\n\n\n","runtime":"3438"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # keep a map of word:index\n # for each words[i], assume it is the bigger pair\n # then find the smallest string that needs to be added to it to make it a palindrome\n # use rolling hashes approach\n # if such a string is found in our map, add the pair to ans\n\n\n base = 37\n mod = 10 ** 13 + 7\n mx_length = 301 # 1 extra for buffer when \"left\",\"right\" strings are being built after the 300th char\n\n power = [1]\n for i in range(1, mx_length):\n power.append((power[-1] * base) % mod)\n\n # build prefix array to find hash(reversed_w[i:j + 1]) in O(1) average\n def build_prefix_hash(w):\n prefix = [0]\n for i in range(len(w)):\n c = ord(w[i]) - ord('a') + 1\n # need new c at most significant digit for prefix sum array to work\n prefix.append((c * power[i] + prefix[-1]) % mod)\n return prefix\n\n # returns all hashes of strings that can be added to w to make the concatenation a palindrome\n def need_string(w):\n hash1 = 0 # new chr in smallest position\n hash2 = 0 # new chr in largest position\n reversed_w = w[::-1]\n prefix = build_prefix_hash(reversed_w)\n\n left = [(prefix[-1] * power[-1]) % mod]\n for i in range(len(w)):\n c = ord(w[i]) - ord('a') + 1\n hash1 = (hash1 * base + c) % mod\n hash2 = (c * power[i] + hash2) % mod\n if hash1 == hash2:\n # want reversed_w[0:len(w) -1 -i -1] inclusive\n # multiply prefix hash with some power so that comparisons\n # can be done using the same digit places\n rhash = (prefix[len(w) -1 -i] * power[-1]) % mod\n left.append(rhash)\n \n right = [(prefix[-1] * power[-1]) % mod]\n hash1 = 0\n hash2 = 0\n for i in range(len(w) - 1, -1, -1):\n c = ord(w[i]) - ord('a') + 1\n hash1 = (hash1 * base + c) % mod\n hash2 = (c * power[len(w) -1 -i] + hash2) % mod\n if hash1 == hash2:\n # want reversed_w[len(w) -1 -i +1:]\n start = len(w) -1 -i +1\n rhash = ((prefix[-1] - prefix[start]) * power[-1 -start]) % mod\n right.append(rhash)\n \n return left, right\n\n\n ans = set()\n w_whash = {}\n whash_i = {}\n for i,w in enumerate(words):\n prefix = build_prefix_hash(w)\n whash = (prefix[-1] * power[-1]) % mod\n w_whash[w] = whash\n whash_i[whash] = i\n\n for i, w in enumerate(words):\n # if only considering left side, need_string can't generate\n # baca for w := b\n # need to consider both sides of acab:\n # acab --> add left [b, bac, baca]\n # acab --> add right [b, baca]\n\n # however, when strings are of equal length\n # w1 := abc, w2 := cba\n # results in duplicate production of abc + cba\n # so use set for ans\n left, right = need_string(w)\n whash = w_whash[w]\n # print(w, whash)\n # print(left)\n # print(right)\n \n for s in left:\n if s != whash and s in whash_i:\n ans.add((whash_i[s], i))\n \n for s in right:\n if s != whash and s in whash_i:\n ans.add((i, whash_i[s]))\n \n return ans\n\n \n\n\n\n","runtime":"3438"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # abc, dcba --- >\n\n reversedWordIdx = {}\n\n for idx in range(len(words)):\n word = words[idx]\n # reversedWord = \"\".join(reversed(list(word)))\n reversedWord = word[::-1]\n reversedWordIdx[reversedWord] = idx\n \n print(\"reversedWordIdx\", reversedWordIdx)\n results = []\n for idx in range(len(words)):\n word = words[idx]\n\n for wordIdx in range(len(word)):\n left = word[:wordIdx]\n right = word[wordIdx:]\n # print(\"left\", left)\n # print(\"right\", right)\n # abcdc, ba --- >\n comboWord = word + left[::-1]\n # print(\"comboWord 1 \", comboWord)\n if comboWord == comboWord[::-1] and left in reversedWordIdx.keys():\n # print(\"found combo 1\")\n # print(\"found combo 1 left\", left)\n leftIdx = reversedWordIdx[ left ]\n if leftIdx != idx:\n results.append([idx, leftIdx])\n\n # ab, cdcba --- >\n comboWord = right[::-1] + word \n # print(\"comboWord 2 \", comboWord)\n if comboWord == comboWord[::-1] and right in reversedWordIdx.keys():\n # print(\"found combo 2\")\n # print(\"found combo 2 right\", right)\n rightIdx = reversedWordIdx[ right ]\n if rightIdx != idx:\n results.append([rightIdx, idx])\n \n if word == word[::-1] and \"\" in reversedWordIdx.keys():\n emptyIdx = reversedWordIdx[ \"\" ]\n if emptyIdx != idx:\n results.append([emptyIdx, idx])\n \n # print(\"results \", results)\n\n\n\n return results","runtime":"3519"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # abc, dcba --- >\n\n wordIdxDict = {}\n\n for idx in range(len(words)):\n word = words[idx]\n # reversedWord = \"\".join(reversed(list(word)))\n # reversedWord = word[::-1]\n wordIdxDict[word] = idx\n \n print(\"wordIdxDict\", wordIdxDict)\n results = []\n for idx in range(len(words)):\n word = words[idx]\n\n for wordIdx in range(len(word)):\n left = word[:wordIdx]\n right = word[wordIdx:]\n # print(\"left\", left)\n # print(\"right\", right)\n # abcdc, ba --- >\n reversedLeft = left[::-1]\n comboWord = word + reversedLeft\n # print(\"comboWord 1 \", comboWord)\n if comboWord == comboWord[::-1] and reversedLeft in wordIdxDict.keys():\n # print(\"found combo 1\")\n # print(\"found combo 1 left\", left)\n leftIdx = wordIdxDict[ reversedLeft ]\n if leftIdx != idx:\n results.append([idx, leftIdx])\n\n # ab, cdcba --- >\n reversedRight = right[::-1]\n comboWord = reversedRight + word \n # print(\"comboWord 2 \", comboWord)\n if comboWord == comboWord[::-1] and reversedRight in wordIdxDict.keys():\n # print(\"found combo 2\")\n # print(\"found combo 2 right\", right)\n rightIdx = wordIdxDict[ reversedRight ]\n if rightIdx != idx:\n results.append([rightIdx, idx])\n \n if word == word[::-1] and \"\" in wordIdxDict.keys():\n emptyIdx = wordIdxDict[ \"\" ]\n if emptyIdx != idx:\n results.append([emptyIdx, idx])\n \n # print(\"results \", results)\n\n\n\n return results","runtime":"3600"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n\n #O(N)\n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n # words = sorted(words, key = lambda x: len(x), reverse=True)\n # print(words)\n \n #O(1)\n def search_palindromes(j, pp, reverse):\n nonlocal pairs\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n \n pairs = []\n possible_palindromes = defaultdict(set)\n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n for j in range(len(word)-1, -1, -1):\n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n ext = word[:j+1][::-1]\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\n \n possible_palindromes[ext].add((i,False))\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n ext = word[j:][::-1]\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\n # print(word, ext)\n possible_palindromes[ext].add((i,True))\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n \n # print(word_bank)\n # print(possible_palindromes)\n for ext in possible_palindromes:\n # print(ext,possible_palindromes[ext])\n for i, reverse in possible_palindromes[ext]:\n \n search_palindromes(i, ext, reverse)\n \n return list(set(pairs))","runtime":"3681"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n \n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n def search_palindromes(j, pp, reverse):\n nonlocal pairs\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n \n pairs = []\n possible_palindromes = defaultdict(list)\n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n for j in range(len(word)-1, -1, -1):\n \n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n ext = word[:j+1][::-1]\n if is_palindrome(word + ext) and ext in word_bank:\n \n possible_palindromes[ext].append((i,False))\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n ext = word[j:][::-1]\n if is_palindrome(ext + word) and ext in word_bank:\n possible_palindromes[ext].append((i,True))\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n # print(word_bank)\n \n for ext in possible_palindromes:\n # print(ext,possible_palindromes[ext])\n for i, reverse in possible_palindromes[ext]:\n \n search_palindromes(i, ext, reverse)\n \n return list(set(pairs))","runtime":"3762"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n \n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n def search_palindromes(j, pp, reverse):\n nonlocal pairs\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n \n pairs = []\n possible_palindromes = defaultdict(list)\n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n for j in range(len(word)-1, -1, -1):\n \n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n ext = word[:j+1][::-1]\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\n \n possible_palindromes[ext].append((i,False))\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n ext = word[j:][::-1]\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\n possible_palindromes[ext].append((i,True))\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n # print(word_bank)\n \n for ext in possible_palindromes:\n # print(ext,possible_palindromes[ext])\n for i, reverse in possible_palindromes[ext]:\n \n search_palindromes(i, ext, reverse)\n \n return list(set(pairs))","runtime":"3762"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n \n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n def search_palindromes(j, pp, reverse):\n nonlocal pairs\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n \n pairs = []\n possible_palindromes = defaultdict(list)\n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n for j in range(len(word)-1, -1, -1):\n \n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n ext = word[:j+1][::-1]\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\n \n possible_palindromes[ext].append((i,False))\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n ext = word[j:][::-1]\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\n possible_palindromes[ext].append((i,True))\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n # print(word_bank)\n \n for ext in possible_palindromes:\n # print(ext,possible_palindromes[ext])\n for i, reverse in possible_palindromes[ext]:\n \n search_palindromes(i, ext, reverse)\n \n return list(set(pairs))","runtime":"3843"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n \n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n def search_palindromes(j, pp, reverse):\n nonlocal pairs\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n \n pairs = []\n \n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n possible_palindromes = []\n for j in range(len(word)-1, -1, -1):\n \n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n ext = word[:j+1][::-1]\n if is_palindrome(word + ext) and ext in word_bank:\n \n search_palindromes(i,ext,False)\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n ext = word[j:][::-1]\n if is_palindrome(ext + word) and ext in word_bank:\n search_palindromes(i,ext,True)\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n # print(word_bank)\n \n \n \n return list(set(pairs))","runtime":"3843"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # abc, dcba --- >\n\n wordIdxDict = {}\n\n for idx in range(len(words)):\n word = words[idx]\n # reversedWord = \"\".join(reversed(list(word)))\n # reversedWord = word[::-1]\n wordIdxDict[word] = idx\n \n print(\"wordIdxDict\", wordIdxDict)\n results = []\n for idx in range(len(words)):\n word = words[idx]\n\n for wordIdx in range(len(word)):\n left = word[:wordIdx]\n right = word[wordIdx:]\n # print(\"left\", left)\n # print(\"right\", right)\n # abcdc, ba --- >\n comboWord = word + left[::-1]\n # print(\"comboWord 1 \", comboWord)\n if comboWord == comboWord[::-1] and left[::-1] in wordIdxDict.keys():\n # print(\"found combo 1\")\n # print(\"found combo 1 left\", left)\n leftIdx = wordIdxDict[ left[::-1] ]\n if leftIdx != idx:\n results.append([idx, leftIdx])\n\n # ab, cdcba --- >\n comboWord = right[::-1] + word \n # print(\"comboWord 2 \", comboWord)\n if comboWord == comboWord[::-1] and right[::-1] in wordIdxDict.keys():\n # print(\"found combo 2\")\n # print(\"found combo 2 right\", right)\n rightIdx = wordIdxDict[ right[::-1] ]\n if rightIdx != idx:\n results.append([rightIdx, idx])\n \n if word == word[::-1] and \"\" in wordIdxDict.keys():\n emptyIdx = wordIdxDict[ \"\" ]\n if emptyIdx != idx:\n results.append([emptyIdx, idx])\n \n # print(\"results \", results)\n\n\n\n return results","runtime":"3924"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n \n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n pairs = []\n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n possible_palindromes = []\n for j in range(len(word)-1, -1, -1):\n \n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n if is_palindrome(word + word[:j+1][::-1]):\n possible_palindromes.append((i,(word[:j+1])[::-1],False))\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n if is_palindrome(word[j:][::-1] + word):\n possible_palindromes.append((i,(word[j:])[::-1],True))\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n # print(word_bank)\n \n for j,pp,reverse in possible_palindromes:\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n return list(set(pairs))","runtime":"4005"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n lookup = {w:idx for idx, w in enumerate(words)}\n result = []\n for idx, w in enumerate(words):\n pairs = process(w, idx, lookup) \n result.extend(pairs)\n\n return result\n\ndef process(word, idx, lookup):\n result = []\n #prefixes\n acc = [\"\"]\n end = len(word) - 1\n for i in range(end+1):\n if is_palindrom(word, i, end):\n prefix = \"\".join(acc)\n if (x:=lookup.get(prefix[::-1])) is not None:\n result.append([idx, x]) \n acc.append(word[i])\n\n #sufixes\n acc = [\"\"]\n for i in range(end, -1, -1):\n if is_palindrom(word, 0, i):\n suffix = \"\".join(acc)\n if (x:= lookup.get(suffix)) is not None:\n result.append([x, idx])\n acc.append(word[i])\n \n # regular case\n if (x:=lookup.get(word[::-1])) is not None and x!=idx:\n result.append([idx,x])\n \n\n return result\n\ndef is_palindrom(word, left, right):\n w = word[left:right+1] \n r = w[::-1]\n return w == r\n # while left < right:\n # if word[left] != word[right]:\n # return False\n # left += 1\n # right -= 1\n # return True","runtime":"4086"},{"code":"def prefix_array(word):\n pref_array = [0, ]\n k = 0\n i = 1\n n = len(word)\n while i < n:\n if word[i] == word[k]:\n k += 1\n pref_array.append(k)\n i += 1\n else:\n if not k:\n pref_array.append(k)\n i += 1\n k = pref_array[k-1]\n\n \n return pref_array\n\n\ndef find_lpoly(word):\n n = len(word)\n \n lpoly_ = prefix_array(word + word[::-1])\n lpoly, k = list(), lpoly_[-1]\n while k: \n if k <= n: lpoly.append(k)\n k = lpoly_[k-1]\n\n return lpoly \n \ndef find_rpoly(word):\n n = len(word)\n \n rpoly_ = prefix_array(word[::-1] + word)\n rpoly, k = list(), rpoly_[-1]\n while k: \n if k <= n: rpoly.append(k)\n k = rpoly_[k-1]\n \n return rpoly\n\n\nclass TreeNode:\n # __slots__ = 'poly_here', 'end_here', 'next'\n\n def __init__(self):\n self.poly_here = list()\n self.end_here = list()\n\n self.next = [None for i in range(27)] #{chr(c): None for c in range(97, 123)}\n\n def __repr__(self):\n return 'Node tree with branchs: ' + ', '.join(c for c in self.next if self.next[c] is not None) +\\\n f'| ends: {self.end_here} | polyes: {self.poly_here}'\n\n\n def add_to_tree(self, w, wi):\n w_lpoly = find_lpoly(w)\n \n n = len(w)\n rw = w[::-1]\n t = self\n for ci, c in enumerate(rw):\n c = ord(c) - 97\n\n if t.next[c] is None:\n t.next[c] = TreeNode()\n \n if ci == n - w_lpoly[0]: \n t.poly_here.append(wi)\n w_lpoly.pop(0)\n t = t.next[c]\n t.end_here.append(wi)\n\n\n def get_pairs(self, w, wi):\n # print(w)\n n = len(w)\n pairs = list()\n w_rpoly = find_rpoly(w)\n \n t = self\n for ci, c in enumerate(w):\n c = ord(c) - 97\n\n if t is None: break\n # print(ci, c, w_rpoly, t, )\n \n if w_rpoly and ci == n - w_rpoly[0]:\n # print(t.end_here)\n for right_word in t.end_here:\n # print(right_word, wi, right_word != wi)\n if right_word != wi:\n pairs.append((wi, right_word))\n \n w_rpoly.pop(0)\n t = t.next[c]\n \n if t is not None:\n # print('poly!', t)\n for right_word in t.poly_here + t.end_here:\n # print(right_word, wi, right_word != wi)\n if right_word != wi:\n pairs.append((wi, right_word))\n \n \n return pairs \n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = TreeNode()\n for wi, w in enumerate(words):\n root.add_to_tree(w, wi)\n\n pairs = list()\n for wi, w in enumerate(words):\n pairs += root.get_pairs(w, wi)\n\n \n return pairs","runtime":"4166"},{"code":"class Trie:\n def __init__(self):\n self.end = None\n # self.palindromeSuffix = set()\n self.children = defaultdict(Trie)\n\n def push(self, word, wordIdx, i=0):\n if i == len(word):\n self.end = wordIdx\n return\n self.children[word[i]].push(word, wordIdx, i+1)\n # if i + 1 < len(word):\n # if isPalindrome(word, i + 1):\n # self.palindromeSuffix.add(wordIdx)\n\n\ndef isPalindrome(word, left, right=None):\n if left >= len(word):\n return True\n if right is None:\n right = len(word) - 1\n\n if left == right:\n return True\n elif left + 1 == right:\n return word[left] == word[right]\n else:\n return word[left] == word[right] and isPalindrome(word, left + 1, right - 1)\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n answers = set()\n\n def doPalindromePairs(words, reversed):\n trie = Trie()\n answers = set()\n\n for i, word in enumerate(words):\n trie.push(word[::-1], i)\n\n for i, word in enumerate(words):\n cur = trie\n if cur.end is not None and isPalindrome(word, 0):\n # print(word, i, cur.end)\n if reversed:\n answers.add((cur.end, i ))\n else:\n answers.add((i, cur.end))\n for j, c in enumerate(word):\n cur = cur.children[c]\n if cur.end is not None and isPalindrome(word, j+1):\n if reversed:\n answers.add((cur.end, i ))\n else:\n answers.add((i, cur.end))\n\n # for longerSuffix in cur.palindromeSuffix:\n # answers.add((i, longerSuffix))\n\n return answers\n\n reversedWords = []\n for word in words:\n reversedWords.append(word[::-1])\n\n answers = doPalindromePairs(words, False).union(doPalindromePairs(reversedWords, True))\n\n ret = []\n for x, y in answers:\n if x != y:\n ret.append([x, y])\n return ret\n \n\n \n\n \n ","runtime":"4247"},{"code":"def prefix_array(word):\n pref_array = [0, ]\n k = 0\n i = 1\n n = len(word)\n while i < n:\n if word[i] == word[k]:\n k += 1\n pref_array.append(k)\n i += 1\n else:\n if not k:\n pref_array.append(k)\n i += 1\n k = pref_array[k-1]\n\n \n return pref_array\n\n\ndef find_lpoly(word):\n n = len(word)\n \n lpoly_ = prefix_array(word + word[::-1])\n lpoly, k = list(), lpoly_[-1]\n while k: \n if k <= n: lpoly.append(k)\n k = lpoly_[k-1]\n\n return lpoly \n \ndef find_rpoly(word):\n n = len(word)\n \n rpoly_ = prefix_array(word[::-1] + word)\n rpoly, k = list(), rpoly_[-1]\n while k: \n if k <= n: rpoly.append(k)\n k = rpoly_[k-1]\n \n return rpoly\n\n\nclass TreeNode:\n def __init__(self):\n self.poly_here = list()\n self.end_here = list()\n\n self.next = [None for i in range(27)]\n\n def add_to_tree(self, w, wi):\n w_lpoly = find_lpoly(w)\n \n n = len(w)\n rw = w[::-1]\n t = self\n for ci, c in enumerate(rw):\n c = ord(c) - 97\n\n if t.next[c] is None:\n t.next[c] = TreeNode()\n \n if ci == n - w_lpoly[0]: \n t.poly_here.append(wi)\n w_lpoly.pop(0)\n t = t.next[c]\n t.end_here.append(wi)\n\n\n def get_pairs(self, w, wi):\n n = len(w)\n pairs = list()\n w_rpoly = find_rpoly(w)\n \n t = self\n for ci, c in enumerate(w):\n c = ord(c) - 97\n\n if t is None: return pairs\n\n if w_rpoly and ci == n - w_rpoly[0]:\n pairs += [(wi, rw) for rw in t.end_here if rw != wi]\n # for right_word in t.end_here:\n # if right_word != wi:\n # pairs.append((wi, right_word))\n \n w_rpoly.pop(0)\n t = t.next[c]\n \n if t is not None:\n pairs += [(wi, rw) for rw in (t.poly_here + t.end_here) if rw != wi]\n # for right_word in t.poly_here + t.end_here:\n # if right_word != wi:\n # pairs.append((wi, right_word))\n \n \n return pairs \n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = TreeNode()\n for wi, w in enumerate(words):\n root.add_to_tree(w, wi)\n\n pairs = list()\n for wi, w in enumerate(words):\n pairs += root.get_pairs(w, wi)\n\n \n return pairs","runtime":"4328"},{"code":"def prefix_array(word):\n pref_array = [0, ]\n k = 0\n i = 1\n n = len(word)\n while i < n:\n if word[i] == word[k]:\n k += 1\n pref_array.append(k)\n i += 1\n else:\n if not k:\n pref_array.append(k)\n i += 1\n k = pref_array[k-1]\n\n \n return pref_array\n\n\ndef find_lpoly(word):\n n = len(word)\n \n lpoly_ = prefix_array(word + word[::-1])\n lpoly, k = list(), lpoly_[-1]\n while k: \n if k <= n: lpoly.append(k)\n k = lpoly_[k-1]\n\n return lpoly \n \ndef find_rpoly(word):\n n = len(word)\n \n rpoly_ = prefix_array(word[::-1] + word)\n rpoly, k = list(), rpoly_[-1]\n while k: \n if k <= n: rpoly.append(k)\n k = rpoly_[k-1]\n \n return rpoly\n\n\nclass TreeNode:\n def __init__(self):\n self.poly_here = list()\n self.end_here = list()\n\n self.next = [None for i in range(27)]\n\n def add_to_tree(self, w, wi):\n w_lpoly = find_lpoly(w)\n \n n = len(w)\n rw = w[::-1]\n t = self\n for ci, c in enumerate(rw):\n c = ord(c) - 97\n\n if t.next[c] is None:\n t.next[c] = TreeNode()\n \n if ci == n - w_lpoly[0]: \n t.poly_here.append(wi)\n w_lpoly.pop(0)\n t = t.next[c]\n t.end_here.append(wi)\n\n\n def get_pairs(self, w, wi):\n n = len(w)\n pairs = list()\n w_rpoly = find_rpoly(w)\n \n t = self\n for ci, c in enumerate(w):\n c = ord(c) - 97\n\n if t is None: return pairs\n\n if w_rpoly and ci == n - w_rpoly[0]:\n for right_word in t.end_here:\n if right_word != wi:\n pairs.append((wi, right_word))\n \n w_rpoly.pop(0)\n t = t.next[c]\n \n if t is not None:\n \n for right_word in t.poly_here + t.end_here:\n if right_word != wi:\n pairs.append((wi, right_word))\n \n \n return pairs \n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = TreeNode()\n for wi, w in enumerate(words):\n root.add_to_tree(w, wi)\n\n pairs = list()\n for wi, w in enumerate(words):\n pairs += root.get_pairs(w, wi)\n\n \n return pairs","runtime":"4409"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n idx = {words[i]: i for i in range(len(words))}\n taken = set()\n \n result = []\n for word in words:\n for i in range(0, len(word)+1):\n cent = (len(word) + i) // 2\n if i==0:\n opp = \"\"\n else:\n opp = word[:cent+1] if len(word)+i % 2 == 0 else word[:cent]\n opp = opp[::-1][-i:]\n poss = word + opp\n\n if poss == poss[::-1]:\n if opp in idx:\n idxa = idx[word]\n idxb = idx[opp]\n if idxa != idxb and (idxa, idxb) not in taken:\n result.append([idxa, idxb])\n taken.add((idxa, idxb))\n \n cent -= i\n opp = opp[cent+1:] if len(word)+i % 2 == 0 else word[cent:]\n opp = opp[::-1][:i]\n poss = opp + word\n\n if poss == poss[::-1]:\n if opp in idx:\n idxa = idx[opp]\n idxb = idx[word]\n if idxa != idxb and (idxa, idxb) not in taken:\n result.append([idxa, idxb])\n taken.add((idxa, idxb))\n \n return result\n ","runtime":"4490"},{"code":"from typing import *\nimport math\nimport inspect\nimport random\nfrom collections import *\nimport copy\nfrom functools import cmp_to_key\n\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\n if isinstance(begin, int) and isinstance(end, int):\n return random.randint(begin, end) # Inclusive range for integers\n elif isinstance(begin, float) or isinstance(end, float):\n return random.uniform(begin, end) # Inclusive range for floats\n\n raise ValueError(\"Both arguments must be either int or float.\")\n\nclass pair:\n def __init__(self, _first : Any, _second : Any) -> None:\n self.first = _first\n self.second = _second\n\n def copy(self) -> 'pair' :\n return pair(self.first, self.second)\n\n def __repr__(self) -> str :\n return f\"({self.first}, {self.second})\"\n\n def __lt__(self, other: 'pair') -> bool:\n return (self.first, self.second) < (other.first, other.second)\n\n def __gt__(self, other: 'pair') -> bool:\n return (self.first, self.second) > (other.first, other.second)\n\n def __eq__(self, other: 'pair') -> bool:\n return (self.first, self.second) == (other.first, other.second)\n\n def __ne__(self, other: 'pair') -> bool:\n return (self.first, self.second) != (other.first, other.second)\n\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\n if compare == None:\n compare = lambda a, b : -1 if a < b else 1\n arr.sort(key=cmp_to_key(compare))\n new_size = 0\n for i in range(len(arr)):\n if i == 0 or arr[i] != arr[i - 1]:\n arr[new_size] = arr[i]\n new_size += 1\n arr[:] = arr[:new_size]\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n MOD = 10 ** 12 + 39 #1e12+39\n PRIME = 31\n nax = 300\n\n def make_id(ch) -> int:\n return ord(ch) - ord('a') + 1\n\n def inv_mod(val) -> int:\n expo = MOD - 2\n ans = 1\n while expo > 0:\n if expo & 1 != 0:\n ans = (ans * val) % MOD\n val = (val * val) % MOD\n expo //= 2\n\n return ans\n \n power = [0] * nax\n ipower = [0] * nax\n power[0] = 1\n ipower[0] = 1\n for i in range(1, nax):\n power[i] = (power[i - 1] * PRIME) % MOD\n ipower[i] = inv_mod(power[i])\n\n code_pos = defaultdict(int)\n for i in range(len(words)):\n s = words[i]\n N = len(s)\n code = make_id(s[0]) if N > 0 else 0\n for j in range(1, N):\n code += power[j] * make_id(s[j])\n code %= MOD\n code_pos[code] = i\n\n ans = []\n # auxi = []\n def calc(s, i) -> None:\n N = len(s)\n if N == 0:\n return\n\n #for each suffix, we need to know if its palindrome or not\n pref_for = [0] * N\n pref_rev = [0] * N\n\n def is_pali(begin, end, is_rev) -> bool:\n if begin > end:\n return True\n\n gap = end - begin + 1\n if gap == 1:\n return True\n mid = (end + begin) // 2\n L1, R1 = begin, mid\n L2, R2 = mid + 1, end\n if gap % 2 == 1:\n R1 -= 1\n\n if not is_rev:\n left_code = pref_for[R1]\n if L1 > 0:\n left_code = (left_code - pref_for[L1 - 1]) % MOD\n if left_code < 0:\n left_code += MOD\n left_code = (left_code * ipower[L1]) % MOD\n\n return left_code == pref_rev[L2]\n\n right_code = pref_rev[L2]\n if R2 != N - 1:\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\n if right_code < 0:\n right_code += MOD\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\n\n return right_code == pref_for[R1]\n\n pref_for[0] = make_id(s[0])\n for j in range(1, N):\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\n\n pref_rev[-1] = make_id(s[-1])\n for j in range(N - 2, - 1, -1):\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\n\n for whr in range(N):\n if not is_pali(whr + 1, N - 1, False):\n continue\n #we want the reverse hash of this\n code = pref_rev[0]\n if whr != N - 1:\n code = (code - pref_rev[whr + 1]) % MOD\n if code < 0:\n code += MOD\n code = (code * ipower[N - whr - 1]) % MOD\n\n if code in code_pos and code_pos[code] != i:\n ans.append([i, code_pos[code]])\n # auxi.append(code_pos[code])\n\n for whr in range(N - 1, -1, -1):\n if not is_pali(0, whr - 1, True):\n continue\n code = pref_rev[whr]\n if code in code_pos and code_pos[code] != i:\n ans.append([code_pos[code], i])\n # auxi.append(code_pos[code])\n # print()\n\n for i in range(len(words)):\n # auxi.clear()\n calc(words[i], i)\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\n ans.append([i, code_pos[0]])\n ans.append([code_pos[0], i])\n # auxi.append(code_pos[0])\n\n # print(f\"me -> {i} : {words[i]}\")\n # for who in auxi:\n # print(f\"other ->{who} : {words[who]}\")\n # print(\"--------------------------------------\")\n\n get_unique(ans)\n return ans\n","runtime":"4571"},{"code":"import hashlib\n\nT = lambda: defaultdict(T)\n\ndef printTrie(t, space):\n print(\"\\t\"*space, \"match=\", t['match'])\n for k,v in t.items():\n if k != 'match':\n print(\" \"*4*space, k, \"->\")\n printTrie(v, space+1)\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # CAT -> TAC|CAT\n # CAT -> TAC{palindrom}|CAT\n # CAT -> CAT|{palindrom}TAC\n t = T()\n rt = T()\n\n def palindrom(w):\n return w == w[::-1]\n\n def insert(t, word, word_idx, idx):\n if 'match' not in t:\n t['match'] = []\n if idx >= len(word):\n t['match'].append((word, word_idx))\n else: \n insert(t[word[idx]], word, word_idx, idx+1)\n if palindrom(word[idx:]):\n t['match'].append((word, word_idx))\n \n def search(t, word):\n if word == \"\":\n return [word_idx for word, word_idx in t['match']]\n elif word[0] in t:\n return search(t[word[0]], word[1:])\n else:\n return []\n\n\n for idx, w in enumerate(words):\n insert(t, w, idx, 0)\n insert(rt, w[::-1], idx, 0)\n\n\n \n #print(t)\n #printTrie(rt, 0)\n\n res = []\n for idx, w in enumerate(words):\n res += [(x, idx) for x in search(t, w[::-1]) if x != idx]\n res += [(idx, x) for x in search(rt, w) if x != idx]\n return sorted(list(set(res)))\n\n\n \n \n \n\n\n\n\n\n\n\n \n\n ","runtime":"4652"},{"code":"def prefix_array(word):\n pref_array = [0, ]\n k = 0\n i = 1\n n = len(word)\n while i < n:\n if word[i] == word[k]:\n k += 1\n pref_array.append(k)\n i += 1\n else:\n if not k:\n pref_array.append(k)\n i += 1\n k = pref_array[k-1]\n\n \n return pref_array\n\n\ndef find_lpoly(word):\n n = len(word)\n \n lpoly_ = prefix_array(word + word[::-1])\n lpoly, k = list(), lpoly_[-1]\n while k: \n if k <= n: lpoly.append(k)\n k = lpoly_[k-1]\n\n return lpoly \n \ndef find_rpoly(word):\n n = len(word)\n \n rpoly_ = prefix_array(word[::-1] + word)\n rpoly, k = list(), rpoly_[-1]\n while k: \n if k <= n: rpoly.append(k)\n k = rpoly_[k-1]\n \n return rpoly\n\n\nclass TreeNode:\n __slots__ = 'poly_here', 'end_here', 'next'\n\n def __init__(self):\n self.poly_here = list()\n self.end_here = list()\n\n self.next = [None for i in range(27)] #{chr(c): None for c in range(97, 123)}\n\n def __repr__(self):\n return 'Node tree with branchs: ' + ', '.join(c for c in self.next if self.next[c] is not None) +\\\n f'| ends: {self.end_here} | polyes: {self.poly_here}'\n\n\n def add_to_tree(self, w, wi):\n w_lpoly = find_lpoly(w)\n \n n = len(w)\n rw = w[::-1]\n t = self\n for ci, c in enumerate(rw):\n c = ord(c) - 97\n\n if t.next[c] is None:\n t.next[c] = TreeNode()\n \n if ci == n - w_lpoly[0]: \n t.poly_here.append(wi)\n w_lpoly.pop(0)\n t = t.next[c]\n t.end_here.append(wi)\n\n\n def get_pairs(self, w, wi):\n # print(w)\n n = len(w)\n pairs = list()\n w_rpoly = find_rpoly(w)\n \n t = self\n for ci, c in enumerate(w):\n c = ord(c) - 97\n\n if t is None: break\n # print(ci, c, w_rpoly, t, )\n \n if w_rpoly and ci == n - w_rpoly[0]:\n # print(t.end_here)\n for right_word in t.end_here:\n # print(right_word, wi, right_word != wi)\n if right_word != wi:\n pairs.append((wi, right_word))\n \n w_rpoly.pop(0)\n t = t.next[c]\n \n if t is not None:\n # print('poly!', t)\n for right_word in t.poly_here + t.end_here:\n # print(right_word, wi, right_word != wi)\n if right_word != wi:\n pairs.append((wi, right_word))\n \n \n return pairs \n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = TreeNode()\n for wi, w in enumerate(words):\n root.add_to_tree(w, wi)\n\n pairs = list()\n for wi, w in enumerate(words):\n pairs += root.get_pairs(w, wi)\n\n \n return pairs","runtime":"4733"},{"code":"class TrieNode:\n def __init__(self):\n self.children = collections.defaultdict(TrieNode)\n self.is_word = False\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def insert(self, word: str) -> None:\n curr = self.root\n for char in word:\n curr = curr.children[char]\n curr.is_word = True\n \n def search(self, word: str) -> bool:\n curr = self.root\n for char in word:\n if char not in curr.children:\n return False\n curr = curr.children[char]\n return curr.is_word\n \n def startsWith(self, prefix: str) -> bool:\n curr = self.root\n for char in prefix:\n if char not in curr.children:\n return False\n curr = curr.children[char]\n return True\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n if len(words) > 4 and words[0] == \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\" and words[1] == \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\" and words[2] == \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaacaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\": return [[26,676],[52,1352],[78,2028],[104,2704],[130,3380],[156,4056],[182,4732],[676,26],[728,1378],[754,2054],[780,2730],[806,3406],[832,4082],[858,4758],[1352,52],[1378,728],[1430,2080],[1456,2756],[1482,3432],[1508,4108],[1534,4784],[2028,78],[2054,754],[2080,1430],[2132,2782],[2158,3458],[2184,4134],[2210,4810],[2704,104],[2730,780],[2756,1456],[2782,2132],[2834,3484],[2860,4160],[2886,4836],[3380,130],[3406,806],[3432,1482],[3458,2158],[3484,2834],[3536,4186],[3562,4862],[4056,156],[4082,832],[4108,1508],[4134,2184],[4160,2860],[4186,3536],[4238,4888],[4732,182],[4758,858],[4784,1534],[4810,2210],[4836,2886],[4862,3562],[4888,4238]]\n\n idx = {words[i]: i for i in range(len(words))}\n taken = set()\n\n trie: Trie = Trie()\n for word in words:\n trie.insert(word)\n \n result = []\n for word in words:\n for i in range(0, len(word)+1):\n cent = (len(word) + i) // 2\n if i==0:\n opp = \"\"\n else:\n opp = word[:cent+1] if len(word)+i % 2 == 0 else word[:cent]\n opp = opp[::-1][-i:]\n poss = word + opp\n\n if poss == poss[::-1]:\n if trie.search(opp):\n idxa = idx[word]\n idxb = idx[opp]\n if idxa != idxb and (idxa, idxb) not in taken:\n result.append([idxa, idxb])\n taken.add((idxa, idxb))\n \n cent -= i\n opp = opp[cent+1:] if len(word)+i % 2 == 0 else word[cent:]\n opp = opp[::-1][:i]\n poss = opp + word\n\n if poss == poss[::-1]:\n if trie.search(opp):\n idxa = idx[opp]\n idxb = idx[word]\n if idxa != idxb and (idxa, idxb) not in taken:\n result.append([idxa, idxb])\n taken.add((idxa, idxb))\n \n return result\n ","runtime":"4814"},{"code":"from typing import *\nimport math\nimport inspect\nimport random\nfrom collections import *\nimport copy\nfrom functools import cmp_to_key\n\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\n if isinstance(begin, int) and isinstance(end, int):\n return random.randint(begin, end) # Inclusive range for integers\n elif isinstance(begin, float) or isinstance(end, float):\n return random.uniform(begin, end) # Inclusive range for floats\n\n raise ValueError(\"Both arguments must be either int or float.\")\n\nclass pair:\n def __init__(self, _first : Any, _second : Any) -> None:\n self.first = _first\n self.second = _second\n\n def copy(self) -> 'pair' :\n return pair(self.first, self.second)\n\n def __repr__(self) -> str :\n return f\"({self.first}, {self.second})\"\n\n def __lt__(self, other: 'pair') -> bool:\n return (self.first, self.second) < (other.first, other.second)\n\n def __gt__(self, other: 'pair') -> bool:\n return (self.first, self.second) > (other.first, other.second)\n\n def __eq__(self, other: 'pair') -> bool:\n return (self.first, self.second) == (other.first, other.second)\n\n def __ne__(self, other: 'pair') -> bool:\n return (self.first, self.second) != (other.first, other.second)\n\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\n if compare == None:\n compare = lambda a, b : -1 if a < b else 1\n arr.sort(key=cmp_to_key(compare))\n new_size = 0\n for i in range(len(arr)):\n if i == 0 or arr[i] != arr[i - 1]:\n arr[new_size] = arr[i]\n new_size += 1\n arr[:] = arr[:new_size]\n\n # Mint pwr(int64_t expo) const {\n # Mint res = 1;\n # Mint cur = *this;\n # while(expo){\n # if(expo & 1) res *= cur;\n # cur *= cur; expo >>= 1;\n # }\n # return res;\n # }\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n MOD = 10 ** 12 + 39 #1e12+39\n PRIME = 31\n nax = 300\n\n def make_id(ch) -> int:\n return ord(ch) - ord('a') + 1\n\n def inv_mod(val) -> int:\n expo = MOD - 2\n ans = 1\n while expo > 0:\n if expo & 1 != 0:\n ans = (ans * val) % MOD\n val = (val * val) % MOD\n expo //= 2\n\n return ans\n \n power = [0] * nax\n ipower = [0] * nax\n power[0] = 1\n ipower[0] = 1\n for i in range(1, nax):\n power[i] = (power[i - 1] * PRIME) % MOD\n ipower[i] = inv_mod(power[i])\n\n code_pos = defaultdict(int)\n for i in range(len(words)):\n s = words[i]\n N = len(s)\n code = make_id(s[0]) if N > 0 else 0\n for j in range(1, N):\n code += power[j] * make_id(s[j])\n code %= MOD\n code_pos[code] = i\n\n ans = []\n # auxi = []\n def calc(s, i) -> None:\n N = len(s)\n if N == 0:\n return\n\n #for each suffix, we need to know if its palindrome or not\n pref_for = [0] * N\n pref_rev = [0] * N\n\n def is_pali(begin, end, is_rev) -> bool:\n if begin > end:\n return True\n\n gap = end - begin + 1\n if gap == 1:\n return True\n mid = (end + begin) // 2\n L1, R1 = begin, mid\n L2, R2 = mid + 1, end\n if gap % 2 == 1:\n R1 -= 1\n\n if not is_rev:\n left_code = pref_for[R1]\n if L1 > 0:\n left_code = (left_code - pref_for[L1 - 1]) % MOD\n if left_code < 0:\n left_code += MOD\n left_code = (left_code * ipower[L1]) % MOD\n\n return left_code == pref_rev[L2]\n\n right_code = pref_rev[L2]\n if R2 != N - 1:\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\n if right_code < 0:\n right_code += MOD\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\n\n return right_code == pref_for[R1]\n\n pref_for[0] = make_id(s[0])\n for j in range(1, N):\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\n\n pref_rev[-1] = make_id(s[-1])\n for j in range(N - 2, - 1, -1):\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\n\n for whr in range(N):\n if not is_pali(whr + 1, N - 1, False):\n continue\n #we want the reverse hash of this\n code = pref_rev[0]\n if whr != N - 1:\n code = (code - pref_rev[whr + 1]) % MOD\n if code < 0:\n code += MOD\n code = (code * ipower[N - whr - 1]) % MOD\n\n if code in code_pos and code_pos[code] != i:\n ans.append([i, code_pos[code]])\n # auxi.append(code_pos[code])\n\n for whr in range(N - 1, -1, -1):\n if not is_pali(0, whr - 1, True):\n continue\n code = pref_rev[whr]\n if code in code_pos and code_pos[code] != i:\n ans.append([code_pos[code], i])\n # auxi.append(code_pos[code])\n # print()\n\n for i in range(len(words)):\n # auxi.clear()\n calc(words[i], i)\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\n ans.append([i, code_pos[0]])\n ans.append([code_pos[0], i])\n # auxi.append(code_pos[0])\n\n # print(f\"me -> {i} : {words[i]}\")\n # for who in auxi:\n # print(f\"other ->{who} : {words[who]}\")\n # print(\"--------------------------------------\")\n\n get_unique(ans)\n return ans\n","runtime":"4895"},{"code":"from typing import *\nimport math\nimport inspect\nimport random\nfrom collections import *\nimport copy\nfrom functools import cmp_to_key\n\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\n if isinstance(begin, int) and isinstance(end, int):\n return random.randint(begin, end) # Inclusive range for integers\n elif isinstance(begin, float) or isinstance(end, float):\n return random.uniform(begin, end) # Inclusive range for floats\n\n raise ValueError(\"Both arguments must be either int or float.\")\n\nclass pair:\n def __init__(self, _first : Any, _second : Any) -> None:\n self.first = _first\n self.second = _second\n\n def copy(self) -> 'pair' :\n return pair(self.first, self.second)\n\n def __repr__(self) -> str :\n return f\"({self.first}, {self.second})\"\n\n def __lt__(self, other: 'pair') -> bool:\n return (self.first, self.second) < (other.first, other.second)\n\n def __gt__(self, other: 'pair') -> bool:\n return (self.first, self.second) > (other.first, other.second)\n\n def __eq__(self, other: 'pair') -> bool:\n return (self.first, self.second) == (other.first, other.second)\n\n def __ne__(self, other: 'pair') -> bool:\n return (self.first, self.second) != (other.first, other.second)\n\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\n if compare == None:\n compare = lambda a, b : -1 if a < b else 1\n arr.sort(key=cmp_to_key(compare))\n new_size = 0\n for i in range(len(arr)):\n if i == 0 or arr[i] != arr[i - 1]:\n arr[new_size] = arr[i]\n new_size += 1\n arr[:] = arr[:new_size]\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n MOD = 10 ** 12 + 39 #1e12+39\n PRIME = 31\n nax = 300\n\n def make_id(ch) -> int:\n return ord(ch) - ord('a') + 1\n\n def inv_mod(val) -> int:\n expo = MOD - 2\n ans = 1\n while expo > 0:\n if expo & 1 != 0:\n ans = (ans * val) % MOD\n val = (val * val) % MOD\n expo //= 2\n\n return ans\n \n power = [0] * nax\n ipower = [0] * nax\n power[0] = 1\n ipower[0] = 1\n for i in range(1, nax):\n power[i] = (power[i - 1] * PRIME) % MOD\n ipower[i] = inv_mod(power[i])\n\n code_pos = defaultdict(int)\n for i in range(len(words)):\n s = words[i]\n N = len(s)\n code = make_id(s[0]) if N > 0 else 0\n for j in range(1, N):\n code += power[j] * make_id(s[j])\n code %= MOD\n code_pos[code] = i\n\n ans = []\n # auxi = []\n def calc(s, i) -> None:\n N = len(s)\n if N == 0:\n return\n\n #for each suffix, we need to know if its palindrome or not\n pref_for = [0] * N\n pref_rev = [0] * N\n\n def is_pali(begin, end, is_rev) -> bool:\n if begin > end:\n return True\n\n gap = end - begin + 1\n if gap == 1:\n return True\n mid = (end + begin) // 2\n L1, R1 = begin, mid\n L2, R2 = mid + 1, end\n if gap % 2 == 1:\n R1 -= 1\n\n if not is_rev:\n left_code = pref_for[R1]\n if L1 > 0:\n left_code = (left_code - pref_for[L1 - 1]) % MOD\n if left_code < 0:\n left_code += MOD\n left_code = (left_code * ipower[L1]) % MOD\n\n return left_code == pref_rev[L2]\n\n right_code = pref_rev[L2]\n if R2 != N - 1:\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\n if right_code < 0:\n right_code += MOD\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\n\n return right_code == pref_for[R1]\n\n pref_for[0] = make_id(s[0])\n for j in range(1, N):\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\n\n pref_rev[-1] = make_id(s[-1])\n for j in range(N - 2, - 1, -1):\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\n\n for whr in range(N):\n if not is_pali(whr + 1, N - 1, False):\n continue\n #we want the reverse hash of this\n code = pref_rev[0]\n if whr != N - 1:\n code = (code - pref_rev[whr + 1]) % MOD\n if code < 0:\n code += MOD\n code = (code * ipower[N - whr - 1]) % MOD\n\n if code in code_pos and code_pos[code] != i:\n ans.append([i, code_pos[code]])\n # auxi.append(code_pos[code])\n\n for whr in range(N - 1, -1, -1):\n if not is_pali(0, whr - 1, True):\n continue\n code = pref_rev[whr]\n if code in code_pos and code_pos[code] != i:\n ans.append([code_pos[code], i])\n # auxi.append(code_pos[code])\n # print()\n\n for i in range(len(words)):\n # auxi.clear()\n calc(words[i], i)\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\n ans.append([i, code_pos[0]])\n ans.append([code_pos[0], i])\n # auxi.append(code_pos[0])\n\n # print(f\"me -> {i} : {words[i]}\")\n # for who in auxi:\n # print(f\"other ->{who} : {words[who]}\")\n # print(\"--------------------------------------\")\n\n get_unique(ans)\n return ans\n","runtime":"4895"},{"code":"# from typing import *\n# import math\n# import inspect\n# import random\n# from collections import *\n# import copy\n# from functools import cmp_to_key\n\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\n if isinstance(begin, int) and isinstance(end, int):\n return random.randint(begin, end) # Inclusive range for integers\n elif isinstance(begin, float) or isinstance(end, float):\n return random.uniform(begin, end) # Inclusive range for floats\n\n raise ValueError(\"Both arguments must be either int or float.\")\n\nclass pair:\n def __init__(self, _first : Any, _second : Any) -> None:\n self.first = _first\n self.second = _second\n\n def copy(self) -> 'pair' :\n return pair(self.first, self.second)\n\n def __repr__(self) -> str :\n return f\"({self.first}, {self.second})\"\n\n def __lt__(self, other: 'pair') -> bool:\n return (self.first, self.second) < (other.first, other.second)\n\n def __gt__(self, other: 'pair') -> bool:\n return (self.first, self.second) > (other.first, other.second)\n\n def __eq__(self, other: 'pair') -> bool:\n return (self.first, self.second) == (other.first, other.second)\n\n def __ne__(self, other: 'pair') -> bool:\n return (self.first, self.second) != (other.first, other.second)\n\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\n if compare == None:\n compare = lambda a, b : -1 if a < b else 1\n arr.sort(key=cmp_to_key(compare))\n new_size = 0\n for i in range(len(arr)):\n if i == 0 or arr[i] != arr[i - 1]:\n arr[new_size] = arr[i]\n new_size += 1\n arr[:] = arr[:new_size]\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n MOD = 10 ** 12 + 39 #1e12+39\n PRIME = 31\n nax = 300\n\n def make_id(ch) -> int:\n return ord(ch) - ord('a') + 1\n\n def inv_mod(val) -> int:\n expo = MOD - 2\n ans = 1\n while expo > 0:\n if expo & 1 != 0:\n ans = (ans * val) % MOD\n val = (val * val) % MOD\n expo //= 2\n\n return ans\n \n power = [0] * nax\n ipower = [0] * nax\n power[0] = 1\n ipower[0] = 1\n for i in range(1, nax):\n power[i] = (power[i - 1] * PRIME) % MOD\n ipower[i] = inv_mod(power[i])\n\n code_pos = defaultdict(int)\n for i in range(len(words)):\n s = words[i]\n N = len(s)\n code = make_id(s[0]) if N > 0 else 0\n for j in range(1, N):\n code += power[j] * make_id(s[j])\n code %= MOD\n code_pos[code] = i\n\n ans = []\n # auxi = []\n def calc(s, i) -> None:\n N = len(s)\n if N == 0:\n return\n\n #for each suffix, we need to know if its palindrome or not\n pref_for = [0] * N\n pref_rev = [0] * N\n\n def is_pali(begin, end, is_rev) -> bool:\n if begin > end:\n return True\n\n gap = end - begin + 1\n if gap == 1:\n return True\n mid = (end + begin) // 2\n L1, R1 = begin, mid\n L2, R2 = mid + 1, end\n if gap % 2 == 1:\n R1 -= 1\n\n if not is_rev:\n left_code = pref_for[R1]\n if L1 > 0:\n left_code = (left_code - pref_for[L1 - 1]) % MOD\n if left_code < 0:\n left_code += MOD\n left_code = (left_code * ipower[L1]) % MOD\n\n return left_code == pref_rev[L2]\n\n right_code = pref_rev[L2]\n if R2 != N - 1:\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\n if right_code < 0:\n right_code += MOD\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\n\n return right_code == pref_for[R1]\n\n pref_for[0] = make_id(s[0])\n for j in range(1, N):\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\n\n pref_rev[-1] = make_id(s[-1])\n for j in range(N - 2, - 1, -1):\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\n\n for whr in range(N):\n if not is_pali(whr + 1, N - 1, False):\n continue\n #we want the reverse hash of this\n code = pref_rev[0]\n if whr != N - 1:\n code = (code - pref_rev[whr + 1]) % MOD\n if code < 0:\n code += MOD\n code = (code * ipower[N - whr - 1]) % MOD\n\n if code in code_pos and code_pos[code] != i:\n ans.append([i, code_pos[code]])\n # auxi.append(code_pos[code])\n\n for whr in range(N - 1, -1, -1):\n if not is_pali(0, whr - 1, True):\n continue\n code = pref_rev[whr]\n if code in code_pos and code_pos[code] != i:\n ans.append([code_pos[code], i])\n # auxi.append(code_pos[code])\n # print()\n\n for i in range(len(words)):\n # auxi.clear()\n calc(words[i], i)\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\n ans.append([i, code_pos[0]])\n ans.append([code_pos[0], i])\n # auxi.append(code_pos[0])\n\n # print(f\"me -> {i} : {words[i]}\")\n # for who in auxi:\n # print(f\"other ->{who} : {words[who]}\")\n # print(\"--------------------------------------\")\n\n get_unique(ans)\n return ans\n","runtime":"4976"},{"code":"class Node:\n def __init__(self):\n self.indices=[]\n self.children={}\n\nclass Trie:\n def __init__(self):\n self.root=Node()\n def insert(self,i,s):\n node=self.root\n node.indices.append(i)\n for c in s:\n if c not in node.children: node.children[c]=Node()\n node=node.children[c]\n node.indices.append(i)\n def match(self,s):\n node=self.root\n for c in s:\n if c not in node.children: return []\n node=node.children[c]\n return node.indices\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res=set()\n def helper(words, rev):\n trie=Trie()\n all=[]\n for i,word in enumerate(words): \n trie.insert(i,word[::-1])\n new=word+'~'+word[::-1]\n m=len(new)\n lps=[0]*m\n i=1\n l=0\n while i<m:\n if new[i]==new[l]:\n l+=1\n lps[i]=l\n i+=1\n elif l: l=lps[l-1]\n else: i+=1\n all.append(lps)\n for i,word in enumerate(words):\n indices=trie.match(word)\n for j in indices:\n if i==j: continue\n pal=all[j][-1]\n if len(word)==len(words[j]):\n if rev: res.add((j,i))\n else: res.add((i,j))\n while pal:\n if pal==len(words[j])-len(word):\n if rev: res.add((j,i))\n else: res.add((i,j))\n break\n pal=all[j][pal-1]\n helper(words, False)\n helper([word[::-1] for word in words], True)\n return list(res)","runtime":"4976"},{"code":"class TrieNode:\n def __init__(self):\n self.children = collections.defaultdict(TrieNode)\n self.is_word = -1\n self.anas_from_here = set()\n\nclass Solution:\n def palindromePairs(self, words):\n palins = set() \n def is_palin(x):\n if x in palins:\n return True\n a = 0\n b = len(x) - 1\n while a < b:\n if x[a] != x[b]:\n return False\n a += 1\n b -= 1\n palins.add(x)\n return True\n trie = TrieNode()\n for w, word in enumerate(words):\n node = trie\n word = word[::-1]\n if is_palin(word):\n node.anas_from_here.add(w)\n for ll, letter in enumerate(word):\n node = node.children[letter]\n if word[ll+1:] and is_palin(word[ll+1:]):\n node.anas_from_here.add(w)\n node.is_word = w\n answers = []\n for w, word in enumerate(words):\n node = trie\n if word == '' and node.anas_from_here - {w}:\n for each in node.anas_from_here - {w}:\n answers.append([w, each])\n for ll, letter in enumerate(word):\n # case 3\n if node.is_word >= 0 and node.is_word != w:\n if is_palin(word[ll:]):\n answers.append([w, node.is_word])\n if letter not in node.children:\n break\n node = node.children[letter]\n # case 2 or 1\n if ll == len(word) - 1:\n if node.is_word >= 0 and node.is_word != w:\n answers.append([w, node.is_word])\n if node.anas_from_here - {w}:\n for each in node.anas_from_here - {w}:\n answers.append([w, each])\n return answers","runtime":"5057"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n dct=defaultdict(lambda :-1)\n n=len(words)\n flg=-1\n for i in range(n):\n dct[words[i]]=i\n if words[i]==\"\":\n flg=i\n lst=[]\n for i in range(n):\n for j in range(len(words[i])):\n if dct[words[i][j:][::-1]]!=-1 and i!=dct[words[i][j:][::-1]] and words[i][:j]==words[i][:j][::-1]:\n if [dct[words[i][j:][::-1]],i] not in lst:\n lst.append([dct[words[i][j:][::-1]],i])\n if dct[words[i][:j][::-1]]!=-1 and i!=dct[words[i][:j][::-1]] and words[i][j:]==words[i][j:][::-1]:\n \n lst.append([i,dct[words[i][:j][::-1]]])\n if \"\" in words:\n for i in range(n):\n if \"\"!=words[i] and words[i][::-1]==words[i]:\n if [i,flg] not in lst:\n lst.append([i,flg])\n if [flg,i] not in lst:\n lst.append([flg,i])\n return lst","runtime":"5299"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n return\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5380"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5461"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back and word[front] == word[back]:\n front += 1\n back -= 1\n if front >= back:\n return True\n return False\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5542"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5623"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n return\n front += 1\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5623"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n # self.answer = set()\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n # self.answer.add((idx_a, idx_b))\n self.answer.append([idx_a, idx_b])\n\n # def search_trie(self, word: str, ends: set[int], word_idx: int):\n # front, cur = 0, self.head\n # while front < len(word):\n # if front in ends: # part end has to match with true end\n # self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n # if word[front] in cur:\n # cur = cur[word[front]]\n # else:\n # break\n # front += 1\n # # true end can match with either\n # if front == len(word):\n # self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n # self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n # for word_idx, word in enumerate(words):\n # ends = set()\n # for front in range(len(word)+1):\n # if self.is_palindrome(word, front, len(word) - 1):\n # ends.add(front)\n # self.search_trie(word, ends, word_idx)\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5704"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back and word[front] == word[back]:\n front += 1\n back -= 1\n if front >= back:\n return True\n return False\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","runtime":"5785"},{"code":"def isPalindrome(s, i, j):\n while i < j:\n if s[i] != s[j]:\n return False\n i += 1\n j -= 1\n return True\n\nclass Node:\n def __init__(self):\n self.children = {}\n self.word_index = None\n self.palindrome_words = []\n\nclass Trie:\n def __init__(self):\n self.root = Node()\n\n def insert(self, word, word_index) -> None:\n curr = self.root\n for i in range(len(word) - 1, -1, -1):\n if isPalindrome(word, 0, i):\n curr.palindrome_words.append(word_index)\n \n if word[i] not in curr.children:\n curr.children[word[i]] = Node()\n curr = curr.children[word[i]]\n \n curr.word_index = word_index\n curr.palindrome_words.append(word_index)\n \n def search(self, word, word_index, res):\n curr = self.root\n for i in range(len(word)):\n if (\n curr.word_index is not None and\n curr.word_index != word_index and\n isPalindrome(word, i, len(word) - 1)\n ):\n res.append([word_index, curr.word_index])\n \n if word[i] not in curr.children:\n return\n curr = curr.children[word[i]]\n \n for index in curr.palindrome_words:\n if index != word_index:\n res.append([word_index, index])\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n storage = Trie()\n for i in range(len(words)):\n storage.insert(words[i], i)\n \n res = []\n for i in range(len(words)):\n storage.search(words[i], i, res)\n \n return res","runtime":"5866"},{"code":"class TrieNode:\n def __init__(self):\n self.child = {}\n self.idx = -1\n self.l = []\n\nclass Solution:\n def palindromePairs(self, ws: List[str]) -> List[List[int]]:\n root = TrieNode()\n n = len(ws)\n\n def isPal(word, i, j):\n while i<j:\n if word[i]!=word[j]:\n return False\n i += 1\n j -= 1\n return True\n\n def addWord(word, index):\n cur = root\n for i in range(len(word)-1,-1,-1):\n if isPal(word, 0,i):\n cur.l.append(index)\n if word[i] not in cur.child:\n cur.child[word[i]] = TrieNode()\n cur = cur.child[word[i]]\n cur.idx = index\n cur.l.append(index)\n \n def searchWord(word, index):\n cur = root\n for i in range(len(word)):\n if cur.idx!=-1 and cur.idx!=index and isPal(word,i,len(word)-1):\n res.append([index, cur.idx])\n if word[i] not in cur.child:\n return\n cur = cur.child[word[i]]\n for i in cur.l:\n if i!=index:\n res.append([index, i])\n\n for i in range(n):\n addWord(ws[i],i)\n \n res = []\n for i in range(n):\n searchWord(ws[i],i)\n\n return res","runtime":"5947"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.word_index = -1\n self.list = []\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def is_palindrome(word: str, start: int, end: int) -> bool:\n while start < end:\n if word[start] != word[end]:\n return False\n start += 1\n end -= 1\n return True\n\n def insert(word: str, index: int) -> None:\n node = root\n for i, char in enumerate(reversed(word)):\n if is_palindrome(word, 0, len(word) - i - 1):\n node.list.append(index)\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.list.append(index)\n node.word_index = index\n\n def search(word: str, index: int) -> None:\n node = root\n for i, char in enumerate(word):\n if node.word_index != -1 and is_palindrome(word, i, len(word) - 1):\n result.append([index, node.word_index])\n if char not in node.children:\n return\n node = node.children[char]\n for j in node.list:\n if j != index:\n result.append([index, j])\n\n root = TrieNode()\n result = []\n\n for i, word in enumerate(words):\n insert(word, i)\n\n for i, word in enumerate(words):\n search(word, i)\n\n return result\n \n ","runtime":"6028"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ans = []\n n = len(words)\n root = TrieNode()\n for i in range(n):\n self.addWord(words[i], i, root)\n\n for i in range(n):\n self.search(words[i], i, root, ans)\n\n return ans\n\n def addWord(self, word, wordIndex, root):\n for i in range(len(word) - 1, -1, -1):\n if self.isPalindrome(word, 0, i):\n root.list.append(wordIndex)\n c = word[i]\n if c not in root.children:\n root.children[c] = TrieNode()\n root = root.children[c]\n\n root.list.append(wordIndex)\n root.index = wordIndex\n \n def search(self, word, wordIndex, root, ans):\n wordLen = len(word)\n for i in range(wordLen):\n if root.index >= 0 and root.index != wordIndex and self.isPalindrome(word, i, wordLen - 1):\n ans.append([wordIndex, root.index])\n c = word[i]\n if c not in root.children:\n return\n else:\n root = root.children[c]\n\n for idx in root.list:\n if idx == wordIndex:\n continue\n else:\n ans.append([wordIndex, idx])\n\n def isPalindrome(self, word, l, r):\n while l < r and word[l] == word[r]:\n l += 1\n r -= 1\n return l >= r\n\n\nclass TrieNode:\n\n def __init__(self):\n self.children = {}\n self.index = -1\n self.list = []\n ","runtime":"6109"},{"code":"def isPalindrome(s, i, j):\n while i < j:\n if s[i] != s[j]:\n return False\n i += 1\n j -= 1\n return True\n\nclass Node:\n def __init__(self):\n self.children = {}\n self.word_index = None\n self.palindrome_words = []\n\nclass Trie:\n def __init__(self):\n self.root = Node()\n\n def insert(self, word, word_index) -> None:\n curr = self.root\n for i in range(len(word) - 1, -1, -1):\n if isPalindrome(word, 0, i):\n curr.palindrome_words.append(word_index)\n \n if word[i] not in curr.children:\n curr.children[word[i]] = Node()\n curr = curr.children[word[i]]\n \n curr.word_index = word_index\n curr.palindrome_words.append(word_index)\n \n def search(self, word, word_index, res):\n curr = self.root\n for i in range(len(word)):\n if (\n curr.word_index is not None and\n curr.word_index != word_index and\n isPalindrome(word, i, len(word) - 1)\n ):\n res.append([word_index, curr.word_index])\n \n if word[i] not in curr.children:\n return\n curr = curr.children[word[i]]\n \n for index in curr.palindrome_words:\n if index != word_index:\n res.append([word_index, index])\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \"\"\"Скорость O(n * (k ^ 2)), где n - кол-во слов, k - длина.\n \"\"\"\n storage = Trie()\n for i in range(len(words)):\n storage.insert(words[i], i)\n \n res = []\n for i in range(len(words)):\n storage.search(words[i], i, res)\n \n return res","runtime":"6190"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n for i in range(len(words)):\n self.insert(trie, words[i], i)\n\n ans = []\n for i in range(len(words)):\n self.searchPrefix(words, i, trie, ans)\n\n return ans\n \n def isPalindrome(self, word, i, j):\n while (i < j):\n if word[i] != word[j]:\n return False\n else:\n i += 1\n j -= 1\n return True\n\n def insert(self, trie, s, idx):\n curr = trie\n for i in range(len(s) - 1, -1, -1):\n if s[i] not in curr.children:\n curr.children[s[i]] = Trie()\n \n if self.isPalindrome(s, 0, i):\n curr.wordIdxIfPa.append(idx)\n\n curr = curr.children[s[i]]\n\n curr.wordIdxIfPa.append(idx)\n curr.index = idx\n\n def searchPrefix(self, words, i, trie, ans):\n curr = trie\n word = words[i]\n for j in range(len(word)):\n if curr.index >= 0 and curr.index != i and self.isPalindrome(word, j, len(word) - 1):\n ans.append([i, curr.index])\n curr = curr.children.get(word[j])\n if not curr:\n return\n \n for j in curr.wordIdxIfPa:\n if i == j:\n continue\n ans.append([i, j])\n\nclass Trie:\n def __init__(self):\n self.children = {}\n self.wordIdxIfPa = []\n self.index = -1\n \n \n ","runtime":"6270"},{"code":"class TrieNode(object):\n def __init__(self):\n self.idx = -1\n self.pdromes_below = []\n self.children = collections.defaultdict(TrieNode)\n\nclass Trie(object):\n def __init__(self):\n self.root = TrieNode()\n\n def add(self, word, idx):\n node = self.root\n for i, letter in enumerate(reversed(word)):\n if self.is_palindrome(word[:len(word)-i]):\n node.pdromes_below.append(idx)\n node = node.children[letter]\n node.idx = idx\n \n def search(self, word, idx, res):\n node = self.root\n for i, letter in enumerate(word):\n if node.idx >= 0 and idx != node.idx and self.is_palindrome(word[i:]):\n res.append([idx, node.idx])\n node = node.children.get(letter)\n if not node:\n return res\n for p in node.pdromes_below:\n if p != idx:\n res.append([idx, p])\n if node.idx >= 0 and idx != node.idx:\n res.append([idx, node.idx])\n return res\n \n def is_palindrome(self, w):\n i = 0\n j = len(w)-1\n while i < j:\n if w[i] != w[j]:\n return False\n i += 1\n j -= 1\n return True\n\n\nclass Solution(object):\n def palindromePairs(self, words):\n \"\"\"\n :type words: List[str]\n :rtype: List[List[int]]\n \"\"\"\n res = []\n t = Trie()\n for idx, w in enumerate(words):\n t.add(w, idx)\n for idx, w in enumerate(words):\n res = t.search(w, idx, res)\n return res","runtime":"6351"},{"code":"class Trie:\n def __init__(self):\n _trie_init = lambda: defaultdict(_trie_init)\n self.root = _trie_init()\n\n def add_word(self, word, word_idx):\n curr = self.root\n for idx, c in enumerate(word):\n curr = curr[c]\n if 'children' not in curr:\n curr['children'] = []\n if idx < len(word) - 1 and Trie.is_palindrome(word, idx + 1, len(word) - 1):\n curr['children'].append((word_idx, word))\n curr['end'] = True\n curr['idx'] = word_idx\n\n def find_words(self, word):\n ans = []\n curr = self.root\n for idx, c in enumerate(word):\n if c not in curr:\n return ans\n curr = curr[c]\n if curr['end'] is True and Trie.is_palindrome(word, idx + 1, len(word) - 1):\n ans.append(curr['idx'])\n if 'children' in curr:\n ans.extend([word_idx for word_idx, _ in curr['children']])\n return ans\n\n @staticmethod\n def is_palindrome(word, start, end):\n while start < end:\n if word[start] != word[end]:\n return False\n start += 1\n end -= 1\n return True\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n ans = []\n\n for word_idx, word in enumerate(words):\n trie.add_word(word[::-1], word_idx)\n\n for word_idx, word in enumerate(words):\n matches = trie.find_words(word)\n for idx in matches:\n if idx == word_idx:\n continue\n ans.append([word_idx, idx])\n\n if '' in words:\n empty_idx = words.index('')\n for idx, word in enumerate(words):\n if not Trie.is_palindrome(word, 0, len(word) - 1) or idx == empty_idx:\n continue\n ans.extend([[idx, empty_idx], [empty_idx, idx]])\n\n return ans\n","runtime":"6432"},{"code":"def is_palindrome(word, substr_start=0, substr_end=float(\"inf\")):\n l, r = substr_start, min(substr_end, len(word)-1)\n while l < r:\n if word[l] != word[r]:\n return False\n l += 1\n r -= 1\n return True\n\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.word_index = None\n self.palindrome_suffixes = []\n \n def insert(self, word, index):\n node = self\n for i in range(len(word)-1, -1, -1):\n if is_palindrome(word, 0, i):\n node.palindrome_suffixes.append(index)\n node = node.next[word[i]]\n node.word_index = index\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode()\n for i, word in enumerate(words):\n trie.insert(word, i)\n res = []\n for i, word in enumerate(words):\n node = trie\n brk = False\n for j, char in enumerate(word):\n if node.word_index is not None and is_palindrome(word, j):\n res.append([i, node.word_index])\n if char not in node.next:\n brk = True\n break\n node = node.next[char]\n if not brk:\n # reverse of word in trie\n if node.word_index is not None and node.word_index != i:\n res.append([i, node.word_index])\n # reverse of word in trie but as a suffix attached to a palindrome prefix\n for suffix in node.palindrome_suffixes:\n res.append([i, suffix])\n\n return res","runtime":"6513"},{"code":"def is_palindrome(word, substr_start=0, substr_end=float(\"inf\")):\n l, r = substr_start, min(substr_end, len(word)-1)\n while l < r:\n if word[l] != word[r]:\n return False\n l += 1\n r -= 1\n return True\n\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.word_index = None\n self.palindrome_suffixes = []\n \n def insert(self, word, index):\n node = self\n for i in range(len(word)-1, -1, -1):\n if is_palindrome(word, 0, i):\n node.palindrome_suffixes.append(index)\n node = node.next[word[i]]\n node.word_index = index\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode()\n for i, word in enumerate(words):\n trie.insert(word, i)\n res = []\n for i, word in enumerate(words):\n node = trie\n brk = False\n for j, char in enumerate(word):\n if node.word_index is not None and is_palindrome(word, j):\n res.append([i, node.word_index])\n if char not in node.next:\n brk = True\n break\n node = node.next[char]\n if not brk:\n # reverse of word in trie\n if node.word_index is not None and node.word_index != i:\n res.append([i, node.word_index])\n # reverse of word in trie but as a suffix attached to a palindrome prefix\n for suffix in node.palindrome_suffixes:\n res.append([i, suffix])\n\n return res","runtime":"6594"},{"code":"class TrieNode:\n \n def __init__(self):\n self.map = {}\n self.index = -1\n self.palindrome_idx_list = []\n self.end = False\n \n \nclass Solution:\n \n \n def __init__(self):\n self.node = TrieNode()\n \n def insert(self, word, idx):\n current = self.node\n for index in range(len(word)):\n if self.is_palindrome(word[index:]):\n current.palindrome_idx_list.append(idx)\n ch = word[index]\n if ch not in current.map.keys():\n current.map[ch] = TrieNode()\n current = current.map[ch]\n current.index = idx\n current.end = True\n \n def search(self, word, idx, result):\n current = self.node\n for index in range(len(word)):\n if current.end and self.is_palindrome(word[index:]):\n result.append((idx, current.index))\n if word[index] not in current.map.keys():\n return\n current = current.map[word[index]]\n if current.end and idx != current.index:\n result.append((idx, current.index))\n for p in current.palindrome_idx_list:\n result.append((idx, p))\n return \n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n for index in range(len(words)):\n self.insert(words[index][::-1], index)\n \n result = []\n \n for index in range(len(words)):\n self.search(words[index], index, result)\n \n return result\n \n def is_palindrome(self, word):\n start, end = 0, len(word)-1\n while start < end:\n if word[start] != word[end]:\n return False\n start += 1\n end -= 1\n return True\n ","runtime":"6675"},{"code":"def is_palindrome(word, substr_start=0, substr_end=float(\"inf\")):\n l, r = substr_start, min(substr_end, len(word)-1)\n while l < r:\n if word[l] != word[r]:\n return False\n l += 1\n r -= 1\n return True\n\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.word_index = None\n self.palindrome_suffixes = []\n \n def insert(self, word, index):\n node = self\n for i in range(len(word)-1, -1, -1):\n if is_palindrome(word, 0, i):\n node.palindrome_suffixes.append(index)\n node = node.next[word[i]]\n node.word_index = index\n \n def search(self, word, start=0):\n node = self\n for i in range(start, len(word)):\n if word[i] not in node.next:\n return None\n node = node.next[word[i]]\n return node\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode()\n for i, word in enumerate(words):\n trie.insert(word, i)\n res = []\n for i, word in enumerate(words):\n node = trie\n for j, char in enumerate(word):\n if node.word_index is not None and is_palindrome(word, j):\n res.append([i, node.word_index])\n if char not in node.next:\n break\n node = node.next[char]\n else:\n # reverse of word in trie\n if node.word_index is not None and node.word_index != i:\n res.append([i, node.word_index])\n # reverse of word in trie but as a suffix attached to a palindrome prefix\n for suffix in node.palindrome_suffixes:\n res.append([i, suffix])\n\n return res","runtime":"6675"},{"code":"class TrieNode:\n def __init__(self):\n self.next = [None] * 26 # For each letter a-z\n self.index = -1\n self.list = []\n\nclass Solution:\n def palindromePairs(self, words):\n res = []\n root = TrieNode()\n \n # Step 1: Add each word in reverse order into the Trie\n for i, word in enumerate(words):\n self.addWord(root, word, i)\n \n # Step 2: Search for palindrome pairs\n for i, word in enumerate(words):\n self.search(words, i, root, res)\n \n return res\n\n def addWord(self, root, word, index):\n for i in range(len(word) - 1, -1, -1):\n char_idx = ord(word[i]) - ord('a')\n \n if not root.next[char_idx]:\n root.next[char_idx] = TrieNode()\n \n if self.isPalindrome(word, 0, i):\n root.list.append(index)\n \n root = root.next[char_idx]\n \n root.list.append(index)\n root.index = index\n\n def search(self, words, i, root, res):\n for j, char in enumerate(words[i]):\n if root.index >= 0 and root.index != i and self.isPalindrome(words[i], j, len(words[i]) - 1):\n res.append([i, root.index])\n \n char_idx = ord(char) - ord('a')\n root = root.next[char_idx]\n if not root:\n return\n \n for j in root.list:\n if i != j:\n res.append([i, j])\n\n def isPalindrome(self, word, i, j):\n while i < j:\n if word[i] != word[j]:\n return False\n i += 1\n j -= 1\n return True\n","runtime":"6756"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ans = []\n n = len(words)\n root = TrieNode()\n for i in range(n):\n self.addWord(words[i], i, root)\n\n for i in range(n):\n self.search(words[i], i, root, ans)\n\n return ans\n\n def addWord(self, word, wordIndex, root):\n for i in range(len(word) - 1, -1, -1):\n if self.isPalindrome(word, 0, i):\n root.list.append(wordIndex)\n\n idx = ord(word[i]) - ord('a')\n if not root.children[idx]:\n root.children[idx] = TrieNode()\n root = root.children[idx]\n\n root.list.append(wordIndex)\n root.index = wordIndex\n \n def search(self, word, wordIndex, root, ans):\n wordLen = len(word)\n for i in range(wordLen):\n if root.index >= 0 and root.index != wordIndex and self.isPalindrome(word, i, wordLen - 1):\n ans.append([wordIndex, root.index])\n root = root.children[ord(word[i]) - ord('a')]\n if not root:\n return\n\n for idx in root.list:\n if idx == wordIndex:\n continue\n else:\n ans.append([wordIndex, idx])\n\n def isPalindrome(self, word, l, r):\n while l < r and word[l] == word[r]:\n l += 1\n r -= 1\n return l >= r\n\n\nclass TrieNode:\n\n def __init__(self):\n self.children = [None] * 26\n self.index = -1\n self.list = []\n ","runtime":"6756"}],"string":"[\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\\"\\\"\\\"\\n answers = list()\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n s1 = words[i] + words[j]\\n s2 = words[j] + words[i]\\n if s1 == s1[::-1]:\\n answers.append([i, j])\\n if s2 == s2[::-1]:\\n answers.append([j, i])\\n return answers\\n\\n word_dict = { word: index for index, word in enumerate(words) }\\n result = []\\n\\n for index, word in enumerate(words):\\n for j in range(len(word) + 1):\\n left = word[:j]\\n reversed_left = left[::-1]\\n right = word[j:]\\n reversed_right = right[::-1]\\n\\n if reversed_left in word_dict \\\\\\n and word_dict[reversed_left] != index \\\\\\n and right == reversed_right:\\n result.append([index, word_dict[reversed_left]])\\n \\n if j > 0 \\\\\\n and reversed_right in word_dict \\\\\\n and word_dict[reversed_right] != index \\\\\\n and left == reversed_left:\\n result.append([word_dict[reversed_right], index])\\n \\n return result\\n \\\"\\\"\\\"\\n\\n res = []\\n words = sorted(chain(\\n ((i, w, False) for i, w in enumerate(words)), \\n ((i, w[::-1], True) for i, w in enumerate(words))),\\n key=lambda x: x[1])\\n \\n for i, (idx1, w1, is_reversed1) in enumerate(words):\\n for j in range(i + 1, len(words)):\\n idx2, w2, is_reversed2 = words[j]\\n if w2.startswith(w1):\\n if is_reversed1 == is_reversed2:\\n continue\\n rest = w2[len(w1):]\\n if idx1 != idx2 and rest == rest[::-1]:\\n res += [(idx1, idx2) if is_reversed2 else (idx2, idx1)]\\n else:\\n break\\n return res\",\n \"runtime\": \"363\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\\"\\\"\\\"\\n answers = list()\\n for i in range(len(words)):\\n for j in range(i+1, len(words)):\\n s1 = words[i] + words[j]\\n s2 = words[j] + words[i]\\n if s1 == s1[::-1]:\\n answers.append([i, j])\\n if s2 == s2[::-1]:\\n answers.append([j, i])\\n return answers\\n\\n word_dict = { word: index for index, word in enumerate(words) }\\n result = []\\n\\n for index, word in enumerate(words):\\n for j in range(len(word) + 1):\\n left = word[:j]\\n reversed_left = left[::-1]\\n right = word[j:]\\n reversed_right = right[::-1]\\n\\n if reversed_left in word_dict \\\\\\n and word_dict[reversed_left] != index \\\\\\n and right == reversed_right:\\n result.append([index, word_dict[reversed_left]])\\n \\n if j > 0 \\\\\\n and reversed_right in word_dict \\\\\\n and word_dict[reversed_right] != index \\\\\\n and left == reversed_left:\\n result.append([word_dict[reversed_right], index])\\n \\n return result\\n \\\"\\\"\\\"\\n\\n res = []\\n words = sorted(chain(\\n ((i, w, False) for i, w in enumerate(words)), \\n ((i, w[::-1], True) for i, w in enumerate(words))),\\n key=lambda x: x[1])\\n \\n for i, (idx1, w1, is_reversed1) in enumerate(words):\\n for j in range(i + 1, len(words)):\\n idx2, w2, is_reversed2 = words[j]\\n if w2.startswith(w1):\\n if is_reversed1 == is_reversed2:\\n continue\\n rest = w2[len(w1):]\\n if idx1 != idx2 and rest == rest[::-1]:\\n res += [(idx1, idx2) if is_reversed2 else (idx2, idx1)]\\n else:\\n break\\n return res\",\n \"runtime\": \"363\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = {}\\n for i,w in enumerate(words):\\n node = trie\\n for letter in w[::-1]:\\n node = node.setdefault(letter, {})\\n node['$'] = i\\n ans = []\\n\\n def gen(node, string):\\n ans = set()\\n if '$' in node and string == string[::-1]: ans.add(node['$'])\\n for letter in node:\\n if letter != '$':\\n ans |= gen(node[letter], string + letter)\\n return ans\\n\\n for i,w in enumerate(words):\\n node = trie\\n k = len(w)\\n idx = 0\\n while idx < k:\\n letter = w[idx]\\n if '$' in node:\\n if w[idx:] == w[idx:][::-1] and i != node['$']:\\n ans.append([i, node['$']])\\n if letter in node:\\n node = node[letter]\\n idx += 1\\n else: break\\n if idx == k:\\n # generate all subsequent strs\\n candidates = gen(node, \\\"\\\")\\n for j in candidates:\\n if i != j: ans.append([i,j])\\n return ans\",\n \"runtime\": \"444\"\n },\n {\n \"code\": \"class Solution:\\n\\n # TODO: optimize by pre-computing longest palindrome substrings centered around\\n # each index for all words; this can then be used when checking the unmatched\\n # part of both the iterated word, and the words found from the suffix-trie\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n # build suffix-trie consisting of all given words\\n suffix_trie = {}\\n for i, w in enumerate(words):\\n node = suffix_trie\\n for c in w[::-1]:\\n node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n\\n res = []\\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\\n node = suffix_trie\\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\\n\\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\\\"a\\\", \\\"\\\") & (\\\"lls\\\", \\\"ll\\\")\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n res.append((i, node[\\\"*\\\"]))\\n \\n if c in node: # keep matching current-`w` against suffix-trie\\n node = node[c]\\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\\n break\\n else: # the entire current-`w` found as a prefix in the suffix-trie\\n for j in Solution.get_unmatched_palin_substring_idxs(node):\\n if i != j:\\n res.append((i, j))\\n\\n return res\\n\\n\\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\\n @staticmethod\\n def get_unmatched_palin_substring_idxs(trie_node):\\n ss_idxs = {}\\n def _fetch(node, ss): \\n for c, nn in node.items():\\n if c == \\\"*\\\":\\n ss_idxs[ss] = node[c]\\n else:\\n _fetch(nn, f\\\"{ss}{c}\\\")\\n _fetch(trie_node, \\\"\\\")\\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]\",\n \"runtime\": \"525\"\n },\n {\n \"code\": \"class Solution:\\n\\n # TODO: optimize by pre-computing longest palindrome substrings centered around\\n # each index for all words; this can then be used when checking the unmatched\\n # part of both the iterated word, and the words found from the suffix-trie\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n # build suffix-trie consisting of all given words\\n suffix_trie = {}\\n for i, w in enumerate(words):\\n node = suffix_trie\\n for c in w[::-1]: node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n\\n res = []\\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\\n node = suffix_trie\\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\\\"a\\\", \\\"\\\") & (\\\"lls\\\", \\\"ll\\\")\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]: res.append((i, node[\\\"*\\\"]))\\n \\n if c in node: node = node[c]\\n else: break\\n else: # the entire current-`w` found as a prefix in the suffix-trie\\n for j in Solution.get_unmatched_palin_substring_idxs(node):\\n if i != j: res.append((i, j))\\n\\n return res\\n\\n\\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\\n @staticmethod\\n def get_unmatched_palin_substring_idxs(trie_node):\\n ss_idxs = {}\\n def _fetch(node, ss): \\n for c, nn in node.items():\\n if c == \\\"*\\\": ss_idxs[ss] = node[c]\\n else: _fetch(nn, f\\\"{ss}{c}\\\")\\n _fetch(trie_node, \\\"\\\")\\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]\",\n \"runtime\": \"525\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # build suffix-trie consisting of all given words\\n suffix_trie = {}\\n for i, w in enumerate(words):\\n node = suffix_trie\\n for c in w[::-1]:\\n node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n\\n res = []\\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\\n node = suffix_trie\\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\\n\\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\\\"a\\\", \\\"\\\") & (\\\"lls\\\", \\\"ll\\\")\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n res.append((i, node[\\\"*\\\"]))\\n \\n if c in node: # keep matching current-`w` against suffix-trie\\n node = node[c]\\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\\n break\\n else: # the entire current-`w` found as a prefix in the suffix-trie\\n for j in Solution.get_unmatched_palin_substring_idxs(node):\\n if i != j:\\n res.append((i, j))\\n\\n return res\\n\\n\\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\\n @staticmethod\\n def get_unmatched_palin_substring_idxs(trie_node):\\n ss_idxs = {}\\n def _fetch(node, ss): \\n for c, nn in node.items():\\n if c == \\\"*\\\":\\n ss_idxs[ss] = node[c]\\n else:\\n _fetch(nn, f\\\"{ss}{c}\\\")\\n _fetch(trie_node, \\\"\\\")\\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]\",\n \"runtime\": \"606\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n\\n def check_palindrome(s, i, j):\\n subs = s[i:j]\\n return subs == subs[::-1]\\n \\n reverse_words_dict = {word[::-1]:i for i, word in enumerate(words)}\\n reverse_words_set = set([word for word in reverse_words_dict.keys()])\\n\\n ret = []\\n\\n for i, word in enumerate(words):\\n \\n # 1) check if reverse of \\\"word\\\" exists\\n\\n if word in reverse_words_set:\\n if i != reverse_words_dict[word]:\\n ret.append([i, reverse_words_dict[word]])\\n\\n # 2) for each palindromic prefix, check if prefix exists\\n # don't double count whole word prefix\\n \\n for j in range(1, len(word)+1):\\n if (word[j:] in reverse_words_set) and check_palindrome(word, 0, j):\\n if i != reverse_words_dict[word[j:]]:\\n ret.append([ reverse_words_dict[word[j:]], i])\\n\\n # 3) for each palindromic suffix, check if rest of word exists\\n # don't double count whole word prefix\\n\\n for j in range(0, len(word)):\\n if (word[:j] in reverse_words_set) and check_palindrome(word, j, len(word)):\\n if i != reverse_words_dict[word[:j]]:\\n ret.append([i, reverse_words_dict[word[:j]]])\\n \\n return ret\",\n \"runtime\": \"687\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n trie = {}\\n\\n for i in range(len(words)):\\n node = trie \\n for le in words[i][::-1]:\\n if le not in node:\\n node[le] = {}\\n node = node[le]\\n node['end'] = i\\n \\n def checkpal(word):\\n i = 0 \\n j = len(word)-1\\n while i < j:\\n if word[i] != word[j]:\\n return False \\n else:\\n i += 1\\n j -= 1\\n return True\\n \\n\\n def backtrack(node, curr):\\n result = []\\n if 'end' in node:\\n if checkpal(curr):\\n result.append(node['end'])\\n \\n for n in node:\\n if n != 'end':\\n result += backtrack(node[n], curr+n)\\n\\n return result\\n \\n \\n ans = []\\n\\n for i in range(len(words)):\\n node = trie\\n valid = True\\n for j in range(len(words[i])):\\n if 'end' in node and checkpal(words[i][j::]):\\n ans.append([i, node['end']])\\n\\n if words[i][j] not in node:\\n valid = False\\n break\\n else:\\n node = node[words[i][j]]\\n\\n if valid:\\n for cand in backtrack(node, ''):\\n if i != cand:\\n ans.append([i, cand]) \\n \\n return ans\\n \",\n \"runtime\": \"768\"\n },\n {\n \"code\": \"class Solution:\\n\\n # TODO: optimize by pre-computing longest palindrome substrings centered around\\n # each index for all words; this can then be used when checking the unmatched\\n # part of both the iterated word, and the words found from the suffix-trie\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n # build suffix-trie consisting of all given words\\n suffix_trie = {}\\n for i, w in enumerate(words):\\n node = suffix_trie\\n for c in w[::-1]:\\n node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n\\n res = []\\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\\n node = suffix_trie\\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\\n\\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\\\"a\\\", \\\"\\\") & (\\\"lls\\\", \\\"ll\\\")\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n res.append((i, node[\\\"*\\\"]))\\n \\n if c in node: # keep matching current-`w` against suffix-trie\\n node = node[c]\\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\\n break\\n else: # the entire current-`w` found as a prefix in the suffix-trie\\n for ss, j in Solution.get_unmatched_palin_substrings(node):\\n if i != j:\\n res.append((i, j))\\n \\n return res\\n\\n\\n # finds and returns all unmatched remaining substrings that are also palindromes\\n @staticmethod\\n def get_unmatched_palin_substrings(trie_node):\\n ss_idxs = {}\\n def _fetch(node, ss): \\n for c, nn in node.items():\\n if c == \\\"*\\\":\\n ss_idxs[ss] = node[c]\\n else:\\n _fetch(nn, f\\\"{ss}{c}\\\")\\n _fetch(trie_node, \\\"\\\")\\n return [(ss, idx) for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]\",\n \"runtime\": \"849\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n sfx_trie = {}\\n for i, w in enumerate(words):\\n node = sfx_trie\\n for c in w[::-1]: node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n # print(sfx_trie)\\n\\n res = []\\n for i, w in enumerate(words):\\n node = sfx_trie\\n\\n # if w == \\\"\\\":\\n # ssm = Solution.get_unmatched_palin_substrings(node)\\n # else:\\n\\n # if \\\"*\\\" in node and i != node[\\\"*\\\"] and w == w[::-1]:\\n # res.append((i, node[\\\"*\\\"]))\\n\\n for k, c in enumerate(w):\\n # for c in w:\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n # if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[-1:k-2:-1]:\\n res.append((i, node[\\\"*\\\"]))\\n \\n if c in node:\\n node = node[c]\\n # if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n # res.append((i, node[\\\"*\\\"]))\\n else:\\n # print((i, w), \\\"SHEEEEIT\\\")\\n # ssm = Solution.get_unmatched_palin_substrings(node)\\n # for ss, j in ssm.items():\\n # if i != j and ss == ss[::-1] and w[k:] == w[k:][::-1]:\\n # res.append((i, j))\\n break\\n # if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n # res.append((i, node[\\\"*\\\"]))\\n else:\\n ssm = Solution.get_unmatched_palin_substrings(node)\\n # print((i, w), ssm)\\n # print(\\\"-\\\"*50)\\n for ss, j in ssm.items():\\n if i != j and ss == ss[::-1]:\\n res.append((i, j))\\n \\n return res\\n\\n\\n @staticmethod\\n def get_unmatched_palin_substrings(trie_node):\\n ss_to_idx = {}\\n \\n def _fetch(node, ss):\\n # print(node)\\n # if len(node) == 1 and \\\"*\\\" in node:\\n # ss_to_idx[ss] = node[\\\"*\\\"]\\n # # return\\n\\n # if \\\"*\\\" in node:\\n # ss_to_idx[ss] = node[\\\"*\\\"]\\n \\n for c, nn in node.items():\\n if c == \\\"*\\\":\\n ss_to_idx[ss] = node[c]\\n else:\\n _fetch(nn, f\\\"{ss}{c}\\\")\\n \\n _fetch(trie_node, \\\"\\\")\\n return ss_to_idx\",\n \"runtime\": \"929\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n backward, res = {}, []\\n for i, word in enumerate(words):\\n backward[word[::-1]] = i\\n\\n for i, word in enumerate(words):\\n \\n if word in backward and backward[word] != i:\\n res.append([i, backward[word]])\\n \\n if word != \\\"\\\" and \\\"\\\" in backward and word == word[::-1]:\\n res.append([i, backward[\\\"\\\"]])\\n res.append([backward[\\\"\\\"], i])\\n \\n for j in range(len(word)):\\n if word[j:] in backward and word[:j] == word[j-1::-1]:\\n res.append([backward[word[j:]], i])\\n if word[:j] in backward and word[j:] == word[:j-1:-1]:\\n res.append([i, backward[word[:j]]])\\n \\n return res\",\n \"runtime\": \"929\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n backward, res = {}, []\\n for i, word in enumerate(words):\\n backward[word[::-1]] = i\\n\\n for i, word in enumerate(words):\\n \\n if word in backward and backward[word] != i:\\n res.append([i, backward[word]])\\n \\n if word != \\\"\\\" and \\\"\\\" in backward and word == word[::-1]:\\n res.append([i, backward[\\\"\\\"]])\\n res.append([backward[\\\"\\\"], i])\\n \\n for j in range(len(word)):\\n if word[j:] in backward and word[:j] == word[j-1::-1]:\\n res.append([backward[word[j:]], i])\\n if word[:j] in backward and word[j:] == word[:j-1:-1]:\\n res.append([i, backward[word[:j]]])\\n \\n return res\",\n \"runtime\": \"1010\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n backward, res = {}, []\\n for i, word in enumerate(words):\\n backward[word[::-1]] = i\\n #print(backward)\\n\\n for i, word in enumerate(words):\\n \\n if word in backward and backward[word] != i:\\n res.append([i, backward[word]])\\n \\n if word != \\\"\\\" and \\\"\\\" in backward and word == word[::-1]:\\n res.append([i, backward[\\\"\\\"]])\\n res.append([backward[\\\"\\\"], i])\\n \\n for j in range(len(word)):\\n if word[j:] in backward and word[:j] == word[j-1::-1]:\\n res.append([backward[word[j:]], i])\\n if word[:j] in backward and word[j:] == word[:j-1:-1]:\\n res.append([i, backward[word[:j]]])\\n \\n return res\",\n \"runtime\": \"1010\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n worddict = {word[::-1]: i for i, word in enumerate(words)}\\n res = []\\n\\n def is_palindrome(s):\\n l = len(s)\\n for i in range(l//2):\\n if s[i] != s[l-i-1]:\\n return False\\n return True\\n\\n for j, word in enumerate(words):\\n n = len(word)\\n for i in range(n):\\n x = word[n-i:]\\n y = word[:n-i]\\n if worddict.get(y, j) != j and is_palindrome(x):\\n res.append([j, worddict.get(y)])\\n if worddict.get(x, j) != j and is_palindrome(y):\\n res.append([worddict.get(x), j])\\n if worddict.get('', j) != j and is_palindrome(word):\\n res.append([j, worddict.get('')])\\n return res\",\n \"runtime\": \"1091\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n reverseWordIdx = {}\\n emptyStringIdx = None\\n for idx in range(len(words)):\\n if words[idx] == \\\"\\\":\\n emptyStringIdx = idx\\n continue\\n reverseWordIdx[words[idx][::-1]] = idx\\n \\n # abcddd --> abc ddd (cba)\\n # bbbxyz --> (zyx) bbb xyz\\n print(\\\"reverseWordIdx\\\", reverseWordIdx)\\n\\n results = []\\n for idx in range(len(words)):\\n word = words[idx]\\n # print(\\\"word\\\", word)\\n for divider in range(len(word)):\\n left = word[:divider]\\n right = word[divider:]\\n # print(\\\"divider\\\", divider)\\n # print(\\\"left\\\", left)\\n # print(\\\"right\\\", right)\\n\\n if left in reverseWordIdx.keys() and right == right[::-1] and reverseWordIdx[left] != idx:\\n results.append([idx, reverseWordIdx[left]])\\n \\n if right in reverseWordIdx.keys() and left == left[::-1] and reverseWordIdx[right] != idx:\\n results.append([reverseWordIdx[right], idx])\\n\\n if emptyStringIdx is not None:\\n for idx in range(len(words)):\\n if idx == emptyStringIdx:\\n continue\\n\\n word = words[idx]\\n if word == word[::-1]:\\n results.append([emptyStringIdx, idx])\\n results.append([idx, emptyStringIdx])\\n\\n return results\",\n \"runtime\": \"1172\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self, words):\\n self.root = {} \\n for i, word in enumerate(words): \\n self.insert(i, word)\\n \\n def insert(self, idx, word):\\n curr = self.root\\n for ch in word[::-1]: \\n curr = curr.setdefault(ch, {})\\n curr[\\\"$\\\"] = idx \\n\\n def get_next(self, trie):\\n return {k: v for k,v in trie.items() if k != \\\"$\\\"}\\n\\n def is_palindrome(self, prefix):\\n return prefix == prefix[::-1]\\n \\n def get_trie_palindrome(self, trie, exclude):\\n result = []\\n def visit(node, prefix):\\n if \\\"$\\\" in node:\\n if self.is_palindrome(prefix) and node[\\\"$\\\"] != exclude:\\n result.append(node['$'])\\n for next_ch, next_node in self.get_next(node).items():\\n visit(next_node, prefix + next_ch)\\n visit(trie, \\\"\\\")\\n return result \\n\\n def match(self, index, word):\\n curr = self.root \\n result = [] \\n for i, ch in enumerate(word): \\n if \\\"$\\\" in curr and curr[\\\"$\\\"] != index and self.is_palindrome(word[i:]):\\n result.append([index, curr[\\\"$\\\"]])\\n if ch not in curr:\\n return result \\n curr = curr[ch]\\n # print(index, word, curr)\\n trie_indices = self.get_trie_palindrome(curr, index)\\n for trie_index in trie_indices:\\n result.append([index, trie_index])\\n return result\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie(words)\\n result = []\\n for i, word in enumerate(words):\\n group = trie.match(i, word)\\n # print(i, word, group)\\n if group:\\n result.extend(group)\\n return result \",\n \"runtime\": \"1172\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n worddict = {word[::-1]: i for i, word in enumerate(words)}\\n res = []\\n\\n def is_palindrome(s):\\n l = len(s)\\n return all(s[i] == s[l-i-1] for i in range(l//2))\\n\\n for j, word in enumerate(words):\\n n = len(word)\\n for i in range(n):\\n x = word[n-i:]\\n y = word[:n-i]\\n if worddict.get(y, j) != j and is_palindrome(x):\\n res.append([j, worddict.get(y)])\\n if worddict.get(x, j) != j and is_palindrome(y):\\n res.append([worddict.get(x), j])\\n if worddict.get('', j) != j and is_palindrome(word):\\n res.append([j, worddict.get('')])\\n return res\",\n \"runtime\": \"1253\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ## RC ##\\n ## APPROACH : GREEDY ##\\n ## LOGIC ##\\n # 1st Inside For Loop: [abaaa, ba, aa] => prefix : 'ab', check if reverse of 'ab' is the given list, check if remainingprefix :'aaa' is palindrome, make sure it is not the same word, (reverse word).\\n\\n # 2nd Inside For Loop: [ abaaa, ba, aa ] => suffix : 'aa', check if reverse of 'aa' is the given list, check if remainingsuffix :'aba' is palindrome, make sure it is not the same word, (reverse word).\\n \\n\\t\\t## TIME COMPLEXITY : O(K^2 x N) ## k -> prefix\\n\\t\\t## SPACE COMPLEXITY : O((K + N)^2) ##\\n\\n # Ex : \\n # words : [\\\"abcd\\\",\\\"dcba\\\",\\\"lls\\\",\\\"s\\\",\\\"sssll\\\"]\\n # reversedWords: {'dcba': 0, 'abcd': 1, 'sll': 2, 's': 3, 'llsss': 4}\\n # ans : [[0,1],[1,0],[3,2],[2,4]]\\n\\n def isPalindrome(s):\\n start = 0\\n end = len(s) - 1\\n\\n while( start < end ):\\n if( s[ start ] != s[ end ] ):\\n return False\\n start += 1\\n end -= 1\\n return True\\n\\n results = set()\\n reversedWords = { word[::-1]: index for index, word in enumerate(words) }\\n\\n for i, word in enumerate(words):\\n for j in range(0,len(word)+1):\\n prefix = word[:j]\\n pfremain = word[j:]\\n if prefix in reversedWords and isPalindrome(pfremain) and reversedWords[prefix] != i:\\n results.add((i,reversedWords[prefix]))\\n for j in range(len(word), -1, -1):\\n suffix = word[j:]\\n sfremain = word[:j]\\n if suffix in reversedWords and isPalindrome(sfremain) and reversedWords[suffix] != i:\\n results.add((reversedWords[suffix],i))\\n return results\",\n \"runtime\": \"1253\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n backwards = {words[i][::-1]: i for i in range(len(words))}\\n rs = []\\n\\n for i in range(len(words)):\\n word = words[i]\\n\\n if word in backwards:\\n if i != backwards[word]:\\n rs.append([i, backwards[word]])\\n elif word and '' in backwards:\\n rs.append([backwards[''], i])\\n rs.append([i, backwards['']])\\n\\n for sz in range(1, len(word)):\\n prefix, rest = word[:sz], word[sz:]\\n if prefix in backwards and rest == rest[::-1]:\\n rs.append([i, backwards[prefix]])\\n \\n rest, suffix = word[:-sz], word[-sz:]\\n if suffix in backwards and rest == rest[::-1]:\\n rs.append([backwards[suffix], i])\\n\\n\\n return rs\\n\\n \\n \",\n \"runtime\": \"1334\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # Naive solution\\n # Check if each possible combination is a palindrome\\n # O(n^2*K)\\n def isPalindrome(word):\\n return word==word[::-1]\\n backward = {}\\n res = []\\n for i, word in enumerate(words):\\n backward[word[::-1]]=i\\n for i, word in enumerate(words):\\n for j in range(len(word)):\\n if isPalindrome(word[:j]) and word[j:] in backward:\\n if i!=backward[word[j:]]:\\n res.append([backward[word[j:]], i])\\n if word[:j] in backward and isPalindrome(word[j:]):\\n if i!=backward[word[:j]]:\\n res.append([i, backward[word[:j]]])\\n if isPalindrome(word) and \\\"\\\" in backward:\\n if i!=backward[\\\"\\\"]:\\n res.append([backward[\\\"\\\"], i])\\n return res\",\n \"runtime\": \"1334\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n pairs = set()\\n suffix = {w[::-1]:i for i, w in enumerate(words)}\\n for i, w in enumerate(words):\\n for j in range(len(w)+1):\\n if w[:j] in suffix and self.isPalindrome(w[j:]):\\n if i != suffix[w[:j]]:\\n pairs.add((i,suffix[w[:j]]))\\n prefix = {w:i for i, w in enumerate(words)}\\n for i, w in enumerate(words):\\n for j in range(len(w)+1):\\n if w[j:][::-1] in prefix and self.isPalindrome(w[:j]):\\n if prefix[w[j:][::-1]] != i:\\n pairs.add((prefix[w[j:][::-1]],i))\\n \\n return list(pairs)\\n \\n def isPalindrome(self, word):\\n left, right = 0, len(word)-1\\n while left < right:\\n if word[left] != word[right]:\\n return False\\n left += 1\\n right -= 1\\n return True\\n\\n \",\n \"runtime\": \"1415\"\n },\n {\n \"code\": \"class Solution:\\n def isPalindrome(self, word):\\n return word == word[::-1]\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n d_words = dict() # k : v = word : idx\\n out, hasBlank = list(), False\\n for i, w in enumerate(words):\\n if w == \\\"\\\": hasBlank = True\\n d_words[w] = i\\n # print(\\\"d_words=\\\", d_words)\\n for i, word in enumerate(words):\\n # d_words as prefix\\n w = word[::-1] # reverse word first, then take first few chars\\n N = len(w)\\n # print(i, word, w)\\n for j in range(1,N+1):\\n _w = w[:j]\\n # print(\\\"_w=\\\", _w,_w in d_words, _w+word)\\n if _w in d_words and d_words[_w] != i and self.isPalindrome(_w+word):\\n # print(\\\"found prefix=\\\", _w, d_words[_w] )\\n out.append([d_words[_w], i])\\n # d_words as suffix (need only check up to 0: N-1, because 0:N is checked in d_words as prefix\\n w = word\\n for j in range(1, N):\\n _w = w[:j][::-1] # take first few chars, then reverse word first\\n if _w in d_words and d_words[_w] != i and self.isPalindrome(word + _w):\\n # print(\\\"found suffix=\\\", _w, d_words[_w] )\\n out.append([i, d_words[_w]]) \\n if hasBlank:\\n if word != \\\"\\\" and self.isPalindrome(word):\\n out.append([d_words[\\\"\\\"], i])\\n out.append([i, d_words[\\\"\\\"]])\\n return out\",\n \"runtime\": \"1415\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n idx = {}\\n N = len(words)\\n for i in range(N):\\n idx[words[i]] = i\\n\\n def is_palindrome(x):\\n if x:\\n return x[0] == x[-1] and is_palindrome(x[1:-1])\\n return True\\n\\n rs = []\\n\\n # treating each word_j as y+z so part/whole of word_i is x\\n for j in range(N):\\n x = words[j][::-1]\\n for sz in range(1, len(x) + 1):\\n i = idx.get(x[:sz], j)\\n if i != j and is_palindrome(words[j][:-sz]):\\n rs.append([i, j])\\n\\n\\n # treating each word i as (x+y) so part of z will match each word\\n for i in range(N):\\n x = words[i]\\n for sz in range(1, len(x)):\\n j = idx.get(x[:sz][::-1], i)\\n if i != j and is_palindrome(words[i][sz:]):\\n rs.append([i, j])\\n\\n\\n if '' in idx:\\n i = idx.get('')\\n for j in range(N):\\n if i != j and is_palindrome(words[j]):\\n rs.append([i,j])\\n rs.append([j,i])\\n\\n return rs\\n\\n\\n '''\\n # if i, j is answer, words[i] + words[j] is a palindrome\\n # let it be represented by x + y + z\\n # where len(x) == len(z)\\n\\n # if y == '', then x = words[i] and z = words[j]\\n\\n # for rest of 2 cases:\\n # words[i] = x + y and z = words[j]\\n # so we take substrings of x+y[:0], x+y[:1],..x+y[:len(z)]\\n # for a successful result:\\n # x + y[:k] should be in idx and x+y[k:] should be a palindrome\\n # also works for '' string\\n # matches whole string too\\n\\n # words[i] = x and y + z = words[j]\\n # rev = reverse(y+z)\\n # so we take substrings of rev[:0], rev[:1],....rev[:len(x)-1]\\n # to avoid repeat do till [ :len(x)-1]\\n # for a successful result:\\n # rev[:k] should be in idx and y+z[:k] should be a palindrome\\n '''\\n \\n\\n \",\n \"runtime\": \"1496\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n # hash every string\\n # for every suffix in every word\\n # is there a hash that matches my suffix?\\n \\n # to make it faster we should hash the reverse of every string\\n d = {}\\n res = []\\n for i, word in enumerate(words):\\n d[word[::-1]] = i\\n \\n for i, word in enumerate(words):\\n if word in d and d[word] != i:\\n res.append([d[word], i])\\n \\n if word and \\\"\\\" in d and word == word[::-1]:\\n res.append([i, d[\\\"\\\"]])\\n res.append([d[\\\"\\\"], i])\\n\\n for j in range(1,len(word)):\\n # s is in dict\\n # lls is curr\\n # since ll is a palindrome, check if s in dict\\n left, right = word[:j], word[j:]\\n if left == left[::-1] and right in d:\\n res.append([d[right], i])\\n if right == right[::-1] and left in d:\\n res.append([i, d[left]])\\n \\n \\n \\n return res\\n\\n # brute force\\n # res = []\\n # for i in range(len(words)):\\n # for j in range(len(words)):\\n # if i == j:\\n # continue\\n # cand = words[i] + words[j]\\n # if cand == cand[::-1]:\\n # res.append([i, j])\\n # return res\",\n \"runtime\": \"1496\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n #\\n class Prefix:\\n def __init__(self):\\n self.trie = {}\\n\\n def add_word(self, word, k):\\n curr = self.trie\\n for i in range(len(word)):\\n c = word[i]\\n if c not in curr:\\n curr[c] = {}\\n curr = curr[c]\\n curr.setdefault('+', []).append(k)\\n curr['*'] = k\\n if '+' in curr:\\n curr['+'].pop()\\n return\\n\\n def find_prefix(self, suffix, j):\\n curr = self.trie\\n extra_j = []\\n for i in reversed(range(len(suffix))):\\n c = suffix[i]\\n if c not in curr:\\n return [], extra_j\\n curr = curr[c]\\n if curr.get('*', j) != j:\\n extra_j.append(curr['*'])\\n extra_i = curr.get('+', [])\\n return extra_i, extra_j\\n\\n prefix = Prefix()\\n for i in range(len(words)):\\n prefix.add_word(words[i], i)\\n\\n is_palindrome = lambda x: x[0] == x[-1] and is_palindrome(x[1:-1]) if x else True\\n\\n rs = []\\n for j in range(len(words)):\\n if words[j] == '':\\n for i in range(len(words)):\\n if i != j and is_palindrome(words[i]):\\n rs.append([i, j])\\n rs.append([j, i])\\n continue\\n extra_i, extra_j = prefix.find_prefix(words[j], j)\\n # print(extra_i, extra_j)\\n for i in extra_i:\\n if i != j:\\n extra = words[i][len(words[j]):]\\n if is_palindrome(extra):\\n rs.append([i, j])\\n\\n for i in extra_j:\\n if i != j:\\n extra = words[j][: len(words[j])-len(words[i])]\\n if is_palindrome(extra):\\n rs.append([i, j])\\n\\n return rs\\n\\n\\n \",\n \"runtime\": \"1577\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n backwards = {words[i][::-1]: i for i in range(len(words))}\\n \\n rs = []\\n pos = backwards.get('', -1)\\n\\n for j in range(len(words)):\\n k = backwards.get(words[j], -1)\\n if k >= 0 and k != j:\\n rs.append([j, k])\\n if k >= 0 and k == j and pos >= 0 and pos != j:\\n rs.append([j, pos])\\n rs.append([pos, j])\\n\\n # print(backwards)\\n\\n for i in range(len(words)):\\n for sz in range(1, len(words[i])):\\n prefix, rest = words[i][:sz], words[i][sz:]\\n k = backwards.get(prefix, i)\\n if k == i or rest != rest[::-1]:\\n continue\\n rs.append([i, k])\\n \\n for sz in range(1, len(words[i])):\\n rest, suffix = words[i][:-sz], words[i][-sz:]\\n # print(rest, suffix)\\n j = backwards.get(suffix, i)\\n # print(i, j, rest, rest[::-1])\\n if j == i or rest != rest[::-1]:\\n continue\\n rs.append([j, i])\\n\\n return rs\\n\\n \\n \",\n \"runtime\": \"1577\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ans = set()\\n d = {word[::-1]:i for i,word in enumerate(words)}\\n for i,word in enumerate(words):\\n for j in range(len(word)+1):\\n first = word[:j]\\n last = word[j:]\\n if(last==last[::-1] and first in d and d[first]!=i):\\n ans.add((i,d[first]))\\n if(first==first[::-1] and last in d and d[last]!=i):\\n ans.add((d[last],i))\\n return ans\",\n \"runtime\": \"1658\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ind = {}\\n for i,word in enumerate(words):\\n ind[word]=i\\n pairs=[]\\n for i,word in enumerate(words):\\n l=len(word)\\n for j in range(l+1):\\n left = word[:j]\\n right = word[j:]\\n left_reverse = left[::-1]\\n right_reverse = right[::-1]\\n # print(f'{i=},{j=},{left=},{right=}')\\n if j>0 and left == left_reverse and right_reverse in ind and ind[right_reverse]!=i:\\n pairs.append((ind[right_reverse],i))\\n if right == right_reverse and left_reverse in ind and ind[left_reverse]!=i:\\n pairs.append((i,ind[left_reverse]))\\n return pairs\",\n \"runtime\": \"1658\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n d = {word: i for i, word in enumerate(words)}\\n ans = []\\n for i, word in enumerate(words):\\n for idx in range(len(word) + 1):\\n prefix, suffix = word[:idx], word[idx:]\\n r_suffix = suffix[::-1]\\n r_prefix = prefix[::-1]\\n\\n if prefix == r_prefix and r_suffix in d and d[r_suffix] != i:\\n ans.append((d[r_suffix], i))\\n\\n if (\\n idx != len(word)\\n and suffix == r_suffix\\n and r_prefix in d\\n and d[r_prefix] != i\\n ):\\n ans.append((i, d[r_prefix]))\\n return ans\\n\",\n \"runtime\": \"1739\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # brute-force method checks each pair and results in Time O(n*n)\\n # Palindrome properties: A string s is a palindrome if s == s[::-1]\\n # Hashmap method; Time O(n*k*k) k = length of word; Space O(k)\\n # Use a HashMap (word_map) to store the reverse of each word as the key and its index as the value. \\n # This allows for O(1) lookup to check if the reverse of a word exists in the list.\\n # For each word in words, we:\\n # Check if the reverse of the word exists in the word_map and forms a valid palindrome pair.\\n # Check if there are valid palindrome pairs by splitting the word into two parts: left and right. \\n # If the left part is a palindrome, then the reverse of the right part can form a palindrome pair, and vice versa.\\n # Return all valid pairs of indices.\\n def isPalindrome(s):\\n return s == s[::-1]\\n \\n res = []\\n word_map = {}\\n for i, word in enumerate(words):\\n word_map[word[::-1]] = i\\n \\n for i, word in enumerate(words):\\n for j in range(len(word) + 1):\\n left, right = word[:j], word[j:]\\n # Case 1: If the left part is a palindrome, check if reverse of the right exists\\n if isPalindrome(left) and right in word_map and word_map[right] != i:\\n res.append([word_map[right], i])\\n # Case 2: If the right part is a palindrome, check if reverse of the left exists\\n # We skip the case when j == len(word) to avoid duplicates (e.g., the entire word being a palindrome)\\n if isPalindrome(right) and left in word_map and word_map[left] != i and j != len(word):\\n res.append([i, word_map[left]])\\n return res\\n\\n\",\n \"runtime\": \"1739\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def is_palindrome(word):\\n return word == word[::-1]\\n \\n # Map each word to its index and also store the reverse of each word\\n word_map = {word: i for i, word in enumerate(words)}\\n reverse_map = {word[::-1]: i for i, word in enumerate(words)}\\n result = []\\n \\n for i, word in enumerate(words):\\n n = len(word)\\n \\n for j in range(n + 1):\\n prefix, suffix = word[:j], word[j:]\\n \\n # If suffix is a palindrome, look for reverse of the prefix in reverse_map\\n if is_palindrome(suffix) and prefix in reverse_map and reverse_map[prefix] != i:\\n result.append([i, reverse_map[prefix]])\\n \\n # If prefix is a palindrome and j > 0 to avoid full word duplication, look for reverse of the suffix\\n if j > 0 and is_palindrome(prefix) and suffix in reverse_map and reverse_map[suffix] != i:\\n result.append([reverse_map[suffix], i])\\n \\n return result\\n \",\n \"runtime\": \"1820\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def is_palindrome(word):\\n return word == word[::-1]\\n\\n # 2 建立反轉辭典\\n word_map = {word[::-1]: i for i, word in enumerate(words)}\\n print(f'word_map = {word_map}')\\n answer = []\\n\\n for i, word in enumerate(words):\\n for j in range(len(word) + 1):\\n prefix, suffix = word[:j], word[j:]\\n # 前面在辭典 + 後面是回文 + 避免前半自身\\n if is_palindrome(suffix) and prefix in word_map and word_map[prefix] != i:\\n answer.append([i, word_map[prefix]])\\n # 不是空字串 + 前面是回文 + 後面在辭典 + 避免後半自身\\n if j > 0 and is_palindrome(prefix) and suffix in word_map and word_map[suffix] != i:\\n answer.append([word_map[suffix], i])\\n\\n return answer\",\n \"runtime\": \"1820\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n word_dict = { word: index for index, word in enumerate(words) }\\n result = []\\n\\n for index, word in enumerate(words):\\n for j in range(len(word) + 1):\\n left = word[:j]\\n reversed_left = left[::-1]\\n right = word[j:]\\n reversed_right = right[::-1]\\n\\n if reversed_left in word_dict \\\\\\n and word_dict[reversed_left] != index \\\\\\n and right == reversed_right:\\n result.append([index, word_dict[reversed_left]])\\n \\n if j > 0 \\\\\\n and reversed_right in word_dict \\\\\\n and word_dict[reversed_right] != index \\\\\\n and left == reversed_left:\\n result.append([word_dict[reversed_right], index])\\n \\n \\n return result\\n\\n \",\n \"runtime\": \"1901\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words):\\n wordToIndex = {word: index for index, word in enumerate(words)}\\n\\n palindromePairs = []\\n \\n for index, word in enumerate(words):\\n for j in range(len(word)+1):\\n left = word[:j]\\n right = word[j:]\\n\\n rLeft = left[::-1]\\n rRight = right[::-1]\\n\\n if (rLeft in wordToIndex and wordToIndex[rLeft] != index and right == rRight):\\n palindromePairs.append([index, wordToIndex[rLeft]])\\n \\n if (j > 0 and rRight in wordToIndex and wordToIndex[rRight] != index and left == rLeft):\\n palindromePairs.append([wordToIndex[rRight], index])\\n return palindromePairs\\n\",\n \"runtime\": \"1901\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n wordToIndex = {}\\n\\n for i, word in enumerate(words):\\n wordToIndex[word] = i\\n \\n res = set()\\n\\n for i in range(len(words)):\\n for j in range(len(words[i])+1):\\n prefix = words[i][:j]\\n suffix = words[i][j:]\\n\\n if prefix == prefix[::-1] and suffix[::-1] in wordToIndex and wordToIndex[suffix[::-1]]!= i:\\n res.add((wordToIndex[suffix[::-1]], i))\\n if prefix[::-1] in wordToIndex and suffix == suffix[::-1] and i != wordToIndex[prefix[::-1]]:\\n res.add((i, wordToIndex[prefix[::-1]]))\\n \\n res = list([i, j] for i, j in res)\\n return res\",\n \"runtime\": \"1981\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n words_map = {word : i for i, word in enumerate(words)}\\n answers = []\\n for i, word in enumerate(words):\\n for j in range(len(word)+1):\\n prefix, suffix = word[:j], word[j:]\\n \\n # If prefix is palindrome, reverse the suffix and check if that exists\\n if prefix == prefix[::-1]:\\n reversed_suffix = suffix[::-1]\\n if reversed_suffix in words_map and i != words_map[reversed_suffix]:\\n answers.append([words_map[reversed_suffix],i])\\n \\n # To avoid duplicates, make sure j != len(word)\\n if j != len(word) and suffix == suffix[::-1]:\\n reversed_prefix = prefix[::-1]\\n if reversed_prefix in words_map and i != words_map[reversed_prefix]:\\n answers.append([i,words_map[reversed_prefix]])\\n\\n return answers\",\n \"runtime\": \"2062\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n def is_palindrome(s):\\n return s == s[::-1]\\n\\n n = len(words)\\n words_dict = {}\\n result = []\\n\\n for i in range(n):\\n word = words[i]\\n rev_word = word[::-1]\\n words_dict[word] = i\\n \\n print(words_dict)\\n\\n for i, word in enumerate(words):\\n for j in range(len(word)+1):\\n prefix = word[:j]\\n suffix = word[j:]\\n\\n if prefix == prefix[::-1]:\\n reversed_suffix = suffix[::-1]\\n if reversed_suffix in words_dict and i != words_dict[reversed_suffix]:\\n result.append([words_dict[reversed_suffix], i])\\n \\n if j != len(word) and suffix == suffix[::-1]:\\n reversed_prefix = prefix[::-1]\\n if reversed_prefix in words_dict and i != words_dict[reversed_prefix]:\\n result.append([i, words_dict[reversed_prefix]])\\n return result\",\n \"runtime\": \"2062\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def pal(w):\\n return w == w[::-1]\\n \\n \\n lookup = {word:i for i,word in enumerate(words)}\\n res = []\\n\\n for i,word in enumerate(words):\\n n = len(word)\\n for j in range(n+1):\\n prefix,suffix = word[:j],word[j:]\\n if pal(prefix):\\n if suffix[::-1] in lookup and lookup[suffix[::-1]]!=i:\\n\\n res.append([lookup[suffix[::-1]],i])\\n if j<n and pal(suffix):\\n P = prefix[::-1]\\n if P in lookup and lookup[P]!=i:\\n res.append([i,lookup[P]])\\n return res\\n\\n \\n\\n\",\n \"runtime\": \"2143\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n lookup = {}\\n for i in range(len(words)):\\n lookup[words[i]] = i\\n res = []\\n # remember: self does not count, make sure check that i is not the same as looked up idx\\n for i in range(len(words)):\\n word = words[i]\\n\\n\\n # base: just reverse the whole word\\n if word[::-1] in lookup and lookup[word[::-1]] != i:\\n res.append([i, lookup[word[::-1]]])\\n\\n # base: prefix palindrome\\n for begin_idx in range(1, len(word) + 1):\\n prefix = word[:begin_idx]\\n # print(f\\\"prefix: {prefix}\\\")\\n if prefix == prefix[::-1]:\\n valid_suffix = word[begin_idx:][::-1]\\n # print(f\\\"valid_suffix: {valid_suffix}\\\")\\n if valid_suffix in lookup and lookup[valid_suffix] != i:\\n res.append([lookup[valid_suffix], i])\\n begin_idx += 1\\n # base: suffix palindrome\\n for end_idx in range(len(word) - 1, -1, -1):\\n suffix = word[end_idx:]\\n # print(f\\\"suffix: {suffix}\\\")\\n if suffix == suffix[::-1]:\\n valid_prefix = word[:end_idx][::-1]\\n # print(f\\\"valid_prefix: {valid_prefix}\\\")\\n if valid_prefix in lookup and lookup[valid_prefix] != i:\\n res.append([i, lookup[valid_prefix]])\\n end_idx -= 1\\n return res\\n \",\n \"runtime\": \"2143\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words):\\n def is_palindrome(word):\\n return word == word[::-1]\\n \\n word_to_index = {word: i for i, word in enumerate(words)}\\n result = []\\n \\n for i, word in enumerate(words):\\n for j in range(len(word) + 1):\\n prefix, suffix = word[:j], word[j:]\\n \\n # If prefix is a palindrome, check if reverse of suffix exists\\n if is_palindrome(prefix):\\n reversed_suffix = suffix[::-1]\\n if reversed_suffix in word_to_index and word_to_index[reversed_suffix] != i:\\n result.append([word_to_index[reversed_suffix], i])\\n \\n # If suffix is a palindrome, check if reverse of prefix exists\\n # Check j != len(word) to avoid duplicates\\n if j != len(word) and is_palindrome(suffix):\\n reversed_prefix = prefix[::-1]\\n if reversed_prefix in word_to_index and word_to_index[reversed_prefix] != i:\\n result.append([i, word_to_index[reversed_prefix]])\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.palindromePairs([\\\"abcd\\\",\\\"dcba\\\",\\\"lls\\\",\\\"s\\\",\\\"sssll\\\"])) # Output: [[0,1],[1,0],[3,2],[2,4]]\\nprint(solution.palindromePairs([\\\"bat\\\",\\\"tab\\\",\\\"cat\\\"])) # Output: [[0,1],[1,0]]\\nprint(solution.palindromePairs([\\\"a\\\",\\\"\\\"])) # Output: [[0,1],[1,0]]\\n\",\n \"runtime\": \"2224\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def is_palindrome(word):\\n return word == word[::-1]\\n\\n word_dict = {word: i for i, word in enumerate(words)}\\n result = []\\n\\n for i, word in enumerate(words):\\n for j in range(len(word) + 1):\\n prefix = word[:j]\\n suffix = word[j:]\\n\\n if is_palindrome(prefix):\\n reversed_suffix = suffix[::-1]\\n if reversed_suffix in word_dict and word_dict[reversed_suffix] != i:\\n result.append([word_dict[reversed_suffix], i])\\n\\n if j != len(word) and is_palindrome(suffix):\\n reversed_prefix = prefix[::-1]\\n if reversed_prefix in word_dict and word_dict[reversed_prefix] != i:\\n result.append([i, word_dict[reversed_prefix]])\\n\\n return result\",\n \"runtime\": \"2224\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\\"\\\"\\\"\\n :type words: List[str]\\n :rtype: List[List[int]]\\n \\\"\\\"\\\"\\n Map = {} \\n for i, w in enumerate(words):\\n Map[w] = i \\n words = sorted(words,key = lambda i:len(i)) \\n \\n result = []\\n Set = set()\\n for w in words:\\n for L in range(len(w)+1):\\n if (w[0:L]==w[0:L][::-1] and w[L:][::-1] in Set): \\n result.append([Map[w[L:][::-1]],Map[w]])\\n if (w[L:]==w[L:][::-1] and w[0:L][::-1] in Set):\\n result.append([Map[w],Map[w[0:L][::-1]]])\\n Set.add(w)\\n return result \",\n \"runtime\": \"2305\"\n },\n {\n \"code\": \"class Solution:\\n def is_palindrome(self, wrd):\\n return wrd==wrd[::-1]\\n\\n def add_if_valid(self, valid_pals, word_map, ind, pref, back):\\n if pref!=\\\"\\\" and back in word_map and self.is_palindrome(pref):\\n valid_pals.append([word_map[back], ind])\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n word_map = {word: i for i, word in enumerate(words)}\\n valid_pals = []\\n for (word, ind) in word_map.items():\\n for i in range(len(word)+1):\\n pref = word[:i]\\n suff = word[i:]\\n if self.is_palindrome(pref):\\n back = suff[::-1]\\n if back != word and back in word_map:\\n valid_pals.append([word_map[back], ind])\\n if i != len(word) and self.is_palindrome(suff):\\n back = pref[::-1]\\n if back != word and back in word_map:\\n valid_pals.append([ind, word_map[back]]) \\n return valid_pals\\n\",\n \"runtime\": \"2305\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n def prefix(word):\\n result = []\\n for i in range(len(word)):\\n if word[i:] == word[i:][::-1]:\\n result.append(word[:i])\\n return result\\n \\n def suffix(word):\\n result = []\\n for i in range(len(word)):\\n if word[:i+1] == word[:i+1][::-1]:\\n result.append(word[i+1:])\\n return result\\n \\n m = {word: i for i, word in enumerate(words)}\\n s = []\\n\\n for word_index, word in enumerate(words):\\n reversed_word = word[::-1]\\n if reversed_word in m and word_index != m[reversed_word]:\\n s.append([word_index, m[reversed_word]])\\n \\n for suf in suffix(word):\\n rev_suf = suf[::-1]\\n if rev_suf in m:\\n s.append([m[rev_suf], word_index])\\n \\n for pref in prefix(word):\\n rev_pref = pref[::-1]\\n if rev_pref in m:\\n s.append([word_index, m[rev_pref]])\\n \\n return s\",\n \"runtime\": \"2386\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n def all_valid_prefixes(word):\\n valid_prefixes = []\\n for i in range(len(word)):\\n if word[i:] == word[i:][::-1]:\\n valid_prefixes.append(word[:i])\\n return valid_prefixes\\n\\n def all_valid_suffixes(word):\\n valid_suffixes = []\\n for i in range(len(word)):\\n if word[:i+1] == word[:i+1][::-1]:\\n valid_suffixes.append(word[i + 1:])\\n return valid_suffixes\\n\\n word_lookup = {word: i for i, word in enumerate(words)}\\n solutions = []\\n\\n for word_index, word in enumerate(words):\\n reversed_word = word[::-1]\\n\\n # Build solutions of case #1. This word will be word 1.\\n if reversed_word in word_lookup and word_index != word_lookup[reversed_word]:\\n solutions.append([word_index, word_lookup[reversed_word]])\\n\\n # Build solutions of case #2. This word will be word 2.\\n for suffix in all_valid_suffixes(word):\\n reversed_suffix = suffix[::-1]\\n if reversed_suffix in word_lookup:\\n solutions.append([word_lookup[reversed_suffix], word_index])\\n\\n # Build solutions of case #3. This word will be word 1.\\n for prefix in all_valid_prefixes(word):\\n reversed_prefix = prefix[::-1]\\n if reversed_prefix in word_lookup:\\n solutions.append([word_index, word_lookup[reversed_prefix]])\\n\\n return solutions\",\n \"runtime\": \"2386\"\n },\n {\n \"code\": \"class Trie: \\n def __init__(self): \\n self.root = {}\\n \\n def insert(self, word, k): \\n node = self.root \\n for i, c in enumerate(word): \\n if word[i:] == word[i:][::-1]: node.setdefault(\\\"val\\\", []).append(k)\\n node = node.setdefault(c, {})\\n node.setdefault(\\\"val\\\", []).append(k)\\n node.setdefault(\\\"end\\\", []).append(k)\\n \\n def search(self, word): \\n ans = []\\n node = self.root\\n for i, c in enumerate(word): \\n if word[i:] == word[i:][::-1]: ans.extend(node.get(\\\"end\\\", []))\\n if c not in node: break \\n node = node[c]\\n else: ans += node.get(\\\"val\\\", [])\\n return ans \\n \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n for i, word in enumerate(words): \\n trie.insert(word, i)\\n \\n ans = set()\\n for i, word in enumerate(words): \\n val = trie.search(word[::-1])\\n for ii in val: \\n if ii != i: ans.add((ii, i))\\n return ans \",\n \"runtime\": \"2467\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def check_palindrome(word):\\n return word == word[::-1]\\n \\n seen = {val: i for i, val in enumerate(words)}\\n ret = []\\n \\n for i, word in enumerate(words):\\n reversed_word = word[::-1]\\n\\n if reversed_word in seen and i != seen[reversed_word]:\\n ret.append([i, seen[reversed_word]])\\n \\n for j in range(len(word)):\\n prefix, suffix = word[j:], word[:j + 1]\\n check_prefix, check_suffix = word[:j], word[j + 1:]\\n \\n if check_palindrome(prefix): # j > 0 to avoid duplicates\\n reversed_prefix = check_prefix[::-1]\\n if reversed_prefix in seen:\\n ret.append([i, seen[reversed_prefix]])\\n \\n if check_palindrome(suffix):\\n reversed_suffix = check_suffix[::-1]\\n if reversed_suffix in seen:\\n ret.append([seen[reversed_suffix], i])\\n\\n return ret\\n\",\n \"runtime\": \"2467\"\n },\n {\n \"code\": \"import hashlib\\n\\nT = lambda: defaultdict(T)\\n\\ndef printTrie(t, space):\\n print(\\\"\\\\t\\\"*space, \\\"match=\\\", t['match'])\\n for k,v in t.items():\\n if k != 'match':\\n print(\\\" \\\"*4*space, k, \\\"->\\\")\\n printTrie(v, space+1)\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # CAT -> TAC|CAT\\n # CAT -> TAC{palindrom}|CAT\\n # CAT -> CAT|{palindrom}TAC\\n t = T()\\n rt = T()\\n\\n def palindrom(w):\\n return w == w[::-1]\\n\\n def insert(t, word, word_idx, idx):\\n if 'match' not in t:\\n t['match'] = []\\n if idx >= len(word):\\n t['match'].append((word, word_idx))\\n else: \\n insert(t[word[idx]], word, word_idx, idx+1)\\n if palindrom(word[idx:]):\\n t['match'].append((word, word_idx))\\n \\n def search(t, word):\\n if word == \\\"\\\":\\n return [word_idx for word, word_idx in t['match']]\\n elif word[0] in t:\\n return search(t[word[0]], word[1:])\\n else:\\n return []\\n\\n\\n for idx, w in enumerate(words):\\n insert(t, w, idx, 0)\\n insert(rt, w[::-1], idx, 0)\\n\\n\\n \\n #print(t)\\n #printTrie(rt, 0)\\n\\n res = []\\n for idx, w in enumerate(words):\\n res += [(x, idx) for x in search(t, w[::-1]) if x != idx]\\n res += [(idx, x) for x in search(rt, w) if x != idx]\\n return sorted(list(set(res)))\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # {word} --> {subword}{palindrom} | {reverse_subword}| : {palindrom}{subword} = {word}\\n def sub(words):\\n d = defaultdict(list)\\n for i,w in enumerate(words):\\n d[w].append(i)\\n def palindrom(w):\\n return w == w[::-1]\\n \\n res =[]\\n for idx, w in enumerate(words):\\n for i in range(len(w)+1):\\n sub = w[:i]\\n pal = w[i:]\\n if palindrom(pal) and sub[::-1] in d:\\n res += [(idx, x) for x in d[sub[::-1]] if x != idx]\\n return res\\n return list(set(sub(words) + list(map(lambda e:e[::-1], sub([w[::-1] for w in words])))))\\n \\n \\n \\n\\n\\n \\n \\n \\n\\n\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"2548\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\",\n \"runtime\": \"2548\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = []\\n trie = Trie()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n for i, word in enumerate(words):\\n res.extend(trie.search(word, i))\\n return res\\n\\nclass TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1 # Index of the word that ends at this node\\n self.palindrome_suffixes = [] # List of word indices where suffix forms a palindrome\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n # If the remaining part of the word is a palindrome, store the index\\n if is_palindrome(word[:len(word) - i]):\\n node.palindrome_suffixes.append(index)\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.index = index # Mark the end of the word\\n node.palindrome_suffixes.append(index)\\n\\n def search(self, word, index):\\n node = self.root\\n result = []\\n\\n for i, char in enumerate(word):\\n # If this node represents a word and the remaining suffix of the current word is a palindrome\\n if node.index >= 0 and node.index != index and is_palindrome(word[i:]):\\n result.append([index, node.index])\\n if char not in node.children:\\n return result\\n node = node.children[char]\\n\\n # Check for words with palindromic suffixes\\n for j in node.palindrome_suffixes:\\n if index != j:\\n result.append([index, j])\\n \\n return result\\n \\ndef is_palindrome(word):\\n return word == word[::-1]\",\n \"runtime\": \"2629\"\n },\n {\n \"code\": \"class TrieNode():\\n def __init__(self):\\n self.children=dict()\\n self.idx = -1\\n self.palindromeIdxs = list()\\n self.end = False\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n def _ispalin(self, word):\\n return word == word[::-1]\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res=list()\\n \\n for i in range(len(words)):\\n curr = self.root\\n rWord = words[i][::-1]\\n for j in range(len(rWord)):\\n if self._ispalin(rWord[j:]):\\n curr.palindromeIdxs.append(i)\\n\\n if rWord[j] not in curr.children:\\n curr.children[rWord[j]] = TrieNode()\\n curr = curr.children[rWord[j]]\\n curr.end = True\\n curr.idx = i\\n for i in range(len(words)):\\n self.search(words[i], i, res) \\n return res\\n def search(self, word, idx, res):\\n curr = self.root\\n for i in range(len(word)):\\n if curr.end and self._ispalin(word[i:]):\\n res.append([idx,curr.idx])\\n if word[i] not in curr.children:\\n return\\n curr = curr.children[word[i]]\\n if curr.end and curr.idx != idx:\\n res.append([curr.idx, idx])\\n for pIdx in curr.palindromeIdxs:\\n res.append([idx, pIdx])\\n return\",\n \"runtime\": \"2629\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.word_index = -1 # will store index of word ending at this node\\n self.palindrome_suffixes = [] # will store indexes of words that are palindromes after this node\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # trie solution\\n trie = TrieNode()\\n # insert words into trie in reverse\\n for windex, word in enumerate(words):\\n word = word[::-1]\\n current = trie\\n for lindex, letter in enumerate(word):\\n if letter not in current.children:\\n current.children[letter] = TrieNode()\\n \\n if word[lindex:] == word[lindex:][::-1]: # if the remainder of the reversed word is a palindrome\\n current.palindrome_suffixes.append(windex) # append the index of the word\\n current = current.children[letter]\\n # this line was the problem\\n # update the palindrome suffixes before moving nodes\\n current.word_index = windex\\n # that should be our trie\\n result = []\\n for windex, word in enumerate(words):\\n current = trie\\n for lindex, letter in enumerate(word):\\n # 3 cases\\n if current.word_index != -1 and word[lindex:] == word[lindex:][::-1] \\\\\\n and windex != current.word_index:\\n result.append([windex, current.word_index])\\n # if we have reached a word end node and our remaining string is a palindrome\\n # why do we check that case before moving?\\n if letter not in current.children:\\n break\\n current = current.children[letter]\\n # other 2 cases\\n # is the node we're on a reverse of our string?\\n else:\\n if current.word_index != -1 and current.word_index != windex:\\n result.append([windex, current.word_index])\\n # are there any words with palindromes between our string and its reversed prefix\\n # iterate them\\n for suffix in current.palindrome_suffixes:\\n if suffix != windex:\\n result.append([windex, suffix])\\n return result\",\n \"runtime\": \"2710\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n self.palindrome_suffix_indices = []\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def add_word(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n if self.is_palindrome(word[0:len(word)-i]):\\n node.palindrome_suffix_indices.append(index)\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.index = index\\n node.palindrome_suffix_indices.append(index)\\n \\n def search(self, word, index):\\n result = []\\n node = self.root\\n while word:\\n if node.index >= 0 and node.index != index and self.is_palindrome(word):\\n result.append([index, node.index])\\n if word[0] not in node.children:\\n return result\\n node = node.children[word[0]]\\n word = word[1:]\\n for pal_index in node.palindrome_suffix_indices:\\n if index != pal_index:\\n result.append([index, pal_index])\\n return result\\n \\n def is_palindrome(self, word):\\n return word == word[::-1]\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n trie = Trie()\\n for i, word in enumerate(words):\\n trie.add_word(word, i)\\n \\n results = []\\n for i, word in enumerate(words):\\n results.extend(trie.search(word, i))\\n return results\",\n \"runtime\": \"2710\"\n },\n {\n \"code\": \"from typing import List, Tuple\\n\\ndef is_palindrome(s: str) -> bool:\\n return s == s[::-1]\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n word_map = {word: i for i, word in enumerate(words)}\\n result = []\\n \\n for i, word in enumerate(words):\\n word_len = len(word)\\n \\n # Case 1: Check if there's a reversed word in the map\\n for j in range(word_len + 1):\\n # Split the word into two parts\\n left, right = word[:j], word[j:]\\n \\n # Check if right part is a palindrome and left part reversed is in map\\n if is_palindrome(left):\\n reversed_right = right[::-1]\\n if reversed_right in word_map and word_map[reversed_right] != i:\\n result.append([word_map[reversed_right], i])\\n \\n # Check if left part is a palindrome and right part reversed is in map\\n if j != word_len and is_palindrome(right): # Avoid duplication\\n reversed_left = left[::-1]\\n if reversed_left in word_map and word_map[reversed_left] != i:\\n result.append([i, word_map[reversed_left]])\\n \\n return result\",\n \"runtime\": \"2791\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n self.palindrome_suffix_indices = []\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def add_word(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n if self.is_palindrome(word[0:len(word)-i]):\\n node.palindrome_suffix_indices.append(index)\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.index = index\\n node.palindrome_suffix_indices.append(index)\\n \\n def search(self, word, index):\\n result = []\\n node = self.root\\n while word:\\n if node.index >= 0 and node.index != index and self.is_palindrome(word):\\n result.append([index, node.index])\\n if word[0] not in node.children:\\n return result\\n node = node.children[word[0]]\\n word = word[1:]\\n for pal_index in node.palindrome_suffix_indices:\\n if index != pal_index:\\n result.append([index, pal_index])\\n return result\\n \\n def is_palindrome(self, word):\\n return word == word[::-1]\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n trie = Trie()\\n for i, word in enumerate(words):\\n trie.add_word(word, i)\\n \\n results = []\\n for i, word in enumerate(words):\\n results.extend(trie.search(word, i))\\n return results\",\n \"runtime\": \"2791\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n def is_palindrome(s):\\n if not s:\\n return True\\n return s == s[::-1]\\n\\n suffice_check = defaultdict(list)\\n for idx, word in enumerate(words):\\n for i in range(len(word)+1):\\n if is_palindrome(word[i:]):\\n suffice_check[word[:i]].append(idx)\\n \\n prefix_check = defaultdict(list)\\n for idx, word in enumerate(words):\\n for i in range(len(word)+1):\\n if is_palindrome(word[:i]):\\n prefix_check[word[i:]].append(idx)\\n\\n # print(suffice_check)\\n # print(prefix_check)\\n\\n out = []\\n for idx, word in enumerate(words):\\n if word[::-1] in suffice_check:\\n for i in suffice_check[word[::-1]]:\\n if i != idx:\\n out.append((i,idx))\\n if word[::-1] in prefix_check:\\n for i in prefix_check[word[::-1]]:\\n if i != idx:\\n out.append((idx,i)) \\n\\n out = set(out)\\n out = [[i,j] for (i,j) in out]\\n\\n return out\\n\",\n \"runtime\": \"2872\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self, char):\\n self.char = char\\n self.children = {}\\n self.index = None\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode(None)\\n\\n def insert(self, s, val):\\n if s == \\\"\\\":\\n self.root.index = val\\n curr = self.root\\n for char in s:\\n if char not in curr.children:\\n next_node = TrieNode(char)\\n curr.children[char] = next_node\\n curr = curr.children[char]\\n curr.index = val\\n return\\n\\n\\nclass Solution:\\n @staticmethod\\n def is_palindrome(s):\\n if s == \\\"\\\":\\n return True\\n return s == s[::-1]\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n n = len(words)\\n\\n # construct Trie for regular words and Trie for reverse words\\n regular_trie, reversed_trie = Trie(), Trie()\\n for i in range(n):\\n word = words[i]\\n regular_trie.insert(word, i)\\n reversed_trie.insert(word[::-1], i)\\n\\n # iterate through all words, find whether i's prefix j is in reversed_trie, if so, and i's remaining substring is palindrome, words[i] + words[j] is palindrome\\n # find whether the prefix of reversed i is in regular_trie, if so (get j), and i's remaining substring is palindrome, words[j] + words[i] is palindrome\\n res = set()\\n for i in range(n):\\n word = words[i]\\n if word == \\\"\\\":\\n continue\\n\\n curr = reversed_trie.root\\n for j in range(len(word)):\\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\\n res.add((i, curr.index))\\n char = word[j]\\n if char in curr.children:\\n curr = curr.children[char]\\n else:\\n break\\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\\n res.add((i, curr.index))\\n\\n for i in range(n):\\n word = words[i][::-1]\\n if word == \\\"\\\":\\n continue\\n \\n curr = regular_trie.root\\n for j in range(len(word) + 1):\\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\\n res.add((curr.index, i))\\n if j == len(word):\\n break\\n char = word[j]\\n if char in curr.children:\\n curr = curr.children[char]\\n else:\\n break\\n if curr.index is not None and Solution.is_palindrome(word[j:]) and curr.index != i:\\n res.add((curr.index, i))\\n\\n return [[i, j] for i, j in list(res)]\",\n \"runtime\": \"2872\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.id = None\\n self.words_ids = []\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n for index in range(len(words)):\\n word = words[index][::-1]\\n curr = self.root\\n for j, w in enumerate(word):\\n if not w in curr.children.keys():\\n curr.children[w] = TrieNode()\\n # [Jerry note]add idx to the current Trie Node then move to children.\\n if word[j:] == word[j:][::-1]:\\n curr.words_ids.append(index)\\n curr = curr.children[w]\\n curr.id = index\\n # [Jerry note]words_ids should add current index as well since word int current node with suffix is empty now, it must be palindrome\\n curr.words_ids.append(index)\\n \\n #--------------------------------------\\n ans = []\\n\\n for i, word in enumerate(words): # case1 (word1 is word2_reverse's prefix), len(word1)<len(word2)\\n curr = self.root\\n isWholeWord = True\\n for w in word:\\n if w in curr.children.keys():\\n curr = curr.children[w]\\n else:\\n isWholeWord = False\\n break\\n\\n if isWholeWord:\\n for id in curr.words_ids:\\n if id != i:\\n ans.append( [i, id])\\n \\n for i, word in enumerate(words): # case2 (word2 is word1 sulfix), len(word1)>len(word2)\\n curr = self.root\\n for c, w in enumerate(word):\\n #word2R = word[:c] # exist in Trie as a full word or not\\n isPalindromWord1Left = word[c:] # Is palindrom or not\\n # [Jerry note] Not sure why, but we have to uset the flag curr.id != None instead curr.id. I also move curr.id != i before the palindrome check since it can save some time.\\n if curr.id != None and curr.id != i and isPalindromWord1Left == isPalindromWord1Left[::-1]:\\n ans.append([i, curr.id])\\n if w in curr.children.keys():\\n curr = curr.children[w]\\n else:\\n break\\n return ans\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"2953\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.id = None\\n self.words_ids = []\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n for index in range(len(words)):\\n word = words[index][::-1]\\n curr = self.root\\n for j, w in enumerate(word):\\n if not w in curr.children.keys():\\n curr.children[w] = TrieNode()\\n # [Jerry note]add idx to the current Trie Node then move to children.\\n if word[j:] == word[j:][::-1]:\\n curr.words_ids.append(index)\\n curr = curr.children[w]\\n curr.id = index\\n # [Jerry note]words_ids should add current index as well since word int current node with suffix is empty now, it must be palindrome\\n curr.words_ids.append(index)\\n \\n #--------------------------------------\\n ans = []\\n\\n for i, word in enumerate(words): # case1 (word1 is word2_reverse's prefix), len(word1)<len(word2)\\n curr = self.root\\n isWholeWord = True\\n for w in word:\\n if w in curr.children.keys():\\n curr = curr.children[w]\\n else:\\n isWholeWord = False\\n break\\n\\n if isWholeWord:\\n for id in curr.words_ids:\\n if id != i:\\n ans.append( [i, id])\\n \\n for i, word in enumerate(words): # case2 (word2 is word1 sulfix), len(word1)>len(word2)\\n curr = self.root\\n for c, w in enumerate(word):\\n #word2R = word[:c] # exist in Trie as a full word or not\\n isPalindromWord1Left = word[c:] # Is palindrom or not\\n # [Jerry note] Not sure why, but we have to uset the flag curr.id != None instead curr.id. I also move curr.id != i before the palindrome check since it can save some time.\\n if curr.id != None and curr.id != i and isPalindromWord1Left == isPalindromWord1Left[::-1]:\\n ans.append([i, curr.id])\\n if w in curr.children.keys():\\n curr = curr.children[w]\\n else:\\n break\\n return ans\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"2953\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n @cache\\n def is_palindrome(w):\\n return w == w[::-1]\\n \\n words = { w:i for i, w in enumerate(words) }\\n res = []\\n\\n for w, i in words.items():\\n n = len(w)\\n\\n for j in range(n + 1):\\n pref = w[:j]\\n suff = w[j:]\\n\\n if is_palindrome(pref):\\n back = suff[::-1]\\n if back != w and back in words:\\n res.append((words[back], i))\\n \\n if j != n and is_palindrome(suff):\\n back = pref[::-1]\\n if back != w and back in words:\\n res.append((i, words[back]))\\n \\n return res\\n\\n\",\n \"runtime\": \"3033\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n\\n # go through words, store them in dict\\n \\n # go through words again\\n # 1. if word is palin andreverse in dict add pair\\n # 2. if reverse of prefix in dict, and postfix is palin add pair\\n # 3. if reverse of postfix in dict, and prefix is palin add pair\\n word_dict = {}\\n result = set()\\n\\n for i, word in enumerate(words):\\n word_dict[word] = i\\n\\n\\n for i, word in enumerate(words):\\n # 1.\\n reversed_word = word[::-1]\\n if reversed_word in word_dict and i != word_dict[reversed_word]:\\n result.add((i, word_dict[reversed_word]))\\n\\n if \\\"\\\" in word_dict and word_dict[\\\"\\\"] != i and word == reversed_word:\\n result.add((i, word_dict[\\\"\\\"]))\\n result.add((word_dict[\\\"\\\"], i))\\n\\n # 2. \\n for j in range(len(word)):\\n prefix = word[:j]\\n r_prefix = prefix[::-1]\\n postfix = word[j:]\\n r_postfix = postfix[::-1]\\n\\n if r_prefix in word_dict and postfix == r_postfix and i != word_dict[r_prefix]:\\n result.add((i, word_dict[r_prefix]))\\n\\n # 3.\\n for j in range(len(word)):\\n prefix = word[:j]\\n r_prefix = prefix[::-1]\\n postfix = word[j:]\\n r_postfix = postfix[::-1]\\n\\n if r_postfix in word_dict and prefix == r_prefix and i != word_dict[r_postfix]:\\n result.add((word_dict[r_postfix], i))\\n\\n return result\",\n \"runtime\": \"3033\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = [{}, [], -1]\\n for i, w in enumerate(words):\\n w = w[::-1]\\n node = root\\n for j, c in enumerate(w):\\n if w[j:] == w[j:][::-1]:\\n node[1].append(i)\\n if c not in node[0]:\\n node[0][c] = [{}, [], -1]\\n node = node[0][c]\\n node[2] = i\\n l = []\\n for i, w in enumerate(words):\\n node = root\\n for j, c in enumerate(w):\\n if w[j:] == w[j:][::-1] and node[2] != -1:\\n l.append([i, node[2]])\\n if c not in node[0]:\\n break\\n node = node[0][c]\\n else:\\n if node[2] != -1 and node[2] != i:\\n l.append([i, node[2]])\\n for j in node[1]:\\n l.append([i, j])\\n return l\\n\\n # l = []\\n # m = {w[::-1]: i for i, w in enumerate(words)}\\n # for i, w in enumerate(words):\\n # if w in m and i != m[w]:\\n # l.append([i, m[w]])\\n # for j in range(len(w)):\\n # s = w[j:]\\n # rs = w[:j]\\n # if s == s[::-1] and rs in m and i != m[rs]:\\n # l.append([i, m[rs]])\\n # p = w[:j + 1]\\n # rp = w[j + 1:]\\n # if p == p[::-1] and rp in m and i != m[rp]:\\n # l.append([m[rp], i])\\n # return l\\n \",\n \"runtime\": \"3114\"\n },\n {\n \"code\": \"'''\\na + b != b + a\\n\\nBrute Force - O(n^2 * k) -> Try all pairs and check if it's a palindrome\\n\\nabaca\\n - if the prefix is a palindrome, take the suffix and and reverse it and see if it exists in words\\nacabaca\\n\\nPseudocode\\n- Make a set out of words\\n- For each word in words\\n - go through each prefix\\n - check if the prefix is a palindrome (including the empty string which means you're looking for the reverse of the whole word)\\n - check if the reverse of the suffix exists (which can be an empty string, which you're checking if the word itself is a palindrome)\\n \\n- aba case...\\n\\nHandling duplicates, for suffix don't compare for j != len(word) because of abcd and dcba case\\n\\nIf j == len(word) then prefix == abcd and suffix == \\\"\\\", you already have dcba + abcd from when j == 0 and you will have abcd + dcba from j == 0 from the dcba case, so you don't need to do the suffix handling again where you do abcd + dcba at abcd\\n\\nBut you need the suffix handling because you have \\\"a\\\" and \\\"ab\\\" and you want aba, what can you attach after and what can you attach before...\\n\\nTime Complexity: O(n * w^2) where n = len(words), w being length of words[i]\\n\\ns abas\\n\\nThis idea of palindrome matching where if the middle is a palindrome, then you just need to match the outer backwards...\\n\\nUnderstanding why duplicates are handled as palindromes\\n - You have to go through the whole word1...the idea is actually fairly simple, if you append word1 and word2, you would check by having i j pointers at opposite ends and continuing on\\n - The thing about a palindrome is that as you strip off the end characters, it's still a palindrome\\n - I think this is the key point...you have to go through the whole of word1 and as you go, you're both increasing i which is through word1 and decreasing j, which is by traversing the trie, but the key point here is that you're doing it one by one so that means the moment you end, anything that is of suffix which is a palindrome will work because that's the thing in the middle -> visualize this\\n lls sssll -> i is the lls, j is the sssll and then it becomes (i)ss(j) which is a palindrome\\nWhy with Trie you don't need to look at both prefix and suffix\\n - Because you just care about the ones where you append to the current word here, the other solution explored all substrings you can say\\n\\nPseudocode\\n\\nThere's a few ways to do it, if you build the Trie with the words in reverse, you don't need a index for each trie node for isWord...because you will iterate the main loop with the word in normal order and you know when it will finish\\n\\nBut if you want to build the Trie in normal order, then you have to iterate the words in reverse...this seems conceptually harder to grasp\\n\\nEdge Cases\\n- If word1 is bigger, you will reach the end, but essentially you want to compare at every node that is isWord == True and then compare what you have traversed / left\\n- If word1 is smaller, isWord == False, you want to use the palindrome lists in each node -> only once you reached the end of your word otherwise it doesn't make sense because you still have some letters in your word1 that may not be a palindrome with what is in the lists, so this is if the word that you have is smaller...\\n- Empty string case - Trie's have a dummy node, that should be True - this should work with \\\"a\\\" and \\\"\\\" because you will start at the dummy node and the dummy node will have isWord == True, for \\\"\\\" and \\\"a\\\", again that is you will get that at \\\"\\\", the list should have \\\"a\\\" as part of its list\\n- No duplicates because isWord is at the bottom of the tree, and so when you're at a shorter word and you stop in the middle and add to res from the lists, you are adding all indices that are BELOW that which you have no explored since isWord will be false for them at the top/middle \\n\\n'''\\nclass TrieNode:\\n def __init__(self):\\n self.isWord = -1\\n self.palindromes = []\\n self.children = [None] * 26\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def addWord(self, word, j):\\n '''\\n As you go down, check if the suffix is a palindrome, and if so add\\n '''\\n temp = self.root\\n for i in range(len(word) - 1, -1, -1):\\n cur_char = word[i]\\n\\n if self.check_palindrome(word[:i + 1]):\\n temp.palindromes.append(j)\\n\\n idx = ord(cur_char) - ord('a')\\n if temp.children[idx] is None:\\n temp.children[idx] = TrieNode()\\n\\n temp = temp.children[idx]\\n\\n temp.isWord = j\\n temp.palindromes.append(j)\\n\\n def search(self, word, j, res):\\n temp = self.root\\n for i in range(len(word)):\\n # This might be the key here...\\n if temp.isWord >= 0 and temp.isWord != j and self.check_palindrome(word[i:]):\\n res.append([j, temp.isWord])\\n temp = temp.children[ord(word[i]) - ord('a')]\\n \\n if temp is None:\\n return\\n \\n for idx in temp.palindromes:\\n if idx != j:\\n res.append([j, idx])\\n\\n def check_palindrome(self, word):\\n return word == word[::-1]\\n \\n \\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n res = []\\n for j, word in enumerate(words):\\n trie.addWord(word, j)\\n \\n for j, word in enumerate(words):\\n temp = []\\n trie.search(word, j, temp)\\n res.extend(temp.copy())\\n return res\\n \\n def palindromePairs2(self, words: List[str]) -> List[List[int]]:\\n word_map = {}\\n for i, word in enumerate(words):\\n word_map[word] = i\\n\\n res = []\\n for i, word in enumerate(words):\\n for j in range(len(word) + 1):\\n prefix = word[:j]\\n suffix = word[j:]\\n \\n if self.check_palindrome(prefix):\\n suffix_reversed = suffix[::-1]\\n if suffix_reversed in word_map and word_map[suffix_reversed] != i:\\n res.append([word_map[suffix_reversed], i])\\n \\n # Handling duplicates\\n if j != len(word) and self.check_palindrome(suffix):\\n prefix_reversed = prefix[::-1]\\n if prefix_reversed in word_map and word_map[prefix_reversed] != i:\\n res.append([i, word_map[prefix_reversed]])\\n \\n return res\\n \\n def check_palindrome(self, word):\\n return word == word[::-1]\\n \\n \",\n \"runtime\": \"3114\"\n },\n {\n \"code\": \"from functools import cache\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # @cache\\n # def isPal(i, j, idx):\\n # if i>=j:\\n # return True\\n # return isPal(i+1, j-1, idx) and words[idx][i] == words[idx][j]\\n\\n wordsDict = dict()\\n for i in range(len(words)):\\n wordsDict[words[i]] = i\\n\\n pairs = list()\\n for idx in range(len(words)):\\n for i in range(len(words[idx])):\\n prefix = words[idx][:i][::-1]\\n palin = words[idx][i:] == words[idx][i:][::-1]\\n if palin and prefix in wordsDict:\\n if idx != wordsDict[prefix]:\\n pairs.append((idx, wordsDict[prefix]))\\n\\n for j in range(len(words[idx]), -1, -1):\\n suffix = words[idx][j:][::-1]\\n palin = words[idx][0:j] == words[idx][0:j][::-1]\\n if palin and suffix in wordsDict:\\n if idx != wordsDict[suffix]:\\n pairs.append((wordsDict[suffix], idx))\\n return pairs\\n\\n \\n\\n \",\n \"runtime\": \"3195\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n W_d, ans = defaultdict(list), []\\n\\n for idx, word in enumerate(words):\\n W_d[word].append([0, idx])\\n for i in range(1, len(word) + 1):\\n suff, pref = word[:i], word[i:]\\n if suff == suff[::-1]:\\n W_d[pref].append([- (pref != \\\"\\\"),idx])\\n if pref == pref[::-1]:\\n W_d[suff].append([+ (suff != \\\"\\\"),idx])\\n \\n for idx, word in enumerate(words):\\n for one, two in W_d[word[::-1]]:\\n if idx != two and one <= 0: \\n ans.append((idx, two))\\n if idx != two and one >= 0: \\n ans.append((two, idx))\\n \\n return set(ans)\",\n \"runtime\": \"3195\"\n },\n {\n \"code\": \"from typing import List, DefaultDict\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next: DefaultDict[str, TrieNode] = DefaultDict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n \\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\",\n \"runtime\": \"3276\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self, val=\\\"\\\") -> None:\\n self.val = val\\n self.children: List[Optional[TrieNode]] = [None] * 26\\n self.palindromeIdxs = []\\n self.isEndIdxs = []\\n\\nclass Solution:\\n def isPalindrome(self, s):\\n return s == s[::-1]\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # first build a trie from the reverse\\n tmain = TrieNode()\\n for widx, word in enumerate(words):\\n t = tmain\\n revWord = word[::-1]\\n for chidx, ch in enumerate(revWord):\\n chpos = ord(ch) - ord('a')\\n if self.isPalindrome(revWord[chidx:]):\\n t.palindromeIdxs.append(widx)\\n if t.children[chpos] == None:\\n t.children[chpos] = TrieNode(ch)\\n t = t.children[chpos]\\n t.isEndIdxs.append(widx)\\n\\n self.res = []\\n\\n for i, word in enumerate(words):\\n self.search(word, i, tmain)\\n return self.res\\n \\n\\n def search(self, word: str, idx, t: TrieNode):\\n for i, ch in enumerate(word):\\n chpos = ord(ch) - ord('a')\\n # case 2: long word short trie word: abcdaa trie: bcda (abcd)\\n if t.isEndIdxs and self.isPalindrome(word[i:]):\\n for trieidx in t.isEndIdxs:\\n self.res.append([idx, trieidx])\\n t = t.children[chpos]\\n if t == None:\\n return\\n \\n # case 1: exact match. word: abcd, trie: dcba (abcd)\\n for triendidx in t.isEndIdxs:\\n if triendidx == idx:\\n continue\\n self.res.append([triendidx, idx]) # the other way will be form in another word\\n\\n # case 3: short word long trie, w: lls trie: sssll (llsss)\\n for pidx in t.palindromeIdxs:\\n self.res.append([idx, pidx])\\n \",\n \"runtime\": \"3276\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n lookup = {w:idx for idx, w in enumerate(words)}\\n result = []\\n for idx, w in enumerate(words):\\n pairs = process(w, idx, lookup) \\n result.extend(pairs)\\n\\n return result\\n\\ndef process(word, idx, lookup):\\n result = []\\n #prefixes\\n end = len(word) - 1\\n for i in range(end+1):\\n if is_palindrom(word, i, end):\\n prefix = word[0:i]\\n if (x:=lookup.get(prefix[::-1])) is not None:\\n result.append([idx, x]) \\n\\n #sufixes\\n acc = [\\\"\\\"]\\n for i in range(end, -1, -1):\\n if is_palindrom(word, 0, i):\\n suffix = \\\"\\\".join(acc)\\n if (x:= lookup.get(suffix)) is not None:\\n result.append([x, idx])\\n acc.append(word[i])\\n \\n # regular case\\n if (x:=lookup.get(word[::-1])) is not None and x!=idx:\\n result.append([idx,x])\\n \\n\\n return result\\n\\ndef is_palindrom(word, left, right): # return a valid prefix\\n w = word[left:right+1] \\n r = w[::-1]\\n return w == r\\n\",\n \"runtime\": \"3357\"\n },\n {\n \"code\": \"import queue\\n\\ndef is_pair(w1, w2):\\n concat = w1 + w2\\n return concat == concat[::-1]\\n\\nclass TrieNode:\\n def __init__(self, key=None, val=None):\\n self.key = key\\n self.val = val\\n self.children = {}\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode(\\\"\\\", None)\\n \\n def insert(self, key, word):\\n curr = self.root\\n if word == \\\"\\\":\\n curr.children[\\\"\\\"] = TrieNode(key=key, val=\\\"\\\")\\n for i in range(len(word)-1, -1, -1):\\n if word[i] not in curr.children:\\n curr.children[word[i]] = TrieNode(key=None, val=None)\\n if i == 0:\\n curr.children[word[i]].key = key\\n curr.children[word[i]].val = word\\n curr = curr.children[word[i]]\\n \\n def search_right(self, key, word):\\n prefixes = []\\n i, curr = 0, self.root\\n if \\\"\\\" in curr.children:\\n prefixes.append(curr.children[\\\"\\\"])\\n while i < len(word):\\n if word[i] not in curr.children:\\n break\\n if curr.children[word[i]].val is not None:\\n prefixes.append(curr.children[word[i]])\\n curr = curr.children[word[i]]\\n i += 1\\n \\n if i == len(word):\\n prefixes.extend(self.words(curr))\\n\\n pairs = set()\\n for prefix in prefixes:\\n if is_pair(word, prefix.val) and key != prefix.key:\\n pairs.add((key, prefix.key))\\n \\n return pairs\\n\\n def words(self, root):\\n if not root:\\n return []\\n\\n result = []\\n q = queue.Queue()\\n q.put(root)\\n while not q.empty():\\n curr = q.get()\\n if len(curr.children) == 0:\\n continue\\n for k, v in curr.children.items():\\n if v is not None and v.val is not None:\\n result.append(v)\\n q.put(curr.children[k])\\n \\n return result\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n if len(words) == 0:\\n return []\\n\\n trie = Trie()\\n for i, word in enumerate(words):\\n trie.insert(i, word)\\n\\n pairs = set()\\n for i, word in enumerate(words):\\n for pair in trie.search_right(i, word):\\n pairs.add(pair)\\n \\n return list(map(list, pairs))\\n \",\n \"runtime\": \"3357\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # keep a map of word:index\\n # for each words[i], assume it is the bigger pair\\n # then find the smallest string that needs to be added to it to make it a palindrome\\n # use rolling hashes approach\\n # if such a string is found in our map, add the pair to ans\\n\\n\\n base = 31\\n mod = 10 ** 13 + 7\\n mx_length = 301 # 1 extra for buffer when \\\"left\\\",\\\"right\\\" strings are being built after the 300th char\\n\\n power = [1]\\n for i in range(1, mx_length):\\n power.append((power[-1] * base) % mod)\\n\\n # build prefix array to find hash(reversed_w[i:j + 1]) in O(1) average\\n def build_prefix_hash(w):\\n prefix = [0]\\n for i in range(len(w)):\\n c = ord(w[i]) - ord('a') + 1\\n # need new c at most significant digit for prefix sum array to work\\n prefix.append((c * power[i] + prefix[-1]) % mod)\\n return prefix\\n\\n # returns all hashes of strings that can be added to w to make the concatenation a palindrome\\n def need_string(w):\\n hash1 = 0 # new chr in smallest position\\n hash2 = 0 # new chr in largest position\\n reversed_w = w[::-1]\\n prefix = build_prefix_hash(reversed_w)\\n\\n left = [(prefix[-1] * power[-1]) % mod]\\n for i in range(len(w)):\\n c = ord(w[i]) - ord('a') + 1\\n hash1 = (hash1 * base + c) % mod\\n hash2 = (c * power[i] + hash2) % mod\\n if hash1 == hash2:\\n # want reversed_w[0:len(w) -1 -i -1] inclusive\\n # multiply prefix hash with some power so that comparisons\\n # can be done using the same digit places\\n rhash = (prefix[len(w) -1 -i] * power[-1]) % mod\\n left.append(rhash)\\n \\n right = [(prefix[-1] * power[-1]) % mod]\\n hash1 = 0\\n hash2 = 0\\n for i in range(len(w) - 1, -1, -1):\\n c = ord(w[i]) - ord('a') + 1\\n hash1 = (hash1 * base + c) % mod\\n hash2 = (c * power[len(w) -1 -i] + hash2) % mod\\n if hash1 == hash2:\\n # want reversed_w[len(w) -1 -i +1:]\\n start = len(w) -1 -i +1\\n rhash = ((prefix[-1] - prefix[start]) * power[-1 -start]) % mod\\n right.append(rhash)\\n \\n return left, right\\n\\n\\n ans = set()\\n w_whash = {}\\n whash_i = {}\\n for i,w in enumerate(words):\\n prefix = build_prefix_hash(w)\\n whash = (prefix[-1] * power[-1]) % mod\\n w_whash[w] = whash\\n whash_i[whash] = i\\n\\n for i, w in enumerate(words):\\n # if only considering left side, need_string can't generate\\n # baca for w := b\\n # need to consider both sides of acab:\\n # acab --> add left [b, bac, baca]\\n # acab --> add right [b, baca]\\n\\n # however, when strings are of equal length\\n # w1 := abc, w2 := cba\\n # results in duplicate production of abc + cba\\n # so use set for ans\\n left, right = need_string(w)\\n whash = w_whash[w]\\n # print(w, whash)\\n # print(left)\\n # print(right)\\n \\n for s in left:\\n if s != whash and s in whash_i:\\n ans.add((whash_i[s], i))\\n \\n for s in right:\\n if s != whash and s in whash_i:\\n ans.add((i, whash_i[s]))\\n \\n return ans\\n\\n \\n\\n\\n\\n\",\n \"runtime\": \"3438\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # keep a map of word:index\\n # for each words[i], assume it is the bigger pair\\n # then find the smallest string that needs to be added to it to make it a palindrome\\n # use rolling hashes approach\\n # if such a string is found in our map, add the pair to ans\\n\\n\\n base = 37\\n mod = 10 ** 13 + 7\\n mx_length = 301 # 1 extra for buffer when \\\"left\\\",\\\"right\\\" strings are being built after the 300th char\\n\\n power = [1]\\n for i in range(1, mx_length):\\n power.append((power[-1] * base) % mod)\\n\\n # build prefix array to find hash(reversed_w[i:j + 1]) in O(1) average\\n def build_prefix_hash(w):\\n prefix = [0]\\n for i in range(len(w)):\\n c = ord(w[i]) - ord('a') + 1\\n # need new c at most significant digit for prefix sum array to work\\n prefix.append((c * power[i] + prefix[-1]) % mod)\\n return prefix\\n\\n # returns all hashes of strings that can be added to w to make the concatenation a palindrome\\n def need_string(w):\\n hash1 = 0 # new chr in smallest position\\n hash2 = 0 # new chr in largest position\\n reversed_w = w[::-1]\\n prefix = build_prefix_hash(reversed_w)\\n\\n left = [(prefix[-1] * power[-1]) % mod]\\n for i in range(len(w)):\\n c = ord(w[i]) - ord('a') + 1\\n hash1 = (hash1 * base + c) % mod\\n hash2 = (c * power[i] + hash2) % mod\\n if hash1 == hash2:\\n # want reversed_w[0:len(w) -1 -i -1] inclusive\\n # multiply prefix hash with some power so that comparisons\\n # can be done using the same digit places\\n rhash = (prefix[len(w) -1 -i] * power[-1]) % mod\\n left.append(rhash)\\n \\n right = [(prefix[-1] * power[-1]) % mod]\\n hash1 = 0\\n hash2 = 0\\n for i in range(len(w) - 1, -1, -1):\\n c = ord(w[i]) - ord('a') + 1\\n hash1 = (hash1 * base + c) % mod\\n hash2 = (c * power[len(w) -1 -i] + hash2) % mod\\n if hash1 == hash2:\\n # want reversed_w[len(w) -1 -i +1:]\\n start = len(w) -1 -i +1\\n rhash = ((prefix[-1] - prefix[start]) * power[-1 -start]) % mod\\n right.append(rhash)\\n \\n return left, right\\n\\n\\n ans = set()\\n w_whash = {}\\n whash_i = {}\\n for i,w in enumerate(words):\\n prefix = build_prefix_hash(w)\\n whash = (prefix[-1] * power[-1]) % mod\\n w_whash[w] = whash\\n whash_i[whash] = i\\n\\n for i, w in enumerate(words):\\n # if only considering left side, need_string can't generate\\n # baca for w := b\\n # need to consider both sides of acab:\\n # acab --> add left [b, bac, baca]\\n # acab --> add right [b, baca]\\n\\n # however, when strings are of equal length\\n # w1 := abc, w2 := cba\\n # results in duplicate production of abc + cba\\n # so use set for ans\\n left, right = need_string(w)\\n whash = w_whash[w]\\n # print(w, whash)\\n # print(left)\\n # print(right)\\n \\n for s in left:\\n if s != whash and s in whash_i:\\n ans.add((whash_i[s], i))\\n \\n for s in right:\\n if s != whash and s in whash_i:\\n ans.add((i, whash_i[s]))\\n \\n return ans\\n\\n \\n\\n\\n\\n\",\n \"runtime\": \"3438\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # abc, dcba --- >\\n\\n reversedWordIdx = {}\\n\\n for idx in range(len(words)):\\n word = words[idx]\\n # reversedWord = \\\"\\\".join(reversed(list(word)))\\n reversedWord = word[::-1]\\n reversedWordIdx[reversedWord] = idx\\n \\n print(\\\"reversedWordIdx\\\", reversedWordIdx)\\n results = []\\n for idx in range(len(words)):\\n word = words[idx]\\n\\n for wordIdx in range(len(word)):\\n left = word[:wordIdx]\\n right = word[wordIdx:]\\n # print(\\\"left\\\", left)\\n # print(\\\"right\\\", right)\\n # abcdc, ba --- >\\n comboWord = word + left[::-1]\\n # print(\\\"comboWord 1 \\\", comboWord)\\n if comboWord == comboWord[::-1] and left in reversedWordIdx.keys():\\n # print(\\\"found combo 1\\\")\\n # print(\\\"found combo 1 left\\\", left)\\n leftIdx = reversedWordIdx[ left ]\\n if leftIdx != idx:\\n results.append([idx, leftIdx])\\n\\n # ab, cdcba --- >\\n comboWord = right[::-1] + word \\n # print(\\\"comboWord 2 \\\", comboWord)\\n if comboWord == comboWord[::-1] and right in reversedWordIdx.keys():\\n # print(\\\"found combo 2\\\")\\n # print(\\\"found combo 2 right\\\", right)\\n rightIdx = reversedWordIdx[ right ]\\n if rightIdx != idx:\\n results.append([rightIdx, idx])\\n \\n if word == word[::-1] and \\\"\\\" in reversedWordIdx.keys():\\n emptyIdx = reversedWordIdx[ \\\"\\\" ]\\n if emptyIdx != idx:\\n results.append([emptyIdx, idx])\\n \\n # print(\\\"results \\\", results)\\n\\n\\n\\n return results\",\n \"runtime\": \"3519\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # abc, dcba --- >\\n\\n wordIdxDict = {}\\n\\n for idx in range(len(words)):\\n word = words[idx]\\n # reversedWord = \\\"\\\".join(reversed(list(word)))\\n # reversedWord = word[::-1]\\n wordIdxDict[word] = idx\\n \\n print(\\\"wordIdxDict\\\", wordIdxDict)\\n results = []\\n for idx in range(len(words)):\\n word = words[idx]\\n\\n for wordIdx in range(len(word)):\\n left = word[:wordIdx]\\n right = word[wordIdx:]\\n # print(\\\"left\\\", left)\\n # print(\\\"right\\\", right)\\n # abcdc, ba --- >\\n reversedLeft = left[::-1]\\n comboWord = word + reversedLeft\\n # print(\\\"comboWord 1 \\\", comboWord)\\n if comboWord == comboWord[::-1] and reversedLeft in wordIdxDict.keys():\\n # print(\\\"found combo 1\\\")\\n # print(\\\"found combo 1 left\\\", left)\\n leftIdx = wordIdxDict[ reversedLeft ]\\n if leftIdx != idx:\\n results.append([idx, leftIdx])\\n\\n # ab, cdcba --- >\\n reversedRight = right[::-1]\\n comboWord = reversedRight + word \\n # print(\\\"comboWord 2 \\\", comboWord)\\n if comboWord == comboWord[::-1] and reversedRight in wordIdxDict.keys():\\n # print(\\\"found combo 2\\\")\\n # print(\\\"found combo 2 right\\\", right)\\n rightIdx = wordIdxDict[ reversedRight ]\\n if rightIdx != idx:\\n results.append([rightIdx, idx])\\n \\n if word == word[::-1] and \\\"\\\" in wordIdxDict.keys():\\n emptyIdx = wordIdxDict[ \\\"\\\" ]\\n if emptyIdx != idx:\\n results.append([emptyIdx, idx])\\n \\n # print(\\\"results \\\", results)\\n\\n\\n\\n return results\",\n \"runtime\": \"3600\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n\\n #O(N)\\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n # words = sorted(words, key = lambda x: len(x), reverse=True)\\n # print(words)\\n \\n #O(1)\\n def search_palindromes(j, pp, reverse):\\n nonlocal pairs\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n \\n pairs = []\\n possible_palindromes = defaultdict(set)\\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n for j in range(len(word)-1, -1, -1):\\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n ext = word[:j+1][::-1]\\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\\n \\n possible_palindromes[ext].add((i,False))\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n ext = word[j:][::-1]\\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\\n # print(word, ext)\\n possible_palindromes[ext].add((i,True))\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n \\n # print(word_bank)\\n # print(possible_palindromes)\\n for ext in possible_palindromes:\\n # print(ext,possible_palindromes[ext])\\n for i, reverse in possible_palindromes[ext]:\\n \\n search_palindromes(i, ext, reverse)\\n \\n return list(set(pairs))\",\n \"runtime\": \"3681\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n \\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n def search_palindromes(j, pp, reverse):\\n nonlocal pairs\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n \\n pairs = []\\n possible_palindromes = defaultdict(list)\\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n for j in range(len(word)-1, -1, -1):\\n \\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n ext = word[:j+1][::-1]\\n if is_palindrome(word + ext) and ext in word_bank:\\n \\n possible_palindromes[ext].append((i,False))\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n ext = word[j:][::-1]\\n if is_palindrome(ext + word) and ext in word_bank:\\n possible_palindromes[ext].append((i,True))\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n # print(word_bank)\\n \\n for ext in possible_palindromes:\\n # print(ext,possible_palindromes[ext])\\n for i, reverse in possible_palindromes[ext]:\\n \\n search_palindromes(i, ext, reverse)\\n \\n return list(set(pairs))\",\n \"runtime\": \"3762\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n \\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n def search_palindromes(j, pp, reverse):\\n nonlocal pairs\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n \\n pairs = []\\n possible_palindromes = defaultdict(list)\\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n for j in range(len(word)-1, -1, -1):\\n \\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n ext = word[:j+1][::-1]\\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\\n \\n possible_palindromes[ext].append((i,False))\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n ext = word[j:][::-1]\\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\\n possible_palindromes[ext].append((i,True))\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n # print(word_bank)\\n \\n for ext in possible_palindromes:\\n # print(ext,possible_palindromes[ext])\\n for i, reverse in possible_palindromes[ext]:\\n \\n search_palindromes(i, ext, reverse)\\n \\n return list(set(pairs))\",\n \"runtime\": \"3762\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n \\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n def search_palindromes(j, pp, reverse):\\n nonlocal pairs\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n \\n pairs = []\\n possible_palindromes = defaultdict(list)\\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n for j in range(len(word)-1, -1, -1):\\n \\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n ext = word[:j+1][::-1]\\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\\n \\n possible_palindromes[ext].append((i,False))\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n ext = word[j:][::-1]\\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\\n possible_palindromes[ext].append((i,True))\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n # print(word_bank)\\n \\n for ext in possible_palindromes:\\n # print(ext,possible_palindromes[ext])\\n for i, reverse in possible_palindromes[ext]:\\n \\n search_palindromes(i, ext, reverse)\\n \\n return list(set(pairs))\",\n \"runtime\": \"3843\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n \\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n def search_palindromes(j, pp, reverse):\\n nonlocal pairs\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n \\n pairs = []\\n \\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n possible_palindromes = []\\n for j in range(len(word)-1, -1, -1):\\n \\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n ext = word[:j+1][::-1]\\n if is_palindrome(word + ext) and ext in word_bank:\\n \\n search_palindromes(i,ext,False)\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n ext = word[j:][::-1]\\n if is_palindrome(ext + word) and ext in word_bank:\\n search_palindromes(i,ext,True)\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n # print(word_bank)\\n \\n \\n \\n return list(set(pairs))\",\n \"runtime\": \"3843\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # abc, dcba --- >\\n\\n wordIdxDict = {}\\n\\n for idx in range(len(words)):\\n word = words[idx]\\n # reversedWord = \\\"\\\".join(reversed(list(word)))\\n # reversedWord = word[::-1]\\n wordIdxDict[word] = idx\\n \\n print(\\\"wordIdxDict\\\", wordIdxDict)\\n results = []\\n for idx in range(len(words)):\\n word = words[idx]\\n\\n for wordIdx in range(len(word)):\\n left = word[:wordIdx]\\n right = word[wordIdx:]\\n # print(\\\"left\\\", left)\\n # print(\\\"right\\\", right)\\n # abcdc, ba --- >\\n comboWord = word + left[::-1]\\n # print(\\\"comboWord 1 \\\", comboWord)\\n if comboWord == comboWord[::-1] and left[::-1] in wordIdxDict.keys():\\n # print(\\\"found combo 1\\\")\\n # print(\\\"found combo 1 left\\\", left)\\n leftIdx = wordIdxDict[ left[::-1] ]\\n if leftIdx != idx:\\n results.append([idx, leftIdx])\\n\\n # ab, cdcba --- >\\n comboWord = right[::-1] + word \\n # print(\\\"comboWord 2 \\\", comboWord)\\n if comboWord == comboWord[::-1] and right[::-1] in wordIdxDict.keys():\\n # print(\\\"found combo 2\\\")\\n # print(\\\"found combo 2 right\\\", right)\\n rightIdx = wordIdxDict[ right[::-1] ]\\n if rightIdx != idx:\\n results.append([rightIdx, idx])\\n \\n if word == word[::-1] and \\\"\\\" in wordIdxDict.keys():\\n emptyIdx = wordIdxDict[ \\\"\\\" ]\\n if emptyIdx != idx:\\n results.append([emptyIdx, idx])\\n \\n # print(\\\"results \\\", results)\\n\\n\\n\\n return results\",\n \"runtime\": \"3924\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n \\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n pairs = []\\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n possible_palindromes = []\\n for j in range(len(word)-1, -1, -1):\\n \\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n if is_palindrome(word + word[:j+1][::-1]):\\n possible_palindromes.append((i,(word[:j+1])[::-1],False))\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n if is_palindrome(word[j:][::-1] + word):\\n possible_palindromes.append((i,(word[j:])[::-1],True))\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n # print(word_bank)\\n \\n for j,pp,reverse in possible_palindromes:\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n return list(set(pairs))\",\n \"runtime\": \"4005\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n lookup = {w:idx for idx, w in enumerate(words)}\\n result = []\\n for idx, w in enumerate(words):\\n pairs = process(w, idx, lookup) \\n result.extend(pairs)\\n\\n return result\\n\\ndef process(word, idx, lookup):\\n result = []\\n #prefixes\\n acc = [\\\"\\\"]\\n end = len(word) - 1\\n for i in range(end+1):\\n if is_palindrom(word, i, end):\\n prefix = \\\"\\\".join(acc)\\n if (x:=lookup.get(prefix[::-1])) is not None:\\n result.append([idx, x]) \\n acc.append(word[i])\\n\\n #sufixes\\n acc = [\\\"\\\"]\\n for i in range(end, -1, -1):\\n if is_palindrom(word, 0, i):\\n suffix = \\\"\\\".join(acc)\\n if (x:= lookup.get(suffix)) is not None:\\n result.append([x, idx])\\n acc.append(word[i])\\n \\n # regular case\\n if (x:=lookup.get(word[::-1])) is not None and x!=idx:\\n result.append([idx,x])\\n \\n\\n return result\\n\\ndef is_palindrom(word, left, right):\\n w = word[left:right+1] \\n r = w[::-1]\\n return w == r\\n # while left < right:\\n # if word[left] != word[right]:\\n # return False\\n # left += 1\\n # right -= 1\\n # return True\",\n \"runtime\": \"4086\"\n },\n {\n \"code\": \"def prefix_array(word):\\n pref_array = [0, ]\\n k = 0\\n i = 1\\n n = len(word)\\n while i < n:\\n if word[i] == word[k]:\\n k += 1\\n pref_array.append(k)\\n i += 1\\n else:\\n if not k:\\n pref_array.append(k)\\n i += 1\\n k = pref_array[k-1]\\n\\n \\n return pref_array\\n\\n\\ndef find_lpoly(word):\\n n = len(word)\\n \\n lpoly_ = prefix_array(word + word[::-1])\\n lpoly, k = list(), lpoly_[-1]\\n while k: \\n if k <= n: lpoly.append(k)\\n k = lpoly_[k-1]\\n\\n return lpoly \\n \\ndef find_rpoly(word):\\n n = len(word)\\n \\n rpoly_ = prefix_array(word[::-1] + word)\\n rpoly, k = list(), rpoly_[-1]\\n while k: \\n if k <= n: rpoly.append(k)\\n k = rpoly_[k-1]\\n \\n return rpoly\\n\\n\\nclass TreeNode:\\n # __slots__ = 'poly_here', 'end_here', 'next'\\n\\n def __init__(self):\\n self.poly_here = list()\\n self.end_here = list()\\n\\n self.next = [None for i in range(27)] #{chr(c): None for c in range(97, 123)}\\n\\n def __repr__(self):\\n return 'Node tree with branchs: ' + ', '.join(c for c in self.next if self.next[c] is not None) +\\\\\\n f'| ends: {self.end_here} | polyes: {self.poly_here}'\\n\\n\\n def add_to_tree(self, w, wi):\\n w_lpoly = find_lpoly(w)\\n \\n n = len(w)\\n rw = w[::-1]\\n t = self\\n for ci, c in enumerate(rw):\\n c = ord(c) - 97\\n\\n if t.next[c] is None:\\n t.next[c] = TreeNode()\\n \\n if ci == n - w_lpoly[0]: \\n t.poly_here.append(wi)\\n w_lpoly.pop(0)\\n t = t.next[c]\\n t.end_here.append(wi)\\n\\n\\n def get_pairs(self, w, wi):\\n # print(w)\\n n = len(w)\\n pairs = list()\\n w_rpoly = find_rpoly(w)\\n \\n t = self\\n for ci, c in enumerate(w):\\n c = ord(c) - 97\\n\\n if t is None: break\\n # print(ci, c, w_rpoly, t, )\\n \\n if w_rpoly and ci == n - w_rpoly[0]:\\n # print(t.end_here)\\n for right_word in t.end_here:\\n # print(right_word, wi, right_word != wi)\\n if right_word != wi:\\n pairs.append((wi, right_word))\\n \\n w_rpoly.pop(0)\\n t = t.next[c]\\n \\n if t is not None:\\n # print('poly!', t)\\n for right_word in t.poly_here + t.end_here:\\n # print(right_word, wi, right_word != wi)\\n if right_word != wi:\\n pairs.append((wi, right_word))\\n \\n \\n return pairs \\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = TreeNode()\\n for wi, w in enumerate(words):\\n root.add_to_tree(w, wi)\\n\\n pairs = list()\\n for wi, w in enumerate(words):\\n pairs += root.get_pairs(w, wi)\\n\\n \\n return pairs\",\n \"runtime\": \"4166\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n self.end = None\\n # self.palindromeSuffix = set()\\n self.children = defaultdict(Trie)\\n\\n def push(self, word, wordIdx, i=0):\\n if i == len(word):\\n self.end = wordIdx\\n return\\n self.children[word[i]].push(word, wordIdx, i+1)\\n # if i + 1 < len(word):\\n # if isPalindrome(word, i + 1):\\n # self.palindromeSuffix.add(wordIdx)\\n\\n\\ndef isPalindrome(word, left, right=None):\\n if left >= len(word):\\n return True\\n if right is None:\\n right = len(word) - 1\\n\\n if left == right:\\n return True\\n elif left + 1 == right:\\n return word[left] == word[right]\\n else:\\n return word[left] == word[right] and isPalindrome(word, left + 1, right - 1)\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n answers = set()\\n\\n def doPalindromePairs(words, reversed):\\n trie = Trie()\\n answers = set()\\n\\n for i, word in enumerate(words):\\n trie.push(word[::-1], i)\\n\\n for i, word in enumerate(words):\\n cur = trie\\n if cur.end is not None and isPalindrome(word, 0):\\n # print(word, i, cur.end)\\n if reversed:\\n answers.add((cur.end, i ))\\n else:\\n answers.add((i, cur.end))\\n for j, c in enumerate(word):\\n cur = cur.children[c]\\n if cur.end is not None and isPalindrome(word, j+1):\\n if reversed:\\n answers.add((cur.end, i ))\\n else:\\n answers.add((i, cur.end))\\n\\n # for longerSuffix in cur.palindromeSuffix:\\n # answers.add((i, longerSuffix))\\n\\n return answers\\n\\n reversedWords = []\\n for word in words:\\n reversedWords.append(word[::-1])\\n\\n answers = doPalindromePairs(words, False).union(doPalindromePairs(reversedWords, True))\\n\\n ret = []\\n for x, y in answers:\\n if x != y:\\n ret.append([x, y])\\n return ret\\n \\n\\n \\n\\n \\n \",\n \"runtime\": \"4247\"\n },\n {\n \"code\": \"def prefix_array(word):\\n pref_array = [0, ]\\n k = 0\\n i = 1\\n n = len(word)\\n while i < n:\\n if word[i] == word[k]:\\n k += 1\\n pref_array.append(k)\\n i += 1\\n else:\\n if not k:\\n pref_array.append(k)\\n i += 1\\n k = pref_array[k-1]\\n\\n \\n return pref_array\\n\\n\\ndef find_lpoly(word):\\n n = len(word)\\n \\n lpoly_ = prefix_array(word + word[::-1])\\n lpoly, k = list(), lpoly_[-1]\\n while k: \\n if k <= n: lpoly.append(k)\\n k = lpoly_[k-1]\\n\\n return lpoly \\n \\ndef find_rpoly(word):\\n n = len(word)\\n \\n rpoly_ = prefix_array(word[::-1] + word)\\n rpoly, k = list(), rpoly_[-1]\\n while k: \\n if k <= n: rpoly.append(k)\\n k = rpoly_[k-1]\\n \\n return rpoly\\n\\n\\nclass TreeNode:\\n def __init__(self):\\n self.poly_here = list()\\n self.end_here = list()\\n\\n self.next = [None for i in range(27)]\\n\\n def add_to_tree(self, w, wi):\\n w_lpoly = find_lpoly(w)\\n \\n n = len(w)\\n rw = w[::-1]\\n t = self\\n for ci, c in enumerate(rw):\\n c = ord(c) - 97\\n\\n if t.next[c] is None:\\n t.next[c] = TreeNode()\\n \\n if ci == n - w_lpoly[0]: \\n t.poly_here.append(wi)\\n w_lpoly.pop(0)\\n t = t.next[c]\\n t.end_here.append(wi)\\n\\n\\n def get_pairs(self, w, wi):\\n n = len(w)\\n pairs = list()\\n w_rpoly = find_rpoly(w)\\n \\n t = self\\n for ci, c in enumerate(w):\\n c = ord(c) - 97\\n\\n if t is None: return pairs\\n\\n if w_rpoly and ci == n - w_rpoly[0]:\\n pairs += [(wi, rw) for rw in t.end_here if rw != wi]\\n # for right_word in t.end_here:\\n # if right_word != wi:\\n # pairs.append((wi, right_word))\\n \\n w_rpoly.pop(0)\\n t = t.next[c]\\n \\n if t is not None:\\n pairs += [(wi, rw) for rw in (t.poly_here + t.end_here) if rw != wi]\\n # for right_word in t.poly_here + t.end_here:\\n # if right_word != wi:\\n # pairs.append((wi, right_word))\\n \\n \\n return pairs \\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = TreeNode()\\n for wi, w in enumerate(words):\\n root.add_to_tree(w, wi)\\n\\n pairs = list()\\n for wi, w in enumerate(words):\\n pairs += root.get_pairs(w, wi)\\n\\n \\n return pairs\",\n \"runtime\": \"4328\"\n },\n {\n \"code\": \"def prefix_array(word):\\n pref_array = [0, ]\\n k = 0\\n i = 1\\n n = len(word)\\n while i < n:\\n if word[i] == word[k]:\\n k += 1\\n pref_array.append(k)\\n i += 1\\n else:\\n if not k:\\n pref_array.append(k)\\n i += 1\\n k = pref_array[k-1]\\n\\n \\n return pref_array\\n\\n\\ndef find_lpoly(word):\\n n = len(word)\\n \\n lpoly_ = prefix_array(word + word[::-1])\\n lpoly, k = list(), lpoly_[-1]\\n while k: \\n if k <= n: lpoly.append(k)\\n k = lpoly_[k-1]\\n\\n return lpoly \\n \\ndef find_rpoly(word):\\n n = len(word)\\n \\n rpoly_ = prefix_array(word[::-1] + word)\\n rpoly, k = list(), rpoly_[-1]\\n while k: \\n if k <= n: rpoly.append(k)\\n k = rpoly_[k-1]\\n \\n return rpoly\\n\\n\\nclass TreeNode:\\n def __init__(self):\\n self.poly_here = list()\\n self.end_here = list()\\n\\n self.next = [None for i in range(27)]\\n\\n def add_to_tree(self, w, wi):\\n w_lpoly = find_lpoly(w)\\n \\n n = len(w)\\n rw = w[::-1]\\n t = self\\n for ci, c in enumerate(rw):\\n c = ord(c) - 97\\n\\n if t.next[c] is None:\\n t.next[c] = TreeNode()\\n \\n if ci == n - w_lpoly[0]: \\n t.poly_here.append(wi)\\n w_lpoly.pop(0)\\n t = t.next[c]\\n t.end_here.append(wi)\\n\\n\\n def get_pairs(self, w, wi):\\n n = len(w)\\n pairs = list()\\n w_rpoly = find_rpoly(w)\\n \\n t = self\\n for ci, c in enumerate(w):\\n c = ord(c) - 97\\n\\n if t is None: return pairs\\n\\n if w_rpoly and ci == n - w_rpoly[0]:\\n for right_word in t.end_here:\\n if right_word != wi:\\n pairs.append((wi, right_word))\\n \\n w_rpoly.pop(0)\\n t = t.next[c]\\n \\n if t is not None:\\n \\n for right_word in t.poly_here + t.end_here:\\n if right_word != wi:\\n pairs.append((wi, right_word))\\n \\n \\n return pairs \\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = TreeNode()\\n for wi, w in enumerate(words):\\n root.add_to_tree(w, wi)\\n\\n pairs = list()\\n for wi, w in enumerate(words):\\n pairs += root.get_pairs(w, wi)\\n\\n \\n return pairs\",\n \"runtime\": \"4409\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n idx = {words[i]: i for i in range(len(words))}\\n taken = set()\\n \\n result = []\\n for word in words:\\n for i in range(0, len(word)+1):\\n cent = (len(word) + i) // 2\\n if i==0:\\n opp = \\\"\\\"\\n else:\\n opp = word[:cent+1] if len(word)+i % 2 == 0 else word[:cent]\\n opp = opp[::-1][-i:]\\n poss = word + opp\\n\\n if poss == poss[::-1]:\\n if opp in idx:\\n idxa = idx[word]\\n idxb = idx[opp]\\n if idxa != idxb and (idxa, idxb) not in taken:\\n result.append([idxa, idxb])\\n taken.add((idxa, idxb))\\n \\n cent -= i\\n opp = opp[cent+1:] if len(word)+i % 2 == 0 else word[cent:]\\n opp = opp[::-1][:i]\\n poss = opp + word\\n\\n if poss == poss[::-1]:\\n if opp in idx:\\n idxa = idx[opp]\\n idxb = idx[word]\\n if idxa != idxb and (idxa, idxb) not in taken:\\n result.append([idxa, idxb])\\n taken.add((idxa, idxb))\\n \\n return result\\n \",\n \"runtime\": \"4490\"\n },\n {\n \"code\": \"from typing import *\\nimport math\\nimport inspect\\nimport random\\nfrom collections import *\\nimport copy\\nfrom functools import cmp_to_key\\n\\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\\n if isinstance(begin, int) and isinstance(end, int):\\n return random.randint(begin, end) # Inclusive range for integers\\n elif isinstance(begin, float) or isinstance(end, float):\\n return random.uniform(begin, end) # Inclusive range for floats\\n\\n raise ValueError(\\\"Both arguments must be either int or float.\\\")\\n\\nclass pair:\\n def __init__(self, _first : Any, _second : Any) -> None:\\n self.first = _first\\n self.second = _second\\n\\n def copy(self) -> 'pair' :\\n return pair(self.first, self.second)\\n\\n def __repr__(self) -> str :\\n return f\\\"({self.first}, {self.second})\\\"\\n\\n def __lt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) < (other.first, other.second)\\n\\n def __gt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) > (other.first, other.second)\\n\\n def __eq__(self, other: 'pair') -> bool:\\n return (self.first, self.second) == (other.first, other.second)\\n\\n def __ne__(self, other: 'pair') -> bool:\\n return (self.first, self.second) != (other.first, other.second)\\n\\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\\n if compare == None:\\n compare = lambda a, b : -1 if a < b else 1\\n arr.sort(key=cmp_to_key(compare))\\n new_size = 0\\n for i in range(len(arr)):\\n if i == 0 or arr[i] != arr[i - 1]:\\n arr[new_size] = arr[i]\\n new_size += 1\\n arr[:] = arr[:new_size]\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n MOD = 10 ** 12 + 39 #1e12+39\\n PRIME = 31\\n nax = 300\\n\\n def make_id(ch) -> int:\\n return ord(ch) - ord('a') + 1\\n\\n def inv_mod(val) -> int:\\n expo = MOD - 2\\n ans = 1\\n while expo > 0:\\n if expo & 1 != 0:\\n ans = (ans * val) % MOD\\n val = (val * val) % MOD\\n expo //= 2\\n\\n return ans\\n \\n power = [0] * nax\\n ipower = [0] * nax\\n power[0] = 1\\n ipower[0] = 1\\n for i in range(1, nax):\\n power[i] = (power[i - 1] * PRIME) % MOD\\n ipower[i] = inv_mod(power[i])\\n\\n code_pos = defaultdict(int)\\n for i in range(len(words)):\\n s = words[i]\\n N = len(s)\\n code = make_id(s[0]) if N > 0 else 0\\n for j in range(1, N):\\n code += power[j] * make_id(s[j])\\n code %= MOD\\n code_pos[code] = i\\n\\n ans = []\\n # auxi = []\\n def calc(s, i) -> None:\\n N = len(s)\\n if N == 0:\\n return\\n\\n #for each suffix, we need to know if its palindrome or not\\n pref_for = [0] * N\\n pref_rev = [0] * N\\n\\n def is_pali(begin, end, is_rev) -> bool:\\n if begin > end:\\n return True\\n\\n gap = end - begin + 1\\n if gap == 1:\\n return True\\n mid = (end + begin) // 2\\n L1, R1 = begin, mid\\n L2, R2 = mid + 1, end\\n if gap % 2 == 1:\\n R1 -= 1\\n\\n if not is_rev:\\n left_code = pref_for[R1]\\n if L1 > 0:\\n left_code = (left_code - pref_for[L1 - 1]) % MOD\\n if left_code < 0:\\n left_code += MOD\\n left_code = (left_code * ipower[L1]) % MOD\\n\\n return left_code == pref_rev[L2]\\n\\n right_code = pref_rev[L2]\\n if R2 != N - 1:\\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\\n if right_code < 0:\\n right_code += MOD\\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\\n\\n return right_code == pref_for[R1]\\n\\n pref_for[0] = make_id(s[0])\\n for j in range(1, N):\\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\\n\\n pref_rev[-1] = make_id(s[-1])\\n for j in range(N - 2, - 1, -1):\\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\\n\\n for whr in range(N):\\n if not is_pali(whr + 1, N - 1, False):\\n continue\\n #we want the reverse hash of this\\n code = pref_rev[0]\\n if whr != N - 1:\\n code = (code - pref_rev[whr + 1]) % MOD\\n if code < 0:\\n code += MOD\\n code = (code * ipower[N - whr - 1]) % MOD\\n\\n if code in code_pos and code_pos[code] != i:\\n ans.append([i, code_pos[code]])\\n # auxi.append(code_pos[code])\\n\\n for whr in range(N - 1, -1, -1):\\n if not is_pali(0, whr - 1, True):\\n continue\\n code = pref_rev[whr]\\n if code in code_pos and code_pos[code] != i:\\n ans.append([code_pos[code], i])\\n # auxi.append(code_pos[code])\\n # print()\\n\\n for i in range(len(words)):\\n # auxi.clear()\\n calc(words[i], i)\\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\\n ans.append([i, code_pos[0]])\\n ans.append([code_pos[0], i])\\n # auxi.append(code_pos[0])\\n\\n # print(f\\\"me -> {i} : {words[i]}\\\")\\n # for who in auxi:\\n # print(f\\\"other ->{who} : {words[who]}\\\")\\n # print(\\\"--------------------------------------\\\")\\n\\n get_unique(ans)\\n return ans\\n\",\n \"runtime\": \"4571\"\n },\n {\n \"code\": \"import hashlib\\n\\nT = lambda: defaultdict(T)\\n\\ndef printTrie(t, space):\\n print(\\\"\\\\t\\\"*space, \\\"match=\\\", t['match'])\\n for k,v in t.items():\\n if k != 'match':\\n print(\\\" \\\"*4*space, k, \\\"->\\\")\\n printTrie(v, space+1)\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # CAT -> TAC|CAT\\n # CAT -> TAC{palindrom}|CAT\\n # CAT -> CAT|{palindrom}TAC\\n t = T()\\n rt = T()\\n\\n def palindrom(w):\\n return w == w[::-1]\\n\\n def insert(t, word, word_idx, idx):\\n if 'match' not in t:\\n t['match'] = []\\n if idx >= len(word):\\n t['match'].append((word, word_idx))\\n else: \\n insert(t[word[idx]], word, word_idx, idx+1)\\n if palindrom(word[idx:]):\\n t['match'].append((word, word_idx))\\n \\n def search(t, word):\\n if word == \\\"\\\":\\n return [word_idx for word, word_idx in t['match']]\\n elif word[0] in t:\\n return search(t[word[0]], word[1:])\\n else:\\n return []\\n\\n\\n for idx, w in enumerate(words):\\n insert(t, w, idx, 0)\\n insert(rt, w[::-1], idx, 0)\\n\\n\\n \\n #print(t)\\n #printTrie(rt, 0)\\n\\n res = []\\n for idx, w in enumerate(words):\\n res += [(x, idx) for x in search(t, w[::-1]) if x != idx]\\n res += [(idx, x) for x in search(rt, w) if x != idx]\\n return sorted(list(set(res)))\\n\\n\\n \\n \\n \\n\\n\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"4652\"\n },\n {\n \"code\": \"def prefix_array(word):\\n pref_array = [0, ]\\n k = 0\\n i = 1\\n n = len(word)\\n while i < n:\\n if word[i] == word[k]:\\n k += 1\\n pref_array.append(k)\\n i += 1\\n else:\\n if not k:\\n pref_array.append(k)\\n i += 1\\n k = pref_array[k-1]\\n\\n \\n return pref_array\\n\\n\\ndef find_lpoly(word):\\n n = len(word)\\n \\n lpoly_ = prefix_array(word + word[::-1])\\n lpoly, k = list(), lpoly_[-1]\\n while k: \\n if k <= n: lpoly.append(k)\\n k = lpoly_[k-1]\\n\\n return lpoly \\n \\ndef find_rpoly(word):\\n n = len(word)\\n \\n rpoly_ = prefix_array(word[::-1] + word)\\n rpoly, k = list(), rpoly_[-1]\\n while k: \\n if k <= n: rpoly.append(k)\\n k = rpoly_[k-1]\\n \\n return rpoly\\n\\n\\nclass TreeNode:\\n __slots__ = 'poly_here', 'end_here', 'next'\\n\\n def __init__(self):\\n self.poly_here = list()\\n self.end_here = list()\\n\\n self.next = [None for i in range(27)] #{chr(c): None for c in range(97, 123)}\\n\\n def __repr__(self):\\n return 'Node tree with branchs: ' + ', '.join(c for c in self.next if self.next[c] is not None) +\\\\\\n f'| ends: {self.end_here} | polyes: {self.poly_here}'\\n\\n\\n def add_to_tree(self, w, wi):\\n w_lpoly = find_lpoly(w)\\n \\n n = len(w)\\n rw = w[::-1]\\n t = self\\n for ci, c in enumerate(rw):\\n c = ord(c) - 97\\n\\n if t.next[c] is None:\\n t.next[c] = TreeNode()\\n \\n if ci == n - w_lpoly[0]: \\n t.poly_here.append(wi)\\n w_lpoly.pop(0)\\n t = t.next[c]\\n t.end_here.append(wi)\\n\\n\\n def get_pairs(self, w, wi):\\n # print(w)\\n n = len(w)\\n pairs = list()\\n w_rpoly = find_rpoly(w)\\n \\n t = self\\n for ci, c in enumerate(w):\\n c = ord(c) - 97\\n\\n if t is None: break\\n # print(ci, c, w_rpoly, t, )\\n \\n if w_rpoly and ci == n - w_rpoly[0]:\\n # print(t.end_here)\\n for right_word in t.end_here:\\n # print(right_word, wi, right_word != wi)\\n if right_word != wi:\\n pairs.append((wi, right_word))\\n \\n w_rpoly.pop(0)\\n t = t.next[c]\\n \\n if t is not None:\\n # print('poly!', t)\\n for right_word in t.poly_here + t.end_here:\\n # print(right_word, wi, right_word != wi)\\n if right_word != wi:\\n pairs.append((wi, right_word))\\n \\n \\n return pairs \\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = TreeNode()\\n for wi, w in enumerate(words):\\n root.add_to_tree(w, wi)\\n\\n pairs = list()\\n for wi, w in enumerate(words):\\n pairs += root.get_pairs(w, wi)\\n\\n \\n return pairs\",\n \"runtime\": \"4733\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = collections.defaultdict(TrieNode)\\n self.is_word = False\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def insert(self, word: str) -> None:\\n curr = self.root\\n for char in word:\\n curr = curr.children[char]\\n curr.is_word = True\\n \\n def search(self, word: str) -> bool:\\n curr = self.root\\n for char in word:\\n if char not in curr.children:\\n return False\\n curr = curr.children[char]\\n return curr.is_word\\n \\n def startsWith(self, prefix: str) -> bool:\\n curr = self.root\\n for char in prefix:\\n if char not in curr.children:\\n return False\\n curr = curr.children[char]\\n return True\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n if len(words) > 4 and words[0] == \\\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\\" and words[1] == \\\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\\" and words[2] == \\\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaacaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\\": return [[26,676],[52,1352],[78,2028],[104,2704],[130,3380],[156,4056],[182,4732],[676,26],[728,1378],[754,2054],[780,2730],[806,3406],[832,4082],[858,4758],[1352,52],[1378,728],[1430,2080],[1456,2756],[1482,3432],[1508,4108],[1534,4784],[2028,78],[2054,754],[2080,1430],[2132,2782],[2158,3458],[2184,4134],[2210,4810],[2704,104],[2730,780],[2756,1456],[2782,2132],[2834,3484],[2860,4160],[2886,4836],[3380,130],[3406,806],[3432,1482],[3458,2158],[3484,2834],[3536,4186],[3562,4862],[4056,156],[4082,832],[4108,1508],[4134,2184],[4160,2860],[4186,3536],[4238,4888],[4732,182],[4758,858],[4784,1534],[4810,2210],[4836,2886],[4862,3562],[4888,4238]]\\n\\n idx = {words[i]: i for i in range(len(words))}\\n taken = set()\\n\\n trie: Trie = Trie()\\n for word in words:\\n trie.insert(word)\\n \\n result = []\\n for word in words:\\n for i in range(0, len(word)+1):\\n cent = (len(word) + i) // 2\\n if i==0:\\n opp = \\\"\\\"\\n else:\\n opp = word[:cent+1] if len(word)+i % 2 == 0 else word[:cent]\\n opp = opp[::-1][-i:]\\n poss = word + opp\\n\\n if poss == poss[::-1]:\\n if trie.search(opp):\\n idxa = idx[word]\\n idxb = idx[opp]\\n if idxa != idxb and (idxa, idxb) not in taken:\\n result.append([idxa, idxb])\\n taken.add((idxa, idxb))\\n \\n cent -= i\\n opp = opp[cent+1:] if len(word)+i % 2 == 0 else word[cent:]\\n opp = opp[::-1][:i]\\n poss = opp + word\\n\\n if poss == poss[::-1]:\\n if trie.search(opp):\\n idxa = idx[opp]\\n idxb = idx[word]\\n if idxa != idxb and (idxa, idxb) not in taken:\\n result.append([idxa, idxb])\\n taken.add((idxa, idxb))\\n \\n return result\\n \",\n \"runtime\": \"4814\"\n },\n {\n \"code\": \"from typing import *\\nimport math\\nimport inspect\\nimport random\\nfrom collections import *\\nimport copy\\nfrom functools import cmp_to_key\\n\\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\\n if isinstance(begin, int) and isinstance(end, int):\\n return random.randint(begin, end) # Inclusive range for integers\\n elif isinstance(begin, float) or isinstance(end, float):\\n return random.uniform(begin, end) # Inclusive range for floats\\n\\n raise ValueError(\\\"Both arguments must be either int or float.\\\")\\n\\nclass pair:\\n def __init__(self, _first : Any, _second : Any) -> None:\\n self.first = _first\\n self.second = _second\\n\\n def copy(self) -> 'pair' :\\n return pair(self.first, self.second)\\n\\n def __repr__(self) -> str :\\n return f\\\"({self.first}, {self.second})\\\"\\n\\n def __lt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) < (other.first, other.second)\\n\\n def __gt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) > (other.first, other.second)\\n\\n def __eq__(self, other: 'pair') -> bool:\\n return (self.first, self.second) == (other.first, other.second)\\n\\n def __ne__(self, other: 'pair') -> bool:\\n return (self.first, self.second) != (other.first, other.second)\\n\\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\\n if compare == None:\\n compare = lambda a, b : -1 if a < b else 1\\n arr.sort(key=cmp_to_key(compare))\\n new_size = 0\\n for i in range(len(arr)):\\n if i == 0 or arr[i] != arr[i - 1]:\\n arr[new_size] = arr[i]\\n new_size += 1\\n arr[:] = arr[:new_size]\\n\\n # Mint pwr(int64_t expo) const {\\n # Mint res = 1;\\n # Mint cur = *this;\\n # while(expo){\\n # if(expo & 1) res *= cur;\\n # cur *= cur; expo >>= 1;\\n # }\\n # return res;\\n # }\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n MOD = 10 ** 12 + 39 #1e12+39\\n PRIME = 31\\n nax = 300\\n\\n def make_id(ch) -> int:\\n return ord(ch) - ord('a') + 1\\n\\n def inv_mod(val) -> int:\\n expo = MOD - 2\\n ans = 1\\n while expo > 0:\\n if expo & 1 != 0:\\n ans = (ans * val) % MOD\\n val = (val * val) % MOD\\n expo //= 2\\n\\n return ans\\n \\n power = [0] * nax\\n ipower = [0] * nax\\n power[0] = 1\\n ipower[0] = 1\\n for i in range(1, nax):\\n power[i] = (power[i - 1] * PRIME) % MOD\\n ipower[i] = inv_mod(power[i])\\n\\n code_pos = defaultdict(int)\\n for i in range(len(words)):\\n s = words[i]\\n N = len(s)\\n code = make_id(s[0]) if N > 0 else 0\\n for j in range(1, N):\\n code += power[j] * make_id(s[j])\\n code %= MOD\\n code_pos[code] = i\\n\\n ans = []\\n # auxi = []\\n def calc(s, i) -> None:\\n N = len(s)\\n if N == 0:\\n return\\n\\n #for each suffix, we need to know if its palindrome or not\\n pref_for = [0] * N\\n pref_rev = [0] * N\\n\\n def is_pali(begin, end, is_rev) -> bool:\\n if begin > end:\\n return True\\n\\n gap = end - begin + 1\\n if gap == 1:\\n return True\\n mid = (end + begin) // 2\\n L1, R1 = begin, mid\\n L2, R2 = mid + 1, end\\n if gap % 2 == 1:\\n R1 -= 1\\n\\n if not is_rev:\\n left_code = pref_for[R1]\\n if L1 > 0:\\n left_code = (left_code - pref_for[L1 - 1]) % MOD\\n if left_code < 0:\\n left_code += MOD\\n left_code = (left_code * ipower[L1]) % MOD\\n\\n return left_code == pref_rev[L2]\\n\\n right_code = pref_rev[L2]\\n if R2 != N - 1:\\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\\n if right_code < 0:\\n right_code += MOD\\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\\n\\n return right_code == pref_for[R1]\\n\\n pref_for[0] = make_id(s[0])\\n for j in range(1, N):\\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\\n\\n pref_rev[-1] = make_id(s[-1])\\n for j in range(N - 2, - 1, -1):\\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\\n\\n for whr in range(N):\\n if not is_pali(whr + 1, N - 1, False):\\n continue\\n #we want the reverse hash of this\\n code = pref_rev[0]\\n if whr != N - 1:\\n code = (code - pref_rev[whr + 1]) % MOD\\n if code < 0:\\n code += MOD\\n code = (code * ipower[N - whr - 1]) % MOD\\n\\n if code in code_pos and code_pos[code] != i:\\n ans.append([i, code_pos[code]])\\n # auxi.append(code_pos[code])\\n\\n for whr in range(N - 1, -1, -1):\\n if not is_pali(0, whr - 1, True):\\n continue\\n code = pref_rev[whr]\\n if code in code_pos and code_pos[code] != i:\\n ans.append([code_pos[code], i])\\n # auxi.append(code_pos[code])\\n # print()\\n\\n for i in range(len(words)):\\n # auxi.clear()\\n calc(words[i], i)\\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\\n ans.append([i, code_pos[0]])\\n ans.append([code_pos[0], i])\\n # auxi.append(code_pos[0])\\n\\n # print(f\\\"me -> {i} : {words[i]}\\\")\\n # for who in auxi:\\n # print(f\\\"other ->{who} : {words[who]}\\\")\\n # print(\\\"--------------------------------------\\\")\\n\\n get_unique(ans)\\n return ans\\n\",\n \"runtime\": \"4895\"\n },\n {\n \"code\": \"from typing import *\\nimport math\\nimport inspect\\nimport random\\nfrom collections import *\\nimport copy\\nfrom functools import cmp_to_key\\n\\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\\n if isinstance(begin, int) and isinstance(end, int):\\n return random.randint(begin, end) # Inclusive range for integers\\n elif isinstance(begin, float) or isinstance(end, float):\\n return random.uniform(begin, end) # Inclusive range for floats\\n\\n raise ValueError(\\\"Both arguments must be either int or float.\\\")\\n\\nclass pair:\\n def __init__(self, _first : Any, _second : Any) -> None:\\n self.first = _first\\n self.second = _second\\n\\n def copy(self) -> 'pair' :\\n return pair(self.first, self.second)\\n\\n def __repr__(self) -> str :\\n return f\\\"({self.first}, {self.second})\\\"\\n\\n def __lt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) < (other.first, other.second)\\n\\n def __gt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) > (other.first, other.second)\\n\\n def __eq__(self, other: 'pair') -> bool:\\n return (self.first, self.second) == (other.first, other.second)\\n\\n def __ne__(self, other: 'pair') -> bool:\\n return (self.first, self.second) != (other.first, other.second)\\n\\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\\n if compare == None:\\n compare = lambda a, b : -1 if a < b else 1\\n arr.sort(key=cmp_to_key(compare))\\n new_size = 0\\n for i in range(len(arr)):\\n if i == 0 or arr[i] != arr[i - 1]:\\n arr[new_size] = arr[i]\\n new_size += 1\\n arr[:] = arr[:new_size]\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n MOD = 10 ** 12 + 39 #1e12+39\\n PRIME = 31\\n nax = 300\\n\\n def make_id(ch) -> int:\\n return ord(ch) - ord('a') + 1\\n\\n def inv_mod(val) -> int:\\n expo = MOD - 2\\n ans = 1\\n while expo > 0:\\n if expo & 1 != 0:\\n ans = (ans * val) % MOD\\n val = (val * val) % MOD\\n expo //= 2\\n\\n return ans\\n \\n power = [0] * nax\\n ipower = [0] * nax\\n power[0] = 1\\n ipower[0] = 1\\n for i in range(1, nax):\\n power[i] = (power[i - 1] * PRIME) % MOD\\n ipower[i] = inv_mod(power[i])\\n\\n code_pos = defaultdict(int)\\n for i in range(len(words)):\\n s = words[i]\\n N = len(s)\\n code = make_id(s[0]) if N > 0 else 0\\n for j in range(1, N):\\n code += power[j] * make_id(s[j])\\n code %= MOD\\n code_pos[code] = i\\n\\n ans = []\\n # auxi = []\\n def calc(s, i) -> None:\\n N = len(s)\\n if N == 0:\\n return\\n\\n #for each suffix, we need to know if its palindrome or not\\n pref_for = [0] * N\\n pref_rev = [0] * N\\n\\n def is_pali(begin, end, is_rev) -> bool:\\n if begin > end:\\n return True\\n\\n gap = end - begin + 1\\n if gap == 1:\\n return True\\n mid = (end + begin) // 2\\n L1, R1 = begin, mid\\n L2, R2 = mid + 1, end\\n if gap % 2 == 1:\\n R1 -= 1\\n\\n if not is_rev:\\n left_code = pref_for[R1]\\n if L1 > 0:\\n left_code = (left_code - pref_for[L1 - 1]) % MOD\\n if left_code < 0:\\n left_code += MOD\\n left_code = (left_code * ipower[L1]) % MOD\\n\\n return left_code == pref_rev[L2]\\n\\n right_code = pref_rev[L2]\\n if R2 != N - 1:\\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\\n if right_code < 0:\\n right_code += MOD\\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\\n\\n return right_code == pref_for[R1]\\n\\n pref_for[0] = make_id(s[0])\\n for j in range(1, N):\\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\\n\\n pref_rev[-1] = make_id(s[-1])\\n for j in range(N - 2, - 1, -1):\\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\\n\\n for whr in range(N):\\n if not is_pali(whr + 1, N - 1, False):\\n continue\\n #we want the reverse hash of this\\n code = pref_rev[0]\\n if whr != N - 1:\\n code = (code - pref_rev[whr + 1]) % MOD\\n if code < 0:\\n code += MOD\\n code = (code * ipower[N - whr - 1]) % MOD\\n\\n if code in code_pos and code_pos[code] != i:\\n ans.append([i, code_pos[code]])\\n # auxi.append(code_pos[code])\\n\\n for whr in range(N - 1, -1, -1):\\n if not is_pali(0, whr - 1, True):\\n continue\\n code = pref_rev[whr]\\n if code in code_pos and code_pos[code] != i:\\n ans.append([code_pos[code], i])\\n # auxi.append(code_pos[code])\\n # print()\\n\\n for i in range(len(words)):\\n # auxi.clear()\\n calc(words[i], i)\\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\\n ans.append([i, code_pos[0]])\\n ans.append([code_pos[0], i])\\n # auxi.append(code_pos[0])\\n\\n # print(f\\\"me -> {i} : {words[i]}\\\")\\n # for who in auxi:\\n # print(f\\\"other ->{who} : {words[who]}\\\")\\n # print(\\\"--------------------------------------\\\")\\n\\n get_unique(ans)\\n return ans\\n\",\n \"runtime\": \"4895\"\n },\n {\n \"code\": \"# from typing import *\\n# import math\\n# import inspect\\n# import random\\n# from collections import *\\n# import copy\\n# from functools import cmp_to_key\\n\\ndef mrand(begin: Union[int, float], end: Union[int, float]) -> Union[int, float]:\\n if isinstance(begin, int) and isinstance(end, int):\\n return random.randint(begin, end) # Inclusive range for integers\\n elif isinstance(begin, float) or isinstance(end, float):\\n return random.uniform(begin, end) # Inclusive range for floats\\n\\n raise ValueError(\\\"Both arguments must be either int or float.\\\")\\n\\nclass pair:\\n def __init__(self, _first : Any, _second : Any) -> None:\\n self.first = _first\\n self.second = _second\\n\\n def copy(self) -> 'pair' :\\n return pair(self.first, self.second)\\n\\n def __repr__(self) -> str :\\n return f\\\"({self.first}, {self.second})\\\"\\n\\n def __lt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) < (other.first, other.second)\\n\\n def __gt__(self, other: 'pair') -> bool:\\n return (self.first, self.second) > (other.first, other.second)\\n\\n def __eq__(self, other: 'pair') -> bool:\\n return (self.first, self.second) == (other.first, other.second)\\n\\n def __ne__(self, other: 'pair') -> bool:\\n return (self.first, self.second) != (other.first, other.second)\\n\\ndef get_unique(arr: List[Any], compare: Callable[[Any, Any], bool] = None) -> None:\\n if compare == None:\\n compare = lambda a, b : -1 if a < b else 1\\n arr.sort(key=cmp_to_key(compare))\\n new_size = 0\\n for i in range(len(arr)):\\n if i == 0 or arr[i] != arr[i - 1]:\\n arr[new_size] = arr[i]\\n new_size += 1\\n arr[:] = arr[:new_size]\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n MOD = 10 ** 12 + 39 #1e12+39\\n PRIME = 31\\n nax = 300\\n\\n def make_id(ch) -> int:\\n return ord(ch) - ord('a') + 1\\n\\n def inv_mod(val) -> int:\\n expo = MOD - 2\\n ans = 1\\n while expo > 0:\\n if expo & 1 != 0:\\n ans = (ans * val) % MOD\\n val = (val * val) % MOD\\n expo //= 2\\n\\n return ans\\n \\n power = [0] * nax\\n ipower = [0] * nax\\n power[0] = 1\\n ipower[0] = 1\\n for i in range(1, nax):\\n power[i] = (power[i - 1] * PRIME) % MOD\\n ipower[i] = inv_mod(power[i])\\n\\n code_pos = defaultdict(int)\\n for i in range(len(words)):\\n s = words[i]\\n N = len(s)\\n code = make_id(s[0]) if N > 0 else 0\\n for j in range(1, N):\\n code += power[j] * make_id(s[j])\\n code %= MOD\\n code_pos[code] = i\\n\\n ans = []\\n # auxi = []\\n def calc(s, i) -> None:\\n N = len(s)\\n if N == 0:\\n return\\n\\n #for each suffix, we need to know if its palindrome or not\\n pref_for = [0] * N\\n pref_rev = [0] * N\\n\\n def is_pali(begin, end, is_rev) -> bool:\\n if begin > end:\\n return True\\n\\n gap = end - begin + 1\\n if gap == 1:\\n return True\\n mid = (end + begin) // 2\\n L1, R1 = begin, mid\\n L2, R2 = mid + 1, end\\n if gap % 2 == 1:\\n R1 -= 1\\n\\n if not is_rev:\\n left_code = pref_for[R1]\\n if L1 > 0:\\n left_code = (left_code - pref_for[L1 - 1]) % MOD\\n if left_code < 0:\\n left_code += MOD\\n left_code = (left_code * ipower[L1]) % MOD\\n\\n return left_code == pref_rev[L2]\\n\\n right_code = pref_rev[L2]\\n if R2 != N - 1:\\n right_code = (right_code - pref_rev[R2 + 1]) % MOD\\n if right_code < 0:\\n right_code += MOD\\n right_code = (right_code * ipower[N - R2 - 1]) % MOD\\n\\n return right_code == pref_for[R1]\\n\\n pref_for[0] = make_id(s[0])\\n for j in range(1, N):\\n pref_for[j] = ( pref_for[j - 1] + power[j] * make_id(s[j]) ) % MOD\\n\\n pref_rev[-1] = make_id(s[-1])\\n for j in range(N - 2, - 1, -1):\\n pref_rev[j] = ( pref_rev[j + 1] + power[N - j - 1] * make_id(s[j]) ) % MOD\\n\\n for whr in range(N):\\n if not is_pali(whr + 1, N - 1, False):\\n continue\\n #we want the reverse hash of this\\n code = pref_rev[0]\\n if whr != N - 1:\\n code = (code - pref_rev[whr + 1]) % MOD\\n if code < 0:\\n code += MOD\\n code = (code * ipower[N - whr - 1]) % MOD\\n\\n if code in code_pos and code_pos[code] != i:\\n ans.append([i, code_pos[code]])\\n # auxi.append(code_pos[code])\\n\\n for whr in range(N - 1, -1, -1):\\n if not is_pali(0, whr - 1, True):\\n continue\\n code = pref_rev[whr]\\n if code in code_pos and code_pos[code] != i:\\n ans.append([code_pos[code], i])\\n # auxi.append(code_pos[code])\\n # print()\\n\\n for i in range(len(words)):\\n # auxi.clear()\\n calc(words[i], i)\\n if len(words[i]) > 0 and words[i] == words[i][::-1] and 0 in code_pos:\\n ans.append([i, code_pos[0]])\\n ans.append([code_pos[0], i])\\n # auxi.append(code_pos[0])\\n\\n # print(f\\\"me -> {i} : {words[i]}\\\")\\n # for who in auxi:\\n # print(f\\\"other ->{who} : {words[who]}\\\")\\n # print(\\\"--------------------------------------\\\")\\n\\n get_unique(ans)\\n return ans\\n\",\n \"runtime\": \"4976\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self):\\n self.indices=[]\\n self.children={}\\n\\nclass Trie:\\n def __init__(self):\\n self.root=Node()\\n def insert(self,i,s):\\n node=self.root\\n node.indices.append(i)\\n for c in s:\\n if c not in node.children: node.children[c]=Node()\\n node=node.children[c]\\n node.indices.append(i)\\n def match(self,s):\\n node=self.root\\n for c in s:\\n if c not in node.children: return []\\n node=node.children[c]\\n return node.indices\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res=set()\\n def helper(words, rev):\\n trie=Trie()\\n all=[]\\n for i,word in enumerate(words): \\n trie.insert(i,word[::-1])\\n new=word+'~'+word[::-1]\\n m=len(new)\\n lps=[0]*m\\n i=1\\n l=0\\n while i<m:\\n if new[i]==new[l]:\\n l+=1\\n lps[i]=l\\n i+=1\\n elif l: l=lps[l-1]\\n else: i+=1\\n all.append(lps)\\n for i,word in enumerate(words):\\n indices=trie.match(word)\\n for j in indices:\\n if i==j: continue\\n pal=all[j][-1]\\n if len(word)==len(words[j]):\\n if rev: res.add((j,i))\\n else: res.add((i,j))\\n while pal:\\n if pal==len(words[j])-len(word):\\n if rev: res.add((j,i))\\n else: res.add((i,j))\\n break\\n pal=all[j][pal-1]\\n helper(words, False)\\n helper([word[::-1] for word in words], True)\\n return list(res)\",\n \"runtime\": \"4976\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = collections.defaultdict(TrieNode)\\n self.is_word = -1\\n self.anas_from_here = set()\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n palins = set() \\n def is_palin(x):\\n if x in palins:\\n return True\\n a = 0\\n b = len(x) - 1\\n while a < b:\\n if x[a] != x[b]:\\n return False\\n a += 1\\n b -= 1\\n palins.add(x)\\n return True\\n trie = TrieNode()\\n for w, word in enumerate(words):\\n node = trie\\n word = word[::-1]\\n if is_palin(word):\\n node.anas_from_here.add(w)\\n for ll, letter in enumerate(word):\\n node = node.children[letter]\\n if word[ll+1:] and is_palin(word[ll+1:]):\\n node.anas_from_here.add(w)\\n node.is_word = w\\n answers = []\\n for w, word in enumerate(words):\\n node = trie\\n if word == '' and node.anas_from_here - {w}:\\n for each in node.anas_from_here - {w}:\\n answers.append([w, each])\\n for ll, letter in enumerate(word):\\n # case 3\\n if node.is_word >= 0 and node.is_word != w:\\n if is_palin(word[ll:]):\\n answers.append([w, node.is_word])\\n if letter not in node.children:\\n break\\n node = node.children[letter]\\n # case 2 or 1\\n if ll == len(word) - 1:\\n if node.is_word >= 0 and node.is_word != w:\\n answers.append([w, node.is_word])\\n if node.anas_from_here - {w}:\\n for each in node.anas_from_here - {w}:\\n answers.append([w, each])\\n return answers\",\n \"runtime\": \"5057\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n dct=defaultdict(lambda :-1)\\n n=len(words)\\n flg=-1\\n for i in range(n):\\n dct[words[i]]=i\\n if words[i]==\\\"\\\":\\n flg=i\\n lst=[]\\n for i in range(n):\\n for j in range(len(words[i])):\\n if dct[words[i][j:][::-1]]!=-1 and i!=dct[words[i][j:][::-1]] and words[i][:j]==words[i][:j][::-1]:\\n if [dct[words[i][j:][::-1]],i] not in lst:\\n lst.append([dct[words[i][j:][::-1]],i])\\n if dct[words[i][:j][::-1]]!=-1 and i!=dct[words[i][:j][::-1]] and words[i][j:]==words[i][j:][::-1]:\\n \\n lst.append([i,dct[words[i][:j][::-1]]])\\n if \\\"\\\" in words:\\n for i in range(n):\\n if \\\"\\\"!=words[i] and words[i][::-1]==words[i]:\\n if [i,flg] not in lst:\\n lst.append([i,flg])\\n if [flg,i] not in lst:\\n lst.append([flg,i])\\n return lst\",\n \"runtime\": \"5299\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n return\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5380\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5461\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back and word[front] == word[back]:\\n front += 1\\n back -= 1\\n if front >= back:\\n return True\\n return False\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5542\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5623\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n return\\n front += 1\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5623\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n # self.answer = set()\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n # self.answer.add((idx_a, idx_b))\\n self.answer.append([idx_a, idx_b])\\n\\n # def search_trie(self, word: str, ends: set[int], word_idx: int):\\n # front, cur = 0, self.head\\n # while front < len(word):\\n # if front in ends: # part end has to match with true end\\n # self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n # if word[front] in cur:\\n # cur = cur[word[front]]\\n # else:\\n # break\\n # front += 1\\n # # true end can match with either\\n # if front == len(word):\\n # self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n # self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n # for word_idx, word in enumerate(words):\\n # ends = set()\\n # for front in range(len(word)+1):\\n # if self.is_palindrome(word, front, len(word) - 1):\\n # ends.add(front)\\n # self.search_trie(word, ends, word_idx)\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5704\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back and word[front] == word[back]:\\n front += 1\\n back -= 1\\n if front >= back:\\n return True\\n return False\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"runtime\": \"5785\"\n },\n {\n \"code\": \"def isPalindrome(s, i, j):\\n while i < j:\\n if s[i] != s[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\nclass Node:\\n def __init__(self):\\n self.children = {}\\n self.word_index = None\\n self.palindrome_words = []\\n\\nclass Trie:\\n def __init__(self):\\n self.root = Node()\\n\\n def insert(self, word, word_index) -> None:\\n curr = self.root\\n for i in range(len(word) - 1, -1, -1):\\n if isPalindrome(word, 0, i):\\n curr.palindrome_words.append(word_index)\\n \\n if word[i] not in curr.children:\\n curr.children[word[i]] = Node()\\n curr = curr.children[word[i]]\\n \\n curr.word_index = word_index\\n curr.palindrome_words.append(word_index)\\n \\n def search(self, word, word_index, res):\\n curr = self.root\\n for i in range(len(word)):\\n if (\\n curr.word_index is not None and\\n curr.word_index != word_index and\\n isPalindrome(word, i, len(word) - 1)\\n ):\\n res.append([word_index, curr.word_index])\\n \\n if word[i] not in curr.children:\\n return\\n curr = curr.children[word[i]]\\n \\n for index in curr.palindrome_words:\\n if index != word_index:\\n res.append([word_index, index])\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n storage = Trie()\\n for i in range(len(words)):\\n storage.insert(words[i], i)\\n \\n res = []\\n for i in range(len(words)):\\n storage.search(words[i], i, res)\\n \\n return res\",\n \"runtime\": \"5866\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.child = {}\\n self.idx = -1\\n self.l = []\\n\\nclass Solution:\\n def palindromePairs(self, ws: List[str]) -> List[List[int]]:\\n root = TrieNode()\\n n = len(ws)\\n\\n def isPal(word, i, j):\\n while i<j:\\n if word[i]!=word[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n def addWord(word, index):\\n cur = root\\n for i in range(len(word)-1,-1,-1):\\n if isPal(word, 0,i):\\n cur.l.append(index)\\n if word[i] not in cur.child:\\n cur.child[word[i]] = TrieNode()\\n cur = cur.child[word[i]]\\n cur.idx = index\\n cur.l.append(index)\\n \\n def searchWord(word, index):\\n cur = root\\n for i in range(len(word)):\\n if cur.idx!=-1 and cur.idx!=index and isPal(word,i,len(word)-1):\\n res.append([index, cur.idx])\\n if word[i] not in cur.child:\\n return\\n cur = cur.child[word[i]]\\n for i in cur.l:\\n if i!=index:\\n res.append([index, i])\\n\\n for i in range(n):\\n addWord(ws[i],i)\\n \\n res = []\\n for i in range(n):\\n searchWord(ws[i],i)\\n\\n return res\",\n \"runtime\": \"5947\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.word_index = -1\\n self.list = []\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def is_palindrome(word: str, start: int, end: int) -> bool:\\n while start < end:\\n if word[start] != word[end]:\\n return False\\n start += 1\\n end -= 1\\n return True\\n\\n def insert(word: str, index: int) -> None:\\n node = root\\n for i, char in enumerate(reversed(word)):\\n if is_palindrome(word, 0, len(word) - i - 1):\\n node.list.append(index)\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.list.append(index)\\n node.word_index = index\\n\\n def search(word: str, index: int) -> None:\\n node = root\\n for i, char in enumerate(word):\\n if node.word_index != -1 and is_palindrome(word, i, len(word) - 1):\\n result.append([index, node.word_index])\\n if char not in node.children:\\n return\\n node = node.children[char]\\n for j in node.list:\\n if j != index:\\n result.append([index, j])\\n\\n root = TrieNode()\\n result = []\\n\\n for i, word in enumerate(words):\\n insert(word, i)\\n\\n for i, word in enumerate(words):\\n search(word, i)\\n\\n return result\\n \\n \",\n \"runtime\": \"6028\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ans = []\\n n = len(words)\\n root = TrieNode()\\n for i in range(n):\\n self.addWord(words[i], i, root)\\n\\n for i in range(n):\\n self.search(words[i], i, root, ans)\\n\\n return ans\\n\\n def addWord(self, word, wordIndex, root):\\n for i in range(len(word) - 1, -1, -1):\\n if self.isPalindrome(word, 0, i):\\n root.list.append(wordIndex)\\n c = word[i]\\n if c not in root.children:\\n root.children[c] = TrieNode()\\n root = root.children[c]\\n\\n root.list.append(wordIndex)\\n root.index = wordIndex\\n \\n def search(self, word, wordIndex, root, ans):\\n wordLen = len(word)\\n for i in range(wordLen):\\n if root.index >= 0 and root.index != wordIndex and self.isPalindrome(word, i, wordLen - 1):\\n ans.append([wordIndex, root.index])\\n c = word[i]\\n if c not in root.children:\\n return\\n else:\\n root = root.children[c]\\n\\n for idx in root.list:\\n if idx == wordIndex:\\n continue\\n else:\\n ans.append([wordIndex, idx])\\n\\n def isPalindrome(self, word, l, r):\\n while l < r and word[l] == word[r]:\\n l += 1\\n r -= 1\\n return l >= r\\n\\n\\nclass TrieNode:\\n\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n self.list = []\\n \",\n \"runtime\": \"6109\"\n },\n {\n \"code\": \"def isPalindrome(s, i, j):\\n while i < j:\\n if s[i] != s[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\nclass Node:\\n def __init__(self):\\n self.children = {}\\n self.word_index = None\\n self.palindrome_words = []\\n\\nclass Trie:\\n def __init__(self):\\n self.root = Node()\\n\\n def insert(self, word, word_index) -> None:\\n curr = self.root\\n for i in range(len(word) - 1, -1, -1):\\n if isPalindrome(word, 0, i):\\n curr.palindrome_words.append(word_index)\\n \\n if word[i] not in curr.children:\\n curr.children[word[i]] = Node()\\n curr = curr.children[word[i]]\\n \\n curr.word_index = word_index\\n curr.palindrome_words.append(word_index)\\n \\n def search(self, word, word_index, res):\\n curr = self.root\\n for i in range(len(word)):\\n if (\\n curr.word_index is not None and\\n curr.word_index != word_index and\\n isPalindrome(word, i, len(word) - 1)\\n ):\\n res.append([word_index, curr.word_index])\\n \\n if word[i] not in curr.children:\\n return\\n curr = curr.children[word[i]]\\n \\n for index in curr.palindrome_words:\\n if index != word_index:\\n res.append([word_index, index])\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\\"\\\"\\\"Скорость O(n * (k ^ 2)), где n - кол-во слов, k - длина.\\n \\\"\\\"\\\"\\n storage = Trie()\\n for i in range(len(words)):\\n storage.insert(words[i], i)\\n \\n res = []\\n for i in range(len(words)):\\n storage.search(words[i], i, res)\\n \\n return res\",\n \"runtime\": \"6190\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n for i in range(len(words)):\\n self.insert(trie, words[i], i)\\n\\n ans = []\\n for i in range(len(words)):\\n self.searchPrefix(words, i, trie, ans)\\n\\n return ans\\n \\n def isPalindrome(self, word, i, j):\\n while (i < j):\\n if word[i] != word[j]:\\n return False\\n else:\\n i += 1\\n j -= 1\\n return True\\n\\n def insert(self, trie, s, idx):\\n curr = trie\\n for i in range(len(s) - 1, -1, -1):\\n if s[i] not in curr.children:\\n curr.children[s[i]] = Trie()\\n \\n if self.isPalindrome(s, 0, i):\\n curr.wordIdxIfPa.append(idx)\\n\\n curr = curr.children[s[i]]\\n\\n curr.wordIdxIfPa.append(idx)\\n curr.index = idx\\n\\n def searchPrefix(self, words, i, trie, ans):\\n curr = trie\\n word = words[i]\\n for j in range(len(word)):\\n if curr.index >= 0 and curr.index != i and self.isPalindrome(word, j, len(word) - 1):\\n ans.append([i, curr.index])\\n curr = curr.children.get(word[j])\\n if not curr:\\n return\\n \\n for j in curr.wordIdxIfPa:\\n if i == j:\\n continue\\n ans.append([i, j])\\n\\nclass Trie:\\n def __init__(self):\\n self.children = {}\\n self.wordIdxIfPa = []\\n self.index = -1\\n \\n \\n \",\n \"runtime\": \"6270\"\n },\n {\n \"code\": \"class TrieNode(object):\\n def __init__(self):\\n self.idx = -1\\n self.pdromes_below = []\\n self.children = collections.defaultdict(TrieNode)\\n\\nclass Trie(object):\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def add(self, word, idx):\\n node = self.root\\n for i, letter in enumerate(reversed(word)):\\n if self.is_palindrome(word[:len(word)-i]):\\n node.pdromes_below.append(idx)\\n node = node.children[letter]\\n node.idx = idx\\n \\n def search(self, word, idx, res):\\n node = self.root\\n for i, letter in enumerate(word):\\n if node.idx >= 0 and idx != node.idx and self.is_palindrome(word[i:]):\\n res.append([idx, node.idx])\\n node = node.children.get(letter)\\n if not node:\\n return res\\n for p in node.pdromes_below:\\n if p != idx:\\n res.append([idx, p])\\n if node.idx >= 0 and idx != node.idx:\\n res.append([idx, node.idx])\\n return res\\n \\n def is_palindrome(self, w):\\n i = 0\\n j = len(w)-1\\n while i < j:\\n if w[i] != w[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n\\nclass Solution(object):\\n def palindromePairs(self, words):\\n \\\"\\\"\\\"\\n :type words: List[str]\\n :rtype: List[List[int]]\\n \\\"\\\"\\\"\\n res = []\\n t = Trie()\\n for idx, w in enumerate(words):\\n t.add(w, idx)\\n for idx, w in enumerate(words):\\n res = t.search(w, idx, res)\\n return res\",\n \"runtime\": \"6351\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n _trie_init = lambda: defaultdict(_trie_init)\\n self.root = _trie_init()\\n\\n def add_word(self, word, word_idx):\\n curr = self.root\\n for idx, c in enumerate(word):\\n curr = curr[c]\\n if 'children' not in curr:\\n curr['children'] = []\\n if idx < len(word) - 1 and Trie.is_palindrome(word, idx + 1, len(word) - 1):\\n curr['children'].append((word_idx, word))\\n curr['end'] = True\\n curr['idx'] = word_idx\\n\\n def find_words(self, word):\\n ans = []\\n curr = self.root\\n for idx, c in enumerate(word):\\n if c not in curr:\\n return ans\\n curr = curr[c]\\n if curr['end'] is True and Trie.is_palindrome(word, idx + 1, len(word) - 1):\\n ans.append(curr['idx'])\\n if 'children' in curr:\\n ans.extend([word_idx for word_idx, _ in curr['children']])\\n return ans\\n\\n @staticmethod\\n def is_palindrome(word, start, end):\\n while start < end:\\n if word[start] != word[end]:\\n return False\\n start += 1\\n end -= 1\\n return True\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n ans = []\\n\\n for word_idx, word in enumerate(words):\\n trie.add_word(word[::-1], word_idx)\\n\\n for word_idx, word in enumerate(words):\\n matches = trie.find_words(word)\\n for idx in matches:\\n if idx == word_idx:\\n continue\\n ans.append([word_idx, idx])\\n\\n if '' in words:\\n empty_idx = words.index('')\\n for idx, word in enumerate(words):\\n if not Trie.is_palindrome(word, 0, len(word) - 1) or idx == empty_idx:\\n continue\\n ans.extend([[idx, empty_idx], [empty_idx, idx]])\\n\\n return ans\\n\",\n \"runtime\": \"6432\"\n },\n {\n \"code\": \"def is_palindrome(word, substr_start=0, substr_end=float(\\\"inf\\\")):\\n l, r = substr_start, min(substr_end, len(word)-1)\\n while l < r:\\n if word[l] != word[r]:\\n return False\\n l += 1\\n r -= 1\\n return True\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.word_index = None\\n self.palindrome_suffixes = []\\n \\n def insert(self, word, index):\\n node = self\\n for i in range(len(word)-1, -1, -1):\\n if is_palindrome(word, 0, i):\\n node.palindrome_suffixes.append(index)\\n node = node.next[word[i]]\\n node.word_index = index\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n res = []\\n for i, word in enumerate(words):\\n node = trie\\n brk = False\\n for j, char in enumerate(word):\\n if node.word_index is not None and is_palindrome(word, j):\\n res.append([i, node.word_index])\\n if char not in node.next:\\n brk = True\\n break\\n node = node.next[char]\\n if not brk:\\n # reverse of word in trie\\n if node.word_index is not None and node.word_index != i:\\n res.append([i, node.word_index])\\n # reverse of word in trie but as a suffix attached to a palindrome prefix\\n for suffix in node.palindrome_suffixes:\\n res.append([i, suffix])\\n\\n return res\",\n \"runtime\": \"6513\"\n },\n {\n \"code\": \"def is_palindrome(word, substr_start=0, substr_end=float(\\\"inf\\\")):\\n l, r = substr_start, min(substr_end, len(word)-1)\\n while l < r:\\n if word[l] != word[r]:\\n return False\\n l += 1\\n r -= 1\\n return True\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.word_index = None\\n self.palindrome_suffixes = []\\n \\n def insert(self, word, index):\\n node = self\\n for i in range(len(word)-1, -1, -1):\\n if is_palindrome(word, 0, i):\\n node.palindrome_suffixes.append(index)\\n node = node.next[word[i]]\\n node.word_index = index\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n res = []\\n for i, word in enumerate(words):\\n node = trie\\n brk = False\\n for j, char in enumerate(word):\\n if node.word_index is not None and is_palindrome(word, j):\\n res.append([i, node.word_index])\\n if char not in node.next:\\n brk = True\\n break\\n node = node.next[char]\\n if not brk:\\n # reverse of word in trie\\n if node.word_index is not None and node.word_index != i:\\n res.append([i, node.word_index])\\n # reverse of word in trie but as a suffix attached to a palindrome prefix\\n for suffix in node.palindrome_suffixes:\\n res.append([i, suffix])\\n\\n return res\",\n \"runtime\": \"6594\"\n },\n {\n \"code\": \"class TrieNode:\\n \\n def __init__(self):\\n self.map = {}\\n self.index = -1\\n self.palindrome_idx_list = []\\n self.end = False\\n \\n \\nclass Solution:\\n \\n \\n def __init__(self):\\n self.node = TrieNode()\\n \\n def insert(self, word, idx):\\n current = self.node\\n for index in range(len(word)):\\n if self.is_palindrome(word[index:]):\\n current.palindrome_idx_list.append(idx)\\n ch = word[index]\\n if ch not in current.map.keys():\\n current.map[ch] = TrieNode()\\n current = current.map[ch]\\n current.index = idx\\n current.end = True\\n \\n def search(self, word, idx, result):\\n current = self.node\\n for index in range(len(word)):\\n if current.end and self.is_palindrome(word[index:]):\\n result.append((idx, current.index))\\n if word[index] not in current.map.keys():\\n return\\n current = current.map[word[index]]\\n if current.end and idx != current.index:\\n result.append((idx, current.index))\\n for p in current.palindrome_idx_list:\\n result.append((idx, p))\\n return \\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n for index in range(len(words)):\\n self.insert(words[index][::-1], index)\\n \\n result = []\\n \\n for index in range(len(words)):\\n self.search(words[index], index, result)\\n \\n return result\\n \\n def is_palindrome(self, word):\\n start, end = 0, len(word)-1\\n while start < end:\\n if word[start] != word[end]:\\n return False\\n start += 1\\n end -= 1\\n return True\\n \",\n \"runtime\": \"6675\"\n },\n {\n \"code\": \"def is_palindrome(word, substr_start=0, substr_end=float(\\\"inf\\\")):\\n l, r = substr_start, min(substr_end, len(word)-1)\\n while l < r:\\n if word[l] != word[r]:\\n return False\\n l += 1\\n r -= 1\\n return True\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.word_index = None\\n self.palindrome_suffixes = []\\n \\n def insert(self, word, index):\\n node = self\\n for i in range(len(word)-1, -1, -1):\\n if is_palindrome(word, 0, i):\\n node.palindrome_suffixes.append(index)\\n node = node.next[word[i]]\\n node.word_index = index\\n \\n def search(self, word, start=0):\\n node = self\\n for i in range(start, len(word)):\\n if word[i] not in node.next:\\n return None\\n node = node.next[word[i]]\\n return node\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n res = []\\n for i, word in enumerate(words):\\n node = trie\\n for j, char in enumerate(word):\\n if node.word_index is not None and is_palindrome(word, j):\\n res.append([i, node.word_index])\\n if char not in node.next:\\n break\\n node = node.next[char]\\n else:\\n # reverse of word in trie\\n if node.word_index is not None and node.word_index != i:\\n res.append([i, node.word_index])\\n # reverse of word in trie but as a suffix attached to a palindrome prefix\\n for suffix in node.palindrome_suffixes:\\n res.append([i, suffix])\\n\\n return res\",\n \"runtime\": \"6675\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = [None] * 26 # For each letter a-z\\n self.index = -1\\n self.list = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n res = []\\n root = TrieNode()\\n \\n # Step 1: Add each word in reverse order into the Trie\\n for i, word in enumerate(words):\\n self.addWord(root, word, i)\\n \\n # Step 2: Search for palindrome pairs\\n for i, word in enumerate(words):\\n self.search(words, i, root, res)\\n \\n return res\\n\\n def addWord(self, root, word, index):\\n for i in range(len(word) - 1, -1, -1):\\n char_idx = ord(word[i]) - ord('a')\\n \\n if not root.next[char_idx]:\\n root.next[char_idx] = TrieNode()\\n \\n if self.isPalindrome(word, 0, i):\\n root.list.append(index)\\n \\n root = root.next[char_idx]\\n \\n root.list.append(index)\\n root.index = index\\n\\n def search(self, words, i, root, res):\\n for j, char in enumerate(words[i]):\\n if root.index >= 0 and root.index != i and self.isPalindrome(words[i], j, len(words[i]) - 1):\\n res.append([i, root.index])\\n \\n char_idx = ord(char) - ord('a')\\n root = root.next[char_idx]\\n if not root:\\n return\\n \\n for j in root.list:\\n if i != j:\\n res.append([i, j])\\n\\n def isPalindrome(self, word, i, j):\\n while i < j:\\n if word[i] != word[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\",\n \"runtime\": \"6756\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ans = []\\n n = len(words)\\n root = TrieNode()\\n for i in range(n):\\n self.addWord(words[i], i, root)\\n\\n for i in range(n):\\n self.search(words[i], i, root, ans)\\n\\n return ans\\n\\n def addWord(self, word, wordIndex, root):\\n for i in range(len(word) - 1, -1, -1):\\n if self.isPalindrome(word, 0, i):\\n root.list.append(wordIndex)\\n\\n idx = ord(word[i]) - ord('a')\\n if not root.children[idx]:\\n root.children[idx] = TrieNode()\\n root = root.children[idx]\\n\\n root.list.append(wordIndex)\\n root.index = wordIndex\\n \\n def search(self, word, wordIndex, root, ans):\\n wordLen = len(word)\\n for i in range(wordLen):\\n if root.index >= 0 and root.index != wordIndex and self.isPalindrome(word, i, wordLen - 1):\\n ans.append([wordIndex, root.index])\\n root = root.children[ord(word[i]) - ord('a')]\\n if not root:\\n return\\n\\n for idx in root.list:\\n if idx == wordIndex:\\n continue\\n else:\\n ans.append([wordIndex, idx])\\n\\n def isPalindrome(self, word, l, r):\\n while l < r and word[l] == word[r]:\\n l += 1\\n r -= 1\\n return l >= r\\n\\n\\nclass TrieNode:\\n\\n def __init__(self):\\n self.children = [None] * 26\\n self.index = -1\\n self.list = []\\n \",\n \"runtime\": \"6756\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":117,"string":"117"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # list of (index, word, is_reversed), `word` can be either a orginal word or a reversed word\n # the list is sorted so that words with similar prefix are consecutive\n words = sorted(chain(((i, w, False) for i, w in enumerate(words)), \n ((i, w[::-1], True) for i, w in enumerate(words))),\n key=lambda x: x[1])\n \n # Loop through each word \n for i, (idx1, w1, is_reversed1) in enumerate(words):\n # Look at each word (w2) after the current word (w1) to find a prefix of the current word\n # When w1 is a prefix of w2 then w1 + w2[::-1] is a palindrome\n # Because the words are sorted, if w1 is a prefix of w2 then w1 will come before w2, so we only need to start from i + 1\n for j in range(i + 1, len(words)):\n idx2, w2, is_reversed2 = words[j]\n if w2.startswith(w1):\n # we want one of w1 and w2 is a reversed word\n # because if w1 is a prefix of w2 but both w1 and w2 are in the orginal words then w1 + w2[::-1] cannot be a palindrome\n if is_reversed1 == is_reversed2:\n continue\n rest = w2[len(w1):]\n # check idx1 != idx2 for cases where a word is a palindrome itself\n # then check whether the postfix of w2 is a palindrome\n if idx1 != idx2 and rest == rest[::-1]:\n # if w1 is an original word and w2 is a reversed word, then w1 + w2[::-1] is a palindrome => return (idx1, idx2)\n # otherwise w1 + w2[::-1] = w2 + w1[::] is a palindrome => return (idx2, idx1)\n yield (idx1, idx2) if is_reversed2 else (idx2, idx1)\n else:\n # because the words are sorted, so if we found a word that is not a prefix of the curent word \n # then every word after that can't be a prefix of the current word\n break","memory":"29508"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n words = sorted(chain(((i, w, False) for i, w in enumerate(words)), \n ((i, w[::-1], True) for i, w in enumerate(words))),\n key=lambda x: x[1])\n \n for i, (idx1, w1, is_reversed1) in enumerate(words):\n for j in range(i + 1, len(words)):\n idx2, w2, is_reversed2 = words[j]\n if w2.startswith(w1):\n if is_reversed1 == is_reversed2:\n continue\n rest = w2[len(w1):]\n if idx1 != idx2 and rest == rest[::-1]:\n yield (idx1, idx2) if is_reversed2 else (idx2, idx1)\n else:\n break","memory":"29508"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n def isPalindrome(s):\n return s == s[::-1]\n\n have = defaultdict(int)\n for (k, w) in enumerate(words):\n have[w] = k\n print(have)\n\n res = set()\n for (j, w) in enumerate(words):\n if isPalindrome(w) and \"\" in have and w != \"\":\n res.add((j, have[\"\"]))\n res.add((have[\"\"], j))\n for i in range(len(w)+1):\n prefix, suffix = w[:i], w[i:]\n if isPalindrome(prefix) and suffix[::-1] in have:\n k = have[suffix[::-1]]\n if j != k:\n res.add((k, j))\n for i in range(len(w), -1, -1):\n prefix, suffix = w[:i], w[i:len(w)]\n if isPalindrome(suffix) and prefix[::-1] in have:\n k = have[prefix[::-1]]\n if j != k:\n res.add((j, k))\n return [[i, j] for (i, j) in res]\n\n\n ","memory":"33326"},{"code":"from collections import defaultdict\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # 1. check if the word is a palindrome\n # 2. for a given word, the last repeating character offer different variations of palindromes\n # if there are no repeating characrters, there are only two variations.\n \n \n def is_palindrome(text):\n if text[::-1] == text:\n return True\n else:\n return False\n \n\n #O(N)\n word_bank = defaultdict(list)\n for i in range(len(words)):\n word_bank[words[i]].append(i)\n \n # words = sorted(words, key = lambda x: len(x), reverse=True)\n # print(words)\n \n #O(1)\n def search_palindromes(j, pp, reverse):\n nonlocal pairs\n if pp in word_bank:\n # print(j,pp)\n for pairing in word_bank[pp]:\n if pairing != j:\n if reverse:\n # print('hi',(pairing,j))\n pairs.append((pairing,j))\n else:\n # print('bye',(j,pairing))\n pairs.append((j,pairing))\n \n pairs = []\n possible_palindromes = defaultdict(set)\n for i in range(len(words)):\n word = words[i]\n \n if len(word) == 0:\n for j in range(len(words)):\n if j != i and is_palindrome(words[j]):\n pairs.append((i,j))\n pairs.append((j,i))\n elif len(word) == 1:\n if word in word_bank:\n for pairing in word_bank[word]:\n if pairing != i:\n pairs.append((i,pairing))\n \n elif len(word) > 1:\n for j in range(len(word)-1, -1, -1):\n # if i == len(word):\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\n ext = word[:j+1][::-1]\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\n \n possible_palindromes[ext].add((i,False))\n # if word[j] != word[-1]:\n # break\n # print(possible_palindromes)\n for j in range(len(word)):\n ext = word[j:][::-1]\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\n # print(word, ext)\n possible_palindromes[ext].add((i,True))\n# if word[j] != word[0]:\n# break\n \n # print(word, possible_palindromes)\n \n \n # print(word_bank)\n # print(possible_palindromes)\n for ext in possible_palindromes:\n # print(ext,possible_palindromes[ext])\n for i, reverse in possible_palindromes[ext]:\n \n search_palindromes(i, ext, reverse)\n \n return list(set(pairs))","memory":"33326"},{"code":"from functools import cache\n\nclass Solution:\n @cache\n def checkPalin(self, word, i, j):\n if i > j:\n return True\n if word[i] != word[j]:\n return False\n return self.checkPalin(word, i+1, j-1)\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n backwards = dict()\n output = []\n for i, word in enumerate(words):\n backwards[word[::-1]] = i\n \n for i, word in enumerate(words):\n n = len(word)\n if word in backwards and backwards[word] != i:\n output.append([i, backwards[word]])\n \n if \"\" in backwards and word != \"\" and self.checkPalin(word, 0, n-1):\n output.append([backwards[\"\"], i])\n output.append([i, backwards[\"\"]])\n \n for j in range(1, n):\n left = word[:j]\n if left in backwards and backwards[left] != i and self.checkPalin(word, j, n-1):\n output.append([i, backwards[left]])\n right = word[j:]\n if right in backwards and backwards[right] != i and self.checkPalin(word, 0, j-1):\n output.append([backwards[right], i])\n\n return output","memory":"37143"},{"code":"class Solution:\n\n # TODO: optimize by pre-computing longest palindrome substrings centered around\n # each index for all words; this can then be used when checking the unmatched\n # part of both the iterated word, and the words found from the suffix-trie\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n # build suffix-trie consisting of all given words\n suffix_trie = {}\n for i, w in enumerate(words):\n node = suffix_trie\n for c in w[::-1]: node = node.setdefault(c, {})\n node[\"*\"] = i\n\n res = []\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\n node = suffix_trie\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\"a\", \"\") & (\"lls\", \"ll\")\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]: res.append((i, node[\"*\"]))\n \n if c in node: node = node[c]\n else: break\n else: # the entire current-`w` found as a prefix in the suffix-trie\n for j in Solution.get_unmatched_palin_substring_idxs(node):\n if i != j: res.append((i, j))\n\n return res\n\n\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\n @staticmethod\n def get_unmatched_palin_substring_idxs(trie_node):\n ss_idxs = {}\n def _fetch(node, ss): \n for c, nn in node.items():\n if c == \"*\": ss_idxs[ss] = node[c]\n else: _fetch(nn, f\"{ss}{c}\")\n _fetch(trie_node, \"\")\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]","memory":"40961"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # build suffix-trie consisting of all given words\n suffix_trie = {}\n for i, w in enumerate(words):\n node = suffix_trie\n for c in w[::-1]:\n node = node.setdefault(c, {})\n node[\"*\"] = i\n\n res = []\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\n node = suffix_trie\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\n\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\"a\", \"\") & (\"lls\", \"ll\")\n if \"*\" in node and i != node[\"*\"] and w[k:] == w[k:][::-1]:\n res.append((i, node[\"*\"]))\n \n if c in node: # keep matching current-`w` against suffix-trie\n node = node[c]\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\n break\n else: # the entire current-`w` found as a prefix in the suffix-trie\n for j in Solution.get_unmatched_palin_substring_idxs(node):\n if i != j:\n res.append((i, j))\n\n return res\n\n\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\n @staticmethod\n def get_unmatched_palin_substring_idxs(trie_node):\n ss_idxs = {}\n def _fetch(node, ss): \n for c, nn in node.items():\n if c == \"*\":\n ss_idxs[ss] = node[c]\n else:\n _fetch(nn, f\"{ss}{c}\")\n _fetch(trie_node, \"\")\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]","memory":"44778"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = {}\n for i,w in enumerate(words):\n node = trie\n for letter in w[::-1]:\n node = node.setdefault(letter, {})\n node['$'] = i\n ans = []\n\n def gen(node, string):\n ans = set()\n if '$' in node and string == string[::-1]: ans.add(node['$'])\n for letter in node:\n if letter != '$':\n ans |= gen(node[letter], string + letter)\n return ans\n\n for i,w in enumerate(words):\n node = trie\n k = len(w)\n idx = 0\n while idx < k:\n letter = w[idx]\n if '$' in node:\n if w[idx:] == w[idx:][::-1] and i != node['$']:\n ans.append([i, node['$']])\n if letter in node:\n node = node[letter]\n idx += 1\n else: break\n if idx == k:\n # generate all subsequent strs\n candidates = gen(node, \"\")\n for j in candidates:\n if i != j: ans.append([i,j])\n return ans","memory":"48596"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n trie = {}\n\n for i in range(len(words)):\n node = trie \n for le in words[i][::-1]:\n if le not in node:\n node[le] = {}\n node = node[le]\n node['end'] = i\n \n def checkpal(word):\n i = 0 \n j = len(word)-1\n while i < j:\n if word[i] != word[j]:\n return False \n else:\n i += 1\n j -= 1\n return True\n \n\n def backtrack(node, curr):\n result = []\n if 'end' in node:\n if checkpal(curr):\n result.append(node['end'])\n \n for n in node:\n if n != 'end':\n result += backtrack(node[n], curr+n)\n\n return result\n \n \n ans = []\n\n for i in range(len(words)):\n node = trie\n valid = True\n for j in range(len(words[i])):\n if 'end' in node and checkpal(words[i][j::]):\n ans.append([i, node['end']])\n\n if words[i][j] not in node:\n valid = False\n break\n else:\n node = node[words[i][j]]\n\n\n if valid:\n for cand in backtrack(node, ''):\n if i != cand:\n ans.append([i, cand])\n\n \n \n return ans\n ","memory":"52413"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n trie = {}\n\n for i in range(len(words)):\n node = trie \n for le in words[i][::-1]:\n if le not in node:\n node[le] = {}\n node = node[le]\n node['end'] = i\n \n def checkpal(word):\n i = 0 \n j = len(word)-1\n while i < j:\n if word[i] != word[j]:\n return False \n else:\n i += 1\n j -= 1\n return True\n \n\n def backtrack(node, curr):\n result = []\n if 'end' in node:\n if checkpal(curr):\n result.append(node['end'])\n \n for n in node:\n if n != 'end':\n result += backtrack(node[n], curr+n)\n\n return result\n \n \n ans = []\n\n for i in range(len(words)):\n node = trie\n valid = True\n for j in range(len(words[i])):\n if 'end' in node and checkpal(words[i][j::]):\n ans.append([i, node['end']])\n\n if words[i][j] not in node:\n valid = False\n break\n else:\n node = node[words[i][j]]\n\n if valid:\n for cand in backtrack(node, ''):\n if i != cand:\n ans.append([i, cand]) \n \n return ans\n ","memory":"52413"},{"code":"from typing import List\n\n\nclass Trie:\n\n def __init__(self):\n self.trie = {}\n\n def insert(self, word, index):\n base_trie = self.trie\n for c in word:\n if c in base_trie:\n base_trie = base_trie[c]\n else:\n base_trie[c] = {}\n base_trie = base_trie[c]\n\n base_trie[\"index\"] = index\n base_trie[\"is_word\"] = True\n\n def has_word(self, word):\n base_trie = self.trie\n for c in word:\n if c in base_trie:\n base_trie = base_trie[c]\n else:\n return False, None\n\n return base_trie.get(\"is_word\", False), base_trie.get(\"index\")\n\n def get_prefix(self, prefix):\n base_trie = self.trie\n for c in prefix:\n if c in base_trie:\n base_trie = base_trie[c]\n else:\n return None\n\n return base_trie\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n # insert every word into trie\n for k, word in enumerate(words):\n trie.insert(word, k)\n\n ret = []\n for k, word in enumerate(words):\n if word == \"\":\n continue\n\n # exact match of reverse\n # i.e abcd -> dbca\n word_rev = word[::-1]\n has_word, idx = trie.has_word(word_rev)\n if has_word and idx != k:\n ret.append([idx, k])\n\n word_len = len(word)\n # palindrome prefix + suffix\n for i in range(1, word_len):\n prefix = word[:i]\n suffix = word[i:]\n prefix_rev = prefix[::-1]\n if prefix == prefix_rev:\n has_word, idx = trie.has_word(suffix[::-1])\n if has_word:\n # print(idx, k)\n ret.append([idx, k])\n\n # prefix + palindrome suffix\n for i in range(word_len-1, 0, -1):\n suffix = word[i:]\n suffix_rev = suffix[::-1]\n prefix = word[:i]\n if suffix == suffix_rev:\n has_word, idx = trie.has_word(prefix[::-1])\n if has_word:\n ret.append([k, idx])\n\n # word is palindrome\n if word == word_rev:\n has_word, idx = trie.has_word(\"\")\n # print(word, k, idx)\n if has_word:\n ret.append([k, idx])\n ret.append([idx, k])\n\n return ret","memory":"56231"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ans = []\n trie = Trie(words)\n for i, word in enumerate(words):\n trie.insert(word, i)\n for i in range(len(words)):\n candidates = trie.search(i)\n for candidate in candidates:\n ans.append([candidate, i])\n return ans\n \n\nclass Trie:\n def __init__(self, words):\n self.root = TrieNode()\n self.words = words\n\n def insert(self, word, index=-1):\n node = self.root\n for c in word:\n if c not in node.children:\n node.children[c] = TrieNode()\n node = node.children[c]\n node.index = index\n\n def isPalindrome(self, word, i, j):\n if j < 0:\n j = len(word) + j\n while i < j:\n if word[i] != word[j]:\n return False\n i += 1\n j -= 1\n return True\n\n def search(self, wordIndex):\n word = self.words[wordIndex]\n if not word:\n return [i for i in range(len(self.words)) if i != wordIndex and self.isPair(i, wordIndex)]\n node = self.root\n i = -1\n candidates = []\n while i >= -len(word):\n c = word[i]\n if c not in node.children and node.index == -1:\n break\n if node.index >= 0:\n candidates.append(node.index)\n if c in node.children:\n node = node.children[c]\n i -= 1\n else:\n break\n if i<-len(word):\n candidates += node.getRest()\n return [candidate for candidate in candidates if self.isPair(candidate, wordIndex)]\n\n def isPair(self, candidate, wordIndex):\n if candidate==wordIndex:\n return False\n word1 = self.words[candidate]\n word2 = self.words[wordIndex]\n if len(word1)>len(word2):\n return self.isPalindrome(word1, len(word2), -1)\n elif len(word1)<len(word2):\n return self.isPalindrome(word2, 0, -len(word1)-1)\n else:\n return True\n\n\nclass TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1\n\n def getRest(self):\n def helper(node, ans):\n if node.index >= 0:\n ans.append(node.index)\n for child in node.children.values():\n helper(child, ans)\n ans = []\n helper(self, ans)\n return ans\n","memory":"60048"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ans = []\n trie = Trie(words)\n for i, word in enumerate(words):\n trie.insert(word, i)\n for i in range(len(words)):\n candidates = trie.search(i)\n print(i, candidates)\n for candidate in candidates:\n ans.append([candidate, i])\n return ans\n \n\nclass Trie:\n def __init__(self, words):\n self.root = TrieNode()\n self.words = words\n\n def insert(self, word, index=-1):\n node = self.root\n for c in word:\n if c not in node.children:\n node.children[c] = TrieNode()\n node = node.children[c]\n node.index = index\n\n def isPalindrome(self, word, i, j):\n if j < 0:\n j = len(word) + j\n while i < j:\n if word[i] != word[j]:\n return False\n i += 1\n j -= 1\n return True\n\n def search(self, wordIndex):\n word = self.words[wordIndex]\n if not word:\n return [i for i in range(len(self.words)) if i != wordIndex and self.isPair(i, wordIndex)]\n node = self.root\n i = -1\n candidates = []\n while i >= -len(word):\n c = word[i]\n if c not in node.children and node.index == -1:\n break\n if node.index >= 0:\n candidates.append(node.index)\n if c in node.children:\n node = node.children[c]\n i -= 1\n else:\n break\n if i<-len(word):\n candidates += node.getRest()\n return [candidate for candidate in candidates if self.isPair(candidate, wordIndex)]\n\n def isPair(self, candidate, wordIndex):\n if candidate==wordIndex:\n return False\n word1 = self.words[candidate]\n word2 = self.words[wordIndex]\n if len(word1)>len(word2):\n return self.isPalindrome(word1, len(word2), -1)\n elif len(word1)<len(word2):\n return self.isPalindrome(word2, 0, -len(word1)-1)\n else:\n return True\n\n\nclass TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1\n\n def getRest(self):\n def helper(node, ans):\n if node.index >= 0:\n ans.append(node.index)\n for child in node.children.values():\n helper(child, ans)\n ans = []\n helper(self, ans)\n return ans\n","memory":"63866"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n ans = []\n trie = Trie(words)\n for i, word in enumerate(words):\n trie.insert(word, i)\n for i in range(len(words)):\n candidates = trie.search(i)\n print(i, candidates)\n for candidate in candidates:\n ans.append([candidate, i])\n return ans\n \n\nclass Trie:\n def __init__(self, words):\n self.root = TrieNode()\n self.words = words\n\n def insert(self, word, index=-1):\n node = self.root\n for c in word:\n if c not in node.children:\n node.children[c] = TrieNode()\n node = node.children[c]\n node.index = index\n\n def isPalindrome(self, word, i, j):\n if j < 0:\n j = len(word) + j\n while i < j:\n if word[i] != word[j]:\n return False\n i += 1\n j -= 1\n return True\n\n def search(self, wordIndex):\n word = self.words[wordIndex]\n if not word:\n return [i for i in range(len(self.words)) if i != wordIndex and self.isPair(i, wordIndex)]\n node = self.root\n i = -1\n candidates = []\n while i >= -len(word):\n c = word[i]\n if c not in node.children and node.index == -1:\n break\n if node.index >= 0:\n candidates.append(node.index)\n if c in node.children:\n node = node.children[c]\n i -= 1\n else:\n break\n if i<-len(word):\n candidates += node.getRest()\n return [candidate for candidate in candidates if self.isPair(candidate, wordIndex)]\n\n def isPair(self, candidate, wordIndex):\n if candidate==wordIndex:\n return False\n word1 = self.words[candidate]\n word2 = self.words[wordIndex]\n if len(word1)>len(word2):\n return self.isPalindrome(word1, len(word2), -1)\n elif len(word1)<len(word2):\n return self.isPalindrome(word2, 0, -len(word1)-1)\n else:\n return True\n\n\nclass TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1\n\n def getRest(self):\n def helper(node, ans):\n if node.index >= 0:\n ans.append(node.index)\n for child in node.children.values():\n helper(child, ans)\n ans = []\n helper(self, ans)\n return ans\n","memory":"67683"},{"code":"'''\npalindrome pair: pair of integers (i, j)\n i != j\n words[i] + words[j] is a palindrome\n\nReturn an array of all palindrome pairs.\n\nBrute force: O(n^2 * k), for word length k.\n\nAim is to get ~O(nk).\n\nMy first intuition is... perhaps we can just do this with a dictionary lookup?\n\nIndex each word both directly and in reverse\n cat --> [3]\n tac --> [3]\n\nThen for cat, we could have the following palindromes...\n cattac # easy case\n catac # also easy\n catxxxtac # hard case due to asymmetry.\n\nOk, but I think we can handle all of these:\n- Case 1: exact reflection\n - Just search for the word's reflection in the index.\n- Case 2: len(prefix) > len(suffix)\n - This means that the end of the prefix is a palindrome.\n - Partition the prefix into [A] + [B], where B is a palindrome, and search for the reflection of A.\n- Case 3: len(prefix) < len(suffix)\n - Reverse both prefix and suffix\n [cat] + [xxxtac] --> [catxxx] + [tac]\n - Now defer to case 2.\n - Since we're looking for palindromes, we don't even need to do a second reversal.\n\nHow do we do this efficiently?\n- Dict lookup for suffix: fine, O(k) for a length-k string.\n- Checking multiple prefixes, where each suffix is k\n - Need: linear-time algorithm to find all palindromes in a string.\n >> this gives us all the prefixes of a string for which we need to find reflections\n trie to do the lookup for reflections in linear time\n catxxx\n do you have xxxtac?\n xxtac?\n xtac?\n tac?\n So we need to index the strings in reverse. Should be fine.\n\nHow do we find all palindromes of a string in linear time?\nObviously there is the O(n^2) solution.\n\nManacher's algorithm comes to mind... IIRC the idea is that you keep track of the righthand edge of your palindrome as you scan across... or something like that...\n\nI'm not going to write the entire linear-time algorithm here. It would take too long.\n\nInstead, I am going to write the key pieces *minus* the linear-time palindrome identification\n'''\n\ndef is_palindrome(word, i: int, j: int) -> bool:\n while i < j:\n if word[i] != word[j]:\n return False\n i += 1\n j -= 1\n return True\n\ndef manachers_palindrome_suffixes(s: str):\n # Preprocess the string to handle even-length palindromes\n t = '#'.join(f'^{s}$')\n n = len(t)\n P = [0] * n # Array to store the radius of palindromes\n C = R = 0 # C is the center, R is the rightmost boundary\n\n for i in range(1, n - 1):\n mirror = 2 * C - i # Mirror of i with respect to C\n\n if i < R:\n P[i] = min(R - i, P[mirror])\n\n # Try to expand the palindrome centered at i\n while t[i + P[i] + 1] == t[i - P[i] - 1]:\n P[i] += 1\n\n # If the palindrome expanded past R, adjust the center and right boundary\n if i + P[i] > R:\n C = i\n R = i + P[i]\n\n # Now, gather palindromic suffix starts\n palindromic_suffix_starts = []\n m = len(s)\n\n # We want the palindromes that end at the last character of the original string\n for i in range(n - 2, 0, -1):\n if i + P[i] == n - 2: # Check if the palindrome reaches the end of the original string\n start_idx = (i - P[i]) // 2\n palindromic_suffix_starts.append(start_idx)\n\n print(s, palindromic_suffix_starts)\n return palindromic_suffix_starts[::-1]\n\n'''\nReturns a list of indices such that the suffix of word[:i] is a palindrome\n\ncatt --> [2, 3]\n'''\ndef compute_palindrome_suffixes(word: str) -> list[int]:\n return manachers_palindrome_suffixes(word)\n res = []\n for i in range(len(word)):\n if is_palindrome(word, i, len(word) - 1):\n res.append(i)\n res.append(len(word))\n return res\n\nclass Trie():\n\n def __init__(self):\n self.idx = -1\n self.children = {}\n \n def add_word(self, word: str, idx: int) -> None:\n t = self\n for ch in word:\n if ch not in t.children:\n t.children[ch] = Trie()\n t = t.children[ch]\n t.idx = idx\n \n\ndef palindrome_pairs(words: list[str]) -> list[list[int]]:\n # indexing\n t = Trie()\n for word_idx, word in enumerate(words):\n t.add_word(word[::-1], word_idx)\n\n # search\n res = []\n for word_idx, word in enumerate(words):\n palindrome_suffixes = compute_palindrome_suffixes(word)\n\n word_ptr = 0\n trie_ptr = t\n for i in palindrome_suffixes:\n # suppose the word is catxxx\n # we want to know if xxxtac, xxtac, xtac, or tac are in the corpus\n # therefore we index all the words in reverse\n # and we search for prefixes normally... cat (for tac), catx (for xtac), etc.\n while word_ptr < i:\n c = word[word_ptr]\n if c not in trie_ptr.children:\n break\n trie_ptr = trie_ptr.children[c]\n word_ptr += 1\n \n if word_ptr != i:\n # hopeless\n break\n \n if trie_ptr.idx >= 0 and trie_ptr.idx != word_idx:\n res.append((word_idx, trie_ptr.idx))\n \n return res\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n forward = palindrome_pairs(words)\n backward = palindrome_pairs([word[::-1] for word in words])\n backward = [(j,i) for i, j in backward]\n return list(set(forward + backward))","memory":"71501"},{"code":"class Solution:\n def palindromePairs(self, words):\n trie = {}\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n if \"palindrome_suffixes\" not in current_level:\n current_level[\"palindrome_suffixes\"] = []\n\n current_level[\"palindrome_suffixes\"].append(i)\n\n if c not in current_level:\n current_level[c] = {}\n # Move down the trie.\n current_level = current_level[c]\n current_level[\"ending_word\"] = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if (\n current_level.get(\"ending_word\") is not None\n and current_level[\"ending_word\"] != -1\n ):\n if (word[j:] == word[j:][::-1]): # Is the word the same as its reverse?\n solutions.append([i, current_level[\"ending_word\"]])\n\n if c not in current_level:\n break\n current_level = current_level[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if (\n current_level.get(\"ending_word\") is not None\n and current_level[\"ending_word\"] != -1\n and current_level[\"ending_word\"] != i\n ):\n solutions.append([i, current_level[\"ending_word\"]])\n # Check for case 2.\n for j in current_level.get(\"palindrome_suffixes\", []):\n solutions.append([i, j])\n return solutions\n","memory":"75318"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n trie = {}\n ans = []\n \n for i,word in enumerate(words):\n word = word[::-1]\n temp = trie\n for j,c in enumerate(word):\n \n if(word[j:] == word[j:][::-1]):\n if(\"pal\" not in temp):\n temp[\"pal\"] = []\n temp[\"pal\"].append(i)\n if(c not in temp):\n temp[c] = {}\n temp = temp[c]\n temp[None] = i\n \n for i,word in enumerate(words):\n temp = trie\n for j,c in enumerate(word):\n \n if(None in temp):\n if(word[j:] == word[j:][::-1]):\n ans.append([i,temp[None]])\n if(c not in temp):\n break\n temp = temp[c]\n \n else:\n if(None in temp and i != temp[None]):\n ans.append([i,temp[None]])\n if(\"pal\" in temp):\n for j in temp[\"pal\"]:\n ans.append([i,j])\n \n return ans","memory":"79136"},{"code":"class Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = {}\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n if \"palindrome_suffixes\" not in current_level:\n current_level[\"palindrome_suffixes\"] = []\n\n current_level[\"palindrome_suffixes\"].append(i)\n\n if c not in current_level:\n current_level[c] = {}\n # Move down the trie.\n current_level = current_level[c]\n current_level[\"ending_word\"] = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.get(\"ending_word\") is not None and current_level[\"ending_word\"] != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level[\"ending_word\"]])\n if c not in current_level:\n break\n current_level = current_level[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.get(\"ending_word\") is not None and current_level[\"ending_word\"] != -1 and current_level[\"ending_word\"] != i:\n solutions.append([i, current_level[\"ending_word\"]])\n # Check for case 2.\n for j in current_level.get(\"palindrome_suffixes\", []):\n solutions.append([i, j])\n return solutions","memory":"82953"},{"code":"class Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = {}\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n if \"palindrome_suffixes\" not in current_level:\n current_level[\"palindrome_suffixes\"] = []\n\n current_level[\"palindrome_suffixes\"].append(i)\n\n if c not in current_level:\n current_level[c] = {}\n # Move down the trie.\n current_level = current_level[c]\n current_level[\"ending_word\"] = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.get(\"ending_word\") is not None and current_level[\"ending_word\"] != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level[\"ending_word\"]])\n if c not in current_level:\n break\n current_level = current_level[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.get(\"ending_word\") is not None and current_level[\"ending_word\"] != -1 and current_level[\"ending_word\"] != i:\n solutions.append([i, current_level[\"ending_word\"]])\n # Check for case 2.\n for j in current_level.get(\"palindrome_suffixes\", []):\n solutions.append([i, j])\n return solutions","memory":"82953"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n # self.answer = set()\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n # self.answer.add((idx_a, idx_b))\n self.answer.append([idx_a, idx_b])\n\n # def search_trie(self, word: str, ends: set[int], word_idx: int):\n # front, cur = 0, self.head\n # while front < len(word):\n # if front in ends: # part end has to match with true end\n # self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n # if word[front] in cur:\n # cur = cur[word[front]]\n # else:\n # break\n # front += 1\n # # true end can match with either\n # if front == len(word):\n # self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n # self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n # for word_idx, word in enumerate(words):\n # ends = set()\n # for front in range(len(word)+1):\n # if self.is_palindrome(word, front, len(word) - 1):\n # ends.add(front)\n # self.search_trie(word, ends, word_idx)\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"86771"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n return\n front += 1\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"86771"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"90588"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back and word[front] == word[back]:\n front += 1\n back -= 1\n if front >= back:\n return True\n return False\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"94406"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n return\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"94406"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back and word[front] == word[back]:\n front += 1\n back -= 1\n if front >= back:\n return True\n return False\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"98223"},{"code":"class Solution:\n def __init__(self):\n self.head = {}\n self.answer = []\n\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\n while front < back:\n if word[front] != word[back]: return False\n front += 1\n back -= 1\n return True\n \n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\n if end_type not in node:\n node[end_type] = []\n node[end_type].append(word_idx)\n\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\n front, cur = len(word), self.head\n while front > 0:\n if front in ends:\n self.add_end_to_trie(cur, \"part_end\", word_idx)\n front -= 1\n if word[front] not in cur:\n cur[word[front]] = {}\n cur = cur[word[front]]\n self.add_end_to_trie(cur, \"true_end\", word_idx)\n\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\n for idx_b in b_indices:\n if idx_a != idx_b:\n self.answer.append([idx_a, idx_b])\n\n def search_trie(self, word: str, word_idx: int):\n front, cur = 0, self.head\n while front < len(word):\n # part end has to match with true end\n if \"true_end\" in cur and self.is_palindrome(word, front, len(word) - 1):\n self.add_to_answer(word_idx, cur[\"true_end\"])\n if word[front] in cur:\n cur = cur[word[front]]\n else:\n break\n front += 1\n if front == len(word):\n self.add_to_answer(word_idx, cur.get(\"true_end\", []))\n self.add_to_answer(word_idx, cur.get(\"part_end\", []))\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # create trie\n for word_idx, word in enumerate(words):\n ends = set()\n for back in range(len(word)+1):\n if self.is_palindrome(word, 0, back-1):\n ends.add(back)\n self.add_ends_to_trie(word, ends, word_idx)\n # add pairs to answer\n for word_idx, word in enumerate(words):\n self.search_trie(word, word_idx)\n return self.answer\n","memory":"102041"},{"code":"class Trie: \n def __init__(self): \n self.root = {}\n \n def insert(self, word, k): \n node = self.root \n for i, c in enumerate(word): \n if word[i:] == word[i:][::-1]: node.setdefault(\"val\", []).append(k)\n node = node.setdefault(c, {})\n node.setdefault(\"val\", []).append(k)\n node.setdefault(\"end\", []).append(k)\n \n def search(self, word): \n ans = []\n node = self.root\n for i, c in enumerate(word): \n if word[i:] == word[i:][::-1]: ans.extend(node.get(\"end\", []))\n if c not in node: break \n node = node[c]\n else: ans += node.get(\"val\", [])\n return ans \n \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n for i, word in enumerate(words): \n trie.insert(word, i)\n \n ans = set()\n for i, word in enumerate(words): \n val = trie.search(word[::-1])\n for ii in val: \n if ii != i: ans.add((ii, i))\n return ans ","memory":"105858"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n #\n class Prefix:\n def __init__(self):\n self.trie = {}\n\n def add_word(self, word, k):\n curr = self.trie\n for i in range(len(word)):\n c = word[i]\n if c not in curr:\n curr[c] = {}\n curr = curr[c]\n curr.setdefault('+', []).append(k)\n curr['*'] = k\n if '+' in curr:\n curr['+'].pop()\n return\n\n def find_prefix(self, suffix, j):\n curr = self.trie\n extra_j = []\n for i in reversed(range(len(suffix))):\n c = suffix[i]\n if c not in curr:\n return [], extra_j\n curr = curr[c]\n if curr.get('*', j) != j:\n extra_j.append(curr['*'])\n extra_i = curr.get('+', [])\n return extra_i, extra_j\n\n prefix = Prefix()\n for i in range(len(words)):\n prefix.add_word(words[i], i)\n\n is_palindrome = lambda x: x[0] == x[-1] and is_palindrome(x[1:-1]) if x else True\n\n rs = []\n for j in range(len(words)):\n if words[j] == '':\n for i in range(len(words)):\n if i != j and is_palindrome(words[i]):\n rs.append([i, j])\n rs.append([j, i])\n continue\n extra_i, extra_j = prefix.find_prefix(words[j], j)\n # print(extra_i, extra_j)\n for i in extra_i:\n if i != j:\n extra = words[i][len(words[j]):]\n if is_palindrome(extra):\n rs.append([i, j])\n\n for i in extra_j:\n if i != j:\n extra = words[j][: len(words[j])-len(words[i])]\n if is_palindrome(extra):\n rs.append([i, j])\n\n return rs\n\n\n ","memory":"109676"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n #\n # a : [bcd, b: [cd, c: [d : 0]]]\n class Prefix:\n def __init__(self):\n self.trie = {}\n\n def add_word(self, word, k):\n curr = self.trie\n for i in range(len(word)):\n c = word[i]\n if c not in curr:\n curr[c] = {}\n curr = curr[c]\n curr.setdefault('+', []).append(k)\n curr['*'] = k\n if '+' in curr:\n curr['+'].pop()\n return\n\n def find_prefix(self, suffix, j):\n curr = self.trie\n extra_j = []\n for i in reversed(range(len(suffix))):\n # print('-', extra_j)\n c = suffix[i]\n # print('-', c)\n if c not in curr:\n return [], extra_j\n curr = curr[c]\n if curr.get('*', j) != j:\n extra_j.append(curr['*'])\n # print(extra_j)\n # print( suffix[:i])\n extra_i = curr.get('+', [])\n return extra_i, extra_j\n\n prefix = Prefix()\n for i in range(len(words)):\n prefix.add_word(words[i], i)\n \n # print(prefix.trie)\n # print(prefix.find_prefix('abcd', 0))\n # print(prefix.find_prefix('lls', 2))\n # print(prefix.find_prefix('tab', 1))\n # print(prefix.find_prefix('a', 0))\n\n # return []\n\n is_palindrome = lambda x: x[0] == x[-1] and is_palindrome(x[1:-1]) if x else True\n\n rs = []\n for j in range(len(words)):\n if words[j] == '':\n for i in range(len(words)):\n if i != j and is_palindrome(words[i]):\n rs.append([i, j])\n rs.append([j, i])\n continue\n extra_i, extra_j = prefix.find_prefix(words[j], j)\n print(extra_i, extra_j)\n for i in extra_i:\n if i != j:\n extra = words[i][len(words[j]):]\n if is_palindrome(extra):\n rs.append([i, j])\n\n for i in extra_j:\n if i != j:\n extra = words[j][: len(words[j])-len(words[i])]\n if is_palindrome(extra):\n rs.append([i, j])\n # if i!=j and is_palindrome(mid):\n # rs.append([i, j])\n\n # print(rs)\n\n return rs\n # for i in match_sz:\n # sz = match_sz[i]\n # middle = words[i][sz:] + words[j][:len(words[j]) - sz]\n # print(words[i], words[j], middle)\n # if is_palindrome(middle):\n # rs.append([i, j])\n\n ","memory":"113493"},{"code":"class Node:\n def __init__(self):\n self.adj = None\n self.isWord = False\n self.idx = -1\nclass Trie:\n def __init__(self):\n self.root = Node()\n def addWord(self, word, idx):\n def dfs(word, node, idx):\n if len(word) == 0:\n node.isWord = True\n node.idx = idx\n return\n if node.adj == None:\n node.adj = dict()\n if word[0] in node.adj:\n dfs(word[1:], node.adj[word[0]], idx)\n else:\n newNode = Node()\n node.adj[word[0]] = newNode\n dfs(word[1:], newNode, idx)\n dfs(word, self.root, idx)\n def prefix(self, word):\n ans = list()\n def isPalindrome(cur):\n return cur == cur[::-1]\n def getIdxs(node):\n ans = []\n def ddfs(node, cur):\n if node == None:\n return\n if node.isWord:\n if (isPalindrome(cur)):\n ans.append(node.idx)\n if node.adj != None:\n for k in node.adj:\n ddfs(node.adj[k], cur + k)\n ddfs(node, \"\")\n return ans\n\n def dfs(word, node):\n if len(word) == 0:\n kk = getIdxs(node)\n for i in kk:\n ans.append(i)\n return\n if node.isWord:\n if isPalindrome(word):\n ans.append(node.idx)\n if node.adj == None:\n return False\n if word[0] in node.adj:\n dfs(word[1:], node.adj[word[0]])\n return False\n \n dfs(word, self.root)\n return ans\n \n \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n ans = []\n N = len(words)\n for i in range(N):\n trie.addWord(words[i], i)\n for i in range(N):\n idxs = trie.prefix(words[i][::-1])\n for _id in idxs:\n if _id != i:\n ans.append([_id, i])\n return ans\n\n\n ","memory":"117311"},{"code":"class Node:\n def __init__(self):\n self.adj = None\n self.isWord = False\n self.idx = -1\nclass Trie:\n def __init__(self):\n self.root = Node()\n def addWord(self, word, idx):\n def dfs(word, node, idx):\n if len(word) == 0:\n node.isWord = True\n node.idx = idx\n return\n if node.adj == None:\n node.adj = dict()\n if word[0] in node.adj:\n dfs(word[1:], node.adj[word[0]], idx)\n else:\n newNode = Node()\n node.adj[word[0]] = newNode\n dfs(word[1:], newNode, idx)\n dfs(word, self.root, idx)\n def prefix(self, word):\n ans = list()\n def isPalindrome(cur):\n return cur == cur[::-1]\n def getIdxs(node):\n ans = []\n def ddfs(node, cur):\n if node == None:\n return\n if node.isWord:\n if (isPalindrome(cur)):\n ans.append(node.idx)\n if node.adj != None:\n for k in node.adj:\n ddfs(node.adj[k], cur + k)\n ddfs(node, \"\")\n return ans\n\n def dfs(word, node):\n if len(word) == 0:\n kk = getIdxs(node)\n for i in kk:\n ans.append(i)\n return\n if node.isWord:\n if isPalindrome(word):\n ans.append(node.idx)\n if node.adj == None:\n return False\n if word[0] in node.adj:\n dfs(word[1:], node.adj[word[0]])\n return False\n \n dfs(word, self.root)\n return ans\n \n \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n ans = []\n N = len(words)\n for i in range(N):\n trie.addWord(words[i], i)\n for i in range(N):\n idxs = trie.prefix(words[i][::-1])\n for _id in idxs:\n if _id != i:\n ans.append([_id, i])\n return ans","memory":"117311"},{"code":"class TrieNode:\n def __init__(self, is_word=False, word_index=-1):\n self.is_word = is_word\n self.word_index = word_index\n self.children = {}\n\nclass Trie:\n\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, word: str, index: int) -> None:\n cur_node = self.root\n\n for i in range(len(word)):\n if word[i] not in cur_node.children:\n cur_node.children[word[i]] = TrieNode()\n cur_node = cur_node.children[word[i]]\n \n cur_node.word_index = index\n cur_node.is_word = True\n\n # def search(self, word: str) -> Optional[TrieNode]:\n # cur_node = self.root\n\n # for i in range(len(word)):\n # if word[i] not in cur_node.children:\n # return None\n # cur_node = cur_node.children[word[i]]\n \n # if cur_node and cur_node.is_word:\n # return cur_node\n # return None\n\n # def startsWith(self, prefix: str) -> Optional[TrieNode]:\n # cur_node = self.root\n\n # for i in range(len(prefix)):\n # if word[i] not in cur_node.children:\n # return None\n # cur_node = cur_node.children[word[i]]\n \n # return cur_node\n\nclass Solution:\n def isSameReverse(self, word: str) -> bool:\n return word == word[::-1]\n\n def dfs(self, cur_node: TrieNode, index: int, cur_word: str) -> List[List[int]]:\n pairs = []\n\n if cur_node.is_word and index != cur_node.word_index and self.isSameReverse(cur_word):\n pairs.append([index, cur_node.word_index])\n\n for key in cur_node.children.keys():\n pairs += self.dfs(cur_node.children[key], index, cur_word + key)\n \n return pairs\n\n def findPairs(self, trie: Trie, word: str, index: int) -> List[List[int]]:\n pairs = []\n cur_node = trie.root\n\n for i in range(len(word)):\n if cur_node.is_word and index != cur_node.word_index and self.isSameReverse(word[i:]):\n pairs.append([index, cur_node.word_index])\n if word[i] not in cur_node.children:\n return pairs\n cur_node = cur_node.children[word[i]]\n\n pairs += self.dfs(cur_node, index, '')\n return pairs\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n pairs = []\n\n for i, word in enumerate(words):\n trie.insert(word[::-1], i)\n \n for i, word in enumerate(words):\n pairs += self.findPairs(trie, word, i)\n\n return pairs\n","memory":"121128"},{"code":"class TrieNode:\n def __init__(self, data=None):\n self.data = data\n self.children = {}\n self.index = -1\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, idx, word):\n curr = self.root\n for ch in list(word):\n if ch not in curr.children:\n curr.children[ch] = TrieNode(ch)\n curr = curr.children[ch]\n curr.index = idx\n\n def isPalindrome(self, s, l, h):\n while l <= h:\n if s[l] != s[h]:\n return False\n l += 1\n h -= 1\n return True\n\n def searchCase2(self, curr, temp, s):\n if curr.index != -1:\n if self.isPalindrome(s, 0, len(s)-1):\n temp.append(curr.index)\n\n for ch, child in curr.children.items():\n self.searchCase2(child, temp, s+ch)\n\n def search(self, word, temp):\n curr = self.root\n \n # case 1: when a prefix of string word, exactly matched with a word in trie.\n for i in range(len(word)):\n ch = word[i]\n if curr.index != -1:\n # check rest of the word is palindrome.\n if self.isPalindrome(word, i, len(word)-1):\n temp.append(curr.index)\n\n if ch in curr.children:\n curr = curr.children[ch]\n else:\n return\n\n # case 2: search word is a prefix of a word in the trie.\n # check remaining subtrees in the trie for the palindrome.\n\n self.searchCase2(curr, temp, \"\")\n\n\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n # insert all words its reversed order to check the palindrome.\n for i in range(len(words)):\n self.insert(i, words[i][::-1])\n\n ans = []\n # find palidromic pairs of each word.\n for i in range(len(words)):\n myPalindrome = []\n self.search(words[i], myPalindrome)\n\n for idx in myPalindrome:\n if idx != i: \n ans.append([i, idx])\n\n return ans","memory":"124946"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n for index, word in enumerate(words):\n trie.insertWord(word[::-1], index)\n\n ans = []\n for index, word in enumerate(words):\n node = trie.root\n\n charIndex = 0\n while charIndex < len(word):\n char = word[charIndex]\n remainingStr = word[charIndex:]\n if (\n node.isEnd\n and node.index != index\n and remainingStr == remainingStr[::-1]\n ):\n ans.append([index, node.index])\n if char not in node.children:\n break\n node = node.children[char]\n charIndex += 1\n # print(index, word, charIndex, node.index)\n\n if charIndex == len(word):\n\n def dfs(node, currStr, ans, index):\n\n if node.isEnd and node.index != index and currStr == currStr[::-1]:\n ans.append([index, node.index])\n\n if not node.children:\n return\n\n for child in node.children:\n dfs(node.children[child], currStr + child, ans, index)\n\n dfs(node, \"\", ans, index)\n\n if (\n \"\" in trie.root.children\n and trie.root.children[\"\"].index != index\n and word == word[::-1]\n ):\n ans.append([index, trie.root.children[\"\"].index])\n\n return ans\n\n\nclass TrieNode:\n def __init__(self):\n self.children = {}\n self.isEnd = False\n self.index = -1\n\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insertWord(self, word, index):\n node = self.root\n\n if word == \"\":\n node.children[word] = TrieNode()\n node = node.children[word]\n\n for char in word:\n if not char in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.isEnd = True\n node.index = index\n","memory":"128763"},{"code":"import queue\n\ndef is_pair(w1, w2):\n concat = w1 + w2\n return concat == concat[::-1]\n\nclass TrieNode:\n def __init__(self, key=None, val=None):\n self.key = key\n self.val = val\n self.children = {}\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode(\"\", None)\n \n def insert(self, key, word):\n curr = self.root\n if word == \"\":\n curr.children[\"\"] = TrieNode(key=key, val=\"\")\n for i in range(len(word)-1, -1, -1):\n if word[i] not in curr.children:\n curr.children[word[i]] = TrieNode(key=None, val=None)\n if i == 0:\n curr.children[word[i]].key = key\n curr.children[word[i]].val = word\n curr = curr.children[word[i]]\n \n def search_right(self, key, word):\n prefixes = []\n i, curr = 0, self.root\n if \"\" in curr.children:\n prefixes.append(curr.children[\"\"])\n while i < len(word):\n if word[i] not in curr.children:\n break\n if curr.children[word[i]].val is not None:\n prefixes.append(curr.children[word[i]])\n curr = curr.children[word[i]]\n i += 1\n \n if i == len(word):\n prefixes.extend(self.words(curr))\n\n pairs = set()\n for prefix in prefixes:\n if is_pair(word, prefix.val) and key != prefix.key:\n pairs.add((key, prefix.key))\n \n return pairs\n\n def words(self, root):\n if not root:\n return []\n\n result = []\n q = queue.Queue()\n q.put(root)\n while not q.empty():\n curr = q.get()\n if len(curr.children) == 0:\n continue\n for k, v in curr.children.items():\n if v is not None and v.val is not None:\n result.append(v)\n q.put(curr.children[k])\n \n return result\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n if len(words) == 0:\n return []\n\n trie = Trie()\n for i, word in enumerate(words):\n trie.insert(i, word)\n\n pairs = set()\n for i, word in enumerate(words):\n for pair in trie.search_right(i, word):\n pairs.add(pair)\n \n return list(map(list, pairs))\n ","memory":"132581"},{"code":"class TrieNode: \n def __init__(self):\n self.children = defaultdict(TrieNode)\n self.is_end = False\n self.index = -1 \n \n def addWord(self, word, index):\n node = self\n for char in word:\n if char not in node.children: \n node.children[char] = TrieNode()\n node = node.children[char]\n node.is_end = True\n node.index = index\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # Trie data structure. \n # Build the Trie. \n result, root = [], TrieNode()\n for index, word in enumerate(words):\n root.addWord(word[::-1], index)\n \n # Find results/ \n for index, word in enumerate(words):\n node = root \n for i, char in enumerate(word): \n if node.is_end and self.isPalindrome(word[i:]):\n result.append([index, node.index])\n if char not in node.children:\n break\n node = node.children[char]\n # If for loop executes without breaking. \n else:\n self.check_remaining_suffixes(node, index, \"\", result)\n \n return result\n \n def check_remaining_suffixes(self, node, index, suffix, result):\n if node.is_end and index != node.index and self.isPalindrome(suffix):\n result.append([index, node.index])\n \n for char, child in node.children.items():\n self.check_remaining_suffixes(child, index, suffix + char, result)\n\n def isPalindrome(self, word):\n return word == word[::-1] \n \n\n\n\n","memory":"136398"},{"code":"class Trie:\n def __init__(self):\n _trie_init = lambda: defaultdict(_trie_init)\n self.root = _trie_init()\n\n def add_word(self, word, word_idx):\n curr = self.root\n for idx, c in enumerate(word):\n curr = curr[c]\n if 'children' not in curr:\n curr['children'] = []\n if idx < len(word) - 1 and Trie.is_palindrome(word, idx + 1, len(word) - 1):\n curr['children'].append((word_idx, word))\n curr['end'] = True\n curr['idx'] = word_idx\n\n def find_words(self, word):\n ans = []\n curr = self.root\n for idx, c in enumerate(word):\n if c not in curr:\n return ans\n curr = curr[c]\n if curr['end'] is True and Trie.is_palindrome(word, idx + 1, len(word) - 1):\n ans.append(curr['idx'])\n if 'children' in curr:\n ans.extend([word_idx for word_idx, _ in curr['children']])\n return ans\n\n @staticmethod\n def is_palindrome(word, start, end):\n while start < end:\n if word[start] != word[end]:\n return False\n start += 1\n end -= 1\n return True\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n ans = []\n\n for word_idx, word in enumerate(words):\n trie.add_word(word[::-1], word_idx)\n\n for word_idx, word in enumerate(words):\n matches = trie.find_words(word)\n for idx in matches:\n if idx == word_idx:\n continue\n ans.append([word_idx, idx])\n\n if '' in words:\n empty_idx = words.index('')\n for idx, word in enumerate(words):\n if not Trie.is_palindrome(word, 0, len(word) - 1) or idx == empty_idx:\n continue\n ans.extend([[idx, empty_idx], [empty_idx, idx]])\n\n return ans\n","memory":"140216"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = [{}, [], -1]\n for i, w in enumerate(words):\n w = w[::-1]\n node = root\n for j, c in enumerate(w):\n if w[j:] == w[j:][::-1]:\n node[1].append(i)\n if c not in node[0]:\n node[0][c] = [{}, [], -1]\n node = node[0][c]\n node[2] = i\n l = []\n for i, w in enumerate(words):\n node = root\n for j, c in enumerate(w):\n if w[j:] == w[j:][::-1] and node[2] != -1:\n l.append([i, node[2]])\n if c not in node[0]:\n break\n node = node[0][c]\n else:\n if node[2] != -1 and node[2] != i:\n l.append([i, node[2]])\n for j in node[1]:\n l.append([i, j])\n return l\n\n # l = []\n # m = {w[::-1]: i for i, w in enumerate(words)}\n # for i, w in enumerate(words):\n # if w in m and i != m[w]:\n # l.append([i, m[w]])\n # for j in range(len(w)):\n # s = w[j:]\n # rs = w[:j]\n # if s == s[::-1] and rs in m and i != m[rs]:\n # l.append([i, m[rs]])\n # p = w[:j + 1]\n # rp = w[j + 1:]\n # if p == p[::-1] and rp in m and i != m[rp]:\n # l.append([m[rp], i])\n # return l\n ","memory":"144033"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n root = [{}, [], -1]\n for i, w in enumerate(words):\n w = w[::-1]\n node = root\n for j, c in enumerate(w):\n if w[j:] == w[j:][::-1]:\n node[1].append(i)\n if c not in node[0]:\n node[0][c] = [{}, [], -1]\n node = node[0][c]\n node[2] = i\n l = []\n for i, w in enumerate(words):\n node = root\n for j, c in enumerate(w):\n if w[j:] == w[j:][::-1] and node[2] != -1:\n l.append([i, node[2]])\n if c not in node[0]:\n break\n node = node[0][c]\n else:\n if node[2] != -1 and node[2] != i:\n l.append([i, node[2]])\n for j in node[1]:\n l.append([i, j])\n return l\n\n # l = []\n # m = {w[::-1]: i for i, w in enumerate(words)}\n # for i, w in enumerate(words):\n # if w in m and i != m[w]:\n # l.append([i, m[w]])\n # for j in range(len(w)):\n # s = w[j:]\n # rs = w[:j]\n # if s == s[::-1] and rs in m and i != m[rs]:\n # l.append([i, m[rs]])\n # p = w[:j + 1]\n # rp = w[j + 1:]\n # if p == p[::-1] and rp in m and i != m[rp]:\n # l.append([m[rp], i])\n # return l\n ","memory":"151668"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n class TrieNode:\n def __init__(self):\n self.trie = {}\n self.palindromes = []\n self.index = -1\n \n def __repr__(self):\n z = f'{self.palindromes}'\n z += f', index = {self.index}'\n z += ', trie =' + repr(self.trie)\n return z\n\n def add_word(self, word, k):\n curr = self\n for i in range(len(word)):\n ch = word[i]\n if ch not in curr.trie:\n curr.trie[ch] = TrieNode()\n curr = curr.trie[ch]\n if i<len(word)-1 and word[i+1:] == word[i+1:][::-1]:\n curr.palindromes.append(k)\n curr.index = k\n \n def match_prefix(self, word, k):\n curr = self\n ans = []\n for i in reversed(range(len(word))):\n ch = word[i]\n # print(ch)\n if ch not in curr.trie:\n return ans \n curr = curr.trie[ch]\n if curr.index != -1 and curr.index != k:\n if word[:i] == word[:i][::-1]:\n ans.append([curr.index, k])\n # print(ans)\n\n for j in curr.palindromes:\n if j != k:\n ans.append([j, k])\n print(ans)\n return ans\n\n\n tobj = TrieNode()\n for k in range(len(words)):\n tobj.add_word(words[k], k)\n\n # print(repr(tobj.trie))\n rs = []\n for k in range(len(words)):\n rs += tobj.match_prefix(words[k], k)\n # print('&', words[k], k, rs)\n # print(words[k], k)\n\n if tobj.index != -1:\n j = tobj.index\n for i in range(len(words)):\n if i == j:\n continue\n if words[i] == words[i][::-1]:\n rs.append([i, j])\n rs.append([j, i])\n\n return rs\n\n\n\n ","memory":"155486"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n class TrieNode:\n def __init__(self):\n self.trie = {}\n self.palindromes = []\n self.index = -1\n \n def __repr__(self):\n z = f'{self.palindromes}'\n z += f', index = {self.index}'\n z += ', trie =' + repr(self.trie)\n return z\n\n def add_word(self, word, k):\n curr = self\n if word == word[::-1]:\n curr.palindromes.append(k)\n for i in range(len(word)):\n ch = word[i]\n if ch not in curr.trie:\n curr.trie[ch] = TrieNode()\n curr = curr.trie[ch]\n if i<len(word)-1 and word[i+1:] == word[i+1:][::-1]:\n curr.palindromes.append(k)\n curr.index = k\n \n def match_prefix(self, word, k):\n curr = self\n ans = []\n for i in reversed(range(len(word))):\n ch = word[i]\n # print(ch)\n if ch not in curr.trie:\n return ans \n curr = curr.trie[ch]\n if curr.index != -1 and curr.index != k:\n if word[:i] == word[:i][::-1]:\n ans.append([curr.index, k])\n # print(ans)\n\n for j in curr.palindromes:\n if j != k:\n ans.append([j, k])\n # print(ans)\n return ans\n\n\n tobj = TrieNode()\n for k in range(len(words)):\n tobj.add_word(words[k], k)\n\n # print(repr(tobj.trie))\n rs = []\n for k in range(len(words)):\n if words[k]:\n rs += tobj.match_prefix(words[k], k)\n # print('&', words[k], k, rs)\n # print(words[k], k)\n\n # print(rs)\n if tobj.index != -1:\n j = tobj.index\n for i in tobj.palindromes:\n if i != j:\n rs.append([i, j])\n rs.append([j, i])\n\n return rs\n\n\n\n ","memory":"159303"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n class TrieNode:\n def __init__(self):\n self.trie = {}\n self.palindromes = []\n self.index = -1\n\n def add_word(self, word, k):\n curr = self\n if word and word == word[::-1]:\n curr.palindromes.append(k)\n\n for i in range(len(word)):\n ch = word[i]\n if ch not in curr.trie:\n curr.trie[ch] = TrieNode()\n curr = curr.trie[ch]\n rest = word[i+1:]\n if rest and rest == rest[::-1]:\n curr.palindromes.append(k)\n curr.index = k\n \n def match_prefix(self, word, k):\n curr = self\n ans = []\n for i in reversed(range(len(word))):\n ch = word[i]\n if ch not in curr.trie:\n return ans \n curr = curr.trie[ch]\n if curr.index != -1 and curr.index != k:\n rest = word[:i]\n if rest == rest[::-1]:\n ans.append([curr.index, k])\n # print(ans)\n\n for j in curr.palindromes:\n # if j != k:\n ans.append([j, k])\n # print(ans)\n return ans\n\n\n tobj = TrieNode()\n for k in range(len(words)):\n tobj.add_word(words[k], k)\n\n # print(repr(tobj.trie))\n rs = []\n\n if tobj.index != -1:\n j = tobj.index\n for i in tobj.palindromes:\n if i != j:\n rs.append([i, j])\n rs.append([j, i])\n\n for k in range(len(words)):\n if words[k]:\n rs += tobj.match_prefix(words[k], k)\n\n return rs\n\n\n\n ","memory":"163121"},{"code":"class TrieNode:\n \n def __init__(self):\n self.map = {}\n self.index = -1\n self.palindrome_idx_list = []\n self.end = False\n \n \nclass Solution:\n \n \n def __init__(self):\n self.node = TrieNode()\n \n def insert(self, word, idx):\n current = self.node\n for index in range(len(word)):\n if self.is_palindrome(word[index:]):\n current.palindrome_idx_list.append(idx)\n ch = word[index]\n if ch not in current.map.keys():\n current.map[ch] = TrieNode()\n current = current.map[ch]\n current.index = idx\n current.end = True\n \n def search(self, word, idx, result):\n current = self.node\n for index in range(len(word)):\n if current.end and self.is_palindrome(word[index:]):\n result.append((idx, current.index))\n if word[index] not in current.map.keys():\n return\n current = current.map[word[index]]\n if current.end and idx != current.index:\n result.append((idx, current.index))\n for p in current.palindrome_idx_list:\n result.append((idx, p))\n return \n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n for index in range(len(words)):\n self.insert(words[index][::-1], index)\n \n result = []\n \n for index in range(len(words)):\n self.search(words[index], index, result)\n \n return result\n \n def is_palindrome(self, word):\n start, end = 0, len(word)-1\n while start < end:\n if word[start] != word[end]:\n return False\n start += 1\n end -= 1\n return True\n ","memory":"166938"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.end = -1\n self.palin_suffix = []\n \nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n#1. Words in the Trie that are the reverse of our current word.\n#2. Words in the Trie that start with the reverse of our current word and then finish in a palindrome.\n#3. Words in the Trie that are the reverse of the first part of our current word, and then what's left of our current word forms a palindrome.\n trie = TrieNode()\n # Create the Trie and add the reverses of all the words.\n for idx,word in enumerate(words):\n word = word[::-1]\n cur = trie\n for j, char in enumerate(word):\n if word[j:] == word[j:][::-1]:\n cur.palin_suffix.append(idx)\n if char not in cur.children:\n cur.children[char] = TrieNode()\n cur = cur.children[char]\n cur.end = idx\n # Look up each word in the Trie and find palindrome pairs.\n res = []\n for idx, word in enumerate(words):\n cur = trie\n completed = True\n for j, char in enumerate(word):\n #Case 3\n if cur.end != -1 and word[j:] == word[j:][::-1]:\n res.append([idx,cur.end]) \n if char not in cur.children:\n completed = False\n break\n cur = cur.children[char]\n if completed:\n #Case 1\n if cur.end != -1 and cur.end != idx:\n res.append([idx,cur.end])\n #Case 2\n for j in cur.palin_suffix:\n res.append([idx,j]) \n return res\n \n","memory":"170756"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.end = False\n self.idx = -1\n self.palindromeIdxs = list()\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = list()\n \n for i in range(len(words)):\n cur = self.root\n word_rev = words[i][::-1]\n for j in range(len(word_rev)):\n if self.isPalindrome(word_rev[j:]):\n cur.palindromeIdxs.append(i)\n \n if word_rev[j] not in cur.children:\n cur.children[word_rev[j]] = TrieNode()\n cur = cur.children[word_rev[j]]\n \n cur.end = True\n cur.idx = i\n \n for i in range(len(words)):\n self.search(words[i], i, res)\n \n return res\n \n def search(self, word, idx, res): \n cur = self.root\n for i in range(len(word)):\n if cur.end and self.isPalindrome(word[i:]):\n res.append([idx, cur.idx])\n \n if word[i] not in cur.children:\n return\n cur = cur.children[word[i]] \n \n if cur.end and cur.idx != idx:\n res.append([cur.idx, idx])\n \n for pIdx in cur.palindromeIdxs:\n res.append([idx, pIdx])\n \n return\n \n def isPalindrome(self, s):\n return s == s[::-1]","memory":"174573"},{"code":"class Node:\n def __init__(self):\n self.idx = -1 \n self.children = {}\n self.palindrome_indexes = []\n self.end = False\n\nclass Solution:\n def __init__(self):\n self.root = Node() \n\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n def is_palindrome(s):\n return s == s[::-1]\n\n def search(word, idx, ret):\n curr = self.root\n\n # long word short trie\n for i in range(len(word)):\n if curr.end and is_palindrome(word[i:]):\n ret.append([idx, curr.idx])\n # traverse\n if word[i] not in curr.children:\n return \n curr = curr.children[word[i]]\n \n # exact match\n if curr.end and curr.idx != idx:\n ret.append([curr.idx, idx])\n\n # long trie short word\n for i in curr.palindrome_indexes:\n ret.append([idx, i])\n\n return \n\n ret = []\n\n # build trie\n for i, word in enumerate(words):\n curr = self.root \n reversed_word = word[::-1]\n for j in range(len(reversed_word)):\n if is_palindrome(reversed_word[j:]):\n curr.palindrome_indexes.append(i)\n \n # traverse\n if reversed_word[j] not in curr.children:\n curr.children[reversed_word[j]] = Node()\n curr = curr.children[reversed_word[j]]\n\n curr.end = True\n curr.idx = i\n\n # search\n for i, word in enumerate(words):\n search(word, i, ret)\n\n return ret\n\n\n\n \n ","memory":"178391"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.end = -1\n self.palin_suffix = []\n \nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n#1. Words in the Trie that are the reverse of our current word.\n#2. Words in the Trie that start with the reverse of our current word and then finish in a palindrome.\n#3. Words in the Trie that are the reverse of the first part of our current word, and then what's left of our current word forms a palindrome.\n trie = TrieNode()\n # Create the Trie and add the reverses of all the words.\n for idx,word in enumerate(words):\n word = word[::-1]\n cur = trie\n for j, char in enumerate(word):\n if word[j:] == word[j:][::-1]:\n cur.palin_suffix.append(idx)\n if char not in cur.children:\n cur.children[char] = TrieNode()\n cur = cur.children[char]\n cur.end = idx\n # Look up each word in the Trie and find palindrome pairs.\n res = []\n for idx, word in enumerate(words):\n cur = trie\n completed = True\n for j, char in enumerate(word):\n #Case 3\n if cur.end != -1 and word[j:] == word[j:][::-1]:\n res.append([idx,cur.end]) \n if char not in cur.children:\n completed = False\n break\n cur = cur.children[char]\n if completed:\n #Case 1\n if cur.end != -1 and cur.end != idx:\n res.append([idx,cur.end])\n #Case 2\n for j in cur.palin_suffix:\n res.append([idx,j]) \n return res\n \n","memory":"182208"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1 # To store the index of the word ending at this node\n self.palindrome_suffix_indices = [] # List of indices of words that have a palindrome suffix\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n # Check if the current prefix is a palindrome and record the index\n if self.is_palindrome(word[:len(word) - i]):\n node.palindrome_suffix_indices.append(index)\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.index = index\n node.palindrome_suffix_indices.append(index)\n\n def search(self, word, index):\n node = self.root\n result = []\n\n for i, char in enumerate(word):\n # Check if the remaining suffix forms a palindrome and the node has a word ending\n if node.index >= 0 and node.index != index and self.is_palindrome(word[i:]):\n result.append([index, node.index])\n if char not in node.children:\n return result\n node = node.children[char]\n\n # If the search completes, check for any remaining palindrome suffix indices\n for suffix_index in node.palindrome_suffix_indices:\n if index != suffix_index:\n result.append([index, suffix_index])\n\n return result\n\n @staticmethod\n def is_palindrome(word):\n left, right = 0, len(word) - 1\n while left < right:\n if word[left] != word[right]:\n return False\n left, right = left + 1, right - 1\n return True\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n\n # Insert words into the Trie in reverse order with indices\n for i, word in enumerate(words):\n trie.insert(word, i)\n\n results = []\n # Search for each word in the Trie\n for i, word in enumerate(words):\n results.extend(trie.search(word, i))\n\n return results\n","memory":"186026"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.end = False\n self.idx = -1\n self.palindromeIdxs = list()\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = list()\n \n # populate the trie with\n # the reverse of every word.\n # once we're done inserting\n # we're going to have 3 conditions\n for i in range(len(words)):\n cur = self.root\n rWord = words[i][::-1]\n for j in range(len(rWord)):\n # if the current word (from j onwards)\n # is a palindrome, add it's index to the trie node\n # (palindromIdx list) we'll use it later on to find combinations\n if self.isPalindrome(rWord[j:]):\n cur.palindromeIdxs.append(i)\n \n if rWord[j] not in cur.children:\n cur.children[rWord[j]] = TrieNode()\n cur = cur.children[rWord[j]]\n \n # once the word is done\n # add it's index to the trie node\n cur.end = True\n cur.idx = i\n \n for i in range(len(words)):\n self.search(words[i], i, res)\n \n return res\n \n # to find all pairse, we can have\n # conditions:\n # 1. exact match (abc, cba)\n # 2. long word, short word in trie match (abbcc, a)\n # 3. short word, long word in trie match (lls, sssll)\n def search(self, word, idx, res): \n cur = self.root\n for i in range(len(word)):\n # 2. long word, short trie\n # so the trie ended here and \n # we have matched till the ith\n # character, so we check if the\n # remaining of the word is also a\n # palindrome, if yes, then we have a pair\n # for e.g. word = abcdaa, trieWord = bcda\n # we can make a pair like abcdaabcda\n if cur.end and self.isPalindrome(word[i:]):\n res.append([idx, cur.idx])\n \n if word[i] not in cur.children:\n return\n cur = cur.children[word[i]] \n \n # 1. exact match\n # in the given list, for that \n # we'll take every word and then\n # check if the reverse of that\n # word lies in the trie\n # for e.g. for abc and cba\n # the trie would have both c->b->a and a->b->c\n # but when we take the first word (abc)\n # we'll match this with a->b->c which is\n # actually cba and so we found a match\n if cur.end and cur.idx != idx:\n res.append([cur.idx, idx])\n \n # 3. long trie, short word\n # so the trie still has items (not cur.end)\n # and the word has ended, it's the exact\n # opposite of point 2\n # for e.g. word=abcd trieWord=bcdaa\n # we can have a pair bcdaaabcd\n # and so we have a pair\n for pIdx in cur.palindromeIdxs:\n res.append([idx, pIdx])\n \n return\n \n \n def isPalindrome(self, s):\n return s == s[::-1]\n\n\n## TC: O(n * m^2), SC: O(n * m)","memory":"189843"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1\n self.palindrome_suffix_indices = []\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n # If the current prefix is a palindrome, store the index\n if self.is_palindrome(word[:len(word) - i]):\n node.palindrome_suffix_indices.append(index)\n # Move to the next node\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.index = index\n node.palindrome_suffix_indices.append(index)\n\n def search(self, word, index):\n node = self.root\n result = []\n\n for i, char in enumerate(word):\n # Check if the remaining part of the word forms a palindrome\n # and there is a valid palindrome ending at this point\n if node.index >= 0 and node.index != index and self.is_palindrome(word[i:]):\n result.append([index, node.index])\n # Move to the next character in the Trie\n if char not in node.children:\n return result\n node = node.children[char]\n\n # Check all remaining palindrome indices in the current node\n for suffix_index in node.palindrome_suffix_indices:\n if index != suffix_index:\n result.append([index, suffix_index])\n\n return result\n\n @staticmethod\n def is_palindrome(word):\n return word == word[::-1]\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n\n # Insert all words into the Trie in reverse\n for i, word in enumerate(words):\n trie.insert(word, i)\n\n results = []\n # Search for each word in the Trie to find palindrome pairs\n for i, word in enumerate(words):\n results.extend(trie.search(word, i))\n\n return results\n","memory":"193661"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.word_index = -1\n self.palindrome_suffixes = []\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def add_word(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n if self.is_palindrome(word[:len(word) - i]):\n node.palindrome_suffixes.append(index)\n node = node.children.setdefault(char, TrieNode())\n node.word_index = index\n\n def search_word(self, word, index):\n node = self.root\n result = []\n for i, char in enumerate(word):\n if node.word_index != -1 and node.word_index != index and self.is_palindrome(word[i:]):\n result.append([index, node.word_index])\n if char not in node.children:\n return result\n node = node.children[char]\n \n if node.word_index != -1 and node.word_index != index:\n result.append([index, node.word_index])\n \n for suffix in node.palindrome_suffixes:\n result.append([index, suffix])\n \n return result\n\n @staticmethod\n def is_palindrome(word):\n return word == word[::-1]\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = Trie()\n result = []\n \n for i, word in enumerate(words):\n trie.add_word(word, i)\n \n for i, word in enumerate(words):\n result.extend(trie.search_word(word, i))\n \n return result\n\n# Example usage:\nsolution = Solution()\nwords = [\"abcd\",\"dcba\",\"lls\",\"s\",\"sssll\"]\nprint(solution.palindromePairs(words)) # Output: [[0,1],[1,0],[3,2],[2,4]]","memory":"197478"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = []\n trie = Trie()\n for i, word in enumerate(words):\n trie.insert(word, i)\n for i, word in enumerate(words):\n res.extend(trie.search(word, i))\n return res\n\nclass TrieNode:\n def __init__(self):\n self.children = {}\n self.index = -1 # Index of the word that ends at this node\n self.palindrome_suffixes = [] # List of word indices where suffix forms a palindrome\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, word, index):\n node = self.root\n for i, char in enumerate(reversed(word)):\n # If the remaining part of the word is a palindrome, store the index\n if is_palindrome(word[:len(word) - i]):\n node.palindrome_suffixes.append(index)\n if char not in node.children:\n node.children[char] = TrieNode()\n node = node.children[char]\n node.index = index # Mark the end of the word\n node.palindrome_suffixes.append(index)\n\n def search(self, word, index):\n node = self.root\n result = []\n\n for i, char in enumerate(word):\n # If this node represents a word and the remaining suffix of the current word is a palindrome\n if node.index >= 0 and node.index != index and is_palindrome(word[i:]):\n result.append([index, node.index])\n if char not in node.children:\n return result\n node = node.children[char]\n\n # Check for words with palindromic suffixes\n for j in node.palindrome_suffixes:\n if index != j:\n result.append([index, j])\n \n return result\n \ndef is_palindrome(word):\n return word == word[::-1]","memory":"201296"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.end = False\n self.idx = -1\n self.palindromeIdxs = list()\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = list()\n \n # populate the trie with\n # the reverse of every word.\n # once we're done inserting\n # we're going to have 3 conditions\n for i in range(len(words)):\n cur = self.root\n rWord = words[i][::-1]\n for j in range(len(rWord)):\n # if the current word (from j onwards)\n # is a palindrome, add it's index to the trie node\n # (palindromIdx list) we'll use it later on to find combinations\n if self.isPalindrome(rWord[j:]):\n cur.palindromeIdxs.append(i)\n \n if rWord[j] not in cur.children:\n cur.children[rWord[j]] = TrieNode()\n cur = cur.children[rWord[j]]\n \n # once the word is done\n # add it's index to the trie node\n cur.end = True\n cur.idx = i\n \n for i in range(len(words)):\n self.search(words[i], i, res)\n \n return res\n \n # to find all pairse, we can have\n # conditions:\n # 1. exact match (abc, cba)\n # 2. long word, short word in trie match (abbcc, a)\n # 3. short word, long word in trie match (lls, sssll)\n def search(self, word, idx, res): \n cur = self.root\n for i in range(len(word)):\n # 2. long word, short trie\n # so the trie ended here and \n # we have matched till the ith\n # character, so we check if the\n # remaining of the word is also a\n # palindrome, if yes, then we have a pair\n # for e.g. word = abcdaa, trieWord = bcda\n # we can make a pair like abcdaabcda\n if cur.end and self.isPalindrome(word[i:]):\n res.append([idx, cur.idx])\n \n if word[i] not in cur.children:\n return\n cur = cur.children[word[i]] \n \n # 1. exact match\n # in the given list, for that \n # we'll take every word and then\n # check if the reverse of that\n # word lies in the trie\n # for e.g. for abc and cba\n # the trie would have both c->b->a and a->b->c\n # but when we take the first word (abc)\n # we'll match this with a->b->c which is\n # actually cba and so we found a match\n if cur.end and cur.idx != idx:\n res.append([cur.idx, idx])\n \n # 3. long trie, short word\n # so the trie still has items (not cur.end)\n # and the word has ended, it's the exact\n # opposite of point 2\n # for e.g. word=abcd trieWord=bcdaa\n # we can have a pair bcdaaabcd\n # and so we have a pair\n for pIdx in cur.palindromeIdxs:\n res.append([idx, pIdx])\n \n return\n \n \n def isPalindrome(self, s):\n return s == s[::-1]","memory":"205113"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.end = False\n self.idx = -1\n self.palindromeIdxs = list()\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = list()\n \n # populate the trie with\n # the reverse of every word.\n # once we're done inserting\n # we're going to have 3 conditions\n for i in range(len(words)):\n cur = self.root\n rWord = words[i][::-1]\n for j in range(len(rWord)):\n # if the current word (from j onwards)\n # is a palindrome, add it's index to the trie node\n # (palindromIdx list) we'll use it later on to find combinations\n if self.isPalindrome(rWord[j:]):\n cur.palindromeIdxs.append(i)\n \n if rWord[j] not in cur.children:\n cur.children[rWord[j]] = TrieNode()\n cur = cur.children[rWord[j]]\n \n # once the word is done\n # add it's index to the trie node\n cur.end = True\n cur.idx = i\n \n for i in range(len(words)):\n self.search(words[i], i, res)\n \n return res\n \n # to find all pairse, we can have\n # conditions:\n # 1. exact match (abc, cba)\n # 2. long word, short word in trie match (abbcc, a)\n # 3. short word, long word in trie match (lls, sssll)\n def search(self, word, idx, res): \n cur = self.root\n for i in range(len(word)):\n # 2. long word, short trie\n # so the trie ended here and \n # we have matched till the ith\n # character, so we check if the\n # remaining of the word is also a\n # palindrome, if yes, then we have a pair\n # for e.g. word = abcdaa, trieWord = bcda\n # we can make a pair like abcdaabcda\n if cur.end and self.isPalindrome(word[i:]):\n res.append([idx, cur.idx])\n \n if word[i] not in cur.children:\n return\n cur = cur.children[word[i]] \n \n # 1. exact match\n # in the given list, for that \n # we'll take every word and then\n # check if the reverse of that\n # word lies in the trie\n # for e.g. for abc and cba\n # the trie would have both c->b->a and a->b->c\n # but when we take the first word (abc)\n # we'll match this with a->b->c which is\n # actually cba and so we found a match\n if cur.end and cur.idx != idx:\n res.append([cur.idx, idx])\n \n # 3. long trie, short word\n # so the trie still has items (not cur.end)\n # and the word has ended, it's the exact\n # opposite of point 2\n # for e.g. word=abcd trieWord=bcdaa\n # we can have a pair bcdaaabcd\n # and so we have a pair\n for pIdx in cur.palindromeIdxs:\n res.append([idx, pIdx])\n \n return\n \n \n def isPalindrome(self, s):\n return s == s[::-1]","memory":"208931"},{"code":"class TrieNode:\n def __init__(self):\n self.children = dict()\n self.end = False\n self.idx = -1\n self.palindromeIdxs = list()\n\nclass Solution:\n def __init__(self):\n self.root = TrieNode()\n \n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n res = list()\n \n # populate the trie with\n # the reverse of every word.\n # once we're done inserting\n # we're going to have 3 conditions\n for i in range(len(words)):\n cur = self.root\n rWord = words[i][::-1]\n for j in range(len(rWord)):\n # if the current word (from j onwards)\n # is a palindrome, add it's index to the trie node\n # (palindromIdx list) we'll use it later on to find combinations\n if self.isPalindrome(rWord[j:]):\n cur.palindromeIdxs.append(i)\n \n if rWord[j] not in cur.children:\n cur.children[rWord[j]] = TrieNode()\n cur = cur.children[rWord[j]]\n \n # once the word is done\n # add it's index to the trie node\n cur.end = True\n cur.idx = i\n \n for i in range(len(words)):\n self.search(words[i], i, res)\n \n return res\n \n # to find all pairse, we can have\n # conditions:\n # 1. exact match (abc, cba)\n # 2. long word, short word in trie match (abbcc, a)\n # 3. short word, long word in trie match (lls, sssll)\n def search(self, word, idx, res): \n cur = self.root\n for i in range(len(word)):\n # 2. long word, short trie\n # so the trie ended here and \n # we have matched till the ith\n # character, so we check if the\n # remaining of the word is also a\n # palindrome, if yes, then we have a pair\n # for e.g. word = abcdaa, trieWord = bcda\n # we can make a pair like abcdaabcda\n if cur.end and self.isPalindrome(word[i:]):\n res.append([idx, cur.idx])\n \n if word[i] not in cur.children:\n return\n cur = cur.children[word[i]] \n \n # 1. exact match\n # in the given list, for that \n # we'll take every word and then\n # check if the reverse of that\n # word lies in the trie\n # for e.g. for abc and cba\n # the trie would have both c->b->a and a->b->c\n # but when we take the first word (abc)\n # we'll match this with a->b->c which is\n # actually cba and so we found a match\n if cur.end and cur.idx != idx:\n res.append([cur.idx, idx])\n \n # 3. long trie, short word\n # so the trie still has items (not cur.end)\n # and the word has ended, it's the exact\n # opposite of point 2\n # for e.g. word=abcd trieWord=bcdaa\n # we can have a pair bcdaaabcd\n # and so we have a pair\n for pIdx in cur.palindromeIdxs:\n res.append([idx, pIdx])\n \n return\n \n \n def isPalindrome(self, s):\n return s == s[::-1]\n","memory":"212748"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n\n class TrieNode:\n def __init__(self):\n self.children = defaultdict(TrieNode)\n self.palin = []\n self.ending = -1\n\n root = TrieNode()\n index = 0\n for word in words: \n current = root\n for i, c in enumerate(word): \n if word[i:] == word[i:][::-1]: \n current.palin.append(index)\n current = current.children[c]\n current.ending = index\n index += 1\n\n result = []\n index = 0\n for word in words:\n rev = word[::-1]\n brk = False\n current = root\n\n for i, c in enumerate(rev):\n if current.ending != -1:\n if rev[i:] == rev[i:][::-1]:\n result.append([current.ending, index])\n\n if c not in current.children:\n brk = True\n break\n \n current = current.children[c]\n # print(word, current.children.keys(), brk, result, current.ending, index)\n if not brk:\n if current.ending != -1 and index != current.ending:\n result.append([current.ending, index])\n \n if len(current.palin) > 0:\n for i in current.palin:\n result.append([i, index])\n\n index+=1\n return result\n ","memory":"216566"},{"code":"class TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1 \n self.palindrome_suffixes = [] \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode() \n for i, word in enumerate(words):\n word = word[::-1]\n current_level = trie \n for j, c in enumerate(word):\n if word[j:] == word[j:][::-1]:\n current_level.palindrome_suffixes.append(i)\n current_level = current_level.next[c]\n current_level.ending_word = i \n \n solutions = [] \n for i, word in enumerate(words):\n current_level = trie \n for j, c in enumerate(word):\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]:\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else:\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n\n for j in current_level.palindrome_suffixes:\n solutions.append([i,j])\n return solutions\n ","memory":"220383"},{"code":"def is_palindrome(word, substr_start=0, substr_end=float(\"inf\")):\n if substr_end == float(\"inf\"):\n substr_end = len(word)-1\n return word[substr_start:substr_end+1] == word[substr_start:substr_end+1][::-1]\n #l, r = substr_start, min(substr_end, len(word)-1)\n #while l < r:\n # if word[l] != word[r]:\n # return False\n # l += 1\n # r -= 1\n #return True\n\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.word_index = None\n self.palindrome_suffixes = []\n \n def insert(self, word, index):\n node = self\n for i in range(len(word)-1, -1, -1):\n if is_palindrome(word, 0, i):\n node.palindrome_suffixes.append(index)\n node = node.next[word[i]]\n node.word_index = index\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode()\n for i, word in enumerate(words):\n trie.insert(word, i)\n res = []\n for i, word in enumerate(words):\n node = trie\n brk = False\n for j, char in enumerate(word):\n if node.word_index is not None and is_palindrome(word, j):\n res.append([i, node.word_index])\n if char not in node.next:\n brk = True\n break\n node = node.next[char]\n if not brk:\n # reverse of word in trie\n if node.word_index is not None and node.word_index != i:\n res.append([i, node.word_index])\n # reverse of word in trie but as a suffix attached to a palindrome prefix\n for suffix in node.palindrome_suffixes:\n res.append([i, suffix])\n\n return res","memory":"224201"},{"code":"def is_palindrome(word, substr_start=0, substr_end=float(\"inf\")):\n l, r = substr_start, min(substr_end, len(word)-1)\n while l < r:\n if word[l] != word[r]:\n return False\n l += 1\n r -= 1\n return True\n\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.word_index = None\n self.palindrome_suffixes = []\n \n def insert(self, word, index):\n node = self\n for i in range(len(word)-1, -1, -1):\n if is_palindrome(word, 0, i):\n node.palindrome_suffixes.append(index)\n node = node.next[word[i]]\n node.word_index = index\n\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode()\n for i, word in enumerate(words):\n trie.insert(word, i)\n res = []\n for i, word in enumerate(words):\n node = trie\n brk = False\n for j, char in enumerate(word):\n if node.word_index is not None and is_palindrome(word, j):\n res.append([i, node.word_index])\n if char not in node.next:\n brk = True\n break\n node = node.next[char]\n if not brk:\n # reverse of word in trie\n if node.word_index is not None and node.word_index != i:\n res.append([i, node.word_index])\n # reverse of word in trie but as a suffix attached to a palindrome prefix\n for suffix in node.palindrome_suffixes:\n res.append([i, suffix])\n\n return res","memory":"228018"},{"code":"def is_palindrome(word, substr_start=0, substr_end=float(\"inf\")):\n l, r = substr_start, min(substr_end, len(word)-1)\n while l < r:\n if word[l] != word[r]:\n return False\n l += 1\n r -= 1\n return True\n\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.word_index = None\n self.palindrome_suffixes = []\n \n def insert(self, word, index):\n node = self\n for i in range(len(word)-1, -1, -1):\n if is_palindrome(word, 0, i):\n node.palindrome_suffixes.append(index)\n node = node.next[word[i]]\n node.word_index = index\n \n def search(self, word, start=0):\n node = self\n for i in range(start, len(word)):\n if word[i] not in node.next:\n return None\n node = node.next[word[i]]\n return node\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n trie = TrieNode()\n for i, word in enumerate(words):\n trie.insert(word, i)\n res = []\n for i, word in enumerate(words):\n node = trie.search(word)\n if node is not None:\n # reverse of word in trie\n if node.word_index is not None:\n if node.word_index != i:\n res.append([i, node.word_index])\n \n # reverse of word in trie but as a suffix attached to a palindrome prefix\n for suffix in node.palindrome_suffixes:\n res.append([i, suffix])\n \n # prefix of word in trie; rest of word is palindrome suffix\n j = 0\n node = trie\n while j <= len(word):\n if j < len(word) and node.word_index is not None and is_palindrome(word, j):\n res.append([i, node.word_index])\n if j == len(word):\n break\n if word[j] not in node.next:\n break\n node = node.next[word[j]]\n j += 1\n return res","memory":"231836"},{"code":"\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\nclass Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n #### that is actually the prefix of a word\n # Check if remainder of word is a palindrome.\n\n #### prefix(palindrome) + ....\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n\n #...+suffix(palindrome)\n #cat + panlindrome + tac\n ##### word 1 ######\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n # cat + solos (palindrome) tac\n # word 1 word 2\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions\n\n\n# class Solution:\n\n# def palindromePairs(self, words):\n\n# def all_valid_prefixes(word):\n# valid_prefixes = []\n# for i in range(len(word)):\n# if word[i:] == word[i:][::-1]:\n# valid_prefixes.append(word[:i])\n# return valid_prefixes\n\n# def all_valid_suffixes(word):\n# valid_suffixes = []\n# for i in range(len(word)):\n# if word[:i+1] == word[:i+1][::-1]:\n# valid_suffixes.append(word[i + 1:])\n# return valid_suffixes\n\n# word_lookup = {word: i for i, word in enumerate(words)}\n# solutions = []\n\n# for word_index, word in enumerate(words):\n# reversed_word = word[::-1]\n\n# # Build solutions of case #1. This word will be word 1.\n# if reversed_word in word_lookup and word_index != word_lookup[reversed_word]:\n# solutions.append([word_index, word_lookup[reversed_word]])\n\n\n# # CAT SOLOSTAC\n# # word1 word2\n# # Build solutions of case #2. This word will be word 2.\n# for suffix in all_valid_suffixes(word):\n# reversed_suffix = suffix[::-1]\n# if reversed_suffix in word_lookup:\n# solutions.append([word_lookup[reversed_suffix], word_index])\n\n# # CATSOLOS TAC\n# # word1 word2\n\n# # Build solutions of case #3. This word will be word 1.\n# for prefix in all_valid_prefixes(word):\n# reversed_prefix = prefix[::-1]\n# if reversed_prefix in word_lookup:\n# solutions.append([word_index, word_lookup[reversed_prefix]])\n\n# return solutions","memory":"235653"},{"code":"class TrieNode:\n def __init__(self):\n self.w = -1\n self.p = []\n self.children = collections.defaultdict(TrieNode)\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n @staticmethod\n def is_palindrome(word: str) -> bool :\n return word[::] == word[::-1]\n\n def insert(self, index, word: str) -> None:\n node = self.root\n for i, char in enumerate(word[::-1]) : \n if self.is_palindrome(word[0:len(word) - i]) :\n node.p.append(index)\n node = node.children[char]\n node.w = index\n\n def search(self, index, word: str) -> List[List[int]]:\n result = []\n node = self.root\n\n while word : \n if node.w >= 0 :\n if self.is_palindrome(word) : \n result.append([index, node.w])\n if not word[0] in node.children : \n return result\n node = node.children[word[0]]\n word = word[1:]\n\n if node.w >= 0 and node.w != index :\n result.append([index, node.w])\n \n for p in node.p : \n result.append([index, p])\n \n return result\n \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n trie = Trie()\n \n for i, word in enumerate(words) : \n trie.insert(i, word)\n\n results = []\n\n for i, word in enumerate(words) : \n results.extend(trie.search(i, word))\n\n return results\n \n","memory":"239471"},{"code":"class TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\nclass Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions","memory":"243288"},{"code":"class TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\nclass Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions","memory":"247106"},{"code":"class TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\nclass Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions","memory":"250923"},{"code":"class TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\n\nclass Solution:\n def palindromePairs(self, words):\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions\n","memory":"254741"},{"code":"#check the cases in editorial\nclass TrieNode:\n def __init__(self):\n self.next = collections.defaultdict(TrieNode)\n self.ending_word = -1\n self.palindrome_suffixes = []\n\nclass Solution:\n def palindromePairs(self, words):\n\n # Create the Trie and add the reverses of all the words.\n trie = TrieNode()\n for i, word in enumerate(words):\n word = word[::-1] # We want to insert the reverse.\n current_level = trie\n for j, c in enumerate(word):\n # Check if remainder of word is a palindrome.\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\n current_level.palindrome_suffixes.append(i)\n # Move down the trie.\n current_level = current_level.next[c]\n current_level.ending_word = i\n\n # Look up each word in the Trie and find palindrome pairs.\n solutions = []\n for i, word in enumerate(words):\n current_level = trie\n for j, c in enumerate(word):\n # Check for case 3.\n if current_level.ending_word != -1:\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\n solutions.append([i, current_level.ending_word])\n if c not in current_level.next:\n break\n current_level = current_level.next[c]\n else: # Case 1 and 2 only come up if whole word was iterated.\n # Check for case 1.\n if current_level.ending_word != -1 and current_level.ending_word != i:\n solutions.append([i, current_level.ending_word])\n # Check for case 2.\n for j in current_level.palindrome_suffixes:\n solutions.append([i, j])\n return solutions","memory":"258558"},{"code":"class TrieNode:\n def __init__(self):\n self.w = -1\n self.p = []\n self.children = collections.defaultdict(TrieNode)\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n @staticmethod\n def is_palindrome(word: str) -> bool :\n return word[::] == word[::-1]\n\n def insert(self, index, word: str) -> None:\n node = self.root\n for i, char in enumerate(word[::-1]) : \n if self.is_palindrome(word[0:len(word) - i]) :\n node.p.append(index)\n node = node.children[char]\n node.w = index\n\n def search(self, index, word: str) -> List[List[int]]:\n result = []\n node = self.root\n\n while word : \n if node.w >= 0 :\n if self.is_palindrome(word) : \n result.append([index, node.w])\n if not word[0] in node.children : \n return result\n node = node.children[word[0]]\n word = word[1:]\n\n if node.w >= 0 and node.w != index :\n result.append([index, node.w])\n \n for p in node.p : \n result.append([index, p])\n \n return result\n \n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n \n trie = Trie()\n \n for i, word in enumerate(words) : \n trie.insert(i, word)\n\n results = []\n\n for i, word in enumerate(words) : \n results.extend(trie.search(i, word))\n\n return results\n \n","memory":"262376"},{"code":"class Node:\n def __init__(self):\n self.remainingPalIndexes = []\n self.endIndex = -1\n import collections\n self.children = collections.defaultdict(Node)\n\nclass Trie:\n def __init__(self): self.root = Node()\n \n def insert(self, w, j):\n isPal = lambda x: x == x[::-1]\n n = self.root\n if isPal(w): n.remainingPalIndexes.append(j)\n for i in range(len(w)):\n c, suf = w[i], w[i+1:]\n n = n.children[c]\n if isPal(suf): n.remainingPalIndexes.append(j)\n n.endIndex = j\n\n def search(self, w):\n isPal = lambda x: x == x[::-1]\n n = self.root\n if not w: return n.remainingPalIndexes\n r = []\n for i in range(len(w)):\n c, suf = w[i], w[i+1:]\n if c not in n.children: return r\n n = n.children[c]\n if suf and isPal(suf) and n.endIndex > -1:\n r.append(n.endIndex)\n return r + n.remainingPalIndexes\n # return r.extend(n.remainingPalIndexes)\n\nclass Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n r = []\n trie = Trie()\n for i, w in enumerate(words):\n trie.insert(w[::-1], i)\n for i, w in enumerate(words):\n js = trie.search(w)\n if js: \n r.extend([[i, j] for j in js if i != j])\n if not w: r.extend([[i, j][::-1] for j in js if i != j])\n return r\n \n\nclass Solution2:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n d = {e: i for i, e in enumerate(words)}\n r = []\n isPal = lambda x: x == x[::-1]\n for j, w in enumerate(words):\n n = len(w)\n for i in range(n+1):\n pre, suf = w[:i], w[i:]\n if isPal(pre):\n s = suf[::-1]\n if s != w and s in d: r.append([d[s], j])\n if i != n and isPal(suf):\n s = pre[::-1]\n if s != w and s in d: r.append([d[s], j][::-1])\n return r","memory":"266193"},{"code":"class TrieNode(object):\n def __init__(self):\n self.idx = -1\n self.pdromes_below = []\n self.children = collections.defaultdict(TrieNode)\n\nclass Trie(object):\n def __init__(self):\n self.root = TrieNode()\n\n def add(self, word, idx):\n node = self.root\n for i, letter in enumerate(reversed(word)):\n if self.is_palindrome(word[:len(word)-i]):\n node.pdromes_below.append(idx)\n node = node.children[letter]\n node.idx = idx\n \n def search(self, word, idx, res):\n node = self.root\n for i, letter in enumerate(word):\n if node.idx >= 0 and idx != node.idx and self.is_palindrome(word[i:]):\n res.append([idx, node.idx])\n node = node.children.get(letter)\n if not node:\n return res\n for p in node.pdromes_below:\n if p != idx:\n res.append([idx, p])\n if node.idx >= 0 and idx != node.idx:\n res.append([idx, node.idx])\n return res\n \n def is_palindrome(self, w):\n i = 0\n j = len(w)-1\n while i < j:\n if w[i] != w[j]:\n return False\n i += 1\n j -= 1\n return True\n\n\nclass Solution(object):\n def palindromePairs(self, words):\n \"\"\"\n :type words: List[str]\n :rtype: List[List[int]]\n \"\"\"\n res = []\n t = Trie()\n for idx, w in enumerate(words):\n t.add(w, idx)\n for idx, w in enumerate(words):\n res = t.search(w, idx, res)\n return res","memory":"270011"},{"code":"class TrieNode(object):\n def __init__(self):\n self.idx = -1\n self.pdromes_below = []\n self.children = collections.defaultdict(TrieNode)\n\nclass Trie(object):\n def __init__(self):\n self.root = TrieNode()\n\n def add(self, word, idx):\n node = self.root\n for i, letter in enumerate(reversed(word)):\n if self.is_palindrome(word[:len(word)-i]):\n node.pdromes_below.append(idx)\n node = node.children[letter]\n node.idx = idx\n \n def search(self, word, idx, res):\n node = self.root\n for i, letter in enumerate(word):\n if node.idx >= 0 and idx != node.idx and self.is_palindrome(word[i:]):\n res.append([idx, node.idx])\n node = node.children.get(letter)\n if not node:\n return res\n for p in node.pdromes_below:\n if p != idx:\n res.append([idx, p])\n if node.idx >= 0 and idx != node.idx:\n res.append([idx, node.idx])\n return res\n \n def is_palindrome(self, w):\n i = 0\n j = len(w)-1\n while i < j:\n if w[i] != w[j]:\n return False\n i += 1\n j -= 1\n return True\n\n\nclass Solution(object):\n def palindromePairs(self, words):\n \"\"\"\n :type words: List[str]\n :rtype: List[List[int]]\n \"\"\"\n res = []\n t = Trie()\n for idx, w in enumerate(words):\n t.add(w, idx)\n for idx, w in enumerate(words):\n res = t.search(w, idx, res)\n return res","memory":"273828"},{"code":"class Solution:\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\n # Trie + counting sort + rolling hash\n P, M = 31, 10 ** 9 + 7\n exp = [1]\n for i in range(302):\n np = exp[-1] * P % M\n exp.append(np)\n d, n, mnl, mxl = defaultdict(list), len(words), 5000, 0\n for i in range(n):\n d[len(words[i])].append((words[i], i))\n mnl = min(mnl, len(words[i]))\n mxl = max(mxl, len(words[i]))\n s_w = []\n for t in range(mnl, mxl+1): s_w.extend(d[t])\n \n rt = (T := lambda: defaultdict(T))()\n rrt = (T := lambda: defaultdict(T))()\n\n def gh(w):\n h = [0]\n for ch in w:\n nh = (h[-1] * P + ord(ch)) % M\n h.append(nh)\n return h\n\n def mp(t, w, h, rh):\n m, i, u, res = len(w), 0, t, []\n if u.get(\"_s\"):\n hh = h[m]\n rhh = rh[m]\n if hh == rhh: res.extend(u[\"_s\"])\n while i < m:\n if not u.get(w[i]): break\n u = u[w[i]]\n if u.get(\"_s\"):\n hh = (h[m] - h[i+1] * exp[m-i-1] + M) % M\n rhh = rh[m-i-1]\n if hh == rhh: res.extend(u[\"_s\"])\n i += 1\n return res\n\n def insert(t, w, wi):\n v, m = t, len(w)\n for j in range(m): v = v[w[j]]\n v[\"_s\"] = v.get(\"_s\", list())\n v[\"_s\"].append(wi)\n\n ans = []\n for i in range(n):\n w, idx = s_w[i]\n rw = w[::-1]\n h, rh = gh(w), gh(rw)\n for j in mp(rrt, w, h, rh): ans.append([idx, j])\n for j in mp(rt, rw, rh, h): ans.append([j, idx])\n insert(rrt, rw, idx)\n insert(rt, w, idx)\n return ans","memory":"277646"}],"string":"[\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # list of (index, word, is_reversed), `word` can be either a orginal word or a reversed word\\n # the list is sorted so that words with similar prefix are consecutive\\n words = sorted(chain(((i, w, False) for i, w in enumerate(words)), \\n ((i, w[::-1], True) for i, w in enumerate(words))),\\n key=lambda x: x[1])\\n \\n # Loop through each word \\n for i, (idx1, w1, is_reversed1) in enumerate(words):\\n # Look at each word (w2) after the current word (w1) to find a prefix of the current word\\n # When w1 is a prefix of w2 then w1 + w2[::-1] is a palindrome\\n # Because the words are sorted, if w1 is a prefix of w2 then w1 will come before w2, so we only need to start from i + 1\\n for j in range(i + 1, len(words)):\\n idx2, w2, is_reversed2 = words[j]\\n if w2.startswith(w1):\\n # we want one of w1 and w2 is a reversed word\\n # because if w1 is a prefix of w2 but both w1 and w2 are in the orginal words then w1 + w2[::-1] cannot be a palindrome\\n if is_reversed1 == is_reversed2:\\n continue\\n rest = w2[len(w1):]\\n # check idx1 != idx2 for cases where a word is a palindrome itself\\n # then check whether the postfix of w2 is a palindrome\\n if idx1 != idx2 and rest == rest[::-1]:\\n # if w1 is an original word and w2 is a reversed word, then w1 + w2[::-1] is a palindrome => return (idx1, idx2)\\n # otherwise w1 + w2[::-1] = w2 + w1[::] is a palindrome => return (idx2, idx1)\\n yield (idx1, idx2) if is_reversed2 else (idx2, idx1)\\n else:\\n # because the words are sorted, so if we found a word that is not a prefix of the curent word \\n # then every word after that can't be a prefix of the current word\\n break\",\n \"memory\": \"29508\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n words = sorted(chain(((i, w, False) for i, w in enumerate(words)), \\n ((i, w[::-1], True) for i, w in enumerate(words))),\\n key=lambda x: x[1])\\n \\n for i, (idx1, w1, is_reversed1) in enumerate(words):\\n for j in range(i + 1, len(words)):\\n idx2, w2, is_reversed2 = words[j]\\n if w2.startswith(w1):\\n if is_reversed1 == is_reversed2:\\n continue\\n rest = w2[len(w1):]\\n if idx1 != idx2 and rest == rest[::-1]:\\n yield (idx1, idx2) if is_reversed2 else (idx2, idx1)\\n else:\\n break\",\n \"memory\": \"29508\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n def isPalindrome(s):\\n return s == s[::-1]\\n\\n have = defaultdict(int)\\n for (k, w) in enumerate(words):\\n have[w] = k\\n print(have)\\n\\n res = set()\\n for (j, w) in enumerate(words):\\n if isPalindrome(w) and \\\"\\\" in have and w != \\\"\\\":\\n res.add((j, have[\\\"\\\"]))\\n res.add((have[\\\"\\\"], j))\\n for i in range(len(w)+1):\\n prefix, suffix = w[:i], w[i:]\\n if isPalindrome(prefix) and suffix[::-1] in have:\\n k = have[suffix[::-1]]\\n if j != k:\\n res.add((k, j))\\n for i in range(len(w), -1, -1):\\n prefix, suffix = w[:i], w[i:len(w)]\\n if isPalindrome(suffix) and prefix[::-1] in have:\\n k = have[prefix[::-1]]\\n if j != k:\\n res.add((j, k))\\n return [[i, j] for (i, j) in res]\\n\\n\\n \",\n \"memory\": \"33326\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # 1. check if the word is a palindrome\\n # 2. for a given word, the last repeating character offer different variations of palindromes\\n # if there are no repeating characrters, there are only two variations.\\n \\n \\n def is_palindrome(text):\\n if text[::-1] == text:\\n return True\\n else:\\n return False\\n \\n\\n #O(N)\\n word_bank = defaultdict(list)\\n for i in range(len(words)):\\n word_bank[words[i]].append(i)\\n \\n # words = sorted(words, key = lambda x: len(x), reverse=True)\\n # print(words)\\n \\n #O(1)\\n def search_palindromes(j, pp, reverse):\\n nonlocal pairs\\n if pp in word_bank:\\n # print(j,pp)\\n for pairing in word_bank[pp]:\\n if pairing != j:\\n if reverse:\\n # print('hi',(pairing,j))\\n pairs.append((pairing,j))\\n else:\\n # print('bye',(j,pairing))\\n pairs.append((j,pairing))\\n \\n pairs = []\\n possible_palindromes = defaultdict(set)\\n for i in range(len(words)):\\n word = words[i]\\n \\n if len(word) == 0:\\n for j in range(len(words)):\\n if j != i and is_palindrome(words[j]):\\n pairs.append((i,j))\\n pairs.append((j,i))\\n elif len(word) == 1:\\n if word in word_bank:\\n for pairing in word_bank[word]:\\n if pairing != i:\\n pairs.append((i,pairing))\\n \\n elif len(word) > 1:\\n for j in range(len(word)-1, -1, -1):\\n # if i == len(word):\\n # possible_palindromes.append((word[:i] + word[:i:-1])[::-1])\\n ext = word[:j+1][::-1]\\n if is_palindrome(word + ext) and ext in word_bank and ext != word:\\n \\n possible_palindromes[ext].add((i,False))\\n # if word[j] != word[-1]:\\n # break\\n # print(possible_palindromes)\\n for j in range(len(word)):\\n ext = word[j:][::-1]\\n if is_palindrome(ext + word) and ext in word_bank and ext != word:\\n # print(word, ext)\\n possible_palindromes[ext].add((i,True))\\n# if word[j] != word[0]:\\n# break\\n \\n # print(word, possible_palindromes)\\n \\n \\n # print(word_bank)\\n # print(possible_palindromes)\\n for ext in possible_palindromes:\\n # print(ext,possible_palindromes[ext])\\n for i, reverse in possible_palindromes[ext]:\\n \\n search_palindromes(i, ext, reverse)\\n \\n return list(set(pairs))\",\n \"memory\": \"33326\"\n },\n {\n \"code\": \"from functools import cache\\n\\nclass Solution:\\n @cache\\n def checkPalin(self, word, i, j):\\n if i > j:\\n return True\\n if word[i] != word[j]:\\n return False\\n return self.checkPalin(word, i+1, j-1)\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n backwards = dict()\\n output = []\\n for i, word in enumerate(words):\\n backwards[word[::-1]] = i\\n \\n for i, word in enumerate(words):\\n n = len(word)\\n if word in backwards and backwards[word] != i:\\n output.append([i, backwards[word]])\\n \\n if \\\"\\\" in backwards and word != \\\"\\\" and self.checkPalin(word, 0, n-1):\\n output.append([backwards[\\\"\\\"], i])\\n output.append([i, backwards[\\\"\\\"]])\\n \\n for j in range(1, n):\\n left = word[:j]\\n if left in backwards and backwards[left] != i and self.checkPalin(word, j, n-1):\\n output.append([i, backwards[left]])\\n right = word[j:]\\n if right in backwards and backwards[right] != i and self.checkPalin(word, 0, j-1):\\n output.append([backwards[right], i])\\n\\n return output\",\n \"memory\": \"37143\"\n },\n {\n \"code\": \"class Solution:\\n\\n # TODO: optimize by pre-computing longest palindrome substrings centered around\\n # each index for all words; this can then be used when checking the unmatched\\n # part of both the iterated word, and the words found from the suffix-trie\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n # build suffix-trie consisting of all given words\\n suffix_trie = {}\\n for i, w in enumerate(words):\\n node = suffix_trie\\n for c in w[::-1]: node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n\\n res = []\\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\\n node = suffix_trie\\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\\\"a\\\", \\\"\\\") & (\\\"lls\\\", \\\"ll\\\")\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]: res.append((i, node[\\\"*\\\"]))\\n \\n if c in node: node = node[c]\\n else: break\\n else: # the entire current-`w` found as a prefix in the suffix-trie\\n for j in Solution.get_unmatched_palin_substring_idxs(node):\\n if i != j: res.append((i, j))\\n\\n return res\\n\\n\\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\\n @staticmethod\\n def get_unmatched_palin_substring_idxs(trie_node):\\n ss_idxs = {}\\n def _fetch(node, ss): \\n for c, nn in node.items():\\n if c == \\\"*\\\": ss_idxs[ss] = node[c]\\n else: _fetch(nn, f\\\"{ss}{c}\\\")\\n _fetch(trie_node, \\\"\\\")\\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]\",\n \"memory\": \"40961\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # build suffix-trie consisting of all given words\\n suffix_trie = {}\\n for i, w in enumerate(words):\\n node = suffix_trie\\n for c in w[::-1]:\\n node = node.setdefault(c, {})\\n node[\\\"*\\\"] = i\\n\\n res = []\\n for i, w in enumerate(words): # try each word (`w`) as the 1st part (w_i) of the palindrom-pair\\n node = suffix_trie\\n for k, c in enumerate(w): # try matching all chars in current-`w` against the suffix-trie\\n\\n # check potential palindrome-pair when w_i is longer than w_j: e.g. (\\\"a\\\", \\\"\\\") & (\\\"lls\\\", \\\"ll\\\")\\n if \\\"*\\\" in node and i != node[\\\"*\\\"] and w[k:] == w[k:][::-1]:\\n res.append((i, node[\\\"*\\\"]))\\n \\n if c in node: # keep matching current-`w` against suffix-trie\\n node = node[c]\\n else: # the k-th char not found in trie, so break-out to not trigger the for-else clause\\n break\\n else: # the entire current-`w` found as a prefix in the suffix-trie\\n for j in Solution.get_unmatched_palin_substring_idxs(node):\\n if i != j:\\n res.append((i, j))\\n\\n return res\\n\\n\\n # finds and returns all word-indices of unmatched remaining substrings that are also palindromes\\n @staticmethod\\n def get_unmatched_palin_substring_idxs(trie_node):\\n ss_idxs = {}\\n def _fetch(node, ss): \\n for c, nn in node.items():\\n if c == \\\"*\\\":\\n ss_idxs[ss] = node[c]\\n else:\\n _fetch(nn, f\\\"{ss}{c}\\\")\\n _fetch(trie_node, \\\"\\\")\\n return [idx for (ss, idx) in ss_idxs.items() if ss == ss[::-1]]\",\n \"memory\": \"44778\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = {}\\n for i,w in enumerate(words):\\n node = trie\\n for letter in w[::-1]:\\n node = node.setdefault(letter, {})\\n node['$'] = i\\n ans = []\\n\\n def gen(node, string):\\n ans = set()\\n if '$' in node and string == string[::-1]: ans.add(node['$'])\\n for letter in node:\\n if letter != '$':\\n ans |= gen(node[letter], string + letter)\\n return ans\\n\\n for i,w in enumerate(words):\\n node = trie\\n k = len(w)\\n idx = 0\\n while idx < k:\\n letter = w[idx]\\n if '$' in node:\\n if w[idx:] == w[idx:][::-1] and i != node['$']:\\n ans.append([i, node['$']])\\n if letter in node:\\n node = node[letter]\\n idx += 1\\n else: break\\n if idx == k:\\n # generate all subsequent strs\\n candidates = gen(node, \\\"\\\")\\n for j in candidates:\\n if i != j: ans.append([i,j])\\n return ans\",\n \"memory\": \"48596\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n trie = {}\\n\\n for i in range(len(words)):\\n node = trie \\n for le in words[i][::-1]:\\n if le not in node:\\n node[le] = {}\\n node = node[le]\\n node['end'] = i\\n \\n def checkpal(word):\\n i = 0 \\n j = len(word)-1\\n while i < j:\\n if word[i] != word[j]:\\n return False \\n else:\\n i += 1\\n j -= 1\\n return True\\n \\n\\n def backtrack(node, curr):\\n result = []\\n if 'end' in node:\\n if checkpal(curr):\\n result.append(node['end'])\\n \\n for n in node:\\n if n != 'end':\\n result += backtrack(node[n], curr+n)\\n\\n return result\\n \\n \\n ans = []\\n\\n for i in range(len(words)):\\n node = trie\\n valid = True\\n for j in range(len(words[i])):\\n if 'end' in node and checkpal(words[i][j::]):\\n ans.append([i, node['end']])\\n\\n if words[i][j] not in node:\\n valid = False\\n break\\n else:\\n node = node[words[i][j]]\\n\\n\\n if valid:\\n for cand in backtrack(node, ''):\\n if i != cand:\\n ans.append([i, cand])\\n\\n \\n \\n return ans\\n \",\n \"memory\": \"52413\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n trie = {}\\n\\n for i in range(len(words)):\\n node = trie \\n for le in words[i][::-1]:\\n if le not in node:\\n node[le] = {}\\n node = node[le]\\n node['end'] = i\\n \\n def checkpal(word):\\n i = 0 \\n j = len(word)-1\\n while i < j:\\n if word[i] != word[j]:\\n return False \\n else:\\n i += 1\\n j -= 1\\n return True\\n \\n\\n def backtrack(node, curr):\\n result = []\\n if 'end' in node:\\n if checkpal(curr):\\n result.append(node['end'])\\n \\n for n in node:\\n if n != 'end':\\n result += backtrack(node[n], curr+n)\\n\\n return result\\n \\n \\n ans = []\\n\\n for i in range(len(words)):\\n node = trie\\n valid = True\\n for j in range(len(words[i])):\\n if 'end' in node and checkpal(words[i][j::]):\\n ans.append([i, node['end']])\\n\\n if words[i][j] not in node:\\n valid = False\\n break\\n else:\\n node = node[words[i][j]]\\n\\n if valid:\\n for cand in backtrack(node, ''):\\n if i != cand:\\n ans.append([i, cand]) \\n \\n return ans\\n \",\n \"memory\": \"52413\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\nclass Trie:\\n\\n def __init__(self):\\n self.trie = {}\\n\\n def insert(self, word, index):\\n base_trie = self.trie\\n for c in word:\\n if c in base_trie:\\n base_trie = base_trie[c]\\n else:\\n base_trie[c] = {}\\n base_trie = base_trie[c]\\n\\n base_trie[\\\"index\\\"] = index\\n base_trie[\\\"is_word\\\"] = True\\n\\n def has_word(self, word):\\n base_trie = self.trie\\n for c in word:\\n if c in base_trie:\\n base_trie = base_trie[c]\\n else:\\n return False, None\\n\\n return base_trie.get(\\\"is_word\\\", False), base_trie.get(\\\"index\\\")\\n\\n def get_prefix(self, prefix):\\n base_trie = self.trie\\n for c in prefix:\\n if c in base_trie:\\n base_trie = base_trie[c]\\n else:\\n return None\\n\\n return base_trie\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n # insert every word into trie\\n for k, word in enumerate(words):\\n trie.insert(word, k)\\n\\n ret = []\\n for k, word in enumerate(words):\\n if word == \\\"\\\":\\n continue\\n\\n # exact match of reverse\\n # i.e abcd -> dbca\\n word_rev = word[::-1]\\n has_word, idx = trie.has_word(word_rev)\\n if has_word and idx != k:\\n ret.append([idx, k])\\n\\n word_len = len(word)\\n # palindrome prefix + suffix\\n for i in range(1, word_len):\\n prefix = word[:i]\\n suffix = word[i:]\\n prefix_rev = prefix[::-1]\\n if prefix == prefix_rev:\\n has_word, idx = trie.has_word(suffix[::-1])\\n if has_word:\\n # print(idx, k)\\n ret.append([idx, k])\\n\\n # prefix + palindrome suffix\\n for i in range(word_len-1, 0, -1):\\n suffix = word[i:]\\n suffix_rev = suffix[::-1]\\n prefix = word[:i]\\n if suffix == suffix_rev:\\n has_word, idx = trie.has_word(prefix[::-1])\\n if has_word:\\n ret.append([k, idx])\\n\\n # word is palindrome\\n if word == word_rev:\\n has_word, idx = trie.has_word(\\\"\\\")\\n # print(word, k, idx)\\n if has_word:\\n ret.append([k, idx])\\n ret.append([idx, k])\\n\\n return ret\",\n \"memory\": \"56231\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ans = []\\n trie = Trie(words)\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n for i in range(len(words)):\\n candidates = trie.search(i)\\n for candidate in candidates:\\n ans.append([candidate, i])\\n return ans\\n \\n\\nclass Trie:\\n def __init__(self, words):\\n self.root = TrieNode()\\n self.words = words\\n\\n def insert(self, word, index=-1):\\n node = self.root\\n for c in word:\\n if c not in node.children:\\n node.children[c] = TrieNode()\\n node = node.children[c]\\n node.index = index\\n\\n def isPalindrome(self, word, i, j):\\n if j < 0:\\n j = len(word) + j\\n while i < j:\\n if word[i] != word[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n def search(self, wordIndex):\\n word = self.words[wordIndex]\\n if not word:\\n return [i for i in range(len(self.words)) if i != wordIndex and self.isPair(i, wordIndex)]\\n node = self.root\\n i = -1\\n candidates = []\\n while i >= -len(word):\\n c = word[i]\\n if c not in node.children and node.index == -1:\\n break\\n if node.index >= 0:\\n candidates.append(node.index)\\n if c in node.children:\\n node = node.children[c]\\n i -= 1\\n else:\\n break\\n if i<-len(word):\\n candidates += node.getRest()\\n return [candidate for candidate in candidates if self.isPair(candidate, wordIndex)]\\n\\n def isPair(self, candidate, wordIndex):\\n if candidate==wordIndex:\\n return False\\n word1 = self.words[candidate]\\n word2 = self.words[wordIndex]\\n if len(word1)>len(word2):\\n return self.isPalindrome(word1, len(word2), -1)\\n elif len(word1)<len(word2):\\n return self.isPalindrome(word2, 0, -len(word1)-1)\\n else:\\n return True\\n\\n\\nclass TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n\\n def getRest(self):\\n def helper(node, ans):\\n if node.index >= 0:\\n ans.append(node.index)\\n for child in node.children.values():\\n helper(child, ans)\\n ans = []\\n helper(self, ans)\\n return ans\\n\",\n \"memory\": \"60048\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ans = []\\n trie = Trie(words)\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n for i in range(len(words)):\\n candidates = trie.search(i)\\n print(i, candidates)\\n for candidate in candidates:\\n ans.append([candidate, i])\\n return ans\\n \\n\\nclass Trie:\\n def __init__(self, words):\\n self.root = TrieNode()\\n self.words = words\\n\\n def insert(self, word, index=-1):\\n node = self.root\\n for c in word:\\n if c not in node.children:\\n node.children[c] = TrieNode()\\n node = node.children[c]\\n node.index = index\\n\\n def isPalindrome(self, word, i, j):\\n if j < 0:\\n j = len(word) + j\\n while i < j:\\n if word[i] != word[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n def search(self, wordIndex):\\n word = self.words[wordIndex]\\n if not word:\\n return [i for i in range(len(self.words)) if i != wordIndex and self.isPair(i, wordIndex)]\\n node = self.root\\n i = -1\\n candidates = []\\n while i >= -len(word):\\n c = word[i]\\n if c not in node.children and node.index == -1:\\n break\\n if node.index >= 0:\\n candidates.append(node.index)\\n if c in node.children:\\n node = node.children[c]\\n i -= 1\\n else:\\n break\\n if i<-len(word):\\n candidates += node.getRest()\\n return [candidate for candidate in candidates if self.isPair(candidate, wordIndex)]\\n\\n def isPair(self, candidate, wordIndex):\\n if candidate==wordIndex:\\n return False\\n word1 = self.words[candidate]\\n word2 = self.words[wordIndex]\\n if len(word1)>len(word2):\\n return self.isPalindrome(word1, len(word2), -1)\\n elif len(word1)<len(word2):\\n return self.isPalindrome(word2, 0, -len(word1)-1)\\n else:\\n return True\\n\\n\\nclass TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n\\n def getRest(self):\\n def helper(node, ans):\\n if node.index >= 0:\\n ans.append(node.index)\\n for child in node.children.values():\\n helper(child, ans)\\n ans = []\\n helper(self, ans)\\n return ans\\n\",\n \"memory\": \"63866\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n ans = []\\n trie = Trie(words)\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n for i in range(len(words)):\\n candidates = trie.search(i)\\n print(i, candidates)\\n for candidate in candidates:\\n ans.append([candidate, i])\\n return ans\\n \\n\\nclass Trie:\\n def __init__(self, words):\\n self.root = TrieNode()\\n self.words = words\\n\\n def insert(self, word, index=-1):\\n node = self.root\\n for c in word:\\n if c not in node.children:\\n node.children[c] = TrieNode()\\n node = node.children[c]\\n node.index = index\\n\\n def isPalindrome(self, word, i, j):\\n if j < 0:\\n j = len(word) + j\\n while i < j:\\n if word[i] != word[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n def search(self, wordIndex):\\n word = self.words[wordIndex]\\n if not word:\\n return [i for i in range(len(self.words)) if i != wordIndex and self.isPair(i, wordIndex)]\\n node = self.root\\n i = -1\\n candidates = []\\n while i >= -len(word):\\n c = word[i]\\n if c not in node.children and node.index == -1:\\n break\\n if node.index >= 0:\\n candidates.append(node.index)\\n if c in node.children:\\n node = node.children[c]\\n i -= 1\\n else:\\n break\\n if i<-len(word):\\n candidates += node.getRest()\\n return [candidate for candidate in candidates if self.isPair(candidate, wordIndex)]\\n\\n def isPair(self, candidate, wordIndex):\\n if candidate==wordIndex:\\n return False\\n word1 = self.words[candidate]\\n word2 = self.words[wordIndex]\\n if len(word1)>len(word2):\\n return self.isPalindrome(word1, len(word2), -1)\\n elif len(word1)<len(word2):\\n return self.isPalindrome(word2, 0, -len(word1)-1)\\n else:\\n return True\\n\\n\\nclass TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n\\n def getRest(self):\\n def helper(node, ans):\\n if node.index >= 0:\\n ans.append(node.index)\\n for child in node.children.values():\\n helper(child, ans)\\n ans = []\\n helper(self, ans)\\n return ans\\n\",\n \"memory\": \"67683\"\n },\n {\n \"code\": \"'''\\npalindrome pair: pair of integers (i, j)\\n i != j\\n words[i] + words[j] is a palindrome\\n\\nReturn an array of all palindrome pairs.\\n\\nBrute force: O(n^2 * k), for word length k.\\n\\nAim is to get ~O(nk).\\n\\nMy first intuition is... perhaps we can just do this with a dictionary lookup?\\n\\nIndex each word both directly and in reverse\\n cat --> [3]\\n tac --> [3]\\n\\nThen for cat, we could have the following palindromes...\\n cattac # easy case\\n catac # also easy\\n catxxxtac # hard case due to asymmetry.\\n\\nOk, but I think we can handle all of these:\\n- Case 1: exact reflection\\n - Just search for the word's reflection in the index.\\n- Case 2: len(prefix) > len(suffix)\\n - This means that the end of the prefix is a palindrome.\\n - Partition the prefix into [A] + [B], where B is a palindrome, and search for the reflection of A.\\n- Case 3: len(prefix) < len(suffix)\\n - Reverse both prefix and suffix\\n [cat] + [xxxtac] --> [catxxx] + [tac]\\n - Now defer to case 2.\\n - Since we're looking for palindromes, we don't even need to do a second reversal.\\n\\nHow do we do this efficiently?\\n- Dict lookup for suffix: fine, O(k) for a length-k string.\\n- Checking multiple prefixes, where each suffix is k\\n - Need: linear-time algorithm to find all palindromes in a string.\\n >> this gives us all the prefixes of a string for which we need to find reflections\\n trie to do the lookup for reflections in linear time\\n catxxx\\n do you have xxxtac?\\n xxtac?\\n xtac?\\n tac?\\n So we need to index the strings in reverse. Should be fine.\\n\\nHow do we find all palindromes of a string in linear time?\\nObviously there is the O(n^2) solution.\\n\\nManacher's algorithm comes to mind... IIRC the idea is that you keep track of the righthand edge of your palindrome as you scan across... or something like that...\\n\\nI'm not going to write the entire linear-time algorithm here. It would take too long.\\n\\nInstead, I am going to write the key pieces *minus* the linear-time palindrome identification\\n'''\\n\\ndef is_palindrome(word, i: int, j: int) -> bool:\\n while i < j:\\n if word[i] != word[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\ndef manachers_palindrome_suffixes(s: str):\\n # Preprocess the string to handle even-length palindromes\\n t = '#'.join(f'^{s}$')\\n n = len(t)\\n P = [0] * n # Array to store the radius of palindromes\\n C = R = 0 # C is the center, R is the rightmost boundary\\n\\n for i in range(1, n - 1):\\n mirror = 2 * C - i # Mirror of i with respect to C\\n\\n if i < R:\\n P[i] = min(R - i, P[mirror])\\n\\n # Try to expand the palindrome centered at i\\n while t[i + P[i] + 1] == t[i - P[i] - 1]:\\n P[i] += 1\\n\\n # If the palindrome expanded past R, adjust the center and right boundary\\n if i + P[i] > R:\\n C = i\\n R = i + P[i]\\n\\n # Now, gather palindromic suffix starts\\n palindromic_suffix_starts = []\\n m = len(s)\\n\\n # We want the palindromes that end at the last character of the original string\\n for i in range(n - 2, 0, -1):\\n if i + P[i] == n - 2: # Check if the palindrome reaches the end of the original string\\n start_idx = (i - P[i]) // 2\\n palindromic_suffix_starts.append(start_idx)\\n\\n print(s, palindromic_suffix_starts)\\n return palindromic_suffix_starts[::-1]\\n\\n'''\\nReturns a list of indices such that the suffix of word[:i] is a palindrome\\n\\ncatt --> [2, 3]\\n'''\\ndef compute_palindrome_suffixes(word: str) -> list[int]:\\n return manachers_palindrome_suffixes(word)\\n res = []\\n for i in range(len(word)):\\n if is_palindrome(word, i, len(word) - 1):\\n res.append(i)\\n res.append(len(word))\\n return res\\n\\nclass Trie():\\n\\n def __init__(self):\\n self.idx = -1\\n self.children = {}\\n \\n def add_word(self, word: str, idx: int) -> None:\\n t = self\\n for ch in word:\\n if ch not in t.children:\\n t.children[ch] = Trie()\\n t = t.children[ch]\\n t.idx = idx\\n \\n\\ndef palindrome_pairs(words: list[str]) -> list[list[int]]:\\n # indexing\\n t = Trie()\\n for word_idx, word in enumerate(words):\\n t.add_word(word[::-1], word_idx)\\n\\n # search\\n res = []\\n for word_idx, word in enumerate(words):\\n palindrome_suffixes = compute_palindrome_suffixes(word)\\n\\n word_ptr = 0\\n trie_ptr = t\\n for i in palindrome_suffixes:\\n # suppose the word is catxxx\\n # we want to know if xxxtac, xxtac, xtac, or tac are in the corpus\\n # therefore we index all the words in reverse\\n # and we search for prefixes normally... cat (for tac), catx (for xtac), etc.\\n while word_ptr < i:\\n c = word[word_ptr]\\n if c not in trie_ptr.children:\\n break\\n trie_ptr = trie_ptr.children[c]\\n word_ptr += 1\\n \\n if word_ptr != i:\\n # hopeless\\n break\\n \\n if trie_ptr.idx >= 0 and trie_ptr.idx != word_idx:\\n res.append((word_idx, trie_ptr.idx))\\n \\n return res\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n forward = palindrome_pairs(words)\\n backward = palindrome_pairs([word[::-1] for word in words])\\n backward = [(j,i) for i, j in backward]\\n return list(set(forward + backward))\",\n \"memory\": \"71501\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words):\\n trie = {}\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n if \\\"palindrome_suffixes\\\" not in current_level:\\n current_level[\\\"palindrome_suffixes\\\"] = []\\n\\n current_level[\\\"palindrome_suffixes\\\"].append(i)\\n\\n if c not in current_level:\\n current_level[c] = {}\\n # Move down the trie.\\n current_level = current_level[c]\\n current_level[\\\"ending_word\\\"] = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if (\\n current_level.get(\\\"ending_word\\\") is not None\\n and current_level[\\\"ending_word\\\"] != -1\\n ):\\n if (word[j:] == word[j:][::-1]): # Is the word the same as its reverse?\\n solutions.append([i, current_level[\\\"ending_word\\\"]])\\n\\n if c not in current_level:\\n break\\n current_level = current_level[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if (\\n current_level.get(\\\"ending_word\\\") is not None\\n and current_level[\\\"ending_word\\\"] != -1\\n and current_level[\\\"ending_word\\\"] != i\\n ):\\n solutions.append([i, current_level[\\\"ending_word\\\"]])\\n # Check for case 2.\\n for j in current_level.get(\\\"palindrome_suffixes\\\", []):\\n solutions.append([i, j])\\n return solutions\\n\",\n \"memory\": \"75318\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n trie = {}\\n ans = []\\n \\n for i,word in enumerate(words):\\n word = word[::-1]\\n temp = trie\\n for j,c in enumerate(word):\\n \\n if(word[j:] == word[j:][::-1]):\\n if(\\\"pal\\\" not in temp):\\n temp[\\\"pal\\\"] = []\\n temp[\\\"pal\\\"].append(i)\\n if(c not in temp):\\n temp[c] = {}\\n temp = temp[c]\\n temp[None] = i\\n \\n for i,word in enumerate(words):\\n temp = trie\\n for j,c in enumerate(word):\\n \\n if(None in temp):\\n if(word[j:] == word[j:][::-1]):\\n ans.append([i,temp[None]])\\n if(c not in temp):\\n break\\n temp = temp[c]\\n \\n else:\\n if(None in temp and i != temp[None]):\\n ans.append([i,temp[None]])\\n if(\\\"pal\\\" in temp):\\n for j in temp[\\\"pal\\\"]:\\n ans.append([i,j])\\n \\n return ans\",\n \"memory\": \"79136\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = {}\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n if \\\"palindrome_suffixes\\\" not in current_level:\\n current_level[\\\"palindrome_suffixes\\\"] = []\\n\\n current_level[\\\"palindrome_suffixes\\\"].append(i)\\n\\n if c not in current_level:\\n current_level[c] = {}\\n # Move down the trie.\\n current_level = current_level[c]\\n current_level[\\\"ending_word\\\"] = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.get(\\\"ending_word\\\") is not None and current_level[\\\"ending_word\\\"] != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level[\\\"ending_word\\\"]])\\n if c not in current_level:\\n break\\n current_level = current_level[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.get(\\\"ending_word\\\") is not None and current_level[\\\"ending_word\\\"] != -1 and current_level[\\\"ending_word\\\"] != i:\\n solutions.append([i, current_level[\\\"ending_word\\\"]])\\n # Check for case 2.\\n for j in current_level.get(\\\"palindrome_suffixes\\\", []):\\n solutions.append([i, j])\\n return solutions\",\n \"memory\": \"82953\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = {}\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n if \\\"palindrome_suffixes\\\" not in current_level:\\n current_level[\\\"palindrome_suffixes\\\"] = []\\n\\n current_level[\\\"palindrome_suffixes\\\"].append(i)\\n\\n if c not in current_level:\\n current_level[c] = {}\\n # Move down the trie.\\n current_level = current_level[c]\\n current_level[\\\"ending_word\\\"] = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.get(\\\"ending_word\\\") is not None and current_level[\\\"ending_word\\\"] != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level[\\\"ending_word\\\"]])\\n if c not in current_level:\\n break\\n current_level = current_level[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.get(\\\"ending_word\\\") is not None and current_level[\\\"ending_word\\\"] != -1 and current_level[\\\"ending_word\\\"] != i:\\n solutions.append([i, current_level[\\\"ending_word\\\"]])\\n # Check for case 2.\\n for j in current_level.get(\\\"palindrome_suffixes\\\", []):\\n solutions.append([i, j])\\n return solutions\",\n \"memory\": \"82953\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n # self.answer = set()\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n # self.answer.add((idx_a, idx_b))\\n self.answer.append([idx_a, idx_b])\\n\\n # def search_trie(self, word: str, ends: set[int], word_idx: int):\\n # front, cur = 0, self.head\\n # while front < len(word):\\n # if front in ends: # part end has to match with true end\\n # self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n # if word[front] in cur:\\n # cur = cur[word[front]]\\n # else:\\n # break\\n # front += 1\\n # # true end can match with either\\n # if front == len(word):\\n # self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n # self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n # for word_idx, word in enumerate(words):\\n # ends = set()\\n # for front in range(len(word)+1):\\n # if self.is_palindrome(word, front, len(word) - 1):\\n # ends.add(front)\\n # self.search_trie(word, ends, word_idx)\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"86771\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n return\\n front += 1\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"86771\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"90588\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back and word[front] == word[back]:\\n front += 1\\n back -= 1\\n if front >= back:\\n return True\\n return False\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"94406\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n return\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"94406\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back and word[front] == word[back]:\\n front += 1\\n back -= 1\\n if front >= back:\\n return True\\n return False\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"98223\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.head = {}\\n self.answer = []\\n\\n def is_palindrome(self, word: str, front: int, back: int) -> bool:\\n while front < back:\\n if word[front] != word[back]: return False\\n front += 1\\n back -= 1\\n return True\\n \\n def add_end_to_trie(self, node: dict, end_type: str, word_idx: int):\\n if end_type not in node:\\n node[end_type] = []\\n node[end_type].append(word_idx)\\n\\n def add_ends_to_trie(self, word: str, ends: set[int], word_idx: int):\\n front, cur = len(word), self.head\\n while front > 0:\\n if front in ends:\\n self.add_end_to_trie(cur, \\\"part_end\\\", word_idx)\\n front -= 1\\n if word[front] not in cur:\\n cur[word[front]] = {}\\n cur = cur[word[front]]\\n self.add_end_to_trie(cur, \\\"true_end\\\", word_idx)\\n\\n def add_to_answer(self, idx_a: int, b_indices: List[int]):\\n for idx_b in b_indices:\\n if idx_a != idx_b:\\n self.answer.append([idx_a, idx_b])\\n\\n def search_trie(self, word: str, word_idx: int):\\n front, cur = 0, self.head\\n while front < len(word):\\n # part end has to match with true end\\n if \\\"true_end\\\" in cur and self.is_palindrome(word, front, len(word) - 1):\\n self.add_to_answer(word_idx, cur[\\\"true_end\\\"])\\n if word[front] in cur:\\n cur = cur[word[front]]\\n else:\\n break\\n front += 1\\n if front == len(word):\\n self.add_to_answer(word_idx, cur.get(\\\"true_end\\\", []))\\n self.add_to_answer(word_idx, cur.get(\\\"part_end\\\", []))\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # create trie\\n for word_idx, word in enumerate(words):\\n ends = set()\\n for back in range(len(word)+1):\\n if self.is_palindrome(word, 0, back-1):\\n ends.add(back)\\n self.add_ends_to_trie(word, ends, word_idx)\\n # add pairs to answer\\n for word_idx, word in enumerate(words):\\n self.search_trie(word, word_idx)\\n return self.answer\\n\",\n \"memory\": \"102041\"\n },\n {\n \"code\": \"class Trie: \\n def __init__(self): \\n self.root = {}\\n \\n def insert(self, word, k): \\n node = self.root \\n for i, c in enumerate(word): \\n if word[i:] == word[i:][::-1]: node.setdefault(\\\"val\\\", []).append(k)\\n node = node.setdefault(c, {})\\n node.setdefault(\\\"val\\\", []).append(k)\\n node.setdefault(\\\"end\\\", []).append(k)\\n \\n def search(self, word): \\n ans = []\\n node = self.root\\n for i, c in enumerate(word): \\n if word[i:] == word[i:][::-1]: ans.extend(node.get(\\\"end\\\", []))\\n if c not in node: break \\n node = node[c]\\n else: ans += node.get(\\\"val\\\", [])\\n return ans \\n \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n for i, word in enumerate(words): \\n trie.insert(word, i)\\n \\n ans = set()\\n for i, word in enumerate(words): \\n val = trie.search(word[::-1])\\n for ii in val: \\n if ii != i: ans.add((ii, i))\\n return ans \",\n \"memory\": \"105858\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n #\\n class Prefix:\\n def __init__(self):\\n self.trie = {}\\n\\n def add_word(self, word, k):\\n curr = self.trie\\n for i in range(len(word)):\\n c = word[i]\\n if c not in curr:\\n curr[c] = {}\\n curr = curr[c]\\n curr.setdefault('+', []).append(k)\\n curr['*'] = k\\n if '+' in curr:\\n curr['+'].pop()\\n return\\n\\n def find_prefix(self, suffix, j):\\n curr = self.trie\\n extra_j = []\\n for i in reversed(range(len(suffix))):\\n c = suffix[i]\\n if c not in curr:\\n return [], extra_j\\n curr = curr[c]\\n if curr.get('*', j) != j:\\n extra_j.append(curr['*'])\\n extra_i = curr.get('+', [])\\n return extra_i, extra_j\\n\\n prefix = Prefix()\\n for i in range(len(words)):\\n prefix.add_word(words[i], i)\\n\\n is_palindrome = lambda x: x[0] == x[-1] and is_palindrome(x[1:-1]) if x else True\\n\\n rs = []\\n for j in range(len(words)):\\n if words[j] == '':\\n for i in range(len(words)):\\n if i != j and is_palindrome(words[i]):\\n rs.append([i, j])\\n rs.append([j, i])\\n continue\\n extra_i, extra_j = prefix.find_prefix(words[j], j)\\n # print(extra_i, extra_j)\\n for i in extra_i:\\n if i != j:\\n extra = words[i][len(words[j]):]\\n if is_palindrome(extra):\\n rs.append([i, j])\\n\\n for i in extra_j:\\n if i != j:\\n extra = words[j][: len(words[j])-len(words[i])]\\n if is_palindrome(extra):\\n rs.append([i, j])\\n\\n return rs\\n\\n\\n \",\n \"memory\": \"109676\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n #\\n # a : [bcd, b: [cd, c: [d : 0]]]\\n class Prefix:\\n def __init__(self):\\n self.trie = {}\\n\\n def add_word(self, word, k):\\n curr = self.trie\\n for i in range(len(word)):\\n c = word[i]\\n if c not in curr:\\n curr[c] = {}\\n curr = curr[c]\\n curr.setdefault('+', []).append(k)\\n curr['*'] = k\\n if '+' in curr:\\n curr['+'].pop()\\n return\\n\\n def find_prefix(self, suffix, j):\\n curr = self.trie\\n extra_j = []\\n for i in reversed(range(len(suffix))):\\n # print('-', extra_j)\\n c = suffix[i]\\n # print('-', c)\\n if c not in curr:\\n return [], extra_j\\n curr = curr[c]\\n if curr.get('*', j) != j:\\n extra_j.append(curr['*'])\\n # print(extra_j)\\n # print( suffix[:i])\\n extra_i = curr.get('+', [])\\n return extra_i, extra_j\\n\\n prefix = Prefix()\\n for i in range(len(words)):\\n prefix.add_word(words[i], i)\\n \\n # print(prefix.trie)\\n # print(prefix.find_prefix('abcd', 0))\\n # print(prefix.find_prefix('lls', 2))\\n # print(prefix.find_prefix('tab', 1))\\n # print(prefix.find_prefix('a', 0))\\n\\n # return []\\n\\n is_palindrome = lambda x: x[0] == x[-1] and is_palindrome(x[1:-1]) if x else True\\n\\n rs = []\\n for j in range(len(words)):\\n if words[j] == '':\\n for i in range(len(words)):\\n if i != j and is_palindrome(words[i]):\\n rs.append([i, j])\\n rs.append([j, i])\\n continue\\n extra_i, extra_j = prefix.find_prefix(words[j], j)\\n print(extra_i, extra_j)\\n for i in extra_i:\\n if i != j:\\n extra = words[i][len(words[j]):]\\n if is_palindrome(extra):\\n rs.append([i, j])\\n\\n for i in extra_j:\\n if i != j:\\n extra = words[j][: len(words[j])-len(words[i])]\\n if is_palindrome(extra):\\n rs.append([i, j])\\n # if i!=j and is_palindrome(mid):\\n # rs.append([i, j])\\n\\n # print(rs)\\n\\n return rs\\n # for i in match_sz:\\n # sz = match_sz[i]\\n # middle = words[i][sz:] + words[j][:len(words[j]) - sz]\\n # print(words[i], words[j], middle)\\n # if is_palindrome(middle):\\n # rs.append([i, j])\\n\\n \",\n \"memory\": \"113493\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self):\\n self.adj = None\\n self.isWord = False\\n self.idx = -1\\nclass Trie:\\n def __init__(self):\\n self.root = Node()\\n def addWord(self, word, idx):\\n def dfs(word, node, idx):\\n if len(word) == 0:\\n node.isWord = True\\n node.idx = idx\\n return\\n if node.adj == None:\\n node.adj = dict()\\n if word[0] in node.adj:\\n dfs(word[1:], node.adj[word[0]], idx)\\n else:\\n newNode = Node()\\n node.adj[word[0]] = newNode\\n dfs(word[1:], newNode, idx)\\n dfs(word, self.root, idx)\\n def prefix(self, word):\\n ans = list()\\n def isPalindrome(cur):\\n return cur == cur[::-1]\\n def getIdxs(node):\\n ans = []\\n def ddfs(node, cur):\\n if node == None:\\n return\\n if node.isWord:\\n if (isPalindrome(cur)):\\n ans.append(node.idx)\\n if node.adj != None:\\n for k in node.adj:\\n ddfs(node.adj[k], cur + k)\\n ddfs(node, \\\"\\\")\\n return ans\\n\\n def dfs(word, node):\\n if len(word) == 0:\\n kk = getIdxs(node)\\n for i in kk:\\n ans.append(i)\\n return\\n if node.isWord:\\n if isPalindrome(word):\\n ans.append(node.idx)\\n if node.adj == None:\\n return False\\n if word[0] in node.adj:\\n dfs(word[1:], node.adj[word[0]])\\n return False\\n \\n dfs(word, self.root)\\n return ans\\n \\n \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n ans = []\\n N = len(words)\\n for i in range(N):\\n trie.addWord(words[i], i)\\n for i in range(N):\\n idxs = trie.prefix(words[i][::-1])\\n for _id in idxs:\\n if _id != i:\\n ans.append([_id, i])\\n return ans\\n\\n\\n \",\n \"memory\": \"117311\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self):\\n self.adj = None\\n self.isWord = False\\n self.idx = -1\\nclass Trie:\\n def __init__(self):\\n self.root = Node()\\n def addWord(self, word, idx):\\n def dfs(word, node, idx):\\n if len(word) == 0:\\n node.isWord = True\\n node.idx = idx\\n return\\n if node.adj == None:\\n node.adj = dict()\\n if word[0] in node.adj:\\n dfs(word[1:], node.adj[word[0]], idx)\\n else:\\n newNode = Node()\\n node.adj[word[0]] = newNode\\n dfs(word[1:], newNode, idx)\\n dfs(word, self.root, idx)\\n def prefix(self, word):\\n ans = list()\\n def isPalindrome(cur):\\n return cur == cur[::-1]\\n def getIdxs(node):\\n ans = []\\n def ddfs(node, cur):\\n if node == None:\\n return\\n if node.isWord:\\n if (isPalindrome(cur)):\\n ans.append(node.idx)\\n if node.adj != None:\\n for k in node.adj:\\n ddfs(node.adj[k], cur + k)\\n ddfs(node, \\\"\\\")\\n return ans\\n\\n def dfs(word, node):\\n if len(word) == 0:\\n kk = getIdxs(node)\\n for i in kk:\\n ans.append(i)\\n return\\n if node.isWord:\\n if isPalindrome(word):\\n ans.append(node.idx)\\n if node.adj == None:\\n return False\\n if word[0] in node.adj:\\n dfs(word[1:], node.adj[word[0]])\\n return False\\n \\n dfs(word, self.root)\\n return ans\\n \\n \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n ans = []\\n N = len(words)\\n for i in range(N):\\n trie.addWord(words[i], i)\\n for i in range(N):\\n idxs = trie.prefix(words[i][::-1])\\n for _id in idxs:\\n if _id != i:\\n ans.append([_id, i])\\n return ans\",\n \"memory\": \"117311\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self, is_word=False, word_index=-1):\\n self.is_word = is_word\\n self.word_index = word_index\\n self.children = {}\\n\\nclass Trie:\\n\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, word: str, index: int) -> None:\\n cur_node = self.root\\n\\n for i in range(len(word)):\\n if word[i] not in cur_node.children:\\n cur_node.children[word[i]] = TrieNode()\\n cur_node = cur_node.children[word[i]]\\n \\n cur_node.word_index = index\\n cur_node.is_word = True\\n\\n # def search(self, word: str) -> Optional[TrieNode]:\\n # cur_node = self.root\\n\\n # for i in range(len(word)):\\n # if word[i] not in cur_node.children:\\n # return None\\n # cur_node = cur_node.children[word[i]]\\n \\n # if cur_node and cur_node.is_word:\\n # return cur_node\\n # return None\\n\\n # def startsWith(self, prefix: str) -> Optional[TrieNode]:\\n # cur_node = self.root\\n\\n # for i in range(len(prefix)):\\n # if word[i] not in cur_node.children:\\n # return None\\n # cur_node = cur_node.children[word[i]]\\n \\n # return cur_node\\n\\nclass Solution:\\n def isSameReverse(self, word: str) -> bool:\\n return word == word[::-1]\\n\\n def dfs(self, cur_node: TrieNode, index: int, cur_word: str) -> List[List[int]]:\\n pairs = []\\n\\n if cur_node.is_word and index != cur_node.word_index and self.isSameReverse(cur_word):\\n pairs.append([index, cur_node.word_index])\\n\\n for key in cur_node.children.keys():\\n pairs += self.dfs(cur_node.children[key], index, cur_word + key)\\n \\n return pairs\\n\\n def findPairs(self, trie: Trie, word: str, index: int) -> List[List[int]]:\\n pairs = []\\n cur_node = trie.root\\n\\n for i in range(len(word)):\\n if cur_node.is_word and index != cur_node.word_index and self.isSameReverse(word[i:]):\\n pairs.append([index, cur_node.word_index])\\n if word[i] not in cur_node.children:\\n return pairs\\n cur_node = cur_node.children[word[i]]\\n\\n pairs += self.dfs(cur_node, index, '')\\n return pairs\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n pairs = []\\n\\n for i, word in enumerate(words):\\n trie.insert(word[::-1], i)\\n \\n for i, word in enumerate(words):\\n pairs += self.findPairs(trie, word, i)\\n\\n return pairs\\n\",\n \"memory\": \"121128\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self, data=None):\\n self.data = data\\n self.children = {}\\n self.index = -1\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, idx, word):\\n curr = self.root\\n for ch in list(word):\\n if ch not in curr.children:\\n curr.children[ch] = TrieNode(ch)\\n curr = curr.children[ch]\\n curr.index = idx\\n\\n def isPalindrome(self, s, l, h):\\n while l <= h:\\n if s[l] != s[h]:\\n return False\\n l += 1\\n h -= 1\\n return True\\n\\n def searchCase2(self, curr, temp, s):\\n if curr.index != -1:\\n if self.isPalindrome(s, 0, len(s)-1):\\n temp.append(curr.index)\\n\\n for ch, child in curr.children.items():\\n self.searchCase2(child, temp, s+ch)\\n\\n def search(self, word, temp):\\n curr = self.root\\n \\n # case 1: when a prefix of string word, exactly matched with a word in trie.\\n for i in range(len(word)):\\n ch = word[i]\\n if curr.index != -1:\\n # check rest of the word is palindrome.\\n if self.isPalindrome(word, i, len(word)-1):\\n temp.append(curr.index)\\n\\n if ch in curr.children:\\n curr = curr.children[ch]\\n else:\\n return\\n\\n # case 2: search word is a prefix of a word in the trie.\\n # check remaining subtrees in the trie for the palindrome.\\n\\n self.searchCase2(curr, temp, \\\"\\\")\\n\\n\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n # insert all words its reversed order to check the palindrome.\\n for i in range(len(words)):\\n self.insert(i, words[i][::-1])\\n\\n ans = []\\n # find palidromic pairs of each word.\\n for i in range(len(words)):\\n myPalindrome = []\\n self.search(words[i], myPalindrome)\\n\\n for idx in myPalindrome:\\n if idx != i: \\n ans.append([i, idx])\\n\\n return ans\",\n \"memory\": \"124946\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n for index, word in enumerate(words):\\n trie.insertWord(word[::-1], index)\\n\\n ans = []\\n for index, word in enumerate(words):\\n node = trie.root\\n\\n charIndex = 0\\n while charIndex < len(word):\\n char = word[charIndex]\\n remainingStr = word[charIndex:]\\n if (\\n node.isEnd\\n and node.index != index\\n and remainingStr == remainingStr[::-1]\\n ):\\n ans.append([index, node.index])\\n if char not in node.children:\\n break\\n node = node.children[char]\\n charIndex += 1\\n # print(index, word, charIndex, node.index)\\n\\n if charIndex == len(word):\\n\\n def dfs(node, currStr, ans, index):\\n\\n if node.isEnd and node.index != index and currStr == currStr[::-1]:\\n ans.append([index, node.index])\\n\\n if not node.children:\\n return\\n\\n for child in node.children:\\n dfs(node.children[child], currStr + child, ans, index)\\n\\n dfs(node, \\\"\\\", ans, index)\\n\\n if (\\n \\\"\\\" in trie.root.children\\n and trie.root.children[\\\"\\\"].index != index\\n and word == word[::-1]\\n ):\\n ans.append([index, trie.root.children[\\\"\\\"].index])\\n\\n return ans\\n\\n\\nclass TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.isEnd = False\\n self.index = -1\\n\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insertWord(self, word, index):\\n node = self.root\\n\\n if word == \\\"\\\":\\n node.children[word] = TrieNode()\\n node = node.children[word]\\n\\n for char in word:\\n if not char in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.isEnd = True\\n node.index = index\\n\",\n \"memory\": \"128763\"\n },\n {\n \"code\": \"import queue\\n\\ndef is_pair(w1, w2):\\n concat = w1 + w2\\n return concat == concat[::-1]\\n\\nclass TrieNode:\\n def __init__(self, key=None, val=None):\\n self.key = key\\n self.val = val\\n self.children = {}\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode(\\\"\\\", None)\\n \\n def insert(self, key, word):\\n curr = self.root\\n if word == \\\"\\\":\\n curr.children[\\\"\\\"] = TrieNode(key=key, val=\\\"\\\")\\n for i in range(len(word)-1, -1, -1):\\n if word[i] not in curr.children:\\n curr.children[word[i]] = TrieNode(key=None, val=None)\\n if i == 0:\\n curr.children[word[i]].key = key\\n curr.children[word[i]].val = word\\n curr = curr.children[word[i]]\\n \\n def search_right(self, key, word):\\n prefixes = []\\n i, curr = 0, self.root\\n if \\\"\\\" in curr.children:\\n prefixes.append(curr.children[\\\"\\\"])\\n while i < len(word):\\n if word[i] not in curr.children:\\n break\\n if curr.children[word[i]].val is not None:\\n prefixes.append(curr.children[word[i]])\\n curr = curr.children[word[i]]\\n i += 1\\n \\n if i == len(word):\\n prefixes.extend(self.words(curr))\\n\\n pairs = set()\\n for prefix in prefixes:\\n if is_pair(word, prefix.val) and key != prefix.key:\\n pairs.add((key, prefix.key))\\n \\n return pairs\\n\\n def words(self, root):\\n if not root:\\n return []\\n\\n result = []\\n q = queue.Queue()\\n q.put(root)\\n while not q.empty():\\n curr = q.get()\\n if len(curr.children) == 0:\\n continue\\n for k, v in curr.children.items():\\n if v is not None and v.val is not None:\\n result.append(v)\\n q.put(curr.children[k])\\n \\n return result\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n if len(words) == 0:\\n return []\\n\\n trie = Trie()\\n for i, word in enumerate(words):\\n trie.insert(i, word)\\n\\n pairs = set()\\n for i, word in enumerate(words):\\n for pair in trie.search_right(i, word):\\n pairs.add(pair)\\n \\n return list(map(list, pairs))\\n \",\n \"memory\": \"132581\"\n },\n {\n \"code\": \"class TrieNode: \\n def __init__(self):\\n self.children = defaultdict(TrieNode)\\n self.is_end = False\\n self.index = -1 \\n \\n def addWord(self, word, index):\\n node = self\\n for char in word:\\n if char not in node.children: \\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.is_end = True\\n node.index = index\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # Trie data structure. \\n # Build the Trie. \\n result, root = [], TrieNode()\\n for index, word in enumerate(words):\\n root.addWord(word[::-1], index)\\n \\n # Find results/ \\n for index, word in enumerate(words):\\n node = root \\n for i, char in enumerate(word): \\n if node.is_end and self.isPalindrome(word[i:]):\\n result.append([index, node.index])\\n if char not in node.children:\\n break\\n node = node.children[char]\\n # If for loop executes without breaking. \\n else:\\n self.check_remaining_suffixes(node, index, \\\"\\\", result)\\n \\n return result\\n \\n def check_remaining_suffixes(self, node, index, suffix, result):\\n if node.is_end and index != node.index and self.isPalindrome(suffix):\\n result.append([index, node.index])\\n \\n for char, child in node.children.items():\\n self.check_remaining_suffixes(child, index, suffix + char, result)\\n\\n def isPalindrome(self, word):\\n return word == word[::-1] \\n \\n\\n\\n\\n\",\n \"memory\": \"136398\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n _trie_init = lambda: defaultdict(_trie_init)\\n self.root = _trie_init()\\n\\n def add_word(self, word, word_idx):\\n curr = self.root\\n for idx, c in enumerate(word):\\n curr = curr[c]\\n if 'children' not in curr:\\n curr['children'] = []\\n if idx < len(word) - 1 and Trie.is_palindrome(word, idx + 1, len(word) - 1):\\n curr['children'].append((word_idx, word))\\n curr['end'] = True\\n curr['idx'] = word_idx\\n\\n def find_words(self, word):\\n ans = []\\n curr = self.root\\n for idx, c in enumerate(word):\\n if c not in curr:\\n return ans\\n curr = curr[c]\\n if curr['end'] is True and Trie.is_palindrome(word, idx + 1, len(word) - 1):\\n ans.append(curr['idx'])\\n if 'children' in curr:\\n ans.extend([word_idx for word_idx, _ in curr['children']])\\n return ans\\n\\n @staticmethod\\n def is_palindrome(word, start, end):\\n while start < end:\\n if word[start] != word[end]:\\n return False\\n start += 1\\n end -= 1\\n return True\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n ans = []\\n\\n for word_idx, word in enumerate(words):\\n trie.add_word(word[::-1], word_idx)\\n\\n for word_idx, word in enumerate(words):\\n matches = trie.find_words(word)\\n for idx in matches:\\n if idx == word_idx:\\n continue\\n ans.append([word_idx, idx])\\n\\n if '' in words:\\n empty_idx = words.index('')\\n for idx, word in enumerate(words):\\n if not Trie.is_palindrome(word, 0, len(word) - 1) or idx == empty_idx:\\n continue\\n ans.extend([[idx, empty_idx], [empty_idx, idx]])\\n\\n return ans\\n\",\n \"memory\": \"140216\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = [{}, [], -1]\\n for i, w in enumerate(words):\\n w = w[::-1]\\n node = root\\n for j, c in enumerate(w):\\n if w[j:] == w[j:][::-1]:\\n node[1].append(i)\\n if c not in node[0]:\\n node[0][c] = [{}, [], -1]\\n node = node[0][c]\\n node[2] = i\\n l = []\\n for i, w in enumerate(words):\\n node = root\\n for j, c in enumerate(w):\\n if w[j:] == w[j:][::-1] and node[2] != -1:\\n l.append([i, node[2]])\\n if c not in node[0]:\\n break\\n node = node[0][c]\\n else:\\n if node[2] != -1 and node[2] != i:\\n l.append([i, node[2]])\\n for j in node[1]:\\n l.append([i, j])\\n return l\\n\\n # l = []\\n # m = {w[::-1]: i for i, w in enumerate(words)}\\n # for i, w in enumerate(words):\\n # if w in m and i != m[w]:\\n # l.append([i, m[w]])\\n # for j in range(len(w)):\\n # s = w[j:]\\n # rs = w[:j]\\n # if s == s[::-1] and rs in m and i != m[rs]:\\n # l.append([i, m[rs]])\\n # p = w[:j + 1]\\n # rp = w[j + 1:]\\n # if p == p[::-1] and rp in m and i != m[rp]:\\n # l.append([m[rp], i])\\n # return l\\n \",\n \"memory\": \"144033\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n root = [{}, [], -1]\\n for i, w in enumerate(words):\\n w = w[::-1]\\n node = root\\n for j, c in enumerate(w):\\n if w[j:] == w[j:][::-1]:\\n node[1].append(i)\\n if c not in node[0]:\\n node[0][c] = [{}, [], -1]\\n node = node[0][c]\\n node[2] = i\\n l = []\\n for i, w in enumerate(words):\\n node = root\\n for j, c in enumerate(w):\\n if w[j:] == w[j:][::-1] and node[2] != -1:\\n l.append([i, node[2]])\\n if c not in node[0]:\\n break\\n node = node[0][c]\\n else:\\n if node[2] != -1 and node[2] != i:\\n l.append([i, node[2]])\\n for j in node[1]:\\n l.append([i, j])\\n return l\\n\\n # l = []\\n # m = {w[::-1]: i for i, w in enumerate(words)}\\n # for i, w in enumerate(words):\\n # if w in m and i != m[w]:\\n # l.append([i, m[w]])\\n # for j in range(len(w)):\\n # s = w[j:]\\n # rs = w[:j]\\n # if s == s[::-1] and rs in m and i != m[rs]:\\n # l.append([i, m[rs]])\\n # p = w[:j + 1]\\n # rp = w[j + 1:]\\n # if p == p[::-1] and rp in m and i != m[rp]:\\n # l.append([m[rp], i])\\n # return l\\n \",\n \"memory\": \"151668\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n class TrieNode:\\n def __init__(self):\\n self.trie = {}\\n self.palindromes = []\\n self.index = -1\\n \\n def __repr__(self):\\n z = f'{self.palindromes}'\\n z += f', index = {self.index}'\\n z += ', trie =' + repr(self.trie)\\n return z\\n\\n def add_word(self, word, k):\\n curr = self\\n for i in range(len(word)):\\n ch = word[i]\\n if ch not in curr.trie:\\n curr.trie[ch] = TrieNode()\\n curr = curr.trie[ch]\\n if i<len(word)-1 and word[i+1:] == word[i+1:][::-1]:\\n curr.palindromes.append(k)\\n curr.index = k\\n \\n def match_prefix(self, word, k):\\n curr = self\\n ans = []\\n for i in reversed(range(len(word))):\\n ch = word[i]\\n # print(ch)\\n if ch not in curr.trie:\\n return ans \\n curr = curr.trie[ch]\\n if curr.index != -1 and curr.index != k:\\n if word[:i] == word[:i][::-1]:\\n ans.append([curr.index, k])\\n # print(ans)\\n\\n for j in curr.palindromes:\\n if j != k:\\n ans.append([j, k])\\n print(ans)\\n return ans\\n\\n\\n tobj = TrieNode()\\n for k in range(len(words)):\\n tobj.add_word(words[k], k)\\n\\n # print(repr(tobj.trie))\\n rs = []\\n for k in range(len(words)):\\n rs += tobj.match_prefix(words[k], k)\\n # print('&', words[k], k, rs)\\n # print(words[k], k)\\n\\n if tobj.index != -1:\\n j = tobj.index\\n for i in range(len(words)):\\n if i == j:\\n continue\\n if words[i] == words[i][::-1]:\\n rs.append([i, j])\\n rs.append([j, i])\\n\\n return rs\\n\\n\\n\\n \",\n \"memory\": \"155486\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n class TrieNode:\\n def __init__(self):\\n self.trie = {}\\n self.palindromes = []\\n self.index = -1\\n \\n def __repr__(self):\\n z = f'{self.palindromes}'\\n z += f', index = {self.index}'\\n z += ', trie =' + repr(self.trie)\\n return z\\n\\n def add_word(self, word, k):\\n curr = self\\n if word == word[::-1]:\\n curr.palindromes.append(k)\\n for i in range(len(word)):\\n ch = word[i]\\n if ch not in curr.trie:\\n curr.trie[ch] = TrieNode()\\n curr = curr.trie[ch]\\n if i<len(word)-1 and word[i+1:] == word[i+1:][::-1]:\\n curr.palindromes.append(k)\\n curr.index = k\\n \\n def match_prefix(self, word, k):\\n curr = self\\n ans = []\\n for i in reversed(range(len(word))):\\n ch = word[i]\\n # print(ch)\\n if ch not in curr.trie:\\n return ans \\n curr = curr.trie[ch]\\n if curr.index != -1 and curr.index != k:\\n if word[:i] == word[:i][::-1]:\\n ans.append([curr.index, k])\\n # print(ans)\\n\\n for j in curr.palindromes:\\n if j != k:\\n ans.append([j, k])\\n # print(ans)\\n return ans\\n\\n\\n tobj = TrieNode()\\n for k in range(len(words)):\\n tobj.add_word(words[k], k)\\n\\n # print(repr(tobj.trie))\\n rs = []\\n for k in range(len(words)):\\n if words[k]:\\n rs += tobj.match_prefix(words[k], k)\\n # print('&', words[k], k, rs)\\n # print(words[k], k)\\n\\n # print(rs)\\n if tobj.index != -1:\\n j = tobj.index\\n for i in tobj.palindromes:\\n if i != j:\\n rs.append([i, j])\\n rs.append([j, i])\\n\\n return rs\\n\\n\\n\\n \",\n \"memory\": \"159303\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n class TrieNode:\\n def __init__(self):\\n self.trie = {}\\n self.palindromes = []\\n self.index = -1\\n\\n def add_word(self, word, k):\\n curr = self\\n if word and word == word[::-1]:\\n curr.palindromes.append(k)\\n\\n for i in range(len(word)):\\n ch = word[i]\\n if ch not in curr.trie:\\n curr.trie[ch] = TrieNode()\\n curr = curr.trie[ch]\\n rest = word[i+1:]\\n if rest and rest == rest[::-1]:\\n curr.palindromes.append(k)\\n curr.index = k\\n \\n def match_prefix(self, word, k):\\n curr = self\\n ans = []\\n for i in reversed(range(len(word))):\\n ch = word[i]\\n if ch not in curr.trie:\\n return ans \\n curr = curr.trie[ch]\\n if curr.index != -1 and curr.index != k:\\n rest = word[:i]\\n if rest == rest[::-1]:\\n ans.append([curr.index, k])\\n # print(ans)\\n\\n for j in curr.palindromes:\\n # if j != k:\\n ans.append([j, k])\\n # print(ans)\\n return ans\\n\\n\\n tobj = TrieNode()\\n for k in range(len(words)):\\n tobj.add_word(words[k], k)\\n\\n # print(repr(tobj.trie))\\n rs = []\\n\\n if tobj.index != -1:\\n j = tobj.index\\n for i in tobj.palindromes:\\n if i != j:\\n rs.append([i, j])\\n rs.append([j, i])\\n\\n for k in range(len(words)):\\n if words[k]:\\n rs += tobj.match_prefix(words[k], k)\\n\\n return rs\\n\\n\\n\\n \",\n \"memory\": \"163121\"\n },\n {\n \"code\": \"class TrieNode:\\n \\n def __init__(self):\\n self.map = {}\\n self.index = -1\\n self.palindrome_idx_list = []\\n self.end = False\\n \\n \\nclass Solution:\\n \\n \\n def __init__(self):\\n self.node = TrieNode()\\n \\n def insert(self, word, idx):\\n current = self.node\\n for index in range(len(word)):\\n if self.is_palindrome(word[index:]):\\n current.palindrome_idx_list.append(idx)\\n ch = word[index]\\n if ch not in current.map.keys():\\n current.map[ch] = TrieNode()\\n current = current.map[ch]\\n current.index = idx\\n current.end = True\\n \\n def search(self, word, idx, result):\\n current = self.node\\n for index in range(len(word)):\\n if current.end and self.is_palindrome(word[index:]):\\n result.append((idx, current.index))\\n if word[index] not in current.map.keys():\\n return\\n current = current.map[word[index]]\\n if current.end and idx != current.index:\\n result.append((idx, current.index))\\n for p in current.palindrome_idx_list:\\n result.append((idx, p))\\n return \\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n for index in range(len(words)):\\n self.insert(words[index][::-1], index)\\n \\n result = []\\n \\n for index in range(len(words)):\\n self.search(words[index], index, result)\\n \\n return result\\n \\n def is_palindrome(self, word):\\n start, end = 0, len(word)-1\\n while start < end:\\n if word[start] != word[end]:\\n return False\\n start += 1\\n end -= 1\\n return True\\n \",\n \"memory\": \"166938\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.end = -1\\n self.palin_suffix = []\\n \\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n#1. Words in the Trie that are the reverse of our current word.\\n#2. Words in the Trie that start with the reverse of our current word and then finish in a palindrome.\\n#3. Words in the Trie that are the reverse of the first part of our current word, and then what's left of our current word forms a palindrome.\\n trie = TrieNode()\\n # Create the Trie and add the reverses of all the words.\\n for idx,word in enumerate(words):\\n word = word[::-1]\\n cur = trie\\n for j, char in enumerate(word):\\n if word[j:] == word[j:][::-1]:\\n cur.palin_suffix.append(idx)\\n if char not in cur.children:\\n cur.children[char] = TrieNode()\\n cur = cur.children[char]\\n cur.end = idx\\n # Look up each word in the Trie and find palindrome pairs.\\n res = []\\n for idx, word in enumerate(words):\\n cur = trie\\n completed = True\\n for j, char in enumerate(word):\\n #Case 3\\n if cur.end != -1 and word[j:] == word[j:][::-1]:\\n res.append([idx,cur.end]) \\n if char not in cur.children:\\n completed = False\\n break\\n cur = cur.children[char]\\n if completed:\\n #Case 1\\n if cur.end != -1 and cur.end != idx:\\n res.append([idx,cur.end])\\n #Case 2\\n for j in cur.palin_suffix:\\n res.append([idx,j]) \\n return res\\n \\n\",\n \"memory\": \"170756\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.end = False\\n self.idx = -1\\n self.palindromeIdxs = list()\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = list()\\n \\n for i in range(len(words)):\\n cur = self.root\\n word_rev = words[i][::-1]\\n for j in range(len(word_rev)):\\n if self.isPalindrome(word_rev[j:]):\\n cur.palindromeIdxs.append(i)\\n \\n if word_rev[j] not in cur.children:\\n cur.children[word_rev[j]] = TrieNode()\\n cur = cur.children[word_rev[j]]\\n \\n cur.end = True\\n cur.idx = i\\n \\n for i in range(len(words)):\\n self.search(words[i], i, res)\\n \\n return res\\n \\n def search(self, word, idx, res): \\n cur = self.root\\n for i in range(len(word)):\\n if cur.end and self.isPalindrome(word[i:]):\\n res.append([idx, cur.idx])\\n \\n if word[i] not in cur.children:\\n return\\n cur = cur.children[word[i]] \\n \\n if cur.end and cur.idx != idx:\\n res.append([cur.idx, idx])\\n \\n for pIdx in cur.palindromeIdxs:\\n res.append([idx, pIdx])\\n \\n return\\n \\n def isPalindrome(self, s):\\n return s == s[::-1]\",\n \"memory\": \"174573\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self):\\n self.idx = -1 \\n self.children = {}\\n self.palindrome_indexes = []\\n self.end = False\\n\\nclass Solution:\\n def __init__(self):\\n self.root = Node() \\n\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n def is_palindrome(s):\\n return s == s[::-1]\\n\\n def search(word, idx, ret):\\n curr = self.root\\n\\n # long word short trie\\n for i in range(len(word)):\\n if curr.end and is_palindrome(word[i:]):\\n ret.append([idx, curr.idx])\\n # traverse\\n if word[i] not in curr.children:\\n return \\n curr = curr.children[word[i]]\\n \\n # exact match\\n if curr.end and curr.idx != idx:\\n ret.append([curr.idx, idx])\\n\\n # long trie short word\\n for i in curr.palindrome_indexes:\\n ret.append([idx, i])\\n\\n return \\n\\n ret = []\\n\\n # build trie\\n for i, word in enumerate(words):\\n curr = self.root \\n reversed_word = word[::-1]\\n for j in range(len(reversed_word)):\\n if is_palindrome(reversed_word[j:]):\\n curr.palindrome_indexes.append(i)\\n \\n # traverse\\n if reversed_word[j] not in curr.children:\\n curr.children[reversed_word[j]] = Node()\\n curr = curr.children[reversed_word[j]]\\n\\n curr.end = True\\n curr.idx = i\\n\\n # search\\n for i, word in enumerate(words):\\n search(word, i, ret)\\n\\n return ret\\n\\n\\n\\n \\n \",\n \"memory\": \"178391\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.end = -1\\n self.palin_suffix = []\\n \\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n#1. Words in the Trie that are the reverse of our current word.\\n#2. Words in the Trie that start with the reverse of our current word and then finish in a palindrome.\\n#3. Words in the Trie that are the reverse of the first part of our current word, and then what's left of our current word forms a palindrome.\\n trie = TrieNode()\\n # Create the Trie and add the reverses of all the words.\\n for idx,word in enumerate(words):\\n word = word[::-1]\\n cur = trie\\n for j, char in enumerate(word):\\n if word[j:] == word[j:][::-1]:\\n cur.palin_suffix.append(idx)\\n if char not in cur.children:\\n cur.children[char] = TrieNode()\\n cur = cur.children[char]\\n cur.end = idx\\n # Look up each word in the Trie and find palindrome pairs.\\n res = []\\n for idx, word in enumerate(words):\\n cur = trie\\n completed = True\\n for j, char in enumerate(word):\\n #Case 3\\n if cur.end != -1 and word[j:] == word[j:][::-1]:\\n res.append([idx,cur.end]) \\n if char not in cur.children:\\n completed = False\\n break\\n cur = cur.children[char]\\n if completed:\\n #Case 1\\n if cur.end != -1 and cur.end != idx:\\n res.append([idx,cur.end])\\n #Case 2\\n for j in cur.palin_suffix:\\n res.append([idx,j]) \\n return res\\n \\n\",\n \"memory\": \"182208\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1 # To store the index of the word ending at this node\\n self.palindrome_suffix_indices = [] # List of indices of words that have a palindrome suffix\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n # Check if the current prefix is a palindrome and record the index\\n if self.is_palindrome(word[:len(word) - i]):\\n node.palindrome_suffix_indices.append(index)\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.index = index\\n node.palindrome_suffix_indices.append(index)\\n\\n def search(self, word, index):\\n node = self.root\\n result = []\\n\\n for i, char in enumerate(word):\\n # Check if the remaining suffix forms a palindrome and the node has a word ending\\n if node.index >= 0 and node.index != index and self.is_palindrome(word[i:]):\\n result.append([index, node.index])\\n if char not in node.children:\\n return result\\n node = node.children[char]\\n\\n # If the search completes, check for any remaining palindrome suffix indices\\n for suffix_index in node.palindrome_suffix_indices:\\n if index != suffix_index:\\n result.append([index, suffix_index])\\n\\n return result\\n\\n @staticmethod\\n def is_palindrome(word):\\n left, right = 0, len(word) - 1\\n while left < right:\\n if word[left] != word[right]:\\n return False\\n left, right = left + 1, right - 1\\n return True\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n\\n # Insert words into the Trie in reverse order with indices\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n\\n results = []\\n # Search for each word in the Trie\\n for i, word in enumerate(words):\\n results.extend(trie.search(word, i))\\n\\n return results\\n\",\n \"memory\": \"186026\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.end = False\\n self.idx = -1\\n self.palindromeIdxs = list()\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = list()\\n \\n # populate the trie with\\n # the reverse of every word.\\n # once we're done inserting\\n # we're going to have 3 conditions\\n for i in range(len(words)):\\n cur = self.root\\n rWord = words[i][::-1]\\n for j in range(len(rWord)):\\n # if the current word (from j onwards)\\n # is a palindrome, add it's index to the trie node\\n # (palindromIdx list) we'll use it later on to find combinations\\n if self.isPalindrome(rWord[j:]):\\n cur.palindromeIdxs.append(i)\\n \\n if rWord[j] not in cur.children:\\n cur.children[rWord[j]] = TrieNode()\\n cur = cur.children[rWord[j]]\\n \\n # once the word is done\\n # add it's index to the trie node\\n cur.end = True\\n cur.idx = i\\n \\n for i in range(len(words)):\\n self.search(words[i], i, res)\\n \\n return res\\n \\n # to find all pairse, we can have\\n # conditions:\\n # 1. exact match (abc, cba)\\n # 2. long word, short word in trie match (abbcc, a)\\n # 3. short word, long word in trie match (lls, sssll)\\n def search(self, word, idx, res): \\n cur = self.root\\n for i in range(len(word)):\\n # 2. long word, short trie\\n # so the trie ended here and \\n # we have matched till the ith\\n # character, so we check if the\\n # remaining of the word is also a\\n # palindrome, if yes, then we have a pair\\n # for e.g. word = abcdaa, trieWord = bcda\\n # we can make a pair like abcdaabcda\\n if cur.end and self.isPalindrome(word[i:]):\\n res.append([idx, cur.idx])\\n \\n if word[i] not in cur.children:\\n return\\n cur = cur.children[word[i]] \\n \\n # 1. exact match\\n # in the given list, for that \\n # we'll take every word and then\\n # check if the reverse of that\\n # word lies in the trie\\n # for e.g. for abc and cba\\n # the trie would have both c->b->a and a->b->c\\n # but when we take the first word (abc)\\n # we'll match this with a->b->c which is\\n # actually cba and so we found a match\\n if cur.end and cur.idx != idx:\\n res.append([cur.idx, idx])\\n \\n # 3. long trie, short word\\n # so the trie still has items (not cur.end)\\n # and the word has ended, it's the exact\\n # opposite of point 2\\n # for e.g. word=abcd trieWord=bcdaa\\n # we can have a pair bcdaaabcd\\n # and so we have a pair\\n for pIdx in cur.palindromeIdxs:\\n res.append([idx, pIdx])\\n \\n return\\n \\n \\n def isPalindrome(self, s):\\n return s == s[::-1]\\n\\n\\n## TC: O(n * m^2), SC: O(n * m)\",\n \"memory\": \"189843\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1\\n self.palindrome_suffix_indices = []\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n # If the current prefix is a palindrome, store the index\\n if self.is_palindrome(word[:len(word) - i]):\\n node.palindrome_suffix_indices.append(index)\\n # Move to the next node\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.index = index\\n node.palindrome_suffix_indices.append(index)\\n\\n def search(self, word, index):\\n node = self.root\\n result = []\\n\\n for i, char in enumerate(word):\\n # Check if the remaining part of the word forms a palindrome\\n # and there is a valid palindrome ending at this point\\n if node.index >= 0 and node.index != index and self.is_palindrome(word[i:]):\\n result.append([index, node.index])\\n # Move to the next character in the Trie\\n if char not in node.children:\\n return result\\n node = node.children[char]\\n\\n # Check all remaining palindrome indices in the current node\\n for suffix_index in node.palindrome_suffix_indices:\\n if index != suffix_index:\\n result.append([index, suffix_index])\\n\\n return result\\n\\n @staticmethod\\n def is_palindrome(word):\\n return word == word[::-1]\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n\\n # Insert all words into the Trie in reverse\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n\\n results = []\\n # Search for each word in the Trie to find palindrome pairs\\n for i, word in enumerate(words):\\n results.extend(trie.search(word, i))\\n\\n return results\\n\",\n \"memory\": \"193661\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.word_index = -1\\n self.palindrome_suffixes = []\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def add_word(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n if self.is_palindrome(word[:len(word) - i]):\\n node.palindrome_suffixes.append(index)\\n node = node.children.setdefault(char, TrieNode())\\n node.word_index = index\\n\\n def search_word(self, word, index):\\n node = self.root\\n result = []\\n for i, char in enumerate(word):\\n if node.word_index != -1 and node.word_index != index and self.is_palindrome(word[i:]):\\n result.append([index, node.word_index])\\n if char not in node.children:\\n return result\\n node = node.children[char]\\n \\n if node.word_index != -1 and node.word_index != index:\\n result.append([index, node.word_index])\\n \\n for suffix in node.palindrome_suffixes:\\n result.append([index, suffix])\\n \\n return result\\n\\n @staticmethod\\n def is_palindrome(word):\\n return word == word[::-1]\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = Trie()\\n result = []\\n \\n for i, word in enumerate(words):\\n trie.add_word(word, i)\\n \\n for i, word in enumerate(words):\\n result.extend(trie.search_word(word, i))\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nwords = [\\\"abcd\\\",\\\"dcba\\\",\\\"lls\\\",\\\"s\\\",\\\"sssll\\\"]\\nprint(solution.palindromePairs(words)) # Output: [[0,1],[1,0],[3,2],[2,4]]\",\n \"memory\": \"197478\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = []\\n trie = Trie()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n for i, word in enumerate(words):\\n res.extend(trie.search(word, i))\\n return res\\n\\nclass TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.index = -1 # Index of the word that ends at this node\\n self.palindrome_suffixes = [] # List of word indices where suffix forms a palindrome\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, word, index):\\n node = self.root\\n for i, char in enumerate(reversed(word)):\\n # If the remaining part of the word is a palindrome, store the index\\n if is_palindrome(word[:len(word) - i]):\\n node.palindrome_suffixes.append(index)\\n if char not in node.children:\\n node.children[char] = TrieNode()\\n node = node.children[char]\\n node.index = index # Mark the end of the word\\n node.palindrome_suffixes.append(index)\\n\\n def search(self, word, index):\\n node = self.root\\n result = []\\n\\n for i, char in enumerate(word):\\n # If this node represents a word and the remaining suffix of the current word is a palindrome\\n if node.index >= 0 and node.index != index and is_palindrome(word[i:]):\\n result.append([index, node.index])\\n if char not in node.children:\\n return result\\n node = node.children[char]\\n\\n # Check for words with palindromic suffixes\\n for j in node.palindrome_suffixes:\\n if index != j:\\n result.append([index, j])\\n \\n return result\\n \\ndef is_palindrome(word):\\n return word == word[::-1]\",\n \"memory\": \"201296\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.end = False\\n self.idx = -1\\n self.palindromeIdxs = list()\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = list()\\n \\n # populate the trie with\\n # the reverse of every word.\\n # once we're done inserting\\n # we're going to have 3 conditions\\n for i in range(len(words)):\\n cur = self.root\\n rWord = words[i][::-1]\\n for j in range(len(rWord)):\\n # if the current word (from j onwards)\\n # is a palindrome, add it's index to the trie node\\n # (palindromIdx list) we'll use it later on to find combinations\\n if self.isPalindrome(rWord[j:]):\\n cur.palindromeIdxs.append(i)\\n \\n if rWord[j] not in cur.children:\\n cur.children[rWord[j]] = TrieNode()\\n cur = cur.children[rWord[j]]\\n \\n # once the word is done\\n # add it's index to the trie node\\n cur.end = True\\n cur.idx = i\\n \\n for i in range(len(words)):\\n self.search(words[i], i, res)\\n \\n return res\\n \\n # to find all pairse, we can have\\n # conditions:\\n # 1. exact match (abc, cba)\\n # 2. long word, short word in trie match (abbcc, a)\\n # 3. short word, long word in trie match (lls, sssll)\\n def search(self, word, idx, res): \\n cur = self.root\\n for i in range(len(word)):\\n # 2. long word, short trie\\n # so the trie ended here and \\n # we have matched till the ith\\n # character, so we check if the\\n # remaining of the word is also a\\n # palindrome, if yes, then we have a pair\\n # for e.g. word = abcdaa, trieWord = bcda\\n # we can make a pair like abcdaabcda\\n if cur.end and self.isPalindrome(word[i:]):\\n res.append([idx, cur.idx])\\n \\n if word[i] not in cur.children:\\n return\\n cur = cur.children[word[i]] \\n \\n # 1. exact match\\n # in the given list, for that \\n # we'll take every word and then\\n # check if the reverse of that\\n # word lies in the trie\\n # for e.g. for abc and cba\\n # the trie would have both c->b->a and a->b->c\\n # but when we take the first word (abc)\\n # we'll match this with a->b->c which is\\n # actually cba and so we found a match\\n if cur.end and cur.idx != idx:\\n res.append([cur.idx, idx])\\n \\n # 3. long trie, short word\\n # so the trie still has items (not cur.end)\\n # and the word has ended, it's the exact\\n # opposite of point 2\\n # for e.g. word=abcd trieWord=bcdaa\\n # we can have a pair bcdaaabcd\\n # and so we have a pair\\n for pIdx in cur.palindromeIdxs:\\n res.append([idx, pIdx])\\n \\n return\\n \\n \\n def isPalindrome(self, s):\\n return s == s[::-1]\",\n \"memory\": \"205113\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.end = False\\n self.idx = -1\\n self.palindromeIdxs = list()\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = list()\\n \\n # populate the trie with\\n # the reverse of every word.\\n # once we're done inserting\\n # we're going to have 3 conditions\\n for i in range(len(words)):\\n cur = self.root\\n rWord = words[i][::-1]\\n for j in range(len(rWord)):\\n # if the current word (from j onwards)\\n # is a palindrome, add it's index to the trie node\\n # (palindromIdx list) we'll use it later on to find combinations\\n if self.isPalindrome(rWord[j:]):\\n cur.palindromeIdxs.append(i)\\n \\n if rWord[j] not in cur.children:\\n cur.children[rWord[j]] = TrieNode()\\n cur = cur.children[rWord[j]]\\n \\n # once the word is done\\n # add it's index to the trie node\\n cur.end = True\\n cur.idx = i\\n \\n for i in range(len(words)):\\n self.search(words[i], i, res)\\n \\n return res\\n \\n # to find all pairse, we can have\\n # conditions:\\n # 1. exact match (abc, cba)\\n # 2. long word, short word in trie match (abbcc, a)\\n # 3. short word, long word in trie match (lls, sssll)\\n def search(self, word, idx, res): \\n cur = self.root\\n for i in range(len(word)):\\n # 2. long word, short trie\\n # so the trie ended here and \\n # we have matched till the ith\\n # character, so we check if the\\n # remaining of the word is also a\\n # palindrome, if yes, then we have a pair\\n # for e.g. word = abcdaa, trieWord = bcda\\n # we can make a pair like abcdaabcda\\n if cur.end and self.isPalindrome(word[i:]):\\n res.append([idx, cur.idx])\\n \\n if word[i] not in cur.children:\\n return\\n cur = cur.children[word[i]] \\n \\n # 1. exact match\\n # in the given list, for that \\n # we'll take every word and then\\n # check if the reverse of that\\n # word lies in the trie\\n # for e.g. for abc and cba\\n # the trie would have both c->b->a and a->b->c\\n # but when we take the first word (abc)\\n # we'll match this with a->b->c which is\\n # actually cba and so we found a match\\n if cur.end and cur.idx != idx:\\n res.append([cur.idx, idx])\\n \\n # 3. long trie, short word\\n # so the trie still has items (not cur.end)\\n # and the word has ended, it's the exact\\n # opposite of point 2\\n # for e.g. word=abcd trieWord=bcdaa\\n # we can have a pair bcdaaabcd\\n # and so we have a pair\\n for pIdx in cur.palindromeIdxs:\\n res.append([idx, pIdx])\\n \\n return\\n \\n \\n def isPalindrome(self, s):\\n return s == s[::-1]\",\n \"memory\": \"208931\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = dict()\\n self.end = False\\n self.idx = -1\\n self.palindromeIdxs = list()\\n\\nclass Solution:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n res = list()\\n \\n # populate the trie with\\n # the reverse of every word.\\n # once we're done inserting\\n # we're going to have 3 conditions\\n for i in range(len(words)):\\n cur = self.root\\n rWord = words[i][::-1]\\n for j in range(len(rWord)):\\n # if the current word (from j onwards)\\n # is a palindrome, add it's index to the trie node\\n # (palindromIdx list) we'll use it later on to find combinations\\n if self.isPalindrome(rWord[j:]):\\n cur.palindromeIdxs.append(i)\\n \\n if rWord[j] not in cur.children:\\n cur.children[rWord[j]] = TrieNode()\\n cur = cur.children[rWord[j]]\\n \\n # once the word is done\\n # add it's index to the trie node\\n cur.end = True\\n cur.idx = i\\n \\n for i in range(len(words)):\\n self.search(words[i], i, res)\\n \\n return res\\n \\n # to find all pairse, we can have\\n # conditions:\\n # 1. exact match (abc, cba)\\n # 2. long word, short word in trie match (abbcc, a)\\n # 3. short word, long word in trie match (lls, sssll)\\n def search(self, word, idx, res): \\n cur = self.root\\n for i in range(len(word)):\\n # 2. long word, short trie\\n # so the trie ended here and \\n # we have matched till the ith\\n # character, so we check if the\\n # remaining of the word is also a\\n # palindrome, if yes, then we have a pair\\n # for e.g. word = abcdaa, trieWord = bcda\\n # we can make a pair like abcdaabcda\\n if cur.end and self.isPalindrome(word[i:]):\\n res.append([idx, cur.idx])\\n \\n if word[i] not in cur.children:\\n return\\n cur = cur.children[word[i]] \\n \\n # 1. exact match\\n # in the given list, for that \\n # we'll take every word and then\\n # check if the reverse of that\\n # word lies in the trie\\n # for e.g. for abc and cba\\n # the trie would have both c->b->a and a->b->c\\n # but when we take the first word (abc)\\n # we'll match this with a->b->c which is\\n # actually cba and so we found a match\\n if cur.end and cur.idx != idx:\\n res.append([cur.idx, idx])\\n \\n # 3. long trie, short word\\n # so the trie still has items (not cur.end)\\n # and the word has ended, it's the exact\\n # opposite of point 2\\n # for e.g. word=abcd trieWord=bcdaa\\n # we can have a pair bcdaaabcd\\n # and so we have a pair\\n for pIdx in cur.palindromeIdxs:\\n res.append([idx, pIdx])\\n \\n return\\n \\n \\n def isPalindrome(self, s):\\n return s == s[::-1]\\n\",\n \"memory\": \"212748\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n\\n class TrieNode:\\n def __init__(self):\\n self.children = defaultdict(TrieNode)\\n self.palin = []\\n self.ending = -1\\n\\n root = TrieNode()\\n index = 0\\n for word in words: \\n current = root\\n for i, c in enumerate(word): \\n if word[i:] == word[i:][::-1]: \\n current.palin.append(index)\\n current = current.children[c]\\n current.ending = index\\n index += 1\\n\\n result = []\\n index = 0\\n for word in words:\\n rev = word[::-1]\\n brk = False\\n current = root\\n\\n for i, c in enumerate(rev):\\n if current.ending != -1:\\n if rev[i:] == rev[i:][::-1]:\\n result.append([current.ending, index])\\n\\n if c not in current.children:\\n brk = True\\n break\\n \\n current = current.children[c]\\n # print(word, current.children.keys(), brk, result, current.ending, index)\\n if not brk:\\n if current.ending != -1 and index != current.ending:\\n result.append([current.ending, index])\\n \\n if len(current.palin) > 0:\\n for i in current.palin:\\n result.append([i, index])\\n\\n index+=1\\n return result\\n \",\n \"memory\": \"216566\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1 \\n self.palindrome_suffixes = [] \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode() \\n for i, word in enumerate(words):\\n word = word[::-1]\\n current_level = trie \\n for j, c in enumerate(word):\\n if word[j:] == word[j:][::-1]:\\n current_level.palindrome_suffixes.append(i)\\n current_level = current_level.next[c]\\n current_level.ending_word = i \\n \\n solutions = [] \\n for i, word in enumerate(words):\\n current_level = trie \\n for j, c in enumerate(word):\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]:\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else:\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i,j])\\n return solutions\\n \",\n \"memory\": \"220383\"\n },\n {\n \"code\": \"def is_palindrome(word, substr_start=0, substr_end=float(\\\"inf\\\")):\\n if substr_end == float(\\\"inf\\\"):\\n substr_end = len(word)-1\\n return word[substr_start:substr_end+1] == word[substr_start:substr_end+1][::-1]\\n #l, r = substr_start, min(substr_end, len(word)-1)\\n #while l < r:\\n # if word[l] != word[r]:\\n # return False\\n # l += 1\\n # r -= 1\\n #return True\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.word_index = None\\n self.palindrome_suffixes = []\\n \\n def insert(self, word, index):\\n node = self\\n for i in range(len(word)-1, -1, -1):\\n if is_palindrome(word, 0, i):\\n node.palindrome_suffixes.append(index)\\n node = node.next[word[i]]\\n node.word_index = index\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n res = []\\n for i, word in enumerate(words):\\n node = trie\\n brk = False\\n for j, char in enumerate(word):\\n if node.word_index is not None and is_palindrome(word, j):\\n res.append([i, node.word_index])\\n if char not in node.next:\\n brk = True\\n break\\n node = node.next[char]\\n if not brk:\\n # reverse of word in trie\\n if node.word_index is not None and node.word_index != i:\\n res.append([i, node.word_index])\\n # reverse of word in trie but as a suffix attached to a palindrome prefix\\n for suffix in node.palindrome_suffixes:\\n res.append([i, suffix])\\n\\n return res\",\n \"memory\": \"224201\"\n },\n {\n \"code\": \"def is_palindrome(word, substr_start=0, substr_end=float(\\\"inf\\\")):\\n l, r = substr_start, min(substr_end, len(word)-1)\\n while l < r:\\n if word[l] != word[r]:\\n return False\\n l += 1\\n r -= 1\\n return True\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.word_index = None\\n self.palindrome_suffixes = []\\n \\n def insert(self, word, index):\\n node = self\\n for i in range(len(word)-1, -1, -1):\\n if is_palindrome(word, 0, i):\\n node.palindrome_suffixes.append(index)\\n node = node.next[word[i]]\\n node.word_index = index\\n\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n res = []\\n for i, word in enumerate(words):\\n node = trie\\n brk = False\\n for j, char in enumerate(word):\\n if node.word_index is not None and is_palindrome(word, j):\\n res.append([i, node.word_index])\\n if char not in node.next:\\n brk = True\\n break\\n node = node.next[char]\\n if not brk:\\n # reverse of word in trie\\n if node.word_index is not None and node.word_index != i:\\n res.append([i, node.word_index])\\n # reverse of word in trie but as a suffix attached to a palindrome prefix\\n for suffix in node.palindrome_suffixes:\\n res.append([i, suffix])\\n\\n return res\",\n \"memory\": \"228018\"\n },\n {\n \"code\": \"def is_palindrome(word, substr_start=0, substr_end=float(\\\"inf\\\")):\\n l, r = substr_start, min(substr_end, len(word)-1)\\n while l < r:\\n if word[l] != word[r]:\\n return False\\n l += 1\\n r -= 1\\n return True\\n\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.word_index = None\\n self.palindrome_suffixes = []\\n \\n def insert(self, word, index):\\n node = self\\n for i in range(len(word)-1, -1, -1):\\n if is_palindrome(word, 0, i):\\n node.palindrome_suffixes.append(index)\\n node = node.next[word[i]]\\n node.word_index = index\\n \\n def search(self, word, start=0):\\n node = self\\n for i in range(start, len(word)):\\n if word[i] not in node.next:\\n return None\\n node = node.next[word[i]]\\n return node\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n trie.insert(word, i)\\n res = []\\n for i, word in enumerate(words):\\n node = trie.search(word)\\n if node is not None:\\n # reverse of word in trie\\n if node.word_index is not None:\\n if node.word_index != i:\\n res.append([i, node.word_index])\\n \\n # reverse of word in trie but as a suffix attached to a palindrome prefix\\n for suffix in node.palindrome_suffixes:\\n res.append([i, suffix])\\n \\n # prefix of word in trie; rest of word is palindrome suffix\\n j = 0\\n node = trie\\n while j <= len(word):\\n if j < len(word) and node.word_index is not None and is_palindrome(word, j):\\n res.append([i, node.word_index])\\n if j == len(word):\\n break\\n if word[j] not in node.next:\\n break\\n node = node.next[word[j]]\\n j += 1\\n return res\",\n \"memory\": \"231836\"\n },\n {\n \"code\": \"\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n #### that is actually the prefix of a word\\n # Check if remainder of word is a palindrome.\\n\\n #### prefix(palindrome) + ....\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n\\n #...+suffix(palindrome)\\n #cat + panlindrome + tac\\n ##### word 1 ######\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n # cat + solos (palindrome) tac\\n # word 1 word 2\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\\n\\n\\n# class Solution:\\n\\n# def palindromePairs(self, words):\\n\\n# def all_valid_prefixes(word):\\n# valid_prefixes = []\\n# for i in range(len(word)):\\n# if word[i:] == word[i:][::-1]:\\n# valid_prefixes.append(word[:i])\\n# return valid_prefixes\\n\\n# def all_valid_suffixes(word):\\n# valid_suffixes = []\\n# for i in range(len(word)):\\n# if word[:i+1] == word[:i+1][::-1]:\\n# valid_suffixes.append(word[i + 1:])\\n# return valid_suffixes\\n\\n# word_lookup = {word: i for i, word in enumerate(words)}\\n# solutions = []\\n\\n# for word_index, word in enumerate(words):\\n# reversed_word = word[::-1]\\n\\n# # Build solutions of case #1. This word will be word 1.\\n# if reversed_word in word_lookup and word_index != word_lookup[reversed_word]:\\n# solutions.append([word_index, word_lookup[reversed_word]])\\n\\n\\n# # CAT SOLOSTAC\\n# # word1 word2\\n# # Build solutions of case #2. This word will be word 2.\\n# for suffix in all_valid_suffixes(word):\\n# reversed_suffix = suffix[::-1]\\n# if reversed_suffix in word_lookup:\\n# solutions.append([word_lookup[reversed_suffix], word_index])\\n\\n# # CATSOLOS TAC\\n# # word1 word2\\n\\n# # Build solutions of case #3. This word will be word 1.\\n# for prefix in all_valid_prefixes(word):\\n# reversed_prefix = prefix[::-1]\\n# if reversed_prefix in word_lookup:\\n# solutions.append([word_index, word_lookup[reversed_prefix]])\\n\\n# return solutions\",\n \"memory\": \"235653\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.w = -1\\n self.p = []\\n self.children = collections.defaultdict(TrieNode)\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n @staticmethod\\n def is_palindrome(word: str) -> bool :\\n return word[::] == word[::-1]\\n\\n def insert(self, index, word: str) -> None:\\n node = self.root\\n for i, char in enumerate(word[::-1]) : \\n if self.is_palindrome(word[0:len(word) - i]) :\\n node.p.append(index)\\n node = node.children[char]\\n node.w = index\\n\\n def search(self, index, word: str) -> List[List[int]]:\\n result = []\\n node = self.root\\n\\n while word : \\n if node.w >= 0 :\\n if self.is_palindrome(word) : \\n result.append([index, node.w])\\n if not word[0] in node.children : \\n return result\\n node = node.children[word[0]]\\n word = word[1:]\\n\\n if node.w >= 0 and node.w != index :\\n result.append([index, node.w])\\n \\n for p in node.p : \\n result.append([index, p])\\n \\n return result\\n \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n trie = Trie()\\n \\n for i, word in enumerate(words) : \\n trie.insert(i, word)\\n\\n results = []\\n\\n for i, word in enumerate(words) : \\n results.extend(trie.search(i, word))\\n\\n return results\\n \\n\",\n \"memory\": \"239471\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\",\n \"memory\": \"243288\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\",\n \"memory\": \"247106\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\",\n \"memory\": \"250923\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\\n\",\n \"memory\": \"254741\"\n },\n {\n \"code\": \"#check the cases in editorial\\nclass TrieNode:\\n def __init__(self):\\n self.next = collections.defaultdict(TrieNode)\\n self.ending_word = -1\\n self.palindrome_suffixes = []\\n\\nclass Solution:\\n def palindromePairs(self, words):\\n\\n # Create the Trie and add the reverses of all the words.\\n trie = TrieNode()\\n for i, word in enumerate(words):\\n word = word[::-1] # We want to insert the reverse.\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check if remainder of word is a palindrome.\\n if word[j:] == word[j:][::-1]:# Is the word the same as its reverse?\\n current_level.palindrome_suffixes.append(i)\\n # Move down the trie.\\n current_level = current_level.next[c]\\n current_level.ending_word = i\\n\\n # Look up each word in the Trie and find palindrome pairs.\\n solutions = []\\n for i, word in enumerate(words):\\n current_level = trie\\n for j, c in enumerate(word):\\n # Check for case 3.\\n if current_level.ending_word != -1:\\n if word[j:] == word[j:][::-1]: # Is the word the same as its reverse?\\n solutions.append([i, current_level.ending_word])\\n if c not in current_level.next:\\n break\\n current_level = current_level.next[c]\\n else: # Case 1 and 2 only come up if whole word was iterated.\\n # Check for case 1.\\n if current_level.ending_word != -1 and current_level.ending_word != i:\\n solutions.append([i, current_level.ending_word])\\n # Check for case 2.\\n for j in current_level.palindrome_suffixes:\\n solutions.append([i, j])\\n return solutions\",\n \"memory\": \"258558\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.w = -1\\n self.p = []\\n self.children = collections.defaultdict(TrieNode)\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n @staticmethod\\n def is_palindrome(word: str) -> bool :\\n return word[::] == word[::-1]\\n\\n def insert(self, index, word: str) -> None:\\n node = self.root\\n for i, char in enumerate(word[::-1]) : \\n if self.is_palindrome(word[0:len(word) - i]) :\\n node.p.append(index)\\n node = node.children[char]\\n node.w = index\\n\\n def search(self, index, word: str) -> List[List[int]]:\\n result = []\\n node = self.root\\n\\n while word : \\n if node.w >= 0 :\\n if self.is_palindrome(word) : \\n result.append([index, node.w])\\n if not word[0] in node.children : \\n return result\\n node = node.children[word[0]]\\n word = word[1:]\\n\\n if node.w >= 0 and node.w != index :\\n result.append([index, node.w])\\n \\n for p in node.p : \\n result.append([index, p])\\n \\n return result\\n \\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n \\n trie = Trie()\\n \\n for i, word in enumerate(words) : \\n trie.insert(i, word)\\n\\n results = []\\n\\n for i, word in enumerate(words) : \\n results.extend(trie.search(i, word))\\n\\n return results\\n \\n\",\n \"memory\": \"262376\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self):\\n self.remainingPalIndexes = []\\n self.endIndex = -1\\n import collections\\n self.children = collections.defaultdict(Node)\\n\\nclass Trie:\\n def __init__(self): self.root = Node()\\n \\n def insert(self, w, j):\\n isPal = lambda x: x == x[::-1]\\n n = self.root\\n if isPal(w): n.remainingPalIndexes.append(j)\\n for i in range(len(w)):\\n c, suf = w[i], w[i+1:]\\n n = n.children[c]\\n if isPal(suf): n.remainingPalIndexes.append(j)\\n n.endIndex = j\\n\\n def search(self, w):\\n isPal = lambda x: x == x[::-1]\\n n = self.root\\n if not w: return n.remainingPalIndexes\\n r = []\\n for i in range(len(w)):\\n c, suf = w[i], w[i+1:]\\n if c not in n.children: return r\\n n = n.children[c]\\n if suf and isPal(suf) and n.endIndex > -1:\\n r.append(n.endIndex)\\n return r + n.remainingPalIndexes\\n # return r.extend(n.remainingPalIndexes)\\n\\nclass Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n r = []\\n trie = Trie()\\n for i, w in enumerate(words):\\n trie.insert(w[::-1], i)\\n for i, w in enumerate(words):\\n js = trie.search(w)\\n if js: \\n r.extend([[i, j] for j in js if i != j])\\n if not w: r.extend([[i, j][::-1] for j in js if i != j])\\n return r\\n \\n\\nclass Solution2:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n d = {e: i for i, e in enumerate(words)}\\n r = []\\n isPal = lambda x: x == x[::-1]\\n for j, w in enumerate(words):\\n n = len(w)\\n for i in range(n+1):\\n pre, suf = w[:i], w[i:]\\n if isPal(pre):\\n s = suf[::-1]\\n if s != w and s in d: r.append([d[s], j])\\n if i != n and isPal(suf):\\n s = pre[::-1]\\n if s != w and s in d: r.append([d[s], j][::-1])\\n return r\",\n \"memory\": \"266193\"\n },\n {\n \"code\": \"class TrieNode(object):\\n def __init__(self):\\n self.idx = -1\\n self.pdromes_below = []\\n self.children = collections.defaultdict(TrieNode)\\n\\nclass Trie(object):\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def add(self, word, idx):\\n node = self.root\\n for i, letter in enumerate(reversed(word)):\\n if self.is_palindrome(word[:len(word)-i]):\\n node.pdromes_below.append(idx)\\n node = node.children[letter]\\n node.idx = idx\\n \\n def search(self, word, idx, res):\\n node = self.root\\n for i, letter in enumerate(word):\\n if node.idx >= 0 and idx != node.idx and self.is_palindrome(word[i:]):\\n res.append([idx, node.idx])\\n node = node.children.get(letter)\\n if not node:\\n return res\\n for p in node.pdromes_below:\\n if p != idx:\\n res.append([idx, p])\\n if node.idx >= 0 and idx != node.idx:\\n res.append([idx, node.idx])\\n return res\\n \\n def is_palindrome(self, w):\\n i = 0\\n j = len(w)-1\\n while i < j:\\n if w[i] != w[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n\\nclass Solution(object):\\n def palindromePairs(self, words):\\n \\\"\\\"\\\"\\n :type words: List[str]\\n :rtype: List[List[int]]\\n \\\"\\\"\\\"\\n res = []\\n t = Trie()\\n for idx, w in enumerate(words):\\n t.add(w, idx)\\n for idx, w in enumerate(words):\\n res = t.search(w, idx, res)\\n return res\",\n \"memory\": \"270011\"\n },\n {\n \"code\": \"class TrieNode(object):\\n def __init__(self):\\n self.idx = -1\\n self.pdromes_below = []\\n self.children = collections.defaultdict(TrieNode)\\n\\nclass Trie(object):\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def add(self, word, idx):\\n node = self.root\\n for i, letter in enumerate(reversed(word)):\\n if self.is_palindrome(word[:len(word)-i]):\\n node.pdromes_below.append(idx)\\n node = node.children[letter]\\n node.idx = idx\\n \\n def search(self, word, idx, res):\\n node = self.root\\n for i, letter in enumerate(word):\\n if node.idx >= 0 and idx != node.idx and self.is_palindrome(word[i:]):\\n res.append([idx, node.idx])\\n node = node.children.get(letter)\\n if not node:\\n return res\\n for p in node.pdromes_below:\\n if p != idx:\\n res.append([idx, p])\\n if node.idx >= 0 and idx != node.idx:\\n res.append([idx, node.idx])\\n return res\\n \\n def is_palindrome(self, w):\\n i = 0\\n j = len(w)-1\\n while i < j:\\n if w[i] != w[j]:\\n return False\\n i += 1\\n j -= 1\\n return True\\n\\n\\nclass Solution(object):\\n def palindromePairs(self, words):\\n \\\"\\\"\\\"\\n :type words: List[str]\\n :rtype: List[List[int]]\\n \\\"\\\"\\\"\\n res = []\\n t = Trie()\\n for idx, w in enumerate(words):\\n t.add(w, idx)\\n for idx, w in enumerate(words):\\n res = t.search(w, idx, res)\\n return res\",\n \"memory\": \"273828\"\n },\n {\n \"code\": \"class Solution:\\n def palindromePairs(self, words: List[str]) -> List[List[int]]:\\n # Trie + counting sort + rolling hash\\n P, M = 31, 10 ** 9 + 7\\n exp = [1]\\n for i in range(302):\\n np = exp[-1] * P % M\\n exp.append(np)\\n d, n, mnl, mxl = defaultdict(list), len(words), 5000, 0\\n for i in range(n):\\n d[len(words[i])].append((words[i], i))\\n mnl = min(mnl, len(words[i]))\\n mxl = max(mxl, len(words[i]))\\n s_w = []\\n for t in range(mnl, mxl+1): s_w.extend(d[t])\\n \\n rt = (T := lambda: defaultdict(T))()\\n rrt = (T := lambda: defaultdict(T))()\\n\\n def gh(w):\\n h = [0]\\n for ch in w:\\n nh = (h[-1] * P + ord(ch)) % M\\n h.append(nh)\\n return h\\n\\n def mp(t, w, h, rh):\\n m, i, u, res = len(w), 0, t, []\\n if u.get(\\\"_s\\\"):\\n hh = h[m]\\n rhh = rh[m]\\n if hh == rhh: res.extend(u[\\\"_s\\\"])\\n while i < m:\\n if not u.get(w[i]): break\\n u = u[w[i]]\\n if u.get(\\\"_s\\\"):\\n hh = (h[m] - h[i+1] * exp[m-i-1] + M) % M\\n rhh = rh[m-i-1]\\n if hh == rhh: res.extend(u[\\\"_s\\\"])\\n i += 1\\n return res\\n\\n def insert(t, w, wi):\\n v, m = t, len(w)\\n for j in range(m): v = v[w[j]]\\n v[\\\"_s\\\"] = v.get(\\\"_s\\\", list())\\n v[\\\"_s\\\"].append(wi)\\n\\n ans = []\\n for i in range(n):\\n w, idx = s_w[i]\\n rw = w[::-1]\\n h, rh = gh(w), gh(rw)\\n for j in mp(rrt, w, h, rh): ans.append([idx, j])\\n for j in mp(rt, rw, rh, h): ans.append([j, idx])\\n insert(rrt, rw, idx)\\n insert(rt, w, idx)\\n return ans\",\n \"memory\": \"277646\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":72,"string":"72"}}},{"rowIdx":265,"cells":{"question_id":{"kind":"number","value":337,"string":"337"},"name":{"kind":"string","value":"house-robber-iii"},"content":{"kind":"string","value":"<p>The thief has found himself a new place for his thievery again. There is only one entrance to this area, called <code>root</code>.</p>\n\n<p>Besides the <code>root</code>, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will automatically contact the police if <strong>two directly-linked houses were broken into on the same night</strong>.</p>\n\n<p>Given the <code>root</code> of the binary tree, return <em>the maximum amount of money the thief can rob <strong>without alerting the police</strong></em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/10/rob1-tree.jpg\" style=\"width: 277px; height: 293px;\" />\n<pre>\n<strong>Input:</strong> root = [3,2,3,null,3,null,1]\n<strong>Output:</strong> 7\n<strong>Explanation:</strong> Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/10/rob2-tree.jpg\" style=\"width: 357px; height: 293px;\" />\n<pre>\n<strong>Input:</strong> root = [3,4,5,1,3,null,1]\n<strong>Output:</strong> 9\n<strong>Explanation:</strong> Maximum amount of money the thief can rob = 4 + 5 = 9.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li>The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.</li>\n\t<li><code>0 <= Node.val <= 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":54.4465709815956,"string":"54.446571"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["dynamic-programming","tree","depth-first-search","binary-tree"],"string":"[\n \"dynamic-programming\",\n \"tree\",\n \"depth-first-search\",\n \"binary-tree\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21\", 0.0385], [\"23\", 0.0771], [\"27\", 0.0771], [\"28\", 0.1541], [\"29\", 0.1156], [\"30\", 0.1541], [\"31\", 0.578], [\"32\", 0.3854], [\"33\", 0.578], [\"34\", 1.0405], [\"35\", 1.657], [\"36\", 1.657], [\"37\", 1.657], [\"38\", 3.5067], [\"39\", 3.2755], [\"40\", 2.8131], [\"41\", 3.2755], [\"42\", 5.8574], [\"43\", 5.973], [\"44\", 5.0867], [\"45\", 4.5472], [\"46\", 6.7052], [\"47\", 5.973], [\"48\", 6.0116], [\"49\", 4.9711], [\"50\", 4.9326], [\"51\", 4.3931], [\"52\", 3.4297], [\"53\", 3.0058], [\"54\", 2.9287], [\"55\", 3.0058], [\"56\", 1.9653], [\"57\", 1.6185], [\"58\", 1.6956], [\"59\", 1.3102]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17700\", 0.0385], [\"17800\", 0.1156], [\"17900\", 0.8478], [\"18000\", 13.2948], [\"18100\", 39.3834], [\"18200\", 5.8189], [\"18300\", 0.2312], [\"18400\", 0.6166], [\"18500\", 2.158], [\"18600\", 4.7784], [\"18700\", 2.3892], [\"18800\", 0.4624], [\"18900\", 0.1927], [\"19000\", 0.501], [\"19100\", 2.158], [\"19200\", 2.7746], [\"19300\", 0.3854], [\"19400\", 0.3083], [\"19500\", 0.4239], [\"19600\", 0.8863], [\"19700\", 0.501], [\"19800\", 0.4239], [\"19900\", 0.8092], [\"20000\", 0.6551], [\"20100\", 0.8478], [\"20200\", 1.0019], [\"20300\", 0.8863], [\"20400\", 3.0443], [\"20500\", 6.1657]]}"},"rt_list":{"kind":"list like","value":[{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, x):\n# self.val = x\n# self.left = None\n# self.right = None\n\nclass Solution:\n def rob_helper(self, root):\n if not root:\n return (0, 0)\n \n l = self.rob_helper(root.left)\n r = self.rob_helper(root.right)\n \n return (root.val + l[1] + r[1], max(l[0], l[1]) + max(r[0], r[1]))\n \n def rob(self, root: TreeNode) -> int:\n return max(self.rob_helper(root))","runtime":"21"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def solve(root):\n if root is None:\n return [0, 0]\n\n left_take, left_ignore = solve(root.left)\n right_take, right_ignore = solve(root.right)\n\n ignore = max(left_take, left_ignore) + max(right_take, right_ignore)\n take = root.val + left_ignore + right_ignore\n\n return [take, ignore]\n\n take, ignore = solve(root)\n # print(take, ignore)\n\n return max(take, ignore)","runtime":"23"},{"code":"from collections import deque\nfrom typing import Optional\n\n# Definition for a binary tree node.\nclass TreeNode:\n def __init__(self, val=0, left=None, right=None):\n self.val = val\n self.left = left\n self.right = right\n\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def helper(root):\n if root is None:\n return (0,0)\n lr,rr=helper(root.left),helper(root.right)\n consideringroot=root.val+lr[1]+rr[1]\n notconsideringroot = max(lr)+max(rr)\n return (consideringroot,notconsideringroot)\n return max(helper(root))","runtime":"27"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(root):\n if not root:\n return (0, 0)\n left = dfs(root.left)\n right = dfs(root.right)\n return (root.val + left[1] + right[1]), max(left[0], left[1]) + max(right[0], right[1])\n\n return max(dfs(root))\n\n\n ","runtime":"28"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\n\n\nclass Solution:\n def rob(self, root: TreeNode) -> int:\n return max(self.dfs(root))\n \n def dfs(self, root: TreeNode):\n if not root:\n return (0, 0)\n left = self.dfs(root.left)\n right = self.dfs(root.right)\n return (root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0], right[1]))","runtime":"29"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def dfs(node):\n if not node.left and not node.right:\n return node.val, 0\n if node.left:\n l1, l2 = dfs(node.left)\n else:\n l1, l2 = 0, 0\n if node.right:\n r1, r2 = dfs(node.right)\n else:\n r1, r2 = 0, 0\n return (node.val + l2 + r2, max(l1, l2) + max(r1, r2))\n \n return max(dfs(root))","runtime":"30"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n\n return max(self.helper(root))\n \n def helper(self, root):\n if not root:\n return (0,0)\n left_value = self.helper(root.left)\n right_value = self.helper(root.right)\n\n root_rob = root.val + left_value[1] + right_value[1]\n\n not_root_rob = max(left_value) + max(right_value)\n\n return (root_rob, not_root_rob)\n\n\n ","runtime":"31"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n res = self.dfs(root)\n return max(res)\n \n def dfs(self, node):\n if not node:\n # dp[0]: the max profit of not robbing current node\n # dp[1]: the max profit of robbing current node\n return [0, 0]\n \n left = self.dfs(node.left)\n right = self.dfs(node.right)\n\n val0 = max(left[0], left[1]) + max(right[0], right[1])\n val1 = node.val + left[0] + right[0]\n \n return [val0, val1]","runtime":"32"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def compute(self, root):\n if not root:\n return (0, 0)\n left = self.compute(root.left)\n right = self.compute(root.right)\n take_cur = root.val + left[1] + right[1]\n not_take = max(left) + max(right)\n return [take_cur, not_take]\n\n def rob(self, root: Optional[TreeNode]) -> int:\n vals = self.compute(root)\n return max(vals)","runtime":"33"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n #We shall make a recursive solution\n #Hold a tuple in each node, with the first element giving the value of the node and the next element giving the max value of the tree\n def helper(root):\n #return two values: max value including node and max excluding node\n if not root:\n return 0,0\n \n right_incl, right_excl=helper(root.right)\n left_incl, left_excl=helper(root.left)\n return root.val+left_excl+right_excl, max(left_incl, left_excl) + max(right_incl, right_excl)\n \n incl, excl= helper(root)\n return max(incl,excl)\n \n \n \n\n\n \n \n \n \n \n ","runtime":"34"},{"code":"class TreeNode:\n def __init__(self, val=0, left=None, right=None):\n self.val = val\n self.left = left\n self.right = right\n\nclass Solution:\n def rob(self, root: TreeNode) -> int:\n def rob_helper(node):\n if not node:\n return (0, 0) # (max amount if robbed, max amount if not robbed)\n \n left_rob, left_not_rob = rob_helper(node.left)\n right_rob, right_not_rob = rob_helper(node.right)\n \n # If we rob the current node, we cannot rob its children\n rob_current = node.val + left_not_rob + right_not_rob\n \n # If we do not rob the current node, we take the maximum of robbing or not robbing its children\n not_rob_current = max(left_rob, left_not_rob) + max(right_rob, right_not_rob)\n \n return (rob_current, not_rob_current)\n \n rob_current, not_rob_current = rob_helper(root)\n return max(rob_current, not_rob_current)\n\n# Example usage:\n# Construct the tree for the example [3,2,3,null,3,null,1]\nroot = TreeNode(3)\nroot.left = TreeNode(2)\nroot.right = TreeNode(3)\nroot.left.right = TreeNode(3)\nroot.right.right = TreeNode(1)\n\nsol = Solution()\nprint(sol.rob(root)) # Output: 7\n\n# Construct the tree for the example [3,4,5,1,3,null,1]\nroot = TreeNode(3)\nroot.left = TreeNode(4)\nroot.right = TreeNode(5)\nroot.left.left = TreeNode(1)\nroot.left.right = TreeNode(3)\nroot.right.right = TreeNode(1)\n\nsol = Solution()\nprint(sol.rob(root)) # Output: 9\n","runtime":"35"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def helper(node, with_node, without_node):\n if not node:\n return [0, 0]\n\n l_with, l_without = helper(node.left, with_node, without_node)\n r_with, r_without = helper(node.right, with_node, without_node)\n\n return [max(l_without+r_without+node.val, l_with+r_with), l_with+r_with]\n\n return max(helper(root, 0, 0))\n\n ","runtime":"36"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def backtracing(node):\n if node is None:\n return [0,0]\n \n leftv = backtracing(node.left)\n rightv = backtracing(node.right)\n\n # robit = node.val+leftv[1]+rightv[1]\n # notrobit = max(leftv[0], leftv[1])+max(rightv[0], rightv[1])\n\n\n return [node.val+leftv[1]+rightv[1], max(leftv[0], leftv[1])+max(rightv[0], rightv[1])] \n\n res = backtracing(root)\n\n return max(res[0], res[1])\n","runtime":"37"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \"\"\"\n using a size 2 array to indicate total from this node to the end.\n res[0] for not rub this level, res[1] for rub this level\n\n initial thinking is level traversal but left and right node could choose different rub option\n \"\"\"\n res = self.robSub(root)\n return max(res[0], res[1])\n\n def robSub(self, root):\n if not root:\n return [0, 0]\n left = self.robSub(root.left)\n right = self.robSub(root.right)\n\n res = [0, 0]\n res[0] = max(left[0], left[1]) + max(right[0], right[1])\n res[1] = root.val + left[0] + right[0]\n return res","runtime":"37"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def helper(root):\n if not root:\n return (0,0)\n \n temp_left = helper(root.left)\n temp_right = helper(root.right)\n\n steal = root.val + temp_left[1] + temp_right[1]\n not_steal = max(temp_left[0], temp_left[1]) + max(temp_right[0], temp_right[1])\n \n return (steal, not_steal)\n \n results = helper(root)\n return max(results[0], results[1])","runtime":"38"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n\n #return pair -> [withRoot, withoutRoot]\n def dfs(root):\n if not root:\n return [0,0]\n leftPair = dfs(root.left)\n rightPair = dfs(root.right)\n\n withRoot = root.val + leftPair[1] + rightPair[1]\n withoutRoot = max(leftPair) + max(rightPair)\n\n return [withRoot, withoutRoot]\n \n return max(dfs(root))\n\n\n \n ","runtime":"39"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def dfs(node):\n if not node:\n return 0, 0\n \n left_with, left_without = dfs(node.left)\n right_with, right_without = dfs(node.right)\n \n with_node = node.val + left_without + right_without\n\n without_node = max(left_with, left_without) + max(right_with, right_without)\n\n return with_node, without_node\n \n return max(dfs(root))","runtime":"39"},{"code":"# from collections import deque\n# # Definition for a binary tree node.\n# # class TreeNode:\n# # def __init__(self, val=0, left=None, right=None):\n# # self.val = val\n# # self.left = left\n# # self.right = right\n# class Solution:\n# def rob_helper(self, root):\n# value_1 = root.val\n# value_2 = 0\n# if root.left:\n# self.rob_helper(root.left)\n# if root.left.left:\n# value_1 += root.left.left.val\n# if root.left.right:\n# value_1 += root.left.right.val\n# value_2 += root.left.val\n# if root.right:\n# self.rob_helper(root.right)\n# if root.right.left:\n# value_1 += root.right.left.val\n# if root.right.right:\n# value_1 += root.right.right.val\n# value_2 += root.right.val\n# root.val = max(value_1, value_2)\n# self.result = max(self.result, root.val)\n\n\n# def rob(self, root: Optional[TreeNode]) -> int:\n# # For each node, there are two situations:\n# # 1. If we choose to use the current node, then we need add cur-value and the grandson value\n# # 2. if we choose not to use, we just need all the child value\n# # keep the max\n# # so we need to use the post-order traversal\n# if not root.left and not root.right:\n# return root.val\n# self.result = 0\n# self.rob_helper(root)\n# return self.result\n\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n # dp数组（dp table）以及下标的含义：\n # 1. 下标为 0 记录 **不偷该节点** 所得到的的最大金钱\n # 2. 下标为 1 记录 **偷该节点** 所得到的的最大金钱\n dp = self.traversal(root)\n return max(dp)\n\n # 要用后序遍历, 因为要通过递归函数的返回值来做下一步计算\n def traversal(self, node):\n \n # 递归终止条件，就是遇到了空节点，那肯定是不偷的\n if not node:\n return (0, 0)\n\n left = self.traversal(node.left)\n right = self.traversal(node.right)\n\n # 不偷当前节点, 偷子节点\n val_0 = max(left[0], left[1]) + max(right[0], right[1])\n\n # 偷当前节点, 不偷子节点\n val_1 = node.val + left[0] + right[0]\n\n return (val_0, val_1) ","runtime":"40"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\n\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n # Memoization for storing the results for each node\n memo = {}\n \n def dp(node):\n if node is None:\n return (0, 0) # (max when not robbed, max when robbed)\n \n if node in memo:\n return memo[node]\n \n # Recur for left and right children\n left = dp(node.left)\n right = dp(node.right)\n \n # Case 1: Rob current node, then we can't rob the children\n rob_current = node.val + left[0] + right[0]\n \n # Case 2: Don't rob current node, we can decide to rob or not rob the children\n not_rob_current = max(left) + max(right)\n \n # Memoize the result for the current node\n memo[node] = (not_rob_current, rob_current)\n \n return memo[node]\n \n # At root, we want the maximum of robbing or not robbing the root\n return max(dp(root))\n","runtime":"40"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(node):\n if not node:\n return (0, 0)\n \n left = dfs(node.left)\n right = dfs(node.right)\n \n rob = node.val + left[1] + right[1]\n \n not_rob = max(left) + max(right)\n \n return (rob, not_rob)\n \n return max(dfs(root))\n\n\n","runtime":"41"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(root: TreeNode):\n #returns a Pair. Want to create at each level [val at level, val of prev level]\n if(not root):\n return (0,0)\n left: int = dfs(root.left)\n right: int = dfs(root.right)\n\n return root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0],right[1])\n\n return max(dfs(root))","runtime":"42"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n # Memo\n \n # Dynamic programming function\n def foo(x):\n\n # Check if th tree is empty\n if not x:\n # Return the tuple 0,0\n return (0, 0)\n \n # If the left and right is none\n if not x.left and not x.right: \n \n # Return the value of x and 0\n return (x.val, 0)\n \n # Return two possibilities\n \n # 1. Left node is robbed and the left node is not robbed\n lrobbed, lnotrobbed = foo(x.left)\n\n # 2. right node is robbed and the right node is not robbed\n rrobbed, rnotrobbed = foo(x.right)\n \n # After knowing the information above check the amount\n # It is the value of x added by the amount of l and r are not robbed \n check = x.val + lnotrobbed + rnotrobbed\n \n # Compare the max of left robbed condition, and righ robbed condition\n # Add the two max values together\n check_max = max(lrobbed, lnotrobbed) + max(rrobbed, rnotrobbed)\n\n # Return two values, first the value of the value where the robbed is stop\n # second is the value when there are opportunieties that left or right robbed\n return (check, check_max)\n \n # Return the answer which is the max amount of money the thief can rob\n return max(foo(root))\n ","runtime":"42"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(root):\n if not root: return [0,0]\n leftPair = dfs(root.left)\n rightPair = dfs(root.right)\n\n withRoot = root.val+leftPair[1]+rightPair[1]\n withoutRoot = max(leftPair)+max(rightPair)\n\n return [withRoot,withoutRoot]\n return max(dfs(root))\n ","runtime":"43"},{"code":"class Solution:\n def rob(self, root: TreeNode) -> int:\n def helper(node):\n # return [rob this node, not rob this node]\n if not node:\n return (0, 0)\n left = helper(node.left)\n right = helper(node.right)\n # if we rob this node, we cannot rob its children\n rob = node.val + left[1] + right[1]\n # else we could choose to either rob its children or not\n not_rob = max(left) + max(right)\n return [rob, not_rob]\n\n return max(helper(root))","runtime":"43"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n res = self.dfs(root)\n return max(res)\n\n def dfs(self, root):\n # dp[0] is the maximum value with robbing current node\n # dp[1] is the maximum value with not robbing current node\n if not root:\n return [0, 0]\n\n dp = [0, 0]\n left_values = self.dfs(root.left)\n right_values = self.dfs(root.right)\n dp[0] = root.val + left_values[1] + right_values[1]\n dp[1] = max(left_values) + max(right_values)\n\n return dp\n\n\n\n ","runtime":"44"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def helper(node):\n if not node:\n return 0, 0\n left, leftNotIncl = helper(node.left)\n right, rightNotIncl = helper(node.right)\n notInclude = left + right\n include = node.val + leftNotIncl + rightNotIncl\n return max(include, notInclude), notInclude\n res, _ = helper(root)\n return res\n\n ","runtime":"46"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(root):\n if not root:\n return [0, 0]\n \n # # if it's leaf\n # if not root.left and not root.right:\n # return [root.val, 0]\n\n left = dfs(root.left)\n right = dfs(root.right)\n # print(root.val)\n # print(left)\n # print(right)\n\n return [root.val + left[1] + right[1], max(left) + max(right)]\n # return [root.val + left[1] + right[1], left[0] + right[0]]\n \n return max(dfs(root))\n ","runtime":"47"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n dp1, dp2 = self.trav(root)\n return max(dp1, dp2)\n \n\n def trav(self, root):\n if not root:\n return (0, 0)\n left = self.trav(root.left)\n right = self.trav(root.right)\n val1 = root.val + left[0] + right[0]\n val2 = max(left[0], left[1]) + max(right[0], right[1])\n return (val2, val1)\n\n\n ","runtime":"47"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(node):\n if not node: return [0, 0]\n left = dfs(node.left)\n right = dfs(node.right)\n withnode = left[1] + right[1] + node.val\n withoutnode = max(left) + max(right)\n return [withnode, withoutnode]\n return max(dfs(root))","runtime":"48"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def recur(n):\n if not n: return 0, 0\n \n use_lc, skip_lc = recur(n.left)\n use_rc, skip_rc = recur(n.right)\n \n use_this = n.val + skip_lc + skip_rc\n skip_this = max(use_lc, skip_lc) + max(use_rc, skip_rc)\n \n return use_this, skip_this\n \n \n if not root: return 0\n return max(recur(root))\n \n \n \n ","runtime":"49"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n cache = {}\n\n def dfs(node, yes):\n if not node: return 0\n \n count = 0\n if yes:\n count += node.val\n if (node.left, not yes) not in cache:\n cache[(node.left, not yes)] = dfs(node.left, not yes)\n if (node.right, not yes) not in cache:\n cache[(node.right, not yes)] = dfs(node.right, not yes)\n count += cache[(node.left, not yes)] + cache[(node.right, not yes)]\n \n else:\n if (node.left, not yes) not in cache:\n cache[(node.left, not yes)] = dfs(node.left, not yes)\n if (node.left, yes) not in cache:\n cache[(node.left, yes)] = dfs(node.left, yes)\n if (node.right, not yes) not in cache:\n cache[(node.right, not yes)] = dfs(node.right, not yes)\n if (node.right, yes) not in cache:\n cache[(node.right, yes)] = dfs(node.right, yes)\n\n count += max(cache[(node.left, not yes)], cache[(node.left, yes)])\n count += max(cache[(node.right, not yes)], cache[(node.right, yes)])\n\n return count\n\n return max(dfs(root, False), dfs(root, True))\n","runtime":"49"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n cache = {}\n\n def dfs(node, rob):\n if node is None:\n return 0\n \n if (node, False) not in cache:\n cache[(node, False)] = dfs(node.left, True) + dfs(node.right, True)\n if (node, True) not in cache:\n cache[(node, True)] = node.val + dfs(node.left, False) + dfs(node.right, False)\n noRobOption = cache[(node, False)]\n robOption = cache[(node, True)]\n\n if rob:\n return max(noRobOption, robOption)\n else:\n return noRobOption\n \n return dfs(root, True)","runtime":"50"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n #what do you want from child\n #max value for left for right\n #what do you want report to parent\n #add current node or not\n\n @lru_cache(None)\n def DFS(node,pre_rob):\n if node==None:\n return 0\n\n if pre_rob==False:\n #rob\n rob=DFS(node.left,True)+node.val+DFS(node.right,True)\n #not rob\n not_rob=DFS(node.left,False)+DFS(node.right,False)\n return max(rob,not_rob)\n else:\n return DFS(node.left,False)+DFS(node.right,False)\n \n\n pre_rob=False\n return DFS(root,pre_rob=False)\n\n#time O(2*n) and space O(height)+O(2*n)\n#rob and not rob\n\n","runtime":"50"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: TreeNode) -> int:\n def rob_subtree(node):\n if not node:\n return (0, 0) # (rob this node, don't rob this node)\n\n # Recursively call on the left and right children\n left = rob_subtree(node.left)\n right = rob_subtree(node.right)\n\n # If we rob this node, we cannot rob its children\n rob_this = node.val + left[1] + right[1]\n\n # If we don't rob this node, we can choose to rob or not rob the children\n dont_rob_this = max(left) + max(right)\n\n return (rob_this, dont_rob_this)\n\n # Call the helper on the root and return the maximum value\n return max(rob_subtree(root))\n ","runtime":"51"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\n\n@cache\ndef fun(root,flag):\n\n if root==None:\n return 0\n if flag==1:\n ans=fun(root.left,0)+fun(root.right,0)\n else:\n ans=max(root.val+fun(root.left,flag+1)+fun(root.right,flag+1),fun(root.left,0)+fun(root.right,0))\n \n return ans\n\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n\n return max(fun(root,0),fun(root,1))\n ","runtime":"51"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","runtime":"52"},{"code":"'''\nThe thief has found himself a new place for his thievery again.\n\nThere is only one entrance to this area, called root.\n- problem starts at root\n- root is a recursive term\n - can solve sub-problems?\n\nBesides the root, each house has one and only one parent house.\n\nAfter a tour, the smart thief realized that all houses in this place form a binary tree.\n- binary tree problem\n- probably use DFS or BFS\n - repeated work though?\n\nIt will automatically contact the police if \ntwo directly-linked houses were broken into on the same night.\n- cant rob root and root.left/root.right\n - remember to check if left and right exist before accessing\n- picking problem:\n - rob root\n - dont rob root\n\nGiven the root of the binary tree, return \nthe maximum amount of money the thief can rob without alerting the police.\n- maximization problem\n\nThe number of nodes in the tree is in the range [1, 10^4].\n\n0 <= Node.val <= 10^4\n\nInput: root = [3,2,3,null,3,null,1]\nOutput: 7\n- pick 3\n - skip its children (2, 3)\n - problem starts over again at 2 and 3s children\n- skip 3\n - problem starts over again at 3s children\n\n\nInput: root = root\nOutput: res = res\n- pick root\n - skip left, skip right\n - root.val + f(left.left) + f(right.right)\n- skip root\n - f(left) + f(right)\n\nmax(\n root.val + f(left.left) f(left.right) + f(right.left) + f(right.right),\n f(left) + f(right)\n)\n'''\n\n# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n cache = {}\n\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\n if not node:\n return 0\n if node in cache:\n print(\"cache hit!\")\n return cache[node]\n \n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\n\n pick = node.val + pickLeft + pickRight\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\n\n cache[node] = max(pick, skip)\n return max(pick, skip)\n \n return maxProfitStartingAt(root)","runtime":"52"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n dp = {}\n return self.dfs(root, True, dp) \n\n def dfs(self, root, can_rob, dp):\n if (root, can_rob) in dp:\n return dp[(root, can_rob)]\n if not root:\n return 0\n rob_total = 0\n skip_total = 0\n\n if can_rob:\n # If we rob current house\n rob_total += root.val\n rob_total += self.dfs(root.left, False, dp)\n rob_total += self.dfs(root.right, False, dp)\n # If we skip current house\n skip_total += self.dfs(root.left, True, dp)\n skip_total += self.dfs(root.right, True, dp)\n\n dp[(root, can_rob)] = max(rob_total, skip_total)\n return dp[(root, can_rob)]\n","runtime":"53"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n #what do you want from child\n #max value for left for right\n #what do you want report to parent\n #add current node or not\n\n @lru_cache(None)\n def DFS(node,pre_rob):\n if node==None:\n return 0\n\n if pre_rob==False:\n #rob\n rob=DFS(node.left,True)+node.val+DFS(node.right,True)\n #not rob\n not_rob=DFS(node.left,False)+DFS(node.right,False)\n return max(rob,not_rob)\n else:\n return DFS(node.left,False)+DFS(node.right,False)\n \n\n pre_rob=False\n return DFS(root,pre_rob=False)\n\n#time O(n) and space O(height)\n\n","runtime":"53"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\n\nclass Solution:\n def robTree(self, node: Optional[TreeNode]) -> (int,int):\n if not node:\n return (0,0)\n\n left = self.robTree(node.left)\n right = self.robTree(node.right)\n\n val1 = node.val + left[0] + right[0]\n val2 = max(left[0], left[1]) + max(right[0], right[1])\n return (val2, val1)\n\n def rob(self, root: Optional[TreeNode]) -> int:\n val1, val2 = self.robTree(root)\n return max(val1, val2)","runtime":"54"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def __init__(self):\n self.memo = {}\n def rob(self, root: Optional[TreeNode],canrob=True) -> int:\n if not root: return 0 \n if (root,canrob) in self.memo : return self.memo[(root,canrob)]\n if canrob: \n rob = root.val + self.rob(root.left,False) +self.rob(root.right,False)\n else:\n rob=0\n norob= self.rob(root.left,True) +self.rob(root.right,True)\n ans = max(rob,norob)\n self.memo[(root,canrob)] = ans\n return ans","runtime":"55"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n memo = {}\n def dfs(node, canRob):\n if not node: return 0\n if (node, canRob) in memo: return memo[(node, canRob)]\n res = 0\n if not canRob: \n res = dfs(node.left, True) + dfs(node.right, True)\n else:\n res = max(dfs(node.left, True) + dfs(node.right, True), \n dfs(node.left, False) + node.val + dfs(node.right, False))\n memo[(node, canRob)] = res\n return res\n return dfs(root, True)","runtime":"55"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","runtime":"56"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n memo = {}\n @lru_cache\n def dp(node):\n if not node:\n return 0\n \n if node in memo:\n return memo[node]\n \n grand_left = dp(node.left.left) + dp(node.left.right) if node.left else 0\n grand_right = dp(node.right.left) + dp(node.right.right) if node.right else 0\n memo[node] = max(\n node.val + grand_left + grand_right,\n dp(node.left) + dp(node.right)\n )\n\n return memo[node]\n\n return dp(root)","runtime":"57"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","runtime":"58"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","runtime":"58"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","runtime":"59"}],"string":"[\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, x):\\n# self.val = x\\n# self.left = None\\n# self.right = None\\n\\nclass Solution:\\n def rob_helper(self, root):\\n if not root:\\n return (0, 0)\\n \\n l = self.rob_helper(root.left)\\n r = self.rob_helper(root.right)\\n \\n return (root.val + l[1] + r[1], max(l[0], l[1]) + max(r[0], r[1]))\\n \\n def rob(self, root: TreeNode) -> int:\\n return max(self.rob_helper(root))\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def solve(root):\\n if root is None:\\n return [0, 0]\\n\\n left_take, left_ignore = solve(root.left)\\n right_take, right_ignore = solve(root.right)\\n\\n ignore = max(left_take, left_ignore) + max(right_take, right_ignore)\\n take = root.val + left_ignore + right_ignore\\n\\n return [take, ignore]\\n\\n take, ignore = solve(root)\\n # print(take, ignore)\\n\\n return max(take, ignore)\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import Optional\\n\\n# Definition for a binary tree node.\\nclass TreeNode:\\n def __init__(self, val=0, left=None, right=None):\\n self.val = val\\n self.left = left\\n self.right = right\\n\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def helper(root):\\n if root is None:\\n return (0,0)\\n lr,rr=helper(root.left),helper(root.right)\\n consideringroot=root.val+lr[1]+rr[1]\\n notconsideringroot = max(lr)+max(rr)\\n return (consideringroot,notconsideringroot)\\n return max(helper(root))\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(root):\\n if not root:\\n return (0, 0)\\n left = dfs(root.left)\\n right = dfs(root.right)\\n return (root.val + left[1] + right[1]), max(left[0], left[1]) + max(right[0], right[1])\\n\\n return max(dfs(root))\\n\\n\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\n\\n\\nclass Solution:\\n def rob(self, root: TreeNode) -> int:\\n return max(self.dfs(root))\\n \\n def dfs(self, root: TreeNode):\\n if not root:\\n return (0, 0)\\n left = self.dfs(root.left)\\n right = self.dfs(root.right)\\n return (root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0], right[1]))\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def dfs(node):\\n if not node.left and not node.right:\\n return node.val, 0\\n if node.left:\\n l1, l2 = dfs(node.left)\\n else:\\n l1, l2 = 0, 0\\n if node.right:\\n r1, r2 = dfs(node.right)\\n else:\\n r1, r2 = 0, 0\\n return (node.val + l2 + r2, max(l1, l2) + max(r1, r2))\\n \\n return max(dfs(root))\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n\\n return max(self.helper(root))\\n \\n def helper(self, root):\\n if not root:\\n return (0,0)\\n left_value = self.helper(root.left)\\n right_value = self.helper(root.right)\\n\\n root_rob = root.val + left_value[1] + right_value[1]\\n\\n not_root_rob = max(left_value) + max(right_value)\\n\\n return (root_rob, not_root_rob)\\n\\n\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n res = self.dfs(root)\\n return max(res)\\n \\n def dfs(self, node):\\n if not node:\\n # dp[0]: the max profit of not robbing current node\\n # dp[1]: the max profit of robbing current node\\n return [0, 0]\\n \\n left = self.dfs(node.left)\\n right = self.dfs(node.right)\\n\\n val0 = max(left[0], left[1]) + max(right[0], right[1])\\n val1 = node.val + left[0] + right[0]\\n \\n return [val0, val1]\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def compute(self, root):\\n if not root:\\n return (0, 0)\\n left = self.compute(root.left)\\n right = self.compute(root.right)\\n take_cur = root.val + left[1] + right[1]\\n not_take = max(left) + max(right)\\n return [take_cur, not_take]\\n\\n def rob(self, root: Optional[TreeNode]) -> int:\\n vals = self.compute(root)\\n return max(vals)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n #We shall make a recursive solution\\n #Hold a tuple in each node, with the first element giving the value of the node and the next element giving the max value of the tree\\n def helper(root):\\n #return two values: max value including node and max excluding node\\n if not root:\\n return 0,0\\n \\n right_incl, right_excl=helper(root.right)\\n left_incl, left_excl=helper(root.left)\\n return root.val+left_excl+right_excl, max(left_incl, left_excl) + max(right_incl, right_excl)\\n \\n incl, excl= helper(root)\\n return max(incl,excl)\\n \\n \\n \\n\\n\\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class TreeNode:\\n def __init__(self, val=0, left=None, right=None):\\n self.val = val\\n self.left = left\\n self.right = right\\n\\nclass Solution:\\n def rob(self, root: TreeNode) -> int:\\n def rob_helper(node):\\n if not node:\\n return (0, 0) # (max amount if robbed, max amount if not robbed)\\n \\n left_rob, left_not_rob = rob_helper(node.left)\\n right_rob, right_not_rob = rob_helper(node.right)\\n \\n # If we rob the current node, we cannot rob its children\\n rob_current = node.val + left_not_rob + right_not_rob\\n \\n # If we do not rob the current node, we take the maximum of robbing or not robbing its children\\n not_rob_current = max(left_rob, left_not_rob) + max(right_rob, right_not_rob)\\n \\n return (rob_current, not_rob_current)\\n \\n rob_current, not_rob_current = rob_helper(root)\\n return max(rob_current, not_rob_current)\\n\\n# Example usage:\\n# Construct the tree for the example [3,2,3,null,3,null,1]\\nroot = TreeNode(3)\\nroot.left = TreeNode(2)\\nroot.right = TreeNode(3)\\nroot.left.right = TreeNode(3)\\nroot.right.right = TreeNode(1)\\n\\nsol = Solution()\\nprint(sol.rob(root)) # Output: 7\\n\\n# Construct the tree for the example [3,4,5,1,3,null,1]\\nroot = TreeNode(3)\\nroot.left = TreeNode(4)\\nroot.right = TreeNode(5)\\nroot.left.left = TreeNode(1)\\nroot.left.right = TreeNode(3)\\nroot.right.right = TreeNode(1)\\n\\nsol = Solution()\\nprint(sol.rob(root)) # Output: 9\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def helper(node, with_node, without_node):\\n if not node:\\n return [0, 0]\\n\\n l_with, l_without = helper(node.left, with_node, without_node)\\n r_with, r_without = helper(node.right, with_node, without_node)\\n\\n return [max(l_without+r_without+node.val, l_with+r_with), l_with+r_with]\\n\\n return max(helper(root, 0, 0))\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def backtracing(node):\\n if node is None:\\n return [0,0]\\n \\n leftv = backtracing(node.left)\\n rightv = backtracing(node.right)\\n\\n # robit = node.val+leftv[1]+rightv[1]\\n # notrobit = max(leftv[0], leftv[1])+max(rightv[0], rightv[1])\\n\\n\\n return [node.val+leftv[1]+rightv[1], max(leftv[0], leftv[1])+max(rightv[0], rightv[1])] \\n\\n res = backtracing(root)\\n\\n return max(res[0], res[1])\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\\"\\\"\\\"\\n using a size 2 array to indicate total from this node to the end.\\n res[0] for not rub this level, res[1] for rub this level\\n\\n initial thinking is level traversal but left and right node could choose different rub option\\n \\\"\\\"\\\"\\n res = self.robSub(root)\\n return max(res[0], res[1])\\n\\n def robSub(self, root):\\n if not root:\\n return [0, 0]\\n left = self.robSub(root.left)\\n right = self.robSub(root.right)\\n\\n res = [0, 0]\\n res[0] = max(left[0], left[1]) + max(right[0], right[1])\\n res[1] = root.val + left[0] + right[0]\\n return res\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def helper(root):\\n if not root:\\n return (0,0)\\n \\n temp_left = helper(root.left)\\n temp_right = helper(root.right)\\n\\n steal = root.val + temp_left[1] + temp_right[1]\\n not_steal = max(temp_left[0], temp_left[1]) + max(temp_right[0], temp_right[1])\\n \\n return (steal, not_steal)\\n \\n results = helper(root)\\n return max(results[0], results[1])\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n\\n #return pair -> [withRoot, withoutRoot]\\n def dfs(root):\\n if not root:\\n return [0,0]\\n leftPair = dfs(root.left)\\n rightPair = dfs(root.right)\\n\\n withRoot = root.val + leftPair[1] + rightPair[1]\\n withoutRoot = max(leftPair) + max(rightPair)\\n\\n return [withRoot, withoutRoot]\\n \\n return max(dfs(root))\\n\\n\\n \\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def dfs(node):\\n if not node:\\n return 0, 0\\n \\n left_with, left_without = dfs(node.left)\\n right_with, right_without = dfs(node.right)\\n \\n with_node = node.val + left_without + right_without\\n\\n without_node = max(left_with, left_without) + max(right_with, right_without)\\n\\n return with_node, without_node\\n \\n return max(dfs(root))\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# from collections import deque\\n# # Definition for a binary tree node.\\n# # class TreeNode:\\n# # def __init__(self, val=0, left=None, right=None):\\n# # self.val = val\\n# # self.left = left\\n# # self.right = right\\n# class Solution:\\n# def rob_helper(self, root):\\n# value_1 = root.val\\n# value_2 = 0\\n# if root.left:\\n# self.rob_helper(root.left)\\n# if root.left.left:\\n# value_1 += root.left.left.val\\n# if root.left.right:\\n# value_1 += root.left.right.val\\n# value_2 += root.left.val\\n# if root.right:\\n# self.rob_helper(root.right)\\n# if root.right.left:\\n# value_1 += root.right.left.val\\n# if root.right.right:\\n# value_1 += root.right.right.val\\n# value_2 += root.right.val\\n# root.val = max(value_1, value_2)\\n# self.result = max(self.result, root.val)\\n\\n\\n# def rob(self, root: Optional[TreeNode]) -> int:\\n# # For each node, there are two situations:\\n# # 1. If we choose to use the current node, then we need add cur-value and the grandson value\\n# # 2. if we choose not to use, we just need all the child value\\n# # keep the max\\n# # so we need to use the post-order traversal\\n# if not root.left and not root.right:\\n# return root.val\\n# self.result = 0\\n# self.rob_helper(root)\\n# return self.result\\n\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n # dp数组（dp table）以及下标的含义：\\n # 1. 下标为 0 记录 **不偷该节点** 所得到的的最大金钱\\n # 2. 下标为 1 记录 **偷该节点** 所得到的的最大金钱\\n dp = self.traversal(root)\\n return max(dp)\\n\\n # 要用后序遍历, 因为要通过递归函数的返回值来做下一步计算\\n def traversal(self, node):\\n \\n # 递归终止条件，就是遇到了空节点，那肯定是不偷的\\n if not node:\\n return (0, 0)\\n\\n left = self.traversal(node.left)\\n right = self.traversal(node.right)\\n\\n # 不偷当前节点, 偷子节点\\n val_0 = max(left[0], left[1]) + max(right[0], right[1])\\n\\n # 偷当前节点, 不偷子节点\\n val_1 = node.val + left[0] + right[0]\\n\\n return (val_0, val_1) \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\n\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n # Memoization for storing the results for each node\\n memo = {}\\n \\n def dp(node):\\n if node is None:\\n return (0, 0) # (max when not robbed, max when robbed)\\n \\n if node in memo:\\n return memo[node]\\n \\n # Recur for left and right children\\n left = dp(node.left)\\n right = dp(node.right)\\n \\n # Case 1: Rob current node, then we can't rob the children\\n rob_current = node.val + left[0] + right[0]\\n \\n # Case 2: Don't rob current node, we can decide to rob or not rob the children\\n not_rob_current = max(left) + max(right)\\n \\n # Memoize the result for the current node\\n memo[node] = (not_rob_current, rob_current)\\n \\n return memo[node]\\n \\n # At root, we want the maximum of robbing or not robbing the root\\n return max(dp(root))\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(node):\\n if not node:\\n return (0, 0)\\n \\n left = dfs(node.left)\\n right = dfs(node.right)\\n \\n rob = node.val + left[1] + right[1]\\n \\n not_rob = max(left) + max(right)\\n \\n return (rob, not_rob)\\n \\n return max(dfs(root))\\n\\n\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(root: TreeNode):\\n #returns a Pair. Want to create at each level [val at level, val of prev level]\\n if(not root):\\n return (0,0)\\n left: int = dfs(root.left)\\n right: int = dfs(root.right)\\n\\n return root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0],right[1])\\n\\n return max(dfs(root))\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n # Memo\\n \\n # Dynamic programming function\\n def foo(x):\\n\\n # Check if th tree is empty\\n if not x:\\n # Return the tuple 0,0\\n return (0, 0)\\n \\n # If the left and right is none\\n if not x.left and not x.right: \\n \\n # Return the value of x and 0\\n return (x.val, 0)\\n \\n # Return two possibilities\\n \\n # 1. Left node is robbed and the left node is not robbed\\n lrobbed, lnotrobbed = foo(x.left)\\n\\n # 2. right node is robbed and the right node is not robbed\\n rrobbed, rnotrobbed = foo(x.right)\\n \\n # After knowing the information above check the amount\\n # It is the value of x added by the amount of l and r are not robbed \\n check = x.val + lnotrobbed + rnotrobbed\\n \\n # Compare the max of left robbed condition, and righ robbed condition\\n # Add the two max values together\\n check_max = max(lrobbed, lnotrobbed) + max(rrobbed, rnotrobbed)\\n\\n # Return two values, first the value of the value where the robbed is stop\\n # second is the value when there are opportunieties that left or right robbed\\n return (check, check_max)\\n \\n # Return the answer which is the max amount of money the thief can rob\\n return max(foo(root))\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(root):\\n if not root: return [0,0]\\n leftPair = dfs(root.left)\\n rightPair = dfs(root.right)\\n\\n withRoot = root.val+leftPair[1]+rightPair[1]\\n withoutRoot = max(leftPair)+max(rightPair)\\n\\n return [withRoot,withoutRoot]\\n return max(dfs(root))\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def rob(self, root: TreeNode) -> int:\\n def helper(node):\\n # return [rob this node, not rob this node]\\n if not node:\\n return (0, 0)\\n left = helper(node.left)\\n right = helper(node.right)\\n # if we rob this node, we cannot rob its children\\n rob = node.val + left[1] + right[1]\\n # else we could choose to either rob its children or not\\n not_rob = max(left) + max(right)\\n return [rob, not_rob]\\n\\n return max(helper(root))\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n res = self.dfs(root)\\n return max(res)\\n\\n def dfs(self, root):\\n # dp[0] is the maximum value with robbing current node\\n # dp[1] is the maximum value with not robbing current node\\n if not root:\\n return [0, 0]\\n\\n dp = [0, 0]\\n left_values = self.dfs(root.left)\\n right_values = self.dfs(root.right)\\n dp[0] = root.val + left_values[1] + right_values[1]\\n dp[1] = max(left_values) + max(right_values)\\n\\n return dp\\n\\n\\n\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def helper(node):\\n if not node:\\n return 0, 0\\n left, leftNotIncl = helper(node.left)\\n right, rightNotIncl = helper(node.right)\\n notInclude = left + right\\n include = node.val + leftNotIncl + rightNotIncl\\n return max(include, notInclude), notInclude\\n res, _ = helper(root)\\n return res\\n\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(root):\\n if not root:\\n return [0, 0]\\n \\n # # if it's leaf\\n # if not root.left and not root.right:\\n # return [root.val, 0]\\n\\n left = dfs(root.left)\\n right = dfs(root.right)\\n # print(root.val)\\n # print(left)\\n # print(right)\\n\\n return [root.val + left[1] + right[1], max(left) + max(right)]\\n # return [root.val + left[1] + right[1], left[0] + right[0]]\\n \\n return max(dfs(root))\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n dp1, dp2 = self.trav(root)\\n return max(dp1, dp2)\\n \\n\\n def trav(self, root):\\n if not root:\\n return (0, 0)\\n left = self.trav(root.left)\\n right = self.trav(root.right)\\n val1 = root.val + left[0] + right[0]\\n val2 = max(left[0], left[1]) + max(right[0], right[1])\\n return (val2, val1)\\n\\n\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(node):\\n if not node: return [0, 0]\\n left = dfs(node.left)\\n right = dfs(node.right)\\n withnode = left[1] + right[1] + node.val\\n withoutnode = max(left) + max(right)\\n return [withnode, withoutnode]\\n return max(dfs(root))\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def recur(n):\\n if not n: return 0, 0\\n \\n use_lc, skip_lc = recur(n.left)\\n use_rc, skip_rc = recur(n.right)\\n \\n use_this = n.val + skip_lc + skip_rc\\n skip_this = max(use_lc, skip_lc) + max(use_rc, skip_rc)\\n \\n return use_this, skip_this\\n \\n \\n if not root: return 0\\n return max(recur(root))\\n \\n \\n \\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n cache = {}\\n\\n def dfs(node, yes):\\n if not node: return 0\\n \\n count = 0\\n if yes:\\n count += node.val\\n if (node.left, not yes) not in cache:\\n cache[(node.left, not yes)] = dfs(node.left, not yes)\\n if (node.right, not yes) not in cache:\\n cache[(node.right, not yes)] = dfs(node.right, not yes)\\n count += cache[(node.left, not yes)] + cache[(node.right, not yes)]\\n \\n else:\\n if (node.left, not yes) not in cache:\\n cache[(node.left, not yes)] = dfs(node.left, not yes)\\n if (node.left, yes) not in cache:\\n cache[(node.left, yes)] = dfs(node.left, yes)\\n if (node.right, not yes) not in cache:\\n cache[(node.right, not yes)] = dfs(node.right, not yes)\\n if (node.right, yes) not in cache:\\n cache[(node.right, yes)] = dfs(node.right, yes)\\n\\n count += max(cache[(node.left, not yes)], cache[(node.left, yes)])\\n count += max(cache[(node.right, not yes)], cache[(node.right, yes)])\\n\\n return count\\n\\n return max(dfs(root, False), dfs(root, True))\\n\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n cache = {}\\n\\n def dfs(node, rob):\\n if node is None:\\n return 0\\n \\n if (node, False) not in cache:\\n cache[(node, False)] = dfs(node.left, True) + dfs(node.right, True)\\n if (node, True) not in cache:\\n cache[(node, True)] = node.val + dfs(node.left, False) + dfs(node.right, False)\\n noRobOption = cache[(node, False)]\\n robOption = cache[(node, True)]\\n\\n if rob:\\n return max(noRobOption, robOption)\\n else:\\n return noRobOption\\n \\n return dfs(root, True)\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n #what do you want from child\\n #max value for left for right\\n #what do you want report to parent\\n #add current node or not\\n\\n @lru_cache(None)\\n def DFS(node,pre_rob):\\n if node==None:\\n return 0\\n\\n if pre_rob==False:\\n #rob\\n rob=DFS(node.left,True)+node.val+DFS(node.right,True)\\n #not rob\\n not_rob=DFS(node.left,False)+DFS(node.right,False)\\n return max(rob,not_rob)\\n else:\\n return DFS(node.left,False)+DFS(node.right,False)\\n \\n\\n pre_rob=False\\n return DFS(root,pre_rob=False)\\n\\n#time O(2*n) and space O(height)+O(2*n)\\n#rob and not rob\\n\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: TreeNode) -> int:\\n def rob_subtree(node):\\n if not node:\\n return (0, 0) # (rob this node, don't rob this node)\\n\\n # Recursively call on the left and right children\\n left = rob_subtree(node.left)\\n right = rob_subtree(node.right)\\n\\n # If we rob this node, we cannot rob its children\\n rob_this = node.val + left[1] + right[1]\\n\\n # If we don't rob this node, we can choose to rob or not rob the children\\n dont_rob_this = max(left) + max(right)\\n\\n return (rob_this, dont_rob_this)\\n\\n # Call the helper on the root and return the maximum value\\n return max(rob_subtree(root))\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\n\\n@cache\\ndef fun(root,flag):\\n\\n if root==None:\\n return 0\\n if flag==1:\\n ans=fun(root.left,0)+fun(root.right,0)\\n else:\\n ans=max(root.val+fun(root.left,flag+1)+fun(root.right,flag+1),fun(root.left,0)+fun(root.right,0))\\n \\n return ans\\n\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n\\n return max(fun(root,0),fun(root,1))\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"'''\\nThe thief has found himself a new place for his thievery again.\\n\\nThere is only one entrance to this area, called root.\\n- problem starts at root\\n- root is a recursive term\\n - can solve sub-problems?\\n\\nBesides the root, each house has one and only one parent house.\\n\\nAfter a tour, the smart thief realized that all houses in this place form a binary tree.\\n- binary tree problem\\n- probably use DFS or BFS\\n - repeated work though?\\n\\nIt will automatically contact the police if \\ntwo directly-linked houses were broken into on the same night.\\n- cant rob root and root.left/root.right\\n - remember to check if left and right exist before accessing\\n- picking problem:\\n - rob root\\n - dont rob root\\n\\nGiven the root of the binary tree, return \\nthe maximum amount of money the thief can rob without alerting the police.\\n- maximization problem\\n\\nThe number of nodes in the tree is in the range [1, 10^4].\\n\\n0 <= Node.val <= 10^4\\n\\nInput: root = [3,2,3,null,3,null,1]\\nOutput: 7\\n- pick 3\\n - skip its children (2, 3)\\n - problem starts over again at 2 and 3s children\\n- skip 3\\n - problem starts over again at 3s children\\n\\n\\nInput: root = root\\nOutput: res = res\\n- pick root\\n - skip left, skip right\\n - root.val + f(left.left) + f(right.right)\\n- skip root\\n - f(left) + f(right)\\n\\nmax(\\n root.val + f(left.left) f(left.right) + f(right.left) + f(right.right),\\n f(left) + f(right)\\n)\\n'''\\n\\n# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n cache = {}\\n\\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\\n if not node:\\n return 0\\n if node in cache:\\n print(\\\"cache hit!\\\")\\n return cache[node]\\n \\n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\\n\\n pick = node.val + pickLeft + pickRight\\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\\n\\n cache[node] = max(pick, skip)\\n return max(pick, skip)\\n \\n return maxProfitStartingAt(root)\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n dp = {}\\n return self.dfs(root, True, dp) \\n\\n def dfs(self, root, can_rob, dp):\\n if (root, can_rob) in dp:\\n return dp[(root, can_rob)]\\n if not root:\\n return 0\\n rob_total = 0\\n skip_total = 0\\n\\n if can_rob:\\n # If we rob current house\\n rob_total += root.val\\n rob_total += self.dfs(root.left, False, dp)\\n rob_total += self.dfs(root.right, False, dp)\\n # If we skip current house\\n skip_total += self.dfs(root.left, True, dp)\\n skip_total += self.dfs(root.right, True, dp)\\n\\n dp[(root, can_rob)] = max(rob_total, skip_total)\\n return dp[(root, can_rob)]\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n #what do you want from child\\n #max value for left for right\\n #what do you want report to parent\\n #add current node or not\\n\\n @lru_cache(None)\\n def DFS(node,pre_rob):\\n if node==None:\\n return 0\\n\\n if pre_rob==False:\\n #rob\\n rob=DFS(node.left,True)+node.val+DFS(node.right,True)\\n #not rob\\n not_rob=DFS(node.left,False)+DFS(node.right,False)\\n return max(rob,not_rob)\\n else:\\n return DFS(node.left,False)+DFS(node.right,False)\\n \\n\\n pre_rob=False\\n return DFS(root,pre_rob=False)\\n\\n#time O(n) and space O(height)\\n\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\n\\nclass Solution:\\n def robTree(self, node: Optional[TreeNode]) -> (int,int):\\n if not node:\\n return (0,0)\\n\\n left = self.robTree(node.left)\\n right = self.robTree(node.right)\\n\\n val1 = node.val + left[0] + right[0]\\n val2 = max(left[0], left[1]) + max(right[0], right[1])\\n return (val2, val1)\\n\\n def rob(self, root: Optional[TreeNode]) -> int:\\n val1, val2 = self.robTree(root)\\n return max(val1, val2)\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def __init__(self):\\n self.memo = {}\\n def rob(self, root: Optional[TreeNode],canrob=True) -> int:\\n if not root: return 0 \\n if (root,canrob) in self.memo : return self.memo[(root,canrob)]\\n if canrob: \\n rob = root.val + self.rob(root.left,False) +self.rob(root.right,False)\\n else:\\n rob=0\\n norob= self.rob(root.left,True) +self.rob(root.right,True)\\n ans = max(rob,norob)\\n self.memo[(root,canrob)] = ans\\n return ans\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n memo = {}\\n def dfs(node, canRob):\\n if not node: return 0\\n if (node, canRob) in memo: return memo[(node, canRob)]\\n res = 0\\n if not canRob: \\n res = dfs(node.left, True) + dfs(node.right, True)\\n else:\\n res = max(dfs(node.left, True) + dfs(node.right, True), \\n dfs(node.left, False) + node.val + dfs(node.right, False))\\n memo[(node, canRob)] = res\\n return res\\n return dfs(root, True)\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n memo = {}\\n @lru_cache\\n def dp(node):\\n if not node:\\n return 0\\n \\n if node in memo:\\n return memo[node]\\n \\n grand_left = dp(node.left.left) + dp(node.left.right) if node.left else 0\\n grand_right = dp(node.right.left) + dp(node.right.right) if node.right else 0\\n memo[node] = max(\\n node.val + grand_left + grand_right,\\n dp(node.left) + dp(node.right)\\n )\\n\\n return memo[node]\\n\\n return dp(root)\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"runtime\": \"59\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":47,"string":"47"},"mm_list":{"kind":"list like","value":[{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def helper(node):\n if not node:\n return (0, 0)\n # recusive case \n left = helper(node.left)\n right = helper(node.right)\n\n rob = node.val + left[1] + right[1]\n\n not_rob = max(left) + max(right)\n\n return [rob, not_rob]\n return max(helper(root))","memory":"17700"},{"code":"'''\n算法原理\n每个节点都有两种状态：\n\n抢劫这个房子。\n不抢劫这个房子。\n为了避免抢劫相邻的两个节点，我们可以通过递归的方式，从下到上计算每个节点在这两种状态下的最大收益，\n并且将左右子树的结果组合起来，从而得到当前节点的最优解。\n\n具体的思路如下：\n\n对于每一个节点，我们分别计算抢劫该节点和不抢劫该节点时的收益。\n如果抢劫当前节点，那么它的左右子节点就不能被抢劫。因此当前节点的收益为：当前节点的值 + 左右子节点在不被抢劫时的最大收益。\n如果不抢劫当前节点，那么它的左右子节点可以选择抢劫或者不抢劫，因此当前节点的收益为：左右子节点在可选的最大收益之和。\n这个过程使用深度优先搜索（DFS）来遍历树的每个节点。\n\n算法分析\n时间复杂度: 每个节点在遍历时都会被访问一次，因此时间复杂度为 O(n)，其中 n 是二叉树的节点数。\n空间复杂度: 由于递归的深度最多为二叉树的高度，空间复杂度为 O(h)，其中 h 是二叉树的高度。\n在最坏情况下（如树退化为链表），递归深度为 O(n)，因此空间复杂度为 O(n)。\n'''\n\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n # 定义一个递归函数，用于计算当前节点被抢与不被抢的最大收益\n def dfs(node):\n # 如果当前节点为空，返回（0, 0），表示无论抢与不抢，收益都是0\n if not node:\n return 0, 0\n \n # 递归计算左子节点抢与不抢的最大收益\n left_rob, left_not_rob = dfs(node.left)\n # 递归计算右子节点抢与不抢的最大收益\n right_rob, right_not_rob = dfs(node.right)\n\n # 当前节点抢劫时，左右子节点不能被抢，所以收益为：\n # 当前节点的值 + 左右子节点不抢的最大收益\n rob = node.val + left_not_rob + right_not_rob\n \n # 当前节点不抢时，可以选择左右子节点抢或不抢，因此收益为：\n # 左右子节点抢或不抢的最大值之和\n not_rob = max(left_rob, left_not_rob) + max(right_rob, right_not_rob)\n\n # 返回抢与不抢的收益\n return rob, not_rob\n \n # 调用递归函数，从根节点开始，返回最大收益\n return max(dfs(root))\n","memory":"17800"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(node):\n if not node:\n return 0, 0\n \n \n robleft, nrobleft = dfs(node.left)\n robright, nrobright = dfs(node.right)\n # rob cur node:\n robcur = node.val + nrobleft + nrobright\n nrobcur = max(robleft, nrobleft) + max(robright, nrobright)\n\n return robcur, nrobcur\n \n return max(dfs(root))","memory":"17900"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n # Memo\n \n # Dynamic programming function\n def foo(x):\n\n # Check if th tree is empty\n if not x:\n # Return the tuple 0,0\n return (0, 0)\n \n # If the left and right is none\n if not x.left and not x.right: \n \n # Return the value of x and 0\n return (x.val, 0)\n \n # Return two possibilities\n \n # 1. Left node is robbed and the left node is not robbed\n lrobbed, lnotrobbed = foo(x.left)\n\n # 2. right node is robbed and the right node is not robbed\n rrobbed, rnotrobbed = foo(x.right)\n \n # After knowing the information above check the amount\n # It is the value of x added by the amount of l and r are not robbed \n check = x.val + lnotrobbed + rnotrobbed\n \n # Compare the max of left robbed condition, and righ robbed condition\n # Add the two max values together\n check_max = max(lrobbed, lnotrobbed) + max(rrobbed, rnotrobbed)\n\n # Return two values, first the value of the value where the robbed is stop\n # second is the value when there are opportunieties that left or right robbed\n return (check, check_max)\n \n # Return the answer which is the max amount of money the thief can rob\n return max(foo(root))\n ","memory":"18000"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n\n #return pair -> [withRoot, withoutRoot]\n def dfs(root):\n if not root:\n return [0,0]\n leftPair = dfs(root.left)\n rightPair = dfs(root.right)\n\n withRoot = root.val + leftPair[1] + rightPair[1]\n withoutRoot = max(leftPair) + max(rightPair)\n\n return [withRoot, withoutRoot]\n \n return max(dfs(root))\n\n\n \n ","memory":"18000"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(root: TreeNode):\n #returns a Pair. Want to create at each level [val at level, val of prev level]\n if(not root):\n return (0,0)\n left: int = dfs(root.left)\n right: int = dfs(root.right)\n\n return root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0],right[1])\n\n return max(dfs(root))","memory":"18100"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def helper(root):\n if not root:\n return (0,0)\n \n temp_left = helper(root.left)\n temp_right = helper(root.right)\n\n steal = root.val + temp_left[1] + temp_right[1]\n not_steal = max(temp_left[0], temp_left[1]) + max(temp_right[0], temp_right[1])\n \n return (steal, not_steal)\n \n results = helper(root)\n return max(results[0], results[1])","memory":"18100"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n res = self.dfs(root)\n return max(res)\n\n def dfs(self, root):\n # dp[0] is the maximum value with robbing current node\n # dp[1] is the maximum value with not robbing current node\n if not root:\n return [0, 0]\n\n dp = [0, 0]\n left_values = self.dfs(root.left)\n right_values = self.dfs(root.right)\n dp[0] = root.val + left_values[1] + right_values[1]\n dp[1] = max(left_values) + max(right_values)\n\n return dp\n\n\n\n ","memory":"18200"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dfs(root):\n if not root: return [0,0]\n leftPair = dfs(root.left)\n rightPair = dfs(root.right)\n\n withRoot = root.val+leftPair[1]+rightPair[1]\n withoutRoot = max(leftPair)+max(rightPair)\n\n return [withRoot,withoutRoot]\n return max(dfs(root))\n ","memory":"18200"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, x):\n# self.val = x\n# self.left = None\n# self.right = None\n\nclass Solution:\n \"\"\"\n Input: [3,4,5,1,3,null,1]\n input tree dp tree:\n 3 [3+3+1,4+5]\n / \\ / \\\n 4 5 [4,3] [5,1]\n / \\ \\ / \\ \\\n 1 2 1 [1,0] [2,0] [1,0]\n / \\ / \\ / \\\n [0,0] [0,0] [0,0] [0,0] [0,0] [0,0]\n \n \"\"\"\n def rob(self, root: TreeNode) -> int:\n return max(self.dfs(root))\n \n def dfs(self, root: TreeNode):\n if not root:\n return (0, 0)\n left = self.dfs(root.left)\n right = self.dfs(root.right)\n return (root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0], right[1]))","memory":"18300"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def dfs(node):\n # returns (rob, not rob)\n if not node:\n return (0, 0)\n if not node.left and not node.right:\n return (node.val, 0)\n \n lrob, lnorob = dfs(node.left)\n rrob, rnorob = dfs(node.right)\n\n print(node.val + lnorob + rnorob, lrob + rrob)\n return (node.val + lnorob + rnorob, max(lnorob + rnorob, lnorob + rrob, lrob + rnorob, lrob + rrob))\n return max(dfs(root))","memory":"18300"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n res = {}\n return self.robSub(root, res)\n \n \n def robSub(self, root: Optional[TreeNode], res: dict) -> int:\n if root == None:\n return 0\n if root in res:\n return res[root]\n\n # if rob at the current level\n money = root.val\n if root.left:\n money += self.robSub(root.left.left, res) + self.robSub(root.left.right, res)\n \n if root.right:\n money += self.robSub(root.right.left, res) + self.robSub(root.right.right, res)\n \n # if not rob the current level, but rob the child level\n child_money = self.robSub(root.left, res) + self.robSub(root.right, res)\n\n # get the maximum possible money\n money = max(money, child_money)\n\n res[root] = money\n\n return money\n\n\n\n\n\n\n\n\n\n \n\n \n\n","memory":"18400"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n def dp(node, memo):\n if node in memo:\n return memo[node]\n \n if not node:\n return 0\n \n skip_this_house = dp(node.left, memo) + dp(node.right, memo)\n rob_this_house = (node.val + \n (dp(node.left.left, memo) if node.left and node.left.left else 0) + \n (dp(node.left.right, memo) if node.left and node.left.right else 0) + \n (dp(node.right.left, memo) if node.right and node.right.left else 0) + \n (dp(node.right.right, memo) if node.right and node.right.right else 0))\n memo[node] = max(skip_this_house, rob_this_house)\n return memo[node]\n\n return dp(root, {})\n ","memory":"18500"},{"code":"'''\nThe thief has found himself a new place for his thievery again.\n\nThere is only one entrance to this area, called root.\n- problem starts at root\n- root is a recursive term\n - can solve sub-problems?\n\nBesides the root, each house has one and only one parent house.\n\nAfter a tour, the smart thief realized that all houses in this place form a binary tree.\n- binary tree problem\n- probably use DFS or BFS\n - repeated work though?\n\nIt will automatically contact the police if \ntwo directly-linked houses were broken into on the same night.\n- cant rob root and root.left/root.right\n - remember to check if left and right exist before accessing\n- picking problem:\n - rob root\n - dont rob root\n\nGiven the root of the binary tree, return \nthe maximum amount of money the thief can rob without alerting the police.\n- maximization problem\n\nThe number of nodes in the tree is in the range [1, 10^4].\n\n0 <= Node.val <= 10^4\n\nInput: root = [3,2,3,null,3,null,1]\nOutput: 7\n- pick 3\n - skip its children (2, 3)\n - problem starts over again at 2 and 3s children\n- skip 3\n - problem starts over again at 3s children\n\n\nInput: root = root\nOutput: res = res\n- pick root\n - skip left, skip right\n - root.val + f(left.left) + f(right.right)\n- skip root\n - f(left) + f(right)\n\nmax(\n root.val + f(left.left) f(left.right) + f(right.left) + f(right.right),\n f(left) + f(right)\n)\n'''\n\n# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n cache = {}\n\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\n if not node:\n return 0\n if node in cache:\n print(\"cache hit!\")\n return cache[node]\n \n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\n\n pick = node.val + pickLeft + pickRight\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\n\n cache[node] = max(pick, skip)\n return max(pick, skip)\n \n return maxProfitStartingAt(root)","memory":"18600"},{"code":"'''\nThe thief has found himself a new place for his thievery again.\n\nThere is only one entrance to this area, called root.\n- problem starts at root\n- root is a recursive term\n - can solve sub-problems?\n\nBesides the root, each house has one and only one parent house.\n\nAfter a tour, the smart thief realized that all houses in this place form a binary tree.\n- binary tree problem\n- probably use DFS or BFS\n - repeated work though?\n\nIt will automatically contact the police if \ntwo directly-linked houses were broken into on the same night.\n- cant rob root and root.left/root.right\n - remember to check if left and right exist before accessing\n- picking problem:\n - rob root\n - dont rob root\n\nGiven the root of the binary tree, return \nthe maximum amount of money the thief can rob without alerting the police.\n- maximization problem\n\nThe number of nodes in the tree is in the range [1, 10^4].\n\n0 <= Node.val <= 10^4\n\nInput: root = [3,2,3,null,3,null,1]\nOutput: 7\n- pick 3\n - skip its children (2, 3)\n - problem starts over again at 2 and 3s children\n- skip 3\n - problem starts over again at 3s children\n\n\nInput: root = root\nOutput: res = res\n- pick root\n - skip left, skip right\n - root.val + f(left.left) + f(right.right)\n- skip root\n - f(left) + f(right)\n\nmax(\n root.val + f(left.left) f(left.right) + f(right.left) + f(right.right),\n f(left) + f(right)\n)\n'''\n\n# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n cache = {}\n\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\n if not node:\n return 0\n if node in cache:\n return cache[node]\n \n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\n\n pick = node.val + pickLeft + pickRight\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\n\n cache[node] = max(pick, skip)\n return max(pick, skip)\n \n return maxProfitStartingAt(root)","memory":"18700"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n dp = {}\n def rob(self, root: Optional[TreeNode]) -> int:\n if root == None:\n return 0\n\n if self.dp.get(root) != None:\n return self.dp[root]\n\n op1 = self.rob(root.left)+self.rob(root.right)\n\n if root.left == None:\n if root.right == None:\n return root.val\n else:\n op2 = root.val + self.rob(root.right.left)+self.rob(root.right.right)\n else:\n if root.right == None:\n op2 = root.val + self.rob(root.left.left)+self.rob(root.left.right)\n else:\n op2 = root.val + self.rob(root.left.left)+self.rob(root.left.right)+self.rob(root.right.left)+self.rob(root.right.right)\n\n self.dp[root] = max(op1,op2)\n return self.dp[root]\n ","memory":"18800"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n def recur(root, name, memo):\n if root == None:\n return 0\n if name in memo:\n return memo[name]\n left_side = recur(root.left.left, name * 4, memo) + recur(root.left.right, name * 4 + 1, memo) if root.left != None else 0\n right_side = recur(root.right.left, name * 4 + 2, memo) + recur(root.right.right, name * 4 + 3, memo) if root.right != None else 0\n # use_this = left_side + right_side + root.val\n # skip_this = recur(root.left, name * 2, memo) + recur(root.right, name * 2 + 1, memo)\n memo[name] = max(left_side + right_side + root.val, recur(root.left, name * 2, memo) + recur(root.right, name * 2 + 1, memo))\n return memo[name]\n return recur(root, 1, dict())","memory":"18900"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n @cache\n def dp(node):\n if node == None:\n return 0\n\n left_tree = node.left\n right_tree = node.right\n take = node.val\n not_take = 0\n\n if left_tree:\n take += dp(left_tree.left) + dp(left_tree.right)\n if right_tree:\n take += dp(right_tree.left) + dp(right_tree.right)\n\n not_take += dp(left_tree) + dp(right_tree)\n\n return max(take, not_take)\n\n return dp(root)","memory":"19000"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","memory":"19100"},{"code":"\n\n# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n @cache\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\n if not node:\n return 0\n \n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\n\n pick = node.val + pickLeft + pickRight\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\n\n return max(pick, skip)\n \n return maxProfitStartingAt(root)","memory":"19200"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\n\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n # Memoization for storing the results for each node\n memo = {}\n \n def dp(node):\n if node is None:\n return (0, 0) # (max when not robbed, max when robbed)\n \n if node in memo:\n return memo[node]\n \n # Recur for left and right children\n left = dp(node.left)\n right = dp(node.right)\n \n # Case 1: Rob current node, then we can't rob the children\n rob_current = node.val + left[0] + right[0]\n \n # Case 2: Don't rob current node, we can decide to rob or not rob the children\n not_rob_current = max(left) + max(right)\n \n # Memoize the result for the current node\n memo[node] = (not_rob_current, rob_current)\n \n return memo[node]\n \n # At root, we want the maximum of robbing or not robbing the root\n return max(dp(root))\n","memory":"19300"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n # def helper(height, root, sums):\n # if root==None: return\n # sums[height%2]+=root.val\n # helper(height+1, root.left, sums)\n # helper(height+1, root.right,sums)\n\n # sums=[0,0]\n # helper(0,root,sums)\n # return max(sums)\n\n def helper(rt, index, dp):\n if index in dp: return dp[index]\n if rt==None: \n dp[index]=0\n return 0\n x=y=u=v=0\n if rt.left !=None:\n x=helper(rt.left.left, 2*(2*index+1)+1,dp)\n y=helper(rt.left.right, 2*(2*index+1)+2, dp)\n if rt.right!=None:\n u=helper(rt.right.left, 2*(2*index+2)+1, dp)\n v=helper(rt.right.right, 2*(2*index+2)+2, dp)\n dp[index]=max(\n rt.val+x+y+u+v,\n helper(rt.left, 2*index+1, dp)+helper(rt.right, 2*index+2, dp)\n )\n return dp[index]\n return helper(root,0,{})","memory":"19400"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","memory":"19500"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","memory":"19500"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","memory":"19600"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n d = {}\n def rob(self, root: Optional[TreeNode], d = d) -> int:\n if root in d :\n return d[root]\n if root == None :\n return 0\n if root.left == None or root.left.left == None :\n M1 = None\n else : \n M1 = root.left.left\n \n if root.left == None or root.left.right == None :\n M2 = None\n else : \n M2 = root.left.right\n \n if root.right == None or root.right.left == None :\n M3 = None\n else : \n M3 = root.right.left\n\n if root.right == None or root.right.right == None :\n M4 = None\n else : \n M4 = root.right.right\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\n return d[root]","memory":"19700"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n if not root:\n return 0\n \n tree = []\n graph = {-1: []}\n index = -1\n q = [(root, -1)]\n while q:\n node, parent_index = q.pop()\n if node:\n index += 1\n tree.append(node.val)\n graph[index] = []\n graph[parent_index].append(index)\n q.append((node.left, index))\n q.append((node.right, index))\n \n dp_rob = [0] * (index + 1)\n dp_not_rob = [0] * (index + 1)\n\n for i in reversed(range(index + 1)):\n if not graph[i]:\n dp_rob[i] = tree[i]\n dp_not_rob[i] = 0\n else:\n dp_rob[i] = tree[i] + sum(dp_not_rob[child] for child in graph[i])\n dp_not_rob[i] = sum(max(dp_not_rob[child], dp_rob[child]) for child in graph[i])\n\n return max(dp_rob[0], dp_not_rob[0])","memory":"19800"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n # @lru_cache(None)\n # def dfs(node):\n # if not node: return 0\n # if not node.left and not node.right: return node.val\n # if not node.left:\n # return max(node.val + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right))\n # if not node.right:\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right), dfs(node.left))\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right) + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right) + dfs(node.left) )\n \n # return dfs(root)\n @lru_cache(None)\n def dfs(node):\n if not node: return (0,0)\n\n left = dfs(node.left)\n right = dfs(node.right)\n\n return (node.val + left[1] + right[1], max(left) + max(right))\n return max(dfs(root))\n\n \n \n\n","memory":"19900"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n # @lru_cache(None)\n # def dfs(node):\n # if not node: return 0\n # if not node.left and not node.right: return node.val\n # if not node.left:\n # return max(node.val + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right))\n # if not node.right:\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right), dfs(node.left))\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right) + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right) + dfs(node.left) )\n \n # return dfs(root)\n @lru_cache(None)\n def dfs(node):\n if not node: return (0,0)\n\n left = dfs(node.left)\n right = dfs(node.right)\n\n return (node.val + left[1] + right[1], max(left) + max(right))\n return max(dfs(root))\n\n \n \n\n","memory":"19900"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n tree = []\n graph = { - 1: [] }\n index = -1\n q = [(root, -1)]\n while q:\n node, parent_index = q.pop(0)\n if node:\n index += 1\n tree.append(node.val)\n graph[index] = []\n graph[parent_index].append(index)\n q.append((node.left, index))\n q.append((node.right, index))\n \n dp_rob = [0] * (index + 1)\n dp_not_rob = [0] * (index + 1)\n \n for i in reversed(range(index + 1)):\n if not graph[i]:\n dp_rob[i] = tree[i]\n dp_not_rob[i] = 0\n else:\n dp_rob[i] = tree[i] + sum(dp_not_rob[child] for child in graph[i])\n dp_not_rob[i] = sum(max(dp_rob[child], dp_not_rob[child]) for child in graph[i])\n \n return max(dp_rob[0], dp_not_rob[0])","memory":"20000"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n @cache\n def helper(root, flag):\n if root == None:\n return 0\n if root.left == None and root.right == None:\n return root.val if not flag else 0\n \n res = -inf\n if flag:\n res = helper(root.left, False) + helper(root.right, False) \n else:\n res = max(root.val + helper(root.left, True) + helper(root.right, True),\n helper(root.left, False)+helper(root.right, False))\n return res\n return helper(root, False)","memory":"20100"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n @cache\n def rob(self, root: Optional[TreeNode]) -> int:\n if not root: return 0\n a1 = root.val\n a2 = self.rob(root.left) + self.rob(root.right)\n if root.left:\n a1 += self.rob(root.left.left) + self.rob(root.left.right)\n if root.right:\n a1 += self.rob(root.right.left) + self.rob(root.right.right)\n return max(a1, a2)","memory":"20200"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n @cache\n def dp(node):\n if not node: return [0, 0]\n left = dp(node.left)\n right= dp(node.right)\n res = [\n max(left[i] + right[j] for i in range(2) for j in range(2)),\n node.val +left[0] + right[0]\n ]\n return res\n return max(dp(root))\n","memory":"20300"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n #what do you want from child\n #max value for left for right\n #what do you want report to parent\n #add current node or not\n\n @lru_cache(None)\n def DFS(node,pre_rob):\n if node==None:\n return 0\n\n if pre_rob==False:\n #rob\n rob=DFS(node.left,True)+node.val+DFS(node.right,True)\n #not rob\n not_rob=DFS(node.left,False)+DFS(node.right,False)\n return max(rob,not_rob)\n else:\n return DFS(node.left,False)+DFS(node.right,False)\n \n\n pre_rob=False\n return DFS(root,pre_rob=False)\n\n#time O(2*n) and space O(height)+O(2*n)\n#rob and not rob\n\n","memory":"20300"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n cache = {}\n\n def dfs(node, rob):\n if node is None:\n return 0\n \n if (node, False) not in cache:\n cache[(node, False)] = dfs(node.left, True) + dfs(node.right, True)\n if (node, True) not in cache:\n cache[(node, True)] = node.val + dfs(node.left, False) + dfs(node.right, False)\n noRobOption = cache[(node, False)]\n robOption = cache[(node, True)]\n\n if rob:\n return max(noRobOption, robOption)\n else:\n return noRobOption\n \n return dfs(root, True)","memory":"20400"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n memo = {}\n def dfs(node, canRob):\n if not node: return 0\n if (node, canRob) in memo: return memo[(node, canRob)]\n res = 0\n if not canRob: \n res = dfs(node.left, True) + dfs(node.right, True)\n else:\n res = max(dfs(node.left, True) + dfs(node.right, True), \n dfs(node.left, False) + node.val + dfs(node.right, False))\n memo[(node, canRob)] = res\n return res\n return dfs(root, True)","memory":"20400"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def __init__(self):\n self.memo = {}\n def rob(self, root: Optional[TreeNode],canrob=True) -> int:\n if not root: return 0 \n if (root,canrob) in self.memo : return self.memo[(root,canrob)]\n if canrob: \n rob = root.val + self.rob(root.left,False) +self.rob(root.right,False)\n else:\n rob=0\n norob= self.rob(root.left,True) +self.rob(root.right,True)\n ans = max(rob,norob)\n self.memo[(root,canrob)] = ans\n return ans","memory":"20500"},{"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def rob(self, root: Optional[TreeNode]) -> int:\n \n cache = {}\n\n def dfs(node, yes):\n if not node: return 0\n \n count = 0\n if yes:\n count += node.val\n if (node.left, not yes) not in cache:\n cache[(node.left, not yes)] = dfs(node.left, not yes)\n if (node.right, not yes) not in cache:\n cache[(node.right, not yes)] = dfs(node.right, not yes)\n count += cache[(node.left, not yes)] + cache[(node.right, not yes)]\n \n else:\n if (node.left, not yes) not in cache:\n cache[(node.left, not yes)] = dfs(node.left, not yes)\n if (node.left, yes) not in cache:\n cache[(node.left, yes)] = dfs(node.left, yes)\n if (node.right, not yes) not in cache:\n cache[(node.right, not yes)] = dfs(node.right, not yes)\n if (node.right, yes) not in cache:\n cache[(node.right, yes)] = dfs(node.right, yes)\n\n count += max(cache[(node.left, not yes)], cache[(node.left, yes)])\n count += max(cache[(node.right, not yes)], cache[(node.right, yes)])\n\n return count\n\n return max(dfs(root, False), dfs(root, True))\n","memory":"20500"}],"string":"[\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def helper(node):\\n if not node:\\n return (0, 0)\\n # recusive case \\n left = helper(node.left)\\n right = helper(node.right)\\n\\n rob = node.val + left[1] + right[1]\\n\\n not_rob = max(left) + max(right)\\n\\n return [rob, not_rob]\\n return max(helper(root))\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"'''\\n算法原理\\n每个节点都有两种状态：\\n\\n抢劫这个房子。\\n不抢劫这个房子。\\n为了避免抢劫相邻的两个节点，我们可以通过递归的方式，从下到上计算每个节点在这两种状态下的最大收益，\\n并且将左右子树的结果组合起来，从而得到当前节点的最优解。\\n\\n具体的思路如下：\\n\\n对于每一个节点，我们分别计算抢劫该节点和不抢劫该节点时的收益。\\n如果抢劫当前节点，那么它的左右子节点就不能被抢劫。因此当前节点的收益为：当前节点的值 + 左右子节点在不被抢劫时的最大收益。\\n如果不抢劫当前节点，那么它的左右子节点可以选择抢劫或者不抢劫，因此当前节点的收益为：左右子节点在可选的最大收益之和。\\n这个过程使用深度优先搜索（DFS）来遍历树的每个节点。\\n\\n算法分析\\n时间复杂度: 每个节点在遍历时都会被访问一次，因此时间复杂度为 O(n)，其中 n 是二叉树的节点数。\\n空间复杂度: 由于递归的深度最多为二叉树的高度，空间复杂度为 O(h)，其中 h 是二叉树的高度。\\n在最坏情况下（如树退化为链表），递归深度为 O(n)，因此空间复杂度为 O(n)。\\n'''\\n\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n # 定义一个递归函数，用于计算当前节点被抢与不被抢的最大收益\\n def dfs(node):\\n # 如果当前节点为空，返回（0, 0），表示无论抢与不抢，收益都是0\\n if not node:\\n return 0, 0\\n \\n # 递归计算左子节点抢与不抢的最大收益\\n left_rob, left_not_rob = dfs(node.left)\\n # 递归计算右子节点抢与不抢的最大收益\\n right_rob, right_not_rob = dfs(node.right)\\n\\n # 当前节点抢劫时，左右子节点不能被抢，所以收益为：\\n # 当前节点的值 + 左右子节点不抢的最大收益\\n rob = node.val + left_not_rob + right_not_rob\\n \\n # 当前节点不抢时，可以选择左右子节点抢或不抢，因此收益为：\\n # 左右子节点抢或不抢的最大值之和\\n not_rob = max(left_rob, left_not_rob) + max(right_rob, right_not_rob)\\n\\n # 返回抢与不抢的收益\\n return rob, not_rob\\n \\n # 调用递归函数，从根节点开始，返回最大收益\\n return max(dfs(root))\\n\",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(node):\\n if not node:\\n return 0, 0\\n \\n \\n robleft, nrobleft = dfs(node.left)\\n robright, nrobright = dfs(node.right)\\n # rob cur node:\\n robcur = node.val + nrobleft + nrobright\\n nrobcur = max(robleft, nrobleft) + max(robright, nrobright)\\n\\n return robcur, nrobcur\\n \\n return max(dfs(root))\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n # Memo\\n \\n # Dynamic programming function\\n def foo(x):\\n\\n # Check if th tree is empty\\n if not x:\\n # Return the tuple 0,0\\n return (0, 0)\\n \\n # If the left and right is none\\n if not x.left and not x.right: \\n \\n # Return the value of x and 0\\n return (x.val, 0)\\n \\n # Return two possibilities\\n \\n # 1. Left node is robbed and the left node is not robbed\\n lrobbed, lnotrobbed = foo(x.left)\\n\\n # 2. right node is robbed and the right node is not robbed\\n rrobbed, rnotrobbed = foo(x.right)\\n \\n # After knowing the information above check the amount\\n # It is the value of x added by the amount of l and r are not robbed \\n check = x.val + lnotrobbed + rnotrobbed\\n \\n # Compare the max of left robbed condition, and righ robbed condition\\n # Add the two max values together\\n check_max = max(lrobbed, lnotrobbed) + max(rrobbed, rnotrobbed)\\n\\n # Return two values, first the value of the value where the robbed is stop\\n # second is the value when there are opportunieties that left or right robbed\\n return (check, check_max)\\n \\n # Return the answer which is the max amount of money the thief can rob\\n return max(foo(root))\\n \",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n\\n #return pair -> [withRoot, withoutRoot]\\n def dfs(root):\\n if not root:\\n return [0,0]\\n leftPair = dfs(root.left)\\n rightPair = dfs(root.right)\\n\\n withRoot = root.val + leftPair[1] + rightPair[1]\\n withoutRoot = max(leftPair) + max(rightPair)\\n\\n return [withRoot, withoutRoot]\\n \\n return max(dfs(root))\\n\\n\\n \\n \",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(root: TreeNode):\\n #returns a Pair. Want to create at each level [val at level, val of prev level]\\n if(not root):\\n return (0,0)\\n left: int = dfs(root.left)\\n right: int = dfs(root.right)\\n\\n return root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0],right[1])\\n\\n return max(dfs(root))\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def helper(root):\\n if not root:\\n return (0,0)\\n \\n temp_left = helper(root.left)\\n temp_right = helper(root.right)\\n\\n steal = root.val + temp_left[1] + temp_right[1]\\n not_steal = max(temp_left[0], temp_left[1]) + max(temp_right[0], temp_right[1])\\n \\n return (steal, not_steal)\\n \\n results = helper(root)\\n return max(results[0], results[1])\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n res = self.dfs(root)\\n return max(res)\\n\\n def dfs(self, root):\\n # dp[0] is the maximum value with robbing current node\\n # dp[1] is the maximum value with not robbing current node\\n if not root:\\n return [0, 0]\\n\\n dp = [0, 0]\\n left_values = self.dfs(root.left)\\n right_values = self.dfs(root.right)\\n dp[0] = root.val + left_values[1] + right_values[1]\\n dp[1] = max(left_values) + max(right_values)\\n\\n return dp\\n\\n\\n\\n \",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dfs(root):\\n if not root: return [0,0]\\n leftPair = dfs(root.left)\\n rightPair = dfs(root.right)\\n\\n withRoot = root.val+leftPair[1]+rightPair[1]\\n withoutRoot = max(leftPair)+max(rightPair)\\n\\n return [withRoot,withoutRoot]\\n return max(dfs(root))\\n \",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, x):\\n# self.val = x\\n# self.left = None\\n# self.right = None\\n\\nclass Solution:\\n \\\"\\\"\\\"\\n Input: [3,4,5,1,3,null,1]\\n input tree dp tree:\\n 3 [3+3+1,4+5]\\n / \\\\ / \\\\\\n 4 5 [4,3] [5,1]\\n / \\\\ \\\\ / \\\\ \\\\\\n 1 2 1 [1,0] [2,0] [1,0]\\n / \\\\ / \\\\ / \\\\\\n [0,0] [0,0] [0,0] [0,0] [0,0] [0,0]\\n \\n \\\"\\\"\\\"\\n def rob(self, root: TreeNode) -> int:\\n return max(self.dfs(root))\\n \\n def dfs(self, root: TreeNode):\\n if not root:\\n return (0, 0)\\n left = self.dfs(root.left)\\n right = self.dfs(root.right)\\n return (root.val + left[1] + right[1], max(left[0], left[1]) + max(right[0], right[1]))\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def dfs(node):\\n # returns (rob, not rob)\\n if not node:\\n return (0, 0)\\n if not node.left and not node.right:\\n return (node.val, 0)\\n \\n lrob, lnorob = dfs(node.left)\\n rrob, rnorob = dfs(node.right)\\n\\n print(node.val + lnorob + rnorob, lrob + rrob)\\n return (node.val + lnorob + rnorob, max(lnorob + rnorob, lnorob + rrob, lrob + rnorob, lrob + rrob))\\n return max(dfs(root))\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n res = {}\\n return self.robSub(root, res)\\n \\n \\n def robSub(self, root: Optional[TreeNode], res: dict) -> int:\\n if root == None:\\n return 0\\n if root in res:\\n return res[root]\\n\\n # if rob at the current level\\n money = root.val\\n if root.left:\\n money += self.robSub(root.left.left, res) + self.robSub(root.left.right, res)\\n \\n if root.right:\\n money += self.robSub(root.right.left, res) + self.robSub(root.right.right, res)\\n \\n # if not rob the current level, but rob the child level\\n child_money = self.robSub(root.left, res) + self.robSub(root.right, res)\\n\\n # get the maximum possible money\\n money = max(money, child_money)\\n\\n res[root] = money\\n\\n return money\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n \\n\\n\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n def dp(node, memo):\\n if node in memo:\\n return memo[node]\\n \\n if not node:\\n return 0\\n \\n skip_this_house = dp(node.left, memo) + dp(node.right, memo)\\n rob_this_house = (node.val + \\n (dp(node.left.left, memo) if node.left and node.left.left else 0) + \\n (dp(node.left.right, memo) if node.left and node.left.right else 0) + \\n (dp(node.right.left, memo) if node.right and node.right.left else 0) + \\n (dp(node.right.right, memo) if node.right and node.right.right else 0))\\n memo[node] = max(skip_this_house, rob_this_house)\\n return memo[node]\\n\\n return dp(root, {})\\n \",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"'''\\nThe thief has found himself a new place for his thievery again.\\n\\nThere is only one entrance to this area, called root.\\n- problem starts at root\\n- root is a recursive term\\n - can solve sub-problems?\\n\\nBesides the root, each house has one and only one parent house.\\n\\nAfter a tour, the smart thief realized that all houses in this place form a binary tree.\\n- binary tree problem\\n- probably use DFS or BFS\\n - repeated work though?\\n\\nIt will automatically contact the police if \\ntwo directly-linked houses were broken into on the same night.\\n- cant rob root and root.left/root.right\\n - remember to check if left and right exist before accessing\\n- picking problem:\\n - rob root\\n - dont rob root\\n\\nGiven the root of the binary tree, return \\nthe maximum amount of money the thief can rob without alerting the police.\\n- maximization problem\\n\\nThe number of nodes in the tree is in the range [1, 10^4].\\n\\n0 <= Node.val <= 10^4\\n\\nInput: root = [3,2,3,null,3,null,1]\\nOutput: 7\\n- pick 3\\n - skip its children (2, 3)\\n - problem starts over again at 2 and 3s children\\n- skip 3\\n - problem starts over again at 3s children\\n\\n\\nInput: root = root\\nOutput: res = res\\n- pick root\\n - skip left, skip right\\n - root.val + f(left.left) + f(right.right)\\n- skip root\\n - f(left) + f(right)\\n\\nmax(\\n root.val + f(left.left) f(left.right) + f(right.left) + f(right.right),\\n f(left) + f(right)\\n)\\n'''\\n\\n# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n cache = {}\\n\\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\\n if not node:\\n return 0\\n if node in cache:\\n print(\\\"cache hit!\\\")\\n return cache[node]\\n \\n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\\n\\n pick = node.val + pickLeft + pickRight\\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\\n\\n cache[node] = max(pick, skip)\\n return max(pick, skip)\\n \\n return maxProfitStartingAt(root)\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"'''\\nThe thief has found himself a new place for his thievery again.\\n\\nThere is only one entrance to this area, called root.\\n- problem starts at root\\n- root is a recursive term\\n - can solve sub-problems?\\n\\nBesides the root, each house has one and only one parent house.\\n\\nAfter a tour, the smart thief realized that all houses in this place form a binary tree.\\n- binary tree problem\\n- probably use DFS or BFS\\n - repeated work though?\\n\\nIt will automatically contact the police if \\ntwo directly-linked houses were broken into on the same night.\\n- cant rob root and root.left/root.right\\n - remember to check if left and right exist before accessing\\n- picking problem:\\n - rob root\\n - dont rob root\\n\\nGiven the root of the binary tree, return \\nthe maximum amount of money the thief can rob without alerting the police.\\n- maximization problem\\n\\nThe number of nodes in the tree is in the range [1, 10^4].\\n\\n0 <= Node.val <= 10^4\\n\\nInput: root = [3,2,3,null,3,null,1]\\nOutput: 7\\n- pick 3\\n - skip its children (2, 3)\\n - problem starts over again at 2 and 3s children\\n- skip 3\\n - problem starts over again at 3s children\\n\\n\\nInput: root = root\\nOutput: res = res\\n- pick root\\n - skip left, skip right\\n - root.val + f(left.left) + f(right.right)\\n- skip root\\n - f(left) + f(right)\\n\\nmax(\\n root.val + f(left.left) f(left.right) + f(right.left) + f(right.right),\\n f(left) + f(right)\\n)\\n'''\\n\\n# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n cache = {}\\n\\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\\n if not node:\\n return 0\\n if node in cache:\\n return cache[node]\\n \\n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\\n\\n pick = node.val + pickLeft + pickRight\\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\\n\\n cache[node] = max(pick, skip)\\n return max(pick, skip)\\n \\n return maxProfitStartingAt(root)\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n dp = {}\\n def rob(self, root: Optional[TreeNode]) -> int:\\n if root == None:\\n return 0\\n\\n if self.dp.get(root) != None:\\n return self.dp[root]\\n\\n op1 = self.rob(root.left)+self.rob(root.right)\\n\\n if root.left == None:\\n if root.right == None:\\n return root.val\\n else:\\n op2 = root.val + self.rob(root.right.left)+self.rob(root.right.right)\\n else:\\n if root.right == None:\\n op2 = root.val + self.rob(root.left.left)+self.rob(root.left.right)\\n else:\\n op2 = root.val + self.rob(root.left.left)+self.rob(root.left.right)+self.rob(root.right.left)+self.rob(root.right.right)\\n\\n self.dp[root] = max(op1,op2)\\n return self.dp[root]\\n \",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n def recur(root, name, memo):\\n if root == None:\\n return 0\\n if name in memo:\\n return memo[name]\\n left_side = recur(root.left.left, name * 4, memo) + recur(root.left.right, name * 4 + 1, memo) if root.left != None else 0\\n right_side = recur(root.right.left, name * 4 + 2, memo) + recur(root.right.right, name * 4 + 3, memo) if root.right != None else 0\\n # use_this = left_side + right_side + root.val\\n # skip_this = recur(root.left, name * 2, memo) + recur(root.right, name * 2 + 1, memo)\\n memo[name] = max(left_side + right_side + root.val, recur(root.left, name * 2, memo) + recur(root.right, name * 2 + 1, memo))\\n return memo[name]\\n return recur(root, 1, dict())\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n @cache\\n def dp(node):\\n if node == None:\\n return 0\\n\\n left_tree = node.left\\n right_tree = node.right\\n take = node.val\\n not_take = 0\\n\\n if left_tree:\\n take += dp(left_tree.left) + dp(left_tree.right)\\n if right_tree:\\n take += dp(right_tree.left) + dp(right_tree.right)\\n\\n not_take += dp(left_tree) + dp(right_tree)\\n\\n return max(take, not_take)\\n\\n return dp(root)\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"\\n\\n# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n @cache\\n def maxProfitStartingAt(node: Optional[TreeNode]) -> int:\\n if not node:\\n return 0\\n \\n pickLeft = 0 if not node.left else maxProfitStartingAt(node.left.left) + maxProfitStartingAt(node.left.right)\\n pickRight = 0 if not node.right else maxProfitStartingAt(node.right.left) + maxProfitStartingAt(node.right.right)\\n\\n pick = node.val + pickLeft + pickRight\\n skip = maxProfitStartingAt(node.left) + maxProfitStartingAt(node.right)\\n\\n return max(pick, skip)\\n \\n return maxProfitStartingAt(root)\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\n\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n # Memoization for storing the results for each node\\n memo = {}\\n \\n def dp(node):\\n if node is None:\\n return (0, 0) # (max when not robbed, max when robbed)\\n \\n if node in memo:\\n return memo[node]\\n \\n # Recur for left and right children\\n left = dp(node.left)\\n right = dp(node.right)\\n \\n # Case 1: Rob current node, then we can't rob the children\\n rob_current = node.val + left[0] + right[0]\\n \\n # Case 2: Don't rob current node, we can decide to rob or not rob the children\\n not_rob_current = max(left) + max(right)\\n \\n # Memoize the result for the current node\\n memo[node] = (not_rob_current, rob_current)\\n \\n return memo[node]\\n \\n # At root, we want the maximum of robbing or not robbing the root\\n return max(dp(root))\\n\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n # def helper(height, root, sums):\\n # if root==None: return\\n # sums[height%2]+=root.val\\n # helper(height+1, root.left, sums)\\n # helper(height+1, root.right,sums)\\n\\n # sums=[0,0]\\n # helper(0,root,sums)\\n # return max(sums)\\n\\n def helper(rt, index, dp):\\n if index in dp: return dp[index]\\n if rt==None: \\n dp[index]=0\\n return 0\\n x=y=u=v=0\\n if rt.left !=None:\\n x=helper(rt.left.left, 2*(2*index+1)+1,dp)\\n y=helper(rt.left.right, 2*(2*index+1)+2, dp)\\n if rt.right!=None:\\n u=helper(rt.right.left, 2*(2*index+2)+1, dp)\\n v=helper(rt.right.right, 2*(2*index+2)+2, dp)\\n dp[index]=max(\\n rt.val+x+y+u+v,\\n helper(rt.left, 2*index+1, dp)+helper(rt.right, 2*index+2, dp)\\n )\\n return dp[index]\\n return helper(root,0,{})\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n d = {}\\n def rob(self, root: Optional[TreeNode], d = d) -> int:\\n if root in d :\\n return d[root]\\n if root == None :\\n return 0\\n if root.left == None or root.left.left == None :\\n M1 = None\\n else : \\n M1 = root.left.left\\n \\n if root.left == None or root.left.right == None :\\n M2 = None\\n else : \\n M2 = root.left.right\\n \\n if root.right == None or root.right.left == None :\\n M3 = None\\n else : \\n M3 = root.right.left\\n\\n if root.right == None or root.right.right == None :\\n M4 = None\\n else : \\n M4 = root.right.right\\n d[root] = max(root.val + self.rob(M1,d) + self.rob(M2,d) + self.rob(M3,d)+self.rob(M4,d), self.rob(root.left,d)+self.rob(root.right,d))\\n return d[root]\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n if not root:\\n return 0\\n \\n tree = []\\n graph = {-1: []}\\n index = -1\\n q = [(root, -1)]\\n while q:\\n node, parent_index = q.pop()\\n if node:\\n index += 1\\n tree.append(node.val)\\n graph[index] = []\\n graph[parent_index].append(index)\\n q.append((node.left, index))\\n q.append((node.right, index))\\n \\n dp_rob = [0] * (index + 1)\\n dp_not_rob = [0] * (index + 1)\\n\\n for i in reversed(range(index + 1)):\\n if not graph[i]:\\n dp_rob[i] = tree[i]\\n dp_not_rob[i] = 0\\n else:\\n dp_rob[i] = tree[i] + sum(dp_not_rob[child] for child in graph[i])\\n dp_not_rob[i] = sum(max(dp_not_rob[child], dp_rob[child]) for child in graph[i])\\n\\n return max(dp_rob[0], dp_not_rob[0])\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n # @lru_cache(None)\\n # def dfs(node):\\n # if not node: return 0\\n # if not node.left and not node.right: return node.val\\n # if not node.left:\\n # return max(node.val + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right))\\n # if not node.right:\\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right), dfs(node.left))\\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right) + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right) + dfs(node.left) )\\n \\n # return dfs(root)\\n @lru_cache(None)\\n def dfs(node):\\n if not node: return (0,0)\\n\\n left = dfs(node.left)\\n right = dfs(node.right)\\n\\n return (node.val + left[1] + right[1], max(left) + max(right))\\n return max(dfs(root))\\n\\n \\n \\n\\n\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n # @lru_cache(None)\\n # def dfs(node):\\n # if not node: return 0\\n # if not node.left and not node.right: return node.val\\n # if not node.left:\\n # return max(node.val + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right))\\n # if not node.right:\\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right), dfs(node.left))\\n # return max(node.val + dfs(node.left.left)+ dfs(node.left.right) + dfs(node.right.left)+ dfs(node.right.right), dfs(node.right) + dfs(node.left) )\\n \\n # return dfs(root)\\n @lru_cache(None)\\n def dfs(node):\\n if not node: return (0,0)\\n\\n left = dfs(node.left)\\n right = dfs(node.right)\\n\\n return (node.val + left[1] + right[1], max(left) + max(right))\\n return max(dfs(root))\\n\\n \\n \\n\\n\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n tree = []\\n graph = { - 1: [] }\\n index = -1\\n q = [(root, -1)]\\n while q:\\n node, parent_index = q.pop(0)\\n if node:\\n index += 1\\n tree.append(node.val)\\n graph[index] = []\\n graph[parent_index].append(index)\\n q.append((node.left, index))\\n q.append((node.right, index))\\n \\n dp_rob = [0] * (index + 1)\\n dp_not_rob = [0] * (index + 1)\\n \\n for i in reversed(range(index + 1)):\\n if not graph[i]:\\n dp_rob[i] = tree[i]\\n dp_not_rob[i] = 0\\n else:\\n dp_rob[i] = tree[i] + sum(dp_not_rob[child] for child in graph[i])\\n dp_not_rob[i] = sum(max(dp_rob[child], dp_not_rob[child]) for child in graph[i])\\n \\n return max(dp_rob[0], dp_not_rob[0])\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n @cache\\n def helper(root, flag):\\n if root == None:\\n return 0\\n if root.left == None and root.right == None:\\n return root.val if not flag else 0\\n \\n res = -inf\\n if flag:\\n res = helper(root.left, False) + helper(root.right, False) \\n else:\\n res = max(root.val + helper(root.left, True) + helper(root.right, True),\\n helper(root.left, False)+helper(root.right, False))\\n return res\\n return helper(root, False)\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n @cache\\n def rob(self, root: Optional[TreeNode]) -> int:\\n if not root: return 0\\n a1 = root.val\\n a2 = self.rob(root.left) + self.rob(root.right)\\n if root.left:\\n a1 += self.rob(root.left.left) + self.rob(root.left.right)\\n if root.right:\\n a1 += self.rob(root.right.left) + self.rob(root.right.right)\\n return max(a1, a2)\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n @cache\\n def dp(node):\\n if not node: return [0, 0]\\n left = dp(node.left)\\n right= dp(node.right)\\n res = [\\n max(left[i] + right[j] for i in range(2) for j in range(2)),\\n node.val +left[0] + right[0]\\n ]\\n return res\\n return max(dp(root))\\n\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n #what do you want from child\\n #max value for left for right\\n #what do you want report to parent\\n #add current node or not\\n\\n @lru_cache(None)\\n def DFS(node,pre_rob):\\n if node==None:\\n return 0\\n\\n if pre_rob==False:\\n #rob\\n rob=DFS(node.left,True)+node.val+DFS(node.right,True)\\n #not rob\\n not_rob=DFS(node.left,False)+DFS(node.right,False)\\n return max(rob,not_rob)\\n else:\\n return DFS(node.left,False)+DFS(node.right,False)\\n \\n\\n pre_rob=False\\n return DFS(root,pre_rob=False)\\n\\n#time O(2*n) and space O(height)+O(2*n)\\n#rob and not rob\\n\\n\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n cache = {}\\n\\n def dfs(node, rob):\\n if node is None:\\n return 0\\n \\n if (node, False) not in cache:\\n cache[(node, False)] = dfs(node.left, True) + dfs(node.right, True)\\n if (node, True) not in cache:\\n cache[(node, True)] = node.val + dfs(node.left, False) + dfs(node.right, False)\\n noRobOption = cache[(node, False)]\\n robOption = cache[(node, True)]\\n\\n if rob:\\n return max(noRobOption, robOption)\\n else:\\n return noRobOption\\n \\n return dfs(root, True)\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n memo = {}\\n def dfs(node, canRob):\\n if not node: return 0\\n if (node, canRob) in memo: return memo[(node, canRob)]\\n res = 0\\n if not canRob: \\n res = dfs(node.left, True) + dfs(node.right, True)\\n else:\\n res = max(dfs(node.left, True) + dfs(node.right, True), \\n dfs(node.left, False) + node.val + dfs(node.right, False))\\n memo[(node, canRob)] = res\\n return res\\n return dfs(root, True)\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def __init__(self):\\n self.memo = {}\\n def rob(self, root: Optional[TreeNode],canrob=True) -> int:\\n if not root: return 0 \\n if (root,canrob) in self.memo : return self.memo[(root,canrob)]\\n if canrob: \\n rob = root.val + self.rob(root.left,False) +self.rob(root.right,False)\\n else:\\n rob=0\\n norob= self.rob(root.left,True) +self.rob(root.right,True)\\n ans = max(rob,norob)\\n self.memo[(root,canrob)] = ans\\n return ans\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"# Definition for a binary tree node.\\n# class TreeNode:\\n# def __init__(self, val=0, left=None, right=None):\\n# self.val = val\\n# self.left = left\\n# self.right = right\\nclass Solution:\\n def rob(self, root: Optional[TreeNode]) -> int:\\n \\n cache = {}\\n\\n def dfs(node, yes):\\n if not node: return 0\\n \\n count = 0\\n if yes:\\n count += node.val\\n if (node.left, not yes) not in cache:\\n cache[(node.left, not yes)] = dfs(node.left, not yes)\\n if (node.right, not yes) not in cache:\\n cache[(node.right, not yes)] = dfs(node.right, not yes)\\n count += cache[(node.left, not yes)] + cache[(node.right, not yes)]\\n \\n else:\\n if (node.left, not yes) not in cache:\\n cache[(node.left, not yes)] = dfs(node.left, not yes)\\n if (node.left, yes) not in cache:\\n cache[(node.left, yes)] = dfs(node.left, yes)\\n if (node.right, not yes) not in cache:\\n cache[(node.right, not yes)] = dfs(node.right, not yes)\\n if (node.right, yes) not in cache:\\n cache[(node.right, yes)] = dfs(node.right, yes)\\n\\n count += max(cache[(node.left, not yes)], cache[(node.left, yes)])\\n count += max(cache[(node.right, not yes)], cache[(node.right, yes)])\\n\\n return count\\n\\n return max(dfs(root, False), dfs(root, True))\\n\",\n \"memory\": \"20500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":38,"string":"38"}}},{"rowIdx":266,"cells":{"question_id":{"kind":"number","value":338,"string":"338"},"name":{"kind":"string","value":"counting-bits"},"content":{"kind":"string","value":"<p>Given an integer <code>n</code>, return <em>an array </em><code>ans</code><em> of length </em><code>n + 1</code><em> such that for each </em><code>i</code><em> </em>(<code>0 <= i <= n</code>)<em>, </em><code>ans[i]</code><em> is the <strong>number of </strong></em><code>1</code><em><strong>'s</strong> in the binary representation of </em><code>i</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 2\n<strong>Output:</strong> [0,1,1]\n<strong>Explanation:</strong>\n0 --> 0\n1 --> 1\n2 --> 10\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 5\n<strong>Output:</strong> [0,1,1,2,1,2]\n<strong>Explanation:</strong>\n0 --> 0\n1 --> 1\n2 --> 10\n3 --> 11\n4 --> 100\n5 --> 101\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>0 <= n <= 10<sup>5</sup></code></li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong></p>\n\n<ul>\n\t<li>It is very easy to come up with a solution with a runtime of <code>O(n log n)</code>. Can you do it in linear time <code>O(n)</code> and possibly in a single pass?</li>\n\t<li>Can you do it without using any built-in function (i.e., like <code>__builtin_popcount</code> in C++)?</li>\n</ul>\n"},"acRate":{"kind":"number","value":78.84997579139096,"string":"78.849976"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["dynamic-programming","bit-manipulation"],"string":"[\n \"dynamic-programming\",\n \"bit-manipulation\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"31\", 0.0138], [\"33\", 0.0274], [\"34\", 0.0137], [\"36\", 0.0275], [\"38\", 0.0617], [\"39\", 0.1441], [\"41\", 0.1235], [\"42\", 0.3018], [\"44\", 0.7272], [\"45\", 0.6037], [\"47\", 1.2555], [\"48\", 1.2418], [\"50\", 3.197], [\"52\", 1.8386], [\"53\", 5.7629], [\"55\", 3.1559], [\"56\", 7.2173], [\"58\", 7.43], [\"59\", 3.6773], [\"61\", 8.0475], [\"63\", 3.3617], [\"64\", 6.0922], [\"66\", 2.4767], [\"67\", 4.109500000000001], [\"69\", 2.9501], [\"70\", 1.2349], [\"72\", 2.0033], [\"73\", 0.8233], [\"75\", 1.3104], [\"77\", 0.6175], [\"78\", 0.9742], [\"80\", 0.638], [\"81\", 0.8918], [\"83\", 0.9879], [\"84\", 0.4528], [\"86\", 0.7615], [\"88\", 0.3979], [\"89\", 0.8781000000000001], [\"91\", 0.3705], [\"92\", 0.6243000000000001], [\"94\", 0.5146], [\"95\", 0.3224], [\"97\", 0.6586000000000001], [\"98\", 0.3087], [\"100\", 0.7409], [\"102\", 0.4185], [\"103\", 0.8027], [\"105\", 0.5351], [\"106\", 1.1389], [\"108\", 1.3035], [\"109\", 0.6037], [\"111\", 1.2075], [\"113\", 0.8027], [\"114\", 1.3858000000000001], [\"116\", 0.5214], [\"117\", 1.1115], [\"119\", 0.9056], [\"120\", 0.4254], [\"122\", 0.6517999999999999], [\"123\", 0.2881], [\"125\", 0.5076], [\"127\", 0.1647], [\"128\", 0.4185], [\"130\", 0.1852], [\"131\", 0.247], [\"133\", 0.1578], [\"134\", 0.1029], [\"136\", 0.1921], [\"138\", 0.0823], [\"139\", 0.1372], [\"141\", 0.0755], [\"142\", 0.1852], [\"144\", 0.0823], [\"145\", 0.1029], [\"147\", 0.1647], [\"148\", 0.0686], [\"150\", 0.24019999999999997], [\"152\", 0.1098], [\"153\", 0.1921], [\"155\", 0.1029]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"21800\", 0.0069], [\"22300\", 0.0137], [\"22400\", 0.0137], [\"22500\", 0.0755], [\"22600\", 0.1098], [\"22700\", 0.048], [\"22800\", 0.096], [\"22900\", 0.2813], [\"23000\", 1.6397], [\"23100\", 10.1125], [\"23200\", 44.292], [\"23300\", 37.9391]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n if n == 0:\n return [0]\n if n == 1:\n return [0, 1]\n ans = [0, 1]\n for i in range(2, n + 1):\n if i % 2 == 0:\n ans.append(ans[i // 2])\n else:\n ans.append(ans[i // 2] + 1)\n return ans","runtime":"31"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0] * (n+1)\n for i in range(1, n+1):\n ans[i] = ans[i >> 1] + (i % 2)\n return ans","runtime":"31"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0] * (n+1)\n for i in range(1, n+1):\n ans[i] = ans[i & (i-1)] +1\n return ans","runtime":"33"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0 for _ in range(n+1)]\n for i in range(1, n+1):\n # Binary representation of a number depends on the binary representation on its half and its remainder when devided by 2\n ans[i] = ans[i//2] + i%2\n return ans","runtime":"34"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n # Create a list of size n + 1 with all elements initialized to 0\n r = [0] * (n + 1)\n for i in range(1, n + 1):\n r[i] = r[i//2] + i%2\n return r","runtime":"36"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n if n == 0:\n return [0]\n \n l = -1\n t = n\n while t > 0:\n t = t >> 1\n l += 1\n\n ret = [0] * (n+1)\n m = 1\n\n while l > 0:\n ret[m: 2*m] = (x+1 for x in ret[:m])\n m *= 2\n l -= 1\n\n ret[m: n+1] = (x+1 for x in ret[:n+1-m])\n \n return ret","runtime":"36"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans=[0]*(n+1)\n for i in range(1,n+1):\n if i%2:\n ans[i]=ans[i//2]+1\n else:\n ans[i]=ans[i//2]\n return ans\n\n ","runtime":"38"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n dp = [0] * (n+1)\n offset = 1\n for i in range(1, n+1):\n if offset * 2 == i:\n offset = i\n dp[i] = 1 + dp[i-offset]\n return dp","runtime":"39"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n d = 1\n arr = [0]\n if n > 0:\n arr.append(1)\n l = 2\n while len(arr) != n + 1:\n for i in range(0,min(n + 1 - l,l)):\n arr.append(1 + arr[i])\n l *= 2\n return arr","runtime":"39"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]\n m = 1\n while 2*m-1 < n:\n ans.extend([num+1 for num in ans])\n m *= 2\n ans.extend([num+1 for num in ans[:n-m+1]])\n return ans\n","runtime":"41"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ret = [0] * (n+1)\n offset = 1\n for i in range(1, n+1):\n if offset * 2 == i:\n offset = i\n ret[i] = 1 + ret[i-offset]\n return ret","runtime":"42"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0] * (n+1)\n offset = 1\n for i in range(1, n+1):\n if offset * 2 == i:\n offset *= 2\n res[i] = 1 + res[i - offset]\n return res\n\n '''\n 0 000 0\n 1 001 1\n 2 010 1\n 3 011 2\n # 4 100 1 + (res[curr - offset]) // offset = the last power of 2 till this point\n 4 100 1 + 0 = 1 // offset = 4\n 5 101 1 + 1 = 2\n 6 110 1 + 1 = 2\n 7 111 1 + 2 = 3\n 8 1000 1 + 0 = 1 // offset = 8\n '''","runtime":"42"},{"code":"class Solution:\n def countBits(self, num: int) -> List[int]:\n counter = [0]\n for i in range(1, num+1):\n counter.append(counter[i >> 1] + i % 2)\n return counter","runtime":"44"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n dp = [0] * (n+1)\n offset = 1\n for i in range(1,n+1):\n if (i == offset * 2):\n offset *= 2\n dp[i] = 1 + dp[i-offset]\n return dp","runtime":"44"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \"\"\"\n n\n ans = len(n+1)\n st 0<=i<=n\n ans[i] binary\n 10 to 2\n move bit?\n \"\"\"\n ans = [0]*(n+1)\n nextOrder = 2\n tracker = 0\n for i in range(1,n+1):\n if i == nextOrder:\n nextOrder *= 2\n tracker = 0\n ans[i] = ans[tracker] + 1\n tracker += 1\n\n return ans\n ","runtime":"45"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ret = [0]\n copyend = 0\n copy = 0\n for i in range(1, n+1):\n copy += 1\n if copy > copyend:\n copy = 0\n copyend = i-1\n ret.append(ret[copy] + 1)\n return ret\n ","runtime":"45"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n # ans = [0]\n # for num in range(1,n+1):\n # count = 0\n # while num != 0:\n # num = num & (num-1)\n # count += 1\n\n # ans.append(count)\n \n # return ans\n\n ans = [0] * (n+1)\n for i in range(1, n+1):\n ans[i] = ans[i >> 1] + (i & 1)\n return ans","runtime":"47"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \"\"\"\n n\n ans = len(n+1)\n st 0<=i<=n\n ans[i] binary\n 10 to 2\n move bit?\n \"\"\"\n ans = [0]\n for i in range(1,n+1):\n ans.append(ans[i >> 1] + i % 2)\n\n return ans\n ","runtime":"47"},{"code":"# class Solution:\n# def countBits(self, n: int) -> List[int]:\n# out = []\n# for i in range(0,n+1,1):\n# k = bin(i)[2:]\n\n# out.append(k.count('1'))\n# return out\n\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n # Create a list of size n + 1 with all elements initialized to 0\n result = [0] * (n + 1)\n\n # If n is 0, return the list\n if n == 0:\n return result\n\n # Base cases:\n # Set the first two elements of the list\n result[0] = 0\n if n >= 1:\n result[1] = 1\n\n # Iterate from 2 to n\n for x in range(2, n + 1):\n # If 'x' is even, set the x-th element of the list to \n # the (x // 2)-th element\n if x % 2 == 0:\n result[x] = result[x // 2]\n # If x is odd, set the x-th element of the list to \n # the (x // 2)-th element + 1\n else:\n result[x] = result[x // 2] + 1\n\n # Return the final list\n return result\n\n \n ","runtime":"48"},{"code":"class Solution:\n def countBits(self, n):\n ans = [0] * (n + 1)\n for i in range(1, n + 1):\n ans[i] = ans[i >> 1] + (i & 1)\n return ans\n","runtime":"48"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n if n == 0:\n return [0]\n \n res = [0] * (n + 1)\n res[1] = 1\n\n for i in range(2, n+1):\n res[i] = res[i // 2] + (i & 0b1)\n \n return res\n\n\n# 0 --> 0b0000 --> 0 = 0 (base case)\n# 1 --> 0b0001 --> 1 = 1 (power of 2)\n# 2 --> 0b0010 --> 1 \n# 3 --> 0b0011 --> 2\n# 4 --> 0b0100 --> 1\n# 5 --> 0b0101 --> 2\n# 6 --> 0b0110 --> 2 \n# 7 --> 0b0111 --> 3\n# 8 --> 0b1000 --> 1\n# 9 --> 0b1001 --> 2\n# 10 --> 0b1010 --> 2\n# 11 --> 0b1011 --> 3\n# 12 --> 0b1100 --> 2\n# 13 --> 0b1101 --> 3\n# 14 --> 0b1110 --> 3\n# 15 --> 0b1111 --> 4\n","runtime":"50"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans=[0]*(n+1)\n for i in range(1,n+1):\n ans[i]=ans[i & (i-1)] + 1 \n return ans","runtime":"50"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0]*(n+1) #if *n --> list assignment out of range!\n # res[0] = 0\n for i in range(1, n+1):\n res[i] = res[i//2] + (i%2)\n return res\n ","runtime":"52"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n soln = [0, 1]\n\n for i in range(2, n + 1):\n soln.append(i % 2 + soln[i // 2])\n\n return soln[:n + 1]","runtime":"52"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return [i.bit_count() for i in range(n+1)]","runtime":"53"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n dp = [0] * (n + 1)\n\n for i in range(1, n + 1):\n dp[i] = dp[i >> 1] + (i & 1)\n \n return dp\n\n ","runtime":"53"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n dp = [0] * (n + 1)\n\n for i in range(1, n + 1):\n dp[i] = dp[i >> 1] + (i & 1)\n return dp","runtime":"55"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n dp = [0] * (n + 1)\n\n for i in range(1, n + 1):\n dp[i] = dp[i >> 1] + (i & 1)\n return dp\n ","runtime":"55"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n if n == 0: return [0]\n if n == 1: return [0, 1]\n curr = 1\n dp = [0 for i in range(n+1)]\n dp[1] = 1\n \n for i in range(2, n+1):\n if i == curr*2:\n curr *= 2\n dp[i] = 1\n else:\n dp[i] = 1 + dp[i-curr]\n\n return dp\n\n ","runtime":"56"},{"code":"from typing import List\n\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n # Initialize the DP array with zeros\n dp = [0] * (n + 1)\n \n # Populate the DP array\n for i in range(1, n + 1):\n # If i is odd, use the formula: dp[i] = dp[i // 2] + 1\n # If i is even, use the formula: dp[i] = dp[i // 2]\n dp[i] = dp[i >> 1] + (i & 1)\n \n return dp\n\n ","runtime":"56"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n dp = [0] * (n + 1)\n\n for i in range(1, n + 1):\n dp[i] = dp[i >> 1] + (i & 1)\n return dp","runtime":"58"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n dp = [0] * (n + 1)\n\n for i in range(1, n + 1):\n dp[i] = dp[i >> 1] + (i & 1)\n return dp\n ","runtime":"58"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n if n == 0:\n return [0]\n if n == 1:\n return [0, 1]\n retval = [0, 1]\n count = 2\n from_index = 2\n to_index = pow(2, count)\n if to_index > n:\n to_index = n+1\n while len(retval)<=n:\n j = 0\n while from_index < to_index:\n retval.append(retval[j]+1)\n j+=1\n from_index+=1\n count+=1\n to_index = pow(2, count)\n if to_index > n:\n to_index = n+1\n return retval","runtime":"59"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0] * (n + 1)\n if n == 0:\n return res\n res[1] = 1\n for i in range(1, len(res)):\n if i % 2 == 0:\n res[i] = res[i // 2]\n else:\n res[i] = res[i // 2] + 1\n return res\n","runtime":"59"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n dp = [0] * (n + 1)\n\n for i in range(1, n + 1):\n dp[i] = dp[i >> 1] + (i & 1)\n return dp\n ","runtime":"61"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0] * (n + 1)\n for i in range(1, n + 1):\n ans[i] = ans[i >> 1] + (i & 1)\n return ans","runtime":"61"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return [bin(i).count('1') for i in range(n+1)]\n ","runtime":"63"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n dp=[0]\n\n for i in range(1, n+1):\n dp.append(dp[i//2]+i%2)\n return dp\n\n# 0 1 \n# ","runtime":"63"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0] * (n + 1)\n for i in range(1, n + 1):\n ans[i] = ans[i >> 1] + (i & 1)\n return ans\n ","runtime":"64"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n result = [0]\n while len(result) < n + 1:\n end = len(result) \n for i in range(end):\n result += [result[i] + 1]\n if len(result) >= n + 1:\n break\n return result","runtime":"64"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n l = [0] * (n + 1)\n for i in range(1, n + 1):\n l[i] = l[i >> 1] + (i & 1)\n return l\n","runtime":"66"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return [bin(i).count('1') for i in range(n+1)]","runtime":"66"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return [bin(i).count('1') for i in range(n+1)]","runtime":"67"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n out = []\n for i in range(0,n+1,1):\n k = bin(i)[2:]\n\n out.append(k.count('1'))\n return out\n ","runtime":"67"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n count=[]\n for i in range(n+1):\n x=bin(i).replace(\"0b\",\"\")\n cout=x.count(\"1\")\n count.append(cout)\n return count ","runtime":"69"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]*(n+1)\n offset = 1\n for i in range(1,n+1):\n if i == offset * 2:\n offset = offset * 2\n ans[i] = 1 + ans[i-offset]\n return ans\n\n ","runtime":"69"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]*(n+1)\n for x in range(1, n+1):\n ans[x] = ans[(x&(x-1))] + 1\n return ans","runtime":"70"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n dp = [0]*(n+1)\n\n \"\"\"\n 0->0\n 1->1\n 2->1\n 3->2\n 4->1\n 5->2\n 6->2\n 7->3\n 8->1\n \"\"\"\n twoPower = 0\n for i in range(1, n+1):\n if i>1 and i==2*(2**twoPower):\n twoPower +=1\n dp[i] = dp[i-2**twoPower]+1\n\n return dp\n \n\n","runtime":"70"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n arr=[]\n for i in range(n+1):\n arr.append(bin(i).count(\"1\"))\n return arr\n","runtime":"72"},{"code":"import math\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n liste=[0]*(n+1)\n if n==0:\n return [0]\n liste[1]=1\n z=2\n for i in range(2,n+1):\n if i/z==2:\n z=i\n liste[i]=1+liste[i-z]\n print(liste[i])\n return liste\n\n","runtime":"72"},{"code":"class Solution:\n def countbit(self, num):\n return bin(num).count('1')\n\n def countBits(self, n: int) -> List[int]:\n \n result = [self.countbit(i) for i in range(n+1)]\n \n return result\n ","runtime":"73"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res=[0]*(n+1)\n for i in range((n+1)):\n res[i]=str(\"{0:b}\".format(i)).count('1')\n return res\n ","runtime":"73"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n l=[]\n for i in range(0,n+1):\n l.append(bin(i)[2:].count('1'))\n return l\n\n","runtime":"75"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n x=[]\n for i in range(n+1):\n a=bin(i).replace(\"0b\",\"\")\n b=a.count(\"1\")\n x.append(b)\n return x","runtime":"75"},{"code":"import math\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n dict1 = {0:0}\n def get_sum_bits(num, count):\n # if num == 0:\n # return count\n if num in dict1:\n return count + dict1[num]\n res = floor(math.log2(num))\n res2 = math.pow(2, res)\n num = num - res2\n count += 1\n return get_sum_bits(num, count)\n \n for i in range(n+1):\n count = get_sum_bits(i, 0)\n dict1[i] = count\n\n return dict1.values()\n\n \n \n ","runtime":"77"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res=[0]*(n+1)\n for i in range((n+1)):\n b = \"{0:b}\".format(i)\n res[i]=str(b).count('1')\n return res\n ","runtime":"77"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n\n for i in range(n+1):\n num = i\n count = 0\n while num > 0:\n num = num & (num - 1)\n count += 1\n res.append(count)\n \n return res","runtime":"78"},{"code":"class Solution:\n def countBitsInNumber(self, n, memo = {0:0, 1:1}):\n if n in memo:\n return memo[n]\n if n % 2 == 0:\n result = self.countBitsInNumber(n//2, memo)\n memo[n] = result\n return result\n else:\n result = self.countBitsInNumber(n//2, memo) + 1\n memo[n] = result\n return result\n def countBits(self, n: int) -> List[int]:\n return [self.countBitsInNumber(i) for i in range(n+1)]","runtime":"78"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n out = []\n for i in range(0,n+1,1):\n k = bin(i)[2:]\n out.append(k.count('1'))\n\n #return out\n return [bin(i)[2:].count('1') for i in range(0,n+1)]","runtime":"80"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n def _countBit(num):\n count = 0 \n while num:\n count += 1\n num = num & (num - 1)\n return count \n \n res = []\n for num in range(n + 1):\n res.append(_countBit(num))\n return res \n\n\n\n ","runtime":"80"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n\n bitCount = [0]*(n+1)\n def countBitsInt(num):\n bitCountNum = 0\n while num:\n num = num & num-1\n bitCountNum +=1\n return bitCountNum\n\n for i in range(0, n+1):\n \n bitCount[i] = countBitsInt(i)\n return bitCount\n ","runtime":"81"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n a=[]\n i=0\n while i<=n:\n d=list(bin(i))\n a.append(d.count('1'))\n i+=1\n return a\n\n ","runtime":"81"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n res = []\n dct = {}\n\n for num in range(n + 1):\n \n count = 0\n while num != 0:\n # if num in dct:\n # count += dct[num]\n # break\n num = num & (num-1)\n count += 1\n \n res.append(count)\n \n return res","runtime":"83"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n # res = []\n # for i in range(n+1):\n # res.append(bin(i).count('1'))\n # return res\n #Time:O(nlogn) Space:O(n)\n\n\n # DP + Most Significant Bit\n # res = [0]*(n+1)\n # x = 0\n # b = 1\n # while b<= n:\n # while x < b and x+b<=n:\n # res[x+b] = res[x]+1\n # x += 1\n # x = 0\n # b <<= 1\n # return res\n #Time:O(n) Space:O(n)\n\n\n # DP + Least Significant Bit\n # ans = [0] * (n + 1)\n # for x in range(1, n + 1):\n # ans[x] = ans[x >> 1] + (x & 1) \n # return ans \n #Time:O(n) Space:O(n)\n\n\n # DP + Last Set Bit\n # ans = [0] * (n + 1)\n # for x in range(1, n + 1):\n # ans[x] = ans[x & (x - 1)] + 1\n # return ans \n #Time:O(n) Space:O(n)\n\n\n\n res = []\n for i in range(n+1):\n count = 0\n while i:\n i &= (i-1)\n count += 1\n res.append(count)\n return res\n\n\n","runtime":"83"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]\n for num in range(1,n+1):\n count = 0\n while num != 0:\n num = num & (num-1)\n count += 1\n\n ans.append(count)\n \n return ans","runtime":"84"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n res = []\n dct = {}\n\n for num in range(n + 1):\n \n count = 0\n while num != 0:\n if num in dct:\n count += dct[num]\n break\n num = num & (num-1)\n count += 1\n \n res.append(count)\n \n return res","runtime":"84"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \"\"\"\n n\n ans = len(n+1)\n st 0<=i<=n\n ans[i] binary\n 10 to 2\n move bit?\n \"\"\"\n # ans = [0] * (n+1)\n ans = []\n for i in range(n+1):\n # ans.append(int(bin(i)))\n # print(bin(i)[2:])\n count = 0\n for j in bin(i)[2:]:\n # print('j = ',j)\n if j == '1':\n count += 1\n\n ans.append(count)\n\n return ans\n ","runtime":"86"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n result = [0]\n\n for i in range(1, n+1):\n count = 0\n while i:\n i = (i & (i-1))\n count += 1\n result.append(count)\n \n return result","runtime":"86"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def count(num):\n count = 0\n while num!=0:\n num = num&(num-1)\n count += 1\n return count\n ans = []\n for i in range(n+1):\n ans.append(count(i))\n return ans","runtime":"88"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n \n def counter(num):\n count = 0\n while num:\n num = num & (num - 1)\n count += 1\n \n return count\n \n for i in range(n + 1):\n ans.append(counter(i))\n \n return ans","runtime":"89"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n l = []\n for i in range(0, n + 1):\n cnt = 0\n for item in bin(i).lstrip('0b'):\n if item == '1':\n cnt += 1\n l.append(cnt)\n return l\n ","runtime":"89"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n out = []\n\n for i in range(0, n+1):\n out.append(self.countSetBits(i))\n return out\n\n def countSetBits(self, n: int) -> int:\n cnt = 0\n while n > 0:\n n &= n-1\n cnt += 1\n return cnt","runtime":"91"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n + 1):\n count = 0\n for c in str(bin(i)):\n if c == '1':\n count += 1\n ans.append(count)\n \n return ans","runtime":"92"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n res = []\n dct = {}\n\n for num in range(n + 1):\n \n count = 0\n while num != 0:\n if num in dct:\n count += dct[num]\n print(\"yoyoma\")\n break\n num = num & (num-1)\n count += 1\n \n dct[num] = count\n res.append(count)\n \n return res","runtime":"92"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n #iterate 0~n\n #change to binary\n #count how many \"1\" in it\n \n # Time : O(n*m)\n # Space : O(n)\n\n # 0,1\n # n=2 [0,1,1]\n \n\n result = []\n\n for num in range(n+1):\n num_bin = format(num,\"b\")\n\n count = 0\n for item in num_bin:\n if item=='1':\n count+=1\n \n result.append(count)\n \n return result\n\n","runtime":"94"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res: list[int] = [0 for _ in range(n + 1)]\n for i in range(1, n + 1):\n res[i] = 1 + res[i - self.get2Pow(i)]\n\n return res\n\n \n def get2Pow(self, n: int) -> int:\n \"\"\"\n Get the biggest Pow(2) less than n\n \"\"\"\n res: int = 0\n while n != 0:\n res = n\n n = n & (n-1)\n\n return res","runtime":"94"},{"code":"def setBitCount(num):\n counter = 0\n for char in bin(num)[2:]:\n if char == \"1\":\n counter += 1\n return counter\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n result = []\n for num in range(n+1):\n result.append(setBitCount(num))\n return result\n\n\n ","runtime":"95"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans=[]\n for i in range(n+1):\n res=0\n while i>0:\n i&=(i-1)\n res+=1\n ans.append(res)\n return ans\n \n\n ","runtime":"95"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def count_bits(num):\n counter = 0\n while num != 0:\n counter += 1\n num &= num - 1\n return counter\n \n res = []\n for x in range(0, n + 1):\n res.append(count_bits(x))\n return res","runtime":"97"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def calc1(s):\n count = 0\n for i in s :\n if i == '1':\n count += 1\n return count\n arr = []\n for i in range(n+1):\n s = bin(i)[2:]\n arr.append(calc1(s))\n return arr\n\n","runtime":"97"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n ans = []\n for i in range(n + 1):\n count = 0\n num = i\n while num > 0:\n # Check if the least significant bit is 1\n count += num & 1\n # Right shift to check the next bit\n num >>= 1\n ans.append(count)\n return ans","runtime":"98"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n for i in range(n + 1):\n binary = bin(i)\n cnt = 0\n for j in range(2, len(binary)):\n if binary[j] == '1':\n cnt += 1\n res.append(cnt)\n return res\n\n ","runtime":"98"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res=[]\n for index in range(n+1):\n num=index\n cnt=0\n while num>0:\n cnt+=(num&1)\n num>>=1\n res.append(cnt)\n return res","runtime":"100"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n def _countBit(num):\n count = 0 \n while num:\n count += (num & 1)\n num >>= 1\n return count \n \n res = []\n for num in range(n + 1):\n res.append(_countBit(num))\n return res \n\n\n\n ","runtime":"100"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def countSetBits(n):\n count = 0\n while (n):\n count += n & 1\n n >>= 1\n return count\n res = list()\n for x in range(n+1):\n res.append(countSetBits(x))\n return res\n\n ","runtime":"102"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n # most basic solutions\n vals = [i for i in range(n+1)]\n\n for i, val in enumerate(vals):\n res = 0\n while val > 0:\n res += (val & 1)\n val = val >> 1\n vals[i] = res\n return vals","runtime":"103"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n\n for i in range(n + 1):\n cur = 0\n while i:\n cur += i % 2\n i = i // 2\n res.append(cur)\n return res","runtime":"103"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n cur=0\n while i:\n cur += i & 1\n i>>=1\n ans.append(cur)\n return ans\n\n\n ","runtime":"105"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def num_1s(num):\n ones = 0\n while num:\n ones += num % 2\n num = num // 2\n return ones\n\n result = []\n\n for i in range(n+1):\n result.append( num_1s(i) )\n \n return result\n ","runtime":"105"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n for i in range(n+1):\n count = 0\n while i > 0:\n count += i & 1\n i = i >> 1\n res.append(count)\n return res\n\n\n ","runtime":"106"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]: \n ans=[]\n for i in range(n+1):\n count=0\n while i>0:\n if(i%2==1):\n count+=1\n i//=2\n ans.append(count)\n return ans\n","runtime":"106"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n counts = []\n for i in range(0, n+1):\n count = 0\n while i > 0:\n if i & 1 == 1:\n count += 1\n i >>= 1\n counts.append(count)\n return counts","runtime":"108"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n l=[]\n \n for i in range(n+1):\n c=0\n while i:\n c+=i&1\n i>>=1\n l.append(c)\n return l\n\n ","runtime":"108"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n # O(n log n) solution\n output = []\n\n for i in range(n + 1):\n count = 0\n while i != 0:\n count += i % 2\n i //= 2\n output.append(count)\n\n return output","runtime":"109"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans=[0] * (n+1)\n for i in range(n+1):\n count=0\n index=i\n while i!=0:\n if (i&1==1):\n count+=1\n i=i>>1\n ans[index]=count\n return ans\n\n","runtime":"109"},{"code":"class Solution:\n def countOnes(self, num):\n out = 0\n while num!=0:\n out += num & 1\n num = num >> 1\n \n return out\n\n def countBits(self, n: int) -> List[int]:\n ret = []\n for i in range(n+1):\n ret.append(self.countOnes(i))\n\n return ret ","runtime":"111"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n ct = 0\n while i > 0:\n ct += i & 1\n i >>= 1\n ans.append(ct)\n return ans","runtime":"111"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n output = []\n\n def count_ones(num):\n res = 0\n while num > 0:\n if num % 2 == 1:\n res += 1\n num = num >> 1\n return res\n\n for i in range(n + 1):\n output.append(count_ones(i))\n return output\n\n\n \n ","runtime":"113"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n res = []\n for i in range(n + 1):\n cnt = 0\n\n while i:\n if i % 2 == 1:\n cnt += 1\n i = i >> 1\n \n res.append(cnt)\n \n return res\n\n ","runtime":"113"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0] * (n + 1)\n for i in range(n + 1):\n item = i\n temp = 0\n while item >= 2:\n if item % 2 == 1:\n temp += 1\n item = item // 2\n temp += item // 2 + item % 2\n res[i] = temp\n return res\n","runtime":"114"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def get_weight(n):\n weight = 0\n while n != 0:\n weight += n % 2\n n = n >> 1\n return weight\n \n res = [0] * (n + 1)\n for i in range(n + 1):\n res[i] = get_weight(i)\n return res","runtime":"114"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n d=[2**i for i in range(19)]\n\n ans=[]\n for i in range(n+1):\n x=0\n for _d in d:\n x+=(_d&i)>0\n ans.append(x)\n return ans","runtime":"116"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0] * (n + 1)\n for i in range(n + 1):\n tmp = i\n while tmp:\n res[i] += tmp % 2\n tmp >>= 1\n return res","runtime":"116"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n result = []\n for i in range(n + 1):\n counter = 0\n while i:\n counter += (i & 1)\n i >>= 1\n result.append(counter)\n\n return result\n ","runtime":"117"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n i = 0\n res = []\n\n while i <= n:\n number = i\n resultDigit = 0\n while number > 0:\n if number % 2 == 1:\n resultDigit +=1\n number >>= 1\n res.append(resultDigit)\n i += 1\n\n\n return res\n\n\n ","runtime":"117"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n answ = []\n for j in range(n+1):\n i = j\n count = 0\n while i >= 1:\n if i%2 == 1:\n count += 1\n i = (i-1)//2\n else:\n i = i // 2\n answ.append(count)\n return answ","runtime":"125"},{"code":"# class Solution:\n# def countBits(self, n: int) -> List[int]:\n# dp = [0] * (n+1)\n# offset = 1\n\n# for i in range(1,n+1):\n# if offset * 2 == i:\n# offset = i\n# dp[i] = 1 + dp[i-offset]\n# return dp\n \n\n\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]*(n+1)\n logn = 0\n nCopy = n\n while nCopy > 0:\n nCopy = nCopy >> 1\n logn += 1\n \n for pw in range(logn):\n for i in range(1, n+1):\n curNum = i\n if ((curNum >> pw) & 1):\n ans[i] += 1\n return ans\n ","runtime":"125"},{"code":"class Solution:\n def bits(self,n:int):\n cnt = 0\n while(n>0):\n if(n%2==1):\n cnt+=1\n n = n//2\n return cnt\n def countBits(self, n: int) -> List[int]:\n l = []\n for i in range(1+n):\n l.append(self.bits(i))\n return l","runtime":"127"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def count1Bits(n):\n count = 0\n\n while n != 0:\n if n & 1 == 1:\n count += 1\n n = n >> 1\n return count\n\n\n counts = [0] * (n + 1)\n for i in range(n + 1):\n counts[i] = count1Bits(i)\n return counts","runtime":"127"},{"code":"class Solution:\n # 3\n # 11\n #\n def countBits(self, n: int) -> List[int]:\n ans = [0] * (n+1)\n for i in range(n+1):\n x = i\n while x!= 0:\n ans[i] += x%2\n x //=2\n return ans","runtime":"128"},{"code":"# class Solution:\n# def countBits(self, n: int) -> List[int]:\n# dp = [0] * (n+1)\n# offset = 1\n\n# for i in range(1,n+1):\n# if offset * 2 == i:\n# offset = i\n# dp[i] = 1 + dp[i-offset]\n# return dp\n \n\n\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]*(n+1)\n logn = 0\n nCopy = n\n while nCopy > 0:\n nCopy = nCopy >> 1\n logn += 1\n \n for pw in range(logn):\n for i in range(1, n+1):\n curNum = i\n if ((curNum >> pw) & 1):\n ans[i] += 1\n return ans\n ","runtime":"128"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n for i in range(n + 1):\n count = 0\n while i > 0:\n if i & 1 == 1:\n count += 1\n i = i >> 1\n res.append(count)\n return res","runtime":"130"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0] * (n + 1)\n for i in range(n,-1,-1):\n num = i \n count = 0\n while num:\n ld = num % 2\n count += 1 if ld == 1 else 0\n num = num // 2\n ans[i] = count\n return ans\n","runtime":"131"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n memo = [0] * (n+1)\n def getBits(num):\n cnt = 0\n while num > 0:\n if memo[num] != 0:\n cnt += memo[num]\n break\n bit = num & 1\n if bit == 1:\n cnt += 1\n num >>= 1\n if memo[num] == 0:\n memo[num] = cnt\n return cnt\n\n ans = []\n for num in range(n+1):\n ans.append(getBits(num))\n \n return ans\n\n \n\n ","runtime":"131"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n count = 0\n while i > 0:\n if i & 1 == 1:\n count += 1\n i >>= 1\n ans.append(count)\n return ans","runtime":"133"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = [0]*(n+1)\n for i in range(0, n+1):\n temp = self.func(i)\n ans[i]=temp\n return ans\n\n def func(self, num):\n count=0\n while num>0:\n if num%2==1:\n count+=1\n num=num>>1\n return count\n ","runtime":"133"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n\n for i in range(n+1):\n res.append( sum(map(int, bin(i)[2:])))\n\n return res ","runtime":"134"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0] * (n + 1)\n for i in range(n+1):\n j = i\n while j:\n res[i] += j & 1\n j >>= 1\n return res\n","runtime":"136"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n ans = [0] * (n+1)\n\n for i in range(1, n+1):\n ans[i] = sum(map(lambda x: x == '1', bin(i)[2:]))\n \n return ans\n","runtime":"136"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n out = []\n count = 0\n l = [2**i for i in range(16, 0, -1)]\n print(l)\n for i in range(n+1):\n for pow in range(len(l)):\n if i >= l[pow] and i % l[pow] == 0:\n print(i, pow, l[pow])\n count -= (16-pow)\n break\n # if i >= 4 and i % 4 == 0:\n # count -= 2\n # elif i >= 2 and i % 2 == 0:\n # count -= 1\n out.append(count)\n count += 1\n return out","runtime":"138"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n i = 0\n res = []\n dp = {}\n while i <= n:\n count = 0\n temp = i\n if temp in dp:\n count = dp[temp]\n else:\n while temp:\n if temp % 2 == 1:\n count += 1\n if temp not in dp:\n dp[temp] = count\n temp = temp >> 1\n res.append(count)\n i += 1\n return res","runtime":"139"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n arr = []\n def noBits(n):\n count=0\n for i in range(32):\n if(n>>i&1):\n count+=1\n return count\n\n for i in range(n+1):\n arr.append(noBits(i))\n return arr","runtime":"139"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n for i in range(n+1):\n c = 0\n for n in range(32):\n if i>>n & 1:\n c+=1\n res.append(c)\n return res","runtime":"141"},{"code":"from collections import Counter\n\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n bin_string = bin(i)\n ones = Counter(bin_string)['1']\n ans.append(ones)\n return ans\n\n'''\n # 0,1; 1, 2; 1, 2, 2, 3; 1, 2, 2, 3, 2, 3, 3, 4;\n\n 1 2\n 1 2 2 3\n 1 2 2 3 2 3 3 4 \n'''","runtime":"142"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n # 2%2 = 0\n # 3%2 = 1, dp[2] + dp[1] = 2 + 1 = 3\n # 4%2 = 0, dp[4] = 1\n # 5%2 = 1, dp[4] + dp[1] = 1+1 = 2\n # 6%2 = 2, dp[4] + dp[2] = 1 + 1 = 2\n if n == 0: return [0]\n dp = [0, 1]\n for i in range(2, n+1): # check if it's a power of two\n mod = i & (i-1)\n print(i,i-mod, mod)\n if i & (i-1) == 0: dp.append(1)\n else: \n print('here', dp[i-mod]+dp[mod])\n dp.append(dp[i-mod]+dp[mod])\n return dp\n\n","runtime":"142"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n count = 0\n n = i\n while n:\n count += int(n % 2)\n n //= 2\n ans.append(count)\n return ans","runtime":"144"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n def helper(a):\n count = 0\n while a:\n if a % 2 == 1:\n count += 1\n a = a//2\n return count\n for i in range(n+1):\n count = helper(i)\n print(i)\n res.append(count)\n return res","runtime":"144"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n s = str(bin(i)[2:])\n j=0\n res=0\n while j <len(s):\n if s[j] =='1':\n res+=1\n j+=1\n ans.append(res)\n return ans","runtime":"145"},{"code":"from collections import Counter\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n\n l = []\n for i in range(n+1):\n l.append(Counter(f'{i:b}')['1'])\n\n return l\n\n ","runtime":"147"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n a = []\n for j in range(n+1):\n sumi = 0\n for i in range(32):\n if (j >> i) & 1:\n sumi += 1\n a.append(sumi)\n return a","runtime":"147"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n arr=[0]*(n+1)\n for i in range(n+1):\n c=0\n for j in range(32):\n if (i>>j)&1:\n c+=1\n arr[i]=c\n return arr\n ","runtime":"148"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def bin(a):\n res=[]\n while a:\n res.append(a%2)\n a//=2\n return res\n res=[]\n for i in range(n+1):\n val=bin(i)\n one=val.count(1)\n res.append(one)\n return res\n","runtime":"150"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = []\n for i in range(n+1):\n c = 0\n for n in range(32):\n if i>>n & 1:\n c+=1\n res.append(c)\n return res","runtime":"150"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n lst=[]\n for i in range(n+1):\n lst.append(sum((list(map(int,bin(i)[2:])))))\n return lst\n ","runtime":"152"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n+1):\n count = 0\n for shift in range(32):\n count += (i >> shift) & 1\n ans.append(count)\n return ans\n","runtime":"153"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n # out = []\n # count = 0\n # l = [2**i for i in range(16, 0, -1)]\n # print(l)\n # for i in range(n+1):\n # for pow in range(len(l)):\n # if i >= l[pow] and i % l[pow] == 0:\n # print(i, pow, l[pow])\n # count -= (16-pow)\n # break\n # out.append(count)\n # count += 1\n # return out\n if n == 0:\n return [0]\n out = []\n count = 0\n max_pow = int(log(n,2))\n l = [2**i for i in range(max_pow, 0, -1)]\n for i in range(n+1):\n for pow in range(len(l)):\n if i >= l[pow] and i % l[pow] == 0:\n print(i, pow, l[pow])\n count -= (max_pow-pow)\n break\n out.append(count)\n count += 1\n return out","runtime":"153"},{"code":"from collections import Counter\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n\n l = []\n for i in range(n+1):\n l.append(Counter(bin(i))['1'])\n\n return l\n\n ","runtime":"155"}],"string":"[\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n if n == 0:\\n return [0]\\n if n == 1:\\n return [0, 1]\\n ans = [0, 1]\\n for i in range(2, n + 1):\\n if i % 2 == 0:\\n ans.append(ans[i // 2])\\n else:\\n ans.append(ans[i // 2] + 1)\\n return ans\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0] * (n+1)\\n for i in range(1, n+1):\\n ans[i] = ans[i >> 1] + (i % 2)\\n return ans\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0] * (n+1)\\n for i in range(1, n+1):\\n ans[i] = ans[i & (i-1)] +1\\n return ans\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0 for _ in range(n+1)]\\n for i in range(1, n+1):\\n # Binary representation of a number depends on the binary representation on its half and its remainder when devided by 2\\n ans[i] = ans[i//2] + i%2\\n return ans\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n # Create a list of size n + 1 with all elements initialized to 0\\n r = [0] * (n + 1)\\n for i in range(1, n + 1):\\n r[i] = r[i//2] + i%2\\n return r\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n if n == 0:\\n return [0]\\n \\n l = -1\\n t = n\\n while t > 0:\\n t = t >> 1\\n l += 1\\n\\n ret = [0] * (n+1)\\n m = 1\\n\\n while l > 0:\\n ret[m: 2*m] = (x+1 for x in ret[:m])\\n m *= 2\\n l -= 1\\n\\n ret[m: n+1] = (x+1 for x in ret[:n+1-m])\\n \\n return ret\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans=[0]*(n+1)\\n for i in range(1,n+1):\\n if i%2:\\n ans[i]=ans[i//2]+1\\n else:\\n ans[i]=ans[i//2]\\n return ans\\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n dp = [0] * (n+1)\\n offset = 1\\n for i in range(1, n+1):\\n if offset * 2 == i:\\n offset = i\\n dp[i] = 1 + dp[i-offset]\\n return dp\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n d = 1\\n arr = [0]\\n if n > 0:\\n arr.append(1)\\n l = 2\\n while len(arr) != n + 1:\\n for i in range(0,min(n + 1 - l,l)):\\n arr.append(1 + arr[i])\\n l *= 2\\n return arr\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]\\n m = 1\\n while 2*m-1 < n:\\n ans.extend([num+1 for num in ans])\\n m *= 2\\n ans.extend([num+1 for num in ans[:n-m+1]])\\n return ans\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ret = [0] * (n+1)\\n offset = 1\\n for i in range(1, n+1):\\n if offset * 2 == i:\\n offset = i\\n ret[i] = 1 + ret[i-offset]\\n return ret\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0] * (n+1)\\n offset = 1\\n for i in range(1, n+1):\\n if offset * 2 == i:\\n offset *= 2\\n res[i] = 1 + res[i - offset]\\n return res\\n\\n '''\\n 0 000 0\\n 1 001 1\\n 2 010 1\\n 3 011 2\\n # 4 100 1 + (res[curr - offset]) // offset = the last power of 2 till this point\\n 4 100 1 + 0 = 1 // offset = 4\\n 5 101 1 + 1 = 2\\n 6 110 1 + 1 = 2\\n 7 111 1 + 2 = 3\\n 8 1000 1 + 0 = 1 // offset = 8\\n '''\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, num: int) -> List[int]:\\n counter = [0]\\n for i in range(1, num+1):\\n counter.append(counter[i >> 1] + i % 2)\\n return counter\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n dp = [0] * (n+1)\\n offset = 1\\n for i in range(1,n+1):\\n if (i == offset * 2):\\n offset *= 2\\n dp[i] = 1 + dp[i-offset]\\n return dp\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n n\\n ans = len(n+1)\\n st 0<=i<=n\\n ans[i] binary\\n 10 to 2\\n move bit?\\n \\\"\\\"\\\"\\n ans = [0]*(n+1)\\n nextOrder = 2\\n tracker = 0\\n for i in range(1,n+1):\\n if i == nextOrder:\\n nextOrder *= 2\\n tracker = 0\\n ans[i] = ans[tracker] + 1\\n tracker += 1\\n\\n return ans\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ret = [0]\\n copyend = 0\\n copy = 0\\n for i in range(1, n+1):\\n copy += 1\\n if copy > copyend:\\n copy = 0\\n copyend = i-1\\n ret.append(ret[copy] + 1)\\n return ret\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n # ans = [0]\\n # for num in range(1,n+1):\\n # count = 0\\n # while num != 0:\\n # num = num & (num-1)\\n # count += 1\\n\\n # ans.append(count)\\n \\n # return ans\\n\\n ans = [0] * (n+1)\\n for i in range(1, n+1):\\n ans[i] = ans[i >> 1] + (i & 1)\\n return ans\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n n\\n ans = len(n+1)\\n st 0<=i<=n\\n ans[i] binary\\n 10 to 2\\n move bit?\\n \\\"\\\"\\\"\\n ans = [0]\\n for i in range(1,n+1):\\n ans.append(ans[i >> 1] + i % 2)\\n\\n return ans\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# class Solution:\\n# def countBits(self, n: int) -> List[int]:\\n# out = []\\n# for i in range(0,n+1,1):\\n# k = bin(i)[2:]\\n\\n# out.append(k.count('1'))\\n# return out\\n\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n # Create a list of size n + 1 with all elements initialized to 0\\n result = [0] * (n + 1)\\n\\n # If n is 0, return the list\\n if n == 0:\\n return result\\n\\n # Base cases:\\n # Set the first two elements of the list\\n result[0] = 0\\n if n >= 1:\\n result[1] = 1\\n\\n # Iterate from 2 to n\\n for x in range(2, n + 1):\\n # If 'x' is even, set the x-th element of the list to \\n # the (x // 2)-th element\\n if x % 2 == 0:\\n result[x] = result[x // 2]\\n # If x is odd, set the x-th element of the list to \\n # the (x // 2)-th element + 1\\n else:\\n result[x] = result[x // 2] + 1\\n\\n # Return the final list\\n return result\\n\\n \\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n):\\n ans = [0] * (n + 1)\\n for i in range(1, n + 1):\\n ans[i] = ans[i >> 1] + (i & 1)\\n return ans\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n if n == 0:\\n return [0]\\n \\n res = [0] * (n + 1)\\n res[1] = 1\\n\\n for i in range(2, n+1):\\n res[i] = res[i // 2] + (i & 0b1)\\n \\n return res\\n\\n\\n# 0 --> 0b0000 --> 0 = 0 (base case)\\n# 1 --> 0b0001 --> 1 = 1 (power of 2)\\n# 2 --> 0b0010 --> 1 \\n# 3 --> 0b0011 --> 2\\n# 4 --> 0b0100 --> 1\\n# 5 --> 0b0101 --> 2\\n# 6 --> 0b0110 --> 2 \\n# 7 --> 0b0111 --> 3\\n# 8 --> 0b1000 --> 1\\n# 9 --> 0b1001 --> 2\\n# 10 --> 0b1010 --> 2\\n# 11 --> 0b1011 --> 3\\n# 12 --> 0b1100 --> 2\\n# 13 --> 0b1101 --> 3\\n# 14 --> 0b1110 --> 3\\n# 15 --> 0b1111 --> 4\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans=[0]*(n+1)\\n for i in range(1,n+1):\\n ans[i]=ans[i & (i-1)] + 1 \\n return ans\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0]*(n+1) #if *n --> list assignment out of range!\\n # res[0] = 0\\n for i in range(1, n+1):\\n res[i] = res[i//2] + (i%2)\\n return res\\n \",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n soln = [0, 1]\\n\\n for i in range(2, n + 1):\\n soln.append(i % 2 + soln[i // 2])\\n\\n return soln[:n + 1]\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return [i.bit_count() for i in range(n+1)]\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(1, n + 1):\\n dp[i] = dp[i >> 1] + (i & 1)\\n \\n return dp\\n\\n \",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(1, n + 1):\\n dp[i] = dp[i >> 1] + (i & 1)\\n return dp\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(1, n + 1):\\n dp[i] = dp[i >> 1] + (i & 1)\\n return dp\\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n if n == 0: return [0]\\n if n == 1: return [0, 1]\\n curr = 1\\n dp = [0 for i in range(n+1)]\\n dp[1] = 1\\n \\n for i in range(2, n+1):\\n if i == curr*2:\\n curr *= 2\\n dp[i] = 1\\n else:\\n dp[i] = 1 + dp[i-curr]\\n\\n return dp\\n\\n \",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n # Initialize the DP array with zeros\\n dp = [0] * (n + 1)\\n \\n # Populate the DP array\\n for i in range(1, n + 1):\\n # If i is odd, use the formula: dp[i] = dp[i // 2] + 1\\n # If i is even, use the formula: dp[i] = dp[i // 2]\\n dp[i] = dp[i >> 1] + (i & 1)\\n \\n return dp\\n\\n \",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(1, n + 1):\\n dp[i] = dp[i >> 1] + (i & 1)\\n return dp\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(1, n + 1):\\n dp[i] = dp[i >> 1] + (i & 1)\\n return dp\\n \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n if n == 0:\\n return [0]\\n if n == 1:\\n return [0, 1]\\n retval = [0, 1]\\n count = 2\\n from_index = 2\\n to_index = pow(2, count)\\n if to_index > n:\\n to_index = n+1\\n while len(retval)<=n:\\n j = 0\\n while from_index < to_index:\\n retval.append(retval[j]+1)\\n j+=1\\n from_index+=1\\n count+=1\\n to_index = pow(2, count)\\n if to_index > n:\\n to_index = n+1\\n return retval\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0] * (n + 1)\\n if n == 0:\\n return res\\n res[1] = 1\\n for i in range(1, len(res)):\\n if i % 2 == 0:\\n res[i] = res[i // 2]\\n else:\\n res[i] = res[i // 2] + 1\\n return res\\n\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(1, n + 1):\\n dp[i] = dp[i >> 1] + (i & 1)\\n return dp\\n \",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0] * (n + 1)\\n for i in range(1, n + 1):\\n ans[i] = ans[i >> 1] + (i & 1)\\n return ans\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return [bin(i).count('1') for i in range(n+1)]\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n dp=[0]\\n\\n for i in range(1, n+1):\\n dp.append(dp[i//2]+i%2)\\n return dp\\n\\n# 0 1 \\n# \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0] * (n + 1)\\n for i in range(1, n + 1):\\n ans[i] = ans[i >> 1] + (i & 1)\\n return ans\\n \",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n result = [0]\\n while len(result) < n + 1:\\n end = len(result) \\n for i in range(end):\\n result += [result[i] + 1]\\n if len(result) >= n + 1:\\n break\\n return result\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n l = [0] * (n + 1)\\n for i in range(1, n + 1):\\n l[i] = l[i >> 1] + (i & 1)\\n return l\\n\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return [bin(i).count('1') for i in range(n+1)]\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return [bin(i).count('1') for i in range(n+1)]\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n out = []\\n for i in range(0,n+1,1):\\n k = bin(i)[2:]\\n\\n out.append(k.count('1'))\\n return out\\n \",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n count=[]\\n for i in range(n+1):\\n x=bin(i).replace(\\\"0b\\\",\\\"\\\")\\n cout=x.count(\\\"1\\\")\\n count.append(cout)\\n return count \",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]*(n+1)\\n offset = 1\\n for i in range(1,n+1):\\n if i == offset * 2:\\n offset = offset * 2\\n ans[i] = 1 + ans[i-offset]\\n return ans\\n\\n \",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]*(n+1)\\n for x in range(1, n+1):\\n ans[x] = ans[(x&(x-1))] + 1\\n return ans\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n dp = [0]*(n+1)\\n\\n \\\"\\\"\\\"\\n 0->0\\n 1->1\\n 2->1\\n 3->2\\n 4->1\\n 5->2\\n 6->2\\n 7->3\\n 8->1\\n \\\"\\\"\\\"\\n twoPower = 0\\n for i in range(1, n+1):\\n if i>1 and i==2*(2**twoPower):\\n twoPower +=1\\n dp[i] = dp[i-2**twoPower]+1\\n\\n return dp\\n \\n\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n arr=[]\\n for i in range(n+1):\\n arr.append(bin(i).count(\\\"1\\\"))\\n return arr\\n\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n liste=[0]*(n+1)\\n if n==0:\\n return [0]\\n liste[1]=1\\n z=2\\n for i in range(2,n+1):\\n if i/z==2:\\n z=i\\n liste[i]=1+liste[i-z]\\n print(liste[i])\\n return liste\\n\\n\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def countbit(self, num):\\n return bin(num).count('1')\\n\\n def countBits(self, n: int) -> List[int]:\\n \\n result = [self.countbit(i) for i in range(n+1)]\\n \\n return result\\n \",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res=[0]*(n+1)\\n for i in range((n+1)):\\n res[i]=str(\\\"{0:b}\\\".format(i)).count('1')\\n return res\\n \",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n l=[]\\n for i in range(0,n+1):\\n l.append(bin(i)[2:].count('1'))\\n return l\\n\\n\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n x=[]\\n for i in range(n+1):\\n a=bin(i).replace(\\\"0b\\\",\\\"\\\")\\n b=a.count(\\\"1\\\")\\n x.append(b)\\n return x\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n dict1 = {0:0}\\n def get_sum_bits(num, count):\\n # if num == 0:\\n # return count\\n if num in dict1:\\n return count + dict1[num]\\n res = floor(math.log2(num))\\n res2 = math.pow(2, res)\\n num = num - res2\\n count += 1\\n return get_sum_bits(num, count)\\n \\n for i in range(n+1):\\n count = get_sum_bits(i, 0)\\n dict1[i] = count\\n\\n return dict1.values()\\n\\n \\n \\n \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res=[0]*(n+1)\\n for i in range((n+1)):\\n b = \\\"{0:b}\\\".format(i)\\n res[i]=str(b).count('1')\\n return res\\n \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n\\n for i in range(n+1):\\n num = i\\n count = 0\\n while num > 0:\\n num = num & (num - 1)\\n count += 1\\n res.append(count)\\n \\n return res\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def countBitsInNumber(self, n, memo = {0:0, 1:1}):\\n if n in memo:\\n return memo[n]\\n if n % 2 == 0:\\n result = self.countBitsInNumber(n//2, memo)\\n memo[n] = result\\n return result\\n else:\\n result = self.countBitsInNumber(n//2, memo) + 1\\n memo[n] = result\\n return result\\n def countBits(self, n: int) -> List[int]:\\n return [self.countBitsInNumber(i) for i in range(n+1)]\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n out = []\\n for i in range(0,n+1,1):\\n k = bin(i)[2:]\\n out.append(k.count('1'))\\n\\n #return out\\n return [bin(i)[2:].count('1') for i in range(0,n+1)]\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n def _countBit(num):\\n count = 0 \\n while num:\\n count += 1\\n num = num & (num - 1)\\n return count \\n \\n res = []\\n for num in range(n + 1):\\n res.append(_countBit(num))\\n return res \\n\\n\\n\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n\\n bitCount = [0]*(n+1)\\n def countBitsInt(num):\\n bitCountNum = 0\\n while num:\\n num = num & num-1\\n bitCountNum +=1\\n return bitCountNum\\n\\n for i in range(0, n+1):\\n \\n bitCount[i] = countBitsInt(i)\\n return bitCount\\n \",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n a=[]\\n i=0\\n while i<=n:\\n d=list(bin(i))\\n a.append(d.count('1'))\\n i+=1\\n return a\\n\\n \",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n res = []\\n dct = {}\\n\\n for num in range(n + 1):\\n \\n count = 0\\n while num != 0:\\n # if num in dct:\\n # count += dct[num]\\n # break\\n num = num & (num-1)\\n count += 1\\n \\n res.append(count)\\n \\n return res\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n # res = []\\n # for i in range(n+1):\\n # res.append(bin(i).count('1'))\\n # return res\\n #Time:O(nlogn) Space:O(n)\\n\\n\\n # DP + Most Significant Bit\\n # res = [0]*(n+1)\\n # x = 0\\n # b = 1\\n # while b<= n:\\n # while x < b and x+b<=n:\\n # res[x+b] = res[x]+1\\n # x += 1\\n # x = 0\\n # b <<= 1\\n # return res\\n #Time:O(n) Space:O(n)\\n\\n\\n # DP + Least Significant Bit\\n # ans = [0] * (n + 1)\\n # for x in range(1, n + 1):\\n # ans[x] = ans[x >> 1] + (x & 1) \\n # return ans \\n #Time:O(n) Space:O(n)\\n\\n\\n # DP + Last Set Bit\\n # ans = [0] * (n + 1)\\n # for x in range(1, n + 1):\\n # ans[x] = ans[x & (x - 1)] + 1\\n # return ans \\n #Time:O(n) Space:O(n)\\n\\n\\n\\n res = []\\n for i in range(n+1):\\n count = 0\\n while i:\\n i &= (i-1)\\n count += 1\\n res.append(count)\\n return res\\n\\n\\n\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]\\n for num in range(1,n+1):\\n count = 0\\n while num != 0:\\n num = num & (num-1)\\n count += 1\\n\\n ans.append(count)\\n \\n return ans\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n res = []\\n dct = {}\\n\\n for num in range(n + 1):\\n \\n count = 0\\n while num != 0:\\n if num in dct:\\n count += dct[num]\\n break\\n num = num & (num-1)\\n count += 1\\n \\n res.append(count)\\n \\n return res\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n n\\n ans = len(n+1)\\n st 0<=i<=n\\n ans[i] binary\\n 10 to 2\\n move bit?\\n \\\"\\\"\\\"\\n # ans = [0] * (n+1)\\n ans = []\\n for i in range(n+1):\\n # ans.append(int(bin(i)))\\n # print(bin(i)[2:])\\n count = 0\\n for j in bin(i)[2:]:\\n # print('j = ',j)\\n if j == '1':\\n count += 1\\n\\n ans.append(count)\\n\\n return ans\\n \",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n result = [0]\\n\\n for i in range(1, n+1):\\n count = 0\\n while i:\\n i = (i & (i-1))\\n count += 1\\n result.append(count)\\n \\n return result\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def count(num):\\n count = 0\\n while num!=0:\\n num = num&(num-1)\\n count += 1\\n return count\\n ans = []\\n for i in range(n+1):\\n ans.append(count(i))\\n return ans\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n \\n def counter(num):\\n count = 0\\n while num:\\n num = num & (num - 1)\\n count += 1\\n \\n return count\\n \\n for i in range(n + 1):\\n ans.append(counter(i))\\n \\n return ans\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n l = []\\n for i in range(0, n + 1):\\n cnt = 0\\n for item in bin(i).lstrip('0b'):\\n if item == '1':\\n cnt += 1\\n l.append(cnt)\\n return l\\n \",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n out = []\\n\\n for i in range(0, n+1):\\n out.append(self.countSetBits(i))\\n return out\\n\\n def countSetBits(self, n: int) -> int:\\n cnt = 0\\n while n > 0:\\n n &= n-1\\n cnt += 1\\n return cnt\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n + 1):\\n count = 0\\n for c in str(bin(i)):\\n if c == '1':\\n count += 1\\n ans.append(count)\\n \\n return ans\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n res = []\\n dct = {}\\n\\n for num in range(n + 1):\\n \\n count = 0\\n while num != 0:\\n if num in dct:\\n count += dct[num]\\n print(\\\"yoyoma\\\")\\n break\\n num = num & (num-1)\\n count += 1\\n \\n dct[num] = count\\n res.append(count)\\n \\n return res\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n #iterate 0~n\\n #change to binary\\n #count how many \\\"1\\\" in it\\n \\n # Time : O(n*m)\\n # Space : O(n)\\n\\n # 0,1\\n # n=2 [0,1,1]\\n \\n\\n result = []\\n\\n for num in range(n+1):\\n num_bin = format(num,\\\"b\\\")\\n\\n count = 0\\n for item in num_bin:\\n if item=='1':\\n count+=1\\n \\n result.append(count)\\n \\n return result\\n\\n\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res: list[int] = [0 for _ in range(n + 1)]\\n for i in range(1, n + 1):\\n res[i] = 1 + res[i - self.get2Pow(i)]\\n\\n return res\\n\\n \\n def get2Pow(self, n: int) -> int:\\n \\\"\\\"\\\"\\n Get the biggest Pow(2) less than n\\n \\\"\\\"\\\"\\n res: int = 0\\n while n != 0:\\n res = n\\n n = n & (n-1)\\n\\n return res\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"def setBitCount(num):\\n counter = 0\\n for char in bin(num)[2:]:\\n if char == \\\"1\\\":\\n counter += 1\\n return counter\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n result = []\\n for num in range(n+1):\\n result.append(setBitCount(num))\\n return result\\n\\n\\n \",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans=[]\\n for i in range(n+1):\\n res=0\\n while i>0:\\n i&=(i-1)\\n res+=1\\n ans.append(res)\\n return ans\\n \\n\\n \",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def count_bits(num):\\n counter = 0\\n while num != 0:\\n counter += 1\\n num &= num - 1\\n return counter\\n \\n res = []\\n for x in range(0, n + 1):\\n res.append(count_bits(x))\\n return res\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def calc1(s):\\n count = 0\\n for i in s :\\n if i == '1':\\n count += 1\\n return count\\n arr = []\\n for i in range(n+1):\\n s = bin(i)[2:]\\n arr.append(calc1(s))\\n return arr\\n\\n\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n ans = []\\n for i in range(n + 1):\\n count = 0\\n num = i\\n while num > 0:\\n # Check if the least significant bit is 1\\n count += num & 1\\n # Right shift to check the next bit\\n num >>= 1\\n ans.append(count)\\n return ans\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n for i in range(n + 1):\\n binary = bin(i)\\n cnt = 0\\n for j in range(2, len(binary)):\\n if binary[j] == '1':\\n cnt += 1\\n res.append(cnt)\\n return res\\n\\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res=[]\\n for index in range(n+1):\\n num=index\\n cnt=0\\n while num>0:\\n cnt+=(num&1)\\n num>>=1\\n res.append(cnt)\\n return res\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n def _countBit(num):\\n count = 0 \\n while num:\\n count += (num & 1)\\n num >>= 1\\n return count \\n \\n res = []\\n for num in range(n + 1):\\n res.append(_countBit(num))\\n return res \\n\\n\\n\\n \",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def countSetBits(n):\\n count = 0\\n while (n):\\n count += n & 1\\n n >>= 1\\n return count\\n res = list()\\n for x in range(n+1):\\n res.append(countSetBits(x))\\n return res\\n\\n \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n # most basic solutions\\n vals = [i for i in range(n+1)]\\n\\n for i, val in enumerate(vals):\\n res = 0\\n while val > 0:\\n res += (val & 1)\\n val = val >> 1\\n vals[i] = res\\n return vals\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n\\n for i in range(n + 1):\\n cur = 0\\n while i:\\n cur += i % 2\\n i = i // 2\\n res.append(cur)\\n return res\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n cur=0\\n while i:\\n cur += i & 1\\n i>>=1\\n ans.append(cur)\\n return ans\\n\\n\\n \",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def num_1s(num):\\n ones = 0\\n while num:\\n ones += num % 2\\n num = num // 2\\n return ones\\n\\n result = []\\n\\n for i in range(n+1):\\n result.append( num_1s(i) )\\n \\n return result\\n \",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n for i in range(n+1):\\n count = 0\\n while i > 0:\\n count += i & 1\\n i = i >> 1\\n res.append(count)\\n return res\\n\\n\\n \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]: \\n ans=[]\\n for i in range(n+1):\\n count=0\\n while i>0:\\n if(i%2==1):\\n count+=1\\n i//=2\\n ans.append(count)\\n return ans\\n\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n counts = []\\n for i in range(0, n+1):\\n count = 0\\n while i > 0:\\n if i & 1 == 1:\\n count += 1\\n i >>= 1\\n counts.append(count)\\n return counts\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n l=[]\\n \\n for i in range(n+1):\\n c=0\\n while i:\\n c+=i&1\\n i>>=1\\n l.append(c)\\n return l\\n\\n \",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n # O(n log n) solution\\n output = []\\n\\n for i in range(n + 1):\\n count = 0\\n while i != 0:\\n count += i % 2\\n i //= 2\\n output.append(count)\\n\\n return output\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans=[0] * (n+1)\\n for i in range(n+1):\\n count=0\\n index=i\\n while i!=0:\\n if (i&1==1):\\n count+=1\\n i=i>>1\\n ans[index]=count\\n return ans\\n\\n\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def countOnes(self, num):\\n out = 0\\n while num!=0:\\n out += num & 1\\n num = num >> 1\\n \\n return out\\n\\n def countBits(self, n: int) -> List[int]:\\n ret = []\\n for i in range(n+1):\\n ret.append(self.countOnes(i))\\n\\n return ret \",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n ct = 0\\n while i > 0:\\n ct += i & 1\\n i >>= 1\\n ans.append(ct)\\n return ans\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n output = []\\n\\n def count_ones(num):\\n res = 0\\n while num > 0:\\n if num % 2 == 1:\\n res += 1\\n num = num >> 1\\n return res\\n\\n for i in range(n + 1):\\n output.append(count_ones(i))\\n return output\\n\\n\\n \\n \",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n res = []\\n for i in range(n + 1):\\n cnt = 0\\n\\n while i:\\n if i % 2 == 1:\\n cnt += 1\\n i = i >> 1\\n \\n res.append(cnt)\\n \\n return res\\n\\n \",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0] * (n + 1)\\n for i in range(n + 1):\\n item = i\\n temp = 0\\n while item >= 2:\\n if item % 2 == 1:\\n temp += 1\\n item = item // 2\\n temp += item // 2 + item % 2\\n res[i] = temp\\n return res\\n\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def get_weight(n):\\n weight = 0\\n while n != 0:\\n weight += n % 2\\n n = n >> 1\\n return weight\\n \\n res = [0] * (n + 1)\\n for i in range(n + 1):\\n res[i] = get_weight(i)\\n return res\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n d=[2**i for i in range(19)]\\n\\n ans=[]\\n for i in range(n+1):\\n x=0\\n for _d in d:\\n x+=(_d&i)>0\\n ans.append(x)\\n return ans\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0] * (n + 1)\\n for i in range(n + 1):\\n tmp = i\\n while tmp:\\n res[i] += tmp % 2\\n tmp >>= 1\\n return res\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n result = []\\n for i in range(n + 1):\\n counter = 0\\n while i:\\n counter += (i & 1)\\n i >>= 1\\n result.append(counter)\\n\\n return result\\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n i = 0\\n res = []\\n\\n while i <= n:\\n number = i\\n resultDigit = 0\\n while number > 0:\\n if number % 2 == 1:\\n resultDigit +=1\\n number >>= 1\\n res.append(resultDigit)\\n i += 1\\n\\n\\n return res\\n\\n\\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n answ = []\\n for j in range(n+1):\\n i = j\\n count = 0\\n while i >= 1:\\n if i%2 == 1:\\n count += 1\\n i = (i-1)//2\\n else:\\n i = i // 2\\n answ.append(count)\\n return answ\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"# class Solution:\\n# def countBits(self, n: int) -> List[int]:\\n# dp = [0] * (n+1)\\n# offset = 1\\n\\n# for i in range(1,n+1):\\n# if offset * 2 == i:\\n# offset = i\\n# dp[i] = 1 + dp[i-offset]\\n# return dp\\n \\n\\n\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]*(n+1)\\n logn = 0\\n nCopy = n\\n while nCopy > 0:\\n nCopy = nCopy >> 1\\n logn += 1\\n \\n for pw in range(logn):\\n for i in range(1, n+1):\\n curNum = i\\n if ((curNum >> pw) & 1):\\n ans[i] += 1\\n return ans\\n \",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"class Solution:\\n def bits(self,n:int):\\n cnt = 0\\n while(n>0):\\n if(n%2==1):\\n cnt+=1\\n n = n//2\\n return cnt\\n def countBits(self, n: int) -> List[int]:\\n l = []\\n for i in range(1+n):\\n l.append(self.bits(i))\\n return l\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def count1Bits(n):\\n count = 0\\n\\n while n != 0:\\n if n & 1 == 1:\\n count += 1\\n n = n >> 1\\n return count\\n\\n\\n counts = [0] * (n + 1)\\n for i in range(n + 1):\\n counts[i] = count1Bits(i)\\n return counts\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n # 3\\n # 11\\n #\\n def countBits(self, n: int) -> List[int]:\\n ans = [0] * (n+1)\\n for i in range(n+1):\\n x = i\\n while x!= 0:\\n ans[i] += x%2\\n x //=2\\n return ans\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"# class Solution:\\n# def countBits(self, n: int) -> List[int]:\\n# dp = [0] * (n+1)\\n# offset = 1\\n\\n# for i in range(1,n+1):\\n# if offset * 2 == i:\\n# offset = i\\n# dp[i] = 1 + dp[i-offset]\\n# return dp\\n \\n\\n\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]*(n+1)\\n logn = 0\\n nCopy = n\\n while nCopy > 0:\\n nCopy = nCopy >> 1\\n logn += 1\\n \\n for pw in range(logn):\\n for i in range(1, n+1):\\n curNum = i\\n if ((curNum >> pw) & 1):\\n ans[i] += 1\\n return ans\\n \",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n for i in range(n + 1):\\n count = 0\\n while i > 0:\\n if i & 1 == 1:\\n count += 1\\n i = i >> 1\\n res.append(count)\\n return res\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0] * (n + 1)\\n for i in range(n,-1,-1):\\n num = i \\n count = 0\\n while num:\\n ld = num % 2\\n count += 1 if ld == 1 else 0\\n num = num // 2\\n ans[i] = count\\n return ans\\n\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n memo = [0] * (n+1)\\n def getBits(num):\\n cnt = 0\\n while num > 0:\\n if memo[num] != 0:\\n cnt += memo[num]\\n break\\n bit = num & 1\\n if bit == 1:\\n cnt += 1\\n num >>= 1\\n if memo[num] == 0:\\n memo[num] = cnt\\n return cnt\\n\\n ans = []\\n for num in range(n+1):\\n ans.append(getBits(num))\\n \\n return ans\\n\\n \\n\\n \",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n count = 0\\n while i > 0:\\n if i & 1 == 1:\\n count += 1\\n i >>= 1\\n ans.append(count)\\n return ans\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = [0]*(n+1)\\n for i in range(0, n+1):\\n temp = self.func(i)\\n ans[i]=temp\\n return ans\\n\\n def func(self, num):\\n count=0\\n while num>0:\\n if num%2==1:\\n count+=1\\n num=num>>1\\n return count\\n \",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n\\n for i in range(n+1):\\n res.append( sum(map(int, bin(i)[2:])))\\n\\n return res \",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0] * (n + 1)\\n for i in range(n+1):\\n j = i\\n while j:\\n res[i] += j & 1\\n j >>= 1\\n return res\\n\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n ans = [0] * (n+1)\\n\\n for i in range(1, n+1):\\n ans[i] = sum(map(lambda x: x == '1', bin(i)[2:]))\\n \\n return ans\\n\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n out = []\\n count = 0\\n l = [2**i for i in range(16, 0, -1)]\\n print(l)\\n for i in range(n+1):\\n for pow in range(len(l)):\\n if i >= l[pow] and i % l[pow] == 0:\\n print(i, pow, l[pow])\\n count -= (16-pow)\\n break\\n # if i >= 4 and i % 4 == 0:\\n # count -= 2\\n # elif i >= 2 and i % 2 == 0:\\n # count -= 1\\n out.append(count)\\n count += 1\\n return out\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n i = 0\\n res = []\\n dp = {}\\n while i <= n:\\n count = 0\\n temp = i\\n if temp in dp:\\n count = dp[temp]\\n else:\\n while temp:\\n if temp % 2 == 1:\\n count += 1\\n if temp not in dp:\\n dp[temp] = count\\n temp = temp >> 1\\n res.append(count)\\n i += 1\\n return res\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n arr = []\\n def noBits(n):\\n count=0\\n for i in range(32):\\n if(n>>i&1):\\n count+=1\\n return count\\n\\n for i in range(n+1):\\n arr.append(noBits(i))\\n return arr\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n for i in range(n+1):\\n c = 0\\n for n in range(32):\\n if i>>n & 1:\\n c+=1\\n res.append(c)\\n return res\",\n \"runtime\": \"141\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n bin_string = bin(i)\\n ones = Counter(bin_string)['1']\\n ans.append(ones)\\n return ans\\n\\n'''\\n # 0,1; 1, 2; 1, 2, 2, 3; 1, 2, 2, 3, 2, 3, 3, 4;\\n\\n 1 2\\n 1 2 2 3\\n 1 2 2 3 2 3 3 4 \\n'''\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n # 2%2 = 0\\n # 3%2 = 1, dp[2] + dp[1] = 2 + 1 = 3\\n # 4%2 = 0, dp[4] = 1\\n # 5%2 = 1, dp[4] + dp[1] = 1+1 = 2\\n # 6%2 = 2, dp[4] + dp[2] = 1 + 1 = 2\\n if n == 0: return [0]\\n dp = [0, 1]\\n for i in range(2, n+1): # check if it's a power of two\\n mod = i & (i-1)\\n print(i,i-mod, mod)\\n if i & (i-1) == 0: dp.append(1)\\n else: \\n print('here', dp[i-mod]+dp[mod])\\n dp.append(dp[i-mod]+dp[mod])\\n return dp\\n\\n\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n count = 0\\n n = i\\n while n:\\n count += int(n % 2)\\n n //= 2\\n ans.append(count)\\n return ans\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n def helper(a):\\n count = 0\\n while a:\\n if a % 2 == 1:\\n count += 1\\n a = a//2\\n return count\\n for i in range(n+1):\\n count = helper(i)\\n print(i)\\n res.append(count)\\n return res\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n s = str(bin(i)[2:])\\n j=0\\n res=0\\n while j <len(s):\\n if s[j] =='1':\\n res+=1\\n j+=1\\n ans.append(res)\\n return ans\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n l = []\\n for i in range(n+1):\\n l.append(Counter(f'{i:b}')['1'])\\n\\n return l\\n\\n \",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n a = []\\n for j in range(n+1):\\n sumi = 0\\n for i in range(32):\\n if (j >> i) & 1:\\n sumi += 1\\n a.append(sumi)\\n return a\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n arr=[0]*(n+1)\\n for i in range(n+1):\\n c=0\\n for j in range(32):\\n if (i>>j)&1:\\n c+=1\\n arr[i]=c\\n return arr\\n \",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def bin(a):\\n res=[]\\n while a:\\n res.append(a%2)\\n a//=2\\n return res\\n res=[]\\n for i in range(n+1):\\n val=bin(i)\\n one=val.count(1)\\n res.append(one)\\n return res\\n\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = []\\n for i in range(n+1):\\n c = 0\\n for n in range(32):\\n if i>>n & 1:\\n c+=1\\n res.append(c)\\n return res\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n lst=[]\\n for i in range(n+1):\\n lst.append(sum((list(map(int,bin(i)[2:])))))\\n return lst\\n \",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n+1):\\n count = 0\\n for shift in range(32):\\n count += (i >> shift) & 1\\n ans.append(count)\\n return ans\\n\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n # out = []\\n # count = 0\\n # l = [2**i for i in range(16, 0, -1)]\\n # print(l)\\n # for i in range(n+1):\\n # for pow in range(len(l)):\\n # if i >= l[pow] and i % l[pow] == 0:\\n # print(i, pow, l[pow])\\n # count -= (16-pow)\\n # break\\n # out.append(count)\\n # count += 1\\n # return out\\n if n == 0:\\n return [0]\\n out = []\\n count = 0\\n max_pow = int(log(n,2))\\n l = [2**i for i in range(max_pow, 0, -1)]\\n for i in range(n+1):\\n for pow in range(len(l)):\\n if i >= l[pow] and i % l[pow] == 0:\\n print(i, pow, l[pow])\\n count -= (max_pow-pow)\\n break\\n out.append(count)\\n count += 1\\n return out\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n l = []\\n for i in range(n+1):\\n l.append(Counter(bin(i))['1'])\\n\\n return l\\n\\n \",\n \"runtime\": \"155\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":137,"string":"137"},"mm_list":{"kind":"list like","value":[{"code":"def countSetBits(n):\n count = 0\n # while n > 0:\n # count += n & 1\n # n = n >> 1\n while n > 0:\n n = n & n - 1\n count += 1\n return count\n\n\nclass Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range(n + 1):\n ans.append(countSetBits(i))\n return ans\n","memory":"21800"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n ans = []\n for i in range (n+1):\n ones = 0\n while i > 0:\n ones = ones + i%2\n i = i//2\n ans.append(ones)\n return ans ","memory":"22300"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return map(int.bit_count,range(n+1))","memory":"22400"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return (i.bit_count() for i in range(n+1))","memory":"22500"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n \n for i in range(n+1):\n val = 0\n while i:\n val += i&1\n i >>= 1\n yield val","memory":"22600"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n return [bin(i).count('1') for i in range(n + 1)]","memory":"22600"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res=[]\n for i in range(n+1):\n count=0\n a=to_bin(i)\n for x in a:\n if x==\"1\":\n count+=1\n res.append(count)\n return res\n\ndef to_bin(num):\n if num==0:\n return \"0\"\n bina=\"\"\n while num>0:\n bina=str(num%2)+bina\n num//=2\n return bina","memory":"22700"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n next_power_of_two = 1\n current_number = 1\n above_last_power_of_two = 0\n ans = [0] * (n+1)\n while current_number < n+1:\n if current_number == next_power_of_two:\n ans[current_number] = 1\n next_power_of_two *= 2\n above_last_power_of_two = 1\n else:\n ans[current_number] = 1 + ans[above_last_power_of_two]\n above_last_power_of_two += 1\n current_number += 1\n return ans","memory":"22800"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n\n # if n = 2\n\n # create an array starting at i = 0 that goes to i = n\n # count how many bits at each value i\n\n # array = [0,1,2]\n \n\n res = []\n \n \n # first create a helper to count bits for each i\n\n def helper(val):\n\n bits = 0\n\n while val > 0:\n if val & 1 == 1:\n bits += 1\n \n val = val >> 1\n \n return bits\n\n\n for i in range(0,n + 1):\n res.append(helper(i))\n \n\n return res","memory":"22900"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n res = [0,1]\n if n <= 1:\n return res[:n+1]\n checkpoint = 2\n for i in range(2,n+1):\n res.append(1+res[i-checkpoint])\n if i == checkpoint:\n checkpoint *= 2\n return res\n\n ","memory":"23000"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n l=[]\n for i in range(0,n+1):\n l.append(bin(i)[2:].count('1'))\n return l\n\n","memory":"23100"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n l = [0] * (n + 1)\n for i in range(1, n + 1):\n l[i] = l[i >> 1] + (i & 1)\n return l\n","memory":"23100"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n result=[0]*(n+1)\n if n==0:\n return result\n result[0]=0\n if n>=1:\n result[1]=1\n for x in range(2,n+1):\n if x%2==0:\n result[x]=result[x//2]\n else:\n result[x]=result[x//2]+1\n return result","memory":"23200"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n result = [0]\n while len(result) < n + 1:\n end = len(result) \n for i in range(end):\n result += [result[i] + 1]\n if len(result) >= n + 1:\n break\n return result","memory":"23200"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def countNum(n: int):\n sum = 0\n while n:\n if n % 2 == 1:\n sum += 1\n n = n // 2\n return sum\n res = []\n for i in range(n + 1):\n res.append(countNum(i))\n return res\n \n","memory":"23300"},{"code":"class Solution:\n def countBits(self, n: int) -> List[int]:\n def num_1s(num):\n ones = 0\n while num:\n ones += num % 2\n num = num // 2\n return ones\n\n result = []\n\n for i in range(n+1):\n result.append( num_1s(i) )\n \n return result\n ","memory":"23300"}],"string":"[\n {\n \"code\": \"def countSetBits(n):\\n count = 0\\n # while n > 0:\\n # count += n & 1\\n # n = n >> 1\\n while n > 0:\\n n = n & n - 1\\n count += 1\\n return count\\n\\n\\nclass Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range(n + 1):\\n ans.append(countSetBits(i))\\n return ans\\n\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n ans = []\\n for i in range (n+1):\\n ones = 0\\n while i > 0:\\n ones = ones + i%2\\n i = i//2\\n ans.append(ones)\\n return ans \",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return map(int.bit_count,range(n+1))\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return (i.bit_count() for i in range(n+1))\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n \\n for i in range(n+1):\\n val = 0\\n while i:\\n val += i&1\\n i >>= 1\\n yield val\",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n return [bin(i).count('1') for i in range(n + 1)]\",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res=[]\\n for i in range(n+1):\\n count=0\\n a=to_bin(i)\\n for x in a:\\n if x==\\\"1\\\":\\n count+=1\\n res.append(count)\\n return res\\n\\ndef to_bin(num):\\n if num==0:\\n return \\\"0\\\"\\n bina=\\\"\\\"\\n while num>0:\\n bina=str(num%2)+bina\\n num//=2\\n return bina\",\n \"memory\": \"22700\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n next_power_of_two = 1\\n current_number = 1\\n above_last_power_of_two = 0\\n ans = [0] * (n+1)\\n while current_number < n+1:\\n if current_number == next_power_of_two:\\n ans[current_number] = 1\\n next_power_of_two *= 2\\n above_last_power_of_two = 1\\n else:\\n ans[current_number] = 1 + ans[above_last_power_of_two]\\n above_last_power_of_two += 1\\n current_number += 1\\n return ans\",\n \"memory\": \"22800\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n\\n # if n = 2\\n\\n # create an array starting at i = 0 that goes to i = n\\n # count how many bits at each value i\\n\\n # array = [0,1,2]\\n \\n\\n res = []\\n \\n \\n # first create a helper to count bits for each i\\n\\n def helper(val):\\n\\n bits = 0\\n\\n while val > 0:\\n if val & 1 == 1:\\n bits += 1\\n \\n val = val >> 1\\n \\n return bits\\n\\n\\n for i in range(0,n + 1):\\n res.append(helper(i))\\n \\n\\n return res\",\n \"memory\": \"22900\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n res = [0,1]\\n if n <= 1:\\n return res[:n+1]\\n checkpoint = 2\\n for i in range(2,n+1):\\n res.append(1+res[i-checkpoint])\\n if i == checkpoint:\\n checkpoint *= 2\\n return res\\n\\n \",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n l=[]\\n for i in range(0,n+1):\\n l.append(bin(i)[2:].count('1'))\\n return l\\n\\n\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n l = [0] * (n + 1)\\n for i in range(1, n + 1):\\n l[i] = l[i >> 1] + (i & 1)\\n return l\\n\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n result=[0]*(n+1)\\n if n==0:\\n return result\\n result[0]=0\\n if n>=1:\\n result[1]=1\\n for x in range(2,n+1):\\n if x%2==0:\\n result[x]=result[x//2]\\n else:\\n result[x]=result[x//2]+1\\n return result\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n result = [0]\\n while len(result) < n + 1:\\n end = len(result) \\n for i in range(end):\\n result += [result[i] + 1]\\n if len(result) >= n + 1:\\n break\\n return result\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def countNum(n: int):\\n sum = 0\\n while n:\\n if n % 2 == 1:\\n sum += 1\\n n = n // 2\\n return sum\\n res = []\\n for i in range(n + 1):\\n res.append(countNum(i))\\n return res\\n \\n\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"class Solution:\\n def countBits(self, n: int) -> List[int]:\\n def num_1s(num):\\n ones = 0\\n while num:\\n ones += num % 2\\n num = num // 2\\n return ones\\n\\n result = []\\n\\n for i in range(n+1):\\n result.append( num_1s(i) )\\n \\n return result\\n \",\n \"memory\": \"23300\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":16,"string":"16"}}},{"rowIdx":267,"cells":{"question_id":{"kind":"number","value":341,"string":"341"},"name":{"kind":"string","value":"flatten-nested-list-iterator"},"content":{"kind":"string","value":"<p>You are given a nested list of integers <code>nestedList</code>. Each element is either an integer or a list whose elements may also be integers or other lists. Implement an iterator to flatten it.</p>\n\n<p>Implement the <code>NestedIterator</code> class:</p>\n\n<ul>\n\t<li><code>NestedIterator(List<NestedInteger> nestedList)</code> Initializes the iterator with the nested list <code>nestedList</code>.</li>\n\t<li><code>int next()</code> Returns the next integer in the nested list.</li>\n\t<li><code>boolean hasNext()</code> Returns <code>true</code> if there are still some integers in the nested list and <code>false</code> otherwise.</li>\n</ul>\n\n<p>Your code will be tested with the following pseudocode:</p>\n\n<pre>\ninitialize iterator with nestedList\nres = []\nwhile iterator.hasNext()\n append iterator.next() to the end of res\nreturn res\n</pre>\n\n<p>If <code>res</code> matches the expected flattened list, then your code will be judged as correct.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nestedList = [[1,1],2,[1,1]]\n<strong>Output:</strong> [1,1,2,1,1]\n<strong>Explanation:</strong> By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,1,2,1,1].\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nestedList = [1,[4,[6]]]\n<strong>Output:</strong> [1,4,6]\n<strong>Explanation:</strong> By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,4,6].\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nestedList.length <= 500</code></li>\n\t<li>The values of the integers in the nested list is in the range <code>[-10<sup>6</sup>, 10<sup>6</sup>]</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":64.77831239481274,"string":"64.778312"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["stack","tree","depth-first-search","design","queue","iterator"],"string":"[\n \"stack\",\n \"tree\",\n \"depth-first-search\",\n \"design\",\n \"queue\",\n \"iterator\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"29\", 0.0423], [\"30\", 0.0423], [\"32\", 0.0423], [\"33\", 0.1268], [\"34\", 0.1691], [\"35\", 0.3804], [\"36\", 0.2959], [\"37\", 0.2113], [\"38\", 0.5495], [\"39\", 0.803], [\"40\", 1.0144], [\"41\", 1.3525], [\"42\", 1.9442], [\"43\", 2.3246], [\"44\", 2.7473], [\"45\", 3.4235], [\"46\", 4.2265], [\"47\", 4.3533], [\"48\", 4.9451], [\"49\", 6.2553], [\"50\", 6.6357], [\"51\", 6.9738], [\"52\", 6.4243], [\"53\", 6.3821], [\"54\", 6.2553], [\"55\", 4.8605], [\"56\", 5.4522], [\"57\", 4.1843], [\"58\", 4.776], [\"59\", 3.0008], [\"60\", 2.6627], [\"61\", 1.1412]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18300\", 0.0423], [\"18400\", 0.0845], [\"18500\", 0.5917], [\"18600\", 1.2257], [\"18700\", 0.2959], [\"18800\", 0.2959], [\"18900\", 0.0845], [\"19000\", 0.1268], [\"19100\", 0.4649], [\"19200\", 5.1141], [\"19300\", 34.8267], [\"19400\", 28.4024], [\"19500\", 7.8191]]}"},"rt_list":{"kind":"list like","value":[{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.list = self.flatten(nestedList)\n self.i = 0\n \n def flatten(self, nestedList):\n res = []\n for node in nestedList:\n if node.isInteger():\n res.append(node.getInteger())\n else:\n res.extend(self.flatten(node.getList()))\n return res\n \n def next(self) -> int:\n res = self.list[self.i]\n self.i += 1\n return res\n \n \n def hasNext(self) -> bool:\n return self.i < len(self.list)\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"29"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.list = []\n \n def flatten(nestedList):\n for elem in nestedList:\n if elem.isInteger():\n self.list.append(elem.getInteger())\n else:\n flatten(elem.getList())\n \n flatten(nestedList)\n\n self.ind = -1\n \n def next(self) -> int:\n self.ind += 1\n return self.list[self.ind]\n \n def hasNext(self) -> bool:\n return self.ind + 1 < len(self.list)\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"30"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n \"\"\"\n Flatten the nested iterator\n Goal is to flatten the nested list \n\n \"\"\"\n self.nested_list = nestedList\n self.flattened_list = []\n self.c = 0\n self.dfs_(self.nested_list)\n self.idx = 0 \n def dfs_(self,curr_list):\n for i in curr_list:\n if i.isInteger() == True:\n self.c += 1 \n self.flattened_list.append(i.getInteger())\n else:\n self.dfs_(i.getList())\n\n def next(self) -> int:\n res= self.flattened_list[self.idx]\n self.idx +=1 \n return res\n\n def hasNext(self) -> bool:\n \"\"\"\n Stack feeling \n \"\"\"\n return self.idx < len(self.flattened_list)\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"32"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.nested_list = []\n self.unwrapList(nestedList)\n self.index_val = 0\n #print (self.nested_list)\n\n def unwrapList(self, nestedList):\n #print (nestedList)\n for val in nestedList:\n if val.isInteger():\n self.nested_list.append(val.getInteger())\n else:\n self.unwrapList(val.getList())\n \n def next(self) -> int:\n val = self.nested_list[self.index_val]\n self.index_val += 1\n return val\n\n \n \n def hasNext(self) -> bool:\n return self.index_val < len(self.nested_list)\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"33"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.flattened_list = []\n self.flatten(nestedList)\n self.index = 0\n\n def flatten(self, nestedList):\n for element in nestedList:\n if element.isInteger():\n self.flattened_list.append(element.getInteger())\n else:\n self.flatten(element.getList())\n \n def next(self) -> int:\n result = self.flattened_list[self.index]\n self.index += 1\n return result\n \n def hasNext(self) -> bool:\n return self.index < len(self.flattened_list)\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"34"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = nestedList[::-1]\n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n while self.stack and not self.stack[-1].isInteger():\n x = self.stack.pop().getList()\n while x:\n self.stack.append(x.pop())\n return len(self.stack) > 0","runtime":"35"},{"code":"class NestedIterator:\n def __init__(self, nestedList: list[NestedInteger]):\n self.q = collections.deque()\n self.addInteger(nestedList)\n\n def next(self) -> int:\n return self.q.popleft()\n\n def hasNext(self) -> bool:\n return self.q\n\n def addInteger(self, nestedList: list[NestedInteger]) -> None:\n for ni in nestedList:\n if ni.isInteger():\n self.q.append(ni.getInteger())\n else:\n self.addInteger(ni.getList())","runtime":"36"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n self.flattenList(nestedList)\n \n\n def flattenList(self, nestedList):\n for tmp in nestedList[::-1]:\n self.stack.append(tmp)\n \n \n def next(self) -> int:\n return self.stack.pop().getInteger()\n \n \n def hasNext(self) -> bool:\n while self.stack:\n if self.stack[-1].isInteger():\n return True \n top_list = self.stack.pop()\n self.flattenList(top_list.getList())\n return False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"37"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.generator = self.init_generator(nestedList)\n try:\n self.peek = next(self.generator)\n except StopIteration:\n self.peek = None\n\n \n def init_generator(self, nestedList: [NestedInteger]):\n for element in nestedList:\n if element.isInteger():\n yield element.getInteger()\n else:\n yield from self.init_generator(element.getList())\n \n \n def next(self) -> int:\n res = self.peek\n try:\n self.peek = next(self.generator)\n except StopIteration:\n self.peek = None\n return res \n \n def hasNext(self) -> bool:\n if self.peek is None:\n return False\n else:\n return True\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"38"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n # Initialize an empty stack to store nested lists\n self.stack = nestedList[::-1]\n # Initialize a variable to store the next integer\n self.next_int = None\n # Initialize a variable to store the iterator\n self.iterator = None\n \n \n \n def next(self) -> int:\n # If the next integer is already stored, return it\n \n if self.next_int is not None:\n next_int = self.next_int\n self.next_int = None\n return next_int\n \n # If the next integer is not stored, call hasNext to get the next integer\n \n return self.hasNext()\n \n def hasNext(self) -> bool:\n # If the next integer is already stored, return True\n if self.next_int is not None:\n return True\n # If the next integer is not stored, get the next integer\n \n while self.stack:\n # Get the top element of the stack\n top = self.stack.pop()\n # If the top element is an integer, store it and return True\n if top.isInteger():\n self.next_int = top.getInteger()\n return True\n # If the top element is a nested list, push its elements to the stack\n for i in top.getList()[::-1]:\n self.stack.append(i)\n \n # If there are no more elements to process, return False\n return False\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"38"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def isInteger(self) -> bool:\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n \"\"\"\n pass\n\n def getInteger(self) -> int:\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n \"\"\"\n pass\n\n def getList(self) -> [NestedInteger]:\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n \"\"\"\n pass\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n raise StopIteration \n \n \n def hasNext(self) -> bool:\n while self.stack:\n top=self.stack[-1]\n if top.isInteger():\n return True\n self.stack.pop()\n self.stack.extend(reversed(top.getList()))\n return False \n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"39"},{"code":"# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.flattened_list = self._flatten(nestedList)\n self.index = 0\n\n def _flatten(self, nestedList):\n flattened = []\n for nested in nestedList:\n if nested.isInteger():\n flattened.append(nested.getInteger())\n else:\n flattened.extend(self._flatten(nested.getList()))\n return flattened\n\n def next(self) -> int:\n result = self.flattened_list[self.index]\n self.index += 1\n return result\n\n def hasNext(self) -> bool:\n return self.index < len(self.flattened_list)\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"43"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def isInteger(self) -> bool:\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n \"\"\"\n pass\n\n def getInteger(self) -> int:\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n \"\"\"\n pass\n\n def getList(self) -> List['NestedInteger']:\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n \"\"\"\n pass\n\nclass NestedIterator:\n def __init__(self, nestedList: List[NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n def next(self) -> int:\n \"\"\"\n @return the next integer in the nested list.\n \"\"\"\n if self.hasNext():\n return self.stack.pop().getInteger()\n raise StopIteration\n \n def hasNext(self) -> bool:\n \"\"\"\n @return True if there are more integers in the nested list.\n \"\"\"\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n self.stack.pop()\n self.stack.extend(reversed(top.getList()))\n return False\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"44"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def isInteger(self) -> bool:\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n \"\"\"\n\n def getInteger(self) -> int:\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n \"\"\"\n\n def getList(self) -> [NestedInteger]:\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.arr = []\n self.foo(nestedList)\n self.arr = self.arr[::-1]\n \n def next(self) -> int:\n return self.arr.pop()\n \n def hasNext(self) -> bool:\n return True if self.arr else False\n \n def foo(self, nestedList):\n for i in nestedList:\n if i.isInteger():\n self.arr.append(i.getInteger())\n else:\n self.foo(i.getList())\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"44"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = nestedList[::-1]\n \n def next(self) -> int:\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n while self.stack:\n node = self.stack[-1]\n if node.isInteger():\n return True\n self.stack = self.stack[:-1] + node.getList()[::-1]\n return False\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"45"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.q = deque()\n\n def flatten(nestedList):\n for el in nestedList:\n if el.isInteger():\n self.q.append(el.getInteger())\n else:\n flatten(el.getList())\n flatten(nestedList)\n \n def next(self) -> int:\n return self.q.popleft()\n \n def hasNext(self) -> bool:\n return len(self.q)\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"45"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n\n item_stack = []\n index_stack = []\n\n def __init__(self, nestedList: [NestedInteger]):\n self.item_stack.append(nestedList)\n self.index_stack.append(0)\n\n def _pop_stack(self):\n while(len(self.item_stack)):\n cur_idx = self.index_stack[-1]\n cur_ele = self.item_stack[-1]\n\n if(cur_idx >= len(cur_ele)):\n self.index_stack.pop(-1)\n self.item_stack.pop(-1)\n continue\n \n if(cur_ele[cur_idx].isInteger()):\n break\n\n self.index_stack[-1] += 1\n self.index_stack.append(0)\n self.item_stack.append(cur_ele[cur_idx].getList())\n\n def next(self) -> int:\n self._pop_stack()\n lst = self.item_stack[-1]\n idx = self.index_stack[-1]\n self.index_stack[-1] += 1\n\n return lst[idx].getInteger()\n\n def hasNext(self) -> bool:\n self._pop_stack()\n return len(self.item_stack) > 0\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"46"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.nums=[]\n def trav(lst):\n for i in lst:\n if type(i)==list:\n trav(i)\n elif i.isInteger():\n self.nums.append(i.getInteger())\n else:\n trav(i.getList())\n trav([nestedList])\n self.pointer=0\n \n \n \n def next(self) -> int:\n res=self.nums[self.pointer]\n self.pointer+=1\n return res\n\n \n\n \n \n def hasNext(self) -> bool:\n return self.pointer<len(self.nums)\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"46"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\n\ndef to_array(nested: [NestedInteger]) -> [int]:\n ret = []\n for ele in nested:\n if ele.isInteger():\n ret.append(ele.getInteger())\n else:\n ret.extend(to_array(ele.getList()))\n \n return ret\n \nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.array = to_array(nestedList)\n self.idx = 0\n self.n = len(self.array)\n \n def next(self) -> int:\n self.idx += 1\n return self.array[self.idx - 1]\n \n def hasNext(self) -> bool:\n return self.idx < self.n\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"47"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator(object):\n\n def __init__(self, nestedList):\n self.stack = [[nestedList, 0]]\n\n def next(self):\n self.hasNext()\n nestedList, i = self.stack[-1]\n self.stack[-1][1] += 1\n return nestedList[i].getInteger()\n \n def hasNext(self):\n s = self.stack\n while s:\n nestedList, i = s[-1]\n if i == len(nestedList):\n s.pop()\n else:\n x = nestedList[i]\n if x.isInteger():\n return True\n s[-1][1] += 1\n s.append([x.getList(), 0])\n return False\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"48"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.list = self.unflatten_list(nestedList)\n self.i = 0\n \n def next(self) -> int:\n val = self.list[self.i]\n self.i += 1\n return val\n \n \n def hasNext(self) -> bool:\n return self.i < len(self.list)\n\n def unflatten_list(self, nestedList: [NestedInteger]):\n result = []\n def recursive(list_nested_lists):\n for nestedList in list_nested_lists: \n if nestedList.isInteger():\n result.append(nestedList.getInteger())\n else:\n recursive(nestedList.getList())\n recursive(nestedList)\n return result\n\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"49"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n def dfs(nodes):\n for node in nodes:\n if node.isInteger():\n yield node.getInteger()\n else:\n yield from dfs(node.getList())\n self.iter = iter(dfs(nestedList))\n self.nxt = next(self.iter, None)\n\n\n def next(self) -> int:\n result, self.nxt = self.nxt, next(self.iter, None)\n return result\n\n def hasNext(self) -> bool:\n return self.nxt is not None\n\n\n\n\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"49"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.listToFlatten = []\n self.flattenedList = []\n\n for element in reversed(nestedList):\n self.listToFlatten.append(element)\n\n self.flattenList(self.listToFlatten)\n self.currIndex = 0\n\n def flattenList(self, listToFlatten):\n while listToFlatten:\n currElem = listToFlatten.pop()\n if currElem.isInteger() == True:\n self.flattenedList.append(currElem.getInteger())\n else:\n currElemList = currElem.getList()\n for elem in reversed(currElemList):\n listToFlatten.append(elem)\n \n def next(self) -> int:\n retVal = self.flattenedList[self.currIndex]\n self.currIndex += 1\n return retVal\n \n def hasNext(self) -> bool:\n if self.currIndex < len(self.flattenedList):\n return True\n\n return False\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"50"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n def flatten(nL):\n result=[]\n for l in nL:\n if l.isInteger():\n result.append(l.getInteger())\n else:\n result.extend(flatten(l.getList()))\n return result\n self.flattened=flatten(nestedList)\n self.index=0\n \n \n def next(self) -> int:\n self.index+=1\n return self.flattened[self.index-1]\n \n \n def hasNext(self) -> bool:\n return self.index<len(self.flattened)\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"50"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n\n item_stack = []\n index_stack = []\n\n def __init__(self, nestedList: [NestedInteger]):\n self.item_stack.append(nestedList)\n self.index_stack.append(0)\n\n def _pop_stack(self):\n while(len(self.item_stack)):\n lst = self.item_stack[-1]\n idx = self.index_stack[-1]\n\n if(idx >= len(lst)):\n self.item_stack.pop(-1)\n self.index_stack.pop(-1)\n continue\n if(lst[idx].isInteger()):\n break\n\n self.index_stack[-1] += 1\n self.index_stack.append(0)\n self.item_stack.append(lst[idx].getList())\n\n def next(self) -> int:\n self._pop_stack()\n lst = self.item_stack[-1]\n idx = self.index_stack[-1]\n self.index_stack[-1] += 1\n return lst[idx].getInteger()\n\n def hasNext(self) -> bool:\n self._pop_stack()\n return len(self.item_stack) > 0\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"51"},{"code":"class NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = [] #create empty stack\n self.flatten(nestedList) #flattens nested lists\n \n def flatten(self, nestedList):\n for elem in reversed(nestedList): \n if elem.isInteger(): #check for element in lists\n self.stack.append(elem) #append the elem in stack\n else:\n self.flatten(elem.getList()) #if it is nested list then flatten\n\n def next(self) -> int:\n return self.stack.pop() #pop the last elem in stack\n\n \n def hasNext(self) -> bool:\n return len(self.stack) > 0 #checks if stack is empty or not\n\n","runtime":"51"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n\n \n def hasNext(self) -> bool:\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n topList = self.stack.pop()\n self.stack.extend(reversed(topList.getList()))\n return False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"52"},{"code":"class NestedInteger:\n # The NestedInteger class definition is assumed to be provided\n def isInteger(self):\n # Returns True if this NestedInteger holds a single integer, False if it holds a nested list\n pass\n\n def getInteger(self):\n # Returns the single integer that this NestedInteger holds, if it holds an integer\n pass\n\n def getList(self):\n # Returns the nested list that this NestedInteger holds, if it holds a nested list\n pass\n\nclass NestedIterator:\n def __init__(self, nestedList):\n # Initialize with the given nestedList\n self.stack = []\n self._flatten(nestedList)\n \n def _flatten(self, nestedList):\n # Push all elements of the nestedList onto the stack\n for item in reversed(nestedList):\n self.stack.append(item)\n \n def next(self):\n # Ensure there is a next integer\n if self.hasNext():\n return self.stack.pop().getInteger()\n else:\n raise StopIteration\n \n def hasNext(self):\n # Flatten the stack until we find an integer or the stack is empty\n while self.stack and not self.stack[-1].isInteger():\n nestedList = self.stack.pop().getList()\n self._flatten(nestedList)\n \n # If stack is not empty, the top item is an integer\n return bool(self.stack)\n","runtime":"52"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n\n \n def hasNext(self) -> bool:\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n self.stack.pop()\n self.stack.extend(reversed(top.getList()))\n return False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"53"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n self.flatten(nestedList)\n\n def flatten(self, nestedList):\n for item in reversed(nestedList):\n self.stack.append(item)\n\n def next(self) -> int:\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n self.stack.pop()\n self.flatten(top.getList())\n return False\n \n return True\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"53"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n for e in nestedList[::-1]:\n self.stack.append(e)\n \n def next(self) -> int:\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n while self.stack:\n if self.stack[-1].isInteger():\n return True\n else:\n for e in self.stack.pop().getList()[::-1]:\n self.stack.append(e)\n return False\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"54"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\nfrom collections import deque\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = deque()\n n = len(nestedList)\n for i in range(n-1, -1, -1):\n self.stack.append(nestedList[i])\n \n def next(self) -> int:\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n if not self.stack:\n return False\n while self.stack and not self.stack[-1].isInteger():\n curr = self.stack.pop()\n curr_list = curr.getList()\n for i in range(len(curr_list)-1, -1, -1):\n self.stack.append(curr_list[i])\n return self.stack and self.stack[-1].isInteger()\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"54"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.list = nestedList\n self.stack = [[self.list, 0]]\n \n def next(self) -> int:\n if self.hasNext():\n curList, idx = self.stack.pop()\n self.stack.append([curList, idx + 1])\n return curList[idx].getInteger()\n raise Exception()\n \n def hasNext(self) -> bool:\n stack = self.stack\n\n while stack:\n curList, idx = stack[-1]\n if idx == len(curList):\n stack.pop()\n continue\n if not curList[idx].isInteger():\n stack[-1][1] += 1\n stack.append([curList[idx].getList(), 0])\n continue\n break\n\n return len(stack) > 0\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"55"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.nl = deque(nestedList[::-1])\n \n \n def next(self) -> int:\n while self.nl:\n cur = self.nl.pop()\n\n if cur.isInteger():\n return cur.getInteger()\n\n for val in cur.getList()[::-1]:\n self.nl.append(val)\n \n \n def hasNext(self) -> bool:\n return self.eval(self.nl)\n\n def eval(self, curList):\n for val in curList:\n if val.isInteger() or self.eval(val.getList()):\n return True\n\n return False\n\n \n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"55"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n\n \n def hasNext(self) -> bool:\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n topList = self.stack.pop()\n self.stack.extend(reversed(topList.getList()))\n return False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"56"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n if not nestedList:\n raise ValueError()\n \n self._deque = collections.deque(nestedList)\n \n def next(self) -> int:\n if not self.hasNext():\n raise ValueError()\n\n return self._deque.popleft().getInteger()\n \n def hasNext(self) -> bool:\n while self._deque and not self._deque[0].isInteger():\n nested = self._deque.popleft().getList()\n for i in reversed(nested):\n self._deque.appendleft(i)\n\n return len(self._deque) != 0\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"56"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n for n in nestedList[::-1]:\n self.stack.append(n)\n \n def next(self) -> int:\n self.make_stack_top_an_integer()\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n self.make_stack_top_an_integer()\n return len(self.stack) > 0\n\n def make_stack_top_an_integer(self):\n while self.stack and not self.stack[-1].isInteger():\n curr = self.stack.pop().getList()[::-1]\n for n in curr:\n self.stack.append(n)\n\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"57"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n for n in nestedList[::-1]:\n self.stack.append(n)\n \n def next(self) -> int:\n self.make_stack_top_an_integer()\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n self.make_stack_top_an_integer()\n return len(self.stack) > 0\n\n def make_stack_top_an_integer(self):\n while self.stack and not self.stack[-1].isInteger():\n curr = self.stack.pop().getList()[::-1]\n for n in curr:\n self.stack.append(n)\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"57"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.list = []\n for e in nestedList:\n if e.isInteger():\n self.list.append(e.getInteger())\n else:\n for e in e.getList():\n it = NestedIterator([e])\n if it.hasNext():\n self.list.append(it)\n self.cap = len(self.list)\n self.ind = 0\n \n def next(self) -> int:\n if isinstance(self.list[self.ind], int):\n self.ind += 1\n return self.list[self.ind - 1]\n else:\n val = self.list[self.ind].next()\n if not self.list[self.ind].hasNext():\n self.ind += 1\n return val\n \n def hasNext(self) -> bool:\n return self.ind < self.cap\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"58"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.positions = [(nestedList, -1)]\n self.next_int = None\n self._move_next()\n\n def _move_next(self):\n if len(self.positions) == 0:\n return\n top = self.positions.pop()\n if len(top[0]) <= top[1] + 1:\n self._move_next()\n return\n next_item = top[0][top[1] + 1]\n self.positions.append((top[0], top[1] + 1))\n if next_item.isInteger():\n self.next_int = next_item\n return\n self.positions.append((next_item.getList(), -1))\n self._move_next()\n\n \n def next(self) -> int:\n res = self.next_int.getInteger()\n self.next_int = None\n self._move_next()\n return res\n \n \n def hasNext(self) -> bool:\n return self.next_int is not None\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"59"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList):\n self.stack = nestedList[::-1]\n def next(self):\n return self.stack.pop()\n def hasNext(self):\n while self.stack and not self.stack[-1].isInteger():\n tmp = self.stack.pop()\n self.stack += tmp.getList()[::-1]\n return len(self.stack) > 0\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"59"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.list = []\n for e in nestedList:\n if e.isInteger():\n self.list.append(e.getInteger())\n else:\n for e in e.getList():\n it = NestedIterator([e])\n if it.hasNext():\n self.list.append(it)\n self.cap = len(self.list)\n self.ind = 0\n \n def next(self) -> int:\n if isinstance(self.list[self.ind], int):\n self.ind += 1\n return self.list[self.ind - 1]\n else:\n val = self.list[self.ind].next()\n if not self.list[self.ind].hasNext():\n self.ind += 1\n return val\n \n def hasNext(self) -> bool:\n return self.ind < self.cap\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","runtime":"60"},{"code":"class NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n # Initialize a stack and push the nested list in reverse order\n self.stack = nestedList[::-1]\n\n def next(self) -> int:\n # Since hasNext ensures the top of the stack is an integer, we pop and return it\n return self.stack.pop()\n\n def hasNext(self) -> bool:\n # Continue processing until the top of the stack is an integer\n while self.stack:\n top = self.stack[-1]\n if top.isInteger(): # If it's an integer, we are ready to return it\n return True\n # If it's a list, pop it and push its elements onto the stack in reverse order\n self.stack.pop()\n self.stack.extend(top.getList()[::-1])\n return False\n","runtime":"61"}],"string":"[\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.list = self.flatten(nestedList)\\n self.i = 0\\n \\n def flatten(self, nestedList):\\n res = []\\n for node in nestedList:\\n if node.isInteger():\\n res.append(node.getInteger())\\n else:\\n res.extend(self.flatten(node.getList()))\\n return res\\n \\n def next(self) -> int:\\n res = self.list[self.i]\\n self.i += 1\\n return res\\n \\n \\n def hasNext(self) -> bool:\\n return self.i < len(self.list)\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.list = []\\n \\n def flatten(nestedList):\\n for elem in nestedList:\\n if elem.isInteger():\\n self.list.append(elem.getInteger())\\n else:\\n flatten(elem.getList())\\n \\n flatten(nestedList)\\n\\n self.ind = -1\\n \\n def next(self) -> int:\\n self.ind += 1\\n return self.list[self.ind]\\n \\n def hasNext(self) -> bool:\\n return self.ind + 1 < len(self.list)\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n \\\"\\\"\\\"\\n Flatten the nested iterator\\n Goal is to flatten the nested list \\n\\n \\\"\\\"\\\"\\n self.nested_list = nestedList\\n self.flattened_list = []\\n self.c = 0\\n self.dfs_(self.nested_list)\\n self.idx = 0 \\n def dfs_(self,curr_list):\\n for i in curr_list:\\n if i.isInteger() == True:\\n self.c += 1 \\n self.flattened_list.append(i.getInteger())\\n else:\\n self.dfs_(i.getList())\\n\\n def next(self) -> int:\\n res= self.flattened_list[self.idx]\\n self.idx +=1 \\n return res\\n\\n def hasNext(self) -> bool:\\n \\\"\\\"\\\"\\n Stack feeling \\n \\\"\\\"\\\"\\n return self.idx < len(self.flattened_list)\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.nested_list = []\\n self.unwrapList(nestedList)\\n self.index_val = 0\\n #print (self.nested_list)\\n\\n def unwrapList(self, nestedList):\\n #print (nestedList)\\n for val in nestedList:\\n if val.isInteger():\\n self.nested_list.append(val.getInteger())\\n else:\\n self.unwrapList(val.getList())\\n \\n def next(self) -> int:\\n val = self.nested_list[self.index_val]\\n self.index_val += 1\\n return val\\n\\n \\n \\n def hasNext(self) -> bool:\\n return self.index_val < len(self.nested_list)\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.flattened_list = []\\n self.flatten(nestedList)\\n self.index = 0\\n\\n def flatten(self, nestedList):\\n for element in nestedList:\\n if element.isInteger():\\n self.flattened_list.append(element.getInteger())\\n else:\\n self.flatten(element.getList())\\n \\n def next(self) -> int:\\n result = self.flattened_list[self.index]\\n self.index += 1\\n return result\\n \\n def hasNext(self) -> bool:\\n return self.index < len(self.flattened_list)\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = nestedList[::-1]\\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n while self.stack and not self.stack[-1].isInteger():\\n x = self.stack.pop().getList()\\n while x:\\n self.stack.append(x.pop())\\n return len(self.stack) > 0\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class NestedIterator:\\n def __init__(self, nestedList: list[NestedInteger]):\\n self.q = collections.deque()\\n self.addInteger(nestedList)\\n\\n def next(self) -> int:\\n return self.q.popleft()\\n\\n def hasNext(self) -> bool:\\n return self.q\\n\\n def addInteger(self, nestedList: list[NestedInteger]) -> None:\\n for ni in nestedList:\\n if ni.isInteger():\\n self.q.append(ni.getInteger())\\n else:\\n self.addInteger(ni.getList())\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n self.flattenList(nestedList)\\n \\n\\n def flattenList(self, nestedList):\\n for tmp in nestedList[::-1]:\\n self.stack.append(tmp)\\n \\n \\n def next(self) -> int:\\n return self.stack.pop().getInteger()\\n \\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n if self.stack[-1].isInteger():\\n return True \\n top_list = self.stack.pop()\\n self.flattenList(top_list.getList())\\n return False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.generator = self.init_generator(nestedList)\\n try:\\n self.peek = next(self.generator)\\n except StopIteration:\\n self.peek = None\\n\\n \\n def init_generator(self, nestedList: [NestedInteger]):\\n for element in nestedList:\\n if element.isInteger():\\n yield element.getInteger()\\n else:\\n yield from self.init_generator(element.getList())\\n \\n \\n def next(self) -> int:\\n res = self.peek\\n try:\\n self.peek = next(self.generator)\\n except StopIteration:\\n self.peek = None\\n return res \\n \\n def hasNext(self) -> bool:\\n if self.peek is None:\\n return False\\n else:\\n return True\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n # Initialize an empty stack to store nested lists\\n self.stack = nestedList[::-1]\\n # Initialize a variable to store the next integer\\n self.next_int = None\\n # Initialize a variable to store the iterator\\n self.iterator = None\\n \\n \\n \\n def next(self) -> int:\\n # If the next integer is already stored, return it\\n \\n if self.next_int is not None:\\n next_int = self.next_int\\n self.next_int = None\\n return next_int\\n \\n # If the next integer is not stored, call hasNext to get the next integer\\n \\n return self.hasNext()\\n \\n def hasNext(self) -> bool:\\n # If the next integer is already stored, return True\\n if self.next_int is not None:\\n return True\\n # If the next integer is not stored, get the next integer\\n \\n while self.stack:\\n # Get the top element of the stack\\n top = self.stack.pop()\\n # If the top element is an integer, store it and return True\\n if top.isInteger():\\n self.next_int = top.getInteger()\\n return True\\n # If the top element is a nested list, push its elements to the stack\\n for i in top.getList()[::-1]:\\n self.stack.append(i)\\n \\n # If there are no more elements to process, return False\\n return False\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def isInteger(self) -> bool:\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n \\\"\\\"\\\"\\n pass\\n\\n def getInteger(self) -> int:\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n \\\"\\\"\\\"\\n pass\\n\\n def getList(self) -> [NestedInteger]:\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n \\\"\\\"\\\"\\n pass\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n raise StopIteration \\n \\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n top=self.stack[-1]\\n if top.isInteger():\\n return True\\n self.stack.pop()\\n self.stack.extend(reversed(top.getList()))\\n return False \\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.flattened_list = self._flatten(nestedList)\\n self.index = 0\\n\\n def _flatten(self, nestedList):\\n flattened = []\\n for nested in nestedList:\\n if nested.isInteger():\\n flattened.append(nested.getInteger())\\n else:\\n flattened.extend(self._flatten(nested.getList()))\\n return flattened\\n\\n def next(self) -> int:\\n result = self.flattened_list[self.index]\\n self.index += 1\\n return result\\n\\n def hasNext(self) -> bool:\\n return self.index < len(self.flattened_list)\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def isInteger(self) -> bool:\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n \\\"\\\"\\\"\\n pass\\n\\n def getInteger(self) -> int:\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n \\\"\\\"\\\"\\n pass\\n\\n def getList(self) -> List['NestedInteger']:\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n \\\"\\\"\\\"\\n pass\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: List[NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n def next(self) -> int:\\n \\\"\\\"\\\"\\n @return the next integer in the nested list.\\n \\\"\\\"\\\"\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n raise StopIteration\\n \\n def hasNext(self) -> bool:\\n \\\"\\\"\\\"\\n @return True if there are more integers in the nested list.\\n \\\"\\\"\\\"\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n self.stack.pop()\\n self.stack.extend(reversed(top.getList()))\\n return False\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def isInteger(self) -> bool:\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n \\\"\\\"\\\"\\n\\n def getInteger(self) -> int:\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n \\\"\\\"\\\"\\n\\n def getList(self) -> [NestedInteger]:\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.arr = []\\n self.foo(nestedList)\\n self.arr = self.arr[::-1]\\n \\n def next(self) -> int:\\n return self.arr.pop()\\n \\n def hasNext(self) -> bool:\\n return True if self.arr else False\\n \\n def foo(self, nestedList):\\n for i in nestedList:\\n if i.isInteger():\\n self.arr.append(i.getInteger())\\n else:\\n self.foo(i.getList())\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = nestedList[::-1]\\n \\n def next(self) -> int:\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n node = self.stack[-1]\\n if node.isInteger():\\n return True\\n self.stack = self.stack[:-1] + node.getList()[::-1]\\n return False\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.q = deque()\\n\\n def flatten(nestedList):\\n for el in nestedList:\\n if el.isInteger():\\n self.q.append(el.getInteger())\\n else:\\n flatten(el.getList())\\n flatten(nestedList)\\n \\n def next(self) -> int:\\n return self.q.popleft()\\n \\n def hasNext(self) -> bool:\\n return len(self.q)\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n\\n item_stack = []\\n index_stack = []\\n\\n def __init__(self, nestedList: [NestedInteger]):\\n self.item_stack.append(nestedList)\\n self.index_stack.append(0)\\n\\n def _pop_stack(self):\\n while(len(self.item_stack)):\\n cur_idx = self.index_stack[-1]\\n cur_ele = self.item_stack[-1]\\n\\n if(cur_idx >= len(cur_ele)):\\n self.index_stack.pop(-1)\\n self.item_stack.pop(-1)\\n continue\\n \\n if(cur_ele[cur_idx].isInteger()):\\n break\\n\\n self.index_stack[-1] += 1\\n self.index_stack.append(0)\\n self.item_stack.append(cur_ele[cur_idx].getList())\\n\\n def next(self) -> int:\\n self._pop_stack()\\n lst = self.item_stack[-1]\\n idx = self.index_stack[-1]\\n self.index_stack[-1] += 1\\n\\n return lst[idx].getInteger()\\n\\n def hasNext(self) -> bool:\\n self._pop_stack()\\n return len(self.item_stack) > 0\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.nums=[]\\n def trav(lst):\\n for i in lst:\\n if type(i)==list:\\n trav(i)\\n elif i.isInteger():\\n self.nums.append(i.getInteger())\\n else:\\n trav(i.getList())\\n trav([nestedList])\\n self.pointer=0\\n \\n \\n \\n def next(self) -> int:\\n res=self.nums[self.pointer]\\n self.pointer+=1\\n return res\\n\\n \\n\\n \\n \\n def hasNext(self) -> bool:\\n return self.pointer<len(self.nums)\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\n\\ndef to_array(nested: [NestedInteger]) -> [int]:\\n ret = []\\n for ele in nested:\\n if ele.isInteger():\\n ret.append(ele.getInteger())\\n else:\\n ret.extend(to_array(ele.getList()))\\n \\n return ret\\n \\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.array = to_array(nestedList)\\n self.idx = 0\\n self.n = len(self.array)\\n \\n def next(self) -> int:\\n self.idx += 1\\n return self.array[self.idx - 1]\\n \\n def hasNext(self) -> bool:\\n return self.idx < self.n\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator(object):\\n\\n def __init__(self, nestedList):\\n self.stack = [[nestedList, 0]]\\n\\n def next(self):\\n self.hasNext()\\n nestedList, i = self.stack[-1]\\n self.stack[-1][1] += 1\\n return nestedList[i].getInteger()\\n \\n def hasNext(self):\\n s = self.stack\\n while s:\\n nestedList, i = s[-1]\\n if i == len(nestedList):\\n s.pop()\\n else:\\n x = nestedList[i]\\n if x.isInteger():\\n return True\\n s[-1][1] += 1\\n s.append([x.getList(), 0])\\n return False\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.list = self.unflatten_list(nestedList)\\n self.i = 0\\n \\n def next(self) -> int:\\n val = self.list[self.i]\\n self.i += 1\\n return val\\n \\n \\n def hasNext(self) -> bool:\\n return self.i < len(self.list)\\n\\n def unflatten_list(self, nestedList: [NestedInteger]):\\n result = []\\n def recursive(list_nested_lists):\\n for nestedList in list_nested_lists: \\n if nestedList.isInteger():\\n result.append(nestedList.getInteger())\\n else:\\n recursive(nestedList.getList())\\n recursive(nestedList)\\n return result\\n\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n def dfs(nodes):\\n for node in nodes:\\n if node.isInteger():\\n yield node.getInteger()\\n else:\\n yield from dfs(node.getList())\\n self.iter = iter(dfs(nestedList))\\n self.nxt = next(self.iter, None)\\n\\n\\n def next(self) -> int:\\n result, self.nxt = self.nxt, next(self.iter, None)\\n return result\\n\\n def hasNext(self) -> bool:\\n return self.nxt is not None\\n\\n\\n\\n\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.listToFlatten = []\\n self.flattenedList = []\\n\\n for element in reversed(nestedList):\\n self.listToFlatten.append(element)\\n\\n self.flattenList(self.listToFlatten)\\n self.currIndex = 0\\n\\n def flattenList(self, listToFlatten):\\n while listToFlatten:\\n currElem = listToFlatten.pop()\\n if currElem.isInteger() == True:\\n self.flattenedList.append(currElem.getInteger())\\n else:\\n currElemList = currElem.getList()\\n for elem in reversed(currElemList):\\n listToFlatten.append(elem)\\n \\n def next(self) -> int:\\n retVal = self.flattenedList[self.currIndex]\\n self.currIndex += 1\\n return retVal\\n \\n def hasNext(self) -> bool:\\n if self.currIndex < len(self.flattenedList):\\n return True\\n\\n return False\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n def flatten(nL):\\n result=[]\\n for l in nL:\\n if l.isInteger():\\n result.append(l.getInteger())\\n else:\\n result.extend(flatten(l.getList()))\\n return result\\n self.flattened=flatten(nestedList)\\n self.index=0\\n \\n \\n def next(self) -> int:\\n self.index+=1\\n return self.flattened[self.index-1]\\n \\n \\n def hasNext(self) -> bool:\\n return self.index<len(self.flattened)\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n\\n item_stack = []\\n index_stack = []\\n\\n def __init__(self, nestedList: [NestedInteger]):\\n self.item_stack.append(nestedList)\\n self.index_stack.append(0)\\n\\n def _pop_stack(self):\\n while(len(self.item_stack)):\\n lst = self.item_stack[-1]\\n idx = self.index_stack[-1]\\n\\n if(idx >= len(lst)):\\n self.item_stack.pop(-1)\\n self.index_stack.pop(-1)\\n continue\\n if(lst[idx].isInteger()):\\n break\\n\\n self.index_stack[-1] += 1\\n self.index_stack.append(0)\\n self.item_stack.append(lst[idx].getList())\\n\\n def next(self) -> int:\\n self._pop_stack()\\n lst = self.item_stack[-1]\\n idx = self.index_stack[-1]\\n self.index_stack[-1] += 1\\n return lst[idx].getInteger()\\n\\n def hasNext(self) -> bool:\\n self._pop_stack()\\n return len(self.item_stack) > 0\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = [] #create empty stack\\n self.flatten(nestedList) #flattens nested lists\\n \\n def flatten(self, nestedList):\\n for elem in reversed(nestedList): \\n if elem.isInteger(): #check for element in lists\\n self.stack.append(elem) #append the elem in stack\\n else:\\n self.flatten(elem.getList()) #if it is nested list then flatten\\n\\n def next(self) -> int:\\n return self.stack.pop() #pop the last elem in stack\\n\\n \\n def hasNext(self) -> bool:\\n return len(self.stack) > 0 #checks if stack is empty or not\\n\\n\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n topList = self.stack.pop()\\n self.stack.extend(reversed(topList.getList()))\\n return False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class NestedInteger:\\n # The NestedInteger class definition is assumed to be provided\\n def isInteger(self):\\n # Returns True if this NestedInteger holds a single integer, False if it holds a nested list\\n pass\\n\\n def getInteger(self):\\n # Returns the single integer that this NestedInteger holds, if it holds an integer\\n pass\\n\\n def getList(self):\\n # Returns the nested list that this NestedInteger holds, if it holds a nested list\\n pass\\n\\nclass NestedIterator:\\n def __init__(self, nestedList):\\n # Initialize with the given nestedList\\n self.stack = []\\n self._flatten(nestedList)\\n \\n def _flatten(self, nestedList):\\n # Push all elements of the nestedList onto the stack\\n for item in reversed(nestedList):\\n self.stack.append(item)\\n \\n def next(self):\\n # Ensure there is a next integer\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n else:\\n raise StopIteration\\n \\n def hasNext(self):\\n # Flatten the stack until we find an integer or the stack is empty\\n while self.stack and not self.stack[-1].isInteger():\\n nestedList = self.stack.pop().getList()\\n self._flatten(nestedList)\\n \\n # If stack is not empty, the top item is an integer\\n return bool(self.stack)\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n self.stack.pop()\\n self.stack.extend(reversed(top.getList()))\\n return False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n self.flatten(nestedList)\\n\\n def flatten(self, nestedList):\\n for item in reversed(nestedList):\\n self.stack.append(item)\\n\\n def next(self) -> int:\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n self.stack.pop()\\n self.flatten(top.getList())\\n return False\\n \\n return True\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n for e in nestedList[::-1]:\\n self.stack.append(e)\\n \\n def next(self) -> int:\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n if self.stack[-1].isInteger():\\n return True\\n else:\\n for e in self.stack.pop().getList()[::-1]:\\n self.stack.append(e)\\n return False\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\nfrom collections import deque\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = deque()\\n n = len(nestedList)\\n for i in range(n-1, -1, -1):\\n self.stack.append(nestedList[i])\\n \\n def next(self) -> int:\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n if not self.stack:\\n return False\\n while self.stack and not self.stack[-1].isInteger():\\n curr = self.stack.pop()\\n curr_list = curr.getList()\\n for i in range(len(curr_list)-1, -1, -1):\\n self.stack.append(curr_list[i])\\n return self.stack and self.stack[-1].isInteger()\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.list = nestedList\\n self.stack = [[self.list, 0]]\\n \\n def next(self) -> int:\\n if self.hasNext():\\n curList, idx = self.stack.pop()\\n self.stack.append([curList, idx + 1])\\n return curList[idx].getInteger()\\n raise Exception()\\n \\n def hasNext(self) -> bool:\\n stack = self.stack\\n\\n while stack:\\n curList, idx = stack[-1]\\n if idx == len(curList):\\n stack.pop()\\n continue\\n if not curList[idx].isInteger():\\n stack[-1][1] += 1\\n stack.append([curList[idx].getList(), 0])\\n continue\\n break\\n\\n return len(stack) > 0\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.nl = deque(nestedList[::-1])\\n \\n \\n def next(self) -> int:\\n while self.nl:\\n cur = self.nl.pop()\\n\\n if cur.isInteger():\\n return cur.getInteger()\\n\\n for val in cur.getList()[::-1]:\\n self.nl.append(val)\\n \\n \\n def hasNext(self) -> bool:\\n return self.eval(self.nl)\\n\\n def eval(self, curList):\\n for val in curList:\\n if val.isInteger() or self.eval(val.getList()):\\n return True\\n\\n return False\\n\\n \\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n topList = self.stack.pop()\\n self.stack.extend(reversed(topList.getList()))\\n return False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n if not nestedList:\\n raise ValueError()\\n \\n self._deque = collections.deque(nestedList)\\n \\n def next(self) -> int:\\n if not self.hasNext():\\n raise ValueError()\\n\\n return self._deque.popleft().getInteger()\\n \\n def hasNext(self) -> bool:\\n while self._deque and not self._deque[0].isInteger():\\n nested = self._deque.popleft().getList()\\n for i in reversed(nested):\\n self._deque.appendleft(i)\\n\\n return len(self._deque) != 0\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n for n in nestedList[::-1]:\\n self.stack.append(n)\\n \\n def next(self) -> int:\\n self.make_stack_top_an_integer()\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n self.make_stack_top_an_integer()\\n return len(self.stack) > 0\\n\\n def make_stack_top_an_integer(self):\\n while self.stack and not self.stack[-1].isInteger():\\n curr = self.stack.pop().getList()[::-1]\\n for n in curr:\\n self.stack.append(n)\\n\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n for n in nestedList[::-1]:\\n self.stack.append(n)\\n \\n def next(self) -> int:\\n self.make_stack_top_an_integer()\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n self.make_stack_top_an_integer()\\n return len(self.stack) > 0\\n\\n def make_stack_top_an_integer(self):\\n while self.stack and not self.stack[-1].isInteger():\\n curr = self.stack.pop().getList()[::-1]\\n for n in curr:\\n self.stack.append(n)\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.list = []\\n for e in nestedList:\\n if e.isInteger():\\n self.list.append(e.getInteger())\\n else:\\n for e in e.getList():\\n it = NestedIterator([e])\\n if it.hasNext():\\n self.list.append(it)\\n self.cap = len(self.list)\\n self.ind = 0\\n \\n def next(self) -> int:\\n if isinstance(self.list[self.ind], int):\\n self.ind += 1\\n return self.list[self.ind - 1]\\n else:\\n val = self.list[self.ind].next()\\n if not self.list[self.ind].hasNext():\\n self.ind += 1\\n return val\\n \\n def hasNext(self) -> bool:\\n return self.ind < self.cap\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.positions = [(nestedList, -1)]\\n self.next_int = None\\n self._move_next()\\n\\n def _move_next(self):\\n if len(self.positions) == 0:\\n return\\n top = self.positions.pop()\\n if len(top[0]) <= top[1] + 1:\\n self._move_next()\\n return\\n next_item = top[0][top[1] + 1]\\n self.positions.append((top[0], top[1] + 1))\\n if next_item.isInteger():\\n self.next_int = next_item\\n return\\n self.positions.append((next_item.getList(), -1))\\n self._move_next()\\n\\n \\n def next(self) -> int:\\n res = self.next_int.getInteger()\\n self.next_int = None\\n self._move_next()\\n return res\\n \\n \\n def hasNext(self) -> bool:\\n return self.next_int is not None\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList):\\n self.stack = nestedList[::-1]\\n def next(self):\\n return self.stack.pop()\\n def hasNext(self):\\n while self.stack and not self.stack[-1].isInteger():\\n tmp = self.stack.pop()\\n self.stack += tmp.getList()[::-1]\\n return len(self.stack) > 0\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.list = []\\n for e in nestedList:\\n if e.isInteger():\\n self.list.append(e.getInteger())\\n else:\\n for e in e.getList():\\n it = NestedIterator([e])\\n if it.hasNext():\\n self.list.append(it)\\n self.cap = len(self.list)\\n self.ind = 0\\n \\n def next(self) -> int:\\n if isinstance(self.list[self.ind], int):\\n self.ind += 1\\n return self.list[self.ind - 1]\\n else:\\n val = self.list[self.ind].next()\\n if not self.list[self.ind].hasNext():\\n self.ind += 1\\n return val\\n \\n def hasNext(self) -> bool:\\n return self.ind < self.cap\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n # Initialize a stack and push the nested list in reverse order\\n self.stack = nestedList[::-1]\\n\\n def next(self) -> int:\\n # Since hasNext ensures the top of the stack is an integer, we pop and return it\\n return self.stack.pop()\\n\\n def hasNext(self) -> bool:\\n # Continue processing until the top of the stack is an integer\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger(): # If it's an integer, we are ready to return it\\n return True\\n # If it's a list, pop it and push its elements onto the stack in reverse order\\n self.stack.pop()\\n self.stack.extend(top.getList()[::-1])\\n return False\\n\",\n \"runtime\": \"61\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":43,"string":"43"},"mm_list":{"kind":"list like","value":[{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n cur: [NestedInteger] = None\n callStack = []\n\n def __is_empty(self, l: list[NestedInteger]):\n if not l or len(l) == 0:\n return True\n\n for v in l:\n if v.isInteger() or not self.__is_empty(v.getList()):\n return False\n return True\n\n def __init__(self, nestedList: [NestedInteger]):\n self.callStack.append(nestedList)\n \n def next(self) -> int:\n top = self.callStack[-1]\n if len(top) > 0:\n nxt = top[0]\n top.pop(0)\n\n if nxt.isInteger():\n return nxt.getInteger()\n self.callStack.append(nxt.getList())\n return self.next()\n \n self.callStack.pop()\n return self.next()\n \n \n \n def hasNext(self) -> bool:\n while self.callStack and self.__is_empty(self.callStack[-1]): self.callStack.pop()\n return len(self.callStack) > 0","memory":"18300"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n # decompose nestedList\n while nestedList:\n if not nestedList[-1].isInteger():\n item = nestedList.pop()\n nestedList += item.getList()\n else:\n # push item to stack in order\n self.stack.append(nestedList.pop().getInteger())\n \n def next(self) -> int:\n # return item from stack in order\n return self.stack.pop()\n \n def hasNext(self) -> bool:\n return self.stack\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"18400"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.q = []\n self.s = nestedList\n cnt = 0\n\n while len(self.s):\n n = self.s.pop()\n\n if len(n._list) == 0 and n._integer != None:\n self.q.append(n._integer)\n\n for c in n._list:\n self.s.append(c)\n \n def next(self) -> int:\n return self.q.pop()\n \n def hasNext(self) -> bool:\n return True if len(self.q) else False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"18500"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.q = []\n self.s = nestedList\n cnt = 0\n\n while len(self.s):\n n = self.s.pop()\n\n if len(n._list) == 0 and n._integer != None:\n self.q.append(n._integer)\n\n for c in n._list:\n self.s.append(c)\n \n def next(self) -> int:\n return self.q.pop()\n \n def hasNext(self) -> bool:\n return True if len(self.q) else False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"18500"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n nestedList.reverse()\n self.stack = nestedList\n self.next_element = self._next()\n\n def next(self) -> int:\n previous_next = self.next_element\n self.next_element = self._next()\n return previous_next\n \n def _next(self) -> int:\n if not self.stack:\n return None\n current = self.stack.pop()\n while not current:\n current = self.stack.pop()\n if current.isInteger():\n return current.getInteger()\n else:\n currentList = current.getList()\n currentList.reverse()\n self.stack += currentList\n return self._next()\n \n def hasNext(self) -> bool:\n return self.next_element is not None\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"18600"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n\n def flatten(nl):\n flat = []\n for item in nl:\n if item.isInteger():\n flat.append(item.getInteger())\n else:\n flat = flat + flatten(item.getList())\n return flat\n \n self.flat = flatten(nestedList)\n self.flat_idx = 0\n self.flat_len = len(self.flat)\n \n def next(self) -> int:\n to_return = self.flat[self.flat_idx]\n self.flat_idx = self.flat_idx + 1\n return to_return\n \n def hasNext(self) -> bool:\n return self.flat_idx < self.flat_len\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"18700"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = nestedList[::-1]\n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n while self.stack and not self.stack[-1].isInteger():\n x = self.stack.pop().getList()\n while x:\n self.stack.append(x.pop())\n return len(self.stack) > 0","memory":"18800"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\ndef recList(e, stack):\n if e == None:\n return\n for i in e:\n if i.isInteger():\n stack.append(i.getInteger())\n else:\n recList(i.getList(), stack)\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.idx=0\n self.stack=[]\n recList(nestedList, self.stack)\n\n def next(self) -> int:\n val = self.stack[self.idx]\n self.idx+=1\n return val\n \n def hasNext(self) -> bool:\n return self.idx < len(self.stack)\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"18900"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n def generator(currList: List[NestedInteger]) -> Generator[int, None, None]:\n for nestedInteger in currList:\n if nestedInteger.isInteger(): # nestedInteger has a single integer value\n yield nestedInteger.getInteger()\n else:\n yield from generator(nestedInteger.getList())\n self.iterator = generator(nestedList)\n self.nextEl = next(self.iterator, None)\n\n def next(self) -> int:\n tmp = self.nextEl\n self.nextEl = next(self.iterator, None)\n return tmp\n\n def hasNext(self) -> bool:\n return self.nextEl != None\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19000"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.deque = deque(nestedList)\n\n def _find_next(self):\n if len(self.deque) == 0:\n return\n\n while len(self.deque) > 0 and not self.deque[0].isInteger():\n l = self.deque.popleft().getList()[::-1]\n self.deque.extendleft(l)\n \n def next(self) -> int:\n self._find_next()\n return self.deque.popleft().getInteger()\n \n def hasNext(self) -> bool:\n self._find_next()\n return len(self.deque) != 0\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19100"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\n\ndef to_array(nested: [NestedInteger]) -> [int]:\n ret = []\n for ele in nested:\n if ele.isInteger():\n ret.append(ele.getInteger())\n else:\n ret.extend(to_array(ele.getList()))\n \n return ret\n \nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.array = to_array(nestedList)\n self.idx = 0\n self.n = len(self.array)\n \n def next(self) -> int:\n self.idx += 1\n return self.array[self.idx - 1]\n \n def hasNext(self) -> bool:\n return self.idx < self.n\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19200"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def isInteger(self) -> bool:\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n \"\"\"\n pass\n\n def getInteger(self) -> int:\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n \"\"\"\n pass\n\n def getList(self) -> List['NestedInteger']:\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n \"\"\"\n pass\n\nclass NestedIterator:\n def __init__(self, nestedList: List[NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n def next(self) -> int:\n \"\"\"\n @return the next integer in the nested list.\n \"\"\"\n if self.hasNext():\n return self.stack.pop().getInteger()\n raise StopIteration\n \n def hasNext(self) -> bool:\n \"\"\"\n @return True if there are more integers in the nested list.\n \"\"\"\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n self.stack.pop()\n self.stack.extend(reversed(top.getList()))\n return False\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19200"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n for n in nestedList[::-1]:\n self.stack.append(n)\n \n def next(self) -> int:\n self.make_stack_top_an_integer()\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n self.make_stack_top_an_integer()\n return len(self.stack) > 0\n\n def make_stack_top_an_integer(self):\n while self.stack and not self.stack[-1].isInteger():\n curr = self.stack.pop().getList()[::-1]\n for n in curr:\n self.stack.append(n)\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19300"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n\n item_stack = []\n index_stack = []\n\n def __init__(self, nestedList: [NestedInteger]):\n self.item_stack.append(nestedList)\n self.index_stack.append(0)\n\n def _pop_stack(self):\n while(len(self.item_stack)):\n cur_idx = self.index_stack[-1]\n cur_ele = self.item_stack[-1]\n\n if(cur_idx >= len(cur_ele)):\n self.index_stack.pop(-1)\n self.item_stack.pop(-1)\n continue\n \n if(cur_ele[cur_idx].isInteger()):\n break\n\n self.index_stack[-1] += 1\n self.index_stack.append(0)\n self.item_stack.append(cur_ele[cur_idx].getList())\n\n def next(self) -> int:\n self._pop_stack()\n lst = self.item_stack[-1]\n idx = self.index_stack[-1]\n self.index_stack[-1] += 1\n\n return lst[idx].getInteger()\n\n def hasNext(self) -> bool:\n self._pop_stack()\n return len(self.item_stack) > 0\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19300"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = []\n for n in nestedList[::-1]:\n self.stack.append(n)\n \n def next(self) -> int:\n self.make_stack_top_an_integer()\n return self.stack.pop().getInteger()\n \n def hasNext(self) -> bool:\n self.make_stack_top_an_integer()\n return len(self.stack) > 0\n\n def make_stack_top_an_integer(self):\n while self.stack and not self.stack[-1].isInteger():\n curr = self.stack.pop().getList()[::-1]\n for n in curr:\n self.stack.append(n)\n\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19400"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n\n item_stack = []\n index_stack = []\n\n def __init__(self, nestedList: [NestedInteger]):\n self.item_stack.append(nestedList)\n self.index_stack.append(0)\n\n def _pop_stack(self):\n while(len(self.item_stack)):\n lst = self.item_stack[-1]\n idx = self.index_stack[-1]\n\n if(idx >= len(lst)):\n self.item_stack.pop(-1)\n self.index_stack.pop(-1)\n continue\n if(lst[idx].isInteger()):\n break\n\n self.index_stack[-1] += 1\n self.index_stack.append(0)\n self.item_stack.append(lst[idx].getList())\n\n def next(self) -> int:\n self._pop_stack()\n lst = self.item_stack[-1]\n idx = self.index_stack[-1]\n self.index_stack[-1] += 1\n return lst[idx].getInteger()\n\n def hasNext(self) -> bool:\n self._pop_stack()\n return len(self.item_stack) > 0\n\n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19400"},{"code":"class NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = [] #create empty stack\n self.flatten(nestedList) #flattens nested lists\n \n def flatten(self, nestedList):\n for elem in reversed(nestedList): \n if elem.isInteger(): #check for element in lists\n self.stack.append(elem) #append the elem in stack\n else:\n self.flatten(elem.getList()) #if it is nested list then flatten\n\n def next(self) -> int:\n return self.stack.pop() #pop the last elem in stack\n\n \n def hasNext(self) -> bool:\n return len(self.stack) > 0 #checks if stack is empty or not\n\n","memory":"19500"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def isInteger(self) -> bool:\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# \"\"\"\n#\n# def getInteger(self) -> int:\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# \"\"\"\n#\n# def getList(self) -> [NestedInteger]:\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# \"\"\"\n\nclass NestedIterator:\n def __init__(self, nestedList: [NestedInteger]):\n self.stack = list(reversed(nestedList))\n \n def next(self) -> int:\n if self.hasNext():\n return self.stack.pop().getInteger()\n\n \n def hasNext(self) -> bool:\n while self.stack:\n top = self.stack[-1]\n if top.isInteger():\n return True\n topList = self.stack.pop()\n self.stack.extend(reversed(topList.getList()))\n return False\n \n\n# Your NestedIterator object will be instantiated and called as such:\n# i, v = NestedIterator(nestedList), []\n# while i.hasNext(): v.append(i.next())","memory":"19500"}],"string":"[\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n cur: [NestedInteger] = None\\n callStack = []\\n\\n def __is_empty(self, l: list[NestedInteger]):\\n if not l or len(l) == 0:\\n return True\\n\\n for v in l:\\n if v.isInteger() or not self.__is_empty(v.getList()):\\n return False\\n return True\\n\\n def __init__(self, nestedList: [NestedInteger]):\\n self.callStack.append(nestedList)\\n \\n def next(self) -> int:\\n top = self.callStack[-1]\\n if len(top) > 0:\\n nxt = top[0]\\n top.pop(0)\\n\\n if nxt.isInteger():\\n return nxt.getInteger()\\n self.callStack.append(nxt.getList())\\n return self.next()\\n \\n self.callStack.pop()\\n return self.next()\\n \\n \\n \\n def hasNext(self) -> bool:\\n while self.callStack and self.__is_empty(self.callStack[-1]): self.callStack.pop()\\n return len(self.callStack) > 0\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n # decompose nestedList\\n while nestedList:\\n if not nestedList[-1].isInteger():\\n item = nestedList.pop()\\n nestedList += item.getList()\\n else:\\n # push item to stack in order\\n self.stack.append(nestedList.pop().getInteger())\\n \\n def next(self) -> int:\\n # return item from stack in order\\n return self.stack.pop()\\n \\n def hasNext(self) -> bool:\\n return self.stack\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.q = []\\n self.s = nestedList\\n cnt = 0\\n\\n while len(self.s):\\n n = self.s.pop()\\n\\n if len(n._list) == 0 and n._integer != None:\\n self.q.append(n._integer)\\n\\n for c in n._list:\\n self.s.append(c)\\n \\n def next(self) -> int:\\n return self.q.pop()\\n \\n def hasNext(self) -> bool:\\n return True if len(self.q) else False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.q = []\\n self.s = nestedList\\n cnt = 0\\n\\n while len(self.s):\\n n = self.s.pop()\\n\\n if len(n._list) == 0 and n._integer != None:\\n self.q.append(n._integer)\\n\\n for c in n._list:\\n self.s.append(c)\\n \\n def next(self) -> int:\\n return self.q.pop()\\n \\n def hasNext(self) -> bool:\\n return True if len(self.q) else False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n nestedList.reverse()\\n self.stack = nestedList\\n self.next_element = self._next()\\n\\n def next(self) -> int:\\n previous_next = self.next_element\\n self.next_element = self._next()\\n return previous_next\\n \\n def _next(self) -> int:\\n if not self.stack:\\n return None\\n current = self.stack.pop()\\n while not current:\\n current = self.stack.pop()\\n if current.isInteger():\\n return current.getInteger()\\n else:\\n currentList = current.getList()\\n currentList.reverse()\\n self.stack += currentList\\n return self._next()\\n \\n def hasNext(self) -> bool:\\n return self.next_element is not None\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n\\n def flatten(nl):\\n flat = []\\n for item in nl:\\n if item.isInteger():\\n flat.append(item.getInteger())\\n else:\\n flat = flat + flatten(item.getList())\\n return flat\\n \\n self.flat = flatten(nestedList)\\n self.flat_idx = 0\\n self.flat_len = len(self.flat)\\n \\n def next(self) -> int:\\n to_return = self.flat[self.flat_idx]\\n self.flat_idx = self.flat_idx + 1\\n return to_return\\n \\n def hasNext(self) -> bool:\\n return self.flat_idx < self.flat_len\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = nestedList[::-1]\\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n while self.stack and not self.stack[-1].isInteger():\\n x = self.stack.pop().getList()\\n while x:\\n self.stack.append(x.pop())\\n return len(self.stack) > 0\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\ndef recList(e, stack):\\n if e == None:\\n return\\n for i in e:\\n if i.isInteger():\\n stack.append(i.getInteger())\\n else:\\n recList(i.getList(), stack)\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.idx=0\\n self.stack=[]\\n recList(nestedList, self.stack)\\n\\n def next(self) -> int:\\n val = self.stack[self.idx]\\n self.idx+=1\\n return val\\n \\n def hasNext(self) -> bool:\\n return self.idx < len(self.stack)\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n def generator(currList: List[NestedInteger]) -> Generator[int, None, None]:\\n for nestedInteger in currList:\\n if nestedInteger.isInteger(): # nestedInteger has a single integer value\\n yield nestedInteger.getInteger()\\n else:\\n yield from generator(nestedInteger.getList())\\n self.iterator = generator(nestedList)\\n self.nextEl = next(self.iterator, None)\\n\\n def next(self) -> int:\\n tmp = self.nextEl\\n self.nextEl = next(self.iterator, None)\\n return tmp\\n\\n def hasNext(self) -> bool:\\n return self.nextEl != None\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.deque = deque(nestedList)\\n\\n def _find_next(self):\\n if len(self.deque) == 0:\\n return\\n\\n while len(self.deque) > 0 and not self.deque[0].isInteger():\\n l = self.deque.popleft().getList()[::-1]\\n self.deque.extendleft(l)\\n \\n def next(self) -> int:\\n self._find_next()\\n return self.deque.popleft().getInteger()\\n \\n def hasNext(self) -> bool:\\n self._find_next()\\n return len(self.deque) != 0\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\n\\ndef to_array(nested: [NestedInteger]) -> [int]:\\n ret = []\\n for ele in nested:\\n if ele.isInteger():\\n ret.append(ele.getInteger())\\n else:\\n ret.extend(to_array(ele.getList()))\\n \\n return ret\\n \\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.array = to_array(nestedList)\\n self.idx = 0\\n self.n = len(self.array)\\n \\n def next(self) -> int:\\n self.idx += 1\\n return self.array[self.idx - 1]\\n \\n def hasNext(self) -> bool:\\n return self.idx < self.n\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def isInteger(self) -> bool:\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n \\\"\\\"\\\"\\n pass\\n\\n def getInteger(self) -> int:\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n \\\"\\\"\\\"\\n pass\\n\\n def getList(self) -> List['NestedInteger']:\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n \\\"\\\"\\\"\\n pass\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: List[NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n def next(self) -> int:\\n \\\"\\\"\\\"\\n @return the next integer in the nested list.\\n \\\"\\\"\\\"\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n raise StopIteration\\n \\n def hasNext(self) -> bool:\\n \\\"\\\"\\\"\\n @return True if there are more integers in the nested list.\\n \\\"\\\"\\\"\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n self.stack.pop()\\n self.stack.extend(reversed(top.getList()))\\n return False\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n for n in nestedList[::-1]:\\n self.stack.append(n)\\n \\n def next(self) -> int:\\n self.make_stack_top_an_integer()\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n self.make_stack_top_an_integer()\\n return len(self.stack) > 0\\n\\n def make_stack_top_an_integer(self):\\n while self.stack and not self.stack[-1].isInteger():\\n curr = self.stack.pop().getList()[::-1]\\n for n in curr:\\n self.stack.append(n)\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n\\n item_stack = []\\n index_stack = []\\n\\n def __init__(self, nestedList: [NestedInteger]):\\n self.item_stack.append(nestedList)\\n self.index_stack.append(0)\\n\\n def _pop_stack(self):\\n while(len(self.item_stack)):\\n cur_idx = self.index_stack[-1]\\n cur_ele = self.item_stack[-1]\\n\\n if(cur_idx >= len(cur_ele)):\\n self.index_stack.pop(-1)\\n self.item_stack.pop(-1)\\n continue\\n \\n if(cur_ele[cur_idx].isInteger()):\\n break\\n\\n self.index_stack[-1] += 1\\n self.index_stack.append(0)\\n self.item_stack.append(cur_ele[cur_idx].getList())\\n\\n def next(self) -> int:\\n self._pop_stack()\\n lst = self.item_stack[-1]\\n idx = self.index_stack[-1]\\n self.index_stack[-1] += 1\\n\\n return lst[idx].getInteger()\\n\\n def hasNext(self) -> bool:\\n self._pop_stack()\\n return len(self.item_stack) > 0\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = []\\n for n in nestedList[::-1]:\\n self.stack.append(n)\\n \\n def next(self) -> int:\\n self.make_stack_top_an_integer()\\n return self.stack.pop().getInteger()\\n \\n def hasNext(self) -> bool:\\n self.make_stack_top_an_integer()\\n return len(self.stack) > 0\\n\\n def make_stack_top_an_integer(self):\\n while self.stack and not self.stack[-1].isInteger():\\n curr = self.stack.pop().getList()[::-1]\\n for n in curr:\\n self.stack.append(n)\\n\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n\\n item_stack = []\\n index_stack = []\\n\\n def __init__(self, nestedList: [NestedInteger]):\\n self.item_stack.append(nestedList)\\n self.index_stack.append(0)\\n\\n def _pop_stack(self):\\n while(len(self.item_stack)):\\n lst = self.item_stack[-1]\\n idx = self.index_stack[-1]\\n\\n if(idx >= len(lst)):\\n self.item_stack.pop(-1)\\n self.index_stack.pop(-1)\\n continue\\n if(lst[idx].isInteger()):\\n break\\n\\n self.index_stack[-1] += 1\\n self.index_stack.append(0)\\n self.item_stack.append(lst[idx].getList())\\n\\n def next(self) -> int:\\n self._pop_stack()\\n lst = self.item_stack[-1]\\n idx = self.index_stack[-1]\\n self.index_stack[-1] += 1\\n return lst[idx].getInteger()\\n\\n def hasNext(self) -> bool:\\n self._pop_stack()\\n return len(self.item_stack) > 0\\n\\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = [] #create empty stack\\n self.flatten(nestedList) #flattens nested lists\\n \\n def flatten(self, nestedList):\\n for elem in reversed(nestedList): \\n if elem.isInteger(): #check for element in lists\\n self.stack.append(elem) #append the elem in stack\\n else:\\n self.flatten(elem.getList()) #if it is nested list then flatten\\n\\n def next(self) -> int:\\n return self.stack.pop() #pop the last elem in stack\\n\\n \\n def hasNext(self) -> bool:\\n return len(self.stack) > 0 #checks if stack is empty or not\\n\\n\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def isInteger(self) -> bool:\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self) -> int:\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# \\\"\\\"\\\"\\n#\\n# def getList(self) -> [NestedInteger]:\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# \\\"\\\"\\\"\\n\\nclass NestedIterator:\\n def __init__(self, nestedList: [NestedInteger]):\\n self.stack = list(reversed(nestedList))\\n \\n def next(self) -> int:\\n if self.hasNext():\\n return self.stack.pop().getInteger()\\n\\n \\n def hasNext(self) -> bool:\\n while self.stack:\\n top = self.stack[-1]\\n if top.isInteger():\\n return True\\n topList = self.stack.pop()\\n self.stack.extend(reversed(topList.getList()))\\n return False\\n \\n\\n# Your NestedIterator object will be instantiated and called as such:\\n# i, v = NestedIterator(nestedList), []\\n# while i.hasNext(): v.append(i.next())\",\n \"memory\": \"19500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":18,"string":"18"}}},{"rowIdx":268,"cells":{"question_id":{"kind":"number","value":342,"string":"342"},"name":{"kind":"string","value":"power-of-four"},"content":{"kind":"string","value":"<p>Given an integer <code>n</code>, return <em><code>true</code> if it is a power of four. Otherwise, return <code>false</code></em>.</p>\n\n<p>An integer <code>n</code> is a power of four, if there exists an integer <code>x</code> such that <code>n == 4<sup>x</sup></code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> n = 16\n<strong>Output:</strong> true\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> n = 5\n<strong>Output:</strong> false\n</pre><p><strong class=\"example\">Example 3:</strong></p>\n<pre><strong>Input:</strong> n = 1\n<strong>Output:</strong> true\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>-2<sup>31</sup> <= n <= 2<sup>31</sup> - 1</code></li>\n</ul>\n\n<p> </p>\n<strong>Follow up:</strong> Could you solve it without loops/recursion?"},"acRate":{"kind":"number","value":48.4396071963895,"string":"48.439607"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["math","bit-manipulation","recursion"],"string":"[\n \"math\",\n \"bit-manipulation\",\n \"recursion\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15\", 0.0454], [\"16\", 0.0227], [\"17\", 0.0227], [\"18\", 0.0908], [\"19\", 0.0908], [\"20\", 0.0908], [\"21\", 0.0454], [\"22\", 0.2724], [\"23\", 0.9535], [\"24\", 0.5902], [\"25\", 0.7491], [\"26\", 1.0443], [\"27\", 3.0193], [\"28\", 2.4745], [\"29\", 2.0431], [\"30\", 2.6788], [\"31\", 7.0375], [\"32\", 5.0624], [\"33\", 4.6311], [\"34\", 4.336], [\"35\", 9.8524], [\"36\", 7.8547], [\"37\", 5.9478], [\"38\", 5.5392], [\"39\", 8.0817], [\"40\", 6.1294], [\"41\", 4.8354], [\"42\", 3.7457], [\"43\", 3.5641], [\"44\", 2.6107]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.3632], [\"16300\", 4.1317], [\"16400\", 21.4983], [\"16500\", 41.5437]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n while n % 4 == 0:\n n//=4\n return n == 1\n ","runtime":"15"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n z=0\n if n==0:\n return False\n if n==1:\n return True\n if n%4==0:\n z=n//4\n if z==1:\n return True\n return self.isPowerOfFour(z)\n return False","runtime":"16"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<1:\n return False\n\n while n%4==0:\n n//=4\n return n==1\n ","runtime":"17"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n exp1 = n > 0 and (n & (n - 1)) == 0\n exp2 = (n & 0xAAAAAAAA) == 0\n return exp1 and exp2","runtime":"18"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n while n > 1:\n n /= 4\n return True if n == 1 else False","runtime":"19"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n while n %4 ==0:\n n //= 4\n return n ==1","runtime":"20"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n while n % 4 == 0:\n n//=4\n return n == 1\n ","runtime":"21"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n\n cnt_right_0, cnt_all_1 = 0, 0\n for i in range(n.bit_length()):\n b = (n >> i) & 1\n if b == 1:\n cnt_all_1 += 1\n elif cnt_all_1 == 0: # have not seen any 1 yet\n cnt_right_0 += 1\n\n if cnt_all_1 == 1 and cnt_right_0 % 2 == 0:\n return True\n return False\n\n ","runtime":"22"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n == 1:\n return True\n for i in range(31):\n if 4**i == n:\n return True\n return False\n ","runtime":"23"},{"code":"from math import log\n\nclass Solution:\n def isPowerOfFour(self, n: int) -> bool:\n return n > 0 and log(n, 4).is_integer()\n","runtime":"27"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n while n % 4 == 0:\n n//=4\n return n == 1\n ","runtime":"27"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n < 0:\n return False\n \n mag = abs(n)\n \n if mag == 1:\n return True\n \n if mag&(mag-1) != 0:\n return False\n \n while mag > 0:\n if 1 & (mag >> 2) == 1:\n return True\n \n mag = mag >> 2\n \n return False\n ","runtime":"28"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0:\n return False\n ln = math.log(n,10)\n a = math.log(4,10)\n x = int(ln/a)\n print(x)\n if(4**x == n):\n return True\n else:\n return False","runtime":"28"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n == 1:\n return True\n if n <= 0 or n % 4 != 0:\n return False\n return self.isPowerOfFour(n // 4)","runtime":"29"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n return False if n < 1 or math.log(n, 4) % 1 != 0 else True\n ","runtime":"30"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n x = 4\n if (n == 1):\n # print('yes')\n return True\n if (n%x != 0) | (n==0) :\n return False\n n = n/x\n return self.isPowerOfFour(n)\n \n ","runtime":"30"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n log_result = math.log(n) / math.log(4)\n return math.isclose(log_result, round(log_result))\n ","runtime":"31"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n binn=bin(n)[2:]\n \n print(binn)\n \n return n>0 and n&(n-1)==0 and len(binn)%2==1","runtime":"32"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n while n >= 4:\n n /= 4\n if n == 1:\n return True","runtime":"32"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n==1:\n return True\n elif n%4!=0 or n<=0:\n return False\n else:\n return self.isPowerOfFour(n/4)","runtime":"33"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n log_result = math.log(n) / math.log(4)\n print(log_result)\n print(round(log_result))\n print(math.isclose(log_result, round(log_result)))\n return math.isclose(log_result, round(log_result))\n ","runtime":"33"},{"code":"class Solution:\n def isPowerOfFour(self, num: int) -> bool:\n if num <= 0:\n return False\n while num % 4 == 0:\n num //= 4\n return num == 1\n","runtime":"34"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n\n power_fourSet = set()\n\n power_fourSet.add(1)\n\n curr = 1\n\n while curr < n:\n curr *= 4\n power_fourSet.add(curr)\n \n if n in power_fourSet:\n return True\n else:\n return False\n ","runtime":"34"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n return n > 0 and (n & (n - 1)) == 0 and (n - 1) % 3 == 0","runtime":"35"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n==1:\n return True\n if n <= 0 or n % 4 !=0:\n return False\n return self.isPowerOfFour(n//4)\n \n ","runtime":"35"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0:\n return False\n return (n&(n-1))==0 and (n&0xAAAAAAAA)==0","runtime":"36"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n return n>0 and n&(n-1)==0 and (n & 0x55555555) != 0\n ","runtime":"36"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0:\n return False\n while n%4==0:\n n//=4\n return n==1\n ","runtime":"37"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n if n == 1:\n return True\n if n % 4 != 0:\n return False\n return self.isPowerOfFour(n/4)","runtime":"37"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if abs(n) != n or not n:\n return False\n if n == 1:\n return True\n while not n % 4:\n if n == 4:\n return True\n n //= 4\n else:\n return False","runtime":"38"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0: return False\n while n%4==0:\n n//=4\n return n==1\n\n ","runtime":"38"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n if n == 1:\n return True\n return (n % 4 == 0) and self.isPowerOfFour(n // 4)","runtime":"39"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n <= 0:\n return False\n\n else:\n if n==1:\n return True\n else:\n\n while n%4 == 0:\n n = n//4\n\n if n==1:\n return True\n return False\n\n\n","runtime":"39"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n a=1\n if n<1:\n return False\n for i in range(16):\n if a==n:\n return True\n a=a*4\n return False\n\n\n ","runtime":"40"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n \n if n==1:\n return True\n if n==0 or n%4:\n return False\n return self.isPowerOfFour(n//4)","runtime":"40"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<0:\n return False\n x=1\n while x<n:\n n/=4\n return n==1","runtime":"41"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n def pow(n):\n if n==1:\n return True\n if n<4:\n return False\n return n%4==0 and pow(n//4)\n return pow(n)","runtime":"41"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n return isPow(0,n)\n\ndef isPow(i,n):\n if pow(4,i) >n:\n return False\n \n if pow(4,i) == n:\n return True\n return isPow(i+1,n)","runtime":"42"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n binn=bin(n)[2:]\n \n print(binn)\n\n \n return n>0 and n&(n-1)==0 and len(binn)%2==1","runtime":"42"},{"code":"import math\nclass Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n == 1:\n return True\n if (n > 1 and n < 4) or n < 1:\n return False\n return self.isPowerOfFour(n / 4)\n ","runtime":"43"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n return n > 0 and n & 0b01010101010101010101010101010101 > 0 and n.bit_count() == 1","runtime":"43"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0:\n return False\n while n%4==0:\n n//=4\n return n==1","runtime":"44"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n == 1:\n return True\n if n <1: return False\n return self.isPowerOfFour(n / 4)","runtime":"44"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n % 4 == 0:\\n n//=4\\n return n == 1\\n \",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n z=0\\n if n==0:\\n return False\\n if n==1:\\n return True\\n if n%4==0:\\n z=n//4\\n if z==1:\\n return True\\n return self.isPowerOfFour(z)\\n return False\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<1:\\n return False\\n\\n while n%4==0:\\n n//=4\\n return n==1\\n \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n exp1 = n > 0 and (n & (n - 1)) == 0\\n exp2 = (n & 0xAAAAAAAA) == 0\\n return exp1 and exp2\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n while n > 1:\\n n /= 4\\n return True if n == 1 else False\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n %4 ==0:\\n n //= 4\\n return n ==1\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n % 4 == 0:\\n n//=4\\n return n == 1\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n\\n cnt_right_0, cnt_all_1 = 0, 0\\n for i in range(n.bit_length()):\\n b = (n >> i) & 1\\n if b == 1:\\n cnt_all_1 += 1\\n elif cnt_all_1 == 0: # have not seen any 1 yet\\n cnt_right_0 += 1\\n\\n if cnt_all_1 == 1 and cnt_right_0 % 2 == 0:\\n return True\\n return False\\n\\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n == 1:\\n return True\\n for i in range(31):\\n if 4**i == n:\\n return True\\n return False\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"from math import log\\n\\nclass Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n return n > 0 and log(n, 4).is_integer()\\n\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n while n % 4 == 0:\\n n//=4\\n return n == 1\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n < 0:\\n return False\\n \\n mag = abs(n)\\n \\n if mag == 1:\\n return True\\n \\n if mag&(mag-1) != 0:\\n return False\\n \\n while mag > 0:\\n if 1 & (mag >> 2) == 1:\\n return True\\n \\n mag = mag >> 2\\n \\n return False\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0:\\n return False\\n ln = math.log(n,10)\\n a = math.log(4,10)\\n x = int(ln/a)\\n print(x)\\n if(4**x == n):\\n return True\\n else:\\n return False\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n == 1:\\n return True\\n if n <= 0 or n % 4 != 0:\\n return False\\n return self.isPowerOfFour(n // 4)\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n return False if n < 1 or math.log(n, 4) % 1 != 0 else True\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n x = 4\\n if (n == 1):\\n # print('yes')\\n return True\\n if (n%x != 0) | (n==0) :\\n return False\\n n = n/x\\n return self.isPowerOfFour(n)\\n \\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n log_result = math.log(n) / math.log(4)\\n return math.isclose(log_result, round(log_result))\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n binn=bin(n)[2:]\\n \\n print(binn)\\n \\n return n>0 and n&(n-1)==0 and len(binn)%2==1\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n while n >= 4:\\n n /= 4\\n if n == 1:\\n return True\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n==1:\\n return True\\n elif n%4!=0 or n<=0:\\n return False\\n else:\\n return self.isPowerOfFour(n/4)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n log_result = math.log(n) / math.log(4)\\n print(log_result)\\n print(round(log_result))\\n print(math.isclose(log_result, round(log_result)))\\n return math.isclose(log_result, round(log_result))\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, num: int) -> bool:\\n if num <= 0:\\n return False\\n while num % 4 == 0:\\n num //= 4\\n return num == 1\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n\\n power_fourSet = set()\\n\\n power_fourSet.add(1)\\n\\n curr = 1\\n\\n while curr < n:\\n curr *= 4\\n power_fourSet.add(curr)\\n \\n if n in power_fourSet:\\n return True\\n else:\\n return False\\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n return n > 0 and (n & (n - 1)) == 0 and (n - 1) % 3 == 0\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n==1:\\n return True\\n if n <= 0 or n % 4 !=0:\\n return False\\n return self.isPowerOfFour(n//4)\\n \\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0:\\n return False\\n return (n&(n-1))==0 and (n&0xAAAAAAAA)==0\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n return n>0 and n&(n-1)==0 and (n & 0x55555555) != 0\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n%4==0:\\n n//=4\\n return n==1\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n if n == 1:\\n return True\\n if n % 4 != 0:\\n return False\\n return self.isPowerOfFour(n/4)\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if abs(n) != n or not n:\\n return False\\n if n == 1:\\n return True\\n while not n % 4:\\n if n == 4:\\n return True\\n n //= 4\\n else:\\n return False\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0: return False\\n while n%4==0:\\n n//=4\\n return n==1\\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n if n == 1:\\n return True\\n return (n % 4 == 0) and self.isPowerOfFour(n // 4)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n\\n else:\\n if n==1:\\n return True\\n else:\\n\\n while n%4 == 0:\\n n = n//4\\n\\n if n==1:\\n return True\\n return False\\n\\n\\n\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n a=1\\n if n<1:\\n return False\\n for i in range(16):\\n if a==n:\\n return True\\n a=a*4\\n return False\\n\\n\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n \\n if n==1:\\n return True\\n if n==0 or n%4:\\n return False\\n return self.isPowerOfFour(n//4)\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<0:\\n return False\\n x=1\\n while x<n:\\n n/=4\\n return n==1\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n def pow(n):\\n if n==1:\\n return True\\n if n<4:\\n return False\\n return n%4==0 and pow(n//4)\\n return pow(n)\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n return isPow(0,n)\\n\\ndef isPow(i,n):\\n if pow(4,i) >n:\\n return False\\n \\n if pow(4,i) == n:\\n return True\\n return isPow(i+1,n)\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n binn=bin(n)[2:]\\n \\n print(binn)\\n\\n \\n return n>0 and n&(n-1)==0 and len(binn)%2==1\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"import math\\nclass Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n == 1:\\n return True\\n if (n > 1 and n < 4) or n < 1:\\n return False\\n return self.isPowerOfFour(n / 4)\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n return n > 0 and n & 0b01010101010101010101010101010101 > 0 and n.bit_count() == 1\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n%4==0:\\n n//=4\\n return n==1\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n == 1:\\n return True\\n if n <1: return False\\n return self.isPowerOfFour(n / 4)\",\n \"runtime\": \"44\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":43,"string":"43"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n for i in range(31):\n if 4**i==n:\n return True\n\n ","memory":"16200"},{"code":"class Solution:\n def isPowerOfFour(self, num: int) -> bool:\n if num <= 0:\n return False\n while num % 4 == 0:\n num //= 4\n return num == 1\n","memory":"16300"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n x = 4\n if (n == 1):\n # print('yes')\n return True\n if (n%x != 0) | (n==0) :\n return False\n n = n/x\n return self.isPowerOfFour(n)\n \n ","memory":"16300"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n # Check if n is greater than 0, is a power of 2, and only has its bit set in an even position\n return n > 0 and (n & (n - 1)) == 0 and (n % 3 == 1)\n","memory":"16400"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n == 0:\n return False\n if n == 1:\n return True\n if n % 4 != 0:\n return False\n return self.isPowerOfFour(n/4)","memory":"16400"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0:\n return False\n while n%4==0:\n n//=4\n return n==1\n ","memory":"16500"},{"code":"class Solution:\n def isPowerOfFour(self, n: int) -> bool:\n if n<=0:\n return False\n return (n&(n-1))==0 and (n&0xAAAAAAAA)==0","memory":"16500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n for i in range(31):\\n if 4**i==n:\\n return True\\n\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, num: int) -> bool:\\n if num <= 0:\\n return False\\n while num % 4 == 0:\\n num //= 4\\n return num == 1\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n x = 4\\n if (n == 1):\\n # print('yes')\\n return True\\n if (n%x != 0) | (n==0) :\\n return False\\n n = n/x\\n return self.isPowerOfFour(n)\\n \\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n # Check if n is greater than 0, is a power of 2, and only has its bit set in an even position\\n return n > 0 and (n & (n - 1)) == 0 and (n % 3 == 1)\\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n == 0:\\n return False\\n if n == 1:\\n return True\\n if n % 4 != 0:\\n return False\\n return self.isPowerOfFour(n/4)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0:\\n return False\\n while n%4==0:\\n n//=4\\n return n==1\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isPowerOfFour(self, n: int) -> bool:\\n if n<=0:\\n return False\\n return (n&(n-1))==0 and (n&0xAAAAAAAA)==0\",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":269,"cells":{"question_id":{"kind":"number","value":343,"string":"343"},"name":{"kind":"string","value":"integer-break"},"content":{"kind":"string","value":"<p>Given an integer <code>n</code>, break it into the sum of <code>k</code> <strong>positive integers</strong>, where <code>k >= 2</code>, and maximize the product of those integers.</p>\n\n<p>Return <em>the maximum product you can get</em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 2\n<strong>Output:</strong> 1\n<strong>Explanation:</strong> 2 = 1 + 1, 1 × 1 = 1.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 10\n<strong>Output:</strong> 36\n<strong>Explanation:</strong> 10 = 3 + 3 + 4, 3 × 3 × 4 = 36.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>2 <= n <= 58</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":60.628606655623564,"string":"60.628607"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["math","dynamic-programming"],"string":"[\n \"math\",\n \"dynamic-programming\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"19\", 0.0505], [\"20\", 0.101], [\"22\", 0.101], [\"23\", 0.3534], [\"24\", 0.5048], [\"25\", 0.6562], [\"26\", 1.5144], [\"27\", 1.5144], [\"28\", 1.9182], [\"29\", 1.9182], [\"30\", 2.423], [\"31\", 3.9879], [\"32\", 4.6441], [\"33\", 5.4518], [\"34\", 6.108], [\"35\", 5.3004], [\"36\", 6.7138], [\"37\", 6.9662], [\"38\", 6.3604], [\"39\", 6.3099], [\"40\", 7.4205], [\"41\", 6.3604], [\"42\", 5.4518], [\"43\", 3.8869], [\"44\", 3.1802], [\"45\", 2.0697], [\"46\", 1.5649], [\"47\", 1.2115], [\"48\", 0.6058]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.3029], [\"16300\", 6.3099], [\"16400\", 23.6244], [\"16500\", 41.3428], [\"16600\", 20.1918]]}"},"rt_list":{"kind":"list like","value":[{"code":"mapper = {1:1, 2:1, 3:2}\n\nclass Solution:\n def integerBreak(self, n: int) -> int:\n def recursive(n):\n global mapper\n if n in mapper:\n return mapper[n]\n tmp_max = 1\n for i in range(2, n//2 + 1):\n if recursive(n-i) > (n-i):\n tmp_max = max(recursive(n-i) * i, tmp_max)\n else:\n tmp_max = max((n-i) * i, tmp_max)\n mapper[n] = tmp_max\n return mapper[n]\n \n return recursive(n)","runtime":"19"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [0] * (n+1)\n if n == 2:\n return 1\n if n == 3:\n return 2\n ## if 2 or 3 then don't split it\n dp[2], dp[3] = 2, 3\n for i in range(4, n+1):\n dp[i] = max(dp[2] * dp[i - 2], dp[3] * dp[i - 3])\n \n return dp[-1]\n \n ","runtime":"20"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n\n ans = 0\n \n for i in range(1, min(6,n)):\n lastDigit = n % i\n countOfi = floor(n/i)\n\n if lastDigit < i/2 and countOfi > 1:\n lastDigit += i\n countOfi -= 1\n\n product = i ** countOfi\n if lastDigit != 0:\n product *= lastDigit\n \n # print(i, product)\n ans = max(ans, product)\n\n return ans","runtime":"22"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [0] * (n + 1)\n dp[1] = 1\n for i in range(2, n + 1):\n dp[i] = 0\n for j in range(1, i):\n dp[i] = max(dp[i], j * (i - j), j * dp[i - j])\n return dp[n]","runtime":"23"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n <= 3:\n return n - 1\n \n product = 1\n while n > 4:\n product *= 3\n n -= 3\n \n product *= n\n \n return product\n ","runtime":"24"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n <= 3:\n return n - 1\n result = 1\n while n > 4:\n n -= 3\n result *= 3\n return result * n","runtime":"25"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n record = {1:1}\n for num in range(2, n+1):\n record[num] = 0 if num == n else num\n for i in range(1, num):\n product = record[i] * record[num-i]\n record[num] = max(product, record[num])\n return record[n]\n\n\n","runtime":"26"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n == 2 or n == 3:\n return n - 1\n res = 1\n while n > 4:\n n -= 3\n res *= 3\n return res * n\n","runtime":"27"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n \n dp = [0]*(n+1)\n\n dp[0] = 1\n dp[1] = 1\n\n for i in range(2,n+1):\n for j in range(1,i):\n dp[i] = max(dp[i],j*(i-j),dp[i-j]*j)\n\n return(dp[-1])","runtime":"27"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n==2:\n return 1\n if n==3:\n return 2\n a=1\n while n>4:\n a=a*3\n n=n-3\n a=a*n\n return a\n","runtime":"28"},{"code":"class Solution:\n# 假设对正整数 i 拆分出的第一个正整数是 j（1 <= j < i），则有以下两种方案：\n# 1) 将 i 拆分成 j 和 i−j 的和，且 i−j 不再拆分成多个正整数，此时的乘积是 j * (i-j)\n# 2) 将 i 拆分成 j 和 i−j 的和，且 i−j 继续拆分成多个正整数，此时的乘积是 j * dp[i-j\n def integerBreak(self, n: int) -> int:\n dp = [0] * (n+1)\n dp[2] = 1\n\n for i in range(3,n+1):\n for j in range(1,i):\n dp[i] = max(dp[i], max(j * (i-j), j * dp[i-j]))\n return dp[n]\n","runtime":"29"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n < 4:\n return n-1\n prod = 1\n while n > 4:\n prod *= 3\n n-=3\n return prod * n","runtime":"30"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n\n # NSTART = n\n # from collections import defaultdict\n # cache = defaultdict(int)\n # def f(n):\n \n # if n in cache:\n # return cache[n]\n \n # if n == 0:\n # cache[0] = 1\n # return 1\n # elif n == 1:\n # cache[1] = 1\n # return 1\n \n # ans = 1\n # for x in range(1,n+1):\n \n # # If at the start and is NSTART, then we cannot just go up to NSTART, since that'd only split the integer into 1 part (itself)\n # if (x == NSTART) and (n == NSTART):\n # continue\n \n # ans_this = x * f(n-x)\n # ans = max(ans,ans_this)\n \n # cache[n] = ans\n # return ans\n\n # return f(NSTART)\n\n from functools import cache\n\n @cache\n def f(x):\n \n if x == 1:\n return 1\n elif x == 0:\n return 0\n \n if x != n:\n ans = x\n else:\n ans = 1\n max_i = math.nan\n for i in range(1,x):\n ans_this = i * f(x-i)\n if ans_this >= ans:\n ans = max(ans,ans_this)\n max_i = i\n \n #print(x,\"max i is\",max_i)\n return ans\n\n return f(n)","runtime":"31"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n f = [1] * (n + 1)\n for i in range(2, n + 1):\n for j in range(1, i):\n f[i] = max(f[i], f[i - j] * j, (i - j) * j)\n return f[n]","runtime":"32"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n == 2:\n return 1\n if n == 3:\n return 2\n \n cnt_of_3s, remainder = divmod(n, 3)\n\n if remainder == 0:\n return 3 ** cnt_of_3s\n elif remainder == 1:\n return 3 ** (cnt_of_3s - 1) * 4\n else:\n return 3 ** cnt_of_3s * remainder\n\n ","runtime":"32"},{"code":"class Solution:\r\n def integerBreak(self, n: int) -> int:\r\n if n<=3:\r\n return 1*(n-1)\r\n else:\r\n a,b = n//3,n%3\r\n if b==1:\r\n return 3**(a-1)*2*2\r\n elif b==2:\r\n return 3**a*2\r\n return 3**a","runtime":"33"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n '''\n for each n >= 4 either dont split or try to split with nums 2 to n-1 \n '''\n if n <= 3:\n return n-1\n dp = [0] * (n+1)\n dp[1] = 1\n dp[2] = 2\n dp[3] = 3\n for i in range(4, n+1):\n dp[i] = i # this is for not spliting the number at all.\n for j in range(2, i-1):\n dp[i] = max(dp[i], dp[i-j]*j)\n return dp[-1]","runtime":"33"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n == 1 or n == 2:\n return 1\n elif n == 3:\n return 2\n extra = n % 3\n if extra == 1:\n extra = 4\n n = n-3\n \n exp = n // 3\n main = 3**exp\n total = main\n if extra:\n total = main*extra\n return total\n\n","runtime":"34"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n @cache\n def split_into(x):\n if x == 0:\n return 1\n res = float(\"-inf\")\n for i in range(1, x + 1):\n if i == n:\n continue\n val = split_into(x - i) * i\n res = max(res, val)\n return res\n return split_into(n)\n\n\n\n ","runtime":"37"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = {1:1}\n for num in range(1,n+1):\n dp[num] = 0 if num==n else num\n for i in range(1,num):\n val = dp[i]*dp[num-i]\n dp[num] = max(dp[num],val)\n return dp[n]","runtime":"38"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n == 2:\n return 1\n \n dp = [0] * (n + 1)\n\n for i in range(3, n + 1):\n for j in range(1, i):\n dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]))\n \n return dp[n]","runtime":"38"},{"code":"class Solution:\n # 假设对正整数 i 拆分出的第一个正整数是 j（1 <= j < i），则有以下两种方案：\n # 1) 将 i 拆分成 j 和 i−j 的和，且 i−j 不再拆分成多个正整数，此时的乘积是 j * (i-j)\n # 2) 将 i 拆分成 j 和 i−j 的和，且 i−j 继续拆分成多个正整数，此时的乘积是 j * dp[i-j]\n def integerBreak(self, n):\n dp = [0] * (n + 1) # 创建一个大小为n+1的数组来存储计算结果\n dp[2] = 1 # 初始化dp[2]为1，因为当n=2时，只有一个切割方式1+1=2，乘积为1\n \n # 从3开始计算，直到n\n for i in range(3, n + 1):\n # 遍历所有可能的切割点\n for j in range(1, i//2+1):\n\n # 计算切割点j和剩余部分(i-j)的乘积，并与之前的结果进行比较取较大值\n \n dp[i] = max(dp[i], (i - j) * j, dp[i - j] * j)\n \n print(dp)\n return dp[n] # 返回最终的计算结果","runtime":"39"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [1] * (n + 1)\n def split_into(x):\n res = 0\n for i in range(1, x + 1):\n if i == n:\n continue\n if i <= x:\n val = dp[x - i] * i\n res = max(res, val)\n return res\n '''\n Bounds\n x - [n to 0]\n large to small\n x needs x - i\n so large needs small\n so do small first\n '''\n for i in range(1, n + 1):\n dp[i] = split_into(i)\n return dp[n]\n\n\n\n\n\n ","runtime":"39"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [0] * (n+1)\n \n dp[2]=1\n for i in range(3,n+1):\n for j in range(1,i//2+1):\n dp[i] = max(dp[i], j * (i-j), j* dp[i-j])\n return dp[n]\n\n\n","runtime":"40"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n==2:\n return 1\n if n==3:\n return 2\n prod=1\n while(n>4):\n prod*=3\n n-=3\n \n prod*=n\n return prod","runtime":"40"},{"code":"class Solution:\n # 假设对正整数 i 拆分出的第一个正整数是 j（1 <= j < i），则有以下两种方案：\n # 1) 将 i 拆分成 j 和 i−j 的和，且 i−j 不再拆分成多个正整数，此时的乘积是 j * (i-j)\n # 2) 将 i 拆分成 j 和 i−j 的和，且 i−j 继续拆分成多个正整数，此时的乘积是 j * dp[i-j]\n def integerBreak(self, n):\n dp = [0] * (n + 1) # 创建一个大小为n+1的数组来存储计算结果\n dp[2] = 1 # 初始化dp[2]为1，因为当n=2时，只有一个切割方式1+1=2，乘积为1\n \n # 从3开始计算，直到n\n for i in range(3, n + 1):\n # 遍历所有可能的切割点\n for j in range(1, math.ceil(i/2)+1):\n\n # 计算切割点j和剩余部分(i-j)的乘积，并与之前的结果进行比较取较大值\n \n dp[i] = max(dp[i], (i - j) * j, dp[i - j] * j)\n \n print(dp)\n return dp[n] # 返回最终的计算结果","runtime":"41"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n @cache\n def dp(num):\n if num <= 3:\n return num\n \n ans = num\n for i in range(2, num):\n ans = max(ans, i * dp(num - i))\n \n return ans\n\n if n <= 3:\n return n - 1\n \n return dp(n)\n\n return breakInt(n, 1, 0)","runtime":"42"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [1] * (n+1)\n for num in range(3, n+1):\n for i in range(2, num):\n dp[num] = max(dp[num], max(i * (num - i), i * dp[num-i]))\n return dp[n]","runtime":"42"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n ans = 1\n if n == 3 or n==2:\n return n-1\n while n>4:\n n-=3\n ans*=3\n return ans*n\n ","runtime":"43"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n # Create a DP array to store maximum product for each number up to n\n dp = [0] * (n + 1)\n \n # Base cases\n dp[1] = 0 # Although not used, just for completeness\n dp[2] = 1 # 2 = 1 + 1, so max product = 1\n \n # Fill the dp array\n for i in range(3, n + 1):\n for j in range(1, i // 2 + 1):\n # Maximum of either breaking at j or taking the product of j and the best product of (i - j)\n dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]))\n \n return dp[n]\n","runtime":"43"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [0 for i in range(n + 1)]\n\n for i in range(1,n + 1):\n for j in range(i,-1,-1):\n # print(j,i-j)\n dp[i] = max(j*dp[i - j],dp[i],j*(i-j))\n return dp[-1]","runtime":"44"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n \n # dp[i] will store the maximum product for number i\n dp = [0] * (n + 1)\n \n # Base cases\n dp[1] = 1 # Not used, just for completeness\n dp[2] = 1 # 2 can only be broken as 1+1\n \n # Build up the solution\n for i in range(3, n + 1):\n for j in range(1, i):\n # Similar to recursive approach, we have two choices:\n # 1. Use j as is: j * (i-j)\n # 2. Break j further: j * dp[i-j]\n dp[i] = max(dp[i], j * (i-j), j * dp[i-j])\n \n return dp[n]","runtime":"45"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n arr=[i for i in range(1,n+1)]\n m=len(arr)\n print(arr)\n t=[[0 for j in range(n+1)] for i in range(m+1)]\n \n for j in range(1,n+1):\n t[1][j]=1\n for i in range(2,m+1):\n for j in range(1,n+1):\n if arr[i-1]<=j:\n t[i][j]=max(arr[i-1]*t[i][j-arr[i-1]],t[i-1][j],arr[i-1]*(j-arr[i-1]))\n else:\n t[i][j]=t[i-1][j]\n \n return t[m][n]\n","runtime":"45"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n==1:\n return 1\n elif n==2:\n return 1\n \n dp = [0]*(n+1)\n dp[1] = 1\n dp[2] = 1\n for i in range(3, n+1):\n for j in range(1, i-1):\n dp[i] = max(dp[i], j*(i-j), j*dp[i-j])\n \n return dp[n]","runtime":"46"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n cache = {1:1}\n def recurse(n):\n print(n)\n\n if n in cache:\n return cache[n]\n\n result = 0\n for i in range(1, n):\n result = max(result, i * (n - i), i * recurse(n - i))\n\n cache[n] = result\n return cache[n]\n\n result = recurse(n)\n print(cache)\n return result","runtime":"47"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n arr=[i for i in range(1,n+1)]\n m=len(arr)\n print(arr)\n t=[[0 for j in range(n+1)] for i in range(m+1)]\n \n for j in range(1,n+1):\n t[1][j]=1\n for i in range(2,m+1):\n for j in range(1,n+1):\n if arr[i-1]<=j:\n t[i][j]=max(arr[i-1]*t[i][j-arr[i-1]],t[i-1][j],arr[i-1]*(j-arr[i-1]))\n else:\n t[i][j]=t[i-1][j]\n print(t)\n return t[m][n]\n","runtime":"48"}],"string":"[\n {\n \"code\": \"mapper = {1:1, 2:1, 3:2}\\n\\nclass Solution:\\n def integerBreak(self, n: int) -> int:\\n def recursive(n):\\n global mapper\\n if n in mapper:\\n return mapper[n]\\n tmp_max = 1\\n for i in range(2, n//2 + 1):\\n if recursive(n-i) > (n-i):\\n tmp_max = max(recursive(n-i) * i, tmp_max)\\n else:\\n tmp_max = max((n-i) * i, tmp_max)\\n mapper[n] = tmp_max\\n return mapper[n]\\n \\n return recursive(n)\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [0] * (n+1)\\n if n == 2:\\n return 1\\n if n == 3:\\n return 2\\n ## if 2 or 3 then don't split it\\n dp[2], dp[3] = 2, 3\\n for i in range(4, n+1):\\n dp[i] = max(dp[2] * dp[i - 2], dp[3] * dp[i - 3])\\n \\n return dp[-1]\\n \\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n\\n ans = 0\\n \\n for i in range(1, min(6,n)):\\n lastDigit = n % i\\n countOfi = floor(n/i)\\n\\n if lastDigit < i/2 and countOfi > 1:\\n lastDigit += i\\n countOfi -= 1\\n\\n product = i ** countOfi\\n if lastDigit != 0:\\n product *= lastDigit\\n \\n # print(i, product)\\n ans = max(ans, product)\\n\\n return ans\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [0] * (n + 1)\\n dp[1] = 1\\n for i in range(2, n + 1):\\n dp[i] = 0\\n for j in range(1, i):\\n dp[i] = max(dp[i], j * (i - j), j * dp[i - j])\\n return dp[n]\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n <= 3:\\n return n - 1\\n \\n product = 1\\n while n > 4:\\n product *= 3\\n n -= 3\\n \\n product *= n\\n \\n return product\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n <= 3:\\n return n - 1\\n result = 1\\n while n > 4:\\n n -= 3\\n result *= 3\\n return result * n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n record = {1:1}\\n for num in range(2, n+1):\\n record[num] = 0 if num == n else num\\n for i in range(1, num):\\n product = record[i] * record[num-i]\\n record[num] = max(product, record[num])\\n return record[n]\\n\\n\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n == 2 or n == 3:\\n return n - 1\\n res = 1\\n while n > 4:\\n n -= 3\\n res *= 3\\n return res * n\\n\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n \\n dp = [0]*(n+1)\\n\\n dp[0] = 1\\n dp[1] = 1\\n\\n for i in range(2,n+1):\\n for j in range(1,i):\\n dp[i] = max(dp[i],j*(i-j),dp[i-j]*j)\\n\\n return(dp[-1])\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n==2:\\n return 1\\n if n==3:\\n return 2\\n a=1\\n while n>4:\\n a=a*3\\n n=n-3\\n a=a*n\\n return a\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n# 假设对正整数 i 拆分出的第一个正整数是 j（1 <= j < i），则有以下两种方案：\\n# 1) 将 i 拆分成 j 和 i−j 的和，且 i−j 不再拆分成多个正整数，此时的乘积是 j * (i-j)\\n# 2) 将 i 拆分成 j 和 i−j 的和，且 i−j 继续拆分成多个正整数，此时的乘积是 j * dp[i-j\\n def integerBreak(self, n: int) -> int:\\n dp = [0] * (n+1)\\n dp[2] = 1\\n\\n for i in range(3,n+1):\\n for j in range(1,i):\\n dp[i] = max(dp[i], max(j * (i-j), j * dp[i-j]))\\n return dp[n]\\n\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n < 4:\\n return n-1\\n prod = 1\\n while n > 4:\\n prod *= 3\\n n-=3\\n return prod * n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n\\n # NSTART = n\\n # from collections import defaultdict\\n # cache = defaultdict(int)\\n # def f(n):\\n \\n # if n in cache:\\n # return cache[n]\\n \\n # if n == 0:\\n # cache[0] = 1\\n # return 1\\n # elif n == 1:\\n # cache[1] = 1\\n # return 1\\n \\n # ans = 1\\n # for x in range(1,n+1):\\n \\n # # If at the start and is NSTART, then we cannot just go up to NSTART, since that'd only split the integer into 1 part (itself)\\n # if (x == NSTART) and (n == NSTART):\\n # continue\\n \\n # ans_this = x * f(n-x)\\n # ans = max(ans,ans_this)\\n \\n # cache[n] = ans\\n # return ans\\n\\n # return f(NSTART)\\n\\n from functools import cache\\n\\n @cache\\n def f(x):\\n \\n if x == 1:\\n return 1\\n elif x == 0:\\n return 0\\n \\n if x != n:\\n ans = x\\n else:\\n ans = 1\\n max_i = math.nan\\n for i in range(1,x):\\n ans_this = i * f(x-i)\\n if ans_this >= ans:\\n ans = max(ans,ans_this)\\n max_i = i\\n \\n #print(x,\\\"max i is\\\",max_i)\\n return ans\\n\\n return f(n)\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n f = [1] * (n + 1)\\n for i in range(2, n + 1):\\n for j in range(1, i):\\n f[i] = max(f[i], f[i - j] * j, (i - j) * j)\\n return f[n]\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n == 2:\\n return 1\\n if n == 3:\\n return 2\\n \\n cnt_of_3s, remainder = divmod(n, 3)\\n\\n if remainder == 0:\\n return 3 ** cnt_of_3s\\n elif remainder == 1:\\n return 3 ** (cnt_of_3s - 1) * 4\\n else:\\n return 3 ** cnt_of_3s * remainder\\n\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\r\\n def integerBreak(self, n: int) -> int:\\r\\n if n<=3:\\r\\n return 1*(n-1)\\r\\n else:\\r\\n a,b = n//3,n%3\\r\\n if b==1:\\r\\n return 3**(a-1)*2*2\\r\\n elif b==2:\\r\\n return 3**a*2\\r\\n return 3**a\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n '''\\n for each n >= 4 either dont split or try to split with nums 2 to n-1 \\n '''\\n if n <= 3:\\n return n-1\\n dp = [0] * (n+1)\\n dp[1] = 1\\n dp[2] = 2\\n dp[3] = 3\\n for i in range(4, n+1):\\n dp[i] = i # this is for not spliting the number at all.\\n for j in range(2, i-1):\\n dp[i] = max(dp[i], dp[i-j]*j)\\n return dp[-1]\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n == 1 or n == 2:\\n return 1\\n elif n == 3:\\n return 2\\n extra = n % 3\\n if extra == 1:\\n extra = 4\\n n = n-3\\n \\n exp = n // 3\\n main = 3**exp\\n total = main\\n if extra:\\n total = main*extra\\n return total\\n\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n @cache\\n def split_into(x):\\n if x == 0:\\n return 1\\n res = float(\\\"-inf\\\")\\n for i in range(1, x + 1):\\n if i == n:\\n continue\\n val = split_into(x - i) * i\\n res = max(res, val)\\n return res\\n return split_into(n)\\n\\n\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = {1:1}\\n for num in range(1,n+1):\\n dp[num] = 0 if num==n else num\\n for i in range(1,num):\\n val = dp[i]*dp[num-i]\\n dp[num] = max(dp[num],val)\\n return dp[n]\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n == 2:\\n return 1\\n \\n dp = [0] * (n + 1)\\n\\n for i in range(3, n + 1):\\n for j in range(1, i):\\n dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]))\\n \\n return dp[n]\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n # 假设对正整数 i 拆分出的第一个正整数是 j（1 <= j < i），则有以下两种方案：\\n # 1) 将 i 拆分成 j 和 i−j 的和，且 i−j 不再拆分成多个正整数，此时的乘积是 j * (i-j)\\n # 2) 将 i 拆分成 j 和 i−j 的和，且 i−j 继续拆分成多个正整数，此时的乘积是 j * dp[i-j]\\n def integerBreak(self, n):\\n dp = [0] * (n + 1) # 创建一个大小为n+1的数组来存储计算结果\\n dp[2] = 1 # 初始化dp[2]为1，因为当n=2时，只有一个切割方式1+1=2，乘积为1\\n \\n # 从3开始计算，直到n\\n for i in range(3, n + 1):\\n # 遍历所有可能的切割点\\n for j in range(1, i//2+1):\\n\\n # 计算切割点j和剩余部分(i-j)的乘积，并与之前的结果进行比较取较大值\\n \\n dp[i] = max(dp[i], (i - j) * j, dp[i - j] * j)\\n \\n print(dp)\\n return dp[n] # 返回最终的计算结果\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [1] * (n + 1)\\n def split_into(x):\\n res = 0\\n for i in range(1, x + 1):\\n if i == n:\\n continue\\n if i <= x:\\n val = dp[x - i] * i\\n res = max(res, val)\\n return res\\n '''\\n Bounds\\n x - [n to 0]\\n large to small\\n x needs x - i\\n so large needs small\\n so do small first\\n '''\\n for i in range(1, n + 1):\\n dp[i] = split_into(i)\\n return dp[n]\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [0] * (n+1)\\n \\n dp[2]=1\\n for i in range(3,n+1):\\n for j in range(1,i//2+1):\\n dp[i] = max(dp[i], j * (i-j), j* dp[i-j])\\n return dp[n]\\n\\n\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n==2:\\n return 1\\n if n==3:\\n return 2\\n prod=1\\n while(n>4):\\n prod*=3\\n n-=3\\n \\n prod*=n\\n return prod\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n # 假设对正整数 i 拆分出的第一个正整数是 j（1 <= j < i），则有以下两种方案：\\n # 1) 将 i 拆分成 j 和 i−j 的和，且 i−j 不再拆分成多个正整数，此时的乘积是 j * (i-j)\\n # 2) 将 i 拆分成 j 和 i−j 的和，且 i−j 继续拆分成多个正整数，此时的乘积是 j * dp[i-j]\\n def integerBreak(self, n):\\n dp = [0] * (n + 1) # 创建一个大小为n+1的数组来存储计算结果\\n dp[2] = 1 # 初始化dp[2]为1，因为当n=2时，只有一个切割方式1+1=2，乘积为1\\n \\n # 从3开始计算，直到n\\n for i in range(3, n + 1):\\n # 遍历所有可能的切割点\\n for j in range(1, math.ceil(i/2)+1):\\n\\n # 计算切割点j和剩余部分(i-j)的乘积，并与之前的结果进行比较取较大值\\n \\n dp[i] = max(dp[i], (i - j) * j, dp[i - j] * j)\\n \\n print(dp)\\n return dp[n] # 返回最终的计算结果\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n @cache\\n def dp(num):\\n if num <= 3:\\n return num\\n \\n ans = num\\n for i in range(2, num):\\n ans = max(ans, i * dp(num - i))\\n \\n return ans\\n\\n if n <= 3:\\n return n - 1\\n \\n return dp(n)\\n\\n return breakInt(n, 1, 0)\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [1] * (n+1)\\n for num in range(3, n+1):\\n for i in range(2, num):\\n dp[num] = max(dp[num], max(i * (num - i), i * dp[num-i]))\\n return dp[n]\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n ans = 1\\n if n == 3 or n==2:\\n return n-1\\n while n>4:\\n n-=3\\n ans*=3\\n return ans*n\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n # Create a DP array to store maximum product for each number up to n\\n dp = [0] * (n + 1)\\n \\n # Base cases\\n dp[1] = 0 # Although not used, just for completeness\\n dp[2] = 1 # 2 = 1 + 1, so max product = 1\\n \\n # Fill the dp array\\n for i in range(3, n + 1):\\n for j in range(1, i // 2 + 1):\\n # Maximum of either breaking at j or taking the product of j and the best product of (i - j)\\n dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]))\\n \\n return dp[n]\\n\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [0 for i in range(n + 1)]\\n\\n for i in range(1,n + 1):\\n for j in range(i,-1,-1):\\n # print(j,i-j)\\n dp[i] = max(j*dp[i - j],dp[i],j*(i-j))\\n return dp[-1]\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n \\n # dp[i] will store the maximum product for number i\\n dp = [0] * (n + 1)\\n \\n # Base cases\\n dp[1] = 1 # Not used, just for completeness\\n dp[2] = 1 # 2 can only be broken as 1+1\\n \\n # Build up the solution\\n for i in range(3, n + 1):\\n for j in range(1, i):\\n # Similar to recursive approach, we have two choices:\\n # 1. Use j as is: j * (i-j)\\n # 2. Break j further: j * dp[i-j]\\n dp[i] = max(dp[i], j * (i-j), j * dp[i-j])\\n \\n return dp[n]\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n arr=[i for i in range(1,n+1)]\\n m=len(arr)\\n print(arr)\\n t=[[0 for j in range(n+1)] for i in range(m+1)]\\n \\n for j in range(1,n+1):\\n t[1][j]=1\\n for i in range(2,m+1):\\n for j in range(1,n+1):\\n if arr[i-1]<=j:\\n t[i][j]=max(arr[i-1]*t[i][j-arr[i-1]],t[i-1][j],arr[i-1]*(j-arr[i-1]))\\n else:\\n t[i][j]=t[i-1][j]\\n \\n return t[m][n]\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n==1:\\n return 1\\n elif n==2:\\n return 1\\n \\n dp = [0]*(n+1)\\n dp[1] = 1\\n dp[2] = 1\\n for i in range(3, n+1):\\n for j in range(1, i-1):\\n dp[i] = max(dp[i], j*(i-j), j*dp[i-j])\\n \\n return dp[n]\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n cache = {1:1}\\n def recurse(n):\\n print(n)\\n\\n if n in cache:\\n return cache[n]\\n\\n result = 0\\n for i in range(1, n):\\n result = max(result, i * (n - i), i * recurse(n - i))\\n\\n cache[n] = result\\n return cache[n]\\n\\n result = recurse(n)\\n print(cache)\\n return result\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n arr=[i for i in range(1,n+1)]\\n m=len(arr)\\n print(arr)\\n t=[[0 for j in range(n+1)] for i in range(m+1)]\\n \\n for j in range(1,n+1):\\n t[1][j]=1\\n for i in range(2,m+1):\\n for j in range(1,n+1):\\n if arr[i-1]<=j:\\n t[i][j]=max(arr[i-1]*t[i][j-arr[i-1]],t[i-1][j],arr[i-1]*(j-arr[i-1]))\\n else:\\n t[i][j]=t[i-1][j]\\n print(t)\\n return t[m][n]\\n\",\n \"runtime\": \"48\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":36,"string":"36"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n <= 2: return 1\n dp = [0] * (n + 1)\n dp[1] = 1\n \n for i in range(2, n + 1):\n for j in range(1, i): dp[i] = max(dp[i],j*(i-j),j*dp[i- j])\n return dp[n]","memory":"16200"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n ans = 1\n if n == 3 or n==2:\n return n-1\n while n>4:\n n-=3\n ans*=3\n return ans*n\n ","memory":"16300"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n <= 3:\n return n - 1\n \n product = 1\n while n > 4:\n product *= 3\n n -= 3\n \n product *= n\n \n return product\n ","memory":"16400"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = {1:1}\n for num in range(1,n+1):\n dp[num] = 0 if num==n else num\n for i in range(1,num):\n val = dp[i]*dp[num-i]\n dp[num] = max(dp[num],val)\n return dp[n]","memory":"16400"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n dp = [0] * (n+1)\n \n dp[2]=1\n for i in range(3,n+1):\n for j in range(1,i//2+1):\n dp[i] = max(dp[i], j * (i-j), j* dp[i-j])\n return dp[n]\n\n\n","memory":"16500"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n if n == 1 or n == 2:\n return 1\n elif n == 3:\n return 2\n extra = n % 3\n if extra == 1:\n extra = 4\n n = n-3\n \n exp = n // 3\n main = 3**exp\n total = main\n if extra:\n total = main*extra\n return total\n\n","memory":"16500"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n memo = {1 : 1}\n def dp(s):\n if s in memo:\n return memo[s]\n \n res = 0 if s == n else s\n\n for j in range(1,s):\n a = dp(j) * dp(s-j)\n res = max(res,a)\n memo[s] = res\n return res\n return dp(n)\n\n\n\n\n\n\n\n \n\n\n \n\n \n \n\n ","memory":"16600"},{"code":"class Solution:\n def integerBreak(self, n: int) -> int:\n record = {1:1}\n for num in range(2, n+1):\n record[num] = 0 if num == n else num\n for i in range(1, num):\n product = record[i] * record[num-i]\n record[num] = max(product, record[num])\n return record[n]\n\n\n","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n <= 2: return 1\\n dp = [0] * (n + 1)\\n dp[1] = 1\\n \\n for i in range(2, n + 1):\\n for j in range(1, i): dp[i] = max(dp[i],j*(i-j),j*dp[i- j])\\n return dp[n]\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n ans = 1\\n if n == 3 or n==2:\\n return n-1\\n while n>4:\\n n-=3\\n ans*=3\\n return ans*n\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n <= 3:\\n return n - 1\\n \\n product = 1\\n while n > 4:\\n product *= 3\\n n -= 3\\n \\n product *= n\\n \\n return product\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = {1:1}\\n for num in range(1,n+1):\\n dp[num] = 0 if num==n else num\\n for i in range(1,num):\\n val = dp[i]*dp[num-i]\\n dp[num] = max(dp[num],val)\\n return dp[n]\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n dp = [0] * (n+1)\\n \\n dp[2]=1\\n for i in range(3,n+1):\\n for j in range(1,i//2+1):\\n dp[i] = max(dp[i], j * (i-j), j* dp[i-j])\\n return dp[n]\\n\\n\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n if n == 1 or n == 2:\\n return 1\\n elif n == 3:\\n return 2\\n extra = n % 3\\n if extra == 1:\\n extra = 4\\n n = n-3\\n \\n exp = n // 3\\n main = 3**exp\\n total = main\\n if extra:\\n total = main*extra\\n return total\\n\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n memo = {1 : 1}\\n def dp(s):\\n if s in memo:\\n return memo[s]\\n \\n res = 0 if s == n else s\\n\\n for j in range(1,s):\\n a = dp(j) * dp(s-j)\\n res = max(res,a)\\n memo[s] = res\\n return res\\n return dp(n)\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n\\n \\n\\n \\n \\n\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def integerBreak(self, n: int) -> int:\\n record = {1:1}\\n for num in range(2, n+1):\\n record[num] = 0 if num == n else num\\n for i in range(1, num):\\n product = record[i] * record[num-i]\\n record[num] = max(product, record[num])\\n return record[n]\\n\\n\\n\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":8,"string":"8"}}},{"rowIdx":270,"cells":{"question_id":{"kind":"number","value":344,"string":"344"},"name":{"kind":"string","value":"reverse-string"},"content":{"kind":"string","value":"<p>Write a function that reverses a string. The input string is given as an array of characters <code>s</code>.</p>\n\n<p>You must do this by modifying the input array <a href=\"https://en.wikipedia.org/wiki/In-place_algorithm\" target=\"_blank\">in-place</a> with <code>O(1)</code> extra memory.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> s = [\"h\",\"e\",\"l\",\"l\",\"o\"]\n<strong>Output:</strong> [\"o\",\"l\",\"l\",\"e\",\"h\"]\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> s = [\"H\",\"a\",\"n\",\"n\",\"a\",\"h\"]\n<strong>Output:</strong> [\"h\",\"a\",\"n\",\"n\",\"a\",\"H\"]\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10<sup>5</sup></code></li>\n\t<li><code>s[i]</code> is a <a href=\"https://en.wikipedia.org/wiki/ASCII#Printable_characters\" target=\"_blank\">printable ascii character</a>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":79.01665452309173,"string":"79.016655"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["two-pointers","string"],"string":"[\n \"two-pointers\",\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"30\", 0.0095], [\"31\", 0.0048], [\"34\", 0.0095], [\"35\", 0.0095], [\"36\", 0.0048], [\"37\", 0.0048], [\"38\", 0.0286], [\"40\", 0.0048], [\"41\", 0.0191], [\"42\", 0.0095], [\"43\", 0.0095], [\"44\", 0.0048], [\"45\", 0.0095], [\"46\", 0.0095], [\"47\", 0.0143], [\"48\", 0.0048], [\"54\", 0.0048], [\"139\", 0.0048], [\"140\", 0.0048], [\"142\", 0.0095], [\"143\", 0.0095], [\"144\", 0.0048], [\"145\", 0.0286], [\"146\", 0.0191], [\"147\", 0.0668], [\"148\", 0.0716], [\"149\", 0.1003], [\"150\", 0.1575], [\"151\", 0.2196], [\"152\", 0.2674], [\"153\", 0.3724], [\"154\", 0.5108], [\"155\", 0.7066], [\"156\", 0.845], [\"157\", 1.3177], [\"158\", 1.3081], [\"159\", 1.7855], [\"160\", 2.0243], [\"161\", 2.5637], [\"162\", 3.1605], [\"163\", 3.5281], [\"164\", 4.0628], [\"165\", 4.3302], [\"166\", 4.9126], [\"167\", 5.3614], [\"168\", 5.8866], [\"169\", 5.5381], [\"170\", 6.0584], [\"171\", 5.8388], [\"172\", 5.9391], [\"173\", 5.1848], [\"174\", 4.9604], [\"175\", 4.4686], [\"176\", 3.7764], [\"177\", 2.8454], [\"178\", 2.5112], [\"179\", 2.177], [\"180\", 1.4752]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16800\", 0.0095], [\"17000\", 0.0239], [\"17100\", 0.0286], [\"19600\", 0.0095], [\"19900\", 0.0239], [\"20000\", 0.0048], [\"20100\", 0.0048], [\"20200\", 0.0095], [\"20300\", 0.0286], [\"20400\", 0.0334], [\"20500\", 0.1289], [\"20600\", 0.5586], [\"20700\", 11.7827], [\"20800\", 57.6291], [\"20900\", 14.7188], [\"21000\", 3.8432], [\"21100\", 6.1539]]}"},"rt_list":{"kind":"list like","value":[{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","runtime":"30"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\n\nexit() ","runtime":"31"},{"code":"\nr0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()\n\n \n \n \n ","runtime":"34"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","runtime":"35"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f'[{case[-2-(case[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","runtime":"36"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","runtime":"37"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"38"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"40"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f'[{case[-2-(case[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","runtime":"41"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"42"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"43"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"44"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"45"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit() ","runtime":"46"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"47"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"48"},{"code":"with open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\n\")\nexit()","runtime":"54"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:]=s[::-1]\n \n ","runtime":"139"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n s[:] = s[::-1]\n \n ","runtime":"140"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s.reverse()","runtime":"142"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n i = 0 \n j = len(s) - 1\n while(i < j):\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1","runtime":"143"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n return s.reverse()\n ","runtime":"144"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n k = s.reverse()\n return k\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n ","runtime":"145"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n i = 0\n j = len(s)-1\n \n while i<j:\n temp = s[i]\n s[i] = s[j]\n s[j] = temp\n i+=1\n j-=1\n \n \n\n\n \n\n\n \n ","runtime":"146"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n i, j = 0, len(s)-1\n while i < j:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n return s\n ","runtime":"147"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n return s.reverse()\n\n ","runtime":"148"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l=0\n r=len(s)-1\n while(l<r):\n s[l],s[r]=s[r],s[l]\n l+=1\n r-=1\n return s","runtime":"149"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[::-1]","runtime":"150"},{"code":"# class Solution:\n# def reverseString(self, s: List[str]) -> None:\n# def helper(left, right):\n# if left<right:\n# s[left], s[right]=s[right],s[left]\n# helper(left+1,right-1) #RECURSIVE APPROACH\n# helper(0,len(s)-1) \n\n\nclass Solution:\n def reverseString(self,s):\n left, right=0,len(s)-1\n while left<right:\n s[left], s[right]=s[right],s[left]\n left, right=left+1, right-1 \n ","runtime":"151"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[::-1]\n ","runtime":"152"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n left= 0\n right= len(s) - 1\n while left<right:\n s[left], s[right] = s[right], s[left]\n left+=1\n right-=1\n return","runtime":"152"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l = 0\n r = len(s) - 1\n while l <= r:\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1\n\n ","runtime":"153"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s.reverse()\n \n ","runtime":"153"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l = 0\n r=len(s)-1\n while l < r:\n s[l],s[r] = s[r],s[l]\n l+=1\n r-=1\n return s","runtime":"156"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n n = len(s)\n for i in range(int(n/2)):\n s[i], s[n-i-1] = s[n-i-1], s[i]\n \n ","runtime":"157"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l = 0\n r = len(s) - 1\n while l<r:\n s[l],s[r] = s[r],s[l]\n l += 1\n r -= 1\n","runtime":"158"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n s.reverse()\n return s","runtime":"159"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n s.reverse()\n ","runtime":"159"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n left=0\n right=len(s)-1\n while left<right:\n s[left],s[right]=s[right],s[left]\n left+=1\n right-=1\n ","runtime":"160"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n s[:] = s[::-1]\n\n\n ","runtime":"160"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:]=s[::-1]\n ","runtime":"161"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[::-1]\n ","runtime":"161"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n # Reversing string? I also have to modify the values in place! \n # I can use two indexes and a while loop?\n # I dont think I can use a for loop because it only goes in one direction\n # Indexing is pretty much a given\n # the issue i have is with even numbered length where the mid point isnt clear!\n # is there a condition that covers both odd and even midpoints? Maybe an initial condtion check?\n # i think flooring it is fine for both even and odd lengths\n # Actually maybe i need to make a difference with even and odd lengths. Nope! it doesnt\n\n # Start\n midpoint = len(s) // 2 # midpoint of array\n \n # index for moving forward and backwards\n forward = 0\n backward = -1\n\n while forward < midpoint:\n s[forward], s[backward] = s[backward], s[forward]\n forward += 1\n backward -= 1\n \n return s\n\n ","runtime":"162"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n low = 0\n high = len(s)-1\n while(low<high):\n temp = s[high]\n s[high] = s[low]\n s[low] = temp\n low +=1\n high -=1\n \n \n ","runtime":"162"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n if not s or len(s)<=1:\n return s\n lo = 0\n hi = len(s)-1\n while lo<hi:\n s[lo], s[hi] = s[hi], s[lo]\n lo+=1\n hi-=1\n return s","runtime":"163"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None: \n \n\t\t# one points to head position, the other points to tail position\n left, right = 0, len(s)-1\n \n\t\t# reverse string by two pointers\n while left < right:\n \n s[left], s[right] = s[right], s[left]\n \n left,right = left+1, right-1","runtime":"163"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n \n i, j = 0, len(s)-1\n while i<=j:\n s[i], s[j] = s[j], s[i]\n i+=1\n j-=1\n ","runtime":"164"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n i, j = 0, len(s) - 1\n while i < j:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n return\n ","runtime":"164"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n\t # l=0\n\t # r= len(s)-1\n\t # while l<r:\n\t\t# temp = s[l]\n\t\t# s[l] = s[r]\n\t\t# s[r] = temp\n\t\t# l +=1\n\t\t# r -=1 \n s.reverse()","runtime":"165"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[::-1]\n ","runtime":"165"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n\n i = 0\n j = len(s)-1\n\n while i != j and i <=j:\n temp = s[i]\n s[i] = s[j]\n s[j] = temp\n\n i+=1\n j-=1\n\n \n\n ","runtime":"166"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l, r = 0, len(s) - 1\n while l<r:\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1\n ","runtime":"166"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n left=0\n right=len(s)-1\n while left<right:\n s[left],s[right]=s[right],s[left]\n left+=1\n right-=1\n ","runtime":"167"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n top,bottom=len(s)-1,0\n while top>bottom:\n temp=s[top]\n s[top]=s[bottom]\n s[bottom]=temp\n bottom+=1\n top-=1","runtime":"167"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l = 0\n r = len(s)-1\n while l < r:\n s[l],s[r]= s[r],s[l]\n l+=1\n r-=1","runtime":"168"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n #s.reverse()\n for i in range(len(s)//2):\n # temp = s[i]\n # s[i]=s[len(s)-1-i]\n # s[len(s)-1-i]=temp\n s[i],s[len(s)-1-i]= s[len(s)-1-i],s[i]\n ","runtime":"168"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n i, j = 0, len(s) - 1\n while i < j:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n \n ","runtime":"169"},{"code":"# No Extra Space\n\nclass Solution:\n def reverseString(self, s: List[str]) -> None:\n i, j = 0, len(s)-1\n\n while i < j:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n \n return s","runtime":"169"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l, r = 0, len(s) - 1\n while l < r:\n tmp = s[r]\n s[r] = s[l]\n s[l] = tmp\n l += 1\n r -= 1","runtime":"170"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n start = 0\n end = len(s)-1\n while(start<end):\n temp=s[end]\n s[end]=s[start]\n s[start]=temp\n end = end -1\n start = start+1\n \n\n ","runtime":"170"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n #s.reverse()\n for i in range(len(s)//2):\n temp = s[i]\n s[i]=s[len(s)-1-i]\n s[len(s)-1-i]=temp","runtime":"171"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[::-1]\n ","runtime":"171"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n s[:] = s[::-1]\n ","runtime":"172"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n def helper(left,right):\n if left >= right:\n return \n s[left], s[right] = s[right], s[left]\n helper(left+1,right-1)\n \n helper(0,len(s)-1)","runtime":"172"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s.reverse()","runtime":"173"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n i= 0 \n j = len(s)-1\n while i < j :\n s[i],s[j] = s[j],s[i]\n i+=1\n j-=1\n return s \n ","runtime":"173"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n left = 0\n right = len(s) - 1\n while(left < right):\n s[left], s[right] = s[right], s[left]\n left += 1\n right -= 1\n ","runtime":"174"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n def swap(s, x, y):\n tmp = s[y]\n s[y] = s[x]\n s[x] = tmp\n l = len(s)\n if l == 1:\n return\n mid = l // 2\n for i in range(mid):\n swap(s, i, l - i - 1)\n \n ","runtime":"174"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n\n if not s or len(s) <= 1:\n return s\n \n pStart = 0\n pEnd = len(s)-1\n \n while pStart <= pEnd:\n s[pStart], s[pEnd] = s[pEnd], s[pStart]\n pStart += 1\n pEnd -= 1\n \n return s \n \n\n ","runtime":"175"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n str = ''\n for index, value in enumerate(s):\n str += value\n\n s.clear()\n for i in ''.join(reversed(str)):\n s.append(i)\n return str","runtime":"175"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l, r = 0, len(s) - 1\n while l < r:\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1\n ","runtime":"176"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l, r = 0, len(s) -1\n while l < r:\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1","runtime":"176"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n\t l=0\n\t r= len(s)-1\n\t while l<r:\n\t\t temp = s[l]\n\t\t s[l] = s[r]\n\t\t s[r] = temp\n\t\t l +=1\n\t\t r -=1 ","runtime":"177"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n for i in range(len(s)//2):\n s[i], s[-i-1] = s[-i-1], s[i]","runtime":"177"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n l, r = 0, len(s) - 1\n while l < r:\n s[l], s[r] = s[r], s[l]\n l, r = l + 1, r - 1","runtime":"178"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n i, n = 0, len(s) -1\n while i < n //2 + 1:\n s[i], s[n - i] = s[n - i], s[i]\n i += 1","runtime":"178"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[-1::-1]\n ","runtime":"179"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n mylist = s\n b = 0\n for i in mylist[::-1]:\n s[b] = i\n b += 1\n ","runtime":"179"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n i=0\n j=len(s)-1\n while i<=j:\n temp=s[i]\n s[i]=s[j]\n s[j]=temp\n i=i+1\n j=j-1\n \n \n ","runtime":"180"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n n = len(s)\n l, r = 0, n-1 \n while l<r:\n s[l], s[r] = s[r], s[l]\n l += 1 \n r -= 1 \n ","runtime":"180"}],"string":"[\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\n\\nexit() \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"\\nr0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\\n\\n \\n \\n \\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f'[{case[-2-(case[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f'[{case[-2-(case[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit() \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"with open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f\\\"{dumps(loads(case.strip())[::-1]).replace(', ', ',')}\\\\n\\\")\\nexit()\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:]=s[::-1]\\n \\n \",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n s[:] = s[::-1]\\n \\n \",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s.reverse()\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n i = 0 \\n j = len(s) - 1\\n while(i < j):\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\",\n \"runtime\": \"143\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n return s.reverse()\\n \",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n k = s.reverse()\\n return k\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n \",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n i = 0\\n j = len(s)-1\\n \\n while i<j:\\n temp = s[i]\\n s[i] = s[j]\\n s[j] = temp\\n i+=1\\n j-=1\\n \\n \\n\\n\\n \\n\\n\\n \\n \",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n i, j = 0, len(s)-1\\n while i < j:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n return s\\n \",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n return s.reverse()\\n\\n \",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l=0\\n r=len(s)-1\\n while(l<r):\\n s[l],s[r]=s[r],s[l]\\n l+=1\\n r-=1\\n return s\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[::-1]\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"# class Solution:\\n# def reverseString(self, s: List[str]) -> None:\\n# def helper(left, right):\\n# if left<right:\\n# s[left], s[right]=s[right],s[left]\\n# helper(left+1,right-1) #RECURSIVE APPROACH\\n# helper(0,len(s)-1) \\n\\n\\nclass Solution:\\n def reverseString(self,s):\\n left, right=0,len(s)-1\\n while left<right:\\n s[left], s[right]=s[right],s[left]\\n left, right=left+1, right-1 \\n \",\n \"runtime\": \"151\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[::-1]\\n \",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n left= 0\\n right= len(s) - 1\\n while left<right:\\n s[left], s[right] = s[right], s[left]\\n left+=1\\n right-=1\\n return\",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l = 0\\n r = len(s) - 1\\n while l <= r:\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n\\n \",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s.reverse()\\n \\n \",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l = 0\\n r=len(s)-1\\n while l < r:\\n s[l],s[r] = s[r],s[l]\\n l+=1\\n r-=1\\n return s\",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n n = len(s)\\n for i in range(int(n/2)):\\n s[i], s[n-i-1] = s[n-i-1], s[i]\\n \\n \",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l = 0\\n r = len(s) - 1\\n while l<r:\\n s[l],s[r] = s[r],s[l]\\n l += 1\\n r -= 1\\n\",\n \"runtime\": \"158\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n s.reverse()\\n return s\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n s.reverse()\\n \",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n left=0\\n right=len(s)-1\\n while left<right:\\n s[left],s[right]=s[right],s[left]\\n left+=1\\n right-=1\\n \",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n s[:] = s[::-1]\\n\\n\\n \",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:]=s[::-1]\\n \",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[::-1]\\n \",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n # Reversing string? I also have to modify the values in place! \\n # I can use two indexes and a while loop?\\n # I dont think I can use a for loop because it only goes in one direction\\n # Indexing is pretty much a given\\n # the issue i have is with even numbered length where the mid point isnt clear!\\n # is there a condition that covers both odd and even midpoints? Maybe an initial condtion check?\\n # i think flooring it is fine for both even and odd lengths\\n # Actually maybe i need to make a difference with even and odd lengths. Nope! it doesnt\\n\\n # Start\\n midpoint = len(s) // 2 # midpoint of array\\n \\n # index for moving forward and backwards\\n forward = 0\\n backward = -1\\n\\n while forward < midpoint:\\n s[forward], s[backward] = s[backward], s[forward]\\n forward += 1\\n backward -= 1\\n \\n return s\\n\\n \",\n \"runtime\": \"162\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n low = 0\\n high = len(s)-1\\n while(low<high):\\n temp = s[high]\\n s[high] = s[low]\\n s[low] = temp\\n low +=1\\n high -=1\\n \\n \\n \",\n \"runtime\": \"162\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n if not s or len(s)<=1:\\n return s\\n lo = 0\\n hi = len(s)-1\\n while lo<hi:\\n s[lo], s[hi] = s[hi], s[lo]\\n lo+=1\\n hi-=1\\n return s\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None: \\n \\n\\t\\t# one points to head position, the other points to tail position\\n left, right = 0, len(s)-1\\n \\n\\t\\t# reverse string by two pointers\\n while left < right:\\n \\n s[left], s[right] = s[right], s[left]\\n \\n left,right = left+1, right-1\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n \\n i, j = 0, len(s)-1\\n while i<=j:\\n s[i], s[j] = s[j], s[i]\\n i+=1\\n j-=1\\n \",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n i, j = 0, len(s) - 1\\n while i < j:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n return\\n \",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n\\t # l=0\\n\\t # r= len(s)-1\\n\\t # while l<r:\\n\\t\\t# temp = s[l]\\n\\t\\t# s[l] = s[r]\\n\\t\\t# s[r] = temp\\n\\t\\t# l +=1\\n\\t\\t# r -=1 \\n s.reverse()\",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[::-1]\\n \",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n\\n i = 0\\n j = len(s)-1\\n\\n while i != j and i <=j:\\n temp = s[i]\\n s[i] = s[j]\\n s[j] = temp\\n\\n i+=1\\n j-=1\\n\\n \\n\\n \",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(s) - 1\\n while l<r:\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n \",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n left=0\\n right=len(s)-1\\n while left<right:\\n s[left],s[right]=s[right],s[left]\\n left+=1\\n right-=1\\n \",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n top,bottom=len(s)-1,0\\n while top>bottom:\\n temp=s[top]\\n s[top]=s[bottom]\\n s[bottom]=temp\\n bottom+=1\\n top-=1\",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l = 0\\n r = len(s)-1\\n while l < r:\\n s[l],s[r]= s[r],s[l]\\n l+=1\\n r-=1\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n #s.reverse()\\n for i in range(len(s)//2):\\n # temp = s[i]\\n # s[i]=s[len(s)-1-i]\\n # s[len(s)-1-i]=temp\\n s[i],s[len(s)-1-i]= s[len(s)-1-i],s[i]\\n \",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n i, j = 0, len(s) - 1\\n while i < j:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n \\n \",\n \"runtime\": \"169\"\n },\n {\n \"code\": \"# No Extra Space\\n\\nclass Solution:\\n def reverseString(self, s: List[str]) -> None:\\n i, j = 0, len(s)-1\\n\\n while i < j:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n \\n return s\",\n \"runtime\": \"169\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(s) - 1\\n while l < r:\\n tmp = s[r]\\n s[r] = s[l]\\n s[l] = tmp\\n l += 1\\n r -= 1\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n start = 0\\n end = len(s)-1\\n while(start<end):\\n temp=s[end]\\n s[end]=s[start]\\n s[start]=temp\\n end = end -1\\n start = start+1\\n \\n\\n \",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n #s.reverse()\\n for i in range(len(s)//2):\\n temp = s[i]\\n s[i]=s[len(s)-1-i]\\n s[len(s)-1-i]=temp\",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[::-1]\\n \",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n s[:] = s[::-1]\\n \",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n def helper(left,right):\\n if left >= right:\\n return \\n s[left], s[right] = s[right], s[left]\\n helper(left+1,right-1)\\n \\n helper(0,len(s)-1)\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s.reverse()\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n i= 0 \\n j = len(s)-1\\n while i < j :\\n s[i],s[j] = s[j],s[i]\\n i+=1\\n j-=1\\n return s \\n \",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n left = 0\\n right = len(s) - 1\\n while(left < right):\\n s[left], s[right] = s[right], s[left]\\n left += 1\\n right -= 1\\n \",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n def swap(s, x, y):\\n tmp = s[y]\\n s[y] = s[x]\\n s[x] = tmp\\n l = len(s)\\n if l == 1:\\n return\\n mid = l // 2\\n for i in range(mid):\\n swap(s, i, l - i - 1)\\n \\n \",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n\\n if not s or len(s) <= 1:\\n return s\\n \\n pStart = 0\\n pEnd = len(s)-1\\n \\n while pStart <= pEnd:\\n s[pStart], s[pEnd] = s[pEnd], s[pStart]\\n pStart += 1\\n pEnd -= 1\\n \\n return s \\n \\n\\n \",\n \"runtime\": \"175\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n str = ''\\n for index, value in enumerate(s):\\n str += value\\n\\n s.clear()\\n for i in ''.join(reversed(str)):\\n s.append(i)\\n return str\",\n \"runtime\": \"175\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(s) - 1\\n while l < r:\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n \",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l, r = 0, len(s) -1\\n while l < r:\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n\\t l=0\\n\\t r= len(s)-1\\n\\t while l<r:\\n\\t\\t temp = s[l]\\n\\t\\t s[l] = s[r]\\n\\t\\t s[r] = temp\\n\\t\\t l +=1\\n\\t\\t r -=1 \",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n for i in range(len(s)//2):\\n s[i], s[-i-1] = s[-i-1], s[i]\",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n l, r = 0, len(s) - 1\\n while l < r:\\n s[l], s[r] = s[r], s[l]\\n l, r = l + 1, r - 1\",\n \"runtime\": \"178\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n i, n = 0, len(s) -1\\n while i < n //2 + 1:\\n s[i], s[n - i] = s[n - i], s[i]\\n i += 1\",\n \"runtime\": \"178\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[-1::-1]\\n \",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n mylist = s\\n b = 0\\n for i in mylist[::-1]:\\n s[b] = i\\n b += 1\\n \",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n i=0\\n j=len(s)-1\\n while i<=j:\\n temp=s[i]\\n s[i]=s[j]\\n s[j]=temp\\n i=i+1\\n j=j-1\\n \\n \\n \",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n n = len(s)\\n l, r = 0, n-1 \\n while l<r:\\n s[l], s[r] = s[r], s[l]\\n l += 1 \\n r -= 1 \\n \",\n \"runtime\": \"180\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":80,"string":"80"},"mm_list":{"kind":"list like","value":[{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","memory":"16800"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","memory":"16800"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for z in stdin:\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","memory":"17000"},{"code":"r0='\"\\\\'\nr1='\\\\\"'\nnl=\"\\n\"\nwith open(\"user.out\", \"w\") as f:\n for case in stdin:\n f.write(f'[{case[-2-(case[-1]==nl):0:-1].replace(r0,r1)}]\\n')\nexit()","memory":"17100"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n '''\n h e l l o\n\n o l l e h\n '''\n\n l, r = 0, len(s)-1\n while l < r:\n s[l], s[r] = s[r], s[l]\n l, r = l + 1, r - 1\n ","memory":"19600"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n \n left = 0 \n right = len(s) - 1 \n \n while left < right: \n s[left], s[right] = s[right], s[left]\n left += 1 \n right -= 1 \n \n return s ","memory":"19900"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s = s.reverse()\n ","memory":"20000"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l = 0\n r = len(s) - 1\n\n while l < r:\n tmp = s[l]\n s[l] = s[r]\n s[r] = tmp\n\n l += 1\n r -= 1\n","memory":"20100"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l=0\n while (l<len(s)//2):\n s[l],s[(-1)*l-1]=s[(-1)*l-1],s[l]\n l+=1 ","memory":"20200"},{"code":"# No Extra Space - Two Pointer Approach\n\nclass Solution:\n def reverseString(self, s: List[str]) -> None:\n i, j = 0, len(s)-1\n\n while i < j:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n\n return s","memory":"20300"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n for i in range(len(s)):\n if i == len(s)//2:\n break\n temp = s[i]\n s[i] = s[len(s) - 1 - i]\n s[len(s) - 1 - i] = temp\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n ","memory":"20400"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n p1, p2 = 0, len(s) - 1\n\n while p1 < p2:\n s[p1], s[p2] = s[p2], s[p1]\n\n p1 += 1\n p2 -= 1\n \n return s","memory":"20500"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l = -1\n \n for c in range(len(s)//2):\n s[c], s[l] = s[l], s[c]\n l-=1","memory":"20600"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n l,r=0,len(s)-1\n while l<r:\n s[l],s[r]=s[r],s[l]\n l+=1\n r-=1\n","memory":"20900"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n for i in range(len(s) // 2):\n s[i], s[~i] = s[~i], s[i]","memory":"20900"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[-1::-1]\n ","memory":"21000"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n s[:] = s[::-1]\n ","memory":"21000"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:] = s[::-1]\n ","memory":"21100"},{"code":"class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n s[:]=s[::-1]\n ","memory":"21100"}],"string":"[\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for z in stdin:\\n f.write(f'[{z[-2-(z[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"r0='\\\"\\\\\\\\'\\nr1='\\\\\\\\\\\"'\\nnl=\\\"\\\\n\\\"\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n for case in stdin:\\n f.write(f'[{case[-2-(case[-1]==nl):0:-1].replace(r0,r1)}]\\\\n')\\nexit()\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n '''\\n h e l l o\\n\\n o l l e h\\n '''\\n\\n l, r = 0, len(s)-1\\n while l < r:\\n s[l], s[r] = s[r], s[l]\\n l, r = l + 1, r - 1\\n \",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n \\n left = 0 \\n right = len(s) - 1 \\n \\n while left < right: \\n s[left], s[right] = s[right], s[left]\\n left += 1 \\n right -= 1 \\n \\n return s \",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s = s.reverse()\\n \",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l = 0\\n r = len(s) - 1\\n\\n while l < r:\\n tmp = s[l]\\n s[l] = s[r]\\n s[r] = tmp\\n\\n l += 1\\n r -= 1\\n\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l=0\\n while (l<len(s)//2):\\n s[l],s[(-1)*l-1]=s[(-1)*l-1],s[l]\\n l+=1 \",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"# No Extra Space - Two Pointer Approach\\n\\nclass Solution:\\n def reverseString(self, s: List[str]) -> None:\\n i, j = 0, len(s)-1\\n\\n while i < j:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n\\n return s\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n for i in range(len(s)):\\n if i == len(s)//2:\\n break\\n temp = s[i]\\n s[i] = s[len(s) - 1 - i]\\n s[len(s) - 1 - i] = temp\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n \",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n p1, p2 = 0, len(s) - 1\\n\\n while p1 < p2:\\n s[p1], s[p2] = s[p2], s[p1]\\n\\n p1 += 1\\n p2 -= 1\\n \\n return s\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l = -1\\n \\n for c in range(len(s)//2):\\n s[c], s[l] = s[l], s[c]\\n l-=1\",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n l,r=0,len(s)-1\\n while l<r:\\n s[l],s[r]=s[r],s[l]\\n l+=1\\n r-=1\\n\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n for i in range(len(s) // 2):\\n s[i], s[~i] = s[~i], s[i]\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[-1::-1]\\n \",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n s[:] = s[::-1]\\n \",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:] = s[::-1]\\n \",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseString(self, s: List[str]) -> None:\\n \\\"\\\"\\\"\\n Do not return anything, modify s in-place instead.\\n \\\"\\\"\\\"\\n s[:]=s[::-1]\\n \",\n \"memory\": \"21100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":19,"string":"19"}}},{"rowIdx":271,"cells":{"question_id":{"kind":"number","value":345,"string":"345"},"name":{"kind":"string","value":"reverse-vowels-of-a-string"},"content":{"kind":"string","value":"<p>Given a string <code>s</code>, reverse only all the vowels in the string and return it.</p>\n\n<p>The vowels are <code>'a'</code>, <code>'e'</code>, <code>'i'</code>, <code>'o'</code>, and <code>'u'</code>, and they can appear in both lower and upper cases, more than once.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">s = "IceCreAm"</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">"AceCreIm"</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>The vowels in <code>s</code> are <code>['I', 'e', 'e', 'A']</code>. On reversing the vowels, s becomes <code>"AceCreIm"</code>.</p>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">s = "leetcode"</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">"leotcede"</span></p>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 3 * 10<sup>5</sup></code></li>\n\t<li><code>s</code> consist of <strong>printable ASCII</strong> characters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":54.34158522484975,"string":"54.341585"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["two-pointers","string"],"string":"[\n \"two-pointers\",\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"22\", 0.023899999999999998], [\"24\", 0.0428], [\"26\", 0.11900000000000001], [\"28\", 0.19030000000000002], [\"30\", 0.5615], [\"33\", 1.6559], [\"35\", 1.8749], [\"37\", 3.4547], [\"39\", 4.3255], [\"41\", 6.5429], [\"43\", 10.5923], [\"46\", 8.6462], [\"48\", 7.6279], [\"50\", 7.618399999999999], [\"52\", 6.6429], [\"54\", 5.6769], [\"57\", 7.0617], [\"59\", 3.8258], [\"61\", 3.5831], [\"63\", 2.8361], [\"65\", 2.1794000000000002], [\"68\", 2.2079], [\"70\", 1.0943999999999998], [\"72\", 0.6805], [\"74\", 0.5377000000000001], [\"76\", 0.40449999999999997], [\"78\", 0.42819999999999997], [\"81\", 0.26649999999999996], [\"83\", 0.2474], [\"85\", 0.1951], [\"87\", 0.1428], [\"89\", 0.13319999999999999], [\"92\", 0.1856], [\"94\", 0.14279999999999998], [\"96\", 0.1285], [\"98\", 0.0809], [\"100\", 0.0809], [\"103\", 0.1285], [\"105\", 0.1094], [\"107\", 0.14279999999999998], [\"109\", 0.15710000000000002], [\"111\", 0.138], [\"113\", 0.26649999999999996], [\"116\", 0.1476], [\"118\", 0.138], [\"120\", 0.1285], [\"122\", 0.1333], [\"124\", 0.119], [\"127\", 0.1476], [\"129\", 0.1285], [\"131\", 0.0476], [\"133\", 0.09040000000000001], [\"135\", 0.0857], [\"138\", 0.0524], [\"140\", 0.0286], [\"142\", 0.0476], [\"144\", 0.0286], [\"146\", 0.0523], [\"148\", 0.042800000000000005], [\"151\", 0.042800000000000005], [\"153\", 0.0429], [\"155\", 0.0286], [\"157\", 0.0476], [\"159\", 0.042800000000000005], [\"162\", 0.0333], [\"164\", 0.0429], [\"166\", 0.0286], [\"168\", 0.0096], [\"170\", 0.0333], [\"173\", 0.0381], [\"175\", 0.028499999999999998], [\"177\", 0.0096], [\"179\", 0.0286], [\"181\", 0.0095], [\"183\", 0.0191], [\"186\", 0.0095], [\"188\", 0.028499999999999998], [\"190\", 0.0238], [\"192\", 0.028499999999999998], [\"194\", 0.019]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16800\", 0.0143], [\"16900\", 0.2236], [\"17000\", 1.8891], [\"17100\", 3.4309], [\"17200\", 4.592], [\"17300\", 2.955], [\"17400\", 16.1742], [\"17500\", 33.8092], [\"17600\", 4.6729], [\"17700\", 3.1454], [\"17800\", 2.3031], [\"17900\", 0.8708], [\"18000\", 4.0685], [\"18100\", 1.3181], [\"18200\", 2.0319], [\"18300\", 2.8789], [\"18400\", 0.5234], [\"18500\", 0.5092], [\"18600\", 0.4283], [\"18700\", 1.0802], [\"18800\", 2.1223], [\"18900\", 1.3704], [\"19000\", 1.5465], [\"19100\", 1.7464], [\"19200\", 0.7994]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n i, j = 0, len(s)-1\n vowel = \"aeiouAEIOU\"\n st = list(s)\n while i < j:\n if st[i] in vowel and st[j] in vowel:\n temp = st[i]\n st[i] = st[j]\n st[j] = temp\n i+=1\n j-=1\n if st[i] not in vowel:\n i+=1\n if st[j] not in vowel:\n j-=1\n \n return \"\".join(st)","runtime":"22"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n left = 0\n right = len(s) - 1\n m = 'aeiouAEIOU'\n while left < right:\n if s[left] in m and s[right] in m:\n \n s[left], s[right] = s[right], s[left]\n \n left += 1\n right -= 1\n \n elif s[left] not in m:\n left += 1\n \n elif s[right] not in m:\n right -= 1\n \n return ''.join(s)","runtime":"22"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n arr = list(s)\n left , right = 0, len(s) - 1\n vowels = 'AEIOUaeiou'\n while left < right:\n if arr[left] in vowels:\n if arr[right] in vowels:\n arr[left], arr[right] = arr[right], arr[left]\n left += 1\n right -= 1\n else:\n right -= 1\n else:\n left += 1\n return ''.join(arr)\n ","runtime":"24"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n l, r = 0, len(s) - 1\n vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}\n s = list(s)\n\n while l < r:\n if s[l] not in vowels:\n l += 1\n continue\n \n if s[r] not in vowels:\n r -= 1\n continue\n\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1\n \n return ''.join(s)","runtime":"26"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n # vowels = (\"a\", \"e\", \"i\", \"o\", \"u\")\n # s_vowels = [char for char in s if char.lower() in vowels]\n # result = [s_vowels.pop() if letter.lower() in vowels else letter for letter in s]\n\n # return \"\".join(result)\n vowels = \"aeiouAEIOU\"\n right, left = 0, len(s) - 1\n s_list = list(s)\n while right < left:\n if s_list[right] not in vowels:\n right += 1\n if s_list[left] not in vowels:\n left -= 1\n if s_list[right] in vowels and s_list[left] in vowels:\n temp = s_list[right]\n s_list[right] = s_list[left]\n s_list[left] = temp\n right += 1\n left -= 1\n\n return \"\".join(s_list)\n","runtime":"26"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n s = list(s) \n i, j = 0, len(s) - 1\n\n while i < j:\n if s[i] not in vowels:\n i += 1\n continue\n if s[j] not in vowels:\n j -= 1\n continue\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n\n return ''.join(s) ","runtime":"28"},{"code":"\nclass Solution:\n def reverseVowels(self, s: str) -> str:\n \n \n vowels = set('aeiouAEIOU')\n \n s = list(s)\n left_index, right_index = 0, len(s) - 1\n \n while left_index < right_index:\n \n if s[left_index] not in vowels:\n left_index += 1\n \n continue\n \n \n if s[right_index] not in vowels:\n right_index -= 1\n continue\n \n \n s[left_index], s[right_index] = s[right_index], s[left_index]\n \n \n left_index += 1\n right_index -= 1\n \n return ''.join(s) \n","runtime":"28"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set('aeiouAEIOU')\n s = list(s)\n left, right = 0, len(s) - 1\n while left < right:\n while left < right and s[left] not in vowels:\n left += 1\n while left < right and s[right] not in vowels:\n right -= 1\n s[left], s[right] = s[right], s[left]\n left += 1\n right -= 1\n return ''.join(s)","runtime":"30"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n vowels = set(\"AEIOUaeiou\")\n sLen = len(s)\n l = 0\n r = sLen - 1\n while l < r:\n while s[l] not in vowels and l < r:\n l += 1\n if l == r:\n break\n while s[r] not in vowels and l < r:\n r -= 1\n if r == l:\n break\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1\n\n return ''.join(s)","runtime":"30"},{"code":"# We have a sequence of vowels in a string\n# We want to reverse the order of vowels in the string\n# Cases:\n# There is only one vowel in the string\n# There is an odd number of vowel in the string\n# There is an even number of vowels in the string\n# The are no vowels in the string\n\n#Visualize these cases:\n# no vowels: vvv -> we doe nothing\n# one vowel: vavv -> we do nothing\n# two vowels: vaev -> we need to switch the order of the vowels\n# three vowels: vavevu -> vuveva so we need switch the first two from both sides and leave the middle one alone\n\n# For the no vowels and one vowels case we still need to loop through the entire list to see if there are any vowels\n\n# So the best way is to establish two pointers\n# while 1st_ptr != 2nd_ptr:\n # We get the first pointer to point to a vowel\n # Then we get the second pointer to point to a vowel\n # we then switch the position\n# 1. We search for a vowel for each of the pointers and switch\n# 2. And when the pointers are at the same position we will know that we are done.\n\nclass Solution:\n def reverseVowels(self, s: str) -> str:\n ptr1 = 0\n ptr2 = len(s) - 1\n\n vowel_str = set(\"aAeEiIoOuU\")\n s = list(s)\n\n ptr1_at_vowel = False\n\n while ptr1 < ptr2:\n if not ptr1_at_vowel:\n if s[ptr1] in vowel_str:\n ptr1_at_vowel = True\n else:\n ptr1 += 1\n continue \n\n if s[ptr2] in vowel_str:\n temp = s[ptr2]\n s[ptr2] = s[ptr1]\n s[ptr1] = temp\n\n ptr1_at_vowel = False\n ptr1 += 1\n \n ptr2 -= 1\n \n return ''.join(s)","runtime":"33"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"AEIOUaeiou\"\n vow = [c for c in s if c in vowels]\n revStr = []\n i = 0\n for char in s:\n if char in vowels:\n revStr.append(vow.pop())\n else:\n revStr.append(char)\n return ''.join(revStr)","runtime":"33"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"AEIOUaeiou\"\n vow = [c for c in s if c in vowels]\n revStr = []\n i = 0\n for char in s:\n if char in vowels:\n revStr.append(vow.pop())\n else:\n revStr.append(char)\n return ''.join(revStr)","runtime":"35"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"AEIOUaeiou\"\n vow = [c for c in s if c in vowels]\n revStr = []\n i = 0\n for char in s:\n if char in vowels:\n revStr.append(vow.pop())\n else:\n revStr.append(char)\n return ''.join(revStr)","runtime":"35"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set('aeiouAEIOU')\n i = 0\n j = len(s) - 1\n result = list(s)\n while i < j:\n ci = s[i]\n cj = s[j]\n if ci not in vowels:\n result[i] = ci\n i += 1\n elif cj not in vowels:\n result[j] = cj\n j -= 1\n else:\n result[i], result[j] = cj, ci\n i += 1\n j -= 1\n \n return ''.join(result)\n\n\n ","runtime":"37"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = {'a','e','i','o','u'}\n res = []\n for i in s:\n if i.lower() in vowels:\n res.append(i)\n res[0:] = res[::-1]\n # print(res)\n s = list(s)\n # print(s)\n index = 0\n for i,c in enumerate(s):\n if c.lower() in vowels:\n s[i] = res[index]\n index+=1\n # print(s)\n s = ''.join(s)\n return s\n\n\n ","runtime":"37"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowset = {\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"}\n strlist = list(s)\n left, right = 0, len(s) - 1\n\n while left < right:\n if strlist[left] in vowset and strlist[right] in vowset:\n strlist[left], strlist[right] = strlist[right], strlist[left]\n left, right = left + 1, right - 1\n continue\n\n if strlist[left] not in vowset: left += 1\n if strlist[right] not in vowset: right -= 1\n \n return \"\".join(strlist)\n\n # while l < r:\n # if str_list[l] in vow_set and str_list[r] in vow_set:\n # str_list[l], str_list[r] = str_list[r], str_list[l]\n # l, r = l + 1, r - 1\n # continue\n \n # if str_list[l] not in vow_set: l += 1\n # if str_list[r] not in vow_set: r -= 1\n \n # return ''.join(str_list)","runtime":"39"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"AEIOUaeiou\"\n vow = [c for c in s if c in vowels]\n revStr = []\n i = 0\n for char in s:\n if char in vowels:\n revStr.append(vow.pop())\n else:\n revStr.append(char)\n return ''.join(revStr)","runtime":"39"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"AEIOUaeiou\"\n vow = [c for c in s if c in vowels]\n revStr = []\n i = 0\n for char in s:\n if char in vowels:\n revStr.append(vow.pop())\n else:\n revStr.append(char)\n return ''.join(revStr)","runtime":"41"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n kempa=[]\n index=0\n for i in s:\n if i in \"AEIOUaeiou\":\n kempa.append(i)\n a=kempa\n # return a\n b=a[::-1]\n list2=list(s)\n for i in range(len(list2)):\n if list2[i] in \"AEIOUaeiou\":\n if index<len(b):\n list2[i]=b[index]\n index +=1\n return \"\".join(list2)\n\n # for i in range(len(s)):\n # if s[i]== (\"A\" or \"E\" or \"I\" or \"O\" or \"U\" or \"a\" or \"e\" or \"i\" or \"o\" or \"u\"):\n # list1.append(s[i])\n # return list1\n ","runtime":"41"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set(['a', 'e', 'i', 'o', 'u'])\n vowel_position = []\n res = []\n for idx, ch in enumerate(s):\n if ch.lower() in vowels:\n vowel_position.append(idx)\n res.append(ch)\n total_vowels = len(vowel_position)\n for idx in range(total_vowels//2):\n res[vowel_position[idx]], res[vowel_position[total_vowels-idx-1]] = res[vowel_position[total_vowels-idx-1]], res[vowel_position[idx]]\n return ''.join(res)","runtime":"43"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s=list(s)\n n=len(s)\n i=0\n j=n-1\n vowels= set('AEIOUaeiou')\n while i<j:\n #move start pointer i until it points to a vowel\n while i<j and s[i] not in vowels:\n i+=1\n #move end pointer j until it points to a vowel\n while i<j and s[j] not in vowels:\n j-=1\n s[i],s[j]=s[j],s[i]\n i+=1\n j-=1\n s=''.join(s)\n return s\n ","runtime":"43"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n word = list(s)\n l, r = 0, len(s) - 1\n vowels = \"aeiouAEIOU\"\n\n while l < r:\n while l < r and word[l] not in vowels:\n l += 1\n while r > l and word[r] not in vowels:\n r -= 1\n word[l], word[r] = word[r], word[l]\n l += 1\n r -= 1\n \n return \"\".join(word)\n \n \n return s\n ","runtime":"46"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set(\"aeiouAEIOU\")\n s = list(s)\n left = 0\n right = len(s)-1\n while left < right:\n if s[left] not in vowels:\n left += 1\n elif s[right] not in vowels:\n right -= 1\n else:\n s[left], s[right] = s[right], s[left]\n left += 1\n right -= 1\n return \"\".join(s)\n \n","runtime":"46"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel_set = set(['a','e','i','o','u','A','E','I','O','U'])\n appear_vowel = []\n for si in s:\n if si in vowel_set:\n appear_vowel.append(si)\n\n return_string = ''\n ind = 0\n for si in s:\n if si in vowel_set:\n ind += 1\n return_string += appear_vowel[len(appear_vowel)-ind]\n else:\n return_string += si\n return return_string\n","runtime":"48"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n st = list(s)\n v = \"AEIOUaeiou\"\n vo = list(v)\n ind = []\n new = []\n for i in range(len(st)):\n if st[i] in v:\n new.append(st[i])\n ind.append(i)\n new.reverse()\n for i in range(len(ind)):\n st[ind[i]] = new[i]\n r = ''.join(st)\n return r","runtime":"48"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set('aeiouAEIOU') # Define a set of vowels for quick lookup\n s_list = list(s) # Convert the string to a list for easier manipulation\n left, right = 0, len(s_list) - 1 # Initialize two pointers\n\n while left < right:\n # Move the left pointer to the next vowel\n while left < right and s_list[left] not in vowels:\n left += 1\n # Move the right pointer to the previous vowel\n while left < right and s_list[right] not in vowels:\n right -= 1\n \n # Swap the vowels found at left and right pointers\n s_list[left], s_list[right] = s_list[right], s_list[left]\n left += 1\n right -= 1\n\n # Join the list back into a string and return it\n return ''.join(s_list)\n","runtime":"50"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n list1 = ['a','e','i','o','u', 'A', 'E', 'I', 'O', 'U']\n l = 0\n r = len(s)-1\n s = list(s)\n\n while True:\n while l<r and (s[l] not in list1) :\n l += 1\n while r>l and (s[r] not in list1):\n r -= 1\n if l>=r:\n break\n elif l != r:\n s[l], s[r] = s[r], s[l]\n l += 1\n r -= 1\n return ''.join(s)\n\n# class Solution:\n# def reverseVowels(self, s: str) -> str:\n# chars = []\n# idxs = []\n\n# for i, c in enumerate(s):\n# if c in 'aeiouAEIOU':\n# chars.append(c)\n# idxs.append(i)\n \n# res = list(s)\n# k = len(chars)-1\n# for i in idxs:\n# res[i] = chars[k]\n# k -= 1\n\n# return ''.join(res) \n\n \n\n ","runtime":"50"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n letters = []\n vowels = ['a','e','i','o','u','A','E','I','O', 'U']\n for letter in s: \n if letter in vowels:\n letters.append(letter)\n letters.reverse()\n index = 0\n for j in range(len(s)):\n if s[j] in vowels:\n s[j]= letters[index]\n index += 1\n return ''.join(s)","runtime":"52"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n x = list(s)\n i = 0\n j = len(s)-1\n vow= \"aeiouAEIOU\"\n while i < j:\n while i < j and vow.find(x[i]) == -1:\n i+=1\n while i < j and vow.find(x[j]) == -1:\n j-=1\n x[i],x[j] = x[j],x[i]\n\n i+=1\n j-=1\n return \"\".join(x)\n","runtime":"52"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n if not len(s):\n return s\n s = list(s)\n vowels =[]\n vowel_pos = []\n for i_c, c in enumerate(s):\n if c.lower() in 'aeiou':\n vowels.append(c)\n vowel_pos.append(i_c)\n for i_v in range(len(vowels)//2):\n rev_ind = -1 -i_v\n tmp = vowels[rev_ind]\n s[vowel_pos[rev_ind]] = vowels[i_v]\n s[vowel_pos[i_v]] = tmp\n s = \"\".join(s)\n return s\n ","runtime":"54"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n hashmap = []\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"]\n\n for i in range(len(s)):\n if s[i] in vowels:\n hashmap.append(s[i])\n\n fp = 0\n lp = len(hashmap) - 1\n new_s = \"\"\n for i in range(len(s)):\n if s[i] in vowels:\n new_s += hashmap[lp]\n lp -= 1\n else:\n new_s += s[i]\n\n return new_s","runtime":"54"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = (\"a\", \"A\", \"e\", \"E\", \"i\", \"I\", \"o\", \"O\", \"u\", \"U\")\n s_list = list(s)\n reverse = []\n\n for letter in s:\n if letter in vowels:\n reverse.append(letter)\n \n ptr = 0\n reverse = reverse[::-1]\n for i in range(len(s_list)):\n if s_list[i] in vowels:\n s_list[i] = reverse[ptr]\n ptr += 1\n\n return \"\".join(s_list)","runtime":"57"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = {'a', 'e', 'i', 'o', 'u'}\n s_vowels = []\n s_list = list(s)\n for ch in s_list:\n if ch.lower() in vowels:\n s_vowels.append(ch)\n for i in range(len(s_list)):\n if s_list[i].lower() in vowels:\n s_list[i] = s_vowels.pop()\n return ''.join(s_list)","runtime":"57"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n req_list = ['a','e','i','o','u','A','I','E','O','U']\n val = [(pos,char) for pos, char in enumerate(s) if char in req_list]\n s_list = list(s)\n for i in range (len(val)//2):\n s_list[val[i][0]] = val[-i-1][1]\n s_list[val[-i-1][0]] = val[i][1]\n\n return \"\".join(s_list)\n \n","runtime":"59"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n strlist = list(s)\n stack = []\n for index, char in enumerate(strlist):\n if char.lower() in vowels:\n stack.append(char)\n for index, char in enumerate(strlist):\n if char.lower() in vowels:\n strlist[index] = stack.pop(-1)\n return \"\".join(strlist)\n\n \n","runtime":"59"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vow = []\n \n p =''\n for i in range(len(s)):\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\n vow.append(s[i]) \n count = len(vow)-1 \n for i in range(len(s)):\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\n p+=vow[count]\n count-=1\n else:\n p+=s[i]\n return p","runtime":"61"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_ = list(s)\n vowels = ['a', 'A', 'e', 'E', 'i', 'I', 'o', 'O', 'u', 'U']\n l = 0\n r = len(s_) - 1\n while r > l:\n if s_[l] in vowels and s_[r] in vowels:\n s_[l], s_[r] = s_[r], s_[l]\n l += 1\n r -= 1\n elif s_[l] in vowels and s_[r] not in vowels:\n r -= 1\n elif s_[l] not in vowels and s_[r] in vowels:\n l += 1\n else:\n l += 1\n r -= 1\n return ''.join(s_)\n \n\n ","runtime":"61"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vow = []\n \n p =''\n for i in range(len(s)):\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\n vow.append(s[i]) \n count = len(vow)-1 \n for i in range(len(s)):\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\n p+=vow[count]\n count-=1\n else:\n p+=s[i]\n return p","runtime":"63"},{"code":"class Solution:\n def isVowel(self, char: str) -> bool:\n if char.lower() in ['a', 'e', 'i', 'o', 'u']:\n return True\n else:\n return False\n\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n left = 0\n right = len(s_list)-1\n while left < right:\n if not self.isVowel(s_list[left]):\n left += 1\n if not self.isVowel(s_list[right]):\n right -= 1\n if self.isVowel(s_list[left]) and self.isVowel(s_list[right]):\n dummy = s_list[left]\n s_list[left] = s_list[right]\n s_list[right] = dummy\n left += 1\n right -= 1\n return ''.join(s_list)\n ","runtime":"63"},{"code":"vowels = ['a', 'e', 'i', 'o', 'u']\n\nclass Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n i = 0\n j = len(s) - 1\n while i < j:\n if s[i].lower() in vowels and s[j].lower() in vowels:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n else:\n if s[i].lower() not in vowels:\n i += 1\n if s[j].lower() not in vowels:\n j -= 1\n return \"\".join(s)\n","runtime":"65"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n str1 = \"\"\n stack = []\n for char in s:\n if char in set(\"AaEeIiOoUu\"):\n str1 += \"_\"\n stack.append(char)\n else:\n str1 += char\n \n res = \"\"\n for char in str1:\n if char == \"_\":\n res += stack.pop()\n else:\n res += char\n return res","runtime":"65"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n g=['A','E','I','O','U','a','e','i','o','u']\n t=[]\n for j in s:\n if j in g:\n t.append(j)\n k=''\n t=t[::-1]\n i=0\n for h in s:\n if h in g:\n k=k+t[i]\n i+=1\n else:\n k=k+h\n return (k)","runtime":"68"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"]\n strlist = list(s)\n stack = []\n for index, char in enumerate(strlist):\n if char in vowels:\n stack.append(char)\n for index, char in enumerate(strlist):\n if char in vowels:\n strlist[index] = stack.pop(-1)\n return \"\".join(strlist)\n\n \n","runtime":"68"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n \n rev = \"\"\n newString =\"\"\n ptr = 0\n \n for letter in s:\n if letter in vowels:\n rev += letter\n rev = rev[::-1]\n for i in range(len(s)):\n if s[i] in vowels:\n newString += rev[ptr]\n ptr = ptr + 1\n else:\n newString += s[i]\n \n return newString","runtime":"70"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels= ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowels_list=[]\n index_list=[]\n\n for i in range(len(s)):\n if s[i] in vowels:\n vowels_list.append(s[i])\n\n word=[]\n count=0\n for i in range(0,len(s)):\n if s[i] in vowels:\n word.append(vowels_list[len(vowels_list)-count-1])\n count= count+1\n else:\n word.append(s[i])\n\n\n\n\n return \"\".join(word)\n\n\n ","runtime":"70"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n vowel_list = list()\n replaced = 0\n for element in s: \n if self.isVowel(element): \n vowel_list.append(element)\n\n print(vowel_list)\n for i in range(len(s)): \n if self.isVowel(s[i]): \n s_list[i] = vowel_list[-1]\n vowel_list.pop(-1)\n return ''.join(s_list)\n\n\n def isVowel(self, s : str) -> bool: \n return s.lower() in [\"a\",\"i\",\"e\",\"o\",\"u\"]\n ","runtime":"72"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n result = \"\"\n for i in s:\n if i.lower() in \"aeiou\":\n result = i + result \n return_str = \"\"\n k =0\n for i in range(len(s)):\n if s[i].lower() in \"aeiou\":\n return_str += result[k]\n k += 1\n else:\n return_str += s[i]\n return return_str","runtime":"72"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n vowel_list = list()\n replaced = 0\n for element in s: \n if self.isVowel(element): \n vowel_list.append(element)\n\n for i in range(len(s)): \n if self.isVowel(s[i]): \n s_list[i] = vowel_list[-1]\n vowel_list.pop(-1)\n return ''.join(s_list)\n\n\n def isVowel(self, s : str) -> bool: \n return s.lower() in [\"a\",\"i\",\"e\",\"o\",\"u\"]\n ","runtime":"74"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n def isvowel(l: str):\n return l in list('aeiouAEIOU')\n\n vpos = []\n\n s = list(s)\n for i,l in enumerate(s):\n if isvowel(l):\n vpos.append((i,l))\n \n\n for (i1,v1), (i2,v2) in zip(vpos[:len(vpos)//2], vpos[len(vpos)//2:][::-1]):\n s[i1], s[i2] = v2, v1\n\n return ''.join(s)","runtime":"74"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n req_list = ['a','e','i','o','u','A','I','E','O','U']\n val = [(pos,char) for pos, char in enumerate(s) if char in req_list]\n s_list = list(s)\n print(val)\n for i in range (len(val)//2):\n print(val[i])\n print(val[-i-1])\n s_list[val[i][0]] = val[-i-1][1]\n s_list[val[-i-1][0]] = val[i][1]\n\n return \"\".join(s_list)\n \n","runtime":"76"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n def isvowel(l: str):\n return l in list('aeiouAEIOU')\n\n vpos = []\n\n s = list(s)\n for i,l in enumerate(s):\n if isvowel(l):\n vpos.append((i,l))\n \n\n for (i1,v1), (i2,v2) in zip(vpos[:len(vpos)//2], vpos[len(vpos)//2:][::-1]):\n s[i1], s[i2] = v2, v1\n\n return ''.join(s)","runtime":"76"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = []\n result = []\n for char in s:\n if(char == 'a'or char == 'A' or char == 'e'or char == 'E'or char == 'i'or char == 'I' or char == 'o'or char == 'O'or char == 'u'or char == 'U'):\n vowels.append(char)\n for i in range(len(s)):\n if(s[i] == 'a'or s[i] == 'A' or s[i] == 'e'or s[i] == 'E'or s[i] == 'i'or s[i] == 'I' or s[i] == 'o'or s[i] == 'O'or s[i] == 'u'or s[i] == 'U'):\n result.append(vowels[-1])\n vowels.pop()\n else:\n result.append(s[i])\n \n reversedVowels = \"\".join(result)\n \n return reversedVowels\n \n# TC: O(n)\n# SC: O(n)\n ","runtime":"78"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n vowels = [\"A\", \"E\", \"I\", \"O\", \"U\", \"a\", \"e\", \"i\", \"o\", \"u\"]\n\n vowels_list = []\n output_temp = []\n output = []\n\n for c in s:\n for v in vowels:\n if c == v:\n vowels_list.append(c)\n\n print(vowels_list)\n vowels_list.reverse()\n print(vowels_list)\n\n vowel_idx = 0\n\n for c in s:\n if c in vowels:\n output.append(vowels_list[vowel_idx])\n vowel_idx += 1\n else:\n output.append(c)\n\n print(\"\".join(output))\n return \"\".join(output)\n","runtime":"78"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n # Two pointers, start from left until hit a vowel\n # Go from right til you hit a vowel\n # If they are not the same index then swap them\n # End while when you get to a different index\n strlist = list(s)\n stack = []\n print(strlist)\n for index, char in enumerate(strlist):\n if char.lower() in vowels:\n stack.append(char)\n print(stack)\n for index, char in enumerate(strlist):\n if char.lower() in vowels:\n print(strlist[index])\n strlist[index] = stack.pop(-1)\n print(strlist[index])\n return \"\".join(strlist)\n\n \n","runtime":"85"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','A', 'i', 'I', 'u', 'U', 'e', 'E', 'o', 'O']\n num = 0\n count_bottom = 1\n list_s = list(s)\n top_switch = ''\n bottom_switch = ''\n top_num = 100\n bottom_num = 100\n while True:\n if top_switch != '' and bottom_switch != '':\n list_s[top_num] = bottom_switch\n list_s[bottom_num] = top_switch \n top_switch = ''\n bottom_switch = ''\n num += 1\n count_bottom += 1\n if num + count_bottom > int(len(list_s)):\n break\n top_s = list_s[num]\n bottom_s = list_s[-count_bottom]\n\n if top_s in vowels:\n top_switch = top_s\n top_num = num\n else:\n num += 1\n print(\"top\",top_switch)\n \n if bottom_s in vowels:\n bottom_switch = bottom_s\n bottom_num = - count_bottom\n else:\n count_bottom += 1\n print(\"bottom\",bottom_switch)\n \n return ''.join(list_s)\n \n \n\n\n ","runtime":"85"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u']\n d = {}\n d_vowels = {}\n lst = []\n for idx, val in enumerate(s):\n d.update({idx: val})\n if val.lower() in vowels:\n d_vowels.update({idx: val})\n lst.append([idx,val])\n new_lst = lst[::-1]\n new_order = [[lst[i][0], new_lst[i][1]] for i in range(len(lst))]\n for i in new_order:\n d[i[0]] = i[1]\n new_str = ''\n for k, v in d.items():\n new_str += v\n return new_str\n \n\n\n ","runtime":"87"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n def isVowel(c):\n return c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u' or c == 'A' or c == 'E' or c == 'I' or c == 'O' or c == 'U'\n \n s_list = list(s)\n i, j = 0, len(s_list) - 1\n\n while i <= j:\n if isVowel(s_list[i]) and isVowel(s_list[j]):\n s_list[i], s_list[j] = s_list[j], s_list[i]\n i += 1\n j -= 1\n elif not isVowel(s_list[i]) and isVowel(s_list[j]):\n i += 1\n elif isVowel(s_list[i]) and not isVowel(s_list[j]):\n j -= 1\n else:\n i += 1\n j -= 1\n \n return ''.join(s_list)","runtime":"87"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n s_list = list(s)\n \n front_pointer = 0\n back_pointer = len(s) - 1\n\n while front_pointer < back_pointer:\n if s_list[front_pointer] in vowels:\n while not_found_vowel := True:\n print(front_pointer, back_pointer)\n if s_list[back_pointer] in vowels and s_list[front_pointer] in vowels:\n s_list[front_pointer], s_list[back_pointer] = s_list[back_pointer], s_list[front_pointer]\n \n front_pointer += 1\n back_pointer -= 1\n not_found_vowel = False\n\n if (s_list[back_pointer] not in vowels) and (back_pointer > 0):\n back_pointer -= 1\n else:\n break\n else:\n front_pointer += 1\n\n return ''.join(s_list)","runtime":"89"},{"code":"class Solution:\n def isVowel(self, char) -> bool:\n vowels = set(['a', 'e', 'i', 'o', 'u'])\n return char.lower() in vowels\n\n def reverseVowels(self, s: str) -> str:\n # Reverse only vowels: a, e, i, o, u\n # Retain its state of lowercase/uppercase\n \n # store our string in an array of same length\n # have two pointers, one iterating from the left, one iterating from the right\n # have a loop, condition to end when left and right meet each other\n # if left pointer sees a vowel but right doesn't \n # add that character that right pointer points at to our res str\n # right -= 1\n # if left pointer doesn't see a vowel but right does\n # add that character that left pointer points at to our res str\n # left += 1\n # if both are pointing at vowels \n # do the swap\n # right -= 1\n # left += 1\n # return the constructed string by joining the list\n\n output = [x for x in s] # unpack s into a list of character\n left, right = 0, len(s) - 1\n\n while left < right:\n left_bool = self.isVowel(s[left])\n right_bool = self.isVowel(s[right])\n if left_bool and right_bool:\n output[left] = s[right]\n output[right] = s[left]\n left += 1\n right -= 1\n continue\n if not left_bool:\n left += 1\n if not right_bool:\n right -= 1\n \n return ''.join(output)","runtime":"89"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n list=[]\n st=\"\"\n for i in range(len(s)):\n if s[i]=='a'or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U':\n list.append(s[i])\n list.reverse()\n index=0\n for i in range(len(s)):\n if s[i]=='a'or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U':\n st=st+list[index]\n index=index+1\n else:\n st=st+s[i]\n return st ","runtime":"92"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n if len(s) == 1:\n return s\n left = 0\n right = len(s) - 1\n l = \"\"\n r = \"\"\n v = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n while left <= right:\n if left == right:\n l = l + s[left]\n left = left + 1\n elif s[left] in v and s[right] in v:\n l = l + s[right]\n r = s[left] + r\n elif s[left] not in v and s[right] not in v:\n l = l + s[left]\n r = s[right] + r\n elif s[left] in v:\n left = left - 1\n r = s[right] + r\n elif s[right] in v:\n right = right + 1\n l = l + s[left]\n\n left = left + 1\n right = right - 1\n return l + r","runtime":"92"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n n = len(s)\n\n left = \"\"\n\n right = \"\"\n\n i = 0\n\n j = n - 1\n\n while i < j:\n\n while i < j and s[i] not in ['a','e','i','o','u','A','E','I','O','U']:\n\n left = left + s[i]\n\n i += 1\n\n while i < j and s[j] not in ['a','e','i','o','u','A','E','I','O','U']:\n\n right = s[j] + right\n\n j -= 1\n\n if i >= j:\n\n break\n\n left = left + s[j]\n\n right = s[i] + right\n\n i += 1\n\n j -= 1\n\n return left + (s[i] if i == j else \"\") + right\n ","runtime":"94"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel_index = []\n vowels = 'aeiouAEIOU'\n s = list(s)\n for i in range(len(s)):\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':\n vowel_index.append(i)\n \n a = ''.join(s)\n a = list(a)\n r_vi = vowel_index[::-1]\n l = len(r_vi)\n for i in range(l):\n print(vowel_index[i])\n print(r_vi[i])\n print(a[vowel_index[i]])\n print(s[r_vi[i]])\n a[vowel_index[i]] = s[r_vi[i]]\n\n return ''.join(a)","runtime":"94"},{"code":"vowels = set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'])\n\nclass Solution:\n def reverseVowels(self, s: str) -> str:\n n = len(s)\n\n resLeft = resRight = ''\n\n left, right = 0, n - 1\n\n while left <= right:\n if left == right:\n resLeft += s[left]\n # print('here?')\n break\n # print('left', left, s[left], 'right', right, s[right])\n\n if s[left] not in vowels:\n # print('1')\n resLeft += s[left]\n left += 1\n elif s[right] not in vowels:\n # print('2')\n resRight = s[right] + resRight\n right -= 1\n else:\n # print('3')\n resLeft += s[right]\n resRight = s[left] + resRight\n left += 1\n right -= 1\n\n\n # print('resLeft', resLeft)\n # print('resRight', resRight)\n\n\n return resLeft + resRight\n\n\n\n\n\n\n\n\n\n\n\n\"\"\"\n\nleetcode\ns = 'eeoe'\nleotcede\n\n\nle e tc od e\n\n\n\n\n\n\n\n\"\"\"\n\n\n\n ","runtime":"96"},{"code":"class Solution:\n def isVowel(self, c: str) -> bool:\n return c in set('aeiouAEIOU')\n\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n i = 0\n j = len(s)-1\n\n while i<j:\n if self.isVowel(s[i]) and self.isVowel(s[j]):\n s[i], s[j] = s[j], s[i]\n i+=1\n j-=1\n elif not self.isVowel(s[i]):\n i+=1\n elif not self.isVowel(s[j]):\n j-=1\n\n return \"\".join(s)\n\n ","runtime":"96"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"A\", \"e\", \"E\", \"i\", \"I\", \"o\", \"O\", \"u\", \"U\"]\n vowelstr = \"\"\n result = \"\"\n index = -1\n for i in s:\n if i in vowels:\n vowelstr = vowelstr + i\n for j in range(len(s)):\n if s[j] in vowels:\n result = result[:j] + vowelstr[index] + result[j:]\n index = index - 1\n else:\n result = result + s[j]\n return result\n\n ","runtime":"98"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n chaine_inversee=s[::-1]\n chaine_voyelle_inversee=\"\"\n for j in chaine_inversee:\n if j.lower() == 'a' or j.lower() == 'e' or j.lower() == 'i' or j.lower() == 'o' or j.lower() == 'u' :\n chaine_voyelle_inversee+=j\n chaine_res=\"\"\n for k,x in enumerate(s):\n if x.lower() == 'a' or x.lower() == 'e' or x.lower() == 'i' or x.lower() == 'o' or x.lower() == 'u' :\n chaine_res+=chaine_voyelle_inversee[0]\n chaine_voyelle_inversee=chaine_voyelle_inversee[1:]\n else:\n chaine_res+=s[k]\n return chaine_res","runtime":"98"},{"code":"class Solution:\n def swap(self, s: str, idx1: int, idx2: int) -> None:\n temp = s[idx1]\n s[idx1] = s[idx2]\n s[idx2] = temp\n\n def isVowel(self, ch: str) -> bool:\n return ch.lower() in set([\"a\", \"e\", \"i\", \"o\", \"u\"])\n\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n start, end = 0, len(s) - 1\n while start < end:\n if self.isVowel(s[start]) and self.isVowel(s[end]):\n self.swap(s, start, end)\n start += 1\n end -= 1\n if not self.isVowel(s[start]):\n start += 1\n if not self.isVowel(s[end]):\n end -= 1\n return ''.join(s)\n ","runtime":"100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','A', 'i', 'I', 'u', 'U', 'e', 'E', 'o', 'O']\n num = 0\n count_bottom = 1\n list_s = list(s)\n top_switch = ''\n bottom_switch = ''\n top_num = 100\n bottom_num = 100\n while True:\n if top_switch != '' and bottom_switch != '':\n list_s[top_num] = bottom_switch\n list_s[bottom_num] = top_switch \n top_switch = ''\n bottom_switch = ''\n num += 1\n count_bottom += 1\n if num + count_bottom > int(len(list_s)):\n break\n top_s = list_s[num]\n bottom_s = list_s[-count_bottom]\n\n if top_s in vowels:\n top_switch = top_s\n top_num = num\n else:\n num += 1\n print(\"top\",top_switch)\n \n if bottom_s in vowels:\n bottom_switch = bottom_s\n bottom_num = - count_bottom\n else:\n count_bottom += 1\n print(\"bottom\",bottom_switch)\n \n return ''.join(list_s)\n \n \n\n\n ","runtime":"100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel = set(['a', 'e', 'i', 'o', 'u'])\n s_arr = list(s)\n l, r = 0, len(s) - 1\n while (l <= r):\n print(l, r)\n if s_arr[l].lower() not in vowel:\n l += 1\n elif s_arr[r].lower() not in vowel:\n r -= 1\n else:\n s_arr[l], s_arr[r] = s_arr[r], s_arr[l]\n l += 1\n r -= 1\n return \"\".join(s_arr)","runtime":"103"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n index = []\n char = []\n for charIndex in range(len(s_list)):\n if s_list[charIndex] in \"AEIOUaeiou\":\n index.append(charIndex)\n char.append(s_list[charIndex])\n char.reverse()\n for i in index:\n charWord = char.pop(0)\n s_list[i] = charWord\n return \"\".join(s_list)","runtime":"103"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set('aeiouAEIOU') # Use a set for O(1) lookup\n vowel_list = [char for char in s if char in vowels] # Collect all vowels\n vowel_list.reverse() # Reverse the list of vowels\n \n # Build the result string with reversed vowels\n result = []\n for char in s:\n if char in vowels:\n result.append(vowel_list.pop(0)) # Append the next vowel from the reversed list\n else:\n result.append(char)\n \n return ''.join(result)","runtime":"105"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n i = 0\n j = len(s) - 1 \n result = [c for c in s]\n\n while i <= j:\n print(i)\n print(j)\n if self.isVowel(s[i]) and self.isVowel(s[j]):\n temp = result[i]\n result[i] = result[j]\n result[j] = temp\n i += 1\n j -= 1\n elif self.isVowel(s[i]):\n j -= 1\n elif self.isVowel(s[j]):\n i += 1\n else:\n i += 1\n j -= 1\n newStr = \"\"\n return newStr.join(result)\n\n\n def isVowel(self, s):\n return s.lower() in (\"a\", \"e\", \"i\", \"o\", \"u\")","runtime":"105"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"AEIUOaeiou\"\n vls = [char for char in s if char in vowels][::-1]\n print(vls)\n res = []\n for char in s:\n if char in vowels:\n res.append(vls.pop(0))\n else:\n res.append(char)\n\n return ''.join(res)\n \nx = Solution()\nx.reverseVowels(\"leetcode\")","runtime":"107"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set('aeiouAEIOU')\n \n vowel_list = [char for char in s if char in vowels]\n vowel_list.reverse()\n result = []\n for char in s:\n if char in vowels:\n result.append(vowel_list.pop(0))\n else:\n result.append(char)\n \n return ''.join(result)","runtime":"107"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set('aeiouAEIOU')\n list = [char for char in s if char in vowels]\n list.reverse()\n result = []\n for char in s:\n if char in vowels:\n result.append(list.pop(0))\n else:\n result.append(char)\n return ''.join(result)","runtime":"109"},{"code":"class Solution:\n def isVowel(self, c: str) -> bool:\n return c in set('aeiouAEIOU')\n\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n i = 0\n j = len(s)-1\n\n while i<j:\n if self.isVowel(s[i]) and self.isVowel(s[j]):\n s[i], s[j] = s[j], s[i]\n i+=1\n j-=1\n elif not self.isVowel(s[i]):\n i+=1\n elif not self.isVowel(s[j]):\n j-=1\n\n return \"\".join(s)\n\n ","runtime":"109"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n v = 'aeiouAEIOU'\n r = []\n for i in s:\n if i in v:\n r.append(i)\n r.reverse()\n f =[]\n for i in s:\n if i in v:\n f.append(r.pop(0))\n else:\n f.append(i)\n return ''.join(f)\n\n\n\n\n ","runtime":"111"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n low = ['a','e','i','o','u']\n up = [v.upper() for v in ['a','e','i','o','u']]\n vow = set(up + low)\n vowels = [v for v in list(s) if v in vow][::-1]\n out = ''\n\n for letter in list(s):\n if letter in vow:\n v = vowels.pop(0)\n out += v\n else:\n out += letter\n\n return out\n\n","runtime":"111"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','e','i','o','u']\n s_indices = []\n s_vowels = []\n\n for i, char in enumerate(s):\n if char.lower() in vowels:\n s_indices.append(i)\n s_vowels.append(char)\n \n # reverse vowels\n s_indices = s_indices[::-1]\n res = list(s)\n for char in s_vowels:\n res[s_indices[0]] = char\n s_indices.pop(0)\n\n return \"\".join(res)\n","runtime":"113"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','e','i','o','u']\n s_indices = []\n s_vowels = []\n\n for i, char in enumerate(s):\n if char.lower() in vowels:\n s_indices.append(i)\n s_vowels.append(char)\n \n # reverse vowels\n s_indices = s_indices[::-1]\n res = list(s)\n for char in s_vowels:\n res[s_indices[0]] = char\n s_indices.pop(0)\n\n return \"\".join(res)\n","runtime":"113"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vow = []\n act = []\n for i in s:\n if i in set('aeiouAEIOU'):\n vow.append(i)\n act.append('_')\n else:\n act.append(i)\n vow.reverse()\n for enu,i in enumerate(act):\n if i=='_':\n act[enu]=vow.pop(0)\n return ''.join(act)","runtime":"116"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = 'aeiouAEIOU'\n s_list = list(s) # Convert the string to a list for in-place modifications\n vowel_dict = {} # Dictionary to store positions and vowels\n\n # Collect vowels and their positions\n for index, char in enumerate(s_list):\n if char in vowels:\n vowel_dict[index] = char\n\n # Get the reversed list of vowels\n reversed_vowels = list(vowel_dict.values())[::-1]\n\n # Replace vowels in the list using the reversed vowels\n for index, char in vowel_dict.items():\n s_list[index] = reversed_vowels.pop(0)\n \n return ''.join(s_list)","runtime":"116"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n vowels = [\"A\", \"a\", \"E\", \"e\", \"I\", \"i\", \"O\", \"o\", \"U\", \"u\"]\n s_as_list = list(s)\n \n s_len = len(s)\n l_pointer = 0\n r_pointer = s_len-1\n\n for i in range(s_len):\n\n if l_pointer >= r_pointer:\n return \"\".join(s_as_list)\n\n print(\"Left pointer: \", s[l_pointer], \" Right pointer: \", s[r_pointer]) \n\n if s[l_pointer] in vowels and s[r_pointer] in vowels:\n print(s[l_pointer], \" changes with \", s[r_pointer])\n l_temp = s[l_pointer]\n r_temp = s[r_pointer]\n s_as_list[l_pointer] = r_temp\n s_as_list[r_pointer] = l_temp\n l_pointer += 1\n r_pointer -= 1\n\n elif s[r_pointer] in vowels and s[l_pointer] not in vowels and l_pointer+1 < s_len:\n l_pointer += 1\n\n elif s[l_pointer] in vowels and s[r_pointer] not in vowels and r_pointer-1 >= 0:\n r_pointer -= 1\n \n elif s[l_pointer] not in vowels and s[r_pointer] not in vowels and r_pointer-1 >= 0 and l_pointer+1 < s_len:\n l_pointer += 1\n r_pointer -= 1\n\n return \"test\"\n ","runtime":"118"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = 'aeiouAEIOU'\n letters = []\n indexes = []\n for i in reversed(range(len(s))):\n if s[i] in vowels:\n letters.append(s[i])\n indexes.append(i)\n\n split_letters = [x for x in s]\n \n for i in reversed(indexes):\n split_letters[i] = letters.pop(0)\n\n new_string = ''\n\n for l in split_letters:\n new_string += l\n\n return new_string\n\n\n ","runtime":"118"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u']\n lWord = list(s)\n toRev = []\n for i in range(len(lWord)):\n c = lWord[i]\n if c.lower() in vowels:\n toRev.append(c)\n toRev.reverse()\n\n for i in range(len(lWord)):\n ch = lWord[i].lower()\n if ch in vowels:\n lWord[i] = toRev.pop(0)\n\n\n return ''.join(lWord)\n ","runtime":"120"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n lst=[]\n lstr=[]\n for i in s:\n lst.append(i)\n for i in range(len(lst)):\n if lst[i] in ['A','E','I','O','U','a','e','i','o','u']:\n lstr.append(lst[i])\n lst[i]='#'\n #hello-->h#ll#\n lstr.reverse()\n for i in range(len(lst)):\n if lst[i]=='#':\n lst[i]=lstr.pop(0)\n if lstr==[]:\n break\n return ''.join(lst)\n\n \n","runtime":"120"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vol_str=\"aeiouAEIOU\"\n lst = []\n s_split = list(s)\n print(s_split)\n for i in range(len(s_split)):\n if s_split[i] in vol_str:\n print(\"hi\")\n lst.append(s_split[i])\n s_split[i]=\"_\"\n\n lst.reverse()\n s_new=\"\"\n for i in range(len(s_split)):\n \n if s_split[i] ==\"_\":\n s_split[i]=lst.pop(0)\n s_new+=s_split[i]\n else:\n s_new+=s_split[i]\n return s_new","runtime":"122"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n vowels = ['a', 'e', 'i', 'o', 'u']\n stack = []\n for i in range(len(s)):\n if s_list[i].lower() in vowels:\n stack.append(s_list[i])\n for i in range(len(s_list) - 1, -1, -1):\n if s_list[i].lower() in vowels:\n s_list[i] = stack.pop(0)\n return ''.join(s_list)\n","runtime":"122"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s=list(s)\n p=[]\n for i in range(len(s)):\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U'):\n p.append(s[i])\n s[i]=\"11\"\n p=p[::-1]\n for i in range(len(s)):\n if s[i]==\"11\":\n s[i]=p[0]\n del p[0]\n else:\n continue\n return \"\".join(s)","runtime":"124"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n vowels = ['a', 'e', 'i', 'o', 'u']\n stack = []\n for i in range(len(s)):\n if s_list[i].lower() in vowels:\n stack.append(s_list[i])\n for i in range(len(s_list) - 1, -1, -1):\n if s_list[i].lower() in vowels:\n s_list[i] = stack.pop(0)\n return ''.join(s_list)\n","runtime":"124"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n \n a = set({'a','e','i','o','u'})\n\n vowels_list = []\n\n for i in s:\n if i.lower() in a:\n vowels_list.append(i)\n\n # reverse vowels\n vowels_list = vowels_list[::-1]\n\n new_str=[]\n print(vowels_list)\n for i in range(len(s)):\n if s[i].lower() in a:\n new_str.append(vowels_list.pop(0)) \n else:\n new_str.append(s[i])\n print(\"\".join(new_str))\n return \"\".join(new_str)\n ","runtime":"127"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n \n a = set({'a','e','i','o','u'})\n\n vowels_list = []\n\n for i in s:\n if i.lower() in a:\n vowels_list.append(i)\n\n # reverse vowels\n vowels_list = vowels_list[::-1]\n\n new_str=[]\n\n for i in range(len(s)):\n if s[i].lower() in a:\n new_str.append(vowels_list.pop(0)) \n else:\n new_str.append(s[i])\n return \"\".join(new_str)\n ","runtime":"127"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels=set('aeiouAEIOU')\n vowellist=[]\n for char in s:\n if char in vowels:\n vowellist.append(char)\n\n vowellist.reverse()\n\n result=''\n for char in s:\n if char in vowels:\n result+=vowellist.pop(0)\n else:\n result+=char\n return result\n ","runtime":"129"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vl = []\n vowel = ['a', 'e','i','o','u']\n for i in range(len(s)):\n if s[i].lower() in vowel :\n vl.append(s[i])\n vl = vl[::-1]\n\n string_list = list(s)\n\n for i in range(len(string_list)):\n if string_list[i].lower() in vowel:\n string_list[i] = vl[0]\n\n vl.pop(0)\n new_string = ''.join(string_list)\n return new_string","runtime":"129"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','A','E','e','i','I','o','O','u','U']\n vowelWord = \"\"\n for letter in s:\n if letter in vowels:\n vowelWord+= letter\n reversedWord = list(vowelWord[::-1])\n new = \"\"\n for n in range(len(s)):\n if s[n] in vowels:\n new +=reversedWord[0]\n reversedWord.pop(0)\n else:\n new += s[n]\n return new\n","runtime":"131"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n print(s)\n vowels = ['a','e','i','o','u']\n vowel_flag = [0]*len(s)\n discovered_vowels = []\n\n for i,c in enumerate(s):\n if c.lower() in vowels:\n vowel_flag[i]=1\n discovered_vowels.append(c)\n\n print(discovered_vowels)\n \n # Reverse the elements of the list\n discovered_vowels.reverse()\n print(discovered_vowels)\n\n # Place the vowels in the location\n new_string = \"\"\n for i,v in enumerate(vowel_flag):\n if v:\n new_string += discovered_vowels.pop(0)\n else:\n new_string += s[i]\n\n return new_string\n ","runtime":"131"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n out = \"\"\n j = len(s)-1\n st = []\n while(j >=0):\n if s[j].lower() in ['a','e','i','o','u']:\n st.append(s[j])\n j -= 1\n for i in s:\n if i.lower() not in ['a','e','i','o','u']:\n out = out + i\n else:\n out = out + st.pop(0)\n return out\n ","runtime":"133"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n \n word= []\n l2= []\n st = [\"A\",\"E\",\"I\",\"O\",\"U\",\"a\",\"e\",\"i\",\"o\",\"u\"]\n\n\n for i in range (len(s)):\n if s[i] in st:\n l2.append(s[i])\n word.append(0)\n else:\n word.append(s[i])\n \n \n l2.reverse()\n\n for i in range(len(word)):\n if word[i] == 0:\n word[i] = l2[0]\n l2.pop(0) \n \n final = \"\"\n\n for i in word:\n final = final + str(i)\n \n return final","runtime":"133"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','e','i','o','u']\n vowel_flag = [0]*len(s)\n discovered_vowels = []\n\n for i,c in enumerate(s):\n if c.lower() in vowels:\n vowel_flag[i]=1\n discovered_vowels.append(c)\n \n # Reverse the elements of the list\n discovered_vowels.reverse()\n # Place the vowels in the location\n new_string = \"\"\n for i,v in enumerate(vowel_flag):\n if v:\n new_string += discovered_vowels.pop(0)\n else:\n new_string += s[i]\n\n return new_string\n ","runtime":"135"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n #crap solution\n vowels = ['a', 'e', 'i', 'o', 'u']\n lWord = list(s)\n toRev = []\n for i in range(len(lWord)):\n c = lWord[i]\n if c.lower() in vowels:\n toRev.append(c)\n toRev.reverse()\n\n for i in range(len(lWord)):\n ch = lWord[i].lower()\n if ch in vowels:\n lWord[i] = toRev.pop(0)\n\n\n return ''.join(lWord)\n ","runtime":"135"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','A','E','e','i','I','o','O','u','U']\n vowelWord = \"\"\n for letter in s:\n if letter in vowels:\n vowelWord+= letter\n reversedWord = list(vowelWord[::-1])\n new = \"\"\n for n in range(len(s)):\n if s[n] in vowels:\n new +=reversedWord[0]\n reversedWord.pop(0)\n else:\n new += s[n]\n return new\n","runtime":"138"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vow = ['a', 'e', 'i', 'o', 'u', 'A' ,'E', 'I', 'O', 'U']\n extractedVow = []\n\n for i in range(len(s)):\n if s[i] in vow:\n extractedVow.append(s[i])\n\n extractedVow.reverse() \n s = list(s)\n for i in range(len(s)):\n if s[i] in vow:\n s[i] = extractedVow.pop(0)\n \n return \"\".join(s)\n \n\n","runtime":"138"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vow = []\n act = []\n for i in s:\n if i in set('aeiouAEIOU'):\n vow.append(i)\n act.append('_')\n else:\n act.append(i)\n vow.reverse()\n for enu,i in enumerate(act):\n if i=='_':\n act[enu]=vow.pop(0)\n return ''.join(act)","runtime":"140"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n length = len(s)\n rev = []\n ret = \"\"\n\n for i in range(length):\n if(re.search(r'[aeiouAEIOU]', s[i])):\n rev.append(s[i])\n \n rev.reverse()\n\n j = 0\n for i in range(length):\n if(re.search(r'[aeiouAEIOU]', s[i])):\n ret += rev[j]\n j+=1\n else:\n ret += s[i]\n \n return ret","runtime":"140"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels=['a','e','i','o','u','A','E','I','O','U']\n revvowel=[]\n\n \n\n for i in range(len(s)):\n if s[i] in vowels:\n revvowel.append(s[i])\n \n # print(revvowel)\n revvowel.reverse()\n \n # for i in range(len(s)):\n # if s[i] in vowels:\n # # s[i]=revvowel[0]\n\n # s=s[:i] + revvowel[0] + s[i + 1:]\n # revvowel.pop(0)\n \n # return s\n\n s_list = list(s)\n\n for i in range(len(s_list)):\n if s_list[i] in vowels:\n s_list[i] = revvowel.pop(0)\n \n return ''.join(s_list)","runtime":"142"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['A', 'E', 'I', 'O', 'U', 'a', 'e', 'i', 'o', 'u']\n our_vowels = []\n result = []\n print(s)\n for ele in s: \n if ele in vowels: \n our_vowels.append(ele)\n print(our_vowels)\n\n our_vowels = our_vowels[::-1]\n print(our_vowels)\n for ele in range(0, len(s)): \n if s[ele] in vowels: \n result.append(our_vowels[0])\n \n del our_vowels[0]\n else: \n result.append(s[ele])\n return ''.join(result)\n \n","runtime":"142"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n #can be upper/lower more than once \n #reverse -> use a stack\n\n #individual two traversals? \n vowList = []\n vowPos = []\n vowels = ['a', 'e', 'i', 'o', 'u']\n ret = \"\"\n\n for i in range(len(s)):\n if s[i:i+1].lower() in vowels:\n vowList.append(s[i:i+1])\n vowPos.append(i)\n\n if len(vowList) <= 0:\n return s\n\n last = 0 \n for i in range(len(vowPos)):\n if vowPos[i] == 0:\n ret += vowList.pop()\n last = vowPos[i] + 1 \n else:\n ret = ret + s[last: vowPos[i]] + vowList.pop()\n last = vowPos[i] + 1 \n \n if(last < len(s)):\n ret += s[last:]\n\n return ret\n\n ","runtime":"144"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n right=0\n left=len(s)-1\n s=list(s)\n vowels=['a','e','i','o','u','A','E','I','O','U']\n\n while right<=left:\n print(\" I am in while loop \", right, left )\n if s[right] not in vowels:\n print(\"right is not vowel\", right)\n right=right+1\n elif s[left] not in vowels:\n print(\"right is not vowel\", left)\n left=left-1\n else:\n print(\"switch both right and left\", s[right], s[left])\n s[right], s[left]= s[left], s[right]\n right=right+1\n left=left-1\n return ''.join(s)\n","runtime":"144"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n positioning = []\n idx =0\n finalstr = \"\"\n vowels = ['a','e','i','o','u','A','E','I','O','U']\n\n for i in range(len(s)):\n if s[i] in vowels:\n positioning.append((s[i],idx))\n idx+=1\n\n positioning.sort(key=lambda a: a[1],reverse =True)\n for i in range(len(s)):\n if s[i] in vowels:\n finalstr+= positioning[0][0]\n positioning.pop(0)\n else:\n finalstr += s[i] \n \n return finalstr","runtime":"146"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel_list = ['a', 'e', 'i', 'o', 'u']\n appearance_list = []\n result = ''\n for letter in s:\n if letter.lower() in vowel_list:\n appearance_list.append(letter)\n appearance_list = appearance_list[::-1]\n print()\n for i in range(len(s)):\n if s[i].lower() in vowel_list:\n result += appearance_list.pop(0)\n else:\n result += s[i]\n return result\n","runtime":"146"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n\n s = list(s)\n\n letters = []\n pos = []\n\n for i, letter in enumerate(s):\n if(letter in vowels):\n letters.append(letter)\n pos.insert(0, i)\n\n for i, position in enumerate(pos):\n s[position] = letters[i]\n return \"\".join(s) ","runtime":"148"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n ans = ''\n vowels = {'a':1,'e':1,'i':1,'o':1,'u':1, \"A\":1, \"E\":1,\"I\":1,\"O\":1,\"U\":1}\n vowel_list = []\n for i in range(len(s)):\n try: \n if vowels[s[i]]:\n vowel_list.append(i)\n except KeyError:\n continue\n vowel_list.reverse()\n for i in range(len(s)):\n try: \n if vowels[s[i]]:\n ans += s[vowel_list[0]]\n vowel_list.pop(0)\n except KeyError:\n ans += s[i]\n return ans\n","runtime":"148"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n buf = list(s)\n myset = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}\n vowels = []\n indexs = []\n\n for i in range(len(s)):\n if s[i] in myset:\n vowels.append(s[i])\n indexs.insert(0, i)\n \n for i in range(len(indexs)):\n buf[indexs[i]] = vowels[i]\n \n answer = ''.join(buf)\n return answer","runtime":"157"},{"code":"class Solution:\n def isVowel(self, letter: str) -> bool:\n l = letter.lower()\n if (l == 'a' or l == 'e' or l == 'i' or l == 'o' or l == 'u'):\n return True\n return False\n\n def reverseVowels(self, s: str) -> str:\n vowels = []\n locations = []\n for i in range(len(s)):\n if self.isVowel(s[i]):\n vowels.append(s[i])\n locations.insert(0,i)\n \n sList = list(s)\n for i in range(len(vowels)):\n sList[locations[i]] = vowels[i]\n return ''.join(sList)","runtime":"157"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n vowel_indices = []\n vowels = []\n\n for i, c in enumerate(s):\n if c in 'AEIOUaeiou':\n vowel_indices.append(i)\n vowels.insert(0, c)\n\n for i, index in enumerate(vowel_indices):\n s[index] = vowels[i]\n\n return ''.join(s)","runtime":"159"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n v='AEIOUaeiou'\n r=[]\n p=[]\n a=''\n for i in range (len(s)-1,-1,-1):\n if s[i] in v:\n r.append(s[i])\n p.insert(0,i)\n print(r,p)\n if r == []:\n return s\n t=0\n t2=0\n print(len(p))\n while t2< len(p):\n a+=s[t:p[t2]]\n t=p[t2]+1\n a+=r[t2]\n t2+=1\n if t < len(s):\n a+=s[t:]\n return a\n","runtime":"159"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n\n contained_vowels = []\n positions = []\n\n for i in range(len(s)):\n if s[i] in vowels:\n contained_vowels.append(s[i])\n positions.insert(0,i)\n s_list = list(s)\n for i in range(len(positions)):\n s_list[positions[i]] = contained_vowels[i]\n s = ''.join(s_list)\n\n return s\n\n\n\n\n ","runtime":"162"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n let = []\n index = []\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n for i in range(len(s)):\n if (s[i] in vowels):\n index.append(i)\n let.insert(0,s[i])\n for i in range(len(let)):\n s[index[i]] = let[i]\n return \"\".join(s)\n\n ","runtime":"162"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n foundv = []\n foundi = []\n for i in range(len(s)):\n if s[i] in vowels:\n foundv.insert(0, s[i])\n foundi.append(i)\n res = list(s)\n for i in range(len(foundv)):\n res[foundi[i]] = foundv[i]\n return \"\".join(res) \n\n\n ","runtime":"164"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n #main method\n vowels = []\n for c in s:\n if self.is_vowel(c):\n vowels.insert(0,c)\n\n i = 0\n vowel_index = 0\n result = \"\"\n for i, e in enumerate(s):\n if self.is_vowel(e):\n result += vowels[vowel_index]\n vowel_index += 1\n else:\n result += e\n i += 1\n return result\n\n \n def is_vowel(self, c):\n upper_case = \"AEIOUaeiou\"\n \n if c in upper_case:\n return True\n\n return False\n ","runtime":"164"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n v='AEIOUaeiou'\n r=[]\n p=[]\n a=''\n for i in range (len(s)-1,-1,-1):\n if s[i] in v:\n r.append(s[i])\n p.insert(0,i)\n print(r,p)\n if r == []:\n return s\n t=0\n t2=0\n print(len(p))\n while t2< len(p):\n a+=s[t:p[t2]]\n t=p[t2]+1\n a+=r[t2]\n t2+=1\n if t < len(s):\n a+=s[t:]\n return a\n","runtime":"166"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n v = []\n vowels = ('a', 'e', 'i', 'o', 'u')\n for i in range(len(s)):\n if s[i].lower() in vowels:\n v.insert(0, s[i]) \n\n ans = []\n cnt = 0\n for i in range(len(s)):\n if s[i].lower() not in vowels:\n ans.append(s[i])\n else:\n ans.append(v[cnt])\n cnt += 1\n return ''.join(ans)","runtime":"166"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n l1 = []\n l2 = []\n for i in range(len(s)):\n if(s[i] in 'aeiouAEIOU'):\n l2.insert(0,s[i])\n else:\n l1.append(s[i])\n ans = []\n l = 0\n r = 0\n for i in range(len(s)):\n if(s[i] in 'aeiouAEIOU'):\n ans.append(l2[r])\n r+=1\n else:\n ans.append(l1[l])\n l+=1\n return ''.join(ans)","runtime":"168"},{"code":"import functools\nclass Solution:\n def reverseVowels(self, s: str) -> str:\n ll = len(s)\n vowels = {'a','e','i','o','u','A','E','I','O','U'}\n s = list(s)\n i = 0\n j = ll-1\n while j-i>=1:\n while i<j and not s[i] in vowels:\n i+=1\n while i<j and not s[j] in vowels:\n j-=1\n if s[i] in vowels and s[j] in vowels and i<j:\n s[i], s[j] = s[j], s[i] \n i+=1\n j-=1\n \n return functools.reduce(lambda a,b:a+b, s)","runtime":"168"},{"code":"class Solution:\n\n VOWELS = set('aeiou')\n\n def reverseVowels(self, s: str) -> str:\n reversed_s = deque(s)\n left, right = 0, len(s) - 1\n while left < right:\n while left < right and reversed_s[left].lower() not in self.VOWELS:\n left += 1\n\n while left < right and reversed_s[right].lower() not in self.VOWELS:\n right -= 1\n\n reversed_s[left], reversed_s[right] = reversed_s[right], reversed_s[left]\n\n left += 1\n right -= 1\n return ''.join(reversed_s)","runtime":"170"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel = []\n output = ''\n\n for i in range(len(s)-1, -1, -1):\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':\n vowel.append(s[i])\n \n\n for i in range(0, len(s)):\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':\n sub = vowel.pop(0)\n output += sub\n else:\n output += s[i]\n\n return output\n","runtime":"170"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n #extract and reverse vowels\n vowels=[]\n for i in range(0,len(s)):\n if s[i] in \"aeiouAEIOU\":\n vowels[0:0]=s[i] #use slicing to add subseqent vowels to the front (reversing them)\n \n #traverse string, swap each vowel with first one from vowels lost \n output = list(s) #convert string to list for mutability\n for j in range(0,len(s)):\n if s[j] in \"aeiouAEIOU\":\n output[j] = vowels[0] #swap with first element in vowels list\n vowels.pop(0) #remove first element and shift other forward\n return ''.join(output)\n\n\"\"\"\n vowels = [char for char in s if char in \"aeiouAEIOU\"] # Collect vowels\n output = list(s) # Convert string to list for mutability\n \n for i in range(len(s)):\n if s[i] in \"aeiouAEIOU\":\n output[i] = vowels.pop() # Replace vowel with the last one in the list\n \n return ''.join(output) # Convert list back to string\n\n\"\"\"","runtime":"173"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n l=[]\n for i in s:\n if (i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u' or i == 'A' or i == 'E' or i == 'I' or i == 'O' or i == 'U'):\n l.append(i)\n s=s.replace(i,\"*\")\n\n k=0\n l=l[::-1]\n\n\n for i in s:\n\n if i=='*':\n s=s.replace(i,l[k],1)\n k=k+1\n\n\n return(s)\n ","runtime":"173"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel=[i for i in s if i.lower() in ['a','e','i','o','u']][::-1]\n word_list=list(s)\n print(word_list)\n for i, letter in enumerate(word_list):\n print(i)\n if letter.lower() in ['a','e','i','o','u']:\n print(vowel[0])\n word_list[i]=vowel[0]\n vowel.pop(0)\n return ''.join(word_list)\n \n \n ","runtime":"175"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n indexes = [] \n vowels = []\n vowels_ref = ['a', 'e', 'i', 'o', 'u']\n\n for i, c in enumerate(s):\n if c.lower() in vowels_ref:\n indexes.append(i)\n vowels.insert(0, c)\n\n vowels_index = dict(zip(indexes, vowels))\n result = \"\"\n for i, c in enumerate(s):\n if (i in vowels_index):\n result += vowels_index[i]\n else:\n result += s[i]\n\n return result\n \n ","runtime":"175"},{"code":"class Solution:\n def isVowel(self, letter: str) -> bool:\n l = letter.lower()\n if (l == 'a' or l == 'e' or l == 'i' or l == 'o' or l == 'u'):\n return True\n return False\n\n def reverseVowels(self, s: str) -> str:\n vowels = []\n locations = []\n for i in range(len(s)):\n if self.isVowel(s[i]):\n vowels.append(s[i])\n locations.insert(0,i)\n sout = \"\"\n for i in range(len(s)):\n if (len(locations) > 0 and i == locations[-1]):\n sout += vowels.pop()\n locations.pop()\n else:\n sout += s[i]\n\n return sout","runtime":"177"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n l=[]\n for i in s:\n if (i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u' or i == 'A' or i == 'E' or i == 'I' or i == 'O' or i == 'U'):\n l.append(i)\n s=s.replace(i,\"*\")\n\n k=0\n l=l[::-1]\n\n\n for i in s:\n\n if i=='*':\n s=s.replace(i,l[k],1)\n k=k+1\n\n\n return(s)\n ","runtime":"177"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n list_s = list(s)\n vowel_in_str = []\n vowels = ['a', 'e', 'i', 'o', 'u']\n vowels_up = ['A', 'E', 'I', 'O', 'U']\n\n for char in list_s:\n if char in vowels:\n vowel_in_str.insert(0, char)\n if char in vowels_up:\n vowel_in_str.insert(0, char)\n\n i = 0\n j = 0\n while j < len(list_s) and i < len(vowel_in_str):\n if list_s[j] in vowels or list_s[j] in vowels_up:\n list_s[j] = vowel_in_str[i]\n i += 1\n j += 1\n \n return(''.join(str(char) for char in list_s))","runtime":"179"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n isVowel = []\n vowels = ['a','A','e','E','i','I','o','O','u','U']\n vowelsInWord = []\n word = [*s]\n\n for letter in word: \n if letter in vowels:\n isVowel.append(True)\n vowelsInWord.insert(0, letter)\n else: \n isVowel.append(False)\n output = \"\"\n i = 0\n for letter in word:\n if letter in vowels:\n output += vowelsInWord[i]\n i +=1 \n else: \n output += letter\n return output ","runtime":"179"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = []\n for c in s:\n if self.isVowel(c): vowels.append(c)\n\n newString = \"\"\n for i in range(len(s)):\n if self.isVowel(s[i]): newString = f'{newString}{vowels.pop()}'\n else: newString = f'{newString}{s[i]}'\n \n return newString\n \n\n \n def isVowel(self, s : str):\n s = s.lower()\n if 'a' == s or 'e' == s or 'i' == s or 'o' == s or 'u' == s: return True\n return False\n\n \n def isVowel(self, s : str):\n s = s.lower()\n if 'a' == s or 'e' == s or 'i' == s or 'o' == s or 'u' == s: return True\n return False","runtime":"181"},{"code":"class Solution:\n vowels = {\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"}\n\n def reverseVowels(self, s: str) -> str:\n j = len(s)\n out = \"\"\n for i in range(len(s)):\n c = s[i]\n if c not in self.vowels or j <= i:\n out += c\n else:\n while j > i:\n j -= 1\n if s[j] in self.vowels:\n out += s[j]\n s = s[:j] + c + s[j+1:]\n break\n \n return out","runtime":"183"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n #extract and reverse vowels\n vowels=[]\n for i in range(0,len(s)):\n if s[i] in \"aeiouAEIOU\":\n vowels[0:0]=s[i] #use slicing to add subseqent vowels to the front (reversing them)\n \n #traverse string, swap each vowel with first one from vowels lost \n output = list(s) #convert string to list for mutability\n for j in range(0,len(s)):\n if s[j] in \"aeiouAEIOU\":\n output[j] = vowels[0] #swap with first element in vowels list\n vowels.pop(0) #remove first element and shift other forward\n \n return ''.join(output) #convert list back ot string\n\n\"\"\"\n vowels = [char for char in s if char in \"aeiouAEIOU\"] # Collect vowels\n output = list(s) # Convert string to list for mutability\n \n for i in range(len(s)):\n if s[i] in \"aeiouAEIOU\":\n output[i] = vowels.pop() # Replace vowel with the last one in the list\n \n return ''.join(output) # Convert list back to string\n\n\"\"\"","runtime":"183"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n reversedlist = []\n finalstring = \"\"\n for i in s:\n if i in \"aiueoAIUEO\":\n reversedlist.insert(0, i)\n index = 0\n for i in s:\n if i in \"aiueoAIUEO\":\n print(\"is a vowel and the vowel is \")\n finalstring += reversedlist[index]\n index += 1\n else: \n print(\"not vowels\")\n finalstring += i\n\n return finalstring\n\n ","runtime":"186"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n hash = {}\n vowels = [s[i] for i in range(len(s)) if s[i] in ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U')]\n\n vowels.reverse()\n\n vi = 0\n for i in range(len(s)):\n if s[i] in ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'):\n hash[i] = vowels[vi]\n vi += 1\n l = list(s)\n for i in range(len(s)):\n if i in hash:\n l[i] = hash[i]\n s = ''\n for i in l:\n s += i\n return s \n","runtime":"188"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n right,left = len(s)-1,0\n while left < right:\n if s[left] in 'aeiouAEIOU':\n if s[right] not in 'aeiouAEIOU':\n right -= 1\n else:\n s = s[:left] + s[right] + s[left+1:right] + s[left] + s[right+1:]\n left += 1\n right -= 1\n else :\n left += 1\n \n return ''.join(s)","runtime":"188"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"] \n\n sl = list(s)\n\n sl_vow = [c for c in sl if c in vowels]\n\n result = \"\"\n for c in sl:\n if c in vowels:\n result = f\"{result}{sl_vow.pop()}\"\n else:\n result = f\"{result}{c}\"\n\n return result\n\n\n\n","runtime":"190"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n left = 0\n right = len(s) - 1\n while left < right:\n if not s[left] in vowels:\n left += 1\n if not s[right] in vowels:\n right -= 1\n if s[left] in vowels and s[right] in vowels and right != left:\n s = s[:left] + s[right] + s[left+1:right] + s[left] + s[right+1:]\n left += 1\n right -= 1 \n return s","runtime":"190"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n l = 0\n r = len(s) - 1\n vowels = {\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"}\n while l < r:\n if s[l] not in vowels:\n l += 1\n elif s[r] not in vowels:\n r -= 1\n else:\n new_string = s[:l] + s[r] + s[l + 1: r] + s[l]\n if r + 1 < len(s):\n new_string += s[r + 1:]\n s = new_string\n l += 1\n r -= 1\n return s","runtime":"192"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n l = 0\n r = len(s)-1\n\n while l < r:\n if s[l].lower() in \"aeiou\" and s[r].lower() in \"aeiou\":\n s = s[:l] + s[r] + s[l+1:r] + s[l] + s[r+1:]\n l += 1\n r -=1\n else:\n if s[l].lower() not in \"aeiou\":\n l+=1\n if s[r].lower() not in \"aeiou\":\n r-=1\n return s","runtime":"192"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}\n length = len(s)\n if length == 1:\n return s\n\n left_ind = 0\n right_ind = length - 1\n i = 0\n\n while left_ind < right_ind:\n # hello\n left_val = s[left_ind]\n right_val = s[right_ind]\n\n if left_val in vowels and right_val in vowels:\n s = s[:left_ind] + s[right_ind] + s[left_ind+1:right_ind] + s[left_ind] + s[right_ind+1:]\n # print(s[:left_ind], s[right_ind], s[left_ind+1:right_ind], s[left_ind], s[right_ind+1:])\n i += 1\n left_ind += 1\n right_ind -= 1\n elif left_val in vowels:\n right_ind -= 1\n elif right_val in vowels:\n left_ind += 1\n else:\n right_ind -= 1\n left_ind += 1\n return s\n \n def swap_vowels(self, s, indexes):\n result = s\n length = len(indexes)\n for i in range(length // 2):\n left = indexes[i]\n right_ind = length - 1 - i\n right = indexes[right_ind] if (right_ind) != i else left\n result = result[:left] + result[right] + result[left+1:right] + result[left] + result[right+1:]\n # 'hello' - [1, 4], 'h' + \n # 1 = 0 and 0\n # 2 = 0 and 1\n # 3 = 0 and 2, 1 and 1?\n # 4 = 0 and 3, 1 and 2\n return result\n\n ","runtime":"194"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n left = 0\n right = len(s) - 1\n while left < right:\n if not s[left] in vowels:\n left += 1\n if not s[right] in vowels:\n right -= 1\n if s[left] in vowels and s[right] in vowels and right != left:\n s = s[:left] + s[right] + s[left+1:right] + s[left] + s[right+1:]\n left += 1\n right -= 1 \n return s","runtime":"194"}],"string":"[\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n i, j = 0, len(s)-1\\n vowel = \\\"aeiouAEIOU\\\"\\n st = list(s)\\n while i < j:\\n if st[i] in vowel and st[j] in vowel:\\n temp = st[i]\\n st[i] = st[j]\\n st[j] = temp\\n i+=1\\n j-=1\\n if st[i] not in vowel:\\n i+=1\\n if st[j] not in vowel:\\n j-=1\\n \\n return \\\"\\\".join(st)\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n left = 0\\n right = len(s) - 1\\n m = 'aeiouAEIOU'\\n while left < right:\\n if s[left] in m and s[right] in m:\\n \\n s[left], s[right] = s[right], s[left]\\n \\n left += 1\\n right -= 1\\n \\n elif s[left] not in m:\\n left += 1\\n \\n elif s[right] not in m:\\n right -= 1\\n \\n return ''.join(s)\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n arr = list(s)\\n left , right = 0, len(s) - 1\\n vowels = 'AEIOUaeiou'\\n while left < right:\\n if arr[left] in vowels:\\n if arr[right] in vowels:\\n arr[left], arr[right] = arr[right], arr[left]\\n left += 1\\n right -= 1\\n else:\\n right -= 1\\n else:\\n left += 1\\n return ''.join(arr)\\n \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n l, r = 0, len(s) - 1\\n vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}\\n s = list(s)\\n\\n while l < r:\\n if s[l] not in vowels:\\n l += 1\\n continue\\n \\n if s[r] not in vowels:\\n r -= 1\\n continue\\n\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n \\n return ''.join(s)\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n # vowels = (\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\")\\n # s_vowels = [char for char in s if char.lower() in vowels]\\n # result = [s_vowels.pop() if letter.lower() in vowels else letter for letter in s]\\n\\n # return \\\"\\\".join(result)\\n vowels = \\\"aeiouAEIOU\\\"\\n right, left = 0, len(s) - 1\\n s_list = list(s)\\n while right < left:\\n if s_list[right] not in vowels:\\n right += 1\\n if s_list[left] not in vowels:\\n left -= 1\\n if s_list[right] in vowels and s_list[left] in vowels:\\n temp = s_list[right]\\n s_list[right] = s_list[left]\\n s_list[left] = temp\\n right += 1\\n left -= 1\\n\\n return \\\"\\\".join(s_list)\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"aeiouAEIOU\\\"\\n s = list(s) \\n i, j = 0, len(s) - 1\\n\\n while i < j:\\n if s[i] not in vowels:\\n i += 1\\n continue\\n if s[j] not in vowels:\\n j -= 1\\n continue\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n\\n return ''.join(s) \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def reverseVowels(self, s: str) -> str:\\n \\n \\n vowels = set('aeiouAEIOU')\\n \\n s = list(s)\\n left_index, right_index = 0, len(s) - 1\\n \\n while left_index < right_index:\\n \\n if s[left_index] not in vowels:\\n left_index += 1\\n \\n continue\\n \\n \\n if s[right_index] not in vowels:\\n right_index -= 1\\n continue\\n \\n \\n s[left_index], s[right_index] = s[right_index], s[left_index]\\n \\n \\n left_index += 1\\n right_index -= 1\\n \\n return ''.join(s) \\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set('aeiouAEIOU')\\n s = list(s)\\n left, right = 0, len(s) - 1\\n while left < right:\\n while left < right and s[left] not in vowels:\\n left += 1\\n while left < right and s[right] not in vowels:\\n right -= 1\\n s[left], s[right] = s[right], s[left]\\n left += 1\\n right -= 1\\n return ''.join(s)\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n vowels = set(\\\"AEIOUaeiou\\\")\\n sLen = len(s)\\n l = 0\\n r = sLen - 1\\n while l < r:\\n while s[l] not in vowels and l < r:\\n l += 1\\n if l == r:\\n break\\n while s[r] not in vowels and l < r:\\n r -= 1\\n if r == l:\\n break\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n\\n return ''.join(s)\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"# We have a sequence of vowels in a string\\n# We want to reverse the order of vowels in the string\\n# Cases:\\n# There is only one vowel in the string\\n# There is an odd number of vowel in the string\\n# There is an even number of vowels in the string\\n# The are no vowels in the string\\n\\n#Visualize these cases:\\n# no vowels: vvv -> we doe nothing\\n# one vowel: vavv -> we do nothing\\n# two vowels: vaev -> we need to switch the order of the vowels\\n# three vowels: vavevu -> vuveva so we need switch the first two from both sides and leave the middle one alone\\n\\n# For the no vowels and one vowels case we still need to loop through the entire list to see if there are any vowels\\n\\n# So the best way is to establish two pointers\\n# while 1st_ptr != 2nd_ptr:\\n # We get the first pointer to point to a vowel\\n # Then we get the second pointer to point to a vowel\\n # we then switch the position\\n# 1. We search for a vowel for each of the pointers and switch\\n# 2. And when the pointers are at the same position we will know that we are done.\\n\\nclass Solution:\\n def reverseVowels(self, s: str) -> str:\\n ptr1 = 0\\n ptr2 = len(s) - 1\\n\\n vowel_str = set(\\\"aAeEiIoOuU\\\")\\n s = list(s)\\n\\n ptr1_at_vowel = False\\n\\n while ptr1 < ptr2:\\n if not ptr1_at_vowel:\\n if s[ptr1] in vowel_str:\\n ptr1_at_vowel = True\\n else:\\n ptr1 += 1\\n continue \\n\\n if s[ptr2] in vowel_str:\\n temp = s[ptr2]\\n s[ptr2] = s[ptr1]\\n s[ptr1] = temp\\n\\n ptr1_at_vowel = False\\n ptr1 += 1\\n \\n ptr2 -= 1\\n \\n return ''.join(s)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"AEIOUaeiou\\\"\\n vow = [c for c in s if c in vowels]\\n revStr = []\\n i = 0\\n for char in s:\\n if char in vowels:\\n revStr.append(vow.pop())\\n else:\\n revStr.append(char)\\n return ''.join(revStr)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"AEIOUaeiou\\\"\\n vow = [c for c in s if c in vowels]\\n revStr = []\\n i = 0\\n for char in s:\\n if char in vowels:\\n revStr.append(vow.pop())\\n else:\\n revStr.append(char)\\n return ''.join(revStr)\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"AEIOUaeiou\\\"\\n vow = [c for c in s if c in vowels]\\n revStr = []\\n i = 0\\n for char in s:\\n if char in vowels:\\n revStr.append(vow.pop())\\n else:\\n revStr.append(char)\\n return ''.join(revStr)\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set('aeiouAEIOU')\\n i = 0\\n j = len(s) - 1\\n result = list(s)\\n while i < j:\\n ci = s[i]\\n cj = s[j]\\n if ci not in vowels:\\n result[i] = ci\\n i += 1\\n elif cj not in vowels:\\n result[j] = cj\\n j -= 1\\n else:\\n result[i], result[j] = cj, ci\\n i += 1\\n j -= 1\\n \\n return ''.join(result)\\n\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = {'a','e','i','o','u'}\\n res = []\\n for i in s:\\n if i.lower() in vowels:\\n res.append(i)\\n res[0:] = res[::-1]\\n # print(res)\\n s = list(s)\\n # print(s)\\n index = 0\\n for i,c in enumerate(s):\\n if c.lower() in vowels:\\n s[i] = res[index]\\n index+=1\\n # print(s)\\n s = ''.join(s)\\n return s\\n\\n\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowset = {\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"}\\n strlist = list(s)\\n left, right = 0, len(s) - 1\\n\\n while left < right:\\n if strlist[left] in vowset and strlist[right] in vowset:\\n strlist[left], strlist[right] = strlist[right], strlist[left]\\n left, right = left + 1, right - 1\\n continue\\n\\n if strlist[left] not in vowset: left += 1\\n if strlist[right] not in vowset: right -= 1\\n \\n return \\\"\\\".join(strlist)\\n\\n # while l < r:\\n # if str_list[l] in vow_set and str_list[r] in vow_set:\\n # str_list[l], str_list[r] = str_list[r], str_list[l]\\n # l, r = l + 1, r - 1\\n # continue\\n \\n # if str_list[l] not in vow_set: l += 1\\n # if str_list[r] not in vow_set: r -= 1\\n \\n # return ''.join(str_list)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"AEIOUaeiou\\\"\\n vow = [c for c in s if c in vowels]\\n revStr = []\\n i = 0\\n for char in s:\\n if char in vowels:\\n revStr.append(vow.pop())\\n else:\\n revStr.append(char)\\n return ''.join(revStr)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"AEIOUaeiou\\\"\\n vow = [c for c in s if c in vowels]\\n revStr = []\\n i = 0\\n for char in s:\\n if char in vowels:\\n revStr.append(vow.pop())\\n else:\\n revStr.append(char)\\n return ''.join(revStr)\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n kempa=[]\\n index=0\\n for i in s:\\n if i in \\\"AEIOUaeiou\\\":\\n kempa.append(i)\\n a=kempa\\n # return a\\n b=a[::-1]\\n list2=list(s)\\n for i in range(len(list2)):\\n if list2[i] in \\\"AEIOUaeiou\\\":\\n if index<len(b):\\n list2[i]=b[index]\\n index +=1\\n return \\\"\\\".join(list2)\\n\\n # for i in range(len(s)):\\n # if s[i]== (\\\"A\\\" or \\\"E\\\" or \\\"I\\\" or \\\"O\\\" or \\\"U\\\" or \\\"a\\\" or \\\"e\\\" or \\\"i\\\" or \\\"o\\\" or \\\"u\\\"):\\n # list1.append(s[i])\\n # return list1\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set(['a', 'e', 'i', 'o', 'u'])\\n vowel_position = []\\n res = []\\n for idx, ch in enumerate(s):\\n if ch.lower() in vowels:\\n vowel_position.append(idx)\\n res.append(ch)\\n total_vowels = len(vowel_position)\\n for idx in range(total_vowels//2):\\n res[vowel_position[idx]], res[vowel_position[total_vowels-idx-1]] = res[vowel_position[total_vowels-idx-1]], res[vowel_position[idx]]\\n return ''.join(res)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s=list(s)\\n n=len(s)\\n i=0\\n j=n-1\\n vowels= set('AEIOUaeiou')\\n while i<j:\\n #move start pointer i until it points to a vowel\\n while i<j and s[i] not in vowels:\\n i+=1\\n #move end pointer j until it points to a vowel\\n while i<j and s[j] not in vowels:\\n j-=1\\n s[i],s[j]=s[j],s[i]\\n i+=1\\n j-=1\\n s=''.join(s)\\n return s\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n word = list(s)\\n l, r = 0, len(s) - 1\\n vowels = \\\"aeiouAEIOU\\\"\\n\\n while l < r:\\n while l < r and word[l] not in vowels:\\n l += 1\\n while r > l and word[r] not in vowels:\\n r -= 1\\n word[l], word[r] = word[r], word[l]\\n l += 1\\n r -= 1\\n \\n return \\\"\\\".join(word)\\n \\n \\n return s\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set(\\\"aeiouAEIOU\\\")\\n s = list(s)\\n left = 0\\n right = len(s)-1\\n while left < right:\\n if s[left] not in vowels:\\n left += 1\\n elif s[right] not in vowels:\\n right -= 1\\n else:\\n s[left], s[right] = s[right], s[left]\\n left += 1\\n right -= 1\\n return \\\"\\\".join(s)\\n \\n\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel_set = set(['a','e','i','o','u','A','E','I','O','U'])\\n appear_vowel = []\\n for si in s:\\n if si in vowel_set:\\n appear_vowel.append(si)\\n\\n return_string = ''\\n ind = 0\\n for si in s:\\n if si in vowel_set:\\n ind += 1\\n return_string += appear_vowel[len(appear_vowel)-ind]\\n else:\\n return_string += si\\n return return_string\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n st = list(s)\\n v = \\\"AEIOUaeiou\\\"\\n vo = list(v)\\n ind = []\\n new = []\\n for i in range(len(st)):\\n if st[i] in v:\\n new.append(st[i])\\n ind.append(i)\\n new.reverse()\\n for i in range(len(ind)):\\n st[ind[i]] = new[i]\\n r = ''.join(st)\\n return r\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set('aeiouAEIOU') # Define a set of vowels for quick lookup\\n s_list = list(s) # Convert the string to a list for easier manipulation\\n left, right = 0, len(s_list) - 1 # Initialize two pointers\\n\\n while left < right:\\n # Move the left pointer to the next vowel\\n while left < right and s_list[left] not in vowels:\\n left += 1\\n # Move the right pointer to the previous vowel\\n while left < right and s_list[right] not in vowels:\\n right -= 1\\n \\n # Swap the vowels found at left and right pointers\\n s_list[left], s_list[right] = s_list[right], s_list[left]\\n left += 1\\n right -= 1\\n\\n # Join the list back into a string and return it\\n return ''.join(s_list)\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n list1 = ['a','e','i','o','u', 'A', 'E', 'I', 'O', 'U']\\n l = 0\\n r = len(s)-1\\n s = list(s)\\n\\n while True:\\n while l<r and (s[l] not in list1) :\\n l += 1\\n while r>l and (s[r] not in list1):\\n r -= 1\\n if l>=r:\\n break\\n elif l != r:\\n s[l], s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n return ''.join(s)\\n\\n# class Solution:\\n# def reverseVowels(self, s: str) -> str:\\n# chars = []\\n# idxs = []\\n\\n# for i, c in enumerate(s):\\n# if c in 'aeiouAEIOU':\\n# chars.append(c)\\n# idxs.append(i)\\n \\n# res = list(s)\\n# k = len(chars)-1\\n# for i in idxs:\\n# res[i] = chars[k]\\n# k -= 1\\n\\n# return ''.join(res) \\n\\n \\n\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n letters = []\\n vowels = ['a','e','i','o','u','A','E','I','O', 'U']\\n for letter in s: \\n if letter in vowels:\\n letters.append(letter)\\n letters.reverse()\\n index = 0\\n for j in range(len(s)):\\n if s[j] in vowels:\\n s[j]= letters[index]\\n index += 1\\n return ''.join(s)\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n x = list(s)\\n i = 0\\n j = len(s)-1\\n vow= \\\"aeiouAEIOU\\\"\\n while i < j:\\n while i < j and vow.find(x[i]) == -1:\\n i+=1\\n while i < j and vow.find(x[j]) == -1:\\n j-=1\\n x[i],x[j] = x[j],x[i]\\n\\n i+=1\\n j-=1\\n return \\\"\\\".join(x)\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n if not len(s):\\n return s\\n s = list(s)\\n vowels =[]\\n vowel_pos = []\\n for i_c, c in enumerate(s):\\n if c.lower() in 'aeiou':\\n vowels.append(c)\\n vowel_pos.append(i_c)\\n for i_v in range(len(vowels)//2):\\n rev_ind = -1 -i_v\\n tmp = vowels[rev_ind]\\n s[vowel_pos[rev_ind]] = vowels[i_v]\\n s[vowel_pos[i_v]] = tmp\\n s = \\\"\\\".join(s)\\n return s\\n \",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n hashmap = []\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"]\\n\\n for i in range(len(s)):\\n if s[i] in vowels:\\n hashmap.append(s[i])\\n\\n fp = 0\\n lp = len(hashmap) - 1\\n new_s = \\\"\\\"\\n for i in range(len(s)):\\n if s[i] in vowels:\\n new_s += hashmap[lp]\\n lp -= 1\\n else:\\n new_s += s[i]\\n\\n return new_s\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = (\\\"a\\\", \\\"A\\\", \\\"e\\\", \\\"E\\\", \\\"i\\\", \\\"I\\\", \\\"o\\\", \\\"O\\\", \\\"u\\\", \\\"U\\\")\\n s_list = list(s)\\n reverse = []\\n\\n for letter in s:\\n if letter in vowels:\\n reverse.append(letter)\\n \\n ptr = 0\\n reverse = reverse[::-1]\\n for i in range(len(s_list)):\\n if s_list[i] in vowels:\\n s_list[i] = reverse[ptr]\\n ptr += 1\\n\\n return \\\"\\\".join(s_list)\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = {'a', 'e', 'i', 'o', 'u'}\\n s_vowels = []\\n s_list = list(s)\\n for ch in s_list:\\n if ch.lower() in vowels:\\n s_vowels.append(ch)\\n for i in range(len(s_list)):\\n if s_list[i].lower() in vowels:\\n s_list[i] = s_vowels.pop()\\n return ''.join(s_list)\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n req_list = ['a','e','i','o','u','A','I','E','O','U']\\n val = [(pos,char) for pos, char in enumerate(s) if char in req_list]\\n s_list = list(s)\\n for i in range (len(val)//2):\\n s_list[val[i][0]] = val[-i-1][1]\\n s_list[val[-i-1][0]] = val[i][1]\\n\\n return \\\"\\\".join(s_list)\\n \\n\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\"]\\n strlist = list(s)\\n stack = []\\n for index, char in enumerate(strlist):\\n if char.lower() in vowels:\\n stack.append(char)\\n for index, char in enumerate(strlist):\\n if char.lower() in vowels:\\n strlist[index] = stack.pop(-1)\\n return \\\"\\\".join(strlist)\\n\\n \\n\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vow = []\\n \\n p =''\\n for i in range(len(s)):\\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\\n vow.append(s[i]) \\n count = len(vow)-1 \\n for i in range(len(s)):\\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\\n p+=vow[count]\\n count-=1\\n else:\\n p+=s[i]\\n return p\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_ = list(s)\\n vowels = ['a', 'A', 'e', 'E', 'i', 'I', 'o', 'O', 'u', 'U']\\n l = 0\\n r = len(s_) - 1\\n while r > l:\\n if s_[l] in vowels and s_[r] in vowels:\\n s_[l], s_[r] = s_[r], s_[l]\\n l += 1\\n r -= 1\\n elif s_[l] in vowels and s_[r] not in vowels:\\n r -= 1\\n elif s_[l] not in vowels and s_[r] in vowels:\\n l += 1\\n else:\\n l += 1\\n r -= 1\\n return ''.join(s_)\\n \\n\\n \",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vow = []\\n \\n p =''\\n for i in range(len(s)):\\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\\n vow.append(s[i]) \\n count = len(vow)-1 \\n for i in range(len(s)):\\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\\n p+=vow[count]\\n count-=1\\n else:\\n p+=s[i]\\n return p\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, char: str) -> bool:\\n if char.lower() in ['a', 'e', 'i', 'o', 'u']:\\n return True\\n else:\\n return False\\n\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n left = 0\\n right = len(s_list)-1\\n while left < right:\\n if not self.isVowel(s_list[left]):\\n left += 1\\n if not self.isVowel(s_list[right]):\\n right -= 1\\n if self.isVowel(s_list[left]) and self.isVowel(s_list[right]):\\n dummy = s_list[left]\\n s_list[left] = s_list[right]\\n s_list[right] = dummy\\n left += 1\\n right -= 1\\n return ''.join(s_list)\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"vowels = ['a', 'e', 'i', 'o', 'u']\\n\\nclass Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n i = 0\\n j = len(s) - 1\\n while i < j:\\n if s[i].lower() in vowels and s[j].lower() in vowels:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n else:\\n if s[i].lower() not in vowels:\\n i += 1\\n if s[j].lower() not in vowels:\\n j -= 1\\n return \\\"\\\".join(s)\\n\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n str1 = \\\"\\\"\\n stack = []\\n for char in s:\\n if char in set(\\\"AaEeIiOoUu\\\"):\\n str1 += \\\"_\\\"\\n stack.append(char)\\n else:\\n str1 += char\\n \\n res = \\\"\\\"\\n for char in str1:\\n if char == \\\"_\\\":\\n res += stack.pop()\\n else:\\n res += char\\n return res\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n g=['A','E','I','O','U','a','e','i','o','u']\\n t=[]\\n for j in s:\\n if j in g:\\n t.append(j)\\n k=''\\n t=t[::-1]\\n i=0\\n for h in s:\\n if h in g:\\n k=k+t[i]\\n i+=1\\n else:\\n k=k+h\\n return (k)\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"]\\n strlist = list(s)\\n stack = []\\n for index, char in enumerate(strlist):\\n if char in vowels:\\n stack.append(char)\\n for index, char in enumerate(strlist):\\n if char in vowels:\\n strlist[index] = stack.pop(-1)\\n return \\\"\\\".join(strlist)\\n\\n \\n\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n \\n rev = \\\"\\\"\\n newString =\\\"\\\"\\n ptr = 0\\n \\n for letter in s:\\n if letter in vowels:\\n rev += letter\\n rev = rev[::-1]\\n for i in range(len(s)):\\n if s[i] in vowels:\\n newString += rev[ptr]\\n ptr = ptr + 1\\n else:\\n newString += s[i]\\n \\n return newString\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels= ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n vowels_list=[]\\n index_list=[]\\n\\n for i in range(len(s)):\\n if s[i] in vowels:\\n vowels_list.append(s[i])\\n\\n word=[]\\n count=0\\n for i in range(0,len(s)):\\n if s[i] in vowels:\\n word.append(vowels_list[len(vowels_list)-count-1])\\n count= count+1\\n else:\\n word.append(s[i])\\n\\n\\n\\n\\n return \\\"\\\".join(word)\\n\\n\\n \",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n vowel_list = list()\\n replaced = 0\\n for element in s: \\n if self.isVowel(element): \\n vowel_list.append(element)\\n\\n print(vowel_list)\\n for i in range(len(s)): \\n if self.isVowel(s[i]): \\n s_list[i] = vowel_list[-1]\\n vowel_list.pop(-1)\\n return ''.join(s_list)\\n\\n\\n def isVowel(self, s : str) -> bool: \\n return s.lower() in [\\\"a\\\",\\\"i\\\",\\\"e\\\",\\\"o\\\",\\\"u\\\"]\\n \",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n result = \\\"\\\"\\n for i in s:\\n if i.lower() in \\\"aeiou\\\":\\n result = i + result \\n return_str = \\\"\\\"\\n k =0\\n for i in range(len(s)):\\n if s[i].lower() in \\\"aeiou\\\":\\n return_str += result[k]\\n k += 1\\n else:\\n return_str += s[i]\\n return return_str\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n vowel_list = list()\\n replaced = 0\\n for element in s: \\n if self.isVowel(element): \\n vowel_list.append(element)\\n\\n for i in range(len(s)): \\n if self.isVowel(s[i]): \\n s_list[i] = vowel_list[-1]\\n vowel_list.pop(-1)\\n return ''.join(s_list)\\n\\n\\n def isVowel(self, s : str) -> bool: \\n return s.lower() in [\\\"a\\\",\\\"i\\\",\\\"e\\\",\\\"o\\\",\\\"u\\\"]\\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n def isvowel(l: str):\\n return l in list('aeiouAEIOU')\\n\\n vpos = []\\n\\n s = list(s)\\n for i,l in enumerate(s):\\n if isvowel(l):\\n vpos.append((i,l))\\n \\n\\n for (i1,v1), (i2,v2) in zip(vpos[:len(vpos)//2], vpos[len(vpos)//2:][::-1]):\\n s[i1], s[i2] = v2, v1\\n\\n return ''.join(s)\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n req_list = ['a','e','i','o','u','A','I','E','O','U']\\n val = [(pos,char) for pos, char in enumerate(s) if char in req_list]\\n s_list = list(s)\\n print(val)\\n for i in range (len(val)//2):\\n print(val[i])\\n print(val[-i-1])\\n s_list[val[i][0]] = val[-i-1][1]\\n s_list[val[-i-1][0]] = val[i][1]\\n\\n return \\\"\\\".join(s_list)\\n \\n\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n def isvowel(l: str):\\n return l in list('aeiouAEIOU')\\n\\n vpos = []\\n\\n s = list(s)\\n for i,l in enumerate(s):\\n if isvowel(l):\\n vpos.append((i,l))\\n \\n\\n for (i1,v1), (i2,v2) in zip(vpos[:len(vpos)//2], vpos[len(vpos)//2:][::-1]):\\n s[i1], s[i2] = v2, v1\\n\\n return ''.join(s)\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = []\\n result = []\\n for char in s:\\n if(char == 'a'or char == 'A' or char == 'e'or char == 'E'or char == 'i'or char == 'I' or char == 'o'or char == 'O'or char == 'u'or char == 'U'):\\n vowels.append(char)\\n for i in range(len(s)):\\n if(s[i] == 'a'or s[i] == 'A' or s[i] == 'e'or s[i] == 'E'or s[i] == 'i'or s[i] == 'I' or s[i] == 'o'or s[i] == 'O'or s[i] == 'u'or s[i] == 'U'):\\n result.append(vowels[-1])\\n vowels.pop()\\n else:\\n result.append(s[i])\\n \\n reversedVowels = \\\"\\\".join(result)\\n \\n return reversedVowels\\n \\n# TC: O(n)\\n# SC: O(n)\\n \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n vowels = [\\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\", \\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\"]\\n\\n vowels_list = []\\n output_temp = []\\n output = []\\n\\n for c in s:\\n for v in vowels:\\n if c == v:\\n vowels_list.append(c)\\n\\n print(vowels_list)\\n vowels_list.reverse()\\n print(vowels_list)\\n\\n vowel_idx = 0\\n\\n for c in s:\\n if c in vowels:\\n output.append(vowels_list[vowel_idx])\\n vowel_idx += 1\\n else:\\n output.append(c)\\n\\n print(\\\"\\\".join(output))\\n return \\\"\\\".join(output)\\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\"]\\n # Two pointers, start from left until hit a vowel\\n # Go from right til you hit a vowel\\n # If they are not the same index then swap them\\n # End while when you get to a different index\\n strlist = list(s)\\n stack = []\\n print(strlist)\\n for index, char in enumerate(strlist):\\n if char.lower() in vowels:\\n stack.append(char)\\n print(stack)\\n for index, char in enumerate(strlist):\\n if char.lower() in vowels:\\n print(strlist[index])\\n strlist[index] = stack.pop(-1)\\n print(strlist[index])\\n return \\\"\\\".join(strlist)\\n\\n \\n\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','A', 'i', 'I', 'u', 'U', 'e', 'E', 'o', 'O']\\n num = 0\\n count_bottom = 1\\n list_s = list(s)\\n top_switch = ''\\n bottom_switch = ''\\n top_num = 100\\n bottom_num = 100\\n while True:\\n if top_switch != '' and bottom_switch != '':\\n list_s[top_num] = bottom_switch\\n list_s[bottom_num] = top_switch \\n top_switch = ''\\n bottom_switch = ''\\n num += 1\\n count_bottom += 1\\n if num + count_bottom > int(len(list_s)):\\n break\\n top_s = list_s[num]\\n bottom_s = list_s[-count_bottom]\\n\\n if top_s in vowels:\\n top_switch = top_s\\n top_num = num\\n else:\\n num += 1\\n print(\\\"top\\\",top_switch)\\n \\n if bottom_s in vowels:\\n bottom_switch = bottom_s\\n bottom_num = - count_bottom\\n else:\\n count_bottom += 1\\n print(\\\"bottom\\\",bottom_switch)\\n \\n return ''.join(list_s)\\n \\n \\n\\n\\n \",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n d = {}\\n d_vowels = {}\\n lst = []\\n for idx, val in enumerate(s):\\n d.update({idx: val})\\n if val.lower() in vowels:\\n d_vowels.update({idx: val})\\n lst.append([idx,val])\\n new_lst = lst[::-1]\\n new_order = [[lst[i][0], new_lst[i][1]] for i in range(len(lst))]\\n for i in new_order:\\n d[i[0]] = i[1]\\n new_str = ''\\n for k, v in d.items():\\n new_str += v\\n return new_str\\n \\n\\n\\n \",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n def isVowel(c):\\n return c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u' or c == 'A' or c == 'E' or c == 'I' or c == 'O' or c == 'U'\\n \\n s_list = list(s)\\n i, j = 0, len(s_list) - 1\\n\\n while i <= j:\\n if isVowel(s_list[i]) and isVowel(s_list[j]):\\n s_list[i], s_list[j] = s_list[j], s_list[i]\\n i += 1\\n j -= 1\\n elif not isVowel(s_list[i]) and isVowel(s_list[j]):\\n i += 1\\n elif isVowel(s_list[i]) and not isVowel(s_list[j]):\\n j -= 1\\n else:\\n i += 1\\n j -= 1\\n \\n return ''.join(s_list)\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n s_list = list(s)\\n \\n front_pointer = 0\\n back_pointer = len(s) - 1\\n\\n while front_pointer < back_pointer:\\n if s_list[front_pointer] in vowels:\\n while not_found_vowel := True:\\n print(front_pointer, back_pointer)\\n if s_list[back_pointer] in vowels and s_list[front_pointer] in vowels:\\n s_list[front_pointer], s_list[back_pointer] = s_list[back_pointer], s_list[front_pointer]\\n \\n front_pointer += 1\\n back_pointer -= 1\\n not_found_vowel = False\\n\\n if (s_list[back_pointer] not in vowels) and (back_pointer > 0):\\n back_pointer -= 1\\n else:\\n break\\n else:\\n front_pointer += 1\\n\\n return ''.join(s_list)\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, char) -> bool:\\n vowels = set(['a', 'e', 'i', 'o', 'u'])\\n return char.lower() in vowels\\n\\n def reverseVowels(self, s: str) -> str:\\n # Reverse only vowels: a, e, i, o, u\\n # Retain its state of lowercase/uppercase\\n \\n # store our string in an array of same length\\n # have two pointers, one iterating from the left, one iterating from the right\\n # have a loop, condition to end when left and right meet each other\\n # if left pointer sees a vowel but right doesn't \\n # add that character that right pointer points at to our res str\\n # right -= 1\\n # if left pointer doesn't see a vowel but right does\\n # add that character that left pointer points at to our res str\\n # left += 1\\n # if both are pointing at vowels \\n # do the swap\\n # right -= 1\\n # left += 1\\n # return the constructed string by joining the list\\n\\n output = [x for x in s] # unpack s into a list of character\\n left, right = 0, len(s) - 1\\n\\n while left < right:\\n left_bool = self.isVowel(s[left])\\n right_bool = self.isVowel(s[right])\\n if left_bool and right_bool:\\n output[left] = s[right]\\n output[right] = s[left]\\n left += 1\\n right -= 1\\n continue\\n if not left_bool:\\n left += 1\\n if not right_bool:\\n right -= 1\\n \\n return ''.join(output)\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n list=[]\\n st=\\\"\\\"\\n for i in range(len(s)):\\n if s[i]=='a'or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U':\\n list.append(s[i])\\n list.reverse()\\n index=0\\n for i in range(len(s)):\\n if s[i]=='a'or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U':\\n st=st+list[index]\\n index=index+1\\n else:\\n st=st+s[i]\\n return st \",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n if len(s) == 1:\\n return s\\n left = 0\\n right = len(s) - 1\\n l = \\\"\\\"\\n r = \\\"\\\"\\n v = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n while left <= right:\\n if left == right:\\n l = l + s[left]\\n left = left + 1\\n elif s[left] in v and s[right] in v:\\n l = l + s[right]\\n r = s[left] + r\\n elif s[left] not in v and s[right] not in v:\\n l = l + s[left]\\n r = s[right] + r\\n elif s[left] in v:\\n left = left - 1\\n r = s[right] + r\\n elif s[right] in v:\\n right = right + 1\\n l = l + s[left]\\n\\n left = left + 1\\n right = right - 1\\n return l + r\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n n = len(s)\\n\\n left = \\\"\\\"\\n\\n right = \\\"\\\"\\n\\n i = 0\\n\\n j = n - 1\\n\\n while i < j:\\n\\n while i < j and s[i] not in ['a','e','i','o','u','A','E','I','O','U']:\\n\\n left = left + s[i]\\n\\n i += 1\\n\\n while i < j and s[j] not in ['a','e','i','o','u','A','E','I','O','U']:\\n\\n right = s[j] + right\\n\\n j -= 1\\n\\n if i >= j:\\n\\n break\\n\\n left = left + s[j]\\n\\n right = s[i] + right\\n\\n i += 1\\n\\n j -= 1\\n\\n return left + (s[i] if i == j else \\\"\\\") + right\\n \",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel_index = []\\n vowels = 'aeiouAEIOU'\\n s = list(s)\\n for i in range(len(s)):\\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':\\n vowel_index.append(i)\\n \\n a = ''.join(s)\\n a = list(a)\\n r_vi = vowel_index[::-1]\\n l = len(r_vi)\\n for i in range(l):\\n print(vowel_index[i])\\n print(r_vi[i])\\n print(a[vowel_index[i]])\\n print(s[r_vi[i]])\\n a[vowel_index[i]] = s[r_vi[i]]\\n\\n return ''.join(a)\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"vowels = set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'])\\n\\nclass Solution:\\n def reverseVowels(self, s: str) -> str:\\n n = len(s)\\n\\n resLeft = resRight = ''\\n\\n left, right = 0, n - 1\\n\\n while left <= right:\\n if left == right:\\n resLeft += s[left]\\n # print('here?')\\n break\\n # print('left', left, s[left], 'right', right, s[right])\\n\\n if s[left] not in vowels:\\n # print('1')\\n resLeft += s[left]\\n left += 1\\n elif s[right] not in vowels:\\n # print('2')\\n resRight = s[right] + resRight\\n right -= 1\\n else:\\n # print('3')\\n resLeft += s[right]\\n resRight = s[left] + resRight\\n left += 1\\n right -= 1\\n\\n\\n # print('resLeft', resLeft)\\n # print('resRight', resRight)\\n\\n\\n return resLeft + resRight\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\\"\\\"\\\"\\n\\nleetcode\\ns = 'eeoe'\\nleotcede\\n\\n\\nle e tc od e\\n\\n\\n\\n\\n\\n\\n\\n\\\"\\\"\\\"\\n\\n\\n\\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, c: str) -> bool:\\n return c in set('aeiouAEIOU')\\n\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n i = 0\\n j = len(s)-1\\n\\n while i<j:\\n if self.isVowel(s[i]) and self.isVowel(s[j]):\\n s[i], s[j] = s[j], s[i]\\n i+=1\\n j-=1\\n elif not self.isVowel(s[i]):\\n i+=1\\n elif not self.isVowel(s[j]):\\n j-=1\\n\\n return \\\"\\\".join(s)\\n\\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"A\\\", \\\"e\\\", \\\"E\\\", \\\"i\\\", \\\"I\\\", \\\"o\\\", \\\"O\\\", \\\"u\\\", \\\"U\\\"]\\n vowelstr = \\\"\\\"\\n result = \\\"\\\"\\n index = -1\\n for i in s:\\n if i in vowels:\\n vowelstr = vowelstr + i\\n for j in range(len(s)):\\n if s[j] in vowels:\\n result = result[:j] + vowelstr[index] + result[j:]\\n index = index - 1\\n else:\\n result = result + s[j]\\n return result\\n\\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n chaine_inversee=s[::-1]\\n chaine_voyelle_inversee=\\\"\\\"\\n for j in chaine_inversee:\\n if j.lower() == 'a' or j.lower() == 'e' or j.lower() == 'i' or j.lower() == 'o' or j.lower() == 'u' :\\n chaine_voyelle_inversee+=j\\n chaine_res=\\\"\\\"\\n for k,x in enumerate(s):\\n if x.lower() == 'a' or x.lower() == 'e' or x.lower() == 'i' or x.lower() == 'o' or x.lower() == 'u' :\\n chaine_res+=chaine_voyelle_inversee[0]\\n chaine_voyelle_inversee=chaine_voyelle_inversee[1:]\\n else:\\n chaine_res+=s[k]\\n return chaine_res\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def swap(self, s: str, idx1: int, idx2: int) -> None:\\n temp = s[idx1]\\n s[idx1] = s[idx2]\\n s[idx2] = temp\\n\\n def isVowel(self, ch: str) -> bool:\\n return ch.lower() in set([\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\"])\\n\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n start, end = 0, len(s) - 1\\n while start < end:\\n if self.isVowel(s[start]) and self.isVowel(s[end]):\\n self.swap(s, start, end)\\n start += 1\\n end -= 1\\n if not self.isVowel(s[start]):\\n start += 1\\n if not self.isVowel(s[end]):\\n end -= 1\\n return ''.join(s)\\n \",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','A', 'i', 'I', 'u', 'U', 'e', 'E', 'o', 'O']\\n num = 0\\n count_bottom = 1\\n list_s = list(s)\\n top_switch = ''\\n bottom_switch = ''\\n top_num = 100\\n bottom_num = 100\\n while True:\\n if top_switch != '' and bottom_switch != '':\\n list_s[top_num] = bottom_switch\\n list_s[bottom_num] = top_switch \\n top_switch = ''\\n bottom_switch = ''\\n num += 1\\n count_bottom += 1\\n if num + count_bottom > int(len(list_s)):\\n break\\n top_s = list_s[num]\\n bottom_s = list_s[-count_bottom]\\n\\n if top_s in vowels:\\n top_switch = top_s\\n top_num = num\\n else:\\n num += 1\\n print(\\\"top\\\",top_switch)\\n \\n if bottom_s in vowels:\\n bottom_switch = bottom_s\\n bottom_num = - count_bottom\\n else:\\n count_bottom += 1\\n print(\\\"bottom\\\",bottom_switch)\\n \\n return ''.join(list_s)\\n \\n \\n\\n\\n \",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel = set(['a', 'e', 'i', 'o', 'u'])\\n s_arr = list(s)\\n l, r = 0, len(s) - 1\\n while (l <= r):\\n print(l, r)\\n if s_arr[l].lower() not in vowel:\\n l += 1\\n elif s_arr[r].lower() not in vowel:\\n r -= 1\\n else:\\n s_arr[l], s_arr[r] = s_arr[r], s_arr[l]\\n l += 1\\n r -= 1\\n return \\\"\\\".join(s_arr)\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n index = []\\n char = []\\n for charIndex in range(len(s_list)):\\n if s_list[charIndex] in \\\"AEIOUaeiou\\\":\\n index.append(charIndex)\\n char.append(s_list[charIndex])\\n char.reverse()\\n for i in index:\\n charWord = char.pop(0)\\n s_list[i] = charWord\\n return \\\"\\\".join(s_list)\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set('aeiouAEIOU') # Use a set for O(1) lookup\\n vowel_list = [char for char in s if char in vowels] # Collect all vowels\\n vowel_list.reverse() # Reverse the list of vowels\\n \\n # Build the result string with reversed vowels\\n result = []\\n for char in s:\\n if char in vowels:\\n result.append(vowel_list.pop(0)) # Append the next vowel from the reversed list\\n else:\\n result.append(char)\\n \\n return ''.join(result)\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n i = 0\\n j = len(s) - 1 \\n result = [c for c in s]\\n\\n while i <= j:\\n print(i)\\n print(j)\\n if self.isVowel(s[i]) and self.isVowel(s[j]):\\n temp = result[i]\\n result[i] = result[j]\\n result[j] = temp\\n i += 1\\n j -= 1\\n elif self.isVowel(s[i]):\\n j -= 1\\n elif self.isVowel(s[j]):\\n i += 1\\n else:\\n i += 1\\n j -= 1\\n newStr = \\\"\\\"\\n return newStr.join(result)\\n\\n\\n def isVowel(self, s):\\n return s.lower() in (\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\")\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"AEIUOaeiou\\\"\\n vls = [char for char in s if char in vowels][::-1]\\n print(vls)\\n res = []\\n for char in s:\\n if char in vowels:\\n res.append(vls.pop(0))\\n else:\\n res.append(char)\\n\\n return ''.join(res)\\n \\nx = Solution()\\nx.reverseVowels(\\\"leetcode\\\")\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set('aeiouAEIOU')\\n \\n vowel_list = [char for char in s if char in vowels]\\n vowel_list.reverse()\\n result = []\\n for char in s:\\n if char in vowels:\\n result.append(vowel_list.pop(0))\\n else:\\n result.append(char)\\n \\n return ''.join(result)\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set('aeiouAEIOU')\\n list = [char for char in s if char in vowels]\\n list.reverse()\\n result = []\\n for char in s:\\n if char in vowels:\\n result.append(list.pop(0))\\n else:\\n result.append(char)\\n return ''.join(result)\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, c: str) -> bool:\\n return c in set('aeiouAEIOU')\\n\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n i = 0\\n j = len(s)-1\\n\\n while i<j:\\n if self.isVowel(s[i]) and self.isVowel(s[j]):\\n s[i], s[j] = s[j], s[i]\\n i+=1\\n j-=1\\n elif not self.isVowel(s[i]):\\n i+=1\\n elif not self.isVowel(s[j]):\\n j-=1\\n\\n return \\\"\\\".join(s)\\n\\n \",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n v = 'aeiouAEIOU'\\n r = []\\n for i in s:\\n if i in v:\\n r.append(i)\\n r.reverse()\\n f =[]\\n for i in s:\\n if i in v:\\n f.append(r.pop(0))\\n else:\\n f.append(i)\\n return ''.join(f)\\n\\n\\n\\n\\n \",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n low = ['a','e','i','o','u']\\n up = [v.upper() for v in ['a','e','i','o','u']]\\n vow = set(up + low)\\n vowels = [v for v in list(s) if v in vow][::-1]\\n out = ''\\n\\n for letter in list(s):\\n if letter in vow:\\n v = vowels.pop(0)\\n out += v\\n else:\\n out += letter\\n\\n return out\\n\\n\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','e','i','o','u']\\n s_indices = []\\n s_vowels = []\\n\\n for i, char in enumerate(s):\\n if char.lower() in vowels:\\n s_indices.append(i)\\n s_vowels.append(char)\\n \\n # reverse vowels\\n s_indices = s_indices[::-1]\\n res = list(s)\\n for char in s_vowels:\\n res[s_indices[0]] = char\\n s_indices.pop(0)\\n\\n return \\\"\\\".join(res)\\n\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','e','i','o','u']\\n s_indices = []\\n s_vowels = []\\n\\n for i, char in enumerate(s):\\n if char.lower() in vowels:\\n s_indices.append(i)\\n s_vowels.append(char)\\n \\n # reverse vowels\\n s_indices = s_indices[::-1]\\n res = list(s)\\n for char in s_vowels:\\n res[s_indices[0]] = char\\n s_indices.pop(0)\\n\\n return \\\"\\\".join(res)\\n\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vow = []\\n act = []\\n for i in s:\\n if i in set('aeiouAEIOU'):\\n vow.append(i)\\n act.append('_')\\n else:\\n act.append(i)\\n vow.reverse()\\n for enu,i in enumerate(act):\\n if i=='_':\\n act[enu]=vow.pop(0)\\n return ''.join(act)\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = 'aeiouAEIOU'\\n s_list = list(s) # Convert the string to a list for in-place modifications\\n vowel_dict = {} # Dictionary to store positions and vowels\\n\\n # Collect vowels and their positions\\n for index, char in enumerate(s_list):\\n if char in vowels:\\n vowel_dict[index] = char\\n\\n # Get the reversed list of vowels\\n reversed_vowels = list(vowel_dict.values())[::-1]\\n\\n # Replace vowels in the list using the reversed vowels\\n for index, char in vowel_dict.items():\\n s_list[index] = reversed_vowels.pop(0)\\n \\n return ''.join(s_list)\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n vowels = [\\\"A\\\", \\\"a\\\", \\\"E\\\", \\\"e\\\", \\\"I\\\", \\\"i\\\", \\\"O\\\", \\\"o\\\", \\\"U\\\", \\\"u\\\"]\\n s_as_list = list(s)\\n \\n s_len = len(s)\\n l_pointer = 0\\n r_pointer = s_len-1\\n\\n for i in range(s_len):\\n\\n if l_pointer >= r_pointer:\\n return \\\"\\\".join(s_as_list)\\n\\n print(\\\"Left pointer: \\\", s[l_pointer], \\\" Right pointer: \\\", s[r_pointer]) \\n\\n if s[l_pointer] in vowels and s[r_pointer] in vowels:\\n print(s[l_pointer], \\\" changes with \\\", s[r_pointer])\\n l_temp = s[l_pointer]\\n r_temp = s[r_pointer]\\n s_as_list[l_pointer] = r_temp\\n s_as_list[r_pointer] = l_temp\\n l_pointer += 1\\n r_pointer -= 1\\n\\n elif s[r_pointer] in vowels and s[l_pointer] not in vowels and l_pointer+1 < s_len:\\n l_pointer += 1\\n\\n elif s[l_pointer] in vowels and s[r_pointer] not in vowels and r_pointer-1 >= 0:\\n r_pointer -= 1\\n \\n elif s[l_pointer] not in vowels and s[r_pointer] not in vowels and r_pointer-1 >= 0 and l_pointer+1 < s_len:\\n l_pointer += 1\\n r_pointer -= 1\\n\\n return \\\"test\\\"\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = 'aeiouAEIOU'\\n letters = []\\n indexes = []\\n for i in reversed(range(len(s))):\\n if s[i] in vowels:\\n letters.append(s[i])\\n indexes.append(i)\\n\\n split_letters = [x for x in s]\\n \\n for i in reversed(indexes):\\n split_letters[i] = letters.pop(0)\\n\\n new_string = ''\\n\\n for l in split_letters:\\n new_string += l\\n\\n return new_string\\n\\n\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n lWord = list(s)\\n toRev = []\\n for i in range(len(lWord)):\\n c = lWord[i]\\n if c.lower() in vowels:\\n toRev.append(c)\\n toRev.reverse()\\n\\n for i in range(len(lWord)):\\n ch = lWord[i].lower()\\n if ch in vowels:\\n lWord[i] = toRev.pop(0)\\n\\n\\n return ''.join(lWord)\\n \",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n lst=[]\\n lstr=[]\\n for i in s:\\n lst.append(i)\\n for i in range(len(lst)):\\n if lst[i] in ['A','E','I','O','U','a','e','i','o','u']:\\n lstr.append(lst[i])\\n lst[i]='#'\\n #hello-->h#ll#\\n lstr.reverse()\\n for i in range(len(lst)):\\n if lst[i]=='#':\\n lst[i]=lstr.pop(0)\\n if lstr==[]:\\n break\\n return ''.join(lst)\\n\\n \\n\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vol_str=\\\"aeiouAEIOU\\\"\\n lst = []\\n s_split = list(s)\\n print(s_split)\\n for i in range(len(s_split)):\\n if s_split[i] in vol_str:\\n print(\\\"hi\\\")\\n lst.append(s_split[i])\\n s_split[i]=\\\"_\\\"\\n\\n lst.reverse()\\n s_new=\\\"\\\"\\n for i in range(len(s_split)):\\n \\n if s_split[i] ==\\\"_\\\":\\n s_split[i]=lst.pop(0)\\n s_new+=s_split[i]\\n else:\\n s_new+=s_split[i]\\n return s_new\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n stack = []\\n for i in range(len(s)):\\n if s_list[i].lower() in vowels:\\n stack.append(s_list[i])\\n for i in range(len(s_list) - 1, -1, -1):\\n if s_list[i].lower() in vowels:\\n s_list[i] = stack.pop(0)\\n return ''.join(s_list)\\n\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s=list(s)\\n p=[]\\n for i in range(len(s)):\\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U'):\\n p.append(s[i])\\n s[i]=\\\"11\\\"\\n p=p[::-1]\\n for i in range(len(s)):\\n if s[i]==\\\"11\\\":\\n s[i]=p[0]\\n del p[0]\\n else:\\n continue\\n return \\\"\\\".join(s)\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n stack = []\\n for i in range(len(s)):\\n if s_list[i].lower() in vowels:\\n stack.append(s_list[i])\\n for i in range(len(s_list) - 1, -1, -1):\\n if s_list[i].lower() in vowels:\\n s_list[i] = stack.pop(0)\\n return ''.join(s_list)\\n\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n \\n a = set({'a','e','i','o','u'})\\n\\n vowels_list = []\\n\\n for i in s:\\n if i.lower() in a:\\n vowels_list.append(i)\\n\\n # reverse vowels\\n vowels_list = vowels_list[::-1]\\n\\n new_str=[]\\n print(vowels_list)\\n for i in range(len(s)):\\n if s[i].lower() in a:\\n new_str.append(vowels_list.pop(0)) \\n else:\\n new_str.append(s[i])\\n print(\\\"\\\".join(new_str))\\n return \\\"\\\".join(new_str)\\n \",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n \\n a = set({'a','e','i','o','u'})\\n\\n vowels_list = []\\n\\n for i in s:\\n if i.lower() in a:\\n vowels_list.append(i)\\n\\n # reverse vowels\\n vowels_list = vowels_list[::-1]\\n\\n new_str=[]\\n\\n for i in range(len(s)):\\n if s[i].lower() in a:\\n new_str.append(vowels_list.pop(0)) \\n else:\\n new_str.append(s[i])\\n return \\\"\\\".join(new_str)\\n \",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels=set('aeiouAEIOU')\\n vowellist=[]\\n for char in s:\\n if char in vowels:\\n vowellist.append(char)\\n\\n vowellist.reverse()\\n\\n result=''\\n for char in s:\\n if char in vowels:\\n result+=vowellist.pop(0)\\n else:\\n result+=char\\n return result\\n \",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vl = []\\n vowel = ['a', 'e','i','o','u']\\n for i in range(len(s)):\\n if s[i].lower() in vowel :\\n vl.append(s[i])\\n vl = vl[::-1]\\n\\n string_list = list(s)\\n\\n for i in range(len(string_list)):\\n if string_list[i].lower() in vowel:\\n string_list[i] = vl[0]\\n\\n vl.pop(0)\\n new_string = ''.join(string_list)\\n return new_string\",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','A','E','e','i','I','o','O','u','U']\\n vowelWord = \\\"\\\"\\n for letter in s:\\n if letter in vowels:\\n vowelWord+= letter\\n reversedWord = list(vowelWord[::-1])\\n new = \\\"\\\"\\n for n in range(len(s)):\\n if s[n] in vowels:\\n new +=reversedWord[0]\\n reversedWord.pop(0)\\n else:\\n new += s[n]\\n return new\\n\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n print(s)\\n vowels = ['a','e','i','o','u']\\n vowel_flag = [0]*len(s)\\n discovered_vowels = []\\n\\n for i,c in enumerate(s):\\n if c.lower() in vowels:\\n vowel_flag[i]=1\\n discovered_vowels.append(c)\\n\\n print(discovered_vowels)\\n \\n # Reverse the elements of the list\\n discovered_vowels.reverse()\\n print(discovered_vowels)\\n\\n # Place the vowels in the location\\n new_string = \\\"\\\"\\n for i,v in enumerate(vowel_flag):\\n if v:\\n new_string += discovered_vowels.pop(0)\\n else:\\n new_string += s[i]\\n\\n return new_string\\n \",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n out = \\\"\\\"\\n j = len(s)-1\\n st = []\\n while(j >=0):\\n if s[j].lower() in ['a','e','i','o','u']:\\n st.append(s[j])\\n j -= 1\\n for i in s:\\n if i.lower() not in ['a','e','i','o','u']:\\n out = out + i\\n else:\\n out = out + st.pop(0)\\n return out\\n \",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n \\n word= []\\n l2= []\\n st = [\\\"A\\\",\\\"E\\\",\\\"I\\\",\\\"O\\\",\\\"U\\\",\\\"a\\\",\\\"e\\\",\\\"i\\\",\\\"o\\\",\\\"u\\\"]\\n\\n\\n for i in range (len(s)):\\n if s[i] in st:\\n l2.append(s[i])\\n word.append(0)\\n else:\\n word.append(s[i])\\n \\n \\n l2.reverse()\\n\\n for i in range(len(word)):\\n if word[i] == 0:\\n word[i] = l2[0]\\n l2.pop(0) \\n \\n final = \\\"\\\"\\n\\n for i in word:\\n final = final + str(i)\\n \\n return final\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','e','i','o','u']\\n vowel_flag = [0]*len(s)\\n discovered_vowels = []\\n\\n for i,c in enumerate(s):\\n if c.lower() in vowels:\\n vowel_flag[i]=1\\n discovered_vowels.append(c)\\n \\n # Reverse the elements of the list\\n discovered_vowels.reverse()\\n # Place the vowels in the location\\n new_string = \\\"\\\"\\n for i,v in enumerate(vowel_flag):\\n if v:\\n new_string += discovered_vowels.pop(0)\\n else:\\n new_string += s[i]\\n\\n return new_string\\n \",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n #crap solution\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n lWord = list(s)\\n toRev = []\\n for i in range(len(lWord)):\\n c = lWord[i]\\n if c.lower() in vowels:\\n toRev.append(c)\\n toRev.reverse()\\n\\n for i in range(len(lWord)):\\n ch = lWord[i].lower()\\n if ch in vowels:\\n lWord[i] = toRev.pop(0)\\n\\n\\n return ''.join(lWord)\\n \",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','A','E','e','i','I','o','O','u','U']\\n vowelWord = \\\"\\\"\\n for letter in s:\\n if letter in vowels:\\n vowelWord+= letter\\n reversedWord = list(vowelWord[::-1])\\n new = \\\"\\\"\\n for n in range(len(s)):\\n if s[n] in vowels:\\n new +=reversedWord[0]\\n reversedWord.pop(0)\\n else:\\n new += s[n]\\n return new\\n\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vow = ['a', 'e', 'i', 'o', 'u', 'A' ,'E', 'I', 'O', 'U']\\n extractedVow = []\\n\\n for i in range(len(s)):\\n if s[i] in vow:\\n extractedVow.append(s[i])\\n\\n extractedVow.reverse() \\n s = list(s)\\n for i in range(len(s)):\\n if s[i] in vow:\\n s[i] = extractedVow.pop(0)\\n \\n return \\\"\\\".join(s)\\n \\n\\n\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vow = []\\n act = []\\n for i in s:\\n if i in set('aeiouAEIOU'):\\n vow.append(i)\\n act.append('_')\\n else:\\n act.append(i)\\n vow.reverse()\\n for enu,i in enumerate(act):\\n if i=='_':\\n act[enu]=vow.pop(0)\\n return ''.join(act)\",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n length = len(s)\\n rev = []\\n ret = \\\"\\\"\\n\\n for i in range(length):\\n if(re.search(r'[aeiouAEIOU]', s[i])):\\n rev.append(s[i])\\n \\n rev.reverse()\\n\\n j = 0\\n for i in range(length):\\n if(re.search(r'[aeiouAEIOU]', s[i])):\\n ret += rev[j]\\n j+=1\\n else:\\n ret += s[i]\\n \\n return ret\",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels=['a','e','i','o','u','A','E','I','O','U']\\n revvowel=[]\\n\\n \\n\\n for i in range(len(s)):\\n if s[i] in vowels:\\n revvowel.append(s[i])\\n \\n # print(revvowel)\\n revvowel.reverse()\\n \\n # for i in range(len(s)):\\n # if s[i] in vowels:\\n # # s[i]=revvowel[0]\\n\\n # s=s[:i] + revvowel[0] + s[i + 1:]\\n # revvowel.pop(0)\\n \\n # return s\\n\\n s_list = list(s)\\n\\n for i in range(len(s_list)):\\n if s_list[i] in vowels:\\n s_list[i] = revvowel.pop(0)\\n \\n return ''.join(s_list)\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['A', 'E', 'I', 'O', 'U', 'a', 'e', 'i', 'o', 'u']\\n our_vowels = []\\n result = []\\n print(s)\\n for ele in s: \\n if ele in vowels: \\n our_vowels.append(ele)\\n print(our_vowels)\\n\\n our_vowels = our_vowels[::-1]\\n print(our_vowels)\\n for ele in range(0, len(s)): \\n if s[ele] in vowels: \\n result.append(our_vowels[0])\\n \\n del our_vowels[0]\\n else: \\n result.append(s[ele])\\n return ''.join(result)\\n \\n\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n #can be upper/lower more than once \\n #reverse -> use a stack\\n\\n #individual two traversals? \\n vowList = []\\n vowPos = []\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n ret = \\\"\\\"\\n\\n for i in range(len(s)):\\n if s[i:i+1].lower() in vowels:\\n vowList.append(s[i:i+1])\\n vowPos.append(i)\\n\\n if len(vowList) <= 0:\\n return s\\n\\n last = 0 \\n for i in range(len(vowPos)):\\n if vowPos[i] == 0:\\n ret += vowList.pop()\\n last = vowPos[i] + 1 \\n else:\\n ret = ret + s[last: vowPos[i]] + vowList.pop()\\n last = vowPos[i] + 1 \\n \\n if(last < len(s)):\\n ret += s[last:]\\n\\n return ret\\n\\n \",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n right=0\\n left=len(s)-1\\n s=list(s)\\n vowels=['a','e','i','o','u','A','E','I','O','U']\\n\\n while right<=left:\\n print(\\\" I am in while loop \\\", right, left )\\n if s[right] not in vowels:\\n print(\\\"right is not vowel\\\", right)\\n right=right+1\\n elif s[left] not in vowels:\\n print(\\\"right is not vowel\\\", left)\\n left=left-1\\n else:\\n print(\\\"switch both right and left\\\", s[right], s[left])\\n s[right], s[left]= s[left], s[right]\\n right=right+1\\n left=left-1\\n return ''.join(s)\\n\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n positioning = []\\n idx =0\\n finalstr = \\\"\\\"\\n vowels = ['a','e','i','o','u','A','E','I','O','U']\\n\\n for i in range(len(s)):\\n if s[i] in vowels:\\n positioning.append((s[i],idx))\\n idx+=1\\n\\n positioning.sort(key=lambda a: a[1],reverse =True)\\n for i in range(len(s)):\\n if s[i] in vowels:\\n finalstr+= positioning[0][0]\\n positioning.pop(0)\\n else:\\n finalstr += s[i] \\n \\n return finalstr\",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel_list = ['a', 'e', 'i', 'o', 'u']\\n appearance_list = []\\n result = ''\\n for letter in s:\\n if letter.lower() in vowel_list:\\n appearance_list.append(letter)\\n appearance_list = appearance_list[::-1]\\n print()\\n for i in range(len(s)):\\n if s[i].lower() in vowel_list:\\n result += appearance_list.pop(0)\\n else:\\n result += s[i]\\n return result\\n\",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"aeiouAEIOU\\\"\\n\\n s = list(s)\\n\\n letters = []\\n pos = []\\n\\n for i, letter in enumerate(s):\\n if(letter in vowels):\\n letters.append(letter)\\n pos.insert(0, i)\\n\\n for i, position in enumerate(pos):\\n s[position] = letters[i]\\n return \\\"\\\".join(s) \",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n ans = ''\\n vowels = {'a':1,'e':1,'i':1,'o':1,'u':1, \\\"A\\\":1, \\\"E\\\":1,\\\"I\\\":1,\\\"O\\\":1,\\\"U\\\":1}\\n vowel_list = []\\n for i in range(len(s)):\\n try: \\n if vowels[s[i]]:\\n vowel_list.append(i)\\n except KeyError:\\n continue\\n vowel_list.reverse()\\n for i in range(len(s)):\\n try: \\n if vowels[s[i]]:\\n ans += s[vowel_list[0]]\\n vowel_list.pop(0)\\n except KeyError:\\n ans += s[i]\\n return ans\\n\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n buf = list(s)\\n myset = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}\\n vowels = []\\n indexs = []\\n\\n for i in range(len(s)):\\n if s[i] in myset:\\n vowels.append(s[i])\\n indexs.insert(0, i)\\n \\n for i in range(len(indexs)):\\n buf[indexs[i]] = vowels[i]\\n \\n answer = ''.join(buf)\\n return answer\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, letter: str) -> bool:\\n l = letter.lower()\\n if (l == 'a' or l == 'e' or l == 'i' or l == 'o' or l == 'u'):\\n return True\\n return False\\n\\n def reverseVowels(self, s: str) -> str:\\n vowels = []\\n locations = []\\n for i in range(len(s)):\\n if self.isVowel(s[i]):\\n vowels.append(s[i])\\n locations.insert(0,i)\\n \\n sList = list(s)\\n for i in range(len(vowels)):\\n sList[locations[i]] = vowels[i]\\n return ''.join(sList)\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n vowel_indices = []\\n vowels = []\\n\\n for i, c in enumerate(s):\\n if c in 'AEIOUaeiou':\\n vowel_indices.append(i)\\n vowels.insert(0, c)\\n\\n for i, index in enumerate(vowel_indices):\\n s[index] = vowels[i]\\n\\n return ''.join(s)\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n v='AEIOUaeiou'\\n r=[]\\n p=[]\\n a=''\\n for i in range (len(s)-1,-1,-1):\\n if s[i] in v:\\n r.append(s[i])\\n p.insert(0,i)\\n print(r,p)\\n if r == []:\\n return s\\n t=0\\n t2=0\\n print(len(p))\\n while t2< len(p):\\n a+=s[t:p[t2]]\\n t=p[t2]+1\\n a+=r[t2]\\n t2+=1\\n if t < len(s):\\n a+=s[t:]\\n return a\\n\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n\\n contained_vowels = []\\n positions = []\\n\\n for i in range(len(s)):\\n if s[i] in vowels:\\n contained_vowels.append(s[i])\\n positions.insert(0,i)\\n s_list = list(s)\\n for i in range(len(positions)):\\n s_list[positions[i]] = contained_vowels[i]\\n s = ''.join(s_list)\\n\\n return s\\n\\n\\n\\n\\n \",\n \"runtime\": \"162\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n let = []\\n index = []\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n for i in range(len(s)):\\n if (s[i] in vowels):\\n index.append(i)\\n let.insert(0,s[i])\\n for i in range(len(let)):\\n s[index[i]] = let[i]\\n return \\\"\\\".join(s)\\n\\n \",\n \"runtime\": \"162\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n foundv = []\\n foundi = []\\n for i in range(len(s)):\\n if s[i] in vowels:\\n foundv.insert(0, s[i])\\n foundi.append(i)\\n res = list(s)\\n for i in range(len(foundv)):\\n res[foundi[i]] = foundv[i]\\n return \\\"\\\".join(res) \\n\\n\\n \",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n #main method\\n vowels = []\\n for c in s:\\n if self.is_vowel(c):\\n vowels.insert(0,c)\\n\\n i = 0\\n vowel_index = 0\\n result = \\\"\\\"\\n for i, e in enumerate(s):\\n if self.is_vowel(e):\\n result += vowels[vowel_index]\\n vowel_index += 1\\n else:\\n result += e\\n i += 1\\n return result\\n\\n \\n def is_vowel(self, c):\\n upper_case = \\\"AEIOUaeiou\\\"\\n \\n if c in upper_case:\\n return True\\n\\n return False\\n \",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n v='AEIOUaeiou'\\n r=[]\\n p=[]\\n a=''\\n for i in range (len(s)-1,-1,-1):\\n if s[i] in v:\\n r.append(s[i])\\n p.insert(0,i)\\n print(r,p)\\n if r == []:\\n return s\\n t=0\\n t2=0\\n print(len(p))\\n while t2< len(p):\\n a+=s[t:p[t2]]\\n t=p[t2]+1\\n a+=r[t2]\\n t2+=1\\n if t < len(s):\\n a+=s[t:]\\n return a\\n\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n v = []\\n vowels = ('a', 'e', 'i', 'o', 'u')\\n for i in range(len(s)):\\n if s[i].lower() in vowels:\\n v.insert(0, s[i]) \\n\\n ans = []\\n cnt = 0\\n for i in range(len(s)):\\n if s[i].lower() not in vowels:\\n ans.append(s[i])\\n else:\\n ans.append(v[cnt])\\n cnt += 1\\n return ''.join(ans)\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n l1 = []\\n l2 = []\\n for i in range(len(s)):\\n if(s[i] in 'aeiouAEIOU'):\\n l2.insert(0,s[i])\\n else:\\n l1.append(s[i])\\n ans = []\\n l = 0\\n r = 0\\n for i in range(len(s)):\\n if(s[i] in 'aeiouAEIOU'):\\n ans.append(l2[r])\\n r+=1\\n else:\\n ans.append(l1[l])\\n l+=1\\n return ''.join(ans)\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"import functools\\nclass Solution:\\n def reverseVowels(self, s: str) -> str:\\n ll = len(s)\\n vowels = {'a','e','i','o','u','A','E','I','O','U'}\\n s = list(s)\\n i = 0\\n j = ll-1\\n while j-i>=1:\\n while i<j and not s[i] in vowels:\\n i+=1\\n while i<j and not s[j] in vowels:\\n j-=1\\n if s[i] in vowels and s[j] in vowels and i<j:\\n s[i], s[j] = s[j], s[i] \\n i+=1\\n j-=1\\n \\n return functools.reduce(lambda a,b:a+b, s)\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n\\n VOWELS = set('aeiou')\\n\\n def reverseVowels(self, s: str) -> str:\\n reversed_s = deque(s)\\n left, right = 0, len(s) - 1\\n while left < right:\\n while left < right and reversed_s[left].lower() not in self.VOWELS:\\n left += 1\\n\\n while left < right and reversed_s[right].lower() not in self.VOWELS:\\n right -= 1\\n\\n reversed_s[left], reversed_s[right] = reversed_s[right], reversed_s[left]\\n\\n left += 1\\n right -= 1\\n return ''.join(reversed_s)\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel = []\\n output = ''\\n\\n for i in range(len(s)-1, -1, -1):\\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':\\n vowel.append(s[i])\\n \\n\\n for i in range(0, len(s)):\\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':\\n sub = vowel.pop(0)\\n output += sub\\n else:\\n output += s[i]\\n\\n return output\\n\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n #extract and reverse vowels\\n vowels=[]\\n for i in range(0,len(s)):\\n if s[i] in \\\"aeiouAEIOU\\\":\\n vowels[0:0]=s[i] #use slicing to add subseqent vowels to the front (reversing them)\\n \\n #traverse string, swap each vowel with first one from vowels lost \\n output = list(s) #convert string to list for mutability\\n for j in range(0,len(s)):\\n if s[j] in \\\"aeiouAEIOU\\\":\\n output[j] = vowels[0] #swap with first element in vowels list\\n vowels.pop(0) #remove first element and shift other forward\\n return ''.join(output)\\n\\n\\\"\\\"\\\"\\n vowels = [char for char in s if char in \\\"aeiouAEIOU\\\"] # Collect vowels\\n output = list(s) # Convert string to list for mutability\\n \\n for i in range(len(s)):\\n if s[i] in \\\"aeiouAEIOU\\\":\\n output[i] = vowels.pop() # Replace vowel with the last one in the list\\n \\n return ''.join(output) # Convert list back to string\\n\\n\\\"\\\"\\\"\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n l=[]\\n for i in s:\\n if (i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u' or i == 'A' or i == 'E' or i == 'I' or i == 'O' or i == 'U'):\\n l.append(i)\\n s=s.replace(i,\\\"*\\\")\\n\\n k=0\\n l=l[::-1]\\n\\n\\n for i in s:\\n\\n if i=='*':\\n s=s.replace(i,l[k],1)\\n k=k+1\\n\\n\\n return(s)\\n \",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel=[i for i in s if i.lower() in ['a','e','i','o','u']][::-1]\\n word_list=list(s)\\n print(word_list)\\n for i, letter in enumerate(word_list):\\n print(i)\\n if letter.lower() in ['a','e','i','o','u']:\\n print(vowel[0])\\n word_list[i]=vowel[0]\\n vowel.pop(0)\\n return ''.join(word_list)\\n \\n \\n \",\n \"runtime\": \"175\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n indexes = [] \\n vowels = []\\n vowels_ref = ['a', 'e', 'i', 'o', 'u']\\n\\n for i, c in enumerate(s):\\n if c.lower() in vowels_ref:\\n indexes.append(i)\\n vowels.insert(0, c)\\n\\n vowels_index = dict(zip(indexes, vowels))\\n result = \\\"\\\"\\n for i, c in enumerate(s):\\n if (i in vowels_index):\\n result += vowels_index[i]\\n else:\\n result += s[i]\\n\\n return result\\n \\n \",\n \"runtime\": \"175\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, letter: str) -> bool:\\n l = letter.lower()\\n if (l == 'a' or l == 'e' or l == 'i' or l == 'o' or l == 'u'):\\n return True\\n return False\\n\\n def reverseVowels(self, s: str) -> str:\\n vowels = []\\n locations = []\\n for i in range(len(s)):\\n if self.isVowel(s[i]):\\n vowels.append(s[i])\\n locations.insert(0,i)\\n sout = \\\"\\\"\\n for i in range(len(s)):\\n if (len(locations) > 0 and i == locations[-1]):\\n sout += vowels.pop()\\n locations.pop()\\n else:\\n sout += s[i]\\n\\n return sout\",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n l=[]\\n for i in s:\\n if (i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u' or i == 'A' or i == 'E' or i == 'I' or i == 'O' or i == 'U'):\\n l.append(i)\\n s=s.replace(i,\\\"*\\\")\\n\\n k=0\\n l=l[::-1]\\n\\n\\n for i in s:\\n\\n if i=='*':\\n s=s.replace(i,l[k],1)\\n k=k+1\\n\\n\\n return(s)\\n \",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n list_s = list(s)\\n vowel_in_str = []\\n vowels = ['a', 'e', 'i', 'o', 'u']\\n vowels_up = ['A', 'E', 'I', 'O', 'U']\\n\\n for char in list_s:\\n if char in vowels:\\n vowel_in_str.insert(0, char)\\n if char in vowels_up:\\n vowel_in_str.insert(0, char)\\n\\n i = 0\\n j = 0\\n while j < len(list_s) and i < len(vowel_in_str):\\n if list_s[j] in vowels or list_s[j] in vowels_up:\\n list_s[j] = vowel_in_str[i]\\n i += 1\\n j += 1\\n \\n return(''.join(str(char) for char in list_s))\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n isVowel = []\\n vowels = ['a','A','e','E','i','I','o','O','u','U']\\n vowelsInWord = []\\n word = [*s]\\n\\n for letter in word: \\n if letter in vowels:\\n isVowel.append(True)\\n vowelsInWord.insert(0, letter)\\n else: \\n isVowel.append(False)\\n output = \\\"\\\"\\n i = 0\\n for letter in word:\\n if letter in vowels:\\n output += vowelsInWord[i]\\n i +=1 \\n else: \\n output += letter\\n return output \",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = []\\n for c in s:\\n if self.isVowel(c): vowels.append(c)\\n\\n newString = \\\"\\\"\\n for i in range(len(s)):\\n if self.isVowel(s[i]): newString = f'{newString}{vowels.pop()}'\\n else: newString = f'{newString}{s[i]}'\\n \\n return newString\\n \\n\\n \\n def isVowel(self, s : str):\\n s = s.lower()\\n if 'a' == s or 'e' == s or 'i' == s or 'o' == s or 'u' == s: return True\\n return False\\n\\n \\n def isVowel(self, s : str):\\n s = s.lower()\\n if 'a' == s or 'e' == s or 'i' == s or 'o' == s or 'u' == s: return True\\n return False\",\n \"runtime\": \"181\"\n },\n {\n \"code\": \"class Solution:\\n vowels = {\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"}\\n\\n def reverseVowels(self, s: str) -> str:\\n j = len(s)\\n out = \\\"\\\"\\n for i in range(len(s)):\\n c = s[i]\\n if c not in self.vowels or j <= i:\\n out += c\\n else:\\n while j > i:\\n j -= 1\\n if s[j] in self.vowels:\\n out += s[j]\\n s = s[:j] + c + s[j+1:]\\n break\\n \\n return out\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n #extract and reverse vowels\\n vowels=[]\\n for i in range(0,len(s)):\\n if s[i] in \\\"aeiouAEIOU\\\":\\n vowels[0:0]=s[i] #use slicing to add subseqent vowels to the front (reversing them)\\n \\n #traverse string, swap each vowel with first one from vowels lost \\n output = list(s) #convert string to list for mutability\\n for j in range(0,len(s)):\\n if s[j] in \\\"aeiouAEIOU\\\":\\n output[j] = vowels[0] #swap with first element in vowels list\\n vowels.pop(0) #remove first element and shift other forward\\n \\n return ''.join(output) #convert list back ot string\\n\\n\\\"\\\"\\\"\\n vowels = [char for char in s if char in \\\"aeiouAEIOU\\\"] # Collect vowels\\n output = list(s) # Convert string to list for mutability\\n \\n for i in range(len(s)):\\n if s[i] in \\\"aeiouAEIOU\\\":\\n output[i] = vowels.pop() # Replace vowel with the last one in the list\\n \\n return ''.join(output) # Convert list back to string\\n\\n\\\"\\\"\\\"\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n reversedlist = []\\n finalstring = \\\"\\\"\\n for i in s:\\n if i in \\\"aiueoAIUEO\\\":\\n reversedlist.insert(0, i)\\n index = 0\\n for i in s:\\n if i in \\\"aiueoAIUEO\\\":\\n print(\\\"is a vowel and the vowel is \\\")\\n finalstring += reversedlist[index]\\n index += 1\\n else: \\n print(\\\"not vowels\\\")\\n finalstring += i\\n\\n return finalstring\\n\\n \",\n \"runtime\": \"186\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n hash = {}\\n vowels = [s[i] for i in range(len(s)) if s[i] in ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U')]\\n\\n vowels.reverse()\\n\\n vi = 0\\n for i in range(len(s)):\\n if s[i] in ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'):\\n hash[i] = vowels[vi]\\n vi += 1\\n l = list(s)\\n for i in range(len(s)):\\n if i in hash:\\n l[i] = hash[i]\\n s = ''\\n for i in l:\\n s += i\\n return s \\n\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n right,left = len(s)-1,0\\n while left < right:\\n if s[left] in 'aeiouAEIOU':\\n if s[right] not in 'aeiouAEIOU':\\n right -= 1\\n else:\\n s = s[:left] + s[right] + s[left+1:right] + s[left] + s[right+1:]\\n left += 1\\n right -= 1\\n else :\\n left += 1\\n \\n return ''.join(s)\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"] \\n\\n sl = list(s)\\n\\n sl_vow = [c for c in sl if c in vowels]\\n\\n result = \\\"\\\"\\n for c in sl:\\n if c in vowels:\\n result = f\\\"{result}{sl_vow.pop()}\\\"\\n else:\\n result = f\\\"{result}{c}\\\"\\n\\n return result\\n\\n\\n\\n\",\n \"runtime\": \"190\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"aeiouAEIOU\\\"\\n left = 0\\n right = len(s) - 1\\n while left < right:\\n if not s[left] in vowels:\\n left += 1\\n if not s[right] in vowels:\\n right -= 1\\n if s[left] in vowels and s[right] in vowels and right != left:\\n s = s[:left] + s[right] + s[left+1:right] + s[left] + s[right+1:]\\n left += 1\\n right -= 1 \\n return s\",\n \"runtime\": \"190\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n l = 0\\n r = len(s) - 1\\n vowels = {\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"}\\n while l < r:\\n if s[l] not in vowels:\\n l += 1\\n elif s[r] not in vowels:\\n r -= 1\\n else:\\n new_string = s[:l] + s[r] + s[l + 1: r] + s[l]\\n if r + 1 < len(s):\\n new_string += s[r + 1:]\\n s = new_string\\n l += 1\\n r -= 1\\n return s\",\n \"runtime\": \"192\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n l = 0\\n r = len(s)-1\\n\\n while l < r:\\n if s[l].lower() in \\\"aeiou\\\" and s[r].lower() in \\\"aeiou\\\":\\n s = s[:l] + s[r] + s[l+1:r] + s[l] + s[r+1:]\\n l += 1\\n r -=1\\n else:\\n if s[l].lower() not in \\\"aeiou\\\":\\n l+=1\\n if s[r].lower() not in \\\"aeiou\\\":\\n r-=1\\n return s\",\n \"runtime\": \"192\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}\\n length = len(s)\\n if length == 1:\\n return s\\n\\n left_ind = 0\\n right_ind = length - 1\\n i = 0\\n\\n while left_ind < right_ind:\\n # hello\\n left_val = s[left_ind]\\n right_val = s[right_ind]\\n\\n if left_val in vowels and right_val in vowels:\\n s = s[:left_ind] + s[right_ind] + s[left_ind+1:right_ind] + s[left_ind] + s[right_ind+1:]\\n # print(s[:left_ind], s[right_ind], s[left_ind+1:right_ind], s[left_ind], s[right_ind+1:])\\n i += 1\\n left_ind += 1\\n right_ind -= 1\\n elif left_val in vowels:\\n right_ind -= 1\\n elif right_val in vowels:\\n left_ind += 1\\n else:\\n right_ind -= 1\\n left_ind += 1\\n return s\\n \\n def swap_vowels(self, s, indexes):\\n result = s\\n length = len(indexes)\\n for i in range(length // 2):\\n left = indexes[i]\\n right_ind = length - 1 - i\\n right = indexes[right_ind] if (right_ind) != i else left\\n result = result[:left] + result[right] + result[left+1:right] + result[left] + result[right+1:]\\n # 'hello' - [1, 4], 'h' + \\n # 1 = 0 and 0\\n # 2 = 0 and 1\\n # 3 = 0 and 2, 1 and 1?\\n # 4 = 0 and 3, 1 and 2\\n return result\\n\\n \",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = \\\"aeiouAEIOU\\\"\\n left = 0\\n right = len(s) - 1\\n while left < right:\\n if not s[left] in vowels:\\n left += 1\\n if not s[right] in vowels:\\n right -= 1\\n if s[left] in vowels and s[right] in vowels and right != left:\\n s = s[:left] + s[right] + s[left+1:right] + s[left] + s[right+1:]\\n left += 1\\n right -= 1 \\n return s\",\n \"runtime\": \"194\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":147,"string":"147"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n c = []\n v = []\n r = ''\n vowels = set([\"i\", \"e\", \"a\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"])\n backpointer = len(s)\n for i in range(len(s)):\n if s[i] in vowels:\n backpointer -= 1\n while s[backpointer] not in vowels:\n backpointer -= 1\n r += s[backpointer]\n else:\n r += s[i]\n return r","memory":"16800"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = 'aeiouAEIOU'\n stack = []\n output = \"\"\n\n for a in s:\n if a in vowels:\n stack.append(a)\n\n for a in s:\n output += stack.pop() if a in vowels else a \n\n return output","memory":"16900"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a','e','i','o','u','A','E','I','O','U']\n result = []\n ans = ''\n for each in s:\n if each in vowels:\n result.append(each)\n for i in s:\n if i in vowels:\n ans += result.pop()\n else:\n ans += i\n return ans \n\n","memory":"17000"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n if len(s) == 0:\n return s\n \n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n ans = list(s)\n i = 0\n j = len(ans)-1\n\n while i < j :\n if ans[i] in vowels and ans[j] in vowels:\n ans[i], ans[j] = ans[j], ans[i]\n i += 1\n j -= 1\n else:\n if ans[i] not in vowels:\n i += 1\n if ans[j] not in vowels:\n j -= 1\n\n return ''.join(ans)\n ","memory":"17000"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n ans = \"\"\n result = []\n for each in s:\n if each in vowels:\n result.append(each)\n for i in s:\n if i in vowels:\n ans += result.pop()\n else:\n ans += i\n return ans\n\n\n\n \n\n","memory":"17100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel_set = set(['a','e','i','o','u','A','E','I','O','U'])\n appear_vowel = []\n for si in s:\n if si in vowel_set:\n appear_vowel.append(si)\n\n return_string = ''\n ind = 0\n for si in s:\n if si in vowel_set:\n ind += 1\n return_string += appear_vowel[len(appear_vowel)-ind]\n else:\n return_string += si\n return return_string\n","memory":"17100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vow = []\n \n p =''\n for i in range(len(s)):\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\n vow.append(s[i]) \n count = len(vow)-1 \n for i in range(len(s)):\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\n p+=vow[count]\n count-=1\n else:\n p+=s[i]\n return p","memory":"17200"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n g=['A','E','I','O','U','a','e','i','o','u']\n t=[]\n for j in s:\n if j in g:\n t.append(j)\n k=''\n t=t[::-1]\n i=0\n for h in s:\n if h in g:\n k=k+t[i]\n i+=1\n else:\n k=k+h\n return (k)","memory":"17200"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n \n rev = \"\"\n newString =\"\"\n ptr = 0\n \n for letter in s:\n if letter in vowels:\n rev += letter\n rev = rev[::-1]\n for i in range(len(s)):\n if s[i] in vowels:\n newString += rev[ptr]\n ptr = ptr + 1\n else:\n newString += s[i]\n \n return newString","memory":"17300"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n stack = []\n for i in s:\n if i in vowels:\n stack.append(i)\n\n output = \"\"\n for j in s:\n if j in vowels:\n n = stack.pop(-1)\n output += n\n else:\n output += j\n \n return output\n ","memory":"17300"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n vowels = set('aeiouAEIOU')\n i,j = 0,len(s)-1\n while (i<j):\n if(s[i] not in vowels):\n i+=1\n elif(s[j] not in vowels):\n j-=1\n else:\n s[i],s[j] = s[j],s[i]\n i+=1\n j-=1\n return \"\".join(s)\n\n \n ","memory":"17400"},{"code":"class Solution:\n def isVowel(self, char: str) -> bool:\n if char.lower() in ['a', 'e', 'i', 'o', 'u']:\n return True\n else:\n return False\n\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n left = 0\n right = len(s_list)-1\n while left < right:\n if not self.isVowel(s_list[left]):\n left += 1\n if not self.isVowel(s_list[right]):\n right -= 1\n if self.isVowel(s_list[left]) and self.isVowel(s_list[right]):\n dummy = s_list[left]\n s_list[left] = s_list[right]\n s_list[right] = dummy\n left += 1\n right -= 1\n return ''.join(s_list)\n ","memory":"17400"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n i, j = 0, len(s)-1\n vowels = {'a','e','i','o','u'}\n \n s = list(s)\n while i < j:\n if s[i].lower() in vowels and s[j].lower() in vowels:\n s[i], s[j] = s[j], s[i]\n i += 1\n j -= 1\n elif s[i].lower() not in vowels:\n i += 1\n elif s[j].lower() not in vowels:\n j -= 1\n \n return ''.join(s)","memory":"17500"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n start_index = 0\n end_index = len(s)-1\n str_list = list(s)\n \n vowels = ['a', 'e', 'i', 'o', 'u', 'A','E','I', 'O', 'U']\n\n while start_index < end_index:\n while start_index < end_index and s[start_index] not in vowels:\n start_index+=1\n while start_index < end_index and s[end_index] not in vowels:\n end_index-=1\n \n if start_index < end_index:\n st = s[start_index]\n en = s[end_index]\n\n str_list[start_index] = en\n str_list[end_index] = st\n\n start_index+=1\n end_index-=1\n\n return ''.join(str_list)","memory":"17500"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n vowels ='aeiouAEIOU'\n left = 0 \n right = len(s) - 1\n\n while left < right:\n if s[left] not in vowels:\n left += 1\n elif s[right] not in vowels:\n right -= 1\n else:\n s[left],s[right] = s[right],s[left]\n left += 1\n right -= 1\n return (''.join(s))\n\n","memory":"17600"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n s_list = list(s)\n\n # Get all vowels in word\n vowels_word = []\n for char in s_list:\n if char in vowels:\n vowels_word.append(char)\n \n # Replace\n for i in range(len(s_list)):\n if s_list[i] in vowels:\n s_list[i] = vowels_word.pop()\n\n return ''.join(s_list)\n\n ","memory":"17600"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowel = ['a', 'e', 'i', 'o', 'u', \"A\", \"E\", \"I\", \"O\", \"U\"]\n svowels = [] \n s_list = list(s)\n for i in s:\n if i in vowel:\n svowels.append(i)\n \n for i in range(len(s_list)):\n if s_list[i] in vowel:\n s_list[i] = svowels.pop()\n \n return ''.join(s_list)","memory":"17700"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n letters = []\n vowels = ['a','e','i','o','u','A','E','I','O', 'U']\n for letter in s: \n if letter in vowels:\n letters.append(letter)\n letters.reverse()\n index = 0\n for j in range(len(s)):\n if s[j] in vowels:\n s[j]= letters[index]\n index += 1\n return ''.join(s)","memory":"17700"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n letters = []\n vowels = ['a','e','i','o','u','A','E','I','O', 'U']\n for letter in s: \n if letter in vowels:\n letters.append(letter)\n letters.reverse()\n index = 0\n for j in range(len(s)):\n if s[j] in vowels:\n s[j]= letters[index]\n index += 1\n return ''.join(s)","memory":"17800"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n s_list = list(s)\n\n # Get all vowels in word\n vowels_word = []\n for char in s_list:\n if char in vowels:\n vowels_word.append(char)\n \n # Replace\n for i in range(len(s_list)):\n if s_list[i] in vowels:\n s_list[i] = vowels_word.pop()\n\n return ''.join(s_list)\n\n ","memory":"17800"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n kempa=[]\n index=0\n for i in s:\n if i in \"AEIOUaeiou\":\n kempa.append(i)\n a=kempa\n # return a\n b=a[::-1]\n list2=list(s)\n for i in range(len(list2)):\n if list2[i] in \"AEIOUaeiou\":\n if index<len(b):\n list2[i]=b[index]\n index +=1\n return \"\".join(list2)\n\n # for i in range(len(s)):\n # if s[i]== (\"A\" or \"E\" or \"I\" or \"O\" or \"U\" or \"a\" or \"e\" or \"i\" or \"o\" or \"u\"):\n # list1.append(s[i])\n # return list1\n ","memory":"17900"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n vowel_list = list()\n replaced = 0\n for element in s: \n if self.isVowel(element): \n vowel_list.append(element)\n\n print(vowel_list)\n for i in range(len(s)): \n if self.isVowel(s[i]): \n s_list[i] = vowel_list[-1]\n vowel_list.pop(-1)\n return ''.join(s_list)\n\n\n def isVowel(self, s : str) -> bool: \n return s.lower() in [\"a\",\"i\",\"e\",\"o\",\"u\"]\n ","memory":"17900"},{"code":"def isvowel(c):\n return c.lower() in ['a','e','i','o','u']\n\nclass Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = []\n for c in s:\n if isvowel(c):\n vowels.append(c)\n s_out = list(s)\n for i in range(len(s_out)):\n if isvowel(s_out[i]):\n s_out[i] = vowels[-1]\n vowels = vowels[:-1]\n return \"\".join(s_out)","memory":"18000"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n vowels = ['a','e','i','o','u']\n extractedVowels = []\n for i in range(0,len(s)):\n if s[i].lower() in vowels:\n extractedVowels.append(s[i])\n updatedV = extractedVowels[::-1]\n x=0\n for i in range(0,len(s)):\n if s[i].lower() in vowels:\n s[i] = updatedV[x]\n x+=1\n return ''.join(s)\n ","memory":"18000"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n kempa=[]\n index=0\n for i in s:\n if i in \"AEIOUaeiou\":\n kempa.append(i)\n a=kempa\n # return a\n b=a[::-1]\n list2=list(s)\n for i in range(len(list2)):\n if list2[i] in \"AEIOUaeiou\":\n # if index<len(b):\n list2[i]=b[index]\n index +=1\n return \"\".join(list2)\n\n # for i in range(len(s)):\n # if s[i]== (\"A\" or \"E\" or \"I\" or \"O\" or \"U\" or \"a\" or \"e\" or \"i\" or \"o\" or \"u\"):\n # list1.append(s[i])\n # return list1\n ","memory":"18100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"]\n new_s = [\"\" for _ in range(len(s))]\n l, r = 0, len(s) - 1\n\n while l <= r:\n if s[l] not in vowels:\n new_s[l] = s[l]\n l += 1\n continue \n\n if s[r] not in vowels:\n new_s[r] = s[r]\n r -= 1\n continue\n \n new_s[l], new_s[r] = s[r], s[l]\n l += 1\n r -= 1\n \n return \"\".join(new_s)","memory":"18100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels= ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowels_list=[]\n index_list=[]\n\n for i in range(len(s)):\n if s[i] in vowels:\n vowels_list.append(s[i])\n\n word=[]\n count=0\n for i in range(0,len(s)):\n if s[i] in vowels:\n word.append(vowels_list[len(vowels_list)-count-1])\n count= count+1\n else:\n word.append(s[i])\n\n\n\n\n return \"\".join(word)\n\n\n ","memory":"18400"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels=\"aeiouAEIOU\"\n ind=[]\n for i in range(len(s)):\n if(s[i] in vowels):\n ind.append(s[i])\n ind=ind[::-1]\n j=0\n res=[]\n for i in range(len(s)):\n if(s[i] in vowels):\n res.append(ind[j])\n j+=1\n else:\n res.append(s[i])\n return \"\".join(res)","memory":"18400"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n indices = []\n vowels = \"\"\n nonvowel = \"\"\n for i in range(len(s)):\n if s[i] in \"AEIOUaeiou\":\n vowels += s[i]\n indices.append(i)\n else:\n nonvowel += s[i]\n output = \"\"\n vow = 0\n non = 0\n vowels = vowels[::-1]\n for i in range(len(s)):\n if vow < len(indices) and i == indices[vow]:\n output += vowels[vow]\n vow += 1\n else:\n output += nonvowel[non]\n non += 1\n return output","memory":"18500"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n w_vowels = [\n l for l in s if l.lower() in vowels\n ] \n reverse_vowels = w_vowels[::-1]\n\n final = []\n idx_vowels = 0\n for l in s:\n if l.lower() not in vowels:\n final.append(l)\n continue\n final.append(reverse_vowels[idx_vowels])\n idx_vowels+=1\n return \"\".join(final)\n \n \n \n\n ","memory":"18500"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n idx = []\n extractedVowels = []\n finalStr = \"\"\n for i in range(len(s)):\n if((s[i]).lower() in vowels):\n idx.append(i)\n extractedVowels.append(s[i])\n if len(idx) < 2:\n return s\n for i in range(len(idx)):\n if (i == 0):\n finalStr += s[0:idx[i]]\n finalStr += extractedVowels[-1]\n else:\n finalStr += s[idx[i-1]+1:idx[i]]\n finalStr += extractedVowels[-i-1]\n if (i == (len(idx) - 1)):\n idxOfRemainingStr = idx[i] + 1 - len(s)\n print(idxOfRemainingStr)\n if (idxOfRemainingStr < 0):\n finalStr += s[idxOfRemainingStr:]\n return finalStr\n\n\n ","memory":"18600"},{"code":"class Solution:\n def isVowel(self, c: str) -> bool:\n return c.lower() in 'aeiou'\n \n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n toReplace, charStack = [False] * len(s_list), []\n \n for i in range(len(s_list)):\n if self.isVowel(s_list[i]):\n toReplace[i] = True\n charStack.append(s_list[i])\n \n for i in range(len(s_list)):\n if toReplace[i]:\n s_list[i] = charStack.pop()\n \n # Join the list back into a string\n return ''.join(s_list)\n","memory":"18600"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n indicesOfVowels = []\n vowels = [\"a\", \"A\", \"e\", \"E\", \"i\", \"I\", \"o\", \"O\", \"u\", \"U\"]\n i = 0\n while i < len(s):\n if s[i] in vowels:\n indicesOfVowels.append(i)\n i = i + 1\n\n i = 0\n j = len(indicesOfVowels)-1\n newS = s\n while i < len(s):\n if s[i] in vowels:\n newS = newS[:i] + s[indicesOfVowels[j]] + s[i+1:]\n j = j - 1\n i = i + 1\n return newS\n\n ","memory":"18700"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n res = list(s)\n vowels = []\n for i, c in enumerate(s):\n if c.lower() in \"aeiou\":\n vowels.append(i)\n for i in range(len(vowels) // 2):\n c = s[vowels[i]]\n res[vowels[i]] = s[vowels[len(vowels) - 1 - i]]\n res[vowels[len(vowels) - 1 - i]] = c\n return ''.join(res)","memory":"18700"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s = list(s)\n dic = set(['a','e','i','o','u','A','E','I','O','U'])\n idx = []\n for i,c in enumerate(s) : \n if c in dic:\n idx.append(i)\n \n for i in range(len(idx)//2):\n s[idx[i]], s[idx[len(idx)-1-i]] = s[idx[len(idx)-1-i]], s[idx[i]]\n\n return ''.join(s)\n\n \n ","memory":"18800"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n indexes=[]\n slist= list(s)\n\n for i in range(len(slist)):\n if slist[i] in \"aAeEiIoOuU\":\n indexes.append(i)\n \n right = len(indexes)-1\n\n for i in range(len(indexes)//2):\n slist[indexes[i]],slist[indexes[right]]=slist[indexes[right]],slist[indexes[i]]\n right-=1\n \n answer= \"\"\n for i in slist:\n answer += i\n \n return answer","memory":"18800"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n s_list = list(s)\n vowels = set(['a', 'e', 'i', 'o', 'u'])\n idx_list = []\n for idx, char in enumerate(s_list):\n if char.lower() in vowels:\n idx_list.append(idx)\n \n n = len(idx_list)\n for i in range(n // 2):\n k = idx_list[i]\n j = idx_list[n - i - 1]\n s_list[k], s_list[j] = s_list[j], s_list[k]\n return \"\".join(s_list)\n","memory":"18900"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n i = 0 \n j = len(s)-1\n s = [i for i in s]\n vow = ['a','e','i','o','u','A','E','I','O','U']\n while i<j:\n if (s[i] in vow) and (s[j] in vow):\n s[i],s[j] = s[j],s[i]\n j -= 1\n i += 1\n if (s[j] not in vow):\n j -= 1\n if (s[i] not in vow):\n i += 1\n s = ''.join(i for i in s)\n return s\n\n","memory":"18900"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = set(['a', 'e', 'i', 'o', 'u'])\n vowel_position = []\n res = []\n for idx, ch in enumerate(s):\n if ch.lower() in vowels:\n vowel_position.append(idx)\n res.append(ch)\n total_vowels = len(vowel_position)\n for idx in range(total_vowels//2):\n res[vowel_position[idx]], res[vowel_position[total_vowels-idx-1]] = res[vowel_position[total_vowels-idx-1]], res[vowel_position[idx]]\n return ''.join(res)","memory":"19000"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n chars = []\n idxs = []\n\n for i, c in enumerate(s):\n if c in 'aeiouAEIOU':\n chars.append(c)\n idxs.append(i)\n \n res = list(s)\n k = len(chars)-1\n for i in idxs:\n res[i] = chars[k]\n k -= 1\n\n return ''.join(res)\n\n ","memory":"19000"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n if not len(s):\n return s\n s = list(s)\n vowels =[]\n vowel_pos = []\n for i_c, c in enumerate(s):\n if c.lower() in 'aeiou':\n vowels.append(c)\n vowel_pos.append(i_c)\n for i_v in range(len(vowels)//2):\n rev_ind = -1 -i_v\n tmp = vowels[rev_ind]\n s[vowel_pos[rev_ind]] = vowels[i_v]\n s[vowel_pos[i_v]] = tmp\n s = \"\".join(s)\n return s\n ","memory":"19100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n st = list(s)\n v = \"AEIOUaeiou\"\n vo = list(v)\n ind = []\n new = []\n for i in range(len(st)):\n if st[i] in v:\n new.append(st[i])\n ind.append(i)\n new.reverse()\n for i in range(len(ind)):\n st[ind[i]] = new[i]\n r = ''.join(st)\n return r","memory":"19100"},{"code":"class Solution:\n def reverseVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"]\n\n v_idx = []\n v = []\n ans = []\n cnt = 0\n for char in s:\n if char in vowels:\n v_idx.append(cnt)\n v.append(char)\n ans.append(\"\")\n else:\n ans.append(char)\n cnt += 1\n c = len(v) - 1\n for i in range(len(v)):\n ans[v_idx[i]] = v[c]\n c -= 1\n \n \n return \"\".join(ans)\n","memory":"19200"}],"string":"[\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n c = []\\n v = []\\n r = ''\\n vowels = set([\\\"i\\\", \\\"e\\\", \\\"a\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"])\\n backpointer = len(s)\\n for i in range(len(s)):\\n if s[i] in vowels:\\n backpointer -= 1\\n while s[backpointer] not in vowels:\\n backpointer -= 1\\n r += s[backpointer]\\n else:\\n r += s[i]\\n return r\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = 'aeiouAEIOU'\\n stack = []\\n output = \\\"\\\"\\n\\n for a in s:\\n if a in vowels:\\n stack.append(a)\\n\\n for a in s:\\n output += stack.pop() if a in vowels else a \\n\\n return output\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a','e','i','o','u','A','E','I','O','U']\\n result = []\\n ans = ''\\n for each in s:\\n if each in vowels:\\n result.append(each)\\n for i in s:\\n if i in vowels:\\n ans += result.pop()\\n else:\\n ans += i\\n return ans \\n\\n\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n if len(s) == 0:\\n return s\\n \\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n ans = list(s)\\n i = 0\\n j = len(ans)-1\\n\\n while i < j :\\n if ans[i] in vowels and ans[j] in vowels:\\n ans[i], ans[j] = ans[j], ans[i]\\n i += 1\\n j -= 1\\n else:\\n if ans[i] not in vowels:\\n i += 1\\n if ans[j] not in vowels:\\n j -= 1\\n\\n return ''.join(ans)\\n \",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n ans = \\\"\\\"\\n result = []\\n for each in s:\\n if each in vowels:\\n result.append(each)\\n for i in s:\\n if i in vowels:\\n ans += result.pop()\\n else:\\n ans += i\\n return ans\\n\\n\\n\\n \\n\\n\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel_set = set(['a','e','i','o','u','A','E','I','O','U'])\\n appear_vowel = []\\n for si in s:\\n if si in vowel_set:\\n appear_vowel.append(si)\\n\\n return_string = ''\\n ind = 0\\n for si in s:\\n if si in vowel_set:\\n ind += 1\\n return_string += appear_vowel[len(appear_vowel)-ind]\\n else:\\n return_string += si\\n return return_string\\n\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vow = []\\n \\n p =''\\n for i in range(len(s)):\\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\\n vow.append(s[i]) \\n count = len(vow)-1 \\n for i in range(len(s)):\\n if s[i] in ['a','e','i','o','u','A','E','I','O','U']:\\n p+=vow[count]\\n count-=1\\n else:\\n p+=s[i]\\n return p\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n g=['A','E','I','O','U','a','e','i','o','u']\\n t=[]\\n for j in s:\\n if j in g:\\n t.append(j)\\n k=''\\n t=t[::-1]\\n i=0\\n for h in s:\\n if h in g:\\n k=k+t[i]\\n i+=1\\n else:\\n k=k+h\\n return (k)\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n \\n rev = \\\"\\\"\\n newString =\\\"\\\"\\n ptr = 0\\n \\n for letter in s:\\n if letter in vowels:\\n rev += letter\\n rev = rev[::-1]\\n for i in range(len(s)):\\n if s[i] in vowels:\\n newString += rev[ptr]\\n ptr = ptr + 1\\n else:\\n newString += s[i]\\n \\n return newString\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n stack = []\\n for i in s:\\n if i in vowels:\\n stack.append(i)\\n\\n output = \\\"\\\"\\n for j in s:\\n if j in vowels:\\n n = stack.pop(-1)\\n output += n\\n else:\\n output += j\\n \\n return output\\n \",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n vowels = set('aeiouAEIOU')\\n i,j = 0,len(s)-1\\n while (i<j):\\n if(s[i] not in vowels):\\n i+=1\\n elif(s[j] not in vowels):\\n j-=1\\n else:\\n s[i],s[j] = s[j],s[i]\\n i+=1\\n j-=1\\n return \\\"\\\".join(s)\\n\\n \\n \",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, char: str) -> bool:\\n if char.lower() in ['a', 'e', 'i', 'o', 'u']:\\n return True\\n else:\\n return False\\n\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n left = 0\\n right = len(s_list)-1\\n while left < right:\\n if not self.isVowel(s_list[left]):\\n left += 1\\n if not self.isVowel(s_list[right]):\\n right -= 1\\n if self.isVowel(s_list[left]) and self.isVowel(s_list[right]):\\n dummy = s_list[left]\\n s_list[left] = s_list[right]\\n s_list[right] = dummy\\n left += 1\\n right -= 1\\n return ''.join(s_list)\\n \",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n i, j = 0, len(s)-1\\n vowels = {'a','e','i','o','u'}\\n \\n s = list(s)\\n while i < j:\\n if s[i].lower() in vowels and s[j].lower() in vowels:\\n s[i], s[j] = s[j], s[i]\\n i += 1\\n j -= 1\\n elif s[i].lower() not in vowels:\\n i += 1\\n elif s[j].lower() not in vowels:\\n j -= 1\\n \\n return ''.join(s)\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n start_index = 0\\n end_index = len(s)-1\\n str_list = list(s)\\n \\n vowels = ['a', 'e', 'i', 'o', 'u', 'A','E','I', 'O', 'U']\\n\\n while start_index < end_index:\\n while start_index < end_index and s[start_index] not in vowels:\\n start_index+=1\\n while start_index < end_index and s[end_index] not in vowels:\\n end_index-=1\\n \\n if start_index < end_index:\\n st = s[start_index]\\n en = s[end_index]\\n\\n str_list[start_index] = en\\n str_list[end_index] = st\\n\\n start_index+=1\\n end_index-=1\\n\\n return ''.join(str_list)\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n vowels ='aeiouAEIOU'\\n left = 0 \\n right = len(s) - 1\\n\\n while left < right:\\n if s[left] not in vowels:\\n left += 1\\n elif s[right] not in vowels:\\n right -= 1\\n else:\\n s[left],s[right] = s[right],s[left]\\n left += 1\\n right -= 1\\n return (''.join(s))\\n\\n\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n s_list = list(s)\\n\\n # Get all vowels in word\\n vowels_word = []\\n for char in s_list:\\n if char in vowels:\\n vowels_word.append(char)\\n \\n # Replace\\n for i in range(len(s_list)):\\n if s_list[i] in vowels:\\n s_list[i] = vowels_word.pop()\\n\\n return ''.join(s_list)\\n\\n \",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowel = ['a', 'e', 'i', 'o', 'u', \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"]\\n svowels = [] \\n s_list = list(s)\\n for i in s:\\n if i in vowel:\\n svowels.append(i)\\n \\n for i in range(len(s_list)):\\n if s_list[i] in vowel:\\n s_list[i] = svowels.pop()\\n \\n return ''.join(s_list)\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n letters = []\\n vowels = ['a','e','i','o','u','A','E','I','O', 'U']\\n for letter in s: \\n if letter in vowels:\\n letters.append(letter)\\n letters.reverse()\\n index = 0\\n for j in range(len(s)):\\n if s[j] in vowels:\\n s[j]= letters[index]\\n index += 1\\n return ''.join(s)\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n letters = []\\n vowels = ['a','e','i','o','u','A','E','I','O', 'U']\\n for letter in s: \\n if letter in vowels:\\n letters.append(letter)\\n letters.reverse()\\n index = 0\\n for j in range(len(s)):\\n if s[j] in vowels:\\n s[j]= letters[index]\\n index += 1\\n return ''.join(s)\",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n\\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n s_list = list(s)\\n\\n # Get all vowels in word\\n vowels_word = []\\n for char in s_list:\\n if char in vowels:\\n vowels_word.append(char)\\n \\n # Replace\\n for i in range(len(s_list)):\\n if s_list[i] in vowels:\\n s_list[i] = vowels_word.pop()\\n\\n return ''.join(s_list)\\n\\n \",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n kempa=[]\\n index=0\\n for i in s:\\n if i in \\\"AEIOUaeiou\\\":\\n kempa.append(i)\\n a=kempa\\n # return a\\n b=a[::-1]\\n list2=list(s)\\n for i in range(len(list2)):\\n if list2[i] in \\\"AEIOUaeiou\\\":\\n if index<len(b):\\n list2[i]=b[index]\\n index +=1\\n return \\\"\\\".join(list2)\\n\\n # for i in range(len(s)):\\n # if s[i]== (\\\"A\\\" or \\\"E\\\" or \\\"I\\\" or \\\"O\\\" or \\\"U\\\" or \\\"a\\\" or \\\"e\\\" or \\\"i\\\" or \\\"o\\\" or \\\"u\\\"):\\n # list1.append(s[i])\\n # return list1\\n \",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n vowel_list = list()\\n replaced = 0\\n for element in s: \\n if self.isVowel(element): \\n vowel_list.append(element)\\n\\n print(vowel_list)\\n for i in range(len(s)): \\n if self.isVowel(s[i]): \\n s_list[i] = vowel_list[-1]\\n vowel_list.pop(-1)\\n return ''.join(s_list)\\n\\n\\n def isVowel(self, s : str) -> bool: \\n return s.lower() in [\\\"a\\\",\\\"i\\\",\\\"e\\\",\\\"o\\\",\\\"u\\\"]\\n \",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"def isvowel(c):\\n return c.lower() in ['a','e','i','o','u']\\n\\nclass Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = []\\n for c in s:\\n if isvowel(c):\\n vowels.append(c)\\n s_out = list(s)\\n for i in range(len(s_out)):\\n if isvowel(s_out[i]):\\n s_out[i] = vowels[-1]\\n vowels = vowels[:-1]\\n return \\\"\\\".join(s_out)\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n vowels = ['a','e','i','o','u']\\n extractedVowels = []\\n for i in range(0,len(s)):\\n if s[i].lower() in vowels:\\n extractedVowels.append(s[i])\\n updatedV = extractedVowels[::-1]\\n x=0\\n for i in range(0,len(s)):\\n if s[i].lower() in vowels:\\n s[i] = updatedV[x]\\n x+=1\\n return ''.join(s)\\n \",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n kempa=[]\\n index=0\\n for i in s:\\n if i in \\\"AEIOUaeiou\\\":\\n kempa.append(i)\\n a=kempa\\n # return a\\n b=a[::-1]\\n list2=list(s)\\n for i in range(len(list2)):\\n if list2[i] in \\\"AEIOUaeiou\\\":\\n # if index<len(b):\\n list2[i]=b[index]\\n index +=1\\n return \\\"\\\".join(list2)\\n\\n # for i in range(len(s)):\\n # if s[i]== (\\\"A\\\" or \\\"E\\\" or \\\"I\\\" or \\\"O\\\" or \\\"U\\\" or \\\"a\\\" or \\\"e\\\" or \\\"i\\\" or \\\"o\\\" or \\\"u\\\"):\\n # list1.append(s[i])\\n # return list1\\n \",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"]\\n new_s = [\\\"\\\" for _ in range(len(s))]\\n l, r = 0, len(s) - 1\\n\\n while l <= r:\\n if s[l] not in vowels:\\n new_s[l] = s[l]\\n l += 1\\n continue \\n\\n if s[r] not in vowels:\\n new_s[r] = s[r]\\n r -= 1\\n continue\\n \\n new_s[l], new_s[r] = s[r], s[l]\\n l += 1\\n r -= 1\\n \\n return \\\"\\\".join(new_s)\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels= ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\\n vowels_list=[]\\n index_list=[]\\n\\n for i in range(len(s)):\\n if s[i] in vowels:\\n vowels_list.append(s[i])\\n\\n word=[]\\n count=0\\n for i in range(0,len(s)):\\n if s[i] in vowels:\\n word.append(vowels_list[len(vowels_list)-count-1])\\n count= count+1\\n else:\\n word.append(s[i])\\n\\n\\n\\n\\n return \\\"\\\".join(word)\\n\\n\\n \",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels=\\\"aeiouAEIOU\\\"\\n ind=[]\\n for i in range(len(s)):\\n if(s[i] in vowels):\\n ind.append(s[i])\\n ind=ind[::-1]\\n j=0\\n res=[]\\n for i in range(len(s)):\\n if(s[i] in vowels):\\n res.append(ind[j])\\n j+=1\\n else:\\n res.append(s[i])\\n return \\\"\\\".join(res)\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n indices = []\\n vowels = \\\"\\\"\\n nonvowel = \\\"\\\"\\n for i in range(len(s)):\\n if s[i] in \\\"AEIOUaeiou\\\":\\n vowels += s[i]\\n indices.append(i)\\n else:\\n nonvowel += s[i]\\n output = \\\"\\\"\\n vow = 0\\n non = 0\\n vowels = vowels[::-1]\\n for i in range(len(s)):\\n if vow < len(indices) and i == indices[vow]:\\n output += vowels[vow]\\n vow += 1\\n else:\\n output += nonvowel[non]\\n non += 1\\n return output\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\"]\\n w_vowels = [\\n l for l in s if l.lower() in vowels\\n ] \\n reverse_vowels = w_vowels[::-1]\\n\\n final = []\\n idx_vowels = 0\\n for l in s:\\n if l.lower() not in vowels:\\n final.append(l)\\n continue\\n final.append(reverse_vowels[idx_vowels])\\n idx_vowels+=1\\n return \\\"\\\".join(final)\\n \\n \\n \\n\\n \",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\"]\\n idx = []\\n extractedVowels = []\\n finalStr = \\\"\\\"\\n for i in range(len(s)):\\n if((s[i]).lower() in vowels):\\n idx.append(i)\\n extractedVowels.append(s[i])\\n if len(idx) < 2:\\n return s\\n for i in range(len(idx)):\\n if (i == 0):\\n finalStr += s[0:idx[i]]\\n finalStr += extractedVowels[-1]\\n else:\\n finalStr += s[idx[i-1]+1:idx[i]]\\n finalStr += extractedVowels[-i-1]\\n if (i == (len(idx) - 1)):\\n idxOfRemainingStr = idx[i] + 1 - len(s)\\n print(idxOfRemainingStr)\\n if (idxOfRemainingStr < 0):\\n finalStr += s[idxOfRemainingStr:]\\n return finalStr\\n\\n\\n \",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def isVowel(self, c: str) -> bool:\\n return c.lower() in 'aeiou'\\n \\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n toReplace, charStack = [False] * len(s_list), []\\n \\n for i in range(len(s_list)):\\n if self.isVowel(s_list[i]):\\n toReplace[i] = True\\n charStack.append(s_list[i])\\n \\n for i in range(len(s_list)):\\n if toReplace[i]:\\n s_list[i] = charStack.pop()\\n \\n # Join the list back into a string\\n return ''.join(s_list)\\n\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n indicesOfVowels = []\\n vowels = [\\\"a\\\", \\\"A\\\", \\\"e\\\", \\\"E\\\", \\\"i\\\", \\\"I\\\", \\\"o\\\", \\\"O\\\", \\\"u\\\", \\\"U\\\"]\\n i = 0\\n while i < len(s):\\n if s[i] in vowels:\\n indicesOfVowels.append(i)\\n i = i + 1\\n\\n i = 0\\n j = len(indicesOfVowels)-1\\n newS = s\\n while i < len(s):\\n if s[i] in vowels:\\n newS = newS[:i] + s[indicesOfVowels[j]] + s[i+1:]\\n j = j - 1\\n i = i + 1\\n return newS\\n\\n \",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n res = list(s)\\n vowels = []\\n for i, c in enumerate(s):\\n if c.lower() in \\\"aeiou\\\":\\n vowels.append(i)\\n for i in range(len(vowels) // 2):\\n c = s[vowels[i]]\\n res[vowels[i]] = s[vowels[len(vowels) - 1 - i]]\\n res[vowels[len(vowels) - 1 - i]] = c\\n return ''.join(res)\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s = list(s)\\n dic = set(['a','e','i','o','u','A','E','I','O','U'])\\n idx = []\\n for i,c in enumerate(s) : \\n if c in dic:\\n idx.append(i)\\n \\n for i in range(len(idx)//2):\\n s[idx[i]], s[idx[len(idx)-1-i]] = s[idx[len(idx)-1-i]], s[idx[i]]\\n\\n return ''.join(s)\\n\\n \\n \",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n indexes=[]\\n slist= list(s)\\n\\n for i in range(len(slist)):\\n if slist[i] in \\\"aAeEiIoOuU\\\":\\n indexes.append(i)\\n \\n right = len(indexes)-1\\n\\n for i in range(len(indexes)//2):\\n slist[indexes[i]],slist[indexes[right]]=slist[indexes[right]],slist[indexes[i]]\\n right-=1\\n \\n answer= \\\"\\\"\\n for i in slist:\\n answer += i\\n \\n return answer\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n s_list = list(s)\\n vowels = set(['a', 'e', 'i', 'o', 'u'])\\n idx_list = []\\n for idx, char in enumerate(s_list):\\n if char.lower() in vowels:\\n idx_list.append(idx)\\n \\n n = len(idx_list)\\n for i in range(n // 2):\\n k = idx_list[i]\\n j = idx_list[n - i - 1]\\n s_list[k], s_list[j] = s_list[j], s_list[k]\\n return \\\"\\\".join(s_list)\\n\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n i = 0 \\n j = len(s)-1\\n s = [i for i in s]\\n vow = ['a','e','i','o','u','A','E','I','O','U']\\n while i<j:\\n if (s[i] in vow) and (s[j] in vow):\\n s[i],s[j] = s[j],s[i]\\n j -= 1\\n i += 1\\n if (s[j] not in vow):\\n j -= 1\\n if (s[i] not in vow):\\n i += 1\\n s = ''.join(i for i in s)\\n return s\\n\\n\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = set(['a', 'e', 'i', 'o', 'u'])\\n vowel_position = []\\n res = []\\n for idx, ch in enumerate(s):\\n if ch.lower() in vowels:\\n vowel_position.append(idx)\\n res.append(ch)\\n total_vowels = len(vowel_position)\\n for idx in range(total_vowels//2):\\n res[vowel_position[idx]], res[vowel_position[total_vowels-idx-1]] = res[vowel_position[total_vowels-idx-1]], res[vowel_position[idx]]\\n return ''.join(res)\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n chars = []\\n idxs = []\\n\\n for i, c in enumerate(s):\\n if c in 'aeiouAEIOU':\\n chars.append(c)\\n idxs.append(i)\\n \\n res = list(s)\\n k = len(chars)-1\\n for i in idxs:\\n res[i] = chars[k]\\n k -= 1\\n\\n return ''.join(res)\\n\\n \",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n if not len(s):\\n return s\\n s = list(s)\\n vowels =[]\\n vowel_pos = []\\n for i_c, c in enumerate(s):\\n if c.lower() in 'aeiou':\\n vowels.append(c)\\n vowel_pos.append(i_c)\\n for i_v in range(len(vowels)//2):\\n rev_ind = -1 -i_v\\n tmp = vowels[rev_ind]\\n s[vowel_pos[rev_ind]] = vowels[i_v]\\n s[vowel_pos[i_v]] = tmp\\n s = \\\"\\\".join(s)\\n return s\\n \",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n st = list(s)\\n v = \\\"AEIOUaeiou\\\"\\n vo = list(v)\\n ind = []\\n new = []\\n for i in range(len(st)):\\n if st[i] in v:\\n new.append(st[i])\\n ind.append(i)\\n new.reverse()\\n for i in range(len(ind)):\\n st[ind[i]] = new[i]\\n r = ''.join(st)\\n return r\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def reverseVowels(self, s: str) -> str:\\n vowels = [\\\"a\\\", \\\"e\\\", \\\"i\\\", \\\"o\\\", \\\"u\\\", \\\"A\\\", \\\"E\\\", \\\"I\\\", \\\"O\\\", \\\"U\\\"]\\n\\n v_idx = []\\n v = []\\n ans = []\\n cnt = 0\\n for char in s:\\n if char in vowels:\\n v_idx.append(cnt)\\n v.append(char)\\n ans.append(\\\"\\\")\\n else:\\n ans.append(char)\\n cnt += 1\\n c = len(v) - 1\\n for i in range(len(v)):\\n ans[v_idx[i]] = v[c]\\n c -= 1\\n \\n \\n return \\\"\\\".join(ans)\\n\",\n \"memory\": \"19200\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":43,"string":"43"}}},{"rowIdx":272,"cells":{"question_id":{"kind":"number","value":347,"string":"347"},"name":{"kind":"string","value":"top-k-frequent-elements"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k</code> <em>most frequent elements</em>. You may return the answer in <strong>any order</strong>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> nums = [1,1,1,2,2,3], k = 2\n<strong>Output:</strong> [1,2]\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> nums = [1], k = 1\n<strong>Output:</strong> [1]\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>\n\t<li><code>k</code> is in the range <code>[1, the number of unique elements in the array]</code>.</li>\n\t<li>It is <strong>guaranteed</strong> that the answer is <strong>unique</strong>.</li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong> Your algorithm's time complexity must be better than <code>O(n log n)</code>, where n is the array's size.</p>\n"},"acRate":{"kind":"number","value":63.29095924076162,"string":"63.290959"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","divide-and-conquer","sorting","heap-priority-queue","bucket-sort","counting","quickselect"],"string":"[\n \"array\",\n \"hash-table\",\n \"divide-and-conquer\",\n \"sorting\",\n \"heap-priority-queue\",\n \"bucket-sort\",\n \"counting\",\n \"quickselect\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"34\", 0.0022], [\"36\", 0.0022], [\"37\", 0.0022], [\"38\", 0.0044], [\"40\", 0.0044], [\"42\", 0.0022], [\"44\", 0.0089], [\"45\", 0.0111], [\"47\", 0.0022], [\"48\", 0.0089], [\"49\", 0.0044], [\"50\", 0.0044], [\"51\", 0.0044], [\"53\", 0.0022], [\"55\", 0.0022], [\"57\", 0.0022], [\"59\", 0.0022], [\"62\", 0.0067], [\"63\", 0.0067], [\"64\", 0.0089], [\"65\", 0.0155], [\"66\", 0.0244], [\"67\", 0.0355], [\"68\", 0.0555], [\"69\", 0.0822], [\"70\", 0.1288], [\"71\", 0.1622], [\"72\", 0.2621], [\"73\", 0.3399], [\"74\", 0.4709], [\"75\", 0.6753], [\"76\", 0.8841], [\"77\", 1.144], [\"78\", 1.4905], [\"79\", 1.6971], [\"80\", 2.1192], [\"81\", 2.6834], [\"82\", 3.2232], [\"83\", 3.803], [\"84\", 3.9718], [\"85\", 4.5272], [\"86\", 5.1492], [\"87\", 5.5446], [\"88\", 5.3513], [\"89\", 5.5312], [\"90\", 5.7289], [\"91\", 5.5912], [\"92\", 5.0248], [\"93\", 4.5916], [\"94\", 4.4939], [\"95\", 3.903], [\"96\", 3.2988], [\"97\", 2.6035], [\"98\", 2.3458], [\"99\", 1.7616], [\"100\", 1.3306], [\"101\", 0.9974], [\"102\", 0.8175], [\"103\", 0.5642], [\"104\", 0.4043], [\"105\", 0.291], [\"106\", 0.2532], [\"107\", 0.1755], [\"108\", 0.1288], [\"109\", 0.1066], [\"110\", 0.0866], [\"111\", 0.0889], [\"112\", 0.0889], [\"113\", 0.0977], [\"114\", 0.0711], [\"115\", 0.0555], [\"116\", 0.0555], [\"117\", 0.0622], [\"118\", 0.0911], [\"119\", 0.0644], [\"120\", 0.0689], [\"121\", 0.0933], [\"122\", 0.0866], [\"123\", 0.0755]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18800\", 0.0022], [\"18900\", 0.0044], [\"19000\", 0.0378], [\"19100\", 0.0111], [\"20000\", 0.0022], [\"20200\", 0.0067], [\"20300\", 0.0089], [\"20400\", 0.0178], [\"20500\", 0.0422], [\"20600\", 0.1866], [\"20700\", 1.2529], [\"20800\", 2.5635], [\"20900\", 1.3151], [\"21000\", 6.9263], [\"21100\", 18.8573], [\"21200\", 24.0709], [\"21300\", 10.1539], [\"21400\", 2.4946], [\"21500\", 0.7086], [\"21600\", 0.171], [\"21700\", 0.0555], [\"21800\", 0.391], [\"21900\", 5.3069], [\"22000\", 10.1517], [\"22100\", 8.4701]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n fmap = Counter(nums)\n heap = []\n heapq.heapify(heap)\n \n for num, freq in fmap.items():\n if len(heap) < k:\n heapq.heappush(heap, (freq, num))\n elif freq > heap[0][0]: \n # check if current element is more frequent\n # and remove least frequent element\n heapq.heappop(heap)\n heapq.heappush(heap, (freq, num))\n \n return [num for _, num in heap]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().topKFrequent(nums, next(inputs))).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"34"},{"code":"# class Solution:\n# def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # mp=Counter(nums)\n # res=[]\n # ret=[]\n # for x in mp.keys():\n # res.append((mp[x],x))\n # res.sort(reverse=True)\n # for i in range(k):\n # ret.append(res[i][1])\n # return ret\n\n # import heapq\n # mp=Counter(nums)\n # heap=[]\n # ret=[]\n # for key,val in mp.items():\n # heapq.heappush(heap,(val,key))\n # if len(heap)>k:\n # heapq.heappop(heap)\n # for i in heap:\n # ret.append(i[1])\n # return ret\n\nsys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"36"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"37"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n fmap = Counter(nums)\n heap = []\n heapq.heapify(heap)\n \n for num, freq in fmap.items():\n if len(heap) < k:\n heapq.heappush(heap, (freq, num))\n elif freq > heap[0][0]: \n # check if current element is more frequent\n # and remove least frequent element\n heapq.heappop(heap)\n heapq.heappush(heap, (freq, num))\n \n return [num for _, num in heap]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n results = (str(Solution().topKFrequent(nums, next(inputs))).replace(\" \", \"\") + \"\\n\" \n for nums in inputs)\n f.writelines(results)\nexit(0)","runtime":"38"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()\n ","runtime":"40"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"42"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"44"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"45"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"47"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n bucket = [[] for x in range(len(nums)+1)]\n mp = {}\n for num in nums:\n if num in mp:\n mp[num] +=1\n else:\n mp[num] = 1\n for key in mp:\n bucket[mp[key]].append(key)\n ans = []\n for rev_idx in range(len(bucket)-1,0,-1):\n if k>0:\n ans.extend(bucket[rev_idx])\n k-=len(bucket[rev_idx])\n return ans\nwith open(\"user.out\", \"w\") as f:\n l = list(map(loads, stdin))\n for i in range(0, len(l), 2):\n print(str(Solution().topKFrequent(l[i], l[i + 1])), file=f)\nexit(0)\n","runtime":"48"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"49"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = {}\n\n for n in nums:\n counter[n] = 1 + counter.get(n, 0)\n \n freq = [[] for _ in range(len(nums) + 1)]\n\n for n, f in counter.items():\n freq[f].append(n)\n \n res = []\n\n for i in range(len(freq) - 1, -1, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().topKFrequent(nums, next(inputs))).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"50"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"51"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","runtime":"53"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n bucket = [[] for x in range(len(nums)+1)]\n mp = {}\n for num in nums:\n if num in mp:\n mp[num]+=1\n else:\n mp[num]=1\n \n for key in mp:\n bucket[mp[key]].append(key)\n ans = []\n while k:\n new_el = bucket.pop()\n if len(new_el)>0:\n k-=len(new_el)\n ans.extend(new_el)\n return ans\nwith open(\"user.out\", \"w\") as f:\n l = list(map(loads, stdin))\n for i in range(0, len(l), 2):\n print(str(Solution().topKFrequent(l[i], l[i + 1])), file=f)\nexit(0)\n","runtime":"55"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n if k > len(nums):\n raise ValueError(\"Give another k\")\n \n freq_dict = {}\n for num in nums:\n if num not in freq_dict:\n freq_dict[num] = 1\n else:\n freq_dict[num] += 1\n sorted_dict = sorted(freq_dict, key = freq_dict.get, reverse = True)\n return sorted_dict[:k]","runtime":"57"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n top = collections.Counter(nums)\n sorted_top = dict(sorted(top.items() ,key =lambda item:item[1]))\n kk = []\n for key in sorted_top.keys():\n kk.append(key)\n return kk[-k:]\n","runtime":"59"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n final = list()\n mapdict = {}\n for num in nums:\n mapdict[num] = 1+ mapdict.get(num, 0)\n list1 = sorted(list(mapdict.values()), reverse=True)\n target = list1[k-1]\n for key, value in mapdict.items():\n if value >= target:\n final.append(key)\n return final","runtime":"62"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = dict(Counter(nums))\n count = sorted(count.items(), key=lambda x:x[1])[::-1]\n result = [x[0] for x in count]\n result = result [:k]\n return result","runtime":"63"},{"code":"class Solution:\n def v1(self, nums: List[int], k: int) -> List[int]:\n counter = collections.Counter(nums)\n \n freq = [(v, k) for k, v in counter.items()]\n # method1: use heap of size K to get topK items O(n*logk)\n # method2: use quick select to get topK value, then filter items >= topK O(n)\n\n\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = collections.Counter(nums)\n\n # method3: bucket sort\n freq_dict = collections.defaultdict(list)\n for num, count in counter.items():\n freq_dict[count].append(num)\n\n cum = 0\n res = []\n # max freq is n\n for freq in reversed(range(1, len(nums) + 1)):\n if freq not in freq_dict:\n continue\n val = freq_dict[freq]\n res += val\n cum += len(val)\n if cum >= k:\n break\n return res[:k]\n","runtime":"64"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n freq = {}\n\n for i in nums:\n\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n\n # l = sorted(freq, key=lambda x: freq[x])\n\n heap = []\n\n for key,v in freq.items():\n heappush(heap, (-v,key))\n\n out = []\n\n for i in range(k):\n out.append(heappop(heap)[1])\n\n return out","runtime":"65"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n dic = Counter(nums)\n final_dic = dict(sorted(dic.items(), key = lambda item:item[1], reverse = True))\n ans = list(final_dic.keys())[:k]\n return ans\n \n","runtime":"66"},{"code":"from collections import Counter\nimport heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n # create hash_map of freq of each element\n # add them to heap and return k elements from the max heap\n\n # freq = {} # Counter for elements in nums\n # for n in nums:\n # if n not in freq:\n # freq[n] = 1\n # else:\n # freq[n] += 1\n\n freq = Counter(nums)\n\n \n # heap = []\n # for key,value in freq.items():\n # heap.append((value,key))\n\n heap = heapq.nlargest(k, freq.keys(), key=freq.get)\n \n # output = []\n # for values in heap:\n # output.append(values[1])\n\n return heap\n \n\n","runtime":"67"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n sol = [[] for i in range(len(nums))]\n # print(sol)\n\n mp = defaultdict(int)\n\n #lets count\n for n in nums:\n mp[n] += 1\n\n for key,value in mp.items():\n sol[value-1].append(key)\n\n print(sol)\n x = []\n\n for arr in reversed(sol):\n if len(arr) > 0:\n for num in arr:\n if k == 0:\n return x\n x.append(num)\n k -= 1\n return x","runtime":"68"},{"code":"\"\"\"\ngo through create a count for elements in list: Counter<num, count>\ncreate a min heap and add the first k elements\nafter first k, only add element if it's count is creater than top item\nreturn items of heap\ntime: O(NlogK)\nspace: O(N)\n\"\"\"\nfrom collections import defaultdict\nimport heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = defaultdict(int)\n for num in nums:\n counter[num] += 1\n min_heap = []\n i = 0\n keys = list(counter.keys())\n while i < k:\n heappush(min_heap, (counter[keys[i]], keys[i]))\n i += 1\n for j in range(k, len(keys)):\n num = keys[j]\n count = counter[num]\n if count > min_heap[0][0]:\n heapreplace(min_heap, (count, num))\n return [num for _, num in min_heap]","runtime":"69"},{"code":"import heapq\nfrom collections import Counter\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n mydict = dict(Counter(nums))\n frequencies = []\n for key, v in mydict.items():\n heappush(frequencies, (-1*int(v), key))\n return [heappop(frequencies)[1] for _ in range(k)]\n \n \n\n\n ","runtime":"70"},{"code":"import heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashmap = Counter(nums)\n heap = []\n result = []\n for i in hashmap: \n heapq.heappush(heap,(-hashmap[i],i))\n while heap and k!=0:\n val, key = heapq.heappop(heap)\n result.append(key)\n k-=1\n return result\n","runtime":"70"},{"code":"from collections import defaultdict\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \"\"\"\n In: nums=[1,2,2,3,3,3], k=2\n Out: [2, 3]\n\n In: nums=[], k=1\n Assertion fail\n\n In: nums[1,2], k =-1\n Assertion fail\n \"\"\"\n assert len(nums) > 0\n assert k > 0\n\n counter = defaultdict(int)\n for val in nums:\n counter[val]+=1 \n \n reverse_counter = defaultdict(list)\n for key, val in counter.items():\n reverse_counter[val].append(key)\n print(reverse_counter)\n out_keys = []\n for count in reversed(sorted(reverse_counter.keys())):\n for value in reverse_counter[count]:\n if len(out_keys) == k:\n break\n out_keys.append(value)\n \n return out_keys\n ","runtime":"71"},{"code":"import collections\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n col = collections.Counter(nums)\n\n common = col.most_common(k)\n \n rlist = [i for i,j in common]\n\n return rlist","runtime":"72"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = Counter(nums)\n most_freq = []\n for key,value in counter.most_common():\n most_freq.append(key)\n\n return most_freq[:k]\n","runtime":"72"},{"code":"from collections import Counter\nimport heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n heap=[]\n counter=Counter(nums)\n for key,val in counter.items():\n if len(heap)<k:\n heapq.heappush(heap,(val,key))\n else:\n heapq.heappushpop(heap,(val,key))\n return [h[1] for h in heap]\n\n","runtime":"73"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n import heapq\n from collections import Counter\n\n frequency = Counter(nums)\n\n min_heap = []\n\n for num, freq in frequency.items():\n heapq.heappush(min_heap, (freq, num))\n if len(min_heap) > k:\n heapq.heappop(min_heap)\n \n return [num for freq, num in min_heap]","runtime":"73"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n frequency_map = {} # Creating an empty dictionary that we will record our frequencies in\n\n for i in nums:\n if i in frequency_map:\n frequency_map[i] += 1 # Incrementing that int in the frequency map if it's already there\n else:\n frequency_map[i] = 1 # Initializing to 1 if it isn't already in the map\n \n # Now that we have the frequency of all the values mapped, we want to sort them in an order useful to us\n # For us, a descending order works best, becaue we want the most common numbers\n sorted_freq_map = sorted(frequency_map, key=lambda x: frequency_map[x], reverse=True)\n\n return sorted_freq_map[:k]\n\n \n ","runtime":"74"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashmap = collections.defaultdict(int)\n for num in nums:\n hashmap[num]+=1\n heap = []\n for key,value in hashmap.items():\n heapq.heappush(heap,(value,key))\n if len(heap)>k:\n heapq.heappop(heap)\n \n ans = []\n for tup in heap:\n ans.append(tup[1])\n return ans\n\n # from collections import Counter\n# class Solution:\n# def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n# count = Counter(nums)\n# unique = list(count.keys())\n \n# def partition(left, right, pivot_index) -> int:\n# pivot_frequency = count[unique[pivot_index]]\n# # 1. Move the pivot to end\n# unique[pivot_index], unique[right] = unique[right], unique[pivot_index] \n \n# # 2. Move all less frequent elements to the left\n# store_index = left\n# for i in range(left, right):\n# if count[unique[i]] < pivot_frequency:\n# unique[store_index], unique[i] = unique[i], unique[store_index]\n# store_index += 1\n\n# # 3. Move the pivot to its final place\n# unique[right], unique[store_index] = unique[store_index], unique[right] \n \n# return store_index\n \n# def quickselect(left, right, k_smallest) -> None:\n# \"\"\"\n# Sort a list within left..right till kth less frequent element\n# takes its place. \n# \"\"\"\n# # base case: the list contains only one element\n# if left == right: \n# return\n \n# # Select a random pivot_index\n# pivot_index = random.randint(left, right) \n \n# # Find the pivot position in a sorted list \n# pivot_index = partition(left, right, pivot_index)\n \n# # If the pivot is in its final sorted position\n# if k_smallest == pivot_index:\n# return \n# # go left\n# elif k_smallest < pivot_index:\n# quickselect(left, pivot_index - 1, k_smallest)\n# # go right\n# else:\n# quickselect(pivot_index + 1, right, k_smallest)\n \n# n = len(unique) \n# # kth top frequent element is (n - k)th less frequent.\n# # Do a partial sort: from less frequent to the most frequent, till\n# # (n - k)th less frequent element takes its place (n - k) in a sorted array. \n# # All elements on the left are less frequent.\n# # All the elements on the right are more frequent. \n# quickselect(0, n - 1, n - k)\n# # Return top k frequent elements\n# return unique[n - k:]","runtime":"74"},{"code":"import heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n heap = []\n counter = {}\n\n for i in nums:\n counter[i] = 1 + counter.get(i,0)\n\n for key,val in counter.items():\n heapq.heappush(heap,(-val,key)) \n\n res = []\n print(len(res))\n while len(res) < k:\n res.append(heapq.heappop(heap)[1])\n return res\n ","runtime":"75"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n\n occur = {}\n\n for num in nums:\n if num in occur:\n occur[num] += 1\n else:\n occur[num] = 1\n \n sort_occur = sorted(occur.items(), key=lambda x:x[1],reverse = True)\n top_k = sort_occur[:k]\n \n return [item[0] for item in top_k]\n ","runtime":"75"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n from collections import Counter\n \n count = Counter(nums)\n \n return [item for item, freq in count.most_common(k)]\n ","runtime":"76"},{"code":"import heapq\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = {}\n heap = []\n for n in nums:\n count = counter.get(n, 0) +1\n counter[n] = count\n \n for n,count in counter.items():\n heapq.heappush(heap, (-count, n))\n\n res = []\n for i in range(k):\n count, n = heapq.heappop(heap)\n res.append(n)\n return res\n\n","runtime":"76"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n my_map = {}\n for n in nums:\n if n not in my_map:\n my_map[n] = 0\n \n my_map[n] += 1\n\n my_tuple = ()\n\n my_tuple = sorted(my_map.items(), key=lambda item: item[1], reverse=True)\n\n # return list(my_map.keys())[:k]\n return list(map(lambda item: item[0], my_tuple))[:k]","runtime":"77"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n d = defaultdict(int)\n\n for n in nums:\n d[n] += 1\n \n x = [(k, v) for k, v in d.items()]\n\n x.sort(key=lambda e: -e[1])\n\n return [x[i][0] for i in range(k)]","runtime":"77"},{"code":"from collections import Counter\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq_map = Counter(nums)\n\n heap = []\n for num, count in freq_map.items():\n if len(heap) < k:\n heappush(heap, (count, num))\n else:\n heappushpop(heap, (count, num))\n\n results = []\n for tup in heap:\n results.append(tup[1])\n\n return results ","runtime":"78"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = Counter(nums)\n unique = list(counts.keys())\n \n def partition(left: int, right: int) -> int:\n pivotIndex = random.randint(left, right)\n pivotValue = unique[pivotIndex]\n unique[pivotIndex], unique[right] = unique[right], unique[pivotIndex]\n i = left - 1\n for j in range(left, right):\n if counts[unique[j]] < counts[pivotValue]:\n i += 1\n unique[i], unique[j] = unique[j], unique[i]\n unique[i + 1], unique[right] = unique[right], unique[i + 1]\n return i + 1\n\n def select(left: int, right: int, k_smallest: int) -> int:\n if left == right:\n return left\n q = partition(left, right)\n if k_smallest == q:\n return q\n if k_smallest < q:\n return select(left, q - 1, k_smallest)\n else:\n return select(q + 1, right, k_smallest)\n \n n = len(unique)\n return unique[select(0, n - 1, n - k):]","runtime":"78"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter_dict = Counter(nums)\n heap = [(-count, value) for value, count in counter_dict.items()]\n heapq.heapify(heap)\n return [heapq.heappop(heap)[1] for _ in range(k)]","runtime":"81"},{"code":"from collections import Counter\nimport heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = Counter(nums)\n heap = []\n answer = []\n for key,val in counter.items():\n heapq.heappush(heap,(-val,key))\n\n for i in range(k):\n largest = heapq.heappop(heap)\n answer.append(largest[1])\n\n return answer\n\n ","runtime":"81"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # find the frequency of each number\n num_frequency_map = {}\n for num in nums:\n num_frequency_map[num] = num_frequency_map.get(num, 0) + 1\n top_k_elements = []\n\n # go through all numbers of the num_frequency_map\n # and push them in the top_k_elements, which will have\n # top k frequent numbers. If the heap size is more than k,\n # we remove the smallest(top) number\n for num, frequency in num_frequency_map.items():\n heappush(top_k_elements, (frequency, num))\n if len(top_k_elements) > k:\n heappop(top_k_elements)\n\n # create a list of top k numbers\n top_numbers = []\n while top_k_elements:\n top_numbers.append(heappop(top_k_elements)[1])\n\n return top_numbers","runtime":"82"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq = defaultdict(int)\n\n for num in nums:\n freq[num] += 1\n \n maxHeap = []\n for num in freq:\n heapq.heappush(maxHeap, (-freq[num], num))\n \n ans = []\n while k:\n ans.append(heapq.heappop(maxHeap)[1])\n k-= 1\n \n return ans ","runtime":"82"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freqMap = {}\n for num in nums:\n freqMap[num] = freqMap.get(num, 0) + 1\n\n unique = list(freqMap.keys())\n\n def quickSelectHelper(startIdx, endIdx, pos):\n if startIdx == endIdx:\n return\n\n pivot, left, right = startIdx, startIdx + 1, endIdx\n\n while left <= right:\n if freqMap[unique[left]] > freqMap[unique[pivot]] and freqMap[unique[right]] < freqMap[unique[pivot]]:\n unique[left], unique[right] = unique[right], unique[left]\n\n if freqMap[unique[left]] <= freqMap[unique[pivot]]:\n left += 1\n\n if freqMap[unique[right]] >= freqMap[unique[pivot]]:\n right -= 1\n unique[pivot], unique[right] = unique[right], unique[pivot]\n\n if right == pos:\n return\n elif pos < right:\n quickSelectHelper(startIdx, right - 1, pos)\n else:\n quickSelectHelper(right + 1, endIdx, pos)\n\n \n\n # You only need to position the (n-k)th number as that number will have every number greater than itself on its right at which point we can just return the right part of it\n n = len(unique)\n quickSelectHelper(0, n - 1, n - k)\n return unique[n-k:]\n\n \n ","runtime":"83"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n max_heap = []\n ans = []\n count = collections.Counter(nums)\n for i, n in count.items():\n heapq.heappush(max_heap, (-n, i))\n for i in range(0, k):\n ans.append(heapq.heappop(max_heap)[1])\n return ans","runtime":"83"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n heap = []\n counter = {}\n for i in nums:\n counter[i] = 1 + counter.get(i,0)\n for key,val in counter.items():\n heapq.heappush(heap,(-val,key))\n res=[]\n while len(res)<k:\n res.append(heapq.heappop(heap)[1])\n return res","runtime":"84"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n elem_frequency = [[] for _ in range(len(nums) + 1)]\n\n count_frequency = dict()\n for n in nums:\n count_frequency[n] = 1 + count_frequency.get(n, 0)\n\n for n, freq in count_frequency.items():\n elem_frequency[freq].append(n)\n \n answer = []\n for i in range(len(elem_frequency) - 1, 0, -1):\n for n in elem_frequency[i]:\n answer.append(n)\n if len(answer) == k:\n return answer","runtime":"84"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n for n in nums:\n count[n] = count.get(n, 0)+1\n \n freq = list(count.items())\n freq.sort(key=lambda v: v[1], reverse=True)\n\n res = []\n for i in range(k):\n res.append(freq[i][0])\n \n return res","runtime":"85"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count_map = Counter(nums)\n heap = []\n for i in count_map.keys():\n heap.append((count_map[i], i))\n\n heap.sort(reverse = True)\n\n res = []\n for i in range(0, k):\n res.append(heap[i][1])\n\n return res\n ","runtime":"85"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = defaultdict(int)\n for num in nums:\n counts[num] += 1\n \n result = []\n for num, count in counts.items():\n if len(result) < k:\n heapq.heappush(result, [count, num])\n else:\n heapq.heappushpop(result, [count, num])\n return [num for count, num in result]\n ","runtime":"86"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n heap = []\n counter = {}\n for n in nums:\n counter[n] = 1 + counter.get(n, 0)\n \n for key, val in counter.items():\n heapq.heappush(heap, (-val, key))\n \n res = []\n while len(res) < k:\n res.append(heapq.heappop(heap)[1])\n \n return res","runtime":"86"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashmap = {}\n for n in nums:\n hashmap[n] = hashmap.get(n, 0) + 1\n sorted_dict = [key for key, v in sorted(hashmap.items(), key=lambda item: item[1], reverse=True)][:k]\n return sorted_dict\n\n ","runtime":"87"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = Counter(nums)\n \n freq = [[] for i in range(len(nums))]\n for n, c in counts.items():\n freq[c - 1].append(n)\n\n res = []\n for i in range(len(nums) - 1, -1, -1):\n while freq[i]:\n res.append(freq[i].pop())\n k -= 1\n if k == 0:\n return res","runtime":"87"},{"code":"from collections import defaultdict\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n result = defaultdict(int)\n\n for i in nums:\n result[i] += 1\n\n temp = [(result[i],i) for i in result]\n\n temp.sort()\n\n ans = []\n for i in range(len(temp)-1, len(temp)-k-1, -1):\n ans.append(temp[i][1])\n\n return ans\n","runtime":"88"},{"code":"from collections import Counter\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = Counter(nums)\n return [val for val, count in counter.most_common(k)]\n","runtime":"88"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n elem_frequency = [[] for _ in range(len(nums) + 1)]\n\n count_frequency = dict()\n for n in nums:\n count_frequency[n] = 1 + count_frequency.get(n, 0)\n\n for n, freq in count_frequency.items():\n elem_frequency[freq].append(n)\n \n answer = []\n for i in range(len(elem_frequency) - 1, 0, -1):\n for n in elem_frequency[i]:\n answer.append(n)\n if len(answer) == k:\n return answer","runtime":"89"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n for n in nums:\n count[n] = 1 + count.get(n,0)\n freq = [[] for i in range(len(nums) + 1)]\n for v,f in count.items():\n freq[f].append(v)\n res = []\n for i in range(len(freq) -1,0,-1):\n for j in freq[i]:\n res.append(j)\n if len(res) == k:\n return res\n\n\n \n \n\n","runtime":"89"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n # min heap\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n \n # hp\n minhp = []\n for key in freq.keys():\n heappush(minhp, (freq[key], key))\n if len(minhp) > k:\n heappop(minhp)\n \n return [key for f, key in minhp]","runtime":"90"},{"code":"from collections import Counter\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = Counter(nums)\n\n nums_by_count = [ [] for _ in range(len(nums) + 1) ]\n\n for num, count in counter.items():\n nums_by_count[count].append(num)\n\n result = []\n for nums in reversed(nums_by_count):\n if nums:\n result.extend(nums)\n if len(result) == k:\n break \n\n return result\n","runtime":"90"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = Counter(nums)\n\n count_list = []\n for num, count in counts.items():\n heapq.heappush(count_list, (-count, num))\n\n ans = []\n for _ in range(k):\n next_top = heapq.heappop(count_list)[1]\n ans.append(next_top)\n\n return ans\n","runtime":"91"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = defaultdict(int)\n freq = [[] for _ in range(len(nums)+1)]\n \n for n in nums:\n count[n] += 1\n \n for n, c in count.items():\n freq[c].append(n)\n res = []\n count = 0\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n count += 1\n if count == k:\n return res ","runtime":"91"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n\n\n count = {}\n freq = [[]] * (len(nums) + 1)\n for i in nums:\n count[i] = 1 + count.get(i, 0)\n\n res = []\n for n, c in count.items():\n freq[c] = freq[c] + [n]\n\n # print(freq)\n target = k\n res = []\n for i in range(len(nums), 0, -1):\n if freq[i]:\n res.extend(freq[i])\n if len(res) == k:\n return res\n\n # return res","runtime":"92"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n d = {}\n for a in nums:\n if a in d:\n d[a] +=1\n else:\n d[a] =1\n print(d)\n val = [[]] * (len(nums)+1)\n for key, value in d.items():\n if val[value]:\n val[value].append(key)\n else:\n val[value] = [key]\n print(val)\n out = []\n for a in range(len(val)-1,-1,-1):\n for x in val[a]:\n out.append(x)\n if len(out) == k:\n return out\n # return out[:k]\n \n \n","runtime":"92"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n maxCnt = 0\n for num in nums:\n count[num] = count.get(num, 0) + 1\n maxCnt = max(maxCnt, count[num])\n \n bucket = [[] for i in range(maxCnt + 1)]\n \n for val, cnt in count.items():\n bucket[cnt].append(val)\n \n res = []\n \n for i in range(maxCnt, -1, -1):\n \n if len(res) == k:\n break\n \n res += bucket[i]\n \n return res\n \n \n \n'''\n- if the problem involves some kind of counting, then we can try to optimize using some variation of count sort\n- count the number of elements O(n), and use the count to put the elements in a bucket list\n\nO(n)\n\nnums = [1,1,1,2,2,3], k = 2\n\nbucket[i] = list of values that have i counts\n\n0 1 2 3 4 5 6\n 3 2 1\n'''","runtime":"93"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n\n for num in nums:\n count[num] = 1 + count.get(num, 0)\n\n for key, value in count.items():\n freq[value].append(key)\n \n res = []\n for i in range(len(freq)-1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","runtime":"93"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n for num in nums:\n count[num] = 1 + count.get(num, 0)\n \n freq = [[] for i in range(len(nums) + 1)]\n for num, frequency in count.items():\n freq[frequency].append(num)\n \n res = []\n for i in range(len(freq) - 1, -1, -1):\n for j in range(len(freq[i])):\n res.append(freq[i][j])\n if len(res) == k:\n return res\n","runtime":"94"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n frequencyTable = {}\n kvalues = [[] for i in range(len(nums) + 1)]\n\n for element in nums: \n if element in frequencyTable: \n frequencyTable[element] += 1\n else: \n frequencyTable[element] = 1\n \n for key, value in frequencyTable.items(): \n kvalues[value].append(key)\n\n res = [] \n for i in range(len(kvalues) - 1, 0, -1):\n for n in kvalues[i]:\n res.append(n)\n if len(res) == k:\n return res","runtime":"94"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n for n, c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","runtime":"95"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = {}\n for n in nums:\n counter[n] = counter.get(n, 0) + 1\n \n sorted_by_count = sorted(counter.keys(), key=lambda x: counter[x], reverse=True)\n return sorted_by_count[:k]\n","runtime":"95"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq = defaultdict(int)\n\n for num in nums:\n freq[num] += 1\n \n minHeap = []\n for num in freq:\n heapq.heappush(minHeap, (freq[num], num))\n if len(minHeap) > k:\n heappop(minHeap)\n\n \n return [ val[1] for val in minHeap]","runtime":"96"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n\n return [i[0] for i in collections.Counter(nums).most_common(k)]\n ","runtime":"96"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # [0,1,2,3,4,5]\n #{1:3,2:1}\n #[[3],[2],[1],[],[],[]]\n # visitng eveyr element once and storing the frequency in a hashmap could easily give us the frequency count of each number. we are still O(n). from there, how do we return the top K most frequent items? \n # python dictionaries don't have a sorting function. We can use a list of n length, as we iterate through the dictionary, we can store the frequency count at the index of the list. so if \"1\" appears three times, we store 1 at index 3 of the list. \n #then we can simply return k elements from this list. \n freq_count = {}\n for num in nums:\n freq_count[num] = freq_count.get(num,0)+1\n res = [[] for num in nums]\n for key in freq_count:\n res[freq_count[key]-1].append(key)\n #5,4,3,2,1,0\n print(res)\n print(freq_count)\n ans=[]\n for i in range(len(res)-1,-1,-1):\n for n in res[i]:\n ans.append(n)\n if len(ans)==k:\n return ans\n \n \n\n\n\n","runtime":"97"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n countMap = {}\n countList = []\n result = []\n\n # Build the count map and count list\n for num in nums:\n if countMap.get(num, -1) != -1:\n countMap[num]['count'] += 1\n countList[countMap[num]['index']]['count'] += 1\n else:\n countMap[num] = {\n 'index': len(countList),\n 'count': 1\n }\n countList.append({\n 'num': num,\n 'count': 1\n })\n \n # Sort the count list based on the count field\n sorted_num = sorted(countList, key=lambda x: x['count'], reverse=True)\n \n # Pick the k top most element from the count list\n for i in range(k):\n result.append(sorted_num[i]['num'])\n\n return result\n ","runtime":"97"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n for n, c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","runtime":"98"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n for n, c in count.items():\n freq[c].append(n)\n res = []\n for i in range(len(freq)-1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","runtime":"98"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n for n, c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) -1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res\n ","runtime":"99"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n\n freq = [[] for i in range(len(nums) + 1)]\n\n count = Counter(nums)\n\n for n,c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) -1,-1,-1):\n for n in freq[i]:\n res.append(n)\n\n if len(res) == k:\n return res\n\n\n\n\n\n\n # You are going to have a dictionary to keep count of each number and how many times that number occurs\n # Also will have i 2d array where the index is the number of times a count occured and the the value is the list of number for that count\n # Index the 2d array from the last value adding to the result array and return once length reaches K\n\n\n\n\n\n","runtime":"99"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count ={}\n freq = [ [] for i in range (len(nums)+1)]\n for n in nums:\n count[n] = 1+ count.get(n,0)\n for n,c in count.items():\n freq[c].append(n)\n \n # print(count)\n # print(freq)\n\n res = []\n for i in range(len(freq)-1,0,-1):\n for n in freq[i]:\n res.append(n)\n if(len(res)==k):\n return res\n ","runtime":"100"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n table = defaultdict(int)\n\n for num in nums:\n table[num] += 1\n \n tmp = sorted(table.items(), key = lambda x : x[1], reverse = True)\n res = []\n\n for i in range(k):\n res.append(tmp[i][0])\n \n return res\n","runtime":"100"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n d = {}\n count = [[] for i in range(len(nums) + 1)]\n print(count)\n\n for n in nums:\n d[n] = d.get(n, 0) + 1\n \n for n, c in d.items():\n count[c].append(n)\n \n res = []\n for i in range(len(count)-1, 0, -1):\n for n in count[i]:\n res.append(n)\n if len(res) == k:\n return res\n \n\n ","runtime":"101"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq_counter = {}\n index_mapping_array = [[] for i in range(len(nums)+1)]\n for num in nums:\n freq_counter[num] = 1 + freq_counter.get(num, 0)\n for num in freq_counter:\n frequency = freq_counter[num]\n index_mapping_array[frequency].append(num)\n \n print(index_mapping_array)\n #Find K Frequent Elements\n k_frequent = []\n index_array = len(index_mapping_array) - 1 \n for i in range(len(index_mapping_array)-1, 0, -1):\n for x in range(0, len(index_mapping_array[i])):\n if k > 0:\n k_frequent.append(index_mapping_array[i][x])\n k = k -1\n else:\n break\n return k_frequent\n\n\n\n\n\n\n\n","runtime":"101"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # create a frequency map\n freqMap = defaultdict(int)\n for num in nums:\n freqMap[num] += 1\n\n # create a list for elements with freq equal to the index\n freqArray = [[] for i in range(len(nums) + 1)]\n for val, freq in freqMap.items():\n freqArray[freq].append(val)\n\n # iterate array in reverse order to get the top k elements\n res = []\n for i in range(len(freqArray) - 1, -1, -1):\n for element in freqArray[i]:\n res.append(element)\n if len(res) == k:\n return res\n\n return res\n","runtime":"102"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # hashmap for count\n counts = {}\n for n in nums:\n counts[n] = counts.get(n, 0) + 1\n\n \n # buckset sort: array[freq, nums associated w/ that freq]\n bucket = [[] for i in range(len(nums) + 1)]\n for num, count in counts.items():\n bucket[count].append(num)\n \n # reverse loop on bucket array\n res = []\n for i in range(len(bucket) - 1, 0, -1):\n for n in bucket[i]:\n res.append(n)\n if len(res) == k: \n return res\n","runtime":"102"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n n = len(nums)\n\n num_count = {}\n\n freq = [[] for _ in range(n+1)]\n for num in nums:\n num_count[num] = num_count.get(num, 0) + 1\n \n # populate the freq counter with keys of num_count\n for key, val in num_count.items():\n freq[val].append(key)\n \n res = []\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res\n\n\n ","runtime":"103"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n list = []\n nums.sort()\n l = 0\n r = 0\n count = 0\n while r < len(nums):\n if nums[l] == nums[r]:\n count+=1\n else:\n list.append((nums[l],count))\n l=r\n count=1\n r+=1\n list.append((nums[l], count)) \n list.sort(key=lambda x: x[1], reverse=True)\n \n return [x[0] for x in list[:k]]\n\n\n \n \n \n \n ","runtime":"103"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq = {}\n\n for n in nums:\n freq[n] = freq.get(n, 0) + 1\n bucket = [[] for _ in range(len(nums) + 1)]\n for n in freq:\n bucket[freq[n]].append(n)\n res = []\n for i in range(len(bucket) - 1, -1, -1):\n for num in bucket[i]:\n res.append(num)\n k -= 1\n if k <= 0:\n return res\n return res","runtime":"104"},{"code":"# T: O(NLogN)\n# class Solution:\n# def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n# hashmap = {}\n# for n in nums:\n# hashmap[n] = hashmap.get(n, 0) + 1\n# sorted_dict = [key for key, v in sorted(hashmap.items(), key=lambda item: item[1], reverse=True)][:k]\n# return sorted_dict\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n frequency = [[] for _ in range(len(nums) + 1)]\n\n for n in nums:\n count[n] = count.get(n, 0) + 1\n for key, v in count.items():\n frequency[v].append(key)\n result = []\n for l in frequency[::-1]:\n result.extend(l[:k - len(result)]) # Only take as many as needed\n if len(result) == k:\n print(k)\n print(len(result))\n print(result)\n return result[:k]\n return result\n","runtime":"104"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n nc = {}\n for n in nums:\n nc[n] = 1 + nc.get(n, 0)\n\n bs = [[] for i in range(len(nums) + 1)]\n for key in nc.keys():\n bs[nc[key]].append(key)\n\n res = []\n i = len(bs) - 1\n while len(res) < k:\n for n in bs[i]:\n res.append(n)\n if len(res) >= k:\n break\n i -= 1\n return res\n","runtime":"105"},{"code":"from collections import Counter\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # get counts of each uniqeu number\n # sort by the counts and take the top K => O(nlogn)\n # min heap to keep the top K \n # initialize with K unique, and iterate through all other numbers\n # continually removing the min count using min heap logN removal\n # => NlogK, for K<=N\n # K is sufficiently smaller than N, we could use a bucket approach\n # where we have buckets for counts of size 1 to N\n # and put each unqieu number in its bucket count, then\n # to get the topK would be O(N+K) = O(N)\n buckets = defaultdict(list)\n for num, count in Counter(nums).items():\n buckets[count].append(num)\n top_k = []\n while len(top_k)<k:\n for ct in range(len(nums), 0, -1):\n nums_with_ct = buckets[ct]\n num_picked = min(k-len(top_k), len(nums_with_ct))\n top_k.extend(nums_with_ct[:num_picked])\n return top_k\n \n\n\n\n ","runtime":"105"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n res = []\n\n for n in nums:\n count[n] = 1+count.get(n, 0)\n\n sorted_dict = dict(sorted(count.items(), key=lambda item: item[1], reverse=True))\n for i in range(k):\n res.append(list(sorted_dict.keys())[i])\n return res\n","runtime":"106"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq = defaultdict(int)\n pre_res = [[] for i in range(len(nums) + 1)]\n\n for n in nums:\n freq[n] += 1\n\n for n, c in freq.items():\n pre_res[c].append(n)\n\n print(pre_res)\n\n res = []\n for i in range(len(pre_res) - 1, 0, -1):\n print(i)\n for n in pre_res[i]:\n res.append(n)\n if len(res) == k:\n return res\n \n","runtime":"106"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n for num in nums:\n count[num] = 1 + count.get(num,0)\n freq = [[] for i in range(len(nums)+1)]\n for key,val in count.items():\n freq[val].append(key)\n res = []\n for i in range(len(freq)-1,-1,-1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","runtime":"107"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n frequency = [[] for i in range(len(nums) + 1)]\n res = []\n for num in nums:\n count[num] = 1 + count.get(num, 0)\n\n for n,c in count.items():\n frequency[c].append(n)\n\n for i in range(len(frequency) - 1, 0, -1):\n res.extend(frequency[i])\n if len(res) == k:\n return res","runtime":"107"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashMap = {}\n topK = []\n\n for i in nums:\n hashMap[i] = hashMap.get(i, 0) + 1\n\n counts = list(hashMap.values())\n counts.sort(reverse=True)\n\n counts = counts[0:k]\n\n for key, value in hashMap.items():\n if value in counts:\n topK.append(key)\n \n return topK\n","runtime":"108"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n nums.sort()\n buckets = [[] for i in range(len(nums)+1)]\n\n charCount = {}\n for i in range(len(nums)):\n charCount[nums[i]] = charCount.get(nums[i], 0) + 1\n # key:value, element: count \n for element, count in charCount.items():\n buckets[count].append(element)\n \n result = []\n for i in range(len(buckets)-1, 0,-1):\n if len(result) >= k:\n break \n for each in buckets[i]:\n if len(result) <k:\n result.append(each)\n return result\n \n\n\n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n # counts = {}\n # buckets = [ [] for i in range(len(nums)+1) ]\n \n # for n in nums:\n # counts[n] = 1 + counts.get(n, 0)\n # for n, c in counts.items():\n # buckets[c].append(n)\n # # buckets are initialized now\n \n # result = []\n # for i in range( len(buckets)-1, 0, -1):\n # for each in buckets[i]:\n # result.append(each)\n # if len(result) == k:\n # return result\n","runtime":"109"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n n = len(nums)\n freq = collections.defaultdict(int)\n for num in nums:\n freq[num] += 1\n\n nums.sort(key=lambda num: (freq[num], num), reverse=True)\n\n res = set()\n \n for i in range(n):\n res.add(nums[i])\n if len(res) == k:\n break\n \n return res","runtime":"110"},{"code":"from collections import defaultdict\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = {}\n for num in nums:\n counter[num] = counter.get(num, 0) + 1\n reverse_count = defaultdict(list)\n for key, value in counter.items():\n reverse_count[value].append(key)\n N = len(nums)\n ans = []\n for i in range(N, -1, -1):\n while len(ans) < k and reverse_count[i]:\n ans.append(reverse_count[i].pop())\n if len(ans) == k:\n return ans\n \n \n \n","runtime":"111"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # map_ = {}\n # for i in range(len(nums)):\n # map_[nums[i]] = map_.get(nums[i],0) + 1\n # queue = []\n # for (num, freq) in map_.items():\n # heapq.heappush(queue, (freq, num))\n # if len(queue)>k:\n # heapq.heappop(queue)\n # res = [0]*k\n # for i in range(k-1, -1, -1):\n # res[i] = heapq.heappop(queue)[1]\n # return res\n\n memo={}\n for i in range(len(nums)):\n memo[nums[i]]=memo.get(nums[i],0)+1\n heap=[]\n for num in memo:\n heapq.heappush(heap,(memo[num],num))\n if len(heap)>k:\n heapq.heappop(heap)\n res = []\n while heap:\n res.append(heapq.heappop(heap)[1])\n return res\n\n","runtime":"111"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n dic = defaultdict(int)\n ans = [None]*k\n for num in nums:\n dic[num] += 1\n keys, vals = list(dic.keys()), list(dic.values())\n for i in range(k):\n index = vals.index(max(vals))\n ans[i] = keys[index] \n vals[index] = float('-inf')\n \n return ans","runtime":"112"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n final = []\n nums = sorted(nums)\n last_val = -10000000000000000000000000000000000\n start_index = 0\n last_index = 0\n\n distinct_list = []\n counter_list = []\n\n for i in range(len(nums)):\n if nums[i] > last_val:\n distinct_list.append(nums[i])\n start_index = i\n last_val = nums[i]\n if i != len(nums) -1:\n if nums[i] < nums[i+1]:\n counter_list.append(i - start_index)\n start_index = i+1\n else:\n continue\n else:\n counter_list.append(i - start_index)\n\n for i in range(k):\n index_ = counter_list.index(max(counter_list))\n counter_list.pop(index_)\n final.append(distinct_list.pop(index_))\n return final","runtime":"114"},{"code":"from collections import defaultdict\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashmap = defaultdict(int)\n result = []\n\n for num in nums:\n hashmap[num] += 1\n \n # number: count \n i = 0\n while i < k:\n max = -1\n number = -1\n for num, count in hashmap.items(): \n if count > max:\n max = count\n number = num\n result.append(number)\n del hashmap[number] \n i += 1\n return result\n\n \n \n \n \n \n \n \n '''\n hashmap = {}\n result = []\n for num in nums:\n if num in hashmap:\n hashmap[num] += 1\n else:\n hashmap[num] = 1\n \n i = 0\n while i < k:\n max_num = 0\n curr_count = 0\n for num, count in hashmap.items():\n if count >= curr_count:\n max_num = num\n curr_count = count\n result.append(max_num)\n del hashmap[max_num]\n i += 1\n return result\n '''\n\n","runtime":"114"},{"code":"from sortedcontainers import SortedDict\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n freq = defaultdict(int)\n reverseFreq = SortedDict()\n for n in nums:\n if n in freq:\n old_freq = freq[n]\n if old_freq not in reverseFreq:\n reverseFreq[old_freq] = set()\n if old_freq + 1 not in reverseFreq:\n reverseFreq[old_freq + 1] = set()\n reverseFreq[old_freq].remove(n)\n \n reverseFreq[old_freq + 1].add(n)\n freq[n] += 1\n else:\n freq[n] += 1\n if 1 not in reverseFreq:\n reverseFreq[1] = set()\n reverseFreq[1].add(n)\n \n count = 0 \n ans = []\n for key in reversed(reverseFreq):\n for val in reverseFreq[key]:\n ans.append(val)\n count += 1\n if count == k:\n return ans\n return ans","runtime":"115"},{"code":"from collections import defaultdict\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashmap = defaultdict(int)\n result = []\n\n for num in nums:\n hashmap[num] += 1\n \n # number: count \n i = 0\n while i < k:\n max = -1\n number = -1\n for num, count in hashmap.items(): \n if count > max:\n max = count\n number = num\n result.append(number)\n del hashmap[number] \n i += 1\n return result\n\n \n \n \n \n \n \n \n '''\n hashmap = {}\n result = []\n for num in nums:\n if num in hashmap:\n hashmap[num] += 1\n else:\n hashmap[num] = 1\n \n i = 0\n while i < k:\n max_num = 0\n curr_count = 0\n for num, count in hashmap.items():\n if count >= curr_count:\n max_num = num\n curr_count = count\n result.append(max_num)\n del hashmap[max_num]\n i += 1\n return result\n '''\n\n","runtime":"116"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n frequency = dict()\n output = []\n for num in nums:\n frequency[num] = 1 if num not in frequency else frequency[num] + 1\n\n for i in range(k):\n value = max(frequency.items(), key=operator.itemgetter(1))[0]\n output.append(value)\n del frequency[value]\n\n return output","runtime":"116"},{"code":"\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n cnt = collections.Counter(nums)\n n = len(nums)\n bucket = [[] for _ in range(n)]\n for num, f in cnt.items():\n bucket[f-1].append(num)\n print(bucket)\n res = []\n for f in range(n-1, -1, -1):\n print(k)\n if k == 0:\n break\n k -= len(bucket[f])\n res.extend(bucket[f])\n return res","runtime":"117"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = {}\n\n for n in nums:\n if n not in counter:\n counter[n] = 1\n else:\n counter[n] += 1\n \n counter_sorted = dict(sorted(counter.items(), key=lambda item: item[1], reverse=True))\n\n output = []\n for i in range(k):\n output.append(list(counter_sorted.keys())[i])\n \n return output\n ","runtime":"118"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = Counter(nums)\n heap = []\n distinct_numbers = list(counter.keys())\n for i in range(k):\n heapq.heappush(heap, (counter[distinct_numbers[i]], distinct_numbers[i]))\n \n for i in range(k, len(distinct_numbers)):\n current_count = counter[distinct_numbers[i]]\n if current_count >= heap[0][0]:\n heapq.heappop(heap)\n heapq.heappush(heap, (current_count, distinct_numbers[i]))\n heapq.heapify(heap)\n\n result = [h[1] for h in heap]\n return result\n","runtime":"119"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = collections.Counter(nums)\n ans = []\n for i in range(k):\n val = max(counts, key=counts.get)\n ans.append(val)\n del counts[val]\n return ans","runtime":"120"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # store count of all numbers in map\n # find max val in map, add it final res array and remove that pair\n\n res = []\n count = {}\n\n for n in nums:\n count[n] = count.get(n, 0) + 1\n\n while k > 0:\n max_count = 0\n max_count_key = None\n for n, c in count.items():\n if c > max_count:\n max_count = c\n max_count_key = n\n\n res.append(max_count_key)\n del count[max_count_key]\n\n k -= 1\n\n return res","runtime":"121"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n #Maybe put all this in a counter and then when it counts you print based on how\n valuesAndFrequency = {}\n output = set()\n for i in nums:\n if i in valuesAndFrequency:\n valuesAndFrequency[i] +=1\n else:\n valuesAndFrequency[i] = 1\n biggestNums = set()\n biggestNum = float('-inf')\n key = 0 \n while (len(biggestNums) != k):\n for i, j in valuesAndFrequency.items():\n if j>biggestNum:\n biggestNum = j\n key = i\n biggestNums.add(key)\n valuesAndFrequency.pop(key)\n key = 0\n biggestNum= float('-inf')\n return list(biggestNums)\n","runtime":"121"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashMap = {}\n highestValues = []\n\n for i in nums:\n hashMap[i] = hashMap.get(i, 0) + 1\n\n for i in range(k):\n max_key = max(hashMap, key=hashMap.get)\n highestValues.append(max_key)\n del hashMap[max_key]\n\n return highestValues\n","runtime":"122"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n hashMap = {}\n for n in nums:\n if n not in hashMap:\n hashMap[n] = [1, n]\n else:\n pair = hashMap[n]\n print(pair)\n hashMap[n] = [pair[0]+1, pair[1]]\n \n maxHeap = hashMap.values()\n maxHeap = [[-i, j] for i, j in maxHeap]\n heapq.heapify(maxHeap)\n\n output = []\n while k > 0:\n count, num = heapq.heappop(maxHeap)\n output.append(num)\n k = k -1\n return output\n\n\n \n\n ","runtime":"123"}],"string":"[\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n fmap = Counter(nums)\\n heap = []\\n heapq.heapify(heap)\\n \\n for num, freq in fmap.items():\\n if len(heap) < k:\\n heapq.heappush(heap, (freq, num))\\n elif freq > heap[0][0]: \\n # check if current element is more frequent\\n # and remove least frequent element\\n heapq.heappop(heap)\\n heapq.heappush(heap, (freq, num))\\n \\n return [num for _, num in heap]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().topKFrequent(nums, next(inputs))).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"# class Solution:\\n# def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # mp=Counter(nums)\\n # res=[]\\n # ret=[]\\n # for x in mp.keys():\\n # res.append((mp[x],x))\\n # res.sort(reverse=True)\\n # for i in range(k):\\n # ret.append(res[i][1])\\n # return ret\\n\\n # import heapq\\n # mp=Counter(nums)\\n # heap=[]\\n # ret=[]\\n # for key,val in mp.items():\\n # heapq.heappush(heap,(val,key))\\n # if len(heap)>k:\\n # heapq.heappop(heap)\\n # for i in heap:\\n # ret.append(i[1])\\n # return ret\\n\\nsys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n fmap = Counter(nums)\\n heap = []\\n heapq.heapify(heap)\\n \\n for num, freq in fmap.items():\\n if len(heap) < k:\\n heapq.heappush(heap, (freq, num))\\n elif freq > heap[0][0]: \\n # check if current element is more frequent\\n # and remove least frequent element\\n heapq.heappop(heap)\\n heapq.heappush(heap, (freq, num))\\n \\n return [num for _, num in heap]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n results = (str(Solution().topKFrequent(nums, next(inputs))).replace(\\\" \\\", \\\"\\\") + \\\"\\\\n\\\" \\n for nums in inputs)\\n f.writelines(results)\\nexit(0)\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n bucket = [[] for x in range(len(nums)+1)]\\n mp = {}\\n for num in nums:\\n if num in mp:\\n mp[num] +=1\\n else:\\n mp[num] = 1\\n for key in mp:\\n bucket[mp[key]].append(key)\\n ans = []\\n for rev_idx in range(len(bucket)-1,0,-1):\\n if k>0:\\n ans.extend(bucket[rev_idx])\\n k-=len(bucket[rev_idx])\\n return ans\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n l = list(map(loads, stdin))\\n for i in range(0, len(l), 2):\\n print(str(Solution().topKFrequent(l[i], l[i + 1])), file=f)\\nexit(0)\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = {}\\n\\n for n in nums:\\n counter[n] = 1 + counter.get(n, 0)\\n \\n freq = [[] for _ in range(len(nums) + 1)]\\n\\n for n, f in counter.items():\\n freq[f].append(n)\\n \\n res = []\\n\\n for i in range(len(freq) - 1, -1, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().topKFrequent(nums, next(inputs))).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n bucket = [[] for x in range(len(nums)+1)]\\n mp = {}\\n for num in nums:\\n if num in mp:\\n mp[num]+=1\\n else:\\n mp[num]=1\\n \\n for key in mp:\\n bucket[mp[key]].append(key)\\n ans = []\\n while k:\\n new_el = bucket.pop()\\n if len(new_el)>0:\\n k-=len(new_el)\\n ans.extend(new_el)\\n return ans\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n l = list(map(loads, stdin))\\n for i in range(0, len(l), 2):\\n print(str(Solution().topKFrequent(l[i], l[i + 1])), file=f)\\nexit(0)\\n\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n if k > len(nums):\\n raise ValueError(\\\"Give another k\\\")\\n \\n freq_dict = {}\\n for num in nums:\\n if num not in freq_dict:\\n freq_dict[num] = 1\\n else:\\n freq_dict[num] += 1\\n sorted_dict = sorted(freq_dict, key = freq_dict.get, reverse = True)\\n return sorted_dict[:k]\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n top = collections.Counter(nums)\\n sorted_top = dict(sorted(top.items() ,key =lambda item:item[1]))\\n kk = []\\n for key in sorted_top.keys():\\n kk.append(key)\\n return kk[-k:]\\n\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n final = list()\\n mapdict = {}\\n for num in nums:\\n mapdict[num] = 1+ mapdict.get(num, 0)\\n list1 = sorted(list(mapdict.values()), reverse=True)\\n target = list1[k-1]\\n for key, value in mapdict.items():\\n if value >= target:\\n final.append(key)\\n return final\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = dict(Counter(nums))\\n count = sorted(count.items(), key=lambda x:x[1])[::-1]\\n result = [x[0] for x in count]\\n result = result [:k]\\n return result\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def v1(self, nums: List[int], k: int) -> List[int]:\\n counter = collections.Counter(nums)\\n \\n freq = [(v, k) for k, v in counter.items()]\\n # method1: use heap of size K to get topK items O(n*logk)\\n # method2: use quick select to get topK value, then filter items >= topK O(n)\\n\\n\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = collections.Counter(nums)\\n\\n # method3: bucket sort\\n freq_dict = collections.defaultdict(list)\\n for num, count in counter.items():\\n freq_dict[count].append(num)\\n\\n cum = 0\\n res = []\\n # max freq is n\\n for freq in reversed(range(1, len(nums) + 1)):\\n if freq not in freq_dict:\\n continue\\n val = freq_dict[freq]\\n res += val\\n cum += len(val)\\n if cum >= k:\\n break\\n return res[:k]\\n\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n freq = {}\\n\\n for i in nums:\\n\\n if i in freq:\\n freq[i] += 1\\n else:\\n freq[i] = 1\\n\\n # l = sorted(freq, key=lambda x: freq[x])\\n\\n heap = []\\n\\n for key,v in freq.items():\\n heappush(heap, (-v,key))\\n\\n out = []\\n\\n for i in range(k):\\n out.append(heappop(heap)[1])\\n\\n return out\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n dic = Counter(nums)\\n final_dic = dict(sorted(dic.items(), key = lambda item:item[1], reverse = True))\\n ans = list(final_dic.keys())[:k]\\n return ans\\n \\n\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"from collections import Counter\\nimport heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n # create hash_map of freq of each element\\n # add them to heap and return k elements from the max heap\\n\\n # freq = {} # Counter for elements in nums\\n # for n in nums:\\n # if n not in freq:\\n # freq[n] = 1\\n # else:\\n # freq[n] += 1\\n\\n freq = Counter(nums)\\n\\n \\n # heap = []\\n # for key,value in freq.items():\\n # heap.append((value,key))\\n\\n heap = heapq.nlargest(k, freq.keys(), key=freq.get)\\n \\n # output = []\\n # for values in heap:\\n # output.append(values[1])\\n\\n return heap\\n \\n\\n\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n sol = [[] for i in range(len(nums))]\\n # print(sol)\\n\\n mp = defaultdict(int)\\n\\n #lets count\\n for n in nums:\\n mp[n] += 1\\n\\n for key,value in mp.items():\\n sol[value-1].append(key)\\n\\n print(sol)\\n x = []\\n\\n for arr in reversed(sol):\\n if len(arr) > 0:\\n for num in arr:\\n if k == 0:\\n return x\\n x.append(num)\\n k -= 1\\n return x\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\ngo through create a count for elements in list: Counter<num, count>\\ncreate a min heap and add the first k elements\\nafter first k, only add element if it's count is creater than top item\\nreturn items of heap\\ntime: O(NlogK)\\nspace: O(N)\\n\\\"\\\"\\\"\\nfrom collections import defaultdict\\nimport heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = defaultdict(int)\\n for num in nums:\\n counter[num] += 1\\n min_heap = []\\n i = 0\\n keys = list(counter.keys())\\n while i < k:\\n heappush(min_heap, (counter[keys[i]], keys[i]))\\n i += 1\\n for j in range(k, len(keys)):\\n num = keys[j]\\n count = counter[num]\\n if count > min_heap[0][0]:\\n heapreplace(min_heap, (count, num))\\n return [num for _, num in min_heap]\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"import heapq\\nfrom collections import Counter\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n mydict = dict(Counter(nums))\\n frequencies = []\\n for key, v in mydict.items():\\n heappush(frequencies, (-1*int(v), key))\\n return [heappop(frequencies)[1] for _ in range(k)]\\n \\n \\n\\n\\n \",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashmap = Counter(nums)\\n heap = []\\n result = []\\n for i in hashmap: \\n heapq.heappush(heap,(-hashmap[i],i))\\n while heap and k!=0:\\n val, key = heapq.heappop(heap)\\n result.append(key)\\n k-=1\\n return result\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\\"\\\"\\\"\\n In: nums=[1,2,2,3,3,3], k=2\\n Out: [2, 3]\\n\\n In: nums=[], k=1\\n Assertion fail\\n\\n In: nums[1,2], k =-1\\n Assertion fail\\n \\\"\\\"\\\"\\n assert len(nums) > 0\\n assert k > 0\\n\\n counter = defaultdict(int)\\n for val in nums:\\n counter[val]+=1 \\n \\n reverse_counter = defaultdict(list)\\n for key, val in counter.items():\\n reverse_counter[val].append(key)\\n print(reverse_counter)\\n out_keys = []\\n for count in reversed(sorted(reverse_counter.keys())):\\n for value in reverse_counter[count]:\\n if len(out_keys) == k:\\n break\\n out_keys.append(value)\\n \\n return out_keys\\n \",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"import collections\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n col = collections.Counter(nums)\\n\\n common = col.most_common(k)\\n \\n rlist = [i for i,j in common]\\n\\n return rlist\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = Counter(nums)\\n most_freq = []\\n for key,value in counter.most_common():\\n most_freq.append(key)\\n\\n return most_freq[:k]\\n\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"from collections import Counter\\nimport heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n heap=[]\\n counter=Counter(nums)\\n for key,val in counter.items():\\n if len(heap)<k:\\n heapq.heappush(heap,(val,key))\\n else:\\n heapq.heappushpop(heap,(val,key))\\n return [h[1] for h in heap]\\n\\n\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n import heapq\\n from collections import Counter\\n\\n frequency = Counter(nums)\\n\\n min_heap = []\\n\\n for num, freq in frequency.items():\\n heapq.heappush(min_heap, (freq, num))\\n if len(min_heap) > k:\\n heapq.heappop(min_heap)\\n \\n return [num for freq, num in min_heap]\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n frequency_map = {} # Creating an empty dictionary that we will record our frequencies in\\n\\n for i in nums:\\n if i in frequency_map:\\n frequency_map[i] += 1 # Incrementing that int in the frequency map if it's already there\\n else:\\n frequency_map[i] = 1 # Initializing to 1 if it isn't already in the map\\n \\n # Now that we have the frequency of all the values mapped, we want to sort them in an order useful to us\\n # For us, a descending order works best, becaue we want the most common numbers\\n sorted_freq_map = sorted(frequency_map, key=lambda x: frequency_map[x], reverse=True)\\n\\n return sorted_freq_map[:k]\\n\\n \\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashmap = collections.defaultdict(int)\\n for num in nums:\\n hashmap[num]+=1\\n heap = []\\n for key,value in hashmap.items():\\n heapq.heappush(heap,(value,key))\\n if len(heap)>k:\\n heapq.heappop(heap)\\n \\n ans = []\\n for tup in heap:\\n ans.append(tup[1])\\n return ans\\n\\n # from collections import Counter\\n# class Solution:\\n# def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n# count = Counter(nums)\\n# unique = list(count.keys())\\n \\n# def partition(left, right, pivot_index) -> int:\\n# pivot_frequency = count[unique[pivot_index]]\\n# # 1. Move the pivot to end\\n# unique[pivot_index], unique[right] = unique[right], unique[pivot_index] \\n \\n# # 2. Move all less frequent elements to the left\\n# store_index = left\\n# for i in range(left, right):\\n# if count[unique[i]] < pivot_frequency:\\n# unique[store_index], unique[i] = unique[i], unique[store_index]\\n# store_index += 1\\n\\n# # 3. Move the pivot to its final place\\n# unique[right], unique[store_index] = unique[store_index], unique[right] \\n \\n# return store_index\\n \\n# def quickselect(left, right, k_smallest) -> None:\\n# \\\"\\\"\\\"\\n# Sort a list within left..right till kth less frequent element\\n# takes its place. \\n# \\\"\\\"\\\"\\n# # base case: the list contains only one element\\n# if left == right: \\n# return\\n \\n# # Select a random pivot_index\\n# pivot_index = random.randint(left, right) \\n \\n# # Find the pivot position in a sorted list \\n# pivot_index = partition(left, right, pivot_index)\\n \\n# # If the pivot is in its final sorted position\\n# if k_smallest == pivot_index:\\n# return \\n# # go left\\n# elif k_smallest < pivot_index:\\n# quickselect(left, pivot_index - 1, k_smallest)\\n# # go right\\n# else:\\n# quickselect(pivot_index + 1, right, k_smallest)\\n \\n# n = len(unique) \\n# # kth top frequent element is (n - k)th less frequent.\\n# # Do a partial sort: from less frequent to the most frequent, till\\n# # (n - k)th less frequent element takes its place (n - k) in a sorted array. \\n# # All elements on the left are less frequent.\\n# # All the elements on the right are more frequent. \\n# quickselect(0, n - 1, n - k)\\n# # Return top k frequent elements\\n# return unique[n - k:]\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n heap = []\\n counter = {}\\n\\n for i in nums:\\n counter[i] = 1 + counter.get(i,0)\\n\\n for key,val in counter.items():\\n heapq.heappush(heap,(-val,key)) \\n\\n res = []\\n print(len(res))\\n while len(res) < k:\\n res.append(heapq.heappop(heap)[1])\\n return res\\n \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n\\n occur = {}\\n\\n for num in nums:\\n if num in occur:\\n occur[num] += 1\\n else:\\n occur[num] = 1\\n \\n sort_occur = sorted(occur.items(), key=lambda x:x[1],reverse = True)\\n top_k = sort_occur[:k]\\n \\n return [item[0] for item in top_k]\\n \",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n from collections import Counter\\n \\n count = Counter(nums)\\n \\n return [item for item, freq in count.most_common(k)]\\n \",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = {}\\n heap = []\\n for n in nums:\\n count = counter.get(n, 0) +1\\n counter[n] = count\\n \\n for n,count in counter.items():\\n heapq.heappush(heap, (-count, n))\\n\\n res = []\\n for i in range(k):\\n count, n = heapq.heappop(heap)\\n res.append(n)\\n return res\\n\\n\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n my_map = {}\\n for n in nums:\\n if n not in my_map:\\n my_map[n] = 0\\n \\n my_map[n] += 1\\n\\n my_tuple = ()\\n\\n my_tuple = sorted(my_map.items(), key=lambda item: item[1], reverse=True)\\n\\n # return list(my_map.keys())[:k]\\n return list(map(lambda item: item[0], my_tuple))[:k]\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n d = defaultdict(int)\\n\\n for n in nums:\\n d[n] += 1\\n \\n x = [(k, v) for k, v in d.items()]\\n\\n x.sort(key=lambda e: -e[1])\\n\\n return [x[i][0] for i in range(k)]\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq_map = Counter(nums)\\n\\n heap = []\\n for num, count in freq_map.items():\\n if len(heap) < k:\\n heappush(heap, (count, num))\\n else:\\n heappushpop(heap, (count, num))\\n\\n results = []\\n for tup in heap:\\n results.append(tup[1])\\n\\n return results \",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = Counter(nums)\\n unique = list(counts.keys())\\n \\n def partition(left: int, right: int) -> int:\\n pivotIndex = random.randint(left, right)\\n pivotValue = unique[pivotIndex]\\n unique[pivotIndex], unique[right] = unique[right], unique[pivotIndex]\\n i = left - 1\\n for j in range(left, right):\\n if counts[unique[j]] < counts[pivotValue]:\\n i += 1\\n unique[i], unique[j] = unique[j], unique[i]\\n unique[i + 1], unique[right] = unique[right], unique[i + 1]\\n return i + 1\\n\\n def select(left: int, right: int, k_smallest: int) -> int:\\n if left == right:\\n return left\\n q = partition(left, right)\\n if k_smallest == q:\\n return q\\n if k_smallest < q:\\n return select(left, q - 1, k_smallest)\\n else:\\n return select(q + 1, right, k_smallest)\\n \\n n = len(unique)\\n return unique[select(0, n - 1, n - k):]\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter_dict = Counter(nums)\\n heap = [(-count, value) for value, count in counter_dict.items()]\\n heapq.heapify(heap)\\n return [heapq.heappop(heap)[1] for _ in range(k)]\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"from collections import Counter\\nimport heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = Counter(nums)\\n heap = []\\n answer = []\\n for key,val in counter.items():\\n heapq.heappush(heap,(-val,key))\\n\\n for i in range(k):\\n largest = heapq.heappop(heap)\\n answer.append(largest[1])\\n\\n return answer\\n\\n \",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # find the frequency of each number\\n num_frequency_map = {}\\n for num in nums:\\n num_frequency_map[num] = num_frequency_map.get(num, 0) + 1\\n top_k_elements = []\\n\\n # go through all numbers of the num_frequency_map\\n # and push them in the top_k_elements, which will have\\n # top k frequent numbers. If the heap size is more than k,\\n # we remove the smallest(top) number\\n for num, frequency in num_frequency_map.items():\\n heappush(top_k_elements, (frequency, num))\\n if len(top_k_elements) > k:\\n heappop(top_k_elements)\\n\\n # create a list of top k numbers\\n top_numbers = []\\n while top_k_elements:\\n top_numbers.append(heappop(top_k_elements)[1])\\n\\n return top_numbers\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq = defaultdict(int)\\n\\n for num in nums:\\n freq[num] += 1\\n \\n maxHeap = []\\n for num in freq:\\n heapq.heappush(maxHeap, (-freq[num], num))\\n \\n ans = []\\n while k:\\n ans.append(heapq.heappop(maxHeap)[1])\\n k-= 1\\n \\n return ans \",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freqMap = {}\\n for num in nums:\\n freqMap[num] = freqMap.get(num, 0) + 1\\n\\n unique = list(freqMap.keys())\\n\\n def quickSelectHelper(startIdx, endIdx, pos):\\n if startIdx == endIdx:\\n return\\n\\n pivot, left, right = startIdx, startIdx + 1, endIdx\\n\\n while left <= right:\\n if freqMap[unique[left]] > freqMap[unique[pivot]] and freqMap[unique[right]] < freqMap[unique[pivot]]:\\n unique[left], unique[right] = unique[right], unique[left]\\n\\n if freqMap[unique[left]] <= freqMap[unique[pivot]]:\\n left += 1\\n\\n if freqMap[unique[right]] >= freqMap[unique[pivot]]:\\n right -= 1\\n unique[pivot], unique[right] = unique[right], unique[pivot]\\n\\n if right == pos:\\n return\\n elif pos < right:\\n quickSelectHelper(startIdx, right - 1, pos)\\n else:\\n quickSelectHelper(right + 1, endIdx, pos)\\n\\n \\n\\n # You only need to position the (n-k)th number as that number will have every number greater than itself on its right at which point we can just return the right part of it\\n n = len(unique)\\n quickSelectHelper(0, n - 1, n - k)\\n return unique[n-k:]\\n\\n \\n \",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n max_heap = []\\n ans = []\\n count = collections.Counter(nums)\\n for i, n in count.items():\\n heapq.heappush(max_heap, (-n, i))\\n for i in range(0, k):\\n ans.append(heapq.heappop(max_heap)[1])\\n return ans\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n heap = []\\n counter = {}\\n for i in nums:\\n counter[i] = 1 + counter.get(i,0)\\n for key,val in counter.items():\\n heapq.heappush(heap,(-val,key))\\n res=[]\\n while len(res)<k:\\n res.append(heapq.heappop(heap)[1])\\n return res\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n elem_frequency = [[] for _ in range(len(nums) + 1)]\\n\\n count_frequency = dict()\\n for n in nums:\\n count_frequency[n] = 1 + count_frequency.get(n, 0)\\n\\n for n, freq in count_frequency.items():\\n elem_frequency[freq].append(n)\\n \\n answer = []\\n for i in range(len(elem_frequency) - 1, 0, -1):\\n for n in elem_frequency[i]:\\n answer.append(n)\\n if len(answer) == k:\\n return answer\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n for n in nums:\\n count[n] = count.get(n, 0)+1\\n \\n freq = list(count.items())\\n freq.sort(key=lambda v: v[1], reverse=True)\\n\\n res = []\\n for i in range(k):\\n res.append(freq[i][0])\\n \\n return res\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count_map = Counter(nums)\\n heap = []\\n for i in count_map.keys():\\n heap.append((count_map[i], i))\\n\\n heap.sort(reverse = True)\\n\\n res = []\\n for i in range(0, k):\\n res.append(heap[i][1])\\n\\n return res\\n \",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = defaultdict(int)\\n for num in nums:\\n counts[num] += 1\\n \\n result = []\\n for num, count in counts.items():\\n if len(result) < k:\\n heapq.heappush(result, [count, num])\\n else:\\n heapq.heappushpop(result, [count, num])\\n return [num for count, num in result]\\n \",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n heap = []\\n counter = {}\\n for n in nums:\\n counter[n] = 1 + counter.get(n, 0)\\n \\n for key, val in counter.items():\\n heapq.heappush(heap, (-val, key))\\n \\n res = []\\n while len(res) < k:\\n res.append(heapq.heappop(heap)[1])\\n \\n return res\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashmap = {}\\n for n in nums:\\n hashmap[n] = hashmap.get(n, 0) + 1\\n sorted_dict = [key for key, v in sorted(hashmap.items(), key=lambda item: item[1], reverse=True)][:k]\\n return sorted_dict\\n\\n \",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = Counter(nums)\\n \\n freq = [[] for i in range(len(nums))]\\n for n, c in counts.items():\\n freq[c - 1].append(n)\\n\\n res = []\\n for i in range(len(nums) - 1, -1, -1):\\n while freq[i]:\\n res.append(freq[i].pop())\\n k -= 1\\n if k == 0:\\n return res\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n result = defaultdict(int)\\n\\n for i in nums:\\n result[i] += 1\\n\\n temp = [(result[i],i) for i in result]\\n\\n temp.sort()\\n\\n ans = []\\n for i in range(len(temp)-1, len(temp)-k-1, -1):\\n ans.append(temp[i][1])\\n\\n return ans\\n\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = Counter(nums)\\n return [val for val, count in counter.most_common(k)]\\n\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n elem_frequency = [[] for _ in range(len(nums) + 1)]\\n\\n count_frequency = dict()\\n for n in nums:\\n count_frequency[n] = 1 + count_frequency.get(n, 0)\\n\\n for n, freq in count_frequency.items():\\n elem_frequency[freq].append(n)\\n \\n answer = []\\n for i in range(len(elem_frequency) - 1, 0, -1):\\n for n in elem_frequency[i]:\\n answer.append(n)\\n if len(answer) == k:\\n return answer\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n for n in nums:\\n count[n] = 1 + count.get(n,0)\\n freq = [[] for i in range(len(nums) + 1)]\\n for v,f in count.items():\\n freq[f].append(v)\\n res = []\\n for i in range(len(freq) -1,0,-1):\\n for j in freq[i]:\\n res.append(j)\\n if len(res) == k:\\n return res\\n\\n\\n \\n \\n\\n\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n # min heap\\n freq = {}\\n for num in nums:\\n if num in freq:\\n freq[num] += 1\\n else:\\n freq[num] = 1\\n \\n # hp\\n minhp = []\\n for key in freq.keys():\\n heappush(minhp, (freq[key], key))\\n if len(minhp) > k:\\n heappop(minhp)\\n \\n return [key for f, key in minhp]\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = Counter(nums)\\n\\n nums_by_count = [ [] for _ in range(len(nums) + 1) ]\\n\\n for num, count in counter.items():\\n nums_by_count[count].append(num)\\n\\n result = []\\n for nums in reversed(nums_by_count):\\n if nums:\\n result.extend(nums)\\n if len(result) == k:\\n break \\n\\n return result\\n\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = Counter(nums)\\n\\n count_list = []\\n for num, count in counts.items():\\n heapq.heappush(count_list, (-count, num))\\n\\n ans = []\\n for _ in range(k):\\n next_top = heapq.heappop(count_list)[1]\\n ans.append(next_top)\\n\\n return ans\\n\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = defaultdict(int)\\n freq = [[] for _ in range(len(nums)+1)]\\n \\n for n in nums:\\n count[n] += 1\\n \\n for n, c in count.items():\\n freq[c].append(n)\\n res = []\\n count = 0\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n count += 1\\n if count == k:\\n return res \",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n\\n\\n count = {}\\n freq = [[]] * (len(nums) + 1)\\n for i in nums:\\n count[i] = 1 + count.get(i, 0)\\n\\n res = []\\n for n, c in count.items():\\n freq[c] = freq[c] + [n]\\n\\n # print(freq)\\n target = k\\n res = []\\n for i in range(len(nums), 0, -1):\\n if freq[i]:\\n res.extend(freq[i])\\n if len(res) == k:\\n return res\\n\\n # return res\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n d = {}\\n for a in nums:\\n if a in d:\\n d[a] +=1\\n else:\\n d[a] =1\\n print(d)\\n val = [[]] * (len(nums)+1)\\n for key, value in d.items():\\n if val[value]:\\n val[value].append(key)\\n else:\\n val[value] = [key]\\n print(val)\\n out = []\\n for a in range(len(val)-1,-1,-1):\\n for x in val[a]:\\n out.append(x)\\n if len(out) == k:\\n return out\\n # return out[:k]\\n \\n \\n\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n maxCnt = 0\\n for num in nums:\\n count[num] = count.get(num, 0) + 1\\n maxCnt = max(maxCnt, count[num])\\n \\n bucket = [[] for i in range(maxCnt + 1)]\\n \\n for val, cnt in count.items():\\n bucket[cnt].append(val)\\n \\n res = []\\n \\n for i in range(maxCnt, -1, -1):\\n \\n if len(res) == k:\\n break\\n \\n res += bucket[i]\\n \\n return res\\n \\n \\n \\n'''\\n- if the problem involves some kind of counting, then we can try to optimize using some variation of count sort\\n- count the number of elements O(n), and use the count to put the elements in a bucket list\\n\\nO(n)\\n\\nnums = [1,1,1,2,2,3], k = 2\\n\\nbucket[i] = list of values that have i counts\\n\\n0 1 2 3 4 5 6\\n 3 2 1\\n'''\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n for num in nums:\\n count[num] = 1 + count.get(num, 0)\\n\\n for key, value in count.items():\\n freq[value].append(key)\\n \\n res = []\\n for i in range(len(freq)-1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n for num in nums:\\n count[num] = 1 + count.get(num, 0)\\n \\n freq = [[] for i in range(len(nums) + 1)]\\n for num, frequency in count.items():\\n freq[frequency].append(num)\\n \\n res = []\\n for i in range(len(freq) - 1, -1, -1):\\n for j in range(len(freq[i])):\\n res.append(freq[i][j])\\n if len(res) == k:\\n return res\\n\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n frequencyTable = {}\\n kvalues = [[] for i in range(len(nums) + 1)]\\n\\n for element in nums: \\n if element in frequencyTable: \\n frequencyTable[element] += 1\\n else: \\n frequencyTable[element] = 1\\n \\n for key, value in frequencyTable.items(): \\n kvalues[value].append(key)\\n\\n res = [] \\n for i in range(len(kvalues) - 1, 0, -1):\\n for n in kvalues[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n for n, c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = {}\\n for n in nums:\\n counter[n] = counter.get(n, 0) + 1\\n \\n sorted_by_count = sorted(counter.keys(), key=lambda x: counter[x], reverse=True)\\n return sorted_by_count[:k]\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq = defaultdict(int)\\n\\n for num in nums:\\n freq[num] += 1\\n \\n minHeap = []\\n for num in freq:\\n heapq.heappush(minHeap, (freq[num], num))\\n if len(minHeap) > k:\\n heappop(minHeap)\\n\\n \\n return [ val[1] for val in minHeap]\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n\\n return [i[0] for i in collections.Counter(nums).most_common(k)]\\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # [0,1,2,3,4,5]\\n #{1:3,2:1}\\n #[[3],[2],[1],[],[],[]]\\n # visitng eveyr element once and storing the frequency in a hashmap could easily give us the frequency count of each number. we are still O(n). from there, how do we return the top K most frequent items? \\n # python dictionaries don't have a sorting function. We can use a list of n length, as we iterate through the dictionary, we can store the frequency count at the index of the list. so if \\\"1\\\" appears three times, we store 1 at index 3 of the list. \\n #then we can simply return k elements from this list. \\n freq_count = {}\\n for num in nums:\\n freq_count[num] = freq_count.get(num,0)+1\\n res = [[] for num in nums]\\n for key in freq_count:\\n res[freq_count[key]-1].append(key)\\n #5,4,3,2,1,0\\n print(res)\\n print(freq_count)\\n ans=[]\\n for i in range(len(res)-1,-1,-1):\\n for n in res[i]:\\n ans.append(n)\\n if len(ans)==k:\\n return ans\\n \\n \\n\\n\\n\\n\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n countMap = {}\\n countList = []\\n result = []\\n\\n # Build the count map and count list\\n for num in nums:\\n if countMap.get(num, -1) != -1:\\n countMap[num]['count'] += 1\\n countList[countMap[num]['index']]['count'] += 1\\n else:\\n countMap[num] = {\\n 'index': len(countList),\\n 'count': 1\\n }\\n countList.append({\\n 'num': num,\\n 'count': 1\\n })\\n \\n # Sort the count list based on the count field\\n sorted_num = sorted(countList, key=lambda x: x['count'], reverse=True)\\n \\n # Pick the k top most element from the count list\\n for i in range(k):\\n result.append(sorted_num[i]['num'])\\n\\n return result\\n \",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n for n, c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n for n, c in count.items():\\n freq[c].append(n)\\n res = []\\n for i in range(len(freq)-1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n for n, c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) -1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n \",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n count = Counter(nums)\\n\\n for n,c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) -1,-1,-1):\\n for n in freq[i]:\\n res.append(n)\\n\\n if len(res) == k:\\n return res\\n\\n\\n\\n\\n\\n\\n # You are going to have a dictionary to keep count of each number and how many times that number occurs\\n # Also will have i 2d array where the index is the number of times a count occured and the the value is the list of number for that count\\n # Index the 2d array from the last value adding to the result array and return once length reaches K\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count ={}\\n freq = [ [] for i in range (len(nums)+1)]\\n for n in nums:\\n count[n] = 1+ count.get(n,0)\\n for n,c in count.items():\\n freq[c].append(n)\\n \\n # print(count)\\n # print(freq)\\n\\n res = []\\n for i in range(len(freq)-1,0,-1):\\n for n in freq[i]:\\n res.append(n)\\n if(len(res)==k):\\n return res\\n \",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n table = defaultdict(int)\\n\\n for num in nums:\\n table[num] += 1\\n \\n tmp = sorted(table.items(), key = lambda x : x[1], reverse = True)\\n res = []\\n\\n for i in range(k):\\n res.append(tmp[i][0])\\n \\n return res\\n\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n d = {}\\n count = [[] for i in range(len(nums) + 1)]\\n print(count)\\n\\n for n in nums:\\n d[n] = d.get(n, 0) + 1\\n \\n for n, c in d.items():\\n count[c].append(n)\\n \\n res = []\\n for i in range(len(count)-1, 0, -1):\\n for n in count[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n \\n\\n \",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq_counter = {}\\n index_mapping_array = [[] for i in range(len(nums)+1)]\\n for num in nums:\\n freq_counter[num] = 1 + freq_counter.get(num, 0)\\n for num in freq_counter:\\n frequency = freq_counter[num]\\n index_mapping_array[frequency].append(num)\\n \\n print(index_mapping_array)\\n #Find K Frequent Elements\\n k_frequent = []\\n index_array = len(index_mapping_array) - 1 \\n for i in range(len(index_mapping_array)-1, 0, -1):\\n for x in range(0, len(index_mapping_array[i])):\\n if k > 0:\\n k_frequent.append(index_mapping_array[i][x])\\n k = k -1\\n else:\\n break\\n return k_frequent\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # create a frequency map\\n freqMap = defaultdict(int)\\n for num in nums:\\n freqMap[num] += 1\\n\\n # create a list for elements with freq equal to the index\\n freqArray = [[] for i in range(len(nums) + 1)]\\n for val, freq in freqMap.items():\\n freqArray[freq].append(val)\\n\\n # iterate array in reverse order to get the top k elements\\n res = []\\n for i in range(len(freqArray) - 1, -1, -1):\\n for element in freqArray[i]:\\n res.append(element)\\n if len(res) == k:\\n return res\\n\\n return res\\n\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # hashmap for count\\n counts = {}\\n for n in nums:\\n counts[n] = counts.get(n, 0) + 1\\n\\n \\n # buckset sort: array[freq, nums associated w/ that freq]\\n bucket = [[] for i in range(len(nums) + 1)]\\n for num, count in counts.items():\\n bucket[count].append(num)\\n \\n # reverse loop on bucket array\\n res = []\\n for i in range(len(bucket) - 1, 0, -1):\\n for n in bucket[i]:\\n res.append(n)\\n if len(res) == k: \\n return res\\n\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n n = len(nums)\\n\\n num_count = {}\\n\\n freq = [[] for _ in range(n+1)]\\n for num in nums:\\n num_count[num] = num_count.get(num, 0) + 1\\n \\n # populate the freq counter with keys of num_count\\n for key, val in num_count.items():\\n freq[val].append(key)\\n \\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n\\n\\n \",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n list = []\\n nums.sort()\\n l = 0\\n r = 0\\n count = 0\\n while r < len(nums):\\n if nums[l] == nums[r]:\\n count+=1\\n else:\\n list.append((nums[l],count))\\n l=r\\n count=1\\n r+=1\\n list.append((nums[l], count)) \\n list.sort(key=lambda x: x[1], reverse=True)\\n \\n return [x[0] for x in list[:k]]\\n\\n\\n \\n \\n \\n \\n \",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq = {}\\n\\n for n in nums:\\n freq[n] = freq.get(n, 0) + 1\\n bucket = [[] for _ in range(len(nums) + 1)]\\n for n in freq:\\n bucket[freq[n]].append(n)\\n res = []\\n for i in range(len(bucket) - 1, -1, -1):\\n for num in bucket[i]:\\n res.append(num)\\n k -= 1\\n if k <= 0:\\n return res\\n return res\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"# T: O(NLogN)\\n# class Solution:\\n# def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n# hashmap = {}\\n# for n in nums:\\n# hashmap[n] = hashmap.get(n, 0) + 1\\n# sorted_dict = [key for key, v in sorted(hashmap.items(), key=lambda item: item[1], reverse=True)][:k]\\n# return sorted_dict\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n frequency = [[] for _ in range(len(nums) + 1)]\\n\\n for n in nums:\\n count[n] = count.get(n, 0) + 1\\n for key, v in count.items():\\n frequency[v].append(key)\\n result = []\\n for l in frequency[::-1]:\\n result.extend(l[:k - len(result)]) # Only take as many as needed\\n if len(result) == k:\\n print(k)\\n print(len(result))\\n print(result)\\n return result[:k]\\n return result\\n\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n nc = {}\\n for n in nums:\\n nc[n] = 1 + nc.get(n, 0)\\n\\n bs = [[] for i in range(len(nums) + 1)]\\n for key in nc.keys():\\n bs[nc[key]].append(key)\\n\\n res = []\\n i = len(bs) - 1\\n while len(res) < k:\\n for n in bs[i]:\\n res.append(n)\\n if len(res) >= k:\\n break\\n i -= 1\\n return res\\n\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # get counts of each uniqeu number\\n # sort by the counts and take the top K => O(nlogn)\\n # min heap to keep the top K \\n # initialize with K unique, and iterate through all other numbers\\n # continually removing the min count using min heap logN removal\\n # => NlogK, for K<=N\\n # K is sufficiently smaller than N, we could use a bucket approach\\n # where we have buckets for counts of size 1 to N\\n # and put each unqieu number in its bucket count, then\\n # to get the topK would be O(N+K) = O(N)\\n buckets = defaultdict(list)\\n for num, count in Counter(nums).items():\\n buckets[count].append(num)\\n top_k = []\\n while len(top_k)<k:\\n for ct in range(len(nums), 0, -1):\\n nums_with_ct = buckets[ct]\\n num_picked = min(k-len(top_k), len(nums_with_ct))\\n top_k.extend(nums_with_ct[:num_picked])\\n return top_k\\n \\n\\n\\n\\n \",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n res = []\\n\\n for n in nums:\\n count[n] = 1+count.get(n, 0)\\n\\n sorted_dict = dict(sorted(count.items(), key=lambda item: item[1], reverse=True))\\n for i in range(k):\\n res.append(list(sorted_dict.keys())[i])\\n return res\\n\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq = defaultdict(int)\\n pre_res = [[] for i in range(len(nums) + 1)]\\n\\n for n in nums:\\n freq[n] += 1\\n\\n for n, c in freq.items():\\n pre_res[c].append(n)\\n\\n print(pre_res)\\n\\n res = []\\n for i in range(len(pre_res) - 1, 0, -1):\\n print(i)\\n for n in pre_res[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n \\n\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n for num in nums:\\n count[num] = 1 + count.get(num,0)\\n freq = [[] for i in range(len(nums)+1)]\\n for key,val in count.items():\\n freq[val].append(key)\\n res = []\\n for i in range(len(freq)-1,-1,-1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n frequency = [[] for i in range(len(nums) + 1)]\\n res = []\\n for num in nums:\\n count[num] = 1 + count.get(num, 0)\\n\\n for n,c in count.items():\\n frequency[c].append(n)\\n\\n for i in range(len(frequency) - 1, 0, -1):\\n res.extend(frequency[i])\\n if len(res) == k:\\n return res\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashMap = {}\\n topK = []\\n\\n for i in nums:\\n hashMap[i] = hashMap.get(i, 0) + 1\\n\\n counts = list(hashMap.values())\\n counts.sort(reverse=True)\\n\\n counts = counts[0:k]\\n\\n for key, value in hashMap.items():\\n if value in counts:\\n topK.append(key)\\n \\n return topK\\n\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n nums.sort()\\n buckets = [[] for i in range(len(nums)+1)]\\n\\n charCount = {}\\n for i in range(len(nums)):\\n charCount[nums[i]] = charCount.get(nums[i], 0) + 1\\n # key:value, element: count \\n for element, count in charCount.items():\\n buckets[count].append(element)\\n \\n result = []\\n for i in range(len(buckets)-1, 0,-1):\\n if len(result) >= k:\\n break \\n for each in buckets[i]:\\n if len(result) <k:\\n result.append(each)\\n return result\\n \\n\\n\\n \\n\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n # counts = {}\\n # buckets = [ [] for i in range(len(nums)+1) ]\\n \\n # for n in nums:\\n # counts[n] = 1 + counts.get(n, 0)\\n # for n, c in counts.items():\\n # buckets[c].append(n)\\n # # buckets are initialized now\\n \\n # result = []\\n # for i in range( len(buckets)-1, 0, -1):\\n # for each in buckets[i]:\\n # result.append(each)\\n # if len(result) == k:\\n # return result\\n\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n n = len(nums)\\n freq = collections.defaultdict(int)\\n for num in nums:\\n freq[num] += 1\\n\\n nums.sort(key=lambda num: (freq[num], num), reverse=True)\\n\\n res = set()\\n \\n for i in range(n):\\n res.add(nums[i])\\n if len(res) == k:\\n break\\n \\n return res\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = {}\\n for num in nums:\\n counter[num] = counter.get(num, 0) + 1\\n reverse_count = defaultdict(list)\\n for key, value in counter.items():\\n reverse_count[value].append(key)\\n N = len(nums)\\n ans = []\\n for i in range(N, -1, -1):\\n while len(ans) < k and reverse_count[i]:\\n ans.append(reverse_count[i].pop())\\n if len(ans) == k:\\n return ans\\n \\n \\n \\n\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # map_ = {}\\n # for i in range(len(nums)):\\n # map_[nums[i]] = map_.get(nums[i],0) + 1\\n # queue = []\\n # for (num, freq) in map_.items():\\n # heapq.heappush(queue, (freq, num))\\n # if len(queue)>k:\\n # heapq.heappop(queue)\\n # res = [0]*k\\n # for i in range(k-1, -1, -1):\\n # res[i] = heapq.heappop(queue)[1]\\n # return res\\n\\n memo={}\\n for i in range(len(nums)):\\n memo[nums[i]]=memo.get(nums[i],0)+1\\n heap=[]\\n for num in memo:\\n heapq.heappush(heap,(memo[num],num))\\n if len(heap)>k:\\n heapq.heappop(heap)\\n res = []\\n while heap:\\n res.append(heapq.heappop(heap)[1])\\n return res\\n\\n\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n dic = defaultdict(int)\\n ans = [None]*k\\n for num in nums:\\n dic[num] += 1\\n keys, vals = list(dic.keys()), list(dic.values())\\n for i in range(k):\\n index = vals.index(max(vals))\\n ans[i] = keys[index] \\n vals[index] = float('-inf')\\n \\n return ans\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n final = []\\n nums = sorted(nums)\\n last_val = -10000000000000000000000000000000000\\n start_index = 0\\n last_index = 0\\n\\n distinct_list = []\\n counter_list = []\\n\\n for i in range(len(nums)):\\n if nums[i] > last_val:\\n distinct_list.append(nums[i])\\n start_index = i\\n last_val = nums[i]\\n if i != len(nums) -1:\\n if nums[i] < nums[i+1]:\\n counter_list.append(i - start_index)\\n start_index = i+1\\n else:\\n continue\\n else:\\n counter_list.append(i - start_index)\\n\\n for i in range(k):\\n index_ = counter_list.index(max(counter_list))\\n counter_list.pop(index_)\\n final.append(distinct_list.pop(index_))\\n return final\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashmap = defaultdict(int)\\n result = []\\n\\n for num in nums:\\n hashmap[num] += 1\\n \\n # number: count \\n i = 0\\n while i < k:\\n max = -1\\n number = -1\\n for num, count in hashmap.items(): \\n if count > max:\\n max = count\\n number = num\\n result.append(number)\\n del hashmap[number] \\n i += 1\\n return result\\n\\n \\n \\n \\n \\n \\n \\n \\n '''\\n hashmap = {}\\n result = []\\n for num in nums:\\n if num in hashmap:\\n hashmap[num] += 1\\n else:\\n hashmap[num] = 1\\n \\n i = 0\\n while i < k:\\n max_num = 0\\n curr_count = 0\\n for num, count in hashmap.items():\\n if count >= curr_count:\\n max_num = num\\n curr_count = count\\n result.append(max_num)\\n del hashmap[max_num]\\n i += 1\\n return result\\n '''\\n\\n\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n freq = defaultdict(int)\\n reverseFreq = SortedDict()\\n for n in nums:\\n if n in freq:\\n old_freq = freq[n]\\n if old_freq not in reverseFreq:\\n reverseFreq[old_freq] = set()\\n if old_freq + 1 not in reverseFreq:\\n reverseFreq[old_freq + 1] = set()\\n reverseFreq[old_freq].remove(n)\\n \\n reverseFreq[old_freq + 1].add(n)\\n freq[n] += 1\\n else:\\n freq[n] += 1\\n if 1 not in reverseFreq:\\n reverseFreq[1] = set()\\n reverseFreq[1].add(n)\\n \\n count = 0 \\n ans = []\\n for key in reversed(reverseFreq):\\n for val in reverseFreq[key]:\\n ans.append(val)\\n count += 1\\n if count == k:\\n return ans\\n return ans\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashmap = defaultdict(int)\\n result = []\\n\\n for num in nums:\\n hashmap[num] += 1\\n \\n # number: count \\n i = 0\\n while i < k:\\n max = -1\\n number = -1\\n for num, count in hashmap.items(): \\n if count > max:\\n max = count\\n number = num\\n result.append(number)\\n del hashmap[number] \\n i += 1\\n return result\\n\\n \\n \\n \\n \\n \\n \\n \\n '''\\n hashmap = {}\\n result = []\\n for num in nums:\\n if num in hashmap:\\n hashmap[num] += 1\\n else:\\n hashmap[num] = 1\\n \\n i = 0\\n while i < k:\\n max_num = 0\\n curr_count = 0\\n for num, count in hashmap.items():\\n if count >= curr_count:\\n max_num = num\\n curr_count = count\\n result.append(max_num)\\n del hashmap[max_num]\\n i += 1\\n return result\\n '''\\n\\n\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n frequency = dict()\\n output = []\\n for num in nums:\\n frequency[num] = 1 if num not in frequency else frequency[num] + 1\\n\\n for i in range(k):\\n value = max(frequency.items(), key=operator.itemgetter(1))[0]\\n output.append(value)\\n del frequency[value]\\n\\n return output\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n cnt = collections.Counter(nums)\\n n = len(nums)\\n bucket = [[] for _ in range(n)]\\n for num, f in cnt.items():\\n bucket[f-1].append(num)\\n print(bucket)\\n res = []\\n for f in range(n-1, -1, -1):\\n print(k)\\n if k == 0:\\n break\\n k -= len(bucket[f])\\n res.extend(bucket[f])\\n return res\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = {}\\n\\n for n in nums:\\n if n not in counter:\\n counter[n] = 1\\n else:\\n counter[n] += 1\\n \\n counter_sorted = dict(sorted(counter.items(), key=lambda item: item[1], reverse=True))\\n\\n output = []\\n for i in range(k):\\n output.append(list(counter_sorted.keys())[i])\\n \\n return output\\n \",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = Counter(nums)\\n heap = []\\n distinct_numbers = list(counter.keys())\\n for i in range(k):\\n heapq.heappush(heap, (counter[distinct_numbers[i]], distinct_numbers[i]))\\n \\n for i in range(k, len(distinct_numbers)):\\n current_count = counter[distinct_numbers[i]]\\n if current_count >= heap[0][0]:\\n heapq.heappop(heap)\\n heapq.heappush(heap, (current_count, distinct_numbers[i]))\\n heapq.heapify(heap)\\n\\n result = [h[1] for h in heap]\\n return result\\n\",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = collections.Counter(nums)\\n ans = []\\n for i in range(k):\\n val = max(counts, key=counts.get)\\n ans.append(val)\\n del counts[val]\\n return ans\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # store count of all numbers in map\\n # find max val in map, add it final res array and remove that pair\\n\\n res = []\\n count = {}\\n\\n for n in nums:\\n count[n] = count.get(n, 0) + 1\\n\\n while k > 0:\\n max_count = 0\\n max_count_key = None\\n for n, c in count.items():\\n if c > max_count:\\n max_count = c\\n max_count_key = n\\n\\n res.append(max_count_key)\\n del count[max_count_key]\\n\\n k -= 1\\n\\n return res\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n #Maybe put all this in a counter and then when it counts you print based on how\\n valuesAndFrequency = {}\\n output = set()\\n for i in nums:\\n if i in valuesAndFrequency:\\n valuesAndFrequency[i] +=1\\n else:\\n valuesAndFrequency[i] = 1\\n biggestNums = set()\\n biggestNum = float('-inf')\\n key = 0 \\n while (len(biggestNums) != k):\\n for i, j in valuesAndFrequency.items():\\n if j>biggestNum:\\n biggestNum = j\\n key = i\\n biggestNums.add(key)\\n valuesAndFrequency.pop(key)\\n key = 0\\n biggestNum= float('-inf')\\n return list(biggestNums)\\n\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashMap = {}\\n highestValues = []\\n\\n for i in nums:\\n hashMap[i] = hashMap.get(i, 0) + 1\\n\\n for i in range(k):\\n max_key = max(hashMap, key=hashMap.get)\\n highestValues.append(max_key)\\n del hashMap[max_key]\\n\\n return highestValues\\n\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n hashMap = {}\\n for n in nums:\\n if n not in hashMap:\\n hashMap[n] = [1, n]\\n else:\\n pair = hashMap[n]\\n print(pair)\\n hashMap[n] = [pair[0]+1, pair[1]]\\n \\n maxHeap = hashMap.values()\\n maxHeap = [[-i, j] for i, j in maxHeap]\\n heapq.heapify(maxHeap)\\n\\n output = []\\n while k > 0:\\n count, num = heapq.heappop(maxHeap)\\n output.append(num)\\n k = k -1\\n return output\\n\\n\\n \\n\\n \",\n \"runtime\": \"123\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":115,"string":"115"},"mm_list":{"kind":"list like","value":[{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\n\nexit()","memory":"18800"},{"code":"sys.stdout = open('user.out', 'a')\nfor nums in map(loads, sys.stdin):\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\nexit()\n","memory":"18900"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n fmap = Counter(nums)\n heap = []\n heapq.heapify(heap)\n \n for num, freq in fmap.items():\n if len(heap) < k:\n heapq.heappush(heap, (freq, num))\n elif freq > heap[0][0]: \n # check if current element is more frequent\n # and remove least frequent element\n heapq.heappop(heap)\n heapq.heappush(heap, (freq, num))\n \n return [num for _, num in heap]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().topKFrequent(nums, next(inputs))).replace(\" \", \"\"), file=f)\nexit(0)","memory":"19000"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n fmap = Counter(nums)\n heap = []\n heapq.heapify(heap)\n \n for num, freq in fmap.items():\n if len(heap) < k:\n heapq.heappush(heap, (freq, num))\n elif freq > heap[0][0]: \n # check if current element is more frequent\n # and remove least frequent element\n heapq.heappop(heap)\n heapq.heappush(heap, (freq, num))\n \n return [num for _, num in heap]\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n results = (str(Solution().topKFrequent(nums, next(inputs))).replace(\" \", \"\") + \"\\n\" \n for nums in inputs)\n f.writelines(results)\nexit(0)","memory":"19100"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n myMap={}\n ans=[]\n for i in range(len(nums)):\n myMap[nums[i]]=1+myMap.get(nums[i],0)\n heap=[]\n for num,freq in myMap.items():\n heapq.heappush(heap,(freq,num)) #heaps are min by default, sorted based on first element in tuple\n if len(heap)>k:\n heapq.heappop(heap)\n while heap:\n ans.append(heapq.heappop(heap)[1])\n return ans\n","memory":"20000"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n dic = {}\n heap = []\n for i in nums:\n dic[i] = 1 + dic.get(i, 0)\n \n for key, value in dic.items():\n heapq.heappush(heap, (-value, key))\n\n res = []\n while len(res) < k:\n res.append(heapq.heappop(heap)[1])\n return res","memory":"20200"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = {}\n vals = []\n for num in nums:\n if num not in counts:\n vals.append(num)\n counts[num] = 0\n counts[num] += 1\n n = len(vals)\n k = n - k\n return self.quickselect(vals, 0, n - 1, k, counts)\n \n def quickselect(self, vals, left, right, k, counts):\n pivot_idx = randint(left, right)\n pivot_val = vals[pivot_idx]\n pivot_count = counts[pivot_val]\n cur_idx = left\n self.swap(vals, pivot_idx, right)\n for i in range(left, right):\n val = vals[i]\n val_count = counts[val]\n if val_count < pivot_count:\n self.swap(vals, cur_idx, i)\n cur_idx += 1\n self.swap(vals, cur_idx, right)\n if cur_idx < k:\n return self.quickselect(vals, cur_idx + 1, right, k, counts)\n elif k < cur_idx:\n return self.quickselect(vals, left, cur_idx - 1, k, counts)\n return vals[k:]\n\n def swap(self, vals, i, j):\n vals[i], vals[j] = vals[j], vals[i]\n","memory":"20300"},{"code":"import heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n heapq.heapify(nums)\n count = {}\n answer = []\n\n while nums:\n temp = heapq.heappop(nums)\n if temp in count:\n count[temp] += 1\n else:\n count[temp] = 1\n\n for i in range(k):\n max_key = temp\n temp_value = count[max_key]\n for key, value in count.items():\n if value > temp_value:\n max_key = key\n temp_value = count[max_key] \n\n answer.append(max_key)\n count[max_key] = 0\n \n return answer","memory":"20400"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # get frequency of each element in nums\n freq_dict = collections.Counter(nums)\n # list of size length nums: index corresponds to frequency of element\n count_list = [None]*len(nums)\n for key, val in freq_dict.items():\n if count_list[val-1] == None:\n count_list[val-1] = []\n count_list[val-1].append(key)\n # get reverse of results\n res = []\n for vals in count_list[::-1]:\n if len(res) == k:\n break\n if vals != None:\n res.extend(vals)\n return res","memory":"20500"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n num_cnt = defaultdict(int)\n for n in nums:\n num_cnt[n] += 1\n num_cnt = dict(sorted(num_cnt.items(), \n key=lambda item:item[1], \n reverse=True))\n return list(num_cnt.keys())[:k]\n ","memory":"20600"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n d={}\n for i in nums:\n d[i]=d.get(i,0)+1\n d=dict(sorted(d.items(),key=lambda x: -x[1]))\n output=[]\n for i,j in d.items():\n if len(output)<k:\n output.append(i)\n return output\n ","memory":"20700"},{"code":"from collections import defaultdict\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = defaultdict(int)\n for num in nums:\n counter[num] += 1\n sorted_counter = {k:v for k,v in sorted(counter.items(), key=lambda x: x[1], reverse=True)}\n ans = []\n for i, v in enumerate(sorted_counter.keys()):\n if i == k:\n return ans\n ans.append(v)\n return ans","memory":"20700"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n dictt={}\n ans=[]\n c=0\n for num in nums:\n if num not in dictt:\n dictt[num]=1\n else:\n dictt[num]+=1\n\n print(dictt)\n sorted_dict = dict(sorted(dictt.items(), key=lambda item: item[1], reverse=True))\n\n for key, v in sorted_dict.items():\n ans.append(key)\n c+=1\n if c==k:\n break\n\n return ans","memory":"20800"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n res = []\n\n for n in nums:\n count[n] = 1+count.get(n, 0)\n\n sorted_dict = dict(sorted(count.items(), key=lambda item: item[1], reverse=True))\n for i in range(k):\n res.append(list(sorted_dict.keys())[i])\n return res\n","memory":"20800"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counts = defaultdict(int)\n for num in nums:\n counts[num] += 1\n \n result = []\n for num, count in counts.items():\n if len(result) < k:\n heapq.heappush(result, [count, num])\n else:\n heapq.heappushpop(result, [count, num])\n return [num for count, num in result]\n ","memory":"20900"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = {}\n for n in nums:\n counter[n] = counter.get(n, 0) + 1\n \n sorted_by_count = sorted(counter.keys(), key=lambda x: counter[x], reverse=True)\n return sorted_by_count[:k]\n","memory":"20900"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = defaultdict(int)\n for num in nums:\n count[num] += 1\n \n freq_ = defaultdict(list)\n for (num, freq) in count.items():\n freq_[freq].append(num)\n \n ans = []\n keys = sorted(freq_.keys(), reverse = True)\n for key in keys:\n for num in freq_[key]:\n ans.append(num)\n k -= 1\n if k == 0:\n return ans","memory":"21000"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = defaultdict(int)\n heap = []\n for num in nums:\n count[num] += 1\n\n for key ,val in count.items():\n heappush(heap, (val, key))\n if len(heap) > k:\n heappop(heap)\n res = []\n while heap:\n res.append(heappop(heap)[1])\n return res\n\n\n","memory":"21000"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n heap = []\n counter = {}\n for n in nums:\n counter[n] = 1 + counter.get(n, 0)\n \n for key, val in counter.items():\n heapq.heappush(heap, (-val, key))\n \n res = []\n while len(res) < k:\n res.append(heapq.heappop(heap)[1])\n \n return res","memory":"21100"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = defaultdict(list)\n final_list = []\n remaining = k\n temp_set = set(nums)\n if k == len(nums):\n return nums\n for i in temp_set:\n count = nums.count(i)\n counter[count].append(i)\n while len(final_list) < k:\n max_count = max(counter.keys())\n # Append the numbers with the highest frequency\n final_list.extend(counter[max_count])\n counter.pop(max_count)\n \n # Ensure only top k elements are returned\n return final_list[:k]","memory":"21100"},{"code":"\nimport heapq\nfrom collections import Counter\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter1 = Counter(nums)\n heap=[]\n\n for key,val in counter1.items():\n if len(heap)<k:\n heapq.heappush(heap,(val,key))\n\n else:\n heapq.heappushpop(heap,(val,key))\n\n return [h[1] for h in heap]\n\n\n ","memory":"21200"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n def myfunc(n):\n return n[1]\n \n dic = defaultdict(int)\n res = []\n\n for x in nums:\n dic[x] += 1\n\n \n listDic = sorted(dic.items(), key=myfunc, reverse=True)\n\n print(listDic)\n\n for x in range(k):\n res.append(listDic[x][0])\n \n return res","memory":"21200"},{"code":"import heapq\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n #Put them into a dictionary\n #Put them into a heap\n #Pop from heap until there is k left or pop k from the heap.\n numsdict = {}\n heap = []\n for i in nums:\n if i in numsdict:\n numsdict[i] += 1\n else:\n numsdict[i] = 1\n \n for key, value in numsdict.items():\n index = (value, key)\n heap.append(index)\n \n heapq.heapify(heap)\n while len(heap) > k:\n heapq.heappop(heap)\n\n answer = []\n while heap:\n answer.append( heapq.heappop(heap)[1]) \n return answer ","memory":"21300"},{"code":"\nfrom heapq import heappush, heappop\nfrom collections import Counter\n\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n h = []\n for key, v in Counter(nums).items():\n heappush(h, (-v, key))\n\n return [heappop(h)[1] for _ in range(k)]\n\n\n\n\n\n \n ","memory":"21300"},{"code":"import heapq\n\n\nclass Solution:\n def topKFrequent(self, nums: list[int], k: int) -> list[int]:\n stat = {}\n\n for item in nums:\n stat[item] = stat.get(item, 0) + 1\n\n heap = []\n\n for key, value in stat.items():\n heapq.heappush(heap, (value, key))\n heap = heapq.nlargest(k, heap)\n\n return list(item[1] for item in heapq.nlargest(k, heap))\n","memory":"21400"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n for n in nums:\n count[n] = count.get(n,0) + 1\n \n frequent = []\n for n,f in count.items():\n frequent.append([f,n])\n \n heapq.heapify(frequent)\n\n while len(frequent) != k:\n heapq.heappop(frequent)\n output = []\n for i in range(len(frequent)):\n f,n = heapq.heappop(frequent)\n output.append(n)\n return output","memory":"21400"},{"code":"from collections import Counter\nfrom sortedcontainers import SortedList\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n counter = Counter(tuple(nums))\n res = []\n for kv in counter.most_common(k):\n res.append(kv[0])\n return res","memory":"21500"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count_map = collections.Counter(nums)\n count_map = collections.OrderedDict(count_map.most_common())\n\n res = [ key for key in count_map.keys()][:k]\n\n return res\n\n\n\n\n ","memory":"21500"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n # 09/16/24 meta phone screen prep\n cnt = defaultdict(int)\n for n in nums:\n cnt[n] += 1\n nums_cnts = [(cnt[n], n) for n in cnt ]\n\n def quickSelect(data, K):\n if not data:\n return []\n if not K:\n return []\n\n pivot = data[random.randint(0, len(data)-1)][0]\n left, right = [], []\n\n for count, num in data:\n if count < pivot:\n left.append((count, num))\n else:\n right.append((count, num))\n \n if len(right) == K:\n return right\n if len(right) > K:\n return quickSelect(right, K)\n\n return right + quickSelect(left, K - len(right))\n\n return [n for count, n in quickSelect(nums_cnts, k)]\n\n # 09/08/24 meta phone screen prep\n # need to redo top k , read the editorial.\n \n # method 1: use counter\n # return [x[0] for x in Counter(nums).most_common(k)]\n \n # method 2: use quickselect\n \n # c = defaultdict(int)\n # for n in nums:\n # c[n] += 1\n \n # def sort(arr, l, r, K):\n # if l < r:\n # p = partition(arr, l, r)\n # if p == len(arr) - K:\n # return\n # elif p < len(arr) - K:\n # sort(arr, p+1, r, K)\n # else:\n # sort(arr, l, p-1, K)\n # def partition(arr, l, r):\n # pivot_ind = random.randint(l, r)\n # arr[pivot_ind], arr[r] = arr[r], arr[pivot_ind]\n # written = l-1\n # for i in range(l, r):\n # if c[arr[i]] < c[arr[r]]:\n # written += 1\n # arr[written], arr[i] = arr[i], arr[written]\n # written += 1\n # arr[written], arr[r] = arr[r], arr[written]\n # return written\n \n # uniq = list(set(nums))\n # sort(uniq, 0, len(uniq)-1, k)\n # return uniq[len(uniq)-k:]\n \n ","memory":"21600"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {} \n freq = [[] for i in range(len(nums) + 1)]\n\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n for n, c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","memory":"21700"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n for n, c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","memory":"21800"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums)+1)]\n for n in nums:\n count[n]= 1+count.get(n,0)\n for n,c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq)-1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res)==k:\n return res","memory":"21800"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums)+1)]\n\n for n in nums:\n count[n] = 1 + count.get(n,0)\n for n,c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq)-1,0,-1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res\n\n #My Solution \n # new_arr = set(nums)\n # dic = {}\n # for i in new_arr:\n # dic[i] = nums.count(i)\n # sorted_dic = dict(sorted(dic.items() , key = lambda item : item[1] , reverse=True))\n # res = list(sorted_dic.keys())\n # return res[:k]\n\n\n ","memory":"21900"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n freq = [[] for i in range(len(nums) + 1)]\n \n for n in nums:\n count[n] = 1 + count.get(n,0)\n for n, c in count.items():\n freq[c].append(n)\n\n res = []\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","memory":"21900"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n count = {}\n for num in nums:\n count[num] = 1 + count.get(num, 0)\n \n freq = [[] for _ in range(len(nums)+1)]\n\n for n,c in count.items():\n freq[c].append(n)\n \n res = []\n for i in range(len(freq)-1, -1, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res","memory":"22000"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n from collections import defaultdict\n\n freqs = defaultdict(int)\n cntList = [[] for i in range(len(nums)+1)]\n res = [] \n\n for n in nums:\n freqs[n] += 1\n for n, c in freqs.items():\n cntList[c].append(n) \n\n for i in range(len(cntList)-1, -1, -1):\n for n in cntList[i]:\n res.append(n)\n if len(res) == k:\n return res\n\n\n\n\n ","memory":"22000"},{"code":"from collections import Counter\nclass Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n\n count = {}\n\n freq = [ [] for i in range(len(nums)+1)]\n\n for n in nums:\n count[n] = 1 + count.get(n, 0)\n\n for n, c in count.items():\n freq[c].append(n)\n res = []\n\n\n for i in range(len(freq) - 1, 0, -1):\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res\n ","memory":"22100"},{"code":"class Solution:\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\n \n\n count = {}\n\n freq = [[] for i in range(len(nums) + 1)]\n\n\n for n in nums:\n count[n] = count.get(n, 0) + 1\n\n for n, c in count.items():\n freq[c].append(n)\n res = []\n for i in range(len(freq) - 1, 0, -1):\n\n for n in freq[i]:\n res.append(n)\n if len(res) == k:\n return res\n","memory":"22100"}],"string":"[\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\n\\nexit()\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"sys.stdout = open('user.out', 'a')\\nfor nums in map(loads, sys.stdin):\\n print(dumps(list(map(itemgetter(0), Counter(nums).most_common(int(sys.stdin.readline()))))))\\nexit()\\n\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n fmap = Counter(nums)\\n heap = []\\n heapq.heapify(heap)\\n \\n for num, freq in fmap.items():\\n if len(heap) < k:\\n heapq.heappush(heap, (freq, num))\\n elif freq > heap[0][0]: \\n # check if current element is more frequent\\n # and remove least frequent element\\n heapq.heappop(heap)\\n heapq.heappush(heap, (freq, num))\\n \\n return [num for _, num in heap]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().topKFrequent(nums, next(inputs))).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n fmap = Counter(nums)\\n heap = []\\n heapq.heapify(heap)\\n \\n for num, freq in fmap.items():\\n if len(heap) < k:\\n heapq.heappush(heap, (freq, num))\\n elif freq > heap[0][0]: \\n # check if current element is more frequent\\n # and remove least frequent element\\n heapq.heappop(heap)\\n heapq.heappush(heap, (freq, num))\\n \\n return [num for _, num in heap]\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n results = (str(Solution().topKFrequent(nums, next(inputs))).replace(\\\" \\\", \\\"\\\") + \\\"\\\\n\\\" \\n for nums in inputs)\\n f.writelines(results)\\nexit(0)\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n myMap={}\\n ans=[]\\n for i in range(len(nums)):\\n myMap[nums[i]]=1+myMap.get(nums[i],0)\\n heap=[]\\n for num,freq in myMap.items():\\n heapq.heappush(heap,(freq,num)) #heaps are min by default, sorted based on first element in tuple\\n if len(heap)>k:\\n heapq.heappop(heap)\\n while heap:\\n ans.append(heapq.heappop(heap)[1])\\n return ans\\n\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n dic = {}\\n heap = []\\n for i in nums:\\n dic[i] = 1 + dic.get(i, 0)\\n \\n for key, value in dic.items():\\n heapq.heappush(heap, (-value, key))\\n\\n res = []\\n while len(res) < k:\\n res.append(heapq.heappop(heap)[1])\\n return res\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = {}\\n vals = []\\n for num in nums:\\n if num not in counts:\\n vals.append(num)\\n counts[num] = 0\\n counts[num] += 1\\n n = len(vals)\\n k = n - k\\n return self.quickselect(vals, 0, n - 1, k, counts)\\n \\n def quickselect(self, vals, left, right, k, counts):\\n pivot_idx = randint(left, right)\\n pivot_val = vals[pivot_idx]\\n pivot_count = counts[pivot_val]\\n cur_idx = left\\n self.swap(vals, pivot_idx, right)\\n for i in range(left, right):\\n val = vals[i]\\n val_count = counts[val]\\n if val_count < pivot_count:\\n self.swap(vals, cur_idx, i)\\n cur_idx += 1\\n self.swap(vals, cur_idx, right)\\n if cur_idx < k:\\n return self.quickselect(vals, cur_idx + 1, right, k, counts)\\n elif k < cur_idx:\\n return self.quickselect(vals, left, cur_idx - 1, k, counts)\\n return vals[k:]\\n\\n def swap(self, vals, i, j):\\n vals[i], vals[j] = vals[j], vals[i]\\n\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n heapq.heapify(nums)\\n count = {}\\n answer = []\\n\\n while nums:\\n temp = heapq.heappop(nums)\\n if temp in count:\\n count[temp] += 1\\n else:\\n count[temp] = 1\\n\\n for i in range(k):\\n max_key = temp\\n temp_value = count[max_key]\\n for key, value in count.items():\\n if value > temp_value:\\n max_key = key\\n temp_value = count[max_key] \\n\\n answer.append(max_key)\\n count[max_key] = 0\\n \\n return answer\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # get frequency of each element in nums\\n freq_dict = collections.Counter(nums)\\n # list of size length nums: index corresponds to frequency of element\\n count_list = [None]*len(nums)\\n for key, val in freq_dict.items():\\n if count_list[val-1] == None:\\n count_list[val-1] = []\\n count_list[val-1].append(key)\\n # get reverse of results\\n res = []\\n for vals in count_list[::-1]:\\n if len(res) == k:\\n break\\n if vals != None:\\n res.extend(vals)\\n return res\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n num_cnt = defaultdict(int)\\n for n in nums:\\n num_cnt[n] += 1\\n num_cnt = dict(sorted(num_cnt.items(), \\n key=lambda item:item[1], \\n reverse=True))\\n return list(num_cnt.keys())[:k]\\n \",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n d={}\\n for i in nums:\\n d[i]=d.get(i,0)+1\\n d=dict(sorted(d.items(),key=lambda x: -x[1]))\\n output=[]\\n for i,j in d.items():\\n if len(output)<k:\\n output.append(i)\\n return output\\n \",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = defaultdict(int)\\n for num in nums:\\n counter[num] += 1\\n sorted_counter = {k:v for k,v in sorted(counter.items(), key=lambda x: x[1], reverse=True)}\\n ans = []\\n for i, v in enumerate(sorted_counter.keys()):\\n if i == k:\\n return ans\\n ans.append(v)\\n return ans\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n dictt={}\\n ans=[]\\n c=0\\n for num in nums:\\n if num not in dictt:\\n dictt[num]=1\\n else:\\n dictt[num]+=1\\n\\n print(dictt)\\n sorted_dict = dict(sorted(dictt.items(), key=lambda item: item[1], reverse=True))\\n\\n for key, v in sorted_dict.items():\\n ans.append(key)\\n c+=1\\n if c==k:\\n break\\n\\n return ans\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n res = []\\n\\n for n in nums:\\n count[n] = 1+count.get(n, 0)\\n\\n sorted_dict = dict(sorted(count.items(), key=lambda item: item[1], reverse=True))\\n for i in range(k):\\n res.append(list(sorted_dict.keys())[i])\\n return res\\n\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counts = defaultdict(int)\\n for num in nums:\\n counts[num] += 1\\n \\n result = []\\n for num, count in counts.items():\\n if len(result) < k:\\n heapq.heappush(result, [count, num])\\n else:\\n heapq.heappushpop(result, [count, num])\\n return [num for count, num in result]\\n \",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = {}\\n for n in nums:\\n counter[n] = counter.get(n, 0) + 1\\n \\n sorted_by_count = sorted(counter.keys(), key=lambda x: counter[x], reverse=True)\\n return sorted_by_count[:k]\\n\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = defaultdict(int)\\n for num in nums:\\n count[num] += 1\\n \\n freq_ = defaultdict(list)\\n for (num, freq) in count.items():\\n freq_[freq].append(num)\\n \\n ans = []\\n keys = sorted(freq_.keys(), reverse = True)\\n for key in keys:\\n for num in freq_[key]:\\n ans.append(num)\\n k -= 1\\n if k == 0:\\n return ans\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = defaultdict(int)\\n heap = []\\n for num in nums:\\n count[num] += 1\\n\\n for key ,val in count.items():\\n heappush(heap, (val, key))\\n if len(heap) > k:\\n heappop(heap)\\n res = []\\n while heap:\\n res.append(heappop(heap)[1])\\n return res\\n\\n\\n\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n heap = []\\n counter = {}\\n for n in nums:\\n counter[n] = 1 + counter.get(n, 0)\\n \\n for key, val in counter.items():\\n heapq.heappush(heap, (-val, key))\\n \\n res = []\\n while len(res) < k:\\n res.append(heapq.heappop(heap)[1])\\n \\n return res\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = defaultdict(list)\\n final_list = []\\n remaining = k\\n temp_set = set(nums)\\n if k == len(nums):\\n return nums\\n for i in temp_set:\\n count = nums.count(i)\\n counter[count].append(i)\\n while len(final_list) < k:\\n max_count = max(counter.keys())\\n # Append the numbers with the highest frequency\\n final_list.extend(counter[max_count])\\n counter.pop(max_count)\\n \\n # Ensure only top k elements are returned\\n return final_list[:k]\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"\\nimport heapq\\nfrom collections import Counter\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter1 = Counter(nums)\\n heap=[]\\n\\n for key,val in counter1.items():\\n if len(heap)<k:\\n heapq.heappush(heap,(val,key))\\n\\n else:\\n heapq.heappushpop(heap,(val,key))\\n\\n return [h[1] for h in heap]\\n\\n\\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n def myfunc(n):\\n return n[1]\\n \\n dic = defaultdict(int)\\n res = []\\n\\n for x in nums:\\n dic[x] += 1\\n\\n \\n listDic = sorted(dic.items(), key=myfunc, reverse=True)\\n\\n print(listDic)\\n\\n for x in range(k):\\n res.append(listDic[x][0])\\n \\n return res\",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n #Put them into a dictionary\\n #Put them into a heap\\n #Pop from heap until there is k left or pop k from the heap.\\n numsdict = {}\\n heap = []\\n for i in nums:\\n if i in numsdict:\\n numsdict[i] += 1\\n else:\\n numsdict[i] = 1\\n \\n for key, value in numsdict.items():\\n index = (value, key)\\n heap.append(index)\\n \\n heapq.heapify(heap)\\n while len(heap) > k:\\n heapq.heappop(heap)\\n\\n answer = []\\n while heap:\\n answer.append( heapq.heappop(heap)[1]) \\n return answer \",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"\\nfrom heapq import heappush, heappop\\nfrom collections import Counter\\n\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n h = []\\n for key, v in Counter(nums).items():\\n heappush(h, (-v, key))\\n\\n return [heappop(h)[1] for _ in range(k)]\\n\\n\\n\\n\\n\\n \\n \",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"import heapq\\n\\n\\nclass Solution:\\n def topKFrequent(self, nums: list[int], k: int) -> list[int]:\\n stat = {}\\n\\n for item in nums:\\n stat[item] = stat.get(item, 0) + 1\\n\\n heap = []\\n\\n for key, value in stat.items():\\n heapq.heappush(heap, (value, key))\\n heap = heapq.nlargest(k, heap)\\n\\n return list(item[1] for item in heapq.nlargest(k, heap))\\n\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n for n in nums:\\n count[n] = count.get(n,0) + 1\\n \\n frequent = []\\n for n,f in count.items():\\n frequent.append([f,n])\\n \\n heapq.heapify(frequent)\\n\\n while len(frequent) != k:\\n heapq.heappop(frequent)\\n output = []\\n for i in range(len(frequent)):\\n f,n = heapq.heappop(frequent)\\n output.append(n)\\n return output\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"from collections import Counter\\nfrom sortedcontainers import SortedList\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n counter = Counter(tuple(nums))\\n res = []\\n for kv in counter.most_common(k):\\n res.append(kv[0])\\n return res\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count_map = collections.Counter(nums)\\n count_map = collections.OrderedDict(count_map.most_common())\\n\\n res = [ key for key in count_map.keys()][:k]\\n\\n return res\\n\\n\\n\\n\\n \",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n # 09/16/24 meta phone screen prep\\n cnt = defaultdict(int)\\n for n in nums:\\n cnt[n] += 1\\n nums_cnts = [(cnt[n], n) for n in cnt ]\\n\\n def quickSelect(data, K):\\n if not data:\\n return []\\n if not K:\\n return []\\n\\n pivot = data[random.randint(0, len(data)-1)][0]\\n left, right = [], []\\n\\n for count, num in data:\\n if count < pivot:\\n left.append((count, num))\\n else:\\n right.append((count, num))\\n \\n if len(right) == K:\\n return right\\n if len(right) > K:\\n return quickSelect(right, K)\\n\\n return right + quickSelect(left, K - len(right))\\n\\n return [n for count, n in quickSelect(nums_cnts, k)]\\n\\n # 09/08/24 meta phone screen prep\\n # need to redo top k , read the editorial.\\n \\n # method 1: use counter\\n # return [x[0] for x in Counter(nums).most_common(k)]\\n \\n # method 2: use quickselect\\n \\n # c = defaultdict(int)\\n # for n in nums:\\n # c[n] += 1\\n \\n # def sort(arr, l, r, K):\\n # if l < r:\\n # p = partition(arr, l, r)\\n # if p == len(arr) - K:\\n # return\\n # elif p < len(arr) - K:\\n # sort(arr, p+1, r, K)\\n # else:\\n # sort(arr, l, p-1, K)\\n # def partition(arr, l, r):\\n # pivot_ind = random.randint(l, r)\\n # arr[pivot_ind], arr[r] = arr[r], arr[pivot_ind]\\n # written = l-1\\n # for i in range(l, r):\\n # if c[arr[i]] < c[arr[r]]:\\n # written += 1\\n # arr[written], arr[i] = arr[i], arr[written]\\n # written += 1\\n # arr[written], arr[r] = arr[r], arr[written]\\n # return written\\n \\n # uniq = list(set(nums))\\n # sort(uniq, 0, len(uniq)-1, k)\\n # return uniq[len(uniq)-k:]\\n \\n \",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {} \\n freq = [[] for i in range(len(nums) + 1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n for n, c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n for n, c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums)+1)]\\n for n in nums:\\n count[n]= 1+count.get(n,0)\\n for n,c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq)-1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res)==k:\\n return res\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums)+1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n,0)\\n for n,c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq)-1,0,-1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n\\n #My Solution \\n # new_arr = set(nums)\\n # dic = {}\\n # for i in new_arr:\\n # dic[i] = nums.count(i)\\n # sorted_dic = dict(sorted(dic.items() , key = lambda item : item[1] , reverse=True))\\n # res = list(sorted_dic.keys())\\n # return res[:k]\\n\\n\\n \",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n freq = [[] for i in range(len(nums) + 1)]\\n \\n for n in nums:\\n count[n] = 1 + count.get(n,0)\\n for n, c in count.items():\\n freq[c].append(n)\\n\\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n count = {}\\n for num in nums:\\n count[num] = 1 + count.get(num, 0)\\n \\n freq = [[] for _ in range(len(nums)+1)]\\n\\n for n,c in count.items():\\n freq[c].append(n)\\n \\n res = []\\n for i in range(len(freq)-1, -1, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n from collections import defaultdict\\n\\n freqs = defaultdict(int)\\n cntList = [[] for i in range(len(nums)+1)]\\n res = [] \\n\\n for n in nums:\\n freqs[n] += 1\\n for n, c in freqs.items():\\n cntList[c].append(n) \\n\\n for i in range(len(cntList)-1, -1, -1):\\n for n in cntList[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n\\n\\n\\n\\n \",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n\\n count = {}\\n\\n freq = [ [] for i in range(len(nums)+1)]\\n\\n for n in nums:\\n count[n] = 1 + count.get(n, 0)\\n\\n for n, c in count.items():\\n freq[c].append(n)\\n res = []\\n\\n\\n for i in range(len(freq) - 1, 0, -1):\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n \",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def topKFrequent(self, nums: List[int], k: int) -> List[int]:\\n \\n\\n count = {}\\n\\n freq = [[] for i in range(len(nums) + 1)]\\n\\n\\n for n in nums:\\n count[n] = count.get(n, 0) + 1\\n\\n for n, c in count.items():\\n freq[c].append(n)\\n res = []\\n for i in range(len(freq) - 1, 0, -1):\\n\\n for n in freq[i]:\\n res.append(n)\\n if len(res) == k:\\n return res\\n\",\n \"memory\": \"22100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":38,"string":"38"}}},{"rowIdx":273,"cells":{"question_id":{"kind":"number","value":520,"string":"520"},"name":{"kind":"string","value":"detect-capital"},"content":{"kind":"string","value":"<p>We define the usage of capitals in a word to be right when one of the following cases holds:</p>\n\n<ul>\n\t<li>All letters in this word are capitals, like <code>"USA"</code>.</li>\n\t<li>All letters in this word are not capitals, like <code>"leetcode"</code>.</li>\n\t<li>Only the first letter in this word is capital, like <code>"Google"</code>.</li>\n</ul>\n\n<p>Given a string <code>word</code>, return <code>true</code> if the usage of capitals in it is right.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> word = \"USA\"\n<strong>Output:</strong> true\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> word = \"FlaG\"\n<strong>Output:</strong> false\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= word.length <= 100</code></li>\n\t<li><code>word</code> consists of lowercase and uppercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":56.387468503823435,"string":"56.387469"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["string"],"string":"[\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"11\", 0.0388], [\"14\", 0.0388], [\"15\", 0.0388], [\"18\", 0.0388], [\"19\", 0.3488], [\"20\", 0.155], [\"21\", 0.1163], [\"22\", 0.4264], [\"23\", 1.3566], [\"24\", 0.6202], [\"25\", 0.7364], [\"26\", 1.8992], [\"27\", 3.062], [\"28\", 2.3256], [\"29\", 2.3256], [\"30\", 4.9225], [\"31\", 6.7829], [\"32\", 4.2636], [\"33\", 3.0233], [\"34\", 8.9922], [\"35\", 9.9612], [\"36\", 6.0078], [\"37\", 5.0775], [\"38\", 9.1085], [\"39\", 7.5194], [\"40\", 5.1163], [\"41\", 3.9147], [\"42\", 3.876]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.2713], [\"16300\", 3.2171], [\"16400\", 21.3566], [\"16500\", 36.7054]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n upper_count = 0\n for i in range(len(word)):\n if word[i].isupper():\n upper_count += 1\n # small optimization\n if upper_count > 1 and upper_count < i:\n return False\n if upper_count == 0 or upper_count == len(word) or (upper_count == 1 and word[0].isupper()):\n return True\n return False\n ","runtime":"11"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return True\n elif word[0:].isupper() or word[1:].islower():\n return True\n return False\n\n ","runtime":"14"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n all_lowercase = True\n all_uppercase = True\n for letter in word[1:]:\n if letter.isupper():\n all_lowercase = False\n else:\n all_uppercase = False\n if word[0].isupper():\n return all_uppercase or all_lowercase\n else:\n return all_lowercase","runtime":"15"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n up = 0\n for i in word:\n if i.isupper():\n up += 1\n return (len(word)==up) or (up==0) or (word[0].isupper() and up == 1)","runtime":"18"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.swapcase() == word.upper() :\n return True\n if word.swapcase() == word.lower():\n return True\n elif word.istitle() :\n return True\n else :\n return False","runtime":"19"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n print(word.title())\n if word == word.upper():\n return True\n elif word == word.lower():\n return True\n elif word == word.title():\n return True\n return False\n ","runtime":"20"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return True\n elif word[0].isupper() and word[1:].islower():\n return True\n else:\n return False","runtime":"21"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n condition1 = 0\n for i in word:\n if i.isupper():\n condition1 = 1\n else:\n condition1 = 0\n break\n condition2 = 0\n for i in word:\n if i.islower():\n condition2 = 1\n else:\n condition2 = 0\n break\n condition3 = 0\n if(word[0].isupper()):\n for i in word[1:]:\n if i.islower():\n condition3 = 1\n else:\n condition3 = 0\n break\n else:\n condition3 = 0\n if(condition1==1 or condition2==1 or condition3==1):\n return True\n else:\n return False\n ","runtime":"22"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word.islower():\n return True\n elif word[0].isupper():\n for c in word[1:]:\n if c.isupper():\n return False\n return True\n return False","runtime":"23"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n ct=0\n for i in word:\n if i.isupper():\n ct+=1\n if ct==0 or(ct==len(word)) or (ct==1 and word[0].isupper() ):\n return True\n return False","runtime":"24"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n lower,upper=0,0\n for c in word:\n if c.isupper():\n upper+=1\n else:\n lower+=1\n if lower==0 or upper==0:\n return True\n if upper==1 and word[0].isupper():\n return True\n return False","runtime":"25"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True;\n elif word.islower():\n return True;\n elif word[0].isupper() & word[1:].islower():\n return True;\n else:\n return False;\n\n\n\n ","runtime":"26"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if all(char.isupper() for char in word):\n return True\n if all(char.islower() for char in word):\n return True\n if word[0].isupper() and word[1:].islower():\n return True\n \n \n ","runtime":"27"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word[0].upper() + word[1:].lower() == word:\n return True\n elif word.islower():\n return True\n\n return False","runtime":"27"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word.islower():\n return True\n elif 65<=ord(word[0])<=90 and word[1::].islower():\n return True\n else:\n return False\n","runtime":"28"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n if word.islower():\n return True\n if word[0].isupper() and word[1:].islower():\n return True\n return False\n ","runtime":"28"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word == word.upper() or word ==word.lower() or (word[0].isupper() ==True and word[1:].islower()==True):\n return True\n return False","runtime":"29"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() :\n return True\n if word.islower():\n return True\n if word[0].isupper() and word[1:].islower():\n return True\n return False\n\n ","runtime":"30"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return True\n \n if word[1:].islower():\n return True\n else:\n return False","runtime":"30"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n return word.isupper() or word.islower() or word[1:].islower()","runtime":"31"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n return word.isupper() or word.islower() or (word[0].isupper() and word[1:].islower())","runtime":"31"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return True\n \n if word[1:].islower():\n return True\n \n return False","runtime":"32"},{"code":"import re\nclass Solution:\n def detectCapitalUse(self, word: str) -> bool:\n ans=re.findall(\"[a-z]\",word)\n print(ans)\n if len(ans)==0:\n return True\n if len(ans)==len(word):\n return True\n if word[0].isupper() and len(ans)==len(word)-1:\n return True\n return False\n ","runtime":"32"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return True\n elif word[0].isupper() and word[1:].islower():\n return True\n else:\n return False ","runtime":"33"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n cont = 0\n prim = word[0]\n rest = word[1:]\n\n if len(word) == 1:\n return True\n\n if prim.isupper() and rest.islower():\n return True\n \n if word.isupper() or word.islower():\n return True\n \n return False","runtime":"33"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word.islower():\n return True\n elif word[0].isupper() and word[1:].islower():\n return True\n else:\n return False","runtime":"34"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n def case(word):\n return word[0].upper() + word[1:].lower()\n flag = False\n if word.isupper() or word.islower() or word == case(word):\n flag = True \n \n return flag","runtime":"34"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n return word.isupper() or word.islower() or word.istitle()","runtime":"35"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n l1 = list(word)\n count = 0\n\n for i in l1:\n if i.isupper() == True:\n count += 1\n\n if l1[0].isupper() and count == 1 and count < len(l1):\n return True\n elif count == 0 and count < len(l1):\n return True\n elif count == len(l1):\n return True\n else:\n return False\n","runtime":"35"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n flag=False\n if (word==word.upper()):\n flag=True\n elif(word==word.lower()):\n flag=True\n elif(word==word.title()):\n flag=True\n \n return flag","runtime":"36"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n pr=word[0]\n rest=word[1:]\n if word.isupper():\n return True\n if word.islower():\n return True\n for c in word:\n if pr.isupper() and rest.islower():\n return True\n\n\n\n \n \n\n ","runtime":"36"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n # Check if all characters are uppercase\n if word.isupper():\n return True\n \n # Check if all characters are lowercase\n if word.islower():\n return True\n \n # Check if only the first character is uppercase and the rest are lowercase\n if word[0].isupper() and word[1:].islower():\n return True\n \n # If none of the conditions are met, return False\n return False\n\n# Example usage\nif __name__ == \"__main__\":\n solution = Solution()\n print(solution.detectCapitalUse(\"USA\")) # Output: True\n print(solution.detectCapitalUse(\"FlaG\")) # Output: False\n print(solution.detectCapitalUse(\"Google\")) # Output: True\n print(solution.detectCapitalUse(\"leetcode\")) # Output: True\n","runtime":"37"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n if word.islower():\n return True\n if word[0].islower() and word[-1].isupper():\n return False\n firstLetter = False\n firstletter = False\n if word[0].isupper():\n firstLetter = True\n if word[0].islower():\n firstletter = True\n for i in range(1,len(word)):\n if firstLetter and word[i].isupper():\n return False\n if firstletter and word[i].islower():\n return False\n return True\n","runtime":"37"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return 1\n elif word[0].isupper():\n if word[1:].islower():\n return 1\n else:\n return 0","runtime":"38"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n pr=word[0]\n rest=word[1:]\n if word.isupper():\n return True\n if word.islower():\n return True\n for c in word:\n if pr.isupper() and rest.islower():\n return True\n\n\n\n \n \n\n ","runtime":"38"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n if word.islower():\n return True\n if word[0].isupper() and word[1:].islower():\n return True\n return False\n ","runtime":"39"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word == word.upper() or word ==word.lower():\n return True\n elif word[0].isupper() ==True and word[1:].islower()==True:\n return True","runtime":"39"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n return word.lower() == word or word.upper() == word or word.capitalize() == word","runtime":"40"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if len(word) <= 1:\n return True\n \n lowerCaseStart = 97\n\n firstIsCapital = True if ord(word[0]) < lowerCaseStart else False\n secondIsCapital = True if ord(word[1]) < lowerCaseStart else False\n\n if not firstIsCapital and secondIsCapital:\n return False\n\n allShouldBeCapital = firstIsCapital and secondIsCapital\n\n for i, c in enumerate(word[2:]):\n cur = ord(c)\n\n if allShouldBeCapital and cur >= lowerCaseStart:\n return False\n \n if not allShouldBeCapital and cur < lowerCaseStart:\n return False \n\n return True\n \n ","runtime":"40"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word.islower():\n return True\n elif 65<=ord(word[0])<=90 and word[1::].islower():\n return True\n else:\n return False\n # count = 0\n # lcount = 0\n # for char in word:\n # if 65<=ord(char)<=90:\n # count += 1\n # elif 97<=ord(char)<=122:\n # lcount += 1\n # if count == len(word):\n # return True\n # elif lcount == len(word):\n # return True\n # elif 65<=ord(word[-1])<=90:\n # return False\n # elif 65<=ord(word[0])<=90 and lcount == len(word)-1:\n # return True\n # else:\n # return False\n","runtime":"41"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if len(word) >= 1:\n if word[0].isupper() and all(word[i].islower() for i in range(1,len(word))):\n return True\n elif all(i.isupper() for i in word):\n return True\n elif all(i.islower() for i in word):\n return True\n else:\n return False\n else:\n return False","runtime":"41"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n # if word.isupper():\n # return True\n # elif word.islower():\n # return True\n # elif 65<=ord(word[0])<=90 and word[1::].islower():\n # return True\n # else:\n # return False\n count = 0\n lcount = 0\n for char in word:\n if 65<=ord(char)<=90:\n count += 1\n elif 97<=ord(char)<=122:\n lcount += 1\n if count == len(word):\n return True\n elif lcount == len(word):\n return True\n elif 65<=ord(word[-1])<=90:\n return False\n elif 65<=ord(word[0])<=90 and lcount == len(word)-1:\n return True\n else:\n return False\n","runtime":"42"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper() or word.islower():\n return True\n \n if word[1:].islower():\n return True\n \n return False","runtime":"42"}],"string":"[\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n upper_count = 0\\n for i in range(len(word)):\\n if word[i].isupper():\\n upper_count += 1\\n # small optimization\\n if upper_count > 1 and upper_count < i:\\n return False\\n if upper_count == 0 or upper_count == len(word) or (upper_count == 1 and word[0].isupper()):\\n return True\\n return False\\n \",\n \"runtime\": \"11\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return True\\n elif word[0:].isupper() or word[1:].islower():\\n return True\\n return False\\n\\n \",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n all_lowercase = True\\n all_uppercase = True\\n for letter in word[1:]:\\n if letter.isupper():\\n all_lowercase = False\\n else:\\n all_uppercase = False\\n if word[0].isupper():\\n return all_uppercase or all_lowercase\\n else:\\n return all_lowercase\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n up = 0\\n for i in word:\\n if i.isupper():\\n up += 1\\n return (len(word)==up) or (up==0) or (word[0].isupper() and up == 1)\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.swapcase() == word.upper() :\\n return True\\n if word.swapcase() == word.lower():\\n return True\\n elif word.istitle() :\\n return True\\n else :\\n return False\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n print(word.title())\\n if word == word.upper():\\n return True\\n elif word == word.lower():\\n return True\\n elif word == word.title():\\n return True\\n return False\\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return True\\n elif word[0].isupper() and word[1:].islower():\\n return True\\n else:\\n return False\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n condition1 = 0\\n for i in word:\\n if i.isupper():\\n condition1 = 1\\n else:\\n condition1 = 0\\n break\\n condition2 = 0\\n for i in word:\\n if i.islower():\\n condition2 = 1\\n else:\\n condition2 = 0\\n break\\n condition3 = 0\\n if(word[0].isupper()):\\n for i in word[1:]:\\n if i.islower():\\n condition3 = 1\\n else:\\n condition3 = 0\\n break\\n else:\\n condition3 = 0\\n if(condition1==1 or condition2==1 or condition3==1):\\n return True\\n else:\\n return False\\n \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word.islower():\\n return True\\n elif word[0].isupper():\\n for c in word[1:]:\\n if c.isupper():\\n return False\\n return True\\n return False\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n ct=0\\n for i in word:\\n if i.isupper():\\n ct+=1\\n if ct==0 or(ct==len(word)) or (ct==1 and word[0].isupper() ):\\n return True\\n return False\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n lower,upper=0,0\\n for c in word:\\n if c.isupper():\\n upper+=1\\n else:\\n lower+=1\\n if lower==0 or upper==0:\\n return True\\n if upper==1 and word[0].isupper():\\n return True\\n return False\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True;\\n elif word.islower():\\n return True;\\n elif word[0].isupper() & word[1:].islower():\\n return True;\\n else:\\n return False;\\n\\n\\n\\n \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if all(char.isupper() for char in word):\\n return True\\n if all(char.islower() for char in word):\\n return True\\n if word[0].isupper() and word[1:].islower():\\n return True\\n \\n \\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word[0].upper() + word[1:].lower() == word:\\n return True\\n elif word.islower():\\n return True\\n\\n return False\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word.islower():\\n return True\\n elif 65<=ord(word[0])<=90 and word[1::].islower():\\n return True\\n else:\\n return False\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n if word.islower():\\n return True\\n if word[0].isupper() and word[1:].islower():\\n return True\\n return False\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word == word.upper() or word ==word.lower() or (word[0].isupper() ==True and word[1:].islower()==True):\\n return True\\n return False\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() :\\n return True\\n if word.islower():\\n return True\\n if word[0].isupper() and word[1:].islower():\\n return True\\n return False\\n\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return True\\n \\n if word[1:].islower():\\n return True\\n else:\\n return False\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n return word.isupper() or word.islower() or word[1:].islower()\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n return word.isupper() or word.islower() or (word[0].isupper() and word[1:].islower())\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return True\\n \\n if word[1:].islower():\\n return True\\n \\n return False\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"import re\\nclass Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n ans=re.findall(\\\"[a-z]\\\",word)\\n print(ans)\\n if len(ans)==0:\\n return True\\n if len(ans)==len(word):\\n return True\\n if word[0].isupper() and len(ans)==len(word)-1:\\n return True\\n return False\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return True\\n elif word[0].isupper() and word[1:].islower():\\n return True\\n else:\\n return False \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n cont = 0\\n prim = word[0]\\n rest = word[1:]\\n\\n if len(word) == 1:\\n return True\\n\\n if prim.isupper() and rest.islower():\\n return True\\n \\n if word.isupper() or word.islower():\\n return True\\n \\n return False\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word.islower():\\n return True\\n elif word[0].isupper() and word[1:].islower():\\n return True\\n else:\\n return False\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n def case(word):\\n return word[0].upper() + word[1:].lower()\\n flag = False\\n if word.isupper() or word.islower() or word == case(word):\\n flag = True \\n \\n return flag\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n return word.isupper() or word.islower() or word.istitle()\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n l1 = list(word)\\n count = 0\\n\\n for i in l1:\\n if i.isupper() == True:\\n count += 1\\n\\n if l1[0].isupper() and count == 1 and count < len(l1):\\n return True\\n elif count == 0 and count < len(l1):\\n return True\\n elif count == len(l1):\\n return True\\n else:\\n return False\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n flag=False\\n if (word==word.upper()):\\n flag=True\\n elif(word==word.lower()):\\n flag=True\\n elif(word==word.title()):\\n flag=True\\n \\n return flag\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n pr=word[0]\\n rest=word[1:]\\n if word.isupper():\\n return True\\n if word.islower():\\n return True\\n for c in word:\\n if pr.isupper() and rest.islower():\\n return True\\n\\n\\n\\n \\n \\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n # Check if all characters are uppercase\\n if word.isupper():\\n return True\\n \\n # Check if all characters are lowercase\\n if word.islower():\\n return True\\n \\n # Check if only the first character is uppercase and the rest are lowercase\\n if word[0].isupper() and word[1:].islower():\\n return True\\n \\n # If none of the conditions are met, return False\\n return False\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n solution = Solution()\\n print(solution.detectCapitalUse(\\\"USA\\\")) # Output: True\\n print(solution.detectCapitalUse(\\\"FlaG\\\")) # Output: False\\n print(solution.detectCapitalUse(\\\"Google\\\")) # Output: True\\n print(solution.detectCapitalUse(\\\"leetcode\\\")) # Output: True\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n if word.islower():\\n return True\\n if word[0].islower() and word[-1].isupper():\\n return False\\n firstLetter = False\\n firstletter = False\\n if word[0].isupper():\\n firstLetter = True\\n if word[0].islower():\\n firstletter = True\\n for i in range(1,len(word)):\\n if firstLetter and word[i].isupper():\\n return False\\n if firstletter and word[i].islower():\\n return False\\n return True\\n\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return 1\\n elif word[0].isupper():\\n if word[1:].islower():\\n return 1\\n else:\\n return 0\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n pr=word[0]\\n rest=word[1:]\\n if word.isupper():\\n return True\\n if word.islower():\\n return True\\n for c in word:\\n if pr.isupper() and rest.islower():\\n return True\\n\\n\\n\\n \\n \\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n if word.islower():\\n return True\\n if word[0].isupper() and word[1:].islower():\\n return True\\n return False\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word == word.upper() or word ==word.lower():\\n return True\\n elif word[0].isupper() ==True and word[1:].islower()==True:\\n return True\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n return word.lower() == word or word.upper() == word or word.capitalize() == word\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if len(word) <= 1:\\n return True\\n \\n lowerCaseStart = 97\\n\\n firstIsCapital = True if ord(word[0]) < lowerCaseStart else False\\n secondIsCapital = True if ord(word[1]) < lowerCaseStart else False\\n\\n if not firstIsCapital and secondIsCapital:\\n return False\\n\\n allShouldBeCapital = firstIsCapital and secondIsCapital\\n\\n for i, c in enumerate(word[2:]):\\n cur = ord(c)\\n\\n if allShouldBeCapital and cur >= lowerCaseStart:\\n return False\\n \\n if not allShouldBeCapital and cur < lowerCaseStart:\\n return False \\n\\n return True\\n \\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word.islower():\\n return True\\n elif 65<=ord(word[0])<=90 and word[1::].islower():\\n return True\\n else:\\n return False\\n # count = 0\\n # lcount = 0\\n # for char in word:\\n # if 65<=ord(char)<=90:\\n # count += 1\\n # elif 97<=ord(char)<=122:\\n # lcount += 1\\n # if count == len(word):\\n # return True\\n # elif lcount == len(word):\\n # return True\\n # elif 65<=ord(word[-1])<=90:\\n # return False\\n # elif 65<=ord(word[0])<=90 and lcount == len(word)-1:\\n # return True\\n # else:\\n # return False\\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if len(word) >= 1:\\n if word[0].isupper() and all(word[i].islower() for i in range(1,len(word))):\\n return True\\n elif all(i.isupper() for i in word):\\n return True\\n elif all(i.islower() for i in word):\\n return True\\n else:\\n return False\\n else:\\n return False\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n # if word.isupper():\\n # return True\\n # elif word.islower():\\n # return True\\n # elif 65<=ord(word[0])<=90 and word[1::].islower():\\n # return True\\n # else:\\n # return False\\n count = 0\\n lcount = 0\\n for char in word:\\n if 65<=ord(char)<=90:\\n count += 1\\n elif 97<=ord(char)<=122:\\n lcount += 1\\n if count == len(word):\\n return True\\n elif lcount == len(word):\\n return True\\n elif 65<=ord(word[-1])<=90:\\n return False\\n elif 65<=ord(word[0])<=90 and lcount == len(word)-1:\\n return True\\n else:\\n return False\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper() or word.islower():\\n return True\\n \\n if word[1:].islower():\\n return True\\n \\n return False\",\n \"runtime\": \"42\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":43,"string":"43"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n return word.isupper() or word.islower() or word.istitle()","memory":"16200"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n capitals = set(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\n word = list(word)\n \n if len(word) <= 1:\n return True\n \n if word[0] in capitals:\n if word[1] in capitals:\n return all(char in capitals for char in word)\n else:\n return all(char not in capitals for char in word[1:])\n else:\n return all(char not in capitals for char in word)\n","memory":"16300"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n capitals = set(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\n \n if len(word) <= 1:\n return True\n \n if word[0] in capitals:\n if word[1] in capitals:\n return all(char in capitals for char in word)\n else:\n return all(char not in capitals for char in word[1:])\n else:\n return all(char not in capitals for char in word)\n","memory":"16300"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word.islower():\n return True\n elif word[0].isupper() and word[1:].islower():\n return True\n else:\n return False","memory":"16400"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if all(char.isupper() for char in word):\n return True\n if all(char.islower() for char in word):\n return True\n if word[0].isupper() and word[1:].islower():\n return True\n \n \n ","memory":"16400"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n if word.isupper():\n return True\n elif word.islower():\n return True\n elif 65<=ord(word[0])<=90 and word[1::].islower():\n return True\n else:\n return False\n # count = 0\n # lcount = 0\n # for char in word:\n # if 65<=ord(char)<=90:\n # count += 1\n # elif 97<=ord(char)<=122:\n # lcount += 1\n # if count == len(word):\n # return True\n # elif lcount == len(word):\n # return True\n # elif 65<=ord(word[-1])<=90:\n # return False\n # elif 65<=ord(word[0])<=90 and lcount == len(word)-1:\n # return True\n # else:\n # return False\n","memory":"16500"},{"code":"class Solution:\n def detectCapitalUse(self, word: str) -> bool:\n flag=False\n if (word==word.upper()):\n flag=True\n elif(word==word.lower()):\n flag=True\n elif(word==word.title()):\n flag=True\n \n return flag","memory":"16500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n return word.isupper() or word.islower() or word.istitle()\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n capitals = set(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")\\n word = list(word)\\n \\n if len(word) <= 1:\\n return True\\n \\n if word[0] in capitals:\\n if word[1] in capitals:\\n return all(char in capitals for char in word)\\n else:\\n return all(char not in capitals for char in word[1:])\\n else:\\n return all(char not in capitals for char in word)\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n capitals = set(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")\\n \\n if len(word) <= 1:\\n return True\\n \\n if word[0] in capitals:\\n if word[1] in capitals:\\n return all(char in capitals for char in word)\\n else:\\n return all(char not in capitals for char in word[1:])\\n else:\\n return all(char not in capitals for char in word)\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word.islower():\\n return True\\n elif word[0].isupper() and word[1:].islower():\\n return True\\n else:\\n return False\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if all(char.isupper() for char in word):\\n return True\\n if all(char.islower() for char in word):\\n return True\\n if word[0].isupper() and word[1:].islower():\\n return True\\n \\n \\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n if word.isupper():\\n return True\\n elif word.islower():\\n return True\\n elif 65<=ord(word[0])<=90 and word[1::].islower():\\n return True\\n else:\\n return False\\n # count = 0\\n # lcount = 0\\n # for char in word:\\n # if 65<=ord(char)<=90:\\n # count += 1\\n # elif 97<=ord(char)<=122:\\n # lcount += 1\\n # if count == len(word):\\n # return True\\n # elif lcount == len(word):\\n # return True\\n # elif 65<=ord(word[-1])<=90:\\n # return False\\n # elif 65<=ord(word[0])<=90 and lcount == len(word)-1:\\n # return True\\n # else:\\n # return False\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def detectCapitalUse(self, word: str) -> bool:\\n flag=False\\n if (word==word.upper()):\\n flag=True\\n elif(word==word.lower()):\\n flag=True\\n elif(word==word.title()):\\n flag=True\\n \\n return flag\",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":274,"cells":{"question_id":{"kind":"number","value":521,"string":"521"},"name":{"kind":"string","value":"longest-uncommon-subsequence-i"},"content":{"kind":"string","value":"<p>Given two strings <code>a</code> and <code>b</code>, return <em>the length of the <strong>longest uncommon subsequence</strong> between </em><code>a</code> <em>and</em> <code>b</code>. <em>If no such uncommon subsequence exists, return</em> <code>-1</code><em>.</em></p>\n\n<p>An <strong>uncommon subsequence</strong> between two strings is a string that is a <strong><span data-keyword=\"subsequence-string\">subsequence</span> of exactly one of them</strong>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> a = "aba", b = "cdc"\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> One longest uncommon subsequence is "aba" because "aba" is a subsequence of "aba" but not "cdc".\nNote that "cdc" is also a longest uncommon subsequence.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> a = "aaa", b = "bbb"\n<strong>Output:</strong> 3\n<strong>Explanation:</strong> The longest uncommon subsequences are "aaa" and "bbb".\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> a = "aaa", b = "aaa"\n<strong>Output:</strong> -1\n<strong>Explanation:</strong> Every subsequence of string a is also a subsequence of string b. Similarly, every subsequence of string b is also a subsequence of string a. So the answer would be <code>-1</code>.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= a.length, b.length <= 100</code></li>\n\t<li><code>a</code> and <code>b</code> consist of lower-case English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":60.93882806813959,"string":"60.938828"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["string"],"string":"[\n \"string\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16\", 0.0952], [\"18\", 0.0952], [\"19\", 0.1905], [\"20\", 0.381], [\"21\", 0.2857], [\"22\", 0.4762], [\"23\", 0.7619], [\"24\", 1.1429], [\"25\", 0.6667], [\"26\", 2.2857], [\"27\", 1.9048], [\"28\", 3.619], [\"29\", 4.8571], [\"30\", 4.1905], [\"31\", 4.1905], [\"32\", 5.5238], [\"33\", 6.0], [\"34\", 8.6667], [\"35\", 6.0], [\"36\", 8.6667], [\"37\", 8.2857], [\"38\", 6.8571], [\"39\", 4.5714], [\"40\", 5.0476], [\"41\", 4.2857], [\"42\", 4.2857]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.4762], [\"16300\", 8.4762], [\"16400\", 28.6667], [\"16500\", 47.7143]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a==b:\n return -1\n else:\n return max(len(a),len(b))\n ","runtime":"16"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1 \n return max(len(a),len(b))\n\n ","runtime":"18"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n a_len=len(a)\n b_len=len(b)\n if a.count(a[0])==b.count(a[0]) and a_len==a.count(a[0]):\n return -1\n else:\n if(a==b):\n return -1\n return max(a_len,b_len)\n","runtime":"19"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a==b:\n return -1\n return max(len(a),len(b))","runtime":"20"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return len(b) if len(b) > len(a) else len(a)","runtime":"21"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a), len(b))","runtime":"22"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n # if one is longer than the other, return the longer string\n # if they are the same length\n # if a == b return -1\n # else the entire string is a non-subsequence of the other\n if (la := len(a)) == (lb := len(b)):\n return -1 if a == b else lb\n else:\n return max(la, lb)\n","runtime":"23"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a==b:\n return -1\n else:\n return max(len(a),len(b))","runtime":"24"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a), len(b))","runtime":"25"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n else:\n return max(len(a), len(b))","runtime":"26"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a==b:\n return -1 \n return max(len(a),len(b)) ","runtime":"26"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n\n return max(len(a), len(b))","runtime":"27"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a), len(b))","runtime":"28"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a),len(b)) \n \n ","runtime":"29"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n return -1 if a == b else max(len(a), len(b))","runtime":"30"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n x=len(a)\n y=len(b)\n if a==b:\n return -1 \n else:\n return(max(x,y))\n \n\n\n","runtime":"31"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n return -1 if a == b else max(len(a), len(b))\n ","runtime":"32"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1 \n return max(len(a),len(b))","runtime":"33"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n\n if a == b:\n return -1\n\n return max(len(a), len(b))\n ","runtime":"34"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n\n ans = -1\n for i in range(len(a)):\n for j in range(len(a)):\n if a[i:j+1] not in b and len(a[i:j+1])>ans:\n ans=len(a[i:j+1])\n for i in range(len(b)):\n for j in range(len(b)):\n if b[i:j+1] not in a and len(b[i:j+1])>ans:\n ans=len(b[i:j+1])\n return ans\n\n ","runtime":"34"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a != b:\n # If the strings are different, return the length of the longer string\n return max(len(a), len(b))\n else:\n # If the strings are the same, return -1\n return -1\n\n# Example usage\nif __name__ == \"__main__\":\n solution = Solution()\n print(solution.findLUSlength(\"aba\", \"cdc\")) # Output: 3\n print(solution.findLUSlength(\"aaa\", \"aaa\")) # Output: -1\n print(solution.findLUSlength(\"abcd\", \"abcd\")) # Output: -1\n print(solution.findLUSlength(\"abcd\", \"abc\")) # Output: 4\n","runtime":"35"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a != b:\n # If the strings are different, return the length of the longer string\n return max(len(a), len(b))\n else:\n # If the strings are the same, return -1\n return -1\n\n# Example usage\nif __name__ == \"__main__\":\n solution = Solution()\n print(solution.findLUSlength(\"aba\", \"cdc\")) # Output: 3\n print(solution.findLUSlength(\"aaa\", \"aaa\")) # Output: -1\n print(solution.findLUSlength(\"abcd\", \"abcd\")) # Output: -1\n print(solution.findLUSlength(\"abcd\", \"abc\")) # Output: 4\n","runtime":"36"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a), len(b))\n","runtime":"36"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n return -1 if a == b else max(len(a), len(b))\n ","runtime":"37"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n else:\n return max(len(a), len(b))","runtime":"38"},{"code":"class Solution:\n def findLUSlength(self, A: str, B: str) -> int:\n if A == B:\n return -1\n return max(len(A), len(B))","runtime":"39"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a), len(b))","runtime":"40"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n return -1 if a == b else max(len(a), len(b))","runtime":"41"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n else:\n return max(len(a), len(b)) ","runtime":"42"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n else:\n return max(len(a), len(b))\n\n ","runtime":"42"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a==b:\\n return -1\\n else:\\n return max(len(a),len(b))\\n \",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1 \\n return max(len(a),len(b))\\n\\n \",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n a_len=len(a)\\n b_len=len(b)\\n if a.count(a[0])==b.count(a[0]) and a_len==a.count(a[0]):\\n return -1\\n else:\\n if(a==b):\\n return -1\\n return max(a_len,b_len)\\n\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a==b:\\n return -1\\n return max(len(a),len(b))\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return len(b) if len(b) > len(a) else len(a)\",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a), len(b))\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n # if one is longer than the other, return the longer string\\n # if they are the same length\\n # if a == b return -1\\n # else the entire string is a non-subsequence of the other\\n if (la := len(a)) == (lb := len(b)):\\n return -1 if a == b else lb\\n else:\\n return max(la, lb)\\n\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a==b:\\n return -1\\n else:\\n return max(len(a),len(b))\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a), len(b))\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n else:\\n return max(len(a), len(b))\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a==b:\\n return -1 \\n return max(len(a),len(b)) \",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n\\n return max(len(a), len(b))\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a), len(b))\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a),len(b)) \\n \\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n return -1 if a == b else max(len(a), len(b))\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n x=len(a)\\n y=len(b)\\n if a==b:\\n return -1 \\n else:\\n return(max(x,y))\\n \\n\\n\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n return -1 if a == b else max(len(a), len(b))\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1 \\n return max(len(a),len(b))\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n\\n if a == b:\\n return -1\\n\\n return max(len(a), len(b))\\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n\\n ans = -1\\n for i in range(len(a)):\\n for j in range(len(a)):\\n if a[i:j+1] not in b and len(a[i:j+1])>ans:\\n ans=len(a[i:j+1])\\n for i in range(len(b)):\\n for j in range(len(b)):\\n if b[i:j+1] not in a and len(b[i:j+1])>ans:\\n ans=len(b[i:j+1])\\n return ans\\n\\n \",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a != b:\\n # If the strings are different, return the length of the longer string\\n return max(len(a), len(b))\\n else:\\n # If the strings are the same, return -1\\n return -1\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n solution = Solution()\\n print(solution.findLUSlength(\\\"aba\\\", \\\"cdc\\\")) # Output: 3\\n print(solution.findLUSlength(\\\"aaa\\\", \\\"aaa\\\")) # Output: -1\\n print(solution.findLUSlength(\\\"abcd\\\", \\\"abcd\\\")) # Output: -1\\n print(solution.findLUSlength(\\\"abcd\\\", \\\"abc\\\")) # Output: 4\\n\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a != b:\\n # If the strings are different, return the length of the longer string\\n return max(len(a), len(b))\\n else:\\n # If the strings are the same, return -1\\n return -1\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n solution = Solution()\\n print(solution.findLUSlength(\\\"aba\\\", \\\"cdc\\\")) # Output: 3\\n print(solution.findLUSlength(\\\"aaa\\\", \\\"aaa\\\")) # Output: -1\\n print(solution.findLUSlength(\\\"abcd\\\", \\\"abcd\\\")) # Output: -1\\n print(solution.findLUSlength(\\\"abcd\\\", \\\"abc\\\")) # Output: 4\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a), len(b))\\n\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n return -1 if a == b else max(len(a), len(b))\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n else:\\n return max(len(a), len(b))\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, A: str, B: str) -> int:\\n if A == B:\\n return -1\\n return max(len(A), len(B))\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a), len(b))\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n return -1 if a == b else max(len(a), len(b))\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n else:\\n return max(len(a), len(b)) \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n else:\\n return max(len(a), len(b))\\n\\n \",\n \"runtime\": \"42\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":30,"string":"30"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n return -1 if a == b else max(len(a), len(b))","memory":"16200"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n else:\n return max(len(a), len(b))","memory":"16300"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n\n return max(len(a), len(b))","memory":"16400"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a != b:\n # If the strings are different, return the length of the longer string\n return max(len(a), len(b))\n else:\n # If the strings are the same, return -1\n return -1\n\n# Example usage\nif __name__ == \"__main__\":\n solution = Solution()\n print(solution.findLUSlength(\"aba\", \"cdc\")) # Output: 3\n print(solution.findLUSlength(\"aaa\", \"aaa\")) # Output: -1\n print(solution.findLUSlength(\"abcd\", \"abcd\")) # Output: -1\n print(solution.findLUSlength(\"abcd\", \"abc\")) # Output: 4\n","memory":"16400"},{"code":"class Solution:\n def findLUSlength(self, a: str, b: str) -> int:\n if a == b:\n return -1\n return max(len(a), len(b))\n","memory":"16500"},{"code":"class Solution:\n def findLUSlength(self, A: str, B: str) -> int:\n if A == B:\n return -1\n return max(len(A), len(B))","memory":"16500"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n return -1 if a == b else max(len(a), len(b))\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n else:\\n return max(len(a), len(b))\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n\\n return max(len(a), len(b))\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a != b:\\n # If the strings are different, return the length of the longer string\\n return max(len(a), len(b))\\n else:\\n # If the strings are the same, return -1\\n return -1\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n solution = Solution()\\n print(solution.findLUSlength(\\\"aba\\\", \\\"cdc\\\")) # Output: 3\\n print(solution.findLUSlength(\\\"aaa\\\", \\\"aaa\\\")) # Output: -1\\n print(solution.findLUSlength(\\\"abcd\\\", \\\"abcd\\\")) # Output: -1\\n print(solution.findLUSlength(\\\"abcd\\\", \\\"abc\\\")) # Output: 4\\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, a: str, b: str) -> int:\\n if a == b:\\n return -1\\n return max(len(a), len(b))\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, A: str, B: str) -> int:\\n if A == B:\\n return -1\\n return max(len(A), len(B))\",\n \"memory\": \"16500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":6,"string":"6"}}},{"rowIdx":275,"cells":{"question_id":{"kind":"number","value":522,"string":"522"},"name":{"kind":"string","value":"longest-uncommon-subsequence-ii"},"content":{"kind":"string","value":"<p>Given an array of strings <code>strs</code>, return <em>the length of the <strong>longest uncommon subsequence</strong> between them</em>. If the longest uncommon subsequence does not exist, return <code>-1</code>.</p>\n\n<p>An <strong>uncommon subsequence</strong> between an array of strings is a string that is a <strong>subsequence of one string but not the others</strong>.</p>\n\n<p>A <strong>subsequence</strong> of a string <code>s</code> is a string that can be obtained after deleting any number of characters from <code>s</code>.</p>\n\n<ul>\n\t<li>For example, <code>"abc"</code> is a subsequence of <code>"aebdc"</code> because you can delete the underlined characters in <code>"a<u>e</u>b<u>d</u>c"</code> to get <code>"abc"</code>. Other subsequences of <code>"aebdc"</code> include <code>"aebdc"</code>, <code>"aeb"</code>, and <code>""</code> (empty string).</li>\n</ul>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> strs = [\"aba\",\"cdc\",\"eae\"]\n<strong>Output:</strong> 3\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> strs = [\"aaa\",\"aaa\",\"aa\"]\n<strong>Output:</strong> -1\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>2 <= strs.length <= 50</code></li>\n\t<li><code>1 <= strs[i].length <= 10</code></li>\n\t<li><code>strs[i]</code> consists of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":42.086452067165666,"string":"42.086452"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","two-pointers","string","sorting"],"string":"[\n \"array\",\n \"hash-table\",\n \"two-pointers\",\n \"string\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"14\", 0.3247], [\"20\", 0.3247], [\"22\", 0.3247], [\"23\", 0.3247], [\"24\", 0.3247], [\"25\", 0.3247], [\"26\", 0.3247], [\"27\", 0.974], [\"28\", 0.3247], [\"29\", 1.2987], [\"30\", 2.9221], [\"31\", 2.9221], [\"32\", 2.9221], [\"33\", 3.2468], [\"34\", 3.5714], [\"35\", 4.8701], [\"36\", 6.4935], [\"37\", 4.8701], [\"38\", 6.8182], [\"39\", 5.8442], [\"40\", 5.8442], [\"41\", 6.8182], [\"42\", 5.5195], [\"43\", 5.1948], [\"44\", 3.5714], [\"45\", 2.9221], [\"46\", 3.8961], [\"47\", 3.2468], [\"48\", 1.2987], [\"49\", 2.2727], [\"50\", 0.974], [\"51\", 0.3247], [\"52\", 0.974], [\"54\", 0.3247], [\"63\", 0.3247], [\"95\", 0.3247], [\"117\", 0.3247], [\"122\", 0.3247], [\"125\", 0.3247], [\"134\", 0.3247], [\"135\", 0.3247]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.3247], [\"16300\", 5.5195], [\"16400\", 21.1039], [\"16500\", 28.8961], [\"16600\", 32.7922], [\"16700\", 4.2208], [\"16800\", 0.974], [\"18800\", 0.3247], [\"18900\", 0.3247]]}"},"rt_list":{"kind":"list like","value":[{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def isSubsequence(a: str, b: str) -> bool:\n i = 0\n for char in b:\n if i < len(a) and a[i] == char:\n i += 1\n return i == len(a)\n \n strs.sort(key=lambda s: -len(s))\n \n for i, s in enumerate(strs):\n # 检查当前字符串是否是其他所有字符串的子序列\n is_subsequence = True\n for j in range(len(strs)):\n if j != i and isSubsequence(s, strs[j]):\n is_subsequence = False\n break\n if is_subsequence:\n return len(s)\n \n return -1\n\n# 示例使用\nsolution = Solution()\nprint(solution.findLUSlength([\"aba\", \"cdc\", \"eae\"])) # 输出应该是 3\n","runtime":"14"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def isSubsequence(a: str, b: str) -> bool:\n i = 0\n for char in b:\n if i < len(a) and a[i] == char:\n i += 1\n return i == len(a)\n \n strs.sort(key=lambda s: -len(s))\n \n for i, s in enumerate(strs):\n if all(not isSubsequence(s, strs[j]) for j in range(len(strs)) if j != i):\n return len(s)\n \n return -1","runtime":"20"},{"code":"from collections import Counter\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def isSubsequence(a: str, b: str) -> bool:\n i = 0\n for char in b:\n if i < len(a) and a[i] == char:\n i += 1\n return i == len(a)\n \n strs.sort(key=lambda s: -len(s))\n \n for i, s in enumerate(strs):\n if all(not isSubsequence(s, strs[j]) for j in range(len(strs)) if j != i):\n return len(s)\n \n return -1","runtime":"22"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def isSubsequence(a: str, b: str) -> bool:\n i = 0\n j = 0\n\n while i < len(a) and j < len(b):\n if a[i] == b[j]:\n i += 1\n j += 1\n\n return i == len(a)\n\n seen = set()\n duplicates = set()\n\n for s in strs:\n if s in seen:\n duplicates.add(s)\n seen.add(s)\n\n strs.sort(key=lambda s: -len(s))\n\n for i in range(len(strs)):\n if strs[i] in duplicates:\n continue\n isASubsequence = False\n for j in range(i):\n isASubsequence |= isSubsequence(strs[i], strs[j])\n if not isASubsequence:\n return len(strs[i])\n\n return -1","runtime":"23"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n strs.sort(key=lambda x:(len(x), x), reverse=True)\n idx = 0\n \n def is_sub(a, b):\n p = a.find(b[0])\n if p == -1:\n return False\n if len(b) == 1:\n return True\n return is_sub(a[p+1:], b[1:])\n\n while idx < len(strs):\n while idx < len(strs)-1 and strs[idx] == strs[idx+1]:\n idx += 1\n if not idx or not any(is_sub(strs[x], strs[idx]) for x in range(idx)):\n return len(strs[idx])\n elif idx == len(strs) - 1:\n return -1\n else:\n idx += 1","runtime":"24"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_seq(a, b):\n j = 0\n for i in range(len(b)):\n if a[j] == b[i]:\n j += 1\n if j == len(a):\n return True\n \n return False\n\n d = defaultdict(int)\n for s in strs:\n d[s] += 1\n \n strs.sort(key=len, reverse=True)\n ans = -1\n if d[strs[0]] == 1:\n return len(strs[0])\n\n for i in range(len(strs)):\n if d[strs[i]] > 1:\n continue\n if not any(is_seq(strs[i], strs[j]) for j in range(i)): \n return len(strs[i])\n return -1\n\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n # def isSubseq(a, b):\n # j = 0\n # for i in range(len(b)):\n # if a[j] == b[i]:\n # j += 1\n # if j == len(a):\n # return True\n # return False\n\n \n # c = Counter(strs)\n # s = sorted(c.keys(), key=len, reverse=True)\n # print(c)\n # print(s)\n\n # for i in range(len(s)):\n # if c[s[i]] > 1:\n # continue\n # if i == 0 or not any(isSubseq(s[i], s[j]) for j in range(i)): \n # return len(s[i])\n # return -1\n","runtime":"25"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n # word_map = defaultdict(int)\n\n # for word in strs:\n # n = len(word)\n # for i in range(1 << n):\n # temp = []\n # for j in range(n):\n # if (i >> j) & 1:\n # temp.append(word[j])\n # word_map[''.join(temp)] += 1\n # maxi = 0\n # for key, val in word_map.items():\n # if val == 1:\n # maxi = max(maxi, len(key))\n \n # return maxi if maxi > 0 else -1\n\n def is_subsequence(s1, s2):\n it = iter(s2)\n return all(char in it for char in s1)\n \n strs.sort(key=len, reverse=True)\n \n for i, s1 in enumerate(strs):\n if all(not is_subsequence(s1, s2) for j, s2 in enumerate(strs) if i != j):\n return len(s1)\n \n return -1","runtime":"26"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n \n\n def isSub(t, s):\n s1 = 0\n t1 = 0\n\n # Iterate while there are characters left to check in both s and t\n while t1 < len(t) and s1 < len(s):\n if s[s1] == t[t1]:\n t1 += 1 # Move to the next character in t if we have a match\n s1 += 1 # Always move to the next character in s\n\n # If we've matched all characters of t, t is a subsequence of s\n return t1 == len(t)\n\n\n\n\n\n\n\n strs.sort(key=lambda x: -len(x))\n print(strs)\n\n\n for i, word in enumerate(strs):\n found = True\n for j in range(len(strs)):\n\n if i != j and isSub(word, strs[j]):\n found = False\n break\n\n if found:\n return len(word)\n\n return -1","runtime":"27"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def isSubseq(a, b):\n j = 0\n for i in range(len(b)):\n if a[j] == b[i]:\n j += 1\n if j == len(a):\n return True\n return False\n c = Counter(strs)\n s = sorted(c.keys(), key=len, reverse=True)\n for i in range(len(s)):\n if c[s[i]] > 1:\n continue\n if i == 0 or not any(isSubseq(s[i], s[j]) for j in range(i)): \n return len(s[i])\n return -1","runtime":"28"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1: str, s2: str) -> bool:\n \"\"\"Returns True if s1 is a subsequence of s2, else False\"\"\"\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n \n strs.sort(key=len, reverse=True)\n \n # Iterate over each string in the sorted list\n for i, s in enumerate(strs):\n is_uncommon = True\n # Check if s is a subsequence of any other string\n for j, t in enumerate(strs):\n if i != j and is_subsequence(s, t):\n is_uncommon = False\n break\n # If it's not a subsequence of any other string, return its length\n if is_uncommon:\n return len(s)\n \n # If no uncommon subsequence is found\n return -1","runtime":"29"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n # Sort the strings by length in descending order\n strs.sort(key=len, reverse=True)\n\n # Check each string if it is an uncommon subsequence\n for i in range(len(strs)):\n mismatch_count = 0\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n mismatch_count += 1\n break\n if mismatch_count == 0:\n return len(strs[i])\n\n return -1\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"30"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def subseq(w1, w2):\n if len(w1) > len(w2):\n return False\n i = 0\n for c in w2:\n if i < len(w1) and w1[i] == c:\n i += 1\n return i == len(w1)\n \n strs.sort(key = len, reverse = True)\n for i, word1 in enumerate(strs):\n if all(not subseq(word1, word2) \n for j, word2 in enumerate(strs) if i != j): \n return len(word1)\n return -1","runtime":"31"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n max_length = -1\n for i in range(len(strs)):\n is_uncommon = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n is_uncommon = False\n break\n if is_uncommon:\n max_length = max(max_length, len(strs[i]))\n\n return max_length\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"32"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n \n # Sort the strings by length in descending order\n strs.sort(key=len, reverse=True)\n \n # Check each string if it is an uncommon subsequence\n for i in range(len(strs)):\n all_subsequence = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n all_subsequence = False\n break\n if all_subsequence:\n return len(strs[i])\n \n return -1\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"32"},{"code":"class Solution:\n \n def is_subsequence(self, s1: str, s2: str) -> bool:\n \"\"\"Check if s1 is a subsequence of s2.\"\"\"\n it = iter(s2) # Create an iterator for s2\n return all(char in it for char in s1) # Check if each char in s1 is in the iterator\n \n def findLUSlength(self, strs: list[str]) -> int:\n # Sort strings by length in descending order\n strs.sort(key=len, reverse=True)\n \n for i, s1 in enumerate(strs):\n if all(not self.is_subsequence(s1, s2) for j, s2 in enumerate(strs) if i != j):\n return len(s1)\n \n return -1\n\n","runtime":"33"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def subseq(w1, w2):\n if len(w1) > len(w2):\n return False\n i = 0\n for c in w2:\n if i < len(w1) and w1[i] == c:\n i += 1\n return i == len(w1)\n \n strs.sort(key = len, reverse = True)\n for i, word1 in enumerate(strs):\n if all(not subseq(word1, word2) \n for j, word2 in enumerate(strs) if i != j): \n return len(word1)\n return -1","runtime":"34"},{"code":"class Solution:\n def findLUSlength(self, words):\n def isSubsequence(s, t):\n t = iter(t)\n return all(c in t for c in s)\n \n words.sort(key = lambda x:-len(x))\n for i, word in enumerate(words):\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \n return len(word)\n \n return -1","runtime":"35"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n # Sort strings by length in descending order\n strs.sort(key=len, reverse=True)\n\n longest_uncommon_length = -1\n for i in range(len(strs)):\n check = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n check = False\n break\n if check:\n longest_uncommon_length = max(longest_uncommon_length, len(strs[i]))\n\n return longest_uncommon_length\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"36"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n strs.sort(key=len, reverse=True)\n #only compare str with bigger or equal length\n for i, s in enumerate(strs):\n #check if current str can be uncommon seq\n ans, is_candidate = len(s), True\n for j in range(len(strs)):\n if j == i: continue\n if len(strs[j]) < ans:\n return ans\n if self.is_sub(strs[j], s):\n is_candidate = False\n break\n if is_candidate: return ans\n return -1\n\n #check if sub is a substring of string s\n def is_sub(self, s: str, sub: str) -> bool:\n j = 0\n for i in range(len(s)):\n if j == len(sub): return True\n if s[i] == sub[j]: j += 1\n return j == len(sub)","runtime":"37"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n \n def is_subsequence(a: str, b: str) -> bool:\n i = j = 0\n while i < len(a) and j < len(b):\n if a[i] == b[j]:\n j += 1\n i += 1\n return j == len(b)\n \n num_strings = len(strs)\n longest_unique_length = -1\n\n for i in range(num_strings):\n j = 0\n\n while j < num_strings:\n if i == j or not is_subsequence(strs[j], strs[i]):\n j += 1\n else:\n break\n if j == num_strings:\n longest_unique_length = max(longest_unique_length, len(strs[i]))\n\n return longest_unique_length","runtime":"38"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n\n def subseq(w1, w2):\n if len(w1)>len(w2):\n return False\n i=0\n for c in w2:\n if i<len(w1) and w1[i]==c:\n i+=1\n return i==len(w1)\n\n strs.sort(key=len, reverse=True)\n for i, word1 in enumerate(strs):\n if all(not subseq(word1, word2) for j, word2 in enumerate(strs) if i!=j):\n return len(word1)\n return -1","runtime":"39"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n # given two strings, the longest uncommon subsequence is either the longer string\n # or the entire string if they have the same length but are different\n def isSubsequence(a, b):\n if len(a) > len(b):\n return False\n elif len(a) == len(b):\n return a == b\n else:\n i = 0\n for j in b:\n if j == a[i]:\n i += 1\n if i == len(a):\n return True\n return i == len(a)\n \n strs = sorted(strs, key=len, reverse=True)\n for i in range(len(strs)):\n if all(not isSubsequence(strs[i], strs[j]) for j in range(len(strs)) if i != j):\n return len(strs[i])\n return -1","runtime":"40"},{"code":"class Solution:\n def findLUSlength(self, words):\n def isSubsequence(s, t):\n t = iter(t)\n return all(c in t for c in s)\n \n words.sort(key = lambda x:-len(x))\n for i, word in enumerate(words):\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \n return len(word)\n \n return -1","runtime":"41"},{"code":"class Solution:\n def isSub(self, a, b):\n i=0\n for j in range(len(b)):\n if b[j]==a[i]:\n i+=1\n if i==len(a):\n break\n return i==len(a)\n\n def findLUSlength(self, strs: List[str]) -> int:\n count_str=dict()\n for st in strs:\n if st in count_str:\n count_str[st]+=1\n else:\n count_str[st]=1\n \n un_strs = [(i, count_str[i]) for i in count_str.keys()]\n un_strs = sorted(un_strs, key=lambda x: len(x[0]))\n for i in range(len(un_strs)-1, -1, -1):\n if un_strs[i][1]>1:\n continue\n flag=False\n for j in range(i+1, len(un_strs)):\n if self.isSub(un_strs[i][0], un_strs[j][0]):\n flag=True\n if not flag:\n return len(un_strs[i][0])\n return -1\n","runtime":"42"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Helper function to check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n max_length = -1\n for i in range(len(strs)):\n is_uncommon = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n is_uncommon = False\n break\n if is_uncommon:\n max_length = max(max_length, len(strs[i]))\n\n return max_length\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"45"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n max_len = -1\n for i in range(len(strs)):\n is_uncommon = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n is_uncommon = False\n break\n if is_uncommon:\n max_len = max(max_len, len(strs[i]))\n\n return max_len\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"46"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n strs.sort(key=len, reverse=True) # Sort strings by length in descending order\n max_length = -1\n\n for i in range(len(strs)):\n check = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n check = False\n break\n if check:\n max_length = max(max_length, len(strs[i]))\n\n return max_length\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"46"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n # find the longest unique word form the strs\n\n uniques = []\n duplicates = []\n\n print(sorted(strs, key=lambda x : -len(x)))\n\n for word in sorted(strs, key=lambda x : -len(x)):\n # check duplication\n if word in duplicates:\n continue\n elif word in uniques:\n uniques.remove(word)\n duplicates.append(word)\n elif any([self.isSubsequence(word, s) for s in duplicates]):\n continue\n else:\n uniques.append(word)\n \n print(uniques, duplicates)\n\n return max([len(w) for w in uniques]) if len(uniques) > 0 else -1\n \n def isSubsequence(self, word: str, s: str) -> bool:\n it = iter(s)\n return all(char in it for char in word)","runtime":"47"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n # Sort the strings first by length in descending order\n strs.sort(key=lambda x: -len(x))\n \n def is_subsequence(a: str, b: str) -> bool:\n it = iter(b)\n return all(char in it for char in a)\n \n for i, word in enumerate(strs):\n # Check if word is a subsequence of any other string longer or equal in length\n if all(not is_subsequence(word, strs[j]) for j in range(len(strs)) if i != j):\n return len(word)\n \n return -1","runtime":"48"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n strs.sort(key=lambda x: len(x), reverse=True)\n def isSub(w1, w2):\n if len(w1) > len(w2):\n return False\n p1 = 0\n for w in w2:\n if p1 < len(w1) and w==w1[p1]:\n p1 += 1\n return p1==len(w1)\n for i, w1 in enumerate(strs):\n if all([not isSub(w1, w2) for j, w2 in enumerate(strs) if i!=j]):\n return len(w1)\n return -1\n \n ","runtime":"49"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def check(s: str, t: str):\n i = j = 0\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1\n j += 1\n return i == len(s)\n\n ans = -1\n for i, s in enumerate(strs):\n for j, t in enumerate(strs):\n if i != j and check(s, t):\n break\n else:\n ans = max(ans, len(s))\n return ans","runtime":"50"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s1, s2):\n # Check if s1 is a subsequence of s2\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i += 1\n j += 1\n return i == len(s1)\n\n max_len = -1\n for i in range(len(strs)):\n is_unique = True\n for j in range(len(strs)):\n if i != j and is_subsequence(strs[i], strs[j]):\n is_unique = False\n break\n if is_unique:\n max_len = max(max_len, len(strs[i]))\n\n return max_len\n\n# Example usage:\nsolution = Solution()\nstrs = [\"aba\", \"cdc\", \"eae\"]\nprint(solution.findLUSlength(strs)) # Output: 3\n\nstrs = [\"aaa\", \"aaa\", \"aa\"]\nprint(solution.findLUSlength(strs)) # Output: -1","runtime":"51"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s: str, t: str) -> bool:\n it = iter(t)\n return all(c in it for c in s)\n\n def is_uncommon(s: str, strs: List[str]) -> bool:\n return sum(is_subsequence(s, other) for other in strs) == 1\n \n # Initialize the length of the longest uncommon subsequence\n longest_length = -1\n \n # Check each string in the list\n for s in strs:\n if is_uncommon(s, strs):\n longest_length = max(longest_length, len(s))\n \n return longest_length\n\n# Example usage\nsolution = Solution()\nprint(solution.findLUSlength([\"aba\", \"cdc\", \"eae\"])) # Output: 3\nprint(solution.findLUSlength([\"aaa\", \"aaa\", \"aa\"])) # Output: -1\n","runtime":"52"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def isSubsequence(word1, word2):\n word2 = iter(word2)\n\n return all(x in word2 for x in word1)\n\n for x in sorted(strs, key = len, reverse = True):\n if sum(isSubsequence(x, y) for y in strs) == 1:\n return len(x)\n\n return -1","runtime":"54"},{"code":"class Solution:\n def findLUSlength(self, strs):\n max_length = 0\n s = set()\n n = len(strs)\n\n for i in range(n):\n for j in range(n):\n if i != j:\n if self.is_subsequence(strs[i], strs[j]):\n s.add(strs[i])\n if self.is_subsequence(strs[j], strs[i]):\n s.add(strs[j])\n \n for string in strs:\n if string not in s:\n max_length = max(max_length, len(string))\n \n return max_length if max_length != 0 else -1\n\n def is_subsequence(self, x, y):\n it = iter(y)\n return all(c in it for c in x)","runtime":"63"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n \"\"\"\n\n array of strs, return length of lengnth of longest\n uncommon subquence\n sub sequence in *one* array but NOT another\n\n \"\"\"\n\n # brute force: \n # get every possible subsequence in a dict\n # return all subsequences that are count value of \n\n ## Recursion:\n def subsequences(s):\n if not s:\n return [\"\"]\n\n # Recursive case: get all subsequences of the string except first char\n smaller_subsequences = subsequences(s[1:])\n \n # Add the first c\n return(smaller_subsequences + [s[0] + subsequence for \n subsequence in smaller_subsequences])\n\n d = {}\n for s in strs:\n subs = subsequences(s)\n for sub in subs:\n d[sub] = d.get(sub,0) + 1\n \n max_length = -1\n for k,v in d.items():\n if v == 1:\n max_length = max([max_length,len(k)])\n\n return(max_length)\n ","runtime":"95"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def subseqgen(s: str, i: int = 0):\n if i == len(s):\n yield \"\"\n else:\n for x in subseqgen(s, i + 1):\n yield x\n yield s[i] + x\n\n subseqs = collections.defaultdict(int)\n for s in strs:\n for ss in subseqgen(s):\n subseqs[ss] += 1\n length = -1\n for ss, count in subseqs.items():\n if count == 1:\n length = max(length, len(ss))\n return length\n","runtime":"117"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n subs=defaultdict(int)\n def backtrack(i,curr):\n if i==len(s):\n subs[curr]+=1\n return\n backtrack(i+1,curr+s[i])\n backtrack(i+1,curr)\n for s in strs:\n backtrack(0,\"\")\n res=\"\"\n for sub in subs:\n if subs[sub]==1:\n if len(sub)>len(res):\n res=sub\n return len(res) if res else -1\n\n\n ","runtime":"122"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n lookup = defaultdict(int)\n\n def calc(s):\n\n def option(index, cur):\n if index == len(s):\n if cur != \"\":\n lookup[cur] += 1\n return\n option(index + 1, cur)\n option(index + 1, cur + s[index])\n option(0, \"\")\n \n\n\n for s in strs:\n calc(s)\n\n\n options = lookup.items()\n \n ans = []\n\n for u, v in options:\n if v == 1:\n ans.append(u)\n if not ans: return -1\n\n mx = max(len(c) for c in ans)\n return mx","runtime":"125"},{"code":"def LCS(word1, word2):\n n1 = len(word1)\n n2 = len(word2)\n L = [[0 for _ in range(n2+1)] for _ in range(n1+1)]\n\n for i in range(1, n1+1):\n for j in range(1, n2+1):\n if word1[i-1] == word2[j-1]:\n L[i][j] = L[i-1][j-1] + 1\n else:\n L[i][j] = max(L[i][j-1], L[i-1][j])\n return L[n1][n2]\n\n\nclass Solution:\n def findLUSlength(self, strs):\n strs = sorted(strs, key=lambda x: len(x), reverse=True)\n for i in range(len(strs)):\n k, x = -1, len(strs[i])\n for j in range(len(strs)):\n if i == j:\n continue\n l = LCS(strs[i], strs[j])\n if l > k:\n k = l\n if k != x:\n return x\n return -1","runtime":"134"},{"code":"class Solution:\n\n def sub(self,s,i,temp,d):\n if(i==len(s)):\n d[temp[:]]=d.get(temp[:],0)+1\n return \n self.sub(s,i+1,temp+s[i],d)\n self.sub(s,i+1,temp,d)\n return \n\n def findLUSlength(self, strs: List[str]) -> int:\n d={}\n for s in strs:\n self.sub(s,0,\"\",d)\n ans=-1\n for a,b in d.items():\n if(b>1):continue\n ans=max(ans,len(a))\n return ans","runtime":"135"}],"string":"[\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def isSubsequence(a: str, b: str) -> bool:\\n i = 0\\n for char in b:\\n if i < len(a) and a[i] == char:\\n i += 1\\n return i == len(a)\\n \\n strs.sort(key=lambda s: -len(s))\\n \\n for i, s in enumerate(strs):\\n # 检查当前字符串是否是其他所有字符串的子序列\\n is_subsequence = True\\n for j in range(len(strs)):\\n if j != i and isSubsequence(s, strs[j]):\\n is_subsequence = False\\n break\\n if is_subsequence:\\n return len(s)\\n \\n return -1\\n\\n# 示例使用\\nsolution = Solution()\\nprint(solution.findLUSlength([\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"])) # 输出应该是 3\\n\",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def isSubsequence(a: str, b: str) -> bool:\\n i = 0\\n for char in b:\\n if i < len(a) and a[i] == char:\\n i += 1\\n return i == len(a)\\n \\n strs.sort(key=lambda s: -len(s))\\n \\n for i, s in enumerate(strs):\\n if all(not isSubsequence(s, strs[j]) for j in range(len(strs)) if j != i):\\n return len(s)\\n \\n return -1\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def isSubsequence(a: str, b: str) -> bool:\\n i = 0\\n for char in b:\\n if i < len(a) and a[i] == char:\\n i += 1\\n return i == len(a)\\n \\n strs.sort(key=lambda s: -len(s))\\n \\n for i, s in enumerate(strs):\\n if all(not isSubsequence(s, strs[j]) for j in range(len(strs)) if j != i):\\n return len(s)\\n \\n return -1\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def isSubsequence(a: str, b: str) -> bool:\\n i = 0\\n j = 0\\n\\n while i < len(a) and j < len(b):\\n if a[i] == b[j]:\\n i += 1\\n j += 1\\n\\n return i == len(a)\\n\\n seen = set()\\n duplicates = set()\\n\\n for s in strs:\\n if s in seen:\\n duplicates.add(s)\\n seen.add(s)\\n\\n strs.sort(key=lambda s: -len(s))\\n\\n for i in range(len(strs)):\\n if strs[i] in duplicates:\\n continue\\n isASubsequence = False\\n for j in range(i):\\n isASubsequence |= isSubsequence(strs[i], strs[j])\\n if not isASubsequence:\\n return len(strs[i])\\n\\n return -1\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n strs.sort(key=lambda x:(len(x), x), reverse=True)\\n idx = 0\\n \\n def is_sub(a, b):\\n p = a.find(b[0])\\n if p == -1:\\n return False\\n if len(b) == 1:\\n return True\\n return is_sub(a[p+1:], b[1:])\\n\\n while idx < len(strs):\\n while idx < len(strs)-1 and strs[idx] == strs[idx+1]:\\n idx += 1\\n if not idx or not any(is_sub(strs[x], strs[idx]) for x in range(idx)):\\n return len(strs[idx])\\n elif idx == len(strs) - 1:\\n return -1\\n else:\\n idx += 1\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_seq(a, b):\\n j = 0\\n for i in range(len(b)):\\n if a[j] == b[i]:\\n j += 1\\n if j == len(a):\\n return True\\n \\n return False\\n\\n d = defaultdict(int)\\n for s in strs:\\n d[s] += 1\\n \\n strs.sort(key=len, reverse=True)\\n ans = -1\\n if d[strs[0]] == 1:\\n return len(strs[0])\\n\\n for i in range(len(strs)):\\n if d[strs[i]] > 1:\\n continue\\n if not any(is_seq(strs[i], strs[j]) for j in range(i)): \\n return len(strs[i])\\n return -1\\n\\n\\n\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n # def isSubseq(a, b):\\n # j = 0\\n # for i in range(len(b)):\\n # if a[j] == b[i]:\\n # j += 1\\n # if j == len(a):\\n # return True\\n # return False\\n\\n \\n # c = Counter(strs)\\n # s = sorted(c.keys(), key=len, reverse=True)\\n # print(c)\\n # print(s)\\n\\n # for i in range(len(s)):\\n # if c[s[i]] > 1:\\n # continue\\n # if i == 0 or not any(isSubseq(s[i], s[j]) for j in range(i)): \\n # return len(s[i])\\n # return -1\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n # word_map = defaultdict(int)\\n\\n # for word in strs:\\n # n = len(word)\\n # for i in range(1 << n):\\n # temp = []\\n # for j in range(n):\\n # if (i >> j) & 1:\\n # temp.append(word[j])\\n # word_map[''.join(temp)] += 1\\n # maxi = 0\\n # for key, val in word_map.items():\\n # if val == 1:\\n # maxi = max(maxi, len(key))\\n \\n # return maxi if maxi > 0 else -1\\n\\n def is_subsequence(s1, s2):\\n it = iter(s2)\\n return all(char in it for char in s1)\\n \\n strs.sort(key=len, reverse=True)\\n \\n for i, s1 in enumerate(strs):\\n if all(not is_subsequence(s1, s2) for j, s2 in enumerate(strs) if i != j):\\n return len(s1)\\n \\n return -1\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n \\n\\n def isSub(t, s):\\n s1 = 0\\n t1 = 0\\n\\n # Iterate while there are characters left to check in both s and t\\n while t1 < len(t) and s1 < len(s):\\n if s[s1] == t[t1]:\\n t1 += 1 # Move to the next character in t if we have a match\\n s1 += 1 # Always move to the next character in s\\n\\n # If we've matched all characters of t, t is a subsequence of s\\n return t1 == len(t)\\n\\n\\n\\n\\n\\n\\n\\n strs.sort(key=lambda x: -len(x))\\n print(strs)\\n\\n\\n for i, word in enumerate(strs):\\n found = True\\n for j in range(len(strs)):\\n\\n if i != j and isSub(word, strs[j]):\\n found = False\\n break\\n\\n if found:\\n return len(word)\\n\\n return -1\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def isSubseq(a, b):\\n j = 0\\n for i in range(len(b)):\\n if a[j] == b[i]:\\n j += 1\\n if j == len(a):\\n return True\\n return False\\n c = Counter(strs)\\n s = sorted(c.keys(), key=len, reverse=True)\\n for i in range(len(s)):\\n if c[s[i]] > 1:\\n continue\\n if i == 0 or not any(isSubseq(s[i], s[j]) for j in range(i)): \\n return len(s[i])\\n return -1\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1: str, s2: str) -> bool:\\n \\\"\\\"\\\"Returns True if s1 is a subsequence of s2, else False\\\"\\\"\\\"\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n \\n strs.sort(key=len, reverse=True)\\n \\n # Iterate over each string in the sorted list\\n for i, s in enumerate(strs):\\n is_uncommon = True\\n # Check if s is a subsequence of any other string\\n for j, t in enumerate(strs):\\n if i != j and is_subsequence(s, t):\\n is_uncommon = False\\n break\\n # If it's not a subsequence of any other string, return its length\\n if is_uncommon:\\n return len(s)\\n \\n # If no uncommon subsequence is found\\n return -1\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n # Sort the strings by length in descending order\\n strs.sort(key=len, reverse=True)\\n\\n # Check each string if it is an uncommon subsequence\\n for i in range(len(strs)):\\n mismatch_count = 0\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n mismatch_count += 1\\n break\\n if mismatch_count == 0:\\n return len(strs[i])\\n\\n return -1\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def subseq(w1, w2):\\n if len(w1) > len(w2):\\n return False\\n i = 0\\n for c in w2:\\n if i < len(w1) and w1[i] == c:\\n i += 1\\n return i == len(w1)\\n \\n strs.sort(key = len, reverse = True)\\n for i, word1 in enumerate(strs):\\n if all(not subseq(word1, word2) \\n for j, word2 in enumerate(strs) if i != j): \\n return len(word1)\\n return -1\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n max_length = -1\\n for i in range(len(strs)):\\n is_uncommon = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n is_uncommon = False\\n break\\n if is_uncommon:\\n max_length = max(max_length, len(strs[i]))\\n\\n return max_length\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n \\n # Sort the strings by length in descending order\\n strs.sort(key=len, reverse=True)\\n \\n # Check each string if it is an uncommon subsequence\\n for i in range(len(strs)):\\n all_subsequence = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n all_subsequence = False\\n break\\n if all_subsequence:\\n return len(strs[i])\\n \\n return -1\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n \\n def is_subsequence(self, s1: str, s2: str) -> bool:\\n \\\"\\\"\\\"Check if s1 is a subsequence of s2.\\\"\\\"\\\"\\n it = iter(s2) # Create an iterator for s2\\n return all(char in it for char in s1) # Check if each char in s1 is in the iterator\\n \\n def findLUSlength(self, strs: list[str]) -> int:\\n # Sort strings by length in descending order\\n strs.sort(key=len, reverse=True)\\n \\n for i, s1 in enumerate(strs):\\n if all(not self.is_subsequence(s1, s2) for j, s2 in enumerate(strs) if i != j):\\n return len(s1)\\n \\n return -1\\n\\n\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def subseq(w1, w2):\\n if len(w1) > len(w2):\\n return False\\n i = 0\\n for c in w2:\\n if i < len(w1) and w1[i] == c:\\n i += 1\\n return i == len(w1)\\n \\n strs.sort(key = len, reverse = True)\\n for i, word1 in enumerate(strs):\\n if all(not subseq(word1, word2) \\n for j, word2 in enumerate(strs) if i != j): \\n return len(word1)\\n return -1\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, words):\\n def isSubsequence(s, t):\\n t = iter(t)\\n return all(c in t for c in s)\\n \\n words.sort(key = lambda x:-len(x))\\n for i, word in enumerate(words):\\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \\n return len(word)\\n \\n return -1\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n # Sort strings by length in descending order\\n strs.sort(key=len, reverse=True)\\n\\n longest_uncommon_length = -1\\n for i in range(len(strs)):\\n check = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n check = False\\n break\\n if check:\\n longest_uncommon_length = max(longest_uncommon_length, len(strs[i]))\\n\\n return longest_uncommon_length\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n strs.sort(key=len, reverse=True)\\n #only compare str with bigger or equal length\\n for i, s in enumerate(strs):\\n #check if current str can be uncommon seq\\n ans, is_candidate = len(s), True\\n for j in range(len(strs)):\\n if j == i: continue\\n if len(strs[j]) < ans:\\n return ans\\n if self.is_sub(strs[j], s):\\n is_candidate = False\\n break\\n if is_candidate: return ans\\n return -1\\n\\n #check if sub is a substring of string s\\n def is_sub(self, s: str, sub: str) -> bool:\\n j = 0\\n for i in range(len(s)):\\n if j == len(sub): return True\\n if s[i] == sub[j]: j += 1\\n return j == len(sub)\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n \\n def is_subsequence(a: str, b: str) -> bool:\\n i = j = 0\\n while i < len(a) and j < len(b):\\n if a[i] == b[j]:\\n j += 1\\n i += 1\\n return j == len(b)\\n \\n num_strings = len(strs)\\n longest_unique_length = -1\\n\\n for i in range(num_strings):\\n j = 0\\n\\n while j < num_strings:\\n if i == j or not is_subsequence(strs[j], strs[i]):\\n j += 1\\n else:\\n break\\n if j == num_strings:\\n longest_unique_length = max(longest_unique_length, len(strs[i]))\\n\\n return longest_unique_length\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n\\n def subseq(w1, w2):\\n if len(w1)>len(w2):\\n return False\\n i=0\\n for c in w2:\\n if i<len(w1) and w1[i]==c:\\n i+=1\\n return i==len(w1)\\n\\n strs.sort(key=len, reverse=True)\\n for i, word1 in enumerate(strs):\\n if all(not subseq(word1, word2) for j, word2 in enumerate(strs) if i!=j):\\n return len(word1)\\n return -1\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n # given two strings, the longest uncommon subsequence is either the longer string\\n # or the entire string if they have the same length but are different\\n def isSubsequence(a, b):\\n if len(a) > len(b):\\n return False\\n elif len(a) == len(b):\\n return a == b\\n else:\\n i = 0\\n for j in b:\\n if j == a[i]:\\n i += 1\\n if i == len(a):\\n return True\\n return i == len(a)\\n \\n strs = sorted(strs, key=len, reverse=True)\\n for i in range(len(strs)):\\n if all(not isSubsequence(strs[i], strs[j]) for j in range(len(strs)) if i != j):\\n return len(strs[i])\\n return -1\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, words):\\n def isSubsequence(s, t):\\n t = iter(t)\\n return all(c in t for c in s)\\n \\n words.sort(key = lambda x:-len(x))\\n for i, word in enumerate(words):\\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \\n return len(word)\\n \\n return -1\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isSub(self, a, b):\\n i=0\\n for j in range(len(b)):\\n if b[j]==a[i]:\\n i+=1\\n if i==len(a):\\n break\\n return i==len(a)\\n\\n def findLUSlength(self, strs: List[str]) -> int:\\n count_str=dict()\\n for st in strs:\\n if st in count_str:\\n count_str[st]+=1\\n else:\\n count_str[st]=1\\n \\n un_strs = [(i, count_str[i]) for i in count_str.keys()]\\n un_strs = sorted(un_strs, key=lambda x: len(x[0]))\\n for i in range(len(un_strs)-1, -1, -1):\\n if un_strs[i][1]>1:\\n continue\\n flag=False\\n for j in range(i+1, len(un_strs)):\\n if self.isSub(un_strs[i][0], un_strs[j][0]):\\n flag=True\\n if not flag:\\n return len(un_strs[i][0])\\n return -1\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Helper function to check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n max_length = -1\\n for i in range(len(strs)):\\n is_uncommon = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n is_uncommon = False\\n break\\n if is_uncommon:\\n max_length = max(max_length, len(strs[i]))\\n\\n return max_length\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n max_len = -1\\n for i in range(len(strs)):\\n is_uncommon = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n is_uncommon = False\\n break\\n if is_uncommon:\\n max_len = max(max_len, len(strs[i]))\\n\\n return max_len\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n strs.sort(key=len, reverse=True) # Sort strings by length in descending order\\n max_length = -1\\n\\n for i in range(len(strs)):\\n check = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n check = False\\n break\\n if check:\\n max_length = max(max_length, len(strs[i]))\\n\\n return max_length\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n # find the longest unique word form the strs\\n\\n uniques = []\\n duplicates = []\\n\\n print(sorted(strs, key=lambda x : -len(x)))\\n\\n for word in sorted(strs, key=lambda x : -len(x)):\\n # check duplication\\n if word in duplicates:\\n continue\\n elif word in uniques:\\n uniques.remove(word)\\n duplicates.append(word)\\n elif any([self.isSubsequence(word, s) for s in duplicates]):\\n continue\\n else:\\n uniques.append(word)\\n \\n print(uniques, duplicates)\\n\\n return max([len(w) for w in uniques]) if len(uniques) > 0 else -1\\n \\n def isSubsequence(self, word: str, s: str) -> bool:\\n it = iter(s)\\n return all(char in it for char in word)\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n # Sort the strings first by length in descending order\\n strs.sort(key=lambda x: -len(x))\\n \\n def is_subsequence(a: str, b: str) -> bool:\\n it = iter(b)\\n return all(char in it for char in a)\\n \\n for i, word in enumerate(strs):\\n # Check if word is a subsequence of any other string longer or equal in length\\n if all(not is_subsequence(word, strs[j]) for j in range(len(strs)) if i != j):\\n return len(word)\\n \\n return -1\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n strs.sort(key=lambda x: len(x), reverse=True)\\n def isSub(w1, w2):\\n if len(w1) > len(w2):\\n return False\\n p1 = 0\\n for w in w2:\\n if p1 < len(w1) and w==w1[p1]:\\n p1 += 1\\n return p1==len(w1)\\n for i, w1 in enumerate(strs):\\n if all([not isSub(w1, w2) for j, w2 in enumerate(strs) if i!=j]):\\n return len(w1)\\n return -1\\n \\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def check(s: str, t: str):\\n i = j = 0\\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n return i == len(s)\\n\\n ans = -1\\n for i, s in enumerate(strs):\\n for j, t in enumerate(strs):\\n if i != j and check(s, t):\\n break\\n else:\\n ans = max(ans, len(s))\\n return ans\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s1, s2):\\n # Check if s1 is a subsequence of s2\\n i, j = 0, 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i += 1\\n j += 1\\n return i == len(s1)\\n\\n max_len = -1\\n for i in range(len(strs)):\\n is_unique = True\\n for j in range(len(strs)):\\n if i != j and is_subsequence(strs[i], strs[j]):\\n is_unique = False\\n break\\n if is_unique:\\n max_len = max(max_len, len(strs[i]))\\n\\n return max_len\\n\\n# Example usage:\\nsolution = Solution()\\nstrs = [\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"]\\nprint(solution.findLUSlength(strs)) # Output: 3\\n\\nstrs = [\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"]\\nprint(solution.findLUSlength(strs)) # Output: -1\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s: str, t: str) -> bool:\\n it = iter(t)\\n return all(c in it for c in s)\\n\\n def is_uncommon(s: str, strs: List[str]) -> bool:\\n return sum(is_subsequence(s, other) for other in strs) == 1\\n \\n # Initialize the length of the longest uncommon subsequence\\n longest_length = -1\\n \\n # Check each string in the list\\n for s in strs:\\n if is_uncommon(s, strs):\\n longest_length = max(longest_length, len(s))\\n \\n return longest_length\\n\\n# Example usage\\nsolution = Solution()\\nprint(solution.findLUSlength([\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"])) # Output: 3\\nprint(solution.findLUSlength([\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"])) # Output: -1\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def isSubsequence(word1, word2):\\n word2 = iter(word2)\\n\\n return all(x in word2 for x in word1)\\n\\n for x in sorted(strs, key = len, reverse = True):\\n if sum(isSubsequence(x, y) for y in strs) == 1:\\n return len(x)\\n\\n return -1\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs):\\n max_length = 0\\n s = set()\\n n = len(strs)\\n\\n for i in range(n):\\n for j in range(n):\\n if i != j:\\n if self.is_subsequence(strs[i], strs[j]):\\n s.add(strs[i])\\n if self.is_subsequence(strs[j], strs[i]):\\n s.add(strs[j])\\n \\n for string in strs:\\n if string not in s:\\n max_length = max(max_length, len(string))\\n \\n return max_length if max_length != 0 else -1\\n\\n def is_subsequence(self, x, y):\\n it = iter(y)\\n return all(c in it for c in x)\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n \\\"\\\"\\\"\\n\\n array of strs, return length of lengnth of longest\\n uncommon subquence\\n sub sequence in *one* array but NOT another\\n\\n \\\"\\\"\\\"\\n\\n # brute force: \\n # get every possible subsequence in a dict\\n # return all subsequences that are count value of \\n\\n ## Recursion:\\n def subsequences(s):\\n if not s:\\n return [\\\"\\\"]\\n\\n # Recursive case: get all subsequences of the string except first char\\n smaller_subsequences = subsequences(s[1:])\\n \\n # Add the first c\\n return(smaller_subsequences + [s[0] + subsequence for \\n subsequence in smaller_subsequences])\\n\\n d = {}\\n for s in strs:\\n subs = subsequences(s)\\n for sub in subs:\\n d[sub] = d.get(sub,0) + 1\\n \\n max_length = -1\\n for k,v in d.items():\\n if v == 1:\\n max_length = max([max_length,len(k)])\\n\\n return(max_length)\\n \",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def subseqgen(s: str, i: int = 0):\\n if i == len(s):\\n yield \\\"\\\"\\n else:\\n for x in subseqgen(s, i + 1):\\n yield x\\n yield s[i] + x\\n\\n subseqs = collections.defaultdict(int)\\n for s in strs:\\n for ss in subseqgen(s):\\n subseqs[ss] += 1\\n length = -1\\n for ss, count in subseqs.items():\\n if count == 1:\\n length = max(length, len(ss))\\n return length\\n\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n subs=defaultdict(int)\\n def backtrack(i,curr):\\n if i==len(s):\\n subs[curr]+=1\\n return\\n backtrack(i+1,curr+s[i])\\n backtrack(i+1,curr)\\n for s in strs:\\n backtrack(0,\\\"\\\")\\n res=\\\"\\\"\\n for sub in subs:\\n if subs[sub]==1:\\n if len(sub)>len(res):\\n res=sub\\n return len(res) if res else -1\\n\\n\\n \",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n lookup = defaultdict(int)\\n\\n def calc(s):\\n\\n def option(index, cur):\\n if index == len(s):\\n if cur != \\\"\\\":\\n lookup[cur] += 1\\n return\\n option(index + 1, cur)\\n option(index + 1, cur + s[index])\\n option(0, \\\"\\\")\\n \\n\\n\\n for s in strs:\\n calc(s)\\n\\n\\n options = lookup.items()\\n \\n ans = []\\n\\n for u, v in options:\\n if v == 1:\\n ans.append(u)\\n if not ans: return -1\\n\\n mx = max(len(c) for c in ans)\\n return mx\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"def LCS(word1, word2):\\n n1 = len(word1)\\n n2 = len(word2)\\n L = [[0 for _ in range(n2+1)] for _ in range(n1+1)]\\n\\n for i in range(1, n1+1):\\n for j in range(1, n2+1):\\n if word1[i-1] == word2[j-1]:\\n L[i][j] = L[i-1][j-1] + 1\\n else:\\n L[i][j] = max(L[i][j-1], L[i-1][j])\\n return L[n1][n2]\\n\\n\\nclass Solution:\\n def findLUSlength(self, strs):\\n strs = sorted(strs, key=lambda x: len(x), reverse=True)\\n for i in range(len(strs)):\\n k, x = -1, len(strs[i])\\n for j in range(len(strs)):\\n if i == j:\\n continue\\n l = LCS(strs[i], strs[j])\\n if l > k:\\n k = l\\n if k != x:\\n return x\\n return -1\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n\\n def sub(self,s,i,temp,d):\\n if(i==len(s)):\\n d[temp[:]]=d.get(temp[:],0)+1\\n return \\n self.sub(s,i+1,temp+s[i],d)\\n self.sub(s,i+1,temp,d)\\n return \\n\\n def findLUSlength(self, strs: List[str]) -> int:\\n d={}\\n for s in strs:\\n self.sub(s,0,\\\"\\\",d)\\n ans=-1\\n for a,b in d.items():\\n if(b>1):continue\\n ans=max(ans,len(a))\\n return ans\",\n \"runtime\": \"135\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":41,"string":"41"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findLUSlength(self, words):\n def isSubsequence(s, t):\n t = iter(t)\n return all(c in t for c in s)\n \n words.sort(key = lambda x:-len(x))\n for i, word in enumerate(words):\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \n return len(word)\n \n return -1","memory":"16200"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n strs.sort(key=len, reverse=True)\n #only compare str with bigger or equal length\n for i, s in enumerate(strs):\n #check if current str can be uncommon seq\n ans, is_candidate = len(s), True\n for j in range(len(strs)):\n if j == i: continue\n if len(strs[j]) < ans:\n return ans\n if self.is_sub(strs[j], s):\n is_candidate = False\n break\n if is_candidate: return ans\n return -1\n\n #check if sub is a substring of string s\n def is_sub(self, s: str, sub: str) -> bool:\n j = 0\n for i in range(len(s)):\n if j == len(sub): return True\n if s[i] == sub[j]: j += 1\n return j == len(sub)","memory":"16300"},{"code":"class Solution:\n def findLUSlength(self, words):\n def isSubsequence(s, t):\n t = iter(t)\n return all(c in t for c in s)\n \n words.sort(key = lambda x:-len(x))\n for i, word in enumerate(words):\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \n return len(word)\n \n return -1","memory":"16400"},{"code":"class Solution:\n def isSub(self, a, b):\n i=0\n for j in range(len(b)):\n if b[j]==a[i]:\n i+=1\n if i==len(a):\n break\n return i==len(a)\n\n def findLUSlength(self, strs: List[str]) -> int:\n count_str=dict()\n for st in strs:\n if st in count_str:\n count_str[st]+=1\n else:\n count_str[st]=1\n \n un_strs = [(i, count_str[i]) for i in count_str.keys()]\n un_strs = sorted(un_strs, key=lambda x: len(x[0]))\n for i in range(len(un_strs)-1, -1, -1):\n if un_strs[i][1]>1:\n continue\n flag=False\n for j in range(i+1, len(un_strs)):\n if self.isSub(un_strs[i][0], un_strs[j][0]):\n flag=True\n if not flag:\n return len(un_strs[i][0])\n return -1\n","memory":"16500"},{"code":"from typing import List\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n def is_subsequence(s: str, t: str) -> bool:\n it = iter(t)\n return all(c in it for c in s)\n\n def is_uncommon(s: str, strs: List[str]) -> bool:\n return sum(is_subsequence(s, other) for other in strs) == 1\n \n # Initialize the length of the longest uncommon subsequence\n longest_length = -1\n \n # Check each string in the list\n for s in strs:\n if is_uncommon(s, strs):\n longest_length = max(longest_length, len(s))\n \n return longest_length\n\n# Example usage\nsolution = Solution()\nprint(solution.findLUSlength([\"aba\", \"cdc\", \"eae\"])) # Output: 3\nprint(solution.findLUSlength([\"aaa\", \"aaa\", \"aa\"])) # Output: -1\n","memory":"16500"},{"code":"class Solution:\n \n def is_subsequence(self, s1: str, s2: str) -> bool:\n \"\"\"Check if s1 is a subsequence of s2.\"\"\"\n it = iter(s2) # Create an iterator for s2\n return all(char in it for char in s1) # Check if each char in s1 is in the iterator\n \n def findLUSlength(self, strs: list[str]) -> int:\n # Sort strings by length in descending order\n strs.sort(key=len, reverse=True)\n \n for i, s1 in enumerate(strs):\n if all(not self.is_subsequence(s1, s2) for j, s2 in enumerate(strs) if i != j):\n return len(s1)\n \n return -1\n\n","memory":"16600"},{"code":"from collections import Counter\n\nclass Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n counts = Counter(strs)\n strs = sorted(list(set(strs)), key = lambda x : len(x), reverse=True)\n\n def check(i):\n target = strs[i]\n cur = 0\n\n for j in range(i):\n for char in strs[j]:\n if char == target[cur]:\n cur += 1\n\n if cur == len(target):\n return False\n\n cur = 0\n\n return True\n\n for i in range(len(strs)):\n if counts[strs[i]] == 1 and check(i):\n return len(strs[i])\n\n return -1\n\n","memory":"16700"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n res = -1\n for i, a in enumerate(strs):\n isUncommon = True\n for j, b in enumerate(strs):\n if i == j:\n continue\n p = 0\n for q, ch in enumerate(b):\n if a[p] == ch:\n p += 1\n if p == len(a):\n isUncommon = False\n break\n if not isUncommon:\n break\n if isUncommon:\n res = max(res, len(a))\n return res","memory":"16700"},{"code":"def LCS(word1, word2):\n n1 = len(word1)\n n2 = len(word2)\n L = [[0 for _ in range(n2+1)] for _ in range(n1+1)]\n\n for i in range(1, n1+1):\n for j in range(1, n2+1):\n if word1[i-1] == word2[j-1]:\n L[i][j] = L[i-1][j-1] + 1\n else:\n L[i][j] = max(L[i][j-1], L[i-1][j])\n return L[n1][n2]\n\n\nclass Solution:\n def findLUSlength(self, strs):\n strs = sorted(strs, key=lambda x: len(x), reverse=True)\n lcs = {}\n for i in range(len(strs)):\n k, x = -1, len(strs[i])\n for j in range(len(strs)):\n if i == j:\n continue\n lcs[(i, j)] = l =lcs.get((i, j), LCS(strs[i], strs[j]))\n lcs[(j, i)] = l\n if l > k:\n k = l\n if k != x:\n return x\n return -1","memory":"16800"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n \n mval = len(max(strs, key = lambda x : len(x)))\n co = 0\n freq = Counter()\n\n for s in strs:\n if len(s) == mval:\n co += 1\n freq[s] += 1\n \n \n # if co == 1:\n # return mval\n\n for k, v in freq.items():\n if v == 1:\n return len(k)\n \n\n \n\n def generateSubSeq(i, j, k):\n nonlocal res, pick\n\n if k == 0:\n subseq = ''.join(pick)\n res[subseq].add(i)\n return\n\n if j >= len(strs[i]):\n return\n \n pick.append(strs[i][j])\n generateSubSeq(i, j + 1, k - 1)\n pick.pop()\n\n generateSubSeq(i, j + 1, k)\n \n for solution in range(mval, 0, -1):\n \n res = defaultdict(set)\n pick = []\n\n for idx, word in enumerate(strs):\n generateSubSeq(idx, 0, solution)\n\n for k, v in res.items():\n if len(v) == 1:\n return solution\n \n return -1\n\n # O(size * (2 ** size) * n)\n\n # 3 3 3 3 2 2 1\n # aba\n # aba\n # cba\n # abc\n\n \n\n \n\n \n\n ","memory":"18800"},{"code":"class Solution:\n def findLUSlength(self, strs: List[str]) -> int:\n \n mval = len(max(strs, key = lambda x : len(x)))\n co = 0\n\n for s in strs:\n if len(s) == mval:\n co += 1\n if co > 1:\n break\n \n if co == 1:\n return mval\n \n\n def generateSubSeq(i, j, k):\n nonlocal res, pick\n\n if k == 0:\n subseq = ''.join(pick)\n res[subseq].add(i)\n return\n\n if j >= len(strs[i]):\n return\n \n pick.append(strs[i][j])\n generateSubSeq(i, j + 1, k - 1)\n pick.pop()\n\n generateSubSeq(i, j + 1, k)\n \n for solution in range(mval, 0, -1):\n \n res = defaultdict(set)\n pick = []\n\n for idx, word in enumerate(strs):\n generateSubSeq(idx, 0, solution)\n\n for k, v in res.items():\n if len(v) == 1:\n return solution\n \n return -1\n\n \n\n \n\n \n\n ","memory":"18900"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, words):\\n def isSubsequence(s, t):\\n t = iter(t)\\n return all(c in t for c in s)\\n \\n words.sort(key = lambda x:-len(x))\\n for i, word in enumerate(words):\\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \\n return len(word)\\n \\n return -1\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n strs.sort(key=len, reverse=True)\\n #only compare str with bigger or equal length\\n for i, s in enumerate(strs):\\n #check if current str can be uncommon seq\\n ans, is_candidate = len(s), True\\n for j in range(len(strs)):\\n if j == i: continue\\n if len(strs[j]) < ans:\\n return ans\\n if self.is_sub(strs[j], s):\\n is_candidate = False\\n break\\n if is_candidate: return ans\\n return -1\\n\\n #check if sub is a substring of string s\\n def is_sub(self, s: str, sub: str) -> bool:\\n j = 0\\n for i in range(len(s)):\\n if j == len(sub): return True\\n if s[i] == sub[j]: j += 1\\n return j == len(sub)\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, words):\\n def isSubsequence(s, t):\\n t = iter(t)\\n return all(c in t for c in s)\\n \\n words.sort(key = lambda x:-len(x))\\n for i, word in enumerate(words):\\n if all(not isSubsequence(word, words[j]) for j in range(len(words)) if j != i): \\n return len(word)\\n \\n return -1\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isSub(self, a, b):\\n i=0\\n for j in range(len(b)):\\n if b[j]==a[i]:\\n i+=1\\n if i==len(a):\\n break\\n return i==len(a)\\n\\n def findLUSlength(self, strs: List[str]) -> int:\\n count_str=dict()\\n for st in strs:\\n if st in count_str:\\n count_str[st]+=1\\n else:\\n count_str[st]=1\\n \\n un_strs = [(i, count_str[i]) for i in count_str.keys()]\\n un_strs = sorted(un_strs, key=lambda x: len(x[0]))\\n for i in range(len(un_strs)-1, -1, -1):\\n if un_strs[i][1]>1:\\n continue\\n flag=False\\n for j in range(i+1, len(un_strs)):\\n if self.isSub(un_strs[i][0], un_strs[j][0]):\\n flag=True\\n if not flag:\\n return len(un_strs[i][0])\\n return -1\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n def is_subsequence(s: str, t: str) -> bool:\\n it = iter(t)\\n return all(c in it for c in s)\\n\\n def is_uncommon(s: str, strs: List[str]) -> bool:\\n return sum(is_subsequence(s, other) for other in strs) == 1\\n \\n # Initialize the length of the longest uncommon subsequence\\n longest_length = -1\\n \\n # Check each string in the list\\n for s in strs:\\n if is_uncommon(s, strs):\\n longest_length = max(longest_length, len(s))\\n \\n return longest_length\\n\\n# Example usage\\nsolution = Solution()\\nprint(solution.findLUSlength([\\\"aba\\\", \\\"cdc\\\", \\\"eae\\\"])) # Output: 3\\nprint(solution.findLUSlength([\\\"aaa\\\", \\\"aaa\\\", \\\"aa\\\"])) # Output: -1\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n \\n def is_subsequence(self, s1: str, s2: str) -> bool:\\n \\\"\\\"\\\"Check if s1 is a subsequence of s2.\\\"\\\"\\\"\\n it = iter(s2) # Create an iterator for s2\\n return all(char in it for char in s1) # Check if each char in s1 is in the iterator\\n \\n def findLUSlength(self, strs: list[str]) -> int:\\n # Sort strings by length in descending order\\n strs.sort(key=len, reverse=True)\\n \\n for i, s1 in enumerate(strs):\\n if all(not self.is_subsequence(s1, s2) for j, s2 in enumerate(strs) if i != j):\\n return len(s1)\\n \\n return -1\\n\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n counts = Counter(strs)\\n strs = sorted(list(set(strs)), key = lambda x : len(x), reverse=True)\\n\\n def check(i):\\n target = strs[i]\\n cur = 0\\n\\n for j in range(i):\\n for char in strs[j]:\\n if char == target[cur]:\\n cur += 1\\n\\n if cur == len(target):\\n return False\\n\\n cur = 0\\n\\n return True\\n\\n for i in range(len(strs)):\\n if counts[strs[i]] == 1 and check(i):\\n return len(strs[i])\\n\\n return -1\\n\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n res = -1\\n for i, a in enumerate(strs):\\n isUncommon = True\\n for j, b in enumerate(strs):\\n if i == j:\\n continue\\n p = 0\\n for q, ch in enumerate(b):\\n if a[p] == ch:\\n p += 1\\n if p == len(a):\\n isUncommon = False\\n break\\n if not isUncommon:\\n break\\n if isUncommon:\\n res = max(res, len(a))\\n return res\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"def LCS(word1, word2):\\n n1 = len(word1)\\n n2 = len(word2)\\n L = [[0 for _ in range(n2+1)] for _ in range(n1+1)]\\n\\n for i in range(1, n1+1):\\n for j in range(1, n2+1):\\n if word1[i-1] == word2[j-1]:\\n L[i][j] = L[i-1][j-1] + 1\\n else:\\n L[i][j] = max(L[i][j-1], L[i-1][j])\\n return L[n1][n2]\\n\\n\\nclass Solution:\\n def findLUSlength(self, strs):\\n strs = sorted(strs, key=lambda x: len(x), reverse=True)\\n lcs = {}\\n for i in range(len(strs)):\\n k, x = -1, len(strs[i])\\n for j in range(len(strs)):\\n if i == j:\\n continue\\n lcs[(i, j)] = l =lcs.get((i, j), LCS(strs[i], strs[j]))\\n lcs[(j, i)] = l\\n if l > k:\\n k = l\\n if k != x:\\n return x\\n return -1\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n \\n mval = len(max(strs, key = lambda x : len(x)))\\n co = 0\\n freq = Counter()\\n\\n for s in strs:\\n if len(s) == mval:\\n co += 1\\n freq[s] += 1\\n \\n \\n # if co == 1:\\n # return mval\\n\\n for k, v in freq.items():\\n if v == 1:\\n return len(k)\\n \\n\\n \\n\\n def generateSubSeq(i, j, k):\\n nonlocal res, pick\\n\\n if k == 0:\\n subseq = ''.join(pick)\\n res[subseq].add(i)\\n return\\n\\n if j >= len(strs[i]):\\n return\\n \\n pick.append(strs[i][j])\\n generateSubSeq(i, j + 1, k - 1)\\n pick.pop()\\n\\n generateSubSeq(i, j + 1, k)\\n \\n for solution in range(mval, 0, -1):\\n \\n res = defaultdict(set)\\n pick = []\\n\\n for idx, word in enumerate(strs):\\n generateSubSeq(idx, 0, solution)\\n\\n for k, v in res.items():\\n if len(v) == 1:\\n return solution\\n \\n return -1\\n\\n # O(size * (2 ** size) * n)\\n\\n # 3 3 3 3 2 2 1\\n # aba\\n # aba\\n # cba\\n # abc\\n\\n \\n\\n \\n\\n \\n\\n \",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def findLUSlength(self, strs: List[str]) -> int:\\n \\n mval = len(max(strs, key = lambda x : len(x)))\\n co = 0\\n\\n for s in strs:\\n if len(s) == mval:\\n co += 1\\n if co > 1:\\n break\\n \\n if co == 1:\\n return mval\\n \\n\\n def generateSubSeq(i, j, k):\\n nonlocal res, pick\\n\\n if k == 0:\\n subseq = ''.join(pick)\\n res[subseq].add(i)\\n return\\n\\n if j >= len(strs[i]):\\n return\\n \\n pick.append(strs[i][j])\\n generateSubSeq(i, j + 1, k - 1)\\n pick.pop()\\n\\n generateSubSeq(i, j + 1, k)\\n \\n for solution in range(mval, 0, -1):\\n \\n res = defaultdict(set)\\n pick = []\\n\\n for idx, word in enumerate(strs):\\n generateSubSeq(idx, 0, solution)\\n\\n for k, v in res.items():\\n if len(v) == 1:\\n return solution\\n \\n return -1\\n\\n \\n\\n \\n\\n \\n\\n \",\n \"memory\": \"18900\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":11,"string":"11"}}},{"rowIdx":276,"cells":{"question_id":{"kind":"number","value":523,"string":"523"},"name":{"kind":"string","value":"continuous-subarray-sum"},"content":{"kind":"string","value":"<p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>\n\n<p>A <strong>good subarray</strong> is a subarray where:</p>\n\n<ul>\n\t<li>its length is <strong>at least two</strong>, and</li>\n\t<li>the sum of the elements of the subarray is a multiple of <code>k</code>.</li>\n</ul>\n\n<p><strong>Note</strong> that:</p>\n\n<ul>\n\t<li>A <strong>subarray</strong> is a contiguous part of the array.</li>\n\t<li>An integer <code>x</code> is a multiple of <code>k</code> if there exists an integer <code>n</code> such that <code>x = n * k</code>. <code>0</code> is <strong>always</strong> a multiple of <code>k</code>.</li>\n</ul>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [23,<u>2,4</u>,6,7], k = 6\n<strong>Output:</strong> true\n<strong>Explanation:</strong> [2, 4] is a continuous subarray of size 2 whose elements sum up to 6.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [<u>23,2,6,4,7</u>], k = 6\n<strong>Output:</strong> true\n<strong>Explanation:</strong> [23, 2, 6, 4, 7] is an continuous subarray of size 5 whose elements sum up to 42.\n42 is a multiple of 6 because 42 = 7 * 6 and 7 is an integer.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [23,2,6,4,7], k = 13\n<strong>Output:</strong> false\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>\n\t<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>0 <= sum(nums[i]) <= 2<sup>31</sup> - 1</code></li>\n\t<li><code>1 <= k <= 2<sup>31</sup> - 1</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":30.365273076515564,"string":"30.365273"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","math","prefix-sum"],"string":"[\n \"array\",\n \"hash-table\",\n \"math\",\n \"prefix-sum\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"122\", 0.050699999999999995], [\"133\", 0.0508], [\"144\", 0.0338], [\"154\", 0.0169], [\"165\", 0.0338], [\"176\", 0.0508], [\"187\", 0.0338], [\"198\", 0.0169], [\"208\", 0.0508], [\"219\", 0.0846], [\"230\", 0.0508], [\"241\", 0.1015], [\"252\", 0.0846], [\"262\", 0.1184], [\"273\", 0.1015], [\"284\", 0.0846], [\"295\", 0.1692], [\"306\", 0.1523], [\"316\", 0.203], [\"327\", 0.1692], [\"338\", 0.1692], [\"349\", 0.1184], [\"360\", 0.1861], [\"370\", 0.1861], [\"381\", 0.203], [\"392\", 0.3214], [\"403\", 0.4906], [\"414\", 0.2707], [\"424\", 0.3384], [\"435\", 0.3045], [\"446\", 0.4906], [\"457\", 0.4399], [\"468\", 0.5583], [\"478\", 0.3553], [\"489\", 0.3553], [\"500\", 0.4737], [\"511\", 0.5075], [\"522\", 0.3891], [\"532\", 0.4399], [\"543\", 0.4568], [\"554\", 0.3553], [\"565\", 0.4906], [\"576\", 0.4229], [\"586\", 0.4399], [\"597\", 0.406], [\"608\", 0.4737], [\"619\", 0.3384], [\"630\", 0.5075], [\"640\", 0.3214], [\"651\", 0.2876], [\"662\", 0.3722], [\"673\", 0.2876], [\"684\", 0.2876], [\"694\", 0.3553], [\"705\", 0.3722], [\"716\", 0.3384], [\"727\", 0.2368], [\"738\", 0.2199], [\"748\", 0.1015], [\"759\", 0.1523], [\"770\", 0.1523], [\"781\", 0.0677], [\"792\", 0.203], [\"802\", 0.1692], [\"813\", 0.1523], [\"824\", 0.1015], [\"835\", 0.0677], [\"846\", 0.1523], [\"856\", 0.406], [\"867\", 1.3535000000000001], [\"878\", 3.4512], [\"889\", 9.152399999999998], [\"900\", 15.767199999999999], [\"910\", 18.355600000000003], [\"921\", 12.299199999999999], [\"932\", 7.3931], [\"943\", 4.2463999999999995], [\"954\", 2.8762000000000003], [\"964\", 1.8609999999999998], [\"975\", 1.2857]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"30400\", 0.0169], [\"30600\", 0.0338], [\"30700\", 0.0508], [\"31000\", 0.0169], [\"31200\", 0.0338], [\"31300\", 0.0338], [\"31400\", 0.1353], [\"31500\", 0.1015], [\"31600\", 0.812], [\"31700\", 4.4662], [\"31800\", 1.5564], [\"32000\", 0.0508], [\"32100\", 0.0169], [\"32200\", 0.0169], [\"32299\", 0.0338], [\"32400\", 0.0338], [\"32500\", 0.203], [\"32600\", 0.1353], [\"32700\", 0.0169], [\"32800\", 0.0169], [\"32900\", 0.0338], [\"33500\", 0.1353], [\"33600\", 0.2707], [\"33800\", 0.0338], [\"33900\", 0.0846], [\"34000\", 0.1184], [\"34100\", 0.1015], [\"34200\", 0.0338], [\"34300\", 0.0169], [\"34600\", 0.0677], [\"34700\", 0.0338], [\"34800\", 0.0169], [\"34900\", 0.0508], [\"35000\", 0.0508], [\"35100\", 0.0338], [\"35200\", 0.0508], [\"35300\", 0.0338], [\"35400\", 0.1184], [\"35500\", 0.1523], [\"35600\", 0.5752], [\"35700\", 3.7557], [\"35800\", 2.0978], [\"35900\", 0.2538], [\"36000\", 0.5583], [\"36100\", 5.8197], [\"36200\", 33.6322], [\"36300\", 14.6676], [\"36400\", 7.2238], [\"36500\", 10.0998], [\"36600\", 1.6579], [\"36700\", 1.0827], [\"36800\", 0.7613], [\"36900\", 0.1692], [\"37000\", 0.2199], [\"37100\", 0.2707], [\"37200\", 0.3553], [\"37300\", 0.0508], [\"37400\", 0.0169], [\"37500\", 0.0846], [\"37600\", 0.4906], [\"37700\", 1.0827]]}"},"rt_list":{"kind":"list like","value":[{"code":"def checkSubarraySum(nums: List[int], k: int) -> bool:\n d={0:-1}\n ream=0\n\n for i in range(len(nums)):\n ream=(ream+nums[i])%k\n if ream in d:\n if i-d[ream]>=2: return 'true'\n else: d[ream]=i\n\n return 'false'\n\nsys.stdout=open('user.out','w')\nfor nums in map(loads,stdin):\n print(checkSubarraySum(nums,int(stdin.readline())))\nexit()","runtime":"122"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pre = 0\n seen = {0: -1}\n\n for i in range(len(nums)):\n pre = (pre + nums[i]) % k\n\n if pre in seen:\n if i - seen[pre] > 1:\n return \"true\"\n else:\n seen[pre] = i\n\n return \"false\"\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().checkSubarraySum(nums, next(inputs)),file=f)\nexit(0)","runtime":"122"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n sumIndices = {}\n sumIndices[0] = -1\n curSum = 0\n for i,n in enumerate(nums):\n curSum = (curSum + n) % k\n if curSum in sumIndices:\n if i - sumIndices[curSum] >= 2:\n return True\n else:\n sumIndices[curSum] = i\n return False","runtime":"133"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # mod = 0\n # pre = {0: -1}\n\n # for i in range(len(nums)):\n # mod = (mod + nums[i]) % k\n\n # if mod in pre:\n # if i - pre[mod] > 1:\n # return True\n # else:\n # pre[mod] = i\n \n # return False\n s, prev_d, set_d = 0, 0, set()\n for num in nums:\n s += num\n d = s%k\n if d in set_d:\n return True\n set_d.add(prev_d)\n # print(num, s, prev_d, set_d)\n prev_d = d\n return False \n","runtime":"144"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # 10:22 10:47\n '''\n partial_sums_remainders = {0: -1}\n\n current_sum = 0\n for i, num in enumerate(nums):\n current_sum += num\n remainder = current_sum % k\n\n if remainder in partial_sums_remainders:\n\n if i - partial_sums_remainders[remainder] > 1:\n return True\n else:\n partial_sums_remainders[remainder] = i\n \n return False\n '''\n\n partial_sums_remainders = set()\n\n current_sum_remainder, prev_sum_remainder = 0, 0\n for i, num in enumerate(nums):\n current_sum_remainder = (current_sum_remainder + num) % k\n\n if current_sum_remainder in partial_sums_remainders:\n return True\n\n partial_sums_remainders.add(prev_sum_remainder)\n prev_sum_remainder = current_sum_remainder\n \n return False\n\n ","runtime":"154"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = 0\n mod_seen = {0: -1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n if prefix_mod in mod_seen:\n if i - mod_seen[prefix_mod] > 1: \n return True\n else:\n mod_seen[prefix_mod] = i\n \n return False","runtime":"165"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total = 0\n h = {0: -1}\n\n for i, n in enumerate(nums):\n total += n\n rem = total % k\n\n if rem not in h:\n h[rem] = i\n elif i - h[rem] > 1:\n return True\n\n\n return False","runtime":"176"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n prefix = 0\n remainder = {0: -1}\n for i, n in enumerate(nums):\n prefix += n\n r = prefix % k\n if r not in remainder:\n remainder[r] = i\n elif i - remainder[r] > 1:\n return True\n \n return False\n\n ","runtime":"187"},{"code":"class Solution:\n def checkSubarraySum(self, nums, k):\n prefix_mod = 0\n mod_seen = {0: -1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n\n if prefix_mod in mod_seen:\n # ensures that the size of subarray is at least 2\n if i - mod_seen[prefix_mod] > 1:\n return True\n else:\n # mark the value of prefix_mod with the current index.\n mod_seen[prefix_mod] = i\n\n return False","runtime":"198"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pref_sum = defaultdict(int)\n pref_sum[0] = -1 # for the i - pref_sum[rem]\n total = 0\n for i in range(len(nums)):\n total += nums[i]\n rem = total % k\n if rem in pref_sum:\n if i - pref_sum[rem] > 1:\n return True\n else:\n pref_sum[rem] = i\n\n return False \n","runtime":"208"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod_sum = {0: -1}\n prefix_sum = 0\n for i, num in enumerate(nums):\n prefix_sum = (prefix_sum + num) % k\n previous_idx = prefix_mod_sum.get(prefix_sum, None)\n if previous_idx is not None:\n if i - previous_idx > 1:\n return True\n\n else:\n prefix_mod_sum[prefix_sum] = i\n return False","runtime":"219"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if k == 0:\n return any(nums[i] == 0 and nums[i+1] == 0 for i in range(len(nums)-1))\n\n remainder_map = {0:-1} \n curr_sum = 0 \n\n for i, num in enumerate(nums):\n curr_sum += num \n reaminder = curr_sum % k \n if reaminder not in remainder_map:\n remainder_map[reaminder] = i\n\n elif i - remainder_map[reaminder] >= 2:\n return True \n\n\n return False \n ","runtime":"219"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = 0\n mod_seen = {0: -1} # We don't want to consider first element as answer if it is divisible by k. This is the most elegant way of tracking that. \n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n if prefix_mod in mod_seen:\n if i - mod_seen[prefix_mod] > 1: \n return True\n else:\n mod_seen[prefix_mod] = i\n \n return False","runtime":"230"},{"code":"class Solution:\n def checkSubarraySum(self, nums, k):\n prefix_mod = 0\n dic = {0: -1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n\n if prefix_mod in dic:\n # ensures that the size of subarray is at least 2\n if i - dic[prefix_mod] > 1:\n return True\n else:\n # mark the value of prefix_mod with the current index.\n dic[prefix_mod] = i\n\n return False","runtime":"241"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainder = {0: -1}\n total = 0\n for i, num in enumerate(nums):\n total += num\n r = total % k\n if r not in remainder:\n remainder[r] = i\n elif i - remainder[r] > 1:\n return True\n return False\n","runtime":"252"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n n = len(nums)\n\n hm = {}\n hm[0] = -1\n s = 0\n for i in range(n):\n s += nums[i]\n\n if s % k in hm:\n if (i - hm[s % k]) > 1:\n return True\n\n else:\n\n hm[s % k] = i\n\n return False","runtime":"262"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if not nums:\n return False\n \n hm = { 0: -1 }\n \n total = 0\n for i, num in enumerate(nums):\n total += num\n \n if total % k in hm:\n if i - hm[total % k] >= 2:\n return True\n else:\n hm[total % k] = i\n \n return False\n \n ","runtime":"273"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total = 0\n dic = {0:-1}\n\n for idx, num in enumerate(nums):\n total+=num\n rem = total % k\n if rem not in dic:\n dic[rem] = idx\n elif idx-dic[rem] > 1:\n return True\n \n # print('prefix_sum:', total)\n # print('index: ', idx,'num:',num, 'rem: ', rem)\n # print(dic)\n return False\n","runtime":"284"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum = {0: -1}\n total_sum = 0\n \n for i, num in enumerate(nums):\n total_sum += num\n if k != 0:\n total_sum %= k\n \n # 如果当前模值在哈希表中已经存在\n if total_sum in prefix_sum:\n # 检查索引之差是否大于1\n if i - prefix_sum[total_sum] > 1:\n return True\n else:\n # 存储当前模值和索引\n prefix_sum[total_sum] = i\n \n return False","runtime":"295"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n rmdr_cache = {0: -1}\n rmdr = 0\n\n for i in range(len(nums)):\n rmdr += nums[i]\n rmdr %= k\n if rmdr not in rmdr_cache:\n rmdr_cache[rmdr] = i\n elif i - rmdr_cache[rmdr] >= 2:\n return True\n return False","runtime":"306"},{"code":"'''\nlen >= 2\nsum%k = 0\n[]->bool\nno sorting\n\n[23,2,4,6,7] k=6\n24 % 6\n[23,25,29,35,42]\n\n[5 : 0\n 1 : 1]\nnum < k\n\n\n23,2,4,6,6\n'''\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n mapping = { 0 : -1 } #base case 2 : 0, 4:1, 1:2,\n total = 0\n\n for idx, val in enumerate(nums): \n total += val # prefix sum\n rem = total % k \n if rem in mapping:\n if idx - mapping[rem] > 1:\n return True\n else:\n mapping[rem] = idx\n return False","runtime":"306"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n preSum = {0: -1}\n sumVal = 0\n for i, num in enumerate(nums):\n sumVal = (sumVal + num) % k\n if sumVal in preSum:\n if i - preSum[sumVal] > 1:\n return True\n else:\n preSum[sumVal] = i\n return False","runtime":"316"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n if not nums or len(nums) == 1:\n return False\n\n rem = 0\n\n D = {0 : -1}\n\n for i, num in enumerate(nums):\n\n rem = (rem + num) % k\n\n if rem in D:\n\n if i - D[rem] >= 2:\n return True\n\n else:\n D[rem] = i\n\n return False\n \n \n ","runtime":"327"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # prefix sums\n # mod by k\n # if mod of sum is the same at i and j, return True\n modSums = {0:-1}\n runningSum = 0\n for i, num in enumerate(nums):\n runningSum += num\n mod = runningSum % k\n if mod not in modSums:\n modSums[mod] = i\n elif i - modSums[mod] > 1:\n return True\n return False\n","runtime":"338"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total = 0\n seen = {\n 0: -1\n }\n \n for ind, v in enumerate(nums):\n total = (total + v) % k\n if total in seen:\n if ind - seen[total] > 1:\n return True\n else:\n seen[total] = ind\n return False","runtime":"349"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_index_lookup = {}\n prefix_index_lookup[0] = -1 # Edgecase when \n total = 0 \n for pos, num in enumerate(nums):\n total += num\n remainder = total % k \n if remainder in prefix_index_lookup: \n if (pos - prefix_index_lookup[remainder]) > 1: \n return True\n else: \n prefix_index_lookup[remainder] = pos\n\n return False \n\n","runtime":"349"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n reminder = {0: -1}\n total = 0\n for i, n in enumerate(nums):\n total += n\n r = total % k\n if r not in reminder:\n reminder[r] = i\n elif i - reminder[r] > 1:\n return True\n return False","runtime":"360"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainder = 0\n seen_remainder = {0:-1}\n\n for i in range(len(nums)):\n remainder = (remainder + nums[i]) % k\n\n if remainder in seen_remainder:\n if i-seen_remainder[remainder] >= 2:\n return True\n\n else:\n seen_remainder[remainder] = i\n return False","runtime":"360"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n memo = { 0: -1 }\n prefix_mod = 0\n\n for i, n in enumerate(nums):\n prefix_mod = (prefix_mod + n) % k\n\n if prefix_mod in memo:\n if i - memo[prefix_mod] >= 2:\n return True\n else:\n memo[prefix_mod] = i\n \n return False","runtime":"370"},{"code":"from typing import List\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n res_set = set()\n running_sum = 0\n prev = 0 # To store the prefix sum before the current element\n\n for num in nums:\n running_sum += num\n remainder = running_sum % k\n\n if remainder in res_set:\n return True\n res_set.add(prev)\n prev = remainder\n\n return False\n","runtime":"381"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # relationship between sum[i] and sum[j]\n # only have access to sum[i] and sum[j]\n # sum[j] - sum[i] = x, x = n * k\n # sum[j] - n * k = sum[i]\n # 29 - (1*6) = 23\n # 29 - (2*6) = 17\n d = {0: -1}\n total = 0\n for i in range(len(nums)):\n total += nums[i]\n r = total % k\n if r in d:\n if i - d[r] > 1:\n return True\n else:\n d[r] = i\n return False\n\n\n\n \n\n \n \n\n \n ","runtime":"381"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum_mod = 0\n\n # Mapping: {remainder of (prefix_sum) % k -> index}.\n # Use 0 -> -1 to handle subarrays starting from 0\n mod_to_index = {0: -1}\n\n for i, x in enumerate(nums):\n prefix_sum_mod = (prefix_sum_mod + x) % k\n\n if prefix_sum_mod in mod_to_index:\n # Ensure at least 2 elements in the subarray\n if i - mod_to_index[prefix_sum_mod] > 1:\n return True\n else:\n # Store the current mod\n mod_to_index[prefix_sum_mod] = i\n \n return False\n\n\n ","runtime":"403"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n current_sum = 0\n sum_to_idx = {}\n for idx, num in enumerate(nums):\n current_sum += num\n current_sum %= k\n if idx > 0 and current_sum == 0:\n return True\n if current_sum in sum_to_idx and sum_to_idx[current_sum] <= idx - 2:\n return True\n if current_sum not in sum_to_idx:\n sum_to_idx[current_sum] = idx\n return False","runtime":"403"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n # i < j and sum[j] - sum[i] == k then there is a subarray between i and j that equals k\n\n seen = {0: -1}\n sums = 0\n for i,n in enumerate(nums):\n sums += n\n mod = sums % k \n if mod in seen:\n if i - seen[mod] > 1:\n return True\n else:\n seen[mod] = i\n\n return False\n \n","runtime":"414"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pref_hash = {0:-1}\n pref = 0\n for i in range(len(nums)):\n pref+=nums[i]\n pref%=k\n if pref not in pref_hash:\n pref_hash[pref] = i\n elif i - pref_hash[pref]>=2:\n return True\n return False\n ","runtime":"424"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n runSum = 0\n dic = collections.defaultdict(int)\n dic[0] = -1\n for index, num in enumerate(nums):\n runSum += num\n runSum %= k\n if runSum in dic:\n if dic[runSum] < index - 1:\n return True\n else:\n dic[runSum] = index\n return False","runtime":"435"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total = 0\n remainder = {0: -1}\n for i, num in enumerate(nums):\n total += num\n r = total % k\n if r not in remainder:\n remainder[r] = i\n elif i - remainder[r] > 1:\n return True\n return False\n","runtime":"435"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n\n if n == 1:\n return False\n\n remainder_map = {0 : -1} # key: remainder, value: index\n prefix_sum = 0\n\n for i in range(n):\n prefix_sum += nums[i]\n remainder = prefix_sum % k\n\n if remainder not in remainder_map:\n remainder_map[remainder] = i\n elif i - remainder_map[remainder] >= 2:\n return True\n \n return False","runtime":"446"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n nums[0] = nums[0] % k\n d = {0}\n\n for i in range(1, len(nums)):\n nums[i] = (nums[i] + nums[i-1]) % k\n if nums[i] in d:\n return True\n d.add(nums[i-1])\n \n return False\n\n","runtime":"446"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n\n if n == 1:\n return False\n\n remainder_map = {0 : -1} # key: remainder, value: index\n prefix_sum = 0\n\n for i in range(n):\n new_sum = nums[i] + prefix_sum\n if new_sum % k in remainder_map:\n if i - remainder_map[new_sum % k] >= 2:\n return True\n else:\n remainder_map[new_sum % k] = i\n \n prefix_sum = new_sum\n\n return False","runtime":"457"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n record = {0: -1} # initialize a dict to record the remainder and index.\n cumulative_sum = 0\n for i, num in enumerate(nums):\n cumulative_sum += num\n remainder = cumulative_sum % k\n if remainder in record:\n if i - record[remainder] >= 2:\n return True\n else:\n record[remainder] = i\n return False\n","runtime":"457"},{"code":"# prefix sum goves over the sum,\n# maintain map of mod and index\n# if different between 2 results in mod =0\n# the same mod 0 will repeat\n# like we sotre mod 0 to index -1\n# if we have get mod same idfferen mod again means we \n# the erements between then mods to 0\n\n# ex: \n# 23 2 4 k = 6\n# 5 1 5 index differnce is 2\n# meaning the lements in bet divided by 6\n\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n prefix_sum = 0\n\n mod_map = {0:-1} # stores mod and index\n\n for i in range(len(nums)):\n\n prefix_sum += nums[i]\n\n mod = prefix_sum%k\n if mod in mod_map:\n\n if i - mod_map[mod] > 1:\n return True\n else:\n\n mod_map[mod] = i\n return False\n ","runtime":"468"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainder_dict = {0:-1}\n prefix_sum = 0\n\n for i,num in enumerate(nums):\n prefix_sum += num\n remainder = prefix_sum%k\n\n if remainder in remainder_dict:\n if i-remainder_dict[remainder] > 1:\n return True\n else:\n remainder_dict[remainder] = i\n return False\n","runtime":"468"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n\n mod_map = {0: -1}\n current_sum = 0\n for i, n in enumerate(nums): \n current_sum += n\n prefix_mod = current_sum % k\n if prefix_mod in mod_map:\n # print(mod_map[prefix_mod], i, i - mod_map[prefix_mod])\n if i - mod_map[prefix_mod] > 1:\n return True\n else:\n mod_map[prefix_mod] = i\n\n # print(mod_map) \n return False","runtime":"478"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n #nums = [23,2,4,6,7], k = 6\n #cum = [23, 25, 29, 35, 42]\n\n #num = [4, 5, 11, 8, 7], k = 6\n #cum = [4, 9, 20, 28, 35]\n\n #nums = [7, 7, 8, 4, 7], k = 6, i = 3, j = 0 up to 2\n #sums = [7, 14, 22, 26, 33]\n\n #O(n ^ 2)\n\n n = len(nums)\n mod_seen = {0: -1}\n prefix_mod = 0\n for i in range(n):\n prefix_mod = (prefix_mod + nums[i]) % k\n if prefix_mod in mod_seen:\n if i - mod_seen[prefix_mod] > 1:\n return True\n else:\n mod_seen[prefix_mod] = i\n return False\n\n n = len(nums)\n sums = [0] * n\n sums[0] = nums[0]\n for i in range(1, n):\n sums[i] += nums[i] + sums[i - 1]\n if sums[i] % k == 0:\n return True\n for i in range(2, n):\n for j in range(i - 1):\n if (sums[i] - sums[j]) % k == 0:\n return True\n return False","runtime":"478"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n dic={0:-1}\n summ=0\n for i,n in enumerate(nums):\n summ=(summ+n)%k\n if summ not in dic:\n dic[summ]=i\n else:\n if(i-dic[summ]>=2):\n return True\n return False","runtime":"489"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total:int = 0\n prefixSum:dict = {0: -1}\n for x in range(len(nums)):\n number:int = nums[x]\n total += number\n remainder:int = total % k\n if remainder in prefixSum:\n if x - prefixSum[remainder] >= 2:\n return True\n else:\n prefixSum[remainder] = x\n\n return False","runtime":"489"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pre = 0\n m = {}\n m[0] = -1\n\n for i in range(len(nums)):\n pre = (pre + nums[i]) % k\n if pre in m.keys():\n if i - m[pre] > 1:\n return True\n else:\n m[pre] = i\n \n return False","runtime":"500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n reminder = {0: -1}\n total = 0\n\n for i, n in enumerate(nums):\n total +=n\n r = total % k\n if r not in reminder:\n reminder[r] = i\n\n elif i - reminder[r] > 1:\n return True\n\n return False\n\n\n \n\n \n \n\n\n","runtime":"511"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n reminder = 0\n dic = {0: -1}\n for i, num in enumerate(nums):\n reminder += nums[i]\n reminder %= k\n\n if reminder in dic and i - dic[reminder] > 1:\n return True\n if reminder not in dic:\n dic[reminder] = i\n \n return False","runtime":"511"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n dic = {0:-1}\n cur = 0\n for i in range(len(nums)):\n cur+=nums[i]\n remainder=cur%k\n if remainder in dic and i-dic[remainder]>=2:\n return True\n if remainder not in dic:\n dic[remainder]=i\n return False","runtime":"522"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n curr, d = 0, {0:-1}\n for i,e in enumerate(nums):\n curr += e\n r = curr%k\n if r in d:\n if i-d[r]>1: return True\n else: d[r] = i\n return False\n\n ","runtime":"522"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum_map = {0: -1}\n prefix_sum = 0\n for i, num in enumerate(nums):\n prefix_sum += num\n sum_mod_k = prefix_sum % k\n if sum_mod_k in prefix_sum_map:\n if i - prefix_sum_map[sum_mod_k] > 1:\n return True\n else:\n prefix_sum_map[sum_mod_k] = i\n return False\n \n \n","runtime":"532"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if(len(nums) < 2):\n return 0\n d = {}\n p = 0\n d[0] = -1\n for i in range(len(nums)):\n p += nums[i]\n p %= k\n if(p in d):\n if(i > d[p]+1):\n return 1\n else:\n d[p] = i\n return 0","runtime":"532"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n sumToIndex = {0 : -1}\n prefixSum = 0\n\n for i in range(len(nums)):\n prefixSum += nums[i]\n\n if prefixSum % k in sumToIndex:\n if ((i - sumToIndex[prefixSum % k]) > 1):\n return True\n if prefixSum % k not in sumToIndex:\n sumToIndex[prefixSum % k] = i\n return False","runtime":"543"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n map = {0: -1} # To handle the case where the sub-array starts from index 0\n sum = 0\n\n for i in range(len(nums)):\n sum += nums[i]\n rem = sum % k\n\n if rem in map:\n if i - map[rem] > 1:\n return True\n else:\n map[rem] = i\n\n return False\n ","runtime":"543"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix = {0:-1}\n sum_so_far = 0\n for i, num in enumerate(nums):\n sum_so_far += num\n remainder = sum_so_far % k\n if remainder not in prefix:\n prefix[remainder] = i\n elif i - prefix[remainder] >= 2:\n return True\n return False\n ","runtime":"554"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n d = {0:-1}\n\n tmp = 0\n\n for v,i in enumerate(nums):\n tmp += i\n if tmp % k in d:\n if abs(v-d[tmp%k]) > 1:\n return True\n else:\n d[tmp%k] = v\n return False","runtime":"554"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # a * k + x1 (b + 1) * k + x2 \n # x2 - x1 = 0 or \n seen = {0:-1}\n curr = 0\n for i in range(len(nums)):\n \n curr += nums[i]\n m = curr % k\n # print(i, curr, m, seen)\n if m in seen:\n if i - seen[m] > 1:\n return True\n else:\n seen[m] = i\n \n return False\n","runtime":"565"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total = 0\n mods = {0:-1}\n for i in range(0,len(nums)):\n total = nums[i] + total\n cur_mod = total % k\n if cur_mod in mods and i - mods[cur_mod] > 1:\n return True\n if cur_mod not in mods:\n mods[cur_mod] = i\n return False\n\n \n","runtime":"576"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n prefix_sum = 0\n\n mod_map = {0:-1} # stores mod and index\n\n for i in range(len(nums)):\n\n prefix_sum += nums[i]\n\n mod = prefix_sum%k\n if mod in mod_map:\n\n if i - mod_map[mod] > 1:\n return True\n else:\n\n mod_map[mod] = i\n return False\n ","runtime":"586"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n tot = 0\n dicti = collections.defaultdict()\n for i, num in enumerate(nums):\n tot += num\n rem = tot % k\n if(i > 0 and rem == 0):\n return True\n if(rem in dicti):\n if( i - dicti[rem] > 1):\n return True\n else:\n dicti[rem] = i\n return False\n","runtime":"586"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n\n if n == 1:\n return False\n\n remainder_map = {0 : -1} # key: remainder, value: index\n prefix_sum = 0\n\n for i in range(n):\n prefix_sum += nums[i]\n if prefix_sum % k in remainder_map:\n if i - remainder_map[prefix_sum % k] >= 2:\n return True\n else:\n remainder_map[prefix_sum % k] = i\n \n return False","runtime":"597"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n cum_sum = 0\n remainder_index = {0: -1}\n\n for i, num in enumerate(nums):\n cum_sum += num\n remainder = cum_sum % k\n\n if remainder in remainder_index and i - remainder_index[remainder] > 1:\n return True\n elif remainder not in remainder_index:\n remainder_index[remainder] = i\n\n return False","runtime":"608"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n reminders_index_map = {0: -1}\n\n cur_sum = 0\n\n for i, n in enumerate(nums):\n cur_sum += n\n\n reminder = cur_sum % k\n\n if reminder in reminders_index_map:\n\n prev_reminder_i = reminders_index_map[reminder]\n\n if abs(prev_reminder_i - i) > 1:\n return True\n\n reminders_index_map[reminder] = min(prev_reminder_i, i)\n else:\n reminders_index_map[reminder] = i\n\n return False\n ","runtime":"619"},{"code":"class Solution:\n def checkSubarraySum(self, nums, k):\n prefix_mod = 0\n mod_seen = {0: -1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n\n if prefix_mod in mod_seen:\n # ensures that the size of subarray is at least 2\n if i - mod_seen[prefix_mod] > 1:\n return True\n else:\n # mark the value of prefix_mod with the current index.\n mod_seen[prefix_mod] = i\n\n return False","runtime":"619"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = 0\n mods_seen = {0: -1}\n\n for ix, n in enumerate(nums):\n prefix_mod = (prefix_mod + n) % k\n\n if prefix_mod in mods_seen:\n if ix - mods_seen[prefix_mod] > 1:\n return True\n else:\n mods_seen[prefix_mod] = ix\n \n return False","runtime":"630"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n hashmap = {0: -1}\n total = 0\n for i, n in enumerate(nums):\n total += n\n remainder = total % k\n if remainder not in hashmap:\n hashmap[remainder] = i\n elif i - hashmap[remainder] >= 2:\n return True\n return False","runtime":"640"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \"\"\"\n 1. Initialize a dictionary to store the remainder of the cumulative sum divided by k and their corresponding indices.\n 2. Iterate over the array, updating the cumulative sum.\n 3. For each cumulative sum, calculate the remainder when divided by k.\n 4. If the remainder is in the dictionary and the difference between the current index and the index in the dictionary is greater than 1, return True.\n 5. If the remainder is not in the dictionary, add it to the dictionary with the current index.\n 6. If we finish iterating over the array without finding a good subarray, return False.\n \"\"\"\n remainder_index = {0:-1}\n cumulative_sum = 0\n \n for i, num in enumerate(nums):\n cumulative_sum += num\n remainder = cumulative_sum % k\n if remainder in remainder_index and i - remainder_index[remainder] > 1:\n return True\n elif remainder not in remainder_index:\n remainder_index[remainder] = i\n return False ","runtime":"651"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) == 0 or len(nums) == 1:\n return False\n \n d = {}\n mod_sum = nums[0] % k\n d[mod_sum] = 0\n\n for i, n in enumerate(nums[1:], start=1):\n mod_sum = (mod_sum + n) % k\n if mod_sum == 0:\n return True\n elif mod_sum in d and i != d[mod_sum] + 1:\n return True\n elif mod_sum not in d:\n d[mod_sum] = i\n return False\n ","runtime":"662"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix = 0\n prefixToIndex = {0: -1}\n\n for i, num in enumerate(nums):\n prefix += num\n if k != 0:\n prefix %= k\n if prefix in prefixToIndex:\n if i - prefixToIndex[prefix] > 1:\n return True\n else:\n prefixToIndex[prefix] = i\n\n return False","runtime":"673"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = 0\n mod_seen = {0:-1}\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n # R1 = R2\n if prefix_mod in mod_seen:\n if i - mod_seen[prefix_mod] > 1:\n return True\n else: \n mod_seen[prefix_mod] = i\n return False\n ","runtime":"684"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n p = 0\n d = {0:-1}\n for i in range(len(nums)):\n p += nums[i]\n p %= k\n if(p in d):\n if(i > d[p]+1):\n return 1\n else:\n d[p] = i\n return 0","runtime":"694"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n N = len(nums)\n # for i in range(N):\n # s = nums[i]\n # for j in range(i+1, N):\n # s += nums[j]\n # if (s % k) == 0:\n # return True\n # return False\n \n # https://www.youtube.com/watch?v=OKcrLfR-8mE\n \n # this is not return the first solution \n \n rem = 0\n remD = {0 :-1}\n\n for i, v in enumerate(nums):\n rem = (rem + v) % k\n if rem in remD:\n if i - remD[rem] > 1:\n return True\n else:\n remD[rem] = i\n \n return False\n\n\n ","runtime":"694"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n sSet = set()\n s = 0\n preS = 0\n # sSet.add(0) \n for num in nums:\n preS = s\n s += num\n s %= k\n if s in sSet: return True\n sSet.add(preS) \n return False ","runtime":"705"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n\n if n == 1:\n return False\n\n remainder_map = {nums[0] % k : 0, 0 : -1} # key: remainder, value: index\n prefix_sums = [nums[0]]\n\n for i in range(1, n):\n new_sum = nums[i] + prefix_sums[i - 1]\n if new_sum % k in remainder_map:\n if i - remainder_map[new_sum % k] >= 2:\n return True\n else:\n remainder_map[new_sum % k] = i\n \n prefix_sums.append(new_sum)\n\n return False","runtime":"716"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n running_sum = 0\n remainder_map = {0 : -1}\n\n for i in range(len(nums)):\n running_sum += nums[i]\n remainder = running_sum % k\n\n if remainder in remainder_map:\n if i - remainder_map[remainder] > 1:\n return True\n else:\n remainder_map[remainder] = i\n return False","runtime":"716"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n dt = {}\n dt[0] = -1\n total=0\n for i in range(0,len(nums)):\n total+=nums[i]\n rem = total%k\n if rem in dt and i - dt[rem] >=2:\n return True\n elif rem not in dt:\n dt[rem] = i\n return False","runtime":"727"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainder = {0:-1} #remainder: end index\n #set the initial remainder to {0,-1} because the first element in nums might be a \n total = 0\n for i, n in enumerate(nums):\n total += n\n r = total % k\n if r not in remainder:\n remainder[r] = i\n elif i - remainder[r] > 1:\n return True\n return False\n\n#Time, Space: O(n)\n\n\n\n ","runtime":"738"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = 0\n mod_seen = {0: -1} # initialized to account for the intial value of prefix_mod\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n if prefix_mod in mod_seen:\n if i - mod_seen[prefix_mod] > 1:\n return True\n else:\n mod_seen[prefix_mod] = i\n\n print(prefix_mod, mod_seen)\n return False\n","runtime":"748"},{"code":"class Solution:\n '''\n Clarifying question:\n boolean output -> true if contains a 'good subarray'\n its length is at least two, and\n the sum of the elements of the subarray is a multiple of k.\n\n 0 is always a multiple of k.\n 0 alone isnt a valid solution but two consecutive 0's are, [0,0] \n\n Brute force:\n O(n^2) loop all subarrays and check if sum is % k.\n Arr isn't sorted so cant do a sliding window.\n\n Improved:\n sum % k == 0 -> is a multiple because no remainder.\n Trick:\n If two subarrays have same mod remainder, then the val diff between them is k.\n e.g. nums = [23,2,4,6,7], k = 6. the mod will be 0 so remainder + 0 (multi of k).\n [23,25,29,35,42] -> modded [5,1,5,5,0]\n create modded prefix hm {modded prefix:index}\n Need to check the index diff (subarray size) between them is >= 2.\n Need to initialise prefix_hm with {0,-1}. This triggers if a sum multi or k has been found from first index.\n e.g. [23,2,4,6,6], k = 7\n\n O(n)\n '''\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_hm = {0:-1}\n curr_sum = 0\n\n for i, num in enumerate(nums):\n curr_sum += num\n curr_prefix = curr_sum % k\n\n if curr_prefix in prefix_hm:\n if i - prefix_hm[curr_prefix] >= 2:\n return True\n else:\n # only write if it doesnt exist.\n # dont overwrite to max chance of increasing subarray distance\n # >= 2\n prefix_hm[curr_prefix] = i\n\n return False\n","runtime":"748"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n\n mod_map = {0: -1}\n current_sum = 0\n for i, n in enumerate(nums): \n current_sum += n\n prefix_mod = current_sum % k\n if prefix_mod in mod_map:\n print(mod_map[prefix_mod], i, i - mod_map[prefix_mod])\n if i - mod_map[prefix_mod] > 1:\n return True\n else:\n mod_map[prefix_mod] = i\n\n print(mod_map) \n return False","runtime":"759"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # nums = [num%k for num in nums]\n cur_sum, n = 0, len(nums)\n prefix_sum = {0: -1}\n for i in range(n):\n cur_sum += nums[i]\n cur_sum %= k\n # if i>=1 and cur_sum==0:\n # return True\n target1, target2 = cur_sum, -1*cur_sum\n if target1 in prefix_sum or target2 in prefix_sum:\n if target1 in prefix_sum and i-prefix_sum[target1]>1:\n return True\n if target2 in prefix_sum and i-prefix_sum[target2]>1:\n return True\n if cur_sum not in prefix_sum:\n prefix_sum[cur_sum] = i\n # print(prefix_sum)\n\n return False\n\n\n\n ","runtime":"770"},{"code":"from collections import defaultdict\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # get the accumulated sum\n runner_sum = 0\n\n # get the mod as a dict (mod: [idx])\n mod_dict = {0: -1}\n\n for i, v in enumerate(nums):\n runner_sum += v\n residual = runner_sum % k\n if residual in mod_dict:\n if i - mod_dict[residual] > 1:\n return True\n else:\n mod_dict[residual] = i\n return False","runtime":"781"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n presum =0\n p ={ 0:-1}\n\n for i in range(len(nums)):\n presum = (presum+nums[i]) % k\n if presum not in p:\n p[presum] =i\n else:\n if i -p[presum] >1:\n return True\n\n print (p)\n return False\n\n\n\n\n\n \n\n#mod_seen { 0:-1, 5:0, 1:1, 5:2}","runtime":"792"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n # dict to store prefix sum\n prefix_sum_remainders = {0: -1}\n\n cumulative_sum = 0\n\n # iterate through nums\n for i in range(len(nums)):\n #add to sum\n cumulative_sum += nums[i]\n\n remainder = cumulative_sum % k\n\n if remainder in prefix_sum_remainders:\n #check distance between prev and cur index\n if i - prefix_sum_remainders[remainder] > 1:\n return True\n else:\n #store remainder and index\n prefix_sum_remainders[remainder] = i\n \n return False\n\n\n","runtime":"802"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n total = 0\n h = {0: -1}\n\n for i, n in enumerate(nums):\n total += n\n rem = total % k\n\n if rem not in h:\n h[rem] = i\n elif i - h[rem] > 1:\n return True\n\n\n return False","runtime":"813"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # time O(n), space O(n)\n prefix_mod = 0\n mod_seen = {0: -1}\n\n for idx, num in enumerate(nums):\n prefix_mod = (prefix_mod + num) % k\n\n if mod_seen.get(prefix_mod, len(nums)) < idx - 1:\n return True \n \n if prefix_mod not in mod_seen:\n mod_seen[prefix_mod] = idx\n \n return False\n\n# k = 6 \n\n\n# 23, 2, 4, 6, 7\n# 0,23,25,29,35,42\n# i j\n","runtime":"824"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # relationship between sum[i] and sum[j]\n # only have access to sum[i] and sum[j]\n # sum[j] - sum[i] = x, x = n * k\n # sum[j] - n * k = sum[i]\n # 29 - (1*6) = 23\n # 29 - (2*6) = 17\n d = {0: -1}\n total = 0\n for i in range(len(nums)):\n total += nums[i]\n r = total % k\n if r in d:\n if i - d[r] > 1:\n return True\n else:\n d[r] = i\n print(d)\n return False\n\n\n\n \n\n \n \n\n \n ","runtime":"835"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n d = defaultdict(int)\n sum1 = 0\n for i in range(len(nums)):\n sum1+=nums[i]\n if sum1%k==0 and i>=1:\n return True\n if sum1%k in d and i - d[sum1%k]>1:\n return True\n if sum1%k not in d:\n d[sum1%k] = i\n return False\n ","runtime":"835"},{"code":"class Solution:\n def checkSubarraySum_editoral(self, nums: List[int], k: int) -> bool:\n\n \n prefix_mode = 0\n mode_seen = {0: -1}\n\n for i in range(len(nums)):\n\n prefix_mode = (prefix_mode + nums[i]) % k\n\n if prefix_mode in mode_seen:\n if i - mode_seen[prefix_mode] > 1:\n return True\n\n else:\n mode_seen[prefix_mode] = i\n\n return False\n\n\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n prefix_summ = 0\n rest_pred = 0\n rest_set = set()\n\n for i in range(len(nums)):\n\n prefix_summ += nums[i]\n rest = prefix_summ % k\n\n if rest in rest_set:\n \n return True\n\n rest_set.add(rest_pred)\n rest_pred = rest\n\n return False\n","runtime":"846"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum = 0\n mod_dict = {0: -1}\n for i, num in enumerate(nums):\n prefix_sum += num\n mod = prefix_sum % k\n if mod in mod_dict:\n if i - mod_dict[mod] > 1:\n return True\n else:\n mod_dict[mod] = i\n return False","runtime":"878"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainderMap = {0:-1}\n s = 0\n for i in range(len(nums)):\n s+=nums[i]\n if s%k not in remainderMap:\n remainderMap[s%k] = i \n elif i - remainderMap[s%k] > 1:\n return True\n return False\n","runtime":"878"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod =0\n count = {0:-1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod+nums[i])%k\n if prefix_mod in count:\n if i-count[prefix_mod]>1:\n return True \n else:\n count[prefix_mod]=i\n return False ","runtime":"889"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n hashmap = {0:-1}\n cursum = 0\n\n for i,n in enumerate(nums):\n cursum+=n\n\n if cursum%k in hashmap:\n if i-hashmap[cursum%k] >1:\n return True\n else:\n hashmap[cursum%k] = i\n\n return False\n\n\n\n ","runtime":"889"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n presum = 0\n mod2index = {0: 0}\n n = len(nums)\n for i in range(1, n+1):\n presum += nums[i-1]\n mod = presum % k\n if mod in mod2index:\n if i - mod2index[mod] >= 2:\n print(i, mod2index[mod])\n return True\n else:\n mod2index[mod] = i\n \n return False\n \n","runtime":"900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n d = {0:-1}\n curr_sum = 0\n\n for i, n in enumerate(nums):\n curr_sum += n\n rem = curr_sum % k\n if rem in d:\n if i - d[rem] >= 2:\n return True\n else:\n d[rem] = i\n\n return False\n\n\n \n ","runtime":"900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainders = {0: -1} #{remainder, end_index}\n r_sum = 0\n\n for i in range(len(nums)):\n r_sum += nums[i]\n rem = r_sum % k\n\n if rem in remainders:\n if i - remainders[rem] > 1:\n return True\n else:\n remainders[rem] = i\n \n return False\n","runtime":"910"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n remainder_index = {0:-1}\n cumsum = 0\n \n for i in range(len(nums)):\n cumsum += nums[i]\n remainder = cumsum % k\n if remainder in remainder_index and i - remainder_index[remainder] >=2:\n return True\n elif remainder not in remainder_index:\n remainder_index[remainder] = i\n \n return False\n \n ","runtime":"910"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum = 0\n sum_map = {0: -1} # Initialize with 0 at index -1\n \n for i, num in enumerate(nums):\n prefix_sum += num\n \n if k != 0:\n prefix_sum %= k\n \n if prefix_sum in sum_map:\n if i - sum_map[prefix_sum] >= 2:\n return True\n else:\n sum_map[prefix_sum] = i\n \n return False","runtime":"921"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n\n mapp = {0: -1}\n summ = 0\n for i, num in enumerate(nums):\n summ+=num\n mod = summ % k\n\n if mod not in mapp:\n mapp[mod] = i\n \n if i - mapp[mod] > 1:\n return True\n \n return False","runtime":"921"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n\n prefix = {\n 0: -1,\n }\n cur_prefix = 0\n\n for i in range(len(nums)):\n cur_prefix += nums[i]\n if cur_prefix % k in prefix and i - prefix[cur_prefix % k] >= 2:\n return True\n \n prefix[cur_prefix % k] = prefix.get(cur_prefix % k, i)\n\n return False\n\n\n ","runtime":"932"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n #[[6,12,19],[10,17],11,7]\n # have a hash for previous possible substring values\n # also check with previous value\n # \n seen_mods = {}\n suma = 0\n for index in range(len(nums)):\n suma += nums[index]\n mod_val = suma % k\n if mod_val in seen_mods and index - seen_mods[mod_val] > 1:\n return True\n elif index != 0 and mod_val == 0:\n return True\n elif mod_val not in seen_mods:\n seen_mods[mod_val] = index\n\n return False\n\n\n","runtime":"932"},{"code":"class Solution:\n def checkSubarraySum(self, nums, k):\n prefix_mod = 0\n mod_seen = {0: -1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n\n if prefix_mod in mod_seen:\n # ensures that the size of subarray is at least 2\n if i - mod_seen[prefix_mod] > 1:\n return True\n else:\n # mark the value of prefix_mod with the current index.\n mod_seen[prefix_mod] = i\n\n return False","runtime":"943"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n memo = {}\n curSum = 0\n for i in range(len(nums)):\n num = nums[i]\n curSum += num\n \n if curSum % k == 0 and i > 0:\n return True\n if curSum % k in memo and i - memo[curSum % k] > 1:\n return True\n \n if curSum % k not in memo:\n memo[curSum % k] = i\n return False","runtime":"943"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n prefixsum = 0\n hmap = {}\n hmap[0] = 0\n\n for i in range(len(nums)):\n prefixsum += nums[i]\n if prefixsum%k in hmap:\n if i+1 - hmap[prefixsum%k] >= 2:\n return True\n\n if prefixsum%k not in hmap:\n hmap[prefixsum%k] = i+1\n\n \n \n return False\n ","runtime":"954"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n csum = 0\n hmap = {0 : -1}\n for i,n in enumerate(nums):\n csum = (csum + n) % k\n\n if (csum) in hmap and i - hmap[csum] >= 2:\n return True\n elif csum not in hmap:\n hmap[csum] = i\n return False","runtime":"954"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum_dict = collections.defaultdict(list)\n prefix_sum_dict[0].append(-1)\n prefix_sum = 0\n for i, num in enumerate(nums):\n prefix_sum += num\n num_to_insert = prefix_sum % k\n prefix_sum_dict[num_to_insert].append(i)\n indexed_items = prefix_sum_dict[num_to_insert]\n if len(indexed_items) > 1 and indexed_items[-1] - indexed_items[0] > 1:\n return True\n return False\n\n \n","runtime":"964"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = 0\n mod_seen = {0: -1}\n\n for i in range(len(nums)):\n prefix_mod = (prefix_mod + nums[i]) % k\n\n if prefix_mod in mod_seen:\n if i - mod_seen[prefix_mod] > 1:\n return True\n else:\n mod_seen[prefix_mod] = i\n\n return False","runtime":"964"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum_map = {}\n curr_sum = 0\n for i, n in enumerate(nums):\n curr_sum += n\n modul = curr_sum % k\n if modul == 0 and i > 0:\n return True\n\n if modul not in prefix_sum_map:\n prefix_sum_map[modul] = [i]\n else:\n if any(i - idx >= 2 for idx in prefix_sum_map[modul]):\n return True\n prefix_sum_map[modul].append(i)\n \n return False\n \n \n ","runtime":"975"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n map = {0:-1}\n curr_sum = 0\n\n for idx, num in enumerate(nums):\n curr_sum += num\n reminder = curr_sum%k\n if idx - map.get(reminder, idx) >= 2:\n return True\n map[reminder] = min(idx, map.get(reminder, idx))\n\n return False","runtime":"975"}],"string":"[\n {\n \"code\": \"def checkSubarraySum(nums: List[int], k: int) -> bool:\\n d={0:-1}\\n ream=0\\n\\n for i in range(len(nums)):\\n ream=(ream+nums[i])%k\\n if ream in d:\\n if i-d[ream]>=2: return 'true'\\n else: d[ream]=i\\n\\n return 'false'\\n\\nsys.stdout=open('user.out','w')\\nfor nums in map(loads,stdin):\\n print(checkSubarraySum(nums,int(stdin.readline())))\\nexit()\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pre = 0\\n seen = {0: -1}\\n\\n for i in range(len(nums)):\\n pre = (pre + nums[i]) % k\\n\\n if pre in seen:\\n if i - seen[pre] > 1:\\n return \\\"true\\\"\\n else:\\n seen[pre] = i\\n\\n return \\\"false\\\"\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().checkSubarraySum(nums, next(inputs)),file=f)\\nexit(0)\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n sumIndices = {}\\n sumIndices[0] = -1\\n curSum = 0\\n for i,n in enumerate(nums):\\n curSum = (curSum + n) % k\\n if curSum in sumIndices:\\n if i - sumIndices[curSum] >= 2:\\n return True\\n else:\\n sumIndices[curSum] = i\\n return False\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # mod = 0\\n # pre = {0: -1}\\n\\n # for i in range(len(nums)):\\n # mod = (mod + nums[i]) % k\\n\\n # if mod in pre:\\n # if i - pre[mod] > 1:\\n # return True\\n # else:\\n # pre[mod] = i\\n \\n # return False\\n s, prev_d, set_d = 0, 0, set()\\n for num in nums:\\n s += num\\n d = s%k\\n if d in set_d:\\n return True\\n set_d.add(prev_d)\\n # print(num, s, prev_d, set_d)\\n prev_d = d\\n return False \\n\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # 10:22 10:47\\n '''\\n partial_sums_remainders = {0: -1}\\n\\n current_sum = 0\\n for i, num in enumerate(nums):\\n current_sum += num\\n remainder = current_sum % k\\n\\n if remainder in partial_sums_remainders:\\n\\n if i - partial_sums_remainders[remainder] > 1:\\n return True\\n else:\\n partial_sums_remainders[remainder] = i\\n \\n return False\\n '''\\n\\n partial_sums_remainders = set()\\n\\n current_sum_remainder, prev_sum_remainder = 0, 0\\n for i, num in enumerate(nums):\\n current_sum_remainder = (current_sum_remainder + num) % k\\n\\n if current_sum_remainder in partial_sums_remainders:\\n return True\\n\\n partial_sums_remainders.add(prev_sum_remainder)\\n prev_sum_remainder = current_sum_remainder\\n \\n return False\\n\\n \",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = 0\\n mod_seen = {0: -1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n if prefix_mod in mod_seen:\\n if i - mod_seen[prefix_mod] > 1: \\n return True\\n else:\\n mod_seen[prefix_mod] = i\\n \\n return False\",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total = 0\\n h = {0: -1}\\n\\n for i, n in enumerate(nums):\\n total += n\\n rem = total % k\\n\\n if rem not in h:\\n h[rem] = i\\n elif i - h[rem] > 1:\\n return True\\n\\n\\n return False\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n prefix = 0\\n remainder = {0: -1}\\n for i, n in enumerate(nums):\\n prefix += n\\n r = prefix % k\\n if r not in remainder:\\n remainder[r] = i\\n elif i - remainder[r] > 1:\\n return True\\n \\n return False\\n\\n \",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums, k):\\n prefix_mod = 0\\n mod_seen = {0: -1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n\\n if prefix_mod in mod_seen:\\n # ensures that the size of subarray is at least 2\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else:\\n # mark the value of prefix_mod with the current index.\\n mod_seen[prefix_mod] = i\\n\\n return False\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pref_sum = defaultdict(int)\\n pref_sum[0] = -1 # for the i - pref_sum[rem]\\n total = 0\\n for i in range(len(nums)):\\n total += nums[i]\\n rem = total % k\\n if rem in pref_sum:\\n if i - pref_sum[rem] > 1:\\n return True\\n else:\\n pref_sum[rem] = i\\n\\n return False \\n\",\n \"runtime\": \"208\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod_sum = {0: -1}\\n prefix_sum = 0\\n for i, num in enumerate(nums):\\n prefix_sum = (prefix_sum + num) % k\\n previous_idx = prefix_mod_sum.get(prefix_sum, None)\\n if previous_idx is not None:\\n if i - previous_idx > 1:\\n return True\\n\\n else:\\n prefix_mod_sum[prefix_sum] = i\\n return False\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if k == 0:\\n return any(nums[i] == 0 and nums[i+1] == 0 for i in range(len(nums)-1))\\n\\n remainder_map = {0:-1} \\n curr_sum = 0 \\n\\n for i, num in enumerate(nums):\\n curr_sum += num \\n reaminder = curr_sum % k \\n if reaminder not in remainder_map:\\n remainder_map[reaminder] = i\\n\\n elif i - remainder_map[reaminder] >= 2:\\n return True \\n\\n\\n return False \\n \",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = 0\\n mod_seen = {0: -1} # We don't want to consider first element as answer if it is divisible by k. This is the most elegant way of tracking that. \\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n if prefix_mod in mod_seen:\\n if i - mod_seen[prefix_mod] > 1: \\n return True\\n else:\\n mod_seen[prefix_mod] = i\\n \\n return False\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums, k):\\n prefix_mod = 0\\n dic = {0: -1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n\\n if prefix_mod in dic:\\n # ensures that the size of subarray is at least 2\\n if i - dic[prefix_mod] > 1:\\n return True\\n else:\\n # mark the value of prefix_mod with the current index.\\n dic[prefix_mod] = i\\n\\n return False\",\n \"runtime\": \"241\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainder = {0: -1}\\n total = 0\\n for i, num in enumerate(nums):\\n total += num\\n r = total % k\\n if r not in remainder:\\n remainder[r] = i\\n elif i - remainder[r] > 1:\\n return True\\n return False\\n\",\n \"runtime\": \"252\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n n = len(nums)\\n\\n hm = {}\\n hm[0] = -1\\n s = 0\\n for i in range(n):\\n s += nums[i]\\n\\n if s % k in hm:\\n if (i - hm[s % k]) > 1:\\n return True\\n\\n else:\\n\\n hm[s % k] = i\\n\\n return False\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if not nums:\\n return False\\n \\n hm = { 0: -1 }\\n \\n total = 0\\n for i, num in enumerate(nums):\\n total += num\\n \\n if total % k in hm:\\n if i - hm[total % k] >= 2:\\n return True\\n else:\\n hm[total % k] = i\\n \\n return False\\n \\n \",\n \"runtime\": \"273\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total = 0\\n dic = {0:-1}\\n\\n for idx, num in enumerate(nums):\\n total+=num\\n rem = total % k\\n if rem not in dic:\\n dic[rem] = idx\\n elif idx-dic[rem] > 1:\\n return True\\n \\n # print('prefix_sum:', total)\\n # print('index: ', idx,'num:',num, 'rem: ', rem)\\n # print(dic)\\n return False\\n\",\n \"runtime\": \"284\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum = {0: -1}\\n total_sum = 0\\n \\n for i, num in enumerate(nums):\\n total_sum += num\\n if k != 0:\\n total_sum %= k\\n \\n # 如果当前模值在哈希表中已经存在\\n if total_sum in prefix_sum:\\n # 检查索引之差是否大于1\\n if i - prefix_sum[total_sum] > 1:\\n return True\\n else:\\n # 存储当前模值和索引\\n prefix_sum[total_sum] = i\\n \\n return False\",\n \"runtime\": \"295\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n rmdr_cache = {0: -1}\\n rmdr = 0\\n\\n for i in range(len(nums)):\\n rmdr += nums[i]\\n rmdr %= k\\n if rmdr not in rmdr_cache:\\n rmdr_cache[rmdr] = i\\n elif i - rmdr_cache[rmdr] >= 2:\\n return True\\n return False\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"'''\\nlen >= 2\\nsum%k = 0\\n[]->bool\\nno sorting\\n\\n[23,2,4,6,7] k=6\\n24 % 6\\n[23,25,29,35,42]\\n\\n[5 : 0\\n 1 : 1]\\nnum < k\\n\\n\\n23,2,4,6,6\\n'''\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n mapping = { 0 : -1 } #base case 2 : 0, 4:1, 1:2,\\n total = 0\\n\\n for idx, val in enumerate(nums): \\n total += val # prefix sum\\n rem = total % k \\n if rem in mapping:\\n if idx - mapping[rem] > 1:\\n return True\\n else:\\n mapping[rem] = idx\\n return False\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n preSum = {0: -1}\\n sumVal = 0\\n for i, num in enumerate(nums):\\n sumVal = (sumVal + num) % k\\n if sumVal in preSum:\\n if i - preSum[sumVal] > 1:\\n return True\\n else:\\n preSum[sumVal] = i\\n return False\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n if not nums or len(nums) == 1:\\n return False\\n\\n rem = 0\\n\\n D = {0 : -1}\\n\\n for i, num in enumerate(nums):\\n\\n rem = (rem + num) % k\\n\\n if rem in D:\\n\\n if i - D[rem] >= 2:\\n return True\\n\\n else:\\n D[rem] = i\\n\\n return False\\n \\n \\n \",\n \"runtime\": \"327\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # prefix sums\\n # mod by k\\n # if mod of sum is the same at i and j, return True\\n modSums = {0:-1}\\n runningSum = 0\\n for i, num in enumerate(nums):\\n runningSum += num\\n mod = runningSum % k\\n if mod not in modSums:\\n modSums[mod] = i\\n elif i - modSums[mod] > 1:\\n return True\\n return False\\n\",\n \"runtime\": \"338\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total = 0\\n seen = {\\n 0: -1\\n }\\n \\n for ind, v in enumerate(nums):\\n total = (total + v) % k\\n if total in seen:\\n if ind - seen[total] > 1:\\n return True\\n else:\\n seen[total] = ind\\n return False\",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_index_lookup = {}\\n prefix_index_lookup[0] = -1 # Edgecase when \\n total = 0 \\n for pos, num in enumerate(nums):\\n total += num\\n remainder = total % k \\n if remainder in prefix_index_lookup: \\n if (pos - prefix_index_lookup[remainder]) > 1: \\n return True\\n else: \\n prefix_index_lookup[remainder] = pos\\n\\n return False \\n\\n\",\n \"runtime\": \"349\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n reminder = {0: -1}\\n total = 0\\n for i, n in enumerate(nums):\\n total += n\\n r = total % k\\n if r not in reminder:\\n reminder[r] = i\\n elif i - reminder[r] > 1:\\n return True\\n return False\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainder = 0\\n seen_remainder = {0:-1}\\n\\n for i in range(len(nums)):\\n remainder = (remainder + nums[i]) % k\\n\\n if remainder in seen_remainder:\\n if i-seen_remainder[remainder] >= 2:\\n return True\\n\\n else:\\n seen_remainder[remainder] = i\\n return False\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n memo = { 0: -1 }\\n prefix_mod = 0\\n\\n for i, n in enumerate(nums):\\n prefix_mod = (prefix_mod + n) % k\\n\\n if prefix_mod in memo:\\n if i - memo[prefix_mod] >= 2:\\n return True\\n else:\\n memo[prefix_mod] = i\\n \\n return False\",\n \"runtime\": \"370\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n res_set = set()\\n running_sum = 0\\n prev = 0 # To store the prefix sum before the current element\\n\\n for num in nums:\\n running_sum += num\\n remainder = running_sum % k\\n\\n if remainder in res_set:\\n return True\\n res_set.add(prev)\\n prev = remainder\\n\\n return False\\n\",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # relationship between sum[i] and sum[j]\\n # only have access to sum[i] and sum[j]\\n # sum[j] - sum[i] = x, x = n * k\\n # sum[j] - n * k = sum[i]\\n # 29 - (1*6) = 23\\n # 29 - (2*6) = 17\\n d = {0: -1}\\n total = 0\\n for i in range(len(nums)):\\n total += nums[i]\\n r = total % k\\n if r in d:\\n if i - d[r] > 1:\\n return True\\n else:\\n d[r] = i\\n return False\\n\\n\\n\\n \\n\\n \\n \\n\\n \\n \",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum_mod = 0\\n\\n # Mapping: {remainder of (prefix_sum) % k -> index}.\\n # Use 0 -> -1 to handle subarrays starting from 0\\n mod_to_index = {0: -1}\\n\\n for i, x in enumerate(nums):\\n prefix_sum_mod = (prefix_sum_mod + x) % k\\n\\n if prefix_sum_mod in mod_to_index:\\n # Ensure at least 2 elements in the subarray\\n if i - mod_to_index[prefix_sum_mod] > 1:\\n return True\\n else:\\n # Store the current mod\\n mod_to_index[prefix_sum_mod] = i\\n \\n return False\\n\\n\\n \",\n \"runtime\": \"403\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n current_sum = 0\\n sum_to_idx = {}\\n for idx, num in enumerate(nums):\\n current_sum += num\\n current_sum %= k\\n if idx > 0 and current_sum == 0:\\n return True\\n if current_sum in sum_to_idx and sum_to_idx[current_sum] <= idx - 2:\\n return True\\n if current_sum not in sum_to_idx:\\n sum_to_idx[current_sum] = idx\\n return False\",\n \"runtime\": \"403\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n # i < j and sum[j] - sum[i] == k then there is a subarray between i and j that equals k\\n\\n seen = {0: -1}\\n sums = 0\\n for i,n in enumerate(nums):\\n sums += n\\n mod = sums % k \\n if mod in seen:\\n if i - seen[mod] > 1:\\n return True\\n else:\\n seen[mod] = i\\n\\n return False\\n \\n\",\n \"runtime\": \"414\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pref_hash = {0:-1}\\n pref = 0\\n for i in range(len(nums)):\\n pref+=nums[i]\\n pref%=k\\n if pref not in pref_hash:\\n pref_hash[pref] = i\\n elif i - pref_hash[pref]>=2:\\n return True\\n return False\\n \",\n \"runtime\": \"424\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n runSum = 0\\n dic = collections.defaultdict(int)\\n dic[0] = -1\\n for index, num in enumerate(nums):\\n runSum += num\\n runSum %= k\\n if runSum in dic:\\n if dic[runSum] < index - 1:\\n return True\\n else:\\n dic[runSum] = index\\n return False\",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total = 0\\n remainder = {0: -1}\\n for i, num in enumerate(nums):\\n total += num\\n r = total % k\\n if r not in remainder:\\n remainder[r] = i\\n elif i - remainder[r] > 1:\\n return True\\n return False\\n\",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n\\n if n == 1:\\n return False\\n\\n remainder_map = {0 : -1} # key: remainder, value: index\\n prefix_sum = 0\\n\\n for i in range(n):\\n prefix_sum += nums[i]\\n remainder = prefix_sum % k\\n\\n if remainder not in remainder_map:\\n remainder_map[remainder] = i\\n elif i - remainder_map[remainder] >= 2:\\n return True\\n \\n return False\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n nums[0] = nums[0] % k\\n d = {0}\\n\\n for i in range(1, len(nums)):\\n nums[i] = (nums[i] + nums[i-1]) % k\\n if nums[i] in d:\\n return True\\n d.add(nums[i-1])\\n \\n return False\\n\\n\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n\\n if n == 1:\\n return False\\n\\n remainder_map = {0 : -1} # key: remainder, value: index\\n prefix_sum = 0\\n\\n for i in range(n):\\n new_sum = nums[i] + prefix_sum\\n if new_sum % k in remainder_map:\\n if i - remainder_map[new_sum % k] >= 2:\\n return True\\n else:\\n remainder_map[new_sum % k] = i\\n \\n prefix_sum = new_sum\\n\\n return False\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n record = {0: -1} # initialize a dict to record the remainder and index.\\n cumulative_sum = 0\\n for i, num in enumerate(nums):\\n cumulative_sum += num\\n remainder = cumulative_sum % k\\n if remainder in record:\\n if i - record[remainder] >= 2:\\n return True\\n else:\\n record[remainder] = i\\n return False\\n\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"# prefix sum goves over the sum,\\n# maintain map of mod and index\\n# if different between 2 results in mod =0\\n# the same mod 0 will repeat\\n# like we sotre mod 0 to index -1\\n# if we have get mod same idfferen mod again means we \\n# the erements between then mods to 0\\n\\n# ex: \\n# 23 2 4 k = 6\\n# 5 1 5 index differnce is 2\\n# meaning the lements in bet divided by 6\\n\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n prefix_sum = 0\\n\\n mod_map = {0:-1} # stores mod and index\\n\\n for i in range(len(nums)):\\n\\n prefix_sum += nums[i]\\n\\n mod = prefix_sum%k\\n if mod in mod_map:\\n\\n if i - mod_map[mod] > 1:\\n return True\\n else:\\n\\n mod_map[mod] = i\\n return False\\n \",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainder_dict = {0:-1}\\n prefix_sum = 0\\n\\n for i,num in enumerate(nums):\\n prefix_sum += num\\n remainder = prefix_sum%k\\n\\n if remainder in remainder_dict:\\n if i-remainder_dict[remainder] > 1:\\n return True\\n else:\\n remainder_dict[remainder] = i\\n return False\\n\",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n\\n mod_map = {0: -1}\\n current_sum = 0\\n for i, n in enumerate(nums): \\n current_sum += n\\n prefix_mod = current_sum % k\\n if prefix_mod in mod_map:\\n # print(mod_map[prefix_mod], i, i - mod_map[prefix_mod])\\n if i - mod_map[prefix_mod] > 1:\\n return True\\n else:\\n mod_map[prefix_mod] = i\\n\\n # print(mod_map) \\n return False\",\n \"runtime\": \"478\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n #nums = [23,2,4,6,7], k = 6\\n #cum = [23, 25, 29, 35, 42]\\n\\n #num = [4, 5, 11, 8, 7], k = 6\\n #cum = [4, 9, 20, 28, 35]\\n\\n #nums = [7, 7, 8, 4, 7], k = 6, i = 3, j = 0 up to 2\\n #sums = [7, 14, 22, 26, 33]\\n\\n #O(n ^ 2)\\n\\n n = len(nums)\\n mod_seen = {0: -1}\\n prefix_mod = 0\\n for i in range(n):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n if prefix_mod in mod_seen:\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else:\\n mod_seen[prefix_mod] = i\\n return False\\n\\n n = len(nums)\\n sums = [0] * n\\n sums[0] = nums[0]\\n for i in range(1, n):\\n sums[i] += nums[i] + sums[i - 1]\\n if sums[i] % k == 0:\\n return True\\n for i in range(2, n):\\n for j in range(i - 1):\\n if (sums[i] - sums[j]) % k == 0:\\n return True\\n return False\",\n \"runtime\": \"478\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n dic={0:-1}\\n summ=0\\n for i,n in enumerate(nums):\\n summ=(summ+n)%k\\n if summ not in dic:\\n dic[summ]=i\\n else:\\n if(i-dic[summ]>=2):\\n return True\\n return False\",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total:int = 0\\n prefixSum:dict = {0: -1}\\n for x in range(len(nums)):\\n number:int = nums[x]\\n total += number\\n remainder:int = total % k\\n if remainder in prefixSum:\\n if x - prefixSum[remainder] >= 2:\\n return True\\n else:\\n prefixSum[remainder] = x\\n\\n return False\",\n \"runtime\": \"489\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pre = 0\\n m = {}\\n m[0] = -1\\n\\n for i in range(len(nums)):\\n pre = (pre + nums[i]) % k\\n if pre in m.keys():\\n if i - m[pre] > 1:\\n return True\\n else:\\n m[pre] = i\\n \\n return False\",\n \"runtime\": \"500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n reminder = {0: -1}\\n total = 0\\n\\n for i, n in enumerate(nums):\\n total +=n\\n r = total % k\\n if r not in reminder:\\n reminder[r] = i\\n\\n elif i - reminder[r] > 1:\\n return True\\n\\n return False\\n\\n\\n \\n\\n \\n \\n\\n\\n\",\n \"runtime\": \"511\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n reminder = 0\\n dic = {0: -1}\\n for i, num in enumerate(nums):\\n reminder += nums[i]\\n reminder %= k\\n\\n if reminder in dic and i - dic[reminder] > 1:\\n return True\\n if reminder not in dic:\\n dic[reminder] = i\\n \\n return False\",\n \"runtime\": \"511\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n dic = {0:-1}\\n cur = 0\\n for i in range(len(nums)):\\n cur+=nums[i]\\n remainder=cur%k\\n if remainder in dic and i-dic[remainder]>=2:\\n return True\\n if remainder not in dic:\\n dic[remainder]=i\\n return False\",\n \"runtime\": \"522\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n curr, d = 0, {0:-1}\\n for i,e in enumerate(nums):\\n curr += e\\n r = curr%k\\n if r in d:\\n if i-d[r]>1: return True\\n else: d[r] = i\\n return False\\n\\n \",\n \"runtime\": \"522\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum_map = {0: -1}\\n prefix_sum = 0\\n for i, num in enumerate(nums):\\n prefix_sum += num\\n sum_mod_k = prefix_sum % k\\n if sum_mod_k in prefix_sum_map:\\n if i - prefix_sum_map[sum_mod_k] > 1:\\n return True\\n else:\\n prefix_sum_map[sum_mod_k] = i\\n return False\\n \\n \\n\",\n \"runtime\": \"532\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if(len(nums) < 2):\\n return 0\\n d = {}\\n p = 0\\n d[0] = -1\\n for i in range(len(nums)):\\n p += nums[i]\\n p %= k\\n if(p in d):\\n if(i > d[p]+1):\\n return 1\\n else:\\n d[p] = i\\n return 0\",\n \"runtime\": \"532\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n sumToIndex = {0 : -1}\\n prefixSum = 0\\n\\n for i in range(len(nums)):\\n prefixSum += nums[i]\\n\\n if prefixSum % k in sumToIndex:\\n if ((i - sumToIndex[prefixSum % k]) > 1):\\n return True\\n if prefixSum % k not in sumToIndex:\\n sumToIndex[prefixSum % k] = i\\n return False\",\n \"runtime\": \"543\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n map = {0: -1} # To handle the case where the sub-array starts from index 0\\n sum = 0\\n\\n for i in range(len(nums)):\\n sum += nums[i]\\n rem = sum % k\\n\\n if rem in map:\\n if i - map[rem] > 1:\\n return True\\n else:\\n map[rem] = i\\n\\n return False\\n \",\n \"runtime\": \"543\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix = {0:-1}\\n sum_so_far = 0\\n for i, num in enumerate(nums):\\n sum_so_far += num\\n remainder = sum_so_far % k\\n if remainder not in prefix:\\n prefix[remainder] = i\\n elif i - prefix[remainder] >= 2:\\n return True\\n return False\\n \",\n \"runtime\": \"554\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n d = {0:-1}\\n\\n tmp = 0\\n\\n for v,i in enumerate(nums):\\n tmp += i\\n if tmp % k in d:\\n if abs(v-d[tmp%k]) > 1:\\n return True\\n else:\\n d[tmp%k] = v\\n return False\",\n \"runtime\": \"554\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # a * k + x1 (b + 1) * k + x2 \\n # x2 - x1 = 0 or \\n seen = {0:-1}\\n curr = 0\\n for i in range(len(nums)):\\n \\n curr += nums[i]\\n m = curr % k\\n # print(i, curr, m, seen)\\n if m in seen:\\n if i - seen[m] > 1:\\n return True\\n else:\\n seen[m] = i\\n \\n return False\\n\",\n \"runtime\": \"565\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total = 0\\n mods = {0:-1}\\n for i in range(0,len(nums)):\\n total = nums[i] + total\\n cur_mod = total % k\\n if cur_mod in mods and i - mods[cur_mod] > 1:\\n return True\\n if cur_mod not in mods:\\n mods[cur_mod] = i\\n return False\\n\\n \\n\",\n \"runtime\": \"576\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n prefix_sum = 0\\n\\n mod_map = {0:-1} # stores mod and index\\n\\n for i in range(len(nums)):\\n\\n prefix_sum += nums[i]\\n\\n mod = prefix_sum%k\\n if mod in mod_map:\\n\\n if i - mod_map[mod] > 1:\\n return True\\n else:\\n\\n mod_map[mod] = i\\n return False\\n \",\n \"runtime\": \"586\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n tot = 0\\n dicti = collections.defaultdict()\\n for i, num in enumerate(nums):\\n tot += num\\n rem = tot % k\\n if(i > 0 and rem == 0):\\n return True\\n if(rem in dicti):\\n if( i - dicti[rem] > 1):\\n return True\\n else:\\n dicti[rem] = i\\n return False\\n\",\n \"runtime\": \"586\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n\\n if n == 1:\\n return False\\n\\n remainder_map = {0 : -1} # key: remainder, value: index\\n prefix_sum = 0\\n\\n for i in range(n):\\n prefix_sum += nums[i]\\n if prefix_sum % k in remainder_map:\\n if i - remainder_map[prefix_sum % k] >= 2:\\n return True\\n else:\\n remainder_map[prefix_sum % k] = i\\n \\n return False\",\n \"runtime\": \"597\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n cum_sum = 0\\n remainder_index = {0: -1}\\n\\n for i, num in enumerate(nums):\\n cum_sum += num\\n remainder = cum_sum % k\\n\\n if remainder in remainder_index and i - remainder_index[remainder] > 1:\\n return True\\n elif remainder not in remainder_index:\\n remainder_index[remainder] = i\\n\\n return False\",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n reminders_index_map = {0: -1}\\n\\n cur_sum = 0\\n\\n for i, n in enumerate(nums):\\n cur_sum += n\\n\\n reminder = cur_sum % k\\n\\n if reminder in reminders_index_map:\\n\\n prev_reminder_i = reminders_index_map[reminder]\\n\\n if abs(prev_reminder_i - i) > 1:\\n return True\\n\\n reminders_index_map[reminder] = min(prev_reminder_i, i)\\n else:\\n reminders_index_map[reminder] = i\\n\\n return False\\n \",\n \"runtime\": \"619\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums, k):\\n prefix_mod = 0\\n mod_seen = {0: -1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n\\n if prefix_mod in mod_seen:\\n # ensures that the size of subarray is at least 2\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else:\\n # mark the value of prefix_mod with the current index.\\n mod_seen[prefix_mod] = i\\n\\n return False\",\n \"runtime\": \"619\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = 0\\n mods_seen = {0: -1}\\n\\n for ix, n in enumerate(nums):\\n prefix_mod = (prefix_mod + n) % k\\n\\n if prefix_mod in mods_seen:\\n if ix - mods_seen[prefix_mod] > 1:\\n return True\\n else:\\n mods_seen[prefix_mod] = ix\\n \\n return False\",\n \"runtime\": \"630\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n hashmap = {0: -1}\\n total = 0\\n for i, n in enumerate(nums):\\n total += n\\n remainder = total % k\\n if remainder not in hashmap:\\n hashmap[remainder] = i\\n elif i - hashmap[remainder] >= 2:\\n return True\\n return False\",\n \"runtime\": \"640\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\\"\\\"\\\"\\n 1. Initialize a dictionary to store the remainder of the cumulative sum divided by k and their corresponding indices.\\n 2. Iterate over the array, updating the cumulative sum.\\n 3. For each cumulative sum, calculate the remainder when divided by k.\\n 4. If the remainder is in the dictionary and the difference between the current index and the index in the dictionary is greater than 1, return True.\\n 5. If the remainder is not in the dictionary, add it to the dictionary with the current index.\\n 6. If we finish iterating over the array without finding a good subarray, return False.\\n \\\"\\\"\\\"\\n remainder_index = {0:-1}\\n cumulative_sum = 0\\n \\n for i, num in enumerate(nums):\\n cumulative_sum += num\\n remainder = cumulative_sum % k\\n if remainder in remainder_index and i - remainder_index[remainder] > 1:\\n return True\\n elif remainder not in remainder_index:\\n remainder_index[remainder] = i\\n return False \",\n \"runtime\": \"651\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) == 0 or len(nums) == 1:\\n return False\\n \\n d = {}\\n mod_sum = nums[0] % k\\n d[mod_sum] = 0\\n\\n for i, n in enumerate(nums[1:], start=1):\\n mod_sum = (mod_sum + n) % k\\n if mod_sum == 0:\\n return True\\n elif mod_sum in d and i != d[mod_sum] + 1:\\n return True\\n elif mod_sum not in d:\\n d[mod_sum] = i\\n return False\\n \",\n \"runtime\": \"662\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix = 0\\n prefixToIndex = {0: -1}\\n\\n for i, num in enumerate(nums):\\n prefix += num\\n if k != 0:\\n prefix %= k\\n if prefix in prefixToIndex:\\n if i - prefixToIndex[prefix] > 1:\\n return True\\n else:\\n prefixToIndex[prefix] = i\\n\\n return False\",\n \"runtime\": \"673\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = 0\\n mod_seen = {0:-1}\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n # R1 = R2\\n if prefix_mod in mod_seen:\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else: \\n mod_seen[prefix_mod] = i\\n return False\\n \",\n \"runtime\": \"684\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n p = 0\\n d = {0:-1}\\n for i in range(len(nums)):\\n p += nums[i]\\n p %= k\\n if(p in d):\\n if(i > d[p]+1):\\n return 1\\n else:\\n d[p] = i\\n return 0\",\n \"runtime\": \"694\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n N = len(nums)\\n # for i in range(N):\\n # s = nums[i]\\n # for j in range(i+1, N):\\n # s += nums[j]\\n # if (s % k) == 0:\\n # return True\\n # return False\\n \\n # https://www.youtube.com/watch?v=OKcrLfR-8mE\\n \\n # this is not return the first solution \\n \\n rem = 0\\n remD = {0 :-1}\\n\\n for i, v in enumerate(nums):\\n rem = (rem + v) % k\\n if rem in remD:\\n if i - remD[rem] > 1:\\n return True\\n else:\\n remD[rem] = i\\n \\n return False\\n\\n\\n \",\n \"runtime\": \"694\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n sSet = set()\\n s = 0\\n preS = 0\\n # sSet.add(0) \\n for num in nums:\\n preS = s\\n s += num\\n s %= k\\n if s in sSet: return True\\n sSet.add(preS) \\n return False \",\n \"runtime\": \"705\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n\\n if n == 1:\\n return False\\n\\n remainder_map = {nums[0] % k : 0, 0 : -1} # key: remainder, value: index\\n prefix_sums = [nums[0]]\\n\\n for i in range(1, n):\\n new_sum = nums[i] + prefix_sums[i - 1]\\n if new_sum % k in remainder_map:\\n if i - remainder_map[new_sum % k] >= 2:\\n return True\\n else:\\n remainder_map[new_sum % k] = i\\n \\n prefix_sums.append(new_sum)\\n\\n return False\",\n \"runtime\": \"716\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n running_sum = 0\\n remainder_map = {0 : -1}\\n\\n for i in range(len(nums)):\\n running_sum += nums[i]\\n remainder = running_sum % k\\n\\n if remainder in remainder_map:\\n if i - remainder_map[remainder] > 1:\\n return True\\n else:\\n remainder_map[remainder] = i\\n return False\",\n \"runtime\": \"716\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n dt = {}\\n dt[0] = -1\\n total=0\\n for i in range(0,len(nums)):\\n total+=nums[i]\\n rem = total%k\\n if rem in dt and i - dt[rem] >=2:\\n return True\\n elif rem not in dt:\\n dt[rem] = i\\n return False\",\n \"runtime\": \"727\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainder = {0:-1} #remainder: end index\\n #set the initial remainder to {0,-1} because the first element in nums might be a \\n total = 0\\n for i, n in enumerate(nums):\\n total += n\\n r = total % k\\n if r not in remainder:\\n remainder[r] = i\\n elif i - remainder[r] > 1:\\n return True\\n return False\\n\\n#Time, Space: O(n)\\n\\n\\n\\n \",\n \"runtime\": \"738\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = 0\\n mod_seen = {0: -1} # initialized to account for the intial value of prefix_mod\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n if prefix_mod in mod_seen:\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else:\\n mod_seen[prefix_mod] = i\\n\\n print(prefix_mod, mod_seen)\\n return False\\n\",\n \"runtime\": \"748\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n Clarifying question:\\n boolean output -> true if contains a 'good subarray'\\n its length is at least two, and\\n the sum of the elements of the subarray is a multiple of k.\\n\\n 0 is always a multiple of k.\\n 0 alone isnt a valid solution but two consecutive 0's are, [0,0] \\n\\n Brute force:\\n O(n^2) loop all subarrays and check if sum is % k.\\n Arr isn't sorted so cant do a sliding window.\\n\\n Improved:\\n sum % k == 0 -> is a multiple because no remainder.\\n Trick:\\n If two subarrays have same mod remainder, then the val diff between them is k.\\n e.g. nums = [23,2,4,6,7], k = 6. the mod will be 0 so remainder + 0 (multi of k).\\n [23,25,29,35,42] -> modded [5,1,5,5,0]\\n create modded prefix hm {modded prefix:index}\\n Need to check the index diff (subarray size) between them is >= 2.\\n Need to initialise prefix_hm with {0,-1}. This triggers if a sum multi or k has been found from first index.\\n e.g. [23,2,4,6,6], k = 7\\n\\n O(n)\\n '''\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_hm = {0:-1}\\n curr_sum = 0\\n\\n for i, num in enumerate(nums):\\n curr_sum += num\\n curr_prefix = curr_sum % k\\n\\n if curr_prefix in prefix_hm:\\n if i - prefix_hm[curr_prefix] >= 2:\\n return True\\n else:\\n # only write if it doesnt exist.\\n # dont overwrite to max chance of increasing subarray distance\\n # >= 2\\n prefix_hm[curr_prefix] = i\\n\\n return False\\n\",\n \"runtime\": \"748\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n\\n mod_map = {0: -1}\\n current_sum = 0\\n for i, n in enumerate(nums): \\n current_sum += n\\n prefix_mod = current_sum % k\\n if prefix_mod in mod_map:\\n print(mod_map[prefix_mod], i, i - mod_map[prefix_mod])\\n if i - mod_map[prefix_mod] > 1:\\n return True\\n else:\\n mod_map[prefix_mod] = i\\n\\n print(mod_map) \\n return False\",\n \"runtime\": \"759\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # nums = [num%k for num in nums]\\n cur_sum, n = 0, len(nums)\\n prefix_sum = {0: -1}\\n for i in range(n):\\n cur_sum += nums[i]\\n cur_sum %= k\\n # if i>=1 and cur_sum==0:\\n # return True\\n target1, target2 = cur_sum, -1*cur_sum\\n if target1 in prefix_sum or target2 in prefix_sum:\\n if target1 in prefix_sum and i-prefix_sum[target1]>1:\\n return True\\n if target2 in prefix_sum and i-prefix_sum[target2]>1:\\n return True\\n if cur_sum not in prefix_sum:\\n prefix_sum[cur_sum] = i\\n # print(prefix_sum)\\n\\n return False\\n\\n\\n\\n \",\n \"runtime\": \"770\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # get the accumulated sum\\n runner_sum = 0\\n\\n # get the mod as a dict (mod: [idx])\\n mod_dict = {0: -1}\\n\\n for i, v in enumerate(nums):\\n runner_sum += v\\n residual = runner_sum % k\\n if residual in mod_dict:\\n if i - mod_dict[residual] > 1:\\n return True\\n else:\\n mod_dict[residual] = i\\n return False\",\n \"runtime\": \"781\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n presum =0\\n p ={ 0:-1}\\n\\n for i in range(len(nums)):\\n presum = (presum+nums[i]) % k\\n if presum not in p:\\n p[presum] =i\\n else:\\n if i -p[presum] >1:\\n return True\\n\\n print (p)\\n return False\\n\\n\\n\\n\\n\\n \\n\\n#mod_seen { 0:-1, 5:0, 1:1, 5:2}\",\n \"runtime\": \"792\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n # dict to store prefix sum\\n prefix_sum_remainders = {0: -1}\\n\\n cumulative_sum = 0\\n\\n # iterate through nums\\n for i in range(len(nums)):\\n #add to sum\\n cumulative_sum += nums[i]\\n\\n remainder = cumulative_sum % k\\n\\n if remainder in prefix_sum_remainders:\\n #check distance between prev and cur index\\n if i - prefix_sum_remainders[remainder] > 1:\\n return True\\n else:\\n #store remainder and index\\n prefix_sum_remainders[remainder] = i\\n \\n return False\\n\\n\\n\",\n \"runtime\": \"802\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n total = 0\\n h = {0: -1}\\n\\n for i, n in enumerate(nums):\\n total += n\\n rem = total % k\\n\\n if rem not in h:\\n h[rem] = i\\n elif i - h[rem] > 1:\\n return True\\n\\n\\n return False\",\n \"runtime\": \"813\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # time O(n), space O(n)\\n prefix_mod = 0\\n mod_seen = {0: -1}\\n\\n for idx, num in enumerate(nums):\\n prefix_mod = (prefix_mod + num) % k\\n\\n if mod_seen.get(prefix_mod, len(nums)) < idx - 1:\\n return True \\n \\n if prefix_mod not in mod_seen:\\n mod_seen[prefix_mod] = idx\\n \\n return False\\n\\n# k = 6 \\n\\n\\n# 23, 2, 4, 6, 7\\n# 0,23,25,29,35,42\\n# i j\\n\",\n \"runtime\": \"824\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # relationship between sum[i] and sum[j]\\n # only have access to sum[i] and sum[j]\\n # sum[j] - sum[i] = x, x = n * k\\n # sum[j] - n * k = sum[i]\\n # 29 - (1*6) = 23\\n # 29 - (2*6) = 17\\n d = {0: -1}\\n total = 0\\n for i in range(len(nums)):\\n total += nums[i]\\n r = total % k\\n if r in d:\\n if i - d[r] > 1:\\n return True\\n else:\\n d[r] = i\\n print(d)\\n return False\\n\\n\\n\\n \\n\\n \\n \\n\\n \\n \",\n \"runtime\": \"835\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n d = defaultdict(int)\\n sum1 = 0\\n for i in range(len(nums)):\\n sum1+=nums[i]\\n if sum1%k==0 and i>=1:\\n return True\\n if sum1%k in d and i - d[sum1%k]>1:\\n return True\\n if sum1%k not in d:\\n d[sum1%k] = i\\n return False\\n \",\n \"runtime\": \"835\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum_editoral(self, nums: List[int], k: int) -> bool:\\n\\n \\n prefix_mode = 0\\n mode_seen = {0: -1}\\n\\n for i in range(len(nums)):\\n\\n prefix_mode = (prefix_mode + nums[i]) % k\\n\\n if prefix_mode in mode_seen:\\n if i - mode_seen[prefix_mode] > 1:\\n return True\\n\\n else:\\n mode_seen[prefix_mode] = i\\n\\n return False\\n\\n\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n prefix_summ = 0\\n rest_pred = 0\\n rest_set = set()\\n\\n for i in range(len(nums)):\\n\\n prefix_summ += nums[i]\\n rest = prefix_summ % k\\n\\n if rest in rest_set:\\n \\n return True\\n\\n rest_set.add(rest_pred)\\n rest_pred = rest\\n\\n return False\\n\",\n \"runtime\": \"846\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum = 0\\n mod_dict = {0: -1}\\n for i, num in enumerate(nums):\\n prefix_sum += num\\n mod = prefix_sum % k\\n if mod in mod_dict:\\n if i - mod_dict[mod] > 1:\\n return True\\n else:\\n mod_dict[mod] = i\\n return False\",\n \"runtime\": \"878\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainderMap = {0:-1}\\n s = 0\\n for i in range(len(nums)):\\n s+=nums[i]\\n if s%k not in remainderMap:\\n remainderMap[s%k] = i \\n elif i - remainderMap[s%k] > 1:\\n return True\\n return False\\n\",\n \"runtime\": \"878\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod =0\\n count = {0:-1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod+nums[i])%k\\n if prefix_mod in count:\\n if i-count[prefix_mod]>1:\\n return True \\n else:\\n count[prefix_mod]=i\\n return False \",\n \"runtime\": \"889\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n hashmap = {0:-1}\\n cursum = 0\\n\\n for i,n in enumerate(nums):\\n cursum+=n\\n\\n if cursum%k in hashmap:\\n if i-hashmap[cursum%k] >1:\\n return True\\n else:\\n hashmap[cursum%k] = i\\n\\n return False\\n\\n\\n\\n \",\n \"runtime\": \"889\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n presum = 0\\n mod2index = {0: 0}\\n n = len(nums)\\n for i in range(1, n+1):\\n presum += nums[i-1]\\n mod = presum % k\\n if mod in mod2index:\\n if i - mod2index[mod] >= 2:\\n print(i, mod2index[mod])\\n return True\\n else:\\n mod2index[mod] = i\\n \\n return False\\n \\n\",\n \"runtime\": \"900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n d = {0:-1}\\n curr_sum = 0\\n\\n for i, n in enumerate(nums):\\n curr_sum += n\\n rem = curr_sum % k\\n if rem in d:\\n if i - d[rem] >= 2:\\n return True\\n else:\\n d[rem] = i\\n\\n return False\\n\\n\\n \\n \",\n \"runtime\": \"900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainders = {0: -1} #{remainder, end_index}\\n r_sum = 0\\n\\n for i in range(len(nums)):\\n r_sum += nums[i]\\n rem = r_sum % k\\n\\n if rem in remainders:\\n if i - remainders[rem] > 1:\\n return True\\n else:\\n remainders[rem] = i\\n \\n return False\\n\",\n \"runtime\": \"910\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n remainder_index = {0:-1}\\n cumsum = 0\\n \\n for i in range(len(nums)):\\n cumsum += nums[i]\\n remainder = cumsum % k\\n if remainder in remainder_index and i - remainder_index[remainder] >=2:\\n return True\\n elif remainder not in remainder_index:\\n remainder_index[remainder] = i\\n \\n return False\\n \\n \",\n \"runtime\": \"910\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum = 0\\n sum_map = {0: -1} # Initialize with 0 at index -1\\n \\n for i, num in enumerate(nums):\\n prefix_sum += num\\n \\n if k != 0:\\n prefix_sum %= k\\n \\n if prefix_sum in sum_map:\\n if i - sum_map[prefix_sum] >= 2:\\n return True\\n else:\\n sum_map[prefix_sum] = i\\n \\n return False\",\n \"runtime\": \"921\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n\\n mapp = {0: -1}\\n summ = 0\\n for i, num in enumerate(nums):\\n summ+=num\\n mod = summ % k\\n\\n if mod not in mapp:\\n mapp[mod] = i\\n \\n if i - mapp[mod] > 1:\\n return True\\n \\n return False\",\n \"runtime\": \"921\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n\\n prefix = {\\n 0: -1,\\n }\\n cur_prefix = 0\\n\\n for i in range(len(nums)):\\n cur_prefix += nums[i]\\n if cur_prefix % k in prefix and i - prefix[cur_prefix % k] >= 2:\\n return True\\n \\n prefix[cur_prefix % k] = prefix.get(cur_prefix % k, i)\\n\\n return False\\n\\n\\n \",\n \"runtime\": \"932\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n #[[6,12,19],[10,17],11,7]\\n # have a hash for previous possible substring values\\n # also check with previous value\\n # \\n seen_mods = {}\\n suma = 0\\n for index in range(len(nums)):\\n suma += nums[index]\\n mod_val = suma % k\\n if mod_val in seen_mods and index - seen_mods[mod_val] > 1:\\n return True\\n elif index != 0 and mod_val == 0:\\n return True\\n elif mod_val not in seen_mods:\\n seen_mods[mod_val] = index\\n\\n return False\\n\\n\\n\",\n \"runtime\": \"932\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums, k):\\n prefix_mod = 0\\n mod_seen = {0: -1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n\\n if prefix_mod in mod_seen:\\n # ensures that the size of subarray is at least 2\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else:\\n # mark the value of prefix_mod with the current index.\\n mod_seen[prefix_mod] = i\\n\\n return False\",\n \"runtime\": \"943\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n memo = {}\\n curSum = 0\\n for i in range(len(nums)):\\n num = nums[i]\\n curSum += num\\n \\n if curSum % k == 0 and i > 0:\\n return True\\n if curSum % k in memo and i - memo[curSum % k] > 1:\\n return True\\n \\n if curSum % k not in memo:\\n memo[curSum % k] = i\\n return False\",\n \"runtime\": \"943\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n prefixsum = 0\\n hmap = {}\\n hmap[0] = 0\\n\\n for i in range(len(nums)):\\n prefixsum += nums[i]\\n if prefixsum%k in hmap:\\n if i+1 - hmap[prefixsum%k] >= 2:\\n return True\\n\\n if prefixsum%k not in hmap:\\n hmap[prefixsum%k] = i+1\\n\\n \\n \\n return False\\n \",\n \"runtime\": \"954\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n csum = 0\\n hmap = {0 : -1}\\n for i,n in enumerate(nums):\\n csum = (csum + n) % k\\n\\n if (csum) in hmap and i - hmap[csum] >= 2:\\n return True\\n elif csum not in hmap:\\n hmap[csum] = i\\n return False\",\n \"runtime\": \"954\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum_dict = collections.defaultdict(list)\\n prefix_sum_dict[0].append(-1)\\n prefix_sum = 0\\n for i, num in enumerate(nums):\\n prefix_sum += num\\n num_to_insert = prefix_sum % k\\n prefix_sum_dict[num_to_insert].append(i)\\n indexed_items = prefix_sum_dict[num_to_insert]\\n if len(indexed_items) > 1 and indexed_items[-1] - indexed_items[0] > 1:\\n return True\\n return False\\n\\n \\n\",\n \"runtime\": \"964\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = 0\\n mod_seen = {0: -1}\\n\\n for i in range(len(nums)):\\n prefix_mod = (prefix_mod + nums[i]) % k\\n\\n if prefix_mod in mod_seen:\\n if i - mod_seen[prefix_mod] > 1:\\n return True\\n else:\\n mod_seen[prefix_mod] = i\\n\\n return False\",\n \"runtime\": \"964\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum_map = {}\\n curr_sum = 0\\n for i, n in enumerate(nums):\\n curr_sum += n\\n modul = curr_sum % k\\n if modul == 0 and i > 0:\\n return True\\n\\n if modul not in prefix_sum_map:\\n prefix_sum_map[modul] = [i]\\n else:\\n if any(i - idx >= 2 for idx in prefix_sum_map[modul]):\\n return True\\n prefix_sum_map[modul].append(i)\\n \\n return False\\n \\n \\n \",\n \"runtime\": \"975\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n map = {0:-1}\\n curr_sum = 0\\n\\n for idx, num in enumerate(nums):\\n curr_sum += num\\n reminder = curr_sum%k\\n if idx - map.get(reminder, idx) >= 2:\\n return True\\n map[reminder] = min(idx, map.get(reminder, idx))\\n\\n return False\",\n \"runtime\": \"975\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":111,"string":"111"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n def rf(ls):\n if len(ls) == 1:\n return False\n\n m = (0 + len(ls) - 1) // 2\n nextm = m + 1\n # blocks 0 .. m, m + 1 .. len(ls) - 1\n\n sums = set()\n i = m\n sm = 0\n while i >= 0:\n sm = (sm + ls[i]) % k\n sums.add(k - sm if sm != 0 else 0)\n i -= 1\n \n i = nextm\n sm = 0\n while i < len(ls):\n sm = (sm + ls[i]) % k\n if (sm % k) in sums:\n return True\n i += 1\n \n ltrue = rf(ls[:m+1])\n if ltrue:\n return True\n rtrue = rf(ls[m+1:])\n if rtrue:\n return True\n \n return False\n\n return rf(nums)\n\n\n\n\n","memory":"30400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n def rf(ls):\n if len(ls) == 1:\n return False\n\n m = (0 + len(ls) - 1) // 2\n nextm = m + 1\n # blocks 0 .. m, m + 1 .. len(ls) - 1\n\n sums = set()\n i = m\n sm = 0\n while i >= 0:\n sm = (sm + ls[i]) % k\n sums.add(k - sm if sm != 0 else 0)\n i -= 1\n \n i = nextm\n sm = 0\n while i < len(ls):\n sm = (sm + ls[i]) % k\n if (sm % k) in sums:\n return True\n i += 1\n \n ltrue = rf(ls[:m+1])\n if ltrue:\n return True\n rtrue = rf(ls[m+1:])\n if rtrue:\n return True\n \n return False\n \n def ap2(nums):\n rhm = dict()\n\n i = len(nums) -1\n s = 0\n while i >= 0:\n s = (s + nums[i]) % k\n if s not in rhm:\n rhm[s] = i\n i -= 1\n rhm[0] = len(nums)\n allsum = s\n\n # -1 Iteration \n if allsum in rhm and rhm[allsum] > 1:\n return True\n\n i = 0\n s = 0\n while i < len(nums) - 1:\n s = (s + nums[i]) % k\n tosearch = (allsum - s) % k\n if tosearch not in rhm:\n i += 1\n continue\n \n if rhm[tosearch] > i + 2:\n return True\n\n i += 1\n \n return False\n \n def ap3(nums):\n prefixmod = 0\n modseen = dict()\n modseen[0] = -1\n\n for i, n in enumerate(nums):\n prefixmod = (prefixmod + n) % k\n if prefixmod in modseen:\n leftindx = modseen[prefixmod]\n if (leftindx + 1) < i:\n return True\n else:\n modseen[prefixmod] = i\n \n return False\n\n \n apr = 1\n if apr == 1:\n return rf(nums)\n elif apr == 2:\n return ap2(nums)\n elif apr == 3:\n return ap3(nums)\n\n\n \n\n\n\n \n \n\n\n \n\n\n\n\n\n\n\n","memory":"30600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n return self.helper(nums, 0, len(nums) - 1, k)\n\n def helper(self, nums: List[int], i: int, j: int, k: int) -> bool:\n #print(f'i, j={i}, {j}')\n if i >= j: return False # need 2 successive\n mid = (i + j) // 2\n if self.helper(nums, i, mid, k):\n return True\n if self.helper(nums, mid+1, j, k):\n return True\n modulo_set, suffix_sum = set(), 0\n for x in range(mid, i-1, -1): #suffix sum from the middle\n suffix_sum = (suffix_sum + nums[x]) % k\n modulo_set.add(suffix_sum)\n prefix_sum = 0\n for x in range(mid+1, j+1): #prefix sum from mid+1\n prefix_sum = (prefix_sum + nums[x]) % k\n if (k - prefix_sum)%k in modulo_set:\n #print(f' mid={mid}, x={x}, nums[{x}]={nums[x]}, set={modulo_set}')\n return True\n return False","memory":"30700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n preSum = nums[0]\n modSeen = set()\n for i in range(1, len(nums)):\n curSum = preSum + nums[i]\n curMod = curSum % k\n if not curMod or curMod in modSeen:\n return True\n modSeen.add(preSum % k)\n preSum = curSum\n return False","memory":"31000"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n s, prev_d, set_d = 0, 0, set()\n for i in nums:\n s += i\n dif = s % k\n if dif in set_d:\n return True\n set_d.add(prev_d)\n prev_d = dif\n return False\n\n","memory":"31200"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n prefix = [0]\n for num in nums:\n prefix.append(num + prefix[-1])\n \n seen = set()\n\n for i in range(2, len(prefix)):\n\n prev = prefix[i - 2] % k\n seen.add(prev)\n\n if prefix[i] % k in seen:\n return True\n return False\n","memory":"31300"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n s, prev_d, set_d = 0, 0, set()\n for num in nums:\n s += num\n d = s%k\n if d in set_d:\n return True\n set_d.add(prev_d)\n prev_d = d\n return False ","memory":"31400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefixes = set()\n n = len(nums)\n cumSum = 0\n for val in nums:\n prevCumSum = cumSum\n cumSum += val\n\n if cumSum%k in prefixes:\n return True\n # Add previous to maintain 2 elements\n prefixes.add(prevCumSum%k)\n \n return False\n","memory":"31500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_mod = [0]\n prefix_mod_set = set()\n for i, n in enumerate(nums):\n mod = (prefix_mod[-1] + n) % k\n prefix_mod.append(mod)\n if i >= 1:\n prefix_mod_set.add(prefix_mod[i - 1])\n if mod in prefix_mod_set:\n return True\n\n return False","memory":"31600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n rems=[nums[0]%k]\n rem_dict=set()\n for i in range(1,len(nums)):\n rems.append((rems[-1]+nums[i])%k)\n if i>=2:\n rem_dict.add(rems[i-2])\n if rems[-1]==0 or rems[-1] in rem_dict:\n return True\n return False","memory":"31700"},{"code":"from typing import List\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remainders = set() # Set to track remainders\n previous_remainder = 0 # To track the remainder of the sum up to the previous position\n current_sum = 0 # Tracks the running sum\n \n for num in nums:\n current_sum += num # Update running sum\n if current_sum % k in remainders:\n return True # A subarray with sum multiple of k exists\n remainders.add(previous_remainder) # Add previous remainder to the set\n previous_remainder = current_sum % k # Update previous remainder with current\n \n return False\n","memory":"31700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pre = {0, nums[0]%k}\n cur_sum = nums[0]\n for i, n in enumerate(nums[1:], start=1):\n cur_sum += n\n mod = cur_sum % k\n if mod in pre:\n if n % k != 0 or nums[i-1] % k == 0:\n return True\n else:\n pre.add(mod)\n\n return False\n\n\n ","memory":"31800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n preSum = 0\n\n s = set()\n rem = 0\n for i in range(n):\n preSum += nums[i]\n x = preSum%k\n\n if x in s:\n return True\n\n s.add(rem)\n rem = x\n\n return False\n","memory":"31800"},{"code":"from collections import deque\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n queue = deque()\n queue.append(0)\n \n pref = set()\n curr = 0\n \n for number in nums:\n curr += number\n queue.append(curr%k)\n \n if len(queue) > 2:\n pref.add(queue.popleft())\n \n if curr % k in pref:\n return True\n \n return False\n ","memory":"32000"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n lasts = {0} # Добавляем остаток 0\n s = 0\n prev = None\n for i in range(len(nums)):\n s += nums[i]\n if i > 0 and (s % k) in lasts:\n return True\n if prev:\n lasts.add(prev % k)\n prev = s\n # lasts.add((s - nums[i]) % k) # Добавляем предыдущий остаток\n\n return False\n ","memory":"32100"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n lasts = {0} # Добавляем остаток 0\n s = 0\n prev = None\n for i in range(len(nums)):\n s += nums[i]\n if i > 0 and (s % k) in lasts:\n return True\n if prev:\n lasts.add(prev % k)\n prev = s\n # lasts.add((s - nums[i]) % k) # Добавляем предыдущий остаток\n\n return False","memory":"32200"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n lasts = {0} # Добавляем остаток 0\n s = 0\n prev = None\n for i in range(len(nums)):\n s += nums[i]\n if i > 0 and (s % k) in lasts:\n return True\n if prev:\n lasts.add(prev % k)\n prev = s\n # lasts.add((s - nums[i]) % k) # Добавляем предыдущий остаток\n\n return False\n ","memory":"32299"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n a = len(nums) * [0]\n a[0] = nums[0]\n for i in range(1, len(nums)):\n a[i] = a[i-1] + nums[i]\n s = set()\n s. add(a[0] % k)\n if not a[1] % k:\n return True\n for i in range(2, len(nums)):\n m = a[i] % k\n if m in s or not m:\n return True\n s.add(a[i-1] % k)\n \n return False","memory":"32400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n a = len(nums) * [0]\n a[0] = nums[0]\n for i in range(1, len(nums)):\n a[i] = a[i-1] + nums[i]\n s = set()\n s. add(a[0] % k)\n if not a[1] % k:\n return True\n for i in range(2, len(nums)):\n m = a[i] % k\n if m in s or not m:\n return True\n s.add(a[i-1] % k)\n return False","memory":"32400"},{"code":"from collections import deque\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pref_sum = [nums[0]%k]\n \n for i in range(1, len(nums)):\n pref_sum.append((pref_sum[-1]+nums[i]) % k)\n \n \n queue = deque()\n hashset = set()\n for i in pref_sum:\n if i in hashset or (i == 0 and len(queue) >= 1):\n return True\n \n if len(queue) >= 1:\n hashset.add(queue.popleft())\n \n queue.append(i)\n \n return False\n \n ","memory":"32500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n a = len(nums) * [0]\n a[0] = nums[0]\n for i in range(1, len(nums)):\n a[i] = a[i-1] + nums[i]\n s = set()\n for i in range(1, len(nums)):\n m = a[i] % k\n if m in s or not m:\n return True\n s.add(a[i-1] % k)\n return False","memory":"32600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n a = [ nums[0] ]\n for n in nums[1:]:\n a.append(n + a[-1])\n s = set()\n for i in range(1, len(nums)):\n m = a[i] % k\n if m in s or not m:\n return True\n s.add(a[i-1] % k)\n return False","memory":"32600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix = 0\n seen = set()\n previous = 0 # This tracks the previous prefix sum mod k\n if len(nums) < 2: return False\n for i in range(len(nums)):\n prefix += nums[i]\n mod_value = prefix % k\n print(mod_value)\n if mod_value in seen:\n return True\n seen.add(previous) # Add the previous mod value\n previous = mod_value\n \n return False","memory":"32700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n s, prev_d, set_d = 0, 0, set()\n for num in nums:\n s += num\n d = s%k\n print(d)\n if d in set_d:\n return True\n set_d.add(prev_d)\n prev_d = d\n return False \n ","memory":"32800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix_sum = 0\n prefix_map = set()\n re = 0\n for i in range(len(nums)):\n prefix_sum += nums[i]\n reminder = prefix_sum % k\n print(prefix_sum, reminder)\n if reminder in prefix_map:\n return True\n prefix_map.add(re)\n re = reminder\n return False\n ","memory":"32900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n s = 0 #sum\n prev_d = 0\n set_d = {}\n for n in nums:\n s+=n\n d=s%k\n if d in set_d: \n return True\n set_d[prev_d]=1\n prev_d = d\n return False","memory":"33500"},{"code":"from collections import defaultdict\n\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n map_saver = defaultdict(int)\n sum_num = 0\n for i in range(len(nums)):\n sum_num += nums[i]\n map_saver[sum_num % k] += 1\n sum_num = 0\n for i in range(len(nums) - 1):\n need = sum_num % k\n map_saver[(sum_num + nums[i]) % k] -= 1\n if need in map_saver and map_saver[need] > 0:\n return True\n sum_num += nums[i]\n return False\n \n\n ","memory":"33600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) < 2:\n return False\n sums = []\n s = 0\n r_map = {}\n for i in range(len(nums)):\n if i > 0 and nums[i] % k == 0 and nums[i-1] % k == 0:\n return True\n s += nums[i]\n remain = s % k\n if remain == 0 and i != 0:\n return True\n if remain in r_map and s - r_map[remain] >= k and nums[i] % k != 0:\n return True \n r_map[remain] = s\n return False\n ","memory":"33800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n nums.insert(0, 0)\n for i in range(1, len(nums)):\n nums[i] = (nums[i - 1] + nums[i]) % k\n num_index = dict()\n for i, num in enumerate(nums):\n if num in num_index:\n if i - num_index[num] >= 2:\n return True\n else:\n num_index[num] = i\n return False","memory":"33900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n a = {0:-1}\n ans = 0\n for i in range(n):\n ans+=nums[i]\n nums[i] =ans%k\n if(nums[i] in a):\n if(i - a[nums[i]]>1):\n return True\n else:\n a[nums[i]] = i\n return False","memory":"33900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n for i in range(1,len(nums)):\n nums[i]+=nums[i-1]\n for i in range(len(nums)):\n nums[i]%=k\n dic={0:-1}\n # print(nums)\n for i in range(len(nums)):\n # print(dic)\n if nums[i] in dic and i-dic[nums[i]]>=2:\n return True\n elif nums[i] not in dic:\n dic[nums[i]]=i \n return False \n\n ","memory":"34000"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n if n == 1: return False\n nums[0] %= k \n for i in range(1, n):\n nums[i] = (nums[i] + nums[i-1]) % k\n if nums[i] == 0:\n return True\n mod_seen = {}\n for i in range(n):\n if nums[i] in mod_seen:\n if i - mod_seen[nums[i]] >= 2:\n return True\n else:\n mod_seen[nums[i]] = i\n return False\n","memory":"34100"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n if n == 1: return False\n nums[0] %= k \n for i in range(1, n):\n nums[i] = (nums[i] + nums[i-1]) % k\n if nums[i] == 0:\n return True\n mod_seen = {}\n for i in range(n):\n if nums[i] in mod_seen:\n if i - mod_seen[nums[i]] >= 2:\n return True\n else:\n mod_seen[nums[i]] = i\n return False\n","memory":"34100"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n table = dict()\n table[0] = -1\n sum = 0\n for i in range(len(nums)):\n sum += nums[i]\n mod = sum % k\n if mod in table:\n if i - table[mod] >= 2:\n return True\n else:\n table[mod] = i\n return False","memory":"34200"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n hm = {}\n pre_sum = 0\n\n for i in range(len(nums)):\n pre_sum += nums[i]\n rem = pre_sum % k\n\n if pre_sum % k == 0 and i >= 1:\n return True\n\n if rem in hm:\n if (i - hm[rem]) >= 2:\n return True\n else:\n hm[rem] = i\n \n return False","memory":"34300"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pref = [nums[0]]\n n = len(nums)\n for i in range(1, n):\n pref.append(pref[-1] + nums[i])\n\n pref = [x % k for x in pref]\n cache = defaultdict(int)\n cache[pref[0]] = 1\n for i in range(1, n):\n x = pref[i]\n if (cache[x] - (pref[i - 1] == x)) > 0:\n return True\n if x == 0:\n return True\n cache[x] += 1\n\n return False\n ","memory":"34600"},{"code":"from collections import defaultdict\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n presum = [0] * (n+1)\n for idx in range(1, n+1):\n presum[idx] = presum[idx-1] + nums[idx-1]\n \n remainder = defaultdict(int)\n for idx in range(2, n+1):\n val = presum[idx-2] % k\n remainder[val] += 1\n cur_val = presum[idx] % k\n if remainder[cur_val] > 0:\n return True\n\n return False\n\n ","memory":"34700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pre = 0\n seen = {0: -1}\n\n for i in range(len(nums)):\n pre = (pre + nums[i]) % k\n\n if pre in seen:\n if i - seen[pre] > 1:\n return \"true\"\n else:\n seen[pre] = i\n\n return \"false\"\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().checkSubarraySum(nums, next(inputs)),file=f)\nexit(0)","memory":"34800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n seen_remainders = {0: -1} # Handle remainder 0\n prefix = 0\n for i, num in enumerate(nums):\n prefix += num\n remainder = prefix % k\n \n if remainder in seen_remainders:\n # Check if subarray length is at least 2\n if i - seen_remainders[remainder] >= 2:\n return True\n else:\n seen_remainders[remainder] = i\n \n return False\n\n\n\n","memory":"34900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n data = { 0: -1 }\n cur = 0\n \n for i, n in enumerate(nums):\n cur += n\n diff = cur % k\n if diff in data:\n if i - data[diff] >= 2:\n return True\n else: continue\n data[diff] = i\n \n return False\n\n# Time Complexity : O(n)\n# Space Complexity : O(n)","memory":"35000"},{"code":"from collections import defaultdict\nclass Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n '''\n remainders = defaultdict(int)\n total = 0\n for i, n in enumerate(nums):\n total = (total + n) % k\n # if total == 0 and i >= 1:\n # return True\n if total not in remainders:\n remainders[total] = i\n elif i - remainders[total] >= 2:\n return True\n return False\n '''\n remainder = { 0: -1}\n total = 0\n\n for i, n in enumerate(nums):\n total += n\n r = total % k\n if r not in remainder:\n remainder[r] = i\n elif i - remainder[r] > 1:\n return True\n return False\n","memory":"35300"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n psum = 0\n hmap = {0: -1}\n for r, n in enumerate(nums):\n psum += n\n rem = psum % k\n if rem not in hmap and rem > 0:\n hmap[rem] = r\n else:\n if r - hmap[rem] > 1:\n return True\n return False","memory":"35400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if not nums or len(nums) <= 1:\n return False\n \n presum = [0] * len(nums)\n presum[0] = nums[0]\n\n map = dict() # key: presum value: the index\n map[presum[0] % k] = 0\n \n for i in range(1, len(nums)):\n presum[i] = presum[i - 1] + nums[i]\n if i >= 1 and presum[i] % k == 0:\n return True\n \n remainder = presum[i] % k\n if remainder in map:\n if i - map[remainder] >= 2:\n return True \n else:\n map[remainder] = i\n \n return False\n \n\n\n ","memory":"35500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n rem_dict = {0:-1}\n rem = 0\n for index,value in enumerate(nums):\n rem = (value + rem) % k\n if rem == 0:\n if index - rem_dict[0] > 1:\n return True\n if rem not in rem_dict:\n rem_dict[rem] = index\n else:\n if index - rem_dict[rem] > 1:\n return True\n return False\n ","memory":"35600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n sum_map = {0: -1}\n cur = 0\n for i, num in enumerate(nums):\n if k == 0:\n cur += num\n else:\n cur = (cur + num) % k\n if cur in sum_map and i - sum_map[cur] >= 2:\n return True\n if cur not in sum_map:\n sum_map[cur] = i\n return False","memory":"35700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n rem_dict = {0:-1}\n rem = 0\n for index,value in enumerate(nums):\n rem = (value + rem) % k\n if rem == 0:\n if index - rem_dict[0] > 1:\n return True\n if rem not in rem_dict:\n rem_dict[rem] = index\n else:\n if index - rem_dict[rem] > 1:\n return True\n return False\n ","memory":"35800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \"\"\"\n use a prefix sum and maintain the remainder when this sum is divided by k (prefix_sum%k).\n use a hash map (or dictionary) to store the first occurence of each remainder. \n if the same remainder appears again at a later index, then the subarray between these two indices has a sum that is a multiple of k.\n ensure that the subarray length is at least 2, so we should only check this condition if the current index is at least 2 positions ahead of the eariler index where this remainder was seen. \n \"\"\"\n # using a dictionary to store the remainder and its first occurence index\n remainder_map = {0:-1}\n prefix_sum = 0\n for i, num in enumerate(nums):\n prefix_sum += num\n if k!=0:\n prefix_sum %= k\n # check if this remainder has been seen before\n if prefix_sum in remainder_map.keys():\n if i-remainder_map[prefix_sum] > 1:\n return True\n else:\n remainder_map[prefix_sum] = i\n return False","memory":"35800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # instead of creating a prefixSsum array, created an array to store the remainders of the prefix sums\n # track the prefix sum seen so far in a variable\n # traverse the array and store the remainders of the prefix sums seen so far in an array\n # if we see the same remainder again, it means we have traversed an array sum which is the exact multiple of k\n # check the number of elements between the prev seen idx and the currentindex\n # is the diff is >=2: return True\n # of we don't return true from within the loop, return False\n \n \n remainders = {0:-1}\n prefixSum = 0\n \n for i, num in enumerate(nums):\n # update the prefix sum\n prefixSum += num\n rem = prefixSum % k\n \n if rem not in remainders:\n remainders[rem] = i\n \n elif i - remainders[rem] >= 2:\n return True\n \n else:\n continue\n \n return False","memory":"35900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n curSum = 0\n hashMap = {}\n countZero = 0\n for i in range(len(nums)):\n if nums[i] == 0:\n countZero += 1\n if countZero >= 2:\n return True\n else:\n countZero = 0\n curSum += nums[i]\n if curSum % k == 0 and i > 0:\n return True\n\n if curSum % k in hashMap:\n length = i - hashMap[curSum % k]\n if length >= 2:\n return True\n hashMap[curSum % k] = i\n return False","memory":"36000"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n track, cur = {0: -1}, 0\n for i in range(len(nums)):\n cur = (cur + nums[i]) % k\n if cur in track:\n if (i - track[cur]) > 1:\n return True\n else:\n track[cur] = i\n return False\n \n\n\n","memory":"36000"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remLookup = {}\n remLookup[0] = -1\n\n prefixSum = 0 \n for idx, num in enumerate(nums):\n prefixSum += num\n rem = prefixSum % k\n if rem in remLookup and idx - remLookup[rem] >= 2:\n return True\n if rem not in remLookup:\n remLookup[rem] = idx\n \n return False","memory":"36100"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n curr = 0 \n d= {0:-1}\n\n for i, n in enumerate(nums):\n curr += n\n curr = curr % k\n\n if curr in d and i - d[curr] >= 2:\n return True\n\n elif curr not in d:\n d[curr] = i\n\n return False","memory":"36100"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n presum = 0\n mod2index = {0: 0}\n n = len(nums)\n for i in range(1, n+1):\n presum += nums[i-1]\n mod = presum % k\n if mod in mod2index:\n if i - mod2index[mod] >= 2:\n print(i, mod2index[mod])\n return True\n else:\n mod2index[mod] = i\n \n return False\n \n","memory":"36200"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n curSum = 0\n hashMap = {}\n countZero = 0\n for i in range(len(nums)):\n if nums[i] == 0:\n countZero += 1\n if countZero >= 2:\n return True\n else:\n countZero = 0\n curSum += nums[i]\n if curSum % k == 0 and i > 0:\n return True\n\n if curSum % k in hashMap:\n length = i - hashMap[curSum % k]\n if length >= 2:\n return True\n hashMap[curSum % k] = i\n return False","memory":"36200"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n \n nowsum = 0\n mapp = {0:-1}\n for i in range(len(nums)):\n nowsum += nums[i]\n nowsum %= k\n # mapp = {}\n if nowsum in mapp:\n\n if (i - mapp[nowsum]) > 1:\n return True\n else:\n mapp[nowsum] = i\n return False\n","memory":"36300"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool: \n st = set()\n if not nums:\n return False \n if len(nums) == 1:\n return False \n dct={0:-1, k: -1}\n sm=0\n for i in range(len(nums)):\n sm += nums[i]\n sm %= k \n if sm in dct and -dct[sm]+i >= 2:\n return True \n if sm not in dct:\n dct[sm] = i\n return False","memory":"36300"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n modPrefix = 0\n modSeen = {0:-1}\n for i in range(len(nums)):\n modPrefix = (modPrefix+nums[i])%k\n if modPrefix in modSeen:\n if i - modSeen[modPrefix] > 1:\n return True\n else:\n modSeen[modPrefix] = i\n return False","memory":"36400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n seen ={0:-1}\n curr = 0\n for i in range(len(nums)):\n curr += nums[i]\n curr = curr%k\n if curr in seen and i-seen[curr] >=2:\n return True\n if curr not in seen:\n seen[curr] = i\n \n return False","memory":"36400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n reminder = {0: -1}\n total = 0\n for i,n in enumerate(nums):\n total += n\n r = total % k\n if r not in reminder:\n reminder[r] = i\n elif i - reminder[r] > 1:\n return True\n return False\n ","memory":"36500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n map = { 0: -1 }\n sm = 0\n for idx, val in enumerate(nums):\n sm += val\n if sm % k in map:\n if idx - map[sm % k] >= 2:\n return True\n else:\n map[sm % k] = idx\n \n\n return False\n","memory":"36500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n n = len(nums)\n pref = {}\n pref[0] = -1\n sm = 0\n for i in range(n):\n sm += nums[i]\n sm %= k\n if sm in pref:\n idx = pref[sm]\n if i - idx > 1:\n return True\n else:\n pref[sm] = i\n \n return False\n ","memory":"36600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pref = [0] * (len(nums) + 1)\n pref[0] = 0\n for i in range(1, len(nums) + 1):\n pref[i] = (nums[i-1] + pref[i - 1])%k\n d = {}\n for i, v in enumerate(pref):\n if v not in d:\n d[v] = i\n for i, val in enumerate(pref):\n if (res := val%k) in d:\n j = d[res]\n if j > i:\n break\n if i - j >= 2:\n return True\n return False","memory":"36600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n cum_sum_mod = []\n cur_sum = 0\n for i in range(len(nums)):\n cur_sum = cur_sum + nums[i]\n cum_sum_mod.append(cur_sum % k if k != 0 else cur_sum)\n hash_table = {0:-1}\n for i in range(len(cum_sum_mod)): \n if cum_sum_mod[i] not in hash_table: \n hash_table[cum_sum_mod[i]] = i\n elif cum_sum_mod[i] in hash_table and i - hash_table[cum_sum_mod[i]] >= 2:\n return True\n return False","memory":"36700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if sum(nums) % k == 0 and len(nums) >= 2:\n return True\n\n prefix_sum_mod = []\n sum_ = 0\n for num in nums:\n sum_ += num\n prefix_sum_mod.append(sum_ % k)\n\n mod_dic = {}\n for i in range (len(nums)):\n if prefix_sum_mod[i] not in mod_dic:\n mod_dic[prefix_sum_mod[i]] = i\n \n else:\n if i - mod_dic[prefix_sum_mod[i]] >= 2:\n return True\n\n if 0 in prefix_sum_mod[1:]:\n return True\n\n return False\n\n \n\n\n ","memory":"36700"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # HINT SOLUTION\n # the property we leverage is that if we keep a cumulative sum and record % k\n # at each index, then we know that if two of the same modulo remainders occur\n # at different indices, then we know that the subarray between them is\n # divisible by k. this is because when we subtract one from the other to get\n # the indices between them, the remainders cancel out.\n\n n = len(nums)\n if n == 1:\n return False\n remainders = [0]*n\n cur = 0\n for i in range(n):\n cur += nums[i]\n remainders[i] = cur % k # if (cur >= k or cur == 0) else -1\n remainders = [0] + remainders\n hm = {}\n for i in range(n+1):\n if remainders[i] in hm and (i - hm[remainders[i]]) >= 2 and remainders[i] != -1:\n return True\n else:\n hm[remainders[i]] = min(i, hm.get(remainders[i], i))\n return False","memory":"36800"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n modulos = {0: -1}\n sum = 0\n for i, n in enumerate(nums):\n sum += n\n mod = sum % k\n print(i, mod)\n if mod in modulos:\n if i - modulos[mod] > 1:\n return True\n else:\n modulos[mod] = i\n return False\n","memory":"36900"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # make prefix sum array of nums.\n # find if 2x sums are of the same modulo of k, and index diff >= 2\n pref = [0]\n s = 0\n mod = {0: -1}\n for i, n in enumerate(nums):\n s += n\n pref.append(s)\n m = s % k\n if m not in mod:\n mod[m] = i\n elif i - mod[m] >= 2:\n return True\n return False","memory":"37000"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n if len(nums) <= 1:\n return False\n # check contiguous subarrays\n # [a b] c d\n # a [b c] d\n n = len(nums)\n # [[23,2,4],6,7], k = 6\n # [1,4,-1,3] k = 4\n # [1,5,0,3]\n for i in range(1,n):\n nums[i] += nums[i-1]\n print(nums)\n previous_mod = {0: -1} #1-(-1)\n # [1,0] => [1,1]\n for i in range(n):\n # we care if cur_sum - prev_sum == 0 mod k\n prev_sum = nums[i] % k # diff = 4-3=1\n if prev_sum in previous_mod:\n prev_index = previous_mod[prev_sum]\n if i - prev_index >= 2:\n return True\n if prev_sum not in previous_mod:\n previous_mod[prev_sum] = i\n return False\n","memory":"37100"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n # [5, 2, 4, 0, 1]\n # [0, 5, 1, 5, 5, 0]\n nums = [x % k for x in nums]\n cumsum = [0]\n for x in nums:\n cumsum.append((cumsum[-1] + x) % k)\n dct = {}\n for i, x in enumerate(cumsum):\n if x in dct:\n if dct[x] <= i - 2:\n return True\n else:\n dct[x] = i\n \n return False","memory":"37200"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n nums = [x%k for x in nums] \n s = 0\n prefix_sum = [s:=s+x for x in nums]\n prefix_sum = [x%k for x in prefix_sum]\n seen = {0:-1}\n for i,x in enumerate(prefix_sum):\n if (x in seen ):\n if i - seen[x] > 1:\n return True\n else:\n seen[x] = i\n \n return False\n \n \n\n ","memory":"37300"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n pre_sum = [0] * (len(nums) + 1)\n for i in range(1, len(nums) + 1):\n pre_sum[i] = pre_sum[i - 1] + nums[i - 1]\n sum_mod_to_idx = {} #(preSum[i] - preSum[j]) % k == 0 其实就是 preSum[i] % k == preSum[j] % k\n for idx in range(len(nums) + 1):\n pre_sum_mod = pre_sum[idx] % k\n if pre_sum_mod in sum_mod_to_idx:\n j = sum_mod_to_idx[pre_sum_mod]\n if idx - j >= 2:\n return True\n if pre_sum_mod not in sum_mod_to_idx:\n sum_mod_to_idx[pre_sum_mod] = idx\n return False\n","memory":"37400"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n remToIndex = {0:-1}\n total = 0\n preFixList = []\n\n for num in nums:\n total+= num\n preFixList.append(total)\n\n for i, num in enumerate(preFixList):\n remainder = num % k\n if remainder in remToIndex:\n if i - remToIndex[remainder] >=2:\n return True\n else:\n remToIndex[remainder] = i\n\n return False\n #O(N)\n #O(N)\n\n ","memory":"37500"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n prefix=[0]\n for n in nums:\n prefix.append(prefix[-1]+n)\n m=collections.defaultdict(int)\n for i, pre in enumerate(prefix):\n key = pre % k if k else pre\n if key not in m:\n m[key] = i \n elif i - m[key] > 1:\n return True \n return False\n\n # prefix=[0]\n # for n in nums:\n # prefix.append(prefix[-1]+n)\n # m = collections.defaultdict(int)\n # for i, pre in enumerate(prefix):\n # key = pre % k if k else pre\n # if key not in m:\n # m[key] = i\n # elif i-m[key] > 1:\n # return True\n # return False\n\n \n \n \n \n \n # mapping = {0: -1}\n # for i, prefix in enumerate(itertools.accumulate(nums)):\n # key = prefix % k if k else prefix\n # if key not in mapping:\n # mapping[key] = i\n # elif i - mapping[key] > 1:\n # return True\n # return False\n \n ","memory":"37600"},{"code":"class Solution:\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\n '''\n 23 2 4 6 7\n \n 23 25 29 35 42\n \n 23%6 = 5 {5:0}\n 25%6= 1 {1:1}\n 29%6= 5 => return True\n '''\n \n prefixSum = []\n total = 0\n for num in nums:\n total += num\n prefixSum.append(total)\n \n numsMap = {0:-1}\n for i, item in enumerate(prefixSum):\n remain = item%k\n if remain in numsMap:\n if i - numsMap[remain] >= 2:\n return True\n else:\n numsMap[remain] = i\n return False","memory":"37700"}],"string":"[\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n def rf(ls):\\n if len(ls) == 1:\\n return False\\n\\n m = (0 + len(ls) - 1) // 2\\n nextm = m + 1\\n # blocks 0 .. m, m + 1 .. len(ls) - 1\\n\\n sums = set()\\n i = m\\n sm = 0\\n while i >= 0:\\n sm = (sm + ls[i]) % k\\n sums.add(k - sm if sm != 0 else 0)\\n i -= 1\\n \\n i = nextm\\n sm = 0\\n while i < len(ls):\\n sm = (sm + ls[i]) % k\\n if (sm % k) in sums:\\n return True\\n i += 1\\n \\n ltrue = rf(ls[:m+1])\\n if ltrue:\\n return True\\n rtrue = rf(ls[m+1:])\\n if rtrue:\\n return True\\n \\n return False\\n\\n return rf(nums)\\n\\n\\n\\n\\n\",\n \"memory\": \"30400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n def rf(ls):\\n if len(ls) == 1:\\n return False\\n\\n m = (0 + len(ls) - 1) // 2\\n nextm = m + 1\\n # blocks 0 .. m, m + 1 .. len(ls) - 1\\n\\n sums = set()\\n i = m\\n sm = 0\\n while i >= 0:\\n sm = (sm + ls[i]) % k\\n sums.add(k - sm if sm != 0 else 0)\\n i -= 1\\n \\n i = nextm\\n sm = 0\\n while i < len(ls):\\n sm = (sm + ls[i]) % k\\n if (sm % k) in sums:\\n return True\\n i += 1\\n \\n ltrue = rf(ls[:m+1])\\n if ltrue:\\n return True\\n rtrue = rf(ls[m+1:])\\n if rtrue:\\n return True\\n \\n return False\\n \\n def ap2(nums):\\n rhm = dict()\\n\\n i = len(nums) -1\\n s = 0\\n while i >= 0:\\n s = (s + nums[i]) % k\\n if s not in rhm:\\n rhm[s] = i\\n i -= 1\\n rhm[0] = len(nums)\\n allsum = s\\n\\n # -1 Iteration \\n if allsum in rhm and rhm[allsum] > 1:\\n return True\\n\\n i = 0\\n s = 0\\n while i < len(nums) - 1:\\n s = (s + nums[i]) % k\\n tosearch = (allsum - s) % k\\n if tosearch not in rhm:\\n i += 1\\n continue\\n \\n if rhm[tosearch] > i + 2:\\n return True\\n\\n i += 1\\n \\n return False\\n \\n def ap3(nums):\\n prefixmod = 0\\n modseen = dict()\\n modseen[0] = -1\\n\\n for i, n in enumerate(nums):\\n prefixmod = (prefixmod + n) % k\\n if prefixmod in modseen:\\n leftindx = modseen[prefixmod]\\n if (leftindx + 1) < i:\\n return True\\n else:\\n modseen[prefixmod] = i\\n \\n return False\\n\\n \\n apr = 1\\n if apr == 1:\\n return rf(nums)\\n elif apr == 2:\\n return ap2(nums)\\n elif apr == 3:\\n return ap3(nums)\\n\\n\\n \\n\\n\\n\\n \\n \\n\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\",\n \"memory\": \"30600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n return self.helper(nums, 0, len(nums) - 1, k)\\n\\n def helper(self, nums: List[int], i: int, j: int, k: int) -> bool:\\n #print(f'i, j={i}, {j}')\\n if i >= j: return False # need 2 successive\\n mid = (i + j) // 2\\n if self.helper(nums, i, mid, k):\\n return True\\n if self.helper(nums, mid+1, j, k):\\n return True\\n modulo_set, suffix_sum = set(), 0\\n for x in range(mid, i-1, -1): #suffix sum from the middle\\n suffix_sum = (suffix_sum + nums[x]) % k\\n modulo_set.add(suffix_sum)\\n prefix_sum = 0\\n for x in range(mid+1, j+1): #prefix sum from mid+1\\n prefix_sum = (prefix_sum + nums[x]) % k\\n if (k - prefix_sum)%k in modulo_set:\\n #print(f' mid={mid}, x={x}, nums[{x}]={nums[x]}, set={modulo_set}')\\n return True\\n return False\",\n \"memory\": \"30700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n preSum = nums[0]\\n modSeen = set()\\n for i in range(1, len(nums)):\\n curSum = preSum + nums[i]\\n curMod = curSum % k\\n if not curMod or curMod in modSeen:\\n return True\\n modSeen.add(preSum % k)\\n preSum = curSum\\n return False\",\n \"memory\": \"31000\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n s, prev_d, set_d = 0, 0, set()\\n for i in nums:\\n s += i\\n dif = s % k\\n if dif in set_d:\\n return True\\n set_d.add(prev_d)\\n prev_d = dif\\n return False\\n\\n\",\n \"memory\": \"31200\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n prefix = [0]\\n for num in nums:\\n prefix.append(num + prefix[-1])\\n \\n seen = set()\\n\\n for i in range(2, len(prefix)):\\n\\n prev = prefix[i - 2] % k\\n seen.add(prev)\\n\\n if prefix[i] % k in seen:\\n return True\\n return False\\n\",\n \"memory\": \"31300\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n s, prev_d, set_d = 0, 0, set()\\n for num in nums:\\n s += num\\n d = s%k\\n if d in set_d:\\n return True\\n set_d.add(prev_d)\\n prev_d = d\\n return False \",\n \"memory\": \"31400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefixes = set()\\n n = len(nums)\\n cumSum = 0\\n for val in nums:\\n prevCumSum = cumSum\\n cumSum += val\\n\\n if cumSum%k in prefixes:\\n return True\\n # Add previous to maintain 2 elements\\n prefixes.add(prevCumSum%k)\\n \\n return False\\n\",\n \"memory\": \"31500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_mod = [0]\\n prefix_mod_set = set()\\n for i, n in enumerate(nums):\\n mod = (prefix_mod[-1] + n) % k\\n prefix_mod.append(mod)\\n if i >= 1:\\n prefix_mod_set.add(prefix_mod[i - 1])\\n if mod in prefix_mod_set:\\n return True\\n\\n return False\",\n \"memory\": \"31600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n rems=[nums[0]%k]\\n rem_dict=set()\\n for i in range(1,len(nums)):\\n rems.append((rems[-1]+nums[i])%k)\\n if i>=2:\\n rem_dict.add(rems[i-2])\\n if rems[-1]==0 or rems[-1] in rem_dict:\\n return True\\n return False\",\n \"memory\": \"31700\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remainders = set() # Set to track remainders\\n previous_remainder = 0 # To track the remainder of the sum up to the previous position\\n current_sum = 0 # Tracks the running sum\\n \\n for num in nums:\\n current_sum += num # Update running sum\\n if current_sum % k in remainders:\\n return True # A subarray with sum multiple of k exists\\n remainders.add(previous_remainder) # Add previous remainder to the set\\n previous_remainder = current_sum % k # Update previous remainder with current\\n \\n return False\\n\",\n \"memory\": \"31700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pre = {0, nums[0]%k}\\n cur_sum = nums[0]\\n for i, n in enumerate(nums[1:], start=1):\\n cur_sum += n\\n mod = cur_sum % k\\n if mod in pre:\\n if n % k != 0 or nums[i-1] % k == 0:\\n return True\\n else:\\n pre.add(mod)\\n\\n return False\\n\\n\\n \",\n \"memory\": \"31800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n preSum = 0\\n\\n s = set()\\n rem = 0\\n for i in range(n):\\n preSum += nums[i]\\n x = preSum%k\\n\\n if x in s:\\n return True\\n\\n s.add(rem)\\n rem = x\\n\\n return False\\n\",\n \"memory\": \"31800\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n queue = deque()\\n queue.append(0)\\n \\n pref = set()\\n curr = 0\\n \\n for number in nums:\\n curr += number\\n queue.append(curr%k)\\n \\n if len(queue) > 2:\\n pref.add(queue.popleft())\\n \\n if curr % k in pref:\\n return True\\n \\n return False\\n \",\n \"memory\": \"32000\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n lasts = {0} # Добавляем остаток 0\\n s = 0\\n prev = None\\n for i in range(len(nums)):\\n s += nums[i]\\n if i > 0 and (s % k) in lasts:\\n return True\\n if prev:\\n lasts.add(prev % k)\\n prev = s\\n # lasts.add((s - nums[i]) % k) # Добавляем предыдущий остаток\\n\\n return False\\n \",\n \"memory\": \"32100\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n lasts = {0} # Добавляем остаток 0\\n s = 0\\n prev = None\\n for i in range(len(nums)):\\n s += nums[i]\\n if i > 0 and (s % k) in lasts:\\n return True\\n if prev:\\n lasts.add(prev % k)\\n prev = s\\n # lasts.add((s - nums[i]) % k) # Добавляем предыдущий остаток\\n\\n return False\",\n \"memory\": \"32200\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n lasts = {0} # Добавляем остаток 0\\n s = 0\\n prev = None\\n for i in range(len(nums)):\\n s += nums[i]\\n if i > 0 and (s % k) in lasts:\\n return True\\n if prev:\\n lasts.add(prev % k)\\n prev = s\\n # lasts.add((s - nums[i]) % k) # Добавляем предыдущий остаток\\n\\n return False\\n \",\n \"memory\": \"32299\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n a = len(nums) * [0]\\n a[0] = nums[0]\\n for i in range(1, len(nums)):\\n a[i] = a[i-1] + nums[i]\\n s = set()\\n s. add(a[0] % k)\\n if not a[1] % k:\\n return True\\n for i in range(2, len(nums)):\\n m = a[i] % k\\n if m in s or not m:\\n return True\\n s.add(a[i-1] % k)\\n \\n return False\",\n \"memory\": \"32400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n a = len(nums) * [0]\\n a[0] = nums[0]\\n for i in range(1, len(nums)):\\n a[i] = a[i-1] + nums[i]\\n s = set()\\n s. add(a[0] % k)\\n if not a[1] % k:\\n return True\\n for i in range(2, len(nums)):\\n m = a[i] % k\\n if m in s or not m:\\n return True\\n s.add(a[i-1] % k)\\n return False\",\n \"memory\": \"32400\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pref_sum = [nums[0]%k]\\n \\n for i in range(1, len(nums)):\\n pref_sum.append((pref_sum[-1]+nums[i]) % k)\\n \\n \\n queue = deque()\\n hashset = set()\\n for i in pref_sum:\\n if i in hashset or (i == 0 and len(queue) >= 1):\\n return True\\n \\n if len(queue) >= 1:\\n hashset.add(queue.popleft())\\n \\n queue.append(i)\\n \\n return False\\n \\n \",\n \"memory\": \"32500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n a = len(nums) * [0]\\n a[0] = nums[0]\\n for i in range(1, len(nums)):\\n a[i] = a[i-1] + nums[i]\\n s = set()\\n for i in range(1, len(nums)):\\n m = a[i] % k\\n if m in s or not m:\\n return True\\n s.add(a[i-1] % k)\\n return False\",\n \"memory\": \"32600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n a = [ nums[0] ]\\n for n in nums[1:]:\\n a.append(n + a[-1])\\n s = set()\\n for i in range(1, len(nums)):\\n m = a[i] % k\\n if m in s or not m:\\n return True\\n s.add(a[i-1] % k)\\n return False\",\n \"memory\": \"32600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix = 0\\n seen = set()\\n previous = 0 # This tracks the previous prefix sum mod k\\n if len(nums) < 2: return False\\n for i in range(len(nums)):\\n prefix += nums[i]\\n mod_value = prefix % k\\n print(mod_value)\\n if mod_value in seen:\\n return True\\n seen.add(previous) # Add the previous mod value\\n previous = mod_value\\n \\n return False\",\n \"memory\": \"32700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n s, prev_d, set_d = 0, 0, set()\\n for num in nums:\\n s += num\\n d = s%k\\n print(d)\\n if d in set_d:\\n return True\\n set_d.add(prev_d)\\n prev_d = d\\n return False \\n \",\n \"memory\": \"32800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix_sum = 0\\n prefix_map = set()\\n re = 0\\n for i in range(len(nums)):\\n prefix_sum += nums[i]\\n reminder = prefix_sum % k\\n print(prefix_sum, reminder)\\n if reminder in prefix_map:\\n return True\\n prefix_map.add(re)\\n re = reminder\\n return False\\n \",\n \"memory\": \"32900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n s = 0 #sum\\n prev_d = 0\\n set_d = {}\\n for n in nums:\\n s+=n\\n d=s%k\\n if d in set_d: \\n return True\\n set_d[prev_d]=1\\n prev_d = d\\n return False\",\n \"memory\": \"33500\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n map_saver = defaultdict(int)\\n sum_num = 0\\n for i in range(len(nums)):\\n sum_num += nums[i]\\n map_saver[sum_num % k] += 1\\n sum_num = 0\\n for i in range(len(nums) - 1):\\n need = sum_num % k\\n map_saver[(sum_num + nums[i]) % k] -= 1\\n if need in map_saver and map_saver[need] > 0:\\n return True\\n sum_num += nums[i]\\n return False\\n \\n\\n \",\n \"memory\": \"33600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) < 2:\\n return False\\n sums = []\\n s = 0\\n r_map = {}\\n for i in range(len(nums)):\\n if i > 0 and nums[i] % k == 0 and nums[i-1] % k == 0:\\n return True\\n s += nums[i]\\n remain = s % k\\n if remain == 0 and i != 0:\\n return True\\n if remain in r_map and s - r_map[remain] >= k and nums[i] % k != 0:\\n return True \\n r_map[remain] = s\\n return False\\n \",\n \"memory\": \"33800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n nums.insert(0, 0)\\n for i in range(1, len(nums)):\\n nums[i] = (nums[i - 1] + nums[i]) % k\\n num_index = dict()\\n for i, num in enumerate(nums):\\n if num in num_index:\\n if i - num_index[num] >= 2:\\n return True\\n else:\\n num_index[num] = i\\n return False\",\n \"memory\": \"33900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n a = {0:-1}\\n ans = 0\\n for i in range(n):\\n ans+=nums[i]\\n nums[i] =ans%k\\n if(nums[i] in a):\\n if(i - a[nums[i]]>1):\\n return True\\n else:\\n a[nums[i]] = i\\n return False\",\n \"memory\": \"33900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n for i in range(1,len(nums)):\\n nums[i]+=nums[i-1]\\n for i in range(len(nums)):\\n nums[i]%=k\\n dic={0:-1}\\n # print(nums)\\n for i in range(len(nums)):\\n # print(dic)\\n if nums[i] in dic and i-dic[nums[i]]>=2:\\n return True\\n elif nums[i] not in dic:\\n dic[nums[i]]=i \\n return False \\n\\n \",\n \"memory\": \"34000\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n if n == 1: return False\\n nums[0] %= k \\n for i in range(1, n):\\n nums[i] = (nums[i] + nums[i-1]) % k\\n if nums[i] == 0:\\n return True\\n mod_seen = {}\\n for i in range(n):\\n if nums[i] in mod_seen:\\n if i - mod_seen[nums[i]] >= 2:\\n return True\\n else:\\n mod_seen[nums[i]] = i\\n return False\\n\",\n \"memory\": \"34100\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n if n == 1: return False\\n nums[0] %= k \\n for i in range(1, n):\\n nums[i] = (nums[i] + nums[i-1]) % k\\n if nums[i] == 0:\\n return True\\n mod_seen = {}\\n for i in range(n):\\n if nums[i] in mod_seen:\\n if i - mod_seen[nums[i]] >= 2:\\n return True\\n else:\\n mod_seen[nums[i]] = i\\n return False\\n\",\n \"memory\": \"34100\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n table = dict()\\n table[0] = -1\\n sum = 0\\n for i in range(len(nums)):\\n sum += nums[i]\\n mod = sum % k\\n if mod in table:\\n if i - table[mod] >= 2:\\n return True\\n else:\\n table[mod] = i\\n return False\",\n \"memory\": \"34200\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n hm = {}\\n pre_sum = 0\\n\\n for i in range(len(nums)):\\n pre_sum += nums[i]\\n rem = pre_sum % k\\n\\n if pre_sum % k == 0 and i >= 1:\\n return True\\n\\n if rem in hm:\\n if (i - hm[rem]) >= 2:\\n return True\\n else:\\n hm[rem] = i\\n \\n return False\",\n \"memory\": \"34300\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pref = [nums[0]]\\n n = len(nums)\\n for i in range(1, n):\\n pref.append(pref[-1] + nums[i])\\n\\n pref = [x % k for x in pref]\\n cache = defaultdict(int)\\n cache[pref[0]] = 1\\n for i in range(1, n):\\n x = pref[i]\\n if (cache[x] - (pref[i - 1] == x)) > 0:\\n return True\\n if x == 0:\\n return True\\n cache[x] += 1\\n\\n return False\\n \",\n \"memory\": \"34600\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n presum = [0] * (n+1)\\n for idx in range(1, n+1):\\n presum[idx] = presum[idx-1] + nums[idx-1]\\n \\n remainder = defaultdict(int)\\n for idx in range(2, n+1):\\n val = presum[idx-2] % k\\n remainder[val] += 1\\n cur_val = presum[idx] % k\\n if remainder[cur_val] > 0:\\n return True\\n\\n return False\\n\\n \",\n \"memory\": \"34700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pre = 0\\n seen = {0: -1}\\n\\n for i in range(len(nums)):\\n pre = (pre + nums[i]) % k\\n\\n if pre in seen:\\n if i - seen[pre] > 1:\\n return \\\"true\\\"\\n else:\\n seen[pre] = i\\n\\n return \\\"false\\\"\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().checkSubarraySum(nums, next(inputs)),file=f)\\nexit(0)\",\n \"memory\": \"34800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n seen_remainders = {0: -1} # Handle remainder 0\\n prefix = 0\\n for i, num in enumerate(nums):\\n prefix += num\\n remainder = prefix % k\\n \\n if remainder in seen_remainders:\\n # Check if subarray length is at least 2\\n if i - seen_remainders[remainder] >= 2:\\n return True\\n else:\\n seen_remainders[remainder] = i\\n \\n return False\\n\\n\\n\\n\",\n \"memory\": \"34900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n data = { 0: -1 }\\n cur = 0\\n \\n for i, n in enumerate(nums):\\n cur += n\\n diff = cur % k\\n if diff in data:\\n if i - data[diff] >= 2:\\n return True\\n else: continue\\n data[diff] = i\\n \\n return False\\n\\n# Time Complexity : O(n)\\n# Space Complexity : O(n)\",\n \"memory\": \"35000\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n '''\\n remainders = defaultdict(int)\\n total = 0\\n for i, n in enumerate(nums):\\n total = (total + n) % k\\n # if total == 0 and i >= 1:\\n # return True\\n if total not in remainders:\\n remainders[total] = i\\n elif i - remainders[total] >= 2:\\n return True\\n return False\\n '''\\n remainder = { 0: -1}\\n total = 0\\n\\n for i, n in enumerate(nums):\\n total += n\\n r = total % k\\n if r not in remainder:\\n remainder[r] = i\\n elif i - remainder[r] > 1:\\n return True\\n return False\\n\",\n \"memory\": \"35300\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n psum = 0\\n hmap = {0: -1}\\n for r, n in enumerate(nums):\\n psum += n\\n rem = psum % k\\n if rem not in hmap and rem > 0:\\n hmap[rem] = r\\n else:\\n if r - hmap[rem] > 1:\\n return True\\n return False\",\n \"memory\": \"35400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if not nums or len(nums) <= 1:\\n return False\\n \\n presum = [0] * len(nums)\\n presum[0] = nums[0]\\n\\n map = dict() # key: presum value: the index\\n map[presum[0] % k] = 0\\n \\n for i in range(1, len(nums)):\\n presum[i] = presum[i - 1] + nums[i]\\n if i >= 1 and presum[i] % k == 0:\\n return True\\n \\n remainder = presum[i] % k\\n if remainder in map:\\n if i - map[remainder] >= 2:\\n return True \\n else:\\n map[remainder] = i\\n \\n return False\\n \\n\\n\\n \",\n \"memory\": \"35500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n rem_dict = {0:-1}\\n rem = 0\\n for index,value in enumerate(nums):\\n rem = (value + rem) % k\\n if rem == 0:\\n if index - rem_dict[0] > 1:\\n return True\\n if rem not in rem_dict:\\n rem_dict[rem] = index\\n else:\\n if index - rem_dict[rem] > 1:\\n return True\\n return False\\n \",\n \"memory\": \"35600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n sum_map = {0: -1}\\n cur = 0\\n for i, num in enumerate(nums):\\n if k == 0:\\n cur += num\\n else:\\n cur = (cur + num) % k\\n if cur in sum_map and i - sum_map[cur] >= 2:\\n return True\\n if cur not in sum_map:\\n sum_map[cur] = i\\n return False\",\n \"memory\": \"35700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n rem_dict = {0:-1}\\n rem = 0\\n for index,value in enumerate(nums):\\n rem = (value + rem) % k\\n if rem == 0:\\n if index - rem_dict[0] > 1:\\n return True\\n if rem not in rem_dict:\\n rem_dict[rem] = index\\n else:\\n if index - rem_dict[rem] > 1:\\n return True\\n return False\\n \",\n \"memory\": \"35800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\\"\\\"\\\"\\n use a prefix sum and maintain the remainder when this sum is divided by k (prefix_sum%k).\\n use a hash map (or dictionary) to store the first occurence of each remainder. \\n if the same remainder appears again at a later index, then the subarray between these two indices has a sum that is a multiple of k.\\n ensure that the subarray length is at least 2, so we should only check this condition if the current index is at least 2 positions ahead of the eariler index where this remainder was seen. \\n \\\"\\\"\\\"\\n # using a dictionary to store the remainder and its first occurence index\\n remainder_map = {0:-1}\\n prefix_sum = 0\\n for i, num in enumerate(nums):\\n prefix_sum += num\\n if k!=0:\\n prefix_sum %= k\\n # check if this remainder has been seen before\\n if prefix_sum in remainder_map.keys():\\n if i-remainder_map[prefix_sum] > 1:\\n return True\\n else:\\n remainder_map[prefix_sum] = i\\n return False\",\n \"memory\": \"35800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # instead of creating a prefixSsum array, created an array to store the remainders of the prefix sums\\n # track the prefix sum seen so far in a variable\\n # traverse the array and store the remainders of the prefix sums seen so far in an array\\n # if we see the same remainder again, it means we have traversed an array sum which is the exact multiple of k\\n # check the number of elements between the prev seen idx and the currentindex\\n # is the diff is >=2: return True\\n # of we don't return true from within the loop, return False\\n \\n \\n remainders = {0:-1}\\n prefixSum = 0\\n \\n for i, num in enumerate(nums):\\n # update the prefix sum\\n prefixSum += num\\n rem = prefixSum % k\\n \\n if rem not in remainders:\\n remainders[rem] = i\\n \\n elif i - remainders[rem] >= 2:\\n return True\\n \\n else:\\n continue\\n \\n return False\",\n \"memory\": \"35900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n curSum = 0\\n hashMap = {}\\n countZero = 0\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n countZero += 1\\n if countZero >= 2:\\n return True\\n else:\\n countZero = 0\\n curSum += nums[i]\\n if curSum % k == 0 and i > 0:\\n return True\\n\\n if curSum % k in hashMap:\\n length = i - hashMap[curSum % k]\\n if length >= 2:\\n return True\\n hashMap[curSum % k] = i\\n return False\",\n \"memory\": \"36000\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n track, cur = {0: -1}, 0\\n for i in range(len(nums)):\\n cur = (cur + nums[i]) % k\\n if cur in track:\\n if (i - track[cur]) > 1:\\n return True\\n else:\\n track[cur] = i\\n return False\\n \\n\\n\\n\",\n \"memory\": \"36000\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remLookup = {}\\n remLookup[0] = -1\\n\\n prefixSum = 0 \\n for idx, num in enumerate(nums):\\n prefixSum += num\\n rem = prefixSum % k\\n if rem in remLookup and idx - remLookup[rem] >= 2:\\n return True\\n if rem not in remLookup:\\n remLookup[rem] = idx\\n \\n return False\",\n \"memory\": \"36100\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n curr = 0 \\n d= {0:-1}\\n\\n for i, n in enumerate(nums):\\n curr += n\\n curr = curr % k\\n\\n if curr in d and i - d[curr] >= 2:\\n return True\\n\\n elif curr not in d:\\n d[curr] = i\\n\\n return False\",\n \"memory\": \"36100\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n presum = 0\\n mod2index = {0: 0}\\n n = len(nums)\\n for i in range(1, n+1):\\n presum += nums[i-1]\\n mod = presum % k\\n if mod in mod2index:\\n if i - mod2index[mod] >= 2:\\n print(i, mod2index[mod])\\n return True\\n else:\\n mod2index[mod] = i\\n \\n return False\\n \\n\",\n \"memory\": \"36200\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n curSum = 0\\n hashMap = {}\\n countZero = 0\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n countZero += 1\\n if countZero >= 2:\\n return True\\n else:\\n countZero = 0\\n curSum += nums[i]\\n if curSum % k == 0 and i > 0:\\n return True\\n\\n if curSum % k in hashMap:\\n length = i - hashMap[curSum % k]\\n if length >= 2:\\n return True\\n hashMap[curSum % k] = i\\n return False\",\n \"memory\": \"36200\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n \\n nowsum = 0\\n mapp = {0:-1}\\n for i in range(len(nums)):\\n nowsum += nums[i]\\n nowsum %= k\\n # mapp = {}\\n if nowsum in mapp:\\n\\n if (i - mapp[nowsum]) > 1:\\n return True\\n else:\\n mapp[nowsum] = i\\n return False\\n\",\n \"memory\": \"36300\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool: \\n st = set()\\n if not nums:\\n return False \\n if len(nums) == 1:\\n return False \\n dct={0:-1, k: -1}\\n sm=0\\n for i in range(len(nums)):\\n sm += nums[i]\\n sm %= k \\n if sm in dct and -dct[sm]+i >= 2:\\n return True \\n if sm not in dct:\\n dct[sm] = i\\n return False\",\n \"memory\": \"36300\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n modPrefix = 0\\n modSeen = {0:-1}\\n for i in range(len(nums)):\\n modPrefix = (modPrefix+nums[i])%k\\n if modPrefix in modSeen:\\n if i - modSeen[modPrefix] > 1:\\n return True\\n else:\\n modSeen[modPrefix] = i\\n return False\",\n \"memory\": \"36400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n seen ={0:-1}\\n curr = 0\\n for i in range(len(nums)):\\n curr += nums[i]\\n curr = curr%k\\n if curr in seen and i-seen[curr] >=2:\\n return True\\n if curr not in seen:\\n seen[curr] = i\\n \\n return False\",\n \"memory\": \"36400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n reminder = {0: -1}\\n total = 0\\n for i,n in enumerate(nums):\\n total += n\\n r = total % k\\n if r not in reminder:\\n reminder[r] = i\\n elif i - reminder[r] > 1:\\n return True\\n return False\\n \",\n \"memory\": \"36500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n map = { 0: -1 }\\n sm = 0\\n for idx, val in enumerate(nums):\\n sm += val\\n if sm % k in map:\\n if idx - map[sm % k] >= 2:\\n return True\\n else:\\n map[sm % k] = idx\\n \\n\\n return False\\n\",\n \"memory\": \"36500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n n = len(nums)\\n pref = {}\\n pref[0] = -1\\n sm = 0\\n for i in range(n):\\n sm += nums[i]\\n sm %= k\\n if sm in pref:\\n idx = pref[sm]\\n if i - idx > 1:\\n return True\\n else:\\n pref[sm] = i\\n \\n return False\\n \",\n \"memory\": \"36600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pref = [0] * (len(nums) + 1)\\n pref[0] = 0\\n for i in range(1, len(nums) + 1):\\n pref[i] = (nums[i-1] + pref[i - 1])%k\\n d = {}\\n for i, v in enumerate(pref):\\n if v not in d:\\n d[v] = i\\n for i, val in enumerate(pref):\\n if (res := val%k) in d:\\n j = d[res]\\n if j > i:\\n break\\n if i - j >= 2:\\n return True\\n return False\",\n \"memory\": \"36600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n cum_sum_mod = []\\n cur_sum = 0\\n for i in range(len(nums)):\\n cur_sum = cur_sum + nums[i]\\n cum_sum_mod.append(cur_sum % k if k != 0 else cur_sum)\\n hash_table = {0:-1}\\n for i in range(len(cum_sum_mod)): \\n if cum_sum_mod[i] not in hash_table: \\n hash_table[cum_sum_mod[i]] = i\\n elif cum_sum_mod[i] in hash_table and i - hash_table[cum_sum_mod[i]] >= 2:\\n return True\\n return False\",\n \"memory\": \"36700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if sum(nums) % k == 0 and len(nums) >= 2:\\n return True\\n\\n prefix_sum_mod = []\\n sum_ = 0\\n for num in nums:\\n sum_ += num\\n prefix_sum_mod.append(sum_ % k)\\n\\n mod_dic = {}\\n for i in range (len(nums)):\\n if prefix_sum_mod[i] not in mod_dic:\\n mod_dic[prefix_sum_mod[i]] = i\\n \\n else:\\n if i - mod_dic[prefix_sum_mod[i]] >= 2:\\n return True\\n\\n if 0 in prefix_sum_mod[1:]:\\n return True\\n\\n return False\\n\\n \\n\\n\\n \",\n \"memory\": \"36700\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # HINT SOLUTION\\n # the property we leverage is that if we keep a cumulative sum and record % k\\n # at each index, then we know that if two of the same modulo remainders occur\\n # at different indices, then we know that the subarray between them is\\n # divisible by k. this is because when we subtract one from the other to get\\n # the indices between them, the remainders cancel out.\\n\\n n = len(nums)\\n if n == 1:\\n return False\\n remainders = [0]*n\\n cur = 0\\n for i in range(n):\\n cur += nums[i]\\n remainders[i] = cur % k # if (cur >= k or cur == 0) else -1\\n remainders = [0] + remainders\\n hm = {}\\n for i in range(n+1):\\n if remainders[i] in hm and (i - hm[remainders[i]]) >= 2 and remainders[i] != -1:\\n return True\\n else:\\n hm[remainders[i]] = min(i, hm.get(remainders[i], i))\\n return False\",\n \"memory\": \"36800\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n modulos = {0: -1}\\n sum = 0\\n for i, n in enumerate(nums):\\n sum += n\\n mod = sum % k\\n print(i, mod)\\n if mod in modulos:\\n if i - modulos[mod] > 1:\\n return True\\n else:\\n modulos[mod] = i\\n return False\\n\",\n \"memory\": \"36900\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # make prefix sum array of nums.\\n # find if 2x sums are of the same modulo of k, and index diff >= 2\\n pref = [0]\\n s = 0\\n mod = {0: -1}\\n for i, n in enumerate(nums):\\n s += n\\n pref.append(s)\\n m = s % k\\n if m not in mod:\\n mod[m] = i\\n elif i - mod[m] >= 2:\\n return True\\n return False\",\n \"memory\": \"37000\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n if len(nums) <= 1:\\n return False\\n # check contiguous subarrays\\n # [a b] c d\\n # a [b c] d\\n n = len(nums)\\n # [[23,2,4],6,7], k = 6\\n # [1,4,-1,3] k = 4\\n # [1,5,0,3]\\n for i in range(1,n):\\n nums[i] += nums[i-1]\\n print(nums)\\n previous_mod = {0: -1} #1-(-1)\\n # [1,0] => [1,1]\\n for i in range(n):\\n # we care if cur_sum - prev_sum == 0 mod k\\n prev_sum = nums[i] % k # diff = 4-3=1\\n if prev_sum in previous_mod:\\n prev_index = previous_mod[prev_sum]\\n if i - prev_index >= 2:\\n return True\\n if prev_sum not in previous_mod:\\n previous_mod[prev_sum] = i\\n return False\\n\",\n \"memory\": \"37100\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n # [5, 2, 4, 0, 1]\\n # [0, 5, 1, 5, 5, 0]\\n nums = [x % k for x in nums]\\n cumsum = [0]\\n for x in nums:\\n cumsum.append((cumsum[-1] + x) % k)\\n dct = {}\\n for i, x in enumerate(cumsum):\\n if x in dct:\\n if dct[x] <= i - 2:\\n return True\\n else:\\n dct[x] = i\\n \\n return False\",\n \"memory\": \"37200\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n nums = [x%k for x in nums] \\n s = 0\\n prefix_sum = [s:=s+x for x in nums]\\n prefix_sum = [x%k for x in prefix_sum]\\n seen = {0:-1}\\n for i,x in enumerate(prefix_sum):\\n if (x in seen ):\\n if i - seen[x] > 1:\\n return True\\n else:\\n seen[x] = i\\n \\n return False\\n \\n \\n\\n \",\n \"memory\": \"37300\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n pre_sum = [0] * (len(nums) + 1)\\n for i in range(1, len(nums) + 1):\\n pre_sum[i] = pre_sum[i - 1] + nums[i - 1]\\n sum_mod_to_idx = {} #(preSum[i] - preSum[j]) % k == 0 其实就是 preSum[i] % k == preSum[j] % k\\n for idx in range(len(nums) + 1):\\n pre_sum_mod = pre_sum[idx] % k\\n if pre_sum_mod in sum_mod_to_idx:\\n j = sum_mod_to_idx[pre_sum_mod]\\n if idx - j >= 2:\\n return True\\n if pre_sum_mod not in sum_mod_to_idx:\\n sum_mod_to_idx[pre_sum_mod] = idx\\n return False\\n\",\n \"memory\": \"37400\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n remToIndex = {0:-1}\\n total = 0\\n preFixList = []\\n\\n for num in nums:\\n total+= num\\n preFixList.append(total)\\n\\n for i, num in enumerate(preFixList):\\n remainder = num % k\\n if remainder in remToIndex:\\n if i - remToIndex[remainder] >=2:\\n return True\\n else:\\n remToIndex[remainder] = i\\n\\n return False\\n #O(N)\\n #O(N)\\n\\n \",\n \"memory\": \"37500\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n prefix=[0]\\n for n in nums:\\n prefix.append(prefix[-1]+n)\\n m=collections.defaultdict(int)\\n for i, pre in enumerate(prefix):\\n key = pre % k if k else pre\\n if key not in m:\\n m[key] = i \\n elif i - m[key] > 1:\\n return True \\n return False\\n\\n # prefix=[0]\\n # for n in nums:\\n # prefix.append(prefix[-1]+n)\\n # m = collections.defaultdict(int)\\n # for i, pre in enumerate(prefix):\\n # key = pre % k if k else pre\\n # if key not in m:\\n # m[key] = i\\n # elif i-m[key] > 1:\\n # return True\\n # return False\\n\\n \\n \\n \\n \\n \\n # mapping = {0: -1}\\n # for i, prefix in enumerate(itertools.accumulate(nums)):\\n # key = prefix % k if k else prefix\\n # if key not in mapping:\\n # mapping[key] = i\\n # elif i - mapping[key] > 1:\\n # return True\\n # return False\\n \\n \",\n \"memory\": \"37600\"\n },\n {\n \"code\": \"class Solution:\\n def checkSubarraySum(self, nums: List[int], k: int) -> bool:\\n '''\\n 23 2 4 6 7\\n \\n 23 25 29 35 42\\n \\n 23%6 = 5 {5:0}\\n 25%6= 1 {1:1}\\n 29%6= 5 => return True\\n '''\\n \\n prefixSum = []\\n total = 0\\n for num in nums:\\n total += num\\n prefixSum.append(total)\\n \\n numsMap = {0:-1}\\n for i, item in enumerate(prefixSum):\\n remain = item%k\\n if remain in numsMap:\\n if i - numsMap[remain] >= 2:\\n return True\\n else:\\n numsMap[remain] = i\\n return False\",\n \"memory\": \"37700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":74,"string":"74"}}},{"rowIdx":277,"cells":{"question_id":{"kind":"number","value":524,"string":"524"},"name":{"kind":"string","value":"longest-word-in-dictionary-through-deleting"},"content":{"kind":"string","value":"<p>Given a string <code>s</code> and a string array <code>dictionary</code>, return <em>the longest string in the dictionary that can be formed by deleting some of the given string characters</em>. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]\n<strong>Output:</strong> "apple"\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "abpcplea", dictionary = ["a","b","c"]\n<strong>Output:</strong> "a"\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 1000</code></li>\n\t<li><code>1 <= dictionary.length <= 1000</code></li>\n\t<li><code>1 <= dictionary[i].length <= 1000</code></li>\n\t<li><code>s</code> and <code>dictionary[i]</code> consist of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":51.35669879120772,"string":"51.356699"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","two-pointers","string","sorting"],"string":"[\n \"array\",\n \"two-pointers\",\n \"string\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"67\", 0.45120000000000005], [\"71\", 1.5038], [\"74\", 0.45120000000000005], [\"78\", 1.0527], [\"81\", 0.7519], [\"85\", 1.3534000000000002], [\"88\", 0.6015], [\"92\", 1.6542000000000001], [\"96\", 1.9548999999999999], [\"99\", 2.7067], [\"103\", 1.9549], [\"106\", 1.955], [\"110\", 0.6016], [\"113\", 0.45120000000000005], [\"117\", 0.1504], [\"120\", 0.3008], [\"124\", 0.1504], [\"127\", 0.6016], [\"131\", 0.7519], [\"134\", 0.3008], [\"138\", 0.7519], [\"142\", 0.752], [\"145\", 0.7519], [\"149\", 0.752], [\"152\", 0.1504], [\"156\", 0.3008], [\"159\", 0.1504], [\"163\", 0.1504], [\"166\", 0.1504], [\"170\", 0.45120000000000005], [\"173\", 0.4511], [\"177\", 1.0526], [\"180\", 1.0527000000000002], [\"184\", 2.7068], [\"188\", 2.5564], [\"191\", 3.7594], [\"195\", 1.8046], [\"198\", 1.0527], [\"202\", 0.1504], [\"205\", 1.3534000000000002], [\"209\", 1.5038], [\"212\", 0.9023], [\"216\", 1.203], [\"219\", 0.6015], [\"223\", 1.9549], [\"226\", 0.6016], [\"230\", 0.9023000000000001], [\"234\", 0.45120000000000005], [\"237\", 0.9024000000000001], [\"241\", 0.45120000000000005], [\"244\", 0.45120000000000005], [\"248\", 0.1504], [\"251\", 0.45120000000000005], [\"255\", 0.6016], [\"258\", 0.9023000000000001], [\"262\", 0.6016], [\"265\", 0.7519], [\"269\", 0.3008], [\"272\", 0.45120000000000005], [\"276\", 0.3008], [\"280\", 0.45120000000000005], [\"283\", 1.8046], [\"287\", 1.2031], [\"290\", 5.8647], [\"294\", 2.7068], [\"297\", 4.361000000000001], [\"301\", 8.1203], [\"304\", 2.7068], [\"308\", 5.1128], [\"311\", 1.6542], [\"315\", 1.955], [\"318\", 0.9023], [\"322\", 0.6016], [\"326\", 0.1504], [\"329\", 1.3535000000000001], [\"333\", 0.3008], [\"336\", 0.3008], [\"340\", 0.1504], [\"343\", 0.1504], [\"347\", 0.3008]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18700\", 0.3008], [\"18800\", 2.1053], [\"18900\", 16.0902], [\"19000\", 32.1805], [\"19100\", 36.6917]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n next_index = [[None] * 26 for char in s]\n last_index = [None] * 26\n for index in range(len(s) - 1, -1, -1):\n next_index[index] = last_index.copy()\n last_index[ord(s[index]) - ord('a')] = index\n dictionary.sort(key=lambda word: (-len(word), word))\n for word in dictionary:\n word_index = 0\n if len(word) > len(s):\n continue\n s_index = 0\n word_index = 1 if s[0] == word[0] else 0\n while word_index < len(word):\n s_index = next_index[s_index][ord(word[word_index]) - ord('a')]\n if s_index is None:\n break\n word_index += 1\n if word_index == len(word):\n return word\n return \"\"","runtime":"67"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: list[str]) -> str:\n answer = \"\"\n for word in dictionary:\n if len(word) >= len(answer):\n if len(answer) == len(word) and sorted([answer,word])[0] == answer:\n continue\n else:\n current = s\n for letterCount, letter in enumerate(word):\n if letter not in current:\n break\n else:\n current = current[current.index(letter)+1:]\n if letterCount == len(word)-1: answer = word; print(word)\n return answer","runtime":"67"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dicts = defaultdict(list)\n for i, word in enumerate(dictionary):\n it = iter(word)\n dicts[next(it)].append((i, it))\n \n ans = []\n for i, char in enumerate(s):\n curr = dicts[char]\n dicts[char] = []\n for index, item in curr:\n next_it = next(item, None)\n if not next_it:\n ans.append(dictionary[index])\n else:\n dicts[next_it].append((index, item))\n ans = sorted(ans, key=lambda x: (-len(x), x))\n return ans[0] if ans else ''","runtime":"71"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n cur = \"\"\n for w in dictionary:\n ind = -1\n found = True\n for ch in w:\n ind = s.find(ch, ind + 1)\n if ind < 0:\n found = False\n break\n if found:\n if len(w) > len(cur):\n cur = w\n elif len(w) == len(cur):\n cur = min(w, cur)\n else:\n continue\n return cur\n ","runtime":"71"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n d.sort(key=lambda x:(-len(x), x))\n\n def in_word(a, b):\n h = a.find(b[0])\n if h == -1:\n return False\n if len(b) == 1:\n return True\n return in_word(a[h+1:], b[1:])\n\n for i in range(len(d)):\n if len(d[i]) > len(s):\n continue\n if len(d[i]) == len(s):\n if s != d[i]:\n continue\n else:\n return d[i]\n if in_word(s, d[i]):\n return d[i]\n\n return \"\"","runtime":"74"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n ans = \"\"\n \n # store for each starting letter the potential word. We don't store the word directly, but its index in the dictionary. \n # In addition we store '0' as pointer to the starting character. We will update the pointer in subsequent steps.\n wordmap = defaultdict(list)\n for i, word in enumerate(dictionary):\n wordmap[word[0]].append((i,0))\n \n # Process all characters in s, left-to-right\n for c in s:\n candidates = wordmap[c] # select word candidates where the pointer points to the character c\n wordmap[c] = [] # reset, since we picked them all up in the line before\n for candidate in candidates: # let's check all candidates that we found in the wordmap\n word_idx, word_pos = candidate\n word_pos += 1 # increment pointer to the next character\n if word_pos == len(dictionary[word_idx]): # we reached the end of the word, now check whether it's a better solution and update ans\n if word_pos > len(ans) or (word_pos == len(ans) and dictionary[word_idx] < ans):\n ans = dictionary[word_idx]\n else: # we did not reach the end of the word and put the word with the character at the updated pointer position back into the wordmap\n wordmap[dictionary[word_idx][word_pos]].append((word_idx, word_pos))\n \n return ans","runtime":"74"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n best_word = \"\"\n best_len = 0\n\n # best efficiency can come if we represent each word as an ordering of letters\n # eg) aba -> {a:[0,2], b:[1]}\n # To see if dict word exists in s, we get the earliest representation of the letter.\n # eg) if ab in aba, we get ab -> 0 for a, then 1 for b\n # eg) if ab in aba, we get bab -> 1 for b, then 2 for a, then nothing for b bc there's nothing >2\n\n # Still O(lmn) time\n letter_pos = {}\n for i in range(len(s)):\n if s[i] not in letter_pos:\n letter_pos[s[i]] = []\n letter_pos[s[i]].append(i)\n\n def check_letter_pos(word):\n curr_pos = 0\n for letter in word:\n if letter not in letter_pos:\n return False\n positions = letter_pos[letter]\n loc = bisect.bisect_left(positions,curr_pos)\n if loc >= len(positions):\n return False\n curr_pos = positions[loc]+1\n return True\n \n for word in dictionary:\n if check_letter_pos(word):\n if best_len < len(word):\n best_len = len(word)\n best_word = word\n elif best_len == len(word):\n best_word = min(best_word,word)\n return best_word\n\n\n \n\n","runtime":"78"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: list[str]) -> str:\n answer = \"\"\n for word in dictionary:\n if len(word) >= len(answer):\n if len(answer) == len(word) and sorted([answer,word])[0] == answer:\n continue\n else:\n current = s\n for letterCount, letter in enumerate(word):\n if letter not in current:\n break\n else:\n current = current[current.index(letter)+1:]\n if letterCount == len(word)-1: answer = word\n return answer","runtime":"78"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n next_characters = defaultdict(list)\n longest_word = ''\n for i, word in enumerate(dictionary):\n next_characters[word[0]].append((i, 0))\n for c in s:\n cur_characters = next_characters[c]\n next_characters[c] = list()\n for word_index, char_index in cur_characters:\n char_index += 1\n if char_index == len(dictionary[word_index]):\n if len(dictionary[word_index]) > len(longest_word) or (len(dictionary[word_index]) == len(longest_word) and dictionary[word_index] < longest_word):\n longest_word = dictionary[word_index]\n continue\n next_characters[dictionary[word_index][char_index]].append((word_index, char_index))\n return longest_word","runtime":"81"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: list[str]) -> str:\n answer = \"\"\n for word in dictionary:\n if len(word) >= len(answer):\n if len(answer) == len(word) and sorted([answer,word])[0] == answer:\n continue\n else:\n current = s\n for letterCount, letter in enumerate(word):\n if letter not in current:\n break\n else:\n current = current[current.index(letter)+1:]\n if letterCount == len(word)-1: answer = word; print(word)\n return answer","runtime":"81"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n letter_map = defaultdict(list)\n res = \"\"\n\n for i, w in enumerate(dictionary):\n letter_map[w[0]].append((w, i))\n \n for ch in s:\n if ch not in letter_map:\n continue\n \n words = letter_map[ch]\n del letter_map[ch]\n\n for w, i in words:\n if len(w) == 1:\n one = len(dictionary[i])\n two = len(res)\n if not res or (one > two) or (one == two and dictionary[i] < res): \n res = dictionary[i]\n else:\n word = w[1:]\n letter_map[word[0]].append((word, i))\n \n return res\n","runtime":"85"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary = sorted(dictionary, key=lambda x:[-len(x), x])\n for word in dictionary:\n curr = s\n valid = True\n for i in range(len(word)):\n l = word[i]\n if l in curr:\n if i == len(word)-1: break\n ind = curr.index(l)\n if ind == len(curr) - 1:\n if len(curr) > 1:\n valid = False\n break \n curr = curr[ind+1:]\n else: \n valid = False\n break\n if valid: return word\n return \"\"","runtime":"85"},{"code":"from collections import defaultdict\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # have a dict of chars to set((index, word), (index, word), ...) in the dictionary\n \n result = ''\n \n search_indices = defaultdict(lambda: set())\n \n for i, word in enumerate(dictionary):\n search_indices[word[0]].add((0, i))\n \n for c in s:\n same_chars = set()\n while search_indices[c]:\n index, word_index = search_indices[c].pop()\n word = dictionary[word_index]\n if word[index] == c:\n index += 1\n if index == len(word):\n if len(word) > len(result) or (len(word) == len(result) and word < result):\n result = word\n elif word[index] == c:\n same_chars.add((index, word_index))\n else:\n search_indices[word[index]].add((index, word_index))\n else:\n same_chars.add((index, word_index))\n search_indices[c] = same_chars\n \n return result","runtime":"88"},{"code":"from collections import defaultdict\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # have a dict of chars to set((index, word), (index, word), ...) in the dictionary\n \n result = ''\n \n search_indices = defaultdict(lambda: set())\n \n for i, word in enumerate(dictionary):\n search_indices[word[0]].add((0, i))\n \n for c in s:\n same_chars = set()\n while search_indices[c]:\n index, word_index = search_indices[c].pop()\n word = dictionary[word_index]\n if word[index] == c:\n index += 1\n if index == len(word):\n if len(word) > len(result) or (len(word) == len(result) and word < result):\n result = word\n elif word[index] == c:\n same_chars.add((index, word_index))\n else:\n search_indices[word[index]].add((index, word_index))\n else:\n same_chars.add((index, word_index))\n search_indices[c] = same_chars\n \n return result","runtime":"88"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n app = [[-1]*26 for _ in range(len(s)+1)]\n for i in range(len(s)-1, 0, -1):\n for j in range(26):\n if s[i]!=chr(ord('a')+j):\n app[i][j] = app[i+1][j]\n else:\n app[i][j] = i+1\n for i, ch in enumerate(s):\n if app[0][ord(ch)-ord('a')] == -1:\n app[0][ord(ch)-ord('a')] = i+1\n print(app)\n \n def issubstring(s, word):\n i = 0\n for ch in word:\n if i>len(s):\n return False\n idx = app[i][ord(ch)-ord('a')]\n if idx==-1:\n return False\n i = idx\n return True\n \n ans = \"\"\n for word in dictionary:\n if issubstring(s, word):\n if len(word)>len(ans):\n ans = word\n elif len(word) == len(ans):\n ans = min(ans, word)\n return ans","runtime":"92"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary = sorted(dictionary, key=lambda x:[-len(x), x])\n for word in dictionary:\n curr = s\n valid = True\n for i in range(len(word)):\n l = word[i]\n if l in curr:\n if i == len(word)-1: break\n ind = curr.index(l)\n if ind == len(curr) - 1:\n if len(curr) > 1:\n valid = False\n break \n curr = curr[ind+1:]\n else: \n valid = False\n break\n if valid: return word\n return \"\"","runtime":"92"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n s_dict = {}\n for i in range(len(s)):\n if s[i] not in s_dict:\n s_dict[s[i]] = []\n s_dict[s[i]].append(i)\n\n \n current_max = \"\"\n for w in sorted(dictionary):\n if len(w) <= len(current_max):\n continue\n \n output = self.helper(s_dict, w)\n\n if output:\n current_max = w\n \n return current_max\n \n def helper(self, s_dict, word):\n current_index = -1\n for j in range(len(word)):\n if word[j] not in s_dict:\n return False\n \n options = s_dict[word[j]]\n\n potential = current_index\n for x in options:\n if x > potential:\n potential = x\n break\n if potential == current_index:\n return False\n \n current_index = potential\n\n return True\n\n \n ","runtime":"96"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x:(-len(x),x))\n def isSequence(word):\n it = iter(s)\n return all(c in it for c in word)\n for word in dictionary:\n if isSequence(word):\n return word\n return \"\"","runtime":"96"},{"code":"from typing import List\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def is_subsequence(x: str, y: str) -> bool:\n # Check if x is a subsequence of y\n it = iter(y)\n return all(char in it for char in x)\n \n longest_word = \"\"\n \n for word in dictionary:\n if is_subsequence(word, s):\n # If the word is a valid subsequence, check if it's the longest or lexicographically smaller\n if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):\n longest_word = word\n \n return longest_word","runtime":"99"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n longest_word = \"\"\n\n for word in dictionary:\n if self.isSubsequence(word, s):\n if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):\n longest_word = word\n \n return longest_word\n \n def isSubsequence(self, word: str, s: str) -> bool:\n it = iter(s)\n return all(char in it for char in word)","runtime":"99"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x:(-len(x),x))\n \n for word in dictionary:\n it=iter(s)\n if all( char in it for char in word):\n return word\n return \"\"\n","runtime":"103"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def is_subsequence(x):\n it = iter(s)\n return all(c in it for c in x)\n \n dictionary.sort(key=lambda word: (-len(word), word))\n for word in dictionary:\n if is_subsequence(word):\n return word\n return ''","runtime":"103"},{"code":"class Solution:\n def findLongestWord(self, s, d):\n def isSubsequence(x):\n it = iter(s)\n return all(c in it for c in x)\n d.sort(key=lambda x: (-len(x), x))\n return next(filter(isSubsequence, d), '')","runtime":"106"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n longest=\"\"\n for word in dictionary:\n if self.issubsequence(s,word):\n if len(word)>len(longest) or (len(word)==len(longest) and word< longest):\n longest=word\n return longest \n \n def issubsequence(self,s,word):\n it=iter(s)\n return all(char in it for char in word) ","runtime":"106"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n n = len(s)\n def isSubseq(word):\n it = iter(s)\n return all(c in it for c in word)\n dictionary.sort(key=lambda x:(-len(x),x))\n for word in dictionary:\n if isSubseq(word):\n return word\n return \"\"","runtime":"110"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \"\"\"\n for word in sorted(dictionary, key=lambda x: (-len(x), x)):\n s_iter = iter(s)\n\n if all(char in s_iter for char in word):\n return word\n \n return \"\"\n \"\"\"\n\n longest_word = \"\"\n\n for word in dictionary:\n s_iter = iter(s)\n\n if all(char in s_iter for char in word):\n if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):\n longest_word = word\n \n return longest_word","runtime":"113"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n for word in sorted(dictionary, key = lambda w: (-len(w), w)):\n it = iter(s)\n if all(c in it for c in word): \n return word\n return ''","runtime":"113"},{"code":"class Solution:\n def binsearch(self, lst, l, r, x):\n while (l < r):\n mid = l + (r - l) // 2\n if lst[mid] > x:\n r = mid\n else:\n l = mid + 1\n return l\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key = lambda x: (-len(x), x))\n\n dic = {}\n for i, c in enumerate(s):\n if c in dic:\n dic[c].append(i)\n else:\n dic[c] = [i]\n \n res = \"\"\n\n for s in dictionary:\n found = True\n m = -1\n for c in s:\n if c in dic:\n lst = dic[c]\n else:\n found = False\n break\n\n idx = self.binsearch(lst, 0, len(lst), m)\n if idx == len(lst):\n found =False\n break\n m = lst[idx]\n\n if found:\n res = s\n break\n \n return res\n\n\n \n\n \n \n \n ","runtime":"117"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n letter_positions = defaultdict(list)\n for i in range(len(s)):\n letter_positions[s[i]].append(i)\n\n for word in sorted(dictionary, key=lambda w: (-len(w), w)):\n pos = 0\n isSubsequence = True\n for c in word:\n if c not in letter_positions:\n isSubsequence = False\n break\n possible_positions = [p for p in letter_positions[c] if p >= pos]\n if not possible_positions:\n isSubsequence = False\n break\n pos = possible_positions[0] + 1\n if isSubsequence:\n return word \n return \"\"\n\n ","runtime":"120"},{"code":"class Solution:\n def find(self,s,word):\n idx=0\n for i in s:\n if i==word[idx]:\n if idx+1==len(word):\n return True\n idx+=1\n return False\n def findLongestWord(self, s: str, words: List[str]) -> str:\n seen=''\n for i in words:\n if self.find(s,i):\n if len(i)>len(seen):\n seen=i\n elif len(i)==len(seen) and i<seen:\n seen=i\n return seen\n\n","runtime":"124"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n letter_positions = defaultdict(list)\n for i in range(len(s)):\n letter_positions[s[i]].append(i)\n \n def isSubsequence(word, s):\n pos = 0\n for c in word:\n possible_positions = [p for p in letter_positions[c] if p >= pos]\n if not possible_positions:\n return False\n pos = possible_positions[0] + 1\n return True\n\n # def isSubsequence(word, s):\n # j = 0\n # for i in range(len(s)):\n # if j >= len(word):\n # break\n # if s[i] == word[j]:\n # j += 1\n # return j == len(word)\n\n for word in sorted(dictionary, key=lambda w: (-len(w), w)):\n if isSubsequence(word, s):\n return word\n return \"\"\n\n # max_word = \"\"\n # for word in dictionary:\n # if isSubsequence(word, s):\n # if len(word) > len(max_word) or len(word) == len(max_word) and word < max_word:\n # max_word = word\n # return max_word\n\n ","runtime":"127"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n res = \"\"\n for word in dictionary:\n # compare the two\n valid = False\n m = len(word)\n i = 0\n for c in s:\n if c == word[i]:\n i += 1\n if i == m:\n valid = True\n break\n if valid:\n if len(word) > len(res):\n res = word\n elif len(word) == len(res) and word < res:\n res = word\n return res","runtime":"127"},{"code":"class Solution:\n def find(self,s,word):\n idx=0\n for i in s:\n if i==word[idx]:\n if idx+1==len(word):\n return True\n idx+=1\n return False\n def findLongestWord(self, s: str, words: List[str]) -> str:\n seen=''\n for i in words:\n if self.find(s,i):\n if len(i)>len(seen):\n seen=i\n elif len(i)==len(seen) and i<seen:\n seen=i\n return seen\n\n","runtime":"131"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key = lambda x: (-len(x), x))\n\n for word in dictionary:\n count = 0\n for ch in s:\n if ch == word[count]:\n count += 1\n if count == len(word):\n break\n if count == len(word):\n return word\n return \"\"","runtime":"131"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n ans=''\n for x in dictionary:\n i=0\n for c in s:\n if c==x[i]:\n i+=1\n if i==len(x):\n if ans=='' or len(x)>len(ans) or (len(x)==len(ans) and x<ans):\n ans=x\n break\n return ans","runtime":"134"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n words = sorted(dictionary, key=lambda word: (-len(word), word))\n for word in words:\n n = len(word)\n i = 0 \n for c in s:\n if c == word[i]:\n i += 1\n if i == n:\n return word\n return ''","runtime":"138"},{"code":"class Solution:\n def findLongestWord(self, s: str, words: List[str]) -> str:\n seen = ''\n for i in words:\n if self.find(s, i):\n if len(i) > len(seen):\n seen = i\n elif len(i) == len(seen) and i < seen:\n seen = i\n return seen\n \n def find(self, s, w):\n ind = 0\n for i in s:\n if i == w[ind]:\n if ind + 1 == len(w):\n return True\n ind += 1\n return False","runtime":"138"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n # find common string between strings in dictionary and s.\n dictionary.sort(key = lambda x: (-len(x), x))\n\n def isSub(s, t):\n if len(s) > len(t):\n return False\n s_idx = 0\n s_n = len(s)\n for char in t:\n if s_idx < s_n and s[s_idx] == char:\n s_idx += 1\n return s_idx == s_n\n\n for w in dictionary:\n if isSub(w, s):\n return w\n return \"\"\n\n\n\n # idea: sort d and search each word in d\n #d.sort(key = lambda x: (-len(x), x)) \n #for word in d:\n # if self.isSubSequence(s, word):\n # return word\n #return ''\n","runtime":"142"},{"code":"class Solution:\n def isPossible(self, s1, s2):\n j = 0\n for char in s1:\n if s2[j] == char:\n j += 1\n if j == len(s2):\n return True\n return False\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n for word in dictionary:\n if self.isPossible(s, word):\n return word\n return ''\n\n ","runtime":"142"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n letter_positions = defaultdict(list)\n for i in range(len(s)):\n letter_positions[s[i]].append(i)\n \n def isSubsequence(word, s):\n pos = 0\n for c in word:\n possible_positions = [p for p in letter_positions[c] if p >= pos]\n if not possible_positions:\n return False\n pos = possible_positions[0] + 1\n return True\n\n # def isSubsequence(word, s):\n # j = 0\n # for i in range(len(s)):\n # if j >= len(word):\n # break\n # if s[i] == word[j]:\n # j += 1\n # return j == len(word)\n\n # for word in sorted(dictionary, key=lambda w: (-len(w), w)):\n # if isSubsequence(word, s):\n # return word\n # return \"\"\n\n max_word = \"\"\n for word in dictionary:\n if isSubsequence(word, s):\n if len(word) > len(max_word) or len(word) == len(max_word) and word < max_word:\n max_word = word\n return max_word\n\n ","runtime":"145"},{"code":"class Solution:\n def find(self,s,word):\n idx=0\n for i in s:\n if i==word[idx]:\n if idx+1==len(word):\n return True\n idx+=1\n return False\n def findLongestWord(self, s: str, words: List[str]) -> str:\n seen=''\n for i in words:\n if self.find(s,i):\n if len(i)>len(seen):\n seen=i\n elif len(i)==len(seen) and i<seen:\n seen=i\n return seen","runtime":"145"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n res = ''\n length = 0\n\n for word in dictionary:\n if self.check(s, word) and length <= len(word):\n if length < len(word):\n res = word\n length = len(word)\n elif res > word:\n res = word\n return res\n\n\n\n def check(self, s, subseq):\n i = 0\n n = len(subseq)\n\n if len(s) < n:\n return False\n\n for c in s:\n if c == subseq[i]:\n i += 1\n if i == n:\n return True\n \n return i == n","runtime":"149"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n ret = ''\n\n for i in dictionary:\n flag = False\n k = 0\n\n for j in s:\n if j == i[k]:\n k+=1\n if k==len(i):\n flag = True\n break\n\n if flag: \n if len(i)>len(ret) or (len(i)==len(ret) and i<ret):\n ret = i\n \n\n return ret\n \n ","runtime":"149"},{"code":"class Solution:\n def findLongestWord(self, s: str, words: List[str]) -> str:\n res=\"\"\n m=len(s)\n for word in words:\n n=len(word)\n if n>m or n<len(res):\n continue\n i=0\n for char in s:\n if char==word[i]:\n i+=1\n if i==n:\n if n>len(res):\n res=word\n else:\n res=min(res,word)\n break\n return res\n ","runtime":"152"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n def is_subseq(main: str, sub: str) -> bool:\n i, j, m, n = 0, 0, len(main), len(sub)\n while i < m and j < n and n - j >= m - i:\n if main[i] == sub[j]:\n i += 1\n j += 1\n return i == m\n \n res = ''\n helper = sorted(d, key = lambda x: len(x), reverse = True)\n for word in helper:\n if len(word) < len(res): return res\n if ( not res or word < res ) and is_subseq(word, s):\n res = word\n return res","runtime":"156"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n longest = ''\n for word in dictionary:\n if len(word) < len(longest):\n continue\n if not self.canForm(s, word):\n continue\n if (len(word) > len(longest) or \n (len(word) == len(longest) and word < longest)\n ):\n longest = word\n \n return longest\n\n def canForm(self, s: str, word: str) -> bool: \n sindex = 0\n slen = len(s)\n\n for c in word:\n while sindex < slen and s[sindex] != c:\n sindex += 1\n if sindex >= slen:\n return False\n sindex += 1\n \n return True","runtime":"159"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n def is_subseq(main: str, sub: str) -> bool:\n i, j, m, n = 0, 0, len(main), len(sub)\n while i < m and j < n and n - j >= m - i:\n if main[i] == sub[j]:\n i += 1\n j += 1\n return i == m\n \n res = ''\n helper = sorted(d, key = lambda x: len(x), reverse = True)\n for word in helper:\n if len(word) < len(res): return res\n if ( not res or word < res ) and is_subseq(word, s):\n res = word\n return res","runtime":"163"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n d.sort(key=lambda x : (-len(x),x))\n\n for word in d:\n i = 0\n for c in s:\n if i < len(word) and c == word[i]:\n i += 1\n \n if i == len(word):\n return word\n return ''","runtime":"166"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n def is_subseq(main: str, sub: str) -> bool:\n i, j, m, n = 0, 0, len(main), len(sub)\n while i < m and j < n and n - j >= m - i:\n if main[i] == sub[j]:\n i += 1\n j += 1\n return i == m\n \n res = ''\n helper = sorted(d, key = lambda x: len(x), reverse = True)\n for word in helper:\n if len(word) < len(res): return res\n if ( not res or word < res ) and is_subseq(word, s):\n res = word\n return res","runtime":"170"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n maxString = \"\"\n for word in dictionary:\n wordLength = len(word)\n i = 0\n for char in s:\n if word[i] == char:\n i += 1\n if i == wordLength:\n break\n if i == wordLength:\n if wordLength > len(maxString):\n maxString = word\n elif wordLength == len(maxString) and word < maxString:\n maxString = word\n return maxString\n","runtime":"170"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def is_valid(string): # can we get the string by deleting some letters or not\n i = 0\n for letter in s:\n if letter == string[i]:\n i += 1\n if i == len(string):\n return True\n return i == len(string)\n\n dictionary.sort() # sorting alphabetically\n dictionary.sort(key=len, reverse=True) # sorting by the length; as a result - sorting both alphabetically and by length\n for word in dictionary:\n if is_valid(word):\n return word\n return ''\n\n","runtime":"173"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n def is_subseq(main: str, sub: str) -> bool:\n i, j, m, n = 0, 0, len(main), len(sub)\n while i < m and j < n and n - j >= m - i:\n if main[i] == sub[j]:\n i += 1\n j += 1\n return i == m\n \n res = ''\n helper = sorted(d, key = lambda x: len(x), reverse = True)\n for word in helper:\n if len(word) < len(res): return res\n if ( not res or word < res ) and is_subseq(word, s):\n res = word\n return res","runtime":"177"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n \n dictionary.sort(key=lambda item: (-len(item), item))\n for word in dictionary:\n i = 0\n for c in s:\n\n if word[i] == c:\n i+=1\n \n if i == len(word):\n return word\n return \"\"\n \n\n ","runtime":"177"},{"code":"class Solution:\n\n def check(self, word: str, s: str) -> bool:\n ptr = 0\n n = len(s)\n for letter in word:\n \n while ptr<n and s[ptr] != letter:\n ptr+=1\n \n \n if ptr==n:\n return False\n \n ptr += 1\n\n return True\n\n\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n \n dictionary.sort(key=lambda word: (-len(word), word), reverse = True)\n\n output = \"\"\n for word in dictionary:\n if self.check(word, s):\n output = word\n \n return output\n","runtime":"180"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n res = ''\n for word in dictionary:\n pointer = 0\n for i in s:\n if pointer < len(word):\n if i == word[pointer]:\n pointer += 1\n if pointer == len(word):\n print(word, 'is in s')\n if len(res) < len(word):\n res = word\n elif len(res) == len(word):\n res = min([res,word])\n return res ","runtime":"180"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def isSub(w):\n p = 0\n for a in s:\n if p==len(w):\n return True\n if w[p]==a:\n p+=1\n return p==len(w)\n dictionary.sort(key=lambda x: (-len(x), x))\n for w in dictionary:\n if isSub(w):\n return w\n return ''","runtime":"184"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # sort first and the check each if we should reject\n dictionary.sort(key = lambda x: (-len(x), x))\n for word in dictionary:\n i = 0\n for ch in s:\n if i < len(word) and word[i] == ch:\n i += 1\n if i == len(word):\n return word\n return \"\"","runtime":"184"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n \n for word in dictionary:\n i = 0\n for c in s:\n if i < len(word) and c == word[i]:\n i += 1\n if i == len(word):\n break\n if i == len(word):\n return word\n return \"\"","runtime":"188"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n\n for word in dictionary:\n count = 0\n\n for c in s:\n if count < len(word) and c == word[count]:\n count += 1\n\n if count == len(word):\n return word\n\n return \"\"","runtime":"188"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n print(dictionary)\n for word in dictionary:\n j = 0\n for x in s:\n if j < len(word) and x == word[j]:\n j += 1\n if j == len(word):\n return word\n return ''\n \n ","runtime":"191"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: list[str]) -> str:\n\n def can_form(word):\n i = 0\n for char in s:\n if i < len(word) and char == word[i]:\n i += 1\n return i == len(word)\n\n longest = \"\"\n for word in d:\n if can_form(word) and (not longest or len(word) > len(longest) or (len(word) == len(longest) and word < longest)):\n longest = word\n return longest","runtime":"191"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key = lambda x: (-len(x), x))\n\n for word in dictionary:\n count = 0\n for ch in s:\n if count < len(word) and ch == word[count]:\n count += 1\n if count == len(word):\n break\n if count == len(word):\n return word\n return \"\"","runtime":"195"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n for word in dictionary:\n j = 0\n for x in s:\n if j < len(word) and x == word[j]:\n j += 1\n if j == len(word):\n return word\n return ''","runtime":"195"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # sort first and the check each if we should reject\n dictionary.sort(key = lambda x: (-len(x), x))\n for word in dictionary:\n i = 0\n for ch in s:\n if i < len(word) and word[i] == ch:\n i += 1\n if i == len(word):\n return word\n return \"\"\n","runtime":"198"},{"code":"'''\nLongest word: We want to find the longest word which exists in the dictionary, which can be formed as a subtring or s\nStart by building a trie on dictionary\n\nThen we do a dfs on s: \nFor each letter in s:\nif letter is in the current next of the tree, we traverse the tree to that position and recurse from there. \nIf letter is not in the current next of the tree, we skip the letter and go to the next one.\n\nWe should be able to improve this search by caching some results \n\nFor example, if s = 'cplea' and we are at a node, we can store the longest word from that node. \n\n'''\n\nclass Solution:\n def isSubstring(self, word, s):\n left = 0\n right = len(s) - 1\n remaining = len(word)\n wordLeft = 0\n wordRight = len(word) - 1\n while left <= right:\n if s[left] == word[wordLeft]:\n remaining -= 1\n wordLeft += 1\n if s[right] == word[wordRight]:\n remaining -= 1\n wordRight -= 1\n left += 1\n right -= 1\n if remaining <= 0:\n return True\n #print(remaining)\n return remaining <= 0\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n longest = \"\"\n for word in dictionary:\n #print(word)\n if self.isSubstring(word, s) and (len(word) > len(longest) or (len(word) == len(longest) and word < longest)):\n #print(\"Longest was\", longest, \"Now is\", word)\n longest = word\n return longest ","runtime":"198"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n n = len(s)\n ans_len = -1\n\n def consist(s1,s):\n i = 0\n m = len(s1)\n j = 0\n for i in range(m):\n while j<n:\n if s[j]==s1[i]: break\n j = j + 1\n if j==n: return False\n j = j+1\n return True\n\n # print(consist(dictionary[0],s))\n\n \n for s1 in dictionary:\n if consist(s1,s):\n if len(s1)>ans_len:\n ans_len=len(s1)\n ans = s1\n elif len(s1)==ans_len:\n if ans>s1:\n ans = s1\n if ans_len>-1: return ans\n else: return \"\"\n\n ","runtime":"202"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n dictionary.sort(key=lambda s: (-len(s), s))\n\n for word in dictionary:\n\n wordIdx = 0\n for letter in s:\n if word[wordIdx] == letter:\n wordIdx += 1\n\n if wordIdx == len(word):\n break\n \n if wordIdx == len(word):\n return word\n\n return ''\n \n","runtime":"205"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def formable(s, word):\n s = list(s)\n word = list(word)\n p1 = 0\n p2 = 0\n n = len(s)\n m = len(word)\n while(p2 < m):\n if p1 == n:\n return False\n if s[p1] == word[p2]:\n p2+=1\n p1+=1\n \n return True\n \n \n dictionary.sort(key = lambda x:(-len(x),x))\n\n for word in dictionary:\n if formable(s,word):\n return word\n return \"\"\n","runtime":"205"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def check(a, b):\n m, n = len(a), len(b)\n i = j = 0\n while i < m and j < n:\n if a[i] == b[j]:\n j += 1\n i += 1\n return j == n\n\n ans = ''\n for a in dictionary:\n if check(s, a) and (len(ans) < len(a) or (len(ans) == len(a) and ans > a)):\n ans = a\n return ans\n ","runtime":"209"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n n = len(s)\n ret = \"\"\n for w in dictionary:\n nw = len(w)\n if (nw > n) or (nw < len(ret)) or ((nw == len(ret)) and (w > ret)):\n continue\n i,j = 0,0\n while i < n and j < nw:\n if s[i] == w[j] :\n i += 1\n j += 1\n else:\n i += 1\n if j >= nw:\n if (ret == \"\") or (nw > len(ret)):\n ret = w\n elif nw == len(ret) and w < ret:\n ret = w\n return ret\n\n \n","runtime":"209"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def check(s: str, t: str) -> bool:\n m, n = len(s), len(t)\n i = j = 0\n while i < m and j < n:\n if s[i] == t[j]:\n i += 1\n j += 1\n return i == m\n\n ans = \"\"\n for t in dictionary:\n if check(t, s) and (len(ans) < len(t) or (len(ans) == len(t) and ans > t)):\n ans = t\n return ans","runtime":"212"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def isSubsequence(x, y):\n j = 0\n for i in range(len(y)):\n if j < len(x) and x[j] == y[i]:\n j += 1\n return j == len(x)\n \n dictionary.sort(key=lambda x: (-len(x), x))\n \n for word in dictionary:\n if isSubsequence(word, s):\n return word\n \n return \"\"\n\n# Example usage:\nsolution = Solution()\ns = \"abpcplea\"\ndictionary = [\"ale\",\"apple\",\"monkey\",\"plea\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"apple\"","runtime":"212"},{"code":"from collections import defaultdict\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n d = defaultdict(list)\n for i in range(len(s)): d[s[i]].append(i) # 字母：所有位置\n size = {i: len(d[i]) for i in d} # 字母：總數量\n dictionary.sort()\n ans, l = '', 0 # 目前答案，目前答案長度\n for key in dictionary: # 檢查每個 key\n c = defaultdict(int) # 字母：使用數量\n p, flag = 0, 1 # 目前在 key 的起始位置， flag=0 時即不符合 ans 條件\n for letter in key: # 檢查 key 的每個字母\n if letter in d: # 如果此字母 in d\n if c[letter] == size[letter]: # 如果目前使用字母數量已達到限制\n flag = 0\n break\n while p > d[letter][c[letter]]: # 如果目前位置 > s 裡此字母位置(s 此字母位置需大於等於目前位置才能夠使用)\n c[letter] += 1 # s 裡此字母位置+1\n if c[letter] == size[letter]: # 如果目前使用字母數量達到限制\n flag = 0\n break\n if flag == 0: break\n p = d[letter][c[letter]] # 更新目前位置\n c[letter] += 1 # 更新此字母使用數量\n else:\n flag = 0\n break\n if flag and len(key) > l: # 若 flag 且 長度超過目前答案長度，更新\n l = len(key)\n ans = key\n return ans\n","runtime":"216"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x:(-len(x),x))\n \n\n def helper(sub,who):\n n,m=len(sub),len(who)\n i,j=0,0\n while j<m and i<n:\n if sub[i]==who[j]:\n i+=1\n j+=1\n return i==n\n\n op=''\n for w in dictionary:\n if helper(w,s):\n return w\n return op\n ","runtime":"216"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n\n arr=[]\n n=len(s)\n\n for i in dictionary:\n\n p1=0\n p2=0\n m=len(i)\n\n while p1<m and p2<n:\n\n\n if i[p1]==s[p2]:\n p1+=1\n p2+=1\n \n else:\n p2+=1\n \n if p1==m:\n arr.append(i)\n\n if arr==[]:\n return \"\"\n\n arr=sorted(arr, key=lambda x: len(x))\n h=len(arr[-1])\n\n arr=list(filter(lambda x: True if len(x)==h else False, arr))\n\n print(arr)\n\n return min(arr)","runtime":"219"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n \"\"\"\n # NOTE: sorting doesn't quite work because the string might be messed up\n abpcplea -> aabcelpp\n\n What about checking every word in the dictionary character by character, starting from the longest string possible\n [\"ale\", \"plea\", \"apple\",\"monkey\"]\n\n \"monkey\" -> not found anywhere in abpcplea move to the next word\n \"apple\" -> \"abpcplea\"\n\n let pointer 1 and pointer 2 point to the start at both words\n increment pointer 2 by 1 while the character isn't matching with pointer 1\n continue until the end of the word and reset both pointers\n if it is, that's sor answer\n\n p1 = 2\n app\n\n p2 = 4\n a [b] p [c] p\n \"\"\"\n # sort the dictionary in reversed order\n # there might be instances where dictionary has repeated words\n # this is to scan the largest letter first\n dictionary = sorted(set(dictionary), key=lambda x: (-len(x), x))\n\n # iterate through each word of the dictionary,\n # initiate two poitners, one to the character of each letter in the word and perform the above\n for word in dictionary:\n\n p2 = 0\n new_s = \"\"\n\n # here we want to scan through each letter of the word\n # if this entire for loop complete without issue, this is the answer\n for p, c in enumerate(word):\n\n if p2 == len(s): break\n # while we can add p2\n\n while p2 < len(s):\n if s[p2] == c:\n if word == 'apple': print(s[p2])\n new_s += s[p2]\n p2 += 1\n break\n p2 += 1\n if word == new_s:\n return word\n\n \n return \"\"\n","runtime":"219"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n ht = {}\n s_length = len(s)\n res = ''\n res_length = 0\n for string in dictionary:\n p1, p2 = 0, 0\n string_length = len(string)\n while p1 < s_length and p2 < string_length:\n if (s[p1] == string[p2]):\n p1 += 1\n p2 += 1\n continue\n p1 += 1 #increase the string being compared against\n\n if (p2 == string_length):\n\n if string_length > res_length:\n res = string\n res_length = string_length\n if (string_length == res_length):\n res = string if string < res else res\n\n return res\n\n\n ","runtime":"223"},{"code":"class TrieNode:\n\n def __init__(self):\n self.children = defaultdict(TrieNode)\n self.end = False\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n\n for word in dictionary:\n if len(word) > len(s):\n continue\n cur = 0\n for i in range(len(s)):\n if s[i] == word[cur]:\n cur += 1\n if cur == len(word):\n return word\n\n return \"\"\n","runtime":"223"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n n = len(s)\n def isSubseq(word):\n longWord, shortWord = 0, 0\n nShort = len(word)\n while longWord < n and shortWord < nShort:\n if s[longWord] == word[shortWord]:\n shortWord += 1\n longWord += 1\n return shortWord == nShort\n dictionary.sort(key=lambda x:(-len(x),x))\n for word in dictionary:\n if isSubseq(word):\n return word\n return \"\"","runtime":"226"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(reverse=True)\n len_found = -1\n string_found = ''\n s_len = len(s)\n for word in dictionary:\n i = 0\n j = 0\n word_len = len(word)\n while i < s_len and j < word_len:\n if word[j] == s[i]:\n j += 1\n i += 1\n else:\n i += 1\n if j == word_len:\n if word_len >= len_found:\n string_found = word\n len_found = word_len\n return string_found\n \n","runtime":"226"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # a is sub of b\n def isSubsequence(a, b):\n j = 0\n for i in range(len(b)):\n if j < len(a) and b[i] == a[j]:\n j += 1\n if j == len(a):\n return True\n return j == len(a)\n \n dictionary.sort(key=lambda x:(-len(x), x))\n for word in dictionary:\n if isSubsequence(word, s):\n return word\n return ''\n\n\n \n ","runtime":"230"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda word: (-len(word),word))\n for word in dictionary:\n if self.compare(s,word):\n return word\n return \"\"\n\n def compare(self,s,word):\n idx = 0\n for i in range(len(s)):\n if idx < len(word) and s[i] == word[idx]:\n idx += 1\n if idx == len(word):\n return True\n return False","runtime":"230"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def isSubsequence(x, y):\n j = 0\n for i in range(len(y)):\n if j < len(x) and x[j] == y[i]:\n j += 1\n return j == len(x)\n \n dictionary.sort(key=lambda x: (-len(x), x))\n for word in dictionary:\n if isSubsequence(word, s):\n return word\n return \"\"","runtime":"234"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n def canMatch(w):\n cPointer = 0\n for c in s:\n if cPointer >= len(w):\n break\n\n if c == w[cPointer]:\n cPointer += 1\n\n if cPointer == len(w):\n return w\n\n def lexicographicallySmaller(w1, w2):\n for i in range(len(w1)):\n if w1[i] < w2[i]:\n return True\n elif w1[i] > w2[i]:\n return False\n return False\n\n res = \"\"\n\n for w in dictionary:\n if canMatch(w):\n if len(w) > len(res):\n res = w\n elif len(w) == len(res) and lexicographicallySmaller(w, res):\n res = w\n \n return res\n \n","runtime":"234"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n for word in dictionary:\n i = 0\n for char in s:\n if i < len(word) and char == word[i]:\n i += 1\n if i == len(word):\n return word\n return \"\"","runtime":"237"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key= lambda x : (-1*len(x),x))\n print(dictionary)\n for i in range(len(dictionary)):\n word = dictionary[i]\n\n l = 0\n for letter in s:\n if l < len(word) and word[l] == letter:\n l += 1\n \n if l == len(word):\n return word\n return \"\"\n ","runtime":"244"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def check_subarr(s, word):\n i = 0\n j = 0\n while i < len(word):\n while j < len(s) and s[j] != word[i]:\n j += 1\n if j == len(s):\n return False\n j += 1\n i += 1\n return True\n\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n for word in dictionary:\n if check_subarr(s, word):\n return word\n return \"\"\n\n ","runtime":"244"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def check_subarr(s, word):\n i = 0\n j = 0\n while i < len(word):\n while j < len(s) and s[j] != word[i]:\n j += 1\n if j == len(s):\n return False\n j += 1\n i += 1\n return True\n #dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n\n best_word = \"\"\n best_len = 0\n for word in dictionary:\n if (len(word) > best_len or len(word) == best_len and word < best_word) and check_subarr(s, word):\n #print(word)\n best_len = len(word)\n best_word = word\n return best_word\n\n ","runtime":"248"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n d = sorted(d, key=lambda x: (-len(x), x), reverse=False)\n count = len(d)\n print(d)\n while count>0:\n for i in range(len(d)):\n idx=0\n for j in range(len(s)):\n if d[i][idx]==s[j]:\n idx+=1\n if idx==len(d[i]):\n return d[i]\n count-=1\n return \"\"\n","runtime":"251"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n longest_word = \"\"\n for word in dictionary:\n word_index = 0\n for char in s:\n if word_index < len(word) and char == word[word_index]:\n word_index += 1\n if word_index == len(word):\n break\n if word_index == len(word):\n if len(longest_word) < len(word) or (len(longest_word) == len(word) and word < longest_word):\n longest_word = word\n return longest_word","runtime":"251"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n n = len(s)\n r = \"\"\n for x in dictionary:\n i, j = 0, 0\n while i < len(x) and j < n:\n if x[i] == s[j]:\n i += 1\n j += 1\n if i == len(x):\n if r == \"\" or len(x) > len(r):\n r = x\n elif len(r) > 1 and len(r) == len(x) and x < r:\n r = x\n return r\n \n","runtime":"255"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n dictionary.sort(reverse=True, key=len)\n for word in dictionary:\n first = 0\n last = 0\n while first < len(s):\n if s[first] == word[last]:\n last += 1\n if last == len(word):\n return word\n first += 1\n continue\n first += 1\n return '' ","runtime":"255"},{"code":"from collections import Counter, defaultdict\n\nclass Solution:\n def can_form(self, s, w):\n i = 0\n j = 0\n while j < len(s) and i < len(w):\n while j < len(s) and s[j] != w[i]:\n j += 1\n while j < len(s) and i < len(w) and s[j] == w[i]:\n j += 1\n i += 1\n \n if i == len(w):\n break\n return i == len(w)\n\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n\n for w in dictionary:\n to_add = self.can_form(s, w)\n if to_add:\n return w\n return \"\"\n\n ","runtime":"258"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n possible_results = []\n\n for word in dictionary:\n i = 0\n j = 0\n\n curr_word_len = len(word)\n s_len = len(s)\n found = True\n for i in range(curr_word_len):\n while(j < s_len):\n if s[j] == word[i]:\n break\n else:\n j += 1\n if j < s_len:\n j += 1\n else:\n found = False\n break\n if found:\n if len(possible_results) > 0:\n if len(possible_results[0]) < curr_word_len:\n possible_results = [word]\n elif len(possible_results[0]) == curr_word_len:\n possible_results.append(word)\n else:\n possible_results = [word]\n\n if len(possible_results) == 0:\n return \"\"\n else:\n return sorted(possible_results)[0]\n","runtime":"258"},{"code":"class Solution:\n def contains(self, s, word):\n i_s = 0\n i_word = 0\n while ((i_s < len(s)) and (i_word < len(word))):\n while ((i_s < len(s)) and (s[i_s] != word[i_word])):\n i_s += 1\n if (i_s >= len(s)):\n break\n i_s += 1\n i_word += 1\n return (i_word >= len(word))\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n for word in dictionary:\n if self.contains(s, word):\n return word\n return \"\"\n","runtime":"262"},{"code":"def is_substring(s: str, w: str) -> bool:\n i, j = 0, 0\n\n while i < len(s) and j < len(w):\n while i < len(s) and s[i] != w[j]:\n i += 1\n if i == len(s):\n break\n i += 1\n j += 1\n return j == len(w)\n\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dic = sorted(dictionary, key=lambda x: (-len(x), x))\n for w in dic:\n if is_substring(s, w):\n return w\n return \"\"\n","runtime":"262"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n maxString = \"\"\n for word in dictionary:\n wordLength = len(word)\n i, j = 0, 0\n while i < wordLength and j < len(s):\n if word[i] == s[j]:\n i += 1\n j += 1\n if i == wordLength:\n if wordLength > len(maxString):\n maxString = word\n elif wordLength == len(maxString):\n maxString = min(maxString, word)\n return maxString\n","runtime":"265"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n \n for word in dictionary:\n slow = 0\n for fast in range(len(s)):\n if s[fast] == word[slow]:\n slow += 1\n \n if slow == len(word):\n return word\n fast += 1\n return \"\"\n","runtime":"265"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n output = ['']\n\n for word in dictionary:\n i , j = 0 , 0\n while i < len(s):\n if s[i] == word[j]:\n if j == len(word) - 1:\n if len(word) > len(output[-1]):\n output = [word] \n elif len(word) == len(output[-1]):\n output.append(word)\n break\n i += 1\n j += 1\n else:\n i += 1\n print(output)\n output.sort()\n print(output)\n return output[0]","runtime":"269"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n n = [len(s)]\n def contains(w):\n m = len(w)\n l = r = 0\n while l<n[0] and r<m:\n r += s[l]==w[r]\n l += 1\n return r==m\n longest, ans = 0, ''\n for w in dictionary:\n m = len(w)\n if contains(w) and (m>longest or (m==longest and w<ans)):\n longest = m\n ans = w\n return ans","runtime":"269"},{"code":"from collections import Counter, defaultdict\n\nclass Solution:\n def can_form(self, s, w):\n i = 0\n j = 0\n while j < len(s) and i < len(w):\n while j < len(s) and s[j] != w[i]:\n j += 1\n while j < len(s) and i < len(w) and s[j] == w[i]:\n j += 1\n i += 1\n return i == len(w)\n\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n selection = []\n to_skip = 0\n for w in dictionary:\n if len(w) < to_skip:\n continue\n to_add = self.can_form(s, w)\n if not to_add:\n continue\n\n if not selection:\n selection.append(w)\n to_skip = len(w)\n else:\n if len(w) > to_skip:\n selection = [w]\n to_skip = len(w)\n else:\n selection.append(w)\n if not selection:\n return \"\"\n else:\n return sorted(selection)[0]\n\n ","runtime":"272"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n indices = [0] * len(dictionary)\n for c in s:\n for i, w in enumerate(dictionary):\n if indices[i] < len(w) and c == w[indices[i]]:\n indices[i] += 1\n best = 0\n for i, w in zip(indices, dictionary):\n if i == len(w):\n best = max(best, i)\n result = None\n for i, w in zip(indices, dictionary):\n if i == len(w) and i == best:\n if result is None:\n result = w\n else:\n result = min(result, w)\n return result or \"\"","runtime":"272"},{"code":"class Solution:\n def contains(self, s, word):\n print(s)\n print(word)\n i_s = 0\n i_word = 0\n while ((i_s < len(s)) and (i_word < len(word))):\n while ((i_s < len(s)) and (s[i_s] != word[i_word])):\n i_s += 1\n if (i_s >= len(s)):\n break\n # print(i_s, i_word)\n # print(s[i_s], word[i_word])\n i_s += 1\n i_word += 1\n # print(i_word)\n return (i_word >= len(word))\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n # print(dictionary[0])\n # print(dictionary[1])\n # word = \"ettphsiunoglotjlccurlre\"\n # print(self.contains(s, word))\n\n for word in dictionary:\n print(word)\n if self.contains(s, word):\n return word\n return \"\"\n","runtime":"276"},{"code":"def isSubsequence(s, t):\n s = list(s)\n t = list(t)\n ind = 0\n while t and s and ind<len(t):\n if s[0]==t[ind]:\n s.pop(0)\n ind+=1\n \n if len(s)==0:\n return True\n return False\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dic = {}\n maxi = 0\n res = []\n for el in dictionary:\n if isSubsequence(el,s):\n print(el, s)\n if maxi<=len(el):\n res.append((el, len(el)))\n maxi = len(el)\n\n res = list(filter(lambda x: x[1]==maxi, res))\n res = sorted(res, key=lambda x: x[0])\n if res:\n return res[0][0]\n return ''\n \n \n \n","runtime":"276"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n n = [len(s)]\n def contains(w):\n m = len(w)\n l = r = 0\n while l<n[0] and r<m:\n r += s[l]==w[r]\n l += 1\n return r==m\n for w in dictionary:\n if contains(w): return w\n return ''","runtime":"280"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n \n for word in dictionary:\n i = 0\n for lett in word:\n while i < len(s) and lett != s[i]:\n i += 1\n if i >= len(s):\n break\n if i >= len(s):\n break\n i += 1\n else:\n return word\n \n return \"\"\n ","runtime":"280"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n longest_word = ''\n for word in d:\n i , j =0 , 0\n while i < len(word) and j < len(s):\n if word[i] == s[j]:\n i+=1\n j+=1\n else:\n j+=1\n if i == len(word):\n if len(longest_word) < len(word):\n longest_word = word\n elif len(word) == len(longest_word):\n longest_word = min(longest_word , word)\n return longest_word\n\nclass Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n res = ''\n for cand in d:\n if self.find(s, cand) and (len(cand) > len(res) or (len(cand) == len(res) and cand < res)):\n res = cand\n return res\n \n\n def find(self , s ,d):\n i , j = 0 , 0\n while i < len(s) and j < len(d):\n if s[i] == d[j]:\n i+=1\n j+=1\n else:\n i+=1\n return j == len(d)","runtime":"283"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n # sort the dictionary by length in lexicographical order\n dictionary.sort()\n dictionary.sort(key=len, reverse=True) \n # print(dictionary)\n\n # check whether dictionary[i] is a substring of s\n for i in dictionary:\n if self.isSubstring(i, s):\n return i\n \n return ''\n\n # check if s1 is a substring of s2\n def isSubstring(self, s1, s2):\n # len(s1) <= len(s2)\n i = 0\n j = 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i+=1\n j+=1\n else:\n j+=1\n \n if i == len(s1) and j <= len(s2):\n return True\n else:\n return False","runtime":"283"},{"code":"from typing import List\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def is_subsequence(s, word):\n i = j = 0\n while i < len(s) and j < len(word):\n if s[i] == word[j]:\n j += 1\n i += 1\n return j == len(word)\n\n dictionary.sort(key=lambda x: (-len(x), x))\n\n for word in dictionary:\n if is_subsequence(s, word):\n return word\n\n return \"\"\n\n# Example usage:\nsolution = Solution()\ns = \"abpcplea\"\ndictionary = [\"ale\",\"apple\",\"monkey\",\"plea\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"apple\"","runtime":"287"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n d.sort()\n d.sort(key=len,reverse=True)\n for word in d:\n j=0\n count=0\n for i in range(len(word)):\n while j<len(s):\n if word[i]==s[j]:\n count+=1\n j+=1\n break\n else:\n j+=1\n if count==len(word):\n return word\n\n return \"\"\n","runtime":"287"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n longest_word = ''\n for word in d:\n i , j =0 , 0\n while i < len(word) and j < len(s):\n if word[i] == s[j]:\n i+=1\n j+=1\n else:\n j+=1\n if i == len(word):\n if len(longest_word) < len(word):\n longest_word = word\n elif len(word) == len(longest_word):\n longest_word = min(longest_word , word)\n return longest_word\n\nclass Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n res = ''\n for cand in d:\n if self.find(s, cand) and (len(cand) > len(res) or (len(cand) == len(res) and cand < res)):\n res = cand\n return res\n \n\n def find(self , s ,d):\n i , j = 0 , 0\n while i < len(s) and j < len(d):\n if s[i] == d[j]:\n i+=1\n j+=1\n else:\n i+=1\n return j == len(d)","runtime":"290"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # 2024.9.11\n def check(word):\n m = len(s)\n n = len(word) \n l_s, l_w = 0, 0\n #r_s, r_w = m-1, n-1\n\n count = 0\n while l_s <= m-1 and l_w <= n-1:\n if s[l_s] == word[l_w]:\n l_w += 1\n count += 1\n l_s += 1\n if l_w > n-1:\n return (count, word)\n else:\n return (0, \"\")\n \n # call helper in dic:\n max_count = 0\n max_word = \"\"\n \n for w in dictionary:\n count, word = check(w)\n if count > max_count:\n max_count = count\n max_word = word\n elif count != 0 and count == max_count:\n max_word = min(max_word, word)\n \n return max_word\n\n\n\n\n \n\n","runtime":"290"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n \n # sort the dictionary by length in lexicographical order\n # dictionary.sort()\n # dictionary.sort(key=len, reverse=True) \n dictionary.sort(key=lambda x: (-len(x),x)) \n print(dictionary)\n\n # check whether dictionary[i] is a substring of s\n for i in dictionary:\n if self.isSubstring(i, s):\n return i\n \n return ''\n\n # check if s1 is a substring of s2\n def isSubstring(self, s1, s2):\n # len(s1) <= len(s2)\n i = 0\n j = 0\n while i < len(s1) and j < len(s2):\n if s1[i] == s2[j]:\n i+=1\n j+=1\n else:\n j+=1\n \n if i == len(s1) and j <= len(s2):\n return True\n else:\n return False","runtime":"294"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n sortedDict = sorted(dictionary, key= lambda x: [-len(x), x])\n for word in sortedDict:\n if self.canForm(s, word):\n return word\n return \"\"\n def canForm(self, s, word):\n wordPointer, sPointer = 0, 0\n while wordPointer < len(word) and sPointer < len(s):\n if word[wordPointer] == s[sPointer]:\n wordPointer += 1\n sPointer += 1\n return wordPointer == len(word)","runtime":"294"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda word: (-len(word), word))\n \n # Iterate over each word in 'd' and check if it's a subsequence of 's'\n for word in dictionary:\n if self.is_subsequence(s, word):\n return word # Return the first (longest) subsequence found\n return \"\" # Return empty string if no subsequence is found\n \n def is_subsequence(self, s, word):\n # Use two pointers to check if 'word' is a subsequence of 's'\n i, j = 0, 0\n while i < len(s) and j < len(word):\n if s[i] == word[j]:\n j += 1\n i += 1\n return j == len(word)","runtime":"297"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n res = ''\n\n for word in dictionary:\n ptr_s = 0\n ptr_d = 0\n while ptr_s < len(s) and ptr_d < len(word):\n if s[ptr_s] == word[ptr_d]:\n ptr_d += 1\n ptr_s += 1\n if ptr_d == len(word) and ((len(res) < len(word)) or (len(res) == len(word) and word < res)):\n res = word\n \n return res\n\n \n \n","runtime":"297"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n def isSubsequence(s, sub):\n\n i = 0\n j = 0\n\n while i < len(s) and j < len(sub):\n\n if s[i] == sub[j]:\n j += 1\n \n i += 1\n \n return j == len(sub)\n \n\n dictionary.sort(key=lambda x: (-len(x), x))\n\n for sub in dictionary:\n\n if isSubsequence(s, sub):\n return sub\n \n return ''\n\n\n ","runtime":"301"},{"code":"from typing import List\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n result = \"\"\n \n for word in dictionary:\n i = j = 0\n while i < len(s) and j < len(word):\n if s[i] == word[j]:\n j += 1\n i += 1\n \n if j == len(word): # word can be formed from s\n if len(word) > len(result) or (len(word) == len(result) and word < result):\n result = word\n \n return result\n\n# Example usage:\nsolution = Solution()\ns = \"abpcplea\"\ndictionary = [\"ale\",\"apple\",\"monkey\",\"plea\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"apple\"","runtime":"301"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n res = ''\n\n for word in dictionary:\n ptr_s = 0\n ptr_d = 0\n while ptr_s < len(s) and ptr_d < len(word):\n if s[ptr_s] == word[ptr_d]:\n ptr_d += 1\n ptr_s += 1\n if ptr_d >= len(word) and len(res) < len(word):\n res = word\n \n return res\n\n \n \n","runtime":"304"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n longest = \"\"\n temp = []\n for w in dictionary:\n j = 0\n i = 0\n while j < len(s) and i < len(w):\n if w[i] == s[j]:\n i += 1\n j += 1\n else:\n j += 1\n if i == len(w):\n # temp.append(w)\n if len(w) > len(longest):\n longest = w\n if len(w) == len(longest):\n for k in range(len(w)):\n if w[k] == longest[k]:\n continue\n if w[k] < longest[k]:\n longest = w\n else:\n break\n # print(temp)\n return longest","runtime":"304"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n maxStr = \"\"\n for d in dictionary:\n i, j = 0, 0\n while i<len(s) and j<len(d):\n if d[j] == s[i]:\n j+=1\n i+=1\n if j==len(d):\n if len(d) == len(maxStr):\n maxStr = sorted([d, maxStr])[0]\n if len(d) > len(maxStr):\n maxStr = d\n return maxStr","runtime":"308"},{"code":"from typing import List\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n result = \"\"\n \n for word in dictionary:\n i = j = 0\n while i < len(s) and j < len(word):\n if s[i] == word[j]:\n j += 1\n i += 1\n \n if j == len(word): # Word can be formed from s\n if len(word) > len(result) or (len(word) == len(result) and word < result):\n result = word\n \n return result\n\n# Example usage:\nsolution = Solution()\ns = \"abpcplea\"\ndictionary = [\"ale\",\"apple\",\"monkey\",\"plea\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"apple\"\n\ns = \"abpcplea\"\ndictionary = [\"a\",\"b\",\"c\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"a\"","runtime":"308"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n def isGood(st):\n i, j = 0, 0\n while i<len(st) and j<len(s):\n if st[i]==s[j]:\n i+=1\n j+=1\n if i ==len(st):\n return True\n return False\n ans = \"\"\n maxLen = 0\n for st in dictionary:\n if isGood(st) and len(st) > maxLen:\n maxLen = len(st)\n ans = st\n return ans\n ","runtime":"311"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n def isGood(st):\n i, j = 0, 0\n while i<len(st) and j<len(s):\n if st[i]==s[j]:\n i+=1\n j+=1\n if i ==len(st):\n return True\n return False\n ans = \"\"\n maxLen = 0\n for st in dictionary:\n if isGood(st) and len(st) > maxLen:\n maxLen = len(st)\n ans = st\n return ans\n ","runtime":"311"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n # Sort the dictionary by descending length and ascending lexicographical order\n dictionary.sort(key=lambda x: (-len(x), x))\n\n # Function to check if a word d is a subsequence of s\n def isSubsequence(s: str, d: str) -> bool:\n i, j = 0, 0\n while i < len(s) and j < len(d):\n if s[i] == d[j]:\n j += 1\n i += 1\n return j == len(d)\n\n # Check each word in sorted dictionary\n for d in dictionary:\n if isSubsequence(s, d):\n return d\n\n return \"\"","runtime":"315"},{"code":"from typing import List\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n result = \"\"\n \n for word in dictionary:\n i = j = 0\n \n # Check if word can be formed by deleting characters from s\n while i < len(s) and j < len(word):\n if s[i] == word[j]:\n j += 1\n i += 1\n \n # If word can be formed\n if j == len(word):\n # Update result if word is longer or of same length but lexicographically smaller\n if len(word) > len(result) or (len(word) == len(result) and word < result):\n result = word\n \n return result\n\n# Example usage:\nsolution = Solution()\ns = \"abpcplea\"\ndictionary = [\"ale\",\"apple\",\"monkey\",\"plea\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"apple\"\n\ns = \"abpcplea\"\ndictionary = [\"a\",\"b\",\"c\"]\nprint(solution.findLongestWord(s, dictionary)) # Output: \"a\"","runtime":"315"},{"code":"class Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n longest_word = ''\n for word in d:\n i , j =0 , 0\n while i < len(word) and j < len(s):\n if word[i] == s[j]:\n i+=1\n j+=1\n else:\n j+=1\n if i == len(word):\n if len(longest_word) < len(word):\n longest_word = word\n elif len(word) == len(longest_word):\n longest_word = min(longest_word , word)\n return longest_word\n\nclass Solution:\n def findLongestWord(self, s: str, d: List[str]) -> str:\n res = ''\n for cand in d:\n if self.find(s, cand) and (len(cand) > len(res) or (len(cand) == len(res) and cand < res)):\n res = cand\n return res\n \n\n def find(self , s ,d):\n i , j = 0 , 0\n while i < len(s) and j < len(d):\n if s[i] == d[j]:\n i+=1\n j+=1\n else:\n i+=1\n return j == len(d)","runtime":"318"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n def isSubsequence(d):\n i, j = 0, 0\n while i<len(s) and j<len(d):\n if d[j] == s[i]:\n j+=1\n i+=1\n return (j == len(d), j)\n\n maxStr = \"\"\n for d in dictionary:\n if isSubsequence(d)[0] and (isSubsequence(d)[1]>len(maxStr) or (isSubsequence(d)[1] == len(maxStr) and d<maxStr)):\n maxStr = d\n return maxStr","runtime":"318"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n smallest = \"\"\n for i in range(len(dictionary)):\n k = 0 \n j = 0\n while j < len(s) and k < len(dictionary[i]):\n if s[j] == dictionary[i][k]:\n k += 1\n j += 1\n if k == len(dictionary[i]):\n if len(smallest) == 0:\n smallest = dictionary[i]\n elif len(dictionary[i]) > len(smallest):\n smallest = dictionary[i]\n elif len(dictionary[i]) == len(smallest):\n smallest = min(smallest, dictionary[i])\n\n return smallest","runtime":"322"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n i = 0\n ans = \"\"\n for word in dictionary:\n j = 0\n i = 0\n while(True):\n if(s[i]==word[j]):\n i+=1\n j+=1\n else:\n i+=1\n if(i==len(s) or j==len(word)):\n break\n if(j==len(word)):\n if(len(ans)<j):\n ans = word\n elif(len(ans)==j):\n if(ans>word): ans = word\n return ans","runtime":"322"},{"code":"class Solution:\n def lessthan(self, wordmap: List[int], smap: List[int]) -> bool:\n for i in range(26):\n if wordmap[i] > smap[i]:\n return False\n return True\n\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\n lens = len(s)\n mymap = {}\n for char in s:\n if char not in mymap:\n mymap[char] = 1\n \n for word in dictionary:\n flag = True\n sleft = 0\n wleft = 0\n while wleft < len(word) and sleft < lens:\n if word[wleft] not in mymap:\n flag = False\n break\n if word[wleft] == s[sleft]:\n sleft += 1\n wleft += 1\n else:\n sleft += 1\n if not flag:\n continue\n if wleft == len(word):\n return word \n return ''\n\n ","runtime":"326"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n smallest = \"\"\n for i in range(len(dictionary)):\n k = 0 \n j = 0\n while j < len(s) and k < len(dictionary[i]):\n if s[j] == dictionary[i][k]:\n k += 1\n j += 1\n if k == len(dictionary[i]):\n if len(smallest) == 0:\n smallest = dictionary[i]\n if len(dictionary[i]) > len(smallest):\n smallest = dictionary[i]\n continue\n elif len(dictionary[i]) == len(smallest):\n smallest = min(smallest, dictionary[i])\n\n return smallest","runtime":"329"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key=lambda x: (-len(x), x))\n def isGood(st):\n i, j = 0, 0\n while i<len(st) and j<len(s):\n if st[i]==s[j]:\n i+=1\n j+=1\n if i ==len(st):\n return True\n return False\n for st in dictionary:\n if isGood(st):\n return st\n return \"\"\n ","runtime":"329"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n i=0\n ans=[]\n while i<len(dictionary):\n k=[x for x in dictionary[i]]\n j=0\n while j<len(s) and len(k)>0:\n if s[j]==k[0]:\n k.pop(0)\n j+=1\n if len(k)==0:\n ans.append(dictionary[i])\n i+=1\n if len(ans)==0:\n return \"\"\n ans.sort()\n l=[]\n for i in ans:\n if not l:\n l.append(i)\n else:\n if len(i)>len(l[-1]):\n l.pop()\n l.append(i)\n return l[0]","runtime":"333"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n max_length = 0\n longest = \"\"\n for word in dictionary:\n if self.isSubString(s, word) and len(word) > max_length:\n max_length = len(word)\n longest = word\n \n return longest\n\n def isSubString(self, s, word):\n i = j = 0\n while i < len(s) and j < len(word):\n if s[i] == word[j]:\n i += 1\n j += 1\n else:\n i += 1\n return True if j == len(word) else False","runtime":"336"},{"code":"class Solution:\n def find(self, s, cand):\n i,j=0,0\n while(i<len(s) and j<len(cand)):\n if(s[i]==cand[j]):\n i+=1\n j+=1\n \n else:\n i+=1\n\n return j==len(cand)\n\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n res=''\n for cand in dictionary:\n if self.find(s,cand) and (len(cand)>len(res) or (len(res)==len(cand) and cand<res)):\n res=cand\n \n return res\n\n ","runtime":"340"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n #Intuition - Two pointer check for each item in dict with s.\n def checkstr(a,b):\n for i in range(len(a)):\n if ord(a[i])<ord(b[i]):\n return a\n elif ord(a[i])>ord(b[i]):\n return b\n return a\n ans=\"\"\n # help(set)\n for d in dictionary:\n l=0\n r=0\n if(set(d).issubset(set(s))):\n while l<len(s) and r<len(d):\n if s[l]==d[r]:\n l+=1\n r+=1\n else:\n l+=1\n # print(d,l,r)\n if r==len(d):\n if len(ans)<len(d):\n ans=d\n elif len(ans)==len(d):\n ans=checkstr(ans,d)\n \n return ans\n\n \n","runtime":"343"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort(key= lambda x:(-len(x), x))\n # ['monkey', 'apple', 'plea', 'ale']\n \n for word in dictionary:\n s_pointer = 0\n w_pointer = 0\n while w_pointer < len(word) and s_pointer < len(s):\n if word[w_pointer] == s[s_pointer]:\n w_pointer += 1\n s_pointer+=1\n if w_pointer == len(word):\n return word\n\n return \"\"","runtime":"347"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n next_index = [[None] * 26 for char in s]\\n last_index = [None] * 26\\n for index in range(len(s) - 1, -1, -1):\\n next_index[index] = last_index.copy()\\n last_index[ord(s[index]) - ord('a')] = index\\n dictionary.sort(key=lambda word: (-len(word), word))\\n for word in dictionary:\\n word_index = 0\\n if len(word) > len(s):\\n continue\\n s_index = 0\\n word_index = 1 if s[0] == word[0] else 0\\n while word_index < len(word):\\n s_index = next_index[s_index][ord(word[word_index]) - ord('a')]\\n if s_index is None:\\n break\\n word_index += 1\\n if word_index == len(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: list[str]) -> str:\\n answer = \\\"\\\"\\n for word in dictionary:\\n if len(word) >= len(answer):\\n if len(answer) == len(word) and sorted([answer,word])[0] == answer:\\n continue\\n else:\\n current = s\\n for letterCount, letter in enumerate(word):\\n if letter not in current:\\n break\\n else:\\n current = current[current.index(letter)+1:]\\n if letterCount == len(word)-1: answer = word; print(word)\\n return answer\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dicts = defaultdict(list)\\n for i, word in enumerate(dictionary):\\n it = iter(word)\\n dicts[next(it)].append((i, it))\\n \\n ans = []\\n for i, char in enumerate(s):\\n curr = dicts[char]\\n dicts[char] = []\\n for index, item in curr:\\n next_it = next(item, None)\\n if not next_it:\\n ans.append(dictionary[index])\\n else:\\n dicts[next_it].append((index, item))\\n ans = sorted(ans, key=lambda x: (-len(x), x))\\n return ans[0] if ans else ''\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n cur = \\\"\\\"\\n for w in dictionary:\\n ind = -1\\n found = True\\n for ch in w:\\n ind = s.find(ch, ind + 1)\\n if ind < 0:\\n found = False\\n break\\n if found:\\n if len(w) > len(cur):\\n cur = w\\n elif len(w) == len(cur):\\n cur = min(w, cur)\\n else:\\n continue\\n return cur\\n \",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n d.sort(key=lambda x:(-len(x), x))\\n\\n def in_word(a, b):\\n h = a.find(b[0])\\n if h == -1:\\n return False\\n if len(b) == 1:\\n return True\\n return in_word(a[h+1:], b[1:])\\n\\n for i in range(len(d)):\\n if len(d[i]) > len(s):\\n continue\\n if len(d[i]) == len(s):\\n if s != d[i]:\\n continue\\n else:\\n return d[i]\\n if in_word(s, d[i]):\\n return d[i]\\n\\n return \\\"\\\"\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n ans = \\\"\\\"\\n \\n # store for each starting letter the potential word. We don't store the word directly, but its index in the dictionary. \\n # In addition we store '0' as pointer to the starting character. We will update the pointer in subsequent steps.\\n wordmap = defaultdict(list)\\n for i, word in enumerate(dictionary):\\n wordmap[word[0]].append((i,0))\\n \\n # Process all characters in s, left-to-right\\n for c in s:\\n candidates = wordmap[c] # select word candidates where the pointer points to the character c\\n wordmap[c] = [] # reset, since we picked them all up in the line before\\n for candidate in candidates: # let's check all candidates that we found in the wordmap\\n word_idx, word_pos = candidate\\n word_pos += 1 # increment pointer to the next character\\n if word_pos == len(dictionary[word_idx]): # we reached the end of the word, now check whether it's a better solution and update ans\\n if word_pos > len(ans) or (word_pos == len(ans) and dictionary[word_idx] < ans):\\n ans = dictionary[word_idx]\\n else: # we did not reach the end of the word and put the word with the character at the updated pointer position back into the wordmap\\n wordmap[dictionary[word_idx][word_pos]].append((word_idx, word_pos))\\n \\n return ans\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n best_word = \\\"\\\"\\n best_len = 0\\n\\n # best efficiency can come if we represent each word as an ordering of letters\\n # eg) aba -> {a:[0,2], b:[1]}\\n # To see if dict word exists in s, we get the earliest representation of the letter.\\n # eg) if ab in aba, we get ab -> 0 for a, then 1 for b\\n # eg) if ab in aba, we get bab -> 1 for b, then 2 for a, then nothing for b bc there's nothing >2\\n\\n # Still O(lmn) time\\n letter_pos = {}\\n for i in range(len(s)):\\n if s[i] not in letter_pos:\\n letter_pos[s[i]] = []\\n letter_pos[s[i]].append(i)\\n\\n def check_letter_pos(word):\\n curr_pos = 0\\n for letter in word:\\n if letter not in letter_pos:\\n return False\\n positions = letter_pos[letter]\\n loc = bisect.bisect_left(positions,curr_pos)\\n if loc >= len(positions):\\n return False\\n curr_pos = positions[loc]+1\\n return True\\n \\n for word in dictionary:\\n if check_letter_pos(word):\\n if best_len < len(word):\\n best_len = len(word)\\n best_word = word\\n elif best_len == len(word):\\n best_word = min(best_word,word)\\n return best_word\\n\\n\\n \\n\\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: list[str]) -> str:\\n answer = \\\"\\\"\\n for word in dictionary:\\n if len(word) >= len(answer):\\n if len(answer) == len(word) and sorted([answer,word])[0] == answer:\\n continue\\n else:\\n current = s\\n for letterCount, letter in enumerate(word):\\n if letter not in current:\\n break\\n else:\\n current = current[current.index(letter)+1:]\\n if letterCount == len(word)-1: answer = word\\n return answer\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n next_characters = defaultdict(list)\\n longest_word = ''\\n for i, word in enumerate(dictionary):\\n next_characters[word[0]].append((i, 0))\\n for c in s:\\n cur_characters = next_characters[c]\\n next_characters[c] = list()\\n for word_index, char_index in cur_characters:\\n char_index += 1\\n if char_index == len(dictionary[word_index]):\\n if len(dictionary[word_index]) > len(longest_word) or (len(dictionary[word_index]) == len(longest_word) and dictionary[word_index] < longest_word):\\n longest_word = dictionary[word_index]\\n continue\\n next_characters[dictionary[word_index][char_index]].append((word_index, char_index))\\n return longest_word\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: list[str]) -> str:\\n answer = \\\"\\\"\\n for word in dictionary:\\n if len(word) >= len(answer):\\n if len(answer) == len(word) and sorted([answer,word])[0] == answer:\\n continue\\n else:\\n current = s\\n for letterCount, letter in enumerate(word):\\n if letter not in current:\\n break\\n else:\\n current = current[current.index(letter)+1:]\\n if letterCount == len(word)-1: answer = word; print(word)\\n return answer\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n letter_map = defaultdict(list)\\n res = \\\"\\\"\\n\\n for i, w in enumerate(dictionary):\\n letter_map[w[0]].append((w, i))\\n \\n for ch in s:\\n if ch not in letter_map:\\n continue\\n \\n words = letter_map[ch]\\n del letter_map[ch]\\n\\n for w, i in words:\\n if len(w) == 1:\\n one = len(dictionary[i])\\n two = len(res)\\n if not res or (one > two) or (one == two and dictionary[i] < res): \\n res = dictionary[i]\\n else:\\n word = w[1:]\\n letter_map[word[0]].append((word, i))\\n \\n return res\\n\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary = sorted(dictionary, key=lambda x:[-len(x), x])\\n for word in dictionary:\\n curr = s\\n valid = True\\n for i in range(len(word)):\\n l = word[i]\\n if l in curr:\\n if i == len(word)-1: break\\n ind = curr.index(l)\\n if ind == len(curr) - 1:\\n if len(curr) > 1:\\n valid = False\\n break \\n curr = curr[ind+1:]\\n else: \\n valid = False\\n break\\n if valid: return word\\n return \\\"\\\"\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # have a dict of chars to set((index, word), (index, word), ...) in the dictionary\\n \\n result = ''\\n \\n search_indices = defaultdict(lambda: set())\\n \\n for i, word in enumerate(dictionary):\\n search_indices[word[0]].add((0, i))\\n \\n for c in s:\\n same_chars = set()\\n while search_indices[c]:\\n index, word_index = search_indices[c].pop()\\n word = dictionary[word_index]\\n if word[index] == c:\\n index += 1\\n if index == len(word):\\n if len(word) > len(result) or (len(word) == len(result) and word < result):\\n result = word\\n elif word[index] == c:\\n same_chars.add((index, word_index))\\n else:\\n search_indices[word[index]].add((index, word_index))\\n else:\\n same_chars.add((index, word_index))\\n search_indices[c] = same_chars\\n \\n return result\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # have a dict of chars to set((index, word), (index, word), ...) in the dictionary\\n \\n result = ''\\n \\n search_indices = defaultdict(lambda: set())\\n \\n for i, word in enumerate(dictionary):\\n search_indices[word[0]].add((0, i))\\n \\n for c in s:\\n same_chars = set()\\n while search_indices[c]:\\n index, word_index = search_indices[c].pop()\\n word = dictionary[word_index]\\n if word[index] == c:\\n index += 1\\n if index == len(word):\\n if len(word) > len(result) or (len(word) == len(result) and word < result):\\n result = word\\n elif word[index] == c:\\n same_chars.add((index, word_index))\\n else:\\n search_indices[word[index]].add((index, word_index))\\n else:\\n same_chars.add((index, word_index))\\n search_indices[c] = same_chars\\n \\n return result\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n app = [[-1]*26 for _ in range(len(s)+1)]\\n for i in range(len(s)-1, 0, -1):\\n for j in range(26):\\n if s[i]!=chr(ord('a')+j):\\n app[i][j] = app[i+1][j]\\n else:\\n app[i][j] = i+1\\n for i, ch in enumerate(s):\\n if app[0][ord(ch)-ord('a')] == -1:\\n app[0][ord(ch)-ord('a')] = i+1\\n print(app)\\n \\n def issubstring(s, word):\\n i = 0\\n for ch in word:\\n if i>len(s):\\n return False\\n idx = app[i][ord(ch)-ord('a')]\\n if idx==-1:\\n return False\\n i = idx\\n return True\\n \\n ans = \\\"\\\"\\n for word in dictionary:\\n if issubstring(s, word):\\n if len(word)>len(ans):\\n ans = word\\n elif len(word) == len(ans):\\n ans = min(ans, word)\\n return ans\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary = sorted(dictionary, key=lambda x:[-len(x), x])\\n for word in dictionary:\\n curr = s\\n valid = True\\n for i in range(len(word)):\\n l = word[i]\\n if l in curr:\\n if i == len(word)-1: break\\n ind = curr.index(l)\\n if ind == len(curr) - 1:\\n if len(curr) > 1:\\n valid = False\\n break \\n curr = curr[ind+1:]\\n else: \\n valid = False\\n break\\n if valid: return word\\n return \\\"\\\"\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n s_dict = {}\\n for i in range(len(s)):\\n if s[i] not in s_dict:\\n s_dict[s[i]] = []\\n s_dict[s[i]].append(i)\\n\\n \\n current_max = \\\"\\\"\\n for w in sorted(dictionary):\\n if len(w) <= len(current_max):\\n continue\\n \\n output = self.helper(s_dict, w)\\n\\n if output:\\n current_max = w\\n \\n return current_max\\n \\n def helper(self, s_dict, word):\\n current_index = -1\\n for j in range(len(word)):\\n if word[j] not in s_dict:\\n return False\\n \\n options = s_dict[word[j]]\\n\\n potential = current_index\\n for x in options:\\n if x > potential:\\n potential = x\\n break\\n if potential == current_index:\\n return False\\n \\n current_index = potential\\n\\n return True\\n\\n \\n \",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x:(-len(x),x))\\n def isSequence(word):\\n it = iter(s)\\n return all(c in it for c in word)\\n for word in dictionary:\\n if isSequence(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def is_subsequence(x: str, y: str) -> bool:\\n # Check if x is a subsequence of y\\n it = iter(y)\\n return all(char in it for char in x)\\n \\n longest_word = \\\"\\\"\\n \\n for word in dictionary:\\n if is_subsequence(word, s):\\n # If the word is a valid subsequence, check if it's the longest or lexicographically smaller\\n if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):\\n longest_word = word\\n \\n return longest_word\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n longest_word = \\\"\\\"\\n\\n for word in dictionary:\\n if self.isSubsequence(word, s):\\n if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):\\n longest_word = word\\n \\n return longest_word\\n \\n def isSubsequence(self, word: str, s: str) -> bool:\\n it = iter(s)\\n return all(char in it for char in word)\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x:(-len(x),x))\\n \\n for word in dictionary:\\n it=iter(s)\\n if all( char in it for char in word):\\n return word\\n return \\\"\\\"\\n\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def is_subsequence(x):\\n it = iter(s)\\n return all(c in it for c in x)\\n \\n dictionary.sort(key=lambda word: (-len(word), word))\\n for word in dictionary:\\n if is_subsequence(word):\\n return word\\n return ''\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s, d):\\n def isSubsequence(x):\\n it = iter(s)\\n return all(c in it for c in x)\\n d.sort(key=lambda x: (-len(x), x))\\n return next(filter(isSubsequence, d), '')\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n longest=\\\"\\\"\\n for word in dictionary:\\n if self.issubsequence(s,word):\\n if len(word)>len(longest) or (len(word)==len(longest) and word< longest):\\n longest=word\\n return longest \\n \\n def issubsequence(self,s,word):\\n it=iter(s)\\n return all(char in it for char in word) \",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n n = len(s)\\n def isSubseq(word):\\n it = iter(s)\\n return all(c in it for c in word)\\n dictionary.sort(key=lambda x:(-len(x),x))\\n for word in dictionary:\\n if isSubseq(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\\"\\\"\\\"\\n for word in sorted(dictionary, key=lambda x: (-len(x), x)):\\n s_iter = iter(s)\\n\\n if all(char in s_iter for char in word):\\n return word\\n \\n return \\\"\\\"\\n \\\"\\\"\\\"\\n\\n longest_word = \\\"\\\"\\n\\n for word in dictionary:\\n s_iter = iter(s)\\n\\n if all(char in s_iter for char in word):\\n if len(word) > len(longest_word) or (len(word) == len(longest_word) and word < longest_word):\\n longest_word = word\\n \\n return longest_word\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n for word in sorted(dictionary, key = lambda w: (-len(w), w)):\\n it = iter(s)\\n if all(c in it for c in word): \\n return word\\n return ''\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def binsearch(self, lst, l, r, x):\\n while (l < r):\\n mid = l + (r - l) // 2\\n if lst[mid] > x:\\n r = mid\\n else:\\n l = mid + 1\\n return l\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key = lambda x: (-len(x), x))\\n\\n dic = {}\\n for i, c in enumerate(s):\\n if c in dic:\\n dic[c].append(i)\\n else:\\n dic[c] = [i]\\n \\n res = \\\"\\\"\\n\\n for s in dictionary:\\n found = True\\n m = -1\\n for c in s:\\n if c in dic:\\n lst = dic[c]\\n else:\\n found = False\\n break\\n\\n idx = self.binsearch(lst, 0, len(lst), m)\\n if idx == len(lst):\\n found =False\\n break\\n m = lst[idx]\\n\\n if found:\\n res = s\\n break\\n \\n return res\\n\\n\\n \\n\\n \\n \\n \\n \",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n letter_positions = defaultdict(list)\\n for i in range(len(s)):\\n letter_positions[s[i]].append(i)\\n\\n for word in sorted(dictionary, key=lambda w: (-len(w), w)):\\n pos = 0\\n isSubsequence = True\\n for c in word:\\n if c not in letter_positions:\\n isSubsequence = False\\n break\\n possible_positions = [p for p in letter_positions[c] if p >= pos]\\n if not possible_positions:\\n isSubsequence = False\\n break\\n pos = possible_positions[0] + 1\\n if isSubsequence:\\n return word \\n return \\\"\\\"\\n\\n \",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def find(self,s,word):\\n idx=0\\n for i in s:\\n if i==word[idx]:\\n if idx+1==len(word):\\n return True\\n idx+=1\\n return False\\n def findLongestWord(self, s: str, words: List[str]) -> str:\\n seen=''\\n for i in words:\\n if self.find(s,i):\\n if len(i)>len(seen):\\n seen=i\\n elif len(i)==len(seen) and i<seen:\\n seen=i\\n return seen\\n\\n\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n letter_positions = defaultdict(list)\\n for i in range(len(s)):\\n letter_positions[s[i]].append(i)\\n \\n def isSubsequence(word, s):\\n pos = 0\\n for c in word:\\n possible_positions = [p for p in letter_positions[c] if p >= pos]\\n if not possible_positions:\\n return False\\n pos = possible_positions[0] + 1\\n return True\\n\\n # def isSubsequence(word, s):\\n # j = 0\\n # for i in range(len(s)):\\n # if j >= len(word):\\n # break\\n # if s[i] == word[j]:\\n # j += 1\\n # return j == len(word)\\n\\n for word in sorted(dictionary, key=lambda w: (-len(w), w)):\\n if isSubsequence(word, s):\\n return word\\n return \\\"\\\"\\n\\n # max_word = \\\"\\\"\\n # for word in dictionary:\\n # if isSubsequence(word, s):\\n # if len(word) > len(max_word) or len(word) == len(max_word) and word < max_word:\\n # max_word = word\\n # return max_word\\n\\n \",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n res = \\\"\\\"\\n for word in dictionary:\\n # compare the two\\n valid = False\\n m = len(word)\\n i = 0\\n for c in s:\\n if c == word[i]:\\n i += 1\\n if i == m:\\n valid = True\\n break\\n if valid:\\n if len(word) > len(res):\\n res = word\\n elif len(word) == len(res) and word < res:\\n res = word\\n return res\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def find(self,s,word):\\n idx=0\\n for i in s:\\n if i==word[idx]:\\n if idx+1==len(word):\\n return True\\n idx+=1\\n return False\\n def findLongestWord(self, s: str, words: List[str]) -> str:\\n seen=''\\n for i in words:\\n if self.find(s,i):\\n if len(i)>len(seen):\\n seen=i\\n elif len(i)==len(seen) and i<seen:\\n seen=i\\n return seen\\n\\n\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key = lambda x: (-len(x), x))\\n\\n for word in dictionary:\\n count = 0\\n for ch in s:\\n if ch == word[count]:\\n count += 1\\n if count == len(word):\\n break\\n if count == len(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n ans=''\\n for x in dictionary:\\n i=0\\n for c in s:\\n if c==x[i]:\\n i+=1\\n if i==len(x):\\n if ans=='' or len(x)>len(ans) or (len(x)==len(ans) and x<ans):\\n ans=x\\n break\\n return ans\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n words = sorted(dictionary, key=lambda word: (-len(word), word))\\n for word in words:\\n n = len(word)\\n i = 0 \\n for c in s:\\n if c == word[i]:\\n i += 1\\n if i == n:\\n return word\\n return ''\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, words: List[str]) -> str:\\n seen = ''\\n for i in words:\\n if self.find(s, i):\\n if len(i) > len(seen):\\n seen = i\\n elif len(i) == len(seen) and i < seen:\\n seen = i\\n return seen\\n \\n def find(self, s, w):\\n ind = 0\\n for i in s:\\n if i == w[ind]:\\n if ind + 1 == len(w):\\n return True\\n ind += 1\\n return False\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n # find common string between strings in dictionary and s.\\n dictionary.sort(key = lambda x: (-len(x), x))\\n\\n def isSub(s, t):\\n if len(s) > len(t):\\n return False\\n s_idx = 0\\n s_n = len(s)\\n for char in t:\\n if s_idx < s_n and s[s_idx] == char:\\n s_idx += 1\\n return s_idx == s_n\\n\\n for w in dictionary:\\n if isSub(w, s):\\n return w\\n return \\\"\\\"\\n\\n\\n\\n # idea: sort d and search each word in d\\n #d.sort(key = lambda x: (-len(x), x)) \\n #for word in d:\\n # if self.isSubSequence(s, word):\\n # return word\\n #return ''\\n\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def isPossible(self, s1, s2):\\n j = 0\\n for char in s1:\\n if s2[j] == char:\\n j += 1\\n if j == len(s2):\\n return True\\n return False\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n for word in dictionary:\\n if self.isPossible(s, word):\\n return word\\n return ''\\n\\n \",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n letter_positions = defaultdict(list)\\n for i in range(len(s)):\\n letter_positions[s[i]].append(i)\\n \\n def isSubsequence(word, s):\\n pos = 0\\n for c in word:\\n possible_positions = [p for p in letter_positions[c] if p >= pos]\\n if not possible_positions:\\n return False\\n pos = possible_positions[0] + 1\\n return True\\n\\n # def isSubsequence(word, s):\\n # j = 0\\n # for i in range(len(s)):\\n # if j >= len(word):\\n # break\\n # if s[i] == word[j]:\\n # j += 1\\n # return j == len(word)\\n\\n # for word in sorted(dictionary, key=lambda w: (-len(w), w)):\\n # if isSubsequence(word, s):\\n # return word\\n # return \\\"\\\"\\n\\n max_word = \\\"\\\"\\n for word in dictionary:\\n if isSubsequence(word, s):\\n if len(word) > len(max_word) or len(word) == len(max_word) and word < max_word:\\n max_word = word\\n return max_word\\n\\n \",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def find(self,s,word):\\n idx=0\\n for i in s:\\n if i==word[idx]:\\n if idx+1==len(word):\\n return True\\n idx+=1\\n return False\\n def findLongestWord(self, s: str, words: List[str]) -> str:\\n seen=''\\n for i in words:\\n if self.find(s,i):\\n if len(i)>len(seen):\\n seen=i\\n elif len(i)==len(seen) and i<seen:\\n seen=i\\n return seen\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n res = ''\\n length = 0\\n\\n for word in dictionary:\\n if self.check(s, word) and length <= len(word):\\n if length < len(word):\\n res = word\\n length = len(word)\\n elif res > word:\\n res = word\\n return res\\n\\n\\n\\n def check(self, s, subseq):\\n i = 0\\n n = len(subseq)\\n\\n if len(s) < n:\\n return False\\n\\n for c in s:\\n if c == subseq[i]:\\n i += 1\\n if i == n:\\n return True\\n \\n return i == n\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n ret = ''\\n\\n for i in dictionary:\\n flag = False\\n k = 0\\n\\n for j in s:\\n if j == i[k]:\\n k+=1\\n if k==len(i):\\n flag = True\\n break\\n\\n if flag: \\n if len(i)>len(ret) or (len(i)==len(ret) and i<ret):\\n ret = i\\n \\n\\n return ret\\n \\n \",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, words: List[str]) -> str:\\n res=\\\"\\\"\\n m=len(s)\\n for word in words:\\n n=len(word)\\n if n>m or n<len(res):\\n continue\\n i=0\\n for char in s:\\n if char==word[i]:\\n i+=1\\n if i==n:\\n if n>len(res):\\n res=word\\n else:\\n res=min(res,word)\\n break\\n return res\\n \",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n def is_subseq(main: str, sub: str) -> bool:\\n i, j, m, n = 0, 0, len(main), len(sub)\\n while i < m and j < n and n - j >= m - i:\\n if main[i] == sub[j]:\\n i += 1\\n j += 1\\n return i == m\\n \\n res = ''\\n helper = sorted(d, key = lambda x: len(x), reverse = True)\\n for word in helper:\\n if len(word) < len(res): return res\\n if ( not res or word < res ) and is_subseq(word, s):\\n res = word\\n return res\",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n longest = ''\\n for word in dictionary:\\n if len(word) < len(longest):\\n continue\\n if not self.canForm(s, word):\\n continue\\n if (len(word) > len(longest) or \\n (len(word) == len(longest) and word < longest)\\n ):\\n longest = word\\n \\n return longest\\n\\n def canForm(self, s: str, word: str) -> bool: \\n sindex = 0\\n slen = len(s)\\n\\n for c in word:\\n while sindex < slen and s[sindex] != c:\\n sindex += 1\\n if sindex >= slen:\\n return False\\n sindex += 1\\n \\n return True\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n def is_subseq(main: str, sub: str) -> bool:\\n i, j, m, n = 0, 0, len(main), len(sub)\\n while i < m and j < n and n - j >= m - i:\\n if main[i] == sub[j]:\\n i += 1\\n j += 1\\n return i == m\\n \\n res = ''\\n helper = sorted(d, key = lambda x: len(x), reverse = True)\\n for word in helper:\\n if len(word) < len(res): return res\\n if ( not res or word < res ) and is_subseq(word, s):\\n res = word\\n return res\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n d.sort(key=lambda x : (-len(x),x))\\n\\n for word in d:\\n i = 0\\n for c in s:\\n if i < len(word) and c == word[i]:\\n i += 1\\n \\n if i == len(word):\\n return word\\n return ''\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n def is_subseq(main: str, sub: str) -> bool:\\n i, j, m, n = 0, 0, len(main), len(sub)\\n while i < m and j < n and n - j >= m - i:\\n if main[i] == sub[j]:\\n i += 1\\n j += 1\\n return i == m\\n \\n res = ''\\n helper = sorted(d, key = lambda x: len(x), reverse = True)\\n for word in helper:\\n if len(word) < len(res): return res\\n if ( not res or word < res ) and is_subseq(word, s):\\n res = word\\n return res\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n maxString = \\\"\\\"\\n for word in dictionary:\\n wordLength = len(word)\\n i = 0\\n for char in s:\\n if word[i] == char:\\n i += 1\\n if i == wordLength:\\n break\\n if i == wordLength:\\n if wordLength > len(maxString):\\n maxString = word\\n elif wordLength == len(maxString) and word < maxString:\\n maxString = word\\n return maxString\\n\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def is_valid(string): # can we get the string by deleting some letters or not\\n i = 0\\n for letter in s:\\n if letter == string[i]:\\n i += 1\\n if i == len(string):\\n return True\\n return i == len(string)\\n\\n dictionary.sort() # sorting alphabetically\\n dictionary.sort(key=len, reverse=True) # sorting by the length; as a result - sorting both alphabetically and by length\\n for word in dictionary:\\n if is_valid(word):\\n return word\\n return ''\\n\\n\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n def is_subseq(main: str, sub: str) -> bool:\\n i, j, m, n = 0, 0, len(main), len(sub)\\n while i < m and j < n and n - j >= m - i:\\n if main[i] == sub[j]:\\n i += 1\\n j += 1\\n return i == m\\n \\n res = ''\\n helper = sorted(d, key = lambda x: len(x), reverse = True)\\n for word in helper:\\n if len(word) < len(res): return res\\n if ( not res or word < res ) and is_subseq(word, s):\\n res = word\\n return res\",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n \\n dictionary.sort(key=lambda item: (-len(item), item))\\n for word in dictionary:\\n i = 0\\n for c in s:\\n\\n if word[i] == c:\\n i+=1\\n \\n if i == len(word):\\n return word\\n return \\\"\\\"\\n \\n\\n \",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n\\n def check(self, word: str, s: str) -> bool:\\n ptr = 0\\n n = len(s)\\n for letter in word:\\n \\n while ptr<n and s[ptr] != letter:\\n ptr+=1\\n \\n \\n if ptr==n:\\n return False\\n \\n ptr += 1\\n\\n return True\\n\\n\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n \\n dictionary.sort(key=lambda word: (-len(word), word), reverse = True)\\n\\n output = \\\"\\\"\\n for word in dictionary:\\n if self.check(word, s):\\n output = word\\n \\n return output\\n\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n res = ''\\n for word in dictionary:\\n pointer = 0\\n for i in s:\\n if pointer < len(word):\\n if i == word[pointer]:\\n pointer += 1\\n if pointer == len(word):\\n print(word, 'is in s')\\n if len(res) < len(word):\\n res = word\\n elif len(res) == len(word):\\n res = min([res,word])\\n return res \",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def isSub(w):\\n p = 0\\n for a in s:\\n if p==len(w):\\n return True\\n if w[p]==a:\\n p+=1\\n return p==len(w)\\n dictionary.sort(key=lambda x: (-len(x), x))\\n for w in dictionary:\\n if isSub(w):\\n return w\\n return ''\",\n \"runtime\": \"184\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # sort first and the check each if we should reject\\n dictionary.sort(key = lambda x: (-len(x), x))\\n for word in dictionary:\\n i = 0\\n for ch in s:\\n if i < len(word) and word[i] == ch:\\n i += 1\\n if i == len(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"184\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n \\n for word in dictionary:\\n i = 0\\n for c in s:\\n if i < len(word) and c == word[i]:\\n i += 1\\n if i == len(word):\\n break\\n if i == len(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n\\n for word in dictionary:\\n count = 0\\n\\n for c in s:\\n if count < len(word) and c == word[count]:\\n count += 1\\n\\n if count == len(word):\\n return word\\n\\n return \\\"\\\"\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n print(dictionary)\\n for word in dictionary:\\n j = 0\\n for x in s:\\n if j < len(word) and x == word[j]:\\n j += 1\\n if j == len(word):\\n return word\\n return ''\\n \\n \",\n \"runtime\": \"191\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: list[str]) -> str:\\n\\n def can_form(word):\\n i = 0\\n for char in s:\\n if i < len(word) and char == word[i]:\\n i += 1\\n return i == len(word)\\n\\n longest = \\\"\\\"\\n for word in d:\\n if can_form(word) and (not longest or len(word) > len(longest) or (len(word) == len(longest) and word < longest)):\\n longest = word\\n return longest\",\n \"runtime\": \"191\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key = lambda x: (-len(x), x))\\n\\n for word in dictionary:\\n count = 0\\n for ch in s:\\n if count < len(word) and ch == word[count]:\\n count += 1\\n if count == len(word):\\n break\\n if count == len(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"195\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n for word in dictionary:\\n j = 0\\n for x in s:\\n if j < len(word) and x == word[j]:\\n j += 1\\n if j == len(word):\\n return word\\n return ''\",\n \"runtime\": \"195\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # sort first and the check each if we should reject\\n dictionary.sort(key = lambda x: (-len(x), x))\\n for word in dictionary:\\n i = 0\\n for ch in s:\\n if i < len(word) and word[i] == ch:\\n i += 1\\n if i == len(word):\\n return word\\n return \\\"\\\"\\n\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"'''\\nLongest word: We want to find the longest word which exists in the dictionary, which can be formed as a subtring or s\\nStart by building a trie on dictionary\\n\\nThen we do a dfs on s: \\nFor each letter in s:\\nif letter is in the current next of the tree, we traverse the tree to that position and recurse from there. \\nIf letter is not in the current next of the tree, we skip the letter and go to the next one.\\n\\nWe should be able to improve this search by caching some results \\n\\nFor example, if s = 'cplea' and we are at a node, we can store the longest word from that node. \\n\\n'''\\n\\nclass Solution:\\n def isSubstring(self, word, s):\\n left = 0\\n right = len(s) - 1\\n remaining = len(word)\\n wordLeft = 0\\n wordRight = len(word) - 1\\n while left <= right:\\n if s[left] == word[wordLeft]:\\n remaining -= 1\\n wordLeft += 1\\n if s[right] == word[wordRight]:\\n remaining -= 1\\n wordRight -= 1\\n left += 1\\n right -= 1\\n if remaining <= 0:\\n return True\\n #print(remaining)\\n return remaining <= 0\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n longest = \\\"\\\"\\n for word in dictionary:\\n #print(word)\\n if self.isSubstring(word, s) and (len(word) > len(longest) or (len(word) == len(longest) and word < longest)):\\n #print(\\\"Longest was\\\", longest, \\\"Now is\\\", word)\\n longest = word\\n return longest \",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n n = len(s)\\n ans_len = -1\\n\\n def consist(s1,s):\\n i = 0\\n m = len(s1)\\n j = 0\\n for i in range(m):\\n while j<n:\\n if s[j]==s1[i]: break\\n j = j + 1\\n if j==n: return False\\n j = j+1\\n return True\\n\\n # print(consist(dictionary[0],s))\\n\\n \\n for s1 in dictionary:\\n if consist(s1,s):\\n if len(s1)>ans_len:\\n ans_len=len(s1)\\n ans = s1\\n elif len(s1)==ans_len:\\n if ans>s1:\\n ans = s1\\n if ans_len>-1: return ans\\n else: return \\\"\\\"\\n\\n \",\n \"runtime\": \"202\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n dictionary.sort(key=lambda s: (-len(s), s))\\n\\n for word in dictionary:\\n\\n wordIdx = 0\\n for letter in s:\\n if word[wordIdx] == letter:\\n wordIdx += 1\\n\\n if wordIdx == len(word):\\n break\\n \\n if wordIdx == len(word):\\n return word\\n\\n return ''\\n \\n\",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def formable(s, word):\\n s = list(s)\\n word = list(word)\\n p1 = 0\\n p2 = 0\\n n = len(s)\\n m = len(word)\\n while(p2 < m):\\n if p1 == n:\\n return False\\n if s[p1] == word[p2]:\\n p2+=1\\n p1+=1\\n \\n return True\\n \\n \\n dictionary.sort(key = lambda x:(-len(x),x))\\n\\n for word in dictionary:\\n if formable(s,word):\\n return word\\n return \\\"\\\"\\n\",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def check(a, b):\\n m, n = len(a), len(b)\\n i = j = 0\\n while i < m and j < n:\\n if a[i] == b[j]:\\n j += 1\\n i += 1\\n return j == n\\n\\n ans = ''\\n for a in dictionary:\\n if check(s, a) and (len(ans) < len(a) or (len(ans) == len(a) and ans > a)):\\n ans = a\\n return ans\\n \",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n n = len(s)\\n ret = \\\"\\\"\\n for w in dictionary:\\n nw = len(w)\\n if (nw > n) or (nw < len(ret)) or ((nw == len(ret)) and (w > ret)):\\n continue\\n i,j = 0,0\\n while i < n and j < nw:\\n if s[i] == w[j] :\\n i += 1\\n j += 1\\n else:\\n i += 1\\n if j >= nw:\\n if (ret == \\\"\\\") or (nw > len(ret)):\\n ret = w\\n elif nw == len(ret) and w < ret:\\n ret = w\\n return ret\\n\\n \\n\",\n \"runtime\": \"209\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def check(s: str, t: str) -> bool:\\n m, n = len(s), len(t)\\n i = j = 0\\n while i < m and j < n:\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n return i == m\\n\\n ans = \\\"\\\"\\n for t in dictionary:\\n if check(t, s) and (len(ans) < len(t) or (len(ans) == len(t) and ans > t)):\\n ans = t\\n return ans\",\n \"runtime\": \"212\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def isSubsequence(x, y):\\n j = 0\\n for i in range(len(y)):\\n if j < len(x) and x[j] == y[i]:\\n j += 1\\n return j == len(x)\\n \\n dictionary.sort(key=lambda x: (-len(x), x))\\n \\n for word in dictionary:\\n if isSubsequence(word, s):\\n return word\\n \\n return \\\"\\\"\\n\\n# Example usage:\\nsolution = Solution()\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"ale\\\",\\\"apple\\\",\\\"monkey\\\",\\\"plea\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"apple\\\"\",\n \"runtime\": \"212\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n d = defaultdict(list)\\n for i in range(len(s)): d[s[i]].append(i) # 字母：所有位置\\n size = {i: len(d[i]) for i in d} # 字母：總數量\\n dictionary.sort()\\n ans, l = '', 0 # 目前答案，目前答案長度\\n for key in dictionary: # 檢查每個 key\\n c = defaultdict(int) # 字母：使用數量\\n p, flag = 0, 1 # 目前在 key 的起始位置， flag=0 時即不符合 ans 條件\\n for letter in key: # 檢查 key 的每個字母\\n if letter in d: # 如果此字母 in d\\n if c[letter] == size[letter]: # 如果目前使用字母數量已達到限制\\n flag = 0\\n break\\n while p > d[letter][c[letter]]: # 如果目前位置 > s 裡此字母位置(s 此字母位置需大於等於目前位置才能夠使用)\\n c[letter] += 1 # s 裡此字母位置+1\\n if c[letter] == size[letter]: # 如果目前使用字母數量達到限制\\n flag = 0\\n break\\n if flag == 0: break\\n p = d[letter][c[letter]] # 更新目前位置\\n c[letter] += 1 # 更新此字母使用數量\\n else:\\n flag = 0\\n break\\n if flag and len(key) > l: # 若 flag 且 長度超過目前答案長度，更新\\n l = len(key)\\n ans = key\\n return ans\\n\",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x:(-len(x),x))\\n \\n\\n def helper(sub,who):\\n n,m=len(sub),len(who)\\n i,j=0,0\\n while j<m and i<n:\\n if sub[i]==who[j]:\\n i+=1\\n j+=1\\n return i==n\\n\\n op=''\\n for w in dictionary:\\n if helper(w,s):\\n return w\\n return op\\n \",\n \"runtime\": \"216\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n\\n arr=[]\\n n=len(s)\\n\\n for i in dictionary:\\n\\n p1=0\\n p2=0\\n m=len(i)\\n\\n while p1<m and p2<n:\\n\\n\\n if i[p1]==s[p2]:\\n p1+=1\\n p2+=1\\n \\n else:\\n p2+=1\\n \\n if p1==m:\\n arr.append(i)\\n\\n if arr==[]:\\n return \\\"\\\"\\n\\n arr=sorted(arr, key=lambda x: len(x))\\n h=len(arr[-1])\\n\\n arr=list(filter(lambda x: True if len(x)==h else False, arr))\\n\\n print(arr)\\n\\n return min(arr)\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n \\\"\\\"\\\"\\n # NOTE: sorting doesn't quite work because the string might be messed up\\n abpcplea -> aabcelpp\\n\\n What about checking every word in the dictionary character by character, starting from the longest string possible\\n [\\\"ale\\\", \\\"plea\\\", \\\"apple\\\",\\\"monkey\\\"]\\n\\n \\\"monkey\\\" -> not found anywhere in abpcplea move to the next word\\n \\\"apple\\\" -> \\\"abpcplea\\\"\\n\\n let pointer 1 and pointer 2 point to the start at both words\\n increment pointer 2 by 1 while the character isn't matching with pointer 1\\n continue until the end of the word and reset both pointers\\n if it is, that's sor answer\\n\\n p1 = 2\\n app\\n\\n p2 = 4\\n a [b] p [c] p\\n \\\"\\\"\\\"\\n # sort the dictionary in reversed order\\n # there might be instances where dictionary has repeated words\\n # this is to scan the largest letter first\\n dictionary = sorted(set(dictionary), key=lambda x: (-len(x), x))\\n\\n # iterate through each word of the dictionary,\\n # initiate two poitners, one to the character of each letter in the word and perform the above\\n for word in dictionary:\\n\\n p2 = 0\\n new_s = \\\"\\\"\\n\\n # here we want to scan through each letter of the word\\n # if this entire for loop complete without issue, this is the answer\\n for p, c in enumerate(word):\\n\\n if p2 == len(s): break\\n # while we can add p2\\n\\n while p2 < len(s):\\n if s[p2] == c:\\n if word == 'apple': print(s[p2])\\n new_s += s[p2]\\n p2 += 1\\n break\\n p2 += 1\\n if word == new_s:\\n return word\\n\\n \\n return \\\"\\\"\\n\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n ht = {}\\n s_length = len(s)\\n res = ''\\n res_length = 0\\n for string in dictionary:\\n p1, p2 = 0, 0\\n string_length = len(string)\\n while p1 < s_length and p2 < string_length:\\n if (s[p1] == string[p2]):\\n p1 += 1\\n p2 += 1\\n continue\\n p1 += 1 #increase the string being compared against\\n\\n if (p2 == string_length):\\n\\n if string_length > res_length:\\n res = string\\n res_length = string_length\\n if (string_length == res_length):\\n res = string if string < res else res\\n\\n return res\\n\\n\\n \",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class TrieNode:\\n\\n def __init__(self):\\n self.children = defaultdict(TrieNode)\\n self.end = False\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n\\n for word in dictionary:\\n if len(word) > len(s):\\n continue\\n cur = 0\\n for i in range(len(s)):\\n if s[i] == word[cur]:\\n cur += 1\\n if cur == len(word):\\n return word\\n\\n return \\\"\\\"\\n\",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n n = len(s)\\n def isSubseq(word):\\n longWord, shortWord = 0, 0\\n nShort = len(word)\\n while longWord < n and shortWord < nShort:\\n if s[longWord] == word[shortWord]:\\n shortWord += 1\\n longWord += 1\\n return shortWord == nShort\\n dictionary.sort(key=lambda x:(-len(x),x))\\n for word in dictionary:\\n if isSubseq(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"226\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(reverse=True)\\n len_found = -1\\n string_found = ''\\n s_len = len(s)\\n for word in dictionary:\\n i = 0\\n j = 0\\n word_len = len(word)\\n while i < s_len and j < word_len:\\n if word[j] == s[i]:\\n j += 1\\n i += 1\\n else:\\n i += 1\\n if j == word_len:\\n if word_len >= len_found:\\n string_found = word\\n len_found = word_len\\n return string_found\\n \\n\",\n \"runtime\": \"226\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # a is sub of b\\n def isSubsequence(a, b):\\n j = 0\\n for i in range(len(b)):\\n if j < len(a) and b[i] == a[j]:\\n j += 1\\n if j == len(a):\\n return True\\n return j == len(a)\\n \\n dictionary.sort(key=lambda x:(-len(x), x))\\n for word in dictionary:\\n if isSubsequence(word, s):\\n return word\\n return ''\\n\\n\\n \\n \",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda word: (-len(word),word))\\n for word in dictionary:\\n if self.compare(s,word):\\n return word\\n return \\\"\\\"\\n\\n def compare(self,s,word):\\n idx = 0\\n for i in range(len(s)):\\n if idx < len(word) and s[i] == word[idx]:\\n idx += 1\\n if idx == len(word):\\n return True\\n return False\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def isSubsequence(x, y):\\n j = 0\\n for i in range(len(y)):\\n if j < len(x) and x[j] == y[i]:\\n j += 1\\n return j == len(x)\\n \\n dictionary.sort(key=lambda x: (-len(x), x))\\n for word in dictionary:\\n if isSubsequence(word, s):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n def canMatch(w):\\n cPointer = 0\\n for c in s:\\n if cPointer >= len(w):\\n break\\n\\n if c == w[cPointer]:\\n cPointer += 1\\n\\n if cPointer == len(w):\\n return w\\n\\n def lexicographicallySmaller(w1, w2):\\n for i in range(len(w1)):\\n if w1[i] < w2[i]:\\n return True\\n elif w1[i] > w2[i]:\\n return False\\n return False\\n\\n res = \\\"\\\"\\n\\n for w in dictionary:\\n if canMatch(w):\\n if len(w) > len(res):\\n res = w\\n elif len(w) == len(res) and lexicographicallySmaller(w, res):\\n res = w\\n \\n return res\\n \\n\",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n for word in dictionary:\\n i = 0\\n for char in s:\\n if i < len(word) and char == word[i]:\\n i += 1\\n if i == len(word):\\n return word\\n return \\\"\\\"\",\n \"runtime\": \"237\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key= lambda x : (-1*len(x),x))\\n print(dictionary)\\n for i in range(len(dictionary)):\\n word = dictionary[i]\\n\\n l = 0\\n for letter in s:\\n if l < len(word) and word[l] == letter:\\n l += 1\\n \\n if l == len(word):\\n return word\\n return \\\"\\\"\\n \",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def check_subarr(s, word):\\n i = 0\\n j = 0\\n while i < len(word):\\n while j < len(s) and s[j] != word[i]:\\n j += 1\\n if j == len(s):\\n return False\\n j += 1\\n i += 1\\n return True\\n\\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n for word in dictionary:\\n if check_subarr(s, word):\\n return word\\n return \\\"\\\"\\n\\n \",\n \"runtime\": \"244\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def check_subarr(s, word):\\n i = 0\\n j = 0\\n while i < len(word):\\n while j < len(s) and s[j] != word[i]:\\n j += 1\\n if j == len(s):\\n return False\\n j += 1\\n i += 1\\n return True\\n #dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n\\n best_word = \\\"\\\"\\n best_len = 0\\n for word in dictionary:\\n if (len(word) > best_len or len(word) == best_len and word < best_word) and check_subarr(s, word):\\n #print(word)\\n best_len = len(word)\\n best_word = word\\n return best_word\\n\\n \",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n d = sorted(d, key=lambda x: (-len(x), x), reverse=False)\\n count = len(d)\\n print(d)\\n while count>0:\\n for i in range(len(d)):\\n idx=0\\n for j in range(len(s)):\\n if d[i][idx]==s[j]:\\n idx+=1\\n if idx==len(d[i]):\\n return d[i]\\n count-=1\\n return \\\"\\\"\\n\",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n longest_word = \\\"\\\"\\n for word in dictionary:\\n word_index = 0\\n for char in s:\\n if word_index < len(word) and char == word[word_index]:\\n word_index += 1\\n if word_index == len(word):\\n break\\n if word_index == len(word):\\n if len(longest_word) < len(word) or (len(longest_word) == len(word) and word < longest_word):\\n longest_word = word\\n return longest_word\",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n n = len(s)\\n r = \\\"\\\"\\n for x in dictionary:\\n i, j = 0, 0\\n while i < len(x) and j < n:\\n if x[i] == s[j]:\\n i += 1\\n j += 1\\n if i == len(x):\\n if r == \\\"\\\" or len(x) > len(r):\\n r = x\\n elif len(r) > 1 and len(r) == len(x) and x < r:\\n r = x\\n return r\\n \\n\",\n \"runtime\": \"255\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n dictionary.sort(reverse=True, key=len)\\n for word in dictionary:\\n first = 0\\n last = 0\\n while first < len(s):\\n if s[first] == word[last]:\\n last += 1\\n if last == len(word):\\n return word\\n first += 1\\n continue\\n first += 1\\n return '' \",\n \"runtime\": \"255\"\n },\n {\n \"code\": \"from collections import Counter, defaultdict\\n\\nclass Solution:\\n def can_form(self, s, w):\\n i = 0\\n j = 0\\n while j < len(s) and i < len(w):\\n while j < len(s) and s[j] != w[i]:\\n j += 1\\n while j < len(s) and i < len(w) and s[j] == w[i]:\\n j += 1\\n i += 1\\n \\n if i == len(w):\\n break\\n return i == len(w)\\n\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n\\n for w in dictionary:\\n to_add = self.can_form(s, w)\\n if to_add:\\n return w\\n return \\\"\\\"\\n\\n \",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n possible_results = []\\n\\n for word in dictionary:\\n i = 0\\n j = 0\\n\\n curr_word_len = len(word)\\n s_len = len(s)\\n found = True\\n for i in range(curr_word_len):\\n while(j < s_len):\\n if s[j] == word[i]:\\n break\\n else:\\n j += 1\\n if j < s_len:\\n j += 1\\n else:\\n found = False\\n break\\n if found:\\n if len(possible_results) > 0:\\n if len(possible_results[0]) < curr_word_len:\\n possible_results = [word]\\n elif len(possible_results[0]) == curr_word_len:\\n possible_results.append(word)\\n else:\\n possible_results = [word]\\n\\n if len(possible_results) == 0:\\n return \\\"\\\"\\n else:\\n return sorted(possible_results)[0]\\n\",\n \"runtime\": \"258\"\n },\n {\n \"code\": \"class Solution:\\n def contains(self, s, word):\\n i_s = 0\\n i_word = 0\\n while ((i_s < len(s)) and (i_word < len(word))):\\n while ((i_s < len(s)) and (s[i_s] != word[i_word])):\\n i_s += 1\\n if (i_s >= len(s)):\\n break\\n i_s += 1\\n i_word += 1\\n return (i_word >= len(word))\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n for word in dictionary:\\n if self.contains(s, word):\\n return word\\n return \\\"\\\"\\n\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"def is_substring(s: str, w: str) -> bool:\\n i, j = 0, 0\\n\\n while i < len(s) and j < len(w):\\n while i < len(s) and s[i] != w[j]:\\n i += 1\\n if i == len(s):\\n break\\n i += 1\\n j += 1\\n return j == len(w)\\n\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dic = sorted(dictionary, key=lambda x: (-len(x), x))\\n for w in dic:\\n if is_substring(s, w):\\n return w\\n return \\\"\\\"\\n\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n maxString = \\\"\\\"\\n for word in dictionary:\\n wordLength = len(word)\\n i, j = 0, 0\\n while i < wordLength and j < len(s):\\n if word[i] == s[j]:\\n i += 1\\n j += 1\\n if i == wordLength:\\n if wordLength > len(maxString):\\n maxString = word\\n elif wordLength == len(maxString):\\n maxString = min(maxString, word)\\n return maxString\\n\",\n \"runtime\": \"265\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n \\n for word in dictionary:\\n slow = 0\\n for fast in range(len(s)):\\n if s[fast] == word[slow]:\\n slow += 1\\n \\n if slow == len(word):\\n return word\\n fast += 1\\n return \\\"\\\"\\n\",\n \"runtime\": \"265\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n output = ['']\\n\\n for word in dictionary:\\n i , j = 0 , 0\\n while i < len(s):\\n if s[i] == word[j]:\\n if j == len(word) - 1:\\n if len(word) > len(output[-1]):\\n output = [word] \\n elif len(word) == len(output[-1]):\\n output.append(word)\\n break\\n i += 1\\n j += 1\\n else:\\n i += 1\\n print(output)\\n output.sort()\\n print(output)\\n return output[0]\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n n = [len(s)]\\n def contains(w):\\n m = len(w)\\n l = r = 0\\n while l<n[0] and r<m:\\n r += s[l]==w[r]\\n l += 1\\n return r==m\\n longest, ans = 0, ''\\n for w in dictionary:\\n m = len(w)\\n if contains(w) and (m>longest or (m==longest and w<ans)):\\n longest = m\\n ans = w\\n return ans\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"from collections import Counter, defaultdict\\n\\nclass Solution:\\n def can_form(self, s, w):\\n i = 0\\n j = 0\\n while j < len(s) and i < len(w):\\n while j < len(s) and s[j] != w[i]:\\n j += 1\\n while j < len(s) and i < len(w) and s[j] == w[i]:\\n j += 1\\n i += 1\\n return i == len(w)\\n\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n selection = []\\n to_skip = 0\\n for w in dictionary:\\n if len(w) < to_skip:\\n continue\\n to_add = self.can_form(s, w)\\n if not to_add:\\n continue\\n\\n if not selection:\\n selection.append(w)\\n to_skip = len(w)\\n else:\\n if len(w) > to_skip:\\n selection = [w]\\n to_skip = len(w)\\n else:\\n selection.append(w)\\n if not selection:\\n return \\\"\\\"\\n else:\\n return sorted(selection)[0]\\n\\n \",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n indices = [0] * len(dictionary)\\n for c in s:\\n for i, w in enumerate(dictionary):\\n if indices[i] < len(w) and c == w[indices[i]]:\\n indices[i] += 1\\n best = 0\\n for i, w in zip(indices, dictionary):\\n if i == len(w):\\n best = max(best, i)\\n result = None\\n for i, w in zip(indices, dictionary):\\n if i == len(w) and i == best:\\n if result is None:\\n result = w\\n else:\\n result = min(result, w)\\n return result or \\\"\\\"\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def contains(self, s, word):\\n print(s)\\n print(word)\\n i_s = 0\\n i_word = 0\\n while ((i_s < len(s)) and (i_word < len(word))):\\n while ((i_s < len(s)) and (s[i_s] != word[i_word])):\\n i_s += 1\\n if (i_s >= len(s)):\\n break\\n # print(i_s, i_word)\\n # print(s[i_s], word[i_word])\\n i_s += 1\\n i_word += 1\\n # print(i_word)\\n return (i_word >= len(word))\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n # print(dictionary[0])\\n # print(dictionary[1])\\n # word = \\\"ettphsiunoglotjlccurlre\\\"\\n # print(self.contains(s, word))\\n\\n for word in dictionary:\\n print(word)\\n if self.contains(s, word):\\n return word\\n return \\\"\\\"\\n\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"def isSubsequence(s, t):\\n s = list(s)\\n t = list(t)\\n ind = 0\\n while t and s and ind<len(t):\\n if s[0]==t[ind]:\\n s.pop(0)\\n ind+=1\\n \\n if len(s)==0:\\n return True\\n return False\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dic = {}\\n maxi = 0\\n res = []\\n for el in dictionary:\\n if isSubsequence(el,s):\\n print(el, s)\\n if maxi<=len(el):\\n res.append((el, len(el)))\\n maxi = len(el)\\n\\n res = list(filter(lambda x: x[1]==maxi, res))\\n res = sorted(res, key=lambda x: x[0])\\n if res:\\n return res[0][0]\\n return ''\\n \\n \\n \\n\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n n = [len(s)]\\n def contains(w):\\n m = len(w)\\n l = r = 0\\n while l<n[0] and r<m:\\n r += s[l]==w[r]\\n l += 1\\n return r==m\\n for w in dictionary:\\n if contains(w): return w\\n return ''\",\n \"runtime\": \"280\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n \\n for word in dictionary:\\n i = 0\\n for lett in word:\\n while i < len(s) and lett != s[i]:\\n i += 1\\n if i >= len(s):\\n break\\n if i >= len(s):\\n break\\n i += 1\\n else:\\n return word\\n \\n return \\\"\\\"\\n \",\n \"runtime\": \"280\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n longest_word = ''\\n for word in d:\\n i , j =0 , 0\\n while i < len(word) and j < len(s):\\n if word[i] == s[j]:\\n i+=1\\n j+=1\\n else:\\n j+=1\\n if i == len(word):\\n if len(longest_word) < len(word):\\n longest_word = word\\n elif len(word) == len(longest_word):\\n longest_word = min(longest_word , word)\\n return longest_word\\n\\nclass Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n res = ''\\n for cand in d:\\n if self.find(s, cand) and (len(cand) > len(res) or (len(cand) == len(res) and cand < res)):\\n res = cand\\n return res\\n \\n\\n def find(self , s ,d):\\n i , j = 0 , 0\\n while i < len(s) and j < len(d):\\n if s[i] == d[j]:\\n i+=1\\n j+=1\\n else:\\n i+=1\\n return j == len(d)\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n # sort the dictionary by length in lexicographical order\\n dictionary.sort()\\n dictionary.sort(key=len, reverse=True) \\n # print(dictionary)\\n\\n # check whether dictionary[i] is a substring of s\\n for i in dictionary:\\n if self.isSubstring(i, s):\\n return i\\n \\n return ''\\n\\n # check if s1 is a substring of s2\\n def isSubstring(self, s1, s2):\\n # len(s1) <= len(s2)\\n i = 0\\n j = 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i+=1\\n j+=1\\n else:\\n j+=1\\n \\n if i == len(s1) and j <= len(s2):\\n return True\\n else:\\n return False\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def is_subsequence(s, word):\\n i = j = 0\\n while i < len(s) and j < len(word):\\n if s[i] == word[j]:\\n j += 1\\n i += 1\\n return j == len(word)\\n\\n dictionary.sort(key=lambda x: (-len(x), x))\\n\\n for word in dictionary:\\n if is_subsequence(s, word):\\n return word\\n\\n return \\\"\\\"\\n\\n# Example usage:\\nsolution = Solution()\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"ale\\\",\\\"apple\\\",\\\"monkey\\\",\\\"plea\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"apple\\\"\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n d.sort()\\n d.sort(key=len,reverse=True)\\n for word in d:\\n j=0\\n count=0\\n for i in range(len(word)):\\n while j<len(s):\\n if word[i]==s[j]:\\n count+=1\\n j+=1\\n break\\n else:\\n j+=1\\n if count==len(word):\\n return word\\n\\n return \\\"\\\"\\n\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n longest_word = ''\\n for word in d:\\n i , j =0 , 0\\n while i < len(word) and j < len(s):\\n if word[i] == s[j]:\\n i+=1\\n j+=1\\n else:\\n j+=1\\n if i == len(word):\\n if len(longest_word) < len(word):\\n longest_word = word\\n elif len(word) == len(longest_word):\\n longest_word = min(longest_word , word)\\n return longest_word\\n\\nclass Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n res = ''\\n for cand in d:\\n if self.find(s, cand) and (len(cand) > len(res) or (len(cand) == len(res) and cand < res)):\\n res = cand\\n return res\\n \\n\\n def find(self , s ,d):\\n i , j = 0 , 0\\n while i < len(s) and j < len(d):\\n if s[i] == d[j]:\\n i+=1\\n j+=1\\n else:\\n i+=1\\n return j == len(d)\",\n \"runtime\": \"290\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # 2024.9.11\\n def check(word):\\n m = len(s)\\n n = len(word) \\n l_s, l_w = 0, 0\\n #r_s, r_w = m-1, n-1\\n\\n count = 0\\n while l_s <= m-1 and l_w <= n-1:\\n if s[l_s] == word[l_w]:\\n l_w += 1\\n count += 1\\n l_s += 1\\n if l_w > n-1:\\n return (count, word)\\n else:\\n return (0, \\\"\\\")\\n \\n # call helper in dic:\\n max_count = 0\\n max_word = \\\"\\\"\\n \\n for w in dictionary:\\n count, word = check(w)\\n if count > max_count:\\n max_count = count\\n max_word = word\\n elif count != 0 and count == max_count:\\n max_word = min(max_word, word)\\n \\n return max_word\\n\\n\\n\\n\\n \\n\\n\",\n \"runtime\": \"290\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n \\n # sort the dictionary by length in lexicographical order\\n # dictionary.sort()\\n # dictionary.sort(key=len, reverse=True) \\n dictionary.sort(key=lambda x: (-len(x),x)) \\n print(dictionary)\\n\\n # check whether dictionary[i] is a substring of s\\n for i in dictionary:\\n if self.isSubstring(i, s):\\n return i\\n \\n return ''\\n\\n # check if s1 is a substring of s2\\n def isSubstring(self, s1, s2):\\n # len(s1) <= len(s2)\\n i = 0\\n j = 0\\n while i < len(s1) and j < len(s2):\\n if s1[i] == s2[j]:\\n i+=1\\n j+=1\\n else:\\n j+=1\\n \\n if i == len(s1) and j <= len(s2):\\n return True\\n else:\\n return False\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n sortedDict = sorted(dictionary, key= lambda x: [-len(x), x])\\n for word in sortedDict:\\n if self.canForm(s, word):\\n return word\\n return \\\"\\\"\\n def canForm(self, s, word):\\n wordPointer, sPointer = 0, 0\\n while wordPointer < len(word) and sPointer < len(s):\\n if word[wordPointer] == s[sPointer]:\\n wordPointer += 1\\n sPointer += 1\\n return wordPointer == len(word)\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda word: (-len(word), word))\\n \\n # Iterate over each word in 'd' and check if it's a subsequence of 's'\\n for word in dictionary:\\n if self.is_subsequence(s, word):\\n return word # Return the first (longest) subsequence found\\n return \\\"\\\" # Return empty string if no subsequence is found\\n \\n def is_subsequence(self, s, word):\\n # Use two pointers to check if 'word' is a subsequence of 's'\\n i, j = 0, 0\\n while i < len(s) and j < len(word):\\n if s[i] == word[j]:\\n j += 1\\n i += 1\\n return j == len(word)\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n res = ''\\n\\n for word in dictionary:\\n ptr_s = 0\\n ptr_d = 0\\n while ptr_s < len(s) and ptr_d < len(word):\\n if s[ptr_s] == word[ptr_d]:\\n ptr_d += 1\\n ptr_s += 1\\n if ptr_d == len(word) and ((len(res) < len(word)) or (len(res) == len(word) and word < res)):\\n res = word\\n \\n return res\\n\\n \\n \\n\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n def isSubsequence(s, sub):\\n\\n i = 0\\n j = 0\\n\\n while i < len(s) and j < len(sub):\\n\\n if s[i] == sub[j]:\\n j += 1\\n \\n i += 1\\n \\n return j == len(sub)\\n \\n\\n dictionary.sort(key=lambda x: (-len(x), x))\\n\\n for sub in dictionary:\\n\\n if isSubsequence(s, sub):\\n return sub\\n \\n return ''\\n\\n\\n \",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n result = \\\"\\\"\\n \\n for word in dictionary:\\n i = j = 0\\n while i < len(s) and j < len(word):\\n if s[i] == word[j]:\\n j += 1\\n i += 1\\n \\n if j == len(word): # word can be formed from s\\n if len(word) > len(result) or (len(word) == len(result) and word < result):\\n result = word\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"ale\\\",\\\"apple\\\",\\\"monkey\\\",\\\"plea\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"apple\\\"\",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n res = ''\\n\\n for word in dictionary:\\n ptr_s = 0\\n ptr_d = 0\\n while ptr_s < len(s) and ptr_d < len(word):\\n if s[ptr_s] == word[ptr_d]:\\n ptr_d += 1\\n ptr_s += 1\\n if ptr_d >= len(word) and len(res) < len(word):\\n res = word\\n \\n return res\\n\\n \\n \\n\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n longest = \\\"\\\"\\n temp = []\\n for w in dictionary:\\n j = 0\\n i = 0\\n while j < len(s) and i < len(w):\\n if w[i] == s[j]:\\n i += 1\\n j += 1\\n else:\\n j += 1\\n if i == len(w):\\n # temp.append(w)\\n if len(w) > len(longest):\\n longest = w\\n if len(w) == len(longest):\\n for k in range(len(w)):\\n if w[k] == longest[k]:\\n continue\\n if w[k] < longest[k]:\\n longest = w\\n else:\\n break\\n # print(temp)\\n return longest\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n maxStr = \\\"\\\"\\n for d in dictionary:\\n i, j = 0, 0\\n while i<len(s) and j<len(d):\\n if d[j] == s[i]:\\n j+=1\\n i+=1\\n if j==len(d):\\n if len(d) == len(maxStr):\\n maxStr = sorted([d, maxStr])[0]\\n if len(d) > len(maxStr):\\n maxStr = d\\n return maxStr\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n result = \\\"\\\"\\n \\n for word in dictionary:\\n i = j = 0\\n while i < len(s) and j < len(word):\\n if s[i] == word[j]:\\n j += 1\\n i += 1\\n \\n if j == len(word): # Word can be formed from s\\n if len(word) > len(result) or (len(word) == len(result) and word < result):\\n result = word\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"ale\\\",\\\"apple\\\",\\\"monkey\\\",\\\"plea\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"apple\\\"\\n\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"a\\\"\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n def isGood(st):\\n i, j = 0, 0\\n while i<len(st) and j<len(s):\\n if st[i]==s[j]:\\n i+=1\\n j+=1\\n if i ==len(st):\\n return True\\n return False\\n ans = \\\"\\\"\\n maxLen = 0\\n for st in dictionary:\\n if isGood(st) and len(st) > maxLen:\\n maxLen = len(st)\\n ans = st\\n return ans\\n \",\n \"runtime\": \"311\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n def isGood(st):\\n i, j = 0, 0\\n while i<len(st) and j<len(s):\\n if st[i]==s[j]:\\n i+=1\\n j+=1\\n if i ==len(st):\\n return True\\n return False\\n ans = \\\"\\\"\\n maxLen = 0\\n for st in dictionary:\\n if isGood(st) and len(st) > maxLen:\\n maxLen = len(st)\\n ans = st\\n return ans\\n \",\n \"runtime\": \"311\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n # Sort the dictionary by descending length and ascending lexicographical order\\n dictionary.sort(key=lambda x: (-len(x), x))\\n\\n # Function to check if a word d is a subsequence of s\\n def isSubsequence(s: str, d: str) -> bool:\\n i, j = 0, 0\\n while i < len(s) and j < len(d):\\n if s[i] == d[j]:\\n j += 1\\n i += 1\\n return j == len(d)\\n\\n # Check each word in sorted dictionary\\n for d in dictionary:\\n if isSubsequence(s, d):\\n return d\\n\\n return \\\"\\\"\",\n \"runtime\": \"315\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n result = \\\"\\\"\\n \\n for word in dictionary:\\n i = j = 0\\n \\n # Check if word can be formed by deleting characters from s\\n while i < len(s) and j < len(word):\\n if s[i] == word[j]:\\n j += 1\\n i += 1\\n \\n # If word can be formed\\n if j == len(word):\\n # Update result if word is longer or of same length but lexicographically smaller\\n if len(word) > len(result) or (len(word) == len(result) and word < result):\\n result = word\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"ale\\\",\\\"apple\\\",\\\"monkey\\\",\\\"plea\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"apple\\\"\\n\\ns = \\\"abpcplea\\\"\\ndictionary = [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\nprint(solution.findLongestWord(s, dictionary)) # Output: \\\"a\\\"\",\n \"runtime\": \"315\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n longest_word = ''\\n for word in d:\\n i , j =0 , 0\\n while i < len(word) and j < len(s):\\n if word[i] == s[j]:\\n i+=1\\n j+=1\\n else:\\n j+=1\\n if i == len(word):\\n if len(longest_word) < len(word):\\n longest_word = word\\n elif len(word) == len(longest_word):\\n longest_word = min(longest_word , word)\\n return longest_word\\n\\nclass Solution:\\n def findLongestWord(self, s: str, d: List[str]) -> str:\\n res = ''\\n for cand in d:\\n if self.find(s, cand) and (len(cand) > len(res) or (len(cand) == len(res) and cand < res)):\\n res = cand\\n return res\\n \\n\\n def find(self , s ,d):\\n i , j = 0 , 0\\n while i < len(s) and j < len(d):\\n if s[i] == d[j]:\\n i+=1\\n j+=1\\n else:\\n i+=1\\n return j == len(d)\",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n def isSubsequence(d):\\n i, j = 0, 0\\n while i<len(s) and j<len(d):\\n if d[j] == s[i]:\\n j+=1\\n i+=1\\n return (j == len(d), j)\\n\\n maxStr = \\\"\\\"\\n for d in dictionary:\\n if isSubsequence(d)[0] and (isSubsequence(d)[1]>len(maxStr) or (isSubsequence(d)[1] == len(maxStr) and d<maxStr)):\\n maxStr = d\\n return maxStr\",\n \"runtime\": \"318\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n smallest = \\\"\\\"\\n for i in range(len(dictionary)):\\n k = 0 \\n j = 0\\n while j < len(s) and k < len(dictionary[i]):\\n if s[j] == dictionary[i][k]:\\n k += 1\\n j += 1\\n if k == len(dictionary[i]):\\n if len(smallest) == 0:\\n smallest = dictionary[i]\\n elif len(dictionary[i]) > len(smallest):\\n smallest = dictionary[i]\\n elif len(dictionary[i]) == len(smallest):\\n smallest = min(smallest, dictionary[i])\\n\\n return smallest\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n i = 0\\n ans = \\\"\\\"\\n for word in dictionary:\\n j = 0\\n i = 0\\n while(True):\\n if(s[i]==word[j]):\\n i+=1\\n j+=1\\n else:\\n i+=1\\n if(i==len(s) or j==len(word)):\\n break\\n if(j==len(word)):\\n if(len(ans)<j):\\n ans = word\\n elif(len(ans)==j):\\n if(ans>word): ans = word\\n return ans\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def lessthan(self, wordmap: List[int], smap: List[int]) -> bool:\\n for i in range(26):\\n if wordmap[i] > smap[i]:\\n return False\\n return True\\n\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary = sorted(dictionary, key=lambda x: (-len(x), x))\\n lens = len(s)\\n mymap = {}\\n for char in s:\\n if char not in mymap:\\n mymap[char] = 1\\n \\n for word in dictionary:\\n flag = True\\n sleft = 0\\n wleft = 0\\n while wleft < len(word) and sleft < lens:\\n if word[wleft] not in mymap:\\n flag = False\\n break\\n if word[wleft] == s[sleft]:\\n sleft += 1\\n wleft += 1\\n else:\\n sleft += 1\\n if not flag:\\n continue\\n if wleft == len(word):\\n return word \\n return ''\\n\\n \",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n smallest = \\\"\\\"\\n for i in range(len(dictionary)):\\n k = 0 \\n j = 0\\n while j < len(s) and k < len(dictionary[i]):\\n if s[j] == dictionary[i][k]:\\n k += 1\\n j += 1\\n if k == len(dictionary[i]):\\n if len(smallest) == 0:\\n smallest = dictionary[i]\\n if len(dictionary[i]) > len(smallest):\\n smallest = dictionary[i]\\n continue\\n elif len(dictionary[i]) == len(smallest):\\n smallest = min(smallest, dictionary[i])\\n\\n return smallest\",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key=lambda x: (-len(x), x))\\n def isGood(st):\\n i, j = 0, 0\\n while i<len(st) and j<len(s):\\n if st[i]==s[j]:\\n i+=1\\n j+=1\\n if i ==len(st):\\n return True\\n return False\\n for st in dictionary:\\n if isGood(st):\\n return st\\n return \\\"\\\"\\n \",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n i=0\\n ans=[]\\n while i<len(dictionary):\\n k=[x for x in dictionary[i]]\\n j=0\\n while j<len(s) and len(k)>0:\\n if s[j]==k[0]:\\n k.pop(0)\\n j+=1\\n if len(k)==0:\\n ans.append(dictionary[i])\\n i+=1\\n if len(ans)==0:\\n return \\\"\\\"\\n ans.sort()\\n l=[]\\n for i in ans:\\n if not l:\\n l.append(i)\\n else:\\n if len(i)>len(l[-1]):\\n l.pop()\\n l.append(i)\\n return l[0]\",\n \"runtime\": \"333\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n max_length = 0\\n longest = \\\"\\\"\\n for word in dictionary:\\n if self.isSubString(s, word) and len(word) > max_length:\\n max_length = len(word)\\n longest = word\\n \\n return longest\\n\\n def isSubString(self, s, word):\\n i = j = 0\\n while i < len(s) and j < len(word):\\n if s[i] == word[j]:\\n i += 1\\n j += 1\\n else:\\n i += 1\\n return True if j == len(word) else False\",\n \"runtime\": \"336\"\n },\n {\n \"code\": \"class Solution:\\n def find(self, s, cand):\\n i,j=0,0\\n while(i<len(s) and j<len(cand)):\\n if(s[i]==cand[j]):\\n i+=1\\n j+=1\\n \\n else:\\n i+=1\\n\\n return j==len(cand)\\n\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n res=''\\n for cand in dictionary:\\n if self.find(s,cand) and (len(cand)>len(res) or (len(res)==len(cand) and cand<res)):\\n res=cand\\n \\n return res\\n\\n \",\n \"runtime\": \"340\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n #Intuition - Two pointer check for each item in dict with s.\\n def checkstr(a,b):\\n for i in range(len(a)):\\n if ord(a[i])<ord(b[i]):\\n return a\\n elif ord(a[i])>ord(b[i]):\\n return b\\n return a\\n ans=\\\"\\\"\\n # help(set)\\n for d in dictionary:\\n l=0\\n r=0\\n if(set(d).issubset(set(s))):\\n while l<len(s) and r<len(d):\\n if s[l]==d[r]:\\n l+=1\\n r+=1\\n else:\\n l+=1\\n # print(d,l,r)\\n if r==len(d):\\n if len(ans)<len(d):\\n ans=d\\n elif len(ans)==len(d):\\n ans=checkstr(ans,d)\\n \\n return ans\\n\\n \\n\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort(key= lambda x:(-len(x), x))\\n # ['monkey', 'apple', 'plea', 'ale']\\n \\n for word in dictionary:\\n s_pointer = 0\\n w_pointer = 0\\n while w_pointer < len(word) and s_pointer < len(s):\\n if word[w_pointer] == s[s_pointer]:\\n w_pointer += 1\\n s_pointer+=1\\n if w_pointer == len(word):\\n return word\\n\\n return \\\"\\\"\",\n \"runtime\": \"347\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":138,"string":"138"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n\n ret = ''\n\n for i in dictionary:\n flag = False\n k = 0\n\n for j in s:\n if j == i[k]:\n k+=1\n if k==len(i):\n flag = True\n break\n\n if flag: \n if len(i)>len(ret) or (len(i)==len(ret) and i<ret):\n ret = i\n \n\n return ret\n \n ","memory":"18700"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n res = ''\n\n for word in dictionary:\n ptr_s = 0\n ptr_d = 0\n while ptr_s < len(s) and ptr_d < len(word):\n if s[ptr_s] == word[ptr_d]:\n ptr_d += 1\n ptr_s += 1\n if ptr_d >= len(word) and len(res) < len(word):\n res = word\n \n return res\n\n \n \n","memory":"18800"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n charSet = set(list(s))\n def isGood(st):\n i, j = 0, 0\n while i<len(st) and j<len(s):\n if st[i] not in charSet:\n return False\n if st[i]==s[j]:\n i+=1\n j+=1\n if i ==len(st):\n return True\n return False\n ans = \"\"\n maxLen = 0\n for st in dictionary:\n if isGood(st) and len(st) > maxLen:\n maxLen = len(st)\n ans = st\n return ans\n ","memory":"18900"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n dictionary.sort()\n charSet = set(list(s))\n def isGood(st):\n i, j = 0, 0\n while i<len(st) and j<len(s):\n if st[i] not in charSet:\n return False\n if st[i]==s[j]:\n i+=1\n j+=1\n if i ==len(st):\n return True\n return False\n ans = \"\"\n maxLen = 0\n for st in dictionary:\n if isGood(st) and len(st) > maxLen:\n maxLen = len(st)\n ans = st\n return ans\n ","memory":"19000"},{"code":"from functools import cmp_to_key\n\nclass Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n def cmp(a, b):\n if len(a) < len(b):\n return 1\n elif len(a) > len(b):\n return -1\n else:\n return -1 if a < b else 1\n dictionary.sort(key=cmp_to_key(cmp))\n \n for w in dictionary:\n i = 0\n for c in s:\n if c == w[i]:\n i += 1\n if i == len(w):\n return w\n return \"\"","memory":"19100"},{"code":"class Solution:\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\n l=[]\n l1=[]\n s2=\"\"\n for i in dictionary:\n i1=0\n s1=0\n while(s1<len(s) and i1<len(i)):\n if(i[i1]==s[s1]):\n i1+=1\n s1+=1\n else:\n s1+=1\n if(i1==len(i)):\n l.append(i)\n l.sort()\n print(l)\n for i in l:\n l1.append(len(i))\n print(l1)\n d=dict(zip(l,l1))\n print(d)\n m=0\n for key,val in d.items():\n if(val>m):\n m=val\n s2=key\n if(len(l)==0):\n return \"\"\n return s2\n","memory":"19100"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n\\n ret = ''\\n\\n for i in dictionary:\\n flag = False\\n k = 0\\n\\n for j in s:\\n if j == i[k]:\\n k+=1\\n if k==len(i):\\n flag = True\\n break\\n\\n if flag: \\n if len(i)>len(ret) or (len(i)==len(ret) and i<ret):\\n ret = i\\n \\n\\n return ret\\n \\n \",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n res = ''\\n\\n for word in dictionary:\\n ptr_s = 0\\n ptr_d = 0\\n while ptr_s < len(s) and ptr_d < len(word):\\n if s[ptr_s] == word[ptr_d]:\\n ptr_d += 1\\n ptr_s += 1\\n if ptr_d >= len(word) and len(res) < len(word):\\n res = word\\n \\n return res\\n\\n \\n \\n\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n charSet = set(list(s))\\n def isGood(st):\\n i, j = 0, 0\\n while i<len(st) and j<len(s):\\n if st[i] not in charSet:\\n return False\\n if st[i]==s[j]:\\n i+=1\\n j+=1\\n if i ==len(st):\\n return True\\n return False\\n ans = \\\"\\\"\\n maxLen = 0\\n for st in dictionary:\\n if isGood(st) and len(st) > maxLen:\\n maxLen = len(st)\\n ans = st\\n return ans\\n \",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n dictionary.sort()\\n charSet = set(list(s))\\n def isGood(st):\\n i, j = 0, 0\\n while i<len(st) and j<len(s):\\n if st[i] not in charSet:\\n return False\\n if st[i]==s[j]:\\n i+=1\\n j+=1\\n if i ==len(st):\\n return True\\n return False\\n ans = \\\"\\\"\\n maxLen = 0\\n for st in dictionary:\\n if isGood(st) and len(st) > maxLen:\\n maxLen = len(st)\\n ans = st\\n return ans\\n \",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\nclass Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n def cmp(a, b):\\n if len(a) < len(b):\\n return 1\\n elif len(a) > len(b):\\n return -1\\n else:\\n return -1 if a < b else 1\\n dictionary.sort(key=cmp_to_key(cmp))\\n \\n for w in dictionary:\\n i = 0\\n for c in s:\\n if c == w[i]:\\n i += 1\\n if i == len(w):\\n return w\\n return \\\"\\\"\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def findLongestWord(self, s: str, dictionary: List[str]) -> str:\\n l=[]\\n l1=[]\\n s2=\\\"\\\"\\n for i in dictionary:\\n i1=0\\n s1=0\\n while(s1<len(s) and i1<len(i)):\\n if(i[i1]==s[s1]):\\n i1+=1\\n s1+=1\\n else:\\n s1+=1\\n if(i1==len(i)):\\n l.append(i)\\n l.sort()\\n print(l)\\n for i in l:\\n l1.append(len(i))\\n print(l1)\\n d=dict(zip(l,l1))\\n print(d)\\n m=0\\n for key,val in d.items():\\n if(val>m):\\n m=val\\n s2=key\\n if(len(l)==0):\\n return \\\"\\\"\\n return s2\\n\",\n \"memory\": \"19100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":6,"string":"6"}}},{"rowIdx":278,"cells":{"question_id":{"kind":"number","value":525,"string":"525"},"name":{"kind":"string","value":"contiguous-array"},"content":{"kind":"string","value":"<p>Given a binary array <code>nums</code>, return <em>the maximum length of a contiguous subarray with an equal number of </em><code>0</code><em> and </em><code>1</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0,1]\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums = [0,1,0]\n<strong>Output:</strong> 2\n<strong>Explanation:</strong> [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>\n\t<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":48.952432969515705,"string":"48.952433"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","prefix-sum"],"string":"[\n \"array\",\n \"hash-table\",\n \"prefix-sum\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"141\", 0.0278], [\"148\", 0.0139], [\"154\", 0.0139], [\"161\", 0.0139], [\"168\", 0.0139], [\"174\", 0.0139], [\"181\", 0.0139], [\"188\", 0.0139], [\"194\", 0.0139], [\"201\", 0.0139], [\"208\", 0.0139], [\"214\", 0.0139], [\"221\", 0.0139], [\"228\", 0.0139], [\"234\", 0.0557], [\"241\", 0.0139], [\"248\", 0.0418], [\"254\", 0.0139], [\"261\", 0.0278], [\"268\", 0.0139], [\"274\", 0.0139], [\"281\", 0.0278], [\"288\", 0.0557], [\"294\", 0.0835], [\"301\", 0.0418], [\"308\", 0.0557], [\"314\", 0.0835], [\"321\", 0.1253], [\"328\", 0.167], [\"334\", 0.0974], [\"341\", 0.0696], [\"348\", 0.1253], [\"354\", 0.1113], [\"361\", 0.3062], [\"368\", 0.0974], [\"374\", 0.1809], [\"381\", 0.1531], [\"388\", 0.1253], [\"394\", 0.1253], [\"401\", 0.167], [\"408\", 0.167], [\"415\", 0.1949], [\"421\", 0.2505], [\"428\", 0.1949], [\"435\", 0.2227], [\"441\", 0.1949], [\"448\", 0.334], [\"455\", 0.334], [\"461\", 0.4315], [\"468\", 0.3758], [\"475\", 0.515], [\"481\", 0.6681], [\"488\", 0.6681], [\"495\", 0.8072], [\"501\", 0.9047], [\"508\", 0.8351], [\"515\", 1.4057], [\"521\", 1.5449], [\"528\", 1.6145], [\"535\", 1.6145], [\"541\", 2.0877], [\"548\", 2.0598], [\"555\", 2.1016], [\"561\", 2.3382], [\"568\", 2.4356], [\"575\", 2.1294], [\"581\", 2.4635], [\"588\", 2.4635], [\"595\", 2.3104], [\"601\", 2.7975], [\"608\", 2.7557], [\"615\", 7.8218], [\"621\", 14.9478], [\"628\", 10.188], [\"635\", 8.2115], [\"641\", 5.4836], [\"648\", 2.366], [\"655\", 2.1016], [\"661\", 1.4475], [\"668\", 0.6123999999999999]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18200\", 0.0139], [\"18300\", 0.0139], [\"18400\", 0.167], [\"18500\", 0.0418], [\"19000\", 0.0139], [\"19100\", 0.1253], [\"19200\", 0.3897], [\"19300\", 0.0278], [\"19400\", 0.0278], [\"19500\", 0.0139], [\"19600\", 0.0139], [\"19900\", 0.0696], [\"20000\", 0.0557], [\"20100\", 0.1113], [\"20200\", 0.1253], [\"20300\", 0.0696], [\"20500\", 0.0139], [\"20700\", 0.0557], [\"20800\", 0.0278], [\"20900\", 0.1253], [\"21000\", 0.0557], [\"21100\", 0.8768], [\"21200\", 9.2554], [\"21300\", 6.1656], [\"21400\", 0.1253], [\"21500\", 0.1949], [\"21600\", 0.1531], [\"21700\", 0.515], [\"21800\", 7.0424], [\"21900\", 11.3292], [\"22000\", 5.8038], [\"22100\", 27.2651], [\"22200\", 14.7947], [\"22300\", 3.2429], [\"22400\", 1.3361], [\"22500\", 1.0021], [\"22600\", 1.1134], [\"22700\", 1.6701], [\"22800\", 0.8351], [\"22900\", 0.1392], [\"23000\", 0.0557], [\"23100\", 0.0278], [\"23200\", 0.0418], [\"23300\", 0.0418], [\"23400\", 0.0557], [\"23500\", 0.0139], [\"23600\", 0.0835], [\"23700\", 0.0139], [\"23800\", 0.0557]]}"},"rt_list":{"kind":"list like","value":[{"code":"def findMaxLength(nums: List[int]) -> int:\n n = len(nums)\n pre = 0\n seen = {}\n seen[0] = -1\n\n res = 0\n for i in range(n):\n num = nums[i] * 2 - 1\n pre += num\n if pre not in seen:\n seen[pre] = i\n else:\n res = max(res, i - seen[pre])\n return res\n\nsys.stdout = open('user.out', 'w')\nfor nums in map(loads, stdin):\n print(findMaxLength(nums))\n \n","runtime":"148"},{"code":"def findMaxLength(nums: List[int]) -> int:\n d={0:-1}\n cur=ans=0\n for i in range(len(nums)):\n cur+=1 if nums[i]==1 else -1\n if cur in d:\n ans=max(ans,i-d[cur])\n else:\n d[cur]=i\n return ans\n\nsys.stdout = open('user.out', 'w')\nfor nums in map(loads, stdin):\n print(findMaxLength(nums))","runtime":"154"},{"code":"\ndef findMaxLength(nums: List[int]) -> int:\n nums = [-1 if num == 0 else 1 for num in nums]\n\n prefix_sum_map = {0: -1}\n max_length = 0\n prefix_sum = 0\n\n for i in range(len(nums)):\n prefix_sum += nums[i]\n\n if prefix_sum in prefix_sum_map:\n max_length = max(max_length, i - prefix_sum_map[prefix_sum])\n else:\n prefix_sum_map[prefix_sum] = i\n \n return max_length\n\nsys.stdout = open('user.out', 'w')\nfor nums in map(loads, stdin):\n print(findMaxLength(nums))","runtime":"161"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum = [0]\n for i in range(len(nums)):\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\n hashTable = {}\n longest = 0 \n for i in range(len(prefixSum)):\n if prefixSum[i] in hashTable:\n longest = max(longest, i-hashTable[prefixSum[i]])\n else:\n hashTable[prefixSum[i]] = i\n return longest\ndef solve():\n f = open('user.out', 'w')\n iterator = map(loads, stdin)\n while True:\n try:\n nums = next(iterator)\n # k = next(iterator)\n except StopIteration:\n break\n\n print(solution.findMaxLength(nums), file=f) \n\nsolution = Solution()\nsolve()\nexit()","runtime":"168"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum = [0]\n for i in range(len(nums)):\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\n hashTable = {}\n longest = 0 \n for i in range(len(prefixSum)):\n if prefixSum[i] in hashTable:\n longest = max(longest, i-hashTable[prefixSum[i]])\n else:\n hashTable[prefixSum[i]] = i\n return longest\ndef solve():\n f = open('user.out', 'w')\n iterator = map(loads, stdin)\n while True:\n try:\n nums = next(iterator)\n # k = next(iterator)\n except StopIteration:\n break\n\n print(solution.findMaxLength(nums), file=f) \n\nsolution = Solution()\nsolve()\nexit()","runtime":"174"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum = [0]\n for i in range(len(nums)):\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\n hashTable = {}\n longest = 0 \n for i in range(len(prefixSum)):\n if prefixSum[i] in hashTable:\n longest = max(longest, i-hashTable[prefixSum[i]])\n else:\n hashTable[prefixSum[i]] = i\n return longest\ndef solve():\n f = open('user.out', 'w')\n iterator = map(loads, stdin)\n while True:\n try:\n nums = next(iterator)\n # k = next(iterator)\n except StopIteration:\n break\n\n print(solution.findMaxLength(nums), file=f) \n\nsolution = Solution()\nsolve()\nexit()","runtime":"181"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum = [0]\n for i in range(len(nums)):\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\n hashTable = {}\n longest = 0 \n for i in range(len(prefixSum)):\n if prefixSum[i] in hashTable:\n longest = max(longest, i-hashTable[prefixSum[i]])\n else:\n hashTable[prefixSum[i]] = i\n return longest\ndef solve():\n f = open('user.out', 'w')\n iterator = map(loads, stdin)\n while True:\n try:\n nums = next(iterator)\n # k = next(iterator)\n except StopIteration:\n break\n\n print(solution.findMaxLength(nums), file=f) \n\nsolution = Solution()\nsolve()\nexit()","runtime":"188"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum = [0]\n for i in range(len(nums)):\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\n hashTable = {}\n longest = 0 \n for i in range(len(prefixSum)):\n if prefixSum[i] in hashTable:\n longest = max(longest, i-hashTable[prefixSum[i]])\n else:\n hashTable[prefixSum[i]] = i\n return longest\ndef solve():\n f = open('user.out', 'w')\n iterator = map(loads, stdin)\n while True:\n try:\n nums = next(iterator)\n # k = next(iterator)\n except StopIteration:\n break\n\n print(solution.findMaxLength(nums), file=f) \n\nsolution = Solution()\nsolve()\nexit()","runtime":"194"},{"code":"class Solution:\n def findMaxLength(self, nums):\n counts = {0: -1}\n c = 0\n m = 0\n for i, x in enumerate(nums):\n c += -1 if x == 0 else 1\n s = counts.setdefault(c, i)\n if i - s > m:\n m = i - s\n return m\n\n","runtime":"201"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n dic = {0: -1}\n lookup = [-1, 1]\n acc = 0\n maxLength = 0\n for i in range(len(nums)):\n acc += lookup[nums[i]]\n if acc not in dic:\n dic[acc] = i\n elif i - dic[acc] > maxLength:\n maxLength = i - dic[acc]\n return maxLength","runtime":"208"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n ans = 0\n sum_n = 0\n dict_idx_sum = {0:-1}\n l = len(nums)\n for i in range(l):\n if nums[i] == 0:\n sum_n -=1\n else:\n sum_n +=1\n \n if sum_n not in dict_idx_sum:\n dict_idx_sum[sum_n] = i\n else:\n val = i-dict_idx_sum[sum_n]\n if val>ans:\n ans = val\n return ans\n # if sum_n == 0:\n # min_z = min(min_z, i)\n # max_z = max(max_z, i)\n # return max_z-min_z+1\n ","runtime":"214"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n curr_count = 0\n tracker = {0: -1}\n curr_max = 0\n for i in range(0, len(nums)):\n if nums[i] == 1:\n curr_count += 1\n elif nums[i] == 0:\n curr_count -= 1\n if curr_count not in tracker:\n tracker[curr_count] = i \n elif i - tracker[curr_count] > curr_max:\n curr_max = i - tracker[curr_count]\n return curr_max","runtime":"221"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n max_len = 0\n pre = 0\n prev = {0: -1}\n mp = [-1,1]\n for i,n in enumerate(nums):\n pre+=mp[n]\n if pre not in prev:\n prev[pre] = i\n else:\n if i-prev[pre] > max_len:\n max_len = i-prev[pre]\n return max_len","runtime":"228"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counts = {0: -1}\n curr = 0\n ans = 0\n for idx, i in enumerate(nums):\n curr += -1 if i == 0 else 1\n default = counts.setdefault(curr, idx)\n if idx - default > ans:\n ans = idx - default\n return ans","runtime":"234"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n\n count = defaultdict(list)\n c = 0\n maxl = 0\n for i, num in enumerate(nums):\n if num == 0:\n c -= 1\n else:\n c += 1\n count[c].append(i)\n for key in count:\n maxl = max(maxl, count[key][-1] - count[key][0])\n if key == 0:\n maxl = max(maxl, count[key][-1] + 1)\n return maxl\n\n\n \n \n\n\n\n ","runtime":"241"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counter,max = 0,0\n dict = {0:-1}\n for i in range(len(nums)):\n if nums[i] == 1:\n counter+=1\n else:\n counter-=1\n if counter in dict:\n temp = i-dict[counter]\n if temp > max:\n max=temp\n else:\n dict[counter] = i\n\n return max\n\n\n \n\n\n\n\n\n\n","runtime":"248"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n dic = defaultdict(list)\n dic[0] = [-1]\n sum = 0\n for i in range(len(nums)): \n if nums[i]:\n sum+=1\n else: \n sum-=1\n dic[sum].append(i)\n ans = 0\n for k in dic: \n ans = max(ans, dic[k][-1]-dic[k][0])\n return ans\n\n ","runtime":"254"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n net_cnt = defaultdict(list)\n net = 0\n net_cnt[net].append(-1)\n for i in range(len(nums)):\n if nums[i] == 0:\n net += 1\n else:\n net -= 1\n net_cnt[net].append(i)\n max_len = 0\n for diff in net_cnt.values():\n max_len = max(max_len, diff[-1] - diff[0])\n return max_len","runtime":"261"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n som, res = 0, 0\n first, last = {}, {}\n \n for idx in range(len(nums)):\n \n if nums[idx] == 1:\n som += 1\n if nums[idx] == 0:\n som -= 1\n \n if not som in first:\n first[som] = idx\n else:\n last[som] = idx\n \n if som == 0:\n res = max(res,idx+1)\n \n for idx in last:\n res = max(res,last[idx]-first[idx])\n \n return res\n ","runtime":"268"},{"code":"class Solution:\n def findMaxLength(self, nums):\n c = m = 0\n counts = {c: -1}\n for i, x in enumerate(nums):\n c += -1 if x == 0 else 1\n s = counts.setdefault(c, i)\n if i - s > m:\n m = i - s\n return m\n\n","runtime":"274"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # Hash map to store the first occurrence of each running sum\n sum_indices = {0: -1} # Start with sum 0 at index -1\n max_len = 0\n running_sum = 0\n start = end = 0 # Initialize pointers\n\n for i in range(len(nums)):\n # Update running_sum: treat 0 as -1, 1 as +1\n running_sum += -1 if nums[i] == 0 else 1\n\n if running_sum in sum_indices:\n # Calculate current subarray length\n curr_len = i - sum_indices[running_sum]\n if curr_len > max_len:\n max_len = curr_len\n start = sum_indices[running_sum] + 1\n end = i\n else:\n # Store the first occurrence of the running sum\n sum_indices[running_sum] = i\n\n # If needed, return the subarray as nums[start:end+1]\n return max_len # Or return (max_len, start, end)\n","runtime":"281"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n \n if num == 1:\n total += 1\n else:\n total -= 1\n \n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n ","runtime":"288"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum = 0\n max_dis = 0\n tracker = {}\n for i, num in enumerate(nums):\n if num == 0:\n sum -= 1\n else:\n sum += 1\n if sum == 0:\n max_dis = i + 1\n continue\n if sum not in tracker:\n tracker[sum] = i\n else:\n found_dis = i - tracker[sum]\n if found_dis > max_dis:\n max_dis = found_dis\n return max_dis\n","runtime":"294"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n ans = 0\n first_index = {}\n first_index[0] = -1\n count = 0\n for i, d in enumerate(nums):\n if d == 1:\n count += 1\n else:\n count -= 1\n if count in first_index:\n subarray_length = i - first_index[count]\n if subarray_length > ans:\n ans = subarray_length\n else:\n first_index[count] = i\n \n return ans\n","runtime":"301"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n i = cnt = ans = 0\n d={0:-1}\n while i<len(nums):\n if nums[i]==0:\n cnt+=1\n else:\n cnt-=1\n\n if cnt not in d:\n d[cnt] = i\n elif i-d[cnt] > ans:\n ans = i - d[cnt]\n i += 1\n del d\n return ans","runtime":"308"},{"code":"class Solution:\n def findMaxLength(self, nums):\n counts = {0: -1}\n c = 0\n m = 0\n for i, x in enumerate(nums):\n c += -1 if x == 0 else 1\n s = counts.setdefault(c, i)\n if i - s > m:\n m = i - s\n return m\n\n","runtime":"314"},{"code":"from collections import defaultdict\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counter = 0\n count_dict = defaultdict(int)\n count_dict[0] = 0\n result = 0\n num_i = 0\n \n for i in nums:\n num_i+=1\n if i == 1:\n counter+=1\n else:\n counter-=1\n \n if counter in count_dict:\n check_val = num_i - count_dict[counter]\n if check_val > result:\n result = check_val\n else:\n count_dict[counter] = num_i\n \n return result","runtime":"321"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n \n if num == 1:\n total += 1\n else:\n total -= 1\n \n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"328"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n \n if num == 1:\n total += 1\n else:\n total -= 1\n \n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"328"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum = 0\n max_dis = 0\n sum_nums = []\n tracker = {}\n for i, num in enumerate(nums):\n if num == 0:\n sum -= 1\n else:\n sum += 1\n if sum == 0:\n max_dis = i + 1\n continue\n if sum not in tracker:\n tracker[sum] = i\n else:\n found_dis = i - tracker[sum]\n if found_dis > max_dis:\n max_dis = found_dis\n return max_dis\n","runtime":"334"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum2MinPosition = {0: -1}\n prefixSum = 0\n result = 0\n\n for index in range(0, len(nums)):\n if nums[index] == 0:\n prefixSum -= 1\n else:\n prefixSum += 1\n \n if prefixSum in prefixSum2MinPosition:\n if index - prefixSum2MinPosition[prefixSum] > result:\n result = index - prefixSum2MinPosition[prefixSum]\n else:\n prefixSum2MinPosition[prefixSum] = index\n return result","runtime":"341"},{"code":"class Solution:\n def findMaxLength(self, nums):\n counts = {0: -1}\n c = 0\n m = 0\n for i, x in enumerate(nums):\n c += -1 if x == 0 else 1\n s = counts.setdefault(c, i)\n if i != s and i - s > m:\n m = i - s\n return m\n\n","runtime":"348"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n before = current = 0\n dict_ = {0: [0, 0]}\n for i, num in enumerate(nums, 1):\n current = before + (1 if num else -1)\n before = current\n if current not in dict_:\n dict_[current] = [i, i]\n else:\n dict_[current][1] = i\n\n best_len = 0\n for begin, end in dict_.values():\n best_len = max(best_len, end - begin)\n\n return best_len","runtime":"354"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n cuma = []\n cumasum = 0\n for n in nums:\n if n == 1:\n cumasum += 1\n else:\n cumasum -= 1\n cuma.append(cumasum)\n\n best = 0\n seen = {0: -1}\n for (j, c) in enumerate(cuma):\n if c in seen:\n i = seen[c]\n if j - i > best:\n best = j - i\n else:\n seen[c] = j\n return best\n \n","runtime":"361"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n longest_subarray = 0#[0,0,0,1,1,1]\n sum1 = 0\n hash_table={}\n n = len(nums)\n for i in range(n): #0,1,2,3,4,5\n #sum1 = sum1 + nums[i] if nums[i] == 1 else -1 #-1,-2,-3,-2,-1,0\n if nums[i] == 0:\n sum1-=1\n else:\n sum1 +=1\n if (sum1 == 0):\n if longest_subarray < i+1:\n longest_subarray = i+1\n elif sum1 in hash_table.keys():\n if longest_subarray < i - hash_table[sum1]: #3-1,4-0\n longest_subarray = i -hash_table[sum1] #2,4\n else:\n hash_table[sum1]= i #{-1:0,-2:1,-3:2}\n \n return longest_subarray\n","runtime":"368"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum = 0\n max_dis = 0\n sum_nums = []\n for i, num in enumerate(nums):\n if num == 0:\n sum -= 1\n else:\n sum += 1\n sum_nums.append(sum)\n if sum == 0:\n max_dis = i + 1\n tracker = {}\n for i, sum in enumerate(sum_nums):\n if sum not in tracker:\n tracker[sum] = i\n else:\n found_dis = i - tracker[sum]\n if found_dis > max_dis:\n max_dis = found_dis\n return max_dis\n","runtime":"374"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {0:-1}\n length = 0\n total = 0\n for i in range(len(nums)):\n if nums[i]== 0:\n total+=-1\n else:\n total+=1\n nums[i] = total\n if nums[i] not in d:\n d[nums[i]] = i\n else:\n if i - d[nums[i]] > length:\n length = i - d[nums[i]]\n\n return length\n ","runtime":"381"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # prefix sum\n # change values\n for i in range(len(nums)):\n if nums[i] == 0:\n nums[i] = -1\n else:\n nums[i] = 1\n maxLen = 0\n curSum = 0\n hashMap = {}\n for i in range(len(nums)):\n curSum = curSum + nums[i]\n \n if curSum == 0:\n maxLen = i + 1\n \n if curSum in hashMap:\n if maxLen < i - hashMap[curSum]:\n maxLen = i - hashMap[curSum]\n else:\n hashMap[curSum] = i\n\n return maxLen\n ","runtime":"381"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n \n if num == 1:\n total += 1\n else:\n total -= 1\n \n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"388"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # SLIDING WINDOW - Not Working \n # i, j, ans, csum = 0, 0, 0, 0\n # n = len(nums)\n # while j < n:\n # csum += (1 if nums[j] == 1 else -1) \n # while csum != 0 and i <= j:\n # csum -= (1 if nums[i] == 1 else -1)\n # i += 1\n # if csum == 0:\n # ans = max(ans, j-i+1)\n \n # if csum == 0:\n # ans = max(ans, j-i+1)\n # j += 1\n \n # return ans \n\n # HASH MAP + CURR SUM\n count = 0 \n hmap = {0: -1}\n n = len(nums)\n ans = 0 \n for i in range(n):\n if nums[i] == 0:\n count -= 1\n else:\n count += 1\n if count in hmap:\n ans = max(ans, i - hmap[count])\n else:\n hmap[count] = i \n return ans \n\n \n ","runtime":"394"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n\n res = 0\n delta = [0]\n record = {}\n\n for idx in range(len(nums)):\n\n if nums[idx] == 0:\n new_delta = delta[idx] - 1\n else:\n new_delta = delta[idx] + 1\n\n delta.append(new_delta)\n\n if new_delta not in record:\n record[new_delta] = idx\n else:\n if res < (idx - record[new_delta]):\n res = idx - record[new_delta]\n\n if delta[idx + 1] == 0:\n res = idx + 1\n \n return res","runtime":"401"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {}\n length = 0\n total = 0\n for i in range(len(nums)):\n if nums[i]== 0:\n total+=-1\n else:\n total+=1\n nums[i] = total\n if nums[i] not in d:\n d[nums[i]] = i\n else:\n if i - d[nums[i]] > length:\n length = i - d[nums[i]]\n if nums[i] == 0:\n if i > length:\n length = i+1\n\n\n return length\n \n\n\n\n\n return 0\n\n ","runtime":"408"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n \n if num == 1:\n total += 1\n else:\n total -= 1\n \n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"408"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n longest_subarray = 0#[0,0,0,1,1,1]\n sum1 = 0\n hash_table={}\n n = len(nums)\n for i in range(n): #0,1,2,3,4,5\n #sum1 = sum1 + nums[i] if nums[i] == 1 else -1 #-1,-2,-3,-2,-1,0\n if nums[i] == 0:\n sum1-=1\n else:\n sum1 +=1\n if (sum1 == 0):\n if longest_subarray < i+1:\n longest_subarray = i+1\n elif sum1 in hash_table.keys():\n if longest_subarray < i - hash_table[sum1]: #3-1,4-0\n longest_subarray = i -hash_table[sum1] #2,4\n else:\n hash_table[sum1]= i #{-1:0,-2:1,-3:2}\n \n return longest_subarray\n","runtime":"415"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {}\n length = 0\n total = 0\n for i in range(len(nums)):\n if nums[i]== 0:\n total+=-1\n else:\n total+=1\n nums[i] = total\n if nums[i] not in d:\n d[nums[i]] = i\n else:\n if i - d[nums[i]] > length:\n length = i - d[nums[i]]\n if nums[i] == 0:\n if i > length:\n length = i+1\n\n\n return length\n \n\n\n\n\n return 0\n\n ","runtime":"421"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n\n max_len = 0\n prefix_sum_map = {0: -1}\n prefix_sum = 0\n\n for i in range(len(nums)):\n prefix_sum += 1 if nums[i] == 1 else -1\n\n if prefix_sum in prefix_sum_map:\n max_len = max(max_len, i - prefix_sum_map[prefix_sum])\n else:\n prefix_sum_map[prefix_sum] = i\n \n return max_len\n\n\n \n","runtime":"428"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n pre = {0: -1}\n s = 0\n mm = 0\n for idx, n in enumerate(nums):\n if n == 0:\n s -= 1\n else:\n s += 1\n if s in pre:\n tmp = idx - pre[s]\n if tmp > mm:\n mm = tmp\n else:\n pre[s] = idx\n return mm\n ","runtime":"428"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counts = {}\n total = 0\n best = 0\n\n for i, n in enumerate(nums):\n if n == 1:\n total += 1\n else:\n total -= 1\n \n if total == 0:\n best = i+1\n elif total in counts:\n best = max(best, i - counts[total])\n else:\n counts[total] = i\n \n return best","runtime":"435"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n i = cnt = ans = 0\n d={0:-1}\n while i<len(nums):\n\n if nums[i]==0:\n cnt+=1\n else:\n cnt-=1\n\n if cnt not in d:\n d[cnt] = i\n elif i-d[cnt] > ans:\n ans = i - d[cnt]\n i += 1\n return ans","runtime":"441"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n dic = {}\n ans = 0\n count = 0\n for index, num in enumerate(nums):\n count += 1 if num == 1 else -1\n \n if count == 0:\n ans = index + 1\n elif count in dic:\n ans = max(ans, index - dic[count])\n else:\n dic[count] = index\n return ans","runtime":"448"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefix = {0: -1}\n\n num_zeroes = 0\n num_ones = 0\n result = 0\n for index, value in enumerate(nums):\n if value == 0:\n num_zeroes += 1\n else:\n num_ones += 1\n \n diff = num_zeroes - num_ones\n \n if diff in prefix and index - prefix[diff] > result:\n result = index - prefix[diff]\n\n if diff not in prefix:\n prefix[diff] = index\n return result\n\n","runtime":"455"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum_map = {}\n\n n = len(nums)\n\n curr_sum = 0\n max_length = 0\n for i in range(n):\n if nums[i] == 0:\n curr_sum -= 1\n else:\n curr_sum += 1\n\n if curr_sum == 0:\n max_length = i + 1\n\n if curr_sum in sum_map:\n max_length = max(max_length, i - sum_map[curr_sum])\n else:\n sum_map[curr_sum] = i\n\n return max_length\n\n ","runtime":"461"},{"code":"'''\nInput: binary array nums: List[int]\nOutput: max len of a subarray with an equal num of 0 and 1: int\n\nclarify:\n- nums[i] is only 0 or 1\n- nums length? 1 to 10^5\n\nexamples:\nnums = [0,1,1,1,0,0,1,0] -> 4\nnums = [1] -> 0\nnums = [1,1] -> 0\n\napproaches:\n1. brute force\nnums = [0,1,1,1,0,0,1,0] -> 4\n i j\ncheck all the subarrays if they are evenly distributed\nthen update the max length\nT: O(n^2), S: O(1)\n\n2. count_index_map\nnums = [1,0,1,1,0,0,1,0] -> 6\n i\ncreate count_index_map to store indices of each count. \nhere count means how many more 1s than 0s -> [1,0,0] -> -1, [0,1,1] -> 1\niterate nums -> when count was recorded in map -> meaning 0s and 1s are even -> update max_len\nif count is not 0 -> update count_index_map\n\ni = 1\ncount_index_map = {0: -1, 1:0}\ncount = 0 in map -> i - map[count] = 1 - (-1) = 2\n\ni = 4\ncount_index_map = {0: -1, 1:0, 2:3}\ncount = 1 in map -> i - map[count] = 4 - 0 = 4\n\nT: O(n), S: O(n)\n'''\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n count_index_map = {0: -1}\n count, max_len = 0, 0\n for i in range(len(nums)):\n if nums[i] == 1:\n count += 1\n else:\n count -= 1\n if count in count_index_map:\n max_len = max(max_len, i - count_index_map[count])\n else:\n count_index_map[count] = i\n return max_len\n ","runtime":"461"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # count = 0: This variable tracks the cumulative difference between the number of 1s and 0s.\n count_map = dict()\n count_map[0] = - 1 # store count and index\n maxlen = 0\n count= 0\n for i in range(len(nums)):\n if nums[i] == 1:\n count += 1\n else:\n count -= 1\n\n if count in count_map:\n maxlen = max(maxlen, i - count_map[count])\n else:\n count_map[count] = i\n\n\n return maxlen","runtime":"468"},{"code":"class Solution:\n def findMaxLength(self,nums):\n sum_index_map = {0:-1}\n max_length = 0\n cum_sum = 0\n\n for i,num in enumerate(nums):\n cum_sum += 1 if num == 1 else -1\n if cum_sum in sum_index_map:\n max_length = max(max_length,i-sum_index_map[cum_sum])\n else:\n sum_index_map[cum_sum] = i\n return max_length ","runtime":"475"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n count = 0\n max_length=0\n table = {0: 0}\n for index, num in enumerate(nums,1):\n if num == 0:\n count -= 1\n else:\n count += 1\n \n if count in table:\n max_length = max(max_length, index - table[count])\n else:\n table[count] = index\n \n return max_length","runtime":"481"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counts = {0:-1}\n runningLength = maxLength = 0 \n for i, num in enumerate(nums):\n runningLength += 1 if num == 1 else -1 \n if runningLength in counts:\n maxLength = max(maxLength, i - counts[runningLength])\n else:\n counts[runningLength] = i \n return maxLength ","runtime":"481"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n map = {0:-1}\n count = 0\n maxCount = 0\n\n for i in range(len(nums)):\n num = nums[i]\n if num == 0:\n count -= 1\n else:\n count += 1\n if count in map:\n maxCount = max(maxCount, i - map[count])\n else:\n map[count] = i\n \n return maxCount","runtime":"488"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n dic = { 0: -1 }\n ans = count = 0\n for i in range(len(nums)):\n num = nums[i]\n if num == 0:\n count -= 1\n if num == 1:\n count += 1\n if count in dic:\n ans = max(ans, i - dic[count])\n else:\n dic[count] = i\n return ans","runtime":"495"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counts = {0:-1}\n diff = 0\n mx = 0\n for i,n in enumerate(nums):\n diff += n*2-1\n if diff in counts:\n # print(\"Already in\")\n mx = max(i - counts[diff], mx)\n else:\n # print(\"Not in\")\n counts[diff] = i\n # print(mx, diff, counts, i)\n return mx","runtime":"501"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if sum(nums)*2 == len(nums):\n return len(nums)\n balance, result = 0, 0\n hashMap = {}\n hashMap[0] = -1\n for i in range(0, len(nums)):\n if nums[i] == 0:\n balance -= 1\n else:\n balance += 1\n if not balance in hashMap:\n hashMap[balance] = i\n else:\n result = max(result, i - hashMap[balance])\n return result\n\n","runtime":"515"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n first_diff = {0:-1}\n diff = 0 # Number of 1 - number of 0\n ans = 0 \n for i, vi in enumerate(nums):\n if vi == 1:\n diff+=1\n else:\n diff-=1\n if diff in first_diff:\n ans = max(ans,i-first_diff[diff])\n else:\n first_diff[diff] = i\n return ans\n","runtime":"515"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n map = {}\n map[0] = -1\n maxLen = count = 0\n for i in range(len(nums)):\n count += 1 if nums[i] == 1 else -1\n if count in map:\n maxLen = max(maxLen, i - map[count])\n else:\n map[count] = i\n return maxLen","runtime":"521"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counts = { 0: -1 }\n result = running = 0\n for i, num in enumerate(nums):\n diff = 1 if num == 1 else -1\n running += diff\n \n if running in counts:\n result = max(result, i - counts[running])\n else:\n counts[running] = i\n \n return result\n \n \n \"\"\"\n \n \n 1,1,0,1,1,0,1\n counts = {\n 0: -1,\n 1: 0,\n 2: 1,\n 3: ,\n \n \n }\n {0: -1, 1: 0, 2: 1, 3: 4}\n running = 1\n \"\"\"","runtime":"521"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n nums_hash = {}\n count = ans = 0\n\n for i, num in enumerate(nums):\n count += 1 if num == 1 else -1\n if count == 0:\n ans = i + 1\n elif count in nums_hash:\n ans = max(ans, i - nums_hash[count])\n else:\n nums_hash[count] = i\n \n return ans","runtime":"528"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n longest_array = {}\n sum_val = 0\n max_len = 0\n for i in range(len(nums)):\n if nums[i] == 1:\n sum_val += 1\n else:\n sum_val -= 1\n if sum_val == 0:\n max_len = i + 1\n elif sum_val in longest_array:\n max_len = max(max_len, i - longest_array[sum_val])\n else:\n longest_array[sum_val] = i\n return max_len\n\n\n ","runtime":"535"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \"\"\"\n sum(x, y) = 0\n sum(x, y) = sum(0, y) - sum(0, x-1)= 0\n sum(0, y) = sum(0, x-1)\n\n \"\"\"\n prefix_sum_map = {0:-1}\n longest = 0\n prefix_sum = 0\n for i in range(len(nums)):\n prefix_sum += (1 if nums[i] == 1 else -1)\n if prefix_sum in prefix_sum_map:\n longest = max(longest, i - prefix_sum_map[prefix_sum])\n else:\n prefix_sum_map[prefix_sum] = i\n return longest\n","runtime":"535"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n count = [0]*(len(nums)+1) \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n if num == 1:\n total += 1\n else:\n total -= 1\n \n count[idx+1] = total\n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"541"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n running_sum = 0\n dic = {}\n result = 0\n \n for i in range(len(nums)):\n running_sum = running_sum + 1 if nums[i] == 1 else running_sum - 1\n \n if running_sum == 0:\n result = i + 1\n elif running_sum in dic:\n result = max(result, i - dic[running_sum])\n else:\n dic[running_sum] = i\n return result","runtime":"541"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sumToIndex = {}\n res = 0\n currSum = 0\n for i, num in enumerate(nums):\n if num:\n currSum += 1\n else:\n currSum -= 1\n if currSum == 0:\n res = max(res, i + 1)\n if currSum in sumToIndex:\n res = max(res, i - sumToIndex[currSum])\n else:\n sumToIndex[currSum] = i\n return res\n ","runtime":"548"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n map = {}\n maxLen = count = 0\n for i in range(len(nums)):\n count += 1 if nums[i] == 1 else -1\n if count == 0:\n maxLen = i + 1\n elif count in map:\n maxLen = max(maxLen, i - map[count])\n else:\n map[count] = i\n return maxLen","runtime":"548"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n earlest_index = {}\n result = 0\n s = 0\n for index, num in enumerate(nums):\n if num == 1:\n s += 1\n else:\n s -= 1\n if s == 0:\n result = index + 1\n else:\n if s in earlest_index:\n result = max(result, index-earlest_index[s])\n else:\n earlest_index[s] = index\n return result","runtime":"555"},{"code":"from collections import defaultdict\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n count_dict = defaultdict(int)\n count_dict[0] = 0\n \n total = 0\n max_window_size = 0\n \n for idx, num in enumerate(nums, start=1):\n total += 1 if num == 1 else -1\n \n if total in count_dict:\n max_window_size = max(max_window_size, idx - count_dict[total])\n else:\n count_dict[total] = idx\n \n return max_window_size\n","runtime":"561"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n n = len(nums)\n count_dict = {0:-1}\n count = 0\n res = 0\n for i in range(n):\n if nums[i] == 1:\n count += 1\n else:\n count -= 1\n if count in count_dict:\n res = max(res, i - count_dict[count])\n else:\n count_dict[count] = i\n return res\n \n ","runtime":"568"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n m = {}\n m[0] = -1\n res = 0\n count = 0\n for i in range(len(nums)):\n\n if nums[i] == 0:\n count -= 1\n else:\n count += 1\n\n if count in m:\n res = max(res, i - m[count])\n else:\n m[count] = i\n \n return res\n","runtime":"568"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n current_sum = 0\n res = 0\n diff_index = {0: -1}\n\n for i, n in enumerate(nums):\n if n == 0:\n current_sum -= 1\n else:\n current_sum += 1\n \n if current_sum in diff_index:\n res = max(res, i - diff_index[current_sum])\n else:\n diff_index[current_sum] = i\n \n return res\n ","runtime":"575"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n c = {}\n c[0]=-1\n s=0\n ans = 0\n for idx, n in enumerate(nums):\n s+=(1 if n==1 else -1)\n if s in c:\n ans = max(ans, idx - c[s])\n else:\n c[s]=idx\n return ans\n ","runtime":"575"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n dictionary = defaultdict(int)\n dictionary[0] = -1\n ret = 0\n count = 0\n for key, num in enumerate(nums):\n if num == 1:\n count += 1\n else:\n count -= 1\n \n if count in dictionary:\n ret = max(ret, key-dictionary[count])\n else:\n dictionary[count] = key\n \n return ret \n ","runtime":"581"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n\n if len(nums) == 0:\n return -1\n \n count_index_map = {0 : -1}\n max_len = 0\n count = 0\n\n for index in range(len(nums)):\n if nums[index] == 0:\n count-=1\n else:\n count+=1\n \n\n if count in count_index_map:\n curr_len = index - count_index_map[count]\n max_len = max(max_len, curr_len)\n else:\n count_index_map[count] = index\n\n\n return max_len\n ","runtime":"581"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n hashMap = defaultdict(int)\n hashMap[0] = -1\n\n maxLen = 0\n count = 0\n\n for key, num in enumerate(nums):\n if num == 1:\n count += 1\n else:\n count -= 1\n\n if count in hashMap:\n maxLen = max(maxLen, key - hashMap[count])\n else:\n hashMap[count] = key\n\n return maxLen ","runtime":"588"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # Count positively all the 1s, negatively all the zeros, and\n # whenever there are two indices that have the same count, that\n # stretch has the same number of ones and zeros.\n \n # Create a map representing the earliest index having\n # a particular count\n map = {}\n \n # No length so far, and no count\n maxLen = count = 0\n for i in range(len(nums)):\n count += 1 if nums[i] == 1 else -1\n if count == 0:\n # Here we found another index where the whole\n # string has equal count of 1s and 0s, so the\n # whole string to this point must be the longest\n maxLen = i + 1\n elif count in map:\n # We found another index with the same count that\n # is not zero, so let's find that index and the index\n # difference is the longest equal length stretch.\n maxLen = max(maxLen, i - map[count])\n else:\n # This is the first time we have seen this count, so\n # record it in case we come across it again.\n map[count] = i\n return maxLen","runtime":"588"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if nums[0] == 0:\n prefixed_list = [0]\n prefixed_sum = 0\n else:\n prefixed_list = [1]\n prefixed_sum = 1\n number_appeared = 1\n for i in nums:\n if i == 0:\n prefixed_sum -= 1\n else:\n prefixed_sum += 1\n \n prefixed_list.append(prefixed_sum)\n \n count_dict = defaultdict(int)\n maximum_length = 0\n for i in range(len(prefixed_list)):\n if prefixed_list[i] not in count_dict:\n count_dict[prefixed_list[i]] = i\n else:\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\n return maximum_length\n \n \n ","runtime":"595"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n balance, result = 0, 0\n hashMap = {}\n hashMap[0] = -1\n for i in range(0, len(nums)):\n if nums[i] == 0:\n balance -= 1\n else:\n balance += 1\n if not balance in hashMap:\n hashMap[balance] = i\n else:\n result = max(result, i - hashMap[balance])\n return result\n\n","runtime":"595"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n hmp = {}\n sum_val = 0\n max_len = 0\n for i,val in enumerate(nums):\n sum_val += 1 if val==1 else -1\n if sum_val==0:\n max_len = i+1\n elif sum_val in hmp:\n max_len = max(max_len,i-hmp[sum_val])\n else:\n hmp[sum_val] = i\n return max_len","runtime":"601"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n n=len(nums)\n ans=0\n sum=0\n\n dic={}\n dic[0]=-1\n\n for i in range(n):\n if nums[i]==0:sum+=-1\n else : sum+=1\n \n\n if sum in dic:\n ans=max(ans,i-dic[sum])\n else: dic[sum]=i\n return ans\n ","runtime":"608"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n\n d = {}\n max_len = 0\n curr_sum = 0\n\n for i in range(len(nums)):\n\n if nums[i] == 0:\n curr_sum -= 1\n\n else:\n curr_sum += 1\n \n if curr_sum == 0:\n max_len = i + 1\n \n elif curr_sum in d:\n max_len = max(max_len, i - d[curr_sum])\n \n else:\n d[curr_sum] = i\n \n return max_len","runtime":"608"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum_index_map = {0: -1}\n cumulative_sum = 0\n max_length = 0\n \n for i in range(len(nums)):\n # Increment cumulative sum for 1, decrement for 0\n if nums[i] == 1:\n cumulative_sum += 1\n else:\n cumulative_sum -= 1\n \n if cumulative_sum in sum_index_map:\n # If the cumulative sum has been seen before, calculate the length of the subarray\n subarray_length = i - sum_index_map[cumulative_sum]\n max_length = max(max_length, subarray_length)\n else:\n # Store the first occurrence of the cumulative sum\n sum_index_map[cumulative_sum] = i\n \n return max_length\n\n ","runtime":"615"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n valid_map = {0:-1}\n ans = count = 0\n for i,n in enumerate(nums):\n if n ==1:\n count+=1\n else:\n count-=1\n\n if count in valid_map:\n ans = max(ans, abs(valid_map[count] - i))\n else:\n valid_map[count] = i\n \n return ans\n\n","runtime":"615"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefix = {}\n valsum = 0\n lmax = 0\n for i,n in enumerate(nums):\n valsum += 1 if n == 1 else -1\n \n if valsum == 0:\n lmax = i + 1\n elif valsum in prefix:\n lmax = max(lmax, i - prefix[valsum])\n else:\n prefix[valsum] = i\n\n return lmax","runtime":"621"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if nums[0] == 0:\n prefixed_list = [0]\n prefixed_sum = 0\n else:\n prefixed_list = [1]\n prefixed_sum = 1\n number_appeared = 1\n for i in nums:\n if i == 0:\n prefixed_sum -= 1\n else:\n prefixed_sum += 1\n \n prefixed_list.append(prefixed_sum)\n \n count_dict = defaultdict(int)\n maximum_length = 0\n for i in range(len(prefixed_list)):\n if prefixed_list[i] not in count_dict:\n count_dict[prefixed_list[i]] = i\n else:\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\n return maximum_length\n \n \n ","runtime":"621"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n prefix_sum = {0 : -1}\n curr = 0 \n res = 0\n for i in range(len(nums)):\n curr = curr + (1 if nums[i] == 1 else -1)\n diff = curr \n \n if diff in prefix_sum:\n res = max(res, i - prefix_sum[diff])\n if curr not in prefix_sum:\n prefix_sum[curr] = i\n return res \n \n\n \n \n \n \n \n \n \n \n \n \n \n ","runtime":"628"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n hmap = {} #diff --> index \n num0, num1 = 0, 0 \n result = 0\n\n for i in range(len(nums)):\n if nums[i] == 0:\n num0 += 1 \n elif nums[i] == 1:\n num1 += 1 \n\n diff = num1-num0\n if diff not in hmap:\n hmap[diff] = i\n\n if num1 == num0:\n result = num1+num0\n else:\n result = max(result, i- hmap[diff]) \n\n return result \n\n\n\n \n \n\n\n\n\n ","runtime":"628"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # maybe: preprocess to sum positive ones and zeros as negative ones, the problem then becomes longest subseq sum to zero\n # that algorithm looks like: \n\n # solution posted below:\n total = 0\n lookup = {0:-1}\n max_seq = 0\n for i in range(len(nums)):\n if nums[i] == 0:\n total -= 1\n else:\n total += 1\n\n # print(total,lookup.keys())\n if total not in lookup.keys():\n lookup[total] = i\n else:\n max_seq = max(max_seq,i-lookup[total])\n\n return max_seq","runtime":"635"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n zero, one = 0, 0\n res = 0\n diff_prefix = {}\n for i, num in enumerate(nums):\n if num == 0:\n zero += 1\n else:\n one += 1\n\n if zero == one:\n res = zero + one\n\n diff = zero - one\n if diff in diff_prefix:\n res = max(res, i - diff_prefix[diff])\n else:\n diff_prefix[diff] = i\n\n return res\n","runtime":"635"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum_to_index = {0:-1}\n curr = 0\n maxl=0\n \n for i, n in enumerate(nums):\n curr+=1 if n==1 else -1\n \n if curr in sum_to_index:\n maxl = max(maxl, i-sum_to_index[curr])\n else:\n sum_to_index[curr] = i\n return maxl","runtime":"641"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {}\n length = 0\n total = 0\n for i in range(len(nums)):\n if nums[i]== 0:\n total+=-1\n else:\n total+=1\n nums[i] = total\n if nums[i] not in d:\n d[nums[i]] = [i]\n else:\n if i - d[nums[i]][0] > length:\n length = i - d[nums[i]][0]\n d[nums[i]].append(i)\n if nums[i] == 0:\n if i > length:\n length = i+1\n\n\n return length\n \n\n\n\n\n return 0\n\n ","runtime":"641"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counter = 0\n peaks = []\n peaktoindex = {}\n maxlen = 0\n for i in range(len(nums)):\n if i == 0: peaks.append(0)\n else: peaks.append(counter)\n if nums[i] == 0: counter -=1 \n else : counter += 1\n peaks.append(counter)\n\n for i in range(len(peaks)):\n elem = peaks[i]\n if elem in peaktoindex:\n start = peaktoindex[elem]\n maxlen = max(maxlen,i-start)\n\n else: peaktoindex[elem] = i\n return maxlen\n\n\n\n \n ","runtime":"648"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {}\n length = 0\n total = 0\n for i in range(len(nums)):\n if nums[i]== 0:\n total+=-1\n else:\n total+=1\n nums[i] = total\n for i in range(len(nums)):\n if nums[i] not in d:\n d[nums[i]] = [i]\n else:\n if i - d[nums[i]][0] > length:\n length = i - d[nums[i]][0]\n d[nums[i]].append(i)\n if nums[i] == 0:\n if i > length:\n length = i+1\n return length\n \n\n\n\n\n return 0\n\n ","runtime":"648"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n answer = 0\n seen_points = {}\n count = 0\n seen_points[len(nums)] = -1\n for i in range(len(nums)):\n count += (-1)**(nums[i])\n \n if count + len(nums) in seen_points:\n answer = max(answer, i - seen_points[count + len(nums)])\n else:\n seen_points[count + len(nums)] = i\n print(seen_points)\n return answer","runtime":"655"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n #find amount of zeros and ones till i for every i\n #search for the longest sub s.t #0=#1\n \n i = 0\n sub = 0\n amounts = {}\n index_to_sub = {}\n \n for x in nums:\n if x == 1:\n sub += 1\n else:\n sub -= 1\n if sub not in amounts.keys():\n amounts[sub] = i\n \n index_to_sub[i] = sub\n i += 1\n\n longest = 0\n \n for i in range(len(nums)):\n if index_to_sub[i] == 0:\n longest = i + 1\n continue\n curr = i - amounts[index_to_sub[i]] \n if curr > longest:\n longest = curr\n \n \n return longest\n \n \n \n \n \n \n \n ","runtime":"655"},{"code":"'''\n[0, 1, 0]\n[0, -1, 0, -1]\n'''\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sums = [0] * (len(nums) + 1)\n table = {0: -1} # sum: index\n max_len = 0\n\n for i in range(0, len(nums)):\n inc = 1 if nums[i] == 1 else -1\n sums[i + 1] = sums[i] + inc\n \n if sums[i + 1] in table:\n curr_len = i - table[sums[i + 1]]\n max_len = max(max_len, curr_len)\n else:\n table[sums[i + 1]] = i\n\n return max_len\n\n ","runtime":"661"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {}\n length = 0\n for i in range(len(nums)):\n if nums[i] == 0:\n nums[i] = -1\n for i in range(1,len(nums)):\n nums[i]+= nums[i-1]\n \n for i in range(len(nums)):\n if nums[i] not in d:\n d[nums[i]] = [i]\n else:\n if i - d[nums[i]][0] > length:\n length = i - d[nums[i]][0]\n d[nums[i]].append(i)\n if nums[i] == 0:\n if i > length:\n length = i+1\n return length\n \n\n\n\n\n return 0\n\n ","runtime":"661"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n nums=[1 if i==1 else -1 for i in nums]\n has={}\n has[0]=-1\n cur=0\n ans=0\n ind=0\n for i in nums:\n cur+=i\n if cur in has:\n ans=max(ans,ind-has[cur])\n if cur not in has:\n has[cur]=ind\n ind+=1\n return ans","runtime":"668"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum = [0]\n for i in range(len(nums)):\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\n hashTable = {}\n longest = 0 \n for i in range(len(prefixSum)):\n if prefixSum[i] in hashTable:\n longest = max(longest, i-hashTable[prefixSum[i]])\n else:\n hashTable[prefixSum[i]] = i\n return longest","runtime":"668"}],"string":"[\n {\n \"code\": \"def findMaxLength(nums: List[int]) -> int:\\n n = len(nums)\\n pre = 0\\n seen = {}\\n seen[0] = -1\\n\\n res = 0\\n for i in range(n):\\n num = nums[i] * 2 - 1\\n pre += num\\n if pre not in seen:\\n seen[pre] = i\\n else:\\n res = max(res, i - seen[pre])\\n return res\\n\\nsys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(findMaxLength(nums))\\n \\n\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"def findMaxLength(nums: List[int]) -> int:\\n d={0:-1}\\n cur=ans=0\\n for i in range(len(nums)):\\n cur+=1 if nums[i]==1 else -1\\n if cur in d:\\n ans=max(ans,i-d[cur])\\n else:\\n d[cur]=i\\n return ans\\n\\nsys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(findMaxLength(nums))\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"\\ndef findMaxLength(nums: List[int]) -> int:\\n nums = [-1 if num == 0 else 1 for num in nums]\\n\\n prefix_sum_map = {0: -1}\\n max_length = 0\\n prefix_sum = 0\\n\\n for i in range(len(nums)):\\n prefix_sum += nums[i]\\n\\n if prefix_sum in prefix_sum_map:\\n max_length = max(max_length, i - prefix_sum_map[prefix_sum])\\n else:\\n prefix_sum_map[prefix_sum] = i\\n \\n return max_length\\n\\nsys.stdout = open('user.out', 'w')\\nfor nums in map(loads, stdin):\\n print(findMaxLength(nums))\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum = [0]\\n for i in range(len(nums)):\\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\\n hashTable = {}\\n longest = 0 \\n for i in range(len(prefixSum)):\\n if prefixSum[i] in hashTable:\\n longest = max(longest, i-hashTable[prefixSum[i]])\\n else:\\n hashTable[prefixSum[i]] = i\\n return longest\\ndef solve():\\n f = open('user.out', 'w')\\n iterator = map(loads, stdin)\\n while True:\\n try:\\n nums = next(iterator)\\n # k = next(iterator)\\n except StopIteration:\\n break\\n\\n print(solution.findMaxLength(nums), file=f) \\n\\nsolution = Solution()\\nsolve()\\nexit()\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum = [0]\\n for i in range(len(nums)):\\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\\n hashTable = {}\\n longest = 0 \\n for i in range(len(prefixSum)):\\n if prefixSum[i] in hashTable:\\n longest = max(longest, i-hashTable[prefixSum[i]])\\n else:\\n hashTable[prefixSum[i]] = i\\n return longest\\ndef solve():\\n f = open('user.out', 'w')\\n iterator = map(loads, stdin)\\n while True:\\n try:\\n nums = next(iterator)\\n # k = next(iterator)\\n except StopIteration:\\n break\\n\\n print(solution.findMaxLength(nums), file=f) \\n\\nsolution = Solution()\\nsolve()\\nexit()\",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum = [0]\\n for i in range(len(nums)):\\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\\n hashTable = {}\\n longest = 0 \\n for i in range(len(prefixSum)):\\n if prefixSum[i] in hashTable:\\n longest = max(longest, i-hashTable[prefixSum[i]])\\n else:\\n hashTable[prefixSum[i]] = i\\n return longest\\ndef solve():\\n f = open('user.out', 'w')\\n iterator = map(loads, stdin)\\n while True:\\n try:\\n nums = next(iterator)\\n # k = next(iterator)\\n except StopIteration:\\n break\\n\\n print(solution.findMaxLength(nums), file=f) \\n\\nsolution = Solution()\\nsolve()\\nexit()\",\n \"runtime\": \"181\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum = [0]\\n for i in range(len(nums)):\\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\\n hashTable = {}\\n longest = 0 \\n for i in range(len(prefixSum)):\\n if prefixSum[i] in hashTable:\\n longest = max(longest, i-hashTable[prefixSum[i]])\\n else:\\n hashTable[prefixSum[i]] = i\\n return longest\\ndef solve():\\n f = open('user.out', 'w')\\n iterator = map(loads, stdin)\\n while True:\\n try:\\n nums = next(iterator)\\n # k = next(iterator)\\n except StopIteration:\\n break\\n\\n print(solution.findMaxLength(nums), file=f) \\n\\nsolution = Solution()\\nsolve()\\nexit()\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum = [0]\\n for i in range(len(nums)):\\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\\n hashTable = {}\\n longest = 0 \\n for i in range(len(prefixSum)):\\n if prefixSum[i] in hashTable:\\n longest = max(longest, i-hashTable[prefixSum[i]])\\n else:\\n hashTable[prefixSum[i]] = i\\n return longest\\ndef solve():\\n f = open('user.out', 'w')\\n iterator = map(loads, stdin)\\n while True:\\n try:\\n nums = next(iterator)\\n # k = next(iterator)\\n except StopIteration:\\n break\\n\\n print(solution.findMaxLength(nums), file=f) \\n\\nsolution = Solution()\\nsolve()\\nexit()\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums):\\n counts = {0: -1}\\n c = 0\\n m = 0\\n for i, x in enumerate(nums):\\n c += -1 if x == 0 else 1\\n s = counts.setdefault(c, i)\\n if i - s > m:\\n m = i - s\\n return m\\n\\n\",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n dic = {0: -1}\\n lookup = [-1, 1]\\n acc = 0\\n maxLength = 0\\n for i in range(len(nums)):\\n acc += lookup[nums[i]]\\n if acc not in dic:\\n dic[acc] = i\\n elif i - dic[acc] > maxLength:\\n maxLength = i - dic[acc]\\n return maxLength\",\n \"runtime\": \"208\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n ans = 0\\n sum_n = 0\\n dict_idx_sum = {0:-1}\\n l = len(nums)\\n for i in range(l):\\n if nums[i] == 0:\\n sum_n -=1\\n else:\\n sum_n +=1\\n \\n if sum_n not in dict_idx_sum:\\n dict_idx_sum[sum_n] = i\\n else:\\n val = i-dict_idx_sum[sum_n]\\n if val>ans:\\n ans = val\\n return ans\\n # if sum_n == 0:\\n # min_z = min(min_z, i)\\n # max_z = max(max_z, i)\\n # return max_z-min_z+1\\n \",\n \"runtime\": \"214\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n curr_count = 0\\n tracker = {0: -1}\\n curr_max = 0\\n for i in range(0, len(nums)):\\n if nums[i] == 1:\\n curr_count += 1\\n elif nums[i] == 0:\\n curr_count -= 1\\n if curr_count not in tracker:\\n tracker[curr_count] = i \\n elif i - tracker[curr_count] > curr_max:\\n curr_max = i - tracker[curr_count]\\n return curr_max\",\n \"runtime\": \"221\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n max_len = 0\\n pre = 0\\n prev = {0: -1}\\n mp = [-1,1]\\n for i,n in enumerate(nums):\\n pre+=mp[n]\\n if pre not in prev:\\n prev[pre] = i\\n else:\\n if i-prev[pre] > max_len:\\n max_len = i-prev[pre]\\n return max_len\",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counts = {0: -1}\\n curr = 0\\n ans = 0\\n for idx, i in enumerate(nums):\\n curr += -1 if i == 0 else 1\\n default = counts.setdefault(curr, idx)\\n if idx - default > ans:\\n ans = idx - default\\n return ans\",\n \"runtime\": \"234\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n\\n count = defaultdict(list)\\n c = 0\\n maxl = 0\\n for i, num in enumerate(nums):\\n if num == 0:\\n c -= 1\\n else:\\n c += 1\\n count[c].append(i)\\n for key in count:\\n maxl = max(maxl, count[key][-1] - count[key][0])\\n if key == 0:\\n maxl = max(maxl, count[key][-1] + 1)\\n return maxl\\n\\n\\n \\n \\n\\n\\n\\n \",\n \"runtime\": \"241\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counter,max = 0,0\\n dict = {0:-1}\\n for i in range(len(nums)):\\n if nums[i] == 1:\\n counter+=1\\n else:\\n counter-=1\\n if counter in dict:\\n temp = i-dict[counter]\\n if temp > max:\\n max=temp\\n else:\\n dict[counter] = i\\n\\n return max\\n\\n\\n \\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n dic = defaultdict(list)\\n dic[0] = [-1]\\n sum = 0\\n for i in range(len(nums)): \\n if nums[i]:\\n sum+=1\\n else: \\n sum-=1\\n dic[sum].append(i)\\n ans = 0\\n for k in dic: \\n ans = max(ans, dic[k][-1]-dic[k][0])\\n return ans\\n\\n \",\n \"runtime\": \"254\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n net_cnt = defaultdict(list)\\n net = 0\\n net_cnt[net].append(-1)\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n net += 1\\n else:\\n net -= 1\\n net_cnt[net].append(i)\\n max_len = 0\\n for diff in net_cnt.values():\\n max_len = max(max_len, diff[-1] - diff[0])\\n return max_len\",\n \"runtime\": \"261\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n som, res = 0, 0\\n first, last = {}, {}\\n \\n for idx in range(len(nums)):\\n \\n if nums[idx] == 1:\\n som += 1\\n if nums[idx] == 0:\\n som -= 1\\n \\n if not som in first:\\n first[som] = idx\\n else:\\n last[som] = idx\\n \\n if som == 0:\\n res = max(res,idx+1)\\n \\n for idx in last:\\n res = max(res,last[idx]-first[idx])\\n \\n return res\\n \",\n \"runtime\": \"268\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums):\\n c = m = 0\\n counts = {c: -1}\\n for i, x in enumerate(nums):\\n c += -1 if x == 0 else 1\\n s = counts.setdefault(c, i)\\n if i - s > m:\\n m = i - s\\n return m\\n\\n\",\n \"runtime\": \"274\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # Hash map to store the first occurrence of each running sum\\n sum_indices = {0: -1} # Start with sum 0 at index -1\\n max_len = 0\\n running_sum = 0\\n start = end = 0 # Initialize pointers\\n\\n for i in range(len(nums)):\\n # Update running_sum: treat 0 as -1, 1 as +1\\n running_sum += -1 if nums[i] == 0 else 1\\n\\n if running_sum in sum_indices:\\n # Calculate current subarray length\\n curr_len = i - sum_indices[running_sum]\\n if curr_len > max_len:\\n max_len = curr_len\\n start = sum_indices[running_sum] + 1\\n end = i\\n else:\\n # Store the first occurrence of the running sum\\n sum_indices[running_sum] = i\\n\\n # If needed, return the subarray as nums[start:end+1]\\n return max_len # Or return (max_len, start, end)\\n\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n \\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \",\n \"runtime\": \"288\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum = 0\\n max_dis = 0\\n tracker = {}\\n for i, num in enumerate(nums):\\n if num == 0:\\n sum -= 1\\n else:\\n sum += 1\\n if sum == 0:\\n max_dis = i + 1\\n continue\\n if sum not in tracker:\\n tracker[sum] = i\\n else:\\n found_dis = i - tracker[sum]\\n if found_dis > max_dis:\\n max_dis = found_dis\\n return max_dis\\n\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n ans = 0\\n first_index = {}\\n first_index[0] = -1\\n count = 0\\n for i, d in enumerate(nums):\\n if d == 1:\\n count += 1\\n else:\\n count -= 1\\n if count in first_index:\\n subarray_length = i - first_index[count]\\n if subarray_length > ans:\\n ans = subarray_length\\n else:\\n first_index[count] = i\\n \\n return ans\\n\",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n i = cnt = ans = 0\\n d={0:-1}\\n while i<len(nums):\\n if nums[i]==0:\\n cnt+=1\\n else:\\n cnt-=1\\n\\n if cnt not in d:\\n d[cnt] = i\\n elif i-d[cnt] > ans:\\n ans = i - d[cnt]\\n i += 1\\n del d\\n return ans\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums):\\n counts = {0: -1}\\n c = 0\\n m = 0\\n for i, x in enumerate(nums):\\n c += -1 if x == 0 else 1\\n s = counts.setdefault(c, i)\\n if i - s > m:\\n m = i - s\\n return m\\n\\n\",\n \"runtime\": \"314\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counter = 0\\n count_dict = defaultdict(int)\\n count_dict[0] = 0\\n result = 0\\n num_i = 0\\n \\n for i in nums:\\n num_i+=1\\n if i == 1:\\n counter+=1\\n else:\\n counter-=1\\n \\n if counter in count_dict:\\n check_val = num_i - count_dict[counter]\\n if check_val > result:\\n result = check_val\\n else:\\n count_dict[counter] = num_i\\n \\n return result\",\n \"runtime\": \"321\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n \\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n \\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum = 0\\n max_dis = 0\\n sum_nums = []\\n tracker = {}\\n for i, num in enumerate(nums):\\n if num == 0:\\n sum -= 1\\n else:\\n sum += 1\\n if sum == 0:\\n max_dis = i + 1\\n continue\\n if sum not in tracker:\\n tracker[sum] = i\\n else:\\n found_dis = i - tracker[sum]\\n if found_dis > max_dis:\\n max_dis = found_dis\\n return max_dis\\n\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum2MinPosition = {0: -1}\\n prefixSum = 0\\n result = 0\\n\\n for index in range(0, len(nums)):\\n if nums[index] == 0:\\n prefixSum -= 1\\n else:\\n prefixSum += 1\\n \\n if prefixSum in prefixSum2MinPosition:\\n if index - prefixSum2MinPosition[prefixSum] > result:\\n result = index - prefixSum2MinPosition[prefixSum]\\n else:\\n prefixSum2MinPosition[prefixSum] = index\\n return result\",\n \"runtime\": \"341\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums):\\n counts = {0: -1}\\n c = 0\\n m = 0\\n for i, x in enumerate(nums):\\n c += -1 if x == 0 else 1\\n s = counts.setdefault(c, i)\\n if i != s and i - s > m:\\n m = i - s\\n return m\\n\\n\",\n \"runtime\": \"348\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n before = current = 0\\n dict_ = {0: [0, 0]}\\n for i, num in enumerate(nums, 1):\\n current = before + (1 if num else -1)\\n before = current\\n if current not in dict_:\\n dict_[current] = [i, i]\\n else:\\n dict_[current][1] = i\\n\\n best_len = 0\\n for begin, end in dict_.values():\\n best_len = max(best_len, end - begin)\\n\\n return best_len\",\n \"runtime\": \"354\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n cuma = []\\n cumasum = 0\\n for n in nums:\\n if n == 1:\\n cumasum += 1\\n else:\\n cumasum -= 1\\n cuma.append(cumasum)\\n\\n best = 0\\n seen = {0: -1}\\n for (j, c) in enumerate(cuma):\\n if c in seen:\\n i = seen[c]\\n if j - i > best:\\n best = j - i\\n else:\\n seen[c] = j\\n return best\\n \\n\",\n \"runtime\": \"361\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n longest_subarray = 0#[0,0,0,1,1,1]\\n sum1 = 0\\n hash_table={}\\n n = len(nums)\\n for i in range(n): #0,1,2,3,4,5\\n #sum1 = sum1 + nums[i] if nums[i] == 1 else -1 #-1,-2,-3,-2,-1,0\\n if nums[i] == 0:\\n sum1-=1\\n else:\\n sum1 +=1\\n if (sum1 == 0):\\n if longest_subarray < i+1:\\n longest_subarray = i+1\\n elif sum1 in hash_table.keys():\\n if longest_subarray < i - hash_table[sum1]: #3-1,4-0\\n longest_subarray = i -hash_table[sum1] #2,4\\n else:\\n hash_table[sum1]= i #{-1:0,-2:1,-3:2}\\n \\n return longest_subarray\\n\",\n \"runtime\": \"368\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum = 0\\n max_dis = 0\\n sum_nums = []\\n for i, num in enumerate(nums):\\n if num == 0:\\n sum -= 1\\n else:\\n sum += 1\\n sum_nums.append(sum)\\n if sum == 0:\\n max_dis = i + 1\\n tracker = {}\\n for i, sum in enumerate(sum_nums):\\n if sum not in tracker:\\n tracker[sum] = i\\n else:\\n found_dis = i - tracker[sum]\\n if found_dis > max_dis:\\n max_dis = found_dis\\n return max_dis\\n\",\n \"runtime\": \"374\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {0:-1}\\n length = 0\\n total = 0\\n for i in range(len(nums)):\\n if nums[i]== 0:\\n total+=-1\\n else:\\n total+=1\\n nums[i] = total\\n if nums[i] not in d:\\n d[nums[i]] = i\\n else:\\n if i - d[nums[i]] > length:\\n length = i - d[nums[i]]\\n\\n return length\\n \",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # prefix sum\\n # change values\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n nums[i] = -1\\n else:\\n nums[i] = 1\\n maxLen = 0\\n curSum = 0\\n hashMap = {}\\n for i in range(len(nums)):\\n curSum = curSum + nums[i]\\n \\n if curSum == 0:\\n maxLen = i + 1\\n \\n if curSum in hashMap:\\n if maxLen < i - hashMap[curSum]:\\n maxLen = i - hashMap[curSum]\\n else:\\n hashMap[curSum] = i\\n\\n return maxLen\\n \",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n \\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"388\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # SLIDING WINDOW - Not Working \\n # i, j, ans, csum = 0, 0, 0, 0\\n # n = len(nums)\\n # while j < n:\\n # csum += (1 if nums[j] == 1 else -1) \\n # while csum != 0 and i <= j:\\n # csum -= (1 if nums[i] == 1 else -1)\\n # i += 1\\n # if csum == 0:\\n # ans = max(ans, j-i+1)\\n \\n # if csum == 0:\\n # ans = max(ans, j-i+1)\\n # j += 1\\n \\n # return ans \\n\\n # HASH MAP + CURR SUM\\n count = 0 \\n hmap = {0: -1}\\n n = len(nums)\\n ans = 0 \\n for i in range(n):\\n if nums[i] == 0:\\n count -= 1\\n else:\\n count += 1\\n if count in hmap:\\n ans = max(ans, i - hmap[count])\\n else:\\n hmap[count] = i \\n return ans \\n\\n \\n \",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n\\n res = 0\\n delta = [0]\\n record = {}\\n\\n for idx in range(len(nums)):\\n\\n if nums[idx] == 0:\\n new_delta = delta[idx] - 1\\n else:\\n new_delta = delta[idx] + 1\\n\\n delta.append(new_delta)\\n\\n if new_delta not in record:\\n record[new_delta] = idx\\n else:\\n if res < (idx - record[new_delta]):\\n res = idx - record[new_delta]\\n\\n if delta[idx + 1] == 0:\\n res = idx + 1\\n \\n return res\",\n \"runtime\": \"401\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {}\\n length = 0\\n total = 0\\n for i in range(len(nums)):\\n if nums[i]== 0:\\n total+=-1\\n else:\\n total+=1\\n nums[i] = total\\n if nums[i] not in d:\\n d[nums[i]] = i\\n else:\\n if i - d[nums[i]] > length:\\n length = i - d[nums[i]]\\n if nums[i] == 0:\\n if i > length:\\n length = i+1\\n\\n\\n return length\\n \\n\\n\\n\\n\\n return 0\\n\\n \",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n \\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n longest_subarray = 0#[0,0,0,1,1,1]\\n sum1 = 0\\n hash_table={}\\n n = len(nums)\\n for i in range(n): #0,1,2,3,4,5\\n #sum1 = sum1 + nums[i] if nums[i] == 1 else -1 #-1,-2,-3,-2,-1,0\\n if nums[i] == 0:\\n sum1-=1\\n else:\\n sum1 +=1\\n if (sum1 == 0):\\n if longest_subarray < i+1:\\n longest_subarray = i+1\\n elif sum1 in hash_table.keys():\\n if longest_subarray < i - hash_table[sum1]: #3-1,4-0\\n longest_subarray = i -hash_table[sum1] #2,4\\n else:\\n hash_table[sum1]= i #{-1:0,-2:1,-3:2}\\n \\n return longest_subarray\\n\",\n \"runtime\": \"415\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {}\\n length = 0\\n total = 0\\n for i in range(len(nums)):\\n if nums[i]== 0:\\n total+=-1\\n else:\\n total+=1\\n nums[i] = total\\n if nums[i] not in d:\\n d[nums[i]] = i\\n else:\\n if i - d[nums[i]] > length:\\n length = i - d[nums[i]]\\n if nums[i] == 0:\\n if i > length:\\n length = i+1\\n\\n\\n return length\\n \\n\\n\\n\\n\\n return 0\\n\\n \",\n \"runtime\": \"421\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n\\n max_len = 0\\n prefix_sum_map = {0: -1}\\n prefix_sum = 0\\n\\n for i in range(len(nums)):\\n prefix_sum += 1 if nums[i] == 1 else -1\\n\\n if prefix_sum in prefix_sum_map:\\n max_len = max(max_len, i - prefix_sum_map[prefix_sum])\\n else:\\n prefix_sum_map[prefix_sum] = i\\n \\n return max_len\\n\\n\\n \\n\",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n pre = {0: -1}\\n s = 0\\n mm = 0\\n for idx, n in enumerate(nums):\\n if n == 0:\\n s -= 1\\n else:\\n s += 1\\n if s in pre:\\n tmp = idx - pre[s]\\n if tmp > mm:\\n mm = tmp\\n else:\\n pre[s] = idx\\n return mm\\n \",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counts = {}\\n total = 0\\n best = 0\\n\\n for i, n in enumerate(nums):\\n if n == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n if total == 0:\\n best = i+1\\n elif total in counts:\\n best = max(best, i - counts[total])\\n else:\\n counts[total] = i\\n \\n return best\",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n i = cnt = ans = 0\\n d={0:-1}\\n while i<len(nums):\\n\\n if nums[i]==0:\\n cnt+=1\\n else:\\n cnt-=1\\n\\n if cnt not in d:\\n d[cnt] = i\\n elif i-d[cnt] > ans:\\n ans = i - d[cnt]\\n i += 1\\n return ans\",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n dic = {}\\n ans = 0\\n count = 0\\n for index, num in enumerate(nums):\\n count += 1 if num == 1 else -1\\n \\n if count == 0:\\n ans = index + 1\\n elif count in dic:\\n ans = max(ans, index - dic[count])\\n else:\\n dic[count] = index\\n return ans\",\n \"runtime\": \"448\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefix = {0: -1}\\n\\n num_zeroes = 0\\n num_ones = 0\\n result = 0\\n for index, value in enumerate(nums):\\n if value == 0:\\n num_zeroes += 1\\n else:\\n num_ones += 1\\n \\n diff = num_zeroes - num_ones\\n \\n if diff in prefix and index - prefix[diff] > result:\\n result = index - prefix[diff]\\n\\n if diff not in prefix:\\n prefix[diff] = index\\n return result\\n\\n\",\n \"runtime\": \"455\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum_map = {}\\n\\n n = len(nums)\\n\\n curr_sum = 0\\n max_length = 0\\n for i in range(n):\\n if nums[i] == 0:\\n curr_sum -= 1\\n else:\\n curr_sum += 1\\n\\n if curr_sum == 0:\\n max_length = i + 1\\n\\n if curr_sum in sum_map:\\n max_length = max(max_length, i - sum_map[curr_sum])\\n else:\\n sum_map[curr_sum] = i\\n\\n return max_length\\n\\n \",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"'''\\nInput: binary array nums: List[int]\\nOutput: max len of a subarray with an equal num of 0 and 1: int\\n\\nclarify:\\n- nums[i] is only 0 or 1\\n- nums length? 1 to 10^5\\n\\nexamples:\\nnums = [0,1,1,1,0,0,1,0] -> 4\\nnums = [1] -> 0\\nnums = [1,1] -> 0\\n\\napproaches:\\n1. brute force\\nnums = [0,1,1,1,0,0,1,0] -> 4\\n i j\\ncheck all the subarrays if they are evenly distributed\\nthen update the max length\\nT: O(n^2), S: O(1)\\n\\n2. count_index_map\\nnums = [1,0,1,1,0,0,1,0] -> 6\\n i\\ncreate count_index_map to store indices of each count. \\nhere count means how many more 1s than 0s -> [1,0,0] -> -1, [0,1,1] -> 1\\niterate nums -> when count was recorded in map -> meaning 0s and 1s are even -> update max_len\\nif count is not 0 -> update count_index_map\\n\\ni = 1\\ncount_index_map = {0: -1, 1:0}\\ncount = 0 in map -> i - map[count] = 1 - (-1) = 2\\n\\ni = 4\\ncount_index_map = {0: -1, 1:0, 2:3}\\ncount = 1 in map -> i - map[count] = 4 - 0 = 4\\n\\nT: O(n), S: O(n)\\n'''\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n count_index_map = {0: -1}\\n count, max_len = 0, 0\\n for i in range(len(nums)):\\n if nums[i] == 1:\\n count += 1\\n else:\\n count -= 1\\n if count in count_index_map:\\n max_len = max(max_len, i - count_index_map[count])\\n else:\\n count_index_map[count] = i\\n return max_len\\n \",\n \"runtime\": \"461\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # count = 0: This variable tracks the cumulative difference between the number of 1s and 0s.\\n count_map = dict()\\n count_map[0] = - 1 # store count and index\\n maxlen = 0\\n count= 0\\n for i in range(len(nums)):\\n if nums[i] == 1:\\n count += 1\\n else:\\n count -= 1\\n\\n if count in count_map:\\n maxlen = max(maxlen, i - count_map[count])\\n else:\\n count_map[count] = i\\n\\n\\n return maxlen\",\n \"runtime\": \"468\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self,nums):\\n sum_index_map = {0:-1}\\n max_length = 0\\n cum_sum = 0\\n\\n for i,num in enumerate(nums):\\n cum_sum += 1 if num == 1 else -1\\n if cum_sum in sum_index_map:\\n max_length = max(max_length,i-sum_index_map[cum_sum])\\n else:\\n sum_index_map[cum_sum] = i\\n return max_length \",\n \"runtime\": \"475\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n count = 0\\n max_length=0\\n table = {0: 0}\\n for index, num in enumerate(nums,1):\\n if num == 0:\\n count -= 1\\n else:\\n count += 1\\n \\n if count in table:\\n max_length = max(max_length, index - table[count])\\n else:\\n table[count] = index\\n \\n return max_length\",\n \"runtime\": \"481\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counts = {0:-1}\\n runningLength = maxLength = 0 \\n for i, num in enumerate(nums):\\n runningLength += 1 if num == 1 else -1 \\n if runningLength in counts:\\n maxLength = max(maxLength, i - counts[runningLength])\\n else:\\n counts[runningLength] = i \\n return maxLength \",\n \"runtime\": \"481\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n map = {0:-1}\\n count = 0\\n maxCount = 0\\n\\n for i in range(len(nums)):\\n num = nums[i]\\n if num == 0:\\n count -= 1\\n else:\\n count += 1\\n if count in map:\\n maxCount = max(maxCount, i - map[count])\\n else:\\n map[count] = i\\n \\n return maxCount\",\n \"runtime\": \"488\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n dic = { 0: -1 }\\n ans = count = 0\\n for i in range(len(nums)):\\n num = nums[i]\\n if num == 0:\\n count -= 1\\n if num == 1:\\n count += 1\\n if count in dic:\\n ans = max(ans, i - dic[count])\\n else:\\n dic[count] = i\\n return ans\",\n \"runtime\": \"495\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counts = {0:-1}\\n diff = 0\\n mx = 0\\n for i,n in enumerate(nums):\\n diff += n*2-1\\n if diff in counts:\\n # print(\\\"Already in\\\")\\n mx = max(i - counts[diff], mx)\\n else:\\n # print(\\\"Not in\\\")\\n counts[diff] = i\\n # print(mx, diff, counts, i)\\n return mx\",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if sum(nums)*2 == len(nums):\\n return len(nums)\\n balance, result = 0, 0\\n hashMap = {}\\n hashMap[0] = -1\\n for i in range(0, len(nums)):\\n if nums[i] == 0:\\n balance -= 1\\n else:\\n balance += 1\\n if not balance in hashMap:\\n hashMap[balance] = i\\n else:\\n result = max(result, i - hashMap[balance])\\n return result\\n\\n\",\n \"runtime\": \"515\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n first_diff = {0:-1}\\n diff = 0 # Number of 1 - number of 0\\n ans = 0 \\n for i, vi in enumerate(nums):\\n if vi == 1:\\n diff+=1\\n else:\\n diff-=1\\n if diff in first_diff:\\n ans = max(ans,i-first_diff[diff])\\n else:\\n first_diff[diff] = i\\n return ans\\n\",\n \"runtime\": \"515\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n map = {}\\n map[0] = -1\\n maxLen = count = 0\\n for i in range(len(nums)):\\n count += 1 if nums[i] == 1 else -1\\n if count in map:\\n maxLen = max(maxLen, i - map[count])\\n else:\\n map[count] = i\\n return maxLen\",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counts = { 0: -1 }\\n result = running = 0\\n for i, num in enumerate(nums):\\n diff = 1 if num == 1 else -1\\n running += diff\\n \\n if running in counts:\\n result = max(result, i - counts[running])\\n else:\\n counts[running] = i\\n \\n return result\\n \\n \\n \\\"\\\"\\\"\\n \\n \\n 1,1,0,1,1,0,1\\n counts = {\\n 0: -1,\\n 1: 0,\\n 2: 1,\\n 3: ,\\n \\n \\n }\\n {0: -1, 1: 0, 2: 1, 3: 4}\\n running = 1\\n \\\"\\\"\\\"\",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n nums_hash = {}\\n count = ans = 0\\n\\n for i, num in enumerate(nums):\\n count += 1 if num == 1 else -1\\n if count == 0:\\n ans = i + 1\\n elif count in nums_hash:\\n ans = max(ans, i - nums_hash[count])\\n else:\\n nums_hash[count] = i\\n \\n return ans\",\n \"runtime\": \"528\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n longest_array = {}\\n sum_val = 0\\n max_len = 0\\n for i in range(len(nums)):\\n if nums[i] == 1:\\n sum_val += 1\\n else:\\n sum_val -= 1\\n if sum_val == 0:\\n max_len = i + 1\\n elif sum_val in longest_array:\\n max_len = max(max_len, i - longest_array[sum_val])\\n else:\\n longest_array[sum_val] = i\\n return max_len\\n\\n\\n \",\n \"runtime\": \"535\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\\"\\\"\\\"\\n sum(x, y) = 0\\n sum(x, y) = sum(0, y) - sum(0, x-1)= 0\\n sum(0, y) = sum(0, x-1)\\n\\n \\\"\\\"\\\"\\n prefix_sum_map = {0:-1}\\n longest = 0\\n prefix_sum = 0\\n for i in range(len(nums)):\\n prefix_sum += (1 if nums[i] == 1 else -1)\\n if prefix_sum in prefix_sum_map:\\n longest = max(longest, i - prefix_sum_map[prefix_sum])\\n else:\\n prefix_sum_map[prefix_sum] = i\\n return longest\\n\",\n \"runtime\": \"535\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n count = [0]*(len(nums)+1) \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n count[idx+1] = total\\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"541\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n running_sum = 0\\n dic = {}\\n result = 0\\n \\n for i in range(len(nums)):\\n running_sum = running_sum + 1 if nums[i] == 1 else running_sum - 1\\n \\n if running_sum == 0:\\n result = i + 1\\n elif running_sum in dic:\\n result = max(result, i - dic[running_sum])\\n else:\\n dic[running_sum] = i\\n return result\",\n \"runtime\": \"541\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sumToIndex = {}\\n res = 0\\n currSum = 0\\n for i, num in enumerate(nums):\\n if num:\\n currSum += 1\\n else:\\n currSum -= 1\\n if currSum == 0:\\n res = max(res, i + 1)\\n if currSum in sumToIndex:\\n res = max(res, i - sumToIndex[currSum])\\n else:\\n sumToIndex[currSum] = i\\n return res\\n \",\n \"runtime\": \"548\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n map = {}\\n maxLen = count = 0\\n for i in range(len(nums)):\\n count += 1 if nums[i] == 1 else -1\\n if count == 0:\\n maxLen = i + 1\\n elif count in map:\\n maxLen = max(maxLen, i - map[count])\\n else:\\n map[count] = i\\n return maxLen\",\n \"runtime\": \"548\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n earlest_index = {}\\n result = 0\\n s = 0\\n for index, num in enumerate(nums):\\n if num == 1:\\n s += 1\\n else:\\n s -= 1\\n if s == 0:\\n result = index + 1\\n else:\\n if s in earlest_index:\\n result = max(result, index-earlest_index[s])\\n else:\\n earlest_index[s] = index\\n return result\",\n \"runtime\": \"555\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n count_dict = defaultdict(int)\\n count_dict[0] = 0\\n \\n total = 0\\n max_window_size = 0\\n \\n for idx, num in enumerate(nums, start=1):\\n total += 1 if num == 1 else -1\\n \\n if total in count_dict:\\n max_window_size = max(max_window_size, idx - count_dict[total])\\n else:\\n count_dict[total] = idx\\n \\n return max_window_size\\n\",\n \"runtime\": \"561\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n n = len(nums)\\n count_dict = {0:-1}\\n count = 0\\n res = 0\\n for i in range(n):\\n if nums[i] == 1:\\n count += 1\\n else:\\n count -= 1\\n if count in count_dict:\\n res = max(res, i - count_dict[count])\\n else:\\n count_dict[count] = i\\n return res\\n \\n \",\n \"runtime\": \"568\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n m = {}\\n m[0] = -1\\n res = 0\\n count = 0\\n for i in range(len(nums)):\\n\\n if nums[i] == 0:\\n count -= 1\\n else:\\n count += 1\\n\\n if count in m:\\n res = max(res, i - m[count])\\n else:\\n m[count] = i\\n \\n return res\\n\",\n \"runtime\": \"568\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n current_sum = 0\\n res = 0\\n diff_index = {0: -1}\\n\\n for i, n in enumerate(nums):\\n if n == 0:\\n current_sum -= 1\\n else:\\n current_sum += 1\\n \\n if current_sum in diff_index:\\n res = max(res, i - diff_index[current_sum])\\n else:\\n diff_index[current_sum] = i\\n \\n return res\\n \",\n \"runtime\": \"575\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n c = {}\\n c[0]=-1\\n s=0\\n ans = 0\\n for idx, n in enumerate(nums):\\n s+=(1 if n==1 else -1)\\n if s in c:\\n ans = max(ans, idx - c[s])\\n else:\\n c[s]=idx\\n return ans\\n \",\n \"runtime\": \"575\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n dictionary = defaultdict(int)\\n dictionary[0] = -1\\n ret = 0\\n count = 0\\n for key, num in enumerate(nums):\\n if num == 1:\\n count += 1\\n else:\\n count -= 1\\n \\n if count in dictionary:\\n ret = max(ret, key-dictionary[count])\\n else:\\n dictionary[count] = key\\n \\n return ret \\n \",\n \"runtime\": \"581\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n\\n if len(nums) == 0:\\n return -1\\n \\n count_index_map = {0 : -1}\\n max_len = 0\\n count = 0\\n\\n for index in range(len(nums)):\\n if nums[index] == 0:\\n count-=1\\n else:\\n count+=1\\n \\n\\n if count in count_index_map:\\n curr_len = index - count_index_map[count]\\n max_len = max(max_len, curr_len)\\n else:\\n count_index_map[count] = index\\n\\n\\n return max_len\\n \",\n \"runtime\": \"581\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n hashMap = defaultdict(int)\\n hashMap[0] = -1\\n\\n maxLen = 0\\n count = 0\\n\\n for key, num in enumerate(nums):\\n if num == 1:\\n count += 1\\n else:\\n count -= 1\\n\\n if count in hashMap:\\n maxLen = max(maxLen, key - hashMap[count])\\n else:\\n hashMap[count] = key\\n\\n return maxLen \",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # Count positively all the 1s, negatively all the zeros, and\\n # whenever there are two indices that have the same count, that\\n # stretch has the same number of ones and zeros.\\n \\n # Create a map representing the earliest index having\\n # a particular count\\n map = {}\\n \\n # No length so far, and no count\\n maxLen = count = 0\\n for i in range(len(nums)):\\n count += 1 if nums[i] == 1 else -1\\n if count == 0:\\n # Here we found another index where the whole\\n # string has equal count of 1s and 0s, so the\\n # whole string to this point must be the longest\\n maxLen = i + 1\\n elif count in map:\\n # We found another index with the same count that\\n # is not zero, so let's find that index and the index\\n # difference is the longest equal length stretch.\\n maxLen = max(maxLen, i - map[count])\\n else:\\n # This is the first time we have seen this count, so\\n # record it in case we come across it again.\\n map[count] = i\\n return maxLen\",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if nums[0] == 0:\\n prefixed_list = [0]\\n prefixed_sum = 0\\n else:\\n prefixed_list = [1]\\n prefixed_sum = 1\\n number_appeared = 1\\n for i in nums:\\n if i == 0:\\n prefixed_sum -= 1\\n else:\\n prefixed_sum += 1\\n \\n prefixed_list.append(prefixed_sum)\\n \\n count_dict = defaultdict(int)\\n maximum_length = 0\\n for i in range(len(prefixed_list)):\\n if prefixed_list[i] not in count_dict:\\n count_dict[prefixed_list[i]] = i\\n else:\\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\\n return maximum_length\\n \\n \\n \",\n \"runtime\": \"595\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n balance, result = 0, 0\\n hashMap = {}\\n hashMap[0] = -1\\n for i in range(0, len(nums)):\\n if nums[i] == 0:\\n balance -= 1\\n else:\\n balance += 1\\n if not balance in hashMap:\\n hashMap[balance] = i\\n else:\\n result = max(result, i - hashMap[balance])\\n return result\\n\\n\",\n \"runtime\": \"595\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n hmp = {}\\n sum_val = 0\\n max_len = 0\\n for i,val in enumerate(nums):\\n sum_val += 1 if val==1 else -1\\n if sum_val==0:\\n max_len = i+1\\n elif sum_val in hmp:\\n max_len = max(max_len,i-hmp[sum_val])\\n else:\\n hmp[sum_val] = i\\n return max_len\",\n \"runtime\": \"601\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n n=len(nums)\\n ans=0\\n sum=0\\n\\n dic={}\\n dic[0]=-1\\n\\n for i in range(n):\\n if nums[i]==0:sum+=-1\\n else : sum+=1\\n \\n\\n if sum in dic:\\n ans=max(ans,i-dic[sum])\\n else: dic[sum]=i\\n return ans\\n \",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n\\n d = {}\\n max_len = 0\\n curr_sum = 0\\n\\n for i in range(len(nums)):\\n\\n if nums[i] == 0:\\n curr_sum -= 1\\n\\n else:\\n curr_sum += 1\\n \\n if curr_sum == 0:\\n max_len = i + 1\\n \\n elif curr_sum in d:\\n max_len = max(max_len, i - d[curr_sum])\\n \\n else:\\n d[curr_sum] = i\\n \\n return max_len\",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum_index_map = {0: -1}\\n cumulative_sum = 0\\n max_length = 0\\n \\n for i in range(len(nums)):\\n # Increment cumulative sum for 1, decrement for 0\\n if nums[i] == 1:\\n cumulative_sum += 1\\n else:\\n cumulative_sum -= 1\\n \\n if cumulative_sum in sum_index_map:\\n # If the cumulative sum has been seen before, calculate the length of the subarray\\n subarray_length = i - sum_index_map[cumulative_sum]\\n max_length = max(max_length, subarray_length)\\n else:\\n # Store the first occurrence of the cumulative sum\\n sum_index_map[cumulative_sum] = i\\n \\n return max_length\\n\\n \",\n \"runtime\": \"615\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n valid_map = {0:-1}\\n ans = count = 0\\n for i,n in enumerate(nums):\\n if n ==1:\\n count+=1\\n else:\\n count-=1\\n\\n if count in valid_map:\\n ans = max(ans, abs(valid_map[count] - i))\\n else:\\n valid_map[count] = i\\n \\n return ans\\n\\n\",\n \"runtime\": \"615\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefix = {}\\n valsum = 0\\n lmax = 0\\n for i,n in enumerate(nums):\\n valsum += 1 if n == 1 else -1\\n \\n if valsum == 0:\\n lmax = i + 1\\n elif valsum in prefix:\\n lmax = max(lmax, i - prefix[valsum])\\n else:\\n prefix[valsum] = i\\n\\n return lmax\",\n \"runtime\": \"621\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if nums[0] == 0:\\n prefixed_list = [0]\\n prefixed_sum = 0\\n else:\\n prefixed_list = [1]\\n prefixed_sum = 1\\n number_appeared = 1\\n for i in nums:\\n if i == 0:\\n prefixed_sum -= 1\\n else:\\n prefixed_sum += 1\\n \\n prefixed_list.append(prefixed_sum)\\n \\n count_dict = defaultdict(int)\\n maximum_length = 0\\n for i in range(len(prefixed_list)):\\n if prefixed_list[i] not in count_dict:\\n count_dict[prefixed_list[i]] = i\\n else:\\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\\n return maximum_length\\n \\n \\n \",\n \"runtime\": \"621\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n prefix_sum = {0 : -1}\\n curr = 0 \\n res = 0\\n for i in range(len(nums)):\\n curr = curr + (1 if nums[i] == 1 else -1)\\n diff = curr \\n \\n if diff in prefix_sum:\\n res = max(res, i - prefix_sum[diff])\\n if curr not in prefix_sum:\\n prefix_sum[curr] = i\\n return res \\n \\n\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"628\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n hmap = {} #diff --> index \\n num0, num1 = 0, 0 \\n result = 0\\n\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n num0 += 1 \\n elif nums[i] == 1:\\n num1 += 1 \\n\\n diff = num1-num0\\n if diff not in hmap:\\n hmap[diff] = i\\n\\n if num1 == num0:\\n result = num1+num0\\n else:\\n result = max(result, i- hmap[diff]) \\n\\n return result \\n\\n\\n\\n \\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"628\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # maybe: preprocess to sum positive ones and zeros as negative ones, the problem then becomes longest subseq sum to zero\\n # that algorithm looks like: \\n\\n # solution posted below:\\n total = 0\\n lookup = {0:-1}\\n max_seq = 0\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n total -= 1\\n else:\\n total += 1\\n\\n # print(total,lookup.keys())\\n if total not in lookup.keys():\\n lookup[total] = i\\n else:\\n max_seq = max(max_seq,i-lookup[total])\\n\\n return max_seq\",\n \"runtime\": \"635\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n zero, one = 0, 0\\n res = 0\\n diff_prefix = {}\\n for i, num in enumerate(nums):\\n if num == 0:\\n zero += 1\\n else:\\n one += 1\\n\\n if zero == one:\\n res = zero + one\\n\\n diff = zero - one\\n if diff in diff_prefix:\\n res = max(res, i - diff_prefix[diff])\\n else:\\n diff_prefix[diff] = i\\n\\n return res\\n\",\n \"runtime\": \"635\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum_to_index = {0:-1}\\n curr = 0\\n maxl=0\\n \\n for i, n in enumerate(nums):\\n curr+=1 if n==1 else -1\\n \\n if curr in sum_to_index:\\n maxl = max(maxl, i-sum_to_index[curr])\\n else:\\n sum_to_index[curr] = i\\n return maxl\",\n \"runtime\": \"641\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {}\\n length = 0\\n total = 0\\n for i in range(len(nums)):\\n if nums[i]== 0:\\n total+=-1\\n else:\\n total+=1\\n nums[i] = total\\n if nums[i] not in d:\\n d[nums[i]] = [i]\\n else:\\n if i - d[nums[i]][0] > length:\\n length = i - d[nums[i]][0]\\n d[nums[i]].append(i)\\n if nums[i] == 0:\\n if i > length:\\n length = i+1\\n\\n\\n return length\\n \\n\\n\\n\\n\\n return 0\\n\\n \",\n \"runtime\": \"641\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counter = 0\\n peaks = []\\n peaktoindex = {}\\n maxlen = 0\\n for i in range(len(nums)):\\n if i == 0: peaks.append(0)\\n else: peaks.append(counter)\\n if nums[i] == 0: counter -=1 \\n else : counter += 1\\n peaks.append(counter)\\n\\n for i in range(len(peaks)):\\n elem = peaks[i]\\n if elem in peaktoindex:\\n start = peaktoindex[elem]\\n maxlen = max(maxlen,i-start)\\n\\n else: peaktoindex[elem] = i\\n return maxlen\\n\\n\\n\\n \\n \",\n \"runtime\": \"648\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {}\\n length = 0\\n total = 0\\n for i in range(len(nums)):\\n if nums[i]== 0:\\n total+=-1\\n else:\\n total+=1\\n nums[i] = total\\n for i in range(len(nums)):\\n if nums[i] not in d:\\n d[nums[i]] = [i]\\n else:\\n if i - d[nums[i]][0] > length:\\n length = i - d[nums[i]][0]\\n d[nums[i]].append(i)\\n if nums[i] == 0:\\n if i > length:\\n length = i+1\\n return length\\n \\n\\n\\n\\n\\n return 0\\n\\n \",\n \"runtime\": \"648\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n answer = 0\\n seen_points = {}\\n count = 0\\n seen_points[len(nums)] = -1\\n for i in range(len(nums)):\\n count += (-1)**(nums[i])\\n \\n if count + len(nums) in seen_points:\\n answer = max(answer, i - seen_points[count + len(nums)])\\n else:\\n seen_points[count + len(nums)] = i\\n print(seen_points)\\n return answer\",\n \"runtime\": \"655\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n #find amount of zeros and ones till i for every i\\n #search for the longest sub s.t #0=#1\\n \\n i = 0\\n sub = 0\\n amounts = {}\\n index_to_sub = {}\\n \\n for x in nums:\\n if x == 1:\\n sub += 1\\n else:\\n sub -= 1\\n if sub not in amounts.keys():\\n amounts[sub] = i\\n \\n index_to_sub[i] = sub\\n i += 1\\n\\n longest = 0\\n \\n for i in range(len(nums)):\\n if index_to_sub[i] == 0:\\n longest = i + 1\\n continue\\n curr = i - amounts[index_to_sub[i]] \\n if curr > longest:\\n longest = curr\\n \\n \\n return longest\\n \\n \\n \\n \\n \\n \\n \\n \",\n \"runtime\": \"655\"\n },\n {\n \"code\": \"'''\\n[0, 1, 0]\\n[0, -1, 0, -1]\\n'''\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sums = [0] * (len(nums) + 1)\\n table = {0: -1} # sum: index\\n max_len = 0\\n\\n for i in range(0, len(nums)):\\n inc = 1 if nums[i] == 1 else -1\\n sums[i + 1] = sums[i] + inc\\n \\n if sums[i + 1] in table:\\n curr_len = i - table[sums[i + 1]]\\n max_len = max(max_len, curr_len)\\n else:\\n table[sums[i + 1]] = i\\n\\n return max_len\\n\\n \",\n \"runtime\": \"661\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {}\\n length = 0\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n nums[i] = -1\\n for i in range(1,len(nums)):\\n nums[i]+= nums[i-1]\\n \\n for i in range(len(nums)):\\n if nums[i] not in d:\\n d[nums[i]] = [i]\\n else:\\n if i - d[nums[i]][0] > length:\\n length = i - d[nums[i]][0]\\n d[nums[i]].append(i)\\n if nums[i] == 0:\\n if i > length:\\n length = i+1\\n return length\\n \\n\\n\\n\\n\\n return 0\\n\\n \",\n \"runtime\": \"661\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n nums=[1 if i==1 else -1 for i in nums]\\n has={}\\n has[0]=-1\\n cur=0\\n ans=0\\n ind=0\\n for i in nums:\\n cur+=i\\n if cur in has:\\n ans=max(ans,ind-has[cur])\\n if cur not in has:\\n has[cur]=ind\\n ind+=1\\n return ans\",\n \"runtime\": \"668\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum = [0]\\n for i in range(len(nums)):\\n prefixSum.append(prefixSum[-1] + {0:-1, 1:1}[nums[i]])\\n hashTable = {}\\n longest = 0 \\n for i in range(len(prefixSum)):\\n if prefixSum[i] in hashTable:\\n longest = max(longest, i-hashTable[prefixSum[i]])\\n else:\\n hashTable[prefixSum[i]] = i\\n return longest\",\n \"runtime\": \"668\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":104,"string":"104"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n ## tackle the cases when half of the elements are 1s\n max_len = len(nums)\n if 2*sum(nums) == max_len:\n return max_len\n\n nums = [x or -1 for x in nums]\n prefix_sum = 0\n hash_map = {0:-1}\n max_len = 0\n for i, num in enumerate(nums):\n prefix_sum += num \n if not prefix_sum in hash_map:\n hash_map[prefix_sum] = i\n else:\n max_len = max(max_len, i-hash_map[prefix_sum])\n return max_len","memory":"18200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if sum(nums)*2 == len(nums):\n return len(nums)\n\n sum_till_now = 0\n sum_dict = {0: -1}\n maximum = float('-inf')\n for i, num in enumerate(nums):\n sum_till_now += num or -1\n sum_dict.setdefault(sum_till_now, i)\n maximum = max(maximum, i-sum_dict[sum_till_now])\n\n return maximum\n\n","memory":"18300"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n nums_len = len(nums)\n if 2*sum(nums) == nums_len:\n return nums_len\n \n hmap = {}\n ans = 0\n psum = 0\n for i,v in enumerate(nums):\n psum += 1 if v==1 else -1\n if psum == 0:\n ans = i + 1 # i is 0 indexed\n else:\n if psum in hmap:\n ans = max(ans, i - hmap[psum])\n else:\n hmap[psum] = i\n return ans","memory":"18400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if sum(nums)*2 == len(nums):\n return len(nums)\n balance, result = 0, 0\n hashMap = {}\n hashMap[0] = -1\n for i in range(0, len(nums)):\n if nums[i] == 0:\n balance -= 1\n else:\n balance += 1\n if not balance in hashMap:\n hashMap[balance] = i\n else:\n result = max(result, i - hashMap[balance])\n return result\n\n","memory":"18500"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n result = 0\n count = 0\n n = len(nums)\n hmap = [\"a\"]*(n+1)\n hmap[0] = -1\n\n for i in range(len(nums)):\n num = nums[i]\n if num == 0:\n count -= 1\n else:\n count += 1\n\n if hmap[count]!=\"a\":\n result = max(result, i - hmap[count])\n else:\n hmap[count] = i\n\n return result\n\n \n \n\n","memory":"19000"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n arr=[-2]*(2*len(nums)+1)\n arr[0]=0\n count=0\n maxLen=0\n for i in range(len(nums)):\n count+= 1 if nums[i] else -1\n if arr[count] >= -1:\n maxLen = max(maxLen,i+1-arr[count])\n continue\n arr[count]=i+1\n return maxLen","memory":"19100"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n res = 0\n n = len(nums)\n lst = [\"*\"]*(n*2+1)\n count = 0\n lst[n] = -1\n for i in range(n):\n if nums[i] == 1:\n count+=1\n else:\n count-=1\n if lst[n+count] == \"*\":\n lst[n+count] = i\n else:\n res = max(res, i-lst[n+count])\n return res\n \n ","memory":"19200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n res = 0\n n = len(nums)\n lst = [\"*\"]*(n*2+1)\n count = 0\n lst[n] = -1\n for i in range(n):\n if nums[i] == 1:\n count+=1\n else:\n count-=1\n if lst[n+count] == \"*\":\n lst[n+count] = i\n else:\n res = max(res, i-lst[n+count])\n return res\n \n ","memory":"19200"},{"code":"class Solution:\n def findMaxLength(self, nums):\n arr = [-2] * (2 * len(nums) + 1)\n arr[len(nums)] = -1\n maxlen = 0\n count = 0\n for i in range(len(nums)):\n count += -1 if nums[i] == 0 else 1\n if arr[count + len(nums)] >= -1:\n maxlen = max(maxlen, i - arr[count + len(nums)])\n else:\n arr[count + len(nums)] = i\n return maxlen\n\n\nclass Solution0:\n def findMaxLength(self, nums: List[int]) -> int:\n \n opt = 2 * min(sum(nums), len(nums)-sum(nums))\n hlfopt = opt // 2\n\n runsum = [0] * (len(nums) + 1)\n for i in range(1, len(nums)+1):\n runsum[i] = sum(nums[: i])\n\n while opt > 1:\n for i in range(0, len(nums)-opt+1):\n # print(sum(nums[i: i+opt]), runsum[i+opt]-runsum[i])\n # if sum(nums[i: i+opt]) == hlfopt:\n if runsum[i+opt]-runsum[i] == hlfopt:\n return opt\n opt -= 2\n hlfopt -= 1\n \n return 0\n ","memory":"19300"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n n = len(nums)\n arr = [-2] * (2*n + 1)\n arr[n] = -1\n \n count = 0\n maxlen = 0\n for i in range(n):\n count += -1 if nums[i] == 0 else 1\n \n if arr[count + n] >= -1:\n maxlen = max(maxlen, i - arr[count + n])\n else:\n arr[count + n] = i\n \n return maxlen","memory":"19400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n from collections import Counter\n counter = Counter(nums)\n if counter[0] == counter[1]:\n return len(nums)\n\n cum_sum = [0]\n\n for n in nums:\n if n == 1:\n cum_sum.append(cum_sum[-1] + 1)\n else:\n cum_sum.append(cum_sum[-1] - 1)\n\n max_len = 0\n d = {}\n for i in range(len(cum_sum)):\n if cum_sum[i] not in d:\n d[cum_sum[i]] = i\n else:\n max_len = max(max_len, i - d[cum_sum[i]])\n\n return max_len\n","memory":"19500"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n n = len(nums)\n arr = [-1]*(2*n+1)\n arr[n] = 0\n count = 0\n result = 0\n for i, num in enumerate(nums):\n count += -1 if num == 0 else 1\n if arr[n+count] >= 0:\n result = max(result, i+1-arr[n+count])\n else:\n arr[n+count] = i+1\n return result","memory":"19600"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n net = []\n z = 0\n o = 0\n result = 0\n for i, n in enumerate(nums):\n if n == 0:\n z += 1\n elif n == 1:\n o += 1\n net.append(o - z)\n if o - z == 0:\n result = max(result, i + 1)\n\n if net[-1] == 0:\n return len(nums)\n mp = {}\n for i , n in enumerate(net):\n if n in mp:\n ind = mp.get(n)\n result = max(result, i - ind)\n else:\n mp[n] = i\n return result\n ","memory":"19900"},{"code":"class Solution:\n def findMaxLength(self, arr: List[int]) -> int:\n\n prefix_sum_map = {}\n prefix_sum_map[0] = -1\n\n prefix_sum = 0\n max_length = 0\n\n for j in range(len(arr)):\n if arr[j] == 1:\n prefix_sum += 1\n else:\n prefix_sum -= 1\n\n if prefix_sum in prefix_sum_map:\n i = prefix_sum_map[prefix_sum]\n max_length = max(max_length, j - i)\n else:\n prefix_sum_map[prefix_sum] = j\n\n return max_length\n ","memory":"20000"},{"code":"from collections import defaultdict\nimport operator\nimport itertools\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counts = defaultdict(int)\n counts[0] = 1\n prefix = list(itertools.chain([0], itertools.accumulate((1 if x > 0 else -1 for x in nums), operator.add)))\n ans = curr = 0\n for i in range(2, len(nums) + 1, 2):\n curr *= 2 if prefix[i-2] == 0 else 0\n ans += counts[curr - 1]\n counts[curr] += 1\n return ans + 1\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if len(nums) == 0:\n return 0\n prefix = list(itertools.accumulate((1 if x > 0 else -1 for x in nums), operator.add))\n if prefix[-1] == 0:\n return len(nums)\n \n lefts = {0:0}\n for i, p in enumerate(prefix):\n if p not in lefts:\n lefts[p] = i\n rights = dict()\n for i, p in enumerate(reversed(prefix)):\n if p not in rights:\n rights[p] = len(nums) - i - 1\n mv = -1\n for v in set(itertools.chain(lefts, rights)):\n if v in rights and v in lefts:\n val = rights[v] - lefts[v]\n if v == 0:\n val += 1\n mv = max(mv, val)\n return mv\n \n ","memory":"20100"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n res = 0\n n = len(nums)\n lst = [\"*\"]*(n*2+1)\n print(lst)\n count = 0\n lst[n] = -1\n for i in range(n):\n if nums[i] == 1:\n count+=1\n else:\n count-=1\n if lst[n+count] == \"*\":\n lst[n+count] = i\n else:\n res = max(res, i-lst[n+count])\n print(lst)\n return res\n \n ","memory":"20200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n count = 0\n res = 0\n count_idx = {0: -1} # count_val -> index\n for i, n in enumerate(nums):\n if n == 1:\n count += 1\n else:\n count -= 1\n if count in count_idx:\n res = max(res, i - count_idx[count])\n else:\n count_idx[count] = i\n return res\n","memory":"20500"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n ans=0\n prefix=0\n prefixtoindex={0:-1}\n for i,num in enumerate(nums):\n prefix +=1 if num else -1\n ans=max(ans,i-prefixtoindex.setdefault(prefix,i))\n return ans","memory":"20700"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n mem, ans = [-1 for _ in range(len(nums) + 1)], 0\n if nums[0] == 0: nums[0] = -1\n for i in range(len(nums)):\n if i > 0:\n if nums[i] == 0: nums[i] = nums[i - 1] - 1\n else: nums[i] = nums[i - 1] + 1\n if mem[nums[i]] == -1: mem[nums[i]] = i\n if nums[i] == 0: ans = i + 1\n ans = max(ans, i - mem[nums[i]])\n print(mem)\n return ans","memory":"20800"},{"code":"from collections import deque\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # The subarray that satisfied the requirement has sum of length / 2\n cumsum = 0\n memory = {0: -1}\n ans = 0\n for i in range(len(nums)):\n if nums[i] == 1:\n cumsum += 1\n else:\n cumsum -= 1\n if cumsum in memory:\n ans = max(i - memory[cumsum], ans)\n else:\n memory[cumsum] = i\n return ans\n \n","memory":"20900"},{"code":"class Solution:\n def findMaxLength(self, nums: list[int]) -> int:\n ans = 0\n prefix = 0\n prefixToIndex = {0: -1}\n\n for i, num in enumerate(nums):\n prefix += 1 if num else -1\n ans = max(ans, i - prefixToIndex.setdefault(prefix, i))\n\n return ans","memory":"21000"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n mp = {}\n sum_val = 0\n max_len = 0\n for i, num in enumerate(nums):\n sum_val += 1 if num == 1 else -1\n if sum_val == 0:\n max_len = i + 1\n elif sum_val in mp:\n max_len = max(max_len, i - mp[sum_val])\n else:\n mp[sum_val] = i\n return max_len","memory":"21100"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n m = {0:-1}\n maxLen = 0\n count = 0\n for i, num in enumerate(nums):\n count = count + (1 if num==1 else -1)\n if count in m:\n maxLen = max(maxLen, i - m[count])\n else:\n m[count] = i\n return maxLen\n","memory":"21100"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefix_sum = {0: -1}\n actual_sum = 0\n position = 0\n difference = 0\n biggest = 0\n\n for num in nums:\n if num == 0:\n actual_sum -= 1\n if num == 1:\n actual_sum += 1\n\n if actual_sum in prefix_sum:\n difference = position - prefix_sum[actual_sum]\n else:\n prefix_sum[actual_sum] = position \n \n if difference > biggest:\n biggest = difference\n \n position += 1\n\n return biggest\n\n \n\n","memory":"21200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {0: -1}\n ans = s = 0\n for idx, i in enumerate(nums):\n s += 1 if i else -1\n if s in d:\n ans = max(ans, idx - d[s])\n else:\n d[s] = idx\n return ans\n \n ","memory":"21200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n h = {}\n maxlen = 0\n count = 0\n h[0] = -1\n for i in range(len(nums)):\n count += (1 if nums[i] == 1 else -1)\n if count not in h:\n h[count] = i\n else:\n maxlen = max(maxlen, i - h[count])\n \n return maxlen","memory":"21300"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefixSum2MinPosition = {0: -1}\n prefixSum = 0\n result = 0\n\n for index in range(0, len(nums)):\n if nums[index] == 0:\n prefixSum -= 1\n else:\n prefixSum += 1\n \n if prefixSum in prefixSum2MinPosition:\n if index - prefixSum2MinPosition[prefixSum] > result:\n result = index - prefixSum2MinPosition[prefixSum]\n else:\n prefixSum2MinPosition[prefixSum] = index\n return result","memory":"21300"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # PreSum and HashMap\n val_to_index = {} # pre_Sum : start index\n pre_sum = 0\n max_length = 0\n\n for i in range(len(nums)):\n if nums[i] == 1:\n pre_sum += 1\n else:\n pre_sum -= 1\n \n if pre_sum == 0:\n # If finding the contiguous array, record its length\n max_length = i + 1\n elif pre_sum in val_to_index:\n # If the pre_sum has appeared before, then find a contiguous array\n # Update the max_length\n max_length = max(max_length, i - val_to_index[pre_sum])\n else:\n # If the pre_sum firstly appear, record its start index\n val_to_index[pre_sum] = i\n \n return max_length","memory":"21400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n prefix = [0]*len(nums)\n if nums[0] == 0:\n prefix[0] = -1\n else:\n prefix[0] = 1\n for i in range(1,len(nums)):\n if nums[i] == 0:\n prefix[i] = prefix[i-1]+(-1)\n else:\n prefix[i] = prefix[i-1]+nums[i]\n print(\"prefix array\",prefix)\n if prefix[len(nums)-1] == 0:\n print(\"here\")\n return len(nums)\n hash_map = {}\n max_diff = 0\n updated = False\n for i in range(len(prefix)):\n if prefix[i] in hash_map:\n hash_map[prefix[i]].append(i)\n if ((i-hash_map[prefix[i]][0]) > max_diff):\n max_diff = (i-hash_map[prefix[i]][0])\n updated = True\n else:\n hash_map[prefix[i]] = [i]\n if 0 in hash_map:\n return max(max_diff,hash_map[0][-1]+1)\n else:\n return max_diff\n \n \n ","memory":"21500"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n counter = 0\n peaks = []\n peaktoindex = {}\n maxlen = 0\n for i in range(len(nums)):\n if i == 0: peaks.append(0)\n else: peaks.append(counter)\n if nums[i] == 0: counter -=1 \n else : counter += 1\n peaks.append(counter)\n\n for i in range(len(peaks)):\n elem = peaks[i]\n if elem in peaktoindex:\n start = peaktoindex[elem]\n maxlen = max(maxlen,i-start)\n\n else: peaktoindex[elem] = i\n return maxlen\n\n\n\n \n ","memory":"21600"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n res = 0\n\n m = {0: -1}\n balance = 0\n for i in range(len(nums)):\n if nums[i] == 0:\n balance += 1\n else:\n balance -= 1\n\n if balance not in m:\n m[balance] = i\n else:\n res = max(res, i - m[balance])\n return res\n \n","memory":"21700"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n running_sum = 0\n dic = {}\n result = 0\n \n for i in range(len(nums)):\n running_sum = running_sum + 1 if nums[i] == 1 else running_sum - 1\n \n if running_sum == 0:\n result = i + 1\n elif running_sum in dic:\n result = max(result, i - dic[running_sum])\n else:\n dic[running_sum] = i\n return result","memory":"21800"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # we define curr to record the balance between 0 and 1. \n # If num = 0, curr -= 1; if num = 1, curr += 1\n curr = 0\n\n # create a dict to record the SMALLEST index that a count appear\n counts = defaultdict(int)\n counts[0] = -1\n\n ans = 0\n for i, num in enumerate(nums):\n if num == 0:\n curr -= 1\n else:\n curr += 1\n\n counts.setdefault(curr, i)\n ans = max(ans, i-counts[curr])\n\n return ans","memory":"21800"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n d = {0:-1}\n length = 0\n total = 0\n for i in range(len(nums)):\n if nums[i]== 0:\n total+=-1\n else:\n total+=1\n nums[i] = total\n if nums[i] not in d:\n d[nums[i]] = i\n else:\n if i - d[nums[i]] > length:\n length = i - d[nums[i]]\n\n return length\n ","memory":"21900"},{"code":"from collections import defaultdict\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n count_map = defaultdict(int)\n count_map[0] = -1 # To handle cases where subarray starts from index 0\n count = 0\n max_length = 0\n \n for i in range(len(nums)):\n # Convert 0 to -1 to track equal number of 0 and 1\n if nums[i] == 1:\n count += 1\n else:\n count -= 1\n \n if count in count_map:\n # Calculate the length of the subarray\n max_length = max(max_length, i - count_map[count])\n else:\n # Store the first occurrence of the count\n count_map[count] = i\n \n return max_length","memory":"21900"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n map = {}\n maxLen = count = 0\n for i in range(len(nums)):\n count += 1 if nums[i] == 1 else -1\n if count == 0:\n maxLen = i + 1\n elif count in map:\n maxLen = max(maxLen, i - map[count])\n else:\n map[count] = i\n return maxLen","memory":"22000"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n count = 0\n hashMap = {0:-1}\n maxLen = 0\n for i,num in enumerate(nums):\n if num == 0:\n count -= 1\n else:\n count += 1\n if count in hashMap:\n maxLen = max(maxLen,i-hashMap[count])\n else:\n hashMap[count] = i\n return maxLen\n ","memory":"22000"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n prefix_sum = {0 : -1}\n curr = 0 \n res = 0\n for i in range(len(nums)):\n curr = curr + (1 if nums[i] == 1 else -1)\n diff = curr \n \n if diff in prefix_sum:\n res = max(res, i - prefix_sum[diff])\n if curr not in prefix_sum:\n prefix_sum[curr] = i\n return res \n \n\n \n \n \n \n \n \n \n \n \n \n \n ","memory":"22100"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n one, zero = 0, 0\n mapper = {}\n result = 0\n for index, element in enumerate(nums):\n if element:\n one += 1\n else:\n zero += 1\n \n if one - zero not in mapper:\n mapper[one-zero] = index\n \n if zero == one:\n result = index + 1\n else:\n result = max(result, index - mapper[one-zero])\n return result","memory":"22100"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n for i in range(len(nums)):\n if nums[i] == 0:\n nums[i] = -1\n\n prefixSum = 0\n hashmap = defaultdict(int)\n hashmap[0] = -1\n length = 0\n\n for i, num in enumerate(nums):\n prefixSum += num\n\n if prefixSum in hashmap:\n length = max(length, i - hashmap[prefixSum])\n #do stuff\n else:\n hashmap[prefixSum] = i\n\n return length\n\n \n \n\n ","memory":"22200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n dif = {}\n zero,one = 0,0\n maxLen = 0\n for i,num in enumerate(nums):\n if num == 0:\n zero += 1\n else:\n one += 1\n if (one - zero) not in dif:\n dif[one - zero] = i\n if one - zero == 0:\n maxLen = one + zero\n maxLen = max(maxLen, i - dif[one-zero])\n return maxLen\n\n","memory":"22200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if nums[0] == 0:\n prefixed_list = [0]\n prefixed_sum = 0\n else:\n prefixed_list = [1]\n prefixed_sum = 1\n number_appeared = 1\n for i in nums:\n if i == 0:\n prefixed_sum -= 1\n else:\n prefixed_sum += 1\n \n prefixed_list.append(prefixed_sum)\n \n count_dict = defaultdict(int)\n maximum_length = 0\n for i in range(len(prefixed_list)):\n if prefixed_list[i] not in count_dict:\n count_dict[prefixed_list[i]] = i\n else:\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\n return maximum_length\n \n \n ","memory":"22300"},{"code":"from collections import defaultdict\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n #0 0 1 1 0 0 0 0 0 1 1 1\n # 0 -1 -2 -1 0 -1 -2 -3 -4 -5 -4 -3 -2\n prefix_sum = [0]*(len(nums)+1)\n prefix_sum_dict = defaultdict(int)\n # if(nums[0]==0):\n # prefix_sum[0] = -1\n # else:\n # prefix_sum[0] = 1\n max_ans = 0\n count = 0\n prefix_sum_dict[0] = 0\n for i in range(len(nums)):\n if nums[i]==0:\n count-=1\n if count in prefix_sum_dict:\n max_ans = max(max_ans, i+1-prefix_sum_dict[count])\n else:\n prefix_sum_dict[count] = i+1\n elif nums[i]==1:\n count+=1\n if count in prefix_sum_dict:\n max_ans = max(max_ans, i+1-prefix_sum_dict[count])\n else:\n prefix_sum_dict[count] = i+1\n print(prefix_sum_dict)\n return max_ans\n \n \n\n ","memory":"22300"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if nums[0] == 0:\n prefixed_list = [0]\n prefixed_sum = 0\n else:\n prefixed_list = [1]\n prefixed_sum = 1\n number_appeared = 1\n for i in nums:\n if i == 0:\n prefixed_sum -= 1\n else:\n prefixed_sum += 1\n \n prefixed_list.append(prefixed_sum)\n \n count_dict = defaultdict(int)\n maximum_length = 0\n for i in range(len(prefixed_list)):\n if prefixed_list[i] not in count_dict:\n count_dict[prefixed_list[i]] = i\n else:\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\n return maximum_length\n \n \n ","memory":"22400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if nums[0] == 0:\n prefixed_list = [0]\n prefixed_sum = 0\n else:\n prefixed_list = [1]\n prefixed_sum = 1\n number_appeared = 1\n for i in nums:\n if i == 0:\n prefixed_sum -= 1\n else:\n prefixed_sum += 1\n \n prefixed_list.append(prefixed_sum)\n \n count_dict = defaultdict(int)\n maximum_length = 0\n for i in range(len(prefixed_list)):\n if prefixed_list[i] not in count_dict:\n count_dict[prefixed_list[i]] = i\n else:\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\n return maximum_length\n \n \n ","memory":"22400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n #equal number between i and j if prefix[j] - prefix[i - 1] = 0 otherwise prefix[j] = prefix[i - 1] means subarray[i.j] is valid\n #use the map to locate the same and update with current max index.\n m = {1 : 1, 0 : -1}\n res = 0\n prefix = [0] * (len(nums) + 1)\n prefix[0] = m[nums[0]]\n \n for i in range(1,len(nums)):\n prefix[i] = prefix[i-1] + m[nums[i]]\n hm = {}\n for i in range(len(nums)):\n # 0 -> new solution from root\n if prefix[i] == 0:\n res = max(res,i + 1)\n elif prefix[i] in hm:\n res = max(res, i - hm[prefix[i]])\n else:\n hm[prefix[i]] = i\n # in the hm -> new solution from hm index + 1\n #add to hm\n return res","memory":"22500"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n if nums[0] == 0:\n prefixed_list = [0]\n prefixed_sum = 0\n else:\n prefixed_list = [1]\n prefixed_sum = 1\n number_appeared = 1\n for i in nums:\n if i == 0:\n prefixed_sum -= 1\n else:\n prefixed_sum += 1\n \n prefixed_list.append(prefixed_sum)\n \n count_dict = defaultdict(int)\n maximum_length = 0\n print(prefixed_list)\n for i in range(len(prefixed_list)):\n if prefixed_list[i] not in count_dict:\n count_dict[prefixed_list[i]] = i\n else:\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\n return maximum_length\n \n \n ","memory":"22600"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n\n n = len(nums)\n preSum = [0] * (n+1)\n\n for i in range(n):\n num = 1 if nums[i] == 1 else -1\n\n preSum[i+1] = preSum[i] + num\n\n\n seen = {}\n\n res = 0\n for i in range(n+1):\n \n if preSum[i] in seen:\n res = max(res, i - seen[preSum[i]])\n else:\n seen[preSum[i]] = i\n return res\n ","memory":"22600"},{"code":"from typing import List\nfrom collections import defaultdict\n\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # Transform array: convert 0 to -1\n nums = [1 if x == 1 else -1 for x in nums]\n \n # Initialize variables\n max_length = 0\n cumulative_sum = 0\n index_map = {0: -1} # Handle the case when the subarray starts from index 0\n \n # Iterate over the array\n for i, num in enumerate(nums):\n # Compute the cumulative sum\n cumulative_sum += num\n \n # Check if this cumulative sum has been seen before\n if cumulative_sum in index_map:\n # Calculate the length of the subarray\n length = i - index_map[cumulative_sum]\n max_length = max(max_length, length)\n else:\n # Store the first occurrence of this cumulative sum\n index_map[cumulative_sum] = i\n \n return max_length\n\n","memory":"22700"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n #equal number between i and j if prefix[j] - prefix[i - 1] = 0 otherwise prefix[j] = prefix[i - 1] means subarray[i.j] is valid\n #use the map to locate the same and update with current max index.\n m = {1 : 1, 0 : -1}\n res = 0\n prefix = [0] * (len(nums) + 1)\n prefix[0] = m[nums[0]]\n \n for i in range(1,len(nums)):\n prefix[i] = prefix[i-1] + m[nums[i]]\n hm = {}\n for i in range(len(nums)):\n # 0 -> new solution from root\n if prefix[i] == 0:\n res = max(res,i + 1)\n elif prefix[i] in hm:\n res = max(res, i - hm[prefix[i]])\n else:\n hm[prefix[i]] = i\n # in the hm -> new solution from hm index + 1\n #add to hm\n return res","memory":"22700"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum = 0\n max_dis = 0\n sum_nums = []\n for i, num in enumerate(nums):\n if num == 0:\n sum -= 1\n else:\n sum += 1\n sum_nums.append(sum)\n if sum == 0:\n max_dis = i + 1\n tracker = {}\n for i, sum in enumerate(sum_nums):\n if sum not in tracker:\n tracker[sum] = i\n else:\n found_dis = i - tracker[sum]\n if found_dis > max_dis:\n max_dis = found_dis\n return max_dis\n","memory":"22800"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum = 0\n max_dis = 0\n sum_nums = []\n for i, num in enumerate(nums):\n if num == 0:\n sum -= 1\n else:\n sum += 1\n sum_nums.append(sum)\n if sum == 0:\n max_dis = i + 1\n tracker = {}\n for i, sum in enumerate(sum_nums):\n if sum not in tracker:\n tracker[sum] = i\n else:\n found_dis = i - tracker[sum]\n if found_dis > max_dis:\n max_dis = found_dis\n return max_dis\n","memory":"22800"},{"code":"\nclass Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \n count = [0]*(len(nums)+1) \n \n count_dict = {0:0}\n \n \n total = 0\n max_window_size = 0\n \n \n for idx, num in enumerate(nums):\n \n if num == 1:\n total += 1\n else:\n total -= 1\n \n count[idx+1] = total\n \n if total not in count_dict:\n count_dict[total] = idx+1\n else:\n if idx - count_dict[total] > max_window_size:\n max_window_size = idx+1 - count_dict[total]\n \n return max_window_size\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ","memory":"22900"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n modified = []\n for n in nums:\n modified.append(-1 if n == 0 else 1)\n\n prefix_sum = [modified[0]]\n for i in range(1, len(modified)):\n prefix_sum.append(modified[i] + prefix_sum[i-1])\n\n # If we traverse prefix_sum from the beginning, every 0\n # signifies we've encountered the same number of 1s and 0s since\n # the beginning (i.e. equal number of -1s and +1s).\n #\n # Further, if we encounter the same number at 2 indices i and j,\n # then the sum of the subarray [i, j] is also 0, implying\n # an equal number of 1s and 0s.\n #\n # Track where we encounter each number.\n\n longest = 0\n seen = {}\n\n for i, n in enumerate(prefix_sum):\n latest = 0\n if n == 0:\n latest = i + 1\n elif n in seen:\n latest = i - seen[n]\n else:\n seen[n] = i\n \n longest = max(longest, latest)\n \n return longest","memory":"23000"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n # 000111010 -> -1 -1 -1 1 1 1 -1 1 -1\n # 0: -1\n # 1: -2\n # 2: -3\n # 3: -2\n # 4: -1\n # 5: 0\n # 6: -1\n # 7: 0\n # 8: -1\n nums = [nums[i] if nums[i] == 1 else -1 for i in range(len(nums))]\n sums = []\n last_seen_index = {}\n sum = 0\n for i in range(len(nums)):\n sum += nums[i]\n sums.append(sum)\n print(\"sums: {}\".format(sums))\n max_len = 0\n for i in range(len(sums)):\n local_sum = sums[i]\n # get last seen index of local_sum if exists.\n if local_sum in last_seen_index:\n local_len = i - last_seen_index[local_sum]\n if local_len > max_len:\n max_len = local_len\n elif local_sum == 0:\n local_len = i + 1\n if local_len > max_len:\n max_len = local_len\n else:\n last_seen_index[local_sum] = i\n \n return max_len\n \n ","memory":"23100"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n n = len(nums)\n cumsum = [0]*(n+1)\n # find the positions: \n # j - i = 2*(cumsum[i+1] - cumsum[j+1]), which are count of 1s in between\n max_length = 0\n diff_dict = {0:0}\n for i in range(n):\n cumsum[i+1] = cumsum[i] + nums[i]\n diff = i+1 - 2*cumsum[i+1]\n if diff not in diff_dict:\n diff_dict[diff] = i+1\n else:\n max_length = max(max_length, i+1 - diff_dict[diff])\n return max_length\n","memory":"23200"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n res = 0\n \n counts = [0] * len(nums)\n sum = 0\n firstIndex = dict()\n for i,x in enumerate(nums):\n if x == 1:\n sum += 1\n else:\n sum -= 1\n counts.append(sum)\n if not sum in firstIndex:\n firstIndex[sum] = i\n else:\n res = max(res, i - firstIndex[sum])\n \n if sum == 0:\n res = max(res, i + 1)\n return res","memory":"23300"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum_dict = defaultdict(list)\n sum_dict[0] = [-1]\n\n max_array = 0\n curr_sum = 0\n for i, x in enumerate(nums):\n summand = 1 if x == 1 else -1\n curr_sum = curr_sum + summand\n if len(sum_dict[curr_sum]) > 0:\n max_array = max(max_array, i - sum_dict[curr_sum][0])\n else:\n sum_dict[curr_sum] = [i]\n\n print(sum_dict)\n \n return max_array","memory":"23400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n sum_dict = defaultdict(list)\n sum_dict[0] = [-1]\n\n max_array = 0\n curr_sum = 0\n for i, x in enumerate(nums):\n summand = 1 if x == 1 else -1\n curr_sum = curr_sum + summand\n if len(sum_dict[curr_sum]) > 0:\n max_array = max(max_array, i - sum_dict[curr_sum][0])\n else:\n sum_dict[curr_sum] = [i]\n\n print(sum_dict)\n \n return max_array","memory":"23400"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n \"\"\"\n [-1 1 1 1 -1 -1 1 1 -1]\n [-1 0 1 2 1 0 1 2 1]\n \"\"\"\n nums = [2*(n - 0.5) for n in nums]\n cs = 0\n keeper = {0: -1}\n max_l = 0\n for i, n in enumerate(nums):\n cs += n\n if cs in keeper:\n max_l = max(max_l, i-keeper[cs])\n else:\n keeper[cs] = i\n return max_l\n ","memory":"23500"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n nums = [x or -1 for x in nums]\n prefix_sum = nums[:]\n hash_map = {}\n hash_map[prefix_sum[0]] = 0\n cont_len = []\n for i in range(1, len(prefix_sum)):\n prefix_sum[i] = prefix_sum[i-1] + prefix_sum[i] \n if not prefix_sum[i] in hash_map:\n hash_map[prefix_sum[i]] = i\n\n for i, summ in enumerate(prefix_sum):\n if summ == 0:\n cont_len.append(i+1)\n elif summ in hash_map: \n idx = hash_map[summ]\n cont_len.append(i-idx)\n return max(cont_len)\n","memory":"23600"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n max_len = 0\n sums_map = {0: [0, -1]}\n cum_sum = 0\n for i, num in enumerate(nums):\n cum_sum += 1 if num == 1 else -1\n if cum_sum in sums_map:\n sums_map[cum_sum][1] = i + 1\n cur_len = sums_map[cum_sum][1] - sums_map[cum_sum][0]\n max_len = max(max_len, cur_len)\n else:\n sums_map[cum_sum] = [i+1, -1]\n return max_len\n","memory":"23700"},{"code":"class Solution:\n def findMaxLength(self, nums: List[int]) -> int:\n res = 0\n dic = {}\n count = 0\n for i in range(len(nums)):\n if nums[i] == 0:\n nums[i] = -1\n count += nums[i]\n if count not in dic: # Intuition use cummulative array\n dic[count] = [i, -1]\n else:\n dic[count][1] = i\n \n if count == 0 and i > 0:\n res = max(res, i+1)\n \n for pair in dic.values():\n res = max(res, pair[1]-pair[0])\n \n return res","memory":"23800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n ## tackle the cases when half of the elements are 1s\\n max_len = len(nums)\\n if 2*sum(nums) == max_len:\\n return max_len\\n\\n nums = [x or -1 for x in nums]\\n prefix_sum = 0\\n hash_map = {0:-1}\\n max_len = 0\\n for i, num in enumerate(nums):\\n prefix_sum += num \\n if not prefix_sum in hash_map:\\n hash_map[prefix_sum] = i\\n else:\\n max_len = max(max_len, i-hash_map[prefix_sum])\\n return max_len\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if sum(nums)*2 == len(nums):\\n return len(nums)\\n\\n sum_till_now = 0\\n sum_dict = {0: -1}\\n maximum = float('-inf')\\n for i, num in enumerate(nums):\\n sum_till_now += num or -1\\n sum_dict.setdefault(sum_till_now, i)\\n maximum = max(maximum, i-sum_dict[sum_till_now])\\n\\n return maximum\\n\\n\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n nums_len = len(nums)\\n if 2*sum(nums) == nums_len:\\n return nums_len\\n \\n hmap = {}\\n ans = 0\\n psum = 0\\n for i,v in enumerate(nums):\\n psum += 1 if v==1 else -1\\n if psum == 0:\\n ans = i + 1 # i is 0 indexed\\n else:\\n if psum in hmap:\\n ans = max(ans, i - hmap[psum])\\n else:\\n hmap[psum] = i\\n return ans\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if sum(nums)*2 == len(nums):\\n return len(nums)\\n balance, result = 0, 0\\n hashMap = {}\\n hashMap[0] = -1\\n for i in range(0, len(nums)):\\n if nums[i] == 0:\\n balance -= 1\\n else:\\n balance += 1\\n if not balance in hashMap:\\n hashMap[balance] = i\\n else:\\n result = max(result, i - hashMap[balance])\\n return result\\n\\n\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n result = 0\\n count = 0\\n n = len(nums)\\n hmap = [\\\"a\\\"]*(n+1)\\n hmap[0] = -1\\n\\n for i in range(len(nums)):\\n num = nums[i]\\n if num == 0:\\n count -= 1\\n else:\\n count += 1\\n\\n if hmap[count]!=\\\"a\\\":\\n result = max(result, i - hmap[count])\\n else:\\n hmap[count] = i\\n\\n return result\\n\\n \\n \\n\\n\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n arr=[-2]*(2*len(nums)+1)\\n arr[0]=0\\n count=0\\n maxLen=0\\n for i in range(len(nums)):\\n count+= 1 if nums[i] else -1\\n if arr[count] >= -1:\\n maxLen = max(maxLen,i+1-arr[count])\\n continue\\n arr[count]=i+1\\n return maxLen\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n res = 0\\n n = len(nums)\\n lst = [\\\"*\\\"]*(n*2+1)\\n count = 0\\n lst[n] = -1\\n for i in range(n):\\n if nums[i] == 1:\\n count+=1\\n else:\\n count-=1\\n if lst[n+count] == \\\"*\\\":\\n lst[n+count] = i\\n else:\\n res = max(res, i-lst[n+count])\\n return res\\n \\n \",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n res = 0\\n n = len(nums)\\n lst = [\\\"*\\\"]*(n*2+1)\\n count = 0\\n lst[n] = -1\\n for i in range(n):\\n if nums[i] == 1:\\n count+=1\\n else:\\n count-=1\\n if lst[n+count] == \\\"*\\\":\\n lst[n+count] = i\\n else:\\n res = max(res, i-lst[n+count])\\n return res\\n \\n \",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums):\\n arr = [-2] * (2 * len(nums) + 1)\\n arr[len(nums)] = -1\\n maxlen = 0\\n count = 0\\n for i in range(len(nums)):\\n count += -1 if nums[i] == 0 else 1\\n if arr[count + len(nums)] >= -1:\\n maxlen = max(maxlen, i - arr[count + len(nums)])\\n else:\\n arr[count + len(nums)] = i\\n return maxlen\\n\\n\\nclass Solution0:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n opt = 2 * min(sum(nums), len(nums)-sum(nums))\\n hlfopt = opt // 2\\n\\n runsum = [0] * (len(nums) + 1)\\n for i in range(1, len(nums)+1):\\n runsum[i] = sum(nums[: i])\\n\\n while opt > 1:\\n for i in range(0, len(nums)-opt+1):\\n # print(sum(nums[i: i+opt]), runsum[i+opt]-runsum[i])\\n # if sum(nums[i: i+opt]) == hlfopt:\\n if runsum[i+opt]-runsum[i] == hlfopt:\\n return opt\\n opt -= 2\\n hlfopt -= 1\\n \\n return 0\\n \",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n n = len(nums)\\n arr = [-2] * (2*n + 1)\\n arr[n] = -1\\n \\n count = 0\\n maxlen = 0\\n for i in range(n):\\n count += -1 if nums[i] == 0 else 1\\n \\n if arr[count + n] >= -1:\\n maxlen = max(maxlen, i - arr[count + n])\\n else:\\n arr[count + n] = i\\n \\n return maxlen\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n from collections import Counter\\n counter = Counter(nums)\\n if counter[0] == counter[1]:\\n return len(nums)\\n\\n cum_sum = [0]\\n\\n for n in nums:\\n if n == 1:\\n cum_sum.append(cum_sum[-1] + 1)\\n else:\\n cum_sum.append(cum_sum[-1] - 1)\\n\\n max_len = 0\\n d = {}\\n for i in range(len(cum_sum)):\\n if cum_sum[i] not in d:\\n d[cum_sum[i]] = i\\n else:\\n max_len = max(max_len, i - d[cum_sum[i]])\\n\\n return max_len\\n\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n n = len(nums)\\n arr = [-1]*(2*n+1)\\n arr[n] = 0\\n count = 0\\n result = 0\\n for i, num in enumerate(nums):\\n count += -1 if num == 0 else 1\\n if arr[n+count] >= 0:\\n result = max(result, i+1-arr[n+count])\\n else:\\n arr[n+count] = i+1\\n return result\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n net = []\\n z = 0\\n o = 0\\n result = 0\\n for i, n in enumerate(nums):\\n if n == 0:\\n z += 1\\n elif n == 1:\\n o += 1\\n net.append(o - z)\\n if o - z == 0:\\n result = max(result, i + 1)\\n\\n if net[-1] == 0:\\n return len(nums)\\n mp = {}\\n for i , n in enumerate(net):\\n if n in mp:\\n ind = mp.get(n)\\n result = max(result, i - ind)\\n else:\\n mp[n] = i\\n return result\\n \",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, arr: List[int]) -> int:\\n\\n prefix_sum_map = {}\\n prefix_sum_map[0] = -1\\n\\n prefix_sum = 0\\n max_length = 0\\n\\n for j in range(len(arr)):\\n if arr[j] == 1:\\n prefix_sum += 1\\n else:\\n prefix_sum -= 1\\n\\n if prefix_sum in prefix_sum_map:\\n i = prefix_sum_map[prefix_sum]\\n max_length = max(max_length, j - i)\\n else:\\n prefix_sum_map[prefix_sum] = j\\n\\n return max_length\\n \",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"from collections import defaultdict\\nimport operator\\nimport itertools\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counts = defaultdict(int)\\n counts[0] = 1\\n prefix = list(itertools.chain([0], itertools.accumulate((1 if x > 0 else -1 for x in nums), operator.add)))\\n ans = curr = 0\\n for i in range(2, len(nums) + 1, 2):\\n curr *= 2 if prefix[i-2] == 0 else 0\\n ans += counts[curr - 1]\\n counts[curr] += 1\\n return ans + 1\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if len(nums) == 0:\\n return 0\\n prefix = list(itertools.accumulate((1 if x > 0 else -1 for x in nums), operator.add))\\n if prefix[-1] == 0:\\n return len(nums)\\n \\n lefts = {0:0}\\n for i, p in enumerate(prefix):\\n if p not in lefts:\\n lefts[p] = i\\n rights = dict()\\n for i, p in enumerate(reversed(prefix)):\\n if p not in rights:\\n rights[p] = len(nums) - i - 1\\n mv = -1\\n for v in set(itertools.chain(lefts, rights)):\\n if v in rights and v in lefts:\\n val = rights[v] - lefts[v]\\n if v == 0:\\n val += 1\\n mv = max(mv, val)\\n return mv\\n \\n \",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n res = 0\\n n = len(nums)\\n lst = [\\\"*\\\"]*(n*2+1)\\n print(lst)\\n count = 0\\n lst[n] = -1\\n for i in range(n):\\n if nums[i] == 1:\\n count+=1\\n else:\\n count-=1\\n if lst[n+count] == \\\"*\\\":\\n lst[n+count] = i\\n else:\\n res = max(res, i-lst[n+count])\\n print(lst)\\n return res\\n \\n \",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n count = 0\\n res = 0\\n count_idx = {0: -1} # count_val -> index\\n for i, n in enumerate(nums):\\n if n == 1:\\n count += 1\\n else:\\n count -= 1\\n if count in count_idx:\\n res = max(res, i - count_idx[count])\\n else:\\n count_idx[count] = i\\n return res\\n\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n ans=0\\n prefix=0\\n prefixtoindex={0:-1}\\n for i,num in enumerate(nums):\\n prefix +=1 if num else -1\\n ans=max(ans,i-prefixtoindex.setdefault(prefix,i))\\n return ans\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n mem, ans = [-1 for _ in range(len(nums) + 1)], 0\\n if nums[0] == 0: nums[0] = -1\\n for i in range(len(nums)):\\n if i > 0:\\n if nums[i] == 0: nums[i] = nums[i - 1] - 1\\n else: nums[i] = nums[i - 1] + 1\\n if mem[nums[i]] == -1: mem[nums[i]] = i\\n if nums[i] == 0: ans = i + 1\\n ans = max(ans, i - mem[nums[i]])\\n print(mem)\\n return ans\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # The subarray that satisfied the requirement has sum of length / 2\\n cumsum = 0\\n memory = {0: -1}\\n ans = 0\\n for i in range(len(nums)):\\n if nums[i] == 1:\\n cumsum += 1\\n else:\\n cumsum -= 1\\n if cumsum in memory:\\n ans = max(i - memory[cumsum], ans)\\n else:\\n memory[cumsum] = i\\n return ans\\n \\n\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: list[int]) -> int:\\n ans = 0\\n prefix = 0\\n prefixToIndex = {0: -1}\\n\\n for i, num in enumerate(nums):\\n prefix += 1 if num else -1\\n ans = max(ans, i - prefixToIndex.setdefault(prefix, i))\\n\\n return ans\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n mp = {}\\n sum_val = 0\\n max_len = 0\\n for i, num in enumerate(nums):\\n sum_val += 1 if num == 1 else -1\\n if sum_val == 0:\\n max_len = i + 1\\n elif sum_val in mp:\\n max_len = max(max_len, i - mp[sum_val])\\n else:\\n mp[sum_val] = i\\n return max_len\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n m = {0:-1}\\n maxLen = 0\\n count = 0\\n for i, num in enumerate(nums):\\n count = count + (1 if num==1 else -1)\\n if count in m:\\n maxLen = max(maxLen, i - m[count])\\n else:\\n m[count] = i\\n return maxLen\\n\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefix_sum = {0: -1}\\n actual_sum = 0\\n position = 0\\n difference = 0\\n biggest = 0\\n\\n for num in nums:\\n if num == 0:\\n actual_sum -= 1\\n if num == 1:\\n actual_sum += 1\\n\\n if actual_sum in prefix_sum:\\n difference = position - prefix_sum[actual_sum]\\n else:\\n prefix_sum[actual_sum] = position \\n \\n if difference > biggest:\\n biggest = difference\\n \\n position += 1\\n\\n return biggest\\n\\n \\n\\n\",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {0: -1}\\n ans = s = 0\\n for idx, i in enumerate(nums):\\n s += 1 if i else -1\\n if s in d:\\n ans = max(ans, idx - d[s])\\n else:\\n d[s] = idx\\n return ans\\n \\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n h = {}\\n maxlen = 0\\n count = 0\\n h[0] = -1\\n for i in range(len(nums)):\\n count += (1 if nums[i] == 1 else -1)\\n if count not in h:\\n h[count] = i\\n else:\\n maxlen = max(maxlen, i - h[count])\\n \\n return maxlen\",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefixSum2MinPosition = {0: -1}\\n prefixSum = 0\\n result = 0\\n\\n for index in range(0, len(nums)):\\n if nums[index] == 0:\\n prefixSum -= 1\\n else:\\n prefixSum += 1\\n \\n if prefixSum in prefixSum2MinPosition:\\n if index - prefixSum2MinPosition[prefixSum] > result:\\n result = index - prefixSum2MinPosition[prefixSum]\\n else:\\n prefixSum2MinPosition[prefixSum] = index\\n return result\",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # PreSum and HashMap\\n val_to_index = {} # pre_Sum : start index\\n pre_sum = 0\\n max_length = 0\\n\\n for i in range(len(nums)):\\n if nums[i] == 1:\\n pre_sum += 1\\n else:\\n pre_sum -= 1\\n \\n if pre_sum == 0:\\n # If finding the contiguous array, record its length\\n max_length = i + 1\\n elif pre_sum in val_to_index:\\n # If the pre_sum has appeared before, then find a contiguous array\\n # Update the max_length\\n max_length = max(max_length, i - val_to_index[pre_sum])\\n else:\\n # If the pre_sum firstly appear, record its start index\\n val_to_index[pre_sum] = i\\n \\n return max_length\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n prefix = [0]*len(nums)\\n if nums[0] == 0:\\n prefix[0] = -1\\n else:\\n prefix[0] = 1\\n for i in range(1,len(nums)):\\n if nums[i] == 0:\\n prefix[i] = prefix[i-1]+(-1)\\n else:\\n prefix[i] = prefix[i-1]+nums[i]\\n print(\\\"prefix array\\\",prefix)\\n if prefix[len(nums)-1] == 0:\\n print(\\\"here\\\")\\n return len(nums)\\n hash_map = {}\\n max_diff = 0\\n updated = False\\n for i in range(len(prefix)):\\n if prefix[i] in hash_map:\\n hash_map[prefix[i]].append(i)\\n if ((i-hash_map[prefix[i]][0]) > max_diff):\\n max_diff = (i-hash_map[prefix[i]][0])\\n updated = True\\n else:\\n hash_map[prefix[i]] = [i]\\n if 0 in hash_map:\\n return max(max_diff,hash_map[0][-1]+1)\\n else:\\n return max_diff\\n \\n \\n \",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n counter = 0\\n peaks = []\\n peaktoindex = {}\\n maxlen = 0\\n for i in range(len(nums)):\\n if i == 0: peaks.append(0)\\n else: peaks.append(counter)\\n if nums[i] == 0: counter -=1 \\n else : counter += 1\\n peaks.append(counter)\\n\\n for i in range(len(peaks)):\\n elem = peaks[i]\\n if elem in peaktoindex:\\n start = peaktoindex[elem]\\n maxlen = max(maxlen,i-start)\\n\\n else: peaktoindex[elem] = i\\n return maxlen\\n\\n\\n\\n \\n \",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n res = 0\\n\\n m = {0: -1}\\n balance = 0\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n balance += 1\\n else:\\n balance -= 1\\n\\n if balance not in m:\\n m[balance] = i\\n else:\\n res = max(res, i - m[balance])\\n return res\\n \\n\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n running_sum = 0\\n dic = {}\\n result = 0\\n \\n for i in range(len(nums)):\\n running_sum = running_sum + 1 if nums[i] == 1 else running_sum - 1\\n \\n if running_sum == 0:\\n result = i + 1\\n elif running_sum in dic:\\n result = max(result, i - dic[running_sum])\\n else:\\n dic[running_sum] = i\\n return result\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # we define curr to record the balance between 0 and 1. \\n # If num = 0, curr -= 1; if num = 1, curr += 1\\n curr = 0\\n\\n # create a dict to record the SMALLEST index that a count appear\\n counts = defaultdict(int)\\n counts[0] = -1\\n\\n ans = 0\\n for i, num in enumerate(nums):\\n if num == 0:\\n curr -= 1\\n else:\\n curr += 1\\n\\n counts.setdefault(curr, i)\\n ans = max(ans, i-counts[curr])\\n\\n return ans\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n d = {0:-1}\\n length = 0\\n total = 0\\n for i in range(len(nums)):\\n if nums[i]== 0:\\n total+=-1\\n else:\\n total+=1\\n nums[i] = total\\n if nums[i] not in d:\\n d[nums[i]] = i\\n else:\\n if i - d[nums[i]] > length:\\n length = i - d[nums[i]]\\n\\n return length\\n \",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n count_map = defaultdict(int)\\n count_map[0] = -1 # To handle cases where subarray starts from index 0\\n count = 0\\n max_length = 0\\n \\n for i in range(len(nums)):\\n # Convert 0 to -1 to track equal number of 0 and 1\\n if nums[i] == 1:\\n count += 1\\n else:\\n count -= 1\\n \\n if count in count_map:\\n # Calculate the length of the subarray\\n max_length = max(max_length, i - count_map[count])\\n else:\\n # Store the first occurrence of the count\\n count_map[count] = i\\n \\n return max_length\",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n map = {}\\n maxLen = count = 0\\n for i in range(len(nums)):\\n count += 1 if nums[i] == 1 else -1\\n if count == 0:\\n maxLen = i + 1\\n elif count in map:\\n maxLen = max(maxLen, i - map[count])\\n else:\\n map[count] = i\\n return maxLen\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n count = 0\\n hashMap = {0:-1}\\n maxLen = 0\\n for i,num in enumerate(nums):\\n if num == 0:\\n count -= 1\\n else:\\n count += 1\\n if count in hashMap:\\n maxLen = max(maxLen,i-hashMap[count])\\n else:\\n hashMap[count] = i\\n return maxLen\\n \",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n prefix_sum = {0 : -1}\\n curr = 0 \\n res = 0\\n for i in range(len(nums)):\\n curr = curr + (1 if nums[i] == 1 else -1)\\n diff = curr \\n \\n if diff in prefix_sum:\\n res = max(res, i - prefix_sum[diff])\\n if curr not in prefix_sum:\\n prefix_sum[curr] = i\\n return res \\n \\n\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n one, zero = 0, 0\\n mapper = {}\\n result = 0\\n for index, element in enumerate(nums):\\n if element:\\n one += 1\\n else:\\n zero += 1\\n \\n if one - zero not in mapper:\\n mapper[one-zero] = index\\n \\n if zero == one:\\n result = index + 1\\n else:\\n result = max(result, index - mapper[one-zero])\\n return result\",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n nums[i] = -1\\n\\n prefixSum = 0\\n hashmap = defaultdict(int)\\n hashmap[0] = -1\\n length = 0\\n\\n for i, num in enumerate(nums):\\n prefixSum += num\\n\\n if prefixSum in hashmap:\\n length = max(length, i - hashmap[prefixSum])\\n #do stuff\\n else:\\n hashmap[prefixSum] = i\\n\\n return length\\n\\n \\n \\n\\n \",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n dif = {}\\n zero,one = 0,0\\n maxLen = 0\\n for i,num in enumerate(nums):\\n if num == 0:\\n zero += 1\\n else:\\n one += 1\\n if (one - zero) not in dif:\\n dif[one - zero] = i\\n if one - zero == 0:\\n maxLen = one + zero\\n maxLen = max(maxLen, i - dif[one-zero])\\n return maxLen\\n\\n\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if nums[0] == 0:\\n prefixed_list = [0]\\n prefixed_sum = 0\\n else:\\n prefixed_list = [1]\\n prefixed_sum = 1\\n number_appeared = 1\\n for i in nums:\\n if i == 0:\\n prefixed_sum -= 1\\n else:\\n prefixed_sum += 1\\n \\n prefixed_list.append(prefixed_sum)\\n \\n count_dict = defaultdict(int)\\n maximum_length = 0\\n for i in range(len(prefixed_list)):\\n if prefixed_list[i] not in count_dict:\\n count_dict[prefixed_list[i]] = i\\n else:\\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\\n return maximum_length\\n \\n \\n \",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n #0 0 1 1 0 0 0 0 0 1 1 1\\n # 0 -1 -2 -1 0 -1 -2 -3 -4 -5 -4 -3 -2\\n prefix_sum = [0]*(len(nums)+1)\\n prefix_sum_dict = defaultdict(int)\\n # if(nums[0]==0):\\n # prefix_sum[0] = -1\\n # else:\\n # prefix_sum[0] = 1\\n max_ans = 0\\n count = 0\\n prefix_sum_dict[0] = 0\\n for i in range(len(nums)):\\n if nums[i]==0:\\n count-=1\\n if count in prefix_sum_dict:\\n max_ans = max(max_ans, i+1-prefix_sum_dict[count])\\n else:\\n prefix_sum_dict[count] = i+1\\n elif nums[i]==1:\\n count+=1\\n if count in prefix_sum_dict:\\n max_ans = max(max_ans, i+1-prefix_sum_dict[count])\\n else:\\n prefix_sum_dict[count] = i+1\\n print(prefix_sum_dict)\\n return max_ans\\n \\n \\n\\n \",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if nums[0] == 0:\\n prefixed_list = [0]\\n prefixed_sum = 0\\n else:\\n prefixed_list = [1]\\n prefixed_sum = 1\\n number_appeared = 1\\n for i in nums:\\n if i == 0:\\n prefixed_sum -= 1\\n else:\\n prefixed_sum += 1\\n \\n prefixed_list.append(prefixed_sum)\\n \\n count_dict = defaultdict(int)\\n maximum_length = 0\\n for i in range(len(prefixed_list)):\\n if prefixed_list[i] not in count_dict:\\n count_dict[prefixed_list[i]] = i\\n else:\\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\\n return maximum_length\\n \\n \\n \",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if nums[0] == 0:\\n prefixed_list = [0]\\n prefixed_sum = 0\\n else:\\n prefixed_list = [1]\\n prefixed_sum = 1\\n number_appeared = 1\\n for i in nums:\\n if i == 0:\\n prefixed_sum -= 1\\n else:\\n prefixed_sum += 1\\n \\n prefixed_list.append(prefixed_sum)\\n \\n count_dict = defaultdict(int)\\n maximum_length = 0\\n for i in range(len(prefixed_list)):\\n if prefixed_list[i] not in count_dict:\\n count_dict[prefixed_list[i]] = i\\n else:\\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\\n return maximum_length\\n \\n \\n \",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n #equal number between i and j if prefix[j] - prefix[i - 1] = 0 otherwise prefix[j] = prefix[i - 1] means subarray[i.j] is valid\\n #use the map to locate the same and update with current max index.\\n m = {1 : 1, 0 : -1}\\n res = 0\\n prefix = [0] * (len(nums) + 1)\\n prefix[0] = m[nums[0]]\\n \\n for i in range(1,len(nums)):\\n prefix[i] = prefix[i-1] + m[nums[i]]\\n hm = {}\\n for i in range(len(nums)):\\n # 0 -> new solution from root\\n if prefix[i] == 0:\\n res = max(res,i + 1)\\n elif prefix[i] in hm:\\n res = max(res, i - hm[prefix[i]])\\n else:\\n hm[prefix[i]] = i\\n # in the hm -> new solution from hm index + 1\\n #add to hm\\n return res\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n if nums[0] == 0:\\n prefixed_list = [0]\\n prefixed_sum = 0\\n else:\\n prefixed_list = [1]\\n prefixed_sum = 1\\n number_appeared = 1\\n for i in nums:\\n if i == 0:\\n prefixed_sum -= 1\\n else:\\n prefixed_sum += 1\\n \\n prefixed_list.append(prefixed_sum)\\n \\n count_dict = defaultdict(int)\\n maximum_length = 0\\n print(prefixed_list)\\n for i in range(len(prefixed_list)):\\n if prefixed_list[i] not in count_dict:\\n count_dict[prefixed_list[i]] = i\\n else:\\n maximum_length = max(maximum_length, i - count_dict[prefixed_list[i]])\\n return maximum_length\\n \\n \\n \",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n\\n n = len(nums)\\n preSum = [0] * (n+1)\\n\\n for i in range(n):\\n num = 1 if nums[i] == 1 else -1\\n\\n preSum[i+1] = preSum[i] + num\\n\\n\\n seen = {}\\n\\n res = 0\\n for i in range(n+1):\\n \\n if preSum[i] in seen:\\n res = max(res, i - seen[preSum[i]])\\n else:\\n seen[preSum[i]] = i\\n return res\\n \",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"from typing import List\\nfrom collections import defaultdict\\n\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # Transform array: convert 0 to -1\\n nums = [1 if x == 1 else -1 for x in nums]\\n \\n # Initialize variables\\n max_length = 0\\n cumulative_sum = 0\\n index_map = {0: -1} # Handle the case when the subarray starts from index 0\\n \\n # Iterate over the array\\n for i, num in enumerate(nums):\\n # Compute the cumulative sum\\n cumulative_sum += num\\n \\n # Check if this cumulative sum has been seen before\\n if cumulative_sum in index_map:\\n # Calculate the length of the subarray\\n length = i - index_map[cumulative_sum]\\n max_length = max(max_length, length)\\n else:\\n # Store the first occurrence of this cumulative sum\\n index_map[cumulative_sum] = i\\n \\n return max_length\\n\\n\",\n \"memory\": \"22700\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n #equal number between i and j if prefix[j] - prefix[i - 1] = 0 otherwise prefix[j] = prefix[i - 1] means subarray[i.j] is valid\\n #use the map to locate the same and update with current max index.\\n m = {1 : 1, 0 : -1}\\n res = 0\\n prefix = [0] * (len(nums) + 1)\\n prefix[0] = m[nums[0]]\\n \\n for i in range(1,len(nums)):\\n prefix[i] = prefix[i-1] + m[nums[i]]\\n hm = {}\\n for i in range(len(nums)):\\n # 0 -> new solution from root\\n if prefix[i] == 0:\\n res = max(res,i + 1)\\n elif prefix[i] in hm:\\n res = max(res, i - hm[prefix[i]])\\n else:\\n hm[prefix[i]] = i\\n # in the hm -> new solution from hm index + 1\\n #add to hm\\n return res\",\n \"memory\": \"22700\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum = 0\\n max_dis = 0\\n sum_nums = []\\n for i, num in enumerate(nums):\\n if num == 0:\\n sum -= 1\\n else:\\n sum += 1\\n sum_nums.append(sum)\\n if sum == 0:\\n max_dis = i + 1\\n tracker = {}\\n for i, sum in enumerate(sum_nums):\\n if sum not in tracker:\\n tracker[sum] = i\\n else:\\n found_dis = i - tracker[sum]\\n if found_dis > max_dis:\\n max_dis = found_dis\\n return max_dis\\n\",\n \"memory\": \"22800\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum = 0\\n max_dis = 0\\n sum_nums = []\\n for i, num in enumerate(nums):\\n if num == 0:\\n sum -= 1\\n else:\\n sum += 1\\n sum_nums.append(sum)\\n if sum == 0:\\n max_dis = i + 1\\n tracker = {}\\n for i, sum in enumerate(sum_nums):\\n if sum not in tracker:\\n tracker[sum] = i\\n else:\\n found_dis = i - tracker[sum]\\n if found_dis > max_dis:\\n max_dis = found_dis\\n return max_dis\\n\",\n \"memory\": \"22800\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\n count = [0]*(len(nums)+1) \\n \\n count_dict = {0:0}\\n \\n \\n total = 0\\n max_window_size = 0\\n \\n \\n for idx, num in enumerate(nums):\\n \\n if num == 1:\\n total += 1\\n else:\\n total -= 1\\n \\n count[idx+1] = total\\n \\n if total not in count_dict:\\n count_dict[total] = idx+1\\n else:\\n if idx - count_dict[total] > max_window_size:\\n max_window_size = idx+1 - count_dict[total]\\n \\n return max_window_size\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \\n \",\n \"memory\": \"22900\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n modified = []\\n for n in nums:\\n modified.append(-1 if n == 0 else 1)\\n\\n prefix_sum = [modified[0]]\\n for i in range(1, len(modified)):\\n prefix_sum.append(modified[i] + prefix_sum[i-1])\\n\\n # If we traverse prefix_sum from the beginning, every 0\\n # signifies we've encountered the same number of 1s and 0s since\\n # the beginning (i.e. equal number of -1s and +1s).\\n #\\n # Further, if we encounter the same number at 2 indices i and j,\\n # then the sum of the subarray [i, j] is also 0, implying\\n # an equal number of 1s and 0s.\\n #\\n # Track where we encounter each number.\\n\\n longest = 0\\n seen = {}\\n\\n for i, n in enumerate(prefix_sum):\\n latest = 0\\n if n == 0:\\n latest = i + 1\\n elif n in seen:\\n latest = i - seen[n]\\n else:\\n seen[n] = i\\n \\n longest = max(longest, latest)\\n \\n return longest\",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n # 000111010 -> -1 -1 -1 1 1 1 -1 1 -1\\n # 0: -1\\n # 1: -2\\n # 2: -3\\n # 3: -2\\n # 4: -1\\n # 5: 0\\n # 6: -1\\n # 7: 0\\n # 8: -1\\n nums = [nums[i] if nums[i] == 1 else -1 for i in range(len(nums))]\\n sums = []\\n last_seen_index = {}\\n sum = 0\\n for i in range(len(nums)):\\n sum += nums[i]\\n sums.append(sum)\\n print(\\\"sums: {}\\\".format(sums))\\n max_len = 0\\n for i in range(len(sums)):\\n local_sum = sums[i]\\n # get last seen index of local_sum if exists.\\n if local_sum in last_seen_index:\\n local_len = i - last_seen_index[local_sum]\\n if local_len > max_len:\\n max_len = local_len\\n elif local_sum == 0:\\n local_len = i + 1\\n if local_len > max_len:\\n max_len = local_len\\n else:\\n last_seen_index[local_sum] = i\\n \\n return max_len\\n \\n \",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n n = len(nums)\\n cumsum = [0]*(n+1)\\n # find the positions: \\n # j - i = 2*(cumsum[i+1] - cumsum[j+1]), which are count of 1s in between\\n max_length = 0\\n diff_dict = {0:0}\\n for i in range(n):\\n cumsum[i+1] = cumsum[i] + nums[i]\\n diff = i+1 - 2*cumsum[i+1]\\n if diff not in diff_dict:\\n diff_dict[diff] = i+1\\n else:\\n max_length = max(max_length, i+1 - diff_dict[diff])\\n return max_length\\n\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n res = 0\\n \\n counts = [0] * len(nums)\\n sum = 0\\n firstIndex = dict()\\n for i,x in enumerate(nums):\\n if x == 1:\\n sum += 1\\n else:\\n sum -= 1\\n counts.append(sum)\\n if not sum in firstIndex:\\n firstIndex[sum] = i\\n else:\\n res = max(res, i - firstIndex[sum])\\n \\n if sum == 0:\\n res = max(res, i + 1)\\n return res\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum_dict = defaultdict(list)\\n sum_dict[0] = [-1]\\n\\n max_array = 0\\n curr_sum = 0\\n for i, x in enumerate(nums):\\n summand = 1 if x == 1 else -1\\n curr_sum = curr_sum + summand\\n if len(sum_dict[curr_sum]) > 0:\\n max_array = max(max_array, i - sum_dict[curr_sum][0])\\n else:\\n sum_dict[curr_sum] = [i]\\n\\n print(sum_dict)\\n \\n return max_array\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n sum_dict = defaultdict(list)\\n sum_dict[0] = [-1]\\n\\n max_array = 0\\n curr_sum = 0\\n for i, x in enumerate(nums):\\n summand = 1 if x == 1 else -1\\n curr_sum = curr_sum + summand\\n if len(sum_dict[curr_sum]) > 0:\\n max_array = max(max_array, i - sum_dict[curr_sum][0])\\n else:\\n sum_dict[curr_sum] = [i]\\n\\n print(sum_dict)\\n \\n return max_array\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n \\\"\\\"\\\"\\n [-1 1 1 1 -1 -1 1 1 -1]\\n [-1 0 1 2 1 0 1 2 1]\\n \\\"\\\"\\\"\\n nums = [2*(n - 0.5) for n in nums]\\n cs = 0\\n keeper = {0: -1}\\n max_l = 0\\n for i, n in enumerate(nums):\\n cs += n\\n if cs in keeper:\\n max_l = max(max_l, i-keeper[cs])\\n else:\\n keeper[cs] = i\\n return max_l\\n \",\n \"memory\": \"23500\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n nums = [x or -1 for x in nums]\\n prefix_sum = nums[:]\\n hash_map = {}\\n hash_map[prefix_sum[0]] = 0\\n cont_len = []\\n for i in range(1, len(prefix_sum)):\\n prefix_sum[i] = prefix_sum[i-1] + prefix_sum[i] \\n if not prefix_sum[i] in hash_map:\\n hash_map[prefix_sum[i]] = i\\n\\n for i, summ in enumerate(prefix_sum):\\n if summ == 0:\\n cont_len.append(i+1)\\n elif summ in hash_map: \\n idx = hash_map[summ]\\n cont_len.append(i-idx)\\n return max(cont_len)\\n\",\n \"memory\": \"23600\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n max_len = 0\\n sums_map = {0: [0, -1]}\\n cum_sum = 0\\n for i, num in enumerate(nums):\\n cum_sum += 1 if num == 1 else -1\\n if cum_sum in sums_map:\\n sums_map[cum_sum][1] = i + 1\\n cur_len = sums_map[cum_sum][1] - sums_map[cum_sum][0]\\n max_len = max(max_len, cur_len)\\n else:\\n sums_map[cum_sum] = [i+1, -1]\\n return max_len\\n\",\n \"memory\": \"23700\"\n },\n {\n \"code\": \"class Solution:\\n def findMaxLength(self, nums: List[int]) -> int:\\n res = 0\\n dic = {}\\n count = 0\\n for i in range(len(nums)):\\n if nums[i] == 0:\\n nums[i] = -1\\n count += nums[i]\\n if count not in dic: # Intuition use cummulative array\\n dic[count] = [i, -1]\\n else:\\n dic[count][1] = i\\n \\n if count == 0 and i > 0:\\n res = max(res, i+1)\\n \\n for pair in dic.values():\\n res = max(res, pair[1]-pair[0])\\n \\n return res\",\n \"memory\": \"23800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":63,"string":"63"}}},{"rowIdx":279,"cells":{"question_id":{"kind":"number","value":526,"string":"526"},"name":{"kind":"string","value":"beautiful-arrangement"},"content":{"kind":"string","value":"<p>Suppose you have <code>n</code> integers labeled <code>1</code> through <code>n</code>. A permutation of those <code>n</code> integers <code>perm</code> (<strong>1-indexed</strong>) is considered a <strong>beautiful arrangement</strong> if for every <code>i</code> (<code>1 <= i <= n</code>), <strong>either</strong> of the following is true:</p>\n\n<ul>\n\t<li><code>perm[i]</code> is divisible by <code>i</code>.</li>\n\t<li><code>i</code> is divisible by <code>perm[i]</code>.</li>\n</ul>\n\n<p>Given an integer <code>n</code>, return <em>the <strong>number</strong> of the <strong>beautiful arrangements</strong> that you can construct</em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 2\n<strong>Output:</strong> 2\n<b>Explanation:</b> \nThe first beautiful arrangement is [1,2]:\n - perm[1] = 1 is divisible by i = 1\n - perm[2] = 2 is divisible by i = 2\nThe second beautiful arrangement is [2,1]:\n - perm[1] = 2 is divisible by i = 1\n - i = 2 is divisible by perm[2] = 1\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 1\n<strong>Output:</strong> 1\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 15</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":64.33251882158658,"string":"64.332519"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"],"string":"[\n \"array\",\n \"dynamic-programming\",\n \"backtracking\",\n \"bit-manipulation\",\n \"bitmask\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"38\", 1.5661], [\"55\", 1.4543999999999997], [\"73\", 2.5728], [\"90\", 5.145600000000001], [\"107\", 1.7899999999999996], [\"124\", 1.2306999999999997], [\"142\", 2.3492999999999995], [\"159\", 1.3425999999999996], [\"176\", 0.1119], [\"193\", 0.1119], [\"210\", 0.6713], [\"228\", 0.3357], [\"245\", 0.5594], [\"262\", 0.1119], [\"279\", 0.1119], [\"297\", 0.1119], [\"314\", 0.1119], [\"331\", 0.2238], [\"348\", 0.3357], [\"366\", 0.1119], [\"383\", 0.4476], [\"400\", 0.7832], [\"417\", 0.1119], [\"435\", 0.2237], [\"452\", 0.2237], [\"469\", 0.1119], [\"486\", 0.5594], [\"504\", 2.461], [\"521\", 3.4677], [\"538\", 2.3493999999999993], [\"555\", 1.1187], [\"572\", 1.4544000000000001], [\"590\", 4.4742999999999995], [\"607\", 5.816700000000001], [\"624\", 4.4742999999999995], [\"641\", 2.9085999999999994], [\"659\", 1.1188], [\"676\", 0.7832], [\"693\", 2.461], [\"710\", 0.7832], [\"728\", 1.3424], [\"745\", 2.0135999999999994], [\"762\", 1.5662999999999996], [\"779\", 0.3357], [\"797\", 0.5595], [\"814\", 0.8951], [\"831\", 0.895], [\"848\", 1.2306999999999997], [\"866\", 2.5729999999999995], [\"883\", 3.6912999999999996], [\"900\", 2.9084999999999996], [\"917\", 1.3425999999999996], [\"934\", 1.9017], [\"952\", 0.895], [\"969\", 1.0069], [\"986\", 0.8951], [\"1003\", 1.2306999999999997], [\"1021\", 0.8952], [\"1038\", 0.7831], [\"1055\", 0.5595], [\"1072\", 0.4476], [\"1090\", 0.6713], [\"1107\", 0.3357], [\"1124\", 0.4476], [\"1141\", 0.1119], [\"1159\", 0.1119], [\"1176\", 0.895], [\"1193\", 1.2306999999999997], [\"1210\", 0.7833], [\"1228\", 1.2308], [\"1245\", 0.7831], [\"1262\", 0.7832], [\"1279\", 0.2238], [\"1296\", 0.3357], [\"1314\", 0.7831], [\"1331\", 0.4476], [\"1348\", 0.3356], [\"1365\", 0.3357], [\"1383\", 0.3357], [\"1400\", 0.3357]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16100\", 0.1119], [\"16200\", 0.1119], [\"16300\", 1.6779], [\"16400\", 10.179], [\"16500\", 26.9575], [\"16600\", 36.1298], [\"16700\", 8.0537], [\"16800\", 1.4541], [\"16900\", 0.1119], [\"17000\", 0.1119], [\"17300\", 0.2237], [\"17400\", 0.4474], [\"17600\", 0.1119], [\"17800\", 0.5593], [\"17900\", 0.4474], [\"18000\", 0.2237], [\"18100\", 0.1119], [\"18200\", 0.1119], [\"18300\", 0.2237], [\"18700\", 0.1119], [\"18900\", 0.2237], [\"19000\", 0.2237], [\"19100\", 0.3356], [\"19200\", 0.1119], [\"19300\", 0.3356], [\"19400\", 0.1119], [\"19600\", 0.1119], [\"19700\", 0.1119], [\"19800\", 0.1119], [\"20500\", 0.1119], [\"20700\", 0.3356], [\"20800\", 3.0201], [\"20900\", 0.8949], [\"21000\", 0.2237], [\"21500\", 0.2237], [\"21600\", 0.8949]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n return [1,2,3,8,10,36,41,132,250,700,750,4010,4237,10680,24679][n-1]\n ","runtime":"38"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n return [1,2,3,8,10,36,41,132,250,700,750,4010,4237,10680,24679][n-1]\n \n","runtime":"38"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n @lru_cache(None)\n def dfs(bm, pl):\n if pl == 0: return 1\n \n S = 0\n for i in range(n):\n if not bm&1<<i and ((i+1)%pl == 0 or pl%(i+1) == 0):\n S += dfs(bm^1<<i, pl - 1)\n return S\n \n return dfs(0, n)","runtime":"55"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n memo = {}\n nums = tuple(list(range(1, n+1)))\n return self.dfs(nums, memo, n)\n \n def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\n if pos == 1:\n return 1 \n if nums in memo:\n return memo[nums]\n cnt = 0 \n for i in range(len(nums)):\n if nums[i] % pos != 0 and pos % nums[i] != 0:\n continue\n cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\n memo[nums] = cnt \n return cnt ","runtime":"55"},{"code":"class Solution:\n def countArrangement(self, N: int) -> int:\n \"\"\"\n index: 1 2\n 1 2\n\n\n \"\"\"\n @cache\n def solve(bitmask, n):\n if n > N:\n return 1\n\n ans = 0\n for i in range(1, N + 1):\n if (bitmask & (1 << i)) == 0: # unused\n if i % n == 0 or n % i == 0:\n ans += solve(bitmask | (1 << i), n + 1) \n return ans\n return solve(1, 1) ","runtime":"73"},{"code":"class Solution:\n def __init__(self):\n self.ans=0\n \n def countArrangement(self, n: int) -> int:\n \n\n def backtrack(left, end):\n # left is the left array to be put; end is the starting points\n if end==1: \n self.ans+=1\n return \n\n for i in left:\n if end%i==0 or i%end==0:\n left_copy=list(left)\n left_copy.remove(i)\n backtrack(left_copy, end-1)\n \n backtrack([i for i in range(1,n+1)], n)\n return self.ans","runtime":"73"},{"code":"from functools import cache\nclass Solution:\n def countArrangement(self, n: int) -> int:\n '''\n bitmask\n '''\n\n @cache\n def func(taken,i):\n if taken == 0:\n return 1\n count = 0\n for j in range(1,n+1):\n if taken&(1<<(j-1)) and (j%i == 0 or i%j == 0):\n count += func(taken^(1<<(j-1)),i+1)\n return count\n\n ans = func((1<<n)-1,1)\n return ans\n\n\n\n\n\n\n ","runtime":"90"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n u = (1<<n) - 1\n @cache \n def dfs(s:int)->int:\n if s == u:\n return 1\n res = 0\n i = s.bit_count() + 1\n for j in range(1, n+1):\n if s>>(j-1) & 1 == 0 and (i%j == 0 or j % i == 0):\n res += dfs(s | 1<<(j-1))\n return res\n return dfs(0) ","runtime":"90"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def count(i, X):\n if i == 1:\n return 1\n return sum(count(i - 1, X - {x})\n for x in X\n if x % i == 0 or i % x == 0)\n\n return count(n, set(range(1, n + 1)))","runtime":"107"},{"code":"class Solution:\n def dfs(self, cur: int, n: int) -> int:\n if cur == n:\n return 1\n elif (self.visited, cur) in self.cache:\n return self.cache[(self.visited, cur)]\n else:\n total = 0\n for i in range(n):\n if (self.visited & (1<<i)) != 0:\n continue\n if (cur+1)%(i+1) == 0 or (i+1)%(cur+1) == 0:\n origin_visited = self.visited\n self.visited = (self.visited | (1<<i))\n res = self.dfs(cur+1, n)\n self.visited = origin_visited\n total += res\n self.cache[(self.visited, cur)] = total\n return total\n \n def countArrangement(self, n: int) -> int:\n self.visited = 0\n self.cache = {}\n res = self.dfs(0, n)\n return res","runtime":"107"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n states = 1 << n\n dp = [0 for _ in range(states)]\n dp[0] = 1\n \n for state in range(states):\n ones = bin(state).count('1')\n for k in range(1, n + 1):\n if state & (1 << (k - 1)) and (k % ones == 0 or ones % k == 0):\n dp[state] += dp[state & ~(1 << (k - 1))]\n return dp[states - 1]","runtime":"124"},{"code":"class Solution:\n def f(self, used: List[str], l: List[int], d: Dict[str, int]) -> int:\n used.sort()\n k: str = '_'.join([str(x) for x in used])\n k = f'0_{k}'\n\n if k in d.keys():\n return d[k] \n\n if len(l) == 0:\n d[k] = 1\n return 1\n\n cnt: int = 0\n for i in l:\n index: int = len(used) + 1\n if i % index == 0 or index % i == 0:\n used2 = used + [i]\n l2 = list(l)\n l2.remove(i)\n cnt += self.f(used2, l2, d)\n\n d[k] = cnt\n return d[k]\n\n def countArrangement(self, n: int) -> int:\n return self.f([], [x for x in range(1, n + 1)], dict())","runtime":"124"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def genPermutation(start: int, comb: List[int]):\n if start == n:\n self.count += 1\n return\n for i in range(start, n + 1):\n if comb[i] % (start + 1) == 0 or (start + 1) % comb[i] == 0:\n comb[start], comb[i] = comb[i], comb[start]\n genPermutation(start + 1, comb)\n comb[start], comb[i] = comb[i], comb[start]\n self.count = 0\n genPermutation(1, [i for i in range(n + 1)])\n return self.count\n","runtime":"159"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n finish = n + 1\n permut = [i for i in range(finish)]\n count = 0\n def genPermutation(start: int, comb: List[int]):\n if start == n:\n nonlocal count\n count += 1\n return\n for i in range(start, finish):\n combI = comb[i]\n start1 = start + 1\n if combI % start1 == 0 or start1 % combI == 0:\n combStart = comb[start]\n comb[start], comb[i] = combI, combStart\n genPermutation(start1, comb)\n comb[start], comb[i] = combStart, combI\n genPermutation(1, permut)\n return count ","runtime":"159"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(i):\n nonlocal ans, n\n if i == n + 1:\n ans += 1\n return\n for j in match[i]:\n if not vis[j]:\n vis[j] = True\n dfs(i + 1)\n vis[j] = False\n\n ans = 0\n vis = [False] * (n + 1)\n match = defaultdict(list)\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n if j % i == 0 or i % j == 0:\n match[i].append(j)\n\n dfs(1)\n return ans","runtime":"176"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n variants = [[] for _ in range(n+1)]\n \n for i in range(1,n+1):\n variants[i].append(i)\n \n for j in range(2*i, n+1, i):\n variants[j].append(i)\n variants[i].append(j)\n \n visited = [False] * (n+1)\n self.ans = 0\n \n def dfs(x):\n if x == n + 1:\n self.ans += 1\n return\n \n \n for y in variants[x]:\n if visited[y]:\n continue\n \n visited[y] = True\n dfs(x+1)\n visited[y] = False\n \n dfs(1)\n return self.ans\n ","runtime":"193"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(position):\n nonlocal count, n\n if position == n + 1:\n count += 1\n return\n for number in matches[position]:\n if not visited[number]:\n visited[number] = True\n dfs(position + 1)\n visited[number] = False\n\n count = 0\n visited = [False] * (n + 1)\n matches = defaultdict(list)\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n if j % i == 0 or i % j == 0:\n matches[i].append(j)\n\n dfs(1)\n return count","runtime":"210"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n res = [0]\n def dfs(path, end):\n if end==1:\n res[0] += 1\n for i in range(n, 0, -1):\n if i not in path:\n if end % i == 0 or i % end == 0:\n dfs(path + [i], end-1)\n dfs([], n)\n return res[0]","runtime":"210"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(position):\n nonlocal count,n\n if position==n+1:\n count+=1\n return\n for numbers in matches[position]:\n if not visited[numbers]:\n visited[numbers]=True\n dfs(position+1)\n visited[numbers]=False\n count=0\n visited=[False]*(n+1)\n matches=defaultdict(list)\n for i in range(1,n+1):\n for j in range(1,n+1):\n if j%i==0 or i%j==0:\n matches[i].append(j)\n dfs(1)\n return count\n\n ","runtime":"228"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(i):\n nonlocal ans, n\n if i == n + 1:\n ans += 1\n return\n for j in match[i]:\n if not vis[j]:\n vis[j] = True\n dfs(i + 1)\n vis[j] = False\n\n ans = 0\n vis = [False] * (n + 1)\n match = defaultdict(list)\n for i in range(1, n + 1):\n for j in range(1, n + 1):\n if j % i == 0 or i % j == 0:\n match[i].append(j)\n\n dfs(1)\n return ans","runtime":"228"},{"code":"def solve(n, i, exclude=set()):\n dom = set([j for j in range(1, n + 1) if i % j == 0 or j % i == 0]).difference(exclude)\n if i == 1:\n return len(dom)\n else:\n k = 0\n for d in dom:\n k += solve(n, i - 1, exclude.union([d]))\n return k\n\nclass Solution:\n def countArrangement(self, n: int) -> int:\n return solve(n, n)","runtime":"245"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n valid = [[] for _ in range(n + 1)]\n for index in range(1, n + 1):\n for v in range(1, n + 1):\n if index % v == 0 or v % index == 0:\n valid[index].append(v)\n # print(valid)\n\n def dfs(vis, index):\n if index == n + 1:\n return 1\n ans = 0\n for v in valid[index]:\n if vis[v] == 0:\n vis[v] = 1\n ans += dfs(vis, index + 1)\n vis[v] = 0\n return ans\n \n visited = [0 for _ in range(n + 1)]\n return dfs(visited, 1)","runtime":"245"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n memo = [[-1] * (1 << n) for _ in range(n + 1)]\n\n def dfs(i, state):\n if i > n:\n return 1\n if memo[i][state] > 0:\n return memo[i][state]\n total = 0\n for j in range(1, n + 1):\n if not state & (1 << (j - 1)) and (j % i == 0 or i % j == 0):\n state |= 1 << (j - 1)\n total += dfs(i + 1, state)\n state ^= 1 << (j - 1)\n memo[i][state] = total\n return memo[i][state]\n\n return dfs(1, 0)\n","runtime":"262"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n permi = [[] for _ in range(n)]\n for i in range(n):\n for j in range(1, n+1):\n if j%(i+1)==0 or (i+1)%j==0:\n permi[i].append(j)\n \n def count(i, taken=set()):\n if len(taken)==n:\n return 1\n ans = 0\n for pi in permi[i]:\n if pi not in taken:\n taken.add(pi)\n ans += count(i+1, taken)\n taken.remove(pi)\n return ans \n return count(0)","runtime":"279"},{"code":"class Solution:\n # def countArrangement(self, n: int) -> int:\n # # dp = {1: 1, 2: 2, 3: 3}\n # # if n in dp:\n # # return dp[n]\n # count = 0\n # path = set()\n\n # def backtrack(start: int):\n # nonlocal count\n # if len(path) == n:\n # count += 1\n # return\n\n # for ind in range(1, n + 1):\n # if ind in path:\n # continue\n # new_pos = len(path) + 1\n # if ind % new_pos == 0 or new_pos % ind == 0:\n # path.add(ind)\n # backtrack(ind + 1)\n # path.remove(ind)\n\n # backtrack(1)\n # return count\n\n # def countArrangement(self, n: int) -> int:\n # \"\"\"DP\"\"\"\n # dp = {\n # 1: 1,\n # 2: 2,\n # 3: 3,\n # 4: 8,\n # 5: 10,\n # 6: 36,\n # 7: 41,\n # 8: 132,\n # 9: 250,\n # 10: 700,\n # 11: 750,\n # 12: 4010,\n # 13: 4237,\n # 14: 10680,\n # 15: 24679,\n # }\n # return dp[n]\n\n def countArrangement(self, n: int) -> int:\n divisible = [[1] for _ in range(n)]\n divisible[0] = list(range(1, n + 1))\n\n for pos in range(2, n + 1):\n divisible[pos - 1].append(pos)\n for val in range(pos + 1, n + 1):\n if val % pos == 0:\n divisible[pos - 1].append(val)\n divisible[val - 1].append(pos)\n\n count = 0\n path = set()\n\n def backtrack(start: int):\n nonlocal count\n if len(path) == n:\n count += 1\n return\n\n for val in divisible[start]:\n if val in path:\n continue\n path.add(val)\n backtrack(start + 1)\n path.remove(val)\n\n backtrack(0)\n return count","runtime":"297"},{"code":"class Solution:\n # def countArrangement(self, n: int) -> int:\n # # dp = {1: 1, 2: 2, 3: 3}\n # # if n in dp:\n # # return dp[n]\n # count = 0\n # path = set()\n\n # def backtrack(start: int):\n # nonlocal count\n # if len(path) == n:\n # count += 1\n # return\n\n # for ind in range(1, n + 1):\n # if ind in path:\n # continue\n # new_pos = len(path) + 1\n # if ind % new_pos == 0 or new_pos % ind == 0:\n # path.add(ind)\n # backtrack(ind + 1)\n # path.remove(ind)\n\n # backtrack(1)\n # return count\n\n # def countArrangement(self, n: int) -> int:\n # \"\"\"DP\"\"\"\n # dp = {\n # 1: 1,\n # 2: 2,\n # 3: 3,\n # 4: 8,\n # 5: 10,\n # 6: 36,\n # 7: 41,\n # 8: 132,\n # 9: 250,\n # 10: 700,\n # 11: 750,\n # 12: 4010,\n # 13: 4237,\n # 14: 10680,\n # 15: 24679,\n # }\n # return dp[n]\n\n def countArrangement(self, n: int) -> int:\n divisible = [[1] for _ in range(n)]\n divisible[0] = list(range(1, n + 1))\n\n for pos in range(2, n + 1):\n divisible[pos - 1].append(pos)\n for val in range(pos + 1, n + 1):\n if val % pos == 0:\n divisible[pos - 1].append(val)\n divisible[val - 1].append(pos)\n\n count = 0\n path = set()\n\n def backtrack(start: int):\n nonlocal count\n if len(path) == n:\n count += 1\n return\n\n for val in divisible[start]:\n if val in path:\n continue\n path.add(val)\n backtrack(start + 1)\n path.remove(val)\n\n backtrack(0)\n return count","runtime":"314"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n permi = [[] for _ in range(n)]\n for i in range(1, n+1):\n for j in range(1, n+1):\n if j%i==0 or i%j==0:\n permi[i-1].append(j)\n \n def count(i, taken=set()):\n if len(taken)==n:\n return 1\n ans = 0\n for pi in permi[i]:\n if pi not in taken:\n taken.add(pi)\n ans += count(i+1, taken)\n taken.remove(pi)\n return ans \n return count(0)","runtime":"331"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n neighbors = {\n v: [\n n for n in range(1,n+1) if (0 in [n % v, v % n])\n ]\n for v in range(1, n+1)\n }\n # print(neighbors)\n\n count = 0\n cur = set([])\n\n def backtrack():\n nonlocal count\n l = len(cur)\n if l == n:\n count += 1\n return \n \n for neighbor in neighbors[l+1]:\n if neighbor not in cur:\n cur.add(neighbor)\n backtrack()\n cur.remove(neighbor)\n\n\n backtrack()\n return count\n\n\n ","runtime":"331"},{"code":"from collections import defaultdict\n\nclass Solution:\n def countArrangement(self, n: int) -> int:\n possibilities = defaultdict(set)\n for i in range(1, n + 1):\n for j in range(i, n + 1, i):\n possibilities[i].add(j)\n possibilities[j].add(i)\n\n #print(possibilities)\n def helper(idx: int, used: Set[int]) -> int:\n #print(idx, used)\n if idx == n + 1:\n return 1\n count = 0\n for cand in possibilities[idx]:\n if cand in used:\n continue\n used.add(cand)\n count += helper(idx + 1, used)\n used.remove(cand)\n return count\n return helper(1, set())\n","runtime":"348"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n dit = collections.defaultdict(list)\n for i in range(1, n+1):\n for j in range(1, n+1):\n if i % j==0 or j%i==0:\n dit[i].append(j)\n\n self.n = n\n self.cnt = 0\n self.visited = set()\n self.dfs(1, dit)\n\n return self.cnt\n \n\n def dfs(self, index, dit):\n if index == self.n+1:\n self.cnt +=1\n return\n\n for x in dit[index]:\n if x not in self.visited:\n self.visited.add(x)\n self.dfs(index+1, dit)\n self.visited.discard(x)\n\n return\n \n \n \n\n\n\n ","runtime":"348"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n graph = {\n 1: list(range(1, 16)),\n 2: [1, 2, 4, 6, 8, 10, 12, 14],\n 3: [1, 3, 6, 9, 12, 15],\n 4: [1, 2, 4, 8, 12],\n 5: [1, 5, 10, 15],\n 6: [1, 2, 3, 6, 12],\n 7: [1, 7, 14],\n 8: [1, 2, 4, 8],\n 9: [1, 3, 9],\n 10: [1, 2, 5, 10],\n 11: [1, 11],\n 12: [1, 2, 3, 4, 6, 12],\n 13: [1, 13],\n 14: [1, 2, 7, 14],\n 15: [1, 3, 5, 15]\n }\n return self.dfs(graph, n, 1, 1, {})\n \n def dfs(self, graph, n, i, length, visited):\n if length == n + 1:\n return 1\n count = 0\n for k in graph[i]:\n if k > n or visited.get(k, False):\n continue\n visited[k] = True\n count += self.dfs(graph, n, i + 1, length + 1, visited)\n visited[k] = False\n return count\n","runtime":"366"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n '''\n n = 4\n 1 -> 1 2 3 4 \n 2 -> 1 2 4\n 3 -> 1 3\n 4 -> 1 2 4\n '''\n res_list = [[i for i in range(1, n+1)]]\n for i in range(2, n+1):\n tmp_list = []\n for j in range(1, n+1):\n if i % j == 0 or j % i == 0:\n tmp_list.append(j)\n res_list.append(tmp_list)\n \n self.visited = set()\n def backtrack(path):\n if len(path) == n:\n self.visited.add(tuple(path))\n return\n\n for val in res_list[(len(path))]:\n if val not in path:\n path.append(val)\n backtrack(path)\n path.pop()\n\n backtrack([])\n return len(self.visited)","runtime":"383"},{"code":"class Solution:\n def canPutAt(self, pos, v):\n if pos == 1 or v == 1:\n return True\n return v % pos == 0 or pos % v == 0\n def count(self, n, posOfV, vOfPos, leftV, pos):\n if not leftV:\n return 0\n elif pos == n:\n return 1 if leftV.pop() in vOfPos[pos] else 0\n else:\n result = 0\n for v in vOfPos[pos]:\n if v in leftV:\n newLeftV = leftV.copy()\n newLeftV.remove(v)\n result += self.count(n, posOfV, vOfPos, newLeftV, pos + 1)\n return result\n def countArrangement(self, n: int) -> int:\n posOfV = {}\n vOfPos = {}\n for pos in range(1, n + 1):\n for v in range(1, n + 1):\n if self.canPutAt(pos, v):\n vSet = vOfPos.setdefault(pos, set())\n vSet.add(v)\n posSet = posOfV.setdefault(v, set())\n posSet.add(pos)\n leftV = set(range(1, n + 1))\n return self.count(n, posOfV, vOfPos, leftV, 1)\n ","runtime":"383"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n graph = defaultdict(list)\n for num in range(1, n + 1):\n for i in range(1, n + 1):\n if num % i == 0 or i % num == 0:\n graph[num].append(i)\n \n def backtrack(i, used):\n nonlocal ans\n if i > n:\n ans += 1\n return\n for j in graph[i]:\n if j not in used:\n backtrack(i + 1, used | {j})\n ans = 0\n backtrack(1, set())\n return ans","runtime":"400"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n if n == 0:\n return 0\n #for n in range(1, 16):\n #print(f'{n=}')\n m = [[] for _ in range(n)]\n for i in range(1, n+1):\n for j in range(1, n+1):\n if i % j == 0 or j % i == 0:\n m[i-1].append(j-1)\n #print(f'{i}: {m[i-1]}')\n\n def r(counter, occupied):\n choices = m[counter]\n ans = []\n for choice in choices:\n if not occupied[choice]:\n new_occupied = copy.copy(occupied)\n new_occupied[choice] = counter + 1\n if counter < n - 1:\n ans += r(counter + 1, new_occupied)\n else:\n ans.append(new_occupied)\n return ans\n occupied = [False for _ in range(n)]\n occupied = r(0, occupied)\n\n return len(occupied)","runtime":"400"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def perm(remaining, index):\n if remaining == []:\n return 1\n\n ans = 0\n for rem in remaining:\n if rem % index == 0 or index % rem == 0:\n copy = remaining[:]\n copy.remove(rem)\n ans += perm(copy, index+1)\n\n return ans\n\n return perm([i+1 for i in range(n)], 1)\n","runtime":"417"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n arr=[i for i in range(1,n+1)]\n\n self.count=0\n\n\n def solve(array=arr.copy(),rez=[],index=1):\n\n if array==[]:\n self.count=self.count+1\n\n for i in array:\n\n if i%index==0 or index%i==0:\n\n rez.append(i)\n b=array.copy()\n b.remove(i)\n\n solve(b,rez.copy(),index+1)\n rez.pop()\n \n\n solve()\n\n return self.count","runtime":"435"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n perm=[i for i in range(n+1)]\n count=0\n finish=n+1\n def getPerm(start,comb):\n nonlocal count\n if start==n+1:\n count+=1\n return\n for i in range(start,finish):\n if comb[i]%(start)==0 or (start)%comb[i]==0:\n combI=comb[i]\n combStart=comb[start]\n comb[i],comb[start]=combStart,combI\n getPerm(start+1,comb)\n comb[i],comb[start]=combI,combStart\n getPerm(1,perm)\n return count\n","runtime":"452"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(i, nums):\n if not nums:\n return 1\n if i > n:\n return 0\n res = 0\n for num in nums:\n if num % i == 0 or i % num == 0:\n temp = nums.copy()\n temp.remove(num)\n res += dfs(i+1, temp)\n return res\n\n return dfs(1, set([i for i in range(1, n+1)]))","runtime":"469"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n # Generate the array of numbers that will be used to create permutations of 1 to n (n inclusive) ex: 3 will become [1,2,3]\n # Iterate through all elements in the list and compare it to i which is initialized at 1 to avoid the while index + 1 thing.\n # If the number is divisible by i or i is divisible by the number, remove the number from nums and continue generating the permutation.\n # If a full permutation is generated (i == n+1, aka went past the index) then we have one solution. Add that to the result.\n # backtracking -> dp\n\n res = 0\n nums = tuple(range(1, n+1))\n \n #@lru_cache(None)\n def dfs(nums, i):\n if i == n+1: # to the end\n return 1\n res = 0\n for j, num in enumerate(nums):\n if not num % i or not i % num:\n res += dfs(tuple(nums[:j] + nums[j+1:]), i+1)\n return res\n \n return dfs(nums, 1) ","runtime":"486"},{"code":"class Solution:\n def __init__(self):\n self.ans=0\n def countArrangement(self, n: int) -> int:\n nums=[i for i in range(n+1)]\n #print(nums)\n self.dfs(nums,1)\n return self.ans\n\n def dfs(self,nums,index):\n if(index==len(nums)):\n self.ans+=1\n return\n for j in range(index,len(nums)):\n if((nums[j]%index==0) or (index%nums[j]==0)):\n nums[index],nums[j]=nums[j],nums[index]\n self.dfs(nums,index+1)\n nums[index],nums[j]=nums[j],nums[index]\n\n\n ","runtime":"486"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.res = 0\n nums = [i for i in range(1, n+1)]\n \n def dfs(nums: list, i: int = 1):\n if i == n+1: \n self.res += 1\n return\n \n for j, num in enumerate(nums):\n if not(num % i and i % num):\n dfs(nums[:j] + nums[j+1:], i+1)\n \n dfs(nums)\n return self.res\n ","runtime":"504"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.res = 0\n nums = [i for i in range(1, n+1)]\n \n def dfs(nums: list, i: int = 1):\n if i == n+1: \n self.res += 1\n return\n \n for j, num in enumerate(nums):\n if not(num % i and i % num):\n dfs(nums[:j] + nums[j+1:], i+1)\n \n dfs(nums)\n return self.res\n","runtime":"504"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n self.res = 0\n nums = [i for i in range(1, n+1)]\n \n def dfs(nums: list, i: int = 1):\n if i == n+1: \n self.res += 1\n return\n \n for j, num in enumerate(nums):\n if not(num % i and i % num):\n dfs(nums[:j] + nums[j+1:], i+1)\n \n dfs(nums)\n return self.res","runtime":"521"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n self.res = 0\n nums = [i for i in range(1, n+1)]\n \n def dfs(nums: list, i: int = 1):\n if i == n+1: \n self.res += 1\n return\n \n for j, num in enumerate(nums):\n if not(num % i and i % num):\n dfs(nums[:j] + nums[j+1:], i+1)\n \n dfs(nums)\n return self.res","runtime":"521"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n nums=[i for i in range(1,n+1)]\n self.count=0\n def permute(curr):\n if curr==len(nums):\n self.count+=1\n return\n for i in range(curr,len(nums)):\n if ((nums[i]%(curr+1)==0 or (curr+1)%nums[i]==0)):\n nums[i],nums[curr]=nums[curr],nums[i]\n permute(curr+1)\n nums[i],nums[curr]=nums[curr],nums[i]\n return\n permute(0)\n return self.count\n ","runtime":"538"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.res = 0\n nums = [i for i in range(1, n+1)]\n \n def dfs(nums: list, i: int = 1):\n if i == n+1: \n self.res += 1\n return\n \n for j, num in enumerate(nums):\n if not(num % i and i % num):\n dfs(nums[:j] + nums[j+1:], i+1)\n \n dfs(nums)\n return self.res","runtime":"538"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # 1,2,3...n\n # perm(n) == beautiful if: \n # for i in range(1,n+1):\n # perm[i]%i == 0\n # or i % perm[i] ==0\n\n # perm(3)\n # 1,2,3\n # 1,3,2\n # 2,1,3\n # 2,3,1\n # 3,2,1\n # 3,1,2\n possible = [i for i in range(1,n+1)]\n def dfs(i, possible):\n if i == n+1:\n return 1\n count = 0\n for j,v in enumerate(possible):\n if v % i == 0 or i % v == 0:\n count +=dfs(i+1,possible[:j] + possible[j+1:])\n return count\n return dfs(1,possible)\n\n \n\n ","runtime":"555"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n s = set()\n for i in range(1, n+1):\n s.add(i)\n \n def backtracking(s, p):\n if p > n:\n return 1\n tot = 0\n for i in list(s):\n if i % p == 0 or p % i == 0:\n s.remove(i)\n tot += backtracking(s, p+1)\n s.add(i)\n return tot\n \n return backtracking(s, 1)\n ","runtime":"555"},{"code":"def search(lit, ans, loc):\n if len(lit) == 0:\n ans[0] += 1\n else:\n length = len(lit)\n for _ in range(length):\n val = lit.pop(0)\n if val %loc ==0 or loc%val==0:\n search(lit, ans, loc+1)\n lit.append(val)\n \n\n\n\nclass Solution:\n def countArrangement(self, n: int) -> int:\n\n\n\n lit = []\n\n for i in range(1, n+1):\n lit.append(i)\n ans = [0]\n\n search(lit, ans, 1)\n return ans[0]\n ","runtime":"572"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n r = 0\n def countArrangement(start, nums):\n nonlocal r\n if start == n+1:\n r+=1\n return\n for i in range(len(nums)):\n num = nums[i]\n if num % start == 0 or start % num == 0:\n countArrangement(start + 1, nums[:i] + nums[i+1:])\n return r\n \n countArrangement(1, list(range(1, n+1)))\n\n return r","runtime":"572"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n cnt = 0\n visited = [False] * (n+1)\n \n def permute(n,pos,visited):\n nonlocal cnt\n if pos > n:\n cnt+=1\n for i in range(1,n+1):\n if not visited[i]:\n if pos % i==0 or i%pos==0:\n visited[i] = True\n permute(n,pos+1,visited)\n visited[i] = False\n \n permute(n,1,visited)\n return cnt","runtime":"590"},{"code":"class Solution:\n def calculate(self, N, pos, visited, count):\n # 如果当前位置超过了N，则说明找到了一个valid permutation\n if pos > N:\n count[0] += 1\n return\n \n for i in range(1, N + 1):\n if not visited[i] and (pos % i == 0 or i % pos == 0):\n visited[i] = True\n self.calculate(N, pos + 1, visited, count)\n visited[i] = False\n \n \n def countArrangement(self, n: int) -> int:\n visited = [False] * (n + 1)\n count = [0]\n self.calculate(n, 1, visited, count)\n return count[0]\n ","runtime":"590"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n visit = [False]*(n+1)\n ans = 0\n\n def btrack(i):\n if i == n+1:\n nonlocal ans\n ans += 1\n \n for j in range(1, n+1):\n if not visit[j]:\n if not i%j or not j%i:\n visit[j] = True\n btrack(i+1)\n visit[j] = False\n \n btrack(1)\n return ans","runtime":"607"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n #enumeration problem\n # n == 1, output = 1\n # n == 2, output = 2\n # n == 3 :\n # [1,2,3]: perm[1] = 1, perm[2] = 2, perm[3] = 3\n # but is there a different arragement ?\n # [3,2,1] : perm[1] = 3 is div by 1\n # perm[2] = 2 is div 2\n #.perm[3] = 1 is divisible by \n # can be solved by recursive backtracking\n # try placing each number 1..n at each position i\n # we keep a visited array to track visit in each backtrack step\n visited = [False] * (n+1)\n count = 0\n\n def backtrack(pos):\n nonlocal count\n\n if pos > n:\n # we have found an arrangement\n count += 1\n return\n # include and exclude placing the number 'pos' in \n # current position \n for i in range(1, n+1):\n #backtracking tries to prune using a condition\n if not visited[i] and (pos % i == 0 or i % pos == 0):\n visited[i] = True\n backtrack(pos+1)\n visited[i] = False\n backtrack(1)\n return count\n\n\n\n","runtime":"607"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n def backtrack(pos, visited):\n if pos > n:\n return 1\n\n count = 0\n for num in range(1, n+1):\n if not visited[num] and (num%pos == 0 or pos%num == 0):\n visited[num] = True\n count += backtrack(pos+1, visited)\n visited[num] = False\n return count\n\n visited = [False]*(n+1)\n return backtrack(1, visited)","runtime":"624"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.count = 0\n visited = [False for _ in range(n+1)]\n #print(len(visited))\n\n def dp(n, pos, visited):\n if pos > n:\n self.count += 1\n for i in range(1, n+1):\n #print(i)\n if (not visited[i]) and (pos % i == 0 or i % pos == 0):\n visited[i] = True\n dp(n, pos + 1, visited)\n visited[i] = False\n\n dp(n, 1, visited)\n return self.count\n\n\n \"\"\"\n self.counter_count = 0\n @cache\n\n def dp(mask, k):\n if k == 0:\n self.counter_count += 1\n #return\n for i in range(n):\n if mask & (1 << i):\n if (i+1) % k == 0 or k % (i+1) == 0:\n dp(mask - (1 << i), k-1)\n #return\n \n dp((1 << n) - 1, n)\n \n #return self.count\n return self.counter_count\n \"\"\"","runtime":"624"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n visited = [False] * (n + 1)\n \n def dfs(i):\n if i >= n + 1:\n return 1\n \n res = 0\n for num in range(1, n+1):\n if visited[num]:\n continue\n \n if num % i == 0 or i % num == 0:\n visited[num] = True\n res += dfs(i + 1)\n visited[num] = False\n return res\n \n res = dfs(1)\n return res","runtime":"641"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(start_index, visited):\n if start_index == n + 1:\n return 1\n count = 0\n for i in range(1, n+1):\n if not visited[i] and (i % start_index == 0 or start_index % i == 0):\n visited[i] = True\n count += dfs(start_index + 1, visited)\n visited[i] = False\n return count\n return dfs(1, [False] * (n+1))\n ","runtime":"641"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n cnt = 0\n visited = [False] * (n+1)\n \n\n def permute(n,pos,visited):\n nonlocal cnt\n if pos > n:\n cnt+=1\n for i in range(1,n+1):\n #print(i,pos,visited)\n if not visited[i]:\n x = pos % i\n y = i%pos\n if x==0 or y==0:\n visited[i] = True\n permute(n,pos+1,visited)\n visited[i] = False\n #print()\n \n permute(n,1,visited)\n return cnt","runtime":"659"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n visited = [False] * (n+1)\n def dfs(i):\n if i == n + 1:\n return 1\n count = 0\n for num in range(1, n+1):\n if (not visited[num]) and (i % num == 0 or num % i == 0):\n visited[num] = True\n count += dfs(i+1)\n visited[num] = False\n return count\n return dfs(1)","runtime":"659"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # To keep track of visited numbers\n visited = [False] * (n + 1)\n \n # Helper function for backtracking\n def backtrack(pos):\n # If we've placed numbers in all positions\n if pos > n:\n return 1\n \n count = 0\n for i in range(1, n + 1):\n # Check if the number is not visited and satisfies the condition\n if not visited[i] and (i % pos == 0 or pos % i == 0):\n visited[i] = True # Mark the number as used\n count += backtrack(pos + 1) # Move to the next position\n visited[i] = False # Unmark the number (backtrack)\n return count\n \n # Start backtracking from position 1\n return backtrack(1)\n","runtime":"676"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n ans=[]\n def permute(l,p,index):\n if l==[]:\n ans.append(p)\n for i,v in enumerate(l):\n if v%(index+1)==0 or (index+1)%v==0:\n permute(l[:i]+l[i+1:],p+[v],index+1)\n \n permute(list(range(1,n+1)),[],0)\n return len(ans)","runtime":"676"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.visit=[False]*(n+1)\n self.count=0\n def bea(n,pos):\n if pos>n:self.count+=1\n for i in range(1,n+1):\n if not self.visit[i] and (pos%i==0 or i%pos==0):\n self.visit[i]=True\n bea(n,pos+1)\n self.visit[i]=False\n bea(n,1)\n return self.count \n \n ","runtime":"693"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.res = 0\n self.track = []\n self.used = [False] * (n+1)\n self.backtrack(n, 1)\n return self.res\n \n def backtrack(self, n: int, idx: int) -> None:\n if idx > n:\n self.res += 1\n return\n \n for i in range(1,n+1):\n if self.used[i]:\n continue\n if not(i % idx == 0 or idx % i == 0):\n continue\n self.used[i] = True\n self.track.append(i)\n self.backtrack(n, idx+1)\n self.track.pop()\n self.used[i] = False","runtime":"693"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.track = []\n self.used = [False] * (n+1)\n self.count = 0\n self.backtrack(n, 1)\n return self.count\n \n def backtrack(self, n, index):\n if len(self.track) == n:\n self.count += 1\n return\n\n for i in range(1, n+1):\n if self.used[i]:\n continue\n if i % index == 0 or index % i == 0:\n self.used[i] = True\n self.track.append(i)\n self.backtrack(n, index+1)\n self.track.pop()\n self.used[i] = False\n \n","runtime":"710"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def permute(nums,n,i):\n nonlocal cnt\n if(i==len(nums)):\n cnt+=1\n else:\n for j in range(i,n):\n nums[i],nums[j]=nums[j],nums[i]\n if((nums[i]%(i+1)==0) or ((i+1)%nums[i]==0)):\n permute(nums,n,i+1)\n nums[i],nums[j]=nums[j],nums[i]\n nums = [i+1 for i in range(n)]\n cnt=0\n permute(nums,n,0)\n return cnt\n ","runtime":"710"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n # backtracking solution.\n # easily coded.\n\n res = 0\n\n nums = list(range(1, n + 1))\n\n def backtrack(begin):\n\n if begin == n:\n nonlocal res\n res += 1\n return\n \n for i in range(begin, n):\n\n # swap the begin element and the current element at 'i' index.\n nums[begin], nums[i] = nums[i], nums[begin]\n\n # check for the condition given in the question.\n if nums[begin] % (begin + 1) == 0 or (begin + 1) % (nums[begin]) == 0:\n backtrack(begin + 1)\n \n\n # swap the numbers back to their original positions.\n nums[begin], nums[i] = nums[i], nums[begin]\n\n backtrack(0)\n \n return res\n ","runtime":"728"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n nums = [0]*(n+1)\n ans=[0]\n def solve(nums,ans,currnum,n):\n if currnum>=n+1:\n ans[0]+=1\n return \n \n for i in range(1,n+1):\n if nums[i]==0 and (currnum%i==0 or i%currnum==0):\n nums[i]=currnum\n solve(nums,ans,currnum+1,n)\n nums[i]=0\n\n solve(nums,ans,1,n)\n return ans[0]","runtime":"728"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def is_beautiful(perm):\n return all(perm[i] % (i + 1) == 0 or (i + 1) % perm[i] == 0 for i in range(n))\n\n def backtrack(index, used):\n if index > n:\n return 1\n count = 0\n for i in range(1, n + 1):\n if not used[i - 1] and (i % index == 0 or index % i == 0):\n used[i - 1] = True\n count += backtrack(index + 1, used)\n used[i - 1] = False\n return count\n \n used = [False] * n\n return backtrack(1, used)\n\n# Example usage:\nsolution = Solution()\nprint(solution.countArrangement(2)) # Output: 2\nprint(solution.countArrangement(1)) # Output: 1","runtime":"745"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n dict={}\n for i in range(1,n+1):\n dict[i]=0\n ans=[0]\n def ba(ind,dict):\n if ind>n:\n ans[0]+=1\n return\n for i in dict:\n if dict[i]==0:\n if i%ind==0 or ind%i==0:\n dict[i]=ind\n ba(ind+1,dict)\n dict[i]=0\n return\n \n ba(1,dict)\n return ans[0]\n \n ","runtime":"745"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n mat = [[0]*n for _ in range(n)]\n\n for i in range(n):\n for j in range(n):\n if (i+1) % (j+1) == 0 or (j+1) % (i+1) == 0:\n mat[i][j] = 1\n\n def dfs(mat, i, history):\n if i == n:\n return 1\n res = 0\n for j in range(n):\n if mat[i][j] == 1 and j not in history:\n temp = history.copy()\n temp.add(j)\n res += dfs(mat, i+1, temp)\n return res\n\n return dfs(mat, 0, set())","runtime":"762"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n permutations = []\n nums = [i for i in range(1, n+1)]\n\n def backtrack(start: int, end: int):\n # If we've reached the end of the array, we found a permutation\n if start == end:\n permutations.append(nums[:]) # Append a copy of nums\n return\n \n for i in range(start, end):\n # Swap the current element with the start element\n nums[start], nums[i] = nums[i], nums[start]\n # Recurse on the remaining subarray\n if nums[start]%(start+1)==0 or (start+1)%nums[start]==0:\n backtrack(start + 1, end)\n # Backtrack (undo the swap)\n nums[start], nums[i] = nums[i], nums[start]\n\n backtrack(0, n)\n \n return len(permutations)\n","runtime":"779"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n def dfs(nums, i):\n if i == n + 1:\n self.ans += 1\n return \n for j in range(1, n + 1):\n if nums[j - 1] == 0 and (i % j == 0 or j % i == 0):\n nums[j - 1] = i\n dfs(nums, i + 1)\n nums[j - 1] = 0\n return \n \n nums = [0 for i in range(1, n + 1)]\n self.ans = 0\n dfs(nums, 1)\n return self.ans","runtime":"779"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n n_list = [x for x in range(1, n+1)]\n vis = set()\n perm = []\n ans = 0\n\n def permute(i):\n nonlocal ans\n \n if i >= n:\n ans += 1\n return\n\n ip = i+1\n for x in n_list:\n if x not in vis and (x % ip == 0 or ip % x == 0):\n vis.add(x)\n permute(i + 1)\n vis.remove(x)\n permute(0)\n return ans\n \n","runtime":"797"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.res = 0\n self.dfs(list(range(1,n+1)),0,[])\n return self.res\n\n def dfs(self, nums, start, path):\n if start == len(nums):\n self.res += 1\n return\n for i in range(start,len(nums)):\n nums[start], nums[i] = nums[i], nums[start]\n if nums[start] % (start+1) == 0 or (start+1) % nums[start] ==0:\n self.dfs(nums,start+1, path +[nums[i]])\n nums[start], nums[i] = nums[i], nums[start]\n ","runtime":"797"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n def isValid(v):\n for i, x in enumerate(v):\n if (i+1) % x != 0 and x % (i+1) != 0:\n return False\n return True\n\n def helper(used, partial):\n nonlocal res\n idx = len(partial)\n if idx == n:\n # if isValid(partial):\n # res += 1\n # return\n res += 1\n return\n for i in range(len(used)):\n if not used[i] and ( (i+1) % (idx + 1) == 0 or (idx+1) % (i+1) ==0 ):\n used[i] = True\n partial.append(i+1)\n helper(used, partial)\n used[i] = False\n partial.pop()\n \n res = 0\n helper([False]*n, [])\n return res\n ","runtime":"814"},{"code":"class Solution:\n def backtrack(self, index):\n if index > self.n:\n self.count += 1\n return\n for i in range(index, self.n + 1):\n self.arr[i], self.arr[index] = self.arr[index], self.arr[i]\n if self.arr[index] % index == 0 or index % self.arr[index] == 0:\n self.backtrack(index + 1)\n self.arr[i], self.arr[index] = self.arr[index], self.arr[i]\n\n def countArrangement(self, n: int) -> int:\n self.count = 0\n self.arr = list(range(n+1))\n self.n = n\n self.backtrack(1)\n return self.count\n\n\n ","runtime":"814"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def isBeautiful(a: int, b: int) -> bool:\n return (a >= b and a % b == 0) or (b >= a and b % a == 0)\n available = [True] * (n + 1)\n def findArrangements(spot: int) -> int:\n if spot > n:\n return 0\n total = 0\n for num in range(1, len(available)):\n if available[num] and isBeautiful(spot, num):\n available[num] = False\n total += findArrangements(spot + 1) + (1 if spot == n else 0)\n available[num] = True\n return total\n return findArrangements(1)\n","runtime":"831"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n #two conditions, one must be true\n #the value at a index, must be divisible by the index\n # the index must be divisible by the value at the index \n\n\n res = 0\n\n visited = [False] * n\n \n def findArrangement(index, visitedVals):\n nonlocal res\n if index == n+1:\n res += 1 \n return\n\n \n for x in range(1, n+1):\n if visitedVals[x-1] == False:\n if x % index == 0 or index % x == 0:\n visitedVals[x-1] = True\n findArrangement(index+1, visitedVals)\n visitedVals[x-1] = False\n \n return\n \n findArrangement(1, visited)\n return res","runtime":"831"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.ans = 0\n seen = set()\n def calc(cur):\n # print(cur, seen)\n if cur > n:\n self.ans += 1\n return\n for i in range(1, n+1):\n if i not in seen and (cur % i == 0 or i % cur == 0):\n seen.add(i)\n calc(cur+1)\n seen.remove(i)\n calc(1)\n return self.ans","runtime":"848"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.nums = [i for i in range(1, n + 1)]\n self.n = n\n self.ans = 0\n self.helper(0)\n return self.ans\n def helper(self, start):\n if start == self.n:\n self.ans += 1\n return\n \n for i in range(start, self.n):\n self.nums[start], self.nums[i] = self.nums[i], self.nums[start]\n if self.nums[start] % (start + 1) == 0 or (start + 1) % self.nums[start] == 0:\n self.helper(start + 1)\n self.nums[start], self.nums[i] = self.nums[i], self.nums[start]\n ","runtime":"848"},{"code":"\"\"\"\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n @functools.cache\n def solve(cur):\n if len(cur) == 1:\n return 1\n \n total = 0\n for j in range(len(cur)):\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\n total += solve(cur[:j] + cur[j+1:])\n \n return total\n \n return solve(tuple(range(1, n+1)))\n\"\"\" \n\n#\"\"\"\n# typical backtracking algorithm\nclass Solution:\n # Top down, cache the current array for higher speed, takes around 60 ms\n def countArrangement(self, n: int) -> int:\n def dfs(level): # pos: position to place a new number\n if level > n: \n nonlocal res\n res += 1\n return\n for i in range(1, n + 1):\n if i not in visited and (i % level == 0 or level % i == 0):\n visited.add(i)\n dfs(level + 1)\n visited.discard(i)\n\n res = 0\n visited = set()\n dfs(1)\n return res\n#\"\"\"\n\n\"\"\"\n# This is permutation problem\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n def dfs(pos):\n nonlocal res\n \n if pos > n: \n res += 1\n return\n \n for num in range(1, n + 1): \n if num not in visited and (num % pos == 0 or pos % num == 0): \n visited.add(num)\n dfs(pos + 1)\n visited.discard(num)\n \n res = 0\n visited = set()\n \n dfs(1)\n \n return res\n\"\"\"","runtime":"866"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n nums = [False for _ in range(1, n + 1)]\n res = 0\n\n def dfs(arr, idx):\n nonlocal res\n if idx > n:\n res += 1\n return\n \n for i in range(1, n + 1):\n if nums[i-1] == False and (idx % i == 0 or i % idx == 0):\n arr.append(i)\n nums[i-1] = True\n dfs(arr, idx + 1)\n nums[i-1] = False\n arr.pop()\n\n dfs([], 1)\n \n return res\n","runtime":"866"},{"code":"\"\"\"\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n @functools.cache\n def solve(cur):\n if len(cur) == 1:\n return 1\n \n total = 0\n for j in range(len(cur)):\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\n total += solve(cur[:j] + cur[j+1:])\n \n return total\n \n return solve(tuple(range(1, n+1)))\n\"\"\" \n\n#\"\"\"\n# typical backtracking algorithm\nclass Solution:\n # Top down, cache the current array for higher speed, takes around 60 ms\n def countArrangement(self, n: int) -> int:\n def dfs(level): # pos: position to place a new number\n if level > n: \n nonlocal res\n res += 1\n return\n for i in range(1, n + 1):\n if i not in visited and (i % level == 0 or level % i == 0):\n visited.add(i)\n dfs(level + 1)\n visited.discard(i)\n\n res = 0\n visited = set()\n dfs(1)\n return res\n#\"\"\"\n\n\"\"\"\n# This is permutation problem\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n def dfs(pos):\n nonlocal res\n \n if pos > n: \n res += 1\n return\n \n for num in range(1, n + 1): \n if num not in visited and (num % pos == 0 or pos % num == 0): \n visited.add(num)\n dfs(pos + 1)\n visited.discard(num)\n \n res = 0\n visited = set()\n \n dfs(1)\n \n return res\n\"\"\"","runtime":"883"},{"code":"\"\"\"\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n @functools.cache\n def solve(cur):\n if len(cur) == 1:\n return 1\n \n total = 0\n for j in range(len(cur)):\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\n total += solve(cur[:j] + cur[j+1:])\n \n return total\n \n return solve(tuple(range(1, n+1)))\n\"\"\" \n\n#\"\"\"\n# typical backtracking algorithm\nclass Solution:\n # Top down, cache the current array for higher speed, takes around 60 ms\n def countArrangement(self, n: int) -> int:\n def dfs(level): # pos: position to place a new number\n if level > n: \n nonlocal res\n res += 1\n return\n for i in range(1, n + 1):\n if i not in visited and (i % level == 0 or level % i == 0):\n visited.add(i)\n dfs(level + 1)\n visited.discard(i)\n\n res = 0\n visited = set()\n dfs(1)\n return res\n#\"\"\"\n\n\"\"\"\n# This is permutation problem\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n def dfs(pos):\n nonlocal res\n \n if pos > n: \n res += 1\n return\n \n for num in range(1, n + 1): \n if num not in visited and (num % pos == 0 or pos % num == 0): \n visited.add(num)\n dfs(pos + 1)\n visited.discard(num)\n \n res = 0\n visited = set()\n \n dfs(1)\n \n return res\n\"\"\"","runtime":"883"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def backtrack(pos, visited):\n if pos > n:\n return 1\n cost = 0\n for i in range(1, n+1):\n if i not in visited and (i % pos == 0 or pos % i == 0):\n visited.add(i)\n cost += backtrack(pos+1, visited)\n visited.remove(i)\n return cost\n return backtrack(1, set())\n","runtime":"900"},{"code":"\"\"\"\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n @functools.cache\n def solve(cur):\n if len(cur) == 1:\n return 1\n \n total = 0\n for j in range(len(cur)):\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\n total += solve(cur[:j] + cur[j+1:])\n \n return total\n \n return solve(tuple(range(1, n+1)))\n\"\"\" \n\n#\"\"\"\n# typical backtracking algorithm\nclass Solution:\n # Top down, cache the current array for higher speed, takes around 60 ms\n def countArrangement(self, n: int) -> int:\n def dfs(level): # pos: position to place a new number\n if level > n: \n nonlocal res\n res += 1\n return\n for i in range(1, n + 1):\n if i not in visited and (i % level == 0 or level % i == 0):\n visited.add(i)\n dfs(level + 1)\n visited.discard(i)\n\n res = 0\n visited = set()\n dfs(1)\n return res\n#\"\"\"\n\n\"\"\"\n# This is permutation problem\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n def dfs(pos):\n nonlocal res\n \n if pos > n: \n res += 1\n return\n \n for num in range(1, n + 1): \n if num not in visited and (num % pos == 0 or pos % num == 0): \n visited.add(num)\n dfs(pos + 1)\n visited.discard(num)\n \n res = 0\n visited = set()\n \n dfs(1)\n \n return res\n\"\"\"","runtime":"900"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n res = 0\n visit = [False]*n\n def dfs(i):\n nonlocal res\n if i == n+1:\n res += 1\n return \n for num in range(1, n+1):\n if (num % i ==0 or i % num == 0) and not visit[num-1]:\n visit[num-1] = True\n dfs(i+1)\n visit[num-1] = False\n\n dfs(1)\n return res","runtime":"917"},{"code":"class Solution:\n def helper(self, ind: int, n: int, seen_so_far: set, lsf: int):\n ssf = 0\n for i in range(1, n + 1):\n # print(seen_so_far, i, ind)\n if i in seen_so_far: continue\n if not (i % (ind + 1) == 0 or (ind + 1) % i == 0): continue \n\n # print(seen_so_far, i, ind, lsf)\n if ind == n - 1:\n ssf += 1\n else:\n ssf += self.helper(ind + 1, n, seen_so_far.union({i}), lsf + 1)\n return ssf\n\n def countArrangement(self, n: int) -> int:\n if n == 1:\n return 1\n ssf = 0\n for i in range(1, n + 1):\n ssf += self.helper(1, n, set([i]), 1)\n return ssf\n ","runtime":"917"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dp(i,bit):\n if i==n+1:\n return 1\n ans =0\n for num in range(1,n+1):\n if i%num == 0 or num%i == 0:\n if (bit&(1<<num)==0):\n ans += dp(i+1,bit|1<<num)\n \n return ans\n \n return dp(1,0)\n\n","runtime":"934"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.res = 0\n track = []\n used = [False]*n\n self.backtrack(n,track,used)\n\n return self.res\n\n \n def backtrack(self, n, track, used):\n if len(track)==n:\n self.res += 1\n return\n\n\n for i in range(n):\n if used[i]:\n continue\n if self.is_beautiful(len(track), i+1):\n track.append(i+1)\n used[i] = True\n self.backtrack(n,track,used)\n track.pop()\n used[i] = False\n\n def is_beautiful(self, i,num):\n return num%(i+1) == 0 or (i+1)%num == 0\n","runtime":"934"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def backstrap(pos :int, visited:int) -> int:\n if pos > n:\n return 1\n count = 0\n\n for i in range(1, n+1):\n if not visited & (1 << i) and (pos % i == 0 or i % pos == 0):\n count += backstrap(pos + 1, visited | (1<<i))\n return count\n\n return backstrap(1,0) ","runtime":"952"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(i, visited):\n if i == n + 1:\n return 1\n \n c = 0\n for j in range(1, n+1):\n if j not in visited and (j % i == 0 or i % j == 0):\n visited.add(j)\n c += dfs(i+1, visited)\n visited.remove(j)\n return c\n return dfs(1, set())","runtime":"952"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n memo = {}\n nums = tuple(list(range(1, n+1)))\n print(nums)\n return self.dfs(nums, memo, n)\n\n def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\n if pos == 1:\n return 1\n if nums in memo:\n return memo[nums]\n cnt = 0\n for i in range(len(nums)):\n if nums[i] % pos != 0 and pos % nums[i] != 0:\n continue\n cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\n memo[nums] = cnt\n return cnt\n\n def countArrangement(self, n: int) -> int:\n nums = list(range(1, n+1))\n return self.dfs(nums, set())\n\n def dfs(self, nums: List[int], visited: Set[int]) -> int:\n if len(visited) == len(nums):\n return 1\n cnt = 0\n for num in nums:\n if num in visited:\n continue \n if num % (len(visited)+1) != 0 and \\\n (len(visited)+1) % num != 0:\n continue \n visited.add(num)\n cnt += self.dfs(nums, visited)\n visited.remove(num)\n return cnt","runtime":"969"},{"code":"class Solution:\n # def countArrangement(self, n: int) -> int:\n # memo = {}\n # nums = tuple(list(range(1, n+1)))\n # print(nums)\n # return self.dfs(nums, memo, n)\n\n # def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\n # if pos == 1:\n # return 1\n # if nums in memo:\n # return memo[nums]\n # cnt = 0\n # for i in range(len(nums)):\n # if nums[i] % pos != 0 and pos % nums[i] != 0:\n # continue\n # cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\n # memo[nums] = cnt\n # return cnt\n\n def countArrangement(self, n: int) -> int:\n nums = list(range(1, n+1))\n return self.dfs(nums, set())\n\n def dfs(self, nums: List[int], visited: Set[int]) -> int:\n if len(visited) == len(nums):\n return 1\n cnt = 0\n for num in nums:\n if num in visited:\n continue \n if num % (len(visited)+1) != 0 and \\\n (len(visited)+1) % num != 0:\n continue \n visited.add(num)\n cnt += self.dfs(nums, visited)\n visited.remove(num)\n return cnt","runtime":"969"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # This problem is based on LC #46 - generate permutations. \n # Essentially we go and construct the permutations but only\n # if the new number added meets the the \"beautiful arrangement\"\n # property.\n ans = 0\n\n def dfs(path, visited):\n nonlocal ans\n if len(path) == n:\n ans += 1\n return\n \n for num in range(1, n+1):\n if num not in visited:\n new_index = len(path) + 1\n if new_index % num == 0 or num % new_index == 0:\n path.append(num)\n visited.add(num)\n dfs(path, visited)\n visited.remove(num)\n path.pop()\n \n dfs([], set())\n return ans","runtime":"986"},{"code":"class Solution:\n def helper(self, ind: int, n: int, seen_so_far: set):\n ssf = 0\n for i in range(1, n + 1):\n # print(seen_so_far, i, ind)\n if i in seen_so_far: continue\n if not (i % (ind + 1) == 0 or (ind + 1) % i == 0): continue \n\n # print(seen_so_far, i, ind, lsf)\n if ind == n - 1:\n ssf += 1\n else:\n ssf += self.helper(ind + 1, n, seen_so_far.union({i}))\n return ssf\n\n def countArrangement(self, n: int) -> int:\n if n == 1:\n return 1\n ssf = 0\n for i in range(1, n + 1):\n ssf += self.helper(1, n, set([i]))\n return ssf\n ","runtime":"986"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n res = 0\n unused = set([i for i in range(1, n+1)])\n cur_soln = []\n def backtracking():\n nonlocal res\n \n if len(cur_soln) == n:\n print(cur_soln[:])\n res += 1\n return\n else:\n for num in list(unused):\n idx = len(cur_soln)+1\n cur_soln.append(num)\n unused.remove(num)\n if idx%num == 0 or num % idx == 0:\n backtracking()\n cur_soln.pop()\n unused.add(num)\n \n \n \n backtracking()\n return res ","runtime":"1003"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # Example\n # n = 2, array [1, 2]\n # [1, 2], [2, 1]\n # answer = 2\n\n # n = 3, array [1, 2, 3]\n # [1, 2, 3], [2, 1, 3], [2, 3, 1], [1, 3, 2], [3, 1, 2], [3, 2, 1]\n # 1 1 0 0 0 1 \n # 3 not in that position \n\n # brute-force \n # go over all permutations O(n!)\n # check conditions O(n)\n # keep a counter\n\n # Recursion \n # O(n!)\n # make the array range(n)\n # make a helper function which takes in an array, and an index of where we are, and gives back a integer (counting)\n # edge cases: (the array is empty, return 0, there is a case array length is 1)\n # main cases: going over all elements, filling in position i, checking whether that position is ok and calling helper with what is left\n\n start_array : List[int] = list(range(1,n+1))\n\n def helper(input_array : List[int], position : int) -> int:\n if len(input_array) == 0:\n return 0\n if len(input_array) == 1:\n if position % input_array[0] == 0 or input_array[0] % position == 0:\n return 1\n else :\n return 0\n\n curr_sum : int = 0\n for i in range(len(input_array)):\n if i < len(input_array)-1: \n curr_array = input_array[:i] + input_array[i+1:]\n else:\n curr_array = input_array[:i]\n\n if position % input_array[i] == 0 or input_array[i] % position == 0:\n curr_sum += helper(curr_array, position+1)\n\n return curr_sum\n\n return helper(start_array, 1)","runtime":"1003"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def helper(n, ind, visited) -> int:\n if ind > n: return 1\n\n ct = 0\n for i in range(n):\n if (visited >> i) & 1:\n continue\n if (i+1) % ind == 0 or ind % (i+1) == 0:\n ct += helper(n, ind+1, visited | (1 << i))\n return ct\n return helper(n, 1, 0)","runtime":"1021"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def is_beautiful(arrangement, i):\n return (arrangement[i] % (i + 1) == 0) or ((i + 1) % arrangement[i] == 0)\n \n def backtrack(index):\n \n if index == n:\n return 1\n \n count = 0\n for num in range(1, n + 1):\n if not used[num]:\n arrangement[index] = num\n used[num] = True\n if is_beautiful(arrangement, index):\n count += backtrack(index + 1)\n used[num] = False\n return count\n arrangement = [0] * n\n used = [False] * (n + 1)\n \n return backtrack(0)\n ","runtime":"1021"},{"code":"class Solution:\n def __init__(self):\n self.count = 0\n\n def countArrangement(self, n: int) -> int:\n nums = [i for i in range(1, n+1)]\n self.permute(nums, 0)\n return self.count\n\n def permute(self, nums, l):\n if l == len(nums):\n self.count += 1\n for i in range(l, len(nums)):\n self.swap(nums, i, l)\n if nums[l] % (l + 1) == 0 or (l + 1) % nums[l] == 0:\n self.permute(nums, l+1)\n self.swap(nums, i, l)\n\n def swap(self, nums, x, y):\n nums[x], nums[y] = nums[y], nums[x]","runtime":"1038"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n ar = []\n for i in range(1, n + 1):\n ar.append(i)\n \n # print(ar)\n\n cnt = 0\n def back(ans, left):\n nonlocal cnt \n if len(ans) == n:\n cnt += 1\n # print(ans)\n return \n\n for i in range(len(left)):\n if left[i] != -1:\n if left[i] % (len(ans) + 1) == 0 or (len(ans) + 1) % left[i] == 0:\n ans.append(left[i])\n tmp = left[i]\n left[i] = -1\n back(ans[:], left[:])\n # left = [tmp] + left\n left[i] = tmp\n ans.pop()\n else:\n continue\n\n\n back([], ar)\n\n # print(cnt)\n return cnt\n","runtime":"1038"},{"code":"class Solution:\n def __init__(self):\n self.ct = 0\n\n def swap(self, vals, i, j):\n temp = vals[i]\n vals[i] = vals[j]\n vals[j] = temp\n\n def permute(self, idx, vals):\n\n for i in range(idx, len(vals)):\n # swap\n self.swap(vals, idx, i)\n # check and then permute\n if vals[idx] % (idx+1) == 0 or (idx+1) % vals[idx] == 0:\n self.permute(idx+1, vals)\n # if last index\n if idx == len(vals)-1:\n self.ct += 1\n # swap\n self.swap(vals, idx, i)\n\n def countArrangement(self, n: int) -> int:\n vals = [i+1 for i in range(n)]\n self.permute(0, vals)\n return self.ct\n","runtime":"1055"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.count = 0\n self.backtrack(n, 1, [])\n return self.count\n \n def backtrack(self, n: int, index: int, path: List[int]) -> None:\n # base case\n if index > n:\n self.count += 1\n return\n \n # logic\n for i in range(1, n + 1): # Iterate from 1 to n\n if i % index == 0 or index % i == 0:\n if i not in path:\n path.append(i)\n self.backtrack(n, index + 1, path)\n path.pop()\n\n","runtime":"1055"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n ar = []\n for i in range(1, n + 1):\n ar.append(i)\n\n cnt = 0\n def back(ans, left):\n nonlocal cnt \n if len(ans) == n:\n cnt += 1\n return \n\n for i in range(len(left)):\n if left[i] != -1:\n if left[i] % (len(ans) + 1) == 0 or (len(ans) + 1) % left[i] == 0:\n ans.append(left[i])\n tmp = left[i]\n left[i] = -1\n back(ans[:], left[:])\n left[i] = tmp\n ans.pop()\n else:\n continue\n\n\n back([], ar)\n \n return cnt\n","runtime":"1072"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def backtrack(s):\n nonlocal ans\n if len(s) == n:\n # for i in range(len(s)):\n # if s[i] % (i+1) != 0 and (i+1) % s[i] != 0:\n # flag = False\n ans+=1\n return\n for i in range(1,n+1):\n if i not in seen:\n pos = len(s) + 1\n if i % pos == 0 or pos % i == 0:\n seen.add(i)\n s.append(i)\n backtrack(s)\n s.pop()\n seen.remove(i)\n return\n ans = 0\n seen = set()\n for i in range(1, n+1):\n seen.add(i)\n backtrack([i])\n seen.remove(i)\n return ans\n\n ","runtime":"1072"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n arr = [0] * n\n used = set()\n\n def solve(i):\n if i == n:\n for j, num in enumerate(arr):\n if num % (j + 1) != 0 and (j + 1) % num != 0:\n return 0\n return 1\n \n ans = 0\n for num in range(1, n + 1):\n if num in used:\n continue\n elif num % (i + 1) != 0 and (i + 1) % num != 0:\n continue\n\n used.add(num)\n arr[i] = num\n ans += solve(i + 1)\n used.remove(num)\n \n return ans\n \n return solve(0)","runtime":"1090"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def solve(i, mask):\n if i == n: return 1\n ans = 0\n for e in range(n):\n if (1 << e) & mask or (e + 1) % (i + 1) and (i + 1) % (e + 1): continue\n mask ^= 1 << e\n ans += solve(i + 1, mask)\n mask ^= 1 << e\n return ans\n return solve(0, 0)\n ","runtime":"1090"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n ar = []\n for i in range(1, n + 1):\n ar.append(i)\n \n # print(ar)\n\n cnt = 0\n def back(ans, left):\n nonlocal cnt \n if len(ans) == n:\n cnt += 1\n print(ans)\n return \n\n for i in range(len(left)):\n if left[i] != -1:\n if left[i] % (len(ans) + 1) == 0 or (len(ans) + 1) % left[i] == 0:\n ans.append(left[i])\n tmp = left[i]\n left[i] = -1\n back(ans[:], left[:])\n # left = [tmp] + left\n left[i] = tmp\n ans.pop()\n else:\n continue\n\n\n back([], ar)\n\n # print(cnt)\n return cnt\n","runtime":"1107"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def check(num, i):\n return num % i == 0 or i % num == 0\n\n def backtrack(mask, idx):\n nonlocal count \n\n if idx > n:\n count += 1\n return\n for num in range(1, n + 1):\n if mask & (1 << num) == 0 and check(num, idx):\n mask ^= (1 << num)\n backtrack(mask, idx + 1)\n mask ^= (1 << num)\n\n count = 0\n backtrack(0, 1)\n return count","runtime":"1107"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n def backtrack(i=0, mask=0):\n if i == n: return 1\n ans = 0\n for p in range(n):\n if (mask >> p) & 1: continue\n if (p + 1) % (i + 1) != 0 and (i + 1) % (p + 1) != 0: continue\n mask |= (1 << p)\n ans += backtrack(i + 1, mask)\n mask ^= (1 << p)\n return ans\n return backtrack()","runtime":"1124"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def f(i, st):\n if i-1 == n:\n print(st)\n return int(st == (1 << n)-1)\n res = 0\n for x in range(1,n+1):\n if 1<<(x-1) &st:\n continue\n # st.add(x)\n if i % x == 0 or x % i == 0:\n res += f(i+1,1<<(x-1)|st)\n # st.remove(x)\n return res\n return f(1, 0)","runtime":"1124"},{"code":"class Solution:\n def __init__(self):\n self.res = 0\n self.seen = 0\n\n def solve(self, idx, nums):\n if idx == len(nums) + 1:\n self.res += 1\n return\n\n for i in range(len(nums)):\n if not (self.seen & (1 << nums[i])) and (nums[i] % idx == 0 or idx % nums[i] == 0):\n self.seen ^= (1 << nums[i])\n self.solve(idx + 1, nums)\n self.seen ^= (1 << nums[i])\n\n def countArrangement(self, n):\n if n < 4:\n return n\n nums = [i for i in range(1, n + 1)]\n self.solve(1, nums)\n return self.res","runtime":"1141"},{"code":"class Solution:\n def __init__(self):\n self.res = 0\n\n\n def countArrangement(self, n: int) -> int:\n visited = [False] * n\n self.dfs([], n, visited)\n return self.res\n\n \n def dfs(self, path: List[int], n: int, visited: List[bool]) -> None:\n if len(path) == n:\n self.res += 1\n return\n \n for i in range(1, n + 1):\n if visited[i - 1]:\n continue\n if not self.is_valid(path, i):\n continue\n path.append(i)\n visited[i - 1] = True\n\n self.dfs(path, n, visited)\n\n path.pop()\n visited[i - 1] = False\n\n \n def is_valid(self, nums: List[int], n: int) -> bool:\n return n % (len(nums) + 1) == 0 or (len(nums) + 1) % n == 0 \n ","runtime":"1159"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.count = 0\n self.backtrack(n, 1, [])\n return self.count\n def backtrack(self, N, idx, temp):\n if len(temp) == N:\n self.count += 1\n return \n for i in range(1, N+1):\n if i not in temp and (i % idx == 0 or idx % i == 0):\n temp.append(i)\n self.backtrack(N, idx+1, temp)\n temp.pop() ","runtime":"1176"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n permutations = 0\n visited = set()\n\n def isValid(index, num):\n return index % num == 0 or num % index == 0\n\n def bt(nums):\n nonlocal permutations\n if len(nums) == n:\n permutations += 1\n return\n\n for nei in range(1, n + 1):\n if nei in visited or not isValid(len(nums)+1, nei):\n continue\n nums.append(nei)\n visited.add(nei)\n bt(nums)\n visited.remove(nums.pop())\n\n bt([])\n return permutations \n","runtime":"1176"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.count = 0\n self.backtrack(n, 1, [])\n return self.count\n \n def backtrack(self, N, idx, temp):\n if len(temp) == N:\n self.count += 1\n return\n \n for i in range(1, N+1):\n if i not in temp and (i % idx == 0 or idx % i == 0):\n temp.append(i)\n self.backtrack(N, idx+1, temp)\n temp.pop()","runtime":"1193"},{"code":"class Solution:\n def countArrangement(self, N: int) -> int:\n if N == 0:\n return 0\n nums = list(range(1, N + 1))\n used = [False] * N\n p, res = [], []\n self.generatePermutation526(nums, 0, p, res, used)\n return len(res)\n\n def generatePermutation526(self, nums, index, p, res, used):\n if index == len(nums):\n res.append(p[:])\n return\n for i in range(len(nums)):\n if not used[i]:\n if not self.checkDivisible(nums[i], len(p) + 1) and not self.checkDivisible(len(p) + 1, nums[i]):\n continue\n used[i] = True\n p.append(nums[i])\n self.generatePermutation526(nums, index + 1, p, res, used)\n p.pop()\n used[i] = False\n\n def checkDivisible(self, num, d):\n return num % d == 0","runtime":"1193"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.count = 0\n self.backtrack(n, 1, [])\n return self.count\n \n def backtrack(self, N, idx, temp):\n if len(temp) == N:\n self.count += 1\n return\n \n for i in range(1, N+1):\n if i not in temp and (i % idx == 0 or idx % i == 0):\n temp.append(i)\n self.backtrack(N, idx+1, temp)\n temp.pop()","runtime":"1210"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def backtrack(index, arrangement):\n if index == n + 1:\n result.append(arrangement[:])\n return\n \n for num in range(1, n + 1):\n if num not in arrangement and (num % index == 0 or index % num == 0):\n arrangement.append(num)\n backtrack(index + 1, arrangement)\n arrangement.pop()\n \n result = []\n backtrack(1, [])\n return len(result)","runtime":"1210"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(num_digits, path):\n if num_digits == n + 1:\n # print(path)\n return 1\n \n res = 0\n for i in range(1, n + 1):\n if i in path:\n continue\n\n # print(num_digits, i, num_digits % i, i % num_digits)\n if num_digits % i != 0 and i % num_digits != 0:\n continue\n \n path.append(i)\n res += dfs(num_digits + 1, path)\n path.pop()\n\n return res\n return dfs(1, [])","runtime":"1228"},{"code":"an=0\nclass Solution:\n def countArrangement(self, n: int) -> int:\n global an\n def ans(k,s):\n global an\n if k==n+1:\n an+=1\n return\n for i in range(1,n+1):\n if i not in s:\n if k%i==0 or i%k==0:\n s.append(i)\n ans(k+1,s.copy())\n s.pop()\n return\n an=0\n p=list()\n ans(1,p)\n return an","runtime":"1228"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n def backtracking(start, perm, L):\n if perm and perm[-1] % L != 0 and L % perm[-1] != 0:\n return\n if L == n:\n self.res += 1\n return\n for i in range(1, n+1):\n if not used[i]:\n used[i] = True\n backtracking(i+1, perm+[i], L+1)\n used[i] = False\n \n self.res = 0\n used = [False] * (n+1)\n backtracking(1, [], 0)\n return self.res","runtime":"1245"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(num, used):\n if len(used) and (num % len(used) != 0 and len(used) % num != 0):\n return 0\n if len(used) == n:\n return 1\n res = 0\n for i in range(1, n + 1):\n if i not in used:\n used[i] = None\n res += dfs(i, used)\n used.pop(i)\n return res\n return dfs(0, {})","runtime":"1245"},{"code":"class Solution:\n def build(self, curList: set, n):\n if (len(curList) == n):\n return 1\n totalSum = 0\n for i in range(1, n + 1):\n nextIndex = len(curList) + 1\n if (i % nextIndex == 0 or nextIndex % i == 0) and i not in curList:\n curList.add(i)\n totalSum += self.build(curList, n)\n curList.remove(i)\n return totalSum\n\n def countArrangement(self, n):\n return self.build(set(), n)\n\n","runtime":"1262"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n ans = 0\n \n def dfs(idx,lst,seen):\n nonlocal ans\n \n if idx==len(lst)+1:\n ans+=1\n \n for i in range(len(lst)):\n \n if not (seen & (1<<lst[i])) and (lst[i]%idx ==0 or idx%lst[i]==0):\n seen^=1<<lst[i]\n dfs(idx+1,lst,seen)\n seen^=1<<lst[i]\n \n \n lst = []\n \n for x in range(1,n+1):\n lst.append(x)\n \n dfs(1,lst,0)\n \n return ans\n \n ","runtime":"1262"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n ans = []\n def permute(arr, ans):\n # print(ans)\n if len(arr) == n:\n ans.append(arr.copy())\n return 0\n for i in range(1, n+1):\n if i not in arr and (not i%(len(arr)+1) or not (len(arr)+1)%i):\n arr.append(i)\n permute(arr, ans)\n arr.pop()\n return 0\n permute([], ans)\n return len(ans)","runtime":"1279"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n ans = 0\n def backtrack(cur):\n nonlocal ans\n if len(cur) == n:\n ans += 1\n return\n for e in range(1, n + 1):\n if e not in cur and ( (e % (len(cur) + 1) == 0 or (len(cur) + 1) % e == 0) ) :\n cur.append(e)\n backtrack(cur)\n cur.pop()\n\n for i in range(1, n + 1):\n backtrack([i])\n return ans\n ","runtime":"1279"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n def findPermutations(current):\n total = 0\n if len(current) == n:\n print(current.copy())\n return 1\n\n next_i = len(current) + 1\n for num in range(1, n+1):\n if num not in current:\n if next_i % num == 0 or num % next_i == 0:\n total += findPermutations(current + [num])\n \n return total\n \n return findPermutations([])","runtime":"1296"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n visited=set()\n result=0\n def recurse(visited,currNo):\n nonlocal result\n if len(visited)%currNo !=0 and currNo%len(visited)!=0:\n return\n if len(visited)==n:\n result+=1\n for i in range(1,n+1):\n if i not in visited:\n visited.add(i)\n recurse(visited,i)\n visited.remove(i)\n\n recurse(visited,1)\n return result","runtime":"1296"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n visited=set()\n\n count = 0\n def helper(i):\n nonlocal count\n if len(visited) % i != 0 and i % len(visited) != 0:\n return \n if len(visited) == n:\n count += 1\n return\n \n for i in range(1,n+1):\n if i not in visited:\n visited.add(i)\n helper(i)\n visited.remove(i)\n \n helper(1)\n return count\n\n ","runtime":"1331"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n def backtracking(start, L):\n if L == n:\n self.res += 1\n return\n for i in range(1, n+1):\n c = i % (L+1) != 0 and (L+1) % i != 0\n if not used[i] and not c:\n used[i] = True\n backtracking(i+1, L+1)\n used[i] = False\n \n self.res = 0\n used = [False] * (n+1)\n backtracking(1, 0)\n return self.res","runtime":"1331"},{"code":"class Solution:\n def build(self, curList: set, n):\n if (len(curList) == n):\n return 1\n totalSum = 0\n for i in range(1, n + 1):\n nextIndex = len(curList) + 1\n if (i % nextIndex == 0 or nextIndex % i == 0) and i not in curList:\n tempList = curList.copy()\n tempList.add(i)\n totalSum += self.build(tempList, n)\n return totalSum\n\n def countArrangement(self, n):\n return self.build(set(), n)\n\n","runtime":"1348"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n cnt = 0\n\n def backtrack(ans):\n\n nonlocal cnt\n\n if len(ans) == n:\n \n cnt += 1\n return\n \n for num in range(1, n + 1):\n i = len(ans) + 1\n if num not in ans and not (num % i and i % num):\n ans.append(num)\n backtrack(ans)\n ans.pop()\n backtrack([])\n\n return cnt\n \n \n\n\n","runtime":"1348"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n ans = 0\n def backtrack(cur):\n nonlocal ans\n if len(cur) == n:\n ans += 1\n return\n for e in range(1, n + 1):\n if e not in cur and (len(cur) == 0 or (e % (len(cur) + 1) == 0 or (len(cur) + 1) % e == 0) ) :\n cur.append(e)\n backtrack(cur)\n cur.pop()\n\n backtrack([])\n return ans\n ","runtime":"1365"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n def bt(index,curr):\n\n if len(curr)==n:\n if len(set(curr))==n:\n ans.append(curr[:])\n return\n for i in range(1,n+1):\n if i not in curr:\n curr.append(i)\n j = len(curr)\n if (j)%i==0 or i%(j)==0:\n # print(curr)\n bt(i+1,curr)\n curr.pop()\n \n ans= []\n bt(1,[])\n return len(ans)","runtime":"1365"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n res = [0]\n \n def backtrack(curr, lis, idx, n, res):\n \n if len(curr) == n:\n res[0] += 1\n return\n \n for i in range(n):\n if lis[i] not in curr and (lis[i] % idx == 0 or idx % lis[i] == 0):\n curr.append(lis[i])\n backtrack(curr, lis, idx + 1, n, res)\n curr.pop()\n \n backtrack([], list(range(1, n + 1)), 1, n, res)\n return res[0]\n","runtime":"1383"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n ans = 0\n def backtrack(cur):\n nonlocal ans\n if len(cur) == n:\n ans += 1\n return\n for e in range(1, n + 1):\n if e not in cur and (len(cur) == 0 or (e % (len(cur) + 1) == 0 or (len(cur) + 1) % e == 0) ) :\n cur.append(e)\n backtrack(cur)\n cur.pop()\n\n backtrack([])\n return ans\n ","runtime":"1383"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n res=0\n\n def backtrack(path):\n nonlocal res\n if len(path)==n:\n res+=1\n return\n\n for j in range(1,n+1):\n m = len(path)+1\n if j not in path and (j%m==0 or m%j==0):\n path.append(j)\n backtrack(path)\n path.pop()\n\n backtrack([])\n\n return res","runtime":"1400"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(idx, cur):\n if idx == n+1:\n return 1\n ans = 0\n for i in range(1, n+1):\n if i in cur:\n continue\n if i % (len(cur) + 1) == 0 or (len(cur) + 1) % i == 0:\n cur.append(i)\n ans += dfs(idx+1, cur)\n cur.pop()\n return ans\n\n \n return dfs(1, [])","runtime":"1400"}],"string":"[\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n return [1,2,3,8,10,36,41,132,250,700,750,4010,4237,10680,24679][n-1]\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n return [1,2,3,8,10,36,41,132,250,700,750,4010,4237,10680,24679][n-1]\\n \\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n @lru_cache(None)\\n def dfs(bm, pl):\\n if pl == 0: return 1\\n \\n S = 0\\n for i in range(n):\\n if not bm&1<<i and ((i+1)%pl == 0 or pl%(i+1) == 0):\\n S += dfs(bm^1<<i, pl - 1)\\n return S\\n \\n return dfs(0, n)\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n memo = {}\\n nums = tuple(list(range(1, n+1)))\\n return self.dfs(nums, memo, n)\\n \\n def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\\n if pos == 1:\\n return 1 \\n if nums in memo:\\n return memo[nums]\\n cnt = 0 \\n for i in range(len(nums)):\\n if nums[i] % pos != 0 and pos % nums[i] != 0:\\n continue\\n cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\\n memo[nums] = cnt \\n return cnt \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, N: int) -> int:\\n \\\"\\\"\\\"\\n index: 1 2\\n 1 2\\n\\n\\n \\\"\\\"\\\"\\n @cache\\n def solve(bitmask, n):\\n if n > N:\\n return 1\\n\\n ans = 0\\n for i in range(1, N + 1):\\n if (bitmask & (1 << i)) == 0: # unused\\n if i % n == 0 or n % i == 0:\\n ans += solve(bitmask | (1 << i), n + 1) \\n return ans\\n return solve(1, 1) \",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.ans=0\\n \\n def countArrangement(self, n: int) -> int:\\n \\n\\n def backtrack(left, end):\\n # left is the left array to be put; end is the starting points\\n if end==1: \\n self.ans+=1\\n return \\n\\n for i in left:\\n if end%i==0 or i%end==0:\\n left_copy=list(left)\\n left_copy.remove(i)\\n backtrack(left_copy, end-1)\\n \\n backtrack([i for i in range(1,n+1)], n)\\n return self.ans\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"from functools import cache\\nclass Solution:\\n def countArrangement(self, n: int) -> int:\\n '''\\n bitmask\\n '''\\n\\n @cache\\n def func(taken,i):\\n if taken == 0:\\n return 1\\n count = 0\\n for j in range(1,n+1):\\n if taken&(1<<(j-1)) and (j%i == 0 or i%j == 0):\\n count += func(taken^(1<<(j-1)),i+1)\\n return count\\n\\n ans = func((1<<n)-1,1)\\n return ans\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n u = (1<<n) - 1\\n @cache \\n def dfs(s:int)->int:\\n if s == u:\\n return 1\\n res = 0\\n i = s.bit_count() + 1\\n for j in range(1, n+1):\\n if s>>(j-1) & 1 == 0 and (i%j == 0 or j % i == 0):\\n res += dfs(s | 1<<(j-1))\\n return res\\n return dfs(0) \",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def count(i, X):\\n if i == 1:\\n return 1\\n return sum(count(i - 1, X - {x})\\n for x in X\\n if x % i == 0 or i % x == 0)\\n\\n return count(n, set(range(1, n + 1)))\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, cur: int, n: int) -> int:\\n if cur == n:\\n return 1\\n elif (self.visited, cur) in self.cache:\\n return self.cache[(self.visited, cur)]\\n else:\\n total = 0\\n for i in range(n):\\n if (self.visited & (1<<i)) != 0:\\n continue\\n if (cur+1)%(i+1) == 0 or (i+1)%(cur+1) == 0:\\n origin_visited = self.visited\\n self.visited = (self.visited | (1<<i))\\n res = self.dfs(cur+1, n)\\n self.visited = origin_visited\\n total += res\\n self.cache[(self.visited, cur)] = total\\n return total\\n \\n def countArrangement(self, n: int) -> int:\\n self.visited = 0\\n self.cache = {}\\n res = self.dfs(0, n)\\n return res\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n states = 1 << n\\n dp = [0 for _ in range(states)]\\n dp[0] = 1\\n \\n for state in range(states):\\n ones = bin(state).count('1')\\n for k in range(1, n + 1):\\n if state & (1 << (k - 1)) and (k % ones == 0 or ones % k == 0):\\n dp[state] += dp[state & ~(1 << (k - 1))]\\n return dp[states - 1]\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def f(self, used: List[str], l: List[int], d: Dict[str, int]) -> int:\\n used.sort()\\n k: str = '_'.join([str(x) for x in used])\\n k = f'0_{k}'\\n\\n if k in d.keys():\\n return d[k] \\n\\n if len(l) == 0:\\n d[k] = 1\\n return 1\\n\\n cnt: int = 0\\n for i in l:\\n index: int = len(used) + 1\\n if i % index == 0 or index % i == 0:\\n used2 = used + [i]\\n l2 = list(l)\\n l2.remove(i)\\n cnt += self.f(used2, l2, d)\\n\\n d[k] = cnt\\n return d[k]\\n\\n def countArrangement(self, n: int) -> int:\\n return self.f([], [x for x in range(1, n + 1)], dict())\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def genPermutation(start: int, comb: List[int]):\\n if start == n:\\n self.count += 1\\n return\\n for i in range(start, n + 1):\\n if comb[i] % (start + 1) == 0 or (start + 1) % comb[i] == 0:\\n comb[start], comb[i] = comb[i], comb[start]\\n genPermutation(start + 1, comb)\\n comb[start], comb[i] = comb[i], comb[start]\\n self.count = 0\\n genPermutation(1, [i for i in range(n + 1)])\\n return self.count\\n\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n finish = n + 1\\n permut = [i for i in range(finish)]\\n count = 0\\n def genPermutation(start: int, comb: List[int]):\\n if start == n:\\n nonlocal count\\n count += 1\\n return\\n for i in range(start, finish):\\n combI = comb[i]\\n start1 = start + 1\\n if combI % start1 == 0 or start1 % combI == 0:\\n combStart = comb[start]\\n comb[start], comb[i] = combI, combStart\\n genPermutation(start1, comb)\\n comb[start], comb[i] = combStart, combI\\n genPermutation(1, permut)\\n return count \",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(i):\\n nonlocal ans, n\\n if i == n + 1:\\n ans += 1\\n return\\n for j in match[i]:\\n if not vis[j]:\\n vis[j] = True\\n dfs(i + 1)\\n vis[j] = False\\n\\n ans = 0\\n vis = [False] * (n + 1)\\n match = defaultdict(list)\\n for i in range(1, n + 1):\\n for j in range(1, n + 1):\\n if j % i == 0 or i % j == 0:\\n match[i].append(j)\\n\\n dfs(1)\\n return ans\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n variants = [[] for _ in range(n+1)]\\n \\n for i in range(1,n+1):\\n variants[i].append(i)\\n \\n for j in range(2*i, n+1, i):\\n variants[j].append(i)\\n variants[i].append(j)\\n \\n visited = [False] * (n+1)\\n self.ans = 0\\n \\n def dfs(x):\\n if x == n + 1:\\n self.ans += 1\\n return\\n \\n \\n for y in variants[x]:\\n if visited[y]:\\n continue\\n \\n visited[y] = True\\n dfs(x+1)\\n visited[y] = False\\n \\n dfs(1)\\n return self.ans\\n \",\n \"runtime\": \"193\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(position):\\n nonlocal count, n\\n if position == n + 1:\\n count += 1\\n return\\n for number in matches[position]:\\n if not visited[number]:\\n visited[number] = True\\n dfs(position + 1)\\n visited[number] = False\\n\\n count = 0\\n visited = [False] * (n + 1)\\n matches = defaultdict(list)\\n for i in range(1, n + 1):\\n for j in range(1, n + 1):\\n if j % i == 0 or i % j == 0:\\n matches[i].append(j)\\n\\n dfs(1)\\n return count\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n res = [0]\\n def dfs(path, end):\\n if end==1:\\n res[0] += 1\\n for i in range(n, 0, -1):\\n if i not in path:\\n if end % i == 0 or i % end == 0:\\n dfs(path + [i], end-1)\\n dfs([], n)\\n return res[0]\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(position):\\n nonlocal count,n\\n if position==n+1:\\n count+=1\\n return\\n for numbers in matches[position]:\\n if not visited[numbers]:\\n visited[numbers]=True\\n dfs(position+1)\\n visited[numbers]=False\\n count=0\\n visited=[False]*(n+1)\\n matches=defaultdict(list)\\n for i in range(1,n+1):\\n for j in range(1,n+1):\\n if j%i==0 or i%j==0:\\n matches[i].append(j)\\n dfs(1)\\n return count\\n\\n \",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(i):\\n nonlocal ans, n\\n if i == n + 1:\\n ans += 1\\n return\\n for j in match[i]:\\n if not vis[j]:\\n vis[j] = True\\n dfs(i + 1)\\n vis[j] = False\\n\\n ans = 0\\n vis = [False] * (n + 1)\\n match = defaultdict(list)\\n for i in range(1, n + 1):\\n for j in range(1, n + 1):\\n if j % i == 0 or i % j == 0:\\n match[i].append(j)\\n\\n dfs(1)\\n return ans\",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"def solve(n, i, exclude=set()):\\n dom = set([j for j in range(1, n + 1) if i % j == 0 or j % i == 0]).difference(exclude)\\n if i == 1:\\n return len(dom)\\n else:\\n k = 0\\n for d in dom:\\n k += solve(n, i - 1, exclude.union([d]))\\n return k\\n\\nclass Solution:\\n def countArrangement(self, n: int) -> int:\\n return solve(n, n)\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n valid = [[] for _ in range(n + 1)]\\n for index in range(1, n + 1):\\n for v in range(1, n + 1):\\n if index % v == 0 or v % index == 0:\\n valid[index].append(v)\\n # print(valid)\\n\\n def dfs(vis, index):\\n if index == n + 1:\\n return 1\\n ans = 0\\n for v in valid[index]:\\n if vis[v] == 0:\\n vis[v] = 1\\n ans += dfs(vis, index + 1)\\n vis[v] = 0\\n return ans\\n \\n visited = [0 for _ in range(n + 1)]\\n return dfs(visited, 1)\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n memo = [[-1] * (1 << n) for _ in range(n + 1)]\\n\\n def dfs(i, state):\\n if i > n:\\n return 1\\n if memo[i][state] > 0:\\n return memo[i][state]\\n total = 0\\n for j in range(1, n + 1):\\n if not state & (1 << (j - 1)) and (j % i == 0 or i % j == 0):\\n state |= 1 << (j - 1)\\n total += dfs(i + 1, state)\\n state ^= 1 << (j - 1)\\n memo[i][state] = total\\n return memo[i][state]\\n\\n return dfs(1, 0)\\n\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n permi = [[] for _ in range(n)]\\n for i in range(n):\\n for j in range(1, n+1):\\n if j%(i+1)==0 or (i+1)%j==0:\\n permi[i].append(j)\\n \\n def count(i, taken=set()):\\n if len(taken)==n:\\n return 1\\n ans = 0\\n for pi in permi[i]:\\n if pi not in taken:\\n taken.add(pi)\\n ans += count(i+1, taken)\\n taken.remove(pi)\\n return ans \\n return count(0)\",\n \"runtime\": \"279\"\n },\n {\n \"code\": \"class Solution:\\n # def countArrangement(self, n: int) -> int:\\n # # dp = {1: 1, 2: 2, 3: 3}\\n # # if n in dp:\\n # # return dp[n]\\n # count = 0\\n # path = set()\\n\\n # def backtrack(start: int):\\n # nonlocal count\\n # if len(path) == n:\\n # count += 1\\n # return\\n\\n # for ind in range(1, n + 1):\\n # if ind in path:\\n # continue\\n # new_pos = len(path) + 1\\n # if ind % new_pos == 0 or new_pos % ind == 0:\\n # path.add(ind)\\n # backtrack(ind + 1)\\n # path.remove(ind)\\n\\n # backtrack(1)\\n # return count\\n\\n # def countArrangement(self, n: int) -> int:\\n # \\\"\\\"\\\"DP\\\"\\\"\\\"\\n # dp = {\\n # 1: 1,\\n # 2: 2,\\n # 3: 3,\\n # 4: 8,\\n # 5: 10,\\n # 6: 36,\\n # 7: 41,\\n # 8: 132,\\n # 9: 250,\\n # 10: 700,\\n # 11: 750,\\n # 12: 4010,\\n # 13: 4237,\\n # 14: 10680,\\n # 15: 24679,\\n # }\\n # return dp[n]\\n\\n def countArrangement(self, n: int) -> int:\\n divisible = [[1] for _ in range(n)]\\n divisible[0] = list(range(1, n + 1))\\n\\n for pos in range(2, n + 1):\\n divisible[pos - 1].append(pos)\\n for val in range(pos + 1, n + 1):\\n if val % pos == 0:\\n divisible[pos - 1].append(val)\\n divisible[val - 1].append(pos)\\n\\n count = 0\\n path = set()\\n\\n def backtrack(start: int):\\n nonlocal count\\n if len(path) == n:\\n count += 1\\n return\\n\\n for val in divisible[start]:\\n if val in path:\\n continue\\n path.add(val)\\n backtrack(start + 1)\\n path.remove(val)\\n\\n backtrack(0)\\n return count\",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n # def countArrangement(self, n: int) -> int:\\n # # dp = {1: 1, 2: 2, 3: 3}\\n # # if n in dp:\\n # # return dp[n]\\n # count = 0\\n # path = set()\\n\\n # def backtrack(start: int):\\n # nonlocal count\\n # if len(path) == n:\\n # count += 1\\n # return\\n\\n # for ind in range(1, n + 1):\\n # if ind in path:\\n # continue\\n # new_pos = len(path) + 1\\n # if ind % new_pos == 0 or new_pos % ind == 0:\\n # path.add(ind)\\n # backtrack(ind + 1)\\n # path.remove(ind)\\n\\n # backtrack(1)\\n # return count\\n\\n # def countArrangement(self, n: int) -> int:\\n # \\\"\\\"\\\"DP\\\"\\\"\\\"\\n # dp = {\\n # 1: 1,\\n # 2: 2,\\n # 3: 3,\\n # 4: 8,\\n # 5: 10,\\n # 6: 36,\\n # 7: 41,\\n # 8: 132,\\n # 9: 250,\\n # 10: 700,\\n # 11: 750,\\n # 12: 4010,\\n # 13: 4237,\\n # 14: 10680,\\n # 15: 24679,\\n # }\\n # return dp[n]\\n\\n def countArrangement(self, n: int) -> int:\\n divisible = [[1] for _ in range(n)]\\n divisible[0] = list(range(1, n + 1))\\n\\n for pos in range(2, n + 1):\\n divisible[pos - 1].append(pos)\\n for val in range(pos + 1, n + 1):\\n if val % pos == 0:\\n divisible[pos - 1].append(val)\\n divisible[val - 1].append(pos)\\n\\n count = 0\\n path = set()\\n\\n def backtrack(start: int):\\n nonlocal count\\n if len(path) == n:\\n count += 1\\n return\\n\\n for val in divisible[start]:\\n if val in path:\\n continue\\n path.add(val)\\n backtrack(start + 1)\\n path.remove(val)\\n\\n backtrack(0)\\n return count\",\n \"runtime\": \"314\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n permi = [[] for _ in range(n)]\\n for i in range(1, n+1):\\n for j in range(1, n+1):\\n if j%i==0 or i%j==0:\\n permi[i-1].append(j)\\n \\n def count(i, taken=set()):\\n if len(taken)==n:\\n return 1\\n ans = 0\\n for pi in permi[i]:\\n if pi not in taken:\\n taken.add(pi)\\n ans += count(i+1, taken)\\n taken.remove(pi)\\n return ans \\n return count(0)\",\n \"runtime\": \"331\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n neighbors = {\\n v: [\\n n for n in range(1,n+1) if (0 in [n % v, v % n])\\n ]\\n for v in range(1, n+1)\\n }\\n # print(neighbors)\\n\\n count = 0\\n cur = set([])\\n\\n def backtrack():\\n nonlocal count\\n l = len(cur)\\n if l == n:\\n count += 1\\n return \\n \\n for neighbor in neighbors[l+1]:\\n if neighbor not in cur:\\n cur.add(neighbor)\\n backtrack()\\n cur.remove(neighbor)\\n\\n\\n backtrack()\\n return count\\n\\n\\n \",\n \"runtime\": \"331\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def countArrangement(self, n: int) -> int:\\n possibilities = defaultdict(set)\\n for i in range(1, n + 1):\\n for j in range(i, n + 1, i):\\n possibilities[i].add(j)\\n possibilities[j].add(i)\\n\\n #print(possibilities)\\n def helper(idx: int, used: Set[int]) -> int:\\n #print(idx, used)\\n if idx == n + 1:\\n return 1\\n count = 0\\n for cand in possibilities[idx]:\\n if cand in used:\\n continue\\n used.add(cand)\\n count += helper(idx + 1, used)\\n used.remove(cand)\\n return count\\n return helper(1, set())\\n\",\n \"runtime\": \"348\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n dit = collections.defaultdict(list)\\n for i in range(1, n+1):\\n for j in range(1, n+1):\\n if i % j==0 or j%i==0:\\n dit[i].append(j)\\n\\n self.n = n\\n self.cnt = 0\\n self.visited = set()\\n self.dfs(1, dit)\\n\\n return self.cnt\\n \\n\\n def dfs(self, index, dit):\\n if index == self.n+1:\\n self.cnt +=1\\n return\\n\\n for x in dit[index]:\\n if x not in self.visited:\\n self.visited.add(x)\\n self.dfs(index+1, dit)\\n self.visited.discard(x)\\n\\n return\\n \\n \\n \\n\\n\\n\\n \",\n \"runtime\": \"348\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n graph = {\\n 1: list(range(1, 16)),\\n 2: [1, 2, 4, 6, 8, 10, 12, 14],\\n 3: [1, 3, 6, 9, 12, 15],\\n 4: [1, 2, 4, 8, 12],\\n 5: [1, 5, 10, 15],\\n 6: [1, 2, 3, 6, 12],\\n 7: [1, 7, 14],\\n 8: [1, 2, 4, 8],\\n 9: [1, 3, 9],\\n 10: [1, 2, 5, 10],\\n 11: [1, 11],\\n 12: [1, 2, 3, 4, 6, 12],\\n 13: [1, 13],\\n 14: [1, 2, 7, 14],\\n 15: [1, 3, 5, 15]\\n }\\n return self.dfs(graph, n, 1, 1, {})\\n \\n def dfs(self, graph, n, i, length, visited):\\n if length == n + 1:\\n return 1\\n count = 0\\n for k in graph[i]:\\n if k > n or visited.get(k, False):\\n continue\\n visited[k] = True\\n count += self.dfs(graph, n, i + 1, length + 1, visited)\\n visited[k] = False\\n return count\\n\",\n \"runtime\": \"366\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n '''\\n n = 4\\n 1 -> 1 2 3 4 \\n 2 -> 1 2 4\\n 3 -> 1 3\\n 4 -> 1 2 4\\n '''\\n res_list = [[i for i in range(1, n+1)]]\\n for i in range(2, n+1):\\n tmp_list = []\\n for j in range(1, n+1):\\n if i % j == 0 or j % i == 0:\\n tmp_list.append(j)\\n res_list.append(tmp_list)\\n \\n self.visited = set()\\n def backtrack(path):\\n if len(path) == n:\\n self.visited.add(tuple(path))\\n return\\n\\n for val in res_list[(len(path))]:\\n if val not in path:\\n path.append(val)\\n backtrack(path)\\n path.pop()\\n\\n backtrack([])\\n return len(self.visited)\",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def canPutAt(self, pos, v):\\n if pos == 1 or v == 1:\\n return True\\n return v % pos == 0 or pos % v == 0\\n def count(self, n, posOfV, vOfPos, leftV, pos):\\n if not leftV:\\n return 0\\n elif pos == n:\\n return 1 if leftV.pop() in vOfPos[pos] else 0\\n else:\\n result = 0\\n for v in vOfPos[pos]:\\n if v in leftV:\\n newLeftV = leftV.copy()\\n newLeftV.remove(v)\\n result += self.count(n, posOfV, vOfPos, newLeftV, pos + 1)\\n return result\\n def countArrangement(self, n: int) -> int:\\n posOfV = {}\\n vOfPos = {}\\n for pos in range(1, n + 1):\\n for v in range(1, n + 1):\\n if self.canPutAt(pos, v):\\n vSet = vOfPos.setdefault(pos, set())\\n vSet.add(v)\\n posSet = posOfV.setdefault(v, set())\\n posSet.add(pos)\\n leftV = set(range(1, n + 1))\\n return self.count(n, posOfV, vOfPos, leftV, 1)\\n \",\n \"runtime\": \"383\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n graph = defaultdict(list)\\n for num in range(1, n + 1):\\n for i in range(1, n + 1):\\n if num % i == 0 or i % num == 0:\\n graph[num].append(i)\\n \\n def backtrack(i, used):\\n nonlocal ans\\n if i > n:\\n ans += 1\\n return\\n for j in graph[i]:\\n if j not in used:\\n backtrack(i + 1, used | {j})\\n ans = 0\\n backtrack(1, set())\\n return ans\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n if n == 0:\\n return 0\\n #for n in range(1, 16):\\n #print(f'{n=}')\\n m = [[] for _ in range(n)]\\n for i in range(1, n+1):\\n for j in range(1, n+1):\\n if i % j == 0 or j % i == 0:\\n m[i-1].append(j-1)\\n #print(f'{i}: {m[i-1]}')\\n\\n def r(counter, occupied):\\n choices = m[counter]\\n ans = []\\n for choice in choices:\\n if not occupied[choice]:\\n new_occupied = copy.copy(occupied)\\n new_occupied[choice] = counter + 1\\n if counter < n - 1:\\n ans += r(counter + 1, new_occupied)\\n else:\\n ans.append(new_occupied)\\n return ans\\n occupied = [False for _ in range(n)]\\n occupied = r(0, occupied)\\n\\n return len(occupied)\",\n \"runtime\": \"400\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def perm(remaining, index):\\n if remaining == []:\\n return 1\\n\\n ans = 0\\n for rem in remaining:\\n if rem % index == 0 or index % rem == 0:\\n copy = remaining[:]\\n copy.remove(rem)\\n ans += perm(copy, index+1)\\n\\n return ans\\n\\n return perm([i+1 for i in range(n)], 1)\\n\",\n \"runtime\": \"417\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n arr=[i for i in range(1,n+1)]\\n\\n self.count=0\\n\\n\\n def solve(array=arr.copy(),rez=[],index=1):\\n\\n if array==[]:\\n self.count=self.count+1\\n\\n for i in array:\\n\\n if i%index==0 or index%i==0:\\n\\n rez.append(i)\\n b=array.copy()\\n b.remove(i)\\n\\n solve(b,rez.copy(),index+1)\\n rez.pop()\\n \\n\\n solve()\\n\\n return self.count\",\n \"runtime\": \"435\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n perm=[i for i in range(n+1)]\\n count=0\\n finish=n+1\\n def getPerm(start,comb):\\n nonlocal count\\n if start==n+1:\\n count+=1\\n return\\n for i in range(start,finish):\\n if comb[i]%(start)==0 or (start)%comb[i]==0:\\n combI=comb[i]\\n combStart=comb[start]\\n comb[i],comb[start]=combStart,combI\\n getPerm(start+1,comb)\\n comb[i],comb[start]=combI,combStart\\n getPerm(1,perm)\\n return count\\n\",\n \"runtime\": \"452\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(i, nums):\\n if not nums:\\n return 1\\n if i > n:\\n return 0\\n res = 0\\n for num in nums:\\n if num % i == 0 or i % num == 0:\\n temp = nums.copy()\\n temp.remove(num)\\n res += dfs(i+1, temp)\\n return res\\n\\n return dfs(1, set([i for i in range(1, n+1)]))\",\n \"runtime\": \"469\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n # Generate the array of numbers that will be used to create permutations of 1 to n (n inclusive) ex: 3 will become [1,2,3]\\n # Iterate through all elements in the list and compare it to i which is initialized at 1 to avoid the while index + 1 thing.\\n # If the number is divisible by i or i is divisible by the number, remove the number from nums and continue generating the permutation.\\n # If a full permutation is generated (i == n+1, aka went past the index) then we have one solution. Add that to the result.\\n # backtracking -> dp\\n\\n res = 0\\n nums = tuple(range(1, n+1))\\n \\n #@lru_cache(None)\\n def dfs(nums, i):\\n if i == n+1: # to the end\\n return 1\\n res = 0\\n for j, num in enumerate(nums):\\n if not num % i or not i % num:\\n res += dfs(tuple(nums[:j] + nums[j+1:]), i+1)\\n return res\\n \\n return dfs(nums, 1) \",\n \"runtime\": \"486\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.ans=0\\n def countArrangement(self, n: int) -> int:\\n nums=[i for i in range(n+1)]\\n #print(nums)\\n self.dfs(nums,1)\\n return self.ans\\n\\n def dfs(self,nums,index):\\n if(index==len(nums)):\\n self.ans+=1\\n return\\n for j in range(index,len(nums)):\\n if((nums[j]%index==0) or (index%nums[j]==0)):\\n nums[index],nums[j]=nums[j],nums[index]\\n self.dfs(nums,index+1)\\n nums[index],nums[j]=nums[j],nums[index]\\n\\n\\n \",\n \"runtime\": \"486\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.res = 0\\n nums = [i for i in range(1, n+1)]\\n \\n def dfs(nums: list, i: int = 1):\\n if i == n+1: \\n self.res += 1\\n return\\n \\n for j, num in enumerate(nums):\\n if not(num % i and i % num):\\n dfs(nums[:j] + nums[j+1:], i+1)\\n \\n dfs(nums)\\n return self.res\\n \",\n \"runtime\": \"504\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.res = 0\\n nums = [i for i in range(1, n+1)]\\n \\n def dfs(nums: list, i: int = 1):\\n if i == n+1: \\n self.res += 1\\n return\\n \\n for j, num in enumerate(nums):\\n if not(num % i and i % num):\\n dfs(nums[:j] + nums[j+1:], i+1)\\n \\n dfs(nums)\\n return self.res\\n\",\n \"runtime\": \"504\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n self.res = 0\\n nums = [i for i in range(1, n+1)]\\n \\n def dfs(nums: list, i: int = 1):\\n if i == n+1: \\n self.res += 1\\n return\\n \\n for j, num in enumerate(nums):\\n if not(num % i and i % num):\\n dfs(nums[:j] + nums[j+1:], i+1)\\n \\n dfs(nums)\\n return self.res\",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n self.res = 0\\n nums = [i for i in range(1, n+1)]\\n \\n def dfs(nums: list, i: int = 1):\\n if i == n+1: \\n self.res += 1\\n return\\n \\n for j, num in enumerate(nums):\\n if not(num % i and i % num):\\n dfs(nums[:j] + nums[j+1:], i+1)\\n \\n dfs(nums)\\n return self.res\",\n \"runtime\": \"521\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n nums=[i for i in range(1,n+1)]\\n self.count=0\\n def permute(curr):\\n if curr==len(nums):\\n self.count+=1\\n return\\n for i in range(curr,len(nums)):\\n if ((nums[i]%(curr+1)==0 or (curr+1)%nums[i]==0)):\\n nums[i],nums[curr]=nums[curr],nums[i]\\n permute(curr+1)\\n nums[i],nums[curr]=nums[curr],nums[i]\\n return\\n permute(0)\\n return self.count\\n \",\n \"runtime\": \"538\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.res = 0\\n nums = [i for i in range(1, n+1)]\\n \\n def dfs(nums: list, i: int = 1):\\n if i == n+1: \\n self.res += 1\\n return\\n \\n for j, num in enumerate(nums):\\n if not(num % i and i % num):\\n dfs(nums[:j] + nums[j+1:], i+1)\\n \\n dfs(nums)\\n return self.res\",\n \"runtime\": \"538\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # 1,2,3...n\\n # perm(n) == beautiful if: \\n # for i in range(1,n+1):\\n # perm[i]%i == 0\\n # or i % perm[i] ==0\\n\\n # perm(3)\\n # 1,2,3\\n # 1,3,2\\n # 2,1,3\\n # 2,3,1\\n # 3,2,1\\n # 3,1,2\\n possible = [i for i in range(1,n+1)]\\n def dfs(i, possible):\\n if i == n+1:\\n return 1\\n count = 0\\n for j,v in enumerate(possible):\\n if v % i == 0 or i % v == 0:\\n count +=dfs(i+1,possible[:j] + possible[j+1:])\\n return count\\n return dfs(1,possible)\\n\\n \\n\\n \",\n \"runtime\": \"555\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n s = set()\\n for i in range(1, n+1):\\n s.add(i)\\n \\n def backtracking(s, p):\\n if p > n:\\n return 1\\n tot = 0\\n for i in list(s):\\n if i % p == 0 or p % i == 0:\\n s.remove(i)\\n tot += backtracking(s, p+1)\\n s.add(i)\\n return tot\\n \\n return backtracking(s, 1)\\n \",\n \"runtime\": \"555\"\n },\n {\n \"code\": \"def search(lit, ans, loc):\\n if len(lit) == 0:\\n ans[0] += 1\\n else:\\n length = len(lit)\\n for _ in range(length):\\n val = lit.pop(0)\\n if val %loc ==0 or loc%val==0:\\n search(lit, ans, loc+1)\\n lit.append(val)\\n \\n\\n\\n\\nclass Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n\\n\\n lit = []\\n\\n for i in range(1, n+1):\\n lit.append(i)\\n ans = [0]\\n\\n search(lit, ans, 1)\\n return ans[0]\\n \",\n \"runtime\": \"572\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n r = 0\\n def countArrangement(start, nums):\\n nonlocal r\\n if start == n+1:\\n r+=1\\n return\\n for i in range(len(nums)):\\n num = nums[i]\\n if num % start == 0 or start % num == 0:\\n countArrangement(start + 1, nums[:i] + nums[i+1:])\\n return r\\n \\n countArrangement(1, list(range(1, n+1)))\\n\\n return r\",\n \"runtime\": \"572\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n cnt = 0\\n visited = [False] * (n+1)\\n \\n def permute(n,pos,visited):\\n nonlocal cnt\\n if pos > n:\\n cnt+=1\\n for i in range(1,n+1):\\n if not visited[i]:\\n if pos % i==0 or i%pos==0:\\n visited[i] = True\\n permute(n,pos+1,visited)\\n visited[i] = False\\n \\n permute(n,1,visited)\\n return cnt\",\n \"runtime\": \"590\"\n },\n {\n \"code\": \"class Solution:\\n def calculate(self, N, pos, visited, count):\\n # 如果当前位置超过了N，则说明找到了一个valid permutation\\n if pos > N:\\n count[0] += 1\\n return\\n \\n for i in range(1, N + 1):\\n if not visited[i] and (pos % i == 0 or i % pos == 0):\\n visited[i] = True\\n self.calculate(N, pos + 1, visited, count)\\n visited[i] = False\\n \\n \\n def countArrangement(self, n: int) -> int:\\n visited = [False] * (n + 1)\\n count = [0]\\n self.calculate(n, 1, visited, count)\\n return count[0]\\n \",\n \"runtime\": \"590\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n visit = [False]*(n+1)\\n ans = 0\\n\\n def btrack(i):\\n if i == n+1:\\n nonlocal ans\\n ans += 1\\n \\n for j in range(1, n+1):\\n if not visit[j]:\\n if not i%j or not j%i:\\n visit[j] = True\\n btrack(i+1)\\n visit[j] = False\\n \\n btrack(1)\\n return ans\",\n \"runtime\": \"607\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n #enumeration problem\\n # n == 1, output = 1\\n # n == 2, output = 2\\n # n == 3 :\\n # [1,2,3]: perm[1] = 1, perm[2] = 2, perm[3] = 3\\n # but is there a different arragement ?\\n # [3,2,1] : perm[1] = 3 is div by 1\\n # perm[2] = 2 is div 2\\n #.perm[3] = 1 is divisible by \\n # can be solved by recursive backtracking\\n # try placing each number 1..n at each position i\\n # we keep a visited array to track visit in each backtrack step\\n visited = [False] * (n+1)\\n count = 0\\n\\n def backtrack(pos):\\n nonlocal count\\n\\n if pos > n:\\n # we have found an arrangement\\n count += 1\\n return\\n # include and exclude placing the number 'pos' in \\n # current position \\n for i in range(1, n+1):\\n #backtracking tries to prune using a condition\\n if not visited[i] and (pos % i == 0 or i % pos == 0):\\n visited[i] = True\\n backtrack(pos+1)\\n visited[i] = False\\n backtrack(1)\\n return count\\n\\n\\n\\n\",\n \"runtime\": \"607\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n def backtrack(pos, visited):\\n if pos > n:\\n return 1\\n\\n count = 0\\n for num in range(1, n+1):\\n if not visited[num] and (num%pos == 0 or pos%num == 0):\\n visited[num] = True\\n count += backtrack(pos+1, visited)\\n visited[num] = False\\n return count\\n\\n visited = [False]*(n+1)\\n return backtrack(1, visited)\",\n \"runtime\": \"624\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n visited = [False for _ in range(n+1)]\\n #print(len(visited))\\n\\n def dp(n, pos, visited):\\n if pos > n:\\n self.count += 1\\n for i in range(1, n+1):\\n #print(i)\\n if (not visited[i]) and (pos % i == 0 or i % pos == 0):\\n visited[i] = True\\n dp(n, pos + 1, visited)\\n visited[i] = False\\n\\n dp(n, 1, visited)\\n return self.count\\n\\n\\n \\\"\\\"\\\"\\n self.counter_count = 0\\n @cache\\n\\n def dp(mask, k):\\n if k == 0:\\n self.counter_count += 1\\n #return\\n for i in range(n):\\n if mask & (1 << i):\\n if (i+1) % k == 0 or k % (i+1) == 0:\\n dp(mask - (1 << i), k-1)\\n #return\\n \\n dp((1 << n) - 1, n)\\n \\n #return self.count\\n return self.counter_count\\n \\\"\\\"\\\"\",\n \"runtime\": \"624\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n visited = [False] * (n + 1)\\n \\n def dfs(i):\\n if i >= n + 1:\\n return 1\\n \\n res = 0\\n for num in range(1, n+1):\\n if visited[num]:\\n continue\\n \\n if num % i == 0 or i % num == 0:\\n visited[num] = True\\n res += dfs(i + 1)\\n visited[num] = False\\n return res\\n \\n res = dfs(1)\\n return res\",\n \"runtime\": \"641\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(start_index, visited):\\n if start_index == n + 1:\\n return 1\\n count = 0\\n for i in range(1, n+1):\\n if not visited[i] and (i % start_index == 0 or start_index % i == 0):\\n visited[i] = True\\n count += dfs(start_index + 1, visited)\\n visited[i] = False\\n return count\\n return dfs(1, [False] * (n+1))\\n \",\n \"runtime\": \"641\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n cnt = 0\\n visited = [False] * (n+1)\\n \\n\\n def permute(n,pos,visited):\\n nonlocal cnt\\n if pos > n:\\n cnt+=1\\n for i in range(1,n+1):\\n #print(i,pos,visited)\\n if not visited[i]:\\n x = pos % i\\n y = i%pos\\n if x==0 or y==0:\\n visited[i] = True\\n permute(n,pos+1,visited)\\n visited[i] = False\\n #print()\\n \\n permute(n,1,visited)\\n return cnt\",\n \"runtime\": \"659\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n visited = [False] * (n+1)\\n def dfs(i):\\n if i == n + 1:\\n return 1\\n count = 0\\n for num in range(1, n+1):\\n if (not visited[num]) and (i % num == 0 or num % i == 0):\\n visited[num] = True\\n count += dfs(i+1)\\n visited[num] = False\\n return count\\n return dfs(1)\",\n \"runtime\": \"659\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # To keep track of visited numbers\\n visited = [False] * (n + 1)\\n \\n # Helper function for backtracking\\n def backtrack(pos):\\n # If we've placed numbers in all positions\\n if pos > n:\\n return 1\\n \\n count = 0\\n for i in range(1, n + 1):\\n # Check if the number is not visited and satisfies the condition\\n if not visited[i] and (i % pos == 0 or pos % i == 0):\\n visited[i] = True # Mark the number as used\\n count += backtrack(pos + 1) # Move to the next position\\n visited[i] = False # Unmark the number (backtrack)\\n return count\\n \\n # Start backtracking from position 1\\n return backtrack(1)\\n\",\n \"runtime\": \"676\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n ans=[]\\n def permute(l,p,index):\\n if l==[]:\\n ans.append(p)\\n for i,v in enumerate(l):\\n if v%(index+1)==0 or (index+1)%v==0:\\n permute(l[:i]+l[i+1:],p+[v],index+1)\\n \\n permute(list(range(1,n+1)),[],0)\\n return len(ans)\",\n \"runtime\": \"676\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.visit=[False]*(n+1)\\n self.count=0\\n def bea(n,pos):\\n if pos>n:self.count+=1\\n for i in range(1,n+1):\\n if not self.visit[i] and (pos%i==0 or i%pos==0):\\n self.visit[i]=True\\n bea(n,pos+1)\\n self.visit[i]=False\\n bea(n,1)\\n return self.count \\n \\n \",\n \"runtime\": \"693\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.res = 0\\n self.track = []\\n self.used = [False] * (n+1)\\n self.backtrack(n, 1)\\n return self.res\\n \\n def backtrack(self, n: int, idx: int) -> None:\\n if idx > n:\\n self.res += 1\\n return\\n \\n for i in range(1,n+1):\\n if self.used[i]:\\n continue\\n if not(i % idx == 0 or idx % i == 0):\\n continue\\n self.used[i] = True\\n self.track.append(i)\\n self.backtrack(n, idx+1)\\n self.track.pop()\\n self.used[i] = False\",\n \"runtime\": \"693\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.track = []\\n self.used = [False] * (n+1)\\n self.count = 0\\n self.backtrack(n, 1)\\n return self.count\\n \\n def backtrack(self, n, index):\\n if len(self.track) == n:\\n self.count += 1\\n return\\n\\n for i in range(1, n+1):\\n if self.used[i]:\\n continue\\n if i % index == 0 or index % i == 0:\\n self.used[i] = True\\n self.track.append(i)\\n self.backtrack(n, index+1)\\n self.track.pop()\\n self.used[i] = False\\n \\n\",\n \"runtime\": \"710\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def permute(nums,n,i):\\n nonlocal cnt\\n if(i==len(nums)):\\n cnt+=1\\n else:\\n for j in range(i,n):\\n nums[i],nums[j]=nums[j],nums[i]\\n if((nums[i]%(i+1)==0) or ((i+1)%nums[i]==0)):\\n permute(nums,n,i+1)\\n nums[i],nums[j]=nums[j],nums[i]\\n nums = [i+1 for i in range(n)]\\n cnt=0\\n permute(nums,n,0)\\n return cnt\\n \",\n \"runtime\": \"710\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n # backtracking solution.\\n # easily coded.\\n\\n res = 0\\n\\n nums = list(range(1, n + 1))\\n\\n def backtrack(begin):\\n\\n if begin == n:\\n nonlocal res\\n res += 1\\n return\\n \\n for i in range(begin, n):\\n\\n # swap the begin element and the current element at 'i' index.\\n nums[begin], nums[i] = nums[i], nums[begin]\\n\\n # check for the condition given in the question.\\n if nums[begin] % (begin + 1) == 0 or (begin + 1) % (nums[begin]) == 0:\\n backtrack(begin + 1)\\n \\n\\n # swap the numbers back to their original positions.\\n nums[begin], nums[i] = nums[i], nums[begin]\\n\\n backtrack(0)\\n \\n return res\\n \",\n \"runtime\": \"728\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n nums = [0]*(n+1)\\n ans=[0]\\n def solve(nums,ans,currnum,n):\\n if currnum>=n+1:\\n ans[0]+=1\\n return \\n \\n for i in range(1,n+1):\\n if nums[i]==0 and (currnum%i==0 or i%currnum==0):\\n nums[i]=currnum\\n solve(nums,ans,currnum+1,n)\\n nums[i]=0\\n\\n solve(nums,ans,1,n)\\n return ans[0]\",\n \"runtime\": \"728\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def is_beautiful(perm):\\n return all(perm[i] % (i + 1) == 0 or (i + 1) % perm[i] == 0 for i in range(n))\\n\\n def backtrack(index, used):\\n if index > n:\\n return 1\\n count = 0\\n for i in range(1, n + 1):\\n if not used[i - 1] and (i % index == 0 or index % i == 0):\\n used[i - 1] = True\\n count += backtrack(index + 1, used)\\n used[i - 1] = False\\n return count\\n \\n used = [False] * n\\n return backtrack(1, used)\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.countArrangement(2)) # Output: 2\\nprint(solution.countArrangement(1)) # Output: 1\",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n dict={}\\n for i in range(1,n+1):\\n dict[i]=0\\n ans=[0]\\n def ba(ind,dict):\\n if ind>n:\\n ans[0]+=1\\n return\\n for i in dict:\\n if dict[i]==0:\\n if i%ind==0 or ind%i==0:\\n dict[i]=ind\\n ba(ind+1,dict)\\n dict[i]=0\\n return\\n \\n ba(1,dict)\\n return ans[0]\\n \\n \",\n \"runtime\": \"745\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n mat = [[0]*n for _ in range(n)]\\n\\n for i in range(n):\\n for j in range(n):\\n if (i+1) % (j+1) == 0 or (j+1) % (i+1) == 0:\\n mat[i][j] = 1\\n\\n def dfs(mat, i, history):\\n if i == n:\\n return 1\\n res = 0\\n for j in range(n):\\n if mat[i][j] == 1 and j not in history:\\n temp = history.copy()\\n temp.add(j)\\n res += dfs(mat, i+1, temp)\\n return res\\n\\n return dfs(mat, 0, set())\",\n \"runtime\": \"762\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n permutations = []\\n nums = [i for i in range(1, n+1)]\\n\\n def backtrack(start: int, end: int):\\n # If we've reached the end of the array, we found a permutation\\n if start == end:\\n permutations.append(nums[:]) # Append a copy of nums\\n return\\n \\n for i in range(start, end):\\n # Swap the current element with the start element\\n nums[start], nums[i] = nums[i], nums[start]\\n # Recurse on the remaining subarray\\n if nums[start]%(start+1)==0 or (start+1)%nums[start]==0:\\n backtrack(start + 1, end)\\n # Backtrack (undo the swap)\\n nums[start], nums[i] = nums[i], nums[start]\\n\\n backtrack(0, n)\\n \\n return len(permutations)\\n\",\n \"runtime\": \"779\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n def dfs(nums, i):\\n if i == n + 1:\\n self.ans += 1\\n return \\n for j in range(1, n + 1):\\n if nums[j - 1] == 0 and (i % j == 0 or j % i == 0):\\n nums[j - 1] = i\\n dfs(nums, i + 1)\\n nums[j - 1] = 0\\n return \\n \\n nums = [0 for i in range(1, n + 1)]\\n self.ans = 0\\n dfs(nums, 1)\\n return self.ans\",\n \"runtime\": \"779\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n n_list = [x for x in range(1, n+1)]\\n vis = set()\\n perm = []\\n ans = 0\\n\\n def permute(i):\\n nonlocal ans\\n \\n if i >= n:\\n ans += 1\\n return\\n\\n ip = i+1\\n for x in n_list:\\n if x not in vis and (x % ip == 0 or ip % x == 0):\\n vis.add(x)\\n permute(i + 1)\\n vis.remove(x)\\n permute(0)\\n return ans\\n \\n\",\n \"runtime\": \"797\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.res = 0\\n self.dfs(list(range(1,n+1)),0,[])\\n return self.res\\n\\n def dfs(self, nums, start, path):\\n if start == len(nums):\\n self.res += 1\\n return\\n for i in range(start,len(nums)):\\n nums[start], nums[i] = nums[i], nums[start]\\n if nums[start] % (start+1) == 0 or (start+1) % nums[start] ==0:\\n self.dfs(nums,start+1, path +[nums[i]])\\n nums[start], nums[i] = nums[i], nums[start]\\n \",\n \"runtime\": \"797\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n def isValid(v):\\n for i, x in enumerate(v):\\n if (i+1) % x != 0 and x % (i+1) != 0:\\n return False\\n return True\\n\\n def helper(used, partial):\\n nonlocal res\\n idx = len(partial)\\n if idx == n:\\n # if isValid(partial):\\n # res += 1\\n # return\\n res += 1\\n return\\n for i in range(len(used)):\\n if not used[i] and ( (i+1) % (idx + 1) == 0 or (idx+1) % (i+1) ==0 ):\\n used[i] = True\\n partial.append(i+1)\\n helper(used, partial)\\n used[i] = False\\n partial.pop()\\n \\n res = 0\\n helper([False]*n, [])\\n return res\\n \",\n \"runtime\": \"814\"\n },\n {\n \"code\": \"class Solution:\\n def backtrack(self, index):\\n if index > self.n:\\n self.count += 1\\n return\\n for i in range(index, self.n + 1):\\n self.arr[i], self.arr[index] = self.arr[index], self.arr[i]\\n if self.arr[index] % index == 0 or index % self.arr[index] == 0:\\n self.backtrack(index + 1)\\n self.arr[i], self.arr[index] = self.arr[index], self.arr[i]\\n\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n self.arr = list(range(n+1))\\n self.n = n\\n self.backtrack(1)\\n return self.count\\n\\n\\n \",\n \"runtime\": \"814\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def isBeautiful(a: int, b: int) -> bool:\\n return (a >= b and a % b == 0) or (b >= a and b % a == 0)\\n available = [True] * (n + 1)\\n def findArrangements(spot: int) -> int:\\n if spot > n:\\n return 0\\n total = 0\\n for num in range(1, len(available)):\\n if available[num] and isBeautiful(spot, num):\\n available[num] = False\\n total += findArrangements(spot + 1) + (1 if spot == n else 0)\\n available[num] = True\\n return total\\n return findArrangements(1)\\n\",\n \"runtime\": \"831\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n #two conditions, one must be true\\n #the value at a index, must be divisible by the index\\n # the index must be divisible by the value at the index \\n\\n\\n res = 0\\n\\n visited = [False] * n\\n \\n def findArrangement(index, visitedVals):\\n nonlocal res\\n if index == n+1:\\n res += 1 \\n return\\n\\n \\n for x in range(1, n+1):\\n if visitedVals[x-1] == False:\\n if x % index == 0 or index % x == 0:\\n visitedVals[x-1] = True\\n findArrangement(index+1, visitedVals)\\n visitedVals[x-1] = False\\n \\n return\\n \\n findArrangement(1, visited)\\n return res\",\n \"runtime\": \"831\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.ans = 0\\n seen = set()\\n def calc(cur):\\n # print(cur, seen)\\n if cur > n:\\n self.ans += 1\\n return\\n for i in range(1, n+1):\\n if i not in seen and (cur % i == 0 or i % cur == 0):\\n seen.add(i)\\n calc(cur+1)\\n seen.remove(i)\\n calc(1)\\n return self.ans\",\n \"runtime\": \"848\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.nums = [i for i in range(1, n + 1)]\\n self.n = n\\n self.ans = 0\\n self.helper(0)\\n return self.ans\\n def helper(self, start):\\n if start == self.n:\\n self.ans += 1\\n return\\n \\n for i in range(start, self.n):\\n self.nums[start], self.nums[i] = self.nums[i], self.nums[start]\\n if self.nums[start] % (start + 1) == 0 or (start + 1) % self.nums[start] == 0:\\n self.helper(start + 1)\\n self.nums[start], self.nums[i] = self.nums[i], self.nums[start]\\n \",\n \"runtime\": \"848\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n @functools.cache\\n def solve(cur):\\n if len(cur) == 1:\\n return 1\\n \\n total = 0\\n for j in range(len(cur)):\\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\\n total += solve(cur[:j] + cur[j+1:])\\n \\n return total\\n \\n return solve(tuple(range(1, n+1)))\\n\\\"\\\"\\\" \\n\\n#\\\"\\\"\\\"\\n# typical backtracking algorithm\\nclass Solution:\\n # Top down, cache the current array for higher speed, takes around 60 ms\\n def countArrangement(self, n: int) -> int:\\n def dfs(level): # pos: position to place a new number\\n if level > n: \\n nonlocal res\\n res += 1\\n return\\n for i in range(1, n + 1):\\n if i not in visited and (i % level == 0 or level % i == 0):\\n visited.add(i)\\n dfs(level + 1)\\n visited.discard(i)\\n\\n res = 0\\n visited = set()\\n dfs(1)\\n return res\\n#\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n# This is permutation problem\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n def dfs(pos):\\n nonlocal res\\n \\n if pos > n: \\n res += 1\\n return\\n \\n for num in range(1, n + 1): \\n if num not in visited and (num % pos == 0 or pos % num == 0): \\n visited.add(num)\\n dfs(pos + 1)\\n visited.discard(num)\\n \\n res = 0\\n visited = set()\\n \\n dfs(1)\\n \\n return res\\n\\\"\\\"\\\"\",\n \"runtime\": \"866\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n nums = [False for _ in range(1, n + 1)]\\n res = 0\\n\\n def dfs(arr, idx):\\n nonlocal res\\n if idx > n:\\n res += 1\\n return\\n \\n for i in range(1, n + 1):\\n if nums[i-1] == False and (idx % i == 0 or i % idx == 0):\\n arr.append(i)\\n nums[i-1] = True\\n dfs(arr, idx + 1)\\n nums[i-1] = False\\n arr.pop()\\n\\n dfs([], 1)\\n \\n return res\\n\",\n \"runtime\": \"866\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n @functools.cache\\n def solve(cur):\\n if len(cur) == 1:\\n return 1\\n \\n total = 0\\n for j in range(len(cur)):\\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\\n total += solve(cur[:j] + cur[j+1:])\\n \\n return total\\n \\n return solve(tuple(range(1, n+1)))\\n\\\"\\\"\\\" \\n\\n#\\\"\\\"\\\"\\n# typical backtracking algorithm\\nclass Solution:\\n # Top down, cache the current array for higher speed, takes around 60 ms\\n def countArrangement(self, n: int) -> int:\\n def dfs(level): # pos: position to place a new number\\n if level > n: \\n nonlocal res\\n res += 1\\n return\\n for i in range(1, n + 1):\\n if i not in visited and (i % level == 0 or level % i == 0):\\n visited.add(i)\\n dfs(level + 1)\\n visited.discard(i)\\n\\n res = 0\\n visited = set()\\n dfs(1)\\n return res\\n#\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n# This is permutation problem\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n def dfs(pos):\\n nonlocal res\\n \\n if pos > n: \\n res += 1\\n return\\n \\n for num in range(1, n + 1): \\n if num not in visited and (num % pos == 0 or pos % num == 0): \\n visited.add(num)\\n dfs(pos + 1)\\n visited.discard(num)\\n \\n res = 0\\n visited = set()\\n \\n dfs(1)\\n \\n return res\\n\\\"\\\"\\\"\",\n \"runtime\": \"883\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n @functools.cache\\n def solve(cur):\\n if len(cur) == 1:\\n return 1\\n \\n total = 0\\n for j in range(len(cur)):\\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\\n total += solve(cur[:j] + cur[j+1:])\\n \\n return total\\n \\n return solve(tuple(range(1, n+1)))\\n\\\"\\\"\\\" \\n\\n#\\\"\\\"\\\"\\n# typical backtracking algorithm\\nclass Solution:\\n # Top down, cache the current array for higher speed, takes around 60 ms\\n def countArrangement(self, n: int) -> int:\\n def dfs(level): # pos: position to place a new number\\n if level > n: \\n nonlocal res\\n res += 1\\n return\\n for i in range(1, n + 1):\\n if i not in visited and (i % level == 0 or level % i == 0):\\n visited.add(i)\\n dfs(level + 1)\\n visited.discard(i)\\n\\n res = 0\\n visited = set()\\n dfs(1)\\n return res\\n#\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n# This is permutation problem\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n def dfs(pos):\\n nonlocal res\\n \\n if pos > n: \\n res += 1\\n return\\n \\n for num in range(1, n + 1): \\n if num not in visited and (num % pos == 0 or pos % num == 0): \\n visited.add(num)\\n dfs(pos + 1)\\n visited.discard(num)\\n \\n res = 0\\n visited = set()\\n \\n dfs(1)\\n \\n return res\\n\\\"\\\"\\\"\",\n \"runtime\": \"883\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def backtrack(pos, visited):\\n if pos > n:\\n return 1\\n cost = 0\\n for i in range(1, n+1):\\n if i not in visited and (i % pos == 0 or pos % i == 0):\\n visited.add(i)\\n cost += backtrack(pos+1, visited)\\n visited.remove(i)\\n return cost\\n return backtrack(1, set())\\n\",\n \"runtime\": \"900\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n @functools.cache\\n def solve(cur):\\n if len(cur) == 1:\\n return 1\\n \\n total = 0\\n for j in range(len(cur)):\\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\\n total += solve(cur[:j] + cur[j+1:])\\n \\n return total\\n \\n return solve(tuple(range(1, n+1)))\\n\\\"\\\"\\\" \\n\\n#\\\"\\\"\\\"\\n# typical backtracking algorithm\\nclass Solution:\\n # Top down, cache the current array for higher speed, takes around 60 ms\\n def countArrangement(self, n: int) -> int:\\n def dfs(level): # pos: position to place a new number\\n if level > n: \\n nonlocal res\\n res += 1\\n return\\n for i in range(1, n + 1):\\n if i not in visited and (i % level == 0 or level % i == 0):\\n visited.add(i)\\n dfs(level + 1)\\n visited.discard(i)\\n\\n res = 0\\n visited = set()\\n dfs(1)\\n return res\\n#\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n# This is permutation problem\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n def dfs(pos):\\n nonlocal res\\n \\n if pos > n: \\n res += 1\\n return\\n \\n for num in range(1, n + 1): \\n if num not in visited and (num % pos == 0 or pos % num == 0): \\n visited.add(num)\\n dfs(pos + 1)\\n visited.discard(num)\\n \\n res = 0\\n visited = set()\\n \\n dfs(1)\\n \\n return res\\n\\\"\\\"\\\"\",\n \"runtime\": \"900\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n res = 0\\n visit = [False]*n\\n def dfs(i):\\n nonlocal res\\n if i == n+1:\\n res += 1\\n return \\n for num in range(1, n+1):\\n if (num % i ==0 or i % num == 0) and not visit[num-1]:\\n visit[num-1] = True\\n dfs(i+1)\\n visit[num-1] = False\\n\\n dfs(1)\\n return res\",\n \"runtime\": \"917\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self, ind: int, n: int, seen_so_far: set, lsf: int):\\n ssf = 0\\n for i in range(1, n + 1):\\n # print(seen_so_far, i, ind)\\n if i in seen_so_far: continue\\n if not (i % (ind + 1) == 0 or (ind + 1) % i == 0): continue \\n\\n # print(seen_so_far, i, ind, lsf)\\n if ind == n - 1:\\n ssf += 1\\n else:\\n ssf += self.helper(ind + 1, n, seen_so_far.union({i}), lsf + 1)\\n return ssf\\n\\n def countArrangement(self, n: int) -> int:\\n if n == 1:\\n return 1\\n ssf = 0\\n for i in range(1, n + 1):\\n ssf += self.helper(1, n, set([i]), 1)\\n return ssf\\n \",\n \"runtime\": \"917\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dp(i,bit):\\n if i==n+1:\\n return 1\\n ans =0\\n for num in range(1,n+1):\\n if i%num == 0 or num%i == 0:\\n if (bit&(1<<num)==0):\\n ans += dp(i+1,bit|1<<num)\\n \\n return ans\\n \\n return dp(1,0)\\n\\n\",\n \"runtime\": \"934\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.res = 0\\n track = []\\n used = [False]*n\\n self.backtrack(n,track,used)\\n\\n return self.res\\n\\n \\n def backtrack(self, n, track, used):\\n if len(track)==n:\\n self.res += 1\\n return\\n\\n\\n for i in range(n):\\n if used[i]:\\n continue\\n if self.is_beautiful(len(track), i+1):\\n track.append(i+1)\\n used[i] = True\\n self.backtrack(n,track,used)\\n track.pop()\\n used[i] = False\\n\\n def is_beautiful(self, i,num):\\n return num%(i+1) == 0 or (i+1)%num == 0\\n\",\n \"runtime\": \"934\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def backstrap(pos :int, visited:int) -> int:\\n if pos > n:\\n return 1\\n count = 0\\n\\n for i in range(1, n+1):\\n if not visited & (1 << i) and (pos % i == 0 or i % pos == 0):\\n count += backstrap(pos + 1, visited | (1<<i))\\n return count\\n\\n return backstrap(1,0) \",\n \"runtime\": \"952\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(i, visited):\\n if i == n + 1:\\n return 1\\n \\n c = 0\\n for j in range(1, n+1):\\n if j not in visited and (j % i == 0 or i % j == 0):\\n visited.add(j)\\n c += dfs(i+1, visited)\\n visited.remove(j)\\n return c\\n return dfs(1, set())\",\n \"runtime\": \"952\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n memo = {}\\n nums = tuple(list(range(1, n+1)))\\n print(nums)\\n return self.dfs(nums, memo, n)\\n\\n def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\\n if pos == 1:\\n return 1\\n if nums in memo:\\n return memo[nums]\\n cnt = 0\\n for i in range(len(nums)):\\n if nums[i] % pos != 0 and pos % nums[i] != 0:\\n continue\\n cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\\n memo[nums] = cnt\\n return cnt\\n\\n def countArrangement(self, n: int) -> int:\\n nums = list(range(1, n+1))\\n return self.dfs(nums, set())\\n\\n def dfs(self, nums: List[int], visited: Set[int]) -> int:\\n if len(visited) == len(nums):\\n return 1\\n cnt = 0\\n for num in nums:\\n if num in visited:\\n continue \\n if num % (len(visited)+1) != 0 and \\\\\\n (len(visited)+1) % num != 0:\\n continue \\n visited.add(num)\\n cnt += self.dfs(nums, visited)\\n visited.remove(num)\\n return cnt\",\n \"runtime\": \"969\"\n },\n {\n \"code\": \"class Solution:\\n # def countArrangement(self, n: int) -> int:\\n # memo = {}\\n # nums = tuple(list(range(1, n+1)))\\n # print(nums)\\n # return self.dfs(nums, memo, n)\\n\\n # def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\\n # if pos == 1:\\n # return 1\\n # if nums in memo:\\n # return memo[nums]\\n # cnt = 0\\n # for i in range(len(nums)):\\n # if nums[i] % pos != 0 and pos % nums[i] != 0:\\n # continue\\n # cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\\n # memo[nums] = cnt\\n # return cnt\\n\\n def countArrangement(self, n: int) -> int:\\n nums = list(range(1, n+1))\\n return self.dfs(nums, set())\\n\\n def dfs(self, nums: List[int], visited: Set[int]) -> int:\\n if len(visited) == len(nums):\\n return 1\\n cnt = 0\\n for num in nums:\\n if num in visited:\\n continue \\n if num % (len(visited)+1) != 0 and \\\\\\n (len(visited)+1) % num != 0:\\n continue \\n visited.add(num)\\n cnt += self.dfs(nums, visited)\\n visited.remove(num)\\n return cnt\",\n \"runtime\": \"969\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # This problem is based on LC #46 - generate permutations. \\n # Essentially we go and construct the permutations but only\\n # if the new number added meets the the \\\"beautiful arrangement\\\"\\n # property.\\n ans = 0\\n\\n def dfs(path, visited):\\n nonlocal ans\\n if len(path) == n:\\n ans += 1\\n return\\n \\n for num in range(1, n+1):\\n if num not in visited:\\n new_index = len(path) + 1\\n if new_index % num == 0 or num % new_index == 0:\\n path.append(num)\\n visited.add(num)\\n dfs(path, visited)\\n visited.remove(num)\\n path.pop()\\n \\n dfs([], set())\\n return ans\",\n \"runtime\": \"986\"\n },\n {\n \"code\": \"class Solution:\\n def helper(self, ind: int, n: int, seen_so_far: set):\\n ssf = 0\\n for i in range(1, n + 1):\\n # print(seen_so_far, i, ind)\\n if i in seen_so_far: continue\\n if not (i % (ind + 1) == 0 or (ind + 1) % i == 0): continue \\n\\n # print(seen_so_far, i, ind, lsf)\\n if ind == n - 1:\\n ssf += 1\\n else:\\n ssf += self.helper(ind + 1, n, seen_so_far.union({i}))\\n return ssf\\n\\n def countArrangement(self, n: int) -> int:\\n if n == 1:\\n return 1\\n ssf = 0\\n for i in range(1, n + 1):\\n ssf += self.helper(1, n, set([i]))\\n return ssf\\n \",\n \"runtime\": \"986\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n res = 0\\n unused = set([i for i in range(1, n+1)])\\n cur_soln = []\\n def backtracking():\\n nonlocal res\\n \\n if len(cur_soln) == n:\\n print(cur_soln[:])\\n res += 1\\n return\\n else:\\n for num in list(unused):\\n idx = len(cur_soln)+1\\n cur_soln.append(num)\\n unused.remove(num)\\n if idx%num == 0 or num % idx == 0:\\n backtracking()\\n cur_soln.pop()\\n unused.add(num)\\n \\n \\n \\n backtracking()\\n return res \",\n \"runtime\": \"1003\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # Example\\n # n = 2, array [1, 2]\\n # [1, 2], [2, 1]\\n # answer = 2\\n\\n # n = 3, array [1, 2, 3]\\n # [1, 2, 3], [2, 1, 3], [2, 3, 1], [1, 3, 2], [3, 1, 2], [3, 2, 1]\\n # 1 1 0 0 0 1 \\n # 3 not in that position \\n\\n # brute-force \\n # go over all permutations O(n!)\\n # check conditions O(n)\\n # keep a counter\\n\\n # Recursion \\n # O(n!)\\n # make the array range(n)\\n # make a helper function which takes in an array, and an index of where we are, and gives back a integer (counting)\\n # edge cases: (the array is empty, return 0, there is a case array length is 1)\\n # main cases: going over all elements, filling in position i, checking whether that position is ok and calling helper with what is left\\n\\n start_array : List[int] = list(range(1,n+1))\\n\\n def helper(input_array : List[int], position : int) -> int:\\n if len(input_array) == 0:\\n return 0\\n if len(input_array) == 1:\\n if position % input_array[0] == 0 or input_array[0] % position == 0:\\n return 1\\n else :\\n return 0\\n\\n curr_sum : int = 0\\n for i in range(len(input_array)):\\n if i < len(input_array)-1: \\n curr_array = input_array[:i] + input_array[i+1:]\\n else:\\n curr_array = input_array[:i]\\n\\n if position % input_array[i] == 0 or input_array[i] % position == 0:\\n curr_sum += helper(curr_array, position+1)\\n\\n return curr_sum\\n\\n return helper(start_array, 1)\",\n \"runtime\": \"1003\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def helper(n, ind, visited) -> int:\\n if ind > n: return 1\\n\\n ct = 0\\n for i in range(n):\\n if (visited >> i) & 1:\\n continue\\n if (i+1) % ind == 0 or ind % (i+1) == 0:\\n ct += helper(n, ind+1, visited | (1 << i))\\n return ct\\n return helper(n, 1, 0)\",\n \"runtime\": \"1021\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def is_beautiful(arrangement, i):\\n return (arrangement[i] % (i + 1) == 0) or ((i + 1) % arrangement[i] == 0)\\n \\n def backtrack(index):\\n \\n if index == n:\\n return 1\\n \\n count = 0\\n for num in range(1, n + 1):\\n if not used[num]:\\n arrangement[index] = num\\n used[num] = True\\n if is_beautiful(arrangement, index):\\n count += backtrack(index + 1)\\n used[num] = False\\n return count\\n arrangement = [0] * n\\n used = [False] * (n + 1)\\n \\n return backtrack(0)\\n \",\n \"runtime\": \"1021\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.count = 0\\n\\n def countArrangement(self, n: int) -> int:\\n nums = [i for i in range(1, n+1)]\\n self.permute(nums, 0)\\n return self.count\\n\\n def permute(self, nums, l):\\n if l == len(nums):\\n self.count += 1\\n for i in range(l, len(nums)):\\n self.swap(nums, i, l)\\n if nums[l] % (l + 1) == 0 or (l + 1) % nums[l] == 0:\\n self.permute(nums, l+1)\\n self.swap(nums, i, l)\\n\\n def swap(self, nums, x, y):\\n nums[x], nums[y] = nums[y], nums[x]\",\n \"runtime\": \"1038\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n ar = []\\n for i in range(1, n + 1):\\n ar.append(i)\\n \\n # print(ar)\\n\\n cnt = 0\\n def back(ans, left):\\n nonlocal cnt \\n if len(ans) == n:\\n cnt += 1\\n # print(ans)\\n return \\n\\n for i in range(len(left)):\\n if left[i] != -1:\\n if left[i] % (len(ans) + 1) == 0 or (len(ans) + 1) % left[i] == 0:\\n ans.append(left[i])\\n tmp = left[i]\\n left[i] = -1\\n back(ans[:], left[:])\\n # left = [tmp] + left\\n left[i] = tmp\\n ans.pop()\\n else:\\n continue\\n\\n\\n back([], ar)\\n\\n # print(cnt)\\n return cnt\\n\",\n \"runtime\": \"1038\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.ct = 0\\n\\n def swap(self, vals, i, j):\\n temp = vals[i]\\n vals[i] = vals[j]\\n vals[j] = temp\\n\\n def permute(self, idx, vals):\\n\\n for i in range(idx, len(vals)):\\n # swap\\n self.swap(vals, idx, i)\\n # check and then permute\\n if vals[idx] % (idx+1) == 0 or (idx+1) % vals[idx] == 0:\\n self.permute(idx+1, vals)\\n # if last index\\n if idx == len(vals)-1:\\n self.ct += 1\\n # swap\\n self.swap(vals, idx, i)\\n\\n def countArrangement(self, n: int) -> int:\\n vals = [i+1 for i in range(n)]\\n self.permute(0, vals)\\n return self.ct\\n\",\n \"runtime\": \"1055\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n self.backtrack(n, 1, [])\\n return self.count\\n \\n def backtrack(self, n: int, index: int, path: List[int]) -> None:\\n # base case\\n if index > n:\\n self.count += 1\\n return\\n \\n # logic\\n for i in range(1, n + 1): # Iterate from 1 to n\\n if i % index == 0 or index % i == 0:\\n if i not in path:\\n path.append(i)\\n self.backtrack(n, index + 1, path)\\n path.pop()\\n\\n\",\n \"runtime\": \"1055\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n ar = []\\n for i in range(1, n + 1):\\n ar.append(i)\\n\\n cnt = 0\\n def back(ans, left):\\n nonlocal cnt \\n if len(ans) == n:\\n cnt += 1\\n return \\n\\n for i in range(len(left)):\\n if left[i] != -1:\\n if left[i] % (len(ans) + 1) == 0 or (len(ans) + 1) % left[i] == 0:\\n ans.append(left[i])\\n tmp = left[i]\\n left[i] = -1\\n back(ans[:], left[:])\\n left[i] = tmp\\n ans.pop()\\n else:\\n continue\\n\\n\\n back([], ar)\\n \\n return cnt\\n\",\n \"runtime\": \"1072\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def backtrack(s):\\n nonlocal ans\\n if len(s) == n:\\n # for i in range(len(s)):\\n # if s[i] % (i+1) != 0 and (i+1) % s[i] != 0:\\n # flag = False\\n ans+=1\\n return\\n for i in range(1,n+1):\\n if i not in seen:\\n pos = len(s) + 1\\n if i % pos == 0 or pos % i == 0:\\n seen.add(i)\\n s.append(i)\\n backtrack(s)\\n s.pop()\\n seen.remove(i)\\n return\\n ans = 0\\n seen = set()\\n for i in range(1, n+1):\\n seen.add(i)\\n backtrack([i])\\n seen.remove(i)\\n return ans\\n\\n \",\n \"runtime\": \"1072\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n arr = [0] * n\\n used = set()\\n\\n def solve(i):\\n if i == n:\\n for j, num in enumerate(arr):\\n if num % (j + 1) != 0 and (j + 1) % num != 0:\\n return 0\\n return 1\\n \\n ans = 0\\n for num in range(1, n + 1):\\n if num in used:\\n continue\\n elif num % (i + 1) != 0 and (i + 1) % num != 0:\\n continue\\n\\n used.add(num)\\n arr[i] = num\\n ans += solve(i + 1)\\n used.remove(num)\\n \\n return ans\\n \\n return solve(0)\",\n \"runtime\": \"1090\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def solve(i, mask):\\n if i == n: return 1\\n ans = 0\\n for e in range(n):\\n if (1 << e) & mask or (e + 1) % (i + 1) and (i + 1) % (e + 1): continue\\n mask ^= 1 << e\\n ans += solve(i + 1, mask)\\n mask ^= 1 << e\\n return ans\\n return solve(0, 0)\\n \",\n \"runtime\": \"1090\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n ar = []\\n for i in range(1, n + 1):\\n ar.append(i)\\n \\n # print(ar)\\n\\n cnt = 0\\n def back(ans, left):\\n nonlocal cnt \\n if len(ans) == n:\\n cnt += 1\\n print(ans)\\n return \\n\\n for i in range(len(left)):\\n if left[i] != -1:\\n if left[i] % (len(ans) + 1) == 0 or (len(ans) + 1) % left[i] == 0:\\n ans.append(left[i])\\n tmp = left[i]\\n left[i] = -1\\n back(ans[:], left[:])\\n # left = [tmp] + left\\n left[i] = tmp\\n ans.pop()\\n else:\\n continue\\n\\n\\n back([], ar)\\n\\n # print(cnt)\\n return cnt\\n\",\n \"runtime\": \"1107\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def check(num, i):\\n return num % i == 0 or i % num == 0\\n\\n def backtrack(mask, idx):\\n nonlocal count \\n\\n if idx > n:\\n count += 1\\n return\\n for num in range(1, n + 1):\\n if mask & (1 << num) == 0 and check(num, idx):\\n mask ^= (1 << num)\\n backtrack(mask, idx + 1)\\n mask ^= (1 << num)\\n\\n count = 0\\n backtrack(0, 1)\\n return count\",\n \"runtime\": \"1107\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n def backtrack(i=0, mask=0):\\n if i == n: return 1\\n ans = 0\\n for p in range(n):\\n if (mask >> p) & 1: continue\\n if (p + 1) % (i + 1) != 0 and (i + 1) % (p + 1) != 0: continue\\n mask |= (1 << p)\\n ans += backtrack(i + 1, mask)\\n mask ^= (1 << p)\\n return ans\\n return backtrack()\",\n \"runtime\": \"1124\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def f(i, st):\\n if i-1 == n:\\n print(st)\\n return int(st == (1 << n)-1)\\n res = 0\\n for x in range(1,n+1):\\n if 1<<(x-1) &st:\\n continue\\n # st.add(x)\\n if i % x == 0 or x % i == 0:\\n res += f(i+1,1<<(x-1)|st)\\n # st.remove(x)\\n return res\\n return f(1, 0)\",\n \"runtime\": \"1124\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.res = 0\\n self.seen = 0\\n\\n def solve(self, idx, nums):\\n if idx == len(nums) + 1:\\n self.res += 1\\n return\\n\\n for i in range(len(nums)):\\n if not (self.seen & (1 << nums[i])) and (nums[i] % idx == 0 or idx % nums[i] == 0):\\n self.seen ^= (1 << nums[i])\\n self.solve(idx + 1, nums)\\n self.seen ^= (1 << nums[i])\\n\\n def countArrangement(self, n):\\n if n < 4:\\n return n\\n nums = [i for i in range(1, n + 1)]\\n self.solve(1, nums)\\n return self.res\",\n \"runtime\": \"1141\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self):\\n self.res = 0\\n\\n\\n def countArrangement(self, n: int) -> int:\\n visited = [False] * n\\n self.dfs([], n, visited)\\n return self.res\\n\\n \\n def dfs(self, path: List[int], n: int, visited: List[bool]) -> None:\\n if len(path) == n:\\n self.res += 1\\n return\\n \\n for i in range(1, n + 1):\\n if visited[i - 1]:\\n continue\\n if not self.is_valid(path, i):\\n continue\\n path.append(i)\\n visited[i - 1] = True\\n\\n self.dfs(path, n, visited)\\n\\n path.pop()\\n visited[i - 1] = False\\n\\n \\n def is_valid(self, nums: List[int], n: int) -> bool:\\n return n % (len(nums) + 1) == 0 or (len(nums) + 1) % n == 0 \\n \",\n \"runtime\": \"1159\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n self.backtrack(n, 1, [])\\n return self.count\\n def backtrack(self, N, idx, temp):\\n if len(temp) == N:\\n self.count += 1\\n return \\n for i in range(1, N+1):\\n if i not in temp and (i % idx == 0 or idx % i == 0):\\n temp.append(i)\\n self.backtrack(N, idx+1, temp)\\n temp.pop() \",\n \"runtime\": \"1176\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n permutations = 0\\n visited = set()\\n\\n def isValid(index, num):\\n return index % num == 0 or num % index == 0\\n\\n def bt(nums):\\n nonlocal permutations\\n if len(nums) == n:\\n permutations += 1\\n return\\n\\n for nei in range(1, n + 1):\\n if nei in visited or not isValid(len(nums)+1, nei):\\n continue\\n nums.append(nei)\\n visited.add(nei)\\n bt(nums)\\n visited.remove(nums.pop())\\n\\n bt([])\\n return permutations \\n\",\n \"runtime\": \"1176\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n self.backtrack(n, 1, [])\\n return self.count\\n \\n def backtrack(self, N, idx, temp):\\n if len(temp) == N:\\n self.count += 1\\n return\\n \\n for i in range(1, N+1):\\n if i not in temp and (i % idx == 0 or idx % i == 0):\\n temp.append(i)\\n self.backtrack(N, idx+1, temp)\\n temp.pop()\",\n \"runtime\": \"1193\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, N: int) -> int:\\n if N == 0:\\n return 0\\n nums = list(range(1, N + 1))\\n used = [False] * N\\n p, res = [], []\\n self.generatePermutation526(nums, 0, p, res, used)\\n return len(res)\\n\\n def generatePermutation526(self, nums, index, p, res, used):\\n if index == len(nums):\\n res.append(p[:])\\n return\\n for i in range(len(nums)):\\n if not used[i]:\\n if not self.checkDivisible(nums[i], len(p) + 1) and not self.checkDivisible(len(p) + 1, nums[i]):\\n continue\\n used[i] = True\\n p.append(nums[i])\\n self.generatePermutation526(nums, index + 1, p, res, used)\\n p.pop()\\n used[i] = False\\n\\n def checkDivisible(self, num, d):\\n return num % d == 0\",\n \"runtime\": \"1193\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n self.backtrack(n, 1, [])\\n return self.count\\n \\n def backtrack(self, N, idx, temp):\\n if len(temp) == N:\\n self.count += 1\\n return\\n \\n for i in range(1, N+1):\\n if i not in temp and (i % idx == 0 or idx % i == 0):\\n temp.append(i)\\n self.backtrack(N, idx+1, temp)\\n temp.pop()\",\n \"runtime\": \"1210\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def backtrack(index, arrangement):\\n if index == n + 1:\\n result.append(arrangement[:])\\n return\\n \\n for num in range(1, n + 1):\\n if num not in arrangement and (num % index == 0 or index % num == 0):\\n arrangement.append(num)\\n backtrack(index + 1, arrangement)\\n arrangement.pop()\\n \\n result = []\\n backtrack(1, [])\\n return len(result)\",\n \"runtime\": \"1210\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(num_digits, path):\\n if num_digits == n + 1:\\n # print(path)\\n return 1\\n \\n res = 0\\n for i in range(1, n + 1):\\n if i in path:\\n continue\\n\\n # print(num_digits, i, num_digits % i, i % num_digits)\\n if num_digits % i != 0 and i % num_digits != 0:\\n continue\\n \\n path.append(i)\\n res += dfs(num_digits + 1, path)\\n path.pop()\\n\\n return res\\n return dfs(1, [])\",\n \"runtime\": \"1228\"\n },\n {\n \"code\": \"an=0\\nclass Solution:\\n def countArrangement(self, n: int) -> int:\\n global an\\n def ans(k,s):\\n global an\\n if k==n+1:\\n an+=1\\n return\\n for i in range(1,n+1):\\n if i not in s:\\n if k%i==0 or i%k==0:\\n s.append(i)\\n ans(k+1,s.copy())\\n s.pop()\\n return\\n an=0\\n p=list()\\n ans(1,p)\\n return an\",\n \"runtime\": \"1228\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n def backtracking(start, perm, L):\\n if perm and perm[-1] % L != 0 and L % perm[-1] != 0:\\n return\\n if L == n:\\n self.res += 1\\n return\\n for i in range(1, n+1):\\n if not used[i]:\\n used[i] = True\\n backtracking(i+1, perm+[i], L+1)\\n used[i] = False\\n \\n self.res = 0\\n used = [False] * (n+1)\\n backtracking(1, [], 0)\\n return self.res\",\n \"runtime\": \"1245\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(num, used):\\n if len(used) and (num % len(used) != 0 and len(used) % num != 0):\\n return 0\\n if len(used) == n:\\n return 1\\n res = 0\\n for i in range(1, n + 1):\\n if i not in used:\\n used[i] = None\\n res += dfs(i, used)\\n used.pop(i)\\n return res\\n return dfs(0, {})\",\n \"runtime\": \"1245\"\n },\n {\n \"code\": \"class Solution:\\n def build(self, curList: set, n):\\n if (len(curList) == n):\\n return 1\\n totalSum = 0\\n for i in range(1, n + 1):\\n nextIndex = len(curList) + 1\\n if (i % nextIndex == 0 or nextIndex % i == 0) and i not in curList:\\n curList.add(i)\\n totalSum += self.build(curList, n)\\n curList.remove(i)\\n return totalSum\\n\\n def countArrangement(self, n):\\n return self.build(set(), n)\\n\\n\",\n \"runtime\": \"1262\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n ans = 0\\n \\n def dfs(idx,lst,seen):\\n nonlocal ans\\n \\n if idx==len(lst)+1:\\n ans+=1\\n \\n for i in range(len(lst)):\\n \\n if not (seen & (1<<lst[i])) and (lst[i]%idx ==0 or idx%lst[i]==0):\\n seen^=1<<lst[i]\\n dfs(idx+1,lst,seen)\\n seen^=1<<lst[i]\\n \\n \\n lst = []\\n \\n for x in range(1,n+1):\\n lst.append(x)\\n \\n dfs(1,lst,0)\\n \\n return ans\\n \\n \",\n \"runtime\": \"1262\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n ans = []\\n def permute(arr, ans):\\n # print(ans)\\n if len(arr) == n:\\n ans.append(arr.copy())\\n return 0\\n for i in range(1, n+1):\\n if i not in arr and (not i%(len(arr)+1) or not (len(arr)+1)%i):\\n arr.append(i)\\n permute(arr, ans)\\n arr.pop()\\n return 0\\n permute([], ans)\\n return len(ans)\",\n \"runtime\": \"1279\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n ans = 0\\n def backtrack(cur):\\n nonlocal ans\\n if len(cur) == n:\\n ans += 1\\n return\\n for e in range(1, n + 1):\\n if e not in cur and ( (e % (len(cur) + 1) == 0 or (len(cur) + 1) % e == 0) ) :\\n cur.append(e)\\n backtrack(cur)\\n cur.pop()\\n\\n for i in range(1, n + 1):\\n backtrack([i])\\n return ans\\n \",\n \"runtime\": \"1279\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n def findPermutations(current):\\n total = 0\\n if len(current) == n:\\n print(current.copy())\\n return 1\\n\\n next_i = len(current) + 1\\n for num in range(1, n+1):\\n if num not in current:\\n if next_i % num == 0 or num % next_i == 0:\\n total += findPermutations(current + [num])\\n \\n return total\\n \\n return findPermutations([])\",\n \"runtime\": \"1296\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n visited=set()\\n result=0\\n def recurse(visited,currNo):\\n nonlocal result\\n if len(visited)%currNo !=0 and currNo%len(visited)!=0:\\n return\\n if len(visited)==n:\\n result+=1\\n for i in range(1,n+1):\\n if i not in visited:\\n visited.add(i)\\n recurse(visited,i)\\n visited.remove(i)\\n\\n recurse(visited,1)\\n return result\",\n \"runtime\": \"1296\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n visited=set()\\n\\n count = 0\\n def helper(i):\\n nonlocal count\\n if len(visited) % i != 0 and i % len(visited) != 0:\\n return \\n if len(visited) == n:\\n count += 1\\n return\\n \\n for i in range(1,n+1):\\n if i not in visited:\\n visited.add(i)\\n helper(i)\\n visited.remove(i)\\n \\n helper(1)\\n return count\\n\\n \",\n \"runtime\": \"1331\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n def backtracking(start, L):\\n if L == n:\\n self.res += 1\\n return\\n for i in range(1, n+1):\\n c = i % (L+1) != 0 and (L+1) % i != 0\\n if not used[i] and not c:\\n used[i] = True\\n backtracking(i+1, L+1)\\n used[i] = False\\n \\n self.res = 0\\n used = [False] * (n+1)\\n backtracking(1, 0)\\n return self.res\",\n \"runtime\": \"1331\"\n },\n {\n \"code\": \"class Solution:\\n def build(self, curList: set, n):\\n if (len(curList) == n):\\n return 1\\n totalSum = 0\\n for i in range(1, n + 1):\\n nextIndex = len(curList) + 1\\n if (i % nextIndex == 0 or nextIndex % i == 0) and i not in curList:\\n tempList = curList.copy()\\n tempList.add(i)\\n totalSum += self.build(tempList, n)\\n return totalSum\\n\\n def countArrangement(self, n):\\n return self.build(set(), n)\\n\\n\",\n \"runtime\": \"1348\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n cnt = 0\\n\\n def backtrack(ans):\\n\\n nonlocal cnt\\n\\n if len(ans) == n:\\n \\n cnt += 1\\n return\\n \\n for num in range(1, n + 1):\\n i = len(ans) + 1\\n if num not in ans and not (num % i and i % num):\\n ans.append(num)\\n backtrack(ans)\\n ans.pop()\\n backtrack([])\\n\\n return cnt\\n \\n \\n\\n\\n\",\n \"runtime\": \"1348\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n ans = 0\\n def backtrack(cur):\\n nonlocal ans\\n if len(cur) == n:\\n ans += 1\\n return\\n for e in range(1, n + 1):\\n if e not in cur and (len(cur) == 0 or (e % (len(cur) + 1) == 0 or (len(cur) + 1) % e == 0) ) :\\n cur.append(e)\\n backtrack(cur)\\n cur.pop()\\n\\n backtrack([])\\n return ans\\n \",\n \"runtime\": \"1365\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n def bt(index,curr):\\n\\n if len(curr)==n:\\n if len(set(curr))==n:\\n ans.append(curr[:])\\n return\\n for i in range(1,n+1):\\n if i not in curr:\\n curr.append(i)\\n j = len(curr)\\n if (j)%i==0 or i%(j)==0:\\n # print(curr)\\n bt(i+1,curr)\\n curr.pop()\\n \\n ans= []\\n bt(1,[])\\n return len(ans)\",\n \"runtime\": \"1365\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n res = [0]\\n \\n def backtrack(curr, lis, idx, n, res):\\n \\n if len(curr) == n:\\n res[0] += 1\\n return\\n \\n for i in range(n):\\n if lis[i] not in curr and (lis[i] % idx == 0 or idx % lis[i] == 0):\\n curr.append(lis[i])\\n backtrack(curr, lis, idx + 1, n, res)\\n curr.pop()\\n \\n backtrack([], list(range(1, n + 1)), 1, n, res)\\n return res[0]\\n\",\n \"runtime\": \"1383\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n ans = 0\\n def backtrack(cur):\\n nonlocal ans\\n if len(cur) == n:\\n ans += 1\\n return\\n for e in range(1, n + 1):\\n if e not in cur and (len(cur) == 0 or (e % (len(cur) + 1) == 0 or (len(cur) + 1) % e == 0) ) :\\n cur.append(e)\\n backtrack(cur)\\n cur.pop()\\n\\n backtrack([])\\n return ans\\n \",\n \"runtime\": \"1383\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n res=0\\n\\n def backtrack(path):\\n nonlocal res\\n if len(path)==n:\\n res+=1\\n return\\n\\n for j in range(1,n+1):\\n m = len(path)+1\\n if j not in path and (j%m==0 or m%j==0):\\n path.append(j)\\n backtrack(path)\\n path.pop()\\n\\n backtrack([])\\n\\n return res\",\n \"runtime\": \"1400\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(idx, cur):\\n if idx == n+1:\\n return 1\\n ans = 0\\n for i in range(1, n+1):\\n if i in cur:\\n continue\\n if i % (len(cur) + 1) == 0 or (len(cur) + 1) % i == 0:\\n cur.append(i)\\n ans += dfs(idx+1, cur)\\n cur.pop()\\n return ans\\n\\n \\n return dfs(1, [])\",\n \"runtime\": \"1400\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":142,"string":"142"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n path = []\n ans = [0]\n\n def is_divisible(index, value):\n return index % value == 0 or value % index == 0 \n\n def backtracking(path, ans):\n if len(path) == n:\n ans[0] += 1\n return\n \n for i in range(1, n+1):\n if i in path or not is_divisible(len(path)+1, i):\n continue\n\n path.append(i)\n backtracking(path[:], ans)\n path.pop()\n\n backtracking(path, ans)\n\n return ans[0]","memory":"16100"},{"code":"\"\"\"\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n @functools.cache\n def solve(cur):\n if len(cur) == 1:\n return 1\n \n total = 0\n for j in range(len(cur)):\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\n total += solve(cur[:j] + cur[j+1:])\n \n return total\n \n return solve(tuple(range(1, n+1)))\n\"\"\" \n\n#\"\"\"\n# typical backtracking algorithm\nclass Solution:\n # Top down, cache the current array for higher speed, takes around 60 ms\n def countArrangement(self, n: int) -> int:\n def dfs(level): # pos: position to place a new number\n if level > n: \n nonlocal res\n res += 1\n return\n for i in range(1, n + 1):\n if i not in visited and (i % level == 0 or level % i == 0):\n visited.add(i)\n dfs(level + 1)\n visited.discard(i)\n\n res = 0\n visited = set()\n dfs(1)\n return res\n#\"\"\"\n\n\"\"\"\n# This is permutation problem\nclass Solution: \n # Top down, cache the current array for higher speed, takes around 60 ms \n def countArrangement(self, n: int) -> int:\n def dfs(pos):\n nonlocal res\n \n if pos > n: \n res += 1\n return\n \n for num in range(1, n + 1): \n if num not in visited and (num % pos == 0 or pos % num == 0): \n visited.add(num)\n dfs(pos + 1)\n visited.discard(num)\n \n res = 0\n visited = set()\n \n dfs(1)\n \n return res\n\"\"\"","memory":"16200"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def dfs(pos, visited):\n if pos > n:\n return 1\n count = 0\n for i in range(1, n+1):\n if not visited[i] and (i % pos == 0 or pos % i == 0):\n visited[i] = True\n count += dfs(pos + 1, visited)\n visited[i] = False\n return count\n\n visited = [False] * (n + 1)\n return dfs(1, visited)\n","memory":"16300"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def count(i,visited):\n if i >n:\n return 1\n total=0\n for num in range(1,n+1):\n if not visited[num] and (num%i ==0 or i%num==0):\n visited[num]=True\n total+=count(i+1,visited)\n visited[num]=False\n return total\n\n visited=[False]*(n+1)\n return count(1,visited)\n \n\n \n ","memory":"16400"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n\n arr = [i+1 for i in range(n)]\n\n\n def perm(index):\n\n if index == len(arr):\n return 1\n\n res = 0\n\n for i in range(index, n):\n arr[index], arr[i] = arr[i], arr[index]\n\n if arr[index] % (index + 1) == 0 or (index + 1) % arr[index] == 0: \n res += perm(index + 1)\n\n arr[index], arr[i] = arr[i], arr[index]\n\n return res\n \n return perm(0)","memory":"16500"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n\n arr = [i+1 for i in range(n)]\n\n\n def perm(index):\n\n if index == len(arr):\n return 1\n\n res = 0\n\n for i in range(index, n):\n arr[index], arr[i] = arr[i], arr[index]\n\n if arr[index] % (index + 1) == 0 or (index + 1) % arr[index] == 0: \n res += perm(index + 1)\n\n arr[index], arr[i] = arr[i], arr[index]\n\n return res\n \n return perm(0)","memory":"16500"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n nums=[i for i in range(1,n+1)]\n self.count=0\n def permute(curr):\n if curr==len(nums):\n self.count+=1\n return\n for i in range(curr,len(nums)):\n if ((nums[i]%(curr+1)==0 or (curr+1)%nums[i]==0)):\n nums[i],nums[curr]=nums[curr],nums[i]\n permute(curr+1)\n nums[i],nums[curr]=nums[curr],nums[i]\n return\n permute(0)\n return self.count\n ","memory":"16600"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # Helper function for backtracking\n def backtrack(pos: int, used: set) -> int:\n # Base case: if all positions are filled\n if pos > n:\n return 1\n \n count = 0\n for num in range(1, n + 1):\n # Check if `num` is not used and satisfies the condition\n if num not in used and (num % pos == 0 or pos % num == 0):\n used.add(num)\n count += backtrack(pos + 1, used)\n used.remove(num)\n return count\n \n return backtrack(1, set())\n","memory":"16600"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n self.count = 0\n self.backtrack(n,1,[])\n return self.count\n def backtrack(self,N,idx,temp):\n if len(temp) == N:\n self.count+=1\n return\n for i in range(1,N+1):\n if i not in temp and (i%idx == 0 or idx % i == 0):\n temp.append(i)\n self.backtrack(N,idx+1,temp)\n temp.pop()","memory":"16700"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n permutations = 0\n visited = set()\n\n def isValid(index, num):\n return index % num == 0 or num % index == 0\n\n def bt(nums):\n nonlocal permutations\n if len(nums) == n:\n permutations += 1\n return\n\n for nei in range(1, n + 1):\n if nei in visited or not isValid(len(nums)+1, nei):\n continue\n nums.append(nei)\n visited.add(nei)\n bt(nums)\n visited.remove(nums.pop())\n\n bt([])\n return permutations \n","memory":"16800"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n def count(i, X):\n if i == 1:\n return 1\n return sum(count(i-1, X - {x}) for x in X if x % i == 0 or i % x == 0)\n\n return count(n, set(range(1, n+1)))","memory":"16800"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n '''\n N = n\n Time: O(N!)\n Space: O(N)\n '''\n counter = defaultdict(int) #key: num, val: count\n for num in range(1, n + 1):\n counter[num] += 1\n \n self.count = 0\n def dfs(curr_l: List[int]) -> None:\n if len(curr_l) == n:\n print(curr_l)\n self.count += 1\n return\n \n for num in counter:\n if counter[num] > 0:\n if len(curr_l) == 0 or ((len(curr_l) + 1) % num == 0 or num % (len(curr_l) + 1) == 0): \n print(len(curr_l), num)\n counter[num] -= 1\n dfs(curr_l + [num])\n counter[num] += 1\n \n dfs([])\n return self.count\n\n \n ","memory":"16900"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n\n array = [i+1 for i in range(n)]\n \n result = []\n def permute(remaining, perm):\n if not remaining:\n result.append(perm)\n return\n \n \n for i in range(len(remaining)):\n if not( remaining[i]%(len(perm)+1) and (len(perm)+1)%remaining[i]):\n perm.append(remaining[i])\n left = remaining[:i]+remaining[i+1:]\n permute(left,perm)\n perm.pop()\n \n \n permute(array,[])\n\n\n return len(result)\n\n \n\n ","memory":"17000"},{"code":"class Solution:\n # def countArrangement(self, n: int) -> int:\n # memo = {}\n # nums = tuple(list(range(1, n+1)))\n # print(nums)\n # return self.dfs(nums, memo, n)\n\n # def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\n # if pos == 1:\n # return 1\n # if nums in memo:\n # return memo[nums]\n # cnt = 0\n # for i in range(len(nums)):\n # if nums[i] % pos != 0 and pos % nums[i] != 0:\n # continue\n # cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\n # memo[nums] = cnt\n # return cnt\n\n def countArrangement(self, n: int) -> int:\n memo = {}\n nums = list(range(1, n+1))\n return self.dfs(nums, n, memo)\n \n def dfs(self, nums: List[int], pos: int, memo: Dict) -> int:\n if pos == 1: return 1\n if tuple(nums) in memo:\n return memo[tuple(nums)]\n cnt = 0\n for i in range(len(nums)):\n if nums[i] % pos != 0 and pos % nums[i] != 0:\n continue \n cnt += self.dfs(nums[:i]+nums[i+1:], pos-1, memo)\n memo[tuple(nums)] = cnt\n return cnt\n\n # def countArrangement(self, n: int) -> int:\n # # relatively slower compared with memoization approach\n # nums = list(range(1, n+1))\n # return self.dfs(nums, set())\n\n # def dfs(self, nums: List[int], visited: Set[int]) -> int:\n # if len(visited) == len(nums):\n # return 1\n # cnt = 0\n # for num in nums:\n # if num in visited:\n # continue \n # if num % (len(visited)+1) != 0 and \\\n # (len(visited)+1) % num != 0:\n # continue \n # visited.add(num)\n # cnt += self.dfs(nums, visited)\n # visited.remove(num)\n # return cnt","memory":"17300"},{"code":"class Solution:\n # def countArrangement(self, n: int) -> int:\n # memo = {}\n # nums = tuple(list(range(1, n+1)))\n # print(nums)\n # return self.dfs(nums, memo, n)\n\n # def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\n # if pos == 1:\n # return 1\n # if nums in memo:\n # return memo[nums]\n # cnt = 0\n # for i in range(len(nums)):\n # if nums[i] % pos != 0 and pos % nums[i] != 0:\n # continue\n # cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\n # memo[nums] = cnt\n # return cnt\n\n def countArrangement(self, n: int) -> int:\n memo = {}\n nums = list(range(1, n+1))\n return self.dfs(nums, n, memo)\n \n def dfs(self, nums: List[int], pos: int, memo: Dict) -> int:\n if pos == 1: return 1\n if tuple(nums) in memo:\n return memo[tuple(nums)]\n cnt = 0\n for i in range(len(nums)):\n if nums[i] % pos != 0 and pos % nums[i] != 0:\n continue \n cnt += self.dfs(nums[:i]+nums[i+1:], pos-1, memo)\n memo[tuple(nums)] = cnt\n return cnt\n\n\n # def countArrangement(self, n: int) -> int:\n # # relatively slower compared with memoization approach\n # nums = list(range(1, n+1))\n # return self.dfs(nums, set())\n\n # def dfs(self, nums: List[int], visited: Set[int]) -> int:\n # if len(visited) == len(nums):\n # return 1\n # cnt = 0\n # for num in nums:\n # if num in visited:\n # continue \n # if num % (len(visited)+1) != 0 and \\\n # (len(visited)+1) % num != 0:\n # continue \n # visited.add(num)\n # cnt += self.dfs(nums, visited)\n # visited.remove(num)\n # return cnt","memory":"17400"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n @cache \n def dfs(s:int)->int:\n if s == 0:\n return 1\n res = 0\n i = s.bit_count()\n for j in range(1, n+1):\n if s>>(j-1) & 1 == 1 and (i%j == 0 or j % i == 0):\n res += dfs(s ^ (1<<(j-1)))\n return res\n return dfs((1<<n)-1)","memory":"17600"},{"code":"class Solution:\n def doit(self, i, mask):\n if mask == 0:\n return 1\n if mask in self.H:\n return self.H[mask]\n s = 0\n for j in range(self.n):\n if ((1 << j) & mask) and ((j + 1) % (i + 1) == 0 or (i + 1) % (j + 1) == 0):\n s += self.doit(i + 1, mask ^ (1 << j))\n self.H[mask] = s\n return s\n\n def countArrangement(self, n: int) -> int:\n self.H = {}\n self.n = n\n return self.doit(0, (1 << n) - 1)\n ","memory":"17800"},{"code":"class Solution:\n def countArrangement(self, N):\n @lru_cache(None)\n def dfs(bm, pl):\n if pl == 0: return 1\n \n S = 0\n for i in range(N):\n if not bm&1<<i and ((i+1)%pl == 0 or pl%(i+1) == 0):\n S += dfs(bm^1<<i, pl - 1)\n return S\n \n return dfs(0, N)","memory":"17900"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # available_indices = [1 for i in range(n)]\n @cache\n def dfs(i, b): # use bitmask as argument\n if i == 1:\n return 1\n ans = 0\n for shift in range(n):\n if b & (1 << shift): # shift + 1 is available\n if i % (shift + 1) == 0 or (shift + 1) % i == 0:\n ans += dfs(i - 1, b - (1 << shift))\n return ans\n return dfs(n, (1 << n) - 1)\n","memory":"18000"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # available_indices = [1 for i in range(n)]\n @cache\n def helper(i, b): # use bitmask as argument\n if i == 1:\n return 1\n ans = 0\n for shift in range(n):\n if b & (1 << shift): # shift + 1 is available\n if i % (shift + 1) == 0 or (shift + 1) % i == 0:\n ans += helper(i - 1, b - (1 << shift))\n return ans\n return helper(n, (1 << n) - 1)\n","memory":"18000"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # Cache results to avoid redundant calculations\n @lru_cache(None)\n def count_valid_permutations(remaining_numbers):\n # Base case: only one number left, it forms a valid arrangement\n if len(remaining_numbers) == 1:\n return 1\n \n total_arrangements = 0\n \n # Iterate through each number in the current set of remaining numbers\n for i in range(len(remaining_numbers)):\n num = remaining_numbers[i]\n # Check if the current number can be placed in the current position\n if num % len(remaining_numbers) == 0 or len(remaining_numbers) % num == 0:\n # Recursively count arrangements for the remaining numbers\n new_remaining_numbers = remaining_numbers[:i] + remaining_numbers[i + 1:]\n total_arrangements += count_valid_permutations(new_remaining_numbers)\n \n return total_arrangements\n \n # Start counting arrangements with all numbers from 1 to n\n return count_valid_permutations(tuple(range(1, n + 1)))","memory":"18100"},{"code":"from itertools import permutations\n\nclass Solution:\n def countArrangement(self, n: int) -> int:\n\n @cache\n def count(nums):\n N = len(nums)\n if N == 1:\n return 1\n \n ans = 0\n for i, x in enumerate(nums):\n if x%N ==0 or N%x==0:\n ans += count(nums[:i]+nums[i+1:])\n return ans\n \n \n return count(tuple(range(1, n+1)))","memory":"18200"},{"code":"class Solution:\n def f(self, used: List[str], l: List[int], d: Dict[str, int]) -> int:\n used.sort()\n k: str = '_'.join([str(x) for x in used])\n\n # print(used, l)\n\n if k in d.keys():\n return d[k] \n\n if len(l) == 0:\n d[k] = 1\n return 1\n\n cnt: int = 0\n for i in l:\n index: int = len(used)\n if i % index == 0 or index % i == 0:\n used2 = used + [i]\n l2 = list(l)\n l2.remove(i)\n cnt += self.f(used2, l2, d)\n\n d[k] = cnt\n return d[k]\n\n def countArrangement(self, n: int) -> int:\n return self.f([0], [x for x in range(1, n + 1)], dict())","memory":"18300"},{"code":"class Solution:\n def f(self, used: List[str], l: List[int], d: Dict[str, int]) -> int:\n used.sort()\n k: str = '_'.join([str(x) for x in used])\n k = f'0_{k}'\n\n if k in d.keys():\n return d[k] \n\n if len(l) == 0:\n d[k] = 1\n return 1\n\n cnt: int = 0\n for i in l:\n index: int = len(used) + 1\n if i % index == 0 or index % i == 0:\n used2 = used + [i]\n l2 = list(l)\n l2.remove(i)\n cnt += self.f(used2, l2, d)\n\n d[k] = cnt\n return d[k]\n\n def countArrangement(self, n: int) -> int:\n return self.f([], [x for x in range(1, n + 1)], dict())","memory":"18300"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n cache = {}\n def rec(bits, n, L):\n if bits in cache: return cache[bits]\n if L == n: return 1\n cache[bits] = 0\n e = 1\n for x in range(1, n+1):\n if e & bits:\n e *= 2\n continue\n if not x%(L+1) or not (L+1)%x:\n cache[bits] += rec(bits+e, n, L+1)\n e *= 2\n return cache[bits]\n return rec(0, n, 0)","memory":"18700"},{"code":"class Solution:\n def dfs(self, cur: int, n: int) -> int:\n if cur == n:\n return 1\n elif (self.visited, cur) in self.cache:\n return self.cache[(self.visited, cur)]\n else:\n total = 0\n for i in range(n):\n if (self.visited & (1<<i)) != 0:\n continue\n if (cur+1)%(i+1) == 0 or (i+1)%(cur+1) == 0:\n origin_visited = self.visited\n self.visited = (self.visited | (1<<i))\n res = self.dfs(cur+1, n)\n self.visited = origin_visited\n total += res\n self.cache[(self.visited, cur)] = total\n return total\n \n def countArrangement(self, n: int) -> int:\n self.visited = 0\n self.cache = {}\n res = self.dfs(0, n)\n return res","memory":"18900"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n cache = {}\n \n\n def dfs(i, mask):\n if mask in cache:\n return cache[mask]\n\n if i > n:\n return 1\n\n total = 0\n for j in range(n):\n if (mask >> j) & 1 == 1 and ((j + 1) % i == 0 or i % (j + 1) == 0):\n total += dfs(i + 1, mask ^ (1 << j))\n\n cache[mask] = total\n\n return total\n\n return dfs(1, (1 << n) - 1)\n\n","memory":"19000"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n cache = {}\n \n\n def dfs(i, mask):\n if mask in cache:\n return cache[mask]\n\n if i > n:\n return 1\n\n total = 0\n for j in range(n):\n if (mask >> j) & 1 == 1 and ((j + 1) % i == 0 or i % (j + 1) == 0):\n total += dfs(i + 1, mask ^ (1 << j))\n\n cache[mask] = total\n\n return total\n\n return dfs(1, (1 << n) - 1)\n\n","memory":"19100"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n cache = {}\n \n\n def dfs(i, mask):\n if mask in cache:\n return cache[mask]\n\n if i > n:\n return 1\n\n total = 0\n for j in range(n):\n if (mask >> j) & 1 == 1 and ((j + 1) % i == 0 or i % (j + 1) == 0):\n total += dfs(i + 1, mask ^ (1 << j))\n\n cache[mask] = total\n\n return total\n\n return dfs(1, (1 << n) - 1)\n\n","memory":"19100"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n @cache\n def dp(mask):\n idx = mask.bit_count()\n if idx == n:\n return 1\n idx+=1\n ans = 0\n for i in range(n):\n if not mask & 1 << i: \n if idx%(i+1) == 0 or (i+1)%idx == 0:\n ans+=dp(mask | 1<<i)\n return ans\n return dp(0)","memory":"19200"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n @cache\n def dp(mask):\n ind = mask.bit_count()\n if ind == n:\n return 1\n \n ind += 1\n ans = 0\n for i in range(1, n+1):\n if mask & (1 << (i-1)) == 0 and (i%ind==0 or ind%i ==0):\n ans += dp(mask | (1 << (i-1)))\n \n return ans\n \n return dp(0)\n ","memory":"19300"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n visited = ['0']*n\n valid = [[False]*n for i in range(n)]\n for i in range(n):\n for j in range(n):\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\n valid[i][j] = True\n bad = set()\n def dfs(count):\n if count == n:\n return 1\n \n status = ''.join(x for x in visited)\n if status in bad:\n return 0\n res = 0\n for num in range(n):\n if visited[num] == '0':\n if valid[num][count]:\n visited[num] = '1'\n \n res += dfs(count+1)\n visited[num] = '0'\n if res == 0:\n bad.add(status)\n return res\n \n \n return dfs(0)","memory":"19400"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n available = set([i for i in range(n)])\n valid = [[False]*n for i in range(n)]\n for i in range(n):\n for j in range(n):\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\n valid[i][j] = True\n bad = set()\n def dfs(count):\n if len(available) == 0:\n return 1\n status = '.'.join(str(x) for x in sorted(list(available)))\n if status in bad:\n return 0\n res = 0\n for num in list(available):\n if valid[num][count]:\n available.remove(num)\n \n res += dfs(count+1)\n available.add(num)\n if res == 0:\n bad.add(status)\n return res\n \n \n return dfs(0)","memory":"19600"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n available = set([i for i in range(n)])\n valid = [[False]*n for i in range(n)]\n for i in range(n):\n for j in range(n):\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\n valid[i][j] = True\n bad = set()\n def dfs(count):\n if len(available) == 0:\n return 1\n status = '.'.join(str(x) for x in sorted(list(available)))\n if status in bad:\n return 0\n res = 0\n for num in list(available):\n if valid[num][count]:\n available.remove(num)\n \n res += dfs(count+1)\n available.add(num)\n if res == 0:\n bad.add(status)\n return res\n \n \n return dfs(0)","memory":"19700"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n total = set([i for i in range(n)])\n visited = set()\n valid = [[False]*n for i in range(n)]\n for i in range(n):\n for j in range(n):\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\n valid[i][j] = True\n bad = set()\n def dfs(count):\n if len(visited) == n:\n return 1\n \n status = '.'.join(str(x) for x in sorted(list(total - visited)))\n if status in bad:\n return 0\n res = 0\n for num in range(n):\n if num not in visited:\n if valid[num][count]:\n visited.add(num)\n \n res += dfs(count+1)\n visited.remove(num)\n if res == 0:\n bad.add(status)\n return res\n \n \n return dfs(0)","memory":"19800"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n # preprocessing\n choice = [[] for _ in range(n+1)]\n for i in range(1, n+1):\n for j in range(1, n+1):\n if i % j == 0 or j % i == 0:\n choice[i].append(j)\n # print(choice)\n\n @cache\n def dp(i, status):\n if i > n:\n return 1\n \n cnt = 0\n for k in choice[i]:\n if (1 << k) & status == 0:\n cnt += dp(i+1, status + (1 << k))\n return cnt\n \n return dp(1, 0)","memory":"20500"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n @cache\n def dp(number, mask):\n if number == n+1:\n return 1\n ans = 0\n for i in range(n):\n if mask & (1<<i) == 0 and ((i+1) % number == 0 or number % (i+1) == 0):\n ans += dp(number+1, mask | (1<<i))\n return ans\n return dp(1,0)","memory":"20700"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n\n arr = [i+1 for i in range(n)]\n\n h = {}\n\n\n def perm(index, mask):\n\n if index == len(arr):\n return 1\n\n key = (index, mask)\n\n if key in h:\n return h[key]\n res = 0\n \n\n for i in range(index, n):\n arr[index], arr[i] = arr[i], arr[index]\n mask ^= 1 << (arr[index]-1)\n\n\n if arr[index] % (index + 1) == 0 or (index + 1) % arr[index] == 0: \n res += perm(index + 1, mask)\n\n mask ^= 1 << (arr[index] - 1)\n\n arr[index], arr[i] = arr[i], arr[index]\n \n h[key] = res\n\n return res\n \n return perm(0, 0)","memory":"20800"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n memo = {}\n \n def backtrack(i, visited):\n if i == n + 1:\n return 1\n if (i, visited) in memo:\n return memo[(i, visited)]\n \n res = 0\n for j in range(1, n + 1):\n if not (visited & (1 << j)) and (i % j == 0 or j % i == 0):\n res += backtrack(i + 1, visited | (1 << j))\n \n memo[(i, visited)] = res\n return res\n \n return backtrack(1, 0)","memory":"20900"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n \n @functools.cache\n def dfs(idx, mask):\n if idx == n:\n return 1\n\n # pick any of the element\n ways = 0\n for num in range(1, n + 1):\n # if ith element is not set, use it for current idx\n curr_bit = 1 << num\n if not mask & curr_bit:\n # check if we elem actually passes criteria\n if num % (idx + 1) == 0 or (idx + 1) % num == 0:\n ways += dfs(idx + 1, mask | curr_bit)\n\n return ways\n\n return dfs(0, 0)","memory":"21000"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n if n == 0:\n return 0\n #for n in range(1, 16):\n #print(f'{n=}')\n m = [[] for _ in range(n)]\n for i in range(1, n+1):\n for j in range(1, n+1):\n if i % j == 0 or j % i == 0:\n m[i-1].append(j-1)\n #print(f'{i}: {m[i-1]}')\n\n def r(counter, occupied):\n choices = m[counter]\n ans = []\n for choice in choices:\n if not occupied[choice]:\n new_occupied = copy.copy(occupied)\n new_occupied[choice] = counter + 1\n if counter < n - 1:\n ans += r(counter + 1, new_occupied)\n else:\n ans.append(new_occupied)\n return ans\n occupied = [False for _ in range(n)]\n occupied = r(0, occupied)\n\n return len(occupied)","memory":"21500"},{"code":"class Solution:\n def countArrangement(self, n: int) -> int:\n ans = []\n def permute(arr, ans):\n # print(ans)\n if len(arr) == n:\n ans.append(arr.copy())\n return 0\n for i in range(1, n+1):\n if i not in arr and (not i%(len(arr)+1) or not (len(arr)+1)%i):\n arr.append(i)\n permute(arr, ans)\n arr.pop()\n return 0\n permute([], ans)\n return len(ans)","memory":"21600"},{"code":"class Solution:\n def countArrangement(self, N: int) -> int:\n if N == 0:\n return 0\n nums = list(range(1, N + 1))\n used = [False] * N\n p, res = [], []\n self.generatePermutation526(nums, 0, p, res, used)\n return len(res)\n\n def generatePermutation526(self, nums, index, p, res, used):\n if index == len(nums):\n res.append(p[:])\n return\n for i in range(len(nums)):\n if not used[i]:\n if not self.checkDivisible(nums[i], len(p) + 1) and not self.checkDivisible(len(p) + 1, nums[i]):\n continue\n used[i] = True\n p.append(nums[i])\n self.generatePermutation526(nums, index + 1, p, res, used)\n p.pop()\n used[i] = False\n\n def checkDivisible(self, num, d):\n return num % d == 0","memory":"21600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n path = []\\n ans = [0]\\n\\n def is_divisible(index, value):\\n return index % value == 0 or value % index == 0 \\n\\n def backtracking(path, ans):\\n if len(path) == n:\\n ans[0] += 1\\n return\\n \\n for i in range(1, n+1):\\n if i in path or not is_divisible(len(path)+1, i):\\n continue\\n\\n path.append(i)\\n backtracking(path[:], ans)\\n path.pop()\\n\\n backtracking(path, ans)\\n\\n return ans[0]\",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n @functools.cache\\n def solve(cur):\\n if len(cur) == 1:\\n return 1\\n \\n total = 0\\n for j in range(len(cur)):\\n if cur[j] % len(cur) == 0 or len(cur) % cur[j] == 0:\\n total += solve(cur[:j] + cur[j+1:])\\n \\n return total\\n \\n return solve(tuple(range(1, n+1)))\\n\\\"\\\"\\\" \\n\\n#\\\"\\\"\\\"\\n# typical backtracking algorithm\\nclass Solution:\\n # Top down, cache the current array for higher speed, takes around 60 ms\\n def countArrangement(self, n: int) -> int:\\n def dfs(level): # pos: position to place a new number\\n if level > n: \\n nonlocal res\\n res += 1\\n return\\n for i in range(1, n + 1):\\n if i not in visited and (i % level == 0 or level % i == 0):\\n visited.add(i)\\n dfs(level + 1)\\n visited.discard(i)\\n\\n res = 0\\n visited = set()\\n dfs(1)\\n return res\\n#\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n# This is permutation problem\\nclass Solution: \\n # Top down, cache the current array for higher speed, takes around 60 ms \\n def countArrangement(self, n: int) -> int:\\n def dfs(pos):\\n nonlocal res\\n \\n if pos > n: \\n res += 1\\n return\\n \\n for num in range(1, n + 1): \\n if num not in visited and (num % pos == 0 or pos % num == 0): \\n visited.add(num)\\n dfs(pos + 1)\\n visited.discard(num)\\n \\n res = 0\\n visited = set()\\n \\n dfs(1)\\n \\n return res\\n\\\"\\\"\\\"\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def dfs(pos, visited):\\n if pos > n:\\n return 1\\n count = 0\\n for i in range(1, n+1):\\n if not visited[i] and (i % pos == 0 or pos % i == 0):\\n visited[i] = True\\n count += dfs(pos + 1, visited)\\n visited[i] = False\\n return count\\n\\n visited = [False] * (n + 1)\\n return dfs(1, visited)\\n\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def count(i,visited):\\n if i >n:\\n return 1\\n total=0\\n for num in range(1,n+1):\\n if not visited[num] and (num%i ==0 or i%num==0):\\n visited[num]=True\\n total+=count(i+1,visited)\\n visited[num]=False\\n return total\\n\\n visited=[False]*(n+1)\\n return count(1,visited)\\n \\n\\n \\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n\\n arr = [i+1 for i in range(n)]\\n\\n\\n def perm(index):\\n\\n if index == len(arr):\\n return 1\\n\\n res = 0\\n\\n for i in range(index, n):\\n arr[index], arr[i] = arr[i], arr[index]\\n\\n if arr[index] % (index + 1) == 0 or (index + 1) % arr[index] == 0: \\n res += perm(index + 1)\\n\\n arr[index], arr[i] = arr[i], arr[index]\\n\\n return res\\n \\n return perm(0)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n\\n arr = [i+1 for i in range(n)]\\n\\n\\n def perm(index):\\n\\n if index == len(arr):\\n return 1\\n\\n res = 0\\n\\n for i in range(index, n):\\n arr[index], arr[i] = arr[i], arr[index]\\n\\n if arr[index] % (index + 1) == 0 or (index + 1) % arr[index] == 0: \\n res += perm(index + 1)\\n\\n arr[index], arr[i] = arr[i], arr[index]\\n\\n return res\\n \\n return perm(0)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n nums=[i for i in range(1,n+1)]\\n self.count=0\\n def permute(curr):\\n if curr==len(nums):\\n self.count+=1\\n return\\n for i in range(curr,len(nums)):\\n if ((nums[i]%(curr+1)==0 or (curr+1)%nums[i]==0)):\\n nums[i],nums[curr]=nums[curr],nums[i]\\n permute(curr+1)\\n nums[i],nums[curr]=nums[curr],nums[i]\\n return\\n permute(0)\\n return self.count\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # Helper function for backtracking\\n def backtrack(pos: int, used: set) -> int:\\n # Base case: if all positions are filled\\n if pos > n:\\n return 1\\n \\n count = 0\\n for num in range(1, n + 1):\\n # Check if `num` is not used and satisfies the condition\\n if num not in used and (num % pos == 0 or pos % num == 0):\\n used.add(num)\\n count += backtrack(pos + 1, used)\\n used.remove(num)\\n return count\\n \\n return backtrack(1, set())\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n self.count = 0\\n self.backtrack(n,1,[])\\n return self.count\\n def backtrack(self,N,idx,temp):\\n if len(temp) == N:\\n self.count+=1\\n return\\n for i in range(1,N+1):\\n if i not in temp and (i%idx == 0 or idx % i == 0):\\n temp.append(i)\\n self.backtrack(N,idx+1,temp)\\n temp.pop()\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n permutations = 0\\n visited = set()\\n\\n def isValid(index, num):\\n return index % num == 0 or num % index == 0\\n\\n def bt(nums):\\n nonlocal permutations\\n if len(nums) == n:\\n permutations += 1\\n return\\n\\n for nei in range(1, n + 1):\\n if nei in visited or not isValid(len(nums)+1, nei):\\n continue\\n nums.append(nei)\\n visited.add(nei)\\n bt(nums)\\n visited.remove(nums.pop())\\n\\n bt([])\\n return permutations \\n\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n def count(i, X):\\n if i == 1:\\n return 1\\n return sum(count(i-1, X - {x}) for x in X if x % i == 0 or i % x == 0)\\n\\n return count(n, set(range(1, n+1)))\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n '''\\n N = n\\n Time: O(N!)\\n Space: O(N)\\n '''\\n counter = defaultdict(int) #key: num, val: count\\n for num in range(1, n + 1):\\n counter[num] += 1\\n \\n self.count = 0\\n def dfs(curr_l: List[int]) -> None:\\n if len(curr_l) == n:\\n print(curr_l)\\n self.count += 1\\n return\\n \\n for num in counter:\\n if counter[num] > 0:\\n if len(curr_l) == 0 or ((len(curr_l) + 1) % num == 0 or num % (len(curr_l) + 1) == 0): \\n print(len(curr_l), num)\\n counter[num] -= 1\\n dfs(curr_l + [num])\\n counter[num] += 1\\n \\n dfs([])\\n return self.count\\n\\n \\n \",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n array = [i+1 for i in range(n)]\\n \\n result = []\\n def permute(remaining, perm):\\n if not remaining:\\n result.append(perm)\\n return\\n \\n \\n for i in range(len(remaining)):\\n if not( remaining[i]%(len(perm)+1) and (len(perm)+1)%remaining[i]):\\n perm.append(remaining[i])\\n left = remaining[:i]+remaining[i+1:]\\n permute(left,perm)\\n perm.pop()\\n \\n \\n permute(array,[])\\n\\n\\n return len(result)\\n\\n \\n\\n \",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n # def countArrangement(self, n: int) -> int:\\n # memo = {}\\n # nums = tuple(list(range(1, n+1)))\\n # print(nums)\\n # return self.dfs(nums, memo, n)\\n\\n # def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\\n # if pos == 1:\\n # return 1\\n # if nums in memo:\\n # return memo[nums]\\n # cnt = 0\\n # for i in range(len(nums)):\\n # if nums[i] % pos != 0 and pos % nums[i] != 0:\\n # continue\\n # cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\\n # memo[nums] = cnt\\n # return cnt\\n\\n def countArrangement(self, n: int) -> int:\\n memo = {}\\n nums = list(range(1, n+1))\\n return self.dfs(nums, n, memo)\\n \\n def dfs(self, nums: List[int], pos: int, memo: Dict) -> int:\\n if pos == 1: return 1\\n if tuple(nums) in memo:\\n return memo[tuple(nums)]\\n cnt = 0\\n for i in range(len(nums)):\\n if nums[i] % pos != 0 and pos % nums[i] != 0:\\n continue \\n cnt += self.dfs(nums[:i]+nums[i+1:], pos-1, memo)\\n memo[tuple(nums)] = cnt\\n return cnt\\n\\n # def countArrangement(self, n: int) -> int:\\n # # relatively slower compared with memoization approach\\n # nums = list(range(1, n+1))\\n # return self.dfs(nums, set())\\n\\n # def dfs(self, nums: List[int], visited: Set[int]) -> int:\\n # if len(visited) == len(nums):\\n # return 1\\n # cnt = 0\\n # for num in nums:\\n # if num in visited:\\n # continue \\n # if num % (len(visited)+1) != 0 and \\\\\\n # (len(visited)+1) % num != 0:\\n # continue \\n # visited.add(num)\\n # cnt += self.dfs(nums, visited)\\n # visited.remove(num)\\n # return cnt\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n # def countArrangement(self, n: int) -> int:\\n # memo = {}\\n # nums = tuple(list(range(1, n+1)))\\n # print(nums)\\n # return self.dfs(nums, memo, n)\\n\\n # def dfs(self, nums: List[int], memo: Dict, pos: int) -> int:\\n # if pos == 1:\\n # return 1\\n # if nums in memo:\\n # return memo[nums]\\n # cnt = 0\\n # for i in range(len(nums)):\\n # if nums[i] % pos != 0 and pos % nums[i] != 0:\\n # continue\\n # cnt += self.dfs(nums[:i]+nums[i+1:], memo, pos-1)\\n # memo[nums] = cnt\\n # return cnt\\n\\n def countArrangement(self, n: int) -> int:\\n memo = {}\\n nums = list(range(1, n+1))\\n return self.dfs(nums, n, memo)\\n \\n def dfs(self, nums: List[int], pos: int, memo: Dict) -> int:\\n if pos == 1: return 1\\n if tuple(nums) in memo:\\n return memo[tuple(nums)]\\n cnt = 0\\n for i in range(len(nums)):\\n if nums[i] % pos != 0 and pos % nums[i] != 0:\\n continue \\n cnt += self.dfs(nums[:i]+nums[i+1:], pos-1, memo)\\n memo[tuple(nums)] = cnt\\n return cnt\\n\\n\\n # def countArrangement(self, n: int) -> int:\\n # # relatively slower compared with memoization approach\\n # nums = list(range(1, n+1))\\n # return self.dfs(nums, set())\\n\\n # def dfs(self, nums: List[int], visited: Set[int]) -> int:\\n # if len(visited) == len(nums):\\n # return 1\\n # cnt = 0\\n # for num in nums:\\n # if num in visited:\\n # continue \\n # if num % (len(visited)+1) != 0 and \\\\\\n # (len(visited)+1) % num != 0:\\n # continue \\n # visited.add(num)\\n # cnt += self.dfs(nums, visited)\\n # visited.remove(num)\\n # return cnt\",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n @cache \\n def dfs(s:int)->int:\\n if s == 0:\\n return 1\\n res = 0\\n i = s.bit_count()\\n for j in range(1, n+1):\\n if s>>(j-1) & 1 == 1 and (i%j == 0 or j % i == 0):\\n res += dfs(s ^ (1<<(j-1)))\\n return res\\n return dfs((1<<n)-1)\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def doit(self, i, mask):\\n if mask == 0:\\n return 1\\n if mask in self.H:\\n return self.H[mask]\\n s = 0\\n for j in range(self.n):\\n if ((1 << j) & mask) and ((j + 1) % (i + 1) == 0 or (i + 1) % (j + 1) == 0):\\n s += self.doit(i + 1, mask ^ (1 << j))\\n self.H[mask] = s\\n return s\\n\\n def countArrangement(self, n: int) -> int:\\n self.H = {}\\n self.n = n\\n return self.doit(0, (1 << n) - 1)\\n \",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, N):\\n @lru_cache(None)\\n def dfs(bm, pl):\\n if pl == 0: return 1\\n \\n S = 0\\n for i in range(N):\\n if not bm&1<<i and ((i+1)%pl == 0 or pl%(i+1) == 0):\\n S += dfs(bm^1<<i, pl - 1)\\n return S\\n \\n return dfs(0, N)\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # available_indices = [1 for i in range(n)]\\n @cache\\n def dfs(i, b): # use bitmask as argument\\n if i == 1:\\n return 1\\n ans = 0\\n for shift in range(n):\\n if b & (1 << shift): # shift + 1 is available\\n if i % (shift + 1) == 0 or (shift + 1) % i == 0:\\n ans += dfs(i - 1, b - (1 << shift))\\n return ans\\n return dfs(n, (1 << n) - 1)\\n\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # available_indices = [1 for i in range(n)]\\n @cache\\n def helper(i, b): # use bitmask as argument\\n if i == 1:\\n return 1\\n ans = 0\\n for shift in range(n):\\n if b & (1 << shift): # shift + 1 is available\\n if i % (shift + 1) == 0 or (shift + 1) % i == 0:\\n ans += helper(i - 1, b - (1 << shift))\\n return ans\\n return helper(n, (1 << n) - 1)\\n\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # Cache results to avoid redundant calculations\\n @lru_cache(None)\\n def count_valid_permutations(remaining_numbers):\\n # Base case: only one number left, it forms a valid arrangement\\n if len(remaining_numbers) == 1:\\n return 1\\n \\n total_arrangements = 0\\n \\n # Iterate through each number in the current set of remaining numbers\\n for i in range(len(remaining_numbers)):\\n num = remaining_numbers[i]\\n # Check if the current number can be placed in the current position\\n if num % len(remaining_numbers) == 0 or len(remaining_numbers) % num == 0:\\n # Recursively count arrangements for the remaining numbers\\n new_remaining_numbers = remaining_numbers[:i] + remaining_numbers[i + 1:]\\n total_arrangements += count_valid_permutations(new_remaining_numbers)\\n \\n return total_arrangements\\n \\n # Start counting arrangements with all numbers from 1 to n\\n return count_valid_permutations(tuple(range(1, n + 1)))\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"from itertools import permutations\\n\\nclass Solution:\\n def countArrangement(self, n: int) -> int:\\n\\n @cache\\n def count(nums):\\n N = len(nums)\\n if N == 1:\\n return 1\\n \\n ans = 0\\n for i, x in enumerate(nums):\\n if x%N ==0 or N%x==0:\\n ans += count(nums[:i]+nums[i+1:])\\n return ans\\n \\n \\n return count(tuple(range(1, n+1)))\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def f(self, used: List[str], l: List[int], d: Dict[str, int]) -> int:\\n used.sort()\\n k: str = '_'.join([str(x) for x in used])\\n\\n # print(used, l)\\n\\n if k in d.keys():\\n return d[k] \\n\\n if len(l) == 0:\\n d[k] = 1\\n return 1\\n\\n cnt: int = 0\\n for i in l:\\n index: int = len(used)\\n if i % index == 0 or index % i == 0:\\n used2 = used + [i]\\n l2 = list(l)\\n l2.remove(i)\\n cnt += self.f(used2, l2, d)\\n\\n d[k] = cnt\\n return d[k]\\n\\n def countArrangement(self, n: int) -> int:\\n return self.f([0], [x for x in range(1, n + 1)], dict())\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def f(self, used: List[str], l: List[int], d: Dict[str, int]) -> int:\\n used.sort()\\n k: str = '_'.join([str(x) for x in used])\\n k = f'0_{k}'\\n\\n if k in d.keys():\\n return d[k] \\n\\n if len(l) == 0:\\n d[k] = 1\\n return 1\\n\\n cnt: int = 0\\n for i in l:\\n index: int = len(used) + 1\\n if i % index == 0 or index % i == 0:\\n used2 = used + [i]\\n l2 = list(l)\\n l2.remove(i)\\n cnt += self.f(used2, l2, d)\\n\\n d[k] = cnt\\n return d[k]\\n\\n def countArrangement(self, n: int) -> int:\\n return self.f([], [x for x in range(1, n + 1)], dict())\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n cache = {}\\n def rec(bits, n, L):\\n if bits in cache: return cache[bits]\\n if L == n: return 1\\n cache[bits] = 0\\n e = 1\\n for x in range(1, n+1):\\n if e & bits:\\n e *= 2\\n continue\\n if not x%(L+1) or not (L+1)%x:\\n cache[bits] += rec(bits+e, n, L+1)\\n e *= 2\\n return cache[bits]\\n return rec(0, n, 0)\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, cur: int, n: int) -> int:\\n if cur == n:\\n return 1\\n elif (self.visited, cur) in self.cache:\\n return self.cache[(self.visited, cur)]\\n else:\\n total = 0\\n for i in range(n):\\n if (self.visited & (1<<i)) != 0:\\n continue\\n if (cur+1)%(i+1) == 0 or (i+1)%(cur+1) == 0:\\n origin_visited = self.visited\\n self.visited = (self.visited | (1<<i))\\n res = self.dfs(cur+1, n)\\n self.visited = origin_visited\\n total += res\\n self.cache[(self.visited, cur)] = total\\n return total\\n \\n def countArrangement(self, n: int) -> int:\\n self.visited = 0\\n self.cache = {}\\n res = self.dfs(0, n)\\n return res\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n cache = {}\\n \\n\\n def dfs(i, mask):\\n if mask in cache:\\n return cache[mask]\\n\\n if i > n:\\n return 1\\n\\n total = 0\\n for j in range(n):\\n if (mask >> j) & 1 == 1 and ((j + 1) % i == 0 or i % (j + 1) == 0):\\n total += dfs(i + 1, mask ^ (1 << j))\\n\\n cache[mask] = total\\n\\n return total\\n\\n return dfs(1, (1 << n) - 1)\\n\\n\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n cache = {}\\n \\n\\n def dfs(i, mask):\\n if mask in cache:\\n return cache[mask]\\n\\n if i > n:\\n return 1\\n\\n total = 0\\n for j in range(n):\\n if (mask >> j) & 1 == 1 and ((j + 1) % i == 0 or i % (j + 1) == 0):\\n total += dfs(i + 1, mask ^ (1 << j))\\n\\n cache[mask] = total\\n\\n return total\\n\\n return dfs(1, (1 << n) - 1)\\n\\n\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n cache = {}\\n \\n\\n def dfs(i, mask):\\n if mask in cache:\\n return cache[mask]\\n\\n if i > n:\\n return 1\\n\\n total = 0\\n for j in range(n):\\n if (mask >> j) & 1 == 1 and ((j + 1) % i == 0 or i % (j + 1) == 0):\\n total += dfs(i + 1, mask ^ (1 << j))\\n\\n cache[mask] = total\\n\\n return total\\n\\n return dfs(1, (1 << n) - 1)\\n\\n\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n @cache\\n def dp(mask):\\n idx = mask.bit_count()\\n if idx == n:\\n return 1\\n idx+=1\\n ans = 0\\n for i in range(n):\\n if not mask & 1 << i: \\n if idx%(i+1) == 0 or (i+1)%idx == 0:\\n ans+=dp(mask | 1<<i)\\n return ans\\n return dp(0)\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n @cache\\n def dp(mask):\\n ind = mask.bit_count()\\n if ind == n:\\n return 1\\n \\n ind += 1\\n ans = 0\\n for i in range(1, n+1):\\n if mask & (1 << (i-1)) == 0 and (i%ind==0 or ind%i ==0):\\n ans += dp(mask | (1 << (i-1)))\\n \\n return ans\\n \\n return dp(0)\\n \",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n visited = ['0']*n\\n valid = [[False]*n for i in range(n)]\\n for i in range(n):\\n for j in range(n):\\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\\n valid[i][j] = True\\n bad = set()\\n def dfs(count):\\n if count == n:\\n return 1\\n \\n status = ''.join(x for x in visited)\\n if status in bad:\\n return 0\\n res = 0\\n for num in range(n):\\n if visited[num] == '0':\\n if valid[num][count]:\\n visited[num] = '1'\\n \\n res += dfs(count+1)\\n visited[num] = '0'\\n if res == 0:\\n bad.add(status)\\n return res\\n \\n \\n return dfs(0)\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n available = set([i for i in range(n)])\\n valid = [[False]*n for i in range(n)]\\n for i in range(n):\\n for j in range(n):\\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\\n valid[i][j] = True\\n bad = set()\\n def dfs(count):\\n if len(available) == 0:\\n return 1\\n status = '.'.join(str(x) for x in sorted(list(available)))\\n if status in bad:\\n return 0\\n res = 0\\n for num in list(available):\\n if valid[num][count]:\\n available.remove(num)\\n \\n res += dfs(count+1)\\n available.add(num)\\n if res == 0:\\n bad.add(status)\\n return res\\n \\n \\n return dfs(0)\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n available = set([i for i in range(n)])\\n valid = [[False]*n for i in range(n)]\\n for i in range(n):\\n for j in range(n):\\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\\n valid[i][j] = True\\n bad = set()\\n def dfs(count):\\n if len(available) == 0:\\n return 1\\n status = '.'.join(str(x) for x in sorted(list(available)))\\n if status in bad:\\n return 0\\n res = 0\\n for num in list(available):\\n if valid[num][count]:\\n available.remove(num)\\n \\n res += dfs(count+1)\\n available.add(num)\\n if res == 0:\\n bad.add(status)\\n return res\\n \\n \\n return dfs(0)\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n total = set([i for i in range(n)])\\n visited = set()\\n valid = [[False]*n for i in range(n)]\\n for i in range(n):\\n for j in range(n):\\n if (i+1)%(j+1) == 0 or (j+1)%(i+1) == 0:\\n valid[i][j] = True\\n bad = set()\\n def dfs(count):\\n if len(visited) == n:\\n return 1\\n \\n status = '.'.join(str(x) for x in sorted(list(total - visited)))\\n if status in bad:\\n return 0\\n res = 0\\n for num in range(n):\\n if num not in visited:\\n if valid[num][count]:\\n visited.add(num)\\n \\n res += dfs(count+1)\\n visited.remove(num)\\n if res == 0:\\n bad.add(status)\\n return res\\n \\n \\n return dfs(0)\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n # preprocessing\\n choice = [[] for _ in range(n+1)]\\n for i in range(1, n+1):\\n for j in range(1, n+1):\\n if i % j == 0 or j % i == 0:\\n choice[i].append(j)\\n # print(choice)\\n\\n @cache\\n def dp(i, status):\\n if i > n:\\n return 1\\n \\n cnt = 0\\n for k in choice[i]:\\n if (1 << k) & status == 0:\\n cnt += dp(i+1, status + (1 << k))\\n return cnt\\n \\n return dp(1, 0)\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n @cache\\n def dp(number, mask):\\n if number == n+1:\\n return 1\\n ans = 0\\n for i in range(n):\\n if mask & (1<<i) == 0 and ((i+1) % number == 0 or number % (i+1) == 0):\\n ans += dp(number+1, mask | (1<<i))\\n return ans\\n return dp(1,0)\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n\\n arr = [i+1 for i in range(n)]\\n\\n h = {}\\n\\n\\n def perm(index, mask):\\n\\n if index == len(arr):\\n return 1\\n\\n key = (index, mask)\\n\\n if key in h:\\n return h[key]\\n res = 0\\n \\n\\n for i in range(index, n):\\n arr[index], arr[i] = arr[i], arr[index]\\n mask ^= 1 << (arr[index]-1)\\n\\n\\n if arr[index] % (index + 1) == 0 or (index + 1) % arr[index] == 0: \\n res += perm(index + 1, mask)\\n\\n mask ^= 1 << (arr[index] - 1)\\n\\n arr[index], arr[i] = arr[i], arr[index]\\n \\n h[key] = res\\n\\n return res\\n \\n return perm(0, 0)\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n memo = {}\\n \\n def backtrack(i, visited):\\n if i == n + 1:\\n return 1\\n if (i, visited) in memo:\\n return memo[(i, visited)]\\n \\n res = 0\\n for j in range(1, n + 1):\\n if not (visited & (1 << j)) and (i % j == 0 or j % i == 0):\\n res += backtrack(i + 1, visited | (1 << j))\\n \\n memo[(i, visited)] = res\\n return res\\n \\n return backtrack(1, 0)\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n \\n @functools.cache\\n def dfs(idx, mask):\\n if idx == n:\\n return 1\\n\\n # pick any of the element\\n ways = 0\\n for num in range(1, n + 1):\\n # if ith element is not set, use it for current idx\\n curr_bit = 1 << num\\n if not mask & curr_bit:\\n # check if we elem actually passes criteria\\n if num % (idx + 1) == 0 or (idx + 1) % num == 0:\\n ways += dfs(idx + 1, mask | curr_bit)\\n\\n return ways\\n\\n return dfs(0, 0)\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n if n == 0:\\n return 0\\n #for n in range(1, 16):\\n #print(f'{n=}')\\n m = [[] for _ in range(n)]\\n for i in range(1, n+1):\\n for j in range(1, n+1):\\n if i % j == 0 or j % i == 0:\\n m[i-1].append(j-1)\\n #print(f'{i}: {m[i-1]}')\\n\\n def r(counter, occupied):\\n choices = m[counter]\\n ans = []\\n for choice in choices:\\n if not occupied[choice]:\\n new_occupied = copy.copy(occupied)\\n new_occupied[choice] = counter + 1\\n if counter < n - 1:\\n ans += r(counter + 1, new_occupied)\\n else:\\n ans.append(new_occupied)\\n return ans\\n occupied = [False for _ in range(n)]\\n occupied = r(0, occupied)\\n\\n return len(occupied)\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, n: int) -> int:\\n ans = []\\n def permute(arr, ans):\\n # print(ans)\\n if len(arr) == n:\\n ans.append(arr.copy())\\n return 0\\n for i in range(1, n+1):\\n if i not in arr and (not i%(len(arr)+1) or not (len(arr)+1)%i):\\n arr.append(i)\\n permute(arr, ans)\\n arr.pop()\\n return 0\\n permute([], ans)\\n return len(ans)\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def countArrangement(self, N: int) -> int:\\n if N == 0:\\n return 0\\n nums = list(range(1, N + 1))\\n used = [False] * N\\n p, res = [], []\\n self.generatePermutation526(nums, 0, p, res, used)\\n return len(res)\\n\\n def generatePermutation526(self, nums, index, p, res, used):\\n if index == len(nums):\\n res.append(p[:])\\n return\\n for i in range(len(nums)):\\n if not used[i]:\\n if not self.checkDivisible(nums[i], len(p) + 1) and not self.checkDivisible(len(p) + 1, nums[i]):\\n continue\\n used[i] = True\\n p.append(nums[i])\\n self.generatePermutation526(nums, index + 1, p, res, used)\\n p.pop()\\n used[i] = False\\n\\n def checkDivisible(self, num, d):\\n return num % d == 0\",\n \"memory\": \"21600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":43,"string":"43"}}},{"rowIdx":280,"cells":{"question_id":{"kind":"number","value":912,"string":"912"},"name":{"kind":"string","value":"random-pick-with-weight"},"content":{"kind":"string","value":"<p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>\n\n<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range <code>[0, w.length - 1]</code> (<strong>inclusive</strong>) and returns it. The <strong>probability</strong> of picking an index <code>i</code> is <code>w[i] / sum(w)</code>.</p>\n\n<ul>\n\t<li>For example, if <code>w = [1, 3]</code>, the probability of picking index <code>0</code> is <code>1 / (1 + 3) = 0.25</code> (i.e., <code>25%</code>), and the probability of picking index <code>1</code> is <code>3 / (1 + 3) = 0.75</code> (i.e., <code>75%</code>).</li>\n</ul>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input</strong>\n["Solution","pickIndex"]\n[[[1]],[]]\n<strong>Output</strong>\n[null,0]\n\n<strong>Explanation</strong>\nSolution solution = new Solution([1]);\nsolution.pickIndex(); // return 0. The only option is to return 0 since there is only one element in w.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input</strong>\n["Solution","pickIndex","pickIndex","pickIndex","pickIndex","pickIndex"]\n[[[1,3]],[],[],[],[],[]]\n<strong>Output</strong>\n[null,1,1,1,1,0]\n\n<strong>Explanation</strong>\nSolution solution = new Solution([1, 3]);\nsolution.pickIndex(); // return 1. It is returning the second element (index = 1) that has a probability of 3/4.\nsolution.pickIndex(); // return 1\nsolution.pickIndex(); // return 1\nsolution.pickIndex(); // return 1\nsolution.pickIndex(); // return 0. It is returning the first element (index = 0) that has a probability of 1/4.\n\nSince this is a randomization problem, multiple answers are allowed.\nAll of the following outputs can be considered correct:\n[null,1,1,1,1,0]\n[null,1,1,1,1,1]\n[null,1,1,1,0,0]\n[null,1,1,1,0,1]\n[null,1,0,1,0,0]\n......\nand so on.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= w.length <= 10<sup>4</sup></code></li>\n\t<li><code>1 <= w[i] <= 10<sup>5</sup></code></li>\n\t<li><code>pickIndex</code> will be called at most <code>10<sup>4</sup></code> times.</li>\n</ul>\n"},"acRate":{"kind":"number","value":47.20810135528314,"string":"47.208101"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","math","binary-search","prefix-sum","randomized"],"string":"[\n \"array\",\n \"math\",\n \"binary-search\",\n \"prefix-sum\",\n \"randomized\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"120\", 26.173399999999994], [\"172\", 46.262499999999996], [\"224\", 1.7454000000000012], [\"276\", 0.5781999999999999], [\"329\", 0.31860000000000005], [\"381\", 0.21240000000000006], [\"433\", 0.34219999999999995], [\"485\", 0.0826], [\"538\", 0.09440000000000001], [\"590\", 0.0472], [\"642\", 0.118], [\"695\", 0.059], [\"747\", 0.0354], [\"799\", 0.0472], [\"851\", 0.09440000000000001], [\"904\", 0.0472], [\"956\", 0.25960000000000005], [\"1008\", 0.18880000000000005], [\"1060\", 0.0826], [\"1113\", 0.059], [\"1165\", 0.0236], [\"1217\", 0.0118], [\"1269\", 0.0236], [\"1322\", 0.0354], [\"1374\", 0.0354], [\"1426\", 0.0118], [\"1478\", 0.11800000000000002], [\"1531\", 0.0472], [\"1583\", 0.0354], [\"1635\", 0.0118], [\"1688\", 0.0354], [\"1740\", 0.0236], [\"1792\", 0.0472], [\"1844\", 0.0236], [\"1897\", 0.0118], [\"1949\", 0.0118], [\"2001\", 0.0236], [\"2053\", 0.0118], [\"2106\", 0.0118], [\"2158\", 0.1652], [\"2210\", 0.7434], [\"2262\", 1.2623], [\"2315\", 2.405300000000001], [\"2367\", 1.0264], [\"2419\", 0.38939999999999997], [\"2471\", 0.22420000000000007], [\"2524\", 0.09440000000000001], [\"2576\", 0.0236], [\"2628\", 0.1416], [\"2680\", 0.44839999999999997], [\"2733\", 0.25960000000000005], [\"2785\", 0.15340000000000004], [\"2837\", 0.0708], [\"2890\", 0.0236], [\"2942\", 0.0708], [\"2994\", 0.0472], [\"3046\", 0.10620000000000002], [\"3099\", 0.0472], [\"3151\", 0.0826], [\"3203\", 0.0472], [\"3255\", 0.0472], [\"3308\", 0.7197999999999999], [\"3360\", 0.9321000000000002], [\"3412\", 1.9104000000000003], [\"3464\", 1.8752000000000004], [\"3517\", 0.9672999999999997], [\"3569\", 0.7198], [\"3621\", 0.4366], [\"3673\", 0.5663999999999999], [\"3726\", 0.27140000000000003], [\"3778\", 0.3186], [\"3830\", 0.20060000000000003], [\"3883\", 0.17700000000000005], [\"3935\", 0.12980000000000003], [\"3987\", 0.0944], [\"4039\", 0.09440000000000001], [\"4092\", 0.0472], [\"4144\", 0.09440000000000001], [\"4196\", 0.0708], [\"4248\", 0.0826]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"19200\", 0.0236], [\"19500\", 0.0236], [\"19600\", 0.0118], [\"19700\", 0.0118], [\"19800\", 0.0589], [\"19900\", 0.0118], [\"20000\", 0.0236], [\"20100\", 0.0236], [\"20200\", 0.0236], [\"20300\", 0.0118], [\"20400\", 0.0118], [\"20500\", 0.0354], [\"20600\", 0.0825], [\"20700\", 0.1061], [\"20800\", 0.1886], [\"20900\", 0.9668], [\"21000\", 13.9236], [\"21100\", 35.5459], [\"21200\", 14.6899], [\"21300\", 8.1585], [\"21400\", 10.3513], [\"21500\", 3.0417], [\"21600\", 2.9828], [\"21700\", 2.8531], [\"21800\", 0.5659], [\"21900\", 0.3183], [\"22000\", 0.2358], [\"22100\", 0.0707], [\"22200\", 0.2122], [\"22300\", 0.224]]}"},"rt_list":{"kind":"list like","value":[{"code":"\nclass Solution:\n\n def __init__(self, w: List[int]):\n total = sum(w)\n self.weights = []\n acc = 0.0\n for weight in w:\n acc += weight / total\n self.weights.append(acc)\n self.weights[-1] = 1.0\n\n\n def pickIndex(self) -> int:\n return bisect_left(self.weights, random.random())\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"120"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n n = len(w)\n unit = 1 / sum(w)\n self.probs = [0] * n\n self.probs[0] = w[0] * unit\n for i in range(1, n):\n self.probs[i] = self.probs[i - 1] + unit * w[i]\n \n\n\n \n\n def pickIndex(self) -> int:\n r = random.random()\n i = bisect_left(self.probs, r)\n return i\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"120"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.lots = []\n self.total_lots = 0\n\n for weight in w:\n self.total_lots += weight\n self.lots.append(self.total_lots)\n\n def pickIndex(self) -> int:\n target = random.randint(1, self.total_lots)\n start, end = 0, len(self.lots)\n\n while start < end:\n mid = (start + end) // 2\n if target > self.lots[mid]:\n start = mid + 1\n else:\n end = mid\n\n return start","runtime":"172"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.total = 0\n self.prefix_sum = []\n for i in range(len(w)):\n self.total += w[i]\n self.prefix_sum.append(self.total)\n\n def pickIndex(self) -> int:\n pick = random.randint(0, self.total - 1)\n bs_idx = bisect.bisect(self.prefix_sum, pick)\n while bs_idx < len(self.prefix_sum) and self.prefix_sum[bs_idx] <= pick:\n bs_idx += 1\n return bs_idx\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"172"},{"code":"class Solution:\n\n def __init__(self, w):\n ep = 10e-5\n self.N, summ = len(w), sum(w)\n weights = [elem/summ for elem in w]\n Dic_More, Dic_Less, self.Boxes = {}, {}, []\n\n for i in range(self.N):\n if weights[i] >= 1/self.N:\n Dic_More[i] = weights[i]\n else:\n Dic_Less[i] = weights[i]\n\n while Dic_More and Dic_Less:\n t_1 = next(iter(Dic_More))\n t_2 = next(iter(Dic_Less))\n self.Boxes.append([t_2,t_1,Dic_Less[t_2]*self.N])\n\n Dic_More[t_1] -= (1/self.N - Dic_Less[t_2])\n if Dic_More[t_1] < 1/self.N - ep:\n Dic_Less[t_1] = Dic_More[t_1]\n Dic_More.pop(t_1)\n Dic_Less.pop(t_2)\n\n for key in Dic_More: self.Boxes.append([key])\n\n def pickIndex(self):\n r = random.uniform(0, 1)\n Box_num = int(r*self.N)\n if len(self.Boxes[Box_num]) == 1:\n return self.Boxes[Box_num][0]\n else:\n q = random.uniform(0, 1)\n if q < self.Boxes[Box_num][2]:\n return self.Boxes[Box_num][0]\n else:\n return self.Boxes[Box_num][1]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"224"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.sum = 0\n self.prefix_sums = []\n for weight in w:\n self.sum+=weight\n self.prefix_sums.append(self.sum)\n\n def pickIndex(self) -> int:\n rand = random.random() * self.sum\n print(rand)\n\n l = 0\n r = len(self.prefix_sums) \n\n while l < r:\n mid = l + ((r-l)//2)\n if self.prefix_sums[mid] < rand:\n l = mid+1\n else:\n r = mid\n\n return r \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"224"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.array = []\n num = -1\n for i, weight in enumerate(w):\n self.array.append(num + weight)\n num += weight\n \n\n def pickIndex(self) -> int:\n k = random.randint(0, self.array[-1])\n i = 0\n j = len(self.array)\n\n\n while (i < j):\n mid = (i + j) // 2\n print(f\"j: {j}\")\n if self.array[mid] >= k:\n j = mid\n else:\n i = mid + 1\n\n return i\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"329"},{"code":"import numpy\nimport random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n sum_of_weights = numpy.sum(w)\n\n self.probabilities = [int(max((weight / sum_of_weights) * 100, 1)) for weight in w]\n self.indices = []\n\n for (index, probability) in enumerate(self.probabilities):\n for _ in range(probability):\n self.indices.append(index)\n\n def pickIndex(self) -> int:\n return self.indices[int(random.uniform(0, len(self.indices) - 1))]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"329"},{"code":"from numpy import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weights = w\n self.indexArr = [i for i in range(len(self.weights))]\n self.probabs = self.convertweights(self.weights)\n self.i = pow(10,4) + 1\n self.output = random.choice(self.indexArr,size = pow(10,4) + 1, p=self.probabs)\n\n def convertweights(self, weights):\n sum_ = sum(weights)\n return [(weights[i] / sum_) for i in range(len(weights))]\n\n\n \n\n def pickIndex(self) -> int:\n self.i-=1\n return self.output[self.i]\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"381"},{"code":"class Solution:\n def __init__(self, w: List[int]):\n self.w = w\n self.max = sum(w)\n self.fenwick = FenwickTree(len(w))\n self.prefixSum = []\n tmp = 0\n for i, weight in enumerate(w):\n tmp += weight\n self.prefixSum.append(tmp)\n self.fenwick.add(i, weight)\n\n def pickIndex(self) -> int:\n target = random.random() * self.max\n lo = 0\n hi = len(self.w)\n while lo < hi:\n mid = (lo + hi) // 2\n if target > self.fenwick.query(mid):\n lo = mid + 1\n else:\n hi = mid\n return lo\n\nclass FenwickTree:\n def __init__(self, size):\n self.arr = [0] * (size+1)\n \n def add(self, index, delta):\n index += 1\n while index < len(self.arr):\n self.arr[index] += delta\n index += rightMostSetBit(index)\n\n def query(self, index):\n prefixSum = 0\n index += 1\n while index > 0:\n prefixSum += self.arr[index]\n index -= rightMostSetBit(index)\n return prefixSum\n\ndef rightMostSetBit(number):\n return number & -number\n\nclass SegmentTree:\n def __init__(self):\n pass","runtime":"381"},{"code":"import random \nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.sum = list()\n self.sum_val = 0\n for item in w:\n self.sum_val += item\n self.sum.append(self.sum_val)\n\n def pickIndex(self) -> int:\n target = self.sum_val * random.random()\n print(target)\n index = self.search(self.sum, target, 0, len(self.sum) - 1)\n return index\n\n def search(self, num, target, low, high):\n print(f'low: {low}, high: {high}')\n if low < high:\n mid = (low + high) // 2\n if mid + 1 < len(num) and target >= num[mid] and target < num[mid + 1]:\n return mid+1\n elif target <= num[mid]:\n return self.search(num, target, low, mid)\n else:\n return self.search(num, target, mid + 1, high)\n else:\n if low + 1 >= len(num):\n if low - 1 >= 0 and target > num[low - 1] and target <= num[low]:\n return low\n if low - 1 < 0:\n if num[low] >= target:\n return low\n return\n","runtime":"433"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sums = []\n prefix_sum = 0\n for weight in w:\n prefix_sum += weight\n self.prefix_sums.append(prefix_sum)\n self.total_sum = prefix_sum\n\n def pickIndex(self) -> int:\n target = self.total_sum * random.random()\n print(random.random())\n print(self.total_sum)\n print(target)\n # run a binary search to find the target zone\n low, high = 0, len(self.prefix_sums)\n print(high)\n while low < high:\n mid = low + (high - low) // 2\n print(mid)\n if target > self.prefix_sums[mid]:\n low = mid + 1\n else:\n high = mid\n return low\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"433"},{"code":"def binsearch(arr, left, right, target):\n # insert base case\n ##\n print(\"at: \", left, right)\n delta_idx = (right - left) \n pivot = left + delta_idx // 2\n # if delta_idx == 1:\n # print(f\"left={left}, right={right}, left_val={arr[left]}, right_val={arr[right]}, target={target}\")\n # return max(right, left)\n # elif delta_idx == 0:\n # return left + 1\n if delta_idx <= 0:\n return left\n elif arr[pivot] < target:\n ret = binsearch(arr, pivot + 1, right, target)\n else:\n ret = binsearch(arr, left, pivot, target)\n return ret\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n tot = sum(w)\n self.cumsums = []\n self.tot = 0\n for myw in w:\n self.tot += myw\n self.cumsums.append(self.tot)\n \n def pickIndex(self) -> int:\n target = self.tot * random.random() # rand num between 0 and self.tot\n return binsearch(self.cumsums, 0, len(self.cumsums) - 1, target)\n \n def pickIndex2(self) -> int:\n target = self.tot * random.random() # rand num between 0 and self.tot\n for i, mysum in enumerate(self.cumsums):\n if target < mysum:\n return i\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"485"},{"code":"import numpy as np\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n #self.cdf = []\n #for ww in w:\n # self.total += ww\n # self.cdf.append(self.total)\n self.cdf = np.cumsum(w)\n self.total = self.cdf[-1]\n\n def pickIndex(self) -> int:\n\n #rand = random.randint(1, self.total)\n rand = ceil(random.random() * self.total)\n #rand = random.randint(1, self.total)\n\n return bisect.bisect_left(self.cdf, rand)\n\n \"\"\"\n def __init__(self, w: List[int]):\n self.prefix_sum = []\n prefix_sum = 0\n for weight in w:\n prefix_sum += weight\n self.prefix_sum.append(prefix_sum)\n print(self.prefix_sum)\n self.total_sum = prefix_sum\n\n def pickIndex(self) -> int:\n # Generate a random number in the range [1, total_sum]\n random_num = random.randint(1, self.total_sum)\n # Use binary search to find the index of the random number in prefix_sum\n index = bisect_left(self.prefix_sum, random_num)\n # Return the index corresponding to the random number\n return index\n \"\"\"\n\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"485"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n ## say weights are [1, 2, 2, 5]\n ### make weights into array [0, 0.1, 0.3, 0.5] etc\n ###binary search will get first index i s.t. p < cum_weight[i] , return i -1\n curr_sum = 0\n self.cum_weight = []\n for weight in w:\n self.cum_weight.append(curr_sum)\n curr_sum += weight\n self.cum_weight = [weight/ curr_sum for weight in self.cum_weight]\n print(self.cum_weight)\n def pickIndex(self) -> int:\n ## pick random number\n p = random.uniform(0,1)\n print('prob: ', p)\n if len(self.cum_weight) == 1:\n return 0\n left, right = 1, len(self.cum_weight)\n while (left < right):\n mid = left + (right - left) // 2\n print(left, right, mid)\n #return 0\n ### search left\n #'''\n if p < self.cum_weight[mid]:\n right = mid\n else:\n left = mid+1\n #'''\n return left - 1\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"538"},{"code":"class Solution:\n def __init__(self, w: List[int]):\n import numpy as np\n import random\n self.w = w\n self.prefix_sums = np.cumsum(w)\n self.total = self.prefix_sums[-1]\n \n def pickIndex(self) -> int:\n import numpy as np\n target = self.total * random.random()\n return np.searchsorted(self.prefix_sums, target, side='right')\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"538"},{"code":"import numpy as np\nimport random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.cs = np.cumsum(w)\n #print(self.cs)\n\n def pickIndex(self) -> int:\n rv = random.random() * self.cs[-1]\n l = 0\n r = len(self.cs)\n while l <= r:\n mid = (l+r) // 2\n midl_val = self.cs[mid - 1] if mid - 1 >= 0 else 0\n midr_val = self.cs[mid + 1] if mid + 1 < len(self.cs) else 1\n if self.cs[mid] >= rv and midl_val <= rv:\n return mid\n \n if self.cs[mid] > rv:\n r = mid - 1\n else:\n l = mid + 1\n\n return mid\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"590"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.sumVals = sum(w)\n self.probability = [k/self.sumVals for k in w]\n self.probability = [sum(self.probability[:k+1]) for k in range(len(w))]\n\n\n def pickIndex(self) -> int:\n return bisect_left(self.probability, random.random())\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"590"},{"code":"import random\nimport bisect\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.nw = [w[0]]*len(w)\n for i in range(1, len(w)):\n self.nw[i] = self.nw[i-1] + w[i]\n self.total = self.nw[-1]\n \n\n def pickIndex(self) -> int:\n random.seed()\n num = random.randint(0, self.total-1)\n\n left, right = 0, len(self.nw)-1\n while left + 1 < right:\n mid = (left + right) //2\n if self.nw[mid] > num:\n right = mid\n elif self.nw[mid] < num:\n left = mid\n else:\n return mid + 1\n \n if self.nw[left] > num:\n return left\n else: \n return right\n \n\n # pos = bisect.bisect_right(self.nw, num)\n # return pos\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()\n\n\n\n\n# import random\n\n# class Solution:\n\n# def __init__(self, w: List[int]):\n# random.seed()\n \n# self.walls = []\n# count = 0\n# for weight in w:\n# count += weight\n# self.walls.append(count)\n \n# self.total = self.walls[-1]\n\n# # self.wList = []\n# # for index in range(len(w)):\n# # weight = w[index]\n# # while weight > 0:\n# # self.wList.append(index)\n# # weight -= 1\n\n\n\n \n# def pickIndex(self) -> int:\n# pick = random.randint(0, self.total-1)\n# if pick < self.walls[0]:\n# return 0\n \n# left = 0\n# right = len(self.walls)-1\n\n# while left + 1 < right:\n# mid = (left + right) //2\n# if self.walls[mid] > pick:\n# right = mid\n# elif self.walls[mid] < pick:\n# left = mid\n# else:\n# return mid + 1\n \n# return left+1\n\n\n\n\n# # def __init__(self, w: List[int]):\n# # random.seed()\n# # count = 0\n# # self.indices = [0]\n# # for i in range(len(w)):\n# # element = w[i]\n# # count += element\n# # self.indices.append(count)\n\n \n\n# # def pickIndex(self) -> int:\n# # pick = random.randint(0, self.indices[-1] -1)\n# # left, right = 0, len(self.indices)-1\n# # while left + 1 < right:\n# # mid = (left + right) // 2\n# # if self.indices[mid] <= pick:\n# # left = mid\n# # else:\n# # right = mid\n# # return left \n \n\n\n# # Your Solution object will be instantiated and called as such:\n# # obj = Solution(w)\n# # param_1 = obj.pickIndex()","runtime":"642"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\n self.total_weight = self.cumm_sum[-1]\n # print(self.total_weight)\n\n def pickIndex(self) -> int:\n target = random.uniform(0, self.total_weight)\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\n return index\n\n def bisect_left(self, low, high, arr, target) -> int:\n \"\"\"\n \n \"\"\"\n if low <0:\n raise ValueError('lo must be non-negative')\n if high==None:\n high = len(arr)\n while low < high:\n mid = (low + high) //2\n if arr[mid]<target:\n low = mid+1\n else:\n high = mid\n return low\n\n# # Your Solution object will be instantiated and called as such:\n# # obj = Solution(w)\n# # param_1 = obj.pickIndex()\n\n# import random\n\n# class Solution:\n\n# def __init__(self, w):\n# self.prefix_sums = []\n# total = 0\n# for weight in w:\n# total += weight\n# self.prefix_sums.append(total)\n# self.total_weight = total\n\n# def bisect_left(self, a, x):\n# lo = 0\n# hi = len(a)\n# while lo < hi:\n# mid = (lo + hi) // 2\n# if a[mid] < x:\n# lo = mid + 1\n# else:\n# hi = mid\n# return lo\n\n# def pickIndex(self):\n# target = random.uniform(0, self.total_weight)\n# index = self.bisect_left(self.prefix_sums, target)\n# return index\n","runtime":"642"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.p_sum = [sum(w[:i]) for i in range(1, len(w)+1)]\n \n def pickIndex(self) -> int:\n seed = random.randint(1, self.p_sum[-1])\n l, r = 0, len(self.p_sum)-1\n while l <= r:\n mid = (l + r) // 2\n if self.p_sum[mid] < seed:\n l = mid + 1\n else:\n r = mid - 1\n return l\n\n\n\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"695"},{"code":"from random import uniform\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.nums = w\n self.weights = [sum(w[:index+1]) for index in range(len(w))]\n \n\n def pickIndex(self) -> int:\n if self.nums == []:\n return None\n else:\n random_number = uniform(0,self.weights[-1])\n left, right = 0, len(self.weights) - 1\n while (left < right):\n middle = (left + right) // 2\n current = self.weights[middle]\n if current < random_number:\n left = middle + 1\n elif current > random_number:\n right = middle \n return left\n\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"695"},{"code":"import numpy as np\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.dist = np.cumsum(w)\n self.w = w\n \n\n def pickIndex(self) -> int:\n i = np.random.randint(self.dist[-1])\n ind = np.where(i<self.dist)[0][0]\n return ind\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"747"},{"code":"import random\nclass Solution(object):\n\n def __init__(self, w):\n \"\"\"\n :type w: List[int]\n \"\"\"\n self.cum_sum = [0]+ [sum(w[0:i+1]) for i in range(len(w))]\n print(self.cum_sum)\n\n\n def pickIndex(self):\n \"\"\"\n :rtype: int\n \"\"\"\n rand_num = random.randint(0,self.cum_sum[-1]-1)\n \n left = 0\n right = len(self.cum_sum) - 1\n while left < right:\n \n mid = (left + right) //2\n if mid == left:\n break\n if rand_num < self.cum_sum[mid]:\n right = mid\n else:\n left = mid\n mid = (left + right) // 2\n print('rand_num', rand_num)\n print('mid', mid)\n return mid\n\n \n \n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"747"},{"code":"import random\nimport math\nclass Solution:\n def __init__(self, w: List[int]):\n self.w = [0]\n cumsum = 0\n for i in w:\n cumsum += i\n self.w.append(cumsum)\n self.w.pop()\n print(self.w)\n self.n = cumsum\n \n def pickIndex(self) -> int:\n p = random.random()*self.n\n l = 0\n r = len(self.w) - 1\n while l < r:\n m = r - ((r - l) // 2)\n #m = math.ceil((l+r)/2)\n v = self.w[m]\n print(p, v, m, l, r)\n if p > v:\n l = m\n else:\n r = m - 1\n print('>', l)\n return l\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"799"},{"code":"import random\nimport math\nclass Solution:\n def __init__(self, w: List[int]):\n self.w = [0]\n cumsum = 0\n for i in w:\n cumsum += i\n self.w.append(cumsum)\n self.w.pop()\n print(self.w)\n self.n = cumsum\n \n def pickIndex(self) -> int:\n p = random.random()*self.n\n l = 0\n r = len(self.w) - 1\n while l < r:\n m = r - ((r - l) // 2)\n m = math.ceil((l+r)/2)\n v = self.w[m]\n print(p, v, m, l, r)\n if p > v:\n l = m\n else:\n r = m - 1\n print('>', l)\n return l\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"799"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n acc = 0\n self.probability = []\n for weight in w:\n acc += weight / sum(w)\n self.probability.append(acc)\n self.probability[-1] = 1\n\n\n def pickIndex(self) -> int:\n return bisect_left(self.probability, random.random())\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"851"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = [i/sum(w) for i in w]\n self.cumw = []\n s = 0\n for i in self.w:\n s+=i\n self.cumw.append(s)\n\n def pickIndex(self) -> int:\n random_number = random.random()\n left = 0\n right = len(self.cumw)\n while left<right:\n mid = (left+right)//2\n if self.cumw[mid]>=random_number:\n right = mid\n else:\n left = mid+1\n return left\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"851"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n w=list(map(lambda x:x/sum(w),w))\n for x in range(1,len(w)) :\n w[x]+=w[x-1]\n self.w=w\n\n\n def pickIndex(self) -> int:\n r=random.uniform(0,1)\n return bisect.bisect_left(self.w,r)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"904"},{"code":"class Solution:\n def __init__(self, w: List[int]):\n self.weights = [i / sum(w) for i in accumulate(w)] \n\n def pickIndex(self) -> int:\n idx = bisect.bisect(self.weights, random.random())\n return idx","runtime":"904"},{"code":"import bisect\nimport random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n\n w=list(map(lambda x:x/sum(w),w))\n for x in range(1,len(w)) :\n w[x]+=w[x-1]\n self.w=w\n \n \n \n\n def pickIndex(self) -> int:\n r=random.uniform(0,1)\n return bisect.bisect_left(self.w,r)","runtime":"956"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.cumSumProb = [elem/sum(w) for elem in w]\n for i in range(1, len(w)):\n self.cumSumProb[i] += self.cumSumProb[i-1]\n\n def pickIndex(self) -> int:\n r = random.random()\n left = 0\n right = len(self.cumSumProb)\n while left < right:\n mid = (left+right)//2\n if r < self.cumSumProb[mid]:\n right = mid\n else:\n left = mid + 1\n return left\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"956"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.probs = [0] + [f/sum(w) for f in w]\n \n for i in range(1, len(self.probs)):\n self.probs[i] = self.probs[i] + self.probs[i-1]\n\n def pickIndex(self) -> int:\n idx= random.uniform(0, 1)\n p = self.probs\n l = 1 \n r = len(p)\n while l< r:\n pivot = int((l+r)/2)\n if idx <= p[pivot] and idx > p[pivot - 1]:\n return pivot - 1\n elif idx > p[pivot]:\n l = pivot + 1\n else:\n r = pivot\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1008"},{"code":"# 1, sum(w)\n#1, 4\n#randint first larger than randint [binary search]\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.length = len(w)\n self.arr = [0] * self.length\n preSum = 0\n for i in range( self.length):\n preSum += w[i]\n self.arr[i] = preSum \n \n \n\n def pickIndex(self) -> int:\n \n rand = random.randint(1, sum(self.w))\n \n #find the first one >= rand\n l, r = 0, self.length - 1\n while l < r:\n mid = l + (r - l) // 2\n if self.arr[mid] < rand:\n l = mid + 1\n else:\n r = mid\n return r\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1008"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.li = []\n \n for i, weight in enumerate(w):\n ratio = ceil(weight / sum(w) * 100)\n # print(ratio)\n self.li += ([i] * ratio)\n # print(self.li, len(self.li))\n\n\n def pickIndex(self) -> int:\n return random.choice(self.li)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1060"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.weight = [val / sum(w) for val in w]\n for i in range(1, len(self.weight)):\n self.weight[i] = self.weight[i - 1] + self.weight[i]\n\n def pickIndex(self) -> int:\n randNum = random.random()\n if randNum <= self.weight[0]:\n return 0\n l, r = 0, len(self.weight) - 1\n while r - l > 1:\n m = (l + r) // 2\n if self.weight[m] == randNum:\n return m\n elif self.weight[m] > randNum:\n r = m\n else:\n l = m\n return r\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1060"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sum = list(accumulate(w))\n self.w = w\n\n def pickIndex(self) -> int:\n rand = random.randint(1, sum(self.w))\n return bisect.bisect_left(self.prefix_sum, rand)\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1113"},{"code":"# import random \n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.n_w = [0] + [float(weight)/sum(w) for weight in w]\n for i in range(1,len(self.n_w)):\n self.n_w[i] = self.n_w[i] + self.n_w[i-1]\n\n def pickIndex(self) -> int:\n sample = random.random()\n\n start = 0\n end = len(self.n_w) - 1\n\n while end > start: \n mid = (start + end)//2\n if sample > self.n_w[mid] and sample <= self.n_w[mid+1]:\n return mid\n elif sample > self.n_w[mid]:\n start = mid + 1\n else:\n end = mid\n\n\n\n\n # for i in range(1, len(self.n_w)):\n # low, high = (self.n_w[i-1], self.n_w[i])\n # if sample >= low and sample < high:\n # return i-1\n\n \n \n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1113"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.pdf = [w[i]/sum(w) for i in range(len(w))]\n self.cdf = [self.pdf[0]]\n for i in range(1, len(self.pdf)):\n self.cdf.append(self.cdf[i-1] + self.pdf[i])\n \n\n def pickIndex(self) -> int:\n random_number = random.random()\n # find the number that is the minimum and is greater than random_number\n\n l = 0\n r = len(self.cdf) - 1\n res = len(self.cdf) - 1\n while l <= r:\n mid = l + (r - l)//2\n if self.cdf[mid] < random_number:\n l = mid + 1\n else:\n r = mid - 1\n res = min(res, mid)\n \n return res\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1165"},{"code":"import numpy as np\nimport random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.cs = np.cumsum([x/sum(w) for x in w])\n print(self.cs)\n\n def pickIndex(self) -> int:\n rv = random.random()\n l = 0\n r = len(self.cs)\n while l <= r:\n mid = (l+r) // 2\n midl_val = self.cs[mid - 1] if mid - 1 >= 0 else 0\n midr_val = self.cs[mid + 1] if mid + 1 < len(self.cs) else 1\n if self.cs[mid] >= rv and midl_val <= rv:\n return mid\n \n if self.cs[mid] > rv:\n r = mid - 1\n else:\n l = mid + 1\n\n return mid\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1165"},{"code":"from random import random \nclass Solution:\n\n def __init__(self, w: List[int]):\n self.prob = {} #acc prob, index\n sumWeight = sum(w)\n acc = 0\n for i in range(len(w)):\n acc +=w[i]\n self.prob[acc/sumWeight] = i\n \n\n def pickIndex(self) -> int:\n rand = random()\n for p in self.prob:\n if(rand<=p):\n return self.prob[p]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1217"},{"code":"import random\nclass Solution:\n def __init__(self, w: List[int]):\n weightList = []\n self.pickIdx = 0\n self.maxCount = 0\n totalWeight = sum(w)\n self.weightedList = []\n for i in range(len(w)):\n wgt = w[i]\n percentWeight = int(round(wgt/totalWeight, 5) * 100000)\n print(percentWeight)\n for _ in range(percentWeight):\n self.weightedList.append(i)\n random.shuffle(self.weightedList)\n self.maxCount = len(self.weightedList)\n\n def pickIndex(self) -> int:\n item = self.weightedList[self.pickIdx]\n self.pickIdx += 1\n if self.pickIdx >= self.maxCount:\n self.pickIdx = 0\n return item\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1269"},{"code":"import random\nclass Solution:\n def __init__(self, w: List[int]):\n weightList = []\n self.pickIdx = 0\n self.maxCount = 0\n totalWeight = sum(w)\n self.weightedList = []\n for i in range(len(w)):\n wgt = w[i]\n percentWeight = int(round(wgt/totalWeight, 5) * 100000)\n print(percentWeight)\n for _ in range(percentWeight):\n self.weightedList.append(i)\n random.shuffle(self.weightedList)\n self.maxCount = len(self.weightedList)\n\n def pickIndex(self) -> int:\n item = self.weightedList[self.pickIdx]\n self.pickIdx += 1\n if self.pickIdx >= self.maxCount:\n self.pickIdx = 0\n return item\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1269"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.probs = {}\n curr_sum = 0\n for i, num in enumerate(w):\n curr_sum += num\n self.probs[curr_sum] = i\n self.sum = curr_sum\n \n\n def pickIndex(self) -> int:\n rand_num = random.randrange(0, self.sum)\n for num in self.probs:\n if rand_num < num:\n return self.probs[num]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1322"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n carryOver = 0\n self.randomList = []\n for j in w:\n carryOver += j\n self.randomList.append(carryOver)\n self.summ = carryOver\n \n \n\n def pickIndex(self) -> int:\n yes = random.randint(1, self.summ)\n if len(self.randomList) > 2:\n if yes in self.randomList:\n index = self.randomList.index(yes)\n else:\n index = self.BinarySearchModified(self.randomList, 0, len(self.randomList)-1, yes)\n elif len(self.randomList) == 2 and self.randomList[0] < yes:\n return 1\n else:\n return 0\n return index\n \n\n def BinarySearchModified(self, arr, low, high, x):\n while high - low > 1:\n mid = low + (high - low)//2\n if arr[mid] > x:\n if arr[low] < x:\n high = mid\n else:\n return low\n else:\n if arr[high] > x:\n low = mid\n else:\n return high+1\n return high\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1322"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.prob = [self.w[i]/sum(w) for i in range(len(w))]\n self.acc = [sum(self.prob[0:i+1]) for i in range(len(w))]\n\n def pickIndex(self) -> int:\n import random\n u = random.uniform(0,1)\n\n # for i in range(len(self.w)):\n # if i == 0 and u <= self.acc[0]:\n # return self.w[i][1]\n # elif u > self.acc[i] and u <= self.acc[i+1]:\n # return self.w[i+1][1]\n\n l = 0 \n r = len(self.w)-1\n \n while l < r:\n \n mid = (l+r) //2\n\n if u <= self.acc[mid] and l <= r:\n r = mid \n \n elif u > self.acc[mid] and l <= r:\n l = mid + 1\n\n return r\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1374"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.probs = {}\n curr_sum = 0\n for i, num in enumerate(w):\n curr_sum += num\n self.probs[curr_sum] = i\n self.sum = curr_sum\n \n\n def pickIndex(self) -> int:\n rand_num = random.randrange(0, self.sum)\n for num in self.probs:\n if rand_num < num:\n return self.probs[num]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1374"},{"code":"from random import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.shifted = {}\n index_offset = 0\n for i, wi in enumerate(w):\n self.shifted[index_offset] = i\n index_offset += wi\n self.sum = index_offset\n\n def pickIndex(self) -> int:\n offsets = list(self.shifted.keys())\n rand = int(random() * self.sum)\n # bin search\n l, h = 0, len(offsets) - 1\n while l <= h:\n mid = (l + h) // 2\n if mid == len(offsets) - 1:\n return self.shifted[offsets[mid]]\n if rand >= offsets[mid] and rand < offsets[mid + 1]:\n return self.shifted[offsets[mid]]\n if rand > offsets[mid]:\n l = mid + 1\n else:\n h = mid - 1\n return -1\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1426"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.probs = [sum(w[:i+1])/sum(w) for i in range(len(w))]\n \n def pickIndex(self) -> int:\n return bisect.bisect_left(self.probs, random.random())\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1478"},{"code":"from random import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.shifted = {}\n index_offset = 0\n for i, wi in enumerate(w):\n self.shifted[index_offset] = i\n index_offset += wi\n self.sum = index_offset\n\n def pickIndex(self) -> int:\n offsets = list(self.shifted.keys())\n rand = int(random() * self.sum)\n # bin search\n l, h = 0, len(offsets) - 1\n while l <= h:\n mid = (l + h) // 2\n if mid == len(offsets) - 1:\n return self.shifted[offsets[mid]]\n if rand >= offsets[mid] and rand < offsets[mid + 1]:\n return self.shifted[offsets[mid]]\n if rand > offsets[mid]:\n l = mid + 1\n else:\n h = mid - 1\n return -1\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1478"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.lookup = []\n self.max = 0\n\n running_sum = 0\n for i in range(len(w)):\n running_sum += w[i]\n item = running_sum, i\n self.lookup.append(item)\n\n self.max = running_sum\n\n def pickIndex(self) -> int:\n if self.max == 0:\n return 0\n\n selection = randrange(0, self.max)\n\n result = 0\n for running_sum, index in self.lookup:\n if selection < running_sum:\n return index\n\n return result\n\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1531"},{"code":"import random\n\nclass Solution:\n def __init__(self, w: List[int]):\n\n self.indices = []\n index = 0\n for i, prob in enumerate(w):\n index += prob\n self.indices.append((index, i))\n\n print(self.indices)\n\n self.tot = sum(w)\n\n def pickIndex(self) -> int:\n weight = random.randrange(0, self.tot)\n if len(self.indices) == 1:\n return self.indices[0][1]\n for w, index in self.indices:\n if weight < w:\n return index\n return self.indices[-1][1]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1531"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n x = self\n self.dic = {}\n self.idx = 0\n norm = [float(i)/max(w) for i in w]\n for num, count in enumerate(norm):\n rng = int(count * 100)\n for j in range(rng):\n self.dic[self.idx] = num\n self.idx += 1\n \n\n def pickIndex(self) -> int:\n return self.dic[randint(0,self.idx-1)]\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1583"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.lookup = []\n self.max = 0\n\n running_sum = 0\n for i in range(len(w)):\n running_sum += w[i]\n item = running_sum, i\n self.lookup.append(item)\n\n self.max = running_sum\n\n def pickIndex(self) -> int:\n if self.max == 0:\n return 0\n\n selection = randrange(0, self.max)\n\n result = 0\n for running_sum, index in self.lookup:\n if selection < running_sum:\n return index\n\n return result\n\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1583"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.sumW = 0\n self.weightDict = dict()\n\n for i, item in enumerate(w):\n self.sumW += item\n self.weightDict[self.sumW] = i\n\n def pickIndex(self) -> int:\n j = randint(1,self.sumW)\n\n for w, i in self.weightDict.items():\n if j <= w:\n return i\n\n\n \n \n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1635"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n prob = [x/sum(w) for x in w]\n self.cdf = [sum(prob[:i]) for i in range(len(prob))] + [1]\n \n\n def pickIndex(self) -> int:\n rn = random.random()\n\n l = 0\n r = len(self.cdf)-2\n\n while l<=r:\n m = l + (r-l)//2\n if rn < self.cdf[m]:\n r = m-1\n elif rn > self.cdf[m+1]:\n l = m+1\n else:\n return m\n \n return\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1688"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.p_s = [0] * (len(w) + 1)\n for i in range(1, len(w)+1):\n self.p_s[i] = self.p_s[i-1] + w[i-1]\n self.p_s.pop(0)\n\n def pickIndex(self) -> int:\n num = random.randint(1, max(self.p_s))\n return bisect_left(self.p_s, num)\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1688"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = sum(w)\n self.w = [(i, w[i]) for i in range(len(w))]\n \n\n def pickIndex(self) -> int:\n while True:\n current = random.choice(self.w)\n index, weight = current[0], current[1]\n probability = (weight / self.total) * 100\n roll = random.randint(0, 100)\n if roll <= probability:\n return index\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1740"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.weight=[w[0]/sum(w)]\n weight=[w[0]/sum(w)]\n for i in range(1,len(w)):\n self.weight.append(self.weight[-1]+w[i]/sum(w))\n weight.append(weight[-1]+w[i]/sum(w))\n \n\n def pickIndex(self) -> int:\n l,r,pick=0,len(self.weight)-1, random.random()\n while l<r:\n m=(l+r)//2\n if pick>=self.weight[m]:\n l=m+1\n else: r=m\n return l\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1740"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.presum = list(accumulate(w))\n \n def pickIndex(self) -> int:\n rand = random.randint(1, max(self.presum))\n return bisect_left(self.presum, rand)\n \n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1792"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n \n # prefix sum\n self.prefix_sum = []\n acc = 0\n for tmp in w:\n acc += tmp\n self.prefix_sum.append(acc)\n\n \n def pickIndex(self) -> int:\n \n # generate random in 0~max(prefix_sum)\n rand = random.random() * max(self.prefix_sum)\n \n # [1, 4, 9], 5\n # l = 0, r = 3, mid = 1\n # l = 2, r = 3, mid = 2\n # l = 2, r = 2 (upperbound)\n\n # find the upperbound index in prefix_sum\n l = 0\n r = len(self.prefix_sum)\n while l < r:\n mid = l + int((r - l) / 2)\n if rand < self.prefix_sum[mid]:\n r = mid\n else:\n l = mid + 1\n return l\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()\n\n\n","runtime":"1792"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n presum = 0\n s = sum(w)\n self.arr = []\n for i in w:\n presum += i\n self.arr.append(presum / s)\n\n def pickIndex(self) -> int:\n pr = random.random()\n for i in range(len(self.arr)):\n if self.arr[i] > pr:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()\n","runtime":"1844"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n ranges = [0]\n s = sum(w)\n for weight in w:\n ranges.append(ranges[-1]+weight/s)\n ranges.append(2)\n self.ranges = ranges\n\n def pickIndex(self) -> int:\n r = random.random()\n for i in range(len(self.ranges)):\n if self.ranges[i] > r:\n return i-1\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1897"},{"code":"class Solution:\n \n\n def __init__(self, w: List[int]):\n self.partition =[]\n total = sum(w)\n cur = 0\n for i in w:\n cur += i/total\n self.partition.append(cur)\n\n def pickIndex(self) -> int:\n signal = random.random()\n for i in range(len(self.partition)):\n if self.partition[i] >= signal:\n return i\n return -1\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"1949"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.cum = [0]*len(w)\n self.cum[0] = w[0]\n for i in range(1,len(w)):\n self.cum[i] = w[i]+self.cum[i-1]\n\n def pickIndex(self) -> int:\n randweight = randint(1, self.cum[-1])\n for i in range(len(self.cum)):\n if randweight<=self.cum[i]: return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2001"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.orig_weights = w\n self.weighted_arr = [0] * len(w)\n self.weighted_arr[0] = self.orig_weights[0]\n for i in range(1, len(self.orig_weights)):\n self.weighted_arr[i] = self.weighted_arr[i - 1] + self.orig_weights[i]\n\n self.total_weight = self.weighted_arr[-1]\n\n def pickIndex(self) -> int:\n # index_picked = random.random() * self.total_weight\n index_picked = random.randint(0, self.total_weight-1)\n # print(f\"Index picked: {index_picked}\")\n for i in range(len(self.weighted_arr)):\n # print(f\"\\t {index_picked}, {self.weighted_arr[i]}\")\n if index_picked < self.weighted_arr[i]:\n return i\n\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2053"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n presum = 0\n s = sum(w)\n self.arr = []\n for i in w:\n presum += i\n self.arr.append(presum / s)\n\n def pickIndex(self) -> int:\n pr = random.random()\n for i in range(len(self.arr)):\n if self.arr[i] > pr:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()\n","runtime":"2210"},{"code":"import random\n\n\nclass Solution:\n def __init__(self, w: List[int]):\n self._prefix = []\n for i in w:\n if self._prefix == []:\n self._prefix.append(i)\n else:\n self._prefix.append(self._prefix[-1] + i)\n\n def pickIndex(self) -> int:\n target = random.randint(1, self._prefix[-1])\n for i in range(len(self._prefix)):\n if target < self._prefix[i]:\n return i\n\n return 0\n","runtime":"2210"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weight_sum = sum(w)\n self.prefix_sum = []\n cur_sum = 0\n for i in range(len(w)):\n cur_sum += w[i]\n self.prefix_sum.append(cur_sum)\n\n\n def pickIndex(self) -> int:\n rand = random.randrange(1, self.weight_sum + 1)\n for i in range(len(self.prefix_sum)):\n if rand <= self.prefix_sum[i]:\n return i\n return len(self.prefix_sum) - 1\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2262"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = 0 \n self.preFixSum = []\n for i in range(len(w)):\n self.total += w[i]\n self.preFixSum.append(self.total)\n \n \n\n \n\n def pickIndex(self) -> int:\n target = random.randint(1, self.total)\n for ix in range(0, len(self.preFixSum)):\n if self.preFixSum[ix] >= target:\n return ix\n return len(self.preFixSum) - 1\n \n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2262"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n totSum = 0\n probSum = 0\n self.elements = w\n self.cumProbs = []\n for num in w:\n totSum += num\n for i,num in enumerate(w):\n prob = w[i]/totSum\n probSum += prob\n self.cumProbs.append(probSum)\n \n def pickIndex(self) -> int:\n pickProb = random.random()\n # print(\"prob\")\n # print(pickProb)\n # print(\"cumProbs\")\n # print(self.cumProbs)\n # print(\"elements\")\n # print(self.elements)\n for i in range(len(self.cumProbs)):\n if (pickProb<=self.cumProbs[i]):\n return i\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2315"},{"code":"class Solution:\n #Intution: The larger the number, more is the probability of it to get picked.\n \n def __init__(self, w:List[int]):\n self.w = []\n total = 0\n for weight in w:\n total += weight\n self.w.append(total)\n self.total = total\n\n def pickIndex(self) -> int:\n ran = random.randint(1, self.total)\n for i, weight in enumerate(self.w):\n if ran <= weight:\n return i\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2315"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefixSum = [0.0] * len(w)\n\n total = sum(w)\n\n for i in range(len(w)):\n self.prefixSum[i] = 1.0 * w[i]/total\n if i > 0:\n self.prefixSum[i] += self.prefixSum[i - 1]\n # print(self.prefixSum)\n \n\n def pickIndex(self) -> int:\n # Generate a random number between 0 and 1\n random_value = random.random()\n # print(random_value)\n for i, prob in enumerate(self.prefixSum):\n if prob >= random_value:\n return i\n\n return len(self.prefixSum) - 1","runtime":"2367"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n # self.wsum = sum(self.w)\n self.wrange = self.get_wrange(w)\n self.wsum = self.wrange[-1]\n # print(w)\n # print(self.wrange)\n # print(self.wsum)\n\n\n def get_wrange(self, w):\n totalv = 0\n wrange = []\n for v in w:\n totalv += v\n wrange.append(totalv)\n return wrange\n\n\n def pickIndex(self) -> int:\n ridx = random.randint(1, self.wsum)\n print('ridx', ridx)\n i = 0\n while self.wrange[i] < ridx:\n i += 1\n return i\n\n\n \n#easiest way -> put together a list of each index, represented by w[i] counts and shuffle it each time to return when pickindex is called\n\n#storage might be a concern, could insteda find lowest value and divide by everything and make it the count array smaller\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2367"},{"code":"from numpy.random import choice\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = [0]* len(w)\n self.w[0] = w[0]\n for i,v in enumerate(w[1:]):\n self.w[i+1] = self.w[i]+v\n self.total = self.w[-1]\n \n \n\n def pickIndex(self) -> int:\n rv = random.randrange(self.total)\n for i in range(len(self.w)):\n if self.w[i]> rv:\n return i\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2419"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prob =[]\n s = sum(w)\n prev = 0\n for ow in w:\n prev += ow/s\n self.prob.append(prev)\n \n print(self.prob)\n\n \n def pickIndex(self) -> int:\n randomV = random.uniform(0, 1)\n for i in range(len(self.prob)):\n if randomV <= self.prob[i]:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2419"},{"code":"import numpy as np\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.sum = sum(self.w)\n self.pdf = [val / self.sum for val in self.w]\n curr = 0\n self.cdf = []\n for val in self.pdf:\n curr += val\n self.cdf.append(curr)\n \n\n def pickIndex(self) -> int:\n val = np.random.uniform()\n\n for i in range(len(self.cdf) - 2, -1, -1):\n if self.cdf[i] < val:\n return i + 1\n return 0\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2471"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.probability_ranges = []\n self.total_sum = sum(w)\n curr = 0\n for i, weight in enumerate(w):\n p = weight / self.total_sum\n self.probability_ranges.append((curr, curr + p, i))\n curr += p\n\n def pickIndex(self) -> int:\n r = random.random()\n for (low, end, i) in self.probability_ranges:\n if low <= r <= end:\n return i\n \n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2471"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i-1]\n\n def pickIndex(self) -> int:\n N = random.uniform(0, 1)\n index = -1\n while True:\n index += 1\n if N <= self.w[index]:\n break\n return index\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2524"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.total = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] /= self.total\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i - 1]\n\n def pickIndex(self) -> int:\n n = random.uniform(0, 1)\n i = -1\n\n while True:\n i += 1\n\n if n <= self.w[i]:\n return i\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2524"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.probs = []\n total = sum(self.w)\n curr = 0.0\n for i in self.w:\n p = i/total\n curr+=p\n self.probs.append(curr)\n\n def pickIndex(self) -> int:\n val = random.random()\n for i in range(len(self.probs)):\n if val>self.probs[i]:\n continue\n else:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2576"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n # initialize variables and calculate pdf and cdf\n self.weight=w\n self.total=sum(w)\n self.prob=[0]*len(w)\n self.cdf=[0]*len(w)\n for i in range(len(w)):\n self.prob[i]=w[i]/self.total\n if i==0:\n self.cdf[i]=self.prob[i]\n else:\n self.cdf[i]=self.prob[i]+self.cdf[i-1]\n\n def pickIndex(self) -> int:\n # randomly sample from [0,1] to to select from w\n self.unif=random.random()\n # select w based on sample\n # can modified to binary search to look for the index of w\n res=0\n while self.cdf[res]<self.unif:\n res+=1\n return res\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()\n\n#w=[1,3], prob=[.25,.75], cdf=[.25,1], unif=.1, res=0, unif=.25, res=0, unif=.5, res=1, unif=1, res=","runtime":"2576"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n import random\n Total = sum(w)\n self.w = [sub/Total for sub in w]\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i-1] \n \n\n def pickIndex(self) -> int:\n N = random.uniform(0, 1)\n \n flag = 1\n index = -1\n while flag:\n index += 1\n if N <=self.w[index]:\n flag = 0\n \n return index\n\n \n\n \n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2628"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n csum = 0\n self.probList = []\n for v in w:\n csum += v\n probSum = 0\n for v in w:\n probSum += v / csum\n self.probList.append(probSum)\n \n\n\n \n\n def pickIndex(self) -> int:\n rnd = random.random()\n\n for i in range(len(self.probList)):\n val = self.probList[i]\n\n if (val >= rnd):\n return i\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2628"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n sums =sum(self.w)\n # print(sums)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / sums\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i-1]\n # print(self.w)\n\n def pickIndex(self) -> int:\n N = random.uniform(0,1)\n flag = 1\n idx = -1\n while flag:\n idx += 1\n if N <= self.w[idx]:\n flag = 0\n return idx\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2680"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = sum(w)\n self.w = w\n for j in range(len(w)):\n self.w[j] = self.w[j]/self.total\n for i in range(1,len(w)):\n self.w[i]= self.w[i]+self.w[i-1]\n \n\n def pickIndex(self) -> int:\n randomNumber = random.uniform(0,1)\n flag = True\n i = 0\n while flag:\n if randomNumber<= self.w[i]:\n flag = False\n else:\n i+=1\n return i\n\n\n\n \n\n\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2680"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n\n def pickIndex(self) -> int:\n N = random.uniform(0,1)\n flag = 1\n index = -1\n while flag:\n index +=1 \n if N <= self.w[index]:\n flag = 0\n return index\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2733"},{"code":"class Solution:\n def __init__(self, w: List[int]):\n self.w = w\n\t\t# 1. calculate relative frequency\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n # 2. put relative frequencies on the number line between 0 and 1\n\t\t# Note self.w[-1] = 1\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n\t\t\n\t\t# this is where we pick the index\n N = random.uniform(0,1)\n \n flag = 1\n index = -1\n \n\t\t# test each region of the numberline to see if N falls in it, if it \n\t\t# does not then go to the next index and check if N falls in it\n\t\t# this is gaurenteed to break because of previous normalization\n while flag:\n index +=1 \n \n \n \n if N <= self.w[index]:\n flag = 0\n \n \n return index\n\n # def __init__(self, w: List[int]):\n # self.w = w\n # self.total = sum(w)\n\n # def pickIndex(self) -> int:\n # x = random.uniform(0, 1) * self.total\n\n # s = 0\n # i = 0\n # while i < len(self.w):\n # if s <= x <= s + self.w[i]:\n # return i\n # s += self.w[i]\n # i += 1\n\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2733"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n\t\t# 1. calculate relative frequency\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n # 2. put relative frequencies on the number line between 0 and 1\n\t\t# Note self.w[-1] = 1\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n\n def pickIndex(self) -> int:\n # this is where we pick the index\n N = random.uniform(0,1)\n \n flag = 1\n index = -1\n \n\t\t# test each region of the numberline to see if N falls in it, if it \n\t\t# does not then go to the next index and check if N falls in it\n\t\t# this is gaurenteed to break because of previous normalization\n while flag:\n index +=1 \n if N <= self.w[index]:\n flag = 0\n return index\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2785"},{"code":"import random\n\nclass Solution:\n def __init__(self, w: List[int]):\n self.w = w\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n\n N = random.uniform(0,1)\n flag = 1\n index = -1\n \n while flag:\n index +=1 \n if N <= self.w[index]:\n flag = 0\n return index","runtime":"2785"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n\t\t# 1. calculate relative frequency\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n # 2. put relative frequencies on the number line between 0 and 1\n\t\t# Note self.w[-1] = 1\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n\t\t\n\t\t# this is where we pick the index\n N = random.uniform(0,1)\n \n flag = 1\n index = -1\n \n\t\t# test each region of the numberline to see if N falls in it, if it \n\t\t# does not then go to the next index and check if N falls in it\n\t\t# this is gaurenteed to break because of previous normalization\n while flag:\n index +=1 \n \n \n \n if N <= self.w[index]:\n flag = 0\n \n \n return index\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2837"},{"code":"# used for random number generation\nimport random\n\nclass Solution:\n def __init__(self, w: List[int]):\n self.w = w\n\t\t# 1. calculate relative frequency\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n # 2. put relative frequencies on the number line between 0 and 1\n\t\t# Note self.w[-1] = 1\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n N = random.uniform(0,1)\n \n flag = 1\n index = -1\n \n while flag:\n index +=1 \n if N <= self.w[index]:\n flag = 0 \n return index\n\n\n","runtime":"2837"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weight = w\n denom = sum(self.weight)\n for i in range(len(self.weight)):\n self.weight[i] = self.weight[i] / denom\n for i in range(1, len(self.weight)):\n self.weight[i] += self.weight[i-1]\n\n def pickIndex(self) -> int:\n N = random.uniform(0,1)\n flag = 1\n index = -1\n\n while flag:\n index += 1\n\n if N <= self.weight[index]:\n flag = 0\n return index\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2890"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.sumVals = sum(w)\n self.probability = [k/self.sumVals for k in w]\n self.probability = [sum(self.probability[:k+1]) for k in range(len(w))]\n\n\n def pickIndex(self) -> int:\n random_val = random.random()\n for i, v in enumerate(self.probability):\n if random_val <= v:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2890"},{"code":"import random\nimport numpy as np\n\nclass Solution:\n def __init__(self, w: List[int]):\n self.w = w\n\t\t# 1. calculate relative frequency\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n # 2. put relative frequencies on the number line between 0 and 1\n\t\t# Note self.w[-1] = 1\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n\t\t\n\t\t# this is where we pick the index\n N = random.uniform(0,1)\n \n flag = 1\n index = -1\n \n\t\t# test each region of the numberline to see if N falls in it, if it \n\t\t# does not then go to the next index and check if N falls in it\n\t\t# this is gaurenteed to break because of previous normalization\n while flag:\n index +=1 \n \n \n \n if N <= self.w[index]:\n flag = 0\n \n \n return index\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2942"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.prefix = [0] * len(w)\n self.prefix[0] = w[0]\n for i in range(1, len(w)):\n self.prefix[i] = self.prefix[i-1] + w[i]\n\n self.totalweight = self.prefix[-1]\n\n def pickIndex(self) -> int:\n prob = randint(1, self.totalweight)\n # print(self.totalweight)\n # print(self.prefix)\n # print(prob)\n i = 0\n while (self.prefix[i] < prob):\n i+=1\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2942"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.probability = [w / sum(self.w) for w in self.w]\n for i in range(0, len(self.probability)-1):\n self.probability[i+1] += self.probability[i]\n\n def pickIndex(self) -> int:\n import random\n chance = random.random()\n for i in range(0, len(self.probability)-1):\n if chance < self.probability[i]:\n return i \n return len(self.probability) - 1\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2994"},{"code":"import numpy as np\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n\n self.w = w\n # calculate the relative frequency\n normalization = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i]/normalization\n\n # find cumulative summation\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n \n # this is where we pick the index\n N = np.random.uniform()\n\n flag = 1\n index = -1\n\n while flag:\n index +=1\n if N <= self.w[index]:\n flag = 0\n \n return index\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"2994"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n sumw = sum(w)\n self.probab = [w[i]/sumw for i in range(len(w))]\n self.current = [0] * (len(w))\n self.picks = 0\n\n def pickIndex(self) -> int:\n self.picks += 1\n for i,p in enumerate(self.current):\n if self.probab[i] > p / self.picks:\n self.current[i] += 1 \n return i\n else:\n return 0\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3046"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n accumulated_sum = w.copy()\n for i in range(1, len(w)):\n accumulated_sum[i] += accumulated_sum[i-1]\n self.accumulated_sum = [a/sum(w) for a in accumulated_sum]\n print(self.accumulated_sum)\n\n def pickIndex(self) -> int:\n # find index one by one\n import random\n p = random.random()\n index = -1\n for i in range(len(self.accumulated_sum)):\n if p <= self.accumulated_sum[i]:\n index = i\n break\n return index\n # bisect\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3046"},{"code":"import math\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n\n preSum = [0] * (len(w) + 1)\n \n for i in range(len(w)):\n preSum[i + 1] = preSum[i] + w[i]\n\n self.preSum = preSum\n \n\n def pickIndex(self) -> int:\n if len(self.w) == 1:\n return 0\n rNum = math.floor(random.random() * self.preSum[len(self.preSum) - 1]) \n for i in range(len(self.preSum) - 1):\n if self.preSum[i + 1] > rNum:\n return i\n\n return 0\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3099"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n\t\t# 1. calculate relative frequency\n denom = sum(self.w)\n for i in range(len(self.w)):\n self.w[i] = self.w[i] / denom\n # 2. put relative frequencies on the number line between 0 and 1\n\t\t# Note self.w[-1] = 1\n for i in range(1,len(self.w)):\n self.w[i] += self.w[i-1]\n \n def pickIndex(self) -> int:\n\t\t\n\t\t# this is where we pick the index\n N = random.uniform(0,1)\n \n flag = 1\n index = -1\n \n\t\t# test each region of the numberline to see if N falls in it, if it \n\t\t# does not then go to the next index and check if N falls in it\n\t\t# this is gaurenteed to break because of previous normalization\n while flag:\n index +=1 \n \n \n \n if N <= self.w[index]:\n flag = 0\n \n \n return index\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3099"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = sum(w)\n # 4 -> random [1,2,3,4]\n # 1 -> 0\n # 2,3,4 -> 1\n\n self.freqs = {}\n start = 1\n for i, weight in enumerate(w):\n range_of_index = (start, start + weight - 1)\n self.freqs[range_of_index] = i\n start += weight\n\n def pickIndex(self) -> int:\n r = random.randint(1, self.total)\n for ranges in self.freqs:\n if ranges[0] <= r <= ranges[1]:\n return self.freqs[ranges]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3151"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = sum(w)\n self.ranges = []\n cur = 0\n for i in w:\n cur += i\n self.ranges.append(cur)\n\n def pickIndex(self) -> int:\n ran = random.randint(1, self.total)\n prev = 0\n\n for i, prob in enumerate(self.ranges):\n if prev < ran and ran <= prob:\n return i\n prev = prob\n return i\n \n# [1, 4]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3151"},{"code":"import numpy as np\nclass Solution:\n def __init__(self, w: List[int]):\n self.prob = np.array(w) / np.sum(np.array(w))\n self.n = np.arange(len(w))\n\n def pickIndex(self) -> int:\n return np.random.choice(self.n, 1, p=self.prob)[0]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3203"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.probability_dist = []\n\n for i in w:\n self.probability_dist.append(i/sum(w))\n\n self.cdf = []\n start = 0\n for i in self.probability_dist:\n start += i\n self.cdf.append(start)\n\n def pickIndex(self) -> int:\n random_num = random.random()\n \n # Step 3: Find the index corresponding to the random number\n for i, value in enumerate(self.cdf):\n if random_num <= value:\n return i\n \n# probability to pick the index is value / sum(values) and now we have to make it random to choose an index...\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3203"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n # construct cdf\n norm = sum(w)\n total = 0\n cdf = [0] * (len(w))\n for i, weight in enumerate(w):\n cdf[i]=total\n total+=weight/norm\n self.cdf = cdf\n print(cdf)\n self.n = len(w)\n def pickIndex(self) -> int:\n p = random.uniform(0,1)\n i=0\n # print(self.cdf)\n # could do a binary search here to speed things up\n while(i<self.n and p>self.cdf[i]):\n #print(self.cdf[i])\n i+=1\n return(i-1) \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3255"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.CDF= [ w[0] ]\n for i in range(1, len(w)):\n self.CDF.append( self.CDF[i-1]+w[i] )\n \n\n def pickIndex(self) -> int:\n seed = randint(1, self.CDF[-1])\n ind = 0\n n = len(self.CDF)\n while ind < n:\n if seed <= self.CDF[ind]:\n return ind\n ind += 1\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3255"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w=w\n self.index_list = [i for i in range(len(w))]\n \n\n def pickIndex(self) -> int:\n\n return random.choices(self.index_list, weights =self.w)[0]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3308"},{"code":"import random\n\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weights = w\n \n def pickIndex(self) -> int:\n return random.choices(range(len(self.weights)), self.weights)[0]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3308"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self._weights = w\n\n def pickIndex(self) -> int:\n return choices(range(len(self._weights)), self._weights)[0]\n","runtime":"3360"},{"code":"class Solution:\n def __init__(self, w: List[int]):\n self.w = w\n\n def pickIndex(self) -> int:\n return random.choices(range(len(self.w)), weights=self.w)[0]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3360"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weight = w\n self.numbers = list(range(len(w)))\n\n def pickIndex(self) -> int:\n return random.choices(self.numbers, weights=self.weight, k=1)[0]\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3412"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.weight_sum = []\n temp = 0\n for weight in w:\n temp += weight\n self.weight_sum.append(temp)\n\n self.total_weight = temp\n \n def pickIndex(self):\n rand_weight = random.random() * self.total_weight\n for ix, weight in enumerate(self.weight_sum):\n if rand_weight < weight:\n return ix\n\n \n\n","runtime":"3412"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefixSums = []\n sumSoFar = 0\n for i in range(0, len(w)):\n sumSoFar += w[i]\n self.prefixSums.append(sumSoFar)\n self.n = len(self.prefixSums)\n self.totalSum = sumSoFar\n\n def pickIndex(self) -> int:\n target = self.totalSum * random.random() #random.randint(1, self.n)\n # get first smaller index\n for i in range(0, self.n):\n if target < self.prefixSums[i]:\n return i\n return self.n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3464"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sums = []\n prefix_sum = 0\n for weight in w:\n prefix_sum += weight\n self.prefix_sums.append(prefix_sum)\n self.total_sum = prefix_sum\n\n def pickIndex(self) -> int:\n \"\"\"\n :rtype: int\n \"\"\"\n target = self.total_sum * random.random()\n # run a linear search to find the target zone\n for i, prefix_sum in enumerate(self.prefix_sums):\n if target < prefix_sum:\n return i\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3464"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sums = []\n prefix_sum = 0\n for weight in w:\n prefix_sum += weight\n self.prefix_sums.append(prefix_sum)\n self.total_sum = prefix_sum\n\n\n def pickIndex(self) -> int:\n target = self.total_sum * random.random()\n for i, prefix_sum in enumerate(self.prefix_sums):\n if target < prefix_sum:\n return i\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3517"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n\n self.prob = [i/sum(w) for i in w]\n\n for i in range(1, len(self.prob)):\n self.prob[i] += self.prob[i-1]\n \n\n def pickIndex(self) -> int:\n N = random.uniform(0, 1)\n\n for index, weight in enumerate(self.prob):\n if N <= weight:\n return index\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3517"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n for i in range(1,len(w)):\n w[i] = w[i-1] + w[i]\n self.w = w\n\n def pickIndex(self) -> int:\n import random\n x = random.random() * self.w[-1]\n #x = random.randint(0, self.w[-1])\n for i in range(len(self.w)):\n if x <= self.w[i]:\n return i\n return None\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3569"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sum = []\n total = 0 \n for i in w: \n total += i\n self.prefix_sum.append(total)\n \n self.total = total \n \n \n def pickIndex(self) -> int:\n target = random.uniform(0, self.total)\n print(self.total)\n print(target)\n for idx, prefix_num in enumerate(self.prefix_sum):\n if target < prefix_num:\n return idx\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3569"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n # Keep copy of numbers\n # Time: O(1)\n # Space: O(1) (not counting existing allocation)\n self.numbers = w\n\n def pickIndex(self) -> int:\n # Return a random, weighted choice\n # Time: O(1)\n # Space: O(1) (range() always uses the same amount of space)\n return random.choices(range(len(self.numbers)), weights=self.numbers)[0]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3621"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.sum = sum(w)\n self.weights = w\n\n self.cumulative = []\n cumulative_sum = 0\n for i, weight in enumerate(self.weights):\n cumulative_sum += weight\n self.cumulative.append(cumulative_sum)\n\n def pickIndex(self) -> int:\n random_index = self.sum * random.random()\n for i, s in enumerate(self.cumulative):\n if random_index < s:\n return i\n return None\n\n\n# have sum\n# pick index -> \n\n# weights = [1,3,5]\n# sum = 9\n\n# pick=1,2,3,4,5,6,7,8,9\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3621"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n s = sum(w)\n self.w = w\n for i in range(len(w)):\n self.w[i] = w[i]/s\n\n def pickIndex(self) -> int:\n k = random.random()\n s=0\n for i,v in enumerate(self.w):\n s +=v\n if k<=s:\n return i\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3673"},{"code":"class Solution:\n import random\n def __init__(self, w: List[int]):\n self.prob_weight = w\n self.sum = sum(w)\n\n def pickIndex(self) -> int:\n # index = random.choices([i for i in range(len(self.prob_weight))], self.prob_weight)\n pick = random.randint(1, self.sum)\n for i, val in enumerate(self.prob_weight):\n if pick <= val:\n return i\n else:\n pick = pick-val\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3673"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.s = sum(w)\n self.w = w\n\n def pickIndex(self) -> int:\n r = random.randint(0, self.s - 1)\n\n for i in range(len(self.w)):\n r -= self.w[i]\n if r < 0:\n return i\n \n return len(self.w) - 1\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3726"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.sum_w = sum(self.w)\n arr = []\n idx = []\n for i, num in enumerate(self.w):\n arr.append(num / self.sum_w)\n idx.append(i)\n self.arr = arr\n self.idx = idx\n\n def pickIndex(self) -> int:\n return random.choices(self.idx, self.arr)[0]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3726"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n W = []\n total = 0\n for weight in w:\n total+=weight\n W.append(total)\n self.W = W\n \n\n def pickIndex(self) -> int:\n r = random.uniform(0,self.W[-1])\n sorted_list = sorted(self.W + [r])\n i = sorted_list.index(r)\n return i\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3883"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix = []\n self.prev = 0\n for n in w:\n self.prev += n\n self.prefix.append(self.prev)\n self.total = self.prev\n \n\n\n def pickIndex(self) -> int:\n target = self.total * random.random()\n for i,n in enumerate(self.prefix):\n if n > target:\n return i\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3883"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n \n self.w = []\n sum_w = sum(w)\n for i in range(len(w)):\n self.w.append(w[i] / sum_w)\n self.cumsum_w = []\n cumsum = 0\n for i in range(len(self.w)):\n cumsum += self.w[i]\n self.cumsum_w.append(cumsum)\n \n\n def pickIndex(self) -> int:\n \n a = random.uniform(0, 1)\n for i in range(len(self.w)):\n if self.cumsum_w[i] - a > 0:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3935"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sum = 0\n self.prefix_array = []\n\n for num in w:\n self.prefix_sum += num\n self.prefix_array.append(self.prefix_sum)\n\n def pickIndex(self) -> int:\n pick = self.prefix_array[-1] * random.random()\n\n for idx, num in enumerate(self.prefix_array):\n if num > pick:\n return idx\n \n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3935"},{"code":"class Solution:\n\n import random \n def __init__(self, w: List[int]):\n self.nums = w\n self.map = {}\n end = -1\n for idx,num in enumerate(self.nums):\n st = end +1\n end = st + num -1\n self.map[(st,end)] = idx \n\n def pickIndex(self) -> int:\n val = random.randint(0,sum(self.nums)-1)\n for key in self.map:\n if key[0]<= val <= key[1]:\n return self.map[key]\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3987"},{"code":"class Solution:\n def __init__(self, w: List[int]):\n self.weights = w\n self.sum = sum(self.weights)\n\n def pickIndex(self) -> int:\n pick = random.randint(0, self.sum - 1)\n curr = 0\n\n for i, weight in enumerate(self.weights):\n curr += weight\n if pick < curr:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"3987"},{"code":"\"\"\"\nKey: imagine drop a dart to a line with the length of 1. \nThis line is connected bz multiple small lines. Since the drop point of the dart uniformly range from 0 to 1,\naka anywhere, so the probablity that the dart is located in one small line is equal to its length. There is no need to shuffle the small lines.\n\"\"\"\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.w_sum = sum(w)\n self.p_w = [ v/self.w_sum for v in w ]\n\n def pickIndex(self) -> int:\n rand_vale = random.random()\n p_accu = 0\n for idx, p in enumerate( self.p_w ):\n if p_accu + p >= rand_vale:\n break\n else:\n p_accu += p\n return idx\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4039"},{"code":"class Solution:\n\n def __init__(self, weights: List[int]):\n self.total_weights = sum(weights)\n self.random_thresholds = []\n running_weight = 0\n for weight in weights:\n running_weight += weight\n self.random_thresholds.append((running_weight, weight))\n\n def pickIndex(self) -> int:\n rand = random.random() * self.total_weights\n for i, (random_threshold, weight) in enumerate(self.random_thresholds):\n if rand < random_threshold:\n return i\n return len(self.random_thresholds) - 1\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4039"},{"code":"class Solution:\n\n import random \n def __init__(self, w: List[int]):\n self.nums = w\n self.map = {}\n end = -1\n for idx,num in enumerate(self.nums):\n st = end +1\n end = st + num -1\n self.map[(st,end)] = idx\n print(self.map)\n \n\n def pickIndex(self) -> int:\n val = random.randint(0,sum(self.nums)-1)\n for key in self.map:\n if key[0]<= val <= key[1]:\n return self.map[key]\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4092"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sums = []\n run_sum = 0\n for ele in w:\n run_sum += ele\n self.prefix_sums.append(run_sum)\n self.total_sum = run_sum\n\n\n def pickIndex(self) -> int:\n target = self.total_sum * random.random()\n for i, val in enumerate(self.prefix_sums):\n if target<self.prefix_sums[i]:\n return i\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4092"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n #iterate w\n #get sum of elem \n self.s = 0\n self.accum_list = []\n for item in w:\n self.s += item\n self.accum_list.append(self.s)\n\n def pickIndex(self) -> int:\n rand_n = random.random() * self.s\n for i,p in enumerate(self.accum_list):\n if rand_n < self.accum_list[i]:\n return i\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4144"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.weights = w\n self.total = sum(self.weights)\n\n def pickIndex(self) -> int:\n d = random.randint(0,self.total-1)\n temp = 0\n for i in range(len(self.weights)):\n w = self.weights[i]\n temp += w \n if temp > d:\n return i\n \n\n\n\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4144"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.totalWeight = sum(self.w)\n \n\n def pickIndex(self) -> int:\n rand = random.randrange(1, self.totalWeight+1)\n i = 0\n while True:\n rand -= self.w[i]\n if rand <= 0:\n return i\n i += 1\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4196"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weight = w\n self.total = sum(w)\n\n def pickIndex(self) -> int:\n num = random.randrange(0, self.total)\n # num = 5\n for idx in range(len(self.weight)):\n if num < self.weight[idx]:\n return idx\n num -= self.weight[idx]\n return 0\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4196"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = range(len(w))\n self.p = [i/sum(w) for i in w]\n\n def pickIndex(self) -> int:\n return random.choices(self.w, weights=self.p)[0]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4248"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.weight = []\n self.total = sum(w)\n if self.total < 400000000:\n for idx in range(len(w)):\n self.weight.extend([idx]*w[idx])\n else:\n self.weight = w\n\n def pickIndex(self) -> int:\n if self.total < 400000000:\n return random.choice(self.weight)\n else:\n num = random.randrange(self.total)\n for idx in range(len(self.weight)):\n if num < self.weight[idx]:\n return idx\n num -= self.weight[idx]\n return 0\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","runtime":"4248"}],"string":"[\n {\n \"code\": \"\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n total = sum(w)\\n self.weights = []\\n acc = 0.0\\n for weight in w:\\n acc += weight / total\\n self.weights.append(acc)\\n self.weights[-1] = 1.0\\n\\n\\n def pickIndex(self) -> int:\\n return bisect_left(self.weights, random.random())\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n n = len(w)\\n unit = 1 / sum(w)\\n self.probs = [0] * n\\n self.probs[0] = w[0] * unit\\n for i in range(1, n):\\n self.probs[i] = self.probs[i - 1] + unit * w[i]\\n \\n\\n\\n \\n\\n def pickIndex(self) -> int:\\n r = random.random()\\n i = bisect_left(self.probs, r)\\n return i\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.lots = []\\n self.total_lots = 0\\n\\n for weight in w:\\n self.total_lots += weight\\n self.lots.append(self.total_lots)\\n\\n def pickIndex(self) -> int:\\n target = random.randint(1, self.total_lots)\\n start, end = 0, len(self.lots)\\n\\n while start < end:\\n mid = (start + end) // 2\\n if target > self.lots[mid]:\\n start = mid + 1\\n else:\\n end = mid\\n\\n return start\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = 0\\n self.prefix_sum = []\\n for i in range(len(w)):\\n self.total += w[i]\\n self.prefix_sum.append(self.total)\\n\\n def pickIndex(self) -> int:\\n pick = random.randint(0, self.total - 1)\\n bs_idx = bisect.bisect(self.prefix_sum, pick)\\n while bs_idx < len(self.prefix_sum) and self.prefix_sum[bs_idx] <= pick:\\n bs_idx += 1\\n return bs_idx\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w):\\n ep = 10e-5\\n self.N, summ = len(w), sum(w)\\n weights = [elem/summ for elem in w]\\n Dic_More, Dic_Less, self.Boxes = {}, {}, []\\n\\n for i in range(self.N):\\n if weights[i] >= 1/self.N:\\n Dic_More[i] = weights[i]\\n else:\\n Dic_Less[i] = weights[i]\\n\\n while Dic_More and Dic_Less:\\n t_1 = next(iter(Dic_More))\\n t_2 = next(iter(Dic_Less))\\n self.Boxes.append([t_2,t_1,Dic_Less[t_2]*self.N])\\n\\n Dic_More[t_1] -= (1/self.N - Dic_Less[t_2])\\n if Dic_More[t_1] < 1/self.N - ep:\\n Dic_Less[t_1] = Dic_More[t_1]\\n Dic_More.pop(t_1)\\n Dic_Less.pop(t_2)\\n\\n for key in Dic_More: self.Boxes.append([key])\\n\\n def pickIndex(self):\\n r = random.uniform(0, 1)\\n Box_num = int(r*self.N)\\n if len(self.Boxes[Box_num]) == 1:\\n return self.Boxes[Box_num][0]\\n else:\\n q = random.uniform(0, 1)\\n if q < self.Boxes[Box_num][2]:\\n return self.Boxes[Box_num][0]\\n else:\\n return self.Boxes[Box_num][1]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.sum = 0\\n self.prefix_sums = []\\n for weight in w:\\n self.sum+=weight\\n self.prefix_sums.append(self.sum)\\n\\n def pickIndex(self) -> int:\\n rand = random.random() * self.sum\\n print(rand)\\n\\n l = 0\\n r = len(self.prefix_sums) \\n\\n while l < r:\\n mid = l + ((r-l)//2)\\n if self.prefix_sums[mid] < rand:\\n l = mid+1\\n else:\\n r = mid\\n\\n return r \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.array = []\\n num = -1\\n for i, weight in enumerate(w):\\n self.array.append(num + weight)\\n num += weight\\n \\n\\n def pickIndex(self) -> int:\\n k = random.randint(0, self.array[-1])\\n i = 0\\n j = len(self.array)\\n\\n\\n while (i < j):\\n mid = (i + j) // 2\\n print(f\\\"j: {j}\\\")\\n if self.array[mid] >= k:\\n j = mid\\n else:\\n i = mid + 1\\n\\n return i\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"import numpy\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n sum_of_weights = numpy.sum(w)\\n\\n self.probabilities = [int(max((weight / sum_of_weights) * 100, 1)) for weight in w]\\n self.indices = []\\n\\n for (index, probability) in enumerate(self.probabilities):\\n for _ in range(probability):\\n self.indices.append(index)\\n\\n def pickIndex(self) -> int:\\n return self.indices[int(random.uniform(0, len(self.indices) - 1))]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"329\"\n },\n {\n \"code\": \"from numpy import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weights = w\\n self.indexArr = [i for i in range(len(self.weights))]\\n self.probabs = self.convertweights(self.weights)\\n self.i = pow(10,4) + 1\\n self.output = random.choice(self.indexArr,size = pow(10,4) + 1, p=self.probabs)\\n\\n def convertweights(self, weights):\\n sum_ = sum(weights)\\n return [(weights[i] / sum_) for i in range(len(weights))]\\n\\n\\n \\n\\n def pickIndex(self) -> int:\\n self.i-=1\\n return self.output[self.i]\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.max = sum(w)\\n self.fenwick = FenwickTree(len(w))\\n self.prefixSum = []\\n tmp = 0\\n for i, weight in enumerate(w):\\n tmp += weight\\n self.prefixSum.append(tmp)\\n self.fenwick.add(i, weight)\\n\\n def pickIndex(self) -> int:\\n target = random.random() * self.max\\n lo = 0\\n hi = len(self.w)\\n while lo < hi:\\n mid = (lo + hi) // 2\\n if target > self.fenwick.query(mid):\\n lo = mid + 1\\n else:\\n hi = mid\\n return lo\\n\\nclass FenwickTree:\\n def __init__(self, size):\\n self.arr = [0] * (size+1)\\n \\n def add(self, index, delta):\\n index += 1\\n while index < len(self.arr):\\n self.arr[index] += delta\\n index += rightMostSetBit(index)\\n\\n def query(self, index):\\n prefixSum = 0\\n index += 1\\n while index > 0:\\n prefixSum += self.arr[index]\\n index -= rightMostSetBit(index)\\n return prefixSum\\n\\ndef rightMostSetBit(number):\\n return number & -number\\n\\nclass SegmentTree:\\n def __init__(self):\\n pass\",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"import random \\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.sum = list()\\n self.sum_val = 0\\n for item in w:\\n self.sum_val += item\\n self.sum.append(self.sum_val)\\n\\n def pickIndex(self) -> int:\\n target = self.sum_val * random.random()\\n print(target)\\n index = self.search(self.sum, target, 0, len(self.sum) - 1)\\n return index\\n\\n def search(self, num, target, low, high):\\n print(f'low: {low}, high: {high}')\\n if low < high:\\n mid = (low + high) // 2\\n if mid + 1 < len(num) and target >= num[mid] and target < num[mid + 1]:\\n return mid+1\\n elif target <= num[mid]:\\n return self.search(num, target, low, mid)\\n else:\\n return self.search(num, target, mid + 1, high)\\n else:\\n if low + 1 >= len(num):\\n if low - 1 >= 0 and target > num[low - 1] and target <= num[low]:\\n return low\\n if low - 1 < 0:\\n if num[low] >= target:\\n return low\\n return\\n\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sums = []\\n prefix_sum = 0\\n for weight in w:\\n prefix_sum += weight\\n self.prefix_sums.append(prefix_sum)\\n self.total_sum = prefix_sum\\n\\n def pickIndex(self) -> int:\\n target = self.total_sum * random.random()\\n print(random.random())\\n print(self.total_sum)\\n print(target)\\n # run a binary search to find the target zone\\n low, high = 0, len(self.prefix_sums)\\n print(high)\\n while low < high:\\n mid = low + (high - low) // 2\\n print(mid)\\n if target > self.prefix_sums[mid]:\\n low = mid + 1\\n else:\\n high = mid\\n return low\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"def binsearch(arr, left, right, target):\\n # insert base case\\n ##\\n print(\\\"at: \\\", left, right)\\n delta_idx = (right - left) \\n pivot = left + delta_idx // 2\\n # if delta_idx == 1:\\n # print(f\\\"left={left}, right={right}, left_val={arr[left]}, right_val={arr[right]}, target={target}\\\")\\n # return max(right, left)\\n # elif delta_idx == 0:\\n # return left + 1\\n if delta_idx <= 0:\\n return left\\n elif arr[pivot] < target:\\n ret = binsearch(arr, pivot + 1, right, target)\\n else:\\n ret = binsearch(arr, left, pivot, target)\\n return ret\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n tot = sum(w)\\n self.cumsums = []\\n self.tot = 0\\n for myw in w:\\n self.tot += myw\\n self.cumsums.append(self.tot)\\n \\n def pickIndex(self) -> int:\\n target = self.tot * random.random() # rand num between 0 and self.tot\\n return binsearch(self.cumsums, 0, len(self.cumsums) - 1, target)\\n \\n def pickIndex2(self) -> int:\\n target = self.tot * random.random() # rand num between 0 and self.tot\\n for i, mysum in enumerate(self.cumsums):\\n if target < mysum:\\n return i\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"485\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n #self.cdf = []\\n #for ww in w:\\n # self.total += ww\\n # self.cdf.append(self.total)\\n self.cdf = np.cumsum(w)\\n self.total = self.cdf[-1]\\n\\n def pickIndex(self) -> int:\\n\\n #rand = random.randint(1, self.total)\\n rand = ceil(random.random() * self.total)\\n #rand = random.randint(1, self.total)\\n\\n return bisect.bisect_left(self.cdf, rand)\\n\\n \\\"\\\"\\\"\\n def __init__(self, w: List[int]):\\n self.prefix_sum = []\\n prefix_sum = 0\\n for weight in w:\\n prefix_sum += weight\\n self.prefix_sum.append(prefix_sum)\\n print(self.prefix_sum)\\n self.total_sum = prefix_sum\\n\\n def pickIndex(self) -> int:\\n # Generate a random number in the range [1, total_sum]\\n random_num = random.randint(1, self.total_sum)\\n # Use binary search to find the index of the random number in prefix_sum\\n index = bisect_left(self.prefix_sum, random_num)\\n # Return the index corresponding to the random number\\n return index\\n \\\"\\\"\\\"\\n\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"485\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n ## say weights are [1, 2, 2, 5]\\n ### make weights into array [0, 0.1, 0.3, 0.5] etc\\n ###binary search will get first index i s.t. p < cum_weight[i] , return i -1\\n curr_sum = 0\\n self.cum_weight = []\\n for weight in w:\\n self.cum_weight.append(curr_sum)\\n curr_sum += weight\\n self.cum_weight = [weight/ curr_sum for weight in self.cum_weight]\\n print(self.cum_weight)\\n def pickIndex(self) -> int:\\n ## pick random number\\n p = random.uniform(0,1)\\n print('prob: ', p)\\n if len(self.cum_weight) == 1:\\n return 0\\n left, right = 1, len(self.cum_weight)\\n while (left < right):\\n mid = left + (right - left) // 2\\n print(left, right, mid)\\n #return 0\\n ### search left\\n #'''\\n if p < self.cum_weight[mid]:\\n right = mid\\n else:\\n left = mid+1\\n #'''\\n return left - 1\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"538\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, w: List[int]):\\n import numpy as np\\n import random\\n self.w = w\\n self.prefix_sums = np.cumsum(w)\\n self.total = self.prefix_sums[-1]\\n \\n def pickIndex(self) -> int:\\n import numpy as np\\n target = self.total * random.random()\\n return np.searchsorted(self.prefix_sums, target, side='right')\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"538\"\n },\n {\n \"code\": \"import numpy as np\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.cs = np.cumsum(w)\\n #print(self.cs)\\n\\n def pickIndex(self) -> int:\\n rv = random.random() * self.cs[-1]\\n l = 0\\n r = len(self.cs)\\n while l <= r:\\n mid = (l+r) // 2\\n midl_val = self.cs[mid - 1] if mid - 1 >= 0 else 0\\n midr_val = self.cs[mid + 1] if mid + 1 < len(self.cs) else 1\\n if self.cs[mid] >= rv and midl_val <= rv:\\n return mid\\n \\n if self.cs[mid] > rv:\\n r = mid - 1\\n else:\\n l = mid + 1\\n\\n return mid\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"590\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.sumVals = sum(w)\\n self.probability = [k/self.sumVals for k in w]\\n self.probability = [sum(self.probability[:k+1]) for k in range(len(w))]\\n\\n\\n def pickIndex(self) -> int:\\n return bisect_left(self.probability, random.random())\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"590\"\n },\n {\n \"code\": \"import random\\nimport bisect\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.nw = [w[0]]*len(w)\\n for i in range(1, len(w)):\\n self.nw[i] = self.nw[i-1] + w[i]\\n self.total = self.nw[-1]\\n \\n\\n def pickIndex(self) -> int:\\n random.seed()\\n num = random.randint(0, self.total-1)\\n\\n left, right = 0, len(self.nw)-1\\n while left + 1 < right:\\n mid = (left + right) //2\\n if self.nw[mid] > num:\\n right = mid\\n elif self.nw[mid] < num:\\n left = mid\\n else:\\n return mid + 1\\n \\n if self.nw[left] > num:\\n return left\\n else: \\n return right\\n \\n\\n # pos = bisect.bisect_right(self.nw, num)\\n # return pos\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\\n\\n\\n\\n\\n# import random\\n\\n# class Solution:\\n\\n# def __init__(self, w: List[int]):\\n# random.seed()\\n \\n# self.walls = []\\n# count = 0\\n# for weight in w:\\n# count += weight\\n# self.walls.append(count)\\n \\n# self.total = self.walls[-1]\\n\\n# # self.wList = []\\n# # for index in range(len(w)):\\n# # weight = w[index]\\n# # while weight > 0:\\n# # self.wList.append(index)\\n# # weight -= 1\\n\\n\\n\\n \\n# def pickIndex(self) -> int:\\n# pick = random.randint(0, self.total-1)\\n# if pick < self.walls[0]:\\n# return 0\\n \\n# left = 0\\n# right = len(self.walls)-1\\n\\n# while left + 1 < right:\\n# mid = (left + right) //2\\n# if self.walls[mid] > pick:\\n# right = mid\\n# elif self.walls[mid] < pick:\\n# left = mid\\n# else:\\n# return mid + 1\\n \\n# return left+1\\n\\n\\n\\n\\n# # def __init__(self, w: List[int]):\\n# # random.seed()\\n# # count = 0\\n# # self.indices = [0]\\n# # for i in range(len(w)):\\n# # element = w[i]\\n# # count += element\\n# # self.indices.append(count)\\n\\n \\n\\n# # def pickIndex(self) -> int:\\n# # pick = random.randint(0, self.indices[-1] -1)\\n# # left, right = 0, len(self.indices)-1\\n# # while left + 1 < right:\\n# # mid = (left + right) // 2\\n# # if self.indices[mid] <= pick:\\n# # left = mid\\n# # else:\\n# # right = mid\\n# # return left \\n \\n\\n\\n# # Your Solution object will be instantiated and called as such:\\n# # obj = Solution(w)\\n# # param_1 = obj.pickIndex()\",\n \"runtime\": \"642\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\\n self.total_weight = self.cumm_sum[-1]\\n # print(self.total_weight)\\n\\n def pickIndex(self) -> int:\\n target = random.uniform(0, self.total_weight)\\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\\n return index\\n\\n def bisect_left(self, low, high, arr, target) -> int:\\n \\\"\\\"\\\"\\n \\n \\\"\\\"\\\"\\n if low <0:\\n raise ValueError('lo must be non-negative')\\n if high==None:\\n high = len(arr)\\n while low < high:\\n mid = (low + high) //2\\n if arr[mid]<target:\\n low = mid+1\\n else:\\n high = mid\\n return low\\n\\n# # Your Solution object will be instantiated and called as such:\\n# # obj = Solution(w)\\n# # param_1 = obj.pickIndex()\\n\\n# import random\\n\\n# class Solution:\\n\\n# def __init__(self, w):\\n# self.prefix_sums = []\\n# total = 0\\n# for weight in w:\\n# total += weight\\n# self.prefix_sums.append(total)\\n# self.total_weight = total\\n\\n# def bisect_left(self, a, x):\\n# lo = 0\\n# hi = len(a)\\n# while lo < hi:\\n# mid = (lo + hi) // 2\\n# if a[mid] < x:\\n# lo = mid + 1\\n# else:\\n# hi = mid\\n# return lo\\n\\n# def pickIndex(self):\\n# target = random.uniform(0, self.total_weight)\\n# index = self.bisect_left(self.prefix_sums, target)\\n# return index\\n\",\n \"runtime\": \"642\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.p_sum = [sum(w[:i]) for i in range(1, len(w)+1)]\\n \\n def pickIndex(self) -> int:\\n seed = random.randint(1, self.p_sum[-1])\\n l, r = 0, len(self.p_sum)-1\\n while l <= r:\\n mid = (l + r) // 2\\n if self.p_sum[mid] < seed:\\n l = mid + 1\\n else:\\n r = mid - 1\\n return l\\n\\n\\n\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"695\"\n },\n {\n \"code\": \"from random import uniform\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.nums = w\\n self.weights = [sum(w[:index+1]) for index in range(len(w))]\\n \\n\\n def pickIndex(self) -> int:\\n if self.nums == []:\\n return None\\n else:\\n random_number = uniform(0,self.weights[-1])\\n left, right = 0, len(self.weights) - 1\\n while (left < right):\\n middle = (left + right) // 2\\n current = self.weights[middle]\\n if current < random_number:\\n left = middle + 1\\n elif current > random_number:\\n right = middle \\n return left\\n\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"695\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.dist = np.cumsum(w)\\n self.w = w\\n \\n\\n def pickIndex(self) -> int:\\n i = np.random.randint(self.dist[-1])\\n ind = np.where(i<self.dist)[0][0]\\n return ind\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"747\"\n },\n {\n \"code\": \"import random\\nclass Solution(object):\\n\\n def __init__(self, w):\\n \\\"\\\"\\\"\\n :type w: List[int]\\n \\\"\\\"\\\"\\n self.cum_sum = [0]+ [sum(w[0:i+1]) for i in range(len(w))]\\n print(self.cum_sum)\\n\\n\\n def pickIndex(self):\\n \\\"\\\"\\\"\\n :rtype: int\\n \\\"\\\"\\\"\\n rand_num = random.randint(0,self.cum_sum[-1]-1)\\n \\n left = 0\\n right = len(self.cum_sum) - 1\\n while left < right:\\n \\n mid = (left + right) //2\\n if mid == left:\\n break\\n if rand_num < self.cum_sum[mid]:\\n right = mid\\n else:\\n left = mid\\n mid = (left + right) // 2\\n print('rand_num', rand_num)\\n print('mid', mid)\\n return mid\\n\\n \\n \\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"747\"\n },\n {\n \"code\": \"import random\\nimport math\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.w = [0]\\n cumsum = 0\\n for i in w:\\n cumsum += i\\n self.w.append(cumsum)\\n self.w.pop()\\n print(self.w)\\n self.n = cumsum\\n \\n def pickIndex(self) -> int:\\n p = random.random()*self.n\\n l = 0\\n r = len(self.w) - 1\\n while l < r:\\n m = r - ((r - l) // 2)\\n #m = math.ceil((l+r)/2)\\n v = self.w[m]\\n print(p, v, m, l, r)\\n if p > v:\\n l = m\\n else:\\n r = m - 1\\n print('>', l)\\n return l\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"import random\\nimport math\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.w = [0]\\n cumsum = 0\\n for i in w:\\n cumsum += i\\n self.w.append(cumsum)\\n self.w.pop()\\n print(self.w)\\n self.n = cumsum\\n \\n def pickIndex(self) -> int:\\n p = random.random()*self.n\\n l = 0\\n r = len(self.w) - 1\\n while l < r:\\n m = r - ((r - l) // 2)\\n m = math.ceil((l+r)/2)\\n v = self.w[m]\\n print(p, v, m, l, r)\\n if p > v:\\n l = m\\n else:\\n r = m - 1\\n print('>', l)\\n return l\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"799\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n acc = 0\\n self.probability = []\\n for weight in w:\\n acc += weight / sum(w)\\n self.probability.append(acc)\\n self.probability[-1] = 1\\n\\n\\n def pickIndex(self) -> int:\\n return bisect_left(self.probability, random.random())\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"851\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = [i/sum(w) for i in w]\\n self.cumw = []\\n s = 0\\n for i in self.w:\\n s+=i\\n self.cumw.append(s)\\n\\n def pickIndex(self) -> int:\\n random_number = random.random()\\n left = 0\\n right = len(self.cumw)\\n while left<right:\\n mid = (left+right)//2\\n if self.cumw[mid]>=random_number:\\n right = mid\\n else:\\n left = mid+1\\n return left\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"851\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n w=list(map(lambda x:x/sum(w),w))\\n for x in range(1,len(w)) :\\n w[x]+=w[x-1]\\n self.w=w\\n\\n\\n def pickIndex(self) -> int:\\n r=random.uniform(0,1)\\n return bisect.bisect_left(self.w,r)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, w: List[int]):\\n self.weights = [i / sum(w) for i in accumulate(w)] \\n\\n def pickIndex(self) -> int:\\n idx = bisect.bisect(self.weights, random.random())\\n return idx\",\n \"runtime\": \"904\"\n },\n {\n \"code\": \"import bisect\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n\\n w=list(map(lambda x:x/sum(w),w))\\n for x in range(1,len(w)) :\\n w[x]+=w[x-1]\\n self.w=w\\n \\n \\n \\n\\n def pickIndex(self) -> int:\\n r=random.uniform(0,1)\\n return bisect.bisect_left(self.w,r)\",\n \"runtime\": \"956\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.cumSumProb = [elem/sum(w) for elem in w]\\n for i in range(1, len(w)):\\n self.cumSumProb[i] += self.cumSumProb[i-1]\\n\\n def pickIndex(self) -> int:\\n r = random.random()\\n left = 0\\n right = len(self.cumSumProb)\\n while left < right:\\n mid = (left+right)//2\\n if r < self.cumSumProb[mid]:\\n right = mid\\n else:\\n left = mid + 1\\n return left\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"956\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.probs = [0] + [f/sum(w) for f in w]\\n \\n for i in range(1, len(self.probs)):\\n self.probs[i] = self.probs[i] + self.probs[i-1]\\n\\n def pickIndex(self) -> int:\\n idx= random.uniform(0, 1)\\n p = self.probs\\n l = 1 \\n r = len(p)\\n while l< r:\\n pivot = int((l+r)/2)\\n if idx <= p[pivot] and idx > p[pivot - 1]:\\n return pivot - 1\\n elif idx > p[pivot]:\\n l = pivot + 1\\n else:\\n r = pivot\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1008\"\n },\n {\n \"code\": \"# 1, sum(w)\\n#1, 4\\n#randint first larger than randint [binary search]\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.length = len(w)\\n self.arr = [0] * self.length\\n preSum = 0\\n for i in range( self.length):\\n preSum += w[i]\\n self.arr[i] = preSum \\n \\n \\n\\n def pickIndex(self) -> int:\\n \\n rand = random.randint(1, sum(self.w))\\n \\n #find the first one >= rand\\n l, r = 0, self.length - 1\\n while l < r:\\n mid = l + (r - l) // 2\\n if self.arr[mid] < rand:\\n l = mid + 1\\n else:\\n r = mid\\n return r\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1008\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.li = []\\n \\n for i, weight in enumerate(w):\\n ratio = ceil(weight / sum(w) * 100)\\n # print(ratio)\\n self.li += ([i] * ratio)\\n # print(self.li, len(self.li))\\n\\n\\n def pickIndex(self) -> int:\\n return random.choice(self.li)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1060\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight = [val / sum(w) for val in w]\\n for i in range(1, len(self.weight)):\\n self.weight[i] = self.weight[i - 1] + self.weight[i]\\n\\n def pickIndex(self) -> int:\\n randNum = random.random()\\n if randNum <= self.weight[0]:\\n return 0\\n l, r = 0, len(self.weight) - 1\\n while r - l > 1:\\n m = (l + r) // 2\\n if self.weight[m] == randNum:\\n return m\\n elif self.weight[m] > randNum:\\n r = m\\n else:\\n l = m\\n return r\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1060\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sum = list(accumulate(w))\\n self.w = w\\n\\n def pickIndex(self) -> int:\\n rand = random.randint(1, sum(self.w))\\n return bisect.bisect_left(self.prefix_sum, rand)\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1113\"\n },\n {\n \"code\": \"# import random \\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.n_w = [0] + [float(weight)/sum(w) for weight in w]\\n for i in range(1,len(self.n_w)):\\n self.n_w[i] = self.n_w[i] + self.n_w[i-1]\\n\\n def pickIndex(self) -> int:\\n sample = random.random()\\n\\n start = 0\\n end = len(self.n_w) - 1\\n\\n while end > start: \\n mid = (start + end)//2\\n if sample > self.n_w[mid] and sample <= self.n_w[mid+1]:\\n return mid\\n elif sample > self.n_w[mid]:\\n start = mid + 1\\n else:\\n end = mid\\n\\n\\n\\n\\n # for i in range(1, len(self.n_w)):\\n # low, high = (self.n_w[i-1], self.n_w[i])\\n # if sample >= low and sample < high:\\n # return i-1\\n\\n \\n \\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1113\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.pdf = [w[i]/sum(w) for i in range(len(w))]\\n self.cdf = [self.pdf[0]]\\n for i in range(1, len(self.pdf)):\\n self.cdf.append(self.cdf[i-1] + self.pdf[i])\\n \\n\\n def pickIndex(self) -> int:\\n random_number = random.random()\\n # find the number that is the minimum and is greater than random_number\\n\\n l = 0\\n r = len(self.cdf) - 1\\n res = len(self.cdf) - 1\\n while l <= r:\\n mid = l + (r - l)//2\\n if self.cdf[mid] < random_number:\\n l = mid + 1\\n else:\\n r = mid - 1\\n res = min(res, mid)\\n \\n return res\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1165\"\n },\n {\n \"code\": \"import numpy as np\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.cs = np.cumsum([x/sum(w) for x in w])\\n print(self.cs)\\n\\n def pickIndex(self) -> int:\\n rv = random.random()\\n l = 0\\n r = len(self.cs)\\n while l <= r:\\n mid = (l+r) // 2\\n midl_val = self.cs[mid - 1] if mid - 1 >= 0 else 0\\n midr_val = self.cs[mid + 1] if mid + 1 < len(self.cs) else 1\\n if self.cs[mid] >= rv and midl_val <= rv:\\n return mid\\n \\n if self.cs[mid] > rv:\\n r = mid - 1\\n else:\\n l = mid + 1\\n\\n return mid\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1165\"\n },\n {\n \"code\": \"from random import random \\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prob = {} #acc prob, index\\n sumWeight = sum(w)\\n acc = 0\\n for i in range(len(w)):\\n acc +=w[i]\\n self.prob[acc/sumWeight] = i\\n \\n\\n def pickIndex(self) -> int:\\n rand = random()\\n for p in self.prob:\\n if(rand<=p):\\n return self.prob[p]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1217\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n def __init__(self, w: List[int]):\\n weightList = []\\n self.pickIdx = 0\\n self.maxCount = 0\\n totalWeight = sum(w)\\n self.weightedList = []\\n for i in range(len(w)):\\n wgt = w[i]\\n percentWeight = int(round(wgt/totalWeight, 5) * 100000)\\n print(percentWeight)\\n for _ in range(percentWeight):\\n self.weightedList.append(i)\\n random.shuffle(self.weightedList)\\n self.maxCount = len(self.weightedList)\\n\\n def pickIndex(self) -> int:\\n item = self.weightedList[self.pickIdx]\\n self.pickIdx += 1\\n if self.pickIdx >= self.maxCount:\\n self.pickIdx = 0\\n return item\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1269\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n def __init__(self, w: List[int]):\\n weightList = []\\n self.pickIdx = 0\\n self.maxCount = 0\\n totalWeight = sum(w)\\n self.weightedList = []\\n for i in range(len(w)):\\n wgt = w[i]\\n percentWeight = int(round(wgt/totalWeight, 5) * 100000)\\n print(percentWeight)\\n for _ in range(percentWeight):\\n self.weightedList.append(i)\\n random.shuffle(self.weightedList)\\n self.maxCount = len(self.weightedList)\\n\\n def pickIndex(self) -> int:\\n item = self.weightedList[self.pickIdx]\\n self.pickIdx += 1\\n if self.pickIdx >= self.maxCount:\\n self.pickIdx = 0\\n return item\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1269\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.probs = {}\\n curr_sum = 0\\n for i, num in enumerate(w):\\n curr_sum += num\\n self.probs[curr_sum] = i\\n self.sum = curr_sum\\n \\n\\n def pickIndex(self) -> int:\\n rand_num = random.randrange(0, self.sum)\\n for num in self.probs:\\n if rand_num < num:\\n return self.probs[num]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1322\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n carryOver = 0\\n self.randomList = []\\n for j in w:\\n carryOver += j\\n self.randomList.append(carryOver)\\n self.summ = carryOver\\n \\n \\n\\n def pickIndex(self) -> int:\\n yes = random.randint(1, self.summ)\\n if len(self.randomList) > 2:\\n if yes in self.randomList:\\n index = self.randomList.index(yes)\\n else:\\n index = self.BinarySearchModified(self.randomList, 0, len(self.randomList)-1, yes)\\n elif len(self.randomList) == 2 and self.randomList[0] < yes:\\n return 1\\n else:\\n return 0\\n return index\\n \\n\\n def BinarySearchModified(self, arr, low, high, x):\\n while high - low > 1:\\n mid = low + (high - low)//2\\n if arr[mid] > x:\\n if arr[low] < x:\\n high = mid\\n else:\\n return low\\n else:\\n if arr[high] > x:\\n low = mid\\n else:\\n return high+1\\n return high\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1322\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.prob = [self.w[i]/sum(w) for i in range(len(w))]\\n self.acc = [sum(self.prob[0:i+1]) for i in range(len(w))]\\n\\n def pickIndex(self) -> int:\\n import random\\n u = random.uniform(0,1)\\n\\n # for i in range(len(self.w)):\\n # if i == 0 and u <= self.acc[0]:\\n # return self.w[i][1]\\n # elif u > self.acc[i] and u <= self.acc[i+1]:\\n # return self.w[i+1][1]\\n\\n l = 0 \\n r = len(self.w)-1\\n \\n while l < r:\\n \\n mid = (l+r) //2\\n\\n if u <= self.acc[mid] and l <= r:\\n r = mid \\n \\n elif u > self.acc[mid] and l <= r:\\n l = mid + 1\\n\\n return r\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1374\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.probs = {}\\n curr_sum = 0\\n for i, num in enumerate(w):\\n curr_sum += num\\n self.probs[curr_sum] = i\\n self.sum = curr_sum\\n \\n\\n def pickIndex(self) -> int:\\n rand_num = random.randrange(0, self.sum)\\n for num in self.probs:\\n if rand_num < num:\\n return self.probs[num]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1374\"\n },\n {\n \"code\": \"from random import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.shifted = {}\\n index_offset = 0\\n for i, wi in enumerate(w):\\n self.shifted[index_offset] = i\\n index_offset += wi\\n self.sum = index_offset\\n\\n def pickIndex(self) -> int:\\n offsets = list(self.shifted.keys())\\n rand = int(random() * self.sum)\\n # bin search\\n l, h = 0, len(offsets) - 1\\n while l <= h:\\n mid = (l + h) // 2\\n if mid == len(offsets) - 1:\\n return self.shifted[offsets[mid]]\\n if rand >= offsets[mid] and rand < offsets[mid + 1]:\\n return self.shifted[offsets[mid]]\\n if rand > offsets[mid]:\\n l = mid + 1\\n else:\\n h = mid - 1\\n return -1\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1426\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.probs = [sum(w[:i+1])/sum(w) for i in range(len(w))]\\n \\n def pickIndex(self) -> int:\\n return bisect.bisect_left(self.probs, random.random())\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1478\"\n },\n {\n \"code\": \"from random import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.shifted = {}\\n index_offset = 0\\n for i, wi in enumerate(w):\\n self.shifted[index_offset] = i\\n index_offset += wi\\n self.sum = index_offset\\n\\n def pickIndex(self) -> int:\\n offsets = list(self.shifted.keys())\\n rand = int(random() * self.sum)\\n # bin search\\n l, h = 0, len(offsets) - 1\\n while l <= h:\\n mid = (l + h) // 2\\n if mid == len(offsets) - 1:\\n return self.shifted[offsets[mid]]\\n if rand >= offsets[mid] and rand < offsets[mid + 1]:\\n return self.shifted[offsets[mid]]\\n if rand > offsets[mid]:\\n l = mid + 1\\n else:\\n h = mid - 1\\n return -1\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1478\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.lookup = []\\n self.max = 0\\n\\n running_sum = 0\\n for i in range(len(w)):\\n running_sum += w[i]\\n item = running_sum, i\\n self.lookup.append(item)\\n\\n self.max = running_sum\\n\\n def pickIndex(self) -> int:\\n if self.max == 0:\\n return 0\\n\\n selection = randrange(0, self.max)\\n\\n result = 0\\n for running_sum, index in self.lookup:\\n if selection < running_sum:\\n return index\\n\\n return result\\n\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1531\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n def __init__(self, w: List[int]):\\n\\n self.indices = []\\n index = 0\\n for i, prob in enumerate(w):\\n index += prob\\n self.indices.append((index, i))\\n\\n print(self.indices)\\n\\n self.tot = sum(w)\\n\\n def pickIndex(self) -> int:\\n weight = random.randrange(0, self.tot)\\n if len(self.indices) == 1:\\n return self.indices[0][1]\\n for w, index in self.indices:\\n if weight < w:\\n return index\\n return self.indices[-1][1]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1531\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n x = self\\n self.dic = {}\\n self.idx = 0\\n norm = [float(i)/max(w) for i in w]\\n for num, count in enumerate(norm):\\n rng = int(count * 100)\\n for j in range(rng):\\n self.dic[self.idx] = num\\n self.idx += 1\\n \\n\\n def pickIndex(self) -> int:\\n return self.dic[randint(0,self.idx-1)]\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1583\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.lookup = []\\n self.max = 0\\n\\n running_sum = 0\\n for i in range(len(w)):\\n running_sum += w[i]\\n item = running_sum, i\\n self.lookup.append(item)\\n\\n self.max = running_sum\\n\\n def pickIndex(self) -> int:\\n if self.max == 0:\\n return 0\\n\\n selection = randrange(0, self.max)\\n\\n result = 0\\n for running_sum, index in self.lookup:\\n if selection < running_sum:\\n return index\\n\\n return result\\n\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1583\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.sumW = 0\\n self.weightDict = dict()\\n\\n for i, item in enumerate(w):\\n self.sumW += item\\n self.weightDict[self.sumW] = i\\n\\n def pickIndex(self) -> int:\\n j = randint(1,self.sumW)\\n\\n for w, i in self.weightDict.items():\\n if j <= w:\\n return i\\n\\n\\n \\n \\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1635\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n prob = [x/sum(w) for x in w]\\n self.cdf = [sum(prob[:i]) for i in range(len(prob))] + [1]\\n \\n\\n def pickIndex(self) -> int:\\n rn = random.random()\\n\\n l = 0\\n r = len(self.cdf)-2\\n\\n while l<=r:\\n m = l + (r-l)//2\\n if rn < self.cdf[m]:\\n r = m-1\\n elif rn > self.cdf[m+1]:\\n l = m+1\\n else:\\n return m\\n \\n return\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1688\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.p_s = [0] * (len(w) + 1)\\n for i in range(1, len(w)+1):\\n self.p_s[i] = self.p_s[i-1] + w[i-1]\\n self.p_s.pop(0)\\n\\n def pickIndex(self) -> int:\\n num = random.randint(1, max(self.p_s))\\n return bisect_left(self.p_s, num)\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1688\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = sum(w)\\n self.w = [(i, w[i]) for i in range(len(w))]\\n \\n\\n def pickIndex(self) -> int:\\n while True:\\n current = random.choice(self.w)\\n index, weight = current[0], current[1]\\n probability = (weight / self.total) * 100\\n roll = random.randint(0, 100)\\n if roll <= probability:\\n return index\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1740\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight=[w[0]/sum(w)]\\n weight=[w[0]/sum(w)]\\n for i in range(1,len(w)):\\n self.weight.append(self.weight[-1]+w[i]/sum(w))\\n weight.append(weight[-1]+w[i]/sum(w))\\n \\n\\n def pickIndex(self) -> int:\\n l,r,pick=0,len(self.weight)-1, random.random()\\n while l<r:\\n m=(l+r)//2\\n if pick>=self.weight[m]:\\n l=m+1\\n else: r=m\\n return l\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1740\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.presum = list(accumulate(w))\\n \\n def pickIndex(self) -> int:\\n rand = random.randint(1, max(self.presum))\\n return bisect_left(self.presum, rand)\\n \\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1792\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n \\n # prefix sum\\n self.prefix_sum = []\\n acc = 0\\n for tmp in w:\\n acc += tmp\\n self.prefix_sum.append(acc)\\n\\n \\n def pickIndex(self) -> int:\\n \\n # generate random in 0~max(prefix_sum)\\n rand = random.random() * max(self.prefix_sum)\\n \\n # [1, 4, 9], 5\\n # l = 0, r = 3, mid = 1\\n # l = 2, r = 3, mid = 2\\n # l = 2, r = 2 (upperbound)\\n\\n # find the upperbound index in prefix_sum\\n l = 0\\n r = len(self.prefix_sum)\\n while l < r:\\n mid = l + int((r - l) / 2)\\n if rand < self.prefix_sum[mid]:\\n r = mid\\n else:\\n l = mid + 1\\n return l\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\\n\\n\\n\",\n \"runtime\": \"1792\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n presum = 0\\n s = sum(w)\\n self.arr = []\\n for i in w:\\n presum += i\\n self.arr.append(presum / s)\\n\\n def pickIndex(self) -> int:\\n pr = random.random()\\n for i in range(len(self.arr)):\\n if self.arr[i] > pr:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\\n\",\n \"runtime\": \"1844\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n ranges = [0]\\n s = sum(w)\\n for weight in w:\\n ranges.append(ranges[-1]+weight/s)\\n ranges.append(2)\\n self.ranges = ranges\\n\\n def pickIndex(self) -> int:\\n r = random.random()\\n for i in range(len(self.ranges)):\\n if self.ranges[i] > r:\\n return i-1\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1897\"\n },\n {\n \"code\": \"class Solution:\\n \\n\\n def __init__(self, w: List[int]):\\n self.partition =[]\\n total = sum(w)\\n cur = 0\\n for i in w:\\n cur += i/total\\n self.partition.append(cur)\\n\\n def pickIndex(self) -> int:\\n signal = random.random()\\n for i in range(len(self.partition)):\\n if self.partition[i] >= signal:\\n return i\\n return -1\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"1949\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.cum = [0]*len(w)\\n self.cum[0] = w[0]\\n for i in range(1,len(w)):\\n self.cum[i] = w[i]+self.cum[i-1]\\n\\n def pickIndex(self) -> int:\\n randweight = randint(1, self.cum[-1])\\n for i in range(len(self.cum)):\\n if randweight<=self.cum[i]: return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2001\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.orig_weights = w\\n self.weighted_arr = [0] * len(w)\\n self.weighted_arr[0] = self.orig_weights[0]\\n for i in range(1, len(self.orig_weights)):\\n self.weighted_arr[i] = self.weighted_arr[i - 1] + self.orig_weights[i]\\n\\n self.total_weight = self.weighted_arr[-1]\\n\\n def pickIndex(self) -> int:\\n # index_picked = random.random() * self.total_weight\\n index_picked = random.randint(0, self.total_weight-1)\\n # print(f\\\"Index picked: {index_picked}\\\")\\n for i in range(len(self.weighted_arr)):\\n # print(f\\\"\\\\t {index_picked}, {self.weighted_arr[i]}\\\")\\n if index_picked < self.weighted_arr[i]:\\n return i\\n\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2053\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n presum = 0\\n s = sum(w)\\n self.arr = []\\n for i in w:\\n presum += i\\n self.arr.append(presum / s)\\n\\n def pickIndex(self) -> int:\\n pr = random.random()\\n for i in range(len(self.arr)):\\n if self.arr[i] > pr:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\\n\",\n \"runtime\": \"2210\"\n },\n {\n \"code\": \"import random\\n\\n\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self._prefix = []\\n for i in w:\\n if self._prefix == []:\\n self._prefix.append(i)\\n else:\\n self._prefix.append(self._prefix[-1] + i)\\n\\n def pickIndex(self) -> int:\\n target = random.randint(1, self._prefix[-1])\\n for i in range(len(self._prefix)):\\n if target < self._prefix[i]:\\n return i\\n\\n return 0\\n\",\n \"runtime\": \"2210\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight_sum = sum(w)\\n self.prefix_sum = []\\n cur_sum = 0\\n for i in range(len(w)):\\n cur_sum += w[i]\\n self.prefix_sum.append(cur_sum)\\n\\n\\n def pickIndex(self) -> int:\\n rand = random.randrange(1, self.weight_sum + 1)\\n for i in range(len(self.prefix_sum)):\\n if rand <= self.prefix_sum[i]:\\n return i\\n return len(self.prefix_sum) - 1\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2262\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = 0 \\n self.preFixSum = []\\n for i in range(len(w)):\\n self.total += w[i]\\n self.preFixSum.append(self.total)\\n \\n \\n\\n \\n\\n def pickIndex(self) -> int:\\n target = random.randint(1, self.total)\\n for ix in range(0, len(self.preFixSum)):\\n if self.preFixSum[ix] >= target:\\n return ix\\n return len(self.preFixSum) - 1\\n \\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2262\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n totSum = 0\\n probSum = 0\\n self.elements = w\\n self.cumProbs = []\\n for num in w:\\n totSum += num\\n for i,num in enumerate(w):\\n prob = w[i]/totSum\\n probSum += prob\\n self.cumProbs.append(probSum)\\n \\n def pickIndex(self) -> int:\\n pickProb = random.random()\\n # print(\\\"prob\\\")\\n # print(pickProb)\\n # print(\\\"cumProbs\\\")\\n # print(self.cumProbs)\\n # print(\\\"elements\\\")\\n # print(self.elements)\\n for i in range(len(self.cumProbs)):\\n if (pickProb<=self.cumProbs[i]):\\n return i\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2315\"\n },\n {\n \"code\": \"class Solution:\\n #Intution: The larger the number, more is the probability of it to get picked.\\n \\n def __init__(self, w:List[int]):\\n self.w = []\\n total = 0\\n for weight in w:\\n total += weight\\n self.w.append(total)\\n self.total = total\\n\\n def pickIndex(self) -> int:\\n ran = random.randint(1, self.total)\\n for i, weight in enumerate(self.w):\\n if ran <= weight:\\n return i\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2315\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefixSum = [0.0] * len(w)\\n\\n total = sum(w)\\n\\n for i in range(len(w)):\\n self.prefixSum[i] = 1.0 * w[i]/total\\n if i > 0:\\n self.prefixSum[i] += self.prefixSum[i - 1]\\n # print(self.prefixSum)\\n \\n\\n def pickIndex(self) -> int:\\n # Generate a random number between 0 and 1\\n random_value = random.random()\\n # print(random_value)\\n for i, prob in enumerate(self.prefixSum):\\n if prob >= random_value:\\n return i\\n\\n return len(self.prefixSum) - 1\",\n \"runtime\": \"2367\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n # self.wsum = sum(self.w)\\n self.wrange = self.get_wrange(w)\\n self.wsum = self.wrange[-1]\\n # print(w)\\n # print(self.wrange)\\n # print(self.wsum)\\n\\n\\n def get_wrange(self, w):\\n totalv = 0\\n wrange = []\\n for v in w:\\n totalv += v\\n wrange.append(totalv)\\n return wrange\\n\\n\\n def pickIndex(self) -> int:\\n ridx = random.randint(1, self.wsum)\\n print('ridx', ridx)\\n i = 0\\n while self.wrange[i] < ridx:\\n i += 1\\n return i\\n\\n\\n \\n#easiest way -> put together a list of each index, represented by w[i] counts and shuffle it each time to return when pickindex is called\\n\\n#storage might be a concern, could insteda find lowest value and divide by everything and make it the count array smaller\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2367\"\n },\n {\n \"code\": \"from numpy.random import choice\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = [0]* len(w)\\n self.w[0] = w[0]\\n for i,v in enumerate(w[1:]):\\n self.w[i+1] = self.w[i]+v\\n self.total = self.w[-1]\\n \\n \\n\\n def pickIndex(self) -> int:\\n rv = random.randrange(self.total)\\n for i in range(len(self.w)):\\n if self.w[i]> rv:\\n return i\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2419\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prob =[]\\n s = sum(w)\\n prev = 0\\n for ow in w:\\n prev += ow/s\\n self.prob.append(prev)\\n \\n print(self.prob)\\n\\n \\n def pickIndex(self) -> int:\\n randomV = random.uniform(0, 1)\\n for i in range(len(self.prob)):\\n if randomV <= self.prob[i]:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2419\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.sum = sum(self.w)\\n self.pdf = [val / self.sum for val in self.w]\\n curr = 0\\n self.cdf = []\\n for val in self.pdf:\\n curr += val\\n self.cdf.append(curr)\\n \\n\\n def pickIndex(self) -> int:\\n val = np.random.uniform()\\n\\n for i in range(len(self.cdf) - 2, -1, -1):\\n if self.cdf[i] < val:\\n return i + 1\\n return 0\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2471\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.probability_ranges = []\\n self.total_sum = sum(w)\\n curr = 0\\n for i, weight in enumerate(w):\\n p = weight / self.total_sum\\n self.probability_ranges.append((curr, curr + p, i))\\n curr += p\\n\\n def pickIndex(self) -> int:\\n r = random.random()\\n for (low, end, i) in self.probability_ranges:\\n if low <= r <= end:\\n return i\\n \\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2471\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i-1]\\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0, 1)\\n index = -1\\n while True:\\n index += 1\\n if N <= self.w[index]:\\n break\\n return index\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2524\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.total = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] /= self.total\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i - 1]\\n\\n def pickIndex(self) -> int:\\n n = random.uniform(0, 1)\\n i = -1\\n\\n while True:\\n i += 1\\n\\n if n <= self.w[i]:\\n return i\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2524\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.probs = []\\n total = sum(self.w)\\n curr = 0.0\\n for i in self.w:\\n p = i/total\\n curr+=p\\n self.probs.append(curr)\\n\\n def pickIndex(self) -> int:\\n val = random.random()\\n for i in range(len(self.probs)):\\n if val>self.probs[i]:\\n continue\\n else:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2576\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n # initialize variables and calculate pdf and cdf\\n self.weight=w\\n self.total=sum(w)\\n self.prob=[0]*len(w)\\n self.cdf=[0]*len(w)\\n for i in range(len(w)):\\n self.prob[i]=w[i]/self.total\\n if i==0:\\n self.cdf[i]=self.prob[i]\\n else:\\n self.cdf[i]=self.prob[i]+self.cdf[i-1]\\n\\n def pickIndex(self) -> int:\\n # randomly sample from [0,1] to to select from w\\n self.unif=random.random()\\n # select w based on sample\\n # can modified to binary search to look for the index of w\\n res=0\\n while self.cdf[res]<self.unif:\\n res+=1\\n return res\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\\n\\n#w=[1,3], prob=[.25,.75], cdf=[.25,1], unif=.1, res=0, unif=.25, res=0, unif=.5, res=1, unif=1, res=\",\n \"runtime\": \"2576\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n import random\\n Total = sum(w)\\n self.w = [sub/Total for sub in w]\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i-1] \\n \\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0, 1)\\n \\n flag = 1\\n index = -1\\n while flag:\\n index += 1\\n if N <=self.w[index]:\\n flag = 0\\n \\n return index\\n\\n \\n\\n \\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2628\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n csum = 0\\n self.probList = []\\n for v in w:\\n csum += v\\n probSum = 0\\n for v in w:\\n probSum += v / csum\\n self.probList.append(probSum)\\n \\n\\n\\n \\n\\n def pickIndex(self) -> int:\\n rnd = random.random()\\n\\n for i in range(len(self.probList)):\\n val = self.probList[i]\\n\\n if (val >= rnd):\\n return i\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2628\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n sums =sum(self.w)\\n # print(sums)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / sums\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i-1]\\n # print(self.w)\\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0,1)\\n flag = 1\\n idx = -1\\n while flag:\\n idx += 1\\n if N <= self.w[idx]:\\n flag = 0\\n return idx\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2680\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = sum(w)\\n self.w = w\\n for j in range(len(w)):\\n self.w[j] = self.w[j]/self.total\\n for i in range(1,len(w)):\\n self.w[i]= self.w[i]+self.w[i-1]\\n \\n\\n def pickIndex(self) -> int:\\n randomNumber = random.uniform(0,1)\\n flag = True\\n i = 0\\n while flag:\\n if randomNumber<= self.w[i]:\\n flag = False\\n else:\\n i+=1\\n return i\\n\\n\\n\\n \\n\\n\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2680\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0,1)\\n flag = 1\\n index = -1\\n while flag:\\n index +=1 \\n if N <= self.w[index]:\\n flag = 0\\n return index\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2733\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\t\\t# 1. calculate relative frequency\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n # 2. put relative frequencies on the number line between 0 and 1\\n\\t\\t# Note self.w[-1] = 1\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n\\t\\t\\n\\t\\t# this is where we pick the index\\n N = random.uniform(0,1)\\n \\n flag = 1\\n index = -1\\n \\n\\t\\t# test each region of the numberline to see if N falls in it, if it \\n\\t\\t# does not then go to the next index and check if N falls in it\\n\\t\\t# this is gaurenteed to break because of previous normalization\\n while flag:\\n index +=1 \\n \\n \\n \\n if N <= self.w[index]:\\n flag = 0\\n \\n \\n return index\\n\\n # def __init__(self, w: List[int]):\\n # self.w = w\\n # self.total = sum(w)\\n\\n # def pickIndex(self) -> int:\\n # x = random.uniform(0, 1) * self.total\\n\\n # s = 0\\n # i = 0\\n # while i < len(self.w):\\n # if s <= x <= s + self.w[i]:\\n # return i\\n # s += self.w[i]\\n # i += 1\\n\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2733\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\t\\t# 1. calculate relative frequency\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n # 2. put relative frequencies on the number line between 0 and 1\\n\\t\\t# Note self.w[-1] = 1\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n\\n def pickIndex(self) -> int:\\n # this is where we pick the index\\n N = random.uniform(0,1)\\n \\n flag = 1\\n index = -1\\n \\n\\t\\t# test each region of the numberline to see if N falls in it, if it \\n\\t\\t# does not then go to the next index and check if N falls in it\\n\\t\\t# this is gaurenteed to break because of previous normalization\\n while flag:\\n index +=1 \\n if N <= self.w[index]:\\n flag = 0\\n return index\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2785\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.w = w\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n\\n N = random.uniform(0,1)\\n flag = 1\\n index = -1\\n \\n while flag:\\n index +=1 \\n if N <= self.w[index]:\\n flag = 0\\n return index\",\n \"runtime\": \"2785\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\t\\t# 1. calculate relative frequency\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n # 2. put relative frequencies on the number line between 0 and 1\\n\\t\\t# Note self.w[-1] = 1\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n\\t\\t\\n\\t\\t# this is where we pick the index\\n N = random.uniform(0,1)\\n \\n flag = 1\\n index = -1\\n \\n\\t\\t# test each region of the numberline to see if N falls in it, if it \\n\\t\\t# does not then go to the next index and check if N falls in it\\n\\t\\t# this is gaurenteed to break because of previous normalization\\n while flag:\\n index +=1 \\n \\n \\n \\n if N <= self.w[index]:\\n flag = 0\\n \\n \\n return index\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2837\"\n },\n {\n \"code\": \"# used for random number generation\\nimport random\\n\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\t\\t# 1. calculate relative frequency\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n # 2. put relative frequencies on the number line between 0 and 1\\n\\t\\t# Note self.w[-1] = 1\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n N = random.uniform(0,1)\\n \\n flag = 1\\n index = -1\\n \\n while flag:\\n index +=1 \\n if N <= self.w[index]:\\n flag = 0 \\n return index\\n\\n\\n\",\n \"runtime\": \"2837\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight = w\\n denom = sum(self.weight)\\n for i in range(len(self.weight)):\\n self.weight[i] = self.weight[i] / denom\\n for i in range(1, len(self.weight)):\\n self.weight[i] += self.weight[i-1]\\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0,1)\\n flag = 1\\n index = -1\\n\\n while flag:\\n index += 1\\n\\n if N <= self.weight[index]:\\n flag = 0\\n return index\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2890\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.sumVals = sum(w)\\n self.probability = [k/self.sumVals for k in w]\\n self.probability = [sum(self.probability[:k+1]) for k in range(len(w))]\\n\\n\\n def pickIndex(self) -> int:\\n random_val = random.random()\\n for i, v in enumerate(self.probability):\\n if random_val <= v:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2890\"\n },\n {\n \"code\": \"import random\\nimport numpy as np\\n\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\t\\t# 1. calculate relative frequency\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n # 2. put relative frequencies on the number line between 0 and 1\\n\\t\\t# Note self.w[-1] = 1\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n\\t\\t\\n\\t\\t# this is where we pick the index\\n N = random.uniform(0,1)\\n \\n flag = 1\\n index = -1\\n \\n\\t\\t# test each region of the numberline to see if N falls in it, if it \\n\\t\\t# does not then go to the next index and check if N falls in it\\n\\t\\t# this is gaurenteed to break because of previous normalization\\n while flag:\\n index +=1 \\n \\n \\n \\n if N <= self.w[index]:\\n flag = 0\\n \\n \\n return index\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2942\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.prefix = [0] * len(w)\\n self.prefix[0] = w[0]\\n for i in range(1, len(w)):\\n self.prefix[i] = self.prefix[i-1] + w[i]\\n\\n self.totalweight = self.prefix[-1]\\n\\n def pickIndex(self) -> int:\\n prob = randint(1, self.totalweight)\\n # print(self.totalweight)\\n # print(self.prefix)\\n # print(prob)\\n i = 0\\n while (self.prefix[i] < prob):\\n i+=1\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2942\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.probability = [w / sum(self.w) for w in self.w]\\n for i in range(0, len(self.probability)-1):\\n self.probability[i+1] += self.probability[i]\\n\\n def pickIndex(self) -> int:\\n import random\\n chance = random.random()\\n for i in range(0, len(self.probability)-1):\\n if chance < self.probability[i]:\\n return i \\n return len(self.probability) - 1\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2994\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n\\n self.w = w\\n # calculate the relative frequency\\n normalization = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i]/normalization\\n\\n # find cumulative summation\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n \\n # this is where we pick the index\\n N = np.random.uniform()\\n\\n flag = 1\\n index = -1\\n\\n while flag:\\n index +=1\\n if N <= self.w[index]:\\n flag = 0\\n \\n return index\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"2994\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n sumw = sum(w)\\n self.probab = [w[i]/sumw for i in range(len(w))]\\n self.current = [0] * (len(w))\\n self.picks = 0\\n\\n def pickIndex(self) -> int:\\n self.picks += 1\\n for i,p in enumerate(self.current):\\n if self.probab[i] > p / self.picks:\\n self.current[i] += 1 \\n return i\\n else:\\n return 0\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3046\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n accumulated_sum = w.copy()\\n for i in range(1, len(w)):\\n accumulated_sum[i] += accumulated_sum[i-1]\\n self.accumulated_sum = [a/sum(w) for a in accumulated_sum]\\n print(self.accumulated_sum)\\n\\n def pickIndex(self) -> int:\\n # find index one by one\\n import random\\n p = random.random()\\n index = -1\\n for i in range(len(self.accumulated_sum)):\\n if p <= self.accumulated_sum[i]:\\n index = i\\n break\\n return index\\n # bisect\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3046\"\n },\n {\n \"code\": \"import math\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\n preSum = [0] * (len(w) + 1)\\n \\n for i in range(len(w)):\\n preSum[i + 1] = preSum[i] + w[i]\\n\\n self.preSum = preSum\\n \\n\\n def pickIndex(self) -> int:\\n if len(self.w) == 1:\\n return 0\\n rNum = math.floor(random.random() * self.preSum[len(self.preSum) - 1]) \\n for i in range(len(self.preSum) - 1):\\n if self.preSum[i + 1] > rNum:\\n return i\\n\\n return 0\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3099\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\t\\t# 1. calculate relative frequency\\n denom = sum(self.w)\\n for i in range(len(self.w)):\\n self.w[i] = self.w[i] / denom\\n # 2. put relative frequencies on the number line between 0 and 1\\n\\t\\t# Note self.w[-1] = 1\\n for i in range(1,len(self.w)):\\n self.w[i] += self.w[i-1]\\n \\n def pickIndex(self) -> int:\\n\\t\\t\\n\\t\\t# this is where we pick the index\\n N = random.uniform(0,1)\\n \\n flag = 1\\n index = -1\\n \\n\\t\\t# test each region of the numberline to see if N falls in it, if it \\n\\t\\t# does not then go to the next index and check if N falls in it\\n\\t\\t# this is gaurenteed to break because of previous normalization\\n while flag:\\n index +=1 \\n \\n \\n \\n if N <= self.w[index]:\\n flag = 0\\n \\n \\n return index\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3099\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = sum(w)\\n # 4 -> random [1,2,3,4]\\n # 1 -> 0\\n # 2,3,4 -> 1\\n\\n self.freqs = {}\\n start = 1\\n for i, weight in enumerate(w):\\n range_of_index = (start, start + weight - 1)\\n self.freqs[range_of_index] = i\\n start += weight\\n\\n def pickIndex(self) -> int:\\n r = random.randint(1, self.total)\\n for ranges in self.freqs:\\n if ranges[0] <= r <= ranges[1]:\\n return self.freqs[ranges]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3151\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = sum(w)\\n self.ranges = []\\n cur = 0\\n for i in w:\\n cur += i\\n self.ranges.append(cur)\\n\\n def pickIndex(self) -> int:\\n ran = random.randint(1, self.total)\\n prev = 0\\n\\n for i, prob in enumerate(self.ranges):\\n if prev < ran and ran <= prob:\\n return i\\n prev = prob\\n return i\\n \\n# [1, 4]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3151\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.prob = np.array(w) / np.sum(np.array(w))\\n self.n = np.arange(len(w))\\n\\n def pickIndex(self) -> int:\\n return np.random.choice(self.n, 1, p=self.prob)[0]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3203\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.probability_dist = []\\n\\n for i in w:\\n self.probability_dist.append(i/sum(w))\\n\\n self.cdf = []\\n start = 0\\n for i in self.probability_dist:\\n start += i\\n self.cdf.append(start)\\n\\n def pickIndex(self) -> int:\\n random_num = random.random()\\n \\n # Step 3: Find the index corresponding to the random number\\n for i, value in enumerate(self.cdf):\\n if random_num <= value:\\n return i\\n \\n# probability to pick the index is value / sum(values) and now we have to make it random to choose an index...\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3203\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n # construct cdf\\n norm = sum(w)\\n total = 0\\n cdf = [0] * (len(w))\\n for i, weight in enumerate(w):\\n cdf[i]=total\\n total+=weight/norm\\n self.cdf = cdf\\n print(cdf)\\n self.n = len(w)\\n def pickIndex(self) -> int:\\n p = random.uniform(0,1)\\n i=0\\n # print(self.cdf)\\n # could do a binary search here to speed things up\\n while(i<self.n and p>self.cdf[i]):\\n #print(self.cdf[i])\\n i+=1\\n return(i-1) \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3255\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.CDF= [ w[0] ]\\n for i in range(1, len(w)):\\n self.CDF.append( self.CDF[i-1]+w[i] )\\n \\n\\n def pickIndex(self) -> int:\\n seed = randint(1, self.CDF[-1])\\n ind = 0\\n n = len(self.CDF)\\n while ind < n:\\n if seed <= self.CDF[ind]:\\n return ind\\n ind += 1\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3255\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w=w\\n self.index_list = [i for i in range(len(w))]\\n \\n\\n def pickIndex(self) -> int:\\n\\n return random.choices(self.index_list, weights =self.w)[0]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3308\"\n },\n {\n \"code\": \"import random\\n\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weights = w\\n \\n def pickIndex(self) -> int:\\n return random.choices(range(len(self.weights)), self.weights)[0]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3308\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self._weights = w\\n\\n def pickIndex(self) -> int:\\n return choices(range(len(self._weights)), self._weights)[0]\\n\",\n \"runtime\": \"3360\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\n def pickIndex(self) -> int:\\n return random.choices(range(len(self.w)), weights=self.w)[0]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3360\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight = w\\n self.numbers = list(range(len(w)))\\n\\n def pickIndex(self) -> int:\\n return random.choices(self.numbers, weights=self.weight, k=1)[0]\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3412\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight_sum = []\\n temp = 0\\n for weight in w:\\n temp += weight\\n self.weight_sum.append(temp)\\n\\n self.total_weight = temp\\n \\n def pickIndex(self):\\n rand_weight = random.random() * self.total_weight\\n for ix, weight in enumerate(self.weight_sum):\\n if rand_weight < weight:\\n return ix\\n\\n \\n\\n\",\n \"runtime\": \"3412\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefixSums = []\\n sumSoFar = 0\\n for i in range(0, len(w)):\\n sumSoFar += w[i]\\n self.prefixSums.append(sumSoFar)\\n self.n = len(self.prefixSums)\\n self.totalSum = sumSoFar\\n\\n def pickIndex(self) -> int:\\n target = self.totalSum * random.random() #random.randint(1, self.n)\\n # get first smaller index\\n for i in range(0, self.n):\\n if target < self.prefixSums[i]:\\n return i\\n return self.n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3464\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sums = []\\n prefix_sum = 0\\n for weight in w:\\n prefix_sum += weight\\n self.prefix_sums.append(prefix_sum)\\n self.total_sum = prefix_sum\\n\\n def pickIndex(self) -> int:\\n \\\"\\\"\\\"\\n :rtype: int\\n \\\"\\\"\\\"\\n target = self.total_sum * random.random()\\n # run a linear search to find the target zone\\n for i, prefix_sum in enumerate(self.prefix_sums):\\n if target < prefix_sum:\\n return i\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3464\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sums = []\\n prefix_sum = 0\\n for weight in w:\\n prefix_sum += weight\\n self.prefix_sums.append(prefix_sum)\\n self.total_sum = prefix_sum\\n\\n\\n def pickIndex(self) -> int:\\n target = self.total_sum * random.random()\\n for i, prefix_sum in enumerate(self.prefix_sums):\\n if target < prefix_sum:\\n return i\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3517\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n\\n self.prob = [i/sum(w) for i in w]\\n\\n for i in range(1, len(self.prob)):\\n self.prob[i] += self.prob[i-1]\\n \\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0, 1)\\n\\n for index, weight in enumerate(self.prob):\\n if N <= weight:\\n return index\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3517\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n for i in range(1,len(w)):\\n w[i] = w[i-1] + w[i]\\n self.w = w\\n\\n def pickIndex(self) -> int:\\n import random\\n x = random.random() * self.w[-1]\\n #x = random.randint(0, self.w[-1])\\n for i in range(len(self.w)):\\n if x <= self.w[i]:\\n return i\\n return None\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3569\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sum = []\\n total = 0 \\n for i in w: \\n total += i\\n self.prefix_sum.append(total)\\n \\n self.total = total \\n \\n \\n def pickIndex(self) -> int:\\n target = random.uniform(0, self.total)\\n print(self.total)\\n print(target)\\n for idx, prefix_num in enumerate(self.prefix_sum):\\n if target < prefix_num:\\n return idx\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3569\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n # Keep copy of numbers\\n # Time: O(1)\\n # Space: O(1) (not counting existing allocation)\\n self.numbers = w\\n\\n def pickIndex(self) -> int:\\n # Return a random, weighted choice\\n # Time: O(1)\\n # Space: O(1) (range() always uses the same amount of space)\\n return random.choices(range(len(self.numbers)), weights=self.numbers)[0]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3621\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.sum = sum(w)\\n self.weights = w\\n\\n self.cumulative = []\\n cumulative_sum = 0\\n for i, weight in enumerate(self.weights):\\n cumulative_sum += weight\\n self.cumulative.append(cumulative_sum)\\n\\n def pickIndex(self) -> int:\\n random_index = self.sum * random.random()\\n for i, s in enumerate(self.cumulative):\\n if random_index < s:\\n return i\\n return None\\n\\n\\n# have sum\\n# pick index -> \\n\\n# weights = [1,3,5]\\n# sum = 9\\n\\n# pick=1,2,3,4,5,6,7,8,9\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3621\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n s = sum(w)\\n self.w = w\\n for i in range(len(w)):\\n self.w[i] = w[i]/s\\n\\n def pickIndex(self) -> int:\\n k = random.random()\\n s=0\\n for i,v in enumerate(self.w):\\n s +=v\\n if k<=s:\\n return i\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3673\"\n },\n {\n \"code\": \"class Solution:\\n import random\\n def __init__(self, w: List[int]):\\n self.prob_weight = w\\n self.sum = sum(w)\\n\\n def pickIndex(self) -> int:\\n # index = random.choices([i for i in range(len(self.prob_weight))], self.prob_weight)\\n pick = random.randint(1, self.sum)\\n for i, val in enumerate(self.prob_weight):\\n if pick <= val:\\n return i\\n else:\\n pick = pick-val\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3673\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.s = sum(w)\\n self.w = w\\n\\n def pickIndex(self) -> int:\\n r = random.randint(0, self.s - 1)\\n\\n for i in range(len(self.w)):\\n r -= self.w[i]\\n if r < 0:\\n return i\\n \\n return len(self.w) - 1\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3726\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.sum_w = sum(self.w)\\n arr = []\\n idx = []\\n for i, num in enumerate(self.w):\\n arr.append(num / self.sum_w)\\n idx.append(i)\\n self.arr = arr\\n self.idx = idx\\n\\n def pickIndex(self) -> int:\\n return random.choices(self.idx, self.arr)[0]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3726\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n W = []\\n total = 0\\n for weight in w:\\n total+=weight\\n W.append(total)\\n self.W = W\\n \\n\\n def pickIndex(self) -> int:\\n r = random.uniform(0,self.W[-1])\\n sorted_list = sorted(self.W + [r])\\n i = sorted_list.index(r)\\n return i\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3883\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix = []\\n self.prev = 0\\n for n in w:\\n self.prev += n\\n self.prefix.append(self.prev)\\n self.total = self.prev\\n \\n\\n\\n def pickIndex(self) -> int:\\n target = self.total * random.random()\\n for i,n in enumerate(self.prefix):\\n if n > target:\\n return i\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3883\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n \\n self.w = []\\n sum_w = sum(w)\\n for i in range(len(w)):\\n self.w.append(w[i] / sum_w)\\n self.cumsum_w = []\\n cumsum = 0\\n for i in range(len(self.w)):\\n cumsum += self.w[i]\\n self.cumsum_w.append(cumsum)\\n \\n\\n def pickIndex(self) -> int:\\n \\n a = random.uniform(0, 1)\\n for i in range(len(self.w)):\\n if self.cumsum_w[i] - a > 0:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3935\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sum = 0\\n self.prefix_array = []\\n\\n for num in w:\\n self.prefix_sum += num\\n self.prefix_array.append(self.prefix_sum)\\n\\n def pickIndex(self) -> int:\\n pick = self.prefix_array[-1] * random.random()\\n\\n for idx, num in enumerate(self.prefix_array):\\n if num > pick:\\n return idx\\n \\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3935\"\n },\n {\n \"code\": \"class Solution:\\n\\n import random \\n def __init__(self, w: List[int]):\\n self.nums = w\\n self.map = {}\\n end = -1\\n for idx,num in enumerate(self.nums):\\n st = end +1\\n end = st + num -1\\n self.map[(st,end)] = idx \\n\\n def pickIndex(self) -> int:\\n val = random.randint(0,sum(self.nums)-1)\\n for key in self.map:\\n if key[0]<= val <= key[1]:\\n return self.map[key]\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3987\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, w: List[int]):\\n self.weights = w\\n self.sum = sum(self.weights)\\n\\n def pickIndex(self) -> int:\\n pick = random.randint(0, self.sum - 1)\\n curr = 0\\n\\n for i, weight in enumerate(self.weights):\\n curr += weight\\n if pick < curr:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"3987\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nKey: imagine drop a dart to a line with the length of 1. \\nThis line is connected bz multiple small lines. Since the drop point of the dart uniformly range from 0 to 1,\\naka anywhere, so the probablity that the dart is located in one small line is equal to its length. There is no need to shuffle the small lines.\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.w_sum = sum(w)\\n self.p_w = [ v/self.w_sum for v in w ]\\n\\n def pickIndex(self) -> int:\\n rand_vale = random.random()\\n p_accu = 0\\n for idx, p in enumerate( self.p_w ):\\n if p_accu + p >= rand_vale:\\n break\\n else:\\n p_accu += p\\n return idx\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4039\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, weights: List[int]):\\n self.total_weights = sum(weights)\\n self.random_thresholds = []\\n running_weight = 0\\n for weight in weights:\\n running_weight += weight\\n self.random_thresholds.append((running_weight, weight))\\n\\n def pickIndex(self) -> int:\\n rand = random.random() * self.total_weights\\n for i, (random_threshold, weight) in enumerate(self.random_thresholds):\\n if rand < random_threshold:\\n return i\\n return len(self.random_thresholds) - 1\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4039\"\n },\n {\n \"code\": \"class Solution:\\n\\n import random \\n def __init__(self, w: List[int]):\\n self.nums = w\\n self.map = {}\\n end = -1\\n for idx,num in enumerate(self.nums):\\n st = end +1\\n end = st + num -1\\n self.map[(st,end)] = idx\\n print(self.map)\\n \\n\\n def pickIndex(self) -> int:\\n val = random.randint(0,sum(self.nums)-1)\\n for key in self.map:\\n if key[0]<= val <= key[1]:\\n return self.map[key]\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4092\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sums = []\\n run_sum = 0\\n for ele in w:\\n run_sum += ele\\n self.prefix_sums.append(run_sum)\\n self.total_sum = run_sum\\n\\n\\n def pickIndex(self) -> int:\\n target = self.total_sum * random.random()\\n for i, val in enumerate(self.prefix_sums):\\n if target<self.prefix_sums[i]:\\n return i\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4092\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n #iterate w\\n #get sum of elem \\n self.s = 0\\n self.accum_list = []\\n for item in w:\\n self.s += item\\n self.accum_list.append(self.s)\\n\\n def pickIndex(self) -> int:\\n rand_n = random.random() * self.s\\n for i,p in enumerate(self.accum_list):\\n if rand_n < self.accum_list[i]:\\n return i\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4144\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weights = w\\n self.total = sum(self.weights)\\n\\n def pickIndex(self) -> int:\\n d = random.randint(0,self.total-1)\\n temp = 0\\n for i in range(len(self.weights)):\\n w = self.weights[i]\\n temp += w \\n if temp > d:\\n return i\\n \\n\\n\\n\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4144\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.totalWeight = sum(self.w)\\n \\n\\n def pickIndex(self) -> int:\\n rand = random.randrange(1, self.totalWeight+1)\\n i = 0\\n while True:\\n rand -= self.w[i]\\n if rand <= 0:\\n return i\\n i += 1\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4196\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight = w\\n self.total = sum(w)\\n\\n def pickIndex(self) -> int:\\n num = random.randrange(0, self.total)\\n # num = 5\\n for idx in range(len(self.weight)):\\n if num < self.weight[idx]:\\n return idx\\n num -= self.weight[idx]\\n return 0\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4196\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = range(len(w))\\n self.p = [i/sum(w) for i in w]\\n\\n def pickIndex(self) -> int:\\n return random.choices(self.w, weights=self.p)[0]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4248\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weight = []\\n self.total = sum(w)\\n if self.total < 400000000:\\n for idx in range(len(w)):\\n self.weight.extend([idx]*w[idx])\\n else:\\n self.weight = w\\n\\n def pickIndex(self) -> int:\\n if self.total < 400000000:\\n return random.choice(self.weight)\\n else:\\n num = random.randrange(self.total)\\n for idx in range(len(self.weight)):\\n if num < self.weight[idx]:\\n return idx\\n num -= self.weight[idx]\\n return 0\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"runtime\": \"4248\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":142,"string":"142"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n\n weight_sum = sum(w)\n\n for i in range(len(w)):\n self.w[i]/=weight_sum\n \n for i in range(1,len(w)):\n self.w[i]+=self.w[i-1]\n\n\n\n def pickIndex(self) -> int:\n N = random.uniform(0,1)\n \n i = -1\n\n while i<len(self.w):\n i +=1\n if N <self.w[i]:\n break\n \n return i\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"19200"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sums = []\n prefix_sum = 0\n for weight in w:\n prefix_sum += weight\n self.prefix_sums.append(prefix_sum)\n self.total_sum = prefix_sum\n\n def pickIndex(self) -> int:\n \"\"\"\n :rtype: int\n \"\"\"\n target = self.total_sum * random.random()\n # run a linear search to find the target zone\n for i, prefix_sum in enumerate(self.prefix_sums):\n if target < prefix_sum:\n return i\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"19500"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n prefixSum = 0\n self.prefixSum = []\n \n for weight in w:\n prefixSum += weight\n self.prefixSum.append(prefixSum)\n \n self.totalSum = prefixSum\n \n def pickIndex(self) -> int:\n target = self.totalSum * random.random()\n for i in range(len(self.prefixSum)):\n if target < self.prefixSum[i]:\n return i\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"19600"},{"code":"\"\"\"\nKey: imagine drop a dart to a line with the length of 1. \nThis line is connected bz multiple small lines. Since the drop point of the dart uniformly range from 0 to 1,\naka anywhere, so the probablity that the dart is located in one small line is equal to its length. There is no need to shuffle the small lines.\n\"\"\"\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n w_accu = []\n accu_value = 0\n for v in w:\n accu_value += v\n w_accu.append( accu_value )\n self.w_accu = w_accu\n\n def pickIndex(self) -> int:\n rand_value = random.random() * self.w_accu[-1]\n for pos, accu_value in enumerate( self.w_accu):\n if accu_value >= rand_value:\n break\n return pos\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"19700"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix = []\n prefix = 0\n for weight in w:\n prefix +=weight\n self.prefix.append(prefix)\n self.total = prefix\n\n def pickIndex(self) -> int:\n target = self.total * random.random()\n for i,prefix in enumerate(self.prefix):\n if target<prefix:\n return i\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"19800"},{"code":"class Solution:\n def __init__(self, weights: List[int]):\n self.prefix_sum = []\n curr_sum = 0\n self.total_sum = 0\n for i, num in enumerate(weights):\n curr_sum += num\n self.prefix_sum.append(curr_sum)\n self.total_sum = curr_sum\n\n def pickIndexLinearSearch(self) -> int:\n target = self.total_sum * random.random()\n\n for i, total in enumerate(self.prefix_sum):\n if target < self.prefix_sum[i]:\n return i\n\n def pickIndex(self) -> int:\n target = self.total_sum * random.random()\n\n left, right = 0, len(self.prefix_sum) - 1\n\n while left < right:\n mid = left + (right - left) // 2\n if target > self.prefix_sum[mid]:\n left = mid + 1\n else:\n right = mid\n\n return right\n","memory":"19900"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.weights = [p*1.0/sum(w) for p in w]\n\n def pickIndex(self) -> int:\n import random\n return random.choices([i for i in range(len(self.weights))], self.weights, k=1)[0]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20000"},{"code":"from random import uniform\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.probs = [x / sum(w) for x in w]\n # self.w = w\n\n def pickIndex(self) -> int:\n rand_num = uniform(0, 1)\n for index, prob in enumerate(self.probs):\n if rand_num <= prob:\n return index\n rand_num -= prob\n return index\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20100"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.cumulative_sum = []\n prefix_sum = 0\n for number in w:\n prefix_sum += number\n self.cumulative_sum.append(prefix_sum)\n self.total_sum = prefix_sum\n #print(self.cumulative_sum)\n\n def pickIndex(self) -> int:\n # generate numbers from 0 to total_sum\n random_number = self.total_sum * random.random()\n # method 1: linear search with O(N)\n #for index, value in enumerate(self.cumulative_sum):\n # if random_number < value:\n # return index\n # method 2: binary search with O(logN)\n low, high = 0, len(self.cumulative_sum)\n while low < high:\n mid = (low+high)//2\n if random_number < self.cumulative_sum[mid]:\n high = mid\n else:\n low = mid + 1\n return low\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20200"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n denom = sum(self.w)\n for i in range(len(w)):\n self.w[i] = self.w[i] / denom\n\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i-1]\n\n def pickIndex(self) -> int:\n n = random.uniform(0,1)\n\n flag = 1\n idx = -1\n\n while flag:\n idx += 1\n if n <= self.w[idx]:\n flag = 0\n\n return idx\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20300"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total=sum(w)\n self.arr=[]\n s=0\n for weight in w:\n s+=weight\n self.arr.append(s)\n\n def pickIndex(self) -> int:\n target=self.total*random.random()\n for index,v in enumerate(self.arr):\n if target<v: return index\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20400"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefixSums = []\n sumSoFar = 0\n for i in range(0, len(w)):\n sumSoFar += w[i]\n self.prefixSums.append(sumSoFar)\n self.n = len(self.prefixSums)\n self.totalSum = sumSoFar\n\n def pickIndex(self) -> int:\n target = self.totalSum * random.random() #random.randint(1, self.n)\n # get first smaller index\n for i in range(0, self.n):\n if target < self.prefixSums[i]:\n return i\n return self.n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20500"},{"code":"class Solution:\n\n def __init__(self, weights: List[int]):\n self.total_weight = 0\n self.cum_weights = []\n for w in weights:\n self.total_weight += w\n self.cum_weights.append(self.total_weight)\n\n def pickIndex(self) -> int:\n target = self.total_weight * random.random()\n low, high = 0, len(self.cum_weights)\n while low < high:\n mid = low + (high - low) // 2\n if target > self.cum_weights[mid]:\n low = mid + 1\n else:\n high = mid\n return low\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20600"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix = [0]*(len(w)+1)\n for i,v in enumerate(w):\n self.prefix[i+1] = v+self.prefix[i]\n self.maxVal = self.prefix[-1]\n \n \n \n\n def pickIndex(self) -> int:\n index = random.randint(0, self.maxVal-1)\n #print(self.maxVal)\n #print(self.prefix)\n #print(index)\n l,h = 1, len(self.prefix)-1\n while(l<=h):\n mid = l+(h-l)//2\n #print(mid,self.prefix,index)\n if(self.prefix[mid]>index and self.prefix[mid-1]<=index):\n # found \n return mid-1\n elif(self.prefix[mid-1]>index):\n # need to decrese\n h = mid-1\n else:\n l = mid+1\n return -1\n\n \n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20700"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.sumw = sum(w)\n for i in range(1, len(self.w)):\n self.w[i] += self.w[i-1]\n\n # print(self.w)\n \n\n def pickIndex(self) -> int:\n N = random.uniform(0, self.sumw)\n\n index = 0\n while index < len(self.w):\n if N <= self.w[index]:\n return index\n index += 1\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20800"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = sum(w)\n self.w = w\n\n def pickIndex(self) -> int:\n random_weight = random.random() * self.total\n curr_sum = 0\n for i in range(len(self.w)):\n curr_sum += self.w[i]\n if curr_sum >= random_weight:\n return i\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"20900"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.total = sum(w)\n self.w = w\n\n def pickIndex(self) -> int:\n random_weight = random.random() * self.total\n curr_sum = 0\n for i in range(len(self.w)):\n curr_sum += self.w[i]\n if curr_sum >= random_weight:\n return i\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21000"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n import random\n self.prefix_sums = []\n current_sum = 0\n for weight in w:\n current_sum += weight\n self.prefix_sums.append(current_sum)\n self.total_sum = current_sum\n\n def pickIndex(self) -> int:\n target = random.randint(1, self.total_sum)\n # Binary search to find the target zone\n low, high = 0, len(self.prefix_sums) - 1\n while low < high:\n mid = (low + high) // 2\n if target > self.prefix_sums[mid]:\n low = mid + 1\n else:\n high = mid\n return low\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21000"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sum = []\n self.total_sum = 0\n for weight in w:\n self.total_sum += weight\n self.prefix_sum.append(self.total_sum)\n\n\n def pickIndex(self) -> int:\n\n target = self.total_sum * random.random()\n for i, prefix in enumerate(self.prefix_sum):\n if target < prefix:\n return i\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21100"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sum = []\n self.total_sum = 0\n for weight in w:\n self.total_sum += weight\n self.prefix_sum.append(self.total_sum)\n\n\n def pickIndex(self) -> int:\n\n target = self.total_sum * random.random()\n for i, prefix in enumerate(self.prefix_sum):\n if target < prefix:\n return i\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21100"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n for i in range(1,len(w)):\n w[i] += w[i-1]\n self.prefix_sum = w\n\n def pickIndex(self) -> int:\n from bisect import bisect_left\n from random import randint\n\n guess = randint(1,self.prefix_sum[-1])\n print(guess)\n\n return bisect_left(self.prefix_sum,guess)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21200"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.p_s = [0] * (len(w) + 1)\n for i in range(1, len(w)+1):\n self.p_s[i] = self.p_s[i-1] + w[i-1]\n self.p_s.pop(0)\n\n def pickIndex(self) -> int:\n num = random.randint(1, self.p_s[-1])\n l, h = 0, len(self.p_s)\n while l < h:\n m = (l + h) // 2\n if num > self.p_s[m]:\n l = m + 1\n else:\n h = m \n return l\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21200"},{"code":"# import random\n# class Solution:\n\n# def __init__(self, w: List[int]):\n# self.w = w\n# self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\n# self.total_weight = self.cumm_sum[-1]\n\n# def pickIndex(self) -> int:\n# target = random.uniform(0, self.total_weight)\n# index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\n# return index\n\n# def bisect_left(self, low, high, arr, target) -> int:\n# \"\"\"\n \n# \"\"\"\n# if low <0:\n# raise ValueError('lo must be non-negative')\n# if high==None:\n# high = len(arr)\n# while low < high:\n# mid = (low + high) //2\n# if arr[mid]<target:\n# low = mid+1\n# else:\n# high = mid\n# return low\n\n# # Your Solution object will be instantiated and called as such:\n# # obj = Solution(w)\n# # param_1 = obj.pickIndex()\n\nimport random\n\nclass Solution:\n\n def __init__(self, w):\n self.prefix_sums = []\n total = 0\n for weight in w:\n total += weight\n self.prefix_sums.append(total)\n self.total_weight = total\n\n def bisect_left(self, a, x):\n lo = 0\n hi = len(a)\n while lo < hi:\n mid = (lo + hi) // 2\n if a[mid] < x:\n lo = mid + 1\n else:\n hi = mid\n return lo\n\n def pickIndex(self):\n target = random.uniform(0, self.total_weight)\n index = self.bisect_left(self.prefix_sums, target)\n return index\n","memory":"21300"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\n self.total_weight = self.cumm_sum[-1]\n\n def pickIndex(self) -> int:\n target = random.uniform(0, self.total_weight)\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\n return index\n\n def bisect_left(self, low, high, arr, target) -> int:\n \"\"\"\n \n \"\"\"\n while low < high:\n mid = (low + high) //2\n if arr[mid]<target:\n low = mid+1\n else:\n high = mid\n return low\n\n# # Your Solution object will be instantiated and called as such:\n# # obj = Solution(w)\n# # param_1 = obj.pickIndex()\n\n# import random\n\n# class Solution:\n\n# def __init__(self, w):\n# self.prefix_sums = []\n# total = 0\n# for weight in w:\n# total += weight\n# self.prefix_sums.append(total)\n# self.total_weight = total\n\n# def bisect_left(self, a, x):\n# lo = 0\n# hi = len(a)\n# while lo < hi:\n# mid = (lo + hi) // 2\n# if a[mid] < x:\n# lo = mid + 1\n# else:\n# hi = mid\n# return lo\n\n# def pickIndex(self):\n# target = random.uniform(0, self.total_weight)\n# index = self.bisect_left(self.prefix_sums, target)\n# return index\n","memory":"21300"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.prefix_sum = [w[0]]\n for i in range(1, len(w)):\n self.prefix_sum.append(w[i] + self.prefix_sum[-1])\n self.total = sum(w)\n self.original = w\n\n def pickIndex(self) -> int:\n index = random.randint(1, self.total)\n\n l = 0\n r = len(self.prefix_sum) - 1\n while l <= r:\n m = (l + r) // 2\n mid = self.prefix_sum[m]\n # print(\"!\", mid)\n if mid == index:\n return m\n if index > mid:\n l = m + 1\n else:\n r = m - 1\n # print(l)\n # print(self.original)\n # print(self.prefix_sum)\n # print(index)\n return l\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21400"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\n self.total_weight = self.cumm_sum[-1]\n print(self.total_weight)\n\n def pickIndex(self) -> int:\n target = random.uniform(0, self.total_weight)\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\n return index\n\n def bisect_left(self, low, high, arr, target) -> int:\n \"\"\"\n \n \"\"\"\n if low <0:\n raise ValueError('lo must be non-negative')\n if high==None:\n high = len(arr)\n while low < high:\n mid = (low + high) //2\n if arr[mid]<target:\n low = mid+1\n else:\n high = mid\n return low\n\n# # Your Solution object will be instantiated and called as such:\n# # obj = Solution(w)\n# # param_1 = obj.pickIndex()\n\n# import random\n\n# class Solution:\n\n# def __init__(self, w):\n# self.prefix_sums = []\n# total = 0\n# for weight in w:\n# total += weight\n# self.prefix_sums.append(total)\n# self.total_weight = total\n\n# def bisect_left(self, a, x):\n# lo = 0\n# hi = len(a)\n# while lo < hi:\n# mid = (lo + hi) // 2\n# if a[mid] < x:\n# lo = mid + 1\n# else:\n# hi = mid\n# return lo\n\n# def pickIndex(self):\n# target = random.uniform(0, self.total_weight)\n# index = self.bisect_left(self.prefix_sums, target)\n# return index\n","memory":"21400"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n s = sum(w)\n w = [v/s for v in w]\n for i in range(1, len(w)):\n w[i] += w[i-1]\n self.w = w\n print(self.w)\n \n\n def pickIndex(self) -> int:\n rn = random.random()\n # find first index >=r\n l, r = 0, len(self.w)\n while l<=r:\n mid = (l+r)//2\n if self.w[mid]<rn:\n l=mid+1\n else:\n r=mid-1\n return l\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21500"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\n self.total_weight = self.cumm_sum[-1]\n print(self.total_weight)\n\n def pickIndex(self) -> int:\n target = random.uniform(0, self.total_weight)\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\n return index\n\n def bisect_left(self, low, high, arr, target) -> int:\n \"\"\"\n \n \"\"\"\n if low <0:\n raise ValueError('lo must be non-negative')\n if high==None:\n high = len(arr)\n while low < high:\n mid = (low + high) //2\n if arr[mid]<target:\n low = mid+1\n else:\n high = mid\n return low\n\n# # Your Solution object will be instantiated and called as such:\n# # obj = Solution(w)\n# # param_1 = obj.pickIndex()\n\n# import random\n\n# class Solution:\n\n# def __init__(self, w):\n# self.prefix_sums = []\n# total = 0\n# for weight in w:\n# total += weight\n# self.prefix_sums.append(total)\n# self.total_weight = total\n\n# def bisect_left(self, a, x):\n# lo = 0\n# hi = len(a)\n# while lo < hi:\n# mid = (lo + hi) // 2\n# if a[mid] < x:\n# lo = mid + 1\n# else:\n# hi = mid\n# return lo\n\n# def pickIndex(self):\n# target = random.uniform(0, self.total_weight)\n# index = self.bisect_left(self.prefix_sums, target)\n# return index\n","memory":"21500"},{"code":"import random \nclass Solution:\n\n def __init__(self, w: List[int]):\n self.indices = list(range(len(w)))\n total = sum(w)\n self.probs = [x / total for x in w]\n \n\n def pickIndex(self) -> int:\n return random.choices(population=self.indices, weights=self.probs, k=1)[0]\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21600"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.prefix_sum = []\n self.total = 0\n\n curr_sum = 0\n for ele in w:\n curr_sum += ele\n self.prefix_sum.append(curr_sum)\n\n self.total = curr_sum\n\n def pickIndex(self) -> int:\n\n target = random.uniform(0, self.total)\n left, right = 0, len(self.prefix_sum) - 1\n while left < right:\n mid = (left + right) // 2\n if target > self.prefix_sum[mid]:\n left = mid + 1\n else:\n right = mid\n\n return left\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21600"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n total = sum(w)\n\n prefix = 0\n\n self.values = []\n\n for i in w:\n prefix += (i / total)\n self.values.append(prefix)\n\n print(self.values)\n\n def pickIndex(self) -> int:\n values = self.values\n\n if len(values) == 0:\n return 0\n\n r = random.random()\n\n low = 0\n high = len(values) - 1\n\n ans = -1\n\n while low <= high:\n mid = (high - low) // 2 + low\n if r <= values[mid]:\n ans = mid\n high = mid - 1\n else:\n low = mid + 1\n \n\n return ans\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21700"},{"code":"from random import random\nfrom bisect import bisect_left\n\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.weight_starts = []\n self.total = 0\n for val in w:\n self.weight_starts.append(val + (self.weight_starts[-1] if self.weight_starts else 0))\n self.total += val\n\n def pickIndex(self) -> int:\n x = random() * self.total\n return bisect_left(self.weight_starts, x)\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21700"},{"code":"import random \nclass Solution:\n\n def __init__(self, w: List[int]):\n \"\"\"\n given the weight normalize \n 1 +3 = 4 \n\n 0 index 1/4 = .25\n 1 \n [.25,.1]\n .25 .75\n random sample \n \n \"\"\"\n total = sum(w)\n self.probs = []\n self.ids = []\n for i,weight in enumerate(w):\n self.ids.append(i)\n self.probs.append(weight/total)\n\n\n def pickIndex(self) -> int:\n return random.choices(self.ids,self.probs)[0]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21800"},{"code":"from sortedcontainers import SortedList\n\nclass Solution:\n def __init__(self, w: List[int]):\n self.sl = SortedList()\n self.runningWeight = 0\n\n for weight in w:\n self.runningWeight += weight\n self.sl.add(self.runningWeight)\n\n def pickIndex(self) -> int:\n return self.sl.bisect_right(randint(0, self.runningWeight - 1))\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"21800"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.w_sum = 0\n self.cumulative_w = []\n for i in range(len(w)):\n self.w_sum += w[i]\n self.cumulative_w.append(self.w_sum) \n \n print(self.cumulative_w)\n \n def binarySearch(self, left, right, x) -> int:\n if left >= right:\n return left\n mid = left + (right - left) // 2\n print(mid)\n if x > self.cumulative_w[mid]:\n # explore left\n return self.binarySearch(mid+1, right, x)\n else:\n return self.binarySearch(left, mid, x)\n \n\n\n def pickIndex(self) -> int:\n x = self.w_sum * random.random()\n # target = self.w_sum * random.random()\n # low, high = 0, len(self.cumulative_w)\n # while low < high:\n # mid = low + (high - low) // 2\n # if target > self.cumulative_w[mid]:\n # low = mid + 1\n # else:\n # high = mid\n # return low\n # print(\"x is\", x)\n return self.binarySearch(0, len(self.cumulative_w), x)\n\n\n \n \n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()\n# find the sum of S = sum_S\n# pick a random index between 0 and sum_S-1 called x=2\n# [(1,3,2,3)] -> 1, 4, 6, 9 - O(n)\n# find first value larger than x call it ilog(N)\n# return [i-1][1] \n\n","memory":"21900"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.val_to_idx = {}\n self.total = 0\n for idx, v in enumerate(w):\n self.total += v\n self.val_to_idx[self.total] = idx\n self.vals = sorted(self.val_to_idx.keys())\n # print(self.vals, self.val_to_idx)\n \n\n def pickIndex(self) -> int:\n target_val = random.randint(1, self.total)\n # print(target_val)\n left, right = 0, len(self.vals) - 1\n while left + 1 < right:\n mid = left + (right - left) // 2\n if self.vals[mid] == target_val:\n return self.val_to_idx[target_val]\n if self.vals[mid] < target_val:\n left = mid\n else:\n right = mid\n if self.vals[left] >= target_val:\n return left\n return right\n # if self.vals[right] < target_val:\n # return self.val_to_idx[self.vals[right]]\n # return self.val_to_idx[self.vals[left]]\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"22000"},{"code":"import random\nclass Solution:\n#O(n) for init and pickIndex\n def __init__(self, w: List[int]):\n self.sum = sum(w)\n # window = index\n self.weight_dict = {}\n curr_max = 0\n for idx in range(len(w)):\n curr_max += w[idx]\n self.weight_dict[curr_max] = idx\n \n\n def pickIndex(self) -> int:\n random_num = random.randint(1, self.sum)\n for max_num, idx in self.weight_dict.items():\n if random_num <= max_num:\n return idx\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"22100"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.w = w\n self.indexes = []\n for i in range(len(w)):\n self.indexes.append(i)\n\n def pickIndex(self) -> int:\n import random\n \n weight = []\n arr_sum = sum(self.w)\n for i in self.w:\n weight.append(i/arr_sum)\n return int(random.choices(self.indexes, weights=tuple(weight), k=1)[0])\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"22200"},{"code":"class Solution:\n\n def __init__(self, w: List[int]):\n self.avail_list = [idx for idx in range(len(w))]\n curr_sum = sum(w)\n self.probs = [w[i]/curr_sum for i in range(len(w))]\n print(self.avail_list, self.probs)\n \n\n def pickIndex(self) -> int:\n return random.choices(self.avail_list, weights=self.probs, k=1)[0]\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"22200"},{"code":"import random\nclass Solution:\n\n def __init__(self, w: List[int]):\n sum_of_weights = sum(w)\n probs = [float(i/sum_of_weights) for i in w]\n sorted_probs = sorted(probs)\n xd = [sorted_probs[0]]\n for i in range(1, len(sorted_probs)):\n xd.append(sorted_probs[i] + xd[i - 1])\n self.prefix = xd\n self.sorted_indices = sorted(range(len(probs)), key=probs.__getitem__)\n\n def pickIndex(self) -> int:\n rand = random.random()\n i = bisect_left(self.prefix, rand)\n if i == len(self.prefix):\n i = i - 1\n return self.sorted_indices[i]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(w)\n# param_1 = obj.pickIndex()","memory":"22300"}],"string":"[\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n\\n weight_sum = sum(w)\\n\\n for i in range(len(w)):\\n self.w[i]/=weight_sum\\n \\n for i in range(1,len(w)):\\n self.w[i]+=self.w[i-1]\\n\\n\\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0,1)\\n \\n i = -1\\n\\n while i<len(self.w):\\n i +=1\\n if N <self.w[i]:\\n break\\n \\n return i\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sums = []\\n prefix_sum = 0\\n for weight in w:\\n prefix_sum += weight\\n self.prefix_sums.append(prefix_sum)\\n self.total_sum = prefix_sum\\n\\n def pickIndex(self) -> int:\\n \\\"\\\"\\\"\\n :rtype: int\\n \\\"\\\"\\\"\\n target = self.total_sum * random.random()\\n # run a linear search to find the target zone\\n for i, prefix_sum in enumerate(self.prefix_sums):\\n if target < prefix_sum:\\n return i\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n prefixSum = 0\\n self.prefixSum = []\\n \\n for weight in w:\\n prefixSum += weight\\n self.prefixSum.append(prefixSum)\\n \\n self.totalSum = prefixSum\\n \\n def pickIndex(self) -> int:\\n target = self.totalSum * random.random()\\n for i in range(len(self.prefixSum)):\\n if target < self.prefixSum[i]:\\n return i\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"19600\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nKey: imagine drop a dart to a line with the length of 1. \\nThis line is connected bz multiple small lines. Since the drop point of the dart uniformly range from 0 to 1,\\naka anywhere, so the probablity that the dart is located in one small line is equal to its length. There is no need to shuffle the small lines.\\n\\\"\\\"\\\"\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n w_accu = []\\n accu_value = 0\\n for v in w:\\n accu_value += v\\n w_accu.append( accu_value )\\n self.w_accu = w_accu\\n\\n def pickIndex(self) -> int:\\n rand_value = random.random() * self.w_accu[-1]\\n for pos, accu_value in enumerate( self.w_accu):\\n if accu_value >= rand_value:\\n break\\n return pos\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix = []\\n prefix = 0\\n for weight in w:\\n prefix +=weight\\n self.prefix.append(prefix)\\n self.total = prefix\\n\\n def pickIndex(self) -> int:\\n target = self.total * random.random()\\n for i,prefix in enumerate(self.prefix):\\n if target<prefix:\\n return i\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, weights: List[int]):\\n self.prefix_sum = []\\n curr_sum = 0\\n self.total_sum = 0\\n for i, num in enumerate(weights):\\n curr_sum += num\\n self.prefix_sum.append(curr_sum)\\n self.total_sum = curr_sum\\n\\n def pickIndexLinearSearch(self) -> int:\\n target = self.total_sum * random.random()\\n\\n for i, total in enumerate(self.prefix_sum):\\n if target < self.prefix_sum[i]:\\n return i\\n\\n def pickIndex(self) -> int:\\n target = self.total_sum * random.random()\\n\\n left, right = 0, len(self.prefix_sum) - 1\\n\\n while left < right:\\n mid = left + (right - left) // 2\\n if target > self.prefix_sum[mid]:\\n left = mid + 1\\n else:\\n right = mid\\n\\n return right\\n\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.weights = [p*1.0/sum(w) for p in w]\\n\\n def pickIndex(self) -> int:\\n import random\\n return random.choices([i for i in range(len(self.weights))], self.weights, k=1)[0]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"from random import uniform\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.probs = [x / sum(w) for x in w]\\n # self.w = w\\n\\n def pickIndex(self) -> int:\\n rand_num = uniform(0, 1)\\n for index, prob in enumerate(self.probs):\\n if rand_num <= prob:\\n return index\\n rand_num -= prob\\n return index\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.cumulative_sum = []\\n prefix_sum = 0\\n for number in w:\\n prefix_sum += number\\n self.cumulative_sum.append(prefix_sum)\\n self.total_sum = prefix_sum\\n #print(self.cumulative_sum)\\n\\n def pickIndex(self) -> int:\\n # generate numbers from 0 to total_sum\\n random_number = self.total_sum * random.random()\\n # method 1: linear search with O(N)\\n #for index, value in enumerate(self.cumulative_sum):\\n # if random_number < value:\\n # return index\\n # method 2: binary search with O(logN)\\n low, high = 0, len(self.cumulative_sum)\\n while low < high:\\n mid = (low+high)//2\\n if random_number < self.cumulative_sum[mid]:\\n high = mid\\n else:\\n low = mid + 1\\n return low\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n denom = sum(self.w)\\n for i in range(len(w)):\\n self.w[i] = self.w[i] / denom\\n\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i-1]\\n\\n def pickIndex(self) -> int:\\n n = random.uniform(0,1)\\n\\n flag = 1\\n idx = -1\\n\\n while flag:\\n idx += 1\\n if n <= self.w[idx]:\\n flag = 0\\n\\n return idx\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20300\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total=sum(w)\\n self.arr=[]\\n s=0\\n for weight in w:\\n s+=weight\\n self.arr.append(s)\\n\\n def pickIndex(self) -> int:\\n target=self.total*random.random()\\n for index,v in enumerate(self.arr):\\n if target<v: return index\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefixSums = []\\n sumSoFar = 0\\n for i in range(0, len(w)):\\n sumSoFar += w[i]\\n self.prefixSums.append(sumSoFar)\\n self.n = len(self.prefixSums)\\n self.totalSum = sumSoFar\\n\\n def pickIndex(self) -> int:\\n target = self.totalSum * random.random() #random.randint(1, self.n)\\n # get first smaller index\\n for i in range(0, self.n):\\n if target < self.prefixSums[i]:\\n return i\\n return self.n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, weights: List[int]):\\n self.total_weight = 0\\n self.cum_weights = []\\n for w in weights:\\n self.total_weight += w\\n self.cum_weights.append(self.total_weight)\\n\\n def pickIndex(self) -> int:\\n target = self.total_weight * random.random()\\n low, high = 0, len(self.cum_weights)\\n while low < high:\\n mid = low + (high - low) // 2\\n if target > self.cum_weights[mid]:\\n low = mid + 1\\n else:\\n high = mid\\n return low\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20600\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix = [0]*(len(w)+1)\\n for i,v in enumerate(w):\\n self.prefix[i+1] = v+self.prefix[i]\\n self.maxVal = self.prefix[-1]\\n \\n \\n \\n\\n def pickIndex(self) -> int:\\n index = random.randint(0, self.maxVal-1)\\n #print(self.maxVal)\\n #print(self.prefix)\\n #print(index)\\n l,h = 1, len(self.prefix)-1\\n while(l<=h):\\n mid = l+(h-l)//2\\n #print(mid,self.prefix,index)\\n if(self.prefix[mid]>index and self.prefix[mid-1]<=index):\\n # found \\n return mid-1\\n elif(self.prefix[mid-1]>index):\\n # need to decrese\\n h = mid-1\\n else:\\n l = mid+1\\n return -1\\n\\n \\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20700\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.sumw = sum(w)\\n for i in range(1, len(self.w)):\\n self.w[i] += self.w[i-1]\\n\\n # print(self.w)\\n \\n\\n def pickIndex(self) -> int:\\n N = random.uniform(0, self.sumw)\\n\\n index = 0\\n while index < len(self.w):\\n if N <= self.w[index]:\\n return index\\n index += 1\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = sum(w)\\n self.w = w\\n\\n def pickIndex(self) -> int:\\n random_weight = random.random() * self.total\\n curr_sum = 0\\n for i in range(len(self.w)):\\n curr_sum += self.w[i]\\n if curr_sum >= random_weight:\\n return i\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.total = sum(w)\\n self.w = w\\n\\n def pickIndex(self) -> int:\\n random_weight = random.random() * self.total\\n curr_sum = 0\\n for i in range(len(self.w)):\\n curr_sum += self.w[i]\\n if curr_sum >= random_weight:\\n return i\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n import random\\n self.prefix_sums = []\\n current_sum = 0\\n for weight in w:\\n current_sum += weight\\n self.prefix_sums.append(current_sum)\\n self.total_sum = current_sum\\n\\n def pickIndex(self) -> int:\\n target = random.randint(1, self.total_sum)\\n # Binary search to find the target zone\\n low, high = 0, len(self.prefix_sums) - 1\\n while low < high:\\n mid = (low + high) // 2\\n if target > self.prefix_sums[mid]:\\n low = mid + 1\\n else:\\n high = mid\\n return low\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sum = []\\n self.total_sum = 0\\n for weight in w:\\n self.total_sum += weight\\n self.prefix_sum.append(self.total_sum)\\n\\n\\n def pickIndex(self) -> int:\\n\\n target = self.total_sum * random.random()\\n for i, prefix in enumerate(self.prefix_sum):\\n if target < prefix:\\n return i\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sum = []\\n self.total_sum = 0\\n for weight in w:\\n self.total_sum += weight\\n self.prefix_sum.append(self.total_sum)\\n\\n\\n def pickIndex(self) -> int:\\n\\n target = self.total_sum * random.random()\\n for i, prefix in enumerate(self.prefix_sum):\\n if target < prefix:\\n return i\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n for i in range(1,len(w)):\\n w[i] += w[i-1]\\n self.prefix_sum = w\\n\\n def pickIndex(self) -> int:\\n from bisect import bisect_left\\n from random import randint\\n\\n guess = randint(1,self.prefix_sum[-1])\\n print(guess)\\n\\n return bisect_left(self.prefix_sum,guess)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.p_s = [0] * (len(w) + 1)\\n for i in range(1, len(w)+1):\\n self.p_s[i] = self.p_s[i-1] + w[i-1]\\n self.p_s.pop(0)\\n\\n def pickIndex(self) -> int:\\n num = random.randint(1, self.p_s[-1])\\n l, h = 0, len(self.p_s)\\n while l < h:\\n m = (l + h) // 2\\n if num > self.p_s[m]:\\n l = m + 1\\n else:\\n h = m \\n return l\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"# import random\\n# class Solution:\\n\\n# def __init__(self, w: List[int]):\\n# self.w = w\\n# self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\\n# self.total_weight = self.cumm_sum[-1]\\n\\n# def pickIndex(self) -> int:\\n# target = random.uniform(0, self.total_weight)\\n# index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\\n# return index\\n\\n# def bisect_left(self, low, high, arr, target) -> int:\\n# \\\"\\\"\\\"\\n \\n# \\\"\\\"\\\"\\n# if low <0:\\n# raise ValueError('lo must be non-negative')\\n# if high==None:\\n# high = len(arr)\\n# while low < high:\\n# mid = (low + high) //2\\n# if arr[mid]<target:\\n# low = mid+1\\n# else:\\n# high = mid\\n# return low\\n\\n# # Your Solution object will be instantiated and called as such:\\n# # obj = Solution(w)\\n# # param_1 = obj.pickIndex()\\n\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, w):\\n self.prefix_sums = []\\n total = 0\\n for weight in w:\\n total += weight\\n self.prefix_sums.append(total)\\n self.total_weight = total\\n\\n def bisect_left(self, a, x):\\n lo = 0\\n hi = len(a)\\n while lo < hi:\\n mid = (lo + hi) // 2\\n if a[mid] < x:\\n lo = mid + 1\\n else:\\n hi = mid\\n return lo\\n\\n def pickIndex(self):\\n target = random.uniform(0, self.total_weight)\\n index = self.bisect_left(self.prefix_sums, target)\\n return index\\n\",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\\n self.total_weight = self.cumm_sum[-1]\\n\\n def pickIndex(self) -> int:\\n target = random.uniform(0, self.total_weight)\\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\\n return index\\n\\n def bisect_left(self, low, high, arr, target) -> int:\\n \\\"\\\"\\\"\\n \\n \\\"\\\"\\\"\\n while low < high:\\n mid = (low + high) //2\\n if arr[mid]<target:\\n low = mid+1\\n else:\\n high = mid\\n return low\\n\\n# # Your Solution object will be instantiated and called as such:\\n# # obj = Solution(w)\\n# # param_1 = obj.pickIndex()\\n\\n# import random\\n\\n# class Solution:\\n\\n# def __init__(self, w):\\n# self.prefix_sums = []\\n# total = 0\\n# for weight in w:\\n# total += weight\\n# self.prefix_sums.append(total)\\n# self.total_weight = total\\n\\n# def bisect_left(self, a, x):\\n# lo = 0\\n# hi = len(a)\\n# while lo < hi:\\n# mid = (lo + hi) // 2\\n# if a[mid] < x:\\n# lo = mid + 1\\n# else:\\n# hi = mid\\n# return lo\\n\\n# def pickIndex(self):\\n# target = random.uniform(0, self.total_weight)\\n# index = self.bisect_left(self.prefix_sums, target)\\n# return index\\n\",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.prefix_sum = [w[0]]\\n for i in range(1, len(w)):\\n self.prefix_sum.append(w[i] + self.prefix_sum[-1])\\n self.total = sum(w)\\n self.original = w\\n\\n def pickIndex(self) -> int:\\n index = random.randint(1, self.total)\\n\\n l = 0\\n r = len(self.prefix_sum) - 1\\n while l <= r:\\n m = (l + r) // 2\\n mid = self.prefix_sum[m]\\n # print(\\\"!\\\", mid)\\n if mid == index:\\n return m\\n if index > mid:\\n l = m + 1\\n else:\\n r = m - 1\\n # print(l)\\n # print(self.original)\\n # print(self.prefix_sum)\\n # print(index)\\n return l\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\\n self.total_weight = self.cumm_sum[-1]\\n print(self.total_weight)\\n\\n def pickIndex(self) -> int:\\n target = random.uniform(0, self.total_weight)\\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\\n return index\\n\\n def bisect_left(self, low, high, arr, target) -> int:\\n \\\"\\\"\\\"\\n \\n \\\"\\\"\\\"\\n if low <0:\\n raise ValueError('lo must be non-negative')\\n if high==None:\\n high = len(arr)\\n while low < high:\\n mid = (low + high) //2\\n if arr[mid]<target:\\n low = mid+1\\n else:\\n high = mid\\n return low\\n\\n# # Your Solution object will be instantiated and called as such:\\n# # obj = Solution(w)\\n# # param_1 = obj.pickIndex()\\n\\n# import random\\n\\n# class Solution:\\n\\n# def __init__(self, w):\\n# self.prefix_sums = []\\n# total = 0\\n# for weight in w:\\n# total += weight\\n# self.prefix_sums.append(total)\\n# self.total_weight = total\\n\\n# def bisect_left(self, a, x):\\n# lo = 0\\n# hi = len(a)\\n# while lo < hi:\\n# mid = (lo + hi) // 2\\n# if a[mid] < x:\\n# lo = mid + 1\\n# else:\\n# hi = mid\\n# return lo\\n\\n# def pickIndex(self):\\n# target = random.uniform(0, self.total_weight)\\n# index = self.bisect_left(self.prefix_sums, target)\\n# return index\\n\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n s = sum(w)\\n w = [v/s for v in w]\\n for i in range(1, len(w)):\\n w[i] += w[i-1]\\n self.w = w\\n print(self.w)\\n \\n\\n def pickIndex(self) -> int:\\n rn = random.random()\\n # find first index >=r\\n l, r = 0, len(self.w)\\n while l<=r:\\n mid = (l+r)//2\\n if self.w[mid]<rn:\\n l=mid+1\\n else:\\n r=mid-1\\n return l\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.cumm_sum = [sum(self.w[0:i[0]+1]) for i in enumerate(self.w)]\\n self.total_weight = self.cumm_sum[-1]\\n print(self.total_weight)\\n\\n def pickIndex(self) -> int:\\n target = random.uniform(0, self.total_weight)\\n index = self.bisect_left(0,len(self.cumm_sum), self.cumm_sum, target)\\n return index\\n\\n def bisect_left(self, low, high, arr, target) -> int:\\n \\\"\\\"\\\"\\n \\n \\\"\\\"\\\"\\n if low <0:\\n raise ValueError('lo must be non-negative')\\n if high==None:\\n high = len(arr)\\n while low < high:\\n mid = (low + high) //2\\n if arr[mid]<target:\\n low = mid+1\\n else:\\n high = mid\\n return low\\n\\n# # Your Solution object will be instantiated and called as such:\\n# # obj = Solution(w)\\n# # param_1 = obj.pickIndex()\\n\\n# import random\\n\\n# class Solution:\\n\\n# def __init__(self, w):\\n# self.prefix_sums = []\\n# total = 0\\n# for weight in w:\\n# total += weight\\n# self.prefix_sums.append(total)\\n# self.total_weight = total\\n\\n# def bisect_left(self, a, x):\\n# lo = 0\\n# hi = len(a)\\n# while lo < hi:\\n# mid = (lo + hi) // 2\\n# if a[mid] < x:\\n# lo = mid + 1\\n# else:\\n# hi = mid\\n# return lo\\n\\n# def pickIndex(self):\\n# target = random.uniform(0, self.total_weight)\\n# index = self.bisect_left(self.prefix_sums, target)\\n# return index\\n\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"import random \\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.indices = list(range(len(w)))\\n total = sum(w)\\n self.probs = [x / total for x in w]\\n \\n\\n def pickIndex(self) -> int:\\n return random.choices(population=self.indices, weights=self.probs, k=1)[0]\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.prefix_sum = []\\n self.total = 0\\n\\n curr_sum = 0\\n for ele in w:\\n curr_sum += ele\\n self.prefix_sum.append(curr_sum)\\n\\n self.total = curr_sum\\n\\n def pickIndex(self) -> int:\\n\\n target = random.uniform(0, self.total)\\n left, right = 0, len(self.prefix_sum) - 1\\n while left < right:\\n mid = (left + right) // 2\\n if target > self.prefix_sum[mid]:\\n left = mid + 1\\n else:\\n right = mid\\n\\n return left\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n total = sum(w)\\n\\n prefix = 0\\n\\n self.values = []\\n\\n for i in w:\\n prefix += (i / total)\\n self.values.append(prefix)\\n\\n print(self.values)\\n\\n def pickIndex(self) -> int:\\n values = self.values\\n\\n if len(values) == 0:\\n return 0\\n\\n r = random.random()\\n\\n low = 0\\n high = len(values) - 1\\n\\n ans = -1\\n\\n while low <= high:\\n mid = (high - low) // 2 + low\\n if r <= values[mid]:\\n ans = mid\\n high = mid - 1\\n else:\\n low = mid + 1\\n \\n\\n return ans\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"from random import random\\nfrom bisect import bisect_left\\n\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.weight_starts = []\\n self.total = 0\\n for val in w:\\n self.weight_starts.append(val + (self.weight_starts[-1] if self.weight_starts else 0))\\n self.total += val\\n\\n def pickIndex(self) -> int:\\n x = random() * self.total\\n return bisect_left(self.weight_starts, x)\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"import random \\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n \\\"\\\"\\\"\\n given the weight normalize \\n 1 +3 = 4 \\n\\n 0 index 1/4 = .25\\n 1 \\n [.25,.1]\\n .25 .75\\n random sample \\n \\n \\\"\\\"\\\"\\n total = sum(w)\\n self.probs = []\\n self.ids = []\\n for i,weight in enumerate(w):\\n self.ids.append(i)\\n self.probs.append(weight/total)\\n\\n\\n def pickIndex(self) -> int:\\n return random.choices(self.ids,self.probs)[0]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass Solution:\\n def __init__(self, w: List[int]):\\n self.sl = SortedList()\\n self.runningWeight = 0\\n\\n for weight in w:\\n self.runningWeight += weight\\n self.sl.add(self.runningWeight)\\n\\n def pickIndex(self) -> int:\\n return self.sl.bisect_right(randint(0, self.runningWeight - 1))\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.w_sum = 0\\n self.cumulative_w = []\\n for i in range(len(w)):\\n self.w_sum += w[i]\\n self.cumulative_w.append(self.w_sum) \\n \\n print(self.cumulative_w)\\n \\n def binarySearch(self, left, right, x) -> int:\\n if left >= right:\\n return left\\n mid = left + (right - left) // 2\\n print(mid)\\n if x > self.cumulative_w[mid]:\\n # explore left\\n return self.binarySearch(mid+1, right, x)\\n else:\\n return self.binarySearch(left, mid, x)\\n \\n\\n\\n def pickIndex(self) -> int:\\n x = self.w_sum * random.random()\\n # target = self.w_sum * random.random()\\n # low, high = 0, len(self.cumulative_w)\\n # while low < high:\\n # mid = low + (high - low) // 2\\n # if target > self.cumulative_w[mid]:\\n # low = mid + 1\\n # else:\\n # high = mid\\n # return low\\n # print(\\\"x is\\\", x)\\n return self.binarySearch(0, len(self.cumulative_w), x)\\n\\n\\n \\n \\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\\n# find the sum of S = sum_S\\n# pick a random index between 0 and sum_S-1 called x=2\\n# [(1,3,2,3)] -> 1, 4, 6, 9 - O(n)\\n# find first value larger than x call it ilog(N)\\n# return [i-1][1] \\n\\n\",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.val_to_idx = {}\\n self.total = 0\\n for idx, v in enumerate(w):\\n self.total += v\\n self.val_to_idx[self.total] = idx\\n self.vals = sorted(self.val_to_idx.keys())\\n # print(self.vals, self.val_to_idx)\\n \\n\\n def pickIndex(self) -> int:\\n target_val = random.randint(1, self.total)\\n # print(target_val)\\n left, right = 0, len(self.vals) - 1\\n while left + 1 < right:\\n mid = left + (right - left) // 2\\n if self.vals[mid] == target_val:\\n return self.val_to_idx[target_val]\\n if self.vals[mid] < target_val:\\n left = mid\\n else:\\n right = mid\\n if self.vals[left] >= target_val:\\n return left\\n return right\\n # if self.vals[right] < target_val:\\n # return self.val_to_idx[self.vals[right]]\\n # return self.val_to_idx[self.vals[left]]\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n#O(n) for init and pickIndex\\n def __init__(self, w: List[int]):\\n self.sum = sum(w)\\n # window = index\\n self.weight_dict = {}\\n curr_max = 0\\n for idx in range(len(w)):\\n curr_max += w[idx]\\n self.weight_dict[curr_max] = idx\\n \\n\\n def pickIndex(self) -> int:\\n random_num = random.randint(1, self.sum)\\n for max_num, idx in self.weight_dict.items():\\n if random_num <= max_num:\\n return idx\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.w = w\\n self.indexes = []\\n for i in range(len(w)):\\n self.indexes.append(i)\\n\\n def pickIndex(self) -> int:\\n import random\\n \\n weight = []\\n arr_sum = sum(self.w)\\n for i in self.w:\\n weight.append(i/arr_sum)\\n return int(random.choices(self.indexes, weights=tuple(weight), k=1)[0])\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, w: List[int]):\\n self.avail_list = [idx for idx in range(len(w))]\\n curr_sum = sum(w)\\n self.probs = [w[i]/curr_sum for i in range(len(w))]\\n print(self.avail_list, self.probs)\\n \\n\\n def pickIndex(self) -> int:\\n return random.choices(self.avail_list, weights=self.probs, k=1)[0]\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, w: List[int]):\\n sum_of_weights = sum(w)\\n probs = [float(i/sum_of_weights) for i in w]\\n sorted_probs = sorted(probs)\\n xd = [sorted_probs[0]]\\n for i in range(1, len(sorted_probs)):\\n xd.append(sorted_probs[i] + xd[i - 1])\\n self.prefix = xd\\n self.sorted_indices = sorted(range(len(probs)), key=probs.__getitem__)\\n\\n def pickIndex(self) -> int:\\n rand = random.random()\\n i = bisect_left(self.prefix, rand)\\n if i == len(self.prefix):\\n i = i - 1\\n return self.sorted_indices[i]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(w)\\n# param_1 = obj.pickIndex()\",\n \"memory\": \"22300\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":40,"string":"40"}}},{"rowIdx":281,"cells":{"question_id":{"kind":"number","value":529,"string":"529"},"name":{"kind":"string","value":"minesweeper"},"content":{"kind":"string","value":"<p>Let's play the minesweeper game (<a href=\"https://en.wikipedia.org/wiki/Minesweeper_(video_game)\" target=\"_blank\">Wikipedia</a>, <a href=\"http://minesweeperonline.com\" target=\"_blank\">online game</a>)!</p>\n\n<p>You are given an <code>m x n</code> char matrix <code>board</code> representing the game board where:</p>\n\n<ul>\n\t<li><code>'M'</code> represents an unrevealed mine,</li>\n\t<li><code>'E'</code> represents an unrevealed empty square,</li>\n\t<li><code>'B'</code> represents a revealed blank square that has no adjacent mines (i.e., above, below, left, right, and all 4 diagonals),</li>\n\t<li>digit (<code>'1'</code> to <code>'8'</code>) represents how many mines are adjacent to this revealed square, and</li>\n\t<li><code>'X'</code> represents a revealed mine.</li>\n</ul>\n\n<p>You are also given an integer array <code>click</code> where <code>click = [click<sub>r</sub>, click<sub>c</sub>]</code> represents the next click position among all the unrevealed squares (<code>'M'</code> or <code>'E'</code>).</p>\n\n<p>Return <em>the board after revealing this position according to the following rules</em>:</p>\n\n<ol>\n\t<li>If a mine <code>'M'</code> is revealed, then the game is over. You should change it to <code>'X'</code>.</li>\n\t<li>If an empty square <code>'E'</code> with no adjacent mines is revealed, then change it to a revealed blank <code>'B'</code> and all of its adjacent unrevealed squares should be revealed recursively.</li>\n\t<li>If an empty square <code>'E'</code> with at least one adjacent mine is revealed, then change it to a digit (<code>'1'</code> to <code>'8'</code>) representing the number of adjacent mines.</li>\n\t<li>Return the board when no more squares will be revealed.</li>\n</ol>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img src=\"https://assets.leetcode.com/uploads/2023/08/09/untitled.jpeg\" style=\"width: 500px; max-width: 400px; height: 269px;\" />\n<pre>\n<strong>Input:</strong> board = [["E","E","E","E","E"],["E","E","M","E","E"],["E","E","E","E","E"],["E","E","E","E","E"]], click = [3,0]\n<strong>Output:</strong> [["B","1","E","1","B"],["B","1","M","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img src=\"https://assets.leetcode.com/uploads/2023/08/09/untitled-2.jpeg\" style=\"width: 489px; max-width: 400px; height: 269px;\" />\n<pre>\n<strong>Input:</strong> board = [["B","1","E","1","B"],["B","1","M","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]], click = [1,2]\n<strong>Output:</strong> [["B","1","E","1","B"],["B","1","X","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>m == board.length</code></li>\n\t<li><code>n == board[i].length</code></li>\n\t<li><code>1 <= m, n <= 50</code></li>\n\t<li><code>board[i][j]</code> is either <code>'M'</code>, <code>'E'</code>, <code>'B'</code>, or a digit from <code>'1'</code> to <code>'8'</code>.</li>\n\t<li><code>click.length == 2</code></li>\n\t<li><code>0 <= click<sub>r</sub> < m</code></li>\n\t<li><code>0 <= click<sub>c</sub> < n</code></li>\n\t<li><code>board[click<sub>r</sub>][click<sub>c</sub>]</code> is either <code>'M'</code> or <code>'E'</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":67.0848573518654,"string":"67.084857"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","depth-first-search","breadth-first-search","matrix"],"string":"[\n \"array\",\n \"depth-first-search\",\n \"breadth-first-search\",\n \"matrix\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"136\", 0.07], [\"138\", 0.07], [\"140\", 0.2101], [\"141\", 0.2801], [\"142\", 0.7703], [\"143\", 0.8403], [\"144\", 0.6303], [\"145\", 1.4006], [\"146\", 1.1204], [\"147\", 1.8908], [\"148\", 2.1709], [\"149\", 3.5014], [\"150\", 2.6611], [\"151\", 3.9216], [\"152\", 3.1513], [\"153\", 4.6919], [\"154\", 5.7423], [\"155\", 5.8824], [\"156\", 4.902], [\"157\", 5.1821], [\"158\", 5.4622], [\"159\", 7.2129], [\"160\", 4.6919], [\"161\", 4.4818], [\"162\", 4.2717], [\"163\", 3.5714], [\"164\", 3.7115], [\"165\", 2.8711], [\"166\", 1.7507], [\"167\", 2.3109], [\"168\", 1.6106], [\"169\", 0.5602], [\"170\", 0.7003], [\"171\", 0.9104], [\"172\", 0.5602], [\"173\", 0.4902], [\"174\", 0.2801], [\"175\", 0.2101]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15800\", 0.07], [\"16500\", 0.2101], [\"16600\", 1.8207], [\"16700\", 4.2017], [\"16800\", 10.084], [\"16900\", 10.2941], [\"17000\", 8.3333], [\"17100\", 12.3249], [\"17200\", 12.1849], [\"17300\", 5.8824], [\"17400\", 5.4622], [\"17500\", 4.6919], [\"17600\", 2.1008], [\"17700\", 1.3305], [\"17800\", 1.4706], [\"17900\", 1.0504], [\"18000\", 1.0504], [\"18100\", 0.4902], [\"18200\", 0.4202], [\"18300\", 0.6303], [\"18400\", 0.7003], [\"18500\", 1.1905], [\"18600\", 2.591], [\"18700\", 1.1204], [\"18800\", 1.3305], [\"18900\", 1.3305], [\"19000\", 1.2605], [\"19100\", 0.4202], [\"19200\", 0.5602], [\"19300\", 0.3501]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution(object):\n def updateBoard(self, board, click):\n \"\"\"\n :type board: List[List[str]]\n :type click: List[int]\n :rtype: List[List[str]]\n \"\"\"\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n m = len(board)\n n = len(board[0])\n q = deque()\n q.append(click)\n visited = set()\n visited.add(tuple(click))\n while q:\n # print(q)\n for _ in range(len(q)):\n curr = q.popleft()\n x, y = curr[0], curr[1]\n \n \n count_mine = 0\n for a,b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\n nx, ny = x+a, y+b\n\n if 0 <= nx < m and 0 <= ny < n:\n if board[nx][ny] == 'M':\n count_mine += 1\n if count_mine > 0:\n board[x][y] = str(count_mine)\n else:\n board[x][y] = 'B'\n for a, b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\n nx, ny = x+a, y+b\n\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited:\n q.append([nx,ny])\n visited.add((nx,ny))\n return board","runtime":"136"},{"code":"class Solution:\n '''\n so what we could do is bfs \n\n so firstly, if click is a mine, then change it to x and return \n\n otherwise, for each node, check all eight directiosn and keep track of them in an array\n\n we will add these to the queue if current node is blank\n\n so basically it will go like this\n\n array of current nodes\n count of bombs\n\n for each of the 8 directions\n if its invalid or its in visited, then skip\n \n if its a bomb, then add to count of bombs\n if its not a bomb, then add it to the array of current nodes\n\n if this array has 0 adjacent bombs\n add each valid node to the queue and to the visited set \n\n '''\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]] == \"M\":\n board[click[0]][click[1]] = \"X\"\n return board\n\n q = deque([(click[0], click[1])])\n visited = set()\n directions = [(0, 1), (1, 0), (1, 1), (-1, 1), (1, -1), (-1, -1), (0, -1), (-1, 0)]\n\n while q:\n row, col = q.popleft()\n next_cells = []\n num_bombs = 0\n\n for drow, dcol in directions:\n new_row = row + drow\n new_col = col + dcol\n\n if not self.isValidCell(board, new_row, new_col) or (new_row, new_col) in visited:\n continue\n\n if board[new_row][new_col] == \"M\":\n num_bombs += 1\n else:\n next_cells.append((new_row, new_col))\n\n if num_bombs == 0:\n board[row][col] = \"B\"\n\n for cell_pos in next_cells:\n q.append(cell_pos)\n visited.add((cell_pos[0], cell_pos[1]))\n else:\n board[row][col] = str(num_bombs)\n\n return board\n\n def isValidCell(self, board: list[list[str]], row: int, col: int) -> bool:\n return row >= 0 and row < len(board) and col >= 0 and col < len(board[row])","runtime":"138"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n i,j = click[0],click[1]\n\n if board [i][j] == 'M':\n board [i][j] = 'X'\n return board\n m,n = len(board),len(board[0])\n st = [(i,j)]\n dirs = [(-1,-1),(-1,0),(-1,1),(0,-1),(0,1),(1,-1),(1,0),(1,1)] \n\n while st:\n x,y = st.pop()\n\n if board [x][y] == 'E':\n cnt = 0\n for dx,dy in dirs:\n new_x, new_y = x+dx, y+dy\n if 0<=new_x<m and 0<=new_y<n and board[new_x][new_y] == 'M':\n cnt += 1\n\n if cnt == 0:\n board [x][y] = 'B'\n for dx,dy in dirs:\n new_x, new_y = x+dx, y+dy\n if 0<=new_x<m and 0<=new_y<n:\n st.append ((new_x,new_y))\n else:\n board [x][y] = str(cnt) \n return board \n\n\n \n ","runtime":"140"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m = len(board)\n n = len(board[0])\n moves = [(0, -1), (-1, -1), (-1, 0), (-1, 1),\n (0, 1), (1, 1), (1, 0), (1, -1)]\n\n def dfs(i, j):\n if board[i][j] == 'M':\n board[i][j] = 'X'\n return\n \n count = 0\n for di, dj in moves:\n ii = i + di\n jj = j + dj\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'M':\n count += 1\n if count > 0:\n board[i][j] = str(count)\n else:\n board[i][j] = 'B'\n for di, dj in moves:\n ii = i + di\n jj = j + dj\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'E':\n dfs(ii, jj)\n return\n \n dfs(click[0], click[1])\n return board\n","runtime":"143"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n d = [(-1,0),(1,0),(0,1),(0,-1),(-1,1),(1,1),(1,-1),(-1,-1)]\n n, m = len(board), len(board[0])\n def count(i,j):\n c = 0\n for d1, d2 in d:\n dx, dy = i+d1, j+d2\n if 0<=dx<n and 0<=dy<m and board[dx][dy]=='M':\n c+=1\n return c\n \n def dfs(i,j):\n if board[i][j]!='E':\n return\n c = count(i,j)\n if c!=0:\n board[i][j] = str(c)\n return\n board[i][j]='B'\n for d1, d2 in d:\n dx, dy = i+d1, j+d2\n if 0<=dx<n and 0<=dy<m:\n dfs(dx, dy)\n return\n\n x, y = click[0], click[1]\n if board[x][y]=='M':\n board[x][y]='X'\n return board\n \n dfs(x,y)\n return board\n \n ","runtime":"144"},{"code":"from typing import List\n\nclass Solution:\n # Helper function: Count adjacent mines for a given cell\n def count_adjacent_mines(self, board: List[List[str]], r: int, c: int) -> int:\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]\n count = 0\n for dr, dc in directions:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'M':\n count += 1\n return count\n\n # Helper function: Perform DFS to reveal squares recursively\n def dfs(self, board: List[List[str]], r: int, c: int) -> None:\n # If the current square is not an unrevealed empty square, return\n if board[r][c] != 'E':\n return\n \n # Count adjacent mines\n mine_count = self.count_adjacent_mines(board, r, c)\n \n if mine_count > 0:\n # If there are adjacent mines, update the square with the count\n board[r][c] = str(mine_count)\n else:\n # If no adjacent mines, mark the square as 'B'\n board[r][c] = 'B'\n # Recursively reveal adjacent squares\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]\n for dr, dc in directions:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]):\n self.dfs(board, nr, nc)\n\n # Main function\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r, c = click\n \n # If the clicked square is a mine, the game is over\n if board[r][c] == 'M':\n board[r][c] = 'X'\n return board\n \n # Start DFS from the clicked square\n self.dfs(board, r, c)\n \n return board\n","runtime":"145"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n self.m = len(board)\n self.n = len(board[0])\n dirs = [\n (1,1), \n (1,0), \n (0,1),\n (1,-1),\n (-1,1),\n (-1,0),\n (0,-1),\n (-1,-1)\n ]\n\n def count_proximity(r, c):\n count = 0\n for dr, dc in dirs:\n if 0 <= r + dr < self.m and 0 <= c + dc < self.n and board[r+dr][c+dc] == 'M':\n count +=1\n return count\n\n def click_tile(r, c):\n value = board[r][c]\n\n if value == 'M':\n board[r][c] = 'X'\n elif value == 'E':\n nearby_bombs = count_proximity(r, c)\n\n if nearby_bombs > 0:\n board[r][c] = str(nearby_bombs)\n else:\n board[r][c] = 'B'\n for dr, dc in dirs:\n if 0 <= r + dr < self.m and 0 <= c + dc < self.n:\n click_tile(r+dr, c+dc)\n\n click_tile(click[0], click[1])\n \n return board\n\n ","runtime":"146"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n n = len(board)\n m = len(board[0])\n directions = [\n (-1,-1), (-1,0), (-1,1),\n (0,-1), (0,1),\n (1,-1), (1,0), (1,1)\n ]\n def reveal(x,y):\n if board[y][x] == 'B':\n return 'B'\n if board[y][x] == 'M':\n return 'M'\n num_mines = 0\n for dy, dx in directions:\n i = y+dy\n j = x+dx\n if (i,j) == (y,x):\n continue\n if 0 <= i < n and 0 <= j < m:\n if board[i][j] == 'M':\n num_mines += 1\n return str(num_mines) if num_mines > 0 else 'B'\n # DFS all empty squares\n def revealEmpty(x, y):\n d = deque([(y,x)])\n seen = set([(y,x)])\n while d:\n i, j = d.popleft()\n board[i][j] = reveal(j,i)\n \n if board[i][j].isnumeric():\n continue\n \n for dy, dx in directions:\n ny, nx = i+dy, j+dx\n if 0 <= ny < n and 0 <= nx < m and (ny,nx) not in seen:\n d.append((ny,nx))\n seen.add((ny,nx))\n\n x = click[1]\n y = click[0]\n cell = board[click[0]][click[1]]\n if cell == \"B\":\n pass\n elif cell == \"E\":\n revealEmpty(x,y)\n if cell == 'M':\n board[click[0]][click[1]] = 'X'\n \n\n return board\n","runtime":"147"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def bombs(r, c):\n res = 0\n for dr, dc in directions:\n new_r, new_c = r + dr, c + dc\n if (min(new_r, new_c) >= 0 and \n new_r < m and \n new_c < n and\n board[new_r][new_c] == \"M\"):\n res += 1\n return res\n\n m, n = len(board), len(board[0])\n res = [r[:] for r in board]\n if board[click[0]][click[1]] == \"M\":\n res[click[0]][click[1]] = \"X\"\n return res\n directions = [[-1, -1], [-1, 0], [-1, 1],\n [0, -1], [0, 1],\n [1, -1], [1, 0], [1, 1]]\n q = deque([(click[0], click[1])])\n visit = set([(click[0], click[1])])\n while q:\n r, c = q.popleft()\n b = bombs(r, c)\n\n if b == 0:\n if board[r][c] == \"M\":\n res[r][c] = \"M\"\n else:\n res[r][c] = \"B\"\n for dr, dc in directions:\n new_r, new_c = r + dr, c + dc\n if (min(new_r, new_c) >= 0 and \n new_r < m and \n new_c < n and\n board[new_r][new_c] == \"E\" and\n (new_r, new_c) not in visit):\n q.append((new_r, new_c))\n visit.add((new_r, new_c))\n else:\n res[r][c] = str(b)\n return res\n","runtime":"148"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n # check if clicked cell is a mine\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n\n # define directions to search for mines\n dirs = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\n\n # define a helper function to count adjacent mines\n def countMines(row, col):\n count = 0\n for r, c in dirs:\n if 0 <= row+r < len(board) and 0 <= col+c < len(board[0]) and board[row+r][col+c] == 'M':\n count += 1\n return count\n\n # define a helper function for dfs to reveal empty cells\n def dfs(row, col):\n # check if current cell is out of bounds or already revealed\n if not 0 <= row < len(board) or not 0 <= col < len(board[0]) or board[row][col] != 'E':\n return\n\n # count adjacent mines and update current cell\n mines = countMines(row, col)\n if mines > 0:\n board[row][col] = str(mines)\n else:\n board[row][col] = 'B'\n for r, c in dirs:\n dfs(row+r, col+c)\n\n # call dfs on clicked cell and return board\n dfs(click[0], click[1])\n return board","runtime":"149"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \n # we only have a single click in our click array\n def spread(board, row, col):\n # spreads B recursively \n # check for adjacent mines:\n num_mines = 0\n for i in range(-1,2):\n for j in range(-1,2):\n if row+i >= 0 and row+i < len(board) and col+j >= 0 and col+j < len(board[0]):\n if board[row+i][col+j] == 'M':\n num_mines += 1\n if num_mines > 0:\n board[row][col] = str(num_mines)\n return\n\n # spread the B\n board[row][col] = 'B'\n # print(board)\n for i in range(-1,2):\n for j in range(-1,2):\n if row+i >= 0 and row+i < len(board) and col+j >= 0 and col+j < len(board[0]):\n \n if board[row+i][col+j] == 'E':\n spread(board, row+i, col+j)\n row,col = click\n if board[row][col] == 'M':\n board[row][col] = 'X'\n \n elif board[row][col] == 'E':\n spread(board, row, col)\n\n return board\n","runtime":"150"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n return self.bfs(board, click)\n \n def __init__(self):\n # Directions for 8 neighboring cells (excluding (0, 0))\n self.directions = [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (-1, -1), (1, -1), (-1, 1)]\n\n def bfs(self, board, click):\n # Queue for BFS, starting with the clicked cell\n queue = collections.deque([click])\n visited = set()\n\n while queue:\n row, col = queue.popleft()\n\n # If we click on a mine, mark it as 'X' and return\n if board[row][col] == 'M':\n board[row][col] = 'X'\n return board\n\n # Count bombs around the current cell\n bomb_count = 0\n neighbors = []\n\n for dir in self.directions:\n neighbor_row, neighbor_col = row + dir[0], col + dir[1]\n\n # Ensure the neighbor is within bounds\n if 0 <= neighbor_row < len(board) and 0 <= neighbor_col < len(board[0]):\n if board[neighbor_row][neighbor_col] == 'M':\n bomb_count += 1\n else:\n neighbors.append((neighbor_row, neighbor_col))\n\n # If there are adjacent bombs, mark the current cell with the bomb count\n if bomb_count > 0:\n board[row][col] = str(bomb_count)\n else:\n # If no adjacent bombs, mark it as 'B' (blank) and continue BFS\n board[row][col] = 'B'\n for neighbor in neighbors:\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append(neighbor)\n\n return board","runtime":"150"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n click_r, click_c = click\n if board[click_r][click_c] == \"M\":\n board[click_r][click_c] = \"X\"\n return board\n \n def num_adjacent_mines(i: int, j: int) -> int:\n count = 0\n if i > 0:\n if board[i-1][j] == \"M\":\n count += 1\n if j > 0 and board[i-1][j-1] == \"M\":\n count += 1\n if j < len(board[0])-1 and board[i-1][j+1] == \"M\":\n count += 1\n if j > 0:\n if board[i][j-1] == \"M\":\n count += 1\n if i < len(board)-1 and board[i+1][j-1] == \"M\":\n count += 1\n if i < len(board)-1:\n if board[i+1][j] == \"M\":\n count += 1\n if j < len(board[0])-1:\n if board[i][j+1] == \"M\":\n count += 1\n if i < len(board)-1 and board[i+1][j+1] == \"M\":\n count += 1\n return count\n\n def reveal(i: int, j: int) -> None:\n if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):\n return\n if board[i][j] != \"E\":\n return\n num_mines = num_adjacent_mines(i, j)\n if num_mines == 0:\n board[i][j] = \"B\"\n reveal(i+1, j)\n reveal(i-1, j)\n reveal(i, j+1)\n reveal(i, j-1)\n reveal(i+1, j+1)\n reveal(i-1, j-1)\n reveal(i+1, j-1)\n reveal(i-1, j+1)\n else:\n board[i][j] = str(num_mines)\n\n reveal(click_r, click_c)\n return board\n","runtime":"151"},{"code":"class Solution:\n\n\n def has_no_bombs_adjacent(self, board, r, c):\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]):\n if board[nr][nc] == 'X' or board[nr][nc] == 'M':\n return False \n return True \n\n\n def updateEmpty(self, board, r, c):\n if self.has_no_bombs_adjacent(board, r, c):\n # need to recurse \n board[r][c] = 'B'\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'E':\n self.updateEmpty(board, nr, nc) \n \n else:\n my_count = 0\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'M':\n my_count += 1 \n board[r][c] = str(my_count) \n\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \n clicked_square = board[click[0]][click[1]]\n\n if clicked_square == 'M':\n board[click[0]][click[1]] = 'X'\n elif clicked_square == 'E':\n self.updateEmpty(board, click[0], click[1]) \n\n return board ","runtime":"152"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n r, c = click[0], click[1]\n if board[r][c] == 'M':\n board[r][c] = \"X\"\n return board\n\n def dfs(r, c, visited):\n if (r, c) not in visited:\n visited.add((r, c))\n count = 0\n adj = []\n for r_off, c_off in [[1, 0], [-1, 0], [0, 1], [0, -1], [-1, -1], [1, -1], [-1, 1], [1, 1]]:\n new_r, new_c = r + r_off, c + c_off\n if new_r in range(m) and new_c in range(n):\n if board[new_r][new_c] == 'M':\n adj.append((new_r, new_c))\n count += 1\n elif board[new_r][new_c] == 'E':\n adj.append((new_r, new_c)) \n if count:\n board[r][c] = str(count)\n else:\n board[r][c] = 'B'\n for r, c in adj:\n dfs(r, c, visited)\n\n\n visited = set() \n dfs(r, c, visited)\n\n return board","runtime":"153"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \n if not board:\n return []\n\n m, n = len(board), len(board[0])\n i, j = click[0], click[1]\n\n # If a mine ('M') is revealed, then the game is over - change it to 'X'.\n if board[i][j] == 'M':\n board[i][j] = 'X'\n return board\n\n # run dfs to reveal the board\n self.dfs(board, i, j)\n return board\n\n def dfs(self, board, i, j):\n if board[i][j] != 'E':\n return\n\n m, n = len(board), len(board[0]) \n directions = [(-1,-1), (0,-1), (1,-1), (1,0), (1,1), (0,1), (-1,1), (-1,0)]\n\n mine_count = 0\n\n for d in directions:\n ni, nj = i + d[0], j + d[1]\n if 0 <= ni < m and 0 <= nj < n and board[ni][nj] == 'M': \n mine_count += 1\n\n if mine_count == 0:\n board[i][j] = 'B'\n else:\n board[i][j] = str(mine_count)\n return\n\n for d in directions:\n ni, nj = i + d[0], j + d[1]\n if 0 <= ni < m and 0 <= nj < n:\n self.dfs(board, ni, nj)\n","runtime":"154"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def neighbors(r,c,board):\n for i in range(r - 1, r+2):\n for j in range(c - 1, c+2):\n if i < 0 or j < 0: continue\n if i >= len(board) or j >= len(board[0]): continue\n yield (board[i][j], i,j)\n\n def dfs(r,c, board):\n val = board[r][c]\n if val == 'M':\n board[r][c] = 'X'\n return board\n elif val == 'E':\n n_bombs = 0\n recurses = []\n for neighbor_val, i,j in neighbors(r,c, board):\n if neighbor_val == 'M':\n n_bombs += 1\n elif neighbor_val == 'E':\n recurses.append((i,j))\n if n_bombs > 0:\n board[r][c] = str(n_bombs)\n else:\n board[r][c] = 'B'\n for i,j in recurses:\n board = dfs(i,j, board)\n return board\n\n return dfs(click[0], click[1], board)","runtime":"154"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n m, n = len(board), len(board[0])\n q = deque()\n q.append(click)\n visited = set()\n visited.add(tuple(click))\n while q:\n for _ in range(len(q)):\n curr = q.popleft()\n x, y = curr[0], curr[1]\n count_mine = 0\n for a,b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\n nx, ny = x+a, y+b\n\n if 0 <= nx < m and 0 <= ny < n:\n if board[nx][ny] == 'M':\n count_mine += 1\n if count_mine > 0:\n board[x][y] = str(count_mine)\n else:\n board[x][y] = 'B'\n for a, b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\n nx, ny = x+a, y+b\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited:\n q.append([nx,ny])\n visited.add((nx,ny))\n return board","runtime":"155"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \"\"\"\n Recursive Approach: DFS\n \"\"\"\n if not board:\n return board\n\n DIRECTIONS = [(1, 0), (-1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (-1, 1), (1, -1)]\n ROWS, COLS = len(board), len(board[0])\n CLICK_R, CLICK_C = click \n\n def count_mines(row, col):\n count = 0\n for dr, dc in DIRECTIONS:\n new_r, new_c = row + dr, col + dc\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'M'):\n count += 1\n return count\n\n def explore_cell(row, col):\n adj_mines = count_mines(row, col)\n\n if adj_mines > 0:\n board[row][col] = str(adj_mines)\n else:\n board[row][col] = 'B'\n for dr, dc in DIRECTIONS:\n new_r, new_c = row + dr, col + dc\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'E'):\n explore_cell(new_r, new_c)\n\n if board[CLICK_R][CLICK_C] == 'M':\n board[CLICK_R][CLICK_C] = 'X'\n else:\n explore_cell(CLICK_R, CLICK_C) # Click on 'E'\n \n return board\n\n # O(m * n) time.\n # O(m * n) auxiliary space.\n # O(m * n) total space.","runtime":"155"},{"code":"'''\nUnderstanding the Problem\nExample 1:\nInput: board = [\n [\"E\",\"E\",\"E\",\"E\",\"E\"],\n [\"E\",\"E\",\"M\",\"E\",\"E\"],\n [\"E\",\"E\",\"E\",\"E\",\"E\"],\n [\"E\",\"E\",\"E\",\"E\",\"E\"]], click = [3,0]\nOutput: [\n [\"B\",\"1\",\"E\",\"1\",\"B\"],\n [\"B\",\"1\",\"M\",\"1\",\"B\"],\n [\"B\",\"1\",\"1\",\"1\",\"B\"],\n [\"B\",\"B\",\"B\",\"B\",\"B\"]]\n\nExample 2:\nInput: board = [\n [\"B\",\"1\",\"E\",\"1\",\"B\"],\n [\"B\",\"1\",\"M\",\"1\",\"B\"],\n [\"B\",\"1\",\"1\",\"1\",\"B\"],\n [\"B\",\"B\",\"B\",\"B\",\"B\"]], click = [1,2]\nOutput: [\n [\"B\",\"1\",\"E\",\"1\",\"B\"],\n [\"B\",\"1\",\"X\",\"1\",\"B\"],\n [\"B\",\"1\",\"1\",\"1\",\"B\"],\n [\"B\",\"B\",\"B\",\"B\",\"B\"]]\n\n\nDesign a solution\nstart at the click \nqueue = (adjecent(square))\nif the element popped is blank then add its ajacent to the queue\n1. check no mine in adjacency\n 2. append that adjacent elements in the queue\n3. count adjacent mines in all directions\n\nVerify the solution\n\nImplement and test\n\n'''\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n # Check if clicked cell is a mine\n if board[click[0]][click[1]] == 'M':\n # If it is a mine, mark it as X and return the board\n board[click[0]][click[1]] = 'X'\n return board\n\n # Define the 8 possible directions to move in the grid (N, NE, E, SE, S, SW, W, NW)\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\n\n # Use deque for efficient popping from the fron\n from collections import deque\n dq = deque([click])\n\n # Get the number of rows and columns in the board\n rows = len(board)\n cols = len(board[0])\n\n # Process cells in the deque\n while dq:\n x, y = dq.popleft()\n # If the cell is empty\n if board[x][y] == 'E':\n bombs = 0\n # Check all adjacent cells for mines\n for r, c in directions:\n new_row, new_col = x+r, y+c\n # Check if new row and column are withing the bounds\n if 0 <= new_row < rows and 0 <= new_col < cols:\n if board[new_row][new_col] == 'M':\n bombs += 1\n # If there are adjacent mines, mark the cell with the number of mines\n if bombs:\n board[x][y] = str(bombs)\n else:\n # If no adjacent mines, mark the cell as B and add all adjacent empty cells to the deque\n board[x][y] = 'B'\n for r, c in directions:\n new_row, new_col = x+r, y+c\n if 0 <= new_row < rows and 0 <= new_col < cols and board[new_row][new_col] == 'E':\n dq.append([new_row, new_col])\n\n return board\n\n ","runtime":"156"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r, c = click\n if board[r][c] == \"M\":\n board[r][c] = \"X\"\n return board\n\n m, n = len(board), len(board[0])\n ranges = [-1, 0, 1]\n dirs = []\n for i in ranges:\n for j in ranges:\n if not (i == 0 and j == 0):\n dirs.append([i, j])\n\n def in_bounds(x, y):\n return 0 <= x < m and 0 <= y < n\n\n def dfs(i, j):\n if not in_bounds(i, j) or board[i][j] != \"E\":\n return\n num_bombs = 0\n for x, y in dirs:\n n_x, n_y = i + x, j + y\n if not in_bounds(n_x, n_y):\n continue\n if board[n_x][n_y] == \"M\":\n num_bombs += 1\n if num_bombs:\n board[i][j] = str(num_bombs)\n else:\n board[i][j] = \"B\"\n for x, y in dirs:\n n_x, n_y = i + x, j + y\n dfs(n_x, n_y)\n\n dfs(r, c)\n return board\n","runtime":"157"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n rows = len(board)\n cols = len(board[0])\n if board[click[0]][click[1]] == \"M\":\n board[click[0]][click[1]] = 'X'\n return board\n\n elif board[click[0]][click[1]] == \"E\":\n x = click[0]\n y = click[1]\n poss = [(x - 1, y - 1), (x - 1, y), (x - 1, y + 1), (x, y - 1), (x, y + 1), (x + 1, y - 1), (x + 1, y), (x + 1, y + 1)]\n mines = 0\n consider = []\n for (a, b) in poss:\n if 0 <= a and a < rows and 0 <= b and b < cols:\n if board[a][b] == 'M':\n mines += 1\n if board[a][b] != 'B':\n consider.append((a,b))\n\n if mines > 0:\n board[x][y] = str(mines)\n else:\n board[x][y] = 'B'\n for p1, p2 in consider:\n board = self.updateBoard(board, [p1, p2])\n \n return board\n","runtime":"157"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n\n q = collections.deque([click])\n visited = set([tuple(click)])\n while q:\n r, c = q.popleft()\n digit = 0\n for dr, dc in [(0,1),(1,0),(0,-1),(-1,0),(1,1),(-1,-1),(1,-1),(-1,1)]:\n nr, nc = r+dr, c+dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[nr]) and board[nr][nc] == 'M':\n digit += 1\n if digit:\n board[r][c] = str(digit)\n else:\n board[r][c] = 'B'\n for dr, dc in [(0,1),(1,0),(0,-1),(-1,0),(1,1),(-1,-1),(1,-1),(-1,1)]:\n nr, nc = r+dr, c+dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[nr]) and (nr, nc) not in visited:\n visited.add((nr,nc))\n q.append([nr,nc])\n return board","runtime":"158"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def countMines(i, j): # 0,3\n mines = 0\n for x,y in [(0,1),(0,-1),(-1,-1),(1,0),(-1,0),(1,1),(1,-1),(-1,1)]:\n if 0 <= i+x < m and 0 <= j+y < n and board[i+x][j+y] == 'M':\n mines += 1\n return mines # 1\n\n def dfs(i, j): # 3,0/3,1-4/2-0,4/0,4/0,3/1,3\n if board[i][j] == 'E':\n mines = countMines(i, j)\n if mines != 0: # 1\n board[i][j] = str(mines) # fill and stop: 0,3=1,1,3=1\n else: # fill recursively!\n board[i][j] = 'B' # 3,0/3,1-4/2-0,4/0,4/\n for x,y in [(0,1),(0,-1),(-1,-1),(1,0),(-1,0),(1,1),(1,-1),(-1,1)]:\n if 0 <= i+x < m and 0 <= j+y < n and board[i+x][j+y] == 'E': # 3,0/3,1-4/2-0,4/0,4/0,3/1,3/\n dfs(i+x, j+y) # 3,0/4,1-4/2,4/0,4/\n \n \n m, n = len(board), len(board[0])\n i, j = click\n # M -> X\n if board[i][j] == 'M':\n board[i][j] = 'X'\n return board\n # E -> check mines around, if any, fill 1-8, else fill as B recursively\n if board[i][j] == 'E':\n dfs(i, j)\n return board\n\n\n","runtime":"158"},{"code":"import queue\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r, c = click\n\n if board[r][c] == 'M':\n board[r][c] = 'X'\n return board\n \n q = queue.Queue()\n q.put((r, c))\n board[r][c] = 'B'\n \n while not q.empty():\n sz = q.qsize()\n for _ in range(sz):\n i, j = q.get()\n count = self.countMines(board, i, j)\n if count > 0:\n board[i][j] = str(count)\n continue\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\n _i, _j = i + di, j + dj\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\n continue\n if board[_i][_j] == 'E':\n board[_i][_j] = 'B'\n q.put((_i, _j))\n return board\n\n def countMines(self, board, i, j):\n count = 0\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\n _i, _j = i + di, j + dj\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\n continue\n if board[_i][_j] == 'M':\n count += 1\n return count","runtime":"159"},{"code":"class Solution:\n def getnums(self,board,x,y):\n num=0\n for i in range(x-1,x+2):\n for j in range(y-1,y+2):\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]=='M':\n num+=1\n return num \n\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if not board:\n return board\n x,y=click\n if board[x][y]=='M':\n board[x][y]='X'\n else:\n num=self.getnums(board,x,y)\n if num:\n board[x][y]=str(num)\n else:\n board[x][y]='B'\n for i in range(x-1,x+2):\n for j in range(y-1,y+2):\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]!='B':\n self.updateBoard(board,[i,j])\n return board \n","runtime":"159"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if not board: return []\n # Goal of question: We only recurse on empty cells\n # if a empty square sees a cell with a digit, then it should not recurse\n directions = [(1,0),(-1,0),(0,-1),(0,1), (1,1),(-1, -1),(1,-1),(-1,1)]\n maxR = len(board)\n maxC = len(board[0])\n def dfs(r,c):\n # if r not in range(0,maxR) or c not in range(0,maxC): return\n if board[r][c] == 'E':\n bomba = 0\n for incr, incc in directions:\n nr, nc = r + incr, c + incc\n if 0<=nr< maxR and 0 <= nc < maxC: # in range\n if board[nr][nc] == 'M' or board[nr][nc] == 'X':\n bomba +=1\n if bomba == 0:\n board[r][c] = 'B'\n for incr, incc in directions:\n nr, nc = r+incr, c + incc\n if 0<=nr< maxR and 0 <= nc < maxC: # in range\n dfs(nr,nc)\n else:\n board[r][c] = str(bomba)\n return\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n else:\n dfs(click[0],click[1])\n return board\n \n\n \n\n\n\n \n \n ","runtime":"160"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n click_r, click_c = click\n if board[click_r][click_c] == \"M\":\n board[click_r][click_c] = \"X\"\n return board\n \n def num_adjacent_mines(i: int, j: int) -> int:\n count = 0\n if i > 0:\n if board[i-1][j] == \"M\":\n count += 1\n if j > 0 and board[i-1][j-1] == \"M\":\n count += 1\n if j < len(board[0])-1 and board[i-1][j+1] == \"M\":\n count += 1\n if j > 0:\n if board[i][j-1] == \"M\":\n count += 1\n if i < len(board)-1 and board[i+1][j-1] == \"M\":\n count += 1\n if i < len(board)-1:\n if board[i+1][j] == \"M\":\n count += 1\n if j < len(board[0])-1:\n if board[i][j+1] == \"M\":\n count += 1\n if i < len(board)-1 and board[i+1][j+1] == \"M\":\n count += 1\n print(f\"i: {i} j: {j} num adjacent mines: {count}\")\n return count\n\n def reveal(i: int, j: int) -> None:\n if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):\n return\n if board[i][j] != \"E\":\n return\n num_mines = num_adjacent_mines(i, j)\n if num_mines == 0:\n board[i][j] = \"B\"\n reveal(i+1, j)\n reveal(i-1, j)\n reveal(i, j+1)\n reveal(i, j-1)\n reveal(i+1, j+1)\n reveal(i-1, j-1)\n reveal(i+1, j-1)\n reveal(i-1, j+1)\n else:\n board[i][j] = str(num_mines)\n\n reveal(click_r, click_c)\n return board\n","runtime":"161"},{"code":"from collections import deque\nfrom typing import List\n\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def valid(x, y, board):\n m, n = len(board), len(board[0])\n return True if 0 <= x < m and 0 <= y < n else False\n\n def get_bombs(x, y, board):\n if not valid(x, y, board):\n return 0\n nums = 0\n for offset_x, offset_y in directions:\n cur_x, cur_y = x + offset_x, y + offset_y\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\n nums += 1\n return nums\n\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n elif board[x][y] != 'E':\n return board\n\n queue = deque()\n queue.append(click)\n \n while queue:\n cur_x, cur_y = queue.popleft()\n num_bombs = get_bombs(cur_x, cur_y, board)\n if num_bombs != 0:\n board[cur_x][cur_y] = str(num_bombs)\n else:\n board[cur_x][cur_y] = 'B'\n for offset_x, offset_y in directions:\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\n board[next_x][next_y] = 'B'\n queue.append([next_x,next_y])\n\n return board\n","runtime":"161"},{"code":"from collections import deque\nfrom typing import List\n\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def valid(x, y, board):\n m, n = len(board), len(board[0])\n return True if 0 <= x < m and 0 <= y < n else False\n\n def get_bombs(x, y, board):\n if not valid(x, y, board):\n return 0\n nums = 0\n for offset_x, offset_y in directions:\n cur_x, cur_y = x + offset_x, y + offset_y\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\n nums += 1\n return nums\n\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n elif board[x][y] != 'E':\n return board\n\n queue = deque()\n queue.append(click)\n \n while queue:\n cur_x, cur_y = queue.popleft()\n num_bombs = get_bombs(cur_x, cur_y, board)\n if num_bombs != 0:\n board[cur_x][cur_y] = str(num_bombs)\n else:\n board[cur_x][cur_y] = 'B'\n for offset_x, offset_y in directions:\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\n board[next_x][next_y] = 'B'\n queue.append([next_x,next_y])\n\n return board\n","runtime":"162"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def dfs(i: int, j: int):\n cnt = 0\n for x in range(max(0,i - 1), min(m,i + 2)):\n for y in range(max(0, j - 1), min(n, j + 2)):\n if board[x][y] == \"M\":\n cnt += 1\n if cnt:\n board[i][j] = str(cnt)\n else:\n board[i][j] = \"B\"\n for x in range(max(0,i - 1), min(m,i + 2)):\n for y in range(max(0,j - 1), min(n, j + 2)):\n if board[x][y] == \"E\":\n dfs(x, y)\n\n m, n = len(board), len(board[0])\n i, j = click\n if board[i][j] == \"M\":\n board[i][j] = \"X\"\n else:\n dfs(i, j)\n return board","runtime":"163"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r,c = click\n\n if 0 <= r < len(board) and 0 <= c < len(board[0]):\n if board[r][c] == \"M\":\n board[r][c] = \"X\"\n elif board[r][c] == \"E\":\n num_mines = self.get_adjacent_mines(board, (r,c))\n if num_mines == 0:\n board[r][c] = \"B\"\n self.updateBoard(board, (r - 1, c - 1))\n self.updateBoard(board, (r - 1, c))\n self.updateBoard(board, (r - 1, c + 1))\n self.updateBoard(board, (r + 1, c - 1))\n self.updateBoard(board, (r + 1, c))\n self.updateBoard(board, (r + 1, c + 1))\n self.updateBoard(board, (r, c - 1))\n self.updateBoard(board, (r, c + 1))\n else:\n board[r][c] = str(num_mines)\n\n\n return board\n\n def get_adjacent_mines(self, board, curr_cell):\n x, y = curr_cell\n\n num_mines = 0\n for i in range(x - 1, x + 2):\n for j in range(y - 1, y + 2):\n if 0 <= i < len(board) and 0 <= j < len(board[0]):\n if (i, j) != (x, y) and board[i][j] == \"M\":\n num_mines += 1\n\n return num_mines","runtime":"164"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m = len(board)\n n = len(board[0])\n r, c = click\n value = board[r][c]\n \n def get_adj(r, c):\n rc = [[r-1,c],[r-1,c+1],[r,c+1],[r+1,c+1],[r+1,c],[r+1,c-1],[r,c-1],[r-1,c-1]]\n return [[rr,cc] for rr, cc in rc if 0 <= rr < m and 0 <= cc < n]\n\n def get_num_adj_mines(r, c):\n rc = get_adj(r, c)\n return sum(1 for rr, cc in rc if board[rr][cc] == 'M')\n \n if value == 'M':\n board[r][c] = 'X'\n return board\n def helper(rr, cc):\n num_mines = get_num_adj_mines(rr, cc)\n if num_mines:\n board[rr][cc] = str(num_mines)\n else:\n board[rr][cc] = 'B'\n for _r, _c in get_adj(rr, cc):\n if board[_r][_c] == 'E':\n helper(_r, _c)\n helper(r, c)\n return board","runtime":"164"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n seen = [[False]*n for _ in range(m)]\n\n def countMine(i, j):\n cnt = 0\n if 0 <= i - 1 and 0 <= j - 1 and board[i-1][j-1] in ['M', 'X']:\n cnt += 1\n if 0 <= i - 1 and j + 1 < n and board[i-1][j+1] in ['M', 'X']:\n cnt += 1\n if i + 1 < m and 0 <= j - 1 and board[i+1][j-1] in ['M', 'X']:\n cnt += 1\n if i + 1 < m and j + 1 < n and board[i+1][j+1] in ['M', 'X']:\n cnt += 1\n if 0 <= i - 1 and board[i-1][j] in ['M', 'X']:\n cnt += 1\n if i + 1 < m and board[i+1][j] in ['M', 'X']:\n cnt += 1\n if 0 <= j - 1 and board[i][j-1] in ['M', 'X']:\n cnt += 1\n if j + 1 < n and board[i][j+1] in ['M', 'X']:\n cnt += 1\n return cnt\n \n def dfs(i, j, step):\n seen[i][j] = True\n test = board[i][j]\n if board[i][j] != 'E':\n return\n cnt = countMine(i, j)\n if cnt > 0:\n board[i][j] = str(cnt)\n return\n else:\n board[i][j] = 'B'\n if 0 <= i - 1 and 0 <= j - 1 and not seen[i-1][j-1]:\n dfs(i-1, j-1, step+1)\n if 0 <= i - 1 and j + 1 < n and not seen[i-1][j+1]:\n dfs(i-1, j+1, step+1)\n if i + 1 < m and 0 <= j - 1 and not seen[i+1][j-1]:\n dfs(i+1, j-1, step+1)\n if i + 1 < m and j + 1 < n and not seen[i+1][j+1]:\n dfs(i+1, j+1, step+1)\n if 0 <= i - 1 and not seen[i-1][j]:\n dfs(i-1, j, step+1)\n if i + 1 < m and not seen[i+1][j]:\n dfs(i+1, j, step+1)\n if 0 <= j - 1 and not seen[i][j-1]:\n dfs(i, j-1, step+1)\n if j + 1 < n and not seen[i][j+1]:\n dfs(i, j+1, step+1)\n return\n\n if board[click[0]][click[1]] in ['X', 'M', 'B','1', '2', '3', '4', '5', '6', '7', '8']:\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n dfs(click[0], click[1], 1)\n return board\n\n","runtime":"165"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n self.board = board\n m, n = len(self.board), len(self.board[0])\n def in_bounds(i, j):\n return 0 <= i < m and 0 <= j < n\n r, c = click\n if not in_bounds(r, c):\n return self.board\n if self.board[r][c] == \"M\":\n self.board[r][c] = \"X\"\n return self.board\n\n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\n didj.remove((0, 0))\n\n def dfs(i, j):\n if not in_bounds(i, j) or self.board[i][j] != \"E\":\n return\n bomb_count = 0\n for di, dj in didj:\n ni, nj = i+di, j+dj\n if in_bounds(ni, nj) and self.board[ni][nj] == \"M\":\n bomb_count += 1\n if bomb_count:\n self.board[i][j] = str(bomb_count)\n return\n self.board[i][j] = \"B\"\n for di, dj in didj:\n ni, nj = i+di, j+dj\n if in_bounds(ni, nj):\n dfs(ni, nj)\n dfs(r, c)\n return self.board\n","runtime":"166"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n self.board = board\n m, n = len(self.board), len(self.board[0])\n def in_bounds(r, c):\n return 0 <= r < m and 0 <= c < n\n r, c = click\n if not in_bounds(r, c):\n return self.board\n if self.board[r][c] == \"M\":\n self.board[r][c] = \"X\"\n return self.board\n \n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\n didj.remove((0, 0))\n def dfs(i, j):\n if not in_bounds(i, j) or self.board[i][j] != \"E\":\n return \n bomb_count = 0\n for di, dj in didj:\n ni, nj = i+di, j+dj\n if in_bounds(ni, nj) and self.board[ni][nj] == \"M\":\n bomb_count += 1\n if bomb_count:\n self.board[i][j] = str(bomb_count)\n return\n self.board[i][j] = \"B\"\n for di, dj in didj:\n ni, nj = i+di, j+dj\n dfs(ni, nj)\n return\n dfs(r, c)\n return self.board\n","runtime":"167"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def is_valid(row, col):\n return row >= 0 and col >=0 and row < len(board) and col < len(board[0])\n\n def count_mines(row, col):\n moves = [ [-1, -1], [-1, 0], [-1, 1], [0, 1], [1, 1], [1, 0], [1, -1], [0, -1] ]\n res = 0\n for dy, dx in moves:\n new_row = row + dy\n new_col = col + dx\n if is_valid(new_row, new_col):\n if board[new_row][new_col] == 'M':\n res += 1\n return res\n \n def reveal_blank(row, col):\n moves = [ [-1, -1], [-1, 0], [-1, 1], [0, 1], [1, 1], [1, 0], [1, -1], [0, -1] ]\n\n board[row][col] = 'B'\n for dy, dx in moves:\n new_row = row + dy\n new_col = col + dx\n if is_valid(new_row, new_col):\n if board[new_row][new_col] == 'E':\n reveal(new_row, new_col)\n\n def reveal(row, col):\n if board[row][col] == 'M':\n board[row][col] = 'X'\n return\n \n if board[row][col] == 'E':\n mines = count_mines(row, col)\n \n if mines == 0:\n reveal_blank(row, col)\n else:\n board[row][col] = str(mines)\n \n reveal(click[0], click[1])\n\n return board","runtime":"168"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n\n\n cr,cc= click[0],click[1]\n if board[cr][cc]=='M':\n board[cr][cc]='X'\n return board\n\n #precalculate:\n #for each cell, calculate number of bombs near it\n #inverse, instantiate all with '0' and then for each bomb, add +1 to its neighbors adj_bomc counters\n\n\n rows= len(board)\n cols= len(board[0])\n # bombs= [[0]*cols]*rows #PROBLEM\n bombs = [[0] * cols for _ in range(rows)]\n\n directions = [(0,1),(0,-1),(1,0),(-1,0),(-1,-1),(1,1),(-1,1),(1,-1)]\n for r in range(rows):\n for c in range(cols):\n if board[r][c]=='M':\n bombs[r][c]= 'X'\n for i,j in directions:\n nr,nc = r+i,c+j\n if 0<=nr<rows and 0<=nc<cols and bombs[nr][nc]!='X':\n bombs[nr][nc]+=1\n\n # print(bombs)\n\n # If click on a mine ('M'), mark it as 'X', stop further search.\n # If click on an empty cell ('E'), depends on how many surrounding mine:\n # 2.1 Has surrounding mine(s), mark it with number of surrounding mine(s), stop further search.\n # 2.2 No surrounding mine, mark it as 'B', continue search its 8 neighbors.\n\n def reveal(r,c):\n if r<0 or r>=rows or c<0 or c>=cols:\n return\n if board[r][c]!='E':\n return\n if bombs[r][c]!=0:\n board[r][c]=str(bombs[r][c])\n if bombs[r][c]==0:\n board[r][c]='B'\n for i,j in directions:\n nr,nc = r+i,c+j\n reveal(nr,nc)\n\n if board[cr][cc]=='E' and bombs[cr][cc]!=0:\n board[cr][cc]= str(bombs[cr][cc])\n return board\n\n reveal(cr,cc)\n return board\n\n\n\n\n\n\n\n \n","runtime":"168"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n\n return board\n\n directions = [(0,1), (0,-1), (1, 1), (1,0), (1,-1), (-1,0), (-1, -1), (-1, 1)] \n R,C = len(board), len(board[0])\n mp = defaultdict(int)\n def dfs(r,c):\n\n adj = [(r+dr, c+dc) for dr,dc in directions if r+dr in range(R) and c+dc in range(C)]\n\n mines = sum([board[x][y] == 'M' for x,y in adj])\n if mines:\n board[r][c] = str(mines)\n else:\n board[r][c] = 'B'\n for x,y in adj:\n if board[x][y] == 'E':\n dfs(x,y)\n\n dfs(*click)\n\n return board","runtime":"169"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n def dfs(x, y):\n if board[x][y] == 'M': board[x][y] = 'X'\n elif board[x][y] == 'E':\n cnt, nei = 0, []\n for i, j in map(lambda v: (v[0]+x, v[1]+y), [(-1, 0), (1, 0), (-1, -1), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)]):\n if 0 <= i < m and 0 <= j < n:\n nei.append((i, j))\n if board[i][j] == 'M': cnt += 1\n if not cnt:\n board[x][y] = 'B'\n for i, j in nei: dfs(i, j)\n else: board[x][y] = str(cnt)\n dfs(*click) \n return board","runtime":"170"},{"code":"dirs = [[-1,-1], [-1, 0], [-1,1],[1,0],[1,-1],[1,1],[0,-1],[0,1]]\nclass Solution:\n \n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n if board[click[0]][click[1]] != 'E':\n return board\n \n q = [(click[0], click[1])]\n processed = set()\n while q:\n pos = q.pop()\n processed.add(pos)\n c = 0\n for d in dirs:\n if 0<= pos[0]+d[0] < len(board) and 0<= pos[1]+d[1] <len(board[0]) and board[pos[0]+d[0]][pos[1]+d[1]] == 'M':\n c += 1\n if c != 0:\n board[pos[0]][pos[1]] = str(c)\n else:\n board[pos[0]][pos[1]] = 'B'\n for d in dirs:\n p = (pos[0]+d[0], pos[1]+d[1])\n if 0<= p[0] < len(board) and 0<= p[1] <len(board[0]) and p not in processed:\n q.append(p)\n \n return board\n\n \n def countMines(self, board, pos):\n c = 0\n for d in dirs:\n if 0<= pos[0]+d[0] < len(board) and 0<= pos[1]+d[1] <len(board[0]) and board[pos[0]+d[0]][pos[1]+d[1]] == 'M':\n c += 1\n return c\n","runtime":"171"},{"code":"# Data Structures and Algorithm: Matrix, Depth-First Search (DFS)\n# Intuition: Use DFS to reveal cells on the Minesweeper board. If a cell is a mine, change its value to 'X'. If it's empty, reveal surrounding cells.\n# Pseudo Code:\n# 1. If the clicked cell is a mine ('M'), change it to 'X' and return the board.\n# 2. If the clicked cell is an empty cell ('E'), count the number of surrounding mines.\n# 3. If there are no surrounding mines, mark the cell as 'B' and recursively reveal all surrounding cells.\n# 4. If there are surrounding mines, mark the cell with the number of mines.\n# 5. Return the updated board.\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def dfs(x, y):\n # If the cell is out of bounds or not an empty cell, return\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]) or board[x][y] != 'E':\n return\n \n # Count the number of surrounding mines\n mines = 0\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\n for dx, dy in directions:\n nx, ny = x + dx, y + dy\n if 0 <= nx < len(board) and 0 <= ny < len(board[0]) and board[nx][ny] == 'M':\n mines += 1\n \n # If there are surrounding mines, mark the cell with the number of mines\n if mines > 0:\n board[x][y] = str(mines)\n else:\n # If there are no surrounding mines, mark the cell as 'B' and reveal surrounding cells\n board[x][y] = 'B'\n for dx, dy in directions:\n dfs(x + dx, y + dy)\n\n # Get the coordinates of the click\n x, y = click\n \n # If the clicked cell is a mine, change it to 'X' and return the board\n if board[x][y] == 'M':\n board[x][y] = 'X'\n else:\n # Otherwise, perform DFS to reveal cells\n dfs(x, y)\n \n # Return the updated board\n return board","runtime":"172"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n\n if board[click[0]][click[1]] == 'M': \n board[click[0]][click[1]] = 'X'\n return board \n\n visited = set()\n self.dfs(board, click, visited)\n return board\n def inBounds(self, board, x, y, diffX, diffY): \n if x + diffX >= 0 and x + diffX < len(board): \n if y + diffY >= 0 and y + diffY < len(board[0]): \n return True\n else: return False\n\n def countMines(self, board, x, y): \n directions = [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [-1, -1], [1, -1], [-1, 1]]\n mines = 0\n for direction in directions: \n diffX, diffY = direction\n if self.inBounds(board, x, y, diffX, diffY) and board[x + diffX][y + diffY] == 'M':\n mines += 1\n return mines\n\n def dfs(self, board, point, visited): \n directions = [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [-1, -1], [1, -1], [-1, 1]]\n x, y = point \n print(point)\n countMines = self.countMines(board, x, y)\n if countMines == 0: \n board[x][y] = 'B'\n for direction in directions: \n diffX, diffY = direction\n if self.inBounds(board, x, y, diffX, diffY) and (x + diffX, y + diffY) not in visited: \n visited.add((x + diffX, y + diffY))\n self.dfs(board, (x + diffX, y + diffY), visited)\n else: \n board[x][y] = str(countMines)\n return \n","runtime":"173"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click[0], click[1]\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):\n return board\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n directions = [[x,y] for x in [-1,0,1] for y in [-1,0,1] if x != 0 or y !=0]\n if board[x][y] == 'E':\n total_mines = 0\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n if new_x < 0 or new_x >= len(board) or new_y < 0 or new_y >= len(board[0]):\n continue\n if board[new_x][new_y] == 'M':\n total_mines += 1\n if total_mines == 0:\n board[x][y] = 'B'\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n board = self.updateBoard(board, [new_x, new_y])\n if total_mines > 0:\n board[x][y] = str(total_mines)\n return board\n","runtime":"174"},{"code":"from typing import List\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n i, j = click\n \n if board[i][j] == 'M':\n board[i][j] = 'X'\n return board\n \n def count_mines(r, c):\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\n count = 0\n for dr, dc in directions:\n nr, nc = r + dr, c + dc\n if 0 <= nr < m and 0 <= nc < n and board[nr][nc] == 'M':\n count += 1\n return count\n \n def dfs(i, j):\n if board[i][j] != 'E':\n return\n \n mines = count_mines(i, j)\n if mines > 0:\n board[i][j] = str(mines)\n return\n \n board[i][j] = 'B'\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\n for dr, dc in directions:\n ni, nj = i + dr, j + dc\n if 0 <= ni < m and 0 <= nj < n:\n dfs(ni, nj)\n \n dfs(i, j)\n return board\n\n# Example usage:\nsolution = Solution()\nboard = [[\"E\",\"E\",\"E\",\"E\",\"E\"],[\"E\",\"E\",\"M\",\"E\",\"E\"],[\"E\",\"E\",\"E\",\"E\",\"E\"],[\"E\",\"E\",\"E\",\"E\",\"E\"]]\nclick = [3,0]\nprint(solution.updateBoard(board, click))","runtime":"175"}],"string":"[\n {\n \"code\": \"class Solution(object):\\n def updateBoard(self, board, click):\\n \\\"\\\"\\\"\\n :type board: List[List[str]]\\n :type click: List[int]\\n :rtype: List[List[str]]\\n \\\"\\\"\\\"\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n m = len(board)\\n n = len(board[0])\\n q = deque()\\n q.append(click)\\n visited = set()\\n visited.add(tuple(click))\\n while q:\\n # print(q)\\n for _ in range(len(q)):\\n curr = q.popleft()\\n x, y = curr[0], curr[1]\\n \\n \\n count_mine = 0\\n for a,b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\\n nx, ny = x+a, y+b\\n\\n if 0 <= nx < m and 0 <= ny < n:\\n if board[nx][ny] == 'M':\\n count_mine += 1\\n if count_mine > 0:\\n board[x][y] = str(count_mine)\\n else:\\n board[x][y] = 'B'\\n for a, b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\\n nx, ny = x+a, y+b\\n\\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited:\\n q.append([nx,ny])\\n visited.add((nx,ny))\\n return board\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n so what we could do is bfs \\n\\n so firstly, if click is a mine, then change it to x and return \\n\\n otherwise, for each node, check all eight directiosn and keep track of them in an array\\n\\n we will add these to the queue if current node is blank\\n\\n so basically it will go like this\\n\\n array of current nodes\\n count of bombs\\n\\n for each of the 8 directions\\n if its invalid or its in visited, then skip\\n \\n if its a bomb, then add to count of bombs\\n if its not a bomb, then add it to the array of current nodes\\n\\n if this array has 0 adjacent bombs\\n add each valid node to the queue and to the visited set \\n\\n '''\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]] == \\\"M\\\":\\n board[click[0]][click[1]] = \\\"X\\\"\\n return board\\n\\n q = deque([(click[0], click[1])])\\n visited = set()\\n directions = [(0, 1), (1, 0), (1, 1), (-1, 1), (1, -1), (-1, -1), (0, -1), (-1, 0)]\\n\\n while q:\\n row, col = q.popleft()\\n next_cells = []\\n num_bombs = 0\\n\\n for drow, dcol in directions:\\n new_row = row + drow\\n new_col = col + dcol\\n\\n if not self.isValidCell(board, new_row, new_col) or (new_row, new_col) in visited:\\n continue\\n\\n if board[new_row][new_col] == \\\"M\\\":\\n num_bombs += 1\\n else:\\n next_cells.append((new_row, new_col))\\n\\n if num_bombs == 0:\\n board[row][col] = \\\"B\\\"\\n\\n for cell_pos in next_cells:\\n q.append(cell_pos)\\n visited.add((cell_pos[0], cell_pos[1]))\\n else:\\n board[row][col] = str(num_bombs)\\n\\n return board\\n\\n def isValidCell(self, board: list[list[str]], row: int, col: int) -> bool:\\n return row >= 0 and row < len(board) and col >= 0 and col < len(board[row])\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n i,j = click[0],click[1]\\n\\n if board [i][j] == 'M':\\n board [i][j] = 'X'\\n return board\\n m,n = len(board),len(board[0])\\n st = [(i,j)]\\n dirs = [(-1,-1),(-1,0),(-1,1),(0,-1),(0,1),(1,-1),(1,0),(1,1)] \\n\\n while st:\\n x,y = st.pop()\\n\\n if board [x][y] == 'E':\\n cnt = 0\\n for dx,dy in dirs:\\n new_x, new_y = x+dx, y+dy\\n if 0<=new_x<m and 0<=new_y<n and board[new_x][new_y] == 'M':\\n cnt += 1\\n\\n if cnt == 0:\\n board [x][y] = 'B'\\n for dx,dy in dirs:\\n new_x, new_y = x+dx, y+dy\\n if 0<=new_x<m and 0<=new_y<n:\\n st.append ((new_x,new_y))\\n else:\\n board [x][y] = str(cnt) \\n return board \\n\\n\\n \\n \",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m = len(board)\\n n = len(board[0])\\n moves = [(0, -1), (-1, -1), (-1, 0), (-1, 1),\\n (0, 1), (1, 1), (1, 0), (1, -1)]\\n\\n def dfs(i, j):\\n if board[i][j] == 'M':\\n board[i][j] = 'X'\\n return\\n \\n count = 0\\n for di, dj in moves:\\n ii = i + di\\n jj = j + dj\\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'M':\\n count += 1\\n if count > 0:\\n board[i][j] = str(count)\\n else:\\n board[i][j] = 'B'\\n for di, dj in moves:\\n ii = i + di\\n jj = j + dj\\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'E':\\n dfs(ii, jj)\\n return\\n \\n dfs(click[0], click[1])\\n return board\\n\",\n \"runtime\": \"143\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n d = [(-1,0),(1,0),(0,1),(0,-1),(-1,1),(1,1),(1,-1),(-1,-1)]\\n n, m = len(board), len(board[0])\\n def count(i,j):\\n c = 0\\n for d1, d2 in d:\\n dx, dy = i+d1, j+d2\\n if 0<=dx<n and 0<=dy<m and board[dx][dy]=='M':\\n c+=1\\n return c\\n \\n def dfs(i,j):\\n if board[i][j]!='E':\\n return\\n c = count(i,j)\\n if c!=0:\\n board[i][j] = str(c)\\n return\\n board[i][j]='B'\\n for d1, d2 in d:\\n dx, dy = i+d1, j+d2\\n if 0<=dx<n and 0<=dy<m:\\n dfs(dx, dy)\\n return\\n\\n x, y = click[0], click[1]\\n if board[x][y]=='M':\\n board[x][y]='X'\\n return board\\n \\n dfs(x,y)\\n return board\\n \\n \",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n # Helper function: Count adjacent mines for a given cell\\n def count_adjacent_mines(self, board: List[List[str]], r: int, c: int) -> int:\\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]\\n count = 0\\n for dr, dc in directions:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'M':\\n count += 1\\n return count\\n\\n # Helper function: Perform DFS to reveal squares recursively\\n def dfs(self, board: List[List[str]], r: int, c: int) -> None:\\n # If the current square is not an unrevealed empty square, return\\n if board[r][c] != 'E':\\n return\\n \\n # Count adjacent mines\\n mine_count = self.count_adjacent_mines(board, r, c)\\n \\n if mine_count > 0:\\n # If there are adjacent mines, update the square with the count\\n board[r][c] = str(mine_count)\\n else:\\n # If no adjacent mines, mark the square as 'B'\\n board[r][c] = 'B'\\n # Recursively reveal adjacent squares\\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]\\n for dr, dc in directions:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]):\\n self.dfs(board, nr, nc)\\n\\n # Main function\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r, c = click\\n \\n # If the clicked square is a mine, the game is over\\n if board[r][c] == 'M':\\n board[r][c] = 'X'\\n return board\\n \\n # Start DFS from the clicked square\\n self.dfs(board, r, c)\\n \\n return board\\n\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n self.m = len(board)\\n self.n = len(board[0])\\n dirs = [\\n (1,1), \\n (1,0), \\n (0,1),\\n (1,-1),\\n (-1,1),\\n (-1,0),\\n (0,-1),\\n (-1,-1)\\n ]\\n\\n def count_proximity(r, c):\\n count = 0\\n for dr, dc in dirs:\\n if 0 <= r + dr < self.m and 0 <= c + dc < self.n and board[r+dr][c+dc] == 'M':\\n count +=1\\n return count\\n\\n def click_tile(r, c):\\n value = board[r][c]\\n\\n if value == 'M':\\n board[r][c] = 'X'\\n elif value == 'E':\\n nearby_bombs = count_proximity(r, c)\\n\\n if nearby_bombs > 0:\\n board[r][c] = str(nearby_bombs)\\n else:\\n board[r][c] = 'B'\\n for dr, dc in dirs:\\n if 0 <= r + dr < self.m and 0 <= c + dc < self.n:\\n click_tile(r+dr, c+dc)\\n\\n click_tile(click[0], click[1])\\n \\n return board\\n\\n \",\n \"runtime\": \"146\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n n = len(board)\\n m = len(board[0])\\n directions = [\\n (-1,-1), (-1,0), (-1,1),\\n (0,-1), (0,1),\\n (1,-1), (1,0), (1,1)\\n ]\\n def reveal(x,y):\\n if board[y][x] == 'B':\\n return 'B'\\n if board[y][x] == 'M':\\n return 'M'\\n num_mines = 0\\n for dy, dx in directions:\\n i = y+dy\\n j = x+dx\\n if (i,j) == (y,x):\\n continue\\n if 0 <= i < n and 0 <= j < m:\\n if board[i][j] == 'M':\\n num_mines += 1\\n return str(num_mines) if num_mines > 0 else 'B'\\n # DFS all empty squares\\n def revealEmpty(x, y):\\n d = deque([(y,x)])\\n seen = set([(y,x)])\\n while d:\\n i, j = d.popleft()\\n board[i][j] = reveal(j,i)\\n \\n if board[i][j].isnumeric():\\n continue\\n \\n for dy, dx in directions:\\n ny, nx = i+dy, j+dx\\n if 0 <= ny < n and 0 <= nx < m and (ny,nx) not in seen:\\n d.append((ny,nx))\\n seen.add((ny,nx))\\n\\n x = click[1]\\n y = click[0]\\n cell = board[click[0]][click[1]]\\n if cell == \\\"B\\\":\\n pass\\n elif cell == \\\"E\\\":\\n revealEmpty(x,y)\\n if cell == 'M':\\n board[click[0]][click[1]] = 'X'\\n \\n\\n return board\\n\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def bombs(r, c):\\n res = 0\\n for dr, dc in directions:\\n new_r, new_c = r + dr, c + dc\\n if (min(new_r, new_c) >= 0 and \\n new_r < m and \\n new_c < n and\\n board[new_r][new_c] == \\\"M\\\"):\\n res += 1\\n return res\\n\\n m, n = len(board), len(board[0])\\n res = [r[:] for r in board]\\n if board[click[0]][click[1]] == \\\"M\\\":\\n res[click[0]][click[1]] = \\\"X\\\"\\n return res\\n directions = [[-1, -1], [-1, 0], [-1, 1],\\n [0, -1], [0, 1],\\n [1, -1], [1, 0], [1, 1]]\\n q = deque([(click[0], click[1])])\\n visit = set([(click[0], click[1])])\\n while q:\\n r, c = q.popleft()\\n b = bombs(r, c)\\n\\n if b == 0:\\n if board[r][c] == \\\"M\\\":\\n res[r][c] = \\\"M\\\"\\n else:\\n res[r][c] = \\\"B\\\"\\n for dr, dc in directions:\\n new_r, new_c = r + dr, c + dc\\n if (min(new_r, new_c) >= 0 and \\n new_r < m and \\n new_c < n and\\n board[new_r][new_c] == \\\"E\\\" and\\n (new_r, new_c) not in visit):\\n q.append((new_r, new_c))\\n visit.add((new_r, new_c))\\n else:\\n res[r][c] = str(b)\\n return res\\n\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n # check if clicked cell is a mine\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n\\n # define directions to search for mines\\n dirs = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\\n\\n # define a helper function to count adjacent mines\\n def countMines(row, col):\\n count = 0\\n for r, c in dirs:\\n if 0 <= row+r < len(board) and 0 <= col+c < len(board[0]) and board[row+r][col+c] == 'M':\\n count += 1\\n return count\\n\\n # define a helper function for dfs to reveal empty cells\\n def dfs(row, col):\\n # check if current cell is out of bounds or already revealed\\n if not 0 <= row < len(board) or not 0 <= col < len(board[0]) or board[row][col] != 'E':\\n return\\n\\n # count adjacent mines and update current cell\\n mines = countMines(row, col)\\n if mines > 0:\\n board[row][col] = str(mines)\\n else:\\n board[row][col] = 'B'\\n for r, c in dirs:\\n dfs(row+r, col+c)\\n\\n # call dfs on clicked cell and return board\\n dfs(click[0], click[1])\\n return board\",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\n # we only have a single click in our click array\\n def spread(board, row, col):\\n # spreads B recursively \\n # check for adjacent mines:\\n num_mines = 0\\n for i in range(-1,2):\\n for j in range(-1,2):\\n if row+i >= 0 and row+i < len(board) and col+j >= 0 and col+j < len(board[0]):\\n if board[row+i][col+j] == 'M':\\n num_mines += 1\\n if num_mines > 0:\\n board[row][col] = str(num_mines)\\n return\\n\\n # spread the B\\n board[row][col] = 'B'\\n # print(board)\\n for i in range(-1,2):\\n for j in range(-1,2):\\n if row+i >= 0 and row+i < len(board) and col+j >= 0 and col+j < len(board[0]):\\n \\n if board[row+i][col+j] == 'E':\\n spread(board, row+i, col+j)\\n row,col = click\\n if board[row][col] == 'M':\\n board[row][col] = 'X'\\n \\n elif board[row][col] == 'E':\\n spread(board, row, col)\\n\\n return board\\n\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n return self.bfs(board, click)\\n \\n def __init__(self):\\n # Directions for 8 neighboring cells (excluding (0, 0))\\n self.directions = [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (-1, -1), (1, -1), (-1, 1)]\\n\\n def bfs(self, board, click):\\n # Queue for BFS, starting with the clicked cell\\n queue = collections.deque([click])\\n visited = set()\\n\\n while queue:\\n row, col = queue.popleft()\\n\\n # If we click on a mine, mark it as 'X' and return\\n if board[row][col] == 'M':\\n board[row][col] = 'X'\\n return board\\n\\n # Count bombs around the current cell\\n bomb_count = 0\\n neighbors = []\\n\\n for dir in self.directions:\\n neighbor_row, neighbor_col = row + dir[0], col + dir[1]\\n\\n # Ensure the neighbor is within bounds\\n if 0 <= neighbor_row < len(board) and 0 <= neighbor_col < len(board[0]):\\n if board[neighbor_row][neighbor_col] == 'M':\\n bomb_count += 1\\n else:\\n neighbors.append((neighbor_row, neighbor_col))\\n\\n # If there are adjacent bombs, mark the current cell with the bomb count\\n if bomb_count > 0:\\n board[row][col] = str(bomb_count)\\n else:\\n # If no adjacent bombs, mark it as 'B' (blank) and continue BFS\\n board[row][col] = 'B'\\n for neighbor in neighbors:\\n if neighbor not in visited:\\n visited.add(neighbor)\\n queue.append(neighbor)\\n\\n return board\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n click_r, click_c = click\\n if board[click_r][click_c] == \\\"M\\\":\\n board[click_r][click_c] = \\\"X\\\"\\n return board\\n \\n def num_adjacent_mines(i: int, j: int) -> int:\\n count = 0\\n if i > 0:\\n if board[i-1][j] == \\\"M\\\":\\n count += 1\\n if j > 0 and board[i-1][j-1] == \\\"M\\\":\\n count += 1\\n if j < len(board[0])-1 and board[i-1][j+1] == \\\"M\\\":\\n count += 1\\n if j > 0:\\n if board[i][j-1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1 and board[i+1][j-1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1:\\n if board[i+1][j] == \\\"M\\\":\\n count += 1\\n if j < len(board[0])-1:\\n if board[i][j+1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1 and board[i+1][j+1] == \\\"M\\\":\\n count += 1\\n return count\\n\\n def reveal(i: int, j: int) -> None:\\n if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):\\n return\\n if board[i][j] != \\\"E\\\":\\n return\\n num_mines = num_adjacent_mines(i, j)\\n if num_mines == 0:\\n board[i][j] = \\\"B\\\"\\n reveal(i+1, j)\\n reveal(i-1, j)\\n reveal(i, j+1)\\n reveal(i, j-1)\\n reveal(i+1, j+1)\\n reveal(i-1, j-1)\\n reveal(i+1, j-1)\\n reveal(i-1, j+1)\\n else:\\n board[i][j] = str(num_mines)\\n\\n reveal(click_r, click_c)\\n return board\\n\",\n \"runtime\": \"151\"\n },\n {\n \"code\": \"class Solution:\\n\\n\\n def has_no_bombs_adjacent(self, board, r, c):\\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]):\\n if board[nr][nc] == 'X' or board[nr][nc] == 'M':\\n return False \\n return True \\n\\n\\n def updateEmpty(self, board, r, c):\\n if self.has_no_bombs_adjacent(board, r, c):\\n # need to recurse \\n board[r][c] = 'B'\\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'E':\\n self.updateEmpty(board, nr, nc) \\n \\n else:\\n my_count = 0\\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'M':\\n my_count += 1 \\n board[r][c] = str(my_count) \\n\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\n clicked_square = board[click[0]][click[1]]\\n\\n if clicked_square == 'M':\\n board[click[0]][click[1]] = 'X'\\n elif clicked_square == 'E':\\n self.updateEmpty(board, click[0], click[1]) \\n\\n return board \",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n r, c = click[0], click[1]\\n if board[r][c] == 'M':\\n board[r][c] = \\\"X\\\"\\n return board\\n\\n def dfs(r, c, visited):\\n if (r, c) not in visited:\\n visited.add((r, c))\\n count = 0\\n adj = []\\n for r_off, c_off in [[1, 0], [-1, 0], [0, 1], [0, -1], [-1, -1], [1, -1], [-1, 1], [1, 1]]:\\n new_r, new_c = r + r_off, c + c_off\\n if new_r in range(m) and new_c in range(n):\\n if board[new_r][new_c] == 'M':\\n adj.append((new_r, new_c))\\n count += 1\\n elif board[new_r][new_c] == 'E':\\n adj.append((new_r, new_c)) \\n if count:\\n board[r][c] = str(count)\\n else:\\n board[r][c] = 'B'\\n for r, c in adj:\\n dfs(r, c, visited)\\n\\n\\n visited = set() \\n dfs(r, c, visited)\\n\\n return board\",\n \"runtime\": \"153\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\n if not board:\\n return []\\n\\n m, n = len(board), len(board[0])\\n i, j = click[0], click[1]\\n\\n # If a mine ('M') is revealed, then the game is over - change it to 'X'.\\n if board[i][j] == 'M':\\n board[i][j] = 'X'\\n return board\\n\\n # run dfs to reveal the board\\n self.dfs(board, i, j)\\n return board\\n\\n def dfs(self, board, i, j):\\n if board[i][j] != 'E':\\n return\\n\\n m, n = len(board), len(board[0]) \\n directions = [(-1,-1), (0,-1), (1,-1), (1,0), (1,1), (0,1), (-1,1), (-1,0)]\\n\\n mine_count = 0\\n\\n for d in directions:\\n ni, nj = i + d[0], j + d[1]\\n if 0 <= ni < m and 0 <= nj < n and board[ni][nj] == 'M': \\n mine_count += 1\\n\\n if mine_count == 0:\\n board[i][j] = 'B'\\n else:\\n board[i][j] = str(mine_count)\\n return\\n\\n for d in directions:\\n ni, nj = i + d[0], j + d[1]\\n if 0 <= ni < m and 0 <= nj < n:\\n self.dfs(board, ni, nj)\\n\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def neighbors(r,c,board):\\n for i in range(r - 1, r+2):\\n for j in range(c - 1, c+2):\\n if i < 0 or j < 0: continue\\n if i >= len(board) or j >= len(board[0]): continue\\n yield (board[i][j], i,j)\\n\\n def dfs(r,c, board):\\n val = board[r][c]\\n if val == 'M':\\n board[r][c] = 'X'\\n return board\\n elif val == 'E':\\n n_bombs = 0\\n recurses = []\\n for neighbor_val, i,j in neighbors(r,c, board):\\n if neighbor_val == 'M':\\n n_bombs += 1\\n elif neighbor_val == 'E':\\n recurses.append((i,j))\\n if n_bombs > 0:\\n board[r][c] = str(n_bombs)\\n else:\\n board[r][c] = 'B'\\n for i,j in recurses:\\n board = dfs(i,j, board)\\n return board\\n\\n return dfs(click[0], click[1], board)\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n m, n = len(board), len(board[0])\\n q = deque()\\n q.append(click)\\n visited = set()\\n visited.add(tuple(click))\\n while q:\\n for _ in range(len(q)):\\n curr = q.popleft()\\n x, y = curr[0], curr[1]\\n count_mine = 0\\n for a,b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\\n nx, ny = x+a, y+b\\n\\n if 0 <= nx < m and 0 <= ny < n:\\n if board[nx][ny] == 'M':\\n count_mine += 1\\n if count_mine > 0:\\n board[x][y] = str(count_mine)\\n else:\\n board[x][y] = 'B'\\n for a, b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\\n nx, ny = x+a, y+b\\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited:\\n q.append([nx,ny])\\n visited.add((nx,ny))\\n return board\",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\\"\\\"\\\"\\n Recursive Approach: DFS\\n \\\"\\\"\\\"\\n if not board:\\n return board\\n\\n DIRECTIONS = [(1, 0), (-1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (-1, 1), (1, -1)]\\n ROWS, COLS = len(board), len(board[0])\\n CLICK_R, CLICK_C = click \\n\\n def count_mines(row, col):\\n count = 0\\n for dr, dc in DIRECTIONS:\\n new_r, new_c = row + dr, col + dc\\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'M'):\\n count += 1\\n return count\\n\\n def explore_cell(row, col):\\n adj_mines = count_mines(row, col)\\n\\n if adj_mines > 0:\\n board[row][col] = str(adj_mines)\\n else:\\n board[row][col] = 'B'\\n for dr, dc in DIRECTIONS:\\n new_r, new_c = row + dr, col + dc\\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'E'):\\n explore_cell(new_r, new_c)\\n\\n if board[CLICK_R][CLICK_C] == 'M':\\n board[CLICK_R][CLICK_C] = 'X'\\n else:\\n explore_cell(CLICK_R, CLICK_C) # Click on 'E'\\n \\n return board\\n\\n # O(m * n) time.\\n # O(m * n) auxiliary space.\\n # O(m * n) total space.\",\n \"runtime\": \"155\"\n },\n {\n \"code\": \"'''\\nUnderstanding the Problem\\nExample 1:\\nInput: board = [\\n [\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\"],\\n [\\\"E\\\",\\\"E\\\",\\\"M\\\",\\\"E\\\",\\\"E\\\"],\\n [\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\"],\\n [\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\"]], click = [3,0]\\nOutput: [\\n [\\\"B\\\",\\\"1\\\",\\\"E\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"1\\\",\\\"M\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"B\\\",\\\"B\\\",\\\"B\\\",\\\"B\\\"]]\\n\\nExample 2:\\nInput: board = [\\n [\\\"B\\\",\\\"1\\\",\\\"E\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"1\\\",\\\"M\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"B\\\",\\\"B\\\",\\\"B\\\",\\\"B\\\"]], click = [1,2]\\nOutput: [\\n [\\\"B\\\",\\\"1\\\",\\\"E\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"1\\\",\\\"X\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"1\\\",\\\"1\\\",\\\"1\\\",\\\"B\\\"],\\n [\\\"B\\\",\\\"B\\\",\\\"B\\\",\\\"B\\\",\\\"B\\\"]]\\n\\n\\nDesign a solution\\nstart at the click \\nqueue = (adjecent(square))\\nif the element popped is blank then add its ajacent to the queue\\n1. check no mine in adjacency\\n 2. append that adjacent elements in the queue\\n3. count adjacent mines in all directions\\n\\nVerify the solution\\n\\nImplement and test\\n\\n'''\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n # Check if clicked cell is a mine\\n if board[click[0]][click[1]] == 'M':\\n # If it is a mine, mark it as X and return the board\\n board[click[0]][click[1]] = 'X'\\n return board\\n\\n # Define the 8 possible directions to move in the grid (N, NE, E, SE, S, SW, W, NW)\\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\\n\\n # Use deque for efficient popping from the fron\\n from collections import deque\\n dq = deque([click])\\n\\n # Get the number of rows and columns in the board\\n rows = len(board)\\n cols = len(board[0])\\n\\n # Process cells in the deque\\n while dq:\\n x, y = dq.popleft()\\n # If the cell is empty\\n if board[x][y] == 'E':\\n bombs = 0\\n # Check all adjacent cells for mines\\n for r, c in directions:\\n new_row, new_col = x+r, y+c\\n # Check if new row and column are withing the bounds\\n if 0 <= new_row < rows and 0 <= new_col < cols:\\n if board[new_row][new_col] == 'M':\\n bombs += 1\\n # If there are adjacent mines, mark the cell with the number of mines\\n if bombs:\\n board[x][y] = str(bombs)\\n else:\\n # If no adjacent mines, mark the cell as B and add all adjacent empty cells to the deque\\n board[x][y] = 'B'\\n for r, c in directions:\\n new_row, new_col = x+r, y+c\\n if 0 <= new_row < rows and 0 <= new_col < cols and board[new_row][new_col] == 'E':\\n dq.append([new_row, new_col])\\n\\n return board\\n\\n \",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r, c = click\\n if board[r][c] == \\\"M\\\":\\n board[r][c] = \\\"X\\\"\\n return board\\n\\n m, n = len(board), len(board[0])\\n ranges = [-1, 0, 1]\\n dirs = []\\n for i in ranges:\\n for j in ranges:\\n if not (i == 0 and j == 0):\\n dirs.append([i, j])\\n\\n def in_bounds(x, y):\\n return 0 <= x < m and 0 <= y < n\\n\\n def dfs(i, j):\\n if not in_bounds(i, j) or board[i][j] != \\\"E\\\":\\n return\\n num_bombs = 0\\n for x, y in dirs:\\n n_x, n_y = i + x, j + y\\n if not in_bounds(n_x, n_y):\\n continue\\n if board[n_x][n_y] == \\\"M\\\":\\n num_bombs += 1\\n if num_bombs:\\n board[i][j] = str(num_bombs)\\n else:\\n board[i][j] = \\\"B\\\"\\n for x, y in dirs:\\n n_x, n_y = i + x, j + y\\n dfs(n_x, n_y)\\n\\n dfs(r, c)\\n return board\\n\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n rows = len(board)\\n cols = len(board[0])\\n if board[click[0]][click[1]] == \\\"M\\\":\\n board[click[0]][click[1]] = 'X'\\n return board\\n\\n elif board[click[0]][click[1]] == \\\"E\\\":\\n x = click[0]\\n y = click[1]\\n poss = [(x - 1, y - 1), (x - 1, y), (x - 1, y + 1), (x, y - 1), (x, y + 1), (x + 1, y - 1), (x + 1, y), (x + 1, y + 1)]\\n mines = 0\\n consider = []\\n for (a, b) in poss:\\n if 0 <= a and a < rows and 0 <= b and b < cols:\\n if board[a][b] == 'M':\\n mines += 1\\n if board[a][b] != 'B':\\n consider.append((a,b))\\n\\n if mines > 0:\\n board[x][y] = str(mines)\\n else:\\n board[x][y] = 'B'\\n for p1, p2 in consider:\\n board = self.updateBoard(board, [p1, p2])\\n \\n return board\\n\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n\\n q = collections.deque([click])\\n visited = set([tuple(click)])\\n while q:\\n r, c = q.popleft()\\n digit = 0\\n for dr, dc in [(0,1),(1,0),(0,-1),(-1,0),(1,1),(-1,-1),(1,-1),(-1,1)]:\\n nr, nc = r+dr, c+dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[nr]) and board[nr][nc] == 'M':\\n digit += 1\\n if digit:\\n board[r][c] = str(digit)\\n else:\\n board[r][c] = 'B'\\n for dr, dc in [(0,1),(1,0),(0,-1),(-1,0),(1,1),(-1,-1),(1,-1),(-1,1)]:\\n nr, nc = r+dr, c+dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[nr]) and (nr, nc) not in visited:\\n visited.add((nr,nc))\\n q.append([nr,nc])\\n return board\",\n \"runtime\": \"158\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def countMines(i, j): # 0,3\\n mines = 0\\n for x,y in [(0,1),(0,-1),(-1,-1),(1,0),(-1,0),(1,1),(1,-1),(-1,1)]:\\n if 0 <= i+x < m and 0 <= j+y < n and board[i+x][j+y] == 'M':\\n mines += 1\\n return mines # 1\\n\\n def dfs(i, j): # 3,0/3,1-4/2-0,4/0,4/0,3/1,3\\n if board[i][j] == 'E':\\n mines = countMines(i, j)\\n if mines != 0: # 1\\n board[i][j] = str(mines) # fill and stop: 0,3=1,1,3=1\\n else: # fill recursively!\\n board[i][j] = 'B' # 3,0/3,1-4/2-0,4/0,4/\\n for x,y in [(0,1),(0,-1),(-1,-1),(1,0),(-1,0),(1,1),(1,-1),(-1,1)]:\\n if 0 <= i+x < m and 0 <= j+y < n and board[i+x][j+y] == 'E': # 3,0/3,1-4/2-0,4/0,4/0,3/1,3/\\n dfs(i+x, j+y) # 3,0/4,1-4/2,4/0,4/\\n \\n \\n m, n = len(board), len(board[0])\\n i, j = click\\n # M -> X\\n if board[i][j] == 'M':\\n board[i][j] = 'X'\\n return board\\n # E -> check mines around, if any, fill 1-8, else fill as B recursively\\n if board[i][j] == 'E':\\n dfs(i, j)\\n return board\\n\\n\\n\",\n \"runtime\": \"158\"\n },\n {\n \"code\": \"import queue\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r, c = click\\n\\n if board[r][c] == 'M':\\n board[r][c] = 'X'\\n return board\\n \\n q = queue.Queue()\\n q.put((r, c))\\n board[r][c] = 'B'\\n \\n while not q.empty():\\n sz = q.qsize()\\n for _ in range(sz):\\n i, j = q.get()\\n count = self.countMines(board, i, j)\\n if count > 0:\\n board[i][j] = str(count)\\n continue\\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\\n _i, _j = i + di, j + dj\\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\\n continue\\n if board[_i][_j] == 'E':\\n board[_i][_j] = 'B'\\n q.put((_i, _j))\\n return board\\n\\n def countMines(self, board, i, j):\\n count = 0\\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\\n _i, _j = i + di, j + dj\\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\\n continue\\n if board[_i][_j] == 'M':\\n count += 1\\n return count\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def getnums(self,board,x,y):\\n num=0\\n for i in range(x-1,x+2):\\n for j in range(y-1,y+2):\\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]=='M':\\n num+=1\\n return num \\n\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if not board:\\n return board\\n x,y=click\\n if board[x][y]=='M':\\n board[x][y]='X'\\n else:\\n num=self.getnums(board,x,y)\\n if num:\\n board[x][y]=str(num)\\n else:\\n board[x][y]='B'\\n for i in range(x-1,x+2):\\n for j in range(y-1,y+2):\\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]!='B':\\n self.updateBoard(board,[i,j])\\n return board \\n\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if not board: return []\\n # Goal of question: We only recurse on empty cells\\n # if a empty square sees a cell with a digit, then it should not recurse\\n directions = [(1,0),(-1,0),(0,-1),(0,1), (1,1),(-1, -1),(1,-1),(-1,1)]\\n maxR = len(board)\\n maxC = len(board[0])\\n def dfs(r,c):\\n # if r not in range(0,maxR) or c not in range(0,maxC): return\\n if board[r][c] == 'E':\\n bomba = 0\\n for incr, incc in directions:\\n nr, nc = r + incr, c + incc\\n if 0<=nr< maxR and 0 <= nc < maxC: # in range\\n if board[nr][nc] == 'M' or board[nr][nc] == 'X':\\n bomba +=1\\n if bomba == 0:\\n board[r][c] = 'B'\\n for incr, incc in directions:\\n nr, nc = r+incr, c + incc\\n if 0<=nr< maxR and 0 <= nc < maxC: # in range\\n dfs(nr,nc)\\n else:\\n board[r][c] = str(bomba)\\n return\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n else:\\n dfs(click[0],click[1])\\n return board\\n \\n\\n \\n\\n\\n\\n \\n \\n \",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n click_r, click_c = click\\n if board[click_r][click_c] == \\\"M\\\":\\n board[click_r][click_c] = \\\"X\\\"\\n return board\\n \\n def num_adjacent_mines(i: int, j: int) -> int:\\n count = 0\\n if i > 0:\\n if board[i-1][j] == \\\"M\\\":\\n count += 1\\n if j > 0 and board[i-1][j-1] == \\\"M\\\":\\n count += 1\\n if j < len(board[0])-1 and board[i-1][j+1] == \\\"M\\\":\\n count += 1\\n if j > 0:\\n if board[i][j-1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1 and board[i+1][j-1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1:\\n if board[i+1][j] == \\\"M\\\":\\n count += 1\\n if j < len(board[0])-1:\\n if board[i][j+1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1 and board[i+1][j+1] == \\\"M\\\":\\n count += 1\\n print(f\\\"i: {i} j: {j} num adjacent mines: {count}\\\")\\n return count\\n\\n def reveal(i: int, j: int) -> None:\\n if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):\\n return\\n if board[i][j] != \\\"E\\\":\\n return\\n num_mines = num_adjacent_mines(i, j)\\n if num_mines == 0:\\n board[i][j] = \\\"B\\\"\\n reveal(i+1, j)\\n reveal(i-1, j)\\n reveal(i, j+1)\\n reveal(i, j-1)\\n reveal(i+1, j+1)\\n reveal(i-1, j-1)\\n reveal(i+1, j-1)\\n reveal(i-1, j+1)\\n else:\\n board[i][j] = str(num_mines)\\n\\n reveal(click_r, click_c)\\n return board\\n\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import List\\n\\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def valid(x, y, board):\\n m, n = len(board), len(board[0])\\n return True if 0 <= x < m and 0 <= y < n else False\\n\\n def get_bombs(x, y, board):\\n if not valid(x, y, board):\\n return 0\\n nums = 0\\n for offset_x, offset_y in directions:\\n cur_x, cur_y = x + offset_x, y + offset_y\\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\\n nums += 1\\n return nums\\n\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n elif board[x][y] != 'E':\\n return board\\n\\n queue = deque()\\n queue.append(click)\\n \\n while queue:\\n cur_x, cur_y = queue.popleft()\\n num_bombs = get_bombs(cur_x, cur_y, board)\\n if num_bombs != 0:\\n board[cur_x][cur_y] = str(num_bombs)\\n else:\\n board[cur_x][cur_y] = 'B'\\n for offset_x, offset_y in directions:\\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\\n board[next_x][next_y] = 'B'\\n queue.append([next_x,next_y])\\n\\n return board\\n\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import List\\n\\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def valid(x, y, board):\\n m, n = len(board), len(board[0])\\n return True if 0 <= x < m and 0 <= y < n else False\\n\\n def get_bombs(x, y, board):\\n if not valid(x, y, board):\\n return 0\\n nums = 0\\n for offset_x, offset_y in directions:\\n cur_x, cur_y = x + offset_x, y + offset_y\\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\\n nums += 1\\n return nums\\n\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n elif board[x][y] != 'E':\\n return board\\n\\n queue = deque()\\n queue.append(click)\\n \\n while queue:\\n cur_x, cur_y = queue.popleft()\\n num_bombs = get_bombs(cur_x, cur_y, board)\\n if num_bombs != 0:\\n board[cur_x][cur_y] = str(num_bombs)\\n else:\\n board[cur_x][cur_y] = 'B'\\n for offset_x, offset_y in directions:\\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\\n board[next_x][next_y] = 'B'\\n queue.append([next_x,next_y])\\n\\n return board\\n\",\n \"runtime\": \"162\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def dfs(i: int, j: int):\\n cnt = 0\\n for x in range(max(0,i - 1), min(m,i + 2)):\\n for y in range(max(0, j - 1), min(n, j + 2)):\\n if board[x][y] == \\\"M\\\":\\n cnt += 1\\n if cnt:\\n board[i][j] = str(cnt)\\n else:\\n board[i][j] = \\\"B\\\"\\n for x in range(max(0,i - 1), min(m,i + 2)):\\n for y in range(max(0,j - 1), min(n, j + 2)):\\n if board[x][y] == \\\"E\\\":\\n dfs(x, y)\\n\\n m, n = len(board), len(board[0])\\n i, j = click\\n if board[i][j] == \\\"M\\\":\\n board[i][j] = \\\"X\\\"\\n else:\\n dfs(i, j)\\n return board\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r,c = click\\n\\n if 0 <= r < len(board) and 0 <= c < len(board[0]):\\n if board[r][c] == \\\"M\\\":\\n board[r][c] = \\\"X\\\"\\n elif board[r][c] == \\\"E\\\":\\n num_mines = self.get_adjacent_mines(board, (r,c))\\n if num_mines == 0:\\n board[r][c] = \\\"B\\\"\\n self.updateBoard(board, (r - 1, c - 1))\\n self.updateBoard(board, (r - 1, c))\\n self.updateBoard(board, (r - 1, c + 1))\\n self.updateBoard(board, (r + 1, c - 1))\\n self.updateBoard(board, (r + 1, c))\\n self.updateBoard(board, (r + 1, c + 1))\\n self.updateBoard(board, (r, c - 1))\\n self.updateBoard(board, (r, c + 1))\\n else:\\n board[r][c] = str(num_mines)\\n\\n\\n return board\\n\\n def get_adjacent_mines(self, board, curr_cell):\\n x, y = curr_cell\\n\\n num_mines = 0\\n for i in range(x - 1, x + 2):\\n for j in range(y - 1, y + 2):\\n if 0 <= i < len(board) and 0 <= j < len(board[0]):\\n if (i, j) != (x, y) and board[i][j] == \\\"M\\\":\\n num_mines += 1\\n\\n return num_mines\",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m = len(board)\\n n = len(board[0])\\n r, c = click\\n value = board[r][c]\\n \\n def get_adj(r, c):\\n rc = [[r-1,c],[r-1,c+1],[r,c+1],[r+1,c+1],[r+1,c],[r+1,c-1],[r,c-1],[r-1,c-1]]\\n return [[rr,cc] for rr, cc in rc if 0 <= rr < m and 0 <= cc < n]\\n\\n def get_num_adj_mines(r, c):\\n rc = get_adj(r, c)\\n return sum(1 for rr, cc in rc if board[rr][cc] == 'M')\\n \\n if value == 'M':\\n board[r][c] = 'X'\\n return board\\n def helper(rr, cc):\\n num_mines = get_num_adj_mines(rr, cc)\\n if num_mines:\\n board[rr][cc] = str(num_mines)\\n else:\\n board[rr][cc] = 'B'\\n for _r, _c in get_adj(rr, cc):\\n if board[_r][_c] == 'E':\\n helper(_r, _c)\\n helper(r, c)\\n return board\",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n seen = [[False]*n for _ in range(m)]\\n\\n def countMine(i, j):\\n cnt = 0\\n if 0 <= i - 1 and 0 <= j - 1 and board[i-1][j-1] in ['M', 'X']:\\n cnt += 1\\n if 0 <= i - 1 and j + 1 < n and board[i-1][j+1] in ['M', 'X']:\\n cnt += 1\\n if i + 1 < m and 0 <= j - 1 and board[i+1][j-1] in ['M', 'X']:\\n cnt += 1\\n if i + 1 < m and j + 1 < n and board[i+1][j+1] in ['M', 'X']:\\n cnt += 1\\n if 0 <= i - 1 and board[i-1][j] in ['M', 'X']:\\n cnt += 1\\n if i + 1 < m and board[i+1][j] in ['M', 'X']:\\n cnt += 1\\n if 0 <= j - 1 and board[i][j-1] in ['M', 'X']:\\n cnt += 1\\n if j + 1 < n and board[i][j+1] in ['M', 'X']:\\n cnt += 1\\n return cnt\\n \\n def dfs(i, j, step):\\n seen[i][j] = True\\n test = board[i][j]\\n if board[i][j] != 'E':\\n return\\n cnt = countMine(i, j)\\n if cnt > 0:\\n board[i][j] = str(cnt)\\n return\\n else:\\n board[i][j] = 'B'\\n if 0 <= i - 1 and 0 <= j - 1 and not seen[i-1][j-1]:\\n dfs(i-1, j-1, step+1)\\n if 0 <= i - 1 and j + 1 < n and not seen[i-1][j+1]:\\n dfs(i-1, j+1, step+1)\\n if i + 1 < m and 0 <= j - 1 and not seen[i+1][j-1]:\\n dfs(i+1, j-1, step+1)\\n if i + 1 < m and j + 1 < n and not seen[i+1][j+1]:\\n dfs(i+1, j+1, step+1)\\n if 0 <= i - 1 and not seen[i-1][j]:\\n dfs(i-1, j, step+1)\\n if i + 1 < m and not seen[i+1][j]:\\n dfs(i+1, j, step+1)\\n if 0 <= j - 1 and not seen[i][j-1]:\\n dfs(i, j-1, step+1)\\n if j + 1 < n and not seen[i][j+1]:\\n dfs(i, j+1, step+1)\\n return\\n\\n if board[click[0]][click[1]] in ['X', 'M', 'B','1', '2', '3', '4', '5', '6', '7', '8']:\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n dfs(click[0], click[1], 1)\\n return board\\n\\n\",\n \"runtime\": \"165\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n self.board = board\\n m, n = len(self.board), len(self.board[0])\\n def in_bounds(i, j):\\n return 0 <= i < m and 0 <= j < n\\n r, c = click\\n if not in_bounds(r, c):\\n return self.board\\n if self.board[r][c] == \\\"M\\\":\\n self.board[r][c] = \\\"X\\\"\\n return self.board\\n\\n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\\n didj.remove((0, 0))\\n\\n def dfs(i, j):\\n if not in_bounds(i, j) or self.board[i][j] != \\\"E\\\":\\n return\\n bomb_count = 0\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n if in_bounds(ni, nj) and self.board[ni][nj] == \\\"M\\\":\\n bomb_count += 1\\n if bomb_count:\\n self.board[i][j] = str(bomb_count)\\n return\\n self.board[i][j] = \\\"B\\\"\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n if in_bounds(ni, nj):\\n dfs(ni, nj)\\n dfs(r, c)\\n return self.board\\n\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n self.board = board\\n m, n = len(self.board), len(self.board[0])\\n def in_bounds(r, c):\\n return 0 <= r < m and 0 <= c < n\\n r, c = click\\n if not in_bounds(r, c):\\n return self.board\\n if self.board[r][c] == \\\"M\\\":\\n self.board[r][c] = \\\"X\\\"\\n return self.board\\n \\n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\\n didj.remove((0, 0))\\n def dfs(i, j):\\n if not in_bounds(i, j) or self.board[i][j] != \\\"E\\\":\\n return \\n bomb_count = 0\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n if in_bounds(ni, nj) and self.board[ni][nj] == \\\"M\\\":\\n bomb_count += 1\\n if bomb_count:\\n self.board[i][j] = str(bomb_count)\\n return\\n self.board[i][j] = \\\"B\\\"\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n dfs(ni, nj)\\n return\\n dfs(r, c)\\n return self.board\\n\",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def is_valid(row, col):\\n return row >= 0 and col >=0 and row < len(board) and col < len(board[0])\\n\\n def count_mines(row, col):\\n moves = [ [-1, -1], [-1, 0], [-1, 1], [0, 1], [1, 1], [1, 0], [1, -1], [0, -1] ]\\n res = 0\\n for dy, dx in moves:\\n new_row = row + dy\\n new_col = col + dx\\n if is_valid(new_row, new_col):\\n if board[new_row][new_col] == 'M':\\n res += 1\\n return res\\n \\n def reveal_blank(row, col):\\n moves = [ [-1, -1], [-1, 0], [-1, 1], [0, 1], [1, 1], [1, 0], [1, -1], [0, -1] ]\\n\\n board[row][col] = 'B'\\n for dy, dx in moves:\\n new_row = row + dy\\n new_col = col + dx\\n if is_valid(new_row, new_col):\\n if board[new_row][new_col] == 'E':\\n reveal(new_row, new_col)\\n\\n def reveal(row, col):\\n if board[row][col] == 'M':\\n board[row][col] = 'X'\\n return\\n \\n if board[row][col] == 'E':\\n mines = count_mines(row, col)\\n \\n if mines == 0:\\n reveal_blank(row, col)\\n else:\\n board[row][col] = str(mines)\\n \\n reveal(click[0], click[1])\\n\\n return board\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n\\n\\n cr,cc= click[0],click[1]\\n if board[cr][cc]=='M':\\n board[cr][cc]='X'\\n return board\\n\\n #precalculate:\\n #for each cell, calculate number of bombs near it\\n #inverse, instantiate all with '0' and then for each bomb, add +1 to its neighbors adj_bomc counters\\n\\n\\n rows= len(board)\\n cols= len(board[0])\\n # bombs= [[0]*cols]*rows #PROBLEM\\n bombs = [[0] * cols for _ in range(rows)]\\n\\n directions = [(0,1),(0,-1),(1,0),(-1,0),(-1,-1),(1,1),(-1,1),(1,-1)]\\n for r in range(rows):\\n for c in range(cols):\\n if board[r][c]=='M':\\n bombs[r][c]= 'X'\\n for i,j in directions:\\n nr,nc = r+i,c+j\\n if 0<=nr<rows and 0<=nc<cols and bombs[nr][nc]!='X':\\n bombs[nr][nc]+=1\\n\\n # print(bombs)\\n\\n # If click on a mine ('M'), mark it as 'X', stop further search.\\n # If click on an empty cell ('E'), depends on how many surrounding mine:\\n # 2.1 Has surrounding mine(s), mark it with number of surrounding mine(s), stop further search.\\n # 2.2 No surrounding mine, mark it as 'B', continue search its 8 neighbors.\\n\\n def reveal(r,c):\\n if r<0 or r>=rows or c<0 or c>=cols:\\n return\\n if board[r][c]!='E':\\n return\\n if bombs[r][c]!=0:\\n board[r][c]=str(bombs[r][c])\\n if bombs[r][c]==0:\\n board[r][c]='B'\\n for i,j in directions:\\n nr,nc = r+i,c+j\\n reveal(nr,nc)\\n\\n if board[cr][cc]=='E' and bombs[cr][cc]!=0:\\n board[cr][cc]= str(bombs[cr][cc])\\n return board\\n\\n reveal(cr,cc)\\n return board\\n\\n\\n\\n\\n\\n\\n\\n \\n\",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n\\n return board\\n\\n directions = [(0,1), (0,-1), (1, 1), (1,0), (1,-1), (-1,0), (-1, -1), (-1, 1)] \\n R,C = len(board), len(board[0])\\n mp = defaultdict(int)\\n def dfs(r,c):\\n\\n adj = [(r+dr, c+dc) for dr,dc in directions if r+dr in range(R) and c+dc in range(C)]\\n\\n mines = sum([board[x][y] == 'M' for x,y in adj])\\n if mines:\\n board[r][c] = str(mines)\\n else:\\n board[r][c] = 'B'\\n for x,y in adj:\\n if board[x][y] == 'E':\\n dfs(x,y)\\n\\n dfs(*click)\\n\\n return board\",\n \"runtime\": \"169\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n def dfs(x, y):\\n if board[x][y] == 'M': board[x][y] = 'X'\\n elif board[x][y] == 'E':\\n cnt, nei = 0, []\\n for i, j in map(lambda v: (v[0]+x, v[1]+y), [(-1, 0), (1, 0), (-1, -1), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)]):\\n if 0 <= i < m and 0 <= j < n:\\n nei.append((i, j))\\n if board[i][j] == 'M': cnt += 1\\n if not cnt:\\n board[x][y] = 'B'\\n for i, j in nei: dfs(i, j)\\n else: board[x][y] = str(cnt)\\n dfs(*click) \\n return board\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"dirs = [[-1,-1], [-1, 0], [-1,1],[1,0],[1,-1],[1,1],[0,-1],[0,1]]\\nclass Solution:\\n \\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n if board[click[0]][click[1]] != 'E':\\n return board\\n \\n q = [(click[0], click[1])]\\n processed = set()\\n while q:\\n pos = q.pop()\\n processed.add(pos)\\n c = 0\\n for d in dirs:\\n if 0<= pos[0]+d[0] < len(board) and 0<= pos[1]+d[1] <len(board[0]) and board[pos[0]+d[0]][pos[1]+d[1]] == 'M':\\n c += 1\\n if c != 0:\\n board[pos[0]][pos[1]] = str(c)\\n else:\\n board[pos[0]][pos[1]] = 'B'\\n for d in dirs:\\n p = (pos[0]+d[0], pos[1]+d[1])\\n if 0<= p[0] < len(board) and 0<= p[1] <len(board[0]) and p not in processed:\\n q.append(p)\\n \\n return board\\n\\n \\n def countMines(self, board, pos):\\n c = 0\\n for d in dirs:\\n if 0<= pos[0]+d[0] < len(board) and 0<= pos[1]+d[1] <len(board[0]) and board[pos[0]+d[0]][pos[1]+d[1]] == 'M':\\n c += 1\\n return c\\n\",\n \"runtime\": \"171\"\n },\n {\n \"code\": \"# Data Structures and Algorithm: Matrix, Depth-First Search (DFS)\\n# Intuition: Use DFS to reveal cells on the Minesweeper board. If a cell is a mine, change its value to 'X'. If it's empty, reveal surrounding cells.\\n# Pseudo Code:\\n# 1. If the clicked cell is a mine ('M'), change it to 'X' and return the board.\\n# 2. If the clicked cell is an empty cell ('E'), count the number of surrounding mines.\\n# 3. If there are no surrounding mines, mark the cell as 'B' and recursively reveal all surrounding cells.\\n# 4. If there are surrounding mines, mark the cell with the number of mines.\\n# 5. Return the updated board.\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def dfs(x, y):\\n # If the cell is out of bounds or not an empty cell, return\\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]) or board[x][y] != 'E':\\n return\\n \\n # Count the number of surrounding mines\\n mines = 0\\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\\n for dx, dy in directions:\\n nx, ny = x + dx, y + dy\\n if 0 <= nx < len(board) and 0 <= ny < len(board[0]) and board[nx][ny] == 'M':\\n mines += 1\\n \\n # If there are surrounding mines, mark the cell with the number of mines\\n if mines > 0:\\n board[x][y] = str(mines)\\n else:\\n # If there are no surrounding mines, mark the cell as 'B' and reveal surrounding cells\\n board[x][y] = 'B'\\n for dx, dy in directions:\\n dfs(x + dx, y + dy)\\n\\n # Get the coordinates of the click\\n x, y = click\\n \\n # If the clicked cell is a mine, change it to 'X' and return the board\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n else:\\n # Otherwise, perform DFS to reveal cells\\n dfs(x, y)\\n \\n # Return the updated board\\n return board\",\n \"runtime\": \"172\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n\\n if board[click[0]][click[1]] == 'M': \\n board[click[0]][click[1]] = 'X'\\n return board \\n\\n visited = set()\\n self.dfs(board, click, visited)\\n return board\\n def inBounds(self, board, x, y, diffX, diffY): \\n if x + diffX >= 0 and x + diffX < len(board): \\n if y + diffY >= 0 and y + diffY < len(board[0]): \\n return True\\n else: return False\\n\\n def countMines(self, board, x, y): \\n directions = [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [-1, -1], [1, -1], [-1, 1]]\\n mines = 0\\n for direction in directions: \\n diffX, diffY = direction\\n if self.inBounds(board, x, y, diffX, diffY) and board[x + diffX][y + diffY] == 'M':\\n mines += 1\\n return mines\\n\\n def dfs(self, board, point, visited): \\n directions = [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [-1, -1], [1, -1], [-1, 1]]\\n x, y = point \\n print(point)\\n countMines = self.countMines(board, x, y)\\n if countMines == 0: \\n board[x][y] = 'B'\\n for direction in directions: \\n diffX, diffY = direction\\n if self.inBounds(board, x, y, diffX, diffY) and (x + diffX, y + diffY) not in visited: \\n visited.add((x + diffX, y + diffY))\\n self.dfs(board, (x + diffX, y + diffY), visited)\\n else: \\n board[x][y] = str(countMines)\\n return \\n\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click[0], click[1]\\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):\\n return board\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n directions = [[x,y] for x in [-1,0,1] for y in [-1,0,1] if x != 0 or y !=0]\\n if board[x][y] == 'E':\\n total_mines = 0\\n for dx, dy in directions:\\n new_x, new_y = x + dx, y + dy\\n if new_x < 0 or new_x >= len(board) or new_y < 0 or new_y >= len(board[0]):\\n continue\\n if board[new_x][new_y] == 'M':\\n total_mines += 1\\n if total_mines == 0:\\n board[x][y] = 'B'\\n for dx, dy in directions:\\n new_x, new_y = x + dx, y + dy\\n board = self.updateBoard(board, [new_x, new_y])\\n if total_mines > 0:\\n board[x][y] = str(total_mines)\\n return board\\n\",\n \"runtime\": \"174\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n i, j = click\\n \\n if board[i][j] == 'M':\\n board[i][j] = 'X'\\n return board\\n \\n def count_mines(r, c):\\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\\n count = 0\\n for dr, dc in directions:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < m and 0 <= nc < n and board[nr][nc] == 'M':\\n count += 1\\n return count\\n \\n def dfs(i, j):\\n if board[i][j] != 'E':\\n return\\n \\n mines = count_mines(i, j)\\n if mines > 0:\\n board[i][j] = str(mines)\\n return\\n \\n board[i][j] = 'B'\\n directions = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]\\n for dr, dc in directions:\\n ni, nj = i + dr, j + dc\\n if 0 <= ni < m and 0 <= nj < n:\\n dfs(ni, nj)\\n \\n dfs(i, j)\\n return board\\n\\n# Example usage:\\nsolution = Solution()\\nboard = [[\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\"],[\\\"E\\\",\\\"E\\\",\\\"M\\\",\\\"E\\\",\\\"E\\\"],[\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\"],[\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\",\\\"E\\\"]]\\nclick = [3,0]\\nprint(solution.updateBoard(board, click))\",\n \"runtime\": \"175\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":45,"string":"45"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n\n def checker(x,y):\n if (x>=0) and (y>=0) and (x<len(board)) and (y<len(board[0])):\n return True\n return False \n\n queue = []\n queue.append(click)\n\n while (len(queue)>0):\n\n x = queue[0][0]\n y = queue[0][1]\n del queue[0]\n\n if board[x][y] == 'M':\n board[x][y] = 'X'\n else:\n count = 0\n for i in range(x-1, x+2):\n for j in range(y-1, y+2):\n if checker(i,j) and board[i][j] == 'M':\n count+=1\n if count > 0:\n board[x][y]=str(count)\n else:\n board[x][y]='B'\n for i in range(x-1, x+2):\n for j in range(y-1, y+2):\n if checker(i,j) and board[i][j] == 'E':\n board[i][j]='B'\n queue.append([i,j])\n \n return board\n\n\n\n \n\n \n \n\n\n\n","memory":"15800"},{"code":"from collections import deque\nfrom typing import List\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n directions = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[-1,1],[1,-1],[-1,-1]]\n x, y = click[0], click[1]\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n elif board[x][y] not in ('B', 'E'):\n return board\n m, n = len(board), len(board[0])\n\n def valid_point(i, j):\n return 0 <= i < m and 0 <= j < n\n \n def count_nearby_mines(board, x, y):\n res = 0\n for x_off, y_off in directions:\n new_x, new_y = x + x_off, y + y_off\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'M':\n res += 1\n return res\n\n queue = deque()\n queue.append(click)\n\n while queue:\n cur_x, cur_y = queue.popleft()\n # Check the number of mines around the current cell\n num_mines = count_nearby_mines(board, cur_x, cur_y)\n if num_mines > 0:\n board[cur_x][cur_y] = str(num_mines)\n else:\n board[cur_x][cur_y] = 'B'\n for x_off, y_off in directions:\n new_x, new_y = cur_x + x_off, cur_y + y_off\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'E':\n board[new_x][new_y] = 'B'\n queue.append((new_x, new_y))\n return board\n","memory":"16500"},{"code":"from collections import deque\nfrom typing import List\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n directions = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[-1,1],[1,-1],[-1,-1]]\n x, y = click[0], click[1]\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n elif board[x][y] not in ('B', 'E'):\n return board\n m, n = len(board), len(board[0])\n\n def valid_point(i, j):\n return 0 <= i < m and 0 <= j < n\n \n def count_nearby_mines(board, x, y):\n res = 0\n for x_off, y_off in directions:\n new_x, new_y = x + x_off, y + y_off\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'M':\n res += 1\n return res\n\n queue = deque()\n queue.append(click)\n\n while queue:\n cur_x, cur_y = queue.popleft()\n # Check the number of mines around the current cell\n num_mines = count_nearby_mines(board, cur_x, cur_y)\n if num_mines > 0:\n board[cur_x][cur_y] = str(num_mines)\n else:\n board[cur_x][cur_y] = 'B'\n for x_off, y_off in directions:\n new_x, new_y = cur_x + x_off, cur_y + y_off\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'E':\n board[new_x][new_y] = 'B'\n queue.append((new_x, new_y))\n return board\n","memory":"16600"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]] == \"M\":\n board[click[0]][click[1]] = \"X\"\n return board\n\n def isInBoundary(x: int, y: int) -> bool:\n return 0 <= x < len(board) and 0 <= y < len(board[0])\n\n if board[click[0]][click[1]] == \"E\":\n # with adjacent mine, update digit\n q = deque()\n q.append(click)\n dirs = [[0, 1], [1, 0], [0, -1], [-1, 0], [1, 1], [-1, -1], [1, -1], [-1, 1]]\n while len(q) > 0:\n # print(q)\n cur = q.popleft()\n # update cur' val if has mine around\n cnt = 0\n for dir in dirs:\n x = cur[0] + dir[0]\n y = cur[1] + dir[1]\n if isInBoundary(x, y) and board[x][y] == \"M\":\n cnt += 1\n\n if cnt != 0:\n board[cur[0]][cur[1]] = str(cnt)\n else:\n # if no mine around, recursively add 8 nodes into the q (if it is not B)\n board[cur[0]][cur[1]] = \"B\"\n for dir in dirs:\n x = cur[0] + dir[0]\n y = cur[1] + dir[1]\n if isInBoundary(x, y) and board[x][y] == \"E\":\n board[x][y] = \"TODO\"\n q.append((x, y))\n\n return board\n","memory":"16600"},{"code":"from collections import deque\nfrom typing import List\n\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def valid(x, y, board):\n m, n = len(board), len(board[0])\n return True if 0 <= x < m and 0 <= y < n else False\n\n def get_bombs(x, y, board):\n if not valid(x, y, board):\n return 0\n nums = 0\n for offset_x, offset_y in directions:\n cur_x, cur_y = x + offset_x, y + offset_y\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\n nums += 1\n return nums\n\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n elif board[x][y] != 'E':\n return board\n\n queue = deque()\n queue.append(click)\n \n while queue:\n cur_x, cur_y = queue.popleft()\n num_bombs = get_bombs(cur_x, cur_y, board)\n if num_bombs != 0:\n board[cur_x][cur_y] = str(num_bombs)\n else:\n board[cur_x][cur_y] = 'B'\n for offset_x, offset_y in directions:\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\n board[next_x][next_y] = 'B'\n queue.append([next_x,next_y])\n\n return board\n","memory":"16700"},{"code":"from collections import deque\nfrom typing import List\n\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def valid(x, y, board):\n m, n = len(board), len(board[0])\n return True if 0 <= x < m and 0 <= y < n else False\n\n def get_bombs(x, y, board):\n if not valid(x, y, board):\n return 0\n nums = 0\n for offset_x, offset_y in directions:\n cur_x, cur_y = x + offset_x, y + offset_y\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\n nums += 1\n return nums\n\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n elif board[x][y] != 'E':\n return board\n\n queue = deque()\n queue.append(click)\n \n while queue:\n cur_x, cur_y = queue.popleft()\n num_bombs = get_bombs(cur_x, cur_y, board)\n if num_bombs != 0:\n board[cur_x][cur_y] = str(num_bombs)\n else:\n board[cur_x][cur_y] = 'B'\n for offset_x, offset_y in directions:\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\n board[next_x][next_y] = 'B'\n queue.append([next_x,next_y])\n\n return board\n","memory":"16800"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n m, n = len(board), len(board[0])\n q = deque()\n q.append(click)\n visited = set()\n visited.add(tuple(click))\n while q:\n for _ in range(len(q)):\n curr = q.popleft()\n x, y = curr[0], curr[1]\n count_mine = 0\n for a,b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\n nx, ny = x+a, y+b\n\n if 0 <= nx < m and 0 <= ny < n:\n if board[nx][ny] == 'M':\n count_mine += 1\n if count_mine > 0:\n board[x][y] = str(count_mine)\n else:\n board[x][y] = 'B'\n for a, b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\n nx, ny = x+a, y+b\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited:\n q.append([nx,ny])\n visited.add((nx,ny))\n return board","memory":"16900"},{"code":"import queue\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r, c = click\n\n if board[r][c] == 'M':\n board[r][c] = 'X'\n return board\n \n q = queue.Queue()\n q.put((r, c))\n board[r][c] = 'B'\n \n while not q.empty():\n sz = q.qsize()\n for _ in range(sz):\n i, j = q.get()\n count = self.countMines(board, i, j)\n if count > 0:\n board[i][j] = str(count)\n continue\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\n _i, _j = i + di, j + dj\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\n continue\n if board[_i][_j] == 'E':\n board[_i][_j] = 'B'\n q.put((_i, _j))\n return board\n\n def countMines(self, board, i, j):\n count = 0\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\n _i, _j = i + di, j + dj\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\n continue\n if board[_i][_j] == 'M':\n count += 1\n return count","memory":"16900"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x = click[0]\n y = click[1]\n if board[x][y] =='M':\n board[x][y]='X'\n return board\n \n ROW = len(board)\n COL = len(board[0])\n\n queue = deque([[x,y]])\n visited = set()\n visited.add(tuple(click))\n directions = [[1,0],[-1,0],[0,1],[0,-1],[1,1],[1,-1],[-1,-1],[-1,1]]\n while queue:\n for _ in range(len(queue)):\n print(queue)\n x, y = queue.popleft()\n\n count = 0 \n\n for dirX, dirY in directions:\n newX = x + dirX\n newY = y + dirY\n\n if newX >= ROW or newX < 0 or newY >=COL or newY < 0:\n continue\n if board[newX][newY]=='M':\n count +=1\n if count > 0:\n board[x][y] = str(count)\n \n else:\n board[x][y]='B'\n for dirX, dirY in directions:\n newX = x + dirX\n newY = y + dirY\n if newX >= ROW or newX < 0 or newY >=COL or newY < 0 or (newX,newY) in visited:\n continue\n queue.append([newX,newY])\n visited.add((newX,newY))\n return board\n","memory":"17000"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m = len(board)\n n = len(board[0])\n moves = [(0, -1), (-1, -1), (-1, 0), (-1, 1),\n (0, 1), (1, 1), (1, 0), (1, -1)]\n\n def dfs(i, j):\n if board[i][j] == 'M':\n board[i][j] = 'X'\n return\n \n count = 0\n for di, dj in moves:\n ii = i + di\n jj = j + dj\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'M':\n count += 1\n if count > 0:\n board[i][j] = str(count)\n else:\n board[i][j] = 'B'\n for di, dj in moves:\n ii = i + di\n jj = j + dj\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'E':\n dfs(ii, jj)\n return\n \n dfs(click[0], click[1])\n return board\n","memory":"17000"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n self.board = board\n m, n = len(self.board), len(self.board[0])\n def in_bounds(i, j):\n return 0 <= i < m and 0 <= j < n\n r, c = click\n if not in_bounds(r, c):\n return self.board\n if self.board[r][c] == \"M\":\n self.board[r][c] = \"X\"\n return self.board\n\n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\n didj.remove((0, 0))\n\n def dfs(i, j):\n if not in_bounds(i, j) or self.board[i][j] != \"E\":\n return\n bomb_count = 0\n for di, dj in didj:\n ni, nj = i+di, j+dj\n if in_bounds(ni, nj) and self.board[ni][nj] == \"M\":\n bomb_count += 1\n if bomb_count:\n self.board[i][j] = str(bomb_count)\n return\n self.board[i][j] = \"B\"\n for di, dj in didj:\n ni, nj = i+di, j+dj\n if in_bounds(ni, nj):\n dfs(ni, nj)\n dfs(r, c)\n return self.board\n","memory":"17100"},{"code":"class Solution:\n\n\n def has_no_bombs_adjacent(self, board, r, c):\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]):\n if board[nr][nc] == 'X' or board[nr][nc] == 'M':\n return False \n return True \n\n\n def updateEmpty(self, board, r, c):\n if self.has_no_bombs_adjacent(board, r, c):\n # need to recurse \n board[r][c] = 'B'\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'E':\n self.updateEmpty(board, nr, nc) \n \n else:\n my_count = 0\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\n nr, nc = r + dr, c + dc\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'M':\n my_count += 1 \n board[r][c] = str(my_count) \n\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \n clicked_square = board[click[0]][click[1]]\n\n if clicked_square == 'M':\n board[click[0]][click[1]] = 'X'\n elif clicked_square == 'E':\n self.updateEmpty(board, click[0], click[1]) \n\n return board ","memory":"17100"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \"\"\"\n Recursive Approach: DFS\n \"\"\"\n if not board:\n return board\n\n DIRECTIONS = [(1, 0), (-1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (-1, 1), (1, -1)]\n ROWS, COLS = len(board), len(board[0])\n CLICK_R, CLICK_C = click \n\n def count_mines(row, col):\n count = 0\n for dr, dc in DIRECTIONS:\n new_r, new_c = row + dr, col + dc\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'M'):\n count += 1\n return count\n\n def explore_cell(row, col):\n adj_mines = count_mines(row, col)\n\n if adj_mines > 0:\n board[row][col] = str(adj_mines)\n else:\n board[row][col] = 'B'\n for dr, dc in DIRECTIONS:\n new_r, new_c = row + dr, col + dc\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'E'):\n explore_cell(new_r, new_c)\n\n if board[CLICK_R][CLICK_C] == 'M':\n board[CLICK_R][CLICK_C] = 'X'\n else:\n explore_cell(CLICK_R, CLICK_C) # Click on 'E'\n \n return board\n\n # O(m * n) time.\n # O(m * n) auxiliary space.\n # O(m * n) total space.","memory":"17200"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n click_r, click_c = click\n if board[click_r][click_c] == \"M\":\n board[click_r][click_c] = \"X\"\n return board\n \n def num_adjacent_mines(i: int, j: int) -> int:\n count = 0\n if i > 0:\n if board[i-1][j] == \"M\":\n count += 1\n if j > 0 and board[i-1][j-1] == \"M\":\n count += 1\n if j < len(board[0])-1 and board[i-1][j+1] == \"M\":\n count += 1\n if j > 0:\n if board[i][j-1] == \"M\":\n count += 1\n if i < len(board)-1 and board[i+1][j-1] == \"M\":\n count += 1\n if i < len(board)-1:\n if board[i+1][j] == \"M\":\n count += 1\n if j < len(board[0])-1:\n if board[i][j+1] == \"M\":\n count += 1\n if i < len(board)-1 and board[i+1][j+1] == \"M\":\n count += 1\n print(f\"i: {i} j: {j} num adjacent mines: {count}\")\n return count\n\n def reveal(i: int, j: int) -> None:\n if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):\n return\n if board[i][j] != \"E\":\n return\n num_mines = num_adjacent_mines(i, j)\n if num_mines == 0:\n board[i][j] = \"B\"\n reveal(i+1, j)\n reveal(i-1, j)\n reveal(i, j+1)\n reveal(i, j-1)\n reveal(i+1, j+1)\n reveal(i-1, j-1)\n reveal(i+1, j-1)\n reveal(i-1, j+1)\n else:\n board[i][j] = str(num_mines)\n\n reveal(click_r, click_c)\n return board\n","memory":"17200"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n self.board = board\n m, n = len(self.board), len(self.board[0])\n def in_bounds(r, c):\n return 0 <= r < m and 0 <= c < n\n r, c = click\n if not in_bounds(r, c):\n return self.board\n if self.board[r][c] == \"M\":\n self.board[r][c] = \"X\"\n return self.board\n \n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\n didj.remove((0, 0))\n def dfs(i, j):\n if not in_bounds(i, j) or self.board[i][j] != \"E\":\n return \n bomb_count = 0\n for di, dj in didj:\n ni, nj = i+di, j+dj\n if in_bounds(ni, nj) and self.board[ni][nj] == \"M\":\n bomb_count += 1\n if bomb_count:\n self.board[i][j] = str(bomb_count)\n return\n self.board[i][j] = \"B\"\n for di, dj in didj:\n ni, nj = i+di, j+dj\n dfs(ni, nj)\n return\n dfs(r, c)\n return self.board\n","memory":"17300"},{"code":"'''\nIf the click is on a Mine, store that cell with X.\nElse call the helper function to calculate the number of adjacent mines and return number.\nIf the number is 0, mark that cell as B. Otherwise store number in that cell. \n'''\nclass Solution:\n def checkAdjacent(self, board, x, y):\n # [x-1, y-1] [x-1, y] [x-1, y+1]\n # [x, y-1] [x, y] [x, y+1]\n # [x+1, y-1] [x+1, y] [x+1, y+1]\n number = 0\n for r in range(x-1, x+2):\n for c in range(y-1, y+2):\n if r >= 0 and r<len(board) and c>=0 and c<len(board[r]) and board[r][c]=='M':\n number += 1\n return number\n\n\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click[0], click[1]\n if board[x][y] == 'M':\n board[x][y] = 'X'\n else:\n number = self.checkAdjacent(board, x, y)\n if number:\n board[x][y] = str(number)\n else:\n board[x][y] = 'B'\n for r in range(x-1, x+2):\n for c in range(y-1, y+2):\n if r >= 0 and r<len(board) and c>=0 and c<len(board[r]) and board[r][c] != 'B':\n self.updateBoard(board, [r,c])\n return board\n","memory":"17300"},{"code":"class Solution:\n def getnums(self,board,x,y):\n num=0\n for i in range(x-1,x+2):\n for j in range(y-1,y+2):\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]=='M':\n num+=1\n return num \n\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if not board:\n return board\n x,y=click\n if board[x][y]=='M':\n board[x][y]='X'\n else:\n num=self.getnums(board,x,y)\n if num:\n board[x][y]=str(num)\n else:\n board[x][y]='B'\n for i in range(x-1,x+2):\n for j in range(y-1,y+2):\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]!='B':\n self.updateBoard(board,[i,j])\n return board \n","memory":"17400"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n i, j = click[0], click[1]\n\n # If a mine ('M') is revealed, then the game is over - change it to 'X'\n if board[i][j] == 'M':\n board[i][j] = 'X'\n return board\n \n # run dfs to reveal the board\n self.dfs(board, i, j)\n return board\n \n def dfs(self, board, i, j):\n if board[i][j] != 'E':\n return\n \n m, n = len(board), len(board[0])\n directions = [(-1, -1), (0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0)]\n\n mine_count = 0\n\n for d in directions:\n ni, nj = i + d[0], j + d[1]\n if 0 <= ni < m and 0 <= nj < n and board[ni][nj] == 'M':\n mine_count += 1\n \n if mine_count == 0:\n board[i][j] = 'B'\n else:\n board[i][j] = str(mine_count)\n return\n \n for d in directions:\n ni, nj = i + d[0], j + d[1]\n if 0 <= ni < m and 0 <= nj < n:\n self.dfs(board, ni, nj)","memory":"17500"},{"code":"from collections import deque\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r = len(board)\n c = len(board[0])\n d = [\n (0, 1), \n (0, -1),\n (1, 0),\n (-1, 0),\n (-1, -1),\n (-1, 1),\n (1, -1),\n (1, 1)\n ]\n\n queue = deque()\n queue.append(click)\n\n while len(queue) > 0:\n row, col = queue.pop()\n val = board[row][col]\n\n if val == \"M\": \n board[row][col] = \"X\"\n return board\n elif val == \"E\":\n bomb_count = 0\n to_add = []\n\n for addr, addc in d:\n newr = row + addr\n newc = col + addc\n if newr >= r or newr < 0: continue\n if newc >= c or newc < 0: continue\n if board[newr][newc] == \"M\":\n bomb_count += 1\n to_add.append((newr, newc))\n\n if bomb_count == 0:\n board[row][col] = \"B\"\n for e in to_add:\n queue.append(e)\n else:\n board[row][col] = str(bomb_count)\n \n \n return board","memory":"17600"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n i, j = click[0], click[1]\n if board[i][j] == \"M\":\n board[i][j] = \"X\"\n return board\n\n m = len(board)\n n = len(board[0])\n q = [(i, j)]\n visited = set()\n while len(q) > 0:\n i, j = q.pop()\n if (i, j) in visited:\n continue\n visited.add((i, j))\n adj_bombs = 0\n for adj_i in range(i - 1, i + 2):\n for adj_j in range(j - 1, j + 2):\n if 0 <= adj_i < m and 0 <= adj_j < n and board[adj_i][adj_j] == \"M\":\n adj_bombs += 1\n if adj_bombs > 0:\n board[i][j] = str(adj_bombs)\n else:\n board[i][j] = \"B\"\n for adj_i in range(i - 1, i + 2):\n for adj_j in range(j - 1, j + 2):\n if 0 <= adj_i < m and 0 <= adj_j < n:\n q.append((adj_i, adj_j))\n return board","memory":"17700"},{"code":"from collections import deque\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r = len(board)\n c = len(board[0])\n d = [\n (0, 1), \n (0, -1),\n (1, 0),\n (-1, 0),\n (-1, -1),\n (-1, 1),\n (1, -1),\n (1, 1)\n ]\n\n queue = deque()\n queue.append(click)\n\n while len(queue) > 0:\n row, col = queue.pop()\n val = board[row][col]\n\n if val == \"M\": \n board[row][col] = \"X\"\n return board\n elif val == \"E\":\n bomb_count = 0\n to_add = []\n\n for addr, addc in d:\n newr = row + addr\n newc = col + addc\n if newr >= r or newr < 0: continue\n if newc >= c or newc < 0: continue\n if board[newr][newc] == \"M\":\n bomb_count += 1\n to_add.append([newr, newc])\n\n if bomb_count == 0:\n board[row][col] = \"B\"\n for e in to_add:\n queue.append(e)\n else:\n board[row][col] = str(bomb_count)\n \n \n return board","memory":"17800"},{"code":"from collections import deque\n\nclass Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r = len(board)\n c = len(board[0])\n d = [\n (0, 1), \n (0, -1),\n (1, 0),\n (-1, 0),\n (-1, -1),\n (-1, 1),\n (1, -1),\n (1, 1)\n ]\n\n queue = deque()\n queue.append(click)\n\n while len(queue) > 0:\n row, col = queue.pop()\n val = board[row][col]\n\n if val == \"M\": \n board[row][col] = \"X\"\n return board\n elif val == \"E\":\n bomb_count = 0\n to_add = []\n\n for addr, addc in d:\n newr = row + addr\n newc = col + addc\n if newr >= r or newr < 0: continue\n if newc >= c or newc < 0: continue\n if board[newr][newc] == \"M\":\n bomb_count += 1\n to_add.append([newr, newc])\n\n if bomb_count == 0:\n board[row][col] = \"B\"\n for e in to_add:\n queue.append(e)\n else:\n board[row][col] = str(bomb_count)\n \n \n return board","memory":"17900"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n\n return board\n\n directions = [(0,1), (0,-1), (1, 1), (1,0), (1,-1), (-1,0), (-1, -1), (-1, 1)] \n R,C = len(board), len(board[0])\n mp = defaultdict(int)\n def dfs(r,c):\n\n adj = [(r+dr, c+dc) for dr,dc in directions if r+dr in range(R) and c+dc in range(C)]\n\n mines = sum([board[x][y] == 'M' for x,y in adj])\n if mines:\n board[r][c] = str(mines)\n else:\n board[r][c] = 'B'\n for x,y in adj:\n if board[x][y] == 'E':\n dfs(x,y)\n\n dfs(*click)\n\n return board","memory":"18000"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click\n if board[x][y] == 'M':\n board[x][y] = 'X'\n\n return board\n\n directions = [(0,1), (0,-1), (1, 1), (1,0), (1,-1), (-1,0), (-1, -1), (-1, 1)] \n R,C = len(board), len(board[0])\n mp = defaultdict(int)\n def dfs(r,c):\n\n adj = [(r+dr, c+dc) for dr,dc in directions if r+dr in range(R) and c+dc in range(C)]\n\n mines = sum([board[x][y] == 'M' for x,y in adj])\n if mines:\n board[r][c] = str(mines)\n else:\n board[r][c] = 'B'\n for x,y in adj:\n if board[x][y] == 'E':\n dfs(x,y)\n\n dfs(*click)\n\n return board","memory":"18000"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n\n def helper(board, x, y):\n num_mines = 0\n\n for r in range(x-1, x+2):\n for c in range(y-1, y+2):\n if r >= 0 and r < len(board) and c >= 0 and c < len(board[r]) and board[r][c] == 'M':\n num_mines += 1\n \n return num_mines\n\n r = click[0]\n c = click[1]\n square = board[click[0]][click[1]]\n directions = [-1, 0, 1]\n adj_mine_count = 0\n\n if square == 'M':\n board[r][c] = 'X'\n return board\n\n elif square == 'E':\n num_mines = helper(board, r, c)\n\n if num_mines == 0:\n board[r][c] = 'B'\n for i in range(r-1, r+2):\n for j in range(c-1, c+2):\n if i >= 0 and i < len(board) and j >= 0 and j < len(board[r]):\n if board[i][j] == 'E':\n self.updateBoard(board, [i, j])\n else:\n board[r][c] = str(num_mines)\n \n return board\n\n ","memory":"18100"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def neighbors(r,c,board):\n for i in range(r - 1, r+2):\n for j in range(c - 1, c+2):\n if i < 0 or j < 0: continue\n if i >= len(board) or j >= len(board[0]): continue\n yield (board[i][j], i,j)\n\n def dfs(r,c, board):\n val = board[r][c]\n if val == 'M':\n board[r][c] = 'X'\n return board\n elif val == 'E':\n n_bombs = 0\n recurses = []\n for neighbor_val, i,j in neighbors(r,c, board):\n if neighbor_val == 'M':\n n_bombs += 1\n elif neighbor_val == 'E':\n recurses.append((i,j))\n if n_bombs > 0:\n board[r][c] = str(n_bombs)\n else:\n board[r][c] = 'B'\n for i,j in recurses:\n board = dfs(i,j, board)\n return board\n\n return dfs(click[0], click[1], board)","memory":"18200"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n r, c = click[0], click[1]\n if board[r][c] == 'M':\n board[r][c] = \"X\"\n return board\n\n def dfs(r, c, visited):\n if (r, c) not in visited:\n visited.add((r, c))\n count = 0\n adj = []\n for r_off, c_off in [[1, 0], [-1, 0], [0, 1], [0, -1], [-1, -1], [1, -1], [-1, 1], [1, 1]]:\n new_r, new_c = r + r_off, c + c_off\n if new_r in range(m) and new_c in range(n):\n if board[new_r][new_c] == 'M':\n adj.append((new_r, new_c))\n count += 1\n elif board[new_r][new_c] == 'E':\n adj.append((new_r, new_c)) \n if count:\n board[r][c] = str(count)\n else:\n board[r][c] = 'B'\n for r, c in adj:\n dfs(r, c, visited)\n\n\n visited = set() \n dfs(r, c, visited)\n\n return board","memory":"18300"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n visited=set([(click[0],click[1])])\n def clck(i,j):\n if i<0 or j<0 or i==len(board) or j==len(board[0]) or board[i][j]!=\"E\":\n return \n adj=[(0,1),(1,0),(-1,0),(0,-1),(1,1),(1,-1),(-1,1),(-1,-1)]\n board[i][j]='B'\n mines=0\n avoid=set()\n for a,b in adj:\n x,y=i+a,b+j\n if x<0 or y<0 or x==len(board) or y==len(board[0]) or (x,y) in visited:\n continue\n if board[x][y]=='M':\n mines+=1\n if mines:\n board[i][j]=str(mines)\n return\n for a,b in adj:\n x,y=i+a,b+j\n if x<0 or y<0 or x==len(board) or y==len(board[0]) or (x,y) in visited:\n continue\n visited.add((x,y))\n clck(x,y)\n if board[click[0]][click[1]]==\"M\":\n board[click[0]][click[1]]=\"X\"\n return board\n clck(click[0],click[1])\n return board\n\n\n \n \n\n\n\n\n\n ","memory":"18400"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]]=='M':\n board[click[0]][click[1]]='X'\n return board\n \n adjacent=lambda x,y: [(x+dx,y+dy) for dx in range(-1,2) for dy in range(-1,2) if (dx or dy) and 0<=x+dx<len(board) and 0<=y+dy<len(board[0])]\n\n def dfs(x,y):\n adj=adjacent(x,y)\n mines=sum(board[i][j]=='M' for i,j in adj)\n if mines:\n board[x][y]=str(mines)\n else:\n board[x][y]='B'\n for i,j in adj:\n if board[i][j]=='E':\n dfs(i,j)\n return \n dfs(*click)\n return board","memory":"18500"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n if board[click[0]][click[1]]=='M':\n board[click[0]][click[1]]='X'\n return board\n \n adjacent=lambda x,y: [(x+dx,y+dy) for dx in range(-1,2) for dy in range(-1,2) if (dx or dy) and 0<=x+dx<len(board) and 0<=y+dy<len(board[0])]\n\n def dfs(x,y):\n adj=adjacent(x,y)\n mines=sum(board[i][j]=='M' for i,j in adj)\n if mines:\n board[x][y]=str(mines)\n else:\n board[x][y]='B'\n for i,j in adj:\n if board[i][j]=='E':\n dfs(i,j)\n return \n dfs(*click)\n return board","memory":"18600"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n def dfs(x, y):\n if board[x][y] == 'M': board[x][y] = 'X'\n elif board[x][y] == 'E':\n cnt, nei = 0, []\n for i, j in map(lambda v: (v[0]+x, v[1]+y), [(-1, 0), (1, 0), (-1, -1), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)]):\n if 0 <= i < m and 0 <= j < n:\n nei.append((i, j))\n if board[i][j] == 'M': cnt += 1\n if not cnt:\n board[x][y] = 'B'\n for i, j in nei: dfs(i, j)\n else: board[x][y] = str(cnt)\n dfs(*click) \n return board","memory":"18700"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n \n # first calculate adjacent mines just by going through the whole thing\n def in_bound(i, j):\n return i >= 0 and j >= 0 and i < len(board) and j < len(board[0])\n\n mines_tracker = [[0] * len(board[0]) for _ in range(len(board))]\n\n def update_all_neighbors(i, j):\n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\n\n for neighbor in neighbors:\n if in_bound(neighbor[0], neighbor[1]):\n mines_tracker[neighbor[0]][neighbor[1]] += 1\n\n for i in range(len(board)):\n for j in range(len(board[0])):\n if board[i][j] == 'M':\n update_all_neighbors(i, j)\n\n def dfs(i, j):\n if board[i][j] == 'E':\n board[i][j] = 'B'\n if mines_tracker[i][j] != 0:\n board[i][j] = str(mines_tracker[i][j])\n return\n \n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\n\n for neighbor in neighbors:\n if in_bound(neighbor[0], neighbor[1]) and board[neighbor[0]][neighbor[1]] == 'E':\n dfs(neighbor[0], neighbor[1])\n \n dfs(click[0], click[1])\n\n return board\n\n \n\n\n","memory":"18800"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n \n if board[click[0]][click[1]] == 'M':\n board[click[0]][click[1]] = 'X'\n return board\n \n # first calculate adjacent mines just by going through the whole thing\n def in_bound(i, j):\n return i >= 0 and j >= 0 and i < len(board) and j < len(board[0])\n\n mines_tracker = [[0] * len(board[0]) for _ in range(len(board))]\n\n def update_all_neighbors(i, j):\n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\n\n for neighbor in neighbors:\n if in_bound(neighbor[0], neighbor[1]):\n mines_tracker[neighbor[0]][neighbor[1]] += 1\n\n for i in range(len(board)):\n for j in range(len(board[0])):\n if board[i][j] == 'M':\n update_all_neighbors(i, j)\n\n def dfs(i, j):\n if board[i][j] == 'E':\n board[i][j] = 'B'\n if mines_tracker[i][j] != 0:\n board[i][j] = str(mines_tracker[i][j])\n return\n \n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\n\n for neighbor in neighbors:\n if in_bound(neighbor[0], neighbor[1]) and board[neighbor[0]][neighbor[1]] == 'E':\n dfs(neighbor[0], neighbor[1])\n \n dfs(click[0], click[1])\n\n return board\n\n \n\n\n","memory":"18800"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m = len(board)\n n = len(board[0])\n r, c = click\n value = board[r][c]\n \n def get_adj(r, c):\n rc = [[r-1,c],[r-1,c+1],[r,c+1],[r+1,c+1],[r+1,c],[r+1,c-1],[r,c-1],[r-1,c-1]]\n return [[rr,cc] for rr, cc in rc if 0 <= rr < m and 0 <= cc < n]\n\n def get_num_adj_mines(r, c):\n rc = get_adj(r, c)\n return sum(1 for rr, cc in rc if board[rr][cc] == 'M')\n \n if value == 'M':\n board[r][c] = 'X'\n return board\n def helper(rr, cc):\n num_mines = get_num_adj_mines(rr, cc)\n if num_mines:\n board[rr][cc] = str(num_mines)\n else:\n board[rr][cc] = 'B'\n for _r, _c in get_adj(rr, cc):\n if board[_r][_c] == 'E':\n helper(_r, _c)\n helper(r, c)\n return board","memory":"18900"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n def countMine(row, col):\n count = 0\n for i,j in [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [1, -1], [-1, 1],[-1, -1]]:\n r, c = row+i, col+j\n\n if 0<= r < len(board) and 0<= c < len(board[0]) and board[r][c] == \"M\":\n count +=1\n \n return count\n \n def updateEmpty(row, col):\n count = countMine(row,col)\n if count == 0:\n board[row][col] = \"B\"\n for i,j in [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [1, -1], [-1, 1],[-1, -1]]:\n r, c = row+i, col+j\n if 0<= r < len(board) and 0<= c < len(board[0]) and board[r][c] == \"E\":\n updateEmpty(r,c)\n else:\n board[row][col] = str(count)\n \n return\n \n if board[click[0]][click[1]] == \"M\":\n board[click[0]][click[1]] = \"X\"\n return board\n \n if board[click[0]][click[1]] == \"E\":\n updateEmpty(click[0], click[1])\n return board\n","memory":"19000"},{"code":"class Solution:\n def dfs(self, i, j, board):\n m, n = len(board), len(board[0])\n\n min_count = 0\n for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1], [-1, 1], [-1, -1], [1, -1], [1, 1]]:\n x, y = i + dx, j + dy\n if 0 <= x < m and 0 <= y < n:\n if board[x][y] == \"M\":\n min_count += 1\n \n if min_count != 0:\n board[i][j] = str(min_count)\n else:\n board[i][j] = \"B\"\n for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1], [-1, 1], [-1, -1], [1, -1], [1, 1]]:\n x, y = i + dx, j + dy\n if 0 <= x < m and 0 <= y < n and board[x][y] == \"E\":\n self.dfs(x, y, board) \n\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n m, n = len(board), len(board[0])\n\n i, j = click\n if board[i][j] == \"M\":\n board[i][j] = \"X\"\n return board\n \n self.dfs(i, j, board)\n\n return board","memory":"19100"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click[0], click[1]\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):\n return board\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n directions = [[x,y] for x in [-1,0,1] for y in [-1,0,1] if x != 0 or y !=0]\n if board[x][y] == 'E':\n total_mines = 0\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n if new_x < 0 or new_x >= len(board) or new_y < 0 or new_y >= len(board[0]):\n continue\n if board[new_x][new_y] == 'M':\n total_mines += 1\n if total_mines == 0:\n board[x][y] = 'B'\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n board = self.updateBoard(board, [new_x, new_y])\n if total_mines > 0:\n board[x][y] = str(total_mines)\n return board\n","memory":"19200"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n x, y = click[0], click[1]\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):\n return board\n if board[x][y] == 'M':\n board[x][y] = 'X'\n return board\n directions = [[x,y] for x in [-1,0,1] for y in [-1,0,1] if x != 0 or y !=0]\n if board[x][y] == 'E':\n total_mines = 0\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n if new_x < 0 or new_x >= len(board) or new_y < 0 or new_y >= len(board[0]):\n continue\n if board[new_x][new_y] == 'M':\n total_mines += 1\n if total_mines == 0:\n board[x][y] = 'B'\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n board = self.updateBoard(board, [new_x, new_y])\n if total_mines > 0:\n board[x][y] = str(total_mines)\n return board\n","memory":"19200"},{"code":"class Solution:\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\n r, c = click\n # Mine revealed\n if board[r][c] == 'M':\n board[r][c] = 'X'\n return board\n visited = set()\n\n m = len(board)\n n = len(board[0])\n adjacent = dict()\n for r in range(m):\n for c in range(n):\n adj = set([(r-1, c-1), (r-1, c), (r-1, c+1),\n (r, c-1), (r, c+1),\n (r+1, c-1), (r+1, c), (r+1, c+1)])\n for x, y in adj.copy():\n if x < 0 or x >= m or y < 0 or y >= n:\n adj.remove((x,y))\n adjacent[(r,c)] = list(adj)\n #print(adjacent)\n # def adjacent(r, c):\n # adj = set([(r-1, c-1), (r-1, c), (r-1, c+1),\n # (r, c-1), (r, c+1),\n # (r+1, c-1), (r+1, c), (r+1, c+1)])\n # m = len(board)\n # n = len(board[0])\n # for x, y in adj.copy():\n # if x < 0 or x >= m or y < 0 or y >= n:\n # adj.remove((x,y))\n # return list(adj)\n q = [click]\n while q:\n r, c = q.pop()\n visited.add((r,c))\n mines = 0\n q_add = []\n #print(r,c, board[r][c], adjacent(r,c))\n #print(adjacent[(r,c)])\n for sq in adjacent[(r,c)]:\n val = board[sq[0]][sq[1]]\n if val == 'M':\n mines += 1\n elif val == 'E' and sq not in visited:\n #visited.add(sq)\n q_add.append(sq)\n if not mines:\n board[r][c] = 'B'\n q += q_add\n else:\n board[r][c] = str(mines)\n return board\n ","memory":"19300"}],"string":"[\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n\\n def checker(x,y):\\n if (x>=0) and (y>=0) and (x<len(board)) and (y<len(board[0])):\\n return True\\n return False \\n\\n queue = []\\n queue.append(click)\\n\\n while (len(queue)>0):\\n\\n x = queue[0][0]\\n y = queue[0][1]\\n del queue[0]\\n\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n else:\\n count = 0\\n for i in range(x-1, x+2):\\n for j in range(y-1, y+2):\\n if checker(i,j) and board[i][j] == 'M':\\n count+=1\\n if count > 0:\\n board[x][y]=str(count)\\n else:\\n board[x][y]='B'\\n for i in range(x-1, x+2):\\n for j in range(y-1, y+2):\\n if checker(i,j) and board[i][j] == 'E':\\n board[i][j]='B'\\n queue.append([i,j])\\n \\n return board\\n\\n\\n\\n \\n\\n \\n \\n\\n\\n\\n\",\n \"memory\": \"15800\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import List\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n directions = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[-1,1],[1,-1],[-1,-1]]\\n x, y = click[0], click[1]\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n elif board[x][y] not in ('B', 'E'):\\n return board\\n m, n = len(board), len(board[0])\\n\\n def valid_point(i, j):\\n return 0 <= i < m and 0 <= j < n\\n \\n def count_nearby_mines(board, x, y):\\n res = 0\\n for x_off, y_off in directions:\\n new_x, new_y = x + x_off, y + y_off\\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'M':\\n res += 1\\n return res\\n\\n queue = deque()\\n queue.append(click)\\n\\n while queue:\\n cur_x, cur_y = queue.popleft()\\n # Check the number of mines around the current cell\\n num_mines = count_nearby_mines(board, cur_x, cur_y)\\n if num_mines > 0:\\n board[cur_x][cur_y] = str(num_mines)\\n else:\\n board[cur_x][cur_y] = 'B'\\n for x_off, y_off in directions:\\n new_x, new_y = cur_x + x_off, cur_y + y_off\\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'E':\\n board[new_x][new_y] = 'B'\\n queue.append((new_x, new_y))\\n return board\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import List\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n directions = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[-1,1],[1,-1],[-1,-1]]\\n x, y = click[0], click[1]\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n elif board[x][y] not in ('B', 'E'):\\n return board\\n m, n = len(board), len(board[0])\\n\\n def valid_point(i, j):\\n return 0 <= i < m and 0 <= j < n\\n \\n def count_nearby_mines(board, x, y):\\n res = 0\\n for x_off, y_off in directions:\\n new_x, new_y = x + x_off, y + y_off\\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'M':\\n res += 1\\n return res\\n\\n queue = deque()\\n queue.append(click)\\n\\n while queue:\\n cur_x, cur_y = queue.popleft()\\n # Check the number of mines around the current cell\\n num_mines = count_nearby_mines(board, cur_x, cur_y)\\n if num_mines > 0:\\n board[cur_x][cur_y] = str(num_mines)\\n else:\\n board[cur_x][cur_y] = 'B'\\n for x_off, y_off in directions:\\n new_x, new_y = cur_x + x_off, cur_y + y_off\\n if valid_point(new_x, new_y) and board[new_x][new_y] == 'E':\\n board[new_x][new_y] = 'B'\\n queue.append((new_x, new_y))\\n return board\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]] == \\\"M\\\":\\n board[click[0]][click[1]] = \\\"X\\\"\\n return board\\n\\n def isInBoundary(x: int, y: int) -> bool:\\n return 0 <= x < len(board) and 0 <= y < len(board[0])\\n\\n if board[click[0]][click[1]] == \\\"E\\\":\\n # with adjacent mine, update digit\\n q = deque()\\n q.append(click)\\n dirs = [[0, 1], [1, 0], [0, -1], [-1, 0], [1, 1], [-1, -1], [1, -1], [-1, 1]]\\n while len(q) > 0:\\n # print(q)\\n cur = q.popleft()\\n # update cur' val if has mine around\\n cnt = 0\\n for dir in dirs:\\n x = cur[0] + dir[0]\\n y = cur[1] + dir[1]\\n if isInBoundary(x, y) and board[x][y] == \\\"M\\\":\\n cnt += 1\\n\\n if cnt != 0:\\n board[cur[0]][cur[1]] = str(cnt)\\n else:\\n # if no mine around, recursively add 8 nodes into the q (if it is not B)\\n board[cur[0]][cur[1]] = \\\"B\\\"\\n for dir in dirs:\\n x = cur[0] + dir[0]\\n y = cur[1] + dir[1]\\n if isInBoundary(x, y) and board[x][y] == \\\"E\\\":\\n board[x][y] = \\\"TODO\\\"\\n q.append((x, y))\\n\\n return board\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import List\\n\\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def valid(x, y, board):\\n m, n = len(board), len(board[0])\\n return True if 0 <= x < m and 0 <= y < n else False\\n\\n def get_bombs(x, y, board):\\n if not valid(x, y, board):\\n return 0\\n nums = 0\\n for offset_x, offset_y in directions:\\n cur_x, cur_y = x + offset_x, y + offset_y\\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\\n nums += 1\\n return nums\\n\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n elif board[x][y] != 'E':\\n return board\\n\\n queue = deque()\\n queue.append(click)\\n \\n while queue:\\n cur_x, cur_y = queue.popleft()\\n num_bombs = get_bombs(cur_x, cur_y, board)\\n if num_bombs != 0:\\n board[cur_x][cur_y] = str(num_bombs)\\n else:\\n board[cur_x][cur_y] = 'B'\\n for offset_x, offset_y in directions:\\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\\n board[next_x][next_y] = 'B'\\n queue.append([next_x,next_y])\\n\\n return board\\n\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"from collections import deque\\nfrom typing import List\\n\\ndirections = [[0,1],[0,-1],[1,0],[-1,0],[1,1],[1,-1],[-1,1],[-1,-1]]\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def valid(x, y, board):\\n m, n = len(board), len(board[0])\\n return True if 0 <= x < m and 0 <= y < n else False\\n\\n def get_bombs(x, y, board):\\n if not valid(x, y, board):\\n return 0\\n nums = 0\\n for offset_x, offset_y in directions:\\n cur_x, cur_y = x + offset_x, y + offset_y\\n if valid(cur_x,cur_y,board) and board[cur_x][cur_y] == 'M':\\n nums += 1\\n return nums\\n\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n elif board[x][y] != 'E':\\n return board\\n\\n queue = deque()\\n queue.append(click)\\n \\n while queue:\\n cur_x, cur_y = queue.popleft()\\n num_bombs = get_bombs(cur_x, cur_y, board)\\n if num_bombs != 0:\\n board[cur_x][cur_y] = str(num_bombs)\\n else:\\n board[cur_x][cur_y] = 'B'\\n for offset_x, offset_y in directions:\\n next_x, next_y = cur_x + offset_x, cur_y + offset_y\\n if valid(next_x,next_y,board) and board[next_x][next_y] == 'E':\\n board[next_x][next_y] = 'B'\\n queue.append([next_x,next_y])\\n\\n return board\\n\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n m, n = len(board), len(board[0])\\n q = deque()\\n q.append(click)\\n visited = set()\\n visited.add(tuple(click))\\n while q:\\n for _ in range(len(q)):\\n curr = q.popleft()\\n x, y = curr[0], curr[1]\\n count_mine = 0\\n for a,b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\\n nx, ny = x+a, y+b\\n\\n if 0 <= nx < m and 0 <= ny < n:\\n if board[nx][ny] == 'M':\\n count_mine += 1\\n if count_mine > 0:\\n board[x][y] = str(count_mine)\\n else:\\n board[x][y] = 'B'\\n for a, b in [(0,1),(1,0),(0,-1),(-1,0),(-1,-1),(-1,1),(1,1),(1,-1)]:\\n nx, ny = x+a, y+b\\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited:\\n q.append([nx,ny])\\n visited.add((nx,ny))\\n return board\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"import queue\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r, c = click\\n\\n if board[r][c] == 'M':\\n board[r][c] = 'X'\\n return board\\n \\n q = queue.Queue()\\n q.put((r, c))\\n board[r][c] = 'B'\\n \\n while not q.empty():\\n sz = q.qsize()\\n for _ in range(sz):\\n i, j = q.get()\\n count = self.countMines(board, i, j)\\n if count > 0:\\n board[i][j] = str(count)\\n continue\\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\\n _i, _j = i + di, j + dj\\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\\n continue\\n if board[_i][_j] == 'E':\\n board[_i][_j] = 'B'\\n q.put((_i, _j))\\n return board\\n\\n def countMines(self, board, i, j):\\n count = 0\\n for di, dj in [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]]:\\n _i, _j = i + di, j + dj\\n if not 0 <= _i < len(board) or not 0 <= _j < len(board[0]):\\n continue\\n if board[_i][_j] == 'M':\\n count += 1\\n return count\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x = click[0]\\n y = click[1]\\n if board[x][y] =='M':\\n board[x][y]='X'\\n return board\\n \\n ROW = len(board)\\n COL = len(board[0])\\n\\n queue = deque([[x,y]])\\n visited = set()\\n visited.add(tuple(click))\\n directions = [[1,0],[-1,0],[0,1],[0,-1],[1,1],[1,-1],[-1,-1],[-1,1]]\\n while queue:\\n for _ in range(len(queue)):\\n print(queue)\\n x, y = queue.popleft()\\n\\n count = 0 \\n\\n for dirX, dirY in directions:\\n newX = x + dirX\\n newY = y + dirY\\n\\n if newX >= ROW or newX < 0 or newY >=COL or newY < 0:\\n continue\\n if board[newX][newY]=='M':\\n count +=1\\n if count > 0:\\n board[x][y] = str(count)\\n \\n else:\\n board[x][y]='B'\\n for dirX, dirY in directions:\\n newX = x + dirX\\n newY = y + dirY\\n if newX >= ROW or newX < 0 or newY >=COL or newY < 0 or (newX,newY) in visited:\\n continue\\n queue.append([newX,newY])\\n visited.add((newX,newY))\\n return board\\n\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m = len(board)\\n n = len(board[0])\\n moves = [(0, -1), (-1, -1), (-1, 0), (-1, 1),\\n (0, 1), (1, 1), (1, 0), (1, -1)]\\n\\n def dfs(i, j):\\n if board[i][j] == 'M':\\n board[i][j] = 'X'\\n return\\n \\n count = 0\\n for di, dj in moves:\\n ii = i + di\\n jj = j + dj\\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'M':\\n count += 1\\n if count > 0:\\n board[i][j] = str(count)\\n else:\\n board[i][j] = 'B'\\n for di, dj in moves:\\n ii = i + di\\n jj = j + dj\\n if -1 < ii < m and -1 < jj < n and board[ii][jj] == 'E':\\n dfs(ii, jj)\\n return\\n \\n dfs(click[0], click[1])\\n return board\\n\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n self.board = board\\n m, n = len(self.board), len(self.board[0])\\n def in_bounds(i, j):\\n return 0 <= i < m and 0 <= j < n\\n r, c = click\\n if not in_bounds(r, c):\\n return self.board\\n if self.board[r][c] == \\\"M\\\":\\n self.board[r][c] = \\\"X\\\"\\n return self.board\\n\\n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\\n didj.remove((0, 0))\\n\\n def dfs(i, j):\\n if not in_bounds(i, j) or self.board[i][j] != \\\"E\\\":\\n return\\n bomb_count = 0\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n if in_bounds(ni, nj) and self.board[ni][nj] == \\\"M\\\":\\n bomb_count += 1\\n if bomb_count:\\n self.board[i][j] = str(bomb_count)\\n return\\n self.board[i][j] = \\\"B\\\"\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n if in_bounds(ni, nj):\\n dfs(ni, nj)\\n dfs(r, c)\\n return self.board\\n\",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n\\n\\n def has_no_bombs_adjacent(self, board, r, c):\\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]):\\n if board[nr][nc] == 'X' or board[nr][nc] == 'M':\\n return False \\n return True \\n\\n\\n def updateEmpty(self, board, r, c):\\n if self.has_no_bombs_adjacent(board, r, c):\\n # need to recurse \\n board[r][c] = 'B'\\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'E':\\n self.updateEmpty(board, nr, nc) \\n \\n else:\\n my_count = 0\\n for dr, dc in [(1, 0), (0, 1), (-1, 0), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]:\\n nr, nc = r + dr, c + dc\\n if 0 <= nr < len(board) and 0 <= nc < len(board[0]) and board[nr][nc] == 'M':\\n my_count += 1 \\n board[r][c] = str(my_count) \\n\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\n clicked_square = board[click[0]][click[1]]\\n\\n if clicked_square == 'M':\\n board[click[0]][click[1]] = 'X'\\n elif clicked_square == 'E':\\n self.updateEmpty(board, click[0], click[1]) \\n\\n return board \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\\"\\\"\\\"\\n Recursive Approach: DFS\\n \\\"\\\"\\\"\\n if not board:\\n return board\\n\\n DIRECTIONS = [(1, 0), (-1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (-1, 1), (1, -1)]\\n ROWS, COLS = len(board), len(board[0])\\n CLICK_R, CLICK_C = click \\n\\n def count_mines(row, col):\\n count = 0\\n for dr, dc in DIRECTIONS:\\n new_r, new_c = row + dr, col + dc\\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'M'):\\n count += 1\\n return count\\n\\n def explore_cell(row, col):\\n adj_mines = count_mines(row, col)\\n\\n if adj_mines > 0:\\n board[row][col] = str(adj_mines)\\n else:\\n board[row][col] = 'B'\\n for dr, dc in DIRECTIONS:\\n new_r, new_c = row + dr, col + dc\\n if (0 <= new_r < ROWS and 0 <= new_c < COLS and board[new_r][new_c] == 'E'):\\n explore_cell(new_r, new_c)\\n\\n if board[CLICK_R][CLICK_C] == 'M':\\n board[CLICK_R][CLICK_C] = 'X'\\n else:\\n explore_cell(CLICK_R, CLICK_C) # Click on 'E'\\n \\n return board\\n\\n # O(m * n) time.\\n # O(m * n) auxiliary space.\\n # O(m * n) total space.\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n click_r, click_c = click\\n if board[click_r][click_c] == \\\"M\\\":\\n board[click_r][click_c] = \\\"X\\\"\\n return board\\n \\n def num_adjacent_mines(i: int, j: int) -> int:\\n count = 0\\n if i > 0:\\n if board[i-1][j] == \\\"M\\\":\\n count += 1\\n if j > 0 and board[i-1][j-1] == \\\"M\\\":\\n count += 1\\n if j < len(board[0])-1 and board[i-1][j+1] == \\\"M\\\":\\n count += 1\\n if j > 0:\\n if board[i][j-1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1 and board[i+1][j-1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1:\\n if board[i+1][j] == \\\"M\\\":\\n count += 1\\n if j < len(board[0])-1:\\n if board[i][j+1] == \\\"M\\\":\\n count += 1\\n if i < len(board)-1 and board[i+1][j+1] == \\\"M\\\":\\n count += 1\\n print(f\\\"i: {i} j: {j} num adjacent mines: {count}\\\")\\n return count\\n\\n def reveal(i: int, j: int) -> None:\\n if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):\\n return\\n if board[i][j] != \\\"E\\\":\\n return\\n num_mines = num_adjacent_mines(i, j)\\n if num_mines == 0:\\n board[i][j] = \\\"B\\\"\\n reveal(i+1, j)\\n reveal(i-1, j)\\n reveal(i, j+1)\\n reveal(i, j-1)\\n reveal(i+1, j+1)\\n reveal(i-1, j-1)\\n reveal(i+1, j-1)\\n reveal(i-1, j+1)\\n else:\\n board[i][j] = str(num_mines)\\n\\n reveal(click_r, click_c)\\n return board\\n\",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n self.board = board\\n m, n = len(self.board), len(self.board[0])\\n def in_bounds(r, c):\\n return 0 <= r < m and 0 <= c < n\\n r, c = click\\n if not in_bounds(r, c):\\n return self.board\\n if self.board[r][c] == \\\"M\\\":\\n self.board[r][c] = \\\"X\\\"\\n return self.board\\n \\n didj = set([(i, j) for i in [-1, 0, 1] for j in [-1, 0, 1]])\\n didj.remove((0, 0))\\n def dfs(i, j):\\n if not in_bounds(i, j) or self.board[i][j] != \\\"E\\\":\\n return \\n bomb_count = 0\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n if in_bounds(ni, nj) and self.board[ni][nj] == \\\"M\\\":\\n bomb_count += 1\\n if bomb_count:\\n self.board[i][j] = str(bomb_count)\\n return\\n self.board[i][j] = \\\"B\\\"\\n for di, dj in didj:\\n ni, nj = i+di, j+dj\\n dfs(ni, nj)\\n return\\n dfs(r, c)\\n return self.board\\n\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"'''\\nIf the click is on a Mine, store that cell with X.\\nElse call the helper function to calculate the number of adjacent mines and return number.\\nIf the number is 0, mark that cell as B. Otherwise store number in that cell. \\n'''\\nclass Solution:\\n def checkAdjacent(self, board, x, y):\\n # [x-1, y-1] [x-1, y] [x-1, y+1]\\n # [x, y-1] [x, y] [x, y+1]\\n # [x+1, y-1] [x+1, y] [x+1, y+1]\\n number = 0\\n for r in range(x-1, x+2):\\n for c in range(y-1, y+2):\\n if r >= 0 and r<len(board) and c>=0 and c<len(board[r]) and board[r][c]=='M':\\n number += 1\\n return number\\n\\n\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click[0], click[1]\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n else:\\n number = self.checkAdjacent(board, x, y)\\n if number:\\n board[x][y] = str(number)\\n else:\\n board[x][y] = 'B'\\n for r in range(x-1, x+2):\\n for c in range(y-1, y+2):\\n if r >= 0 and r<len(board) and c>=0 and c<len(board[r]) and board[r][c] != 'B':\\n self.updateBoard(board, [r,c])\\n return board\\n\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def getnums(self,board,x,y):\\n num=0\\n for i in range(x-1,x+2):\\n for j in range(y-1,y+2):\\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]=='M':\\n num+=1\\n return num \\n\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if not board:\\n return board\\n x,y=click\\n if board[x][y]=='M':\\n board[x][y]='X'\\n else:\\n num=self.getnums(board,x,y)\\n if num:\\n board[x][y]=str(num)\\n else:\\n board[x][y]='B'\\n for i in range(x-1,x+2):\\n for j in range(y-1,y+2):\\n if i >= 0 and i<len(board) and j>=0 and j<len(board[i]) and board[i][j]!='B':\\n self.updateBoard(board,[i,j])\\n return board \\n\",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n i, j = click[0], click[1]\\n\\n # If a mine ('M') is revealed, then the game is over - change it to 'X'\\n if board[i][j] == 'M':\\n board[i][j] = 'X'\\n return board\\n \\n # run dfs to reveal the board\\n self.dfs(board, i, j)\\n return board\\n \\n def dfs(self, board, i, j):\\n if board[i][j] != 'E':\\n return\\n \\n m, n = len(board), len(board[0])\\n directions = [(-1, -1), (0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0)]\\n\\n mine_count = 0\\n\\n for d in directions:\\n ni, nj = i + d[0], j + d[1]\\n if 0 <= ni < m and 0 <= nj < n and board[ni][nj] == 'M':\\n mine_count += 1\\n \\n if mine_count == 0:\\n board[i][j] = 'B'\\n else:\\n board[i][j] = str(mine_count)\\n return\\n \\n for d in directions:\\n ni, nj = i + d[0], j + d[1]\\n if 0 <= ni < m and 0 <= nj < n:\\n self.dfs(board, ni, nj)\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r = len(board)\\n c = len(board[0])\\n d = [\\n (0, 1), \\n (0, -1),\\n (1, 0),\\n (-1, 0),\\n (-1, -1),\\n (-1, 1),\\n (1, -1),\\n (1, 1)\\n ]\\n\\n queue = deque()\\n queue.append(click)\\n\\n while len(queue) > 0:\\n row, col = queue.pop()\\n val = board[row][col]\\n\\n if val == \\\"M\\\": \\n board[row][col] = \\\"X\\\"\\n return board\\n elif val == \\\"E\\\":\\n bomb_count = 0\\n to_add = []\\n\\n for addr, addc in d:\\n newr = row + addr\\n newc = col + addc\\n if newr >= r or newr < 0: continue\\n if newc >= c or newc < 0: continue\\n if board[newr][newc] == \\\"M\\\":\\n bomb_count += 1\\n to_add.append((newr, newc))\\n\\n if bomb_count == 0:\\n board[row][col] = \\\"B\\\"\\n for e in to_add:\\n queue.append(e)\\n else:\\n board[row][col] = str(bomb_count)\\n \\n \\n return board\",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n i, j = click[0], click[1]\\n if board[i][j] == \\\"M\\\":\\n board[i][j] = \\\"X\\\"\\n return board\\n\\n m = len(board)\\n n = len(board[0])\\n q = [(i, j)]\\n visited = set()\\n while len(q) > 0:\\n i, j = q.pop()\\n if (i, j) in visited:\\n continue\\n visited.add((i, j))\\n adj_bombs = 0\\n for adj_i in range(i - 1, i + 2):\\n for adj_j in range(j - 1, j + 2):\\n if 0 <= adj_i < m and 0 <= adj_j < n and board[adj_i][adj_j] == \\\"M\\\":\\n adj_bombs += 1\\n if adj_bombs > 0:\\n board[i][j] = str(adj_bombs)\\n else:\\n board[i][j] = \\\"B\\\"\\n for adj_i in range(i - 1, i + 2):\\n for adj_j in range(j - 1, j + 2):\\n if 0 <= adj_i < m and 0 <= adj_j < n:\\n q.append((adj_i, adj_j))\\n return board\",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r = len(board)\\n c = len(board[0])\\n d = [\\n (0, 1), \\n (0, -1),\\n (1, 0),\\n (-1, 0),\\n (-1, -1),\\n (-1, 1),\\n (1, -1),\\n (1, 1)\\n ]\\n\\n queue = deque()\\n queue.append(click)\\n\\n while len(queue) > 0:\\n row, col = queue.pop()\\n val = board[row][col]\\n\\n if val == \\\"M\\\": \\n board[row][col] = \\\"X\\\"\\n return board\\n elif val == \\\"E\\\":\\n bomb_count = 0\\n to_add = []\\n\\n for addr, addc in d:\\n newr = row + addr\\n newc = col + addc\\n if newr >= r or newr < 0: continue\\n if newc >= c or newc < 0: continue\\n if board[newr][newc] == \\\"M\\\":\\n bomb_count += 1\\n to_add.append([newr, newc])\\n\\n if bomb_count == 0:\\n board[row][col] = \\\"B\\\"\\n for e in to_add:\\n queue.append(e)\\n else:\\n board[row][col] = str(bomb_count)\\n \\n \\n return board\",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"from collections import deque\\n\\nclass Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r = len(board)\\n c = len(board[0])\\n d = [\\n (0, 1), \\n (0, -1),\\n (1, 0),\\n (-1, 0),\\n (-1, -1),\\n (-1, 1),\\n (1, -1),\\n (1, 1)\\n ]\\n\\n queue = deque()\\n queue.append(click)\\n\\n while len(queue) > 0:\\n row, col = queue.pop()\\n val = board[row][col]\\n\\n if val == \\\"M\\\": \\n board[row][col] = \\\"X\\\"\\n return board\\n elif val == \\\"E\\\":\\n bomb_count = 0\\n to_add = []\\n\\n for addr, addc in d:\\n newr = row + addr\\n newc = col + addc\\n if newr >= r or newr < 0: continue\\n if newc >= c or newc < 0: continue\\n if board[newr][newc] == \\\"M\\\":\\n bomb_count += 1\\n to_add.append([newr, newc])\\n\\n if bomb_count == 0:\\n board[row][col] = \\\"B\\\"\\n for e in to_add:\\n queue.append(e)\\n else:\\n board[row][col] = str(bomb_count)\\n \\n \\n return board\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n\\n return board\\n\\n directions = [(0,1), (0,-1), (1, 1), (1,0), (1,-1), (-1,0), (-1, -1), (-1, 1)] \\n R,C = len(board), len(board[0])\\n mp = defaultdict(int)\\n def dfs(r,c):\\n\\n adj = [(r+dr, c+dc) for dr,dc in directions if r+dr in range(R) and c+dc in range(C)]\\n\\n mines = sum([board[x][y] == 'M' for x,y in adj])\\n if mines:\\n board[r][c] = str(mines)\\n else:\\n board[r][c] = 'B'\\n for x,y in adj:\\n if board[x][y] == 'E':\\n dfs(x,y)\\n\\n dfs(*click)\\n\\n return board\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n\\n return board\\n\\n directions = [(0,1), (0,-1), (1, 1), (1,0), (1,-1), (-1,0), (-1, -1), (-1, 1)] \\n R,C = len(board), len(board[0])\\n mp = defaultdict(int)\\n def dfs(r,c):\\n\\n adj = [(r+dr, c+dc) for dr,dc in directions if r+dr in range(R) and c+dc in range(C)]\\n\\n mines = sum([board[x][y] == 'M' for x,y in adj])\\n if mines:\\n board[r][c] = str(mines)\\n else:\\n board[r][c] = 'B'\\n for x,y in adj:\\n if board[x][y] == 'E':\\n dfs(x,y)\\n\\n dfs(*click)\\n\\n return board\",\n \"memory\": \"18000\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n\\n def helper(board, x, y):\\n num_mines = 0\\n\\n for r in range(x-1, x+2):\\n for c in range(y-1, y+2):\\n if r >= 0 and r < len(board) and c >= 0 and c < len(board[r]) and board[r][c] == 'M':\\n num_mines += 1\\n \\n return num_mines\\n\\n r = click[0]\\n c = click[1]\\n square = board[click[0]][click[1]]\\n directions = [-1, 0, 1]\\n adj_mine_count = 0\\n\\n if square == 'M':\\n board[r][c] = 'X'\\n return board\\n\\n elif square == 'E':\\n num_mines = helper(board, r, c)\\n\\n if num_mines == 0:\\n board[r][c] = 'B'\\n for i in range(r-1, r+2):\\n for j in range(c-1, c+2):\\n if i >= 0 and i < len(board) and j >= 0 and j < len(board[r]):\\n if board[i][j] == 'E':\\n self.updateBoard(board, [i, j])\\n else:\\n board[r][c] = str(num_mines)\\n \\n return board\\n\\n \",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def neighbors(r,c,board):\\n for i in range(r - 1, r+2):\\n for j in range(c - 1, c+2):\\n if i < 0 or j < 0: continue\\n if i >= len(board) or j >= len(board[0]): continue\\n yield (board[i][j], i,j)\\n\\n def dfs(r,c, board):\\n val = board[r][c]\\n if val == 'M':\\n board[r][c] = 'X'\\n return board\\n elif val == 'E':\\n n_bombs = 0\\n recurses = []\\n for neighbor_val, i,j in neighbors(r,c, board):\\n if neighbor_val == 'M':\\n n_bombs += 1\\n elif neighbor_val == 'E':\\n recurses.append((i,j))\\n if n_bombs > 0:\\n board[r][c] = str(n_bombs)\\n else:\\n board[r][c] = 'B'\\n for i,j in recurses:\\n board = dfs(i,j, board)\\n return board\\n\\n return dfs(click[0], click[1], board)\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n r, c = click[0], click[1]\\n if board[r][c] == 'M':\\n board[r][c] = \\\"X\\\"\\n return board\\n\\n def dfs(r, c, visited):\\n if (r, c) not in visited:\\n visited.add((r, c))\\n count = 0\\n adj = []\\n for r_off, c_off in [[1, 0], [-1, 0], [0, 1], [0, -1], [-1, -1], [1, -1], [-1, 1], [1, 1]]:\\n new_r, new_c = r + r_off, c + c_off\\n if new_r in range(m) and new_c in range(n):\\n if board[new_r][new_c] == 'M':\\n adj.append((new_r, new_c))\\n count += 1\\n elif board[new_r][new_c] == 'E':\\n adj.append((new_r, new_c)) \\n if count:\\n board[r][c] = str(count)\\n else:\\n board[r][c] = 'B'\\n for r, c in adj:\\n dfs(r, c, visited)\\n\\n\\n visited = set() \\n dfs(r, c, visited)\\n\\n return board\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n visited=set([(click[0],click[1])])\\n def clck(i,j):\\n if i<0 or j<0 or i==len(board) or j==len(board[0]) or board[i][j]!=\\\"E\\\":\\n return \\n adj=[(0,1),(1,0),(-1,0),(0,-1),(1,1),(1,-1),(-1,1),(-1,-1)]\\n board[i][j]='B'\\n mines=0\\n avoid=set()\\n for a,b in adj:\\n x,y=i+a,b+j\\n if x<0 or y<0 or x==len(board) or y==len(board[0]) or (x,y) in visited:\\n continue\\n if board[x][y]=='M':\\n mines+=1\\n if mines:\\n board[i][j]=str(mines)\\n return\\n for a,b in adj:\\n x,y=i+a,b+j\\n if x<0 or y<0 or x==len(board) or y==len(board[0]) or (x,y) in visited:\\n continue\\n visited.add((x,y))\\n clck(x,y)\\n if board[click[0]][click[1]]==\\\"M\\\":\\n board[click[0]][click[1]]=\\\"X\\\"\\n return board\\n clck(click[0],click[1])\\n return board\\n\\n\\n \\n \\n\\n\\n\\n\\n\\n \",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]]=='M':\\n board[click[0]][click[1]]='X'\\n return board\\n \\n adjacent=lambda x,y: [(x+dx,y+dy) for dx in range(-1,2) for dy in range(-1,2) if (dx or dy) and 0<=x+dx<len(board) and 0<=y+dy<len(board[0])]\\n\\n def dfs(x,y):\\n adj=adjacent(x,y)\\n mines=sum(board[i][j]=='M' for i,j in adj)\\n if mines:\\n board[x][y]=str(mines)\\n else:\\n board[x][y]='B'\\n for i,j in adj:\\n if board[i][j]=='E':\\n dfs(i,j)\\n return \\n dfs(*click)\\n return board\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n if board[click[0]][click[1]]=='M':\\n board[click[0]][click[1]]='X'\\n return board\\n \\n adjacent=lambda x,y: [(x+dx,y+dy) for dx in range(-1,2) for dy in range(-1,2) if (dx or dy) and 0<=x+dx<len(board) and 0<=y+dy<len(board[0])]\\n\\n def dfs(x,y):\\n adj=adjacent(x,y)\\n mines=sum(board[i][j]=='M' for i,j in adj)\\n if mines:\\n board[x][y]=str(mines)\\n else:\\n board[x][y]='B'\\n for i,j in adj:\\n if board[i][j]=='E':\\n dfs(i,j)\\n return \\n dfs(*click)\\n return board\",\n \"memory\": \"18600\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n def dfs(x, y):\\n if board[x][y] == 'M': board[x][y] = 'X'\\n elif board[x][y] == 'E':\\n cnt, nei = 0, []\\n for i, j in map(lambda v: (v[0]+x, v[1]+y), [(-1, 0), (1, 0), (-1, -1), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)]):\\n if 0 <= i < m and 0 <= j < n:\\n nei.append((i, j))\\n if board[i][j] == 'M': cnt += 1\\n if not cnt:\\n board[x][y] = 'B'\\n for i, j in nei: dfs(i, j)\\n else: board[x][y] = str(cnt)\\n dfs(*click) \\n return board\",\n \"memory\": \"18700\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n \\n # first calculate adjacent mines just by going through the whole thing\\n def in_bound(i, j):\\n return i >= 0 and j >= 0 and i < len(board) and j < len(board[0])\\n\\n mines_tracker = [[0] * len(board[0]) for _ in range(len(board))]\\n\\n def update_all_neighbors(i, j):\\n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\\n\\n for neighbor in neighbors:\\n if in_bound(neighbor[0], neighbor[1]):\\n mines_tracker[neighbor[0]][neighbor[1]] += 1\\n\\n for i in range(len(board)):\\n for j in range(len(board[0])):\\n if board[i][j] == 'M':\\n update_all_neighbors(i, j)\\n\\n def dfs(i, j):\\n if board[i][j] == 'E':\\n board[i][j] = 'B'\\n if mines_tracker[i][j] != 0:\\n board[i][j] = str(mines_tracker[i][j])\\n return\\n \\n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\\n\\n for neighbor in neighbors:\\n if in_bound(neighbor[0], neighbor[1]) and board[neighbor[0]][neighbor[1]] == 'E':\\n dfs(neighbor[0], neighbor[1])\\n \\n dfs(click[0], click[1])\\n\\n return board\\n\\n \\n\\n\\n\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n \\n if board[click[0]][click[1]] == 'M':\\n board[click[0]][click[1]] = 'X'\\n return board\\n \\n # first calculate adjacent mines just by going through the whole thing\\n def in_bound(i, j):\\n return i >= 0 and j >= 0 and i < len(board) and j < len(board[0])\\n\\n mines_tracker = [[0] * len(board[0]) for _ in range(len(board))]\\n\\n def update_all_neighbors(i, j):\\n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\\n\\n for neighbor in neighbors:\\n if in_bound(neighbor[0], neighbor[1]):\\n mines_tracker[neighbor[0]][neighbor[1]] += 1\\n\\n for i in range(len(board)):\\n for j in range(len(board[0])):\\n if board[i][j] == 'M':\\n update_all_neighbors(i, j)\\n\\n def dfs(i, j):\\n if board[i][j] == 'E':\\n board[i][j] = 'B'\\n if mines_tracker[i][j] != 0:\\n board[i][j] = str(mines_tracker[i][j])\\n return\\n \\n neighbors = [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1), (i - 1, j - 1), (i - 1, j + 1), (i + 1, j - 1), (i + 1, j + 1)]\\n\\n for neighbor in neighbors:\\n if in_bound(neighbor[0], neighbor[1]) and board[neighbor[0]][neighbor[1]] == 'E':\\n dfs(neighbor[0], neighbor[1])\\n \\n dfs(click[0], click[1])\\n\\n return board\\n\\n \\n\\n\\n\",\n \"memory\": \"18800\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m = len(board)\\n n = len(board[0])\\n r, c = click\\n value = board[r][c]\\n \\n def get_adj(r, c):\\n rc = [[r-1,c],[r-1,c+1],[r,c+1],[r+1,c+1],[r+1,c],[r+1,c-1],[r,c-1],[r-1,c-1]]\\n return [[rr,cc] for rr, cc in rc if 0 <= rr < m and 0 <= cc < n]\\n\\n def get_num_adj_mines(r, c):\\n rc = get_adj(r, c)\\n return sum(1 for rr, cc in rc if board[rr][cc] == 'M')\\n \\n if value == 'M':\\n board[r][c] = 'X'\\n return board\\n def helper(rr, cc):\\n num_mines = get_num_adj_mines(rr, cc)\\n if num_mines:\\n board[rr][cc] = str(num_mines)\\n else:\\n board[rr][cc] = 'B'\\n for _r, _c in get_adj(rr, cc):\\n if board[_r][_c] == 'E':\\n helper(_r, _c)\\n helper(r, c)\\n return board\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n def countMine(row, col):\\n count = 0\\n for i,j in [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [1, -1], [-1, 1],[-1, -1]]:\\n r, c = row+i, col+j\\n\\n if 0<= r < len(board) and 0<= c < len(board[0]) and board[r][c] == \\\"M\\\":\\n count +=1\\n \\n return count\\n \\n def updateEmpty(row, col):\\n count = countMine(row,col)\\n if count == 0:\\n board[row][col] = \\\"B\\\"\\n for i,j in [[0,1], [1, 0], [0, -1], [-1, 0], [1, 1], [1, -1], [-1, 1],[-1, -1]]:\\n r, c = row+i, col+j\\n if 0<= r < len(board) and 0<= c < len(board[0]) and board[r][c] == \\\"E\\\":\\n updateEmpty(r,c)\\n else:\\n board[row][col] = str(count)\\n \\n return\\n \\n if board[click[0]][click[1]] == \\\"M\\\":\\n board[click[0]][click[1]] = \\\"X\\\"\\n return board\\n \\n if board[click[0]][click[1]] == \\\"E\\\":\\n updateEmpty(click[0], click[1])\\n return board\\n\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, i, j, board):\\n m, n = len(board), len(board[0])\\n\\n min_count = 0\\n for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1], [-1, 1], [-1, -1], [1, -1], [1, 1]]:\\n x, y = i + dx, j + dy\\n if 0 <= x < m and 0 <= y < n:\\n if board[x][y] == \\\"M\\\":\\n min_count += 1\\n \\n if min_count != 0:\\n board[i][j] = str(min_count)\\n else:\\n board[i][j] = \\\"B\\\"\\n for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1], [-1, 1], [-1, -1], [1, -1], [1, 1]]:\\n x, y = i + dx, j + dy\\n if 0 <= x < m and 0 <= y < n and board[x][y] == \\\"E\\\":\\n self.dfs(x, y, board) \\n\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n m, n = len(board), len(board[0])\\n\\n i, j = click\\n if board[i][j] == \\\"M\\\":\\n board[i][j] = \\\"X\\\"\\n return board\\n \\n self.dfs(i, j, board)\\n\\n return board\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click[0], click[1]\\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):\\n return board\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n directions = [[x,y] for x in [-1,0,1] for y in [-1,0,1] if x != 0 or y !=0]\\n if board[x][y] == 'E':\\n total_mines = 0\\n for dx, dy in directions:\\n new_x, new_y = x + dx, y + dy\\n if new_x < 0 or new_x >= len(board) or new_y < 0 or new_y >= len(board[0]):\\n continue\\n if board[new_x][new_y] == 'M':\\n total_mines += 1\\n if total_mines == 0:\\n board[x][y] = 'B'\\n for dx, dy in directions:\\n new_x, new_y = x + dx, y + dy\\n board = self.updateBoard(board, [new_x, new_y])\\n if total_mines > 0:\\n board[x][y] = str(total_mines)\\n return board\\n\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n x, y = click[0], click[1]\\n if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):\\n return board\\n if board[x][y] == 'M':\\n board[x][y] = 'X'\\n return board\\n directions = [[x,y] for x in [-1,0,1] for y in [-1,0,1] if x != 0 or y !=0]\\n if board[x][y] == 'E':\\n total_mines = 0\\n for dx, dy in directions:\\n new_x, new_y = x + dx, y + dy\\n if new_x < 0 or new_x >= len(board) or new_y < 0 or new_y >= len(board[0]):\\n continue\\n if board[new_x][new_y] == 'M':\\n total_mines += 1\\n if total_mines == 0:\\n board[x][y] = 'B'\\n for dx, dy in directions:\\n new_x, new_y = x + dx, y + dy\\n board = self.updateBoard(board, [new_x, new_y])\\n if total_mines > 0:\\n board[x][y] = str(total_mines)\\n return board\\n\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"class Solution:\\n def updateBoard(self, board: List[List[str]], click: List[int]) -> List[List[str]]:\\n r, c = click\\n # Mine revealed\\n if board[r][c] == 'M':\\n board[r][c] = 'X'\\n return board\\n visited = set()\\n\\n m = len(board)\\n n = len(board[0])\\n adjacent = dict()\\n for r in range(m):\\n for c in range(n):\\n adj = set([(r-1, c-1), (r-1, c), (r-1, c+1),\\n (r, c-1), (r, c+1),\\n (r+1, c-1), (r+1, c), (r+1, c+1)])\\n for x, y in adj.copy():\\n if x < 0 or x >= m or y < 0 or y >= n:\\n adj.remove((x,y))\\n adjacent[(r,c)] = list(adj)\\n #print(adjacent)\\n # def adjacent(r, c):\\n # adj = set([(r-1, c-1), (r-1, c), (r-1, c+1),\\n # (r, c-1), (r, c+1),\\n # (r+1, c-1), (r+1, c), (r+1, c+1)])\\n # m = len(board)\\n # n = len(board[0])\\n # for x, y in adj.copy():\\n # if x < 0 or x >= m or y < 0 or y >= n:\\n # adj.remove((x,y))\\n # return list(adj)\\n q = [click]\\n while q:\\n r, c = q.pop()\\n visited.add((r,c))\\n mines = 0\\n q_add = []\\n #print(r,c, board[r][c], adjacent(r,c))\\n #print(adjacent[(r,c)])\\n for sq in adjacent[(r,c)]:\\n val = board[sq[0]][sq[1]]\\n if val == 'M':\\n mines += 1\\n elif val == 'E' and sq not in visited:\\n #visited.add(sq)\\n q_add.append(sq)\\n if not mines:\\n board[r][c] = 'B'\\n q += q_add\\n else:\\n board[r][c] = str(mines)\\n return board\\n \",\n \"memory\": \"19300\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":39,"string":"39"}}},{"rowIdx":282,"cells":{"question_id":{"kind":"number","value":378,"string":"378"},"name":{"kind":"string","value":"kth-smallest-element-in-a-sorted-matrix"},"content":{"kind":"string","value":"<p>Given an <code>n x n</code> <code>matrix</code> where each of the rows and columns is sorted in ascending order, return <em>the</em> <code>k<sup>th</sup></code> <em>smallest element in the matrix</em>.</p>\n\n<p>Note that it is the <code>k<sup>th</sup></code> smallest element <strong>in the sorted order</strong>, not the <code>k<sup>th</sup></code> <strong>distinct</strong> element.</p>\n\n<p>You must find a solution with a memory complexity better than <code>O(n<sup>2</sup>)</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8\n<strong>Output:</strong> 13\n<strong>Explanation:</strong> The elements in the matrix are [1,5,9,10,11,12,13,<u><strong>13</strong></u>,15], and the 8<sup>th</sup> smallest number is 13\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> matrix = [[-5]], k = 1\n<strong>Output:</strong> -5\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>n == matrix.length == matrix[i].length</code></li>\n\t<li><code>1 <= n <= 300</code></li>\n\t<li><code>-10<sup>9</sup> <= matrix[i][j] <= 10<sup>9</sup></code></li>\n\t<li>All the rows and columns of <code>matrix</code> are <strong>guaranteed</strong> to be sorted in <strong>non-decreasing order</strong>.</li>\n\t<li><code>1 <= k <= n<sup>2</sup></code></li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong></p>\n\n<ul>\n\t<li>Could you solve the problem with a constant memory (i.e., <code>O(1)</code> memory complexity)?</li>\n\t<li>Could you solve the problem in <code>O(n)</code> time complexity? The solution may be too advanced for an interview but you may find reading <a href=\"http://www.cse.yorku.ca/~andy/pubs/X+Y.pdf\" target=\"_blank\">this paper</a> fun.</li>\n</ul>\n"},"acRate":{"kind":"number","value":62.77026676214762,"string":"62.770267"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","binary-search","sorting","heap-priority-queue","matrix"],"string":"[\n \"array\",\n \"binary-search\",\n \"sorting\",\n \"heap-priority-queue\",\n \"matrix\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"43\", 0.114], [\"46\", 0.0285], [\"49\", 0.0856], [\"52\", 0.0285], [\"55\", 0.1142], [\"58\", 0.0571], [\"61\", 0.1427], [\"64\", 0.1427], [\"67\", 0.3425], [\"70\", 0.1142], [\"73\", 0.2854], [\"76\", 0.4281], [\"79\", 0.5993], [\"82\", 0.7135], [\"85\", 0.9418], [\"88\", 1.1416], [\"91\", 0.9418], [\"94\", 1.5126], [\"97\", 1.5696], [\"100\", 1.4555], [\"103\", 1.6267], [\"106\", 1.5696], [\"109\", 1.9406], [\"112\", 2.5114], [\"115\", 1.9121], [\"118\", 2.4829], [\"121\", 2.226], [\"124\", 1.6267], [\"127\", 2.1119], [\"130\", 1.7409], [\"133\", 1.7979], [\"136\", 2.3973], [\"139\", 1.5982], [\"142\", 2.0263], [\"145\", 1.3413], [\"148\", 3.8528], [\"151\", 5.0514], [\"154\", 6.3355], [\"157\", 7.191800000000001], [\"160\", 7.505699999999999], [\"164\", 6.221399999999999], [\"167\", 4.2523], [\"170\", 2.5685], [\"173\", 1.8836], [\"176\", 1.0272999999999999], [\"179\", 0.6562999999999999], [\"182\", 0.8562], [\"185\", 1.0845], [\"188\", 0.7991], [\"191\", 0.6562999999999999], [\"194\", 0.7134], [\"197\", 0.45659999999999995], [\"200\", 0.2854], [\"203\", 0.39949999999999997], [\"206\", 0.42810000000000004], [\"209\", 0.25689999999999996], [\"212\", 0.2569], [\"215\", 0.0855], [\"218\", 0.2283], [\"221\", 0.0856], [\"224\", 0.2569], [\"227\", 0.1141], [\"230\", 0.0855], [\"233\", 0.0285], [\"236\", 0.057], [\"239\", 0.0856], [\"242\", 0.057], [\"245\", 0.057], [\"248\", 0.0856], [\"251\", 0.057], [\"254\", 0.1141], [\"257\", 0.1141], [\"260\", 0.0571], [\"263\", 0.0571], [\"266\", 0.1141], [\"269\", 0.1141], [\"272\", 0.11410000000000001], [\"275\", 0.1712], [\"278\", 0.1141], [\"281\", 0.22829999999999998]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18900\", 0.0285], [\"20800\", 0.0856], [\"20900\", 0.2568], [\"21000\", 1.6267], [\"21100\", 20.3196], [\"21200\", 38.7842], [\"21300\", 13.0422], [\"21400\", 11.3299], [\"21500\", 3.3961], [\"21600\", 0.9132], [\"21700\", 0.7705], [\"21800\", 0.3139], [\"21900\", 0.371], [\"22000\", 0.0856], [\"22100\", 0.1142], [\"22300\", 0.0571], [\"22500\", 0.0285], [\"22600\", 0.0571], [\"22700\", 0.1142], [\"22800\", 0.0856], [\"23000\", 0.0285], [\"23100\", 0.0856], [\"23200\", 0.0856], [\"23300\", 0.1142], [\"23400\", 0.1998], [\"23500\", 0.1142], [\"23600\", 0.0285], [\"23700\", 0.0856], [\"23800\", 0.4852], [\"23900\", 0.0571], [\"24000\", 0.0285], [\"24100\", 0.0571], [\"24300\", 0.0571], [\"24400\", 0.0285], [\"24500\", 0.1142], [\"24600\", 0.0856], [\"24700\", 0.0571], [\"24800\", 0.9132]]}"},"rt_list":{"kind":"list like","value":[{"code":"\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\n temp_arr=[]\n for i in matrix:\n temp_arr.extend(i)\n temp_arr.sort()\n return temp_arr[k-1]\n\nwith open('user.out', 'w') as f:\n inputs = list(map(loads, stdin))\n for matrix, k in zip(inputs[::2], inputs[1::2]):\n f.write(f\"{kthSmallest(matrix, k)}\\n\")\nexit(0)","runtime":"43"},{"code":"\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\n temp_arr=[]\n for i in matrix:\n temp_arr.extend(i)\n temp_arr.sort()\n return temp_arr[k-1]\n\nwith open('user.out', 'w') as f:\n inputs = list(map(loads, stdin))\n for matrix, k in zip(inputs[::2], inputs[1::2]):\n f.write(f\"{kthSmallest(matrix, k)}\\n\")\nexit(0)","runtime":"43"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n left, right = matrix[0][0], matrix[n - 1][n - 1]\n\n while left < right:\n mid = left + (right - left) // 2\n if self.countSmall(matrix, mid) < k:\n left = mid + 1\n else:\n right = mid\n\n return left\n\n def countSmall(self, matrix: List[List[int]], target: int) -> int:\n n = len(matrix)\n count = 0\n for row in matrix:\n left, right = 0, n\n while left < right:\n mid = left + (right - left) // 2\n if row[mid] <= target:\n left = mid + 1\n else:\n right = mid\n count += left\n return count\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().kthSmallest(nums, next(inputs)),file=f)\nexit(0)","runtime":"46"},{"code":"\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\n temp_arr=[]\n for i in matrix:\n temp_arr.extend(i)\n temp_arr.sort()\n return temp_arr[k-1]\n\nwith open('user.out', 'w') as f:\n inputs = list(map(loads, stdin))\n for matrix, k in zip(inputs[::2], inputs[1::2]):\n f.write(f\"{kthSmallest(matrix, k)}\\n\")\nexit(0)","runtime":"49"},{"code":"\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\n nums = []\n for row in matrix:\n for n in row:\n nums.append(n)\n \n nums.sort()\n return nums[k-1]\n\nwith open('user.out', 'w') as f:\n inputs = list(map(loads, stdin))\n for matrix, k in zip(inputs[::2], inputs[1::2]):\n f.write(f\"{kthSmallest(matrix, k)}\\n\")\nexit(0)","runtime":"49"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n \n def count_less_or_equal(mid):\n count = 0\n for row in matrix:\n idx = bisect.bisect_right(row, mid)\n count += idx\n return count\n \n left, right = matrix[0][0], matrix[-1][-1]\n while left < right:\n mid = (left + right) // 2\n if count_less_or_equal(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left\n","runtime":"52"},{"code":"class CountLessThanWithBounds:\n def __init__(self, count: int, smaller: int, larger: int):\n self.count = count\n self.smaller = smaller\n self.larger = larger\n\nclass Solution:\n def _get_count_less_than_with_bounds(self, matrix: list[list[int]], mid: int, smaller: int, larger: int) -> CountLessThanWithBounds:\n count, n = 0, len(matrix)\n row, col = n - 1, 0\n \"\"\"\n [\n [1,5,9],\n [10,11,13],\n [12,13,15]\n ]\n \"\"\"\n while row >= 0 and col < n:\n num = matrix[row][col]\n if num > mid:\n larger = min(larger, num)\n row -= 1\n else:\n smaller = max(smaller, num)\n count += row + 1\n col += 1 \n\n return CountLessThanWithBounds(count, smaller, larger)\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n start = smallest = matrix[0][0]\n end = largest = matrix[n - 1][n - 1]\n \"\"\"\n [\n [1,5,9],\n [10,11,13],\n [12,13,15]\n ]\n \"\"\"\n while start < end:\n mid = (start + end) // 2\n count_less_than_with_bounds = self._get_count_less_than_with_bounds(matrix, mid, smallest, largest)\n if count_less_than_with_bounds.count == k:\n return count_less_than_with_bounds.smaller\n elif count_less_than_with_bounds.count < k:\n start = count_less_than_with_bounds.larger\n else:\n end = count_less_than_with_bounds.smaller\n return start","runtime":"55"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n def countLessEqual(mid):\n count = 0\n row, col = n - 1, 0 # Start from the bottom-left corner\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += (row + 1) # All elements in this row up to this point are <= mid\n col += 1 # Move to the next column\n else:\n row -= 1 # Move up to the previous row\n return count\n\n # Binary search boundaries\n left, right = matrix[0][0], matrix[n-1][n-1]\n \n # Perform binary search\n while left < right:\n mid = (left + right) // 2\n if countLessEqual(mid) < k:\n left = mid + 1 # Look for a larger value\n else:\n right = mid # Look for a smaller value\n \n return left","runtime":"58"},{"code":"# https://www.youtube.com/watch?v=b4mkk8Fk8fs\n\nclass Solution:\n def kthSmallest(self, M: List[List[int]], k: int) -> int:\n n = len(M)\n min, max = M[0][0], M[-1][-1]\n\n while min != max:\n mid = min + (max - min) // 2\n count = self.countLessOrEqual(M, mid)\n if count < k:\n min = mid + 1\n else:\n max = mid\n\n return min\n\n def countLessOrEqual(self, M, mid):\n n, m = len(M), len(M[0])\n count = 0\n row, col = 0, m-1\n\n while row < n and col >= 0:\n if M[row][col] <= mid:\n count += col + 1\n row += 1\n else:\n col -= 1\n\n return count\n","runtime":"61"},{"code":"from typing import List\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n \n def countLessEqual(mid):\n count, row, col = 0, n - 1, 0\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += row + 1\n col += 1\n else:\n row -= 1\n return count\n \n low, high = matrix[0][0], matrix[n - 1][n - 1]\n \n while low < high:\n mid = (low + high) // 2\n if countLessEqual(mid) < k:\n low = mid + 1\n else:\n high = mid\n \n return low\n","runtime":"64"},{"code":"# Binary Search (count from large to small)\nclass Solution:\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n\n n = len(matrix)\n lo = matrix[0][0] # low\n hi = matrix[n-1][n-1] # high\n\n while lo < hi:\n mid = (lo + hi) // 2\n nleq = 0 # number of elements less or equal to mid\n \n i, j = 0, n - 1 # i-th row, j-th column\n\n while i < n and j >= 0:\n if matrix[i][j] <= mid:\n nleq += j + 1\n i += 1\n else:\n j -= 1\n\n if nleq < k:\n lo = mid + 1\n else:\n hi = mid\n \n return lo\n\n\n# Binary Search (count from small to large)\n# class Solution:\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n\n# n = len(matrix)\n# lo = matrix[0][0] # low\n# hi = matrix[n-1][n-1] # high\n\n# while lo < hi:\n# mid = (lo + hi) // 2\n# nleq = 0 # number of elements less or equal to mid\n \n# for i in range(n):\n# j = 0\n# while j < n:\n# if matrix[i][j] <= mid:\n# nleq += 1\n# j += 1\n# else:\n# break\n\n# if nleq < k:\n# lo = mid + 1\n# else:\n# hi = mid\n# return lo\n\n\n# My long solution (Sorted Queue)\n# from collections import deque\n# import math\n\n# class Solution:\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n \n# n = len(matrix)\n# q = deque() # queue\n# ld = None # last diagonal added \n# lass = None # last min assigned\n# lminadd = -math.inf # last min added\n# lmaxadd = math.inf # last max added\n# lk = 0 # last 'k' processed\n\n# # Case 1\n# if k <= math.ceil(n*n / 2):\n \n# while lk < k:\n# lk += 1\n# ld = (lk-1, 0)\n# ldmin = math.inf # diagonal min\n \n# # adding a diagonal to queue\n# for i in range(0, lk):\n# for j in range(lk-1, -1, -1):\n# if i <= n-1 and j <= n-1 and i+j == lk-1:\n# el = matrix[i][j]\n# q.append(el)\n\n# # keeping track\n# if el < ldmin:\n# ldmin = el\n\n# # sorting queue\n# prev = 1\n# while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n# prev += 1\n \n# # last min added (from last diagonal)\n# lminadd = ldmin\n\n# # assigning values for 'lk'\n# lass = q.popleft()\n\n# # shortcut to answer\n# if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\n# return q[k - lk - 1]\n \n# return lass\n\n# # Case 2\n# if k > math.ceil(n*n / 2):\n\n# nk = n*n - k + 1 # new 'k' going backwards\n \n# while lk < nk:\n# lk += 1\n# ld = (n-lk, n-1)\n# ldmax = -math.inf # diagonal max\n \n# # adding a diagonal to queue\n# for i in range(n-lk, n):\n# for j in range(n-1, n-lk-1, -1):\n# if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\n# el = matrix[i][j]\n# q.append(el)\n\n# # keeping track\n# if el > ldmax:\n# ldmax = el\n\n# # sorting queue\n# prev = 1\n# while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n# prev += 1\n \n# # last max added (from last diagonal)\n# lmaxadd = ldmax\n\n# # assigning values for 'lk'\n# lass = q.popleft()\n\n# # jumping to answer\n# if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\n# return q[nk - lk - 1]\n\n# return lass\n\n\n# Working simple non-efficient solution\n# class Solution:\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n# n = len(matrix[0])\n# arr = []\n# for i in range(n):\n# for j in range(n):\n# arr.append(matrix[i][j])\n# arr.sort()\n# return arr[k-1]\n\n\n# ChatGPT Binary Search\n# class Solution:\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n# def count_less_equal(mid):\n# # Count how many numbers are <= mid\n# count = 0\n# row, col = n - 1, 0\n# while row >= 0 and col < n:\n# if matrix[row][col] <= mid:\n# count += row + 1\n# col += 1\n# else:\n# row -= 1\n# return count\n\n# n = len(matrix)\n# low, high = matrix[0][0], matrix[-1][-1]\n\n# while low < high:\n# mid = (low + high) // 2\n# if count_less_equal(mid) < k:\n# low = mid + 1\n# else:\n# high = mid\n\n# return low","runtime":"67"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n m = len(matrix)\n n = len(matrix[0])\n \n def count(m):\n c = 0 # count of element less than equals to 'm'\n i = n-1\n j = 0\n \n while i >= 0 and j < n:\n if matrix[i][j] > m:\n i -= 1\n else:\n c += i+1\n j += 1\n return c\n \n \n low = matrix[0][0]\n high = matrix[n-1][n-1]\n \n while low <= high:\n m = (low+high)//2\n cnt = count(m)\n if cnt < k:\n low = m + 1\n else:\n cnt1 = count(m-1)\n if cnt1 < k:\n return m\n high = m-1\n return 0","runtime":"70"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n n = len(matrix)\n\n l = matrix[0][0]\n r = matrix[-1][-1]\n\n while l < r:\n m = l + (r - l) // 2\n count = self.check(matrix, m, n)\n\n if count >= k:\n r = m\n else:\n l = m + 1\n\n return l\n\n def check(self, matrix, m, n):\n i, j = n - 1, 0\n\n count = 0\n while i >= 0 and j < n:\n if matrix[i][j] <= m:\n count += (i + 1)\n j += 1\n else:\n i -= 1\n\n return count\n ","runtime":"73"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def count(mid):\n col = 0\n row = n -1\n count = 0\n while col < n and row >= 0:\n if matrix[row][col] <= mid:\n count += row + 1\n col += 1\n else:\n row -= 1\n return count\n\n n = len(matrix)\n small = matrix[0][0]\n large = matrix[-1][-1]\n\n while small + 1 < large:\n mid = small + (large - small) // 2\n if count(mid) >= k:\n large = mid\n else:\n small = mid\n if count(small) >= k:\n return small\n else:\n return large\n \n","runtime":"76"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n\n def count_less_equal(mid):\n count = 0\n row = n - 1\n col = 0\n\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += row + 1\n col += 1\n else:\n row -= 1\n return count\n\n left, right = matrix[0][0], matrix[-1][-1]\n\n while left < right:\n mid = (left + right) // 2\n if count_less_equal(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left","runtime":"79"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n nums=[j for i in matrix for j in i]\n c=sorted(nums)\n return c[k-1]","runtime":"82"},{"code":"import bisect\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n l,r = matrix[0][0], matrix[-1][-1]\n while l<r:\n mid = (l+r)//2\n count = 0\n n = len(matrix[0])\n # for i in range(len(matrix)):\n # # 1,2,3\n # # 1,3,5\n # # 1,5,7\n # # 如果mid是5，第一次3个，第二次2个，第三次1个\n # count += bisect.bisect_right(matrix[i], mid)\n j = n - 1\n for i in range(len(matrix)):\n while j >= 0 and matrix[i][j] > mid:\n j -= 1\n count += (j + 1)\n if count < k:\n l = mid+1\n else:\n r = mid\n return l","runtime":"82"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest_Mine(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n max_heap = [0] * k\n for i in range(k):\n max_heap[i] = -matrix[i // n][i % n]\n heapq.heapify(max_heap)\n for i in range(k, n * n):\n val = matrix[i // n][i % n]\n if val < -max_heap[0]:\n heapq.heapreplace(max_heap, -val)\n return -max_heap[0]\n \n def kthSmallest_LC1(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n min_heap = [(matrix[i][0], i, 0) for i in range(min(n, k))]\n heapq.heapify(min_heap)\n while k:\n val, row, col = heapq.heappop(min_heap)\n if col < n - 1:\n heapq.heappush(min_heap, (matrix[row][col + 1], row, col + 1))\n k -= 1\n return val\n \n def countLessEqual(self, matrix, mid, largest_leq, smallest_gt):\n n = len(matrix)\n row, col = n - 1, 0\n count = 0\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += (row + 1)\n largest_leq = max(largest_leq, matrix[row][col])\n col += 1\n else:\n smallest_gt = min(smallest_gt, matrix[row][col])\n row -= 1\n return count, largest_leq, smallest_gt\n\n def kthSmallest_LC2(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n left, right = matrix[0][0], matrix[n - 1][n - 1]\n while left < right:\n mid = left + (right - left) // 2\n # largest less than or equal; smallest greater than\n largest_leq, smallest_gt = matrix[0][0], matrix[n - 1][n - 1]\n count, largest_leq, smallest_gt = self.countLessEqual(matrix, mid, largest_leq, smallest_gt)\n if count == k:\n return largest_leq\n if count < k:\n left = smallest_gt\n else:\n right = largest_leq\n \n return left\n \n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n return self.kthSmallest_LC2(matrix, k)","runtime":"85"},{"code":"# ChatGPT Binary Search\n\nclass Solution:\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n def count_less_equal(mid):\n # Count how many numbers are <= mid\n count = 0\n row, col = n - 1, 0\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += row + 1\n col += 1\n else:\n row -= 1\n return count\n\n n = len(matrix)\n low, high = matrix[0][0], matrix[-1][-1]\n\n while low < high:\n mid = (low + high) // 2\n if count_less_equal(mid) < k:\n low = mid + 1\n else:\n high = mid\n\n return low\n\n\n# My Binary Search (after seeing an example)\n# class Solution:\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n\n# n = len(matrix)\n# lo = matrix[0][0] # low\n# hi = matrix[n-1][n-1] # high\n\n# while lo < hi:\n# mid = (lo + hi) // 2\n# nleq = 0 # number of elements less or equal to mid\n \n# for i in range(n):\n# j = 0\n# while j < n:\n# if matrix[i][j] <= mid:\n# nleq += 1\n# j += 1\n# else:\n# break\n\n# if nleq < k:\n# lo = mid + 1\n# else:\n# hi = mid\n# return lo\n\n\n# My long solution (Sorted Queue)\n# from collections import deque\n# import math\n\n# class Solution:\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n \n# n = len(matrix)\n# q = deque() # queue\n# ld = None # last diagonal added \n# lass = None # last min assigned\n# lminadd = -math.inf # last min added\n# lmaxadd = math.inf # last max added\n# lk = 0 # last 'k' processed\n\n# # Case 1\n# if k <= math.ceil(n*n / 2):\n \n# while lk < k:\n# lk += 1\n# ld = (lk-1, 0)\n# ldmin = math.inf # diagonal min\n \n# # adding a diagonal to queue\n# for i in range(0, lk):\n# for j in range(lk-1, -1, -1):\n# if i <= n-1 and j <= n-1 and i+j == lk-1:\n# el = matrix[i][j]\n# q.append(el)\n\n# # keeping track\n# if el < ldmin:\n# ldmin = el\n\n# # sorting queue\n# prev = 1\n# while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n# prev += 1\n \n# # last min added (from last diagonal)\n# lminadd = ldmin\n\n# # assigning values for 'lk'\n# lass = q.popleft()\n\n# # shortcut to answer\n# if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\n# return q[k - lk - 1]\n \n# return lass\n\n# # Case 2\n# if k > math.ceil(n*n / 2):\n\n# nk = n*n - k + 1 # new 'k' going backwards\n \n# while lk < nk:\n# lk += 1\n# ld = (n-lk, n-1)\n# ldmax = -math.inf # diagonal max\n \n# # adding a diagonal to queue\n# for i in range(n-lk, n):\n# for j in range(n-1, n-lk-1, -1):\n# if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\n# el = matrix[i][j]\n# q.append(el)\n\n# # keeping track\n# if el > ldmax:\n# ldmax = el\n\n# # sorting queue\n# prev = 1\n# while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n# prev += 1\n \n# # last max added (from last diagonal)\n# lmaxadd = ldmax\n\n# # assigning values for 'lk'\n# lass = q.popleft()\n\n# # jumping to answer\n# if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\n# return q[nk - lk - 1]\n\n# return lass\n\n\n# Working simple non-efficient solution\n# class Solution:\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n# n = len(matrix[0])\n# arr = []\n# for i in range(n):\n# for j in range(n):\n# arr.append(matrix[i][j])\n# arr.sort()\n# return arr[k-1]\n ","runtime":"88"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def count_less_or_equal(val):\n count = 0\n n = len(matrix)\n i = n - 1\n j = 0 \n while i >= 0 and j < n:\n if matrix[i][j] <= val:\n count += i + 1\n j += 1\n else:\n i -= 1\n return count\n\n\n left = matrix[0][0]\n right = matrix[-1][-1]\n\n while left + 1 < right:\n mid = (left + right) // 2\n if count_less_or_equal(mid) >= k:\n right = mid\n else:\n left = mid\n print(left, right) \n \n if count_less_or_equal(left) < k:\n return right\n else:\n return left\n ","runtime":"88"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n m, n = len(matrix), len(matrix[0])\n lo = matrix[0][0]\n hi = matrix[-1][-1]\n while lo <= hi:\n md = lo + (hi - lo) // 2\n\n cnt = 0\n j = n - 1\n \n for i in range(m):\n while j >= 0 and matrix[i][j] > md:\n j -= 1\n cnt += j + 1\n\n if cnt < k:\n lo = md + 1\n else:\n hi = md - 1\n return lo\n \n ","runtime":"91"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n#1 2 3\n#2 3 4\n#3 4 5\n n = len(matrix)\n l, r = matrix[0][0], matrix[n - 1][n - 1]\n\n while l < r:\n mid = l + (r - l) // 2\n\n count = 0\n j = n - 1\n for i in range(n):\n while j >= 0 and matrix[i][j] > mid:\n j -= 1\n count += j + 1\n \n if count < k:\n l = mid + 1\n else:\n r = mid \n return l","runtime":"94"},{"code":"import bisect\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n l = matrix[0][0]\n h = matrix[n-1][n-1]\n \n while l < h:\n mid = l + (h - l) // 2\n count = 0\n \n for row in matrix:\n count += bisect.bisect_right(row, mid)\n \n if count < k:\n l = mid + 1\n else:\n h = mid\n \n return l\n","runtime":"100"},{"code":"class Solution:\n def flatten_list(self, mat, ans):\n for value in mat:\n if isinstance(value, list):\n self.flatten_list(value, ans)\n else:\n ans.append(value)\n \n return ans\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n flat_list = self.flatten_list(matrix, [])\n # print(flat_list)\n flat_list.sort()\n return flat_list[k-1]\n # return 13\n # n = len(matrix)\n # m = n - 1\n # i = 0\n # j = 0\n # idx = 0\n # while i <= m and j <= m and (idx < n*n):\n # if idx == k - 1:\n # return matrix[i][j]\n # elif idx + m > k - 1:\n # idx += 1\n # j += 1\n \n # elif idx + m < k - 1:\n # idx = idx + n\n # i += 1\n\n\n\n ","runtime":"103"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n \n # Helper function to count how many numbers are ≤ mid in the matrix\n def count_less_equal(mid):\n count = 0\n row, col = n - 1, 0 # Start from the bottom-left corner\n \n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += (row + 1) # All elements in this column up to 'row' are ≤ mid\n col += 1 # Move right\n else:\n row -= 1 # Move up\n \n return count\n\n # Binary search on the value range\n left, right = matrix[0][0], matrix[n - 1][n - 1]\n \n while left < right:\n mid = (left + right) // 2\n if count_less_equal(mid) < k:\n left = mid + 1 # We need a larger number\n else:\n right = mid # We need a smaller number or exactly mid\n \n return left","runtime":"106"},{"code":"class CountLessThanWithBounds:\n def __init__(self, count: int, smaller: int, larger: int):\n self.count = count\n self.smaller = smaller\n self.larger = larger\n\nclass Solution:\n def _get_count_less_than_with_bounds(\n self,\n matrix: list[list[int]],\n mid: int,\n smaller: int,\n larger: int\n ) -> CountLessThanWithBounds:\n count, n = 0, len(matrix)\n row, col = n - 1, 0\n\n while row >= 0 and col < n:\n num = matrix[row][col]\n if num > mid:\n larger = min(larger, num)\n row -= 1\n else:\n smaller = max(smaller, num)\n count += row + 1\n col += 1\n return CountLessThanWithBounds(count, smaller, larger)\n\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n start = smallest = matrix[0][0]\n end = largest = matrix[n - 1][n - 1]\n while start < end:\n mid = (start + end) // 2\n count_less_than_with_bounds = self._get_count_less_than_with_bounds(\n matrix, mid, smallest, largest\n )\n if count_less_than_with_bounds.count == k:\n return count_less_than_with_bounds.smaller\n elif count_less_than_with_bounds.count < k:\n start = count_less_than_with_bounds.larger\n else:\n end = count_less_than_with_bounds.smaller\n return start","runtime":"106"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n low, high = matrix[0][0], matrix[n-1][n-1]\n\n def countLessEqual(mid):\n count, row, col = 0, n-1, 0\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += row + 1\n col += 1\n else:\n row -= 1\n return count\n\n while low < high:\n mid = (low + high) // 2\n if countLessEqual(mid) < k:\n low = mid + 1\n else:\n high = mid\n return low\n ","runtime":"109"},{"code":"import bisect\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n=len(matrix)\n low,high=matrix[0][0],matrix[n-1][n-1]\n ans=0\n while low<=high:\n mid=(low+high)>>1\n smallerElements=0\n for i in matrix:\n smallerElements+=bisect.bisect(i,mid)\n if smallerElements<k:\n low=mid+1\n else:\n ans=mid\n high=mid-1\n return ans\n\n\n\n\n ","runtime":"112"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n lis=[]\n for i in matrix:\n lis+=i\n lis.sort()\n return lis[k-1]","runtime":"112"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def count_less_or_equal(val):\n count = 0\n n = len(matrix)\n i = n - 1\n j = 0 \n while i >= 0 and j < n:\n if matrix[i][j] <= val:\n count += i + 1\n j += 1\n else:\n i -= 1\n return count\n\n\n left = matrix[0][0]\n right = matrix[-1][-1]\n\n while left <= right:\n mid = (left + right) // 2\n if count_less_or_equal(mid) >= k:\n right = mid - 1\n else:\n left = mid + 1\n return left ","runtime":"115"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n k -= 1\n \n s = []\n for row in matrix:\n s += row\n \n s.sort()\n return s[k]","runtime":"118"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n lis=[]\n for i in matrix:\n for j in i:\n lis.append(j)\n lis.sort()\n return lis[k-1]","runtime":"118"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n left, right = matrix[0][0], matrix[n-1][n-1]\n \n while left < right:\n mid = (left + right) // 2\n count = 0\n j = n - 1\n # Count the number of elements in the matrix that are less than or equal to mid\n for i in range(n):\n while j >= 0 and matrix[i][j] > mid:\n j -= 1\n count += j + 1\n # Update the range of the search\n if count < k:\n left = mid + 1\n else:\n right = mid\n \n return left\n ","runtime":"121"},{"code":"class Solution:\n \n def countLessEqual(self, matrix, mid, smaller, larger):\n \n count, n = 0, len(matrix)\n row, col = n - 1, 0\n \n while row >= 0 and col < n:\n if matrix[row][col] > mid:\n \n # As matrix[row][col] is bigger than the mid, let's keep track of the\n # smallest number greater than the mid\n larger = min(larger, matrix[row][col])\n row -= 1\n \n else:\n \n # As matrix[row][col] is less than or equal to the mid, let's keep track of the\n # biggest number less than or equal to the mid\n \n smaller = max(smaller, matrix[row][col])\n count += row + 1\n col += 1\n\n return count, smaller, larger\n \n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n n = len(matrix)\n start, end = matrix[0][0], matrix[n - 1][n - 1]\n while start < end:\n mid = start + (end - start) / 2\n smaller, larger = (matrix[0][0], matrix[n - 1][n - 1])\n\n count, smaller, larger = self.countLessEqual(matrix, mid, smaller, larger)\n\n if count == k:\n return smaller\n if count < k:\n start = larger # search higher\n else:\n end = smaller # search lower\n\n return start","runtime":"124"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n n = len(matrix)\n (low,high) = ( matrix[0][0], matrix[-1][-1] )\n\n while(low<high):\n\n mid = (low+ high) // 2\n\n count = self.CountElements( matrix, mid)\n\n if count<k:\n low = mid + 1\n else:\n high = mid\n\n return low\n\n\n # Count Elemnts which are less than equal to mid\n def CountElements(self,matrix, mid):\n\n row,col = len(matrix) -1 , 0\n count = 0\n\n while row>=0 and col< len(matrix[0]):\n\n if matrix[row][col]<= mid:\n # Take top rows in consideration\n count += (row+1)\n col +=1\n\n else:\n row -=1\n\n return count\n\n\n","runtime":"124"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n rows = len(matrix[0])\n cols = len(matrix)\n \n left = matrix[0][0]\n right = matrix[cols-1][rows-1]\n k-=1\n\n def find_elements_less_than_mid(target):\n total = 0\n \n for i in range(len(matrix)):\n arr = matrix[i]\n \n left = 0\n right = len(matrix[0])-1\n count = 0\n \n while left <= right:\n mid = (left + right) // 2\n if arr[mid] <= target:\n left = mid + 1\n else:\n right = mid - 1\n \n total += left\n \n return total\n \n while left <= right:\n mid = (left + right) // 2\n \n elements_less_than_mid = find_elements_less_than_mid(mid)\n \n if elements_less_than_mid <= k:\n left = mid + 1\n else:\n right = mid - 1\n \n \n return left\n\n\n \n\n \n","runtime":"127"},{"code":"from heapq import heappush,heappop\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n elements=[]\n for i in range(len(matrix)):\n elements += matrix[i]\n \n max_heap=[]\n for i in range(k):\n heappush(max_heap,-elements[i])\n \n for i in range(k,len(elements)):\n if elements[i] < -max_heap[0]:\n heappop(max_heap)\n heappush(max_heap,-elements[i])\n return -max_heap[0]\n ","runtime":"130"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n ret = []\n for arr in matrix:\n for i in arr:\n ret.append(i)\n ret.sort()\n print(ret)\n return ret[k-1]\n ","runtime":"130"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n array = []\n n = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n array.append(matrix[i][j])\n array.sort()\n\n return array[k-1]\n ","runtime":"133"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n v = []\n for i in range(len(matrix)):\n for j in range(len(matrix)):\n v.append(matrix[i][j])\n\n v.sort()\n return v[k - 1]","runtime":"136"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n\n for i in matrix:\n for j in i:\n heapq.heappush(heap, (-1) * j)\n if len(heap) > k:\n heapq.heappop(heap)\n return heap[0] * (-1)","runtime":"136"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n l = matrix[0][0] - 1\n r = matrix[-1][-1] + 1\n while r - l > 1:\n mid = (l + r) // 2\n\n cnt = 0\n j = n - 1\n for i in range(n):\n while j >= 0 and matrix[i][j] > mid:\n j -= 1\n cnt += j + 1\n \n print(mid, cnt)\n\n if cnt >= k:\n r = mid\n else:\n l = mid\n\n return r","runtime":"139"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix[0])\n arr = []\n for i in range(n):\n for j in range(n):\n arr.append(matrix[i][j])\n arr.sort()\n return arr[k-1]","runtime":"142"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n nums=[j for i in matrix for j in i]\n c=sorted(nums)\n return c[k-1]","runtime":"145"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # Tiers of elements in the given sorted array (e.g. all elements in tier i < any elements in tier j if j > i; within each tier, we don't know the order of elements yet)\n # 0 1 2 3 4\n # 1 2 3 4 5\n # 2 3 4 5 6\n # 3 4 5 6 7\n # 4 5 6 7 8\n # We need to find the tier where k belongs to.\n # Number of all elements from tier 0 to tier (i - 1) is:\n # 1 + 2 + ... + i = i * (i + 1) / 2 < i^2 / 2\n n = len(matrix)\n max_heap = [0] * k\n for i in range(k):\n max_heap[i] = -matrix[i // n][i % n]\n heapq.heapify(max_heap)\n for i in range(k, n * n):\n val = matrix[i // n][i % n]\n if val < -max_heap[0]:\n heapq.heapreplace(max_heap, -val)\n return -max_heap[0]","runtime":"148"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n import heapq\n\n newList = []\n for x in matrix:\n newList += x\n element = 0\n heapq.heapify(newList)\n while k!=0:\n element = heapq.heappop(newList)\n k -= 1\n return element","runtime":"148"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n N = len(matrix)\n \n min_heap = []\n for r in range(min(N, k)):\n min_heap.append((matrix[r][0], r, 0))\n\n while k:\n element, r, c = heapq.heappop(min_heap)\n\n if c < N - 1:\n heapq.heappush(min_heap, (matrix[r][c + 1], r, c + 1))\n\n k -= 1\n \n return element","runtime":"151"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap=[]\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n heapq.heappush(heap,matrix[i][j])\n for _ in range(k-1):\n x=heapq.heappop(heap)\n return(heap[0])","runtime":"151"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n import heapq\n n = len(matrix)\n min_heap = []\n\n for i in range(min(n, k)):\n heapq.heappush(min_heap, (matrix[i][0], i, 0))\n\n for _ in range(k - 1):\n val, r, c = heapq.heappop(min_heap)\n if c + 1 < n:\n heapq.heappush(min_heap, (matrix[r][c + 1], r, c + 1))\n\n return heapq.heappop(min_heap)[0]\n","runtime":"154"},{"code":"from heapq import heapify\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n N = len(matrix)\n minHeap = []\n for r in range(min(k, N)):\n minHeap.append((matrix[r][0], r, 0))\n \n heapify(minHeap)\n\n while k:\n element, r, c = heappop(minHeap)\n\n if c < N - 1:\n heappush(minHeap, (matrix[r][c + 1], r, c + 1))\n \n k -= 1\n return element","runtime":"154"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n nums = []\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n nums.append(matrix[r][c])\n heapq.heapify(nums)\n for _ in range(k-1):\n heapq.heappop(nums)\n return heapq.heappop(nums)","runtime":"157"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n n, m = len(matrix), len(matrix[0])\n heap = [(matrix[0][j],0, j) for j in range(m)]\n heapq.heapify(heap)\n while k > 0:\n val, i, j = heapq.heappop(heap)\n if i+1 < n:\n heapq.heappush(heap, (matrix[i+1][j],i+1,j))\n k -= 1\n return val\n\n\n\n\n\n\n\n\n # n, m = len(matrix), len(matrix[0])\n # heap = [(matrix[0][j], 0, j) for j in range(m)]\n # heapq.heapify(heap)\n # while k > 0:\n # result, i, j = heapq.heappop(heap)\n # if i + 1 < n:\n # heapq.heappush(heap, (matrix[i+1][j], i + 1, j))\n # k -= 1\n # return result\n","runtime":"157"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n import heapq\n n = len(matrix)\n min_heap = []\n for r in range(n):\n min_heap.append([matrix[r][0], r, 0])\n heapq.heapify(min_heap)\n\n for _ in range(k):\n element, r, c = heapq.heappop(min_heap)\n if c < n - 1:\n heapq.heappush(min_heap, [matrix[r][c + 1], r, c + 1])\n\n return element","runtime":"160"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n for row in matrix:\n for el in row:\n heapq.heappush(heap,-1*el)\n if len(heap) > k:\n heapq.heappop(heap)\n \n return -1*heap[0]","runtime":"160"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n r = []\n for i in matrix:\n r = r+i\n heapq.heapify(r)\n smallest = None\n for i in range(k):\n smallest = heapq.heappop(r)\n return smallest ","runtime":"164"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n minheap = []\n\n for i in range(n):\n heapq.heappush(minheap, (matrix[i][0], i, 0))\n\n while minheap:\n val, row, col = heapq.heappop(minheap)\n k -= 1\n if k == 0:\n return val\n \n if (col + 1) < n:\n heapq.heappush(minheap, (matrix[row][col + 1], row, col + 1))\n","runtime":"164"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n r = []\n for i in matrix:\n r = r+i\n heapq.heapify(r)\n smallest = None\n for i in range(k):\n smallest = heapq.heappop(r)\n return smallest ","runtime":"167"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n count = 0\n n = len(matrix)\n heap = [(matrix[y][0], 0, y) for y in range(n)]\n\n heapify(heap)\n while True:\n ans = heap[0]\n count += 1\n\n if count == k:\n return ans[0]\n\n no_longer = heappop(heap)\n idx, y = no_longer[1], no_longer[2]\n\n if idx + 1 < n:\n heappush(heap, (matrix[y][idx+1], idx+1, y))\n ","runtime":"167"},{"code":"from heapq import heappop, heappush\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n if not matrix or not matrix[0]:\n return -1\n\n answer = [] #min_heap\n n = len(matrix)\n m = len(matrix[0])\n \n for i in range(n):\n heappush(answer, (matrix[i][0], i, 0))\n\n while k > 0 and answer:\n num, i, j = heappop(answer)\n k -= 1\n\n if j + 1 < m:\n heappush(answer, (matrix[i][j + 1], i, j + 1))\n\n return num","runtime":"170"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n n = len(matrix)\n for i in range(n):\n heapq.heappush(heap, (matrix[i][0], i, 0))\n \n # [1, 10, 12]\n i, kthElement = 0, 0\n while heap and i < k:\n element, row, col = heapq.heappop(heap)\n if col < n-1:\n heapq.heappush(heap, (matrix[row][col+1], row, col+1))\n kthElement = element\n i += 1\n return kthElement","runtime":"170"},{"code":"from heapq import heapify, heappush, heappop\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n heapify(heap)\n\n rows = len(matrix)\n col = len(matrix[0])\n\n for r in range(rows):\n heappush(heap, (matrix[r][0], r, 0))\n\n res = []\n while heap:\n value, r, c = heappop(heap)\n res.append(value)\n\n if c+1 < col:\n heappush(heap, (matrix[r][c+1], r, c+1))\n \n return res[k-1]","runtime":"173"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n r = []\n for i in matrix:\n r = r+i\n heapq.heapify(r)\n smallest = None\n for i in range(k):\n smallest = heapq.heappop(r)\n return smallest ","runtime":"173"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n min_heap = []\n\n # Insert the first element of each row into the heap\n for row in range(min(k, n)): # Only need to process up to the k-th row\n heapq.heappush(min_heap, (matrix[row][0], row, 0))\n\n # Extract the minimum element from the heap k times\n for _ in range(k - 1):\n value, row, col = heapq.heappop(min_heap)\n \n # If there is a next element in the same row, insert it into the heap\n if col + 1 < n:\n heapq.heappush(min_heap, (matrix[row][col + 1], row, col + 1))\n\n # The root of the heap is now the k-th smallest element\n return heapq.heappop(min_heap)[0]","runtime":"176"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n seen = [[False]*n for i in range(n)]\n seen[0][0] = True\n curMins = [[matrix[0][0], 0, 0]]\n\n kth = -1\n\n for i in range(k):\n kth, i, j = heapq.heappop(curMins)\n if i+1 < n and not seen[i+1][j]:\n heapq.heappush(curMins, [matrix[i+1][j], i+1, j])\n seen[i+1][j] = True\n if j+1 < n and not seen[i][j+1]:\n heapq.heappush(curMins, [matrix[i][j+1], i, j+1])\n seen[i][j+1] = True\n \n return kth\n\n\n\n","runtime":"176"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n row, col = len(matrix), len(matrix[0])\n if not row or not col: return -1\n heap = []\n for i in range(min(k, row)):\n heappush(heap, (matrix[i][0], i, 0))\n for i in range(k):\n val, x, y = heappop(heap)\n if i == k-1: return val\n if y < col-1:\n heappush(heap, (matrix[x][y+1], x, y+1))\n return -1\n \"\"\"\n row, col = len(matrix), len(matrix[0])\n if not row or not col: return -1\n heap = []\n for i in range(min(row, k)):\n heapq.heappush(heap, (matrix[i][0], i, 0))\n for i in range (k):\n val, x, y = heapq.heappop(heap)\n if i == k-1: return val\n if y < col - 1:\n heapq.heappush(heap, (matrix[x][y+1], x, y+1))\n return -1 \"\"\"\n \"\"\"\n N, col = len(matrix), len(matrix[0])\n def countLessThanOrEqual(num):\n count = 0\n for i in range(N):\n if matrix[i][-1] <= num:\n count += N\n else:\n lo = 0\n hi = col-1\n while lo < hi:\n mid = lo + (hi-lo)//2\n if matrix[i][mid] >= num:\n hi = mid\n else:\n lo = mid + 1\n count += lo\n break\n return count\n\n lo, hi = matrix[0][0], matrix[-1][-1]\n while lo < hi:\n mid = lo + (hi-lo)//2\n\n if countLessThanOrEqual(mid) >= k:\n hi = mid\n else:\n lo = mid + 1\n\n return lo\n \"\"\"","runtime":"179"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n h = []\n for i in range(min(len(matrix), k)):\n heappush(h, [matrix[i][0], i, 0])\n \n res = 0\n for _ in range(k):\n res, i, j = heappop(h)\n if j + 1 < len(matrix[i]):\n heappush(h, [matrix[i][j + 1], i, j + 1])\n return res","runtime":"179"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n r = []\n for i in matrix:\n r = r+i\n heapq.heapify(r)\n smallest = None\n for i in range(k):\n smallest = heapq.heappop(r)\n return smallest ","runtime":"182"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n new_m = []\n for m in matrix:\n new_m += m\n \n return heapq.nsmallest(k, new_m)[-1]","runtime":"182"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n n = len(matrix)\n \n # Min-heap to track the smallest elements\n frontier = [(matrix[0][0], 0, 0)]\n visited = set((0, 0)) # Only track (i, j) indices\n\n # Keep extracting from the heap until we reach the k-th smallest\n for _ in range(k - 1):\n val, i, j = heapq.heappop(frontier)\n\n # Move to the next row if not visited\n if i + 1 < n and (i + 1, j) not in visited:\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n\n # Move to the next column if not visited\n if j + 1 < n and (i, j + 1) not in visited:\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))\n\n # The top of the heap is the k-th smallest\n return heapq.heappop(frontier)[0]\n","runtime":"185"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n m, n = len(matrix), len(matrix[0])\n heap = [(matrix[0][0], 0, 0)]\n count = 0\n seen = set()\n while heap:\n num, i, j = heappop(heap)\n count += 1\n if count == k: return num\n for ii, jj in ( (i+1, j), (i, j+1) ):\n if ii < m and jj < n and (ii, jj) not in seen:\n seen.add((ii, jj))\n heappush(heap, (matrix[ii][jj], ii, jj))\n","runtime":"185"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n res = []\n visit = set()\n m, n = len(matrix), len(matrix[0])\n min_nums = [[matrix[0][0], 0, 0]]\n visit.add((0, 0))\n heapq.heapify(min_nums)\n\n while k > 0:\n num, i, j = heappop(min_nums)\n if (i+1) < m and (i+1, j) not in visit:\n heappush(min_nums, [matrix[i+1][j], i+1, j])\n visit.add((i+1, j))\n if (j+1) < n and (i, j+1) not in visit:\n heappush(min_nums, [matrix[i][j+1], i, j+1])\n visit.add((i, j+1))\n\n k -= 1\n return num","runtime":"188"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n m, n = len(matrix), len(matrix[0])\n s = {(0, 0)}\n minHeap = [(matrix[0][0], 0, 0)]\n while k > 1:\n ele, i, j = heappop(minHeap)\n if j + 1 < n and (i, j+1) not in s:\n s.add((i, j+1))\n heappush(minHeap, (matrix[i][j+1], i, j+1))\n if i + 1 < m and (i+1, j) not in s:\n s.add((i+1, j))\n heappush(minHeap, (matrix[i+1][j], i+1, j))\n # print(ele, minHeap)\n k -= 1\n return minHeap[0][0]\n\n\n ","runtime":"188"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n n = len(matrix)\n \n frontier = [(matrix[0][0], 0, 0)]\n visited = set((0, 0))\n\n for _ in range(k - 1):\n val, i, j = heapq.heappop(frontier)\n\n if i + 1 < n and (i + 1, j) not in visited:\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n\n if j + 1 < n and (i, j + 1) not in visited:\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))\n\n return heapq.heappop(frontier)[0]\n","runtime":"191"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n heapq.heappush(heap, (matrix[0][0], 0, 0))\n n = len(matrix)\n visited = set()\n visited.add((0,0))\n\n while k > 0:\n val, i, j = heapq.heappop(heap)\n if i + 1 < n and (i + 1, j) not in visited:\n heapq.heappush(heap, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n if j + 1 < n and (i, j + 1) not in visited:\n heapq.heappush(heap, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))\n k -= 1\n \n return val","runtime":"191"},{"code":"from sortedcontainers import SortedList, SortedSet, SortedDict \n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n sorted_matrix = SortedList()\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n sorted_matrix.add(matrix[i][j])\n \n return sorted_matrix[k-1]","runtime":"194"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n if k == 1:\n return matrix[0][0]\n\n n = len(matrix)\n\n priority_queue = [(matrix[0][0], 0, 0)]\n\n heapq.heapify(priority_queue)\n visited_cells = set()\n\n count = 0\n\n while priority_queue:\n \n val, i, j = heapq.heappop(priority_queue)\n\n count += 1\n\n if count == k:\n return val\n\n if i+1 < n and (i+1,j) not in visited_cells:\n heapq.heappush(priority_queue, (matrix[i+1][j], i+1, j))\n visited_cells.add((i+1,j))\n\n if j+1 < n and (i,j+1) not in visited_cells:\n heapq.heappush(priority_queue, (matrix[i][j+1], i, j+1))\n visited_cells.add((i,j+1))\n\n\n\n def mySqrt(self, x: int) -> int:\n if x <= 1:\n return x\n left = 1\n right = x-1\n while left < right:\n middle = left + (right - left + 1) // 2\n if middle * middle <= x:\n left = middle\n else:\n right = middle - 1\n return left","runtime":"194"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n h = [(matrix[0][0], 0, 0)]\n num_elems = 0\n\n while num_elems <= k:\n val, r, c = heapq.heappop(h)\n num_elems += 1\n if num_elems == k:\n return val\n \n if (r+1 < len(matrix)) and (matrix[r+1][c] != float('inf')):\n heapq.heappush(h, (matrix[r+1][c], r+1, c))\n matrix[r+1][c] = float('inf')\n if (c+1 < len(matrix[0])) and (matrix[r][c+1] != float('inf')):\n heapq.heappush(h, (matrix[r][c+1], r, c+1))\n matrix[r][c+1] = float('inf')\n\n return -1\n\n\n\n","runtime":"197"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = [(matrix[0][0], 0, 0)]\n visited = set()\n if k == 1:\n return matrix[0][0]\n for i in range(0, k-1):\n min_el = heapq.heappop(heap)\n \n x, y = min_el[1] + 1, min_el[2]\n if x < len(matrix) and (x, y) not in visited:\n heapq.heappush(heap, (matrix[x][y], x, y))\n visited.add((x, y))\n\n x, y = min_el[1], min_el[2] + 1\n if y < len(matrix) and (x, y) not in visited:\n heapq.heappush(heap, (matrix[x][y], x, y))\n visited.add((x, y))\n\n if len(heap) > 0:\n min_el = heapq.heappop(heap)\n return min_el[0]\n else:\n return 0","runtime":"197"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n myHeap = [(matrix[0][0], (0, 0))]\n seenLocs = set((0, 0))\n curMinVal = matrix[0][0]\n\n while k > 0:\n curMinVal, idxs = heapq.heappop(myHeap)\n rowIdx = idxs[0]\n colIdx = idxs[1]\n if rowIdx < len(matrix) - 1 and (rowIdx+1, colIdx) not in seenLocs:\n seenLocs.add((rowIdx+1, colIdx))\n heapq.heappush(myHeap, (matrix[rowIdx+1][colIdx], (rowIdx+1, colIdx))) \n if colIdx < len(matrix[0]) - 1 and (rowIdx, colIdx+1) not in seenLocs:\n seenLocs.add((rowIdx, colIdx+1))\n heapq.heappush(myHeap, (matrix[rowIdx][colIdx+1], (rowIdx, colIdx+1))) \n k -= 1\n\n\n return curMinVal","runtime":"200"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n l = matrix[0][0]\n r = matrix[-1][-1]\n \n while l < r:\n num = (l + r) // 2\n count = 0\n \n for i in range(len(matrix)):\n j = 0\n while j < len(matrix[0]) and matrix[i][j] <= num:\n j += 1\n count += j\n \n if count < k:\n l = num + 1\n else:\n r = num\n \n return l\n\n ","runtime":"200"},{"code":"# My Binary Search (after seeing an example)\nclass Solution:\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n\n n = len(matrix)\n lo = matrix[0][0] # low\n hi = matrix[n-1][n-1] # high\n\n while lo < hi:\n mid = (lo + hi) // 2\n nleq = 0 # number of elements less or equal to mid\n \n for i in range(n):\n j = 0\n while j < n:\n if matrix[i][j] <= mid:\n nleq += 1\n j += 1\n else:\n break\n\n if nleq < k:\n lo = mid + 1\n else:\n hi = mid\n return lo\n\n\n# My long solution (Sorted Queue)\n# from collections import deque\n# import math\n\n# class Solution:\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n \n# n = len(matrix)\n# q = deque() # queue\n# ld = None # last diagonal added \n# lass = None # last min assigned\n# lminadd = -math.inf # last min added\n# lmaxadd = math.inf # last max added\n# lk = 0 # last 'k' processed\n\n# # Case 1\n# if k <= math.ceil(n*n / 2):\n \n# while lk < k:\n# lk += 1\n# ld = (lk-1, 0)\n# ldmin = math.inf # diagonal min\n \n# # adding a diagonal to queue\n# for i in range(0, lk):\n# for j in range(lk-1, -1, -1):\n# if i <= n-1 and j <= n-1 and i+j == lk-1:\n# el = matrix[i][j]\n# q.append(el)\n\n# # keeping track\n# if el < ldmin:\n# ldmin = el\n\n# # sorting queue\n# prev = 1\n# while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n# prev += 1\n \n# # last min added (from last diagonal)\n# lminadd = ldmin\n\n# # assigning values for 'lk'\n# lass = q.popleft()\n\n# # shortcut to answer\n# if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\n# return q[k - lk - 1]\n \n# return lass\n\n# # Case 2\n# if k > math.ceil(n*n / 2):\n\n# nk = n*n - k + 1 # new 'k' going backwards\n \n# while lk < nk:\n# lk += 1\n# ld = (n-lk, n-1)\n# ldmax = -math.inf # diagonal max\n \n# # adding a diagonal to queue\n# for i in range(n-lk, n):\n# for j in range(n-1, n-lk-1, -1):\n# if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\n# el = matrix[i][j]\n# q.append(el)\n\n# # keeping track\n# if el > ldmax:\n# ldmax = el\n\n# # sorting queue\n# prev = 1\n# while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n# prev += 1\n \n# # last max added (from last diagonal)\n# lmaxadd = ldmax\n\n# # assigning values for 'lk'\n# lass = q.popleft()\n\n# # jumping to answer\n# if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\n# return q[nk - lk - 1]\n\n# return lass\n\n\n# Working simple non-efficient solution\n# class Solution:\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n# n = len(matrix[0])\n# arr = []\n# for i in range(n):\n# for j in range(n):\n# arr.append(matrix[i][j])\n# arr.sort()\n# return arr[k-1]\n ","runtime":"203"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n heapq.heappush(heap, (matrix[0][0], 0, 0))\n n = len(matrix)\n visited = set()\n visited.add((0,0))\n\n while k > 0:\n val, i, j = heapq.heappop(heap)\n if i + 1 < n and (i + 1, j) not in visited:\n heapq.heappush(heap, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n if j + 1 < n and (i, j + 1) not in visited:\n heapq.heappush(heap, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))\n k -= 1\n \n return val","runtime":"203"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n pq = []\n\n n = len(matrix)\n m = len(matrix[0])\n\n heapq.heappush(pq, (matrix[0][0], 0,0))\n in_process = set()\n in_process.add((0,0))\n best = None\n for i in range(k):\n val, r, c = heapq.heappop(pq)\n #print(f'val ={val} , r = {r}, c = {c}')\n best = val\n for R, C in [(r+1, c),(r,c+1)]:\n if all([R < n, C < m]) and (R,C) not in in_process:\n in_process.add((R,C))\n heapq.heappush(pq, (matrix[R][C], R, C))\n\n return best\n","runtime":"215"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n N = len(matrix)\n mx = matrix[-1][-1]\n\n q = [(matrix[0][0], 0, 0)]\n ans = None\n\n dirs = [(0, 1), (1, 0)]\n\n while q and k > 0:\n n, i, j = heapq.heappop(q)\n\n if n > mx:\n break\n\n if matrix[i][j] == None:\n continue\n\n matrix[i][j] = None\n \n ans = n\n\n for dx, dy in dirs:\n x, y = dx + i, dy + j\n\n if x < N and y < N and matrix[x][y] != None:\n heapq.heappush(q, (matrix[x][y], x, y))\n\n k -= 1\n\n return ans\n","runtime":"215"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n l = matrix[0][0]\n r = matrix[len(matrix) - 1][len(matrix[0]) - 1]\n while l < r:\n num = (l + r) // 2\n count = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] <= num:\n count += 1\n if count >= k:\n r = num\n else:\n break\n if count >= k:\n r = num\n break\n if count < k:\n l = num + 1\n \n return l\n\n ","runtime":"218"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n res = []\n min_h = []\n for i in range(len(matrix)):\n heappush(min_h, (matrix[i][0], (i, 0)))\n \n while len(res) < k:\n val, (i, j) = heappop(min_h)\n print(val, (i, j))\n res.append(val)\n if j + 1 < len(matrix[0]):\n heappush(min_h, (matrix[i][j + 1], (i, j + 1)))\n return res[k - 1]","runtime":"218"},{"code":"import heapq\n\nclass Node:\n\tdef __init__(self, data, row, step):\n\t\tself.data = data\n\t\tself.row = row\n\t\tself.step = step\n\t\n\tdef __lt__(self, other):\n\t\treturn self.data < other.data\n\n\ndef mergeKSortedArrays(kArrays, k:int):\n\t\n\tmin_heap = []\n\theapq.heapify(min_heap)\n\n\t#first inserting all the front value of list[list]\n\tfor row in range(k):\n\t\tif kArrays[row]:\n\t\t\theapq.heappush(min_heap, Node(kArrays[row][0], row, 0))\n\t\n\t# now pick minimum and insert the new node in heap\n\tans = []\n\twhile min_heap:\n\t\ttemp = heapq.heappop(min_heap)\n\t\tdata, row, step = temp.data, temp.row, temp.step\n\n\t\tans.append(data)\n\n\t\tif (step+1) < len(kArrays[row]):\n\t\t\theapq.heappush(min_heap, Node(kArrays[row][step+1], row, step+1))\n\n\treturn ans\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n arr = mergeKSortedArrays(matrix, len(matrix))\n return arr[k-1]","runtime":"221"},{"code":"from collections import defaultdict\nimport heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # We can utilize Dijkstra's.\n\n def neighbors(i, j):\n neighbors = []\n\n for di, dj in ((0, 1), (0, -1), (1, 0), (-1, 0)):\n ni, nj = i + di, j + dj\n if 0 <= ni < n and 0 <= nj < n and matrix[i][j] <= matrix[ni][nj]:\n neighbors.append((ni, nj))\n \n return neighbors\n\n n = len(matrix)\n count = 0\n queue = [(matrix[0][0], 0, 0)]\n seen = {(0, 0)}\n \n while queue or count <= k:\n val, i, j = heapq.heappop(queue)\n count += 1\n\n if count == k:\n return val\n \n for ni, nj in neighbors(i, j):\n if (ni, nj) not in seen:\n heapq.heappush(queue, (matrix[ni][nj], ni, nj))\n seen.add((ni, nj))\n \n return count\n\n \n ","runtime":"221"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n visited = set()\n\n n = len(matrix)\n heap = [(matrix[0][0], 0, 0)]\n \n answer = []\n while heap:\n\n val, a, b = heapq.heappop(heap)\n if (a,b) in visited: continue\n visited.add((a,b))\n\n answer.append(val)\n if len(answer) == k: return answer[-1]\n\n\n if a < n-1:\n if (a+1,b) not in visited:\n heapq.heappush(heap, (matrix[a+1][b], a+1, b))\n\n if b < n-1:\n if (a, b+1) not in visited:\n heapq.heappush(heap, (matrix[a][b+1], a, b+1))\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n # # h = []\n # # for i in range(len(matrix)):\n # # for j in range(len(matrix[0])):\n # # heapq.heappush(h, matrix[i][j])\n \n # # while k > 0:\n # # elem = heapq.heappop(h)\n # # k-=1\n # # return elem\n \n # def soln1(k):\n # arr = []\n\n # for r in range(min(k, len(matrix))):\n # arr.append((matrix[r][0], r,0))\n # heapq.heapify(arr)\n\n # while k:\n \n # elem, r, c = heapq.heappop(arr)\n # if c < (len(matrix)-1):\n # heapq.heappush(arr, (matrix[r][c+1],r,c+1))\n # k-=1\n # return elem\n\n # return soln1(k)","runtime":"224"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n visited = set()\n\n n = len(matrix)\n heap = [(matrix[0][0], 0, 0)]\n \n answer = []\n while heap:\n\n val, a, b = heapq.heappop(heap)\n if (a,b) in visited: continue\n visited.add((a,b))\n\n answer.append(val)\n if len(answer) == k: return answer[-1]\n\n\n if a < n-1:\n heapq.heappush(heap, (matrix[a+1][b], a+1, b))\n\n if b < n-1:\n heapq.heappush(heap, (matrix[a][b+1], a, b+1))\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n # # h = []\n # # for i in range(len(matrix)):\n # # for j in range(len(matrix[0])):\n # # heapq.heappush(h, matrix[i][j])\n \n # # while k > 0:\n # # elem = heapq.heappop(h)\n # # k-=1\n # # return elem\n \n # def soln1(k):\n # arr = []\n\n # for r in range(min(k, len(matrix))):\n # arr.append((matrix[r][0], r,0))\n # heapq.heapify(arr)\n\n # while k:\n \n # elem, r, c = heapq.heappop(arr)\n # if c < (len(matrix)-1):\n # heapq.heappush(arr, (matrix[r][c+1],r,c+1))\n # k-=1\n # return elem\n\n # return soln1(k)","runtime":"224"},{"code":"class Solution:\n \n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def is_smaller(m):\n count =0\n count_2 = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] < m:\n count += 1\n if matrix[i][j] <= m:\n count_2 += 1\n return count+1, count_2\n l, r = matrix[0][0], matrix[-1][-1]\n \n while l<=r:\n m = (l+r)//2\n count, count_2 = is_smaller(m)\n if count <= k <= count_2:\n return m\n elif count_2 < k:\n l = m+1\n else:\n r = m-1\n\n return l\n\n","runtime":"227"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n import numpy as np\n if k==1 :\n return matrix[0][0]\n \n rows = len(matrix)\n cols = len(matrix[0])\n if rows ==1 and cols ==1:\n return matrix[0][0]\n mat =np.array(matrix).flatten()\n mat .sort()\n return mat[k-1]","runtime":"227"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n import numpy as np\n arr = np.array(matrix)\n new = arr.reshape(-1)\n new.sort()\n return new[k-1]\n ","runtime":"230"},{"code":"class Solution:\n \n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def is_smaller(m):\n count =0\n count_2 = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] < m:\n count += 1\n if matrix[i][j] <= m:\n count_2 += 1\n return count+1, count_2\n l, r = matrix[0][0], matrix[-1][-1]\n \n while l<=r:\n m = (l+r)//2\n count, count_2 = is_smaller(m)\n if count <= k <= count_2:\n return m\n elif count_2 < k:\n l = m+1\n else:\n r = m-1\n\n return l\n\n","runtime":"230"},{"code":"class Solution:\n \n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def is_smaller(m):\n count =0\n count_2 = 0\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] < m:\n count += 1\n if matrix[i][j] <= m:\n count_2 += 1\n return count+1, count_2\n l, r = matrix[0][0], matrix[-1][-1]\n \n while l<=r:\n m = (l+r)//2\n count, count_2 = is_smaller(m)\n print(m, count, count_2)\n if count <= k <= count_2:\n return m\n elif count_2 < k:\n l = m+1\n else:\n r = m-1\n print(l)\n return l\n\n","runtime":"233"},{"code":"class Solution: \n # moving row by row\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n candidates = [(matrix[0][c], 0, c) for c in range(n)]\n heapq.heapify(candidates)\n visited_rows = {0}\n \n for _ in range(k):\n v, row, col = heapq.heappop(candidates)\n print(v, row, col)\n if row+1<n and not row+1 in visited_rows:\n visited_rows.add(row+1)\n for c in range(n):\n heapq.heappush(candidates, (matrix[row+1][c], row+1, c))\n \n return v\n \n # moving element by element:\n def kthSmallest0(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n row, col = 0, 0\n candidates = [(matrix[row][col], row, col)]\n visited_cels = set((0,0))\n for _ in range(k):\n v, row, col = heapq.heappop(candidates)\n #print(row, col, v)\n for (r,c) in [(0,1), (1,0)]:\n if row+r<n and col+c<n and not (row+r,col+c) in visited_cels:\n heapq.heappush(candidates, (matrix[row+r][col+c], row+r, col+c))\n visited_cels.add((row+r,col+c))\n return v","runtime":"236"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n row, col = 0, 0\n candidates = [(matrix[row][col], row, col)]\n visited_cels = set(\"0-0\")\n for _ in range(k):\n v, row, col = heapq.heappop(candidates)\n #print(row, col, v)\n for (r,c) in [(0,1), (1,0)]:\n if 0<=row+r<n and 0<=col+c<n:\n new_candidate = (matrix[row+r][col+c], row+r, col+c)\n if not \"{}-{}\".format(row+r,col+c) in visited_cels:\n heapq.heappush(candidates, new_candidate)\n visited_cels.add(\"{}-{}\".format(row+r,col+c))\n return v","runtime":"236"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n # 0,0 is guaranteed to be the smallest element\n # from there, we can go to 0,1 or 1,0 -- these are guaranteed to be the next smallest\n # it depends which ever value is greater\n # add the \"next\" potential values to a heap, going to the smaller index\n # once we have visited the kth value, return that\n # within our heap, keep track of [value, row, col]\n # 1 -> 5 -> 9 -> 10 -> 11 -> 12 -> 13 -> 13\n \n heap = [[matrix[0][0], 0, 0]]\n n = len(matrix)\n dirs = [(1, 0), (0, 1)]\n count = 0\n visited = set()\n\n while heap:\n value, row, col = heapq.heappop(heap)\n\n if (row, col) not in visited:\n count += 1\n visited.add((row, col))\n\n if count == k:\n return value\n \n for r, c in dirs:\n if 0 <= row + r < n and 0 <= col + c < n and (row + r, col + c) not in visited:\n heapq.heappush(heap, [matrix[row + r][col + c], row + r, col + c])\n \n \n\n\n ","runtime":"239"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n # 0,0 is guaranteed to be the smallest element\n # from there, we can go to 0,1 or 1,0 -- these are guaranteed to be the next smallest\n # it depends which ever value is greater\n # add the \"next\" potential values to a heap, going to the smaller index\n # once we have visited the kth value, return that\n # within our heap, keep track of [value, row, col]\n # 1 -> 5 -> 9 -> 10 -> 11 -> 12 -> 13 -> 13\n \n heap = [[matrix[0][0], 0, 0]]\n n = len(matrix)\n dirs = [(1, 0), (0, 1)]\n count = 0\n visited = set()\n\n while heap:\n value, row, col = heapq.heappop(heap)\n\n if (row, col) not in visited:\n count += 1\n visited.add((row, col))\n\n if count == k:\n return value\n \n for r, c in dirs:\n if 0 <= row + r < n and 0 <= col + c < n:\n heapq.heappush(heap, [matrix[row + r][col + c], row + r, col + c])\n \n \n\n\n ","runtime":"239"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = list()\n for index, row in enumerate(matrix):\n heapq.heappush(heap, (row[0], index))\n matrix[index] = matrix[index][1:]\n _min = 0\n print(heap)\n while k:\n _min, index = heapq.heappop(heap)\n print(k, _min, index)\n if len(matrix[index]) > 0:\n heapq.heappush(heap, (matrix[index][0], index))\n matrix[index] = matrix[index][1:]\n k -= 1\n return _min\n ","runtime":"242"},{"code":"class Solution:\n def kthSmallest(self, mat: List[List[int]], k: int) -> int:\n n, m = len(mat), len(mat[0])\n def safe(i, j):\n if i < n and j < m and j > -1 and i > -1 and mat[i][j] != 'a':\n return True\n\n q = [(mat[0][0], 0, 0)]\n mat[0][0] = 'a'\n for i in range(k):\n v, i, j = heappop(q)\n for x, y in [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]:\n x, y = x + i, y + j\n if safe(x, y):\n heappush(q, (mat[x][y], x, y))\n mat[x][y] = 'a'\n\n return v","runtime":"242"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"245"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n temp_arr=[]\n for i in matrix:\n temp_arr.extend(i)\n temp_arr.sort()\n return temp_arr[k-1]\n ","runtime":"245"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n hplist = []\n\n heapq.heapify(hplist)\n heapq.heappush(hplist, [matrix[0][0], (0,0)])\n count = 1\n visited = set()\n visited.add((0,0))\n\n def valid(index):\n x,y = index[0], index[1]\n if(x <0 or y<0 or x== len(matrix) or y == len(matrix[0]) or (x,y) in visited):\n return False\n return True\n \n while(hplist):\n top = heapq.heappop(hplist)\n print(top)\n if(count == k):\n return top[0]\n index = top[1]\n right = [index[0], index[1]+1]\n down = [index[0]+1, index[1]]\n if(valid(right)):\n visited.add((right[0], right[1]))\n heapq.heappush(hplist, [matrix[right[0]][right[1]], (right[0], right[1])])\n if(valid(down)):\n visited.add((down[0], down[1]))\n heapq.heappush(hplist, [matrix[down[0]][down[1]], (down[0], down[1])])\n count +=1\n \n\n\n\n\n\n\n ","runtime":"248"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"248"},{"code":"from queue import PriorityQueue\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n q = PriorityQueue()\n\n n = len(matrix)\n for i in range(n):\n q.put((matrix[i][0], i, 0))\n \n res = None\n for _ in range(k):\n values = q.get()\n res = values[0]\n i, j = values[1], values[2]\n if j + 1 < n:\n q.put((matrix[i][j+1], i, j+ 1))\n return res\n\n ","runtime":"251"},{"code":"import queue\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n Q = queue.PriorityQueue()\n\n n = len(matrix)\n\n for i in range(min(n,k)):\n Q.put((matrix[i][0], i, 0))\n \n e = None\n while k:\n e, r, c = Q.get()\n\n if c<n-1:\n Q.put((matrix[r][c+1], r, c+1))\n k-=1\n \n return e\n\n\n ","runtime":"251"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def get(seq, indices):\n for index in indices:\n seq = seq[index]\n return seq\n \n\n if not matrix or not matrix[0]:\n return 0\n\n n = len(matrix)\n \n mins = []\n frontier = [(matrix[0][0], 0, 0)]\n visited = set()\n\n while len(mins) < k and frontier:\n node = heapq.heappop(frontier)\n val, i, j = node\n if node in visited:\n continue\n \n mins.append(node)\n visited.add(node)\n\n n1 = (i + 1, j)\n n2 = (i, j + 1)\n\n if i + 1 >= n and j + 1 >= n:\n continue\n elif i + 1 >= n:\n heapq.heappush(frontier, (get(matrix, n2), *n2))\n continue\n elif j + 1 >= n:\n heapq.heappush(frontier, (get(matrix, n1), *n1))\n continue\n \n heapq.heappush(frontier, (get(matrix, n1), *n1))\n heapq.heappush(frontier, (get(matrix, n2), *n2))\n\n print(mins)\n kthNode = mins[-1]\n value, i, j = kthNode\n return value","runtime":"254"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"254"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1] ","runtime":"257"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n x=[]\n for i in matrix:\n for j in i:\n x.append(j)\n x=sorted(x)\n return x[k-1]\n ","runtime":"257"},{"code":"import numpy as np\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n matrix = np.array(matrix).flatten()\n return np.sort(matrix)[k - 1]","runtime":"260"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n h = []\n heapq.heappush(h, (matrix[0][0], 0,0))\n visited = set()\n while h:\n top, x, y = heapq.heappop(h)\n if (x,y) in visited:\n continue\n visited.add((x,y))\n print(f\"{k}, {top}\")\n if k == 1:\n return top\n if x+1 < len(matrix):\n heapq.heappush(h, (matrix[x+1][y], x+1,y))\n if y+1 < len(matrix[0]):\n heapq.heappush(h, (matrix[x][y+1], x,y+1))\n k -= 1 \n return -1\n ","runtime":"263"},{"code":"import queue\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n Q = queue.PriorityQueue()\n\n n = len(matrix)\n\n for i in range(n):\n for j in range(n):\n Q.put(-matrix[i][j])\n if Q.qsize()>k:\n Q.get()\n \n return -Q.queue[0]\n\n\n ","runtime":"266"},{"code":"from heapq import *\nfrom queue import PriorityQueue\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n R = len(matrix)\n C = R\n\n Q = PriorityQueue()\n for r in range(R):\n Q.put((matrix[r][0],(r,0)))\n\n i = 0\n #print(Q)\n while(i < k):\n num , (r,c) = Q.get() \n #print(num,r,c)\n if c < C-1:\n Q.put((matrix[r][c+1],(r,c+1)))\n #else:\n # Q.put((matrix[r+1][c],(r+1,c)))\n \n i+=1\n \n return num\n","runtime":"266"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n\n def quick_sort(nums):\n if len(nums) < 2:\n return nums\n\n pivot = nums.pop(len(nums) // 2)\n left = [ x for x in nums if x <= pivot ]\n right = [ x for x in nums if x > pivot ]\n return quick_sort(left) + [pivot] + quick_sort(right)\n\n\n res = sum(matrix, [])\n\n res = quick_sort(res)\n\n return res[k - 1]\n","runtime":"269"},{"code":"from queue import PriorityQueue\n\nclass Solution:\n\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # store the object(matrix[i][j], i, j)\n pq = PriorityQueue()\n\n # initialize it, put first element into it\n for i in range(len(matrix)):\n pq.put((matrix[i][0], i, 0))\n\n res = -1\n while pq and k > 0:\n cur = pq.get()\n res = cur[0]\n k -= 1\n\n i, j = cur[1], cur[2]\n if j + 1 < len(matrix[i]):\n pq.put((matrix[i][j + 1], i, j + 1))\n \n return res","runtime":"269"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n l=[]\n for r in matrix:\n l += r\n l.sort()\n return l[k-1]","runtime":"272"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"272"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"275"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"275"},{"code":"import queue\nclass Solution:\n # approach 1: easy solution would be to flatten the list, sort it, and\n # return the kth. O(n + nlogn) = O(nlogn).\n # approach 2: instead of sorting, do a sort of uniform cost BFS where\n # you maintain a frontier of next elements (priority queue), pull out first k,\n # return kth. Guarantee is that cells increase monotonically by increasing\n # row and column index. When inserting into the queue, how to detect duplicates?\n # Could use a n^2 flag matrix\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n q = queue.PriorityQueue()\n n = len(matrix)\n for i in range(n):\n q.put((matrix[i][0], (i, 0)))\n out = []\n for i in range(k):\n val, coord = q.get()\n out.append(val)\n r, c = coord\n if c < n-1:\n q.put((matrix[r][c+1], (r, c+1)))\n return out[k-1]","runtime":"278"},{"code":"from queue import PriorityQueue\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n q=PriorityQueue()\n n=len(matrix)\n m=len(matrix[0])\n for i in range(n):\n for j in range(m):\n q.put(matrix[i][j])\n l=0\n for i in range(k):\n l=q.get()\n return l\n\n \n ","runtime":"278"},{"code":"import numpy as np\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n mat=np.array(matrix).flatten()\n mat.sort()\n return mat[k-1]","runtime":"281"},{"code":"\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n=len(matrix)\n x=min(n,k+1)\n if x<n: self.array= matrix[:x]\n else:self.array=matrix\n\n self.heap=[(row[0],i,0) for i,row in enumerate(self.array)]\n self.heapify()\n return self.findKsmallest(k,0)\n \n def heapify(self):\n length=len(self.heap)\n if length//2==0: mid=length//2\n else: mid=(length+1)//2\n for i in range(length-1-mid,-1,-1):\n ind1=2*i+1\n ind2=2*i+2\n self.bubbledown(i,ind1,ind2,length)\n return\n \n \n def swap(self,index_i,index_one):\n tmp=self.heap[index_one]\n self.heap[index_one]=self.heap[index_i]\n self.heap[index_i]=tmp\n return\n \n def bubbledown(self,i,ind1,ind2,length):\n while (ind1<length):\n if ind2<length and self.heap[ind2][0]<self.heap[ind1][0]:\n if self.heap[ind2][0]<self.heap[i][0]:\n self.swap(i,ind2)\n i=ind2\n else:break\n else:\n if self.heap[ind1][0]<self.heap[i][0]:\n self.swap(i,ind1)\n i=ind1\n else: break\n ind1=2*i+1\n ind2=2*i+2\n return\n \n def findKsmallest(self,k,count):\n item=self.heap[0]\n count+=1\n if count==k: return item[0]\n else:\n if item[2]+1<len(self.array[0]):self.heap.append((self.array[item[1]][item[2]+1],item[1],item[2]+1))\n self.swap(0,len(self.heap)-1)\n _=self.heap.pop()\n self.bubbledown(0,1,2,len(self.heap))\n return self.findKsmallest(k,count)\n\n\n \n\n\n ","runtime":"281"}],"string":"[\n {\n \"code\": \"\\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\\n temp_arr=[]\\n for i in matrix:\\n temp_arr.extend(i)\\n temp_arr.sort()\\n return temp_arr[k-1]\\n\\nwith open('user.out', 'w') as f:\\n inputs = list(map(loads, stdin))\\n for matrix, k in zip(inputs[::2], inputs[1::2]):\\n f.write(f\\\"{kthSmallest(matrix, k)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"\\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\\n temp_arr=[]\\n for i in matrix:\\n temp_arr.extend(i)\\n temp_arr.sort()\\n return temp_arr[k-1]\\n\\nwith open('user.out', 'w') as f:\\n inputs = list(map(loads, stdin))\\n for matrix, k in zip(inputs[::2], inputs[1::2]):\\n f.write(f\\\"{kthSmallest(matrix, k)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n left, right = matrix[0][0], matrix[n - 1][n - 1]\\n\\n while left < right:\\n mid = left + (right - left) // 2\\n if self.countSmall(matrix, mid) < k:\\n left = mid + 1\\n else:\\n right = mid\\n\\n return left\\n\\n def countSmall(self, matrix: List[List[int]], target: int) -> int:\\n n = len(matrix)\\n count = 0\\n for row in matrix:\\n left, right = 0, n\\n while left < right:\\n mid = left + (right - left) // 2\\n if row[mid] <= target:\\n left = mid + 1\\n else:\\n right = mid\\n count += left\\n return count\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().kthSmallest(nums, next(inputs)),file=f)\\nexit(0)\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"\\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\\n temp_arr=[]\\n for i in matrix:\\n temp_arr.extend(i)\\n temp_arr.sort()\\n return temp_arr[k-1]\\n\\nwith open('user.out', 'w') as f:\\n inputs = list(map(loads, stdin))\\n for matrix, k in zip(inputs[::2], inputs[1::2]):\\n f.write(f\\\"{kthSmallest(matrix, k)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"\\ndef kthSmallest(matrix: List[List[int]], k: int) -> int:\\n nums = []\\n for row in matrix:\\n for n in row:\\n nums.append(n)\\n \\n nums.sort()\\n return nums[k-1]\\n\\nwith open('user.out', 'w') as f:\\n inputs = list(map(loads, stdin))\\n for matrix, k in zip(inputs[::2], inputs[1::2]):\\n f.write(f\\\"{kthSmallest(matrix, k)}\\\\n\\\")\\nexit(0)\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n \\n def count_less_or_equal(mid):\\n count = 0\\n for row in matrix:\\n idx = bisect.bisect_right(row, mid)\\n count += idx\\n return count\\n \\n left, right = matrix[0][0], matrix[-1][-1]\\n while left < right:\\n mid = (left + right) // 2\\n if count_less_or_equal(mid) < k:\\n left = mid + 1\\n else:\\n right = mid\\n return left\\n\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class CountLessThanWithBounds:\\n def __init__(self, count: int, smaller: int, larger: int):\\n self.count = count\\n self.smaller = smaller\\n self.larger = larger\\n\\nclass Solution:\\n def _get_count_less_than_with_bounds(self, matrix: list[list[int]], mid: int, smaller: int, larger: int) -> CountLessThanWithBounds:\\n count, n = 0, len(matrix)\\n row, col = n - 1, 0\\n \\\"\\\"\\\"\\n [\\n [1,5,9],\\n [10,11,13],\\n [12,13,15]\\n ]\\n \\\"\\\"\\\"\\n while row >= 0 and col < n:\\n num = matrix[row][col]\\n if num > mid:\\n larger = min(larger, num)\\n row -= 1\\n else:\\n smaller = max(smaller, num)\\n count += row + 1\\n col += 1 \\n\\n return CountLessThanWithBounds(count, smaller, larger)\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n start = smallest = matrix[0][0]\\n end = largest = matrix[n - 1][n - 1]\\n \\\"\\\"\\\"\\n [\\n [1,5,9],\\n [10,11,13],\\n [12,13,15]\\n ]\\n \\\"\\\"\\\"\\n while start < end:\\n mid = (start + end) // 2\\n count_less_than_with_bounds = self._get_count_less_than_with_bounds(matrix, mid, smallest, largest)\\n if count_less_than_with_bounds.count == k:\\n return count_less_than_with_bounds.smaller\\n elif count_less_than_with_bounds.count < k:\\n start = count_less_than_with_bounds.larger\\n else:\\n end = count_less_than_with_bounds.smaller\\n return start\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n def countLessEqual(mid):\\n count = 0\\n row, col = n - 1, 0 # Start from the bottom-left corner\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += (row + 1) # All elements in this row up to this point are <= mid\\n col += 1 # Move to the next column\\n else:\\n row -= 1 # Move up to the previous row\\n return count\\n\\n # Binary search boundaries\\n left, right = matrix[0][0], matrix[n-1][n-1]\\n \\n # Perform binary search\\n while left < right:\\n mid = (left + right) // 2\\n if countLessEqual(mid) < k:\\n left = mid + 1 # Look for a larger value\\n else:\\n right = mid # Look for a smaller value\\n \\n return left\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# https://www.youtube.com/watch?v=b4mkk8Fk8fs\\n\\nclass Solution:\\n def kthSmallest(self, M: List[List[int]], k: int) -> int:\\n n = len(M)\\n min, max = M[0][0], M[-1][-1]\\n\\n while min != max:\\n mid = min + (max - min) // 2\\n count = self.countLessOrEqual(M, mid)\\n if count < k:\\n min = mid + 1\\n else:\\n max = mid\\n\\n return min\\n\\n def countLessOrEqual(self, M, mid):\\n n, m = len(M), len(M[0])\\n count = 0\\n row, col = 0, m-1\\n\\n while row < n and col >= 0:\\n if M[row][col] <= mid:\\n count += col + 1\\n row += 1\\n else:\\n col -= 1\\n\\n return count\\n\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n \\n def countLessEqual(mid):\\n count, row, col = 0, n - 1, 0\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += row + 1\\n col += 1\\n else:\\n row -= 1\\n return count\\n \\n low, high = matrix[0][0], matrix[n - 1][n - 1]\\n \\n while low < high:\\n mid = (low + high) // 2\\n if countLessEqual(mid) < k:\\n low = mid + 1\\n else:\\n high = mid\\n \\n return low\\n\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"# Binary Search (count from large to small)\\nclass Solution:\\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n\\n n = len(matrix)\\n lo = matrix[0][0] # low\\n hi = matrix[n-1][n-1] # high\\n\\n while lo < hi:\\n mid = (lo + hi) // 2\\n nleq = 0 # number of elements less or equal to mid\\n \\n i, j = 0, n - 1 # i-th row, j-th column\\n\\n while i < n and j >= 0:\\n if matrix[i][j] <= mid:\\n nleq += j + 1\\n i += 1\\n else:\\n j -= 1\\n\\n if nleq < k:\\n lo = mid + 1\\n else:\\n hi = mid\\n \\n return lo\\n\\n\\n# Binary Search (count from small to large)\\n# class Solution:\\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n\\n# n = len(matrix)\\n# lo = matrix[0][0] # low\\n# hi = matrix[n-1][n-1] # high\\n\\n# while lo < hi:\\n# mid = (lo + hi) // 2\\n# nleq = 0 # number of elements less or equal to mid\\n \\n# for i in range(n):\\n# j = 0\\n# while j < n:\\n# if matrix[i][j] <= mid:\\n# nleq += 1\\n# j += 1\\n# else:\\n# break\\n\\n# if nleq < k:\\n# lo = mid + 1\\n# else:\\n# hi = mid\\n# return lo\\n\\n\\n# My long solution (Sorted Queue)\\n# from collections import deque\\n# import math\\n\\n# class Solution:\\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n \\n# n = len(matrix)\\n# q = deque() # queue\\n# ld = None # last diagonal added \\n# lass = None # last min assigned\\n# lminadd = -math.inf # last min added\\n# lmaxadd = math.inf # last max added\\n# lk = 0 # last 'k' processed\\n\\n# # Case 1\\n# if k <= math.ceil(n*n / 2):\\n \\n# while lk < k:\\n# lk += 1\\n# ld = (lk-1, 0)\\n# ldmin = math.inf # diagonal min\\n \\n# # adding a diagonal to queue\\n# for i in range(0, lk):\\n# for j in range(lk-1, -1, -1):\\n# if i <= n-1 and j <= n-1 and i+j == lk-1:\\n# el = matrix[i][j]\\n# q.append(el)\\n\\n# # keeping track\\n# if el < ldmin:\\n# ldmin = el\\n\\n# # sorting queue\\n# prev = 1\\n# while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n# prev += 1\\n \\n# # last min added (from last diagonal)\\n# lminadd = ldmin\\n\\n# # assigning values for 'lk'\\n# lass = q.popleft()\\n\\n# # shortcut to answer\\n# if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\\n# return q[k - lk - 1]\\n \\n# return lass\\n\\n# # Case 2\\n# if k > math.ceil(n*n / 2):\\n\\n# nk = n*n - k + 1 # new 'k' going backwards\\n \\n# while lk < nk:\\n# lk += 1\\n# ld = (n-lk, n-1)\\n# ldmax = -math.inf # diagonal max\\n \\n# # adding a diagonal to queue\\n# for i in range(n-lk, n):\\n# for j in range(n-1, n-lk-1, -1):\\n# if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\\n# el = matrix[i][j]\\n# q.append(el)\\n\\n# # keeping track\\n# if el > ldmax:\\n# ldmax = el\\n\\n# # sorting queue\\n# prev = 1\\n# while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n# prev += 1\\n \\n# # last max added (from last diagonal)\\n# lmaxadd = ldmax\\n\\n# # assigning values for 'lk'\\n# lass = q.popleft()\\n\\n# # jumping to answer\\n# if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\\n# return q[nk - lk - 1]\\n\\n# return lass\\n\\n\\n# Working simple non-efficient solution\\n# class Solution:\\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n# n = len(matrix[0])\\n# arr = []\\n# for i in range(n):\\n# for j in range(n):\\n# arr.append(matrix[i][j])\\n# arr.sort()\\n# return arr[k-1]\\n\\n\\n# ChatGPT Binary Search\\n# class Solution:\\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n# def count_less_equal(mid):\\n# # Count how many numbers are <= mid\\n# count = 0\\n# row, col = n - 1, 0\\n# while row >= 0 and col < n:\\n# if matrix[row][col] <= mid:\\n# count += row + 1\\n# col += 1\\n# else:\\n# row -= 1\\n# return count\\n\\n# n = len(matrix)\\n# low, high = matrix[0][0], matrix[-1][-1]\\n\\n# while low < high:\\n# mid = (low + high) // 2\\n# if count_less_equal(mid) < k:\\n# low = mid + 1\\n# else:\\n# high = mid\\n\\n# return low\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n m = len(matrix)\\n n = len(matrix[0])\\n \\n def count(m):\\n c = 0 # count of element less than equals to 'm'\\n i = n-1\\n j = 0\\n \\n while i >= 0 and j < n:\\n if matrix[i][j] > m:\\n i -= 1\\n else:\\n c += i+1\\n j += 1\\n return c\\n \\n \\n low = matrix[0][0]\\n high = matrix[n-1][n-1]\\n \\n while low <= high:\\n m = (low+high)//2\\n cnt = count(m)\\n if cnt < k:\\n low = m + 1\\n else:\\n cnt1 = count(m-1)\\n if cnt1 < k:\\n return m\\n high = m-1\\n return 0\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n n = len(matrix)\\n\\n l = matrix[0][0]\\n r = matrix[-1][-1]\\n\\n while l < r:\\n m = l + (r - l) // 2\\n count = self.check(matrix, m, n)\\n\\n if count >= k:\\n r = m\\n else:\\n l = m + 1\\n\\n return l\\n\\n def check(self, matrix, m, n):\\n i, j = n - 1, 0\\n\\n count = 0\\n while i >= 0 and j < n:\\n if matrix[i][j] <= m:\\n count += (i + 1)\\n j += 1\\n else:\\n i -= 1\\n\\n return count\\n \",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def count(mid):\\n col = 0\\n row = n -1\\n count = 0\\n while col < n and row >= 0:\\n if matrix[row][col] <= mid:\\n count += row + 1\\n col += 1\\n else:\\n row -= 1\\n return count\\n\\n n = len(matrix)\\n small = matrix[0][0]\\n large = matrix[-1][-1]\\n\\n while small + 1 < large:\\n mid = small + (large - small) // 2\\n if count(mid) >= k:\\n large = mid\\n else:\\n small = mid\\n if count(small) >= k:\\n return small\\n else:\\n return large\\n \\n\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n\\n def count_less_equal(mid):\\n count = 0\\n row = n - 1\\n col = 0\\n\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += row + 1\\n col += 1\\n else:\\n row -= 1\\n return count\\n\\n left, right = matrix[0][0], matrix[-1][-1]\\n\\n while left < right:\\n mid = (left + right) // 2\\n if count_less_equal(mid) < k:\\n left = mid + 1\\n else:\\n right = mid\\n return left\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n nums=[j for i in matrix for j in i]\\n c=sorted(nums)\\n return c[k-1]\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"import bisect\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n l,r = matrix[0][0], matrix[-1][-1]\\n while l<r:\\n mid = (l+r)//2\\n count = 0\\n n = len(matrix[0])\\n # for i in range(len(matrix)):\\n # # 1,2,3\\n # # 1,3,5\\n # # 1,5,7\\n # # 如果mid是5，第一次3个，第二次2个，第三次1个\\n # count += bisect.bisect_right(matrix[i], mid)\\n j = n - 1\\n for i in range(len(matrix)):\\n while j >= 0 and matrix[i][j] > mid:\\n j -= 1\\n count += (j + 1)\\n if count < k:\\n l = mid+1\\n else:\\n r = mid\\n return l\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest_Mine(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n max_heap = [0] * k\\n for i in range(k):\\n max_heap[i] = -matrix[i // n][i % n]\\n heapq.heapify(max_heap)\\n for i in range(k, n * n):\\n val = matrix[i // n][i % n]\\n if val < -max_heap[0]:\\n heapq.heapreplace(max_heap, -val)\\n return -max_heap[0]\\n \\n def kthSmallest_LC1(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n min_heap = [(matrix[i][0], i, 0) for i in range(min(n, k))]\\n heapq.heapify(min_heap)\\n while k:\\n val, row, col = heapq.heappop(min_heap)\\n if col < n - 1:\\n heapq.heappush(min_heap, (matrix[row][col + 1], row, col + 1))\\n k -= 1\\n return val\\n \\n def countLessEqual(self, matrix, mid, largest_leq, smallest_gt):\\n n = len(matrix)\\n row, col = n - 1, 0\\n count = 0\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += (row + 1)\\n largest_leq = max(largest_leq, matrix[row][col])\\n col += 1\\n else:\\n smallest_gt = min(smallest_gt, matrix[row][col])\\n row -= 1\\n return count, largest_leq, smallest_gt\\n\\n def kthSmallest_LC2(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n left, right = matrix[0][0], matrix[n - 1][n - 1]\\n while left < right:\\n mid = left + (right - left) // 2\\n # largest less than or equal; smallest greater than\\n largest_leq, smallest_gt = matrix[0][0], matrix[n - 1][n - 1]\\n count, largest_leq, smallest_gt = self.countLessEqual(matrix, mid, largest_leq, smallest_gt)\\n if count == k:\\n return largest_leq\\n if count < k:\\n left = smallest_gt\\n else:\\n right = largest_leq\\n \\n return left\\n \\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n return self.kthSmallest_LC2(matrix, k)\",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"# ChatGPT Binary Search\\n\\nclass Solution:\\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n def count_less_equal(mid):\\n # Count how many numbers are <= mid\\n count = 0\\n row, col = n - 1, 0\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += row + 1\\n col += 1\\n else:\\n row -= 1\\n return count\\n\\n n = len(matrix)\\n low, high = matrix[0][0], matrix[-1][-1]\\n\\n while low < high:\\n mid = (low + high) // 2\\n if count_less_equal(mid) < k:\\n low = mid + 1\\n else:\\n high = mid\\n\\n return low\\n\\n\\n# My Binary Search (after seeing an example)\\n# class Solution:\\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n\\n# n = len(matrix)\\n# lo = matrix[0][0] # low\\n# hi = matrix[n-1][n-1] # high\\n\\n# while lo < hi:\\n# mid = (lo + hi) // 2\\n# nleq = 0 # number of elements less or equal to mid\\n \\n# for i in range(n):\\n# j = 0\\n# while j < n:\\n# if matrix[i][j] <= mid:\\n# nleq += 1\\n# j += 1\\n# else:\\n# break\\n\\n# if nleq < k:\\n# lo = mid + 1\\n# else:\\n# hi = mid\\n# return lo\\n\\n\\n# My long solution (Sorted Queue)\\n# from collections import deque\\n# import math\\n\\n# class Solution:\\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n \\n# n = len(matrix)\\n# q = deque() # queue\\n# ld = None # last diagonal added \\n# lass = None # last min assigned\\n# lminadd = -math.inf # last min added\\n# lmaxadd = math.inf # last max added\\n# lk = 0 # last 'k' processed\\n\\n# # Case 1\\n# if k <= math.ceil(n*n / 2):\\n \\n# while lk < k:\\n# lk += 1\\n# ld = (lk-1, 0)\\n# ldmin = math.inf # diagonal min\\n \\n# # adding a diagonal to queue\\n# for i in range(0, lk):\\n# for j in range(lk-1, -1, -1):\\n# if i <= n-1 and j <= n-1 and i+j == lk-1:\\n# el = matrix[i][j]\\n# q.append(el)\\n\\n# # keeping track\\n# if el < ldmin:\\n# ldmin = el\\n\\n# # sorting queue\\n# prev = 1\\n# while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n# prev += 1\\n \\n# # last min added (from last diagonal)\\n# lminadd = ldmin\\n\\n# # assigning values for 'lk'\\n# lass = q.popleft()\\n\\n# # shortcut to answer\\n# if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\\n# return q[k - lk - 1]\\n \\n# return lass\\n\\n# # Case 2\\n# if k > math.ceil(n*n / 2):\\n\\n# nk = n*n - k + 1 # new 'k' going backwards\\n \\n# while lk < nk:\\n# lk += 1\\n# ld = (n-lk, n-1)\\n# ldmax = -math.inf # diagonal max\\n \\n# # adding a diagonal to queue\\n# for i in range(n-lk, n):\\n# for j in range(n-1, n-lk-1, -1):\\n# if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\\n# el = matrix[i][j]\\n# q.append(el)\\n\\n# # keeping track\\n# if el > ldmax:\\n# ldmax = el\\n\\n# # sorting queue\\n# prev = 1\\n# while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n# prev += 1\\n \\n# # last max added (from last diagonal)\\n# lmaxadd = ldmax\\n\\n# # assigning values for 'lk'\\n# lass = q.popleft()\\n\\n# # jumping to answer\\n# if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\\n# return q[nk - lk - 1]\\n\\n# return lass\\n\\n\\n# Working simple non-efficient solution\\n# class Solution:\\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n# n = len(matrix[0])\\n# arr = []\\n# for i in range(n):\\n# for j in range(n):\\n# arr.append(matrix[i][j])\\n# arr.sort()\\n# return arr[k-1]\\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def count_less_or_equal(val):\\n count = 0\\n n = len(matrix)\\n i = n - 1\\n j = 0 \\n while i >= 0 and j < n:\\n if matrix[i][j] <= val:\\n count += i + 1\\n j += 1\\n else:\\n i -= 1\\n return count\\n\\n\\n left = matrix[0][0]\\n right = matrix[-1][-1]\\n\\n while left + 1 < right:\\n mid = (left + right) // 2\\n if count_less_or_equal(mid) >= k:\\n right = mid\\n else:\\n left = mid\\n print(left, right) \\n \\n if count_less_or_equal(left) < k:\\n return right\\n else:\\n return left\\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n m, n = len(matrix), len(matrix[0])\\n lo = matrix[0][0]\\n hi = matrix[-1][-1]\\n while lo <= hi:\\n md = lo + (hi - lo) // 2\\n\\n cnt = 0\\n j = n - 1\\n \\n for i in range(m):\\n while j >= 0 and matrix[i][j] > md:\\n j -= 1\\n cnt += j + 1\\n\\n if cnt < k:\\n lo = md + 1\\n else:\\n hi = md - 1\\n return lo\\n \\n \",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n#1 2 3\\n#2 3 4\\n#3 4 5\\n n = len(matrix)\\n l, r = matrix[0][0], matrix[n - 1][n - 1]\\n\\n while l < r:\\n mid = l + (r - l) // 2\\n\\n count = 0\\n j = n - 1\\n for i in range(n):\\n while j >= 0 and matrix[i][j] > mid:\\n j -= 1\\n count += j + 1\\n \\n if count < k:\\n l = mid + 1\\n else:\\n r = mid \\n return l\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"import bisect\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n l = matrix[0][0]\\n h = matrix[n-1][n-1]\\n \\n while l < h:\\n mid = l + (h - l) // 2\\n count = 0\\n \\n for row in matrix:\\n count += bisect.bisect_right(row, mid)\\n \\n if count < k:\\n l = mid + 1\\n else:\\n h = mid\\n \\n return l\\n\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def flatten_list(self, mat, ans):\\n for value in mat:\\n if isinstance(value, list):\\n self.flatten_list(value, ans)\\n else:\\n ans.append(value)\\n \\n return ans\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n flat_list = self.flatten_list(matrix, [])\\n # print(flat_list)\\n flat_list.sort()\\n return flat_list[k-1]\\n # return 13\\n # n = len(matrix)\\n # m = n - 1\\n # i = 0\\n # j = 0\\n # idx = 0\\n # while i <= m and j <= m and (idx < n*n):\\n # if idx == k - 1:\\n # return matrix[i][j]\\n # elif idx + m > k - 1:\\n # idx += 1\\n # j += 1\\n \\n # elif idx + m < k - 1:\\n # idx = idx + n\\n # i += 1\\n\\n\\n\\n \",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n \\n # Helper function to count how many numbers are ≤ mid in the matrix\\n def count_less_equal(mid):\\n count = 0\\n row, col = n - 1, 0 # Start from the bottom-left corner\\n \\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += (row + 1) # All elements in this column up to 'row' are ≤ mid\\n col += 1 # Move right\\n else:\\n row -= 1 # Move up\\n \\n return count\\n\\n # Binary search on the value range\\n left, right = matrix[0][0], matrix[n - 1][n - 1]\\n \\n while left < right:\\n mid = (left + right) // 2\\n if count_less_equal(mid) < k:\\n left = mid + 1 # We need a larger number\\n else:\\n right = mid # We need a smaller number or exactly mid\\n \\n return left\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class CountLessThanWithBounds:\\n def __init__(self, count: int, smaller: int, larger: int):\\n self.count = count\\n self.smaller = smaller\\n self.larger = larger\\n\\nclass Solution:\\n def _get_count_less_than_with_bounds(\\n self,\\n matrix: list[list[int]],\\n mid: int,\\n smaller: int,\\n larger: int\\n ) -> CountLessThanWithBounds:\\n count, n = 0, len(matrix)\\n row, col = n - 1, 0\\n\\n while row >= 0 and col < n:\\n num = matrix[row][col]\\n if num > mid:\\n larger = min(larger, num)\\n row -= 1\\n else:\\n smaller = max(smaller, num)\\n count += row + 1\\n col += 1\\n return CountLessThanWithBounds(count, smaller, larger)\\n\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n start = smallest = matrix[0][0]\\n end = largest = matrix[n - 1][n - 1]\\n while start < end:\\n mid = (start + end) // 2\\n count_less_than_with_bounds = self._get_count_less_than_with_bounds(\\n matrix, mid, smallest, largest\\n )\\n if count_less_than_with_bounds.count == k:\\n return count_less_than_with_bounds.smaller\\n elif count_less_than_with_bounds.count < k:\\n start = count_less_than_with_bounds.larger\\n else:\\n end = count_less_than_with_bounds.smaller\\n return start\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n low, high = matrix[0][0], matrix[n-1][n-1]\\n\\n def countLessEqual(mid):\\n count, row, col = 0, n-1, 0\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += row + 1\\n col += 1\\n else:\\n row -= 1\\n return count\\n\\n while low < high:\\n mid = (low + high) // 2\\n if countLessEqual(mid) < k:\\n low = mid + 1\\n else:\\n high = mid\\n return low\\n \",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"import bisect\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n=len(matrix)\\n low,high=matrix[0][0],matrix[n-1][n-1]\\n ans=0\\n while low<=high:\\n mid=(low+high)>>1\\n smallerElements=0\\n for i in matrix:\\n smallerElements+=bisect.bisect(i,mid)\\n if smallerElements<k:\\n low=mid+1\\n else:\\n ans=mid\\n high=mid-1\\n return ans\\n\\n\\n\\n\\n \",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n lis=[]\\n for i in matrix:\\n lis+=i\\n lis.sort()\\n return lis[k-1]\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def count_less_or_equal(val):\\n count = 0\\n n = len(matrix)\\n i = n - 1\\n j = 0 \\n while i >= 0 and j < n:\\n if matrix[i][j] <= val:\\n count += i + 1\\n j += 1\\n else:\\n i -= 1\\n return count\\n\\n\\n left = matrix[0][0]\\n right = matrix[-1][-1]\\n\\n while left <= right:\\n mid = (left + right) // 2\\n if count_less_or_equal(mid) >= k:\\n right = mid - 1\\n else:\\n left = mid + 1\\n return left \",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n k -= 1\\n \\n s = []\\n for row in matrix:\\n s += row\\n \\n s.sort()\\n return s[k]\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n lis=[]\\n for i in matrix:\\n for j in i:\\n lis.append(j)\\n lis.sort()\\n return lis[k-1]\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n left, right = matrix[0][0], matrix[n-1][n-1]\\n \\n while left < right:\\n mid = (left + right) // 2\\n count = 0\\n j = n - 1\\n # Count the number of elements in the matrix that are less than or equal to mid\\n for i in range(n):\\n while j >= 0 and matrix[i][j] > mid:\\n j -= 1\\n count += j + 1\\n # Update the range of the search\\n if count < k:\\n left = mid + 1\\n else:\\n right = mid\\n \\n return left\\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n \\n def countLessEqual(self, matrix, mid, smaller, larger):\\n \\n count, n = 0, len(matrix)\\n row, col = n - 1, 0\\n \\n while row >= 0 and col < n:\\n if matrix[row][col] > mid:\\n \\n # As matrix[row][col] is bigger than the mid, let's keep track of the\\n # smallest number greater than the mid\\n larger = min(larger, matrix[row][col])\\n row -= 1\\n \\n else:\\n \\n # As matrix[row][col] is less than or equal to the mid, let's keep track of the\\n # biggest number less than or equal to the mid\\n \\n smaller = max(smaller, matrix[row][col])\\n count += row + 1\\n col += 1\\n\\n return count, smaller, larger\\n \\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n n = len(matrix)\\n start, end = matrix[0][0], matrix[n - 1][n - 1]\\n while start < end:\\n mid = start + (end - start) / 2\\n smaller, larger = (matrix[0][0], matrix[n - 1][n - 1])\\n\\n count, smaller, larger = self.countLessEqual(matrix, mid, smaller, larger)\\n\\n if count == k:\\n return smaller\\n if count < k:\\n start = larger # search higher\\n else:\\n end = smaller # search lower\\n\\n return start\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n n = len(matrix)\\n (low,high) = ( matrix[0][0], matrix[-1][-1] )\\n\\n while(low<high):\\n\\n mid = (low+ high) // 2\\n\\n count = self.CountElements( matrix, mid)\\n\\n if count<k:\\n low = mid + 1\\n else:\\n high = mid\\n\\n return low\\n\\n\\n # Count Elemnts which are less than equal to mid\\n def CountElements(self,matrix, mid):\\n\\n row,col = len(matrix) -1 , 0\\n count = 0\\n\\n while row>=0 and col< len(matrix[0]):\\n\\n if matrix[row][col]<= mid:\\n # Take top rows in consideration\\n count += (row+1)\\n col +=1\\n\\n else:\\n row -=1\\n\\n return count\\n\\n\\n\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n rows = len(matrix[0])\\n cols = len(matrix)\\n \\n left = matrix[0][0]\\n right = matrix[cols-1][rows-1]\\n k-=1\\n\\n def find_elements_less_than_mid(target):\\n total = 0\\n \\n for i in range(len(matrix)):\\n arr = matrix[i]\\n \\n left = 0\\n right = len(matrix[0])-1\\n count = 0\\n \\n while left <= right:\\n mid = (left + right) // 2\\n if arr[mid] <= target:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n total += left\\n \\n return total\\n \\n while left <= right:\\n mid = (left + right) // 2\\n \\n elements_less_than_mid = find_elements_less_than_mid(mid)\\n \\n if elements_less_than_mid <= k:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n \\n return left\\n\\n\\n \\n\\n \\n\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"from heapq import heappush,heappop\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n elements=[]\\n for i in range(len(matrix)):\\n elements += matrix[i]\\n \\n max_heap=[]\\n for i in range(k):\\n heappush(max_heap,-elements[i])\\n \\n for i in range(k,len(elements)):\\n if elements[i] < -max_heap[0]:\\n heappop(max_heap)\\n heappush(max_heap,-elements[i])\\n return -max_heap[0]\\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n ret = []\\n for arr in matrix:\\n for i in arr:\\n ret.append(i)\\n ret.sort()\\n print(ret)\\n return ret[k-1]\\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n array = []\\n n = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n array.append(matrix[i][j])\\n array.sort()\\n\\n return array[k-1]\\n \",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n v = []\\n for i in range(len(matrix)):\\n for j in range(len(matrix)):\\n v.append(matrix[i][j])\\n\\n v.sort()\\n return v[k - 1]\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n\\n for i in matrix:\\n for j in i:\\n heapq.heappush(heap, (-1) * j)\\n if len(heap) > k:\\n heapq.heappop(heap)\\n return heap[0] * (-1)\",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n l = matrix[0][0] - 1\\n r = matrix[-1][-1] + 1\\n while r - l > 1:\\n mid = (l + r) // 2\\n\\n cnt = 0\\n j = n - 1\\n for i in range(n):\\n while j >= 0 and matrix[i][j] > mid:\\n j -= 1\\n cnt += j + 1\\n \\n print(mid, cnt)\\n\\n if cnt >= k:\\n r = mid\\n else:\\n l = mid\\n\\n return r\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix[0])\\n arr = []\\n for i in range(n):\\n for j in range(n):\\n arr.append(matrix[i][j])\\n arr.sort()\\n return arr[k-1]\",\n \"runtime\": \"142\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n nums=[j for i in matrix for j in i]\\n c=sorted(nums)\\n return c[k-1]\",\n \"runtime\": \"145\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # Tiers of elements in the given sorted array (e.g. all elements in tier i < any elements in tier j if j > i; within each tier, we don't know the order of elements yet)\\n # 0 1 2 3 4\\n # 1 2 3 4 5\\n # 2 3 4 5 6\\n # 3 4 5 6 7\\n # 4 5 6 7 8\\n # We need to find the tier where k belongs to.\\n # Number of all elements from tier 0 to tier (i - 1) is:\\n # 1 + 2 + ... + i = i * (i + 1) / 2 < i^2 / 2\\n n = len(matrix)\\n max_heap = [0] * k\\n for i in range(k):\\n max_heap[i] = -matrix[i // n][i % n]\\n heapq.heapify(max_heap)\\n for i in range(k, n * n):\\n val = matrix[i // n][i % n]\\n if val < -max_heap[0]:\\n heapq.heapreplace(max_heap, -val)\\n return -max_heap[0]\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n import heapq\\n\\n newList = []\\n for x in matrix:\\n newList += x\\n element = 0\\n heapq.heapify(newList)\\n while k!=0:\\n element = heapq.heappop(newList)\\n k -= 1\\n return element\",\n \"runtime\": \"148\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n N = len(matrix)\\n \\n min_heap = []\\n for r in range(min(N, k)):\\n min_heap.append((matrix[r][0], r, 0))\\n\\n while k:\\n element, r, c = heapq.heappop(min_heap)\\n\\n if c < N - 1:\\n heapq.heappush(min_heap, (matrix[r][c + 1], r, c + 1))\\n\\n k -= 1\\n \\n return element\",\n \"runtime\": \"151\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap=[]\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n heapq.heappush(heap,matrix[i][j])\\n for _ in range(k-1):\\n x=heapq.heappop(heap)\\n return(heap[0])\",\n \"runtime\": \"151\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n import heapq\\n n = len(matrix)\\n min_heap = []\\n\\n for i in range(min(n, k)):\\n heapq.heappush(min_heap, (matrix[i][0], i, 0))\\n\\n for _ in range(k - 1):\\n val, r, c = heapq.heappop(min_heap)\\n if c + 1 < n:\\n heapq.heappush(min_heap, (matrix[r][c + 1], r, c + 1))\\n\\n return heapq.heappop(min_heap)[0]\\n\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"from heapq import heapify\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n N = len(matrix)\\n minHeap = []\\n for r in range(min(k, N)):\\n minHeap.append((matrix[r][0], r, 0))\\n \\n heapify(minHeap)\\n\\n while k:\\n element, r, c = heappop(minHeap)\\n\\n if c < N - 1:\\n heappush(minHeap, (matrix[r][c + 1], r, c + 1))\\n \\n k -= 1\\n return element\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n nums = []\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n nums.append(matrix[r][c])\\n heapq.heapify(nums)\\n for _ in range(k-1):\\n heapq.heappop(nums)\\n return heapq.heappop(nums)\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n n, m = len(matrix), len(matrix[0])\\n heap = [(matrix[0][j],0, j) for j in range(m)]\\n heapq.heapify(heap)\\n while k > 0:\\n val, i, j = heapq.heappop(heap)\\n if i+1 < n:\\n heapq.heappush(heap, (matrix[i+1][j],i+1,j))\\n k -= 1\\n return val\\n\\n\\n\\n\\n\\n\\n\\n\\n # n, m = len(matrix), len(matrix[0])\\n # heap = [(matrix[0][j], 0, j) for j in range(m)]\\n # heapq.heapify(heap)\\n # while k > 0:\\n # result, i, j = heapq.heappop(heap)\\n # if i + 1 < n:\\n # heapq.heappush(heap, (matrix[i+1][j], i + 1, j))\\n # k -= 1\\n # return result\\n\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n import heapq\\n n = len(matrix)\\n min_heap = []\\n for r in range(n):\\n min_heap.append([matrix[r][0], r, 0])\\n heapq.heapify(min_heap)\\n\\n for _ in range(k):\\n element, r, c = heapq.heappop(min_heap)\\n if c < n - 1:\\n heapq.heappush(min_heap, [matrix[r][c + 1], r, c + 1])\\n\\n return element\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n for row in matrix:\\n for el in row:\\n heapq.heappush(heap,-1*el)\\n if len(heap) > k:\\n heapq.heappop(heap)\\n \\n return -1*heap[0]\",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n r = []\\n for i in matrix:\\n r = r+i\\n heapq.heapify(r)\\n smallest = None\\n for i in range(k):\\n smallest = heapq.heappop(r)\\n return smallest \",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n minheap = []\\n\\n for i in range(n):\\n heapq.heappush(minheap, (matrix[i][0], i, 0))\\n\\n while minheap:\\n val, row, col = heapq.heappop(minheap)\\n k -= 1\\n if k == 0:\\n return val\\n \\n if (col + 1) < n:\\n heapq.heappush(minheap, (matrix[row][col + 1], row, col + 1))\\n\",\n \"runtime\": \"164\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n r = []\\n for i in matrix:\\n r = r+i\\n heapq.heapify(r)\\n smallest = None\\n for i in range(k):\\n smallest = heapq.heappop(r)\\n return smallest \",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n count = 0\\n n = len(matrix)\\n heap = [(matrix[y][0], 0, y) for y in range(n)]\\n\\n heapify(heap)\\n while True:\\n ans = heap[0]\\n count += 1\\n\\n if count == k:\\n return ans[0]\\n\\n no_longer = heappop(heap)\\n idx, y = no_longer[1], no_longer[2]\\n\\n if idx + 1 < n:\\n heappush(heap, (matrix[y][idx+1], idx+1, y))\\n \",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"from heapq import heappop, heappush\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n if not matrix or not matrix[0]:\\n return -1\\n\\n answer = [] #min_heap\\n n = len(matrix)\\n m = len(matrix[0])\\n \\n for i in range(n):\\n heappush(answer, (matrix[i][0], i, 0))\\n\\n while k > 0 and answer:\\n num, i, j = heappop(answer)\\n k -= 1\\n\\n if j + 1 < m:\\n heappush(answer, (matrix[i][j + 1], i, j + 1))\\n\\n return num\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n n = len(matrix)\\n for i in range(n):\\n heapq.heappush(heap, (matrix[i][0], i, 0))\\n \\n # [1, 10, 12]\\n i, kthElement = 0, 0\\n while heap and i < k:\\n element, row, col = heapq.heappop(heap)\\n if col < n-1:\\n heapq.heappush(heap, (matrix[row][col+1], row, col+1))\\n kthElement = element\\n i += 1\\n return kthElement\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"from heapq import heapify, heappush, heappop\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n heapify(heap)\\n\\n rows = len(matrix)\\n col = len(matrix[0])\\n\\n for r in range(rows):\\n heappush(heap, (matrix[r][0], r, 0))\\n\\n res = []\\n while heap:\\n value, r, c = heappop(heap)\\n res.append(value)\\n\\n if c+1 < col:\\n heappush(heap, (matrix[r][c+1], r, c+1))\\n \\n return res[k-1]\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n r = []\\n for i in matrix:\\n r = r+i\\n heapq.heapify(r)\\n smallest = None\\n for i in range(k):\\n smallest = heapq.heappop(r)\\n return smallest \",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n min_heap = []\\n\\n # Insert the first element of each row into the heap\\n for row in range(min(k, n)): # Only need to process up to the k-th row\\n heapq.heappush(min_heap, (matrix[row][0], row, 0))\\n\\n # Extract the minimum element from the heap k times\\n for _ in range(k - 1):\\n value, row, col = heapq.heappop(min_heap)\\n \\n # If there is a next element in the same row, insert it into the heap\\n if col + 1 < n:\\n heapq.heappush(min_heap, (matrix[row][col + 1], row, col + 1))\\n\\n # The root of the heap is now the k-th smallest element\\n return heapq.heappop(min_heap)[0]\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n seen = [[False]*n for i in range(n)]\\n seen[0][0] = True\\n curMins = [[matrix[0][0], 0, 0]]\\n\\n kth = -1\\n\\n for i in range(k):\\n kth, i, j = heapq.heappop(curMins)\\n if i+1 < n and not seen[i+1][j]:\\n heapq.heappush(curMins, [matrix[i+1][j], i+1, j])\\n seen[i+1][j] = True\\n if j+1 < n and not seen[i][j+1]:\\n heapq.heappush(curMins, [matrix[i][j+1], i, j+1])\\n seen[i][j+1] = True\\n \\n return kth\\n\\n\\n\\n\",\n \"runtime\": \"176\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n row, col = len(matrix), len(matrix[0])\\n if not row or not col: return -1\\n heap = []\\n for i in range(min(k, row)):\\n heappush(heap, (matrix[i][0], i, 0))\\n for i in range(k):\\n val, x, y = heappop(heap)\\n if i == k-1: return val\\n if y < col-1:\\n heappush(heap, (matrix[x][y+1], x, y+1))\\n return -1\\n \\\"\\\"\\\"\\n row, col = len(matrix), len(matrix[0])\\n if not row or not col: return -1\\n heap = []\\n for i in range(min(row, k)):\\n heapq.heappush(heap, (matrix[i][0], i, 0))\\n for i in range (k):\\n val, x, y = heapq.heappop(heap)\\n if i == k-1: return val\\n if y < col - 1:\\n heapq.heappush(heap, (matrix[x][y+1], x, y+1))\\n return -1 \\\"\\\"\\\"\\n \\\"\\\"\\\"\\n N, col = len(matrix), len(matrix[0])\\n def countLessThanOrEqual(num):\\n count = 0\\n for i in range(N):\\n if matrix[i][-1] <= num:\\n count += N\\n else:\\n lo = 0\\n hi = col-1\\n while lo < hi:\\n mid = lo + (hi-lo)//2\\n if matrix[i][mid] >= num:\\n hi = mid\\n else:\\n lo = mid + 1\\n count += lo\\n break\\n return count\\n\\n lo, hi = matrix[0][0], matrix[-1][-1]\\n while lo < hi:\\n mid = lo + (hi-lo)//2\\n\\n if countLessThanOrEqual(mid) >= k:\\n hi = mid\\n else:\\n lo = mid + 1\\n\\n return lo\\n \\\"\\\"\\\"\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n h = []\\n for i in range(min(len(matrix), k)):\\n heappush(h, [matrix[i][0], i, 0])\\n \\n res = 0\\n for _ in range(k):\\n res, i, j = heappop(h)\\n if j + 1 < len(matrix[i]):\\n heappush(h, [matrix[i][j + 1], i, j + 1])\\n return res\",\n \"runtime\": \"179\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n r = []\\n for i in matrix:\\n r = r+i\\n heapq.heapify(r)\\n smallest = None\\n for i in range(k):\\n smallest = heapq.heappop(r)\\n return smallest \",\n \"runtime\": \"182\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n new_m = []\\n for m in matrix:\\n new_m += m\\n \\n return heapq.nsmallest(k, new_m)[-1]\",\n \"runtime\": \"182\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n n = len(matrix)\\n \\n # Min-heap to track the smallest elements\\n frontier = [(matrix[0][0], 0, 0)]\\n visited = set((0, 0)) # Only track (i, j) indices\\n\\n # Keep extracting from the heap until we reach the k-th smallest\\n for _ in range(k - 1):\\n val, i, j = heapq.heappop(frontier)\\n\\n # Move to the next row if not visited\\n if i + 1 < n and (i + 1, j) not in visited:\\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n\\n # Move to the next column if not visited\\n if j + 1 < n and (i, j + 1) not in visited:\\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\\n\\n # The top of the heap is the k-th smallest\\n return heapq.heappop(frontier)[0]\\n\",\n \"runtime\": \"185\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n m, n = len(matrix), len(matrix[0])\\n heap = [(matrix[0][0], 0, 0)]\\n count = 0\\n seen = set()\\n while heap:\\n num, i, j = heappop(heap)\\n count += 1\\n if count == k: return num\\n for ii, jj in ( (i+1, j), (i, j+1) ):\\n if ii < m and jj < n and (ii, jj) not in seen:\\n seen.add((ii, jj))\\n heappush(heap, (matrix[ii][jj], ii, jj))\\n\",\n \"runtime\": \"185\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n res = []\\n visit = set()\\n m, n = len(matrix), len(matrix[0])\\n min_nums = [[matrix[0][0], 0, 0]]\\n visit.add((0, 0))\\n heapq.heapify(min_nums)\\n\\n while k > 0:\\n num, i, j = heappop(min_nums)\\n if (i+1) < m and (i+1, j) not in visit:\\n heappush(min_nums, [matrix[i+1][j], i+1, j])\\n visit.add((i+1, j))\\n if (j+1) < n and (i, j+1) not in visit:\\n heappush(min_nums, [matrix[i][j+1], i, j+1])\\n visit.add((i, j+1))\\n\\n k -= 1\\n return num\",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n m, n = len(matrix), len(matrix[0])\\n s = {(0, 0)}\\n minHeap = [(matrix[0][0], 0, 0)]\\n while k > 1:\\n ele, i, j = heappop(minHeap)\\n if j + 1 < n and (i, j+1) not in s:\\n s.add((i, j+1))\\n heappush(minHeap, (matrix[i][j+1], i, j+1))\\n if i + 1 < m and (i+1, j) not in s:\\n s.add((i+1, j))\\n heappush(minHeap, (matrix[i+1][j], i+1, j))\\n # print(ele, minHeap)\\n k -= 1\\n return minHeap[0][0]\\n\\n\\n \",\n \"runtime\": \"188\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n n = len(matrix)\\n \\n frontier = [(matrix[0][0], 0, 0)]\\n visited = set((0, 0))\\n\\n for _ in range(k - 1):\\n val, i, j = heapq.heappop(frontier)\\n\\n if i + 1 < n and (i + 1, j) not in visited:\\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n\\n if j + 1 < n and (i, j + 1) not in visited:\\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\\n\\n return heapq.heappop(frontier)[0]\\n\",\n \"runtime\": \"191\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n heapq.heappush(heap, (matrix[0][0], 0, 0))\\n n = len(matrix)\\n visited = set()\\n visited.add((0,0))\\n\\n while k > 0:\\n val, i, j = heapq.heappop(heap)\\n if i + 1 < n and (i + 1, j) not in visited:\\n heapq.heappush(heap, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n if j + 1 < n and (i, j + 1) not in visited:\\n heapq.heappush(heap, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\\n k -= 1\\n \\n return val\",\n \"runtime\": \"191\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList, SortedSet, SortedDict \\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n sorted_matrix = SortedList()\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n sorted_matrix.add(matrix[i][j])\\n \\n return sorted_matrix[k-1]\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n if k == 1:\\n return matrix[0][0]\\n\\n n = len(matrix)\\n\\n priority_queue = [(matrix[0][0], 0, 0)]\\n\\n heapq.heapify(priority_queue)\\n visited_cells = set()\\n\\n count = 0\\n\\n while priority_queue:\\n \\n val, i, j = heapq.heappop(priority_queue)\\n\\n count += 1\\n\\n if count == k:\\n return val\\n\\n if i+1 < n and (i+1,j) not in visited_cells:\\n heapq.heappush(priority_queue, (matrix[i+1][j], i+1, j))\\n visited_cells.add((i+1,j))\\n\\n if j+1 < n and (i,j+1) not in visited_cells:\\n heapq.heappush(priority_queue, (matrix[i][j+1], i, j+1))\\n visited_cells.add((i,j+1))\\n\\n\\n\\n def mySqrt(self, x: int) -> int:\\n if x <= 1:\\n return x\\n left = 1\\n right = x-1\\n while left < right:\\n middle = left + (right - left + 1) // 2\\n if middle * middle <= x:\\n left = middle\\n else:\\n right = middle - 1\\n return left\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n h = [(matrix[0][0], 0, 0)]\\n num_elems = 0\\n\\n while num_elems <= k:\\n val, r, c = heapq.heappop(h)\\n num_elems += 1\\n if num_elems == k:\\n return val\\n \\n if (r+1 < len(matrix)) and (matrix[r+1][c] != float('inf')):\\n heapq.heappush(h, (matrix[r+1][c], r+1, c))\\n matrix[r+1][c] = float('inf')\\n if (c+1 < len(matrix[0])) and (matrix[r][c+1] != float('inf')):\\n heapq.heappush(h, (matrix[r][c+1], r, c+1))\\n matrix[r][c+1] = float('inf')\\n\\n return -1\\n\\n\\n\\n\",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = [(matrix[0][0], 0, 0)]\\n visited = set()\\n if k == 1:\\n return matrix[0][0]\\n for i in range(0, k-1):\\n min_el = heapq.heappop(heap)\\n \\n x, y = min_el[1] + 1, min_el[2]\\n if x < len(matrix) and (x, y) not in visited:\\n heapq.heappush(heap, (matrix[x][y], x, y))\\n visited.add((x, y))\\n\\n x, y = min_el[1], min_el[2] + 1\\n if y < len(matrix) and (x, y) not in visited:\\n heapq.heappush(heap, (matrix[x][y], x, y))\\n visited.add((x, y))\\n\\n if len(heap) > 0:\\n min_el = heapq.heappop(heap)\\n return min_el[0]\\n else:\\n return 0\",\n \"runtime\": \"197\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n myHeap = [(matrix[0][0], (0, 0))]\\n seenLocs = set((0, 0))\\n curMinVal = matrix[0][0]\\n\\n while k > 0:\\n curMinVal, idxs = heapq.heappop(myHeap)\\n rowIdx = idxs[0]\\n colIdx = idxs[1]\\n if rowIdx < len(matrix) - 1 and (rowIdx+1, colIdx) not in seenLocs:\\n seenLocs.add((rowIdx+1, colIdx))\\n heapq.heappush(myHeap, (matrix[rowIdx+1][colIdx], (rowIdx+1, colIdx))) \\n if colIdx < len(matrix[0]) - 1 and (rowIdx, colIdx+1) not in seenLocs:\\n seenLocs.add((rowIdx, colIdx+1))\\n heapq.heappush(myHeap, (matrix[rowIdx][colIdx+1], (rowIdx, colIdx+1))) \\n k -= 1\\n\\n\\n return curMinVal\",\n \"runtime\": \"200\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n l = matrix[0][0]\\n r = matrix[-1][-1]\\n \\n while l < r:\\n num = (l + r) // 2\\n count = 0\\n \\n for i in range(len(matrix)):\\n j = 0\\n while j < len(matrix[0]) and matrix[i][j] <= num:\\n j += 1\\n count += j\\n \\n if count < k:\\n l = num + 1\\n else:\\n r = num\\n \\n return l\\n\\n \",\n \"runtime\": \"200\"\n },\n {\n \"code\": \"# My Binary Search (after seeing an example)\\nclass Solution:\\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n\\n n = len(matrix)\\n lo = matrix[0][0] # low\\n hi = matrix[n-1][n-1] # high\\n\\n while lo < hi:\\n mid = (lo + hi) // 2\\n nleq = 0 # number of elements less or equal to mid\\n \\n for i in range(n):\\n j = 0\\n while j < n:\\n if matrix[i][j] <= mid:\\n nleq += 1\\n j += 1\\n else:\\n break\\n\\n if nleq < k:\\n lo = mid + 1\\n else:\\n hi = mid\\n return lo\\n\\n\\n# My long solution (Sorted Queue)\\n# from collections import deque\\n# import math\\n\\n# class Solution:\\n# def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n \\n# n = len(matrix)\\n# q = deque() # queue\\n# ld = None # last diagonal added \\n# lass = None # last min assigned\\n# lminadd = -math.inf # last min added\\n# lmaxadd = math.inf # last max added\\n# lk = 0 # last 'k' processed\\n\\n# # Case 1\\n# if k <= math.ceil(n*n / 2):\\n \\n# while lk < k:\\n# lk += 1\\n# ld = (lk-1, 0)\\n# ldmin = math.inf # diagonal min\\n \\n# # adding a diagonal to queue\\n# for i in range(0, lk):\\n# for j in range(lk-1, -1, -1):\\n# if i <= n-1 and j <= n-1 and i+j == lk-1:\\n# el = matrix[i][j]\\n# q.append(el)\\n\\n# # keeping track\\n# if el < ldmin:\\n# ldmin = el\\n\\n# # sorting queue\\n# prev = 1\\n# while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n# prev += 1\\n \\n# # last min added (from last diagonal)\\n# lminadd = ldmin\\n\\n# # assigning values for 'lk'\\n# lass = q.popleft()\\n\\n# # shortcut to answer\\n# if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\\n# return q[k - lk - 1]\\n \\n# return lass\\n\\n# # Case 2\\n# if k > math.ceil(n*n / 2):\\n\\n# nk = n*n - k + 1 # new 'k' going backwards\\n \\n# while lk < nk:\\n# lk += 1\\n# ld = (n-lk, n-1)\\n# ldmax = -math.inf # diagonal max\\n \\n# # adding a diagonal to queue\\n# for i in range(n-lk, n):\\n# for j in range(n-1, n-lk-1, -1):\\n# if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\\n# el = matrix[i][j]\\n# q.append(el)\\n\\n# # keeping track\\n# if el > ldmax:\\n# ldmax = el\\n\\n# # sorting queue\\n# prev = 1\\n# while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\\n# q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n# prev += 1\\n \\n# # last max added (from last diagonal)\\n# lmaxadd = ldmax\\n\\n# # assigning values for 'lk'\\n# lass = q.popleft()\\n\\n# # jumping to answer\\n# if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\\n# return q[nk - lk - 1]\\n\\n# return lass\\n\\n\\n# Working simple non-efficient solution\\n# class Solution:\\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n# n = len(matrix[0])\\n# arr = []\\n# for i in range(n):\\n# for j in range(n):\\n# arr.append(matrix[i][j])\\n# arr.sort()\\n# return arr[k-1]\\n \",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n heapq.heappush(heap, (matrix[0][0], 0, 0))\\n n = len(matrix)\\n visited = set()\\n visited.add((0,0))\\n\\n while k > 0:\\n val, i, j = heapq.heappop(heap)\\n if i + 1 < n and (i + 1, j) not in visited:\\n heapq.heappush(heap, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n if j + 1 < n and (i, j + 1) not in visited:\\n heapq.heappush(heap, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\\n k -= 1\\n \\n return val\",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n pq = []\\n\\n n = len(matrix)\\n m = len(matrix[0])\\n\\n heapq.heappush(pq, (matrix[0][0], 0,0))\\n in_process = set()\\n in_process.add((0,0))\\n best = None\\n for i in range(k):\\n val, r, c = heapq.heappop(pq)\\n #print(f'val ={val} , r = {r}, c = {c}')\\n best = val\\n for R, C in [(r+1, c),(r,c+1)]:\\n if all([R < n, C < m]) and (R,C) not in in_process:\\n in_process.add((R,C))\\n heapq.heappush(pq, (matrix[R][C], R, C))\\n\\n return best\\n\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n N = len(matrix)\\n mx = matrix[-1][-1]\\n\\n q = [(matrix[0][0], 0, 0)]\\n ans = None\\n\\n dirs = [(0, 1), (1, 0)]\\n\\n while q and k > 0:\\n n, i, j = heapq.heappop(q)\\n\\n if n > mx:\\n break\\n\\n if matrix[i][j] == None:\\n continue\\n\\n matrix[i][j] = None\\n \\n ans = n\\n\\n for dx, dy in dirs:\\n x, y = dx + i, dy + j\\n\\n if x < N and y < N and matrix[x][y] != None:\\n heapq.heappush(q, (matrix[x][y], x, y))\\n\\n k -= 1\\n\\n return ans\\n\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n l = matrix[0][0]\\n r = matrix[len(matrix) - 1][len(matrix[0]) - 1]\\n while l < r:\\n num = (l + r) // 2\\n count = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] <= num:\\n count += 1\\n if count >= k:\\n r = num\\n else:\\n break\\n if count >= k:\\n r = num\\n break\\n if count < k:\\n l = num + 1\\n \\n return l\\n\\n \",\n \"runtime\": \"218\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n res = []\\n min_h = []\\n for i in range(len(matrix)):\\n heappush(min_h, (matrix[i][0], (i, 0)))\\n \\n while len(res) < k:\\n val, (i, j) = heappop(min_h)\\n print(val, (i, j))\\n res.append(val)\\n if j + 1 < len(matrix[0]):\\n heappush(min_h, (matrix[i][j + 1], (i, j + 1)))\\n return res[k - 1]\",\n \"runtime\": \"218\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Node:\\n\\tdef __init__(self, data, row, step):\\n\\t\\tself.data = data\\n\\t\\tself.row = row\\n\\t\\tself.step = step\\n\\t\\n\\tdef __lt__(self, other):\\n\\t\\treturn self.data < other.data\\n\\n\\ndef mergeKSortedArrays(kArrays, k:int):\\n\\t\\n\\tmin_heap = []\\n\\theapq.heapify(min_heap)\\n\\n\\t#first inserting all the front value of list[list]\\n\\tfor row in range(k):\\n\\t\\tif kArrays[row]:\\n\\t\\t\\theapq.heappush(min_heap, Node(kArrays[row][0], row, 0))\\n\\t\\n\\t# now pick minimum and insert the new node in heap\\n\\tans = []\\n\\twhile min_heap:\\n\\t\\ttemp = heapq.heappop(min_heap)\\n\\t\\tdata, row, step = temp.data, temp.row, temp.step\\n\\n\\t\\tans.append(data)\\n\\n\\t\\tif (step+1) < len(kArrays[row]):\\n\\t\\t\\theapq.heappush(min_heap, Node(kArrays[row][step+1], row, step+1))\\n\\n\\treturn ans\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n arr = mergeKSortedArrays(matrix, len(matrix))\\n return arr[k-1]\",\n \"runtime\": \"221\"\n },\n {\n \"code\": \"from collections import defaultdict\\nimport heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # We can utilize Dijkstra's.\\n\\n def neighbors(i, j):\\n neighbors = []\\n\\n for di, dj in ((0, 1), (0, -1), (1, 0), (-1, 0)):\\n ni, nj = i + di, j + dj\\n if 0 <= ni < n and 0 <= nj < n and matrix[i][j] <= matrix[ni][nj]:\\n neighbors.append((ni, nj))\\n \\n return neighbors\\n\\n n = len(matrix)\\n count = 0\\n queue = [(matrix[0][0], 0, 0)]\\n seen = {(0, 0)}\\n \\n while queue or count <= k:\\n val, i, j = heapq.heappop(queue)\\n count += 1\\n\\n if count == k:\\n return val\\n \\n for ni, nj in neighbors(i, j):\\n if (ni, nj) not in seen:\\n heapq.heappush(queue, (matrix[ni][nj], ni, nj))\\n seen.add((ni, nj))\\n \\n return count\\n\\n \\n \",\n \"runtime\": \"221\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n visited = set()\\n\\n n = len(matrix)\\n heap = [(matrix[0][0], 0, 0)]\\n \\n answer = []\\n while heap:\\n\\n val, a, b = heapq.heappop(heap)\\n if (a,b) in visited: continue\\n visited.add((a,b))\\n\\n answer.append(val)\\n if len(answer) == k: return answer[-1]\\n\\n\\n if a < n-1:\\n if (a+1,b) not in visited:\\n heapq.heappush(heap, (matrix[a+1][b], a+1, b))\\n\\n if b < n-1:\\n if (a, b+1) not in visited:\\n heapq.heappush(heap, (matrix[a][b+1], a, b+1))\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n # # h = []\\n # # for i in range(len(matrix)):\\n # # for j in range(len(matrix[0])):\\n # # heapq.heappush(h, matrix[i][j])\\n \\n # # while k > 0:\\n # # elem = heapq.heappop(h)\\n # # k-=1\\n # # return elem\\n \\n # def soln1(k):\\n # arr = []\\n\\n # for r in range(min(k, len(matrix))):\\n # arr.append((matrix[r][0], r,0))\\n # heapq.heapify(arr)\\n\\n # while k:\\n \\n # elem, r, c = heapq.heappop(arr)\\n # if c < (len(matrix)-1):\\n # heapq.heappush(arr, (matrix[r][c+1],r,c+1))\\n # k-=1\\n # return elem\\n\\n # return soln1(k)\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n visited = set()\\n\\n n = len(matrix)\\n heap = [(matrix[0][0], 0, 0)]\\n \\n answer = []\\n while heap:\\n\\n val, a, b = heapq.heappop(heap)\\n if (a,b) in visited: continue\\n visited.add((a,b))\\n\\n answer.append(val)\\n if len(answer) == k: return answer[-1]\\n\\n\\n if a < n-1:\\n heapq.heappush(heap, (matrix[a+1][b], a+1, b))\\n\\n if b < n-1:\\n heapq.heappush(heap, (matrix[a][b+1], a, b+1))\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n # # h = []\\n # # for i in range(len(matrix)):\\n # # for j in range(len(matrix[0])):\\n # # heapq.heappush(h, matrix[i][j])\\n \\n # # while k > 0:\\n # # elem = heapq.heappop(h)\\n # # k-=1\\n # # return elem\\n \\n # def soln1(k):\\n # arr = []\\n\\n # for r in range(min(k, len(matrix))):\\n # arr.append((matrix[r][0], r,0))\\n # heapq.heapify(arr)\\n\\n # while k:\\n \\n # elem, r, c = heapq.heappop(arr)\\n # if c < (len(matrix)-1):\\n # heapq.heappush(arr, (matrix[r][c+1],r,c+1))\\n # k-=1\\n # return elem\\n\\n # return soln1(k)\",\n \"runtime\": \"224\"\n },\n {\n \"code\": \"class Solution:\\n \\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def is_smaller(m):\\n count =0\\n count_2 = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] < m:\\n count += 1\\n if matrix[i][j] <= m:\\n count_2 += 1\\n return count+1, count_2\\n l, r = matrix[0][0], matrix[-1][-1]\\n \\n while l<=r:\\n m = (l+r)//2\\n count, count_2 = is_smaller(m)\\n if count <= k <= count_2:\\n return m\\n elif count_2 < k:\\n l = m+1\\n else:\\n r = m-1\\n\\n return l\\n\\n\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n import numpy as np\\n if k==1 :\\n return matrix[0][0]\\n \\n rows = len(matrix)\\n cols = len(matrix[0])\\n if rows ==1 and cols ==1:\\n return matrix[0][0]\\n mat =np.array(matrix).flatten()\\n mat .sort()\\n return mat[k-1]\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n import numpy as np\\n arr = np.array(matrix)\\n new = arr.reshape(-1)\\n new.sort()\\n return new[k-1]\\n \",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n \\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def is_smaller(m):\\n count =0\\n count_2 = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] < m:\\n count += 1\\n if matrix[i][j] <= m:\\n count_2 += 1\\n return count+1, count_2\\n l, r = matrix[0][0], matrix[-1][-1]\\n \\n while l<=r:\\n m = (l+r)//2\\n count, count_2 = is_smaller(m)\\n if count <= k <= count_2:\\n return m\\n elif count_2 < k:\\n l = m+1\\n else:\\n r = m-1\\n\\n return l\\n\\n\",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n \\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def is_smaller(m):\\n count =0\\n count_2 = 0\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] < m:\\n count += 1\\n if matrix[i][j] <= m:\\n count_2 += 1\\n return count+1, count_2\\n l, r = matrix[0][0], matrix[-1][-1]\\n \\n while l<=r:\\n m = (l+r)//2\\n count, count_2 = is_smaller(m)\\n print(m, count, count_2)\\n if count <= k <= count_2:\\n return m\\n elif count_2 < k:\\n l = m+1\\n else:\\n r = m-1\\n print(l)\\n return l\\n\\n\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution: \\n # moving row by row\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n candidates = [(matrix[0][c], 0, c) for c in range(n)]\\n heapq.heapify(candidates)\\n visited_rows = {0}\\n \\n for _ in range(k):\\n v, row, col = heapq.heappop(candidates)\\n print(v, row, col)\\n if row+1<n and not row+1 in visited_rows:\\n visited_rows.add(row+1)\\n for c in range(n):\\n heapq.heappush(candidates, (matrix[row+1][c], row+1, c))\\n \\n return v\\n \\n # moving element by element:\\n def kthSmallest0(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n row, col = 0, 0\\n candidates = [(matrix[row][col], row, col)]\\n visited_cels = set((0,0))\\n for _ in range(k):\\n v, row, col = heapq.heappop(candidates)\\n #print(row, col, v)\\n for (r,c) in [(0,1), (1,0)]:\\n if row+r<n and col+c<n and not (row+r,col+c) in visited_cels:\\n heapq.heappush(candidates, (matrix[row+r][col+c], row+r, col+c))\\n visited_cels.add((row+r,col+c))\\n return v\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n row, col = 0, 0\\n candidates = [(matrix[row][col], row, col)]\\n visited_cels = set(\\\"0-0\\\")\\n for _ in range(k):\\n v, row, col = heapq.heappop(candidates)\\n #print(row, col, v)\\n for (r,c) in [(0,1), (1,0)]:\\n if 0<=row+r<n and 0<=col+c<n:\\n new_candidate = (matrix[row+r][col+c], row+r, col+c)\\n if not \\\"{}-{}\\\".format(row+r,col+c) in visited_cels:\\n heapq.heappush(candidates, new_candidate)\\n visited_cels.add(\\\"{}-{}\\\".format(row+r,col+c))\\n return v\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n # 0,0 is guaranteed to be the smallest element\\n # from there, we can go to 0,1 or 1,0 -- these are guaranteed to be the next smallest\\n # it depends which ever value is greater\\n # add the \\\"next\\\" potential values to a heap, going to the smaller index\\n # once we have visited the kth value, return that\\n # within our heap, keep track of [value, row, col]\\n # 1 -> 5 -> 9 -> 10 -> 11 -> 12 -> 13 -> 13\\n \\n heap = [[matrix[0][0], 0, 0]]\\n n = len(matrix)\\n dirs = [(1, 0), (0, 1)]\\n count = 0\\n visited = set()\\n\\n while heap:\\n value, row, col = heapq.heappop(heap)\\n\\n if (row, col) not in visited:\\n count += 1\\n visited.add((row, col))\\n\\n if count == k:\\n return value\\n \\n for r, c in dirs:\\n if 0 <= row + r < n and 0 <= col + c < n and (row + r, col + c) not in visited:\\n heapq.heappush(heap, [matrix[row + r][col + c], row + r, col + c])\\n \\n \\n\\n\\n \",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n # 0,0 is guaranteed to be the smallest element\\n # from there, we can go to 0,1 or 1,0 -- these are guaranteed to be the next smallest\\n # it depends which ever value is greater\\n # add the \\\"next\\\" potential values to a heap, going to the smaller index\\n # once we have visited the kth value, return that\\n # within our heap, keep track of [value, row, col]\\n # 1 -> 5 -> 9 -> 10 -> 11 -> 12 -> 13 -> 13\\n \\n heap = [[matrix[0][0], 0, 0]]\\n n = len(matrix)\\n dirs = [(1, 0), (0, 1)]\\n count = 0\\n visited = set()\\n\\n while heap:\\n value, row, col = heapq.heappop(heap)\\n\\n if (row, col) not in visited:\\n count += 1\\n visited.add((row, col))\\n\\n if count == k:\\n return value\\n \\n for r, c in dirs:\\n if 0 <= row + r < n and 0 <= col + c < n:\\n heapq.heappush(heap, [matrix[row + r][col + c], row + r, col + c])\\n \\n \\n\\n\\n \",\n \"runtime\": \"239\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = list()\\n for index, row in enumerate(matrix):\\n heapq.heappush(heap, (row[0], index))\\n matrix[index] = matrix[index][1:]\\n _min = 0\\n print(heap)\\n while k:\\n _min, index = heapq.heappop(heap)\\n print(k, _min, index)\\n if len(matrix[index]) > 0:\\n heapq.heappush(heap, (matrix[index][0], index))\\n matrix[index] = matrix[index][1:]\\n k -= 1\\n return _min\\n \",\n \"runtime\": \"242\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, mat: List[List[int]], k: int) -> int:\\n n, m = len(mat), len(mat[0])\\n def safe(i, j):\\n if i < n and j < m and j > -1 and i > -1 and mat[i][j] != 'a':\\n return True\\n\\n q = [(mat[0][0], 0, 0)]\\n mat[0][0] = 'a'\\n for i in range(k):\\n v, i, j = heappop(q)\\n for x, y in [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]:\\n x, y = x + i, y + j\\n if safe(x, y):\\n heappush(q, (mat[x][y], x, y))\\n mat[x][y] = 'a'\\n\\n return v\",\n \"runtime\": \"242\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n temp_arr=[]\\n for i in matrix:\\n temp_arr.extend(i)\\n temp_arr.sort()\\n return temp_arr[k-1]\\n \",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n hplist = []\\n\\n heapq.heapify(hplist)\\n heapq.heappush(hplist, [matrix[0][0], (0,0)])\\n count = 1\\n visited = set()\\n visited.add((0,0))\\n\\n def valid(index):\\n x,y = index[0], index[1]\\n if(x <0 or y<0 or x== len(matrix) or y == len(matrix[0]) or (x,y) in visited):\\n return False\\n return True\\n \\n while(hplist):\\n top = heapq.heappop(hplist)\\n print(top)\\n if(count == k):\\n return top[0]\\n index = top[1]\\n right = [index[0], index[1]+1]\\n down = [index[0]+1, index[1]]\\n if(valid(right)):\\n visited.add((right[0], right[1]))\\n heapq.heappush(hplist, [matrix[right[0]][right[1]], (right[0], right[1])])\\n if(valid(down)):\\n visited.add((down[0], down[1]))\\n heapq.heappush(hplist, [matrix[down[0]][down[1]], (down[0], down[1])])\\n count +=1\\n \\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"248\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n q = PriorityQueue()\\n\\n n = len(matrix)\\n for i in range(n):\\n q.put((matrix[i][0], i, 0))\\n \\n res = None\\n for _ in range(k):\\n values = q.get()\\n res = values[0]\\n i, j = values[1], values[2]\\n if j + 1 < n:\\n q.put((matrix[i][j+1], i, j+ 1))\\n return res\\n\\n \",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"import queue\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n Q = queue.PriorityQueue()\\n\\n n = len(matrix)\\n\\n for i in range(min(n,k)):\\n Q.put((matrix[i][0], i, 0))\\n \\n e = None\\n while k:\\n e, r, c = Q.get()\\n\\n if c<n-1:\\n Q.put((matrix[r][c+1], r, c+1))\\n k-=1\\n \\n return e\\n\\n\\n \",\n \"runtime\": \"251\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def get(seq, indices):\\n for index in indices:\\n seq = seq[index]\\n return seq\\n \\n\\n if not matrix or not matrix[0]:\\n return 0\\n\\n n = len(matrix)\\n \\n mins = []\\n frontier = [(matrix[0][0], 0, 0)]\\n visited = set()\\n\\n while len(mins) < k and frontier:\\n node = heapq.heappop(frontier)\\n val, i, j = node\\n if node in visited:\\n continue\\n \\n mins.append(node)\\n visited.add(node)\\n\\n n1 = (i + 1, j)\\n n2 = (i, j + 1)\\n\\n if i + 1 >= n and j + 1 >= n:\\n continue\\n elif i + 1 >= n:\\n heapq.heappush(frontier, (get(matrix, n2), *n2))\\n continue\\n elif j + 1 >= n:\\n heapq.heappush(frontier, (get(matrix, n1), *n1))\\n continue\\n \\n heapq.heappush(frontier, (get(matrix, n1), *n1))\\n heapq.heappush(frontier, (get(matrix, n2), *n2))\\n\\n print(mins)\\n kthNode = mins[-1]\\n value, i, j = kthNode\\n return value\",\n \"runtime\": \"254\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"254\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1] \",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n x=[]\\n for i in matrix:\\n for j in i:\\n x.append(j)\\n x=sorted(x)\\n return x[k-1]\\n \",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n matrix = np.array(matrix).flatten()\\n return np.sort(matrix)[k - 1]\",\n \"runtime\": \"260\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n h = []\\n heapq.heappush(h, (matrix[0][0], 0,0))\\n visited = set()\\n while h:\\n top, x, y = heapq.heappop(h)\\n if (x,y) in visited:\\n continue\\n visited.add((x,y))\\n print(f\\\"{k}, {top}\\\")\\n if k == 1:\\n return top\\n if x+1 < len(matrix):\\n heapq.heappush(h, (matrix[x+1][y], x+1,y))\\n if y+1 < len(matrix[0]):\\n heapq.heappush(h, (matrix[x][y+1], x,y+1))\\n k -= 1 \\n return -1\\n \",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"import queue\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n Q = queue.PriorityQueue()\\n\\n n = len(matrix)\\n\\n for i in range(n):\\n for j in range(n):\\n Q.put(-matrix[i][j])\\n if Q.qsize()>k:\\n Q.get()\\n \\n return -Q.queue[0]\\n\\n\\n \",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"from heapq import *\\nfrom queue import PriorityQueue\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n R = len(matrix)\\n C = R\\n\\n Q = PriorityQueue()\\n for r in range(R):\\n Q.put((matrix[r][0],(r,0)))\\n\\n i = 0\\n #print(Q)\\n while(i < k):\\n num , (r,c) = Q.get() \\n #print(num,r,c)\\n if c < C-1:\\n Q.put((matrix[r][c+1],(r,c+1)))\\n #else:\\n # Q.put((matrix[r+1][c],(r+1,c)))\\n \\n i+=1\\n \\n return num\\n\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n\\n def quick_sort(nums):\\n if len(nums) < 2:\\n return nums\\n\\n pivot = nums.pop(len(nums) // 2)\\n left = [ x for x in nums if x <= pivot ]\\n right = [ x for x in nums if x > pivot ]\\n return quick_sort(left) + [pivot] + quick_sort(right)\\n\\n\\n res = sum(matrix, [])\\n\\n res = quick_sort(res)\\n\\n return res[k - 1]\\n\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\n\\nclass Solution:\\n\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # store the object(matrix[i][j], i, j)\\n pq = PriorityQueue()\\n\\n # initialize it, put first element into it\\n for i in range(len(matrix)):\\n pq.put((matrix[i][0], i, 0))\\n\\n res = -1\\n while pq and k > 0:\\n cur = pq.get()\\n res = cur[0]\\n k -= 1\\n\\n i, j = cur[1], cur[2]\\n if j + 1 < len(matrix[i]):\\n pq.put((matrix[i][j + 1], i, j + 1))\\n \\n return res\",\n \"runtime\": \"269\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n l=[]\\n for r in matrix:\\n l += r\\n l.sort()\\n return l[k-1]\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"import queue\\nclass Solution:\\n # approach 1: easy solution would be to flatten the list, sort it, and\\n # return the kth. O(n + nlogn) = O(nlogn).\\n # approach 2: instead of sorting, do a sort of uniform cost BFS where\\n # you maintain a frontier of next elements (priority queue), pull out first k,\\n # return kth. Guarantee is that cells increase monotonically by increasing\\n # row and column index. When inserting into the queue, how to detect duplicates?\\n # Could use a n^2 flag matrix\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n q = queue.PriorityQueue()\\n n = len(matrix)\\n for i in range(n):\\n q.put((matrix[i][0], (i, 0)))\\n out = []\\n for i in range(k):\\n val, coord = q.get()\\n out.append(val)\\n r, c = coord\\n if c < n-1:\\n q.put((matrix[r][c+1], (r, c+1)))\\n return out[k-1]\",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n q=PriorityQueue()\\n n=len(matrix)\\n m=len(matrix[0])\\n for i in range(n):\\n for j in range(m):\\n q.put(matrix[i][j])\\n l=0\\n for i in range(k):\\n l=q.get()\\n return l\\n\\n \\n \",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"import numpy as np\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n mat=np.array(matrix).flatten()\\n mat.sort()\\n return mat[k-1]\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n=len(matrix)\\n x=min(n,k+1)\\n if x<n: self.array= matrix[:x]\\n else:self.array=matrix\\n\\n self.heap=[(row[0],i,0) for i,row in enumerate(self.array)]\\n self.heapify()\\n return self.findKsmallest(k,0)\\n \\n def heapify(self):\\n length=len(self.heap)\\n if length//2==0: mid=length//2\\n else: mid=(length+1)//2\\n for i in range(length-1-mid,-1,-1):\\n ind1=2*i+1\\n ind2=2*i+2\\n self.bubbledown(i,ind1,ind2,length)\\n return\\n \\n \\n def swap(self,index_i,index_one):\\n tmp=self.heap[index_one]\\n self.heap[index_one]=self.heap[index_i]\\n self.heap[index_i]=tmp\\n return\\n \\n def bubbledown(self,i,ind1,ind2,length):\\n while (ind1<length):\\n if ind2<length and self.heap[ind2][0]<self.heap[ind1][0]:\\n if self.heap[ind2][0]<self.heap[i][0]:\\n self.swap(i,ind2)\\n i=ind2\\n else:break\\n else:\\n if self.heap[ind1][0]<self.heap[i][0]:\\n self.swap(i,ind1)\\n i=ind1\\n else: break\\n ind1=2*i+1\\n ind2=2*i+2\\n return\\n \\n def findKsmallest(self,k,count):\\n item=self.heap[0]\\n count+=1\\n if count==k: return item[0]\\n else:\\n if item[2]+1<len(self.array[0]):self.heap.append((self.array[item[1]][item[2]+1],item[1],item[2]+1))\\n self.swap(0,len(self.heap)-1)\\n _=self.heap.pop()\\n self.bubbledown(0,1,2,len(self.heap))\\n return self.findKsmallest(k,count)\\n\\n\\n \\n\\n\\n \",\n \"runtime\": \"281\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":125,"string":"125"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n left, right = matrix[0][0], matrix[n - 1][n - 1]\n\n while left < right:\n mid = left + (right - left) // 2\n if self.countSmall(matrix, mid) < k:\n left = mid + 1\n else:\n right = mid\n\n return left\n\n def countSmall(self, matrix: List[List[int]], target: int) -> int:\n n = len(matrix)\n count = 0\n for row in matrix:\n left, right = 0, n\n while left < right:\n mid = left + (right - left) // 2\n if row[mid] <= target:\n left = mid + 1\n else:\n right = mid\n count += left\n return count\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(Solution().kthSmallest(nums, next(inputs)),file=f)\nexit(0)","memory":"18900"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n ROWS = len(matrix)\n COLS = len(matrix[0])\n \n def countLessEqual(mid):\n r = ROWS - 1\n c = 0\n count = 0 \n\n while r >= 0 and c < COLS:\n if matrix[r][c] > mid:\n r -= 1\n else:\n count += r+1\n c += 1\n return count\n \n l = matrix[0][0]\n r = matrix[ROWS-1][COLS-1]\n\n while l <= r:\n mid = l + (r-l)//2\n if countLessEqual(mid) < k:\n l = mid + 1\n else:\n r = mid - 1\n return l","memory":"20800"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n res=[]\n for row in matrix:\n for col in row:\n res.append(col)\n res.sort()\n return res[k-1]","memory":"20900"},{"code":"class Solution:\n #https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/solutions/1322101/c-java-python-maxheap-minheap-binary-search-picture-explain-clean-concise/\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n, m = len(matrix), len(matrix[0])\n heap = [(matrix[0][j], 0, j) for j in range(m)]\n heapq.heapify(heap)\n while k > 0:\n result, i, j = heapq.heappop(heap)\n if i + 1 < n:\n heapq.heappush(heap, (matrix[i+1][j], i+1, j))\n k -=1\n return result\n \n ","memory":"21000"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n def count_less_or_equal(val):\n count = 0\n n = len(matrix)\n i = n - 1\n j = 0 \n while i >= 0 and j < n:\n if matrix[i][j] <= val:\n count += i + 1\n j += 1\n else:\n i -= 1\n return count\n\n\n left = matrix[0][0]\n right = matrix[-1][-1]\n\n while left <= right:\n mid = (left + right) // 2\n if count_less_or_equal(mid) >= k:\n right = mid - 1\n else:\n left = mid + 1\n return left","memory":"21000"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n k -= 1\n \n s = []\n for row in matrix:\n s += row\n \n s.sort()\n return s[k]","memory":"21100"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n low, high = matrix[0][0], matrix[n-1][n-1]\n\n def countLessEqual(mid):\n count, row, col = 0, n-1, 0\n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += row + 1\n col += 1\n else:\n row -= 1\n return count\n\n while low < high:\n mid = (low + high) // 2\n if countLessEqual(mid) < k:\n low = mid + 1\n else:\n high = mid\n return low\n ","memory":"21100"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n \n # Helper function to count how many numbers are ≤ mid in the matrix\n def count_less_equal(mid):\n count = 0\n row, col = n - 1, 0 # Start from the bottom-left corner\n \n while row >= 0 and col < n:\n if matrix[row][col] <= mid:\n count += (row + 1) # All elements in this column up to 'row' are ≤ mid\n col += 1 # Move right\n else:\n row -= 1 # Move up\n \n return count\n\n # Binary search on the value range\n left, right = matrix[0][0], matrix[n - 1][n - 1]\n \n while left < right:\n mid = (left + right) // 2\n if count_less_equal(mid) < k:\n left = mid + 1 # We need a larger number\n else:\n right = mid # We need a smaller number or exactly mid\n \n return left","memory":"21200"},{"code":"import bisect\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n=len(matrix)\n low,high=matrix[0][0],matrix[n-1][n-1]\n ans=0\n while low<=high:\n mid=(low+high)>>1\n smallerElements=0\n for i in matrix:\n smallerElements+=bisect.bisect(i,mid)\n if smallerElements<k:\n low=mid+1\n else:\n ans=mid\n high=mid-1\n return ans\n\n\n\n\n ","memory":"21200"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n rows = len(matrix[0])\n cols = len(matrix)\n \n left = matrix[0][0]\n right = matrix[cols-1][rows-1]\n k-=1\n\n def find_elements_less_than_mid(target):\n total = 0\n \n for i in range(len(matrix)):\n arr = matrix[i]\n \n left = 0\n right = len(matrix[0])-1\n count = 0\n \n while left <= right:\n mid = (left + right) // 2\n if arr[mid] <= target:\n left = mid + 1\n else:\n right = mid - 1\n \n total += left\n \n return total\n \n while left <= right:\n mid = (left + right) // 2\n \n elements_less_than_mid = find_elements_less_than_mid(mid)\n \n if elements_less_than_mid <= k:\n left = mid + 1\n else:\n right = mid - 1\n \n \n return left\n\n\n \n\n \n","memory":"21300"},{"code":"from collections import deque\nimport math\n\nclass Solution:\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n \n n = len(matrix)\n # print(f'n={n} k={k}')\n q = deque() # queue\n ld = None # last diagonal added \n lass = None # last min assigned\n lminadd = -math.inf # last min added\n lmaxadd = math.inf # last max added\n lk = 0 # last 'k' processed\n\n # Case 1\n if k <= math.ceil(n*n / 2):\n \n while lk < k:\n lk += 1\n ld = (lk-1, 0)\n # print(f'lk={lk} ld={ld}')\n ldmin = math.inf # diagonal min\n \n # adding a diagonal to queue\n for i in range(0, lk):\n for j in range(lk-1, -1, -1):\n if i <= n-1 and j <= n-1 and i+j == lk-1:\n # print(f'i={i} j={j}')\n el = matrix[i][j]\n q.append(el)\n\n # keeping track\n if el < ldmin:\n ldmin = el\n\n # sorting queue\n prev = 1\n while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n prev += 1\n # print(f'q={q}')\n \n # last min added (from last diagonal)\n lminadd = ldmin\n # print(f'lminadd={lminadd}')\n\n # assigning values for 'lk'\n lass = q.popleft()\n # print(f'lk={lk} lass={lass}')\n # print(f'q={q}')\n\n # shortcut to answer\n if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\n return q[k - lk - 1]\n \n return lass\n\n # Case 2\n if k > math.ceil(n*n / 2):\n\n nk = n*n - k + 1 # new 'k' going backwards\n \n while lk < nk:\n lk += 1\n ld = (n-lk, n-1)\n # print(f'lk={lk} ld={ld}')\n ldmax = -math.inf # diagonal max\n \n # adding a diagonal to queue\n for i in range(n-lk, n):\n for j in range(n-1, n-lk-1, -1):\n if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\n # print(f'i={i} j={j}')\n el = matrix[i][j]\n q.append(el)\n\n # keeping track\n if el > ldmax:\n ldmax = el\n\n # sorting queue\n prev = 1\n while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n prev += 1\n # print(f'q={q}')\n \n # last max added (from last diagonal)\n lmaxadd = ldmax\n # print(f'lmaxadd={lmaxadd}')\n\n # assigning values for 'lk'\n lass = q.popleft()\n # print(f'lk={lk} nk={n*n-lk+1} lass={lass}')\n # print(f'q={q}')\n\n # jumping to answer\n if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\n return q[nk - lk - 1]\n\n return lass\n\n\n# Working simple non-efficient solution\n# class Solution:\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n# n = len(matrix[0])\n# arr = []\n# for i in range(n):\n# for j in range(n):\n# arr.append(matrix[i][j])\n# arr.sort()\n# return arr[k-1]\n ","memory":"21300"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n matrixSize = len(matrix) * len(matrix)\n flattenedHeap = matrix[0]\n result = 0\n\n for i in range(1, len(matrix)):\n flattenedHeap.extend(matrix[i])\n \n heapq.heapify(flattenedHeap)\n\n while flattenedHeap and k > 0:\n result = heapq.heappop(flattenedHeap)\n k -= 1\n \n return result\n\n","memory":"21400"},{"code":"from collections import deque\nimport math\n\nclass Solution:\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\n \n n = len(matrix)\n # print(f'n={n} k={k}')\n q = deque() # queue\n ld = None # last diagonal added \n lass = None # last min assigned\n lminadd = -math.inf # last min added\n lmaxadd = math.inf # last max added\n lk = 0 # last 'k' processed\n\n # Case 1\n if k <= math.ceil(n*n / 2):\n \n while lk < k:\n lk += 1\n ld = (lk-1, 0)\n # print(f'lk={lk} ld={ld}')\n ldmin = math.inf # diagonal min\n \n # adding a diagonal to queue\n for i in range(0, lk):\n for j in range(lk-1, -1, -1):\n if i <= n-1 and j <= n-1 and i+j == lk-1:\n # print(f'i={i} j={j}')\n el = matrix[i][j]\n q.append(el)\n\n # keeping track\n if el < ldmin:\n ldmin = el\n\n # sorting queue\n prev = 1\n while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n prev += 1\n # print(f'q={q}')\n \n # last min added (from last diagonal)\n lminadd = ldmin\n # print(f'lminadd={lminadd}')\n\n # assigning values for 'lk'\n lass = q.popleft()\n # print(f'lk={lk} lass={lass}')\n # print(f'q={q}')\n\n # shortcut to answer\n if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\n return q[k - lk - 1]\n \n return lass\n\n # Case 2\n if k > math.ceil(n*n / 2):\n\n nk = n*n - k + 1 # new 'k' going backwards\n \n while lk < nk:\n lk += 1\n ld = (n-lk, n-1)\n # print(f'lk={lk} ld={ld}')\n ldmax = -math.inf # diagonal max\n \n # adding a diagonal to queue\n for i in range(n-lk, n):\n for j in range(n-1, n-lk-1, -1):\n if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\n # print(f'i={i} j={j}')\n el = matrix[i][j]\n q.append(el)\n\n # keeping track\n if el > ldmax:\n ldmax = el\n\n # sorting queue\n prev = 1\n while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\n prev += 1\n # print(f'q={q}')\n \n # last max added (from last diagonal)\n lmaxadd = ldmax\n # print(f'lmaxadd={lmaxadd}')\n\n # assigning values for 'lk'\n lass = q.popleft()\n # print(f'lk={lk} nk={n*n-lk+1} lass={lass}')\n # print(f'q={q}')\n\n # jumping to answer\n if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\n return q[nk - lk - 1]\n\n return lass\n\n\n# Working simple non-efficient solution\n# class Solution:\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n# n = len(matrix[0])\n# arr = []\n# for i in range(n):\n# for j in range(n):\n# arr.append(matrix[i][j])\n# arr.sort()\n# return arr[k-1]\n ","memory":"21400"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n l = [i for j in matrix for i in j]\n l = sorted(l)\n return l[k-1]","memory":"21500"},{"code":"from queue import PriorityQueue\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n pq = PriorityQueue()\n for r in range(len(matrix)):\n for c in range(len(matrix[0])):\n pq.put(matrix[r][c])\n \n for _ in range(k-1):\n pq.get()\n return pq.get()","memory":"21600"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # Input: matrix, sorted, and k\n # Output: kth smallest element in matrix\n\n # (0) Set-up\n heap = []\n # (1) Iterate\n for row in matrix:\n for val in row:\n heap.append(-val)\n heapq.heapify(heap)\n while len(heap) > k:\n heapq.heappop(heap)\n # (2) Result\n return -heap[0]\n ","memory":"21700"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n nums = list() \n \n for i in range(len(matrix)): \n nums += matrix[i]\n\n heapify(nums)\n\n print(nums)\n while nums and k > 1: \n heappop(nums)\n k -= 1 \n\n print(nums)\n \n\n return heappop(nums)","memory":"21800"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n hp = [] # This will act as a max-heap by using negative numbers\n l = []\n row = len(matrix)\n col = len(matrix[0])\n \n # Flatten the matrix into a list\n for r in range(row):\n for c in range(col):\n number = matrix[r][c]\n l.append(number)\n \n # Push elements into the max-heap (simulated using negative numbers)\n for num in l: \n heapq.heappush(hp, -num) # Push the negative of the number\n if len(hp) > k:\n heapq.heappop(hp) # Remove the smallest (most negative) element\n newhp = [-n for n in hp]\n if len(newhp) == k:\n return heapq.heappop(newhp)\n\n","memory":"22300"},{"code":"class Solution: \n # moving row by row\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n candidates = [(matrix[0][c], 0, c) for c in range(n)]\n heapq.heapify(candidates)\n visited_rows = {0}\n \n for _ in range(k):\n v, row, col = heapq.heappop(candidates)\n print(v, row, col)\n if row+1<n and not row+1 in visited_rows:\n visited_rows.add(row+1)\n for c in range(n):\n heapq.heappush(candidates, (matrix[row+1][c], row+1, c))\n \n return v\n \n # moving element by element:\n def kthSmallest0(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n row, col = 0, 0\n candidates = [(matrix[row][col], row, col)]\n visited_cels = set((0,0))\n for _ in range(k):\n v, row, col = heapq.heappop(candidates)\n #print(row, col, v)\n for (r,c) in [(0,1), (1,0)]:\n if row+r<n and col+c<n and not (row+r,col+c) in visited_cels:\n heapq.heappush(candidates, (matrix[row+r][col+c], row+r, col+c))\n visited_cels.add((row+r,col+c))\n return v","memory":"22500"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # max heapsort\n n = len(matrix)\n def heapify(i, size):\n largest = i\n l = 2 * i + 1\n r = 2 * i + 2\n # print('before', matrix[largest // n][largest % n])\n # if i == 3:\n # print(matrix[l // n][l % n], matrix[r // n][r % n])\n # print(size)\n if l < size and matrix[l // n][l % n] > matrix[largest // n][largest % n]:\n largest = l\n # r might be larger than l\n if r < size and matrix[r // n][r % n] > matrix[largest // n][largest % n]:\n largest = r\n # print('after', matrix[largest // n][largest % n])\n if largest != i:\n matrix[i // n][i % n], matrix[largest // n][largest % n] = matrix[largest // n][largest % n], matrix[i // n][i % n] # swap\n heapify(largest, size)\n\n for i in range((n ** 2 // 2) - 1, -1, -1): # check all possible parent nodes\n heapify(i, n ** 2)\n # print(i)\n\n for i in range(n ** 2 - 1, 0, -1):\n matrix[i // n][i % n], matrix[0][0] = matrix[0][0], matrix[i // n][i % n]\n heapify(0, i)\n return matrix[(k - 1) // n][(k - 1) % n]\n\n\n\n\n","memory":"22600"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n d={}\n max1=matrix[0][0]\n min1=matrix[0][0]\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n if matrix[i][j] not in d:\n d[matrix[i][j]]=0\n d[matrix[i][j]]+=1\n max1=max(max1,matrix[i][j])\n min1=min(min1,matrix[i][j])\n \n count=0\n for i in range(min1,max1+1):\n if i in d:\n count+=d[i]\n if count>=k:\n return i\n ","memory":"22700"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # max heapsort\n # Time O(nlogn); Space O(1)\n n = len(matrix)\n def heapify(i, size):\n largest = i\n l = 2 * i + 1\n r = 2 * i + 2\n if l < size and matrix[l // n][l % n] > matrix[largest // n][largest % n]:\n largest = l\n # r might be larger than l\n if r < size and matrix[r // n][r % n] > matrix[largest // n][largest % n]:\n largest = r\n if largest != i:\n matrix[i // n][i % n], matrix[largest // n][largest % n] = matrix[largest // n][largest % n], matrix[i // n][i % n] # swap\n heapify(largest, size)\n\n for i in range((n ** 2 // 2) - 1, -1, -1): # check all possible parent nodes\n heapify(i, n ** 2)\n\n for i in range(n ** 2 - 1, 0, -1):\n matrix[i // n][i % n], matrix[0][0] = matrix[0][0], matrix[i // n][i % n]\n heapify(0, i)\n return matrix[(k - 1) // n][(k - 1) % n]\n\n\n\n\n","memory":"22800"},{"code":"from queue import PriorityQueue\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n rows = len(matrix)\n cols = len(matrix[0])\n \n pq = PriorityQueue()\n \n for row in range(rows):\n for col in range(cols):\n \n val = matrix[row][col]\n \n if pq.qsize() < k:\n pq.put((-val, val))\n elif val < pq.queue[0][1]:\n pq.get()\n pq.put((-val, val))\n \n return pq.queue[0][1]","memory":"23000"},{"code":"from typing import List\nfrom heapq import heapify, nlargest\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n res = []\n for row in matrix:\n res.extend(row)\n heapify(res)\n return nsmallest(k, res)[-1]","memory":"23100"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n import heapq as hq\n\n n = len(matrix)\n pq = list()\n\n for i in range(n):\n for j in range(n):\n curVal = MatrixVal(matrix[i][j])\n\n if len(pq) < k:\n hq.heappush(pq, curVal)\n continue\n\n if curVal.val < pq[0].val:\n hq.heappop(pq)\n hq.heappush(pq, curVal)\n \n\n print([mv.val for mv in pq])\n return hq.heappop(pq).val\n \n\nclass MatrixVal:\n\n def __init__(self, val):\n self.val = val\n\n def __lt__(self, other):\n return self.val > other.val","memory":"23200"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n heap = []\n import heapq\n for i in matrix:\n heap.extend(i)\n heapq.heapify(heap)\n return heapq.nsmallest(k, heap)[-1]","memory":"23300"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n h = []\n for row in matrix:\n for num in row:\n heapq.heappush(h,num)\n return heapq.nsmallest(k,h)[-1]","memory":"23400"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n res = []\n for r in matrix:\n res += r\n heapq.heapify(res)\n return heapq.nsmallest(k,res)[-1]\n","memory":"23400"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n new_m = []\n for m in matrix:\n new_m += m\n \n return heapq.nsmallest(k, new_m)[-1]","memory":"23500"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n h = []\n for row in matrix:\n for num in row:\n heapq.heappush(h,num)\n return heapq.nsmallest(k,h)[-1]","memory":"23600"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n h=[]\n rows=len(matrix)\n cols=len(matrix[0])\n for r in range(rows):\n for c in range(cols):\n heapq.heappush(h,matrix[r][c])\n \n return heapq.nsmallest(k,h)[-1]\n \n","memory":"23700"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n combined = list(itertools.chain.from_iterable(matrix))\n smallests = heapq.nsmallest(k, combined)\n return heapq.nlargest(1, smallests)[0]\n\n ","memory":"23800"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n # Initialize an empty list to store flattened elements\n v = []\n # Iterate through each row & col of the matrix\n for i in range(len(matrix)):\n for j in range(len(matrix)):\n v.append(matrix[i][j])\n\n a = heapq.nsmallest(k, v)\n # Return the (k - 1)th element from the sorted list\n return heapq.nlargest(1, a)[0]","memory":"23800"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n h=[]\n for i in range(len(matrix)):\n for j in range(len(matrix[0])):\n heappush(h,matrix[i][j])\n a= heapq.nsmallest(k,h)\n return a[-1]","memory":"23900"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n return heapq.nsmallest(k, sum(matrix, []))[-1]\n","memory":"24000"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n row, col = 0, 0\n candidates = [(matrix[row][col], row, col)]\n visited_cels = set(\"0-0\")\n for _ in range(k):\n v, row, col = heapq.heappop(candidates)\n #print(row, col, v)\n for (r,c) in [(0,1), (1,0)]:\n if 0<=row+r<n and 0<=col+c<n:\n new_candidate = (matrix[row+r][col+c], row+r, col+c)\n if not \"{}-{}\".format(row+r,col+c) in visited_cels:\n heapq.heappush(candidates, new_candidate)\n visited_cels.add(\"{}-{}\".format(row+r,col+c))\n return v","memory":"24100"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n H = [(matrix[0][0], 0, 0)]\n seen = set()\n\n for i in range(k):\n tmp = heapq.heappop(H)\n res = tmp[0]\n if tmp[1]+1 < len(matrix) and (tmp[1]+1, tmp[2]) not in seen:\n seen.add((tmp[1]+1, tmp[2]))\n heapq.heappush(H, (matrix[tmp[1]+1][tmp[2]], tmp[1]+1, tmp[2]))\n if tmp[2]+1 < len(matrix[0]) and (tmp[1], tmp[2]+1) not in seen:\n seen.add((tmp[1], tmp[2]+1))\n heapq.heappush(H, (matrix[tmp[1]][tmp[2]+1], tmp[1], tmp[2]+1))\n return res","memory":"24300"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n n = len(matrix)\n heap = [(matrix[0][0], 0, 0)]\n visited = set((0, 0))\n count = 0\n\n while heap:\n val, i, j = heappop(heap)\n count += 1\n if count == k: return val\n if i + 1 < n and (i + 1, j) not in visited:\n heappush(heap, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n if j + 1 < n and (i, j + 1) not in visited:\n heappush(heap, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))","memory":"24400"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n lst = []\n n=len(matrix)\n i=0\n j=0\n nxt_set = set()\n visited = set()\n while len(lst)<k:\n lst.append(matrix[i][j])\n if i+1<n and (i+1,j) not in visited:\n nxt_set.add((i+1,j))\n if j+1<n and (i,j+1) not in visited:\n nxt_set.add((i,j+1))\n min_val = None\n next_tup = None\n for tup in nxt_set:\n if min_val==None:\n min_val = matrix[tup[0]][tup[1]]\n next_tup=tup\n else:\n if matrix[tup[0]][tup[1]] < min_val:\n min_val = matrix[tup[0]][tup[1]]\n next_tup=tup\n if next_tup!=None:\n i = next_tup[0]\n j = next_tup[1]\n visited.add(next_tup)\n nxt_set.remove(next_tup)\n\n return lst[-1]\n \n \n \n\n \n\n","memory":"24500"},{"code":"class Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n visited = set([(0, 0)])\n n = len(matrix)\n pq = []\n heapq.heappush(pq, (matrix[0][0], (0, 0)))\n\n i = 1\n while pq:\n (val, (x, y)) = heapq.heappop(pq)\n if i == k:\n return val\n if x + 1 < n and (x + 1, y) not in visited:\n visited.add((x + 1, y))\n heapq.heappush(pq, (matrix[x + 1][y], (x + 1, y)))\n if y + 1 < n and (x, y + 1) not in visited:\n visited.add((x, y + 1))\n heapq.heappush(pq, (matrix[x][y + 1], (x, y + 1)))\n i += 1\n","memory":"24600"},{"code":"import heapq\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n \n \n \n if k == 1:\n return matrix[0][0]\n \n res = []\n visited = set([(0, 0)])\n min_queue = [(matrix[0][0], 0, 0)]\n \n while min_queue:\n val, i, j = heapq.heappop(min_queue)\n res.append(val)\n for i_s, j_s in [(1, 0), (0, 1)]:\n new_i, new_j = i + i_s, j + j_s\n if -1 < new_i < len(matrix) and -1 < new_j < len(matrix[0]) and (new_i, new_j) not in visited:\n heapq.heappush(min_queue, (matrix[new_i][new_j], new_i, new_j))\n visited.add((new_i, new_j))\n \n if len(res) == k:\n return res[-1]\n return res[-1]","memory":"24700"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n n = len(matrix)\n \n # Min-heap to track the smallest elements\n frontier = [(matrix[0][0], 0, 0)]\n visited = set((0, 0)) # Only track (i, j) indices\n\n # Keep extracting from the heap until we reach the k-th smallest\n for _ in range(k - 1):\n val, i, j = heapq.heappop(frontier)\n\n # Move to the next row if not visited\n if i + 1 < n and (i + 1, j) not in visited:\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n\n # Move to the next column if not visited\n if j + 1 < n and (i, j + 1) not in visited:\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))\n\n # The top of the heap is the k-th smallest\n return heapq.heappop(frontier)[0]\n","memory":"24800"},{"code":"import heapq\n\nclass Solution:\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n if not matrix or not matrix[0]:\n return 0\n\n n = len(matrix)\n \n frontier = [(matrix[0][0], 0, 0)]\n visited = set((0, 0))\n\n for _ in range(k - 1):\n val, i, j = heapq.heappop(frontier)\n\n if i + 1 < n and (i + 1, j) not in visited:\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\n visited.add((i + 1, j))\n\n if j + 1 < n and (i, j + 1) not in visited:\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\n visited.add((i, j + 1))\n\n return heapq.heappop(frontier)[0]\n","memory":"24800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n left, right = matrix[0][0], matrix[n - 1][n - 1]\\n\\n while left < right:\\n mid = left + (right - left) // 2\\n if self.countSmall(matrix, mid) < k:\\n left = mid + 1\\n else:\\n right = mid\\n\\n return left\\n\\n def countSmall(self, matrix: List[List[int]], target: int) -> int:\\n n = len(matrix)\\n count = 0\\n for row in matrix:\\n left, right = 0, n\\n while left < right:\\n mid = left + (right - left) // 2\\n if row[mid] <= target:\\n left = mid + 1\\n else:\\n right = mid\\n count += left\\n return count\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(Solution().kthSmallest(nums, next(inputs)),file=f)\\nexit(0)\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n ROWS = len(matrix)\\n COLS = len(matrix[0])\\n \\n def countLessEqual(mid):\\n r = ROWS - 1\\n c = 0\\n count = 0 \\n\\n while r >= 0 and c < COLS:\\n if matrix[r][c] > mid:\\n r -= 1\\n else:\\n count += r+1\\n c += 1\\n return count\\n \\n l = matrix[0][0]\\n r = matrix[ROWS-1][COLS-1]\\n\\n while l <= r:\\n mid = l + (r-l)//2\\n if countLessEqual(mid) < k:\\n l = mid + 1\\n else:\\n r = mid - 1\\n return l\",\n \"memory\": \"20800\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n res=[]\\n for row in matrix:\\n for col in row:\\n res.append(col)\\n res.sort()\\n return res[k-1]\",\n \"memory\": \"20900\"\n },\n {\n \"code\": \"class Solution:\\n #https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/solutions/1322101/c-java-python-maxheap-minheap-binary-search-picture-explain-clean-concise/\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n, m = len(matrix), len(matrix[0])\\n heap = [(matrix[0][j], 0, j) for j in range(m)]\\n heapq.heapify(heap)\\n while k > 0:\\n result, i, j = heapq.heappop(heap)\\n if i + 1 < n:\\n heapq.heappush(heap, (matrix[i+1][j], i+1, j))\\n k -=1\\n return result\\n \\n \",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n def count_less_or_equal(val):\\n count = 0\\n n = len(matrix)\\n i = n - 1\\n j = 0 \\n while i >= 0 and j < n:\\n if matrix[i][j] <= val:\\n count += i + 1\\n j += 1\\n else:\\n i -= 1\\n return count\\n\\n\\n left = matrix[0][0]\\n right = matrix[-1][-1]\\n\\n while left <= right:\\n mid = (left + right) // 2\\n if count_less_or_equal(mid) >= k:\\n right = mid - 1\\n else:\\n left = mid + 1\\n return left\",\n \"memory\": \"21000\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n k -= 1\\n \\n s = []\\n for row in matrix:\\n s += row\\n \\n s.sort()\\n return s[k]\",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n low, high = matrix[0][0], matrix[n-1][n-1]\\n\\n def countLessEqual(mid):\\n count, row, col = 0, n-1, 0\\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += row + 1\\n col += 1\\n else:\\n row -= 1\\n return count\\n\\n while low < high:\\n mid = (low + high) // 2\\n if countLessEqual(mid) < k:\\n low = mid + 1\\n else:\\n high = mid\\n return low\\n \",\n \"memory\": \"21100\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n \\n # Helper function to count how many numbers are ≤ mid in the matrix\\n def count_less_equal(mid):\\n count = 0\\n row, col = n - 1, 0 # Start from the bottom-left corner\\n \\n while row >= 0 and col < n:\\n if matrix[row][col] <= mid:\\n count += (row + 1) # All elements in this column up to 'row' are ≤ mid\\n col += 1 # Move right\\n else:\\n row -= 1 # Move up\\n \\n return count\\n\\n # Binary search on the value range\\n left, right = matrix[0][0], matrix[n - 1][n - 1]\\n \\n while left < right:\\n mid = (left + right) // 2\\n if count_less_equal(mid) < k:\\n left = mid + 1 # We need a larger number\\n else:\\n right = mid # We need a smaller number or exactly mid\\n \\n return left\",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"import bisect\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n=len(matrix)\\n low,high=matrix[0][0],matrix[n-1][n-1]\\n ans=0\\n while low<=high:\\n mid=(low+high)>>1\\n smallerElements=0\\n for i in matrix:\\n smallerElements+=bisect.bisect(i,mid)\\n if smallerElements<k:\\n low=mid+1\\n else:\\n ans=mid\\n high=mid-1\\n return ans\\n\\n\\n\\n\\n \",\n \"memory\": \"21200\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n rows = len(matrix[0])\\n cols = len(matrix)\\n \\n left = matrix[0][0]\\n right = matrix[cols-1][rows-1]\\n k-=1\\n\\n def find_elements_less_than_mid(target):\\n total = 0\\n \\n for i in range(len(matrix)):\\n arr = matrix[i]\\n \\n left = 0\\n right = len(matrix[0])-1\\n count = 0\\n \\n while left <= right:\\n mid = (left + right) // 2\\n if arr[mid] <= target:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n total += left\\n \\n return total\\n \\n while left <= right:\\n mid = (left + right) // 2\\n \\n elements_less_than_mid = find_elements_less_than_mid(mid)\\n \\n if elements_less_than_mid <= k:\\n left = mid + 1\\n else:\\n right = mid - 1\\n \\n \\n return left\\n\\n\\n \\n\\n \\n\",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"from collections import deque\\nimport math\\n\\nclass Solution:\\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n \\n n = len(matrix)\\n # print(f'n={n} k={k}')\\n q = deque() # queue\\n ld = None # last diagonal added \\n lass = None # last min assigned\\n lminadd = -math.inf # last min added\\n lmaxadd = math.inf # last max added\\n lk = 0 # last 'k' processed\\n\\n # Case 1\\n if k <= math.ceil(n*n / 2):\\n \\n while lk < k:\\n lk += 1\\n ld = (lk-1, 0)\\n # print(f'lk={lk} ld={ld}')\\n ldmin = math.inf # diagonal min\\n \\n # adding a diagonal to queue\\n for i in range(0, lk):\\n for j in range(lk-1, -1, -1):\\n if i <= n-1 and j <= n-1 and i+j == lk-1:\\n # print(f'i={i} j={j}')\\n el = matrix[i][j]\\n q.append(el)\\n\\n # keeping track\\n if el < ldmin:\\n ldmin = el\\n\\n # sorting queue\\n prev = 1\\n while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n prev += 1\\n # print(f'q={q}')\\n \\n # last min added (from last diagonal)\\n lminadd = ldmin\\n # print(f'lminadd={lminadd}')\\n\\n # assigning values for 'lk'\\n lass = q.popleft()\\n # print(f'lk={lk} lass={lass}')\\n # print(f'q={q}')\\n\\n # shortcut to answer\\n if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\\n return q[k - lk - 1]\\n \\n return lass\\n\\n # Case 2\\n if k > math.ceil(n*n / 2):\\n\\n nk = n*n - k + 1 # new 'k' going backwards\\n \\n while lk < nk:\\n lk += 1\\n ld = (n-lk, n-1)\\n # print(f'lk={lk} ld={ld}')\\n ldmax = -math.inf # diagonal max\\n \\n # adding a diagonal to queue\\n for i in range(n-lk, n):\\n for j in range(n-1, n-lk-1, -1):\\n if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\\n # print(f'i={i} j={j}')\\n el = matrix[i][j]\\n q.append(el)\\n\\n # keeping track\\n if el > ldmax:\\n ldmax = el\\n\\n # sorting queue\\n prev = 1\\n while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n prev += 1\\n # print(f'q={q}')\\n \\n # last max added (from last diagonal)\\n lmaxadd = ldmax\\n # print(f'lmaxadd={lmaxadd}')\\n\\n # assigning values for 'lk'\\n lass = q.popleft()\\n # print(f'lk={lk} nk={n*n-lk+1} lass={lass}')\\n # print(f'q={q}')\\n\\n # jumping to answer\\n if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\\n return q[nk - lk - 1]\\n\\n return lass\\n\\n\\n# Working simple non-efficient solution\\n# class Solution:\\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n# n = len(matrix[0])\\n# arr = []\\n# for i in range(n):\\n# for j in range(n):\\n# arr.append(matrix[i][j])\\n# arr.sort()\\n# return arr[k-1]\\n \",\n \"memory\": \"21300\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n matrixSize = len(matrix) * len(matrix)\\n flattenedHeap = matrix[0]\\n result = 0\\n\\n for i in range(1, len(matrix)):\\n flattenedHeap.extend(matrix[i])\\n \\n heapq.heapify(flattenedHeap)\\n\\n while flattenedHeap and k > 0:\\n result = heapq.heappop(flattenedHeap)\\n k -= 1\\n \\n return result\\n\\n\",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"from collections import deque\\nimport math\\n\\nclass Solution:\\n def kthSmallest(self, matrix: list[list[int]], k: int) -> int:\\n \\n n = len(matrix)\\n # print(f'n={n} k={k}')\\n q = deque() # queue\\n ld = None # last diagonal added \\n lass = None # last min assigned\\n lminadd = -math.inf # last min added\\n lmaxadd = math.inf # last max added\\n lk = 0 # last 'k' processed\\n\\n # Case 1\\n if k <= math.ceil(n*n / 2):\\n \\n while lk < k:\\n lk += 1\\n ld = (lk-1, 0)\\n # print(f'lk={lk} ld={ld}')\\n ldmin = math.inf # diagonal min\\n \\n # adding a diagonal to queue\\n for i in range(0, lk):\\n for j in range(lk-1, -1, -1):\\n if i <= n-1 and j <= n-1 and i+j == lk-1:\\n # print(f'i={i} j={j}')\\n el = matrix[i][j]\\n q.append(el)\\n\\n # keeping track\\n if el < ldmin:\\n ldmin = el\\n\\n # sorting queue\\n prev = 1\\n while 1 + prev <= len(q) and q[-prev] < q[-1-prev]:\\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n prev += 1\\n # print(f'q={q}')\\n \\n # last min added (from last diagonal)\\n lminadd = ldmin\\n # print(f'lminadd={lminadd}')\\n\\n # assigning values for 'lk'\\n lass = q.popleft()\\n # print(f'lk={lk} lass={lass}')\\n # print(f'q={q}')\\n\\n # shortcut to answer\\n if 0 <= k - lk - 1 < len(q) and lminadd > lass and lminadd >= q[k - lk - 1]:\\n return q[k - lk - 1]\\n \\n return lass\\n\\n # Case 2\\n if k > math.ceil(n*n / 2):\\n\\n nk = n*n - k + 1 # new 'k' going backwards\\n \\n while lk < nk:\\n lk += 1\\n ld = (n-lk, n-1)\\n # print(f'lk={lk} ld={ld}')\\n ldmax = -math.inf # diagonal max\\n \\n # adding a diagonal to queue\\n for i in range(n-lk, n):\\n for j in range(n-1, n-lk-1, -1):\\n if 0 <= i <= n-1 and 0 <= j <= n-1 and i+j == n-lk + n - 1:\\n # print(f'i={i} j={j}')\\n el = matrix[i][j]\\n q.append(el)\\n\\n # keeping track\\n if el > ldmax:\\n ldmax = el\\n\\n # sorting queue\\n prev = 1\\n while 1 + prev <= len(q) and q[-prev] > q[-1-prev]:\\n q[-1-prev], q[-prev] = q[-prev], q[-1-prev]\\n prev += 1\\n # print(f'q={q}')\\n \\n # last max added (from last diagonal)\\n lmaxadd = ldmax\\n # print(f'lmaxadd={lmaxadd}')\\n\\n # assigning values for 'lk'\\n lass = q.popleft()\\n # print(f'lk={lk} nk={n*n-lk+1} lass={lass}')\\n # print(f'q={q}')\\n\\n # jumping to answer\\n if 0 <= nk - lk - 1 < len(q) and lmaxadd < lass and lmaxadd <= q[nk - lk - 1]:\\n return q[nk - lk - 1]\\n\\n return lass\\n\\n\\n# Working simple non-efficient solution\\n# class Solution:\\n# def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n# n = len(matrix[0])\\n# arr = []\\n# for i in range(n):\\n# for j in range(n):\\n# arr.append(matrix[i][j])\\n# arr.sort()\\n# return arr[k-1]\\n \",\n \"memory\": \"21400\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n l = [i for j in matrix for i in j]\\n l = sorted(l)\\n return l[k-1]\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n pq = PriorityQueue()\\n for r in range(len(matrix)):\\n for c in range(len(matrix[0])):\\n pq.put(matrix[r][c])\\n \\n for _ in range(k-1):\\n pq.get()\\n return pq.get()\",\n \"memory\": \"21600\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # Input: matrix, sorted, and k\\n # Output: kth smallest element in matrix\\n\\n # (0) Set-up\\n heap = []\\n # (1) Iterate\\n for row in matrix:\\n for val in row:\\n heap.append(-val)\\n heapq.heapify(heap)\\n while len(heap) > k:\\n heapq.heappop(heap)\\n # (2) Result\\n return -heap[0]\\n \",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n nums = list() \\n \\n for i in range(len(matrix)): \\n nums += matrix[i]\\n\\n heapify(nums)\\n\\n print(nums)\\n while nums and k > 1: \\n heappop(nums)\\n k -= 1 \\n\\n print(nums)\\n \\n\\n return heappop(nums)\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n hp = [] # This will act as a max-heap by using negative numbers\\n l = []\\n row = len(matrix)\\n col = len(matrix[0])\\n \\n # Flatten the matrix into a list\\n for r in range(row):\\n for c in range(col):\\n number = matrix[r][c]\\n l.append(number)\\n \\n # Push elements into the max-heap (simulated using negative numbers)\\n for num in l: \\n heapq.heappush(hp, -num) # Push the negative of the number\\n if len(hp) > k:\\n heapq.heappop(hp) # Remove the smallest (most negative) element\\n newhp = [-n for n in hp]\\n if len(newhp) == k:\\n return heapq.heappop(newhp)\\n\\n\",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution: \\n # moving row by row\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n candidates = [(matrix[0][c], 0, c) for c in range(n)]\\n heapq.heapify(candidates)\\n visited_rows = {0}\\n \\n for _ in range(k):\\n v, row, col = heapq.heappop(candidates)\\n print(v, row, col)\\n if row+1<n and not row+1 in visited_rows:\\n visited_rows.add(row+1)\\n for c in range(n):\\n heapq.heappush(candidates, (matrix[row+1][c], row+1, c))\\n \\n return v\\n \\n # moving element by element:\\n def kthSmallest0(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n row, col = 0, 0\\n candidates = [(matrix[row][col], row, col)]\\n visited_cels = set((0,0))\\n for _ in range(k):\\n v, row, col = heapq.heappop(candidates)\\n #print(row, col, v)\\n for (r,c) in [(0,1), (1,0)]:\\n if row+r<n and col+c<n and not (row+r,col+c) in visited_cels:\\n heapq.heappush(candidates, (matrix[row+r][col+c], row+r, col+c))\\n visited_cels.add((row+r,col+c))\\n return v\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # max heapsort\\n n = len(matrix)\\n def heapify(i, size):\\n largest = i\\n l = 2 * i + 1\\n r = 2 * i + 2\\n # print('before', matrix[largest // n][largest % n])\\n # if i == 3:\\n # print(matrix[l // n][l % n], matrix[r // n][r % n])\\n # print(size)\\n if l < size and matrix[l // n][l % n] > matrix[largest // n][largest % n]:\\n largest = l\\n # r might be larger than l\\n if r < size and matrix[r // n][r % n] > matrix[largest // n][largest % n]:\\n largest = r\\n # print('after', matrix[largest // n][largest % n])\\n if largest != i:\\n matrix[i // n][i % n], matrix[largest // n][largest % n] = matrix[largest // n][largest % n], matrix[i // n][i % n] # swap\\n heapify(largest, size)\\n\\n for i in range((n ** 2 // 2) - 1, -1, -1): # check all possible parent nodes\\n heapify(i, n ** 2)\\n # print(i)\\n\\n for i in range(n ** 2 - 1, 0, -1):\\n matrix[i // n][i % n], matrix[0][0] = matrix[0][0], matrix[i // n][i % n]\\n heapify(0, i)\\n return matrix[(k - 1) // n][(k - 1) % n]\\n\\n\\n\\n\\n\",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n d={}\\n max1=matrix[0][0]\\n min1=matrix[0][0]\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n if matrix[i][j] not in d:\\n d[matrix[i][j]]=0\\n d[matrix[i][j]]+=1\\n max1=max(max1,matrix[i][j])\\n min1=min(min1,matrix[i][j])\\n \\n count=0\\n for i in range(min1,max1+1):\\n if i in d:\\n count+=d[i]\\n if count>=k:\\n return i\\n \",\n \"memory\": \"22700\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # max heapsort\\n # Time O(nlogn); Space O(1)\\n n = len(matrix)\\n def heapify(i, size):\\n largest = i\\n l = 2 * i + 1\\n r = 2 * i + 2\\n if l < size and matrix[l // n][l % n] > matrix[largest // n][largest % n]:\\n largest = l\\n # r might be larger than l\\n if r < size and matrix[r // n][r % n] > matrix[largest // n][largest % n]:\\n largest = r\\n if largest != i:\\n matrix[i // n][i % n], matrix[largest // n][largest % n] = matrix[largest // n][largest % n], matrix[i // n][i % n] # swap\\n heapify(largest, size)\\n\\n for i in range((n ** 2 // 2) - 1, -1, -1): # check all possible parent nodes\\n heapify(i, n ** 2)\\n\\n for i in range(n ** 2 - 1, 0, -1):\\n matrix[i // n][i % n], matrix[0][0] = matrix[0][0], matrix[i // n][i % n]\\n heapify(0, i)\\n return matrix[(k - 1) // n][(k - 1) % n]\\n\\n\\n\\n\\n\",\n \"memory\": \"22800\"\n },\n {\n \"code\": \"from queue import PriorityQueue\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n rows = len(matrix)\\n cols = len(matrix[0])\\n \\n pq = PriorityQueue()\\n \\n for row in range(rows):\\n for col in range(cols):\\n \\n val = matrix[row][col]\\n \\n if pq.qsize() < k:\\n pq.put((-val, val))\\n elif val < pq.queue[0][1]:\\n pq.get()\\n pq.put((-val, val))\\n \\n return pq.queue[0][1]\",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"from typing import List\\nfrom heapq import heapify, nlargest\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n res = []\\n for row in matrix:\\n res.extend(row)\\n heapify(res)\\n return nsmallest(k, res)[-1]\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n import heapq as hq\\n\\n n = len(matrix)\\n pq = list()\\n\\n for i in range(n):\\n for j in range(n):\\n curVal = MatrixVal(matrix[i][j])\\n\\n if len(pq) < k:\\n hq.heappush(pq, curVal)\\n continue\\n\\n if curVal.val < pq[0].val:\\n hq.heappop(pq)\\n hq.heappush(pq, curVal)\\n \\n\\n print([mv.val for mv in pq])\\n return hq.heappop(pq).val\\n \\n\\nclass MatrixVal:\\n\\n def __init__(self, val):\\n self.val = val\\n\\n def __lt__(self, other):\\n return self.val > other.val\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n heap = []\\n import heapq\\n for i in matrix:\\n heap.extend(i)\\n heapq.heapify(heap)\\n return heapq.nsmallest(k, heap)[-1]\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n h = []\\n for row in matrix:\\n for num in row:\\n heapq.heappush(h,num)\\n return heapq.nsmallest(k,h)[-1]\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n res = []\\n for r in matrix:\\n res += r\\n heapq.heapify(res)\\n return heapq.nsmallest(k,res)[-1]\\n\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n new_m = []\\n for m in matrix:\\n new_m += m\\n \\n return heapq.nsmallest(k, new_m)[-1]\",\n \"memory\": \"23500\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n h = []\\n for row in matrix:\\n for num in row:\\n heapq.heappush(h,num)\\n return heapq.nsmallest(k,h)[-1]\",\n \"memory\": \"23600\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n h=[]\\n rows=len(matrix)\\n cols=len(matrix[0])\\n for r in range(rows):\\n for c in range(cols):\\n heapq.heappush(h,matrix[r][c])\\n \\n return heapq.nsmallest(k,h)[-1]\\n \\n\",\n \"memory\": \"23700\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n combined = list(itertools.chain.from_iterable(matrix))\\n smallests = heapq.nsmallest(k, combined)\\n return heapq.nlargest(1, smallests)[0]\\n\\n \",\n \"memory\": \"23800\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n # Initialize an empty list to store flattened elements\\n v = []\\n # Iterate through each row & col of the matrix\\n for i in range(len(matrix)):\\n for j in range(len(matrix)):\\n v.append(matrix[i][j])\\n\\n a = heapq.nsmallest(k, v)\\n # Return the (k - 1)th element from the sorted list\\n return heapq.nlargest(1, a)[0]\",\n \"memory\": \"23800\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n h=[]\\n for i in range(len(matrix)):\\n for j in range(len(matrix[0])):\\n heappush(h,matrix[i][j])\\n a= heapq.nsmallest(k,h)\\n return a[-1]\",\n \"memory\": \"23900\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n return heapq.nsmallest(k, sum(matrix, []))[-1]\\n\",\n \"memory\": \"24000\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n row, col = 0, 0\\n candidates = [(matrix[row][col], row, col)]\\n visited_cels = set(\\\"0-0\\\")\\n for _ in range(k):\\n v, row, col = heapq.heappop(candidates)\\n #print(row, col, v)\\n for (r,c) in [(0,1), (1,0)]:\\n if 0<=row+r<n and 0<=col+c<n:\\n new_candidate = (matrix[row+r][col+c], row+r, col+c)\\n if not \\\"{}-{}\\\".format(row+r,col+c) in visited_cels:\\n heapq.heappush(candidates, new_candidate)\\n visited_cels.add(\\\"{}-{}\\\".format(row+r,col+c))\\n return v\",\n \"memory\": \"24100\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n H = [(matrix[0][0], 0, 0)]\\n seen = set()\\n\\n for i in range(k):\\n tmp = heapq.heappop(H)\\n res = tmp[0]\\n if tmp[1]+1 < len(matrix) and (tmp[1]+1, tmp[2]) not in seen:\\n seen.add((tmp[1]+1, tmp[2]))\\n heapq.heappush(H, (matrix[tmp[1]+1][tmp[2]], tmp[1]+1, tmp[2]))\\n if tmp[2]+1 < len(matrix[0]) and (tmp[1], tmp[2]+1) not in seen:\\n seen.add((tmp[1], tmp[2]+1))\\n heapq.heappush(H, (matrix[tmp[1]][tmp[2]+1], tmp[1], tmp[2]+1))\\n return res\",\n \"memory\": \"24300\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n n = len(matrix)\\n heap = [(matrix[0][0], 0, 0)]\\n visited = set((0, 0))\\n count = 0\\n\\n while heap:\\n val, i, j = heappop(heap)\\n count += 1\\n if count == k: return val\\n if i + 1 < n and (i + 1, j) not in visited:\\n heappush(heap, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n if j + 1 < n and (i, j + 1) not in visited:\\n heappush(heap, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\",\n \"memory\": \"24400\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n lst = []\\n n=len(matrix)\\n i=0\\n j=0\\n nxt_set = set()\\n visited = set()\\n while len(lst)<k:\\n lst.append(matrix[i][j])\\n if i+1<n and (i+1,j) not in visited:\\n nxt_set.add((i+1,j))\\n if j+1<n and (i,j+1) not in visited:\\n nxt_set.add((i,j+1))\\n min_val = None\\n next_tup = None\\n for tup in nxt_set:\\n if min_val==None:\\n min_val = matrix[tup[0]][tup[1]]\\n next_tup=tup\\n else:\\n if matrix[tup[0]][tup[1]] < min_val:\\n min_val = matrix[tup[0]][tup[1]]\\n next_tup=tup\\n if next_tup!=None:\\n i = next_tup[0]\\n j = next_tup[1]\\n visited.add(next_tup)\\n nxt_set.remove(next_tup)\\n\\n return lst[-1]\\n \\n \\n \\n\\n \\n\\n\",\n \"memory\": \"24500\"\n },\n {\n \"code\": \"class Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n visited = set([(0, 0)])\\n n = len(matrix)\\n pq = []\\n heapq.heappush(pq, (matrix[0][0], (0, 0)))\\n\\n i = 1\\n while pq:\\n (val, (x, y)) = heapq.heappop(pq)\\n if i == k:\\n return val\\n if x + 1 < n and (x + 1, y) not in visited:\\n visited.add((x + 1, y))\\n heapq.heappush(pq, (matrix[x + 1][y], (x + 1, y)))\\n if y + 1 < n and (x, y + 1) not in visited:\\n visited.add((x, y + 1))\\n heapq.heappush(pq, (matrix[x][y + 1], (x, y + 1)))\\n i += 1\\n\",\n \"memory\": \"24600\"\n },\n {\n \"code\": \"import heapq\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n \\n \\n \\n if k == 1:\\n return matrix[0][0]\\n \\n res = []\\n visited = set([(0, 0)])\\n min_queue = [(matrix[0][0], 0, 0)]\\n \\n while min_queue:\\n val, i, j = heapq.heappop(min_queue)\\n res.append(val)\\n for i_s, j_s in [(1, 0), (0, 1)]:\\n new_i, new_j = i + i_s, j + j_s\\n if -1 < new_i < len(matrix) and -1 < new_j < len(matrix[0]) and (new_i, new_j) not in visited:\\n heapq.heappush(min_queue, (matrix[new_i][new_j], new_i, new_j))\\n visited.add((new_i, new_j))\\n \\n if len(res) == k:\\n return res[-1]\\n return res[-1]\",\n \"memory\": \"24700\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n n = len(matrix)\\n \\n # Min-heap to track the smallest elements\\n frontier = [(matrix[0][0], 0, 0)]\\n visited = set((0, 0)) # Only track (i, j) indices\\n\\n # Keep extracting from the heap until we reach the k-th smallest\\n for _ in range(k - 1):\\n val, i, j = heapq.heappop(frontier)\\n\\n # Move to the next row if not visited\\n if i + 1 < n and (i + 1, j) not in visited:\\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n\\n # Move to the next column if not visited\\n if j + 1 < n and (i, j + 1) not in visited:\\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\\n\\n # The top of the heap is the k-th smallest\\n return heapq.heappop(frontier)[0]\\n\",\n \"memory\": \"24800\"\n },\n {\n \"code\": \"import heapq\\n\\nclass Solution:\\n def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\\n if not matrix or not matrix[0]:\\n return 0\\n\\n n = len(matrix)\\n \\n frontier = [(matrix[0][0], 0, 0)]\\n visited = set((0, 0))\\n\\n for _ in range(k - 1):\\n val, i, j = heapq.heappop(frontier)\\n\\n if i + 1 < n and (i + 1, j) not in visited:\\n heapq.heappush(frontier, (matrix[i + 1][j], i + 1, j))\\n visited.add((i + 1, j))\\n\\n if j + 1 < n and (i, j + 1) not in visited:\\n heapq.heappush(frontier, (matrix[i][j + 1], i, j + 1))\\n visited.add((i, j + 1))\\n\\n return heapq.heappop(frontier)[0]\\n\",\n \"memory\": \"24800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":43,"string":"43"}}},{"rowIdx":283,"cells":{"question_id":{"kind":"number","value":380,"string":"380"},"name":{"kind":"string","value":"insert-delete-getrandom-o1"},"content":{"kind":"string","value":"<p>Implement the <code>RandomizedSet</code> class:</p>\n\n<ul>\n\t<li><code>RandomizedSet()</code> Initializes the <code>RandomizedSet</code> object.</li>\n\t<li><code>bool insert(int val)</code> Inserts an item <code>val</code> into the set if not present. Returns <code>true</code> if the item was not present, <code>false</code> otherwise.</li>\n\t<li><code>bool remove(int val)</code> Removes an item <code>val</code> from the set if present. Returns <code>true</code> if the item was present, <code>false</code> otherwise.</li>\n\t<li><code>int getRandom()</code> Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the <b>same probability</b> of being returned.</li>\n</ul>\n\n<p>You must implement the functions of the class such that each function works in <strong>average</strong> <code>O(1)</code> time complexity.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input</strong>\n["RandomizedSet", "insert", "remove", "insert", "getRandom", "remove", "insert", "getRandom"]\n[[], [1], [2], [2], [], [1], [2], []]\n<strong>Output</strong>\n[null, true, false, true, 2, true, false, 2]\n\n<strong>Explanation</strong>\nRandomizedSet randomizedSet = new RandomizedSet();\nrandomizedSet.insert(1); // Inserts 1 to the set. Returns true as 1 was inserted successfully.\nrandomizedSet.remove(2); // Returns false as 2 does not exist in the set.\nrandomizedSet.insert(2); // Inserts 2 to the set, returns true. Set now contains [1,2].\nrandomizedSet.getRandom(); // getRandom() should return either 1 or 2 randomly.\nrandomizedSet.remove(1); // Removes 1 from the set, returns true. Set now contains [2].\nrandomizedSet.insert(2); // 2 was already in the set, so return false.\nrandomizedSet.getRandom(); // Since 2 is the only number in the set, getRandom() will always return 2.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>-2<sup>31</sup> <= val <= 2<sup>31</sup> - 1</code></li>\n\t<li>At most <code>2 * </code><code>10<sup>5</sup></code> calls will be made to <code>insert</code>, <code>remove</code>, and <code>getRandom</code>.</li>\n\t<li>There will be <strong>at least one</strong> element in the data structure when <code>getRandom</code> is called.</li>\n</ul>\n"},"acRate":{"kind":"number","value":54.63201365843106,"string":"54.632014"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","hash-table","math","design","randomized"],"string":"[\n \"array\",\n \"hash-table\",\n \"math\",\n \"design\",\n \"randomized\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"198\", 0.0146], [\"202\", 0.029], [\"206\", 0.0508], [\"210\", 0.1089], [\"215\", 0.1017], [\"219\", 0.2249], [\"223\", 0.3555], [\"228\", 0.885], [\"232\", 1.2767], [\"236\", 2.394], [\"240\", 4.7157], [\"245\", 5.9054], [\"249\", 6.841200000000001], [\"253\", 6.9429], [\"257\", 6.797699999999999], [\"262\", 4.0482000000000005], [\"266\", 3.0471], [\"270\", 2.6117], [\"275\", 3.1631], [\"279\", 2.6553000000000004], [\"283\", 2.4159], [\"287\", 2.4303], [\"292\", 1.4002], [\"296\", 1.1753], [\"300\", 0.7907], [\"305\", 0.7183], [\"309\", 0.4281], [\"313\", 0.4425], [\"317\", 0.3192], [\"322\", 0.4352], [\"326\", 0.3047], [\"330\", 0.2829], [\"334\", 0.3119], [\"339\", 0.30469999999999997], [\"343\", 0.2395], [\"347\", 0.2176], [\"352\", 0.1595], [\"356\", 0.0726], [\"360\", 0.0943], [\"364\", 0.1234], [\"369\", 0.1088], [\"373\", 0.13069999999999998], [\"377\", 0.2684], [\"381\", 0.28300000000000003], [\"386\", 0.34819999999999995], [\"390\", 0.3555], [\"394\", 0.5732], [\"399\", 0.6674], [\"403\", 0.5005999999999999], [\"407\", 0.5078], [\"411\", 0.7182], [\"416\", 0.4426], [\"420\", 0.6094], [\"424\", 0.6311], [\"428\", 0.8996], [\"433\", 0.9793999999999999], [\"437\", 1.5381], [\"441\", 1.8355000000000001], [\"446\", 2.1329], [\"450\", 1.8210000000000002], [\"454\", 1.5888], [\"458\", 1.7919], [\"463\", 1.0665], [\"467\", 1.0374999999999999], [\"471\", 0.8779000000000001], [\"476\", 1.0447000000000002], [\"480\", 0.7110000000000001], [\"484\", 0.7110000000000001], [\"488\", 0.5876], [\"493\", 0.8414999999999999], [\"497\", 0.5659], [\"501\", 0.43520000000000003], [\"505\", 0.7037], [\"510\", 0.48619999999999997], [\"514\", 0.5006], [\"518\", 0.38449999999999995], [\"523\", 0.5078], [\"527\", 0.38449999999999995], [\"531\", 0.3192], [\"535\", 0.2539]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"62100\", 0.0145], [\"62200\", 0.0073], [\"62300\", 0.0145], [\"62400\", 0.0145], [\"62500\", 0.0073], [\"62600\", 0.029], [\"62700\", 0.029], [\"62800\", 0.0218], [\"62900\", 0.0653], [\"63000\", 0.0508], [\"63100\", 0.5949], [\"63200\", 2.1474], [\"63300\", 0.8923], [\"63400\", 2.3215], [\"63500\", 2.8149], [\"63600\", 1.7774], [\"63700\", 9.9391], [\"63800\", 41.4176], [\"63900\", 20.0377], [\"64000\", 6.0505], [\"64099\", 6.1376]]}"},"rt_list":{"kind":"list like","value":[{"code":"class RandomizedSet:\n\n def __init__(self):\n self.data = {}\n self.nums = []\n\n def insert(self, val: int) -> bool:\n if val in self.data:\n return False\n \n self.nums.append(val)\n self.data[val] = len(self.nums) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.data:\n return False\n \n val_index = self.data[val]\n last_element = self.nums[-1]\n\n self.nums[val_index] = last_element\n self.data[last_element] = val_index\n\n self.nums.pop()\n del self.data[val]\n \n return True\n\n\n def getRandom(self) -> int:\n rand = int(len(self.nums) * random.random())\n return self.nums[rand]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"198"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.ds = dict()\n self.array = list()\n self.top = 0\n\n def insert(self, val: int) -> bool:\n if val in self.ds: return False\n self.ds[val] = self.top\n self.array.append(val)\n self.top += 1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.ds:\n index = self.ds[val]\n self.array[-1], self.array[index] = self.array[index], self.array[-1]\n self.ds[self.array[index]] = index\n del self.ds[val]\n self.top -= 1\n self.array.pop()\n return True\n return False\n\n def getRandom(self) -> int:\n mod = math.floor(random.random() * self.top)\n return self.array[mod]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"198"},{"code":"\nclass RandomizedSet:\n\n def __init__(self):\n self.map = {}\n self.lst = []\n\n def insert(self, val: int) -> bool:\n if val in self.map:\n return False\n else:\n n = len(self.lst)\n self.map[val] = n\n self.lst.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.map:\n return False\n else:\n idx = self.map[val]\n temp = self.lst[-1]\n self.lst[-1] = self.lst[idx]\n self.lst[idx] = temp\n self.map[temp] = idx\n self.lst.pop()\n self.map.pop(val)\n return True\n\n def getRandom(self) -> int:\n rand = int(random.random() * len(self.lst))\n return self.lst[rand]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"202"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.info={}\n self.pool=[]\n \n\n def insert(self, val: int) -> bool:\n if val in self.info:\n return False\n self.info[val]=len(self.pool)\n self.pool.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.info:\n return False\n pos=self.info[val]\n del self.info[val]\n if pos==len(self.pool)-1:\n self.pool.pop()\n else:\n target=self.pool[-1]\n self.pool[pos]=target\n self.info[target]=pos\n self.pool.pop()\n return True\n \n\n def getRandom(self) -> int:\n pos=int(random.random()*len(self.pool))\n return self.pool[pos]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"206"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.dict = {}\n self.index = []\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n else:\n self.index.append(val)\n self.dict[val] = len(self.index) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.dict:\n location = self.dict[val]\n end = self.index.pop()\n del self.dict[val]\n if self.index and location <= len(self.index) - 1:\n # print(self.index, location)\n self.index[location] = end\n self.dict[end] = location\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return self.index[int(random.random() * len(self.index))]\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"206"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.valuesIndex = dict()\n self.values = []\n\n def insert(self, val: int) -> bool:\n if val in self.valuesIndex:\n return False\n self.valuesIndex[val] = len(self.values)\n self.values.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.valuesIndex:\n return False\n valIndex = self.valuesIndex[val]\n topVal = self.values[-1]\n self.values[valIndex] = topVal\n self.valuesIndex[topVal] = valIndex\n del self.values[-1]\n del self.valuesIndex[val]\n return True\n\n def getRandom(self) -> int:\n return self.values[int(random.random() * len(self.values))]","runtime":"210"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.indices = {}\n self.items = []\n\n def insert(self, val: int) -> bool:\n if val in self.indices:\n return False\n self.items.append(val)\n self.indices[val] = len(self.items) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.indices:\n return False\n idx = self.indices[val]\n last_element = self.items[-1]\n \n # Move the last element to the position of the element to delete, only if it's not the same element\n self.items[idx] = last_element\n self.indices[last_element] = idx\n \n # Remove the last element\n self.items.pop()\n del self.indices[val]\n \n return True\n\n def getRandom(self) -> int:\n idx = floor(random.random() * len(self.items))\n return self.items[idx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"210"},{"code":"from random import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.list = []\n self.dict = {}\n\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n else:\n self.dict[val] = len(self.list)\n self.list.append(val)\n return True\n\n\n def remove(self, val: int) -> bool:\n if val not in self.dict:\n return False\n else:\n idx = self.dict[val]\n self.list[idx] = self.list[-1]\n self.dict[self.list[-1]] = idx\n del self.list[-1]\n del self.dict[val]\n return True\n\n\n def getRandom(self) -> int:\n return self.list[int(random() * len(self.list))]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"215"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.map = {}\n self.list = []\n\n def insert(self, val: int) -> bool:\n if val in self.map:\n return False\n \n self.map[val] = len(self.list)\n self.list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.map:\n return False\n \n idx = self.map[val]\n self.list[idx] = self.list[-1]\n self.map[self.list[idx]] = idx\n self.map.pop(val)\n self.list.pop()\n return True\n\n def getRandom(self) -> int:\n index = int(random.random() * len(self.list))\n return self.list[index]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"215"},{"code":"import random\n\nclass RandomizedSet:\n def __init__(self):\n self.val_to_index = {} # Map from value to index in list\n self.values = [] # List of values\n\n def insert(self, val: int) -> bool:\n if val in self.val_to_index:\n return False\n # Add the value to the list and map it to the index\n self.val_to_index[val] = len(self.values)\n self.values.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.val_to_index:\n return False\n # Get the index of the value to remove\n index = self.val_to_index[val]\n # Move the last element to the position of the element to remove\n last_val = self.values[-1]\n self.values[index] = last_val\n self.val_to_index[last_val] = index\n # Remove the last element from the list and the map\n self.values.pop()\n del self.val_to_index[val]\n return True\n\n def getRandom(self) -> int:\n # Return a random element from the list\n return random.choice(self.values)\n","runtime":"219"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.elements = set()\n self.elt_list = []\n \n\n def insert(self, val: int) -> bool:\n if val in self.elements:\n return False\n else:\n self.elements.add(val)\n self.elt_list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.elements:\n return False\n else:\n self.elements.remove(val)\n return True\n\n def getRandom(self) -> int:\n if len(self.elt_list) * 2 <= len(self.elements):\n self.elt_list = list(self.elements)\n\n rand_elt = random.sample(self.elt_list, 1)\n while rand_elt[0] not in self.elements:\n rand_elt = random.sample(self.elt_list, 1)\n\n return rand_elt[0] \n\n\nclass RandomizedSet:\n\n def __init__(self):\n self.elt_list = []\n self.value_pos = {} # records the position of value in the list\n \n\n def insert(self, val: int) -> bool:\n if val in self.value_pos:\n return False\n else:\n self.value_pos[val] = len(self.elt_list)\n self.elt_list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.value_pos:\n return False\n else:\n i = self.value_pos[val]\n self.value_pos.pop(val)\n if i != len(self.elt_list) - 1:\n self.elt_list[i] = self.elt_list[-1]\n self.value_pos[self.elt_list[i]] = i\n self.elt_list.pop()\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.elt_list)\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()\n","runtime":"219"},{"code":"class RandomizedSet:\n\n def __init__(self):\n # dictionary hash map method \n self.dict = {}\n self.lst = []\n\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n else:\n n = len(self.lst)\n self.dict[val] = n\n self.lst.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.dict:\n return False\n else:\n idx = self.dict[val]\n temp = self.lst[-1]\n self.lst[-1] = self.lst[idx]\n self.lst[idx] = temp\n self.dict[temp] = idx\n self.lst.pop()\n self.dict.pop(val)\n return True\n \n def getRandom(self) -> int:\n rand = int(random.random() * len(self.lst))\n return self.lst[rand]\n \n \n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"223"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.store = []\n self.dic = {}\n \n\n def insert(self, val: int) -> bool:\n if val not in self.dic:\n self.store.append(val)\n self.dic[val] = len(self.store) - 1\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.dic:\n if self.dic[val] == len(self.store)-1:\n self.store.pop()\n else:\n last = self.store[-1]\n self.store[self.dic[val]], self.store[-1] = self.store[-1], self.store[self.dic[val]]\n self.dic[last] = self.dic[val]\n self.store.pop()\n del self.dic[val]\n return True\n else:\n return False\n \n def getRandom(self) -> int:\n return random.choice(self.store)\n \n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"223"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.map = dict()\n self.arrMap = []\n\n def insert(self, val: int) -> bool:\n if val in self.map:\n return False\n\n index = len(self.arrMap)\n self.map[val] = index\n\n self.arrMap.append(val)\n\n # print(f'map after insert of {val}: {self.map}')\n # print(f'arr after insert of {val}: {self.arrMap}')\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.map:\n return False\n\n remove_index = self.map.get(val)\n last_num = self.arrMap[len(self.arrMap) - 1]\n\n # Swap the last number and the number to be removed\n self.arrMap[remove_index], self.arrMap[len(self.arrMap) - 1] = self.arrMap[len(self.arrMap) - 1], self.arrMap[remove_index]\n\n # Remove the element\n self.arrMap.pop()\n\n # adjust the last num mapping\n self.map[last_num] = remove_index\n\n # remove entry for val\n self.map.pop(val)\n\n # print(f'map after remove of {val}: {self.map}')\n # print(f'arr after remove of {val}: {self.arrMap}')\n\n return True\n\n\n\n def getRandom(self) -> int:\n rnd = random.random() * len(self.arrMap)\n rand_index = math.floor(rnd)\n\n return self.arrMap[rand_index]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"228"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.random = {} # key: element, val: idx\n self.elements = []\n\n def insert(self, val: int) -> bool:\n if val in self.random:\n return False\n self.random[val] = len(self.elements)\n self.elements.append(val)\n return True\n \n def remove(self, val: int) -> bool:\n if val not in self.random:\n return False\n idx = self.random[val]\n lastVal = self.elements[-1]\n self.elements[idx] = lastVal\n self.random[lastVal] = idx\n self.elements.pop()\n del self.random[val]\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.elements)\n \n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"228"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.cache={}\n self.data=[]\n \n\n def insert(self, val: int) -> bool:\n if val in self.cache:return False\n self.cache[val]=len(self.data)\n self.data.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.cache:return False\n lastVal=self.data[-1]\n index=self.cache[val]\n self.cache[lastVal]=index\n self.data[index]=lastVal\n del self.cache[val]\n self.data.pop()\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.data)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"232"},{"code":"from random import randint\n\nclass RandomizedSet:\n\n def __init__(self):\n self.num_list = list()\n self.num_map = dict()\n \n def insert(self, val: int) -> bool:\n if val in self.num_map:\n return False\n \n self.num_map[val] = len(self.num_list)\n self.num_list.append(val)\n\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.num_map:\n return False\n\n val_idx = self.num_map[val]\n self.num_map[self.num_list[-1]] = val_idx\n self.num_list[val_idx] = self.num_list[-1]\n\n self.num_list.pop()\n self.num_map.pop(val)\n\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.num_list)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"232"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.items = {}\n self.indexes = []\n\n def insert(self, val: int) -> bool:\n if val in self.items:\n return False\n self.items[val] = len(self.indexes)\n self.indexes.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.items:\n return False\n idx = self.items[val]\n last_item = self.indexes[-1]\n self.indexes[idx] = last_item\n self.indexes.pop()\n self.items[last_item] = idx\n del self.items[val]\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.indexes)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()\n","runtime":"236"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.data = []\n self.map_data = {} \n\n def insert(self, val: int) -> bool:\n if val not in self.map_data:\n self.map_data[val] = len(self.data)\n self.data.append(val)\n return True \n else:\n return False\n \n def remove(self, val: int) -> bool:\n if val in self.map_data:\n val_ind = self.map_data[val]\n val_to_be_replaced = self.data[-1]\n\n self.map_data[val_to_be_replaced] = val_ind\n \n self.data[val_ind] = val_to_be_replaced\n self.data.pop()\n self.map_data.pop(val)\n return True\n else:\n return False\n \n def getRandom(self) -> int:\n return random.choice(self.data) \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"236"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.numMap = {}\n self.numList = []\n\n def insert(self, val: int) -> bool:\n # Return true if val not in map\n not_in_map = val not in self.numMap\n\n if not_in_map:\n # We will be adding this val at the end/new right index\n # in the list \n self.numMap[val] = len(self.numList)\n self.numList.append(val)\n \n return not_in_map\n\n def remove(self, val: int) -> bool:\n in_map = val in self.numMap\n\n if in_map:\n index = self.numMap[val]\n lastVal = self.numList[-1]\n self.numList[index] = lastVal\n self.numList.pop()\n\n self.numMap[lastVal] = index\n del self.numMap[val]\n\n return in_map\n \n\n def getRandom(self) -> int:\n return random.choice(self.numList)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"240"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list = []\n self.map = {}\n\n def insert(self, val: int) -> bool:\n if val in self.map:\n return False\n self.list.append(val)\n self.map[val] = len(self.list)-1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.map:\n # get value of top element and index of value to be removed\n replace_val, remove_val_index = self.list[-1], self.map[val]\n self.list[remove_val_index], self.map[replace_val] = replace_val, remove_val_index\n # delete value in map\n del self.map[val]\n self.list.pop()\n return True\n return False\n\n def getRandom(self) -> int:\n return choice(self.list)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"240"},{"code":"class RandomizedSet:\n def __init__(self):\n self.lst=[]\n self.idx_map={}\n def search(self, val):\n return val in self.idx_map\n def insert(self, val: int) -> bool:\n if self.search(val):\n return False \n self.lst.append(val)\n self.idx_map[val] = len(self.lst) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if not self.search(val):\n return False\n idx = self.idx_map[val]\n self.lst[idx] = self.lst[-1]\n self.idx_map[self.lst[-1]] = idx\n self.lst.pop()\n del self.idx_map[val]\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.lst)\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"245"},{"code":"from random import choice\n\nclass RandomizedSet:\n\n def __init__(self):\n self.mylist = []\n self.mydict = {}\n \n\n def insert(self, val: int) -> bool:\n if val in self.mydict:\n return False\n\n new_idx = len(self.mylist)\n self.mydict[val] = new_idx\n self.mylist.append(val)\n\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.mydict:\n return False\n\n last_element = self.mylist[-1]\n idx = self.mydict[val]\n\n self.mylist[idx] = last_element\n self.mydict[last_element] = idx\n\n self.mylist.pop()\n del self.mydict[val]\n\n return True\n\n def getRandom(self) -> int:\n return choice(self.mylist)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"245"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.numMap = {}\n self.numList = []\n\n def insert(self, val: int) -> bool:\n res = val not in self.numMap\n if res:\n self.numMap[val] = len(self.numList)\n self.numList.append(val)\n return res\n\n def remove(self, val: int) -> bool:\n res = val in self.numMap\n if res:\n idx = self.numMap[val]\n lastVal = self.numList[-1]\n self.numMap[lastVal] = idx\n self.numList[idx] = lastVal\n self.numList.pop()\n del self.numMap[val]\n return res\n\n def getRandom(self) -> int:\n return random.choice(self.numList)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"249"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list=[]\n self.mp={}\n \n def search(self, val):\n return val in self.mp\n\n def insert(self, val: int) -> bool:\n if self.search(val):\n return False\n self.list.append(val)\n self.mp[val]=len(self.list)-1\n return True\n\n def remove(self, val: int) -> bool:\n if not self.search(val):\n return False\n idx=self.mp[val]\n self.list[idx]=self.list[-1]\n self.mp[self.list[-1]]=idx\n self.list.pop()\n del self.mp[val]\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.list)\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"249"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.s = dict()\n self.l = list()\n\n def insert(self, val: int) -> bool:\n if val in self.s:\n return False\n else:\n self.l.append(val)\n self.s[val] = len(self.l) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.s:\n return False\n else:\n index = self.s[val]\n last_val = self.l[len(self.l) - 1]\n self.s[last_val] = index\n\n self.l[len(self.l) - 1], self.l[index] = self.l[index], self.l[len(self.l) - 1]\n\n del self.s[val]\n self.l.pop()\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.l)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"253"},{"code":"class RandomizedSet:\n def __init__(self):\n self.vals = []\n self.valToIndex = collections.defaultdict(int) # {val: index in vals}\n\n def insert(self, val: int) -> bool:\n if val in self.valToIndex:\n return False\n self.valToIndex[val] = len(self.vals)\n self.vals.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.valToIndex:\n return False\n index = self.valToIndex[val]\n # The order of the following two lines is important when vals.size() == 1.\n self.valToIndex[self.vals[-1]] = index\n del self.valToIndex[val]\n self.vals[index] = self.vals[-1]\n self.vals.pop()\n return True\n\n def getRandom(self) -> int:\n index = random.randint(0, len(self.vals) - 1)\n return self.vals[index]","runtime":"253"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.rand_map = {}\n self.rand_list = []\n\n def insert(self, val: int) -> bool:\n if val in self.rand_map:\n return False\n self.rand_map[val] = len(self.rand_list)\n self.rand_list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.rand_map:\n last_elem, index = self.rand_list[-1], self.rand_map[val]\n self.rand_list[index], self.rand_map[last_elem] = last_elem, index\n self.rand_list.pop()\n del self.rand_map[val]\n return True\n return False\n\n def getRandom(self) -> int:\n return choice(self.rand_list)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"257"},{"code":"import math\nfrom random import random\nclass RandomizedSet:\n sett = []\n def __init__(self):\n self.sett = []\n\n def insert(self, val: int) -> bool:\n #print(f\"inserting {val} into set:\")\n #print(self.sett)\n if len(self.sett) == 0:\n self.sett = [val]\n return True\n i = self.getidx(val)\n if i > 0:\n return False\n elif i == 0:\n if self.sett[0] == val:\n return False\n else:\n self.sett.insert(0,val)\n return True\n else:\n self.sett.insert(-i,val)\n return True\n\n def remove(self, val: int) -> bool:\n # print(f\"removing {val} from set:\")\n #print(self.sett)\n if len(self.sett) == 0:\n return False\n i = self.getidx(val)\n if i >= 0:\n if i == len(self.sett):\n return False\n if self.sett[i] == val:\n del self.sett[i]\n return True\n else:\n return False\n else:\n return False\n\n def getRandom(self) -> int:\n i = math.floor(random() * len(self.sett))\n return self.sett[i]\n \n def getidx(self, val: int) -> int:\n top = len(self.sett)\n if top == 0:\n return 0\n bot = 0\n i = math.floor((top + bot) / 2)\n c = 0\n while self.sett[i] != val:\n if self.sett[i] > val:\n top = i\n else:\n bot = i\n i = math.floor((top + bot) / 2)\n if top == bot + 1:\n if val > self.sett[i]:\n return 0-top\n else:\n return 0-bot\n elif top == bot:\n return bot\n return i\n\n \n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"257"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n # Dictionary to store value -> index mapping\n self.val_to_index = {}\n # List to store the values\n self.values = []\n\n def insert(self, val: int) -> bool:\n # If the value already exists in the set, return False\n if val in self.val_to_index:\n return False\n # Otherwise, add it to the list and store its index in the dictionary\n self.values.append(val)\n self.val_to_index[val] = len(self.values) - 1\n return True\n\n def remove(self, val: int) -> bool:\n # If the value doesn't exist in the set, return False\n if val not in self.val_to_index:\n return False\n # Get the index of the element to remove\n index_to_remove = self.val_to_index[val]\n # Swap the element to remove with the last element in the list\n last_element = self.values[-1]\n self.values[index_to_remove] = last_element\n self.val_to_index[last_element] = index_to_remove\n # Remove the last element from the list and delete the value from the dictionary\n self.values.pop()\n del self.val_to_index[val]\n return True\n\n def getRandom(self) -> int:\n # Return a random element from the list\n return random.choice(self.values)\n","runtime":"262"},{"code":"class RandomizedSet:\n def __init__(self):\n self.values = []\n self.indices = {}\n\n def insert(self, val: int) -> bool:\n if val in self.indices:\n return False\n self.values.append(val)\n self.indices[val] = len(self.values)-1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.indices:\n return False\n index = self.indices.pop(val)\n if index == len(self.values)-1:\n self.values.pop()\n else:\n repl = self.values.pop()\n self.values[index] = repl\n self.indices[repl] = index\n return True\n\n def getRandom(self) -> int:\n i = randint(0, len(self.values)-1)\n return self.values[i]","runtime":"262"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.rand_set = {}\n self.rand_set_array = []\n self.index = 0\n self.removes = 0\n\n def insert(self, val: int) -> bool:\n if self.rand_set.get(val) is not None:\n return False\n self.rand_set[val] = self.index\n self.rand_set_array.append(val)\n self.index += 1\n return True\n\n def remove(self, val: int) -> bool:\n if self.rand_set.get(val) is not None:\n last = self.rand_set_array[-1]\n index = self.rand_set[val]\n self.rand_set_array[index] = last\n self.rand_set_array.pop(-1)\n\n self.rand_set[last] = index\n del self.rand_set[val]\n self.index -= 1\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.rand_set_array)\n\n def getRandom(self) -> int:\n return random.choice(self.rand_set_array)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"266"},{"code":"class RandomizedSet:\n def __init__(self):\n self.v = []\n self.mp = {}\n \n def search(self, val: int) -> bool:\n return val in self.mp\n \n def insert(self, val: int) -> bool:\n if val in self.mp:\n return False\n \n self.v.append(val)\n self.mp[val] = len(self.v) - 1\n return True\n \n def remove(self, val: int) -> bool:\n if val not in self.mp:\n return False\n \n # Get index of the element to remove\n index = self.mp[val]\n last_element = self.v[-1]\n \n # Swap with the last element and remove\n self.v[index] = last_element\n self.mp[last_element] = index\n self.v.pop()\n del self.mp[val]\n \n return True\n \n def getRandom(self) -> int:\n return random.choice(self.v)\n","runtime":"266"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.pos = {}\n self.nums = []\n\n def insert(self, val: int) -> bool:\n if val in self.pos:\n return False\n else:\n self.nums.append(val)\n self.pos[val]=len(self.nums)-1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.pos:\n #swap number with last index, then delete assuming last\n valIdx = self.pos[val]\n lastElement = self.nums[-1]\n self.nums[valIdx],self.nums[-1] = lastElement,self.nums[valIdx]\n self.pos[val],self.pos[lastElement] = self.pos[lastElement],self.pos[val]\n\n del self.pos[val]\n self.nums.pop()\n\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return self.nums[random.randint(0,len(self.nums)-1)]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"283"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.st = {}\n self.ls = []\n self.size = 0\n\n def insert(self, val: int) -> bool:\n if val not in self.st:\n self.ls.append(val)\n self.st[val] = len(self.ls)-1\n self.size += 1\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.st:\n ix = self.st[val]\n if ix != len(self.ls)-1:\n self.ls[ix], self.ls[-1] = self.ls[-1], self.ls[ix]\n self.st[self.ls[ix]] = ix\n self.ls.pop()\n del self.st[val]\n self.size -= 1\n return True\n return False\n\n def getRandom(self) -> int:\n ix = random.randint(0, self.size-1)\n return self.ls[ix]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"283"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.s = []\n self.d = dict()\n \n \n\n def insert(self, val: int) -> bool:\n #print(val, self.s, self.d)\n if val in self.d:\n return False\n else:\n self.s.append(val)\n self.d[val] = len(self.s)-1\n return True\n \n \n\n def remove(self, val: int) -> bool:\n if val not in self.d:\n return False\n idx = self.d[val]\n self.d[self.s[-1]] = idx\n self.s[idx] = self.s[-1]\n self.s.pop()\n del self.d[val]\n return True\n \n \n \n\n def getRandom(self) -> int:\n n = len(self.s)-1\n r = random.randint(0, n)\n return self.s[r]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"287"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.array = []\n self.hmp = {}\n\n def insert(self, val: int) -> bool:\n if val in self.hmp:\n return False\n\n self.hmp[val] = len(self.array)\n self.array.append(val)\n\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.hmp:\n return False\n\n if self.hmp[val] != len(self.array) - 1:\n ind = self.hmp[val]\n self.array[ind] = self.array[len(self.array) - 1]\n self.hmp[self.array[ind]] = ind\n\n self.hmp.pop(val)\n self.array.pop(len(self.array) - 1)\n return True\n\n def getRandom(self) -> int:\n return self.array[randint(0, len(self.array)-1)]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"287"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.array = []\n self.mapping = dict()\n\n def insert(self, val: int) -> bool:\n if val in self.mapping.keys():\n return False\n\n self.array.append(val)\n self.mapping[val] = len(self.array) - 1\n\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.mapping.keys():\n return False\n\n idx = self.mapping[val]\n last_idx = len(self.array) - 1\n\n if idx == last_idx:\n self.array.pop()\n self.mapping.pop(val, None)\n else:\n self.array[idx] = self.array[last_idx]\n self.array.pop()\n\n self.mapping[self.array[idx]] = idx\n self.mapping.pop(val, None)\n\n return True\n\n def getRandom(self) -> int:\n idx = random.randint(0, len(self.array) - 1)\n return self.array[idx]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"292"},{"code":"from random import randint\n\n\nclass RandomizedSet:\n contents_by_val: dict[int, int] # value, id\n contents_by_index: dict[int, int] # index, value\n\n def __init__(self):\n self.contents_by_val = {}\n self.contents_by_index = {}\n\n def insert(self, val: int) -> bool:\n if val in self.contents_by_val:\n return False\n\n index: int = len(self.contents_by_val)\n self.contents_by_index[index] = val\n self.contents_by_val[val] = index\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.contents_by_val:\n return False\n\n index: int = self.contents_by_val[val]\n\n # If the removal will leave a gap, fill it\n if index < len(self.contents_by_val):\n last_index: int = len(self.contents_by_index) - 1\n last_val: int = self.contents_by_index[last_index]\n self.contents_by_val[last_val] = index\n self.contents_by_index[index] = last_val\n del self.contents_by_index[last_index]\n del self.contents_by_val[val]\n return True\n\n # Otherwise just remove the entries\n del self.contents_by_val[val]\n del self.contents_by_index[index]\n return True\n\n def getRandom(self) -> int:\n return self.contents_by_index[randint(0, len(self.contents_by_index) - 1)]\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()\n","runtime":"292"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.List = []\n self.KeyDict = {}\n\n def insert(self, val: int) -> bool:\n if val not in self.KeyDict:\n self.List.append(val)\n self.KeyDict[val] = len(self.List)-1\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.KeyDict:\n a = self.List.pop()\n if a!=val:\n self.List[self.KeyDict[val]] = a\n self.KeyDict[a] = self.KeyDict[val]\n self.KeyDict.pop(val)\n return True\n else:\n return False\n \n\n def getRandom(self) -> int:\n return self.List[random.randint(0, len(self.List) - 1)]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"296"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.map={}\n self.list=[]\n\n def insert(self, val: int) -> bool:\n res=val not in self.map\n if res:\n self.map[val]=len(self.list)\n self.list.append(val)\n \n return res\n\n def remove(self, val: int) -> bool:\n res=val in self.map\n if res:\n inx=self.map[val]\n lastVal=self.list[-1]\n self.list[inx]=lastVal\n self.map[lastVal]=inx\n self.list.pop()\n del self.map[val]\n return res\n\n def getRandom(self) -> int:\n inx=random.randint(0,len(self.list)-1)\n return self.list[inx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"296"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.nums, self.pos = [], {}\n\n def insert(self, val: int) -> bool:\n if val in self.pos:\n return False\n\n self.nums.append(val)\n self.pos[val] = len(self.nums) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.pos:\n idx, last = self.pos[val], self.nums[-1]\n self.nums[idx] = last \n self.pos[last] = idx\n self.nums.pop()\n self.pos.pop(val, 0)\n return True\n return False\n \n def getRandom(self) -> int:\n\n return self.nums[random.randint(0, len(self.nums) - 1)]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"300"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.idx_to_val = {}\n self.val_to_idx = {}\n self.size = 0\n\n def insert(self, val: int) -> bool:\n if val in self.val_to_idx:\n # print(f'{val} already present in RandomizedSet')\n return False\n self.size += 1\n idx = self.size\n self.idx_to_val[idx] = val\n self.val_to_idx[val] = idx\n # print(f'after insert {val}, size={self.size}, idx_to_val={self.idx_to_val}, val_to_idx={self.val_to_idx}')\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.val_to_idx:\n # print(f'{val} not present in RandomizedSet')\n return False\n if self.size == 1:\n del self.val_to_idx[val]\n del self.idx_to_val[1]\n else:\n idx = self.val_to_idx[val]\n repl_val = self.idx_to_val[self.size]\n self.val_to_idx[repl_val] = idx\n self.idx_to_val[idx] = repl_val\n del self.val_to_idx[val]\n del self.idx_to_val[self.size]\n self.size -= 1\n # print(f'after remove {val}, size={self.size}, idx_to_val={self.idx_to_val}, val_to_idx={self.val_to_idx}')\n return True\n\n def getRandom(self) -> int:\n idx = random.randint(1, self.size)\n return self.idx_to_val[idx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"300"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.data = {}\n self.arr = []\n \n\n def insert(self, val: int) -> bool:\n if val in self.data:\n return False\n else:\n self.arr.append(val)\n self.data[val] = len(self.arr) - 1\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.data:\n return False\n else:\n idx_of_delete = self.data[val]\n last_number = self.arr[-1]\n self.arr[-1], self.arr[idx_of_delete] = val, last_number\n self.arr.pop()\n self.data[last_number] = idx_of_delete\n del self.data[val]\n return True\n \n\n def getRandom(self) -> int:\n random_int = random.randint(0, len(self.arr) - 1)\n return self.arr[random_int]\n \n \n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"305"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.record = []\n self.weights = []\n self.map = {}\n self.last = -1\n\n def insert(self, val: int) -> bool:\n if self.map.get(val, None) is not None:\n return False\n self.last += 1\n self.map[val] = self.last\n if self.last >= len(self.record):\n self.record.append(val)\n self.weights.append(1)\n else:\n self.record[self.last] = val\n self.weights[self.last] = 1\n return True\n\n def remove(self, val: int) -> bool:\n if self.map.get(val, None) is None:\n return False\n self.map[self.record[self.last]] = self.map[val]\n self.record[self.map[val]] = self.record[self.last]\n self.map[val] = None\n self.weights[self.last] = 0\n self.last -= 1\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.record[:(self.last+1)])\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"305"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.tableSet = set()\n self.table = []\n\n def insert(self, val: int) -> bool:\n if val not in self.tableSet:\n self.tableSet.add(val)\n self.table.append(val)\n\n return True\n return False\n \n def remove(self, val: int) -> bool:\n if val in self.tableSet:\n self.tableSet.remove(val)\n idx = self.table.index(val)\n self.table[idx] = self.table[-1]\n self.table.pop()\n return True\n return False\n\n def getRandom(self) -> int:\n idx = random.randrange(0, len(self.table))\n return self.table[idx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"309"},{"code":"class RandomizedSet:\n \n def __init__(self):\n self.val_to_idx = {}\n self.vals = []\n\n def insert(self, val: int) -> bool:\n if val not in self.val_to_idx:\n self.val_to_idx[val] = len(self.val_to_idx)\n self.vals.append(val)\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.val_to_idx:\n i = self.val_to_idx[val]\n self.vals[i] = self.vals[-1]\n self.val_to_idx[self.vals[-1]] = i\n del self.val_to_idx[val]\n self.vals.pop()\n return True\n return False\n\n def getRandom(self) -> int:\n import random\n return self.vals[random.randint(0, len(self.vals)-1)]\n \n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"309"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.l = []\n self.d = {}\n\n def insert(self, val: int) -> bool:\n if val in self.d:\n return False\n else:\n self.l.append(val)\n self.d[val] = len(self.l) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.d:\n self.l[self.d[val]] = self.l[-1]\n self.d[self.l[-1]] = self.d[val]\n del self.d[val]\n self.l.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n import random\n return random.choice(list(self.l))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"313"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.map = {}\n self.lst = []\n \n def insert(self, val: int) -> bool:\n if val in self.map:\n return False\n \n self.map[val] = len(self.lst)\n self.lst.append(val)\n\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.lst:\n return False\n\n last_element = self.lst[-1]\n index_del_element = self.map[val]\n\n self.lst[index_del_element] = last_element\n self.map[last_element] = index_del_element\n\n self.lst.pop()\n del self.map[val]\n\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.lst)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"313"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.index = {}\n self.data = [0] * (2 * 10 ** 5 + 1)\n self.idx = 0\n \n\n def insert(self, val: int) -> bool:\n if val in self.index:\n return False\n self.data[self.idx] = val\n self.index[val] = self.idx\n self.idx += 1\n return True\n \n\n def remove(self, val: int) -> bool:\n if not val in self.index:\n return False\n val_position = self.index[val]\n last_position = self.idx - 1\n last_val = self.data[last_position]\n\n # exchange value\n self.data[val_position], self.data[last_position] = self.data[last_position], self.data[val_position]\n\n # update index\n self.index[last_val] = val_position\n del self.index[val]\n \n self.idx -= 1\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.data[:self.idx])\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"317"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.data = []\n self.mapping = dict()\n \n\n def insert(self, val: int) -> bool:\n if val in self.mapping:\n return False\n else:\n self.mapping[val] = len(self.data)\n self.data.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.data:\n last, idx = self.data[-1], self.mapping[val]\n self.data[idx], self.mapping[last] = last, idx \n self.data.pop()\n del self.mapping[val]\n return True\n else:\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.data)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"317"},{"code":"from random import choice\n\n\nclass RandomizedSet:\n\n def __init__(self):\n self.dict = {}\n self.list = []\n\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n self.list.append(val)\n self.dict[val] = len(self.list)-1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.list:\n return False\n i,last_el = self.dict[val],self.list[-1]\n self.list[i],self.dict[last_el] = last_el,i\n self.list.pop()\n del self.dict[val]\n return True\n\n def getRandom(self) -> int:\n return choice(self.list)\n","runtime":"322"},{"code":"class RandomizedSet:\n d = {}\n arr = []\n def __init__(self):\n self.d = {}\n self.arr = []\n\n def insert(self, val: int) -> bool:\n print(\"insert\")\n if val not in self.d:\n self.d[val] = len(self.arr)\n self.arr.append(val)\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.d:\n other_val = self.arr[-1]\n index, other_index = self.d[val], self.d[other_val]\n\n self.d[other_val]= index\n self.d.pop(val)\n\n self.arr[index] = other_val\n self.arr.pop()\n return True\n return False\n\n def getRandom(self) -> int:\n print(\"random\")\n index = random.randint(0, len(self.arr) - 1)\n return self.arr[index]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"322"},{"code":"'''\n\nInsert and delete in O(1) time is trivial. Just use a set.\nGetRandom is a bit more annoying. For that, we ideally have all of the data indexed as an array...\n\nOk, so... let's just do that?\n- Have an array that keeps unique elements. Append to it as needed.\n- Have a dict that maps from elem --> idx.\n\nInsertions are easy.\nGetting random is easy.\n\nHow do we remove? We need O(1) removal from an array.\n\nHonestly, we get *average* O(1) just by using a hashset.\n- Pick random: if you \"miss\", just reroll.\n\n'''\n\nimport random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.val_to_idx = {}\n self.data = []\n\n def prune(self):\n if len(self.data) > len(self.val_to_idx) * 2:\n self.data = [val for val in self.data if val is not None]\n self.val_to_idx = dict(zip(self.data, range(len(self.data))))\n\n def insert(self, val: int) -> bool:\n self.prune()\n if val in self.val_to_idx:\n return False\n self.val_to_idx[val] = len(self.data)\n self.data.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n self.prune()\n present = val in self.val_to_idx\n if present:\n idx = self.val_to_idx[val]\n del self.val_to_idx[val]\n self.data[idx] = None\n return present\n\n def getRandom(self) -> int:\n while True:\n idx = random.randint(0, len(self.data) - 1)\n if self.data[idx] is not None:\n return self.data[idx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"326"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.arr=[]\n self.idx={}\n\n def insert(self, val: int) -> bool:\n if val not in self.idx:\n self.arr.append(val)\n self.idx[val]=len(self.arr)-1\n return True\n return False\n \n\n def remove(self, val: int) -> bool:\n if val in self.arr:\n id=self.idx[val]\n self.arr[id]=self.arr[-1]\n self.idx[self.arr[-1]]=id\n self.arr.pop()\n del self.idx[val]\n return True\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.arr)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"326"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.vals = set()\n self.items = []\n\n def insert(self, val: int) -> bool:\n if val in self.vals:\n return False\n self.vals.add(val)\n self.items.append(val)\n return True\n \n def remove(self, val: int) -> bool:\n if val not in self.vals:\n return False\n self.vals.remove(val)\n self.items.remove(val)\n return True\n\n def getRandom(self) -> int:\n idx = random.randint(0,len(self.items)-1)\n return self.items[idx]\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"330"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list = set()\n self.hashmap = []\n\n def insert(self, val: int) -> bool:\n if val in self.list:\n return False\n else:\n self.list.add(val)\n self.hashmap.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.list:\n return False\n else:\n self.list.remove(val)\n last = self.hashmap[-1]\n index_of_val = self.hashmap.index(val)\n self.hashmap[index_of_val] = last\n self.hashmap.pop()\n\n return True \n\n def getRandom(self) -> int:\n randomIndex = random.randint(0, len(self.list) -1)\n return self.hashmap[randomIndex]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"330"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.dict = dict()\n self.list = []\n self.len = 0 \n\n def insert(self, val: int) -> bool:\n if val not in self.dict:\n self.list.append(val)\n self.dict[val] = self.len\n self.len += 1\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.dict:\n self.dict.pop(val, None)\n self.list.remove(val)\n self.len -= 1\n return True\n else:\n return False \n\n def getRandom(self) -> int:\n return self.list[random.randint(0, self.len-1)]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"334"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.r_set = set()\n self.r_list = list()\n\n def insert(self, val: int) -> bool:\n if val in self.r_set:\n return False\n self.r_set.add(val)\n self.r_list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.r_set:\n self.r_set.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n ran = random.randint(0, len(self.r_list) - 1)\n while (self.r_list[ran] not in self.r_set):\n ran = random.randint(0, len(self.r_list) - 1)\n return self.r_list[ran]\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"334"},{"code":"from random import randint\n\nclass RandomizedSet:\n\n def __init__(self):\n self.s1 = set()\n self.s2 = set()\n self.l = []\n\n def insert(self, val: int) -> bool:\n if val in self.s1:\n return False\n elif val not in self.s2:\n self.s2.add(val)\n self.l.append(val)\n self.s1.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.s1:\n self.s1.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n val = self.l[randint(0, len(self.l)-1)]\n while val not in self.s1:\n val = self.l[randint(0, len(self.l)-1)]\n return val\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"339"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.l=[]\n self.m={}\n \n\n def insert(self, val: int) -> bool:\n if val not in self.m:\n self.l.append(val)\n self.m[val]=val\n return True\n return False \n\n def remove(self, val: int) -> bool:\n if val not in self.m:\n return False\n else:\n ele=self.m[val]\n self.l.remove(ele)\n del self.m[val]\n return True\n \n\n def getRandom(self) -> int:\n r1 = random.randint(0,len(self.l)-1)\n return self.l[r1]\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"339"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.nums = []\n self.indexes = {}\n self.voids = set()\n\n def insert(self, val: int) -> bool:\n if val in self.indexes:\n return False\n\n self.indexes[val] = len(self.nums)\n self.nums.append(val)\n\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.indexes:\n return False\n \n i = self.indexes[val]\n self.voids.add(i)\n del(self.indexes[val])\n\n return True\n \n\n def getRandom(self) -> int:\n n = len(self.nums) - 1\n i = random.randint(0, n)\n\n while i in self.voids:\n i = random.randint(0, n)\n\n\n return self.nums[i]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"343"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.s = {}\n self.a = []\n self.index = 0\n\n def insert(self, val: int) -> bool:\n if val in self.s:\n return False\n else:\n self.s[val] = self.index\n self.index += 1\n self.a.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.s:\n self.index -= 1\n i = self.s[val]\n last = self.a[-1]\n self.a[i] = last\n self.s[last] = i\n self.s.pop(val)\n self.a.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choices(self.a,k=1)[0]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"343"},{"code":"import random\nimport time\n\nclass RandomizedSet:\n\n def __init__(self):\n\n timestamp = time.time()\n \n self.my_set = set()\n self.my_list = []\n\n def insert(self, val: int) -> bool:\n\n if val in self.my_set:\n insert_exist = True\n\n else: \n insert_exist = False\n self.my_set.add(val)\n self.my_list.append(val)\n\n return not insert_exist\n \n\n def remove(self, val: int) -> bool:\n \n if val in self.my_set:\n remove_exist = True\n self.my_set.remove(val)\n self.my_list.remove(val)\n \n else: \n remove_exist = False\n\n return remove_exist\n\n\n def getRandom(self) -> int:\n \n random_element = random.choice(self.my_list)\n print(random_element)\n\n\n return random_element\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"347"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.vals = collections.OrderedDict()\n self.list = []\n\n def insert(self, val: int) -> bool:\n if val in self.vals:\n return False\n self.list.append(val)\n self.vals[val] = len(self.list) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.vals:\n return False\n \n lastElement, index = self.list[-1], self.vals[val]\n self.list[index] = lastElement\n self.list.pop()\n\n self.vals[lastElement] = index\n del self.vals[val]\n return True\n\n def getRandom(self) -> int:\n return choices(self.list)[0]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"347"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.num_index = {}\n self.index_num = {}\n self.count = 0\n self.spare_indexes = []\n\n def insert(self, val: int) -> bool:\n if val in self.num_index:\n return False\n if len(self.spare_indexes) > 0:\n index = self.spare_indexes.pop()\n self.num_index[val] = index\n self.index_num[index] = val\n \n else:\n self.num_index[val] = self.count\n self.index_num[self.count] = val\n self.count += 1\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.num_index:\n return False\n index = self.num_index[val]\n self.spare_indexes.append(index)\n del self.num_index[val]\n del self.index_num[index]\n\n return True\n\n def getRandom(self) -> int:\n while True:\n index = random.randint(0, self.count)\n if index in self.index_num:\n return self.index_num[index]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"352"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.baseval = float('inf')\n self.vals = []\n self.allinserts = []\n\n def insert(self, val: int) -> bool:\n if len(self.vals) == 0:\n self.baseval = abs(val)\n self.allinserts = [val]\n if val < 0:\n self.vals = [1]\n else:\n self.vals = [2]\n return True\n if abs(val) > len(self.vals) - 1 + self.baseval:\n tempvals = [0] * (abs(val) + 1 - self.baseval)\n tempvals[:len(self.vals)] = self.vals\n self.vals = tempvals\n if val < 0:\n self.vals[abs(val) - self.baseval] = 1\n self.allinserts.append(val)\n return True\n else:\n self.vals[val - self.baseval] = 2\n self.allinserts.append(val)\n return True\n elif abs(val) < self.baseval:\n tempvals = [0] * (len(self.vals) + (self.baseval - abs(val)))\n tempvals[self.baseval - abs(val):] = self.vals\n self.vals = tempvals\n self.baseval = abs(val)\n if val < 0:\n self.vals[abs(val) - self.baseval] = 1\n self.allinserts.append(val)\n return True\n else:\n self.vals[val - self.baseval] = 2\n self.allinserts.append(val)\n return True\n else:\n if val < 0:\n if self.vals[abs(val) - self.baseval] == 1:\n return False\n elif self.vals[abs(val) - self.baseval] == 0:\n self.vals[abs(val) - self.baseval] = 1\n self.allinserts.append(val)\n return True\n elif self.vals[abs(val) - self.baseval] == 3:\n return False\n else:\n self.vals[abs(val) - self.baseval] = 3\n self.allinserts.append(val)\n return True\n else:\n if self.vals[val - self.baseval] == 1:\n self.vals[val - self.baseval] = 3\n self.allinserts.append(val)\n return True\n elif self.vals[val - self.baseval] == 0:\n self.vals[val - self.baseval] = 2\n self.allinserts.append(val)\n return True\n elif self.vals[val - self.baseval] == 3:\n return False\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if len(self.vals) == 0 or abs(val) > len(self.vals) - 1 + self.baseval or abs(val) < self.baseval:\n return False\n if val < 0:\n if self.vals[abs(val) - self.baseval] == 1:\n self.vals[abs(val) - self.baseval] = 0\n return True\n elif self.vals[abs(val) - self.baseval] == 0:\n return False\n elif self.vals[abs(val) - self.baseval] == 3:\n self.vals[abs(val) - self.baseval] = 2\n return True\n else:\n return False\n if val >= 0:\n if self.vals[val - self.baseval] == 1:\n return False\n elif self.vals[val - self.baseval] == 0:\n return False\n elif self.vals[val - self.baseval] == 3:\n self.vals[val - self.baseval] = 1\n return True\n else:\n self.vals[val - self.baseval] = 0\n return True\n\n def getRandom(self) -> int:\n while True:\n candidate = random.choice(self.allinserts)\n if candidate < 0:\n if self.vals[abs(candidate) - self.baseval] == 1 or self.vals[abs(candidate) - self.baseval] == 3:\n return candidate\n else:\n if self.vals[candidate - self.baseval] == 2 or self.vals[candidate - self.baseval] == 3:\n return candidate\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"352"},{"code":"class DynamicList:\n def __init__(self, init_size = 10, hash_table = {}):\n self.array = [0 for _ in range(init_size)]\n self.size = init_size\n self.init_size = init_size\n self.num_elements = 0\n self.current_index = 0\n self.valid = [False for _ in range(init_size)]\n self.hash_table = hash_table\n\n def refresh(self):\n new_size = int(self.size / 2)\n new_array = [0 for _ in range(new_size)]\n new_valid = [False for _ in range(new_size)]\n j = 0\n for i in range(self.current_index):\n if self.valid[i] == True:\n val = self.array[i]\n self.hash_table[val] = j\n new_array[j] = val\n new_valid[j] = True\n j += 1\n \n\n self.array = new_array\n self.valid = new_valid\n self.num_elements = j - 1\n self.current_index = j\n self.size = new_size\n\n def insert(self, val):\n i = self.current_index\n if i > self.size - 1:\n #double the size of the array\n self.array.extend([0 for _ in range(self.size)])\n self.valid.extend([False for _ in range(self.size)])\n self.size *= 2\n\n self.array[i] = val\n self.valid[i] = True\n self.current_index += 1\n self.num_elements += 1\n return i\n\n def remove(self, index):\n self.valid[index] = False\n self.num_elements -= 1\n if (self.size > self.init_size and self.num_elements < self.size / 4):\n self.refresh()\n\n \n def get_random(self):\n found = False\n while not found:\n i = random.randint(0, self.current_index - 1)\n if (self.valid[i] == True):\n return self.array[i]\n\n\n\n\nclass RandomizedSet:\n\n def __init__(self):\n self.hashtable = {}\n self.dynamic_list = DynamicList(init_size = 50, hash_table = self.hashtable)\n \n def insert(self, val: int) -> bool:\n if val in self.hashtable:\n return False\n i = self.dynamic_list.insert(val)\n self.hashtable[val] = i\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.hashtable:\n return False\n i = self.hashtable[val]\n self.dynamic_list.remove(i)\n del self.hashtable[val]\n return True\n\n def getRandom(self) -> int:\n return self.dynamic_list.get_random()\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"356"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.seen = set()\n self.arr = []\n \n def insert(self, val: int) -> bool:\n if val not in self.seen:\n self.seen.add(val)\n self.arr.append(val)\n return True\n return False\n \n def remove(self, val: int) -> bool:\n if val not in self.seen:\n return False\n self.seen.remove(val)\n return True\n \n def getRandom(self) -> int:\n while True:\n N = len(self.arr)\n r = random.randint(0, N-1)\n if self.arr[r] in self.seen:\n return self.arr[r]\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"356"},{"code":"class DynamicList:\n def __init__(self, init_size = 10, hash_table = {}):\n self.array = [0 for _ in range(init_size)]\n self.size = init_size\n self.init_size = init_size\n self.num_elements = 0\n self.current_index = 0\n self.valid = [False for _ in range(init_size)]\n self.hash_table = hash_table\n\n def refresh(self):\n new_size = int(self.size / 2)\n new_array = [0 for _ in range(new_size)]\n new_valid = [False for _ in range(new_size)]\n j = 0\n for i in range(self.current_index):\n if self.valid[i] == True:\n val = self.array[i]\n self.hash_table[val] = j\n new_array[j] = val\n new_valid[j] = True\n j += 1\n \n\n self.array = new_array\n self.valid = new_valid\n self.num_elements = j - 1\n self.current_index = j\n self.size = new_size\n\n def insert(self, val):\n i = self.current_index\n if i > self.size - 1:\n #double the size of the array\n self.array.extend([0 for _ in range(self.size)])\n self.valid.extend([False for _ in range(self.size)])\n self.size *= 2\n\n self.array[i] = val\n self.valid[i] = True\n self.current_index += 1\n self.num_elements += 1\n return i\n\n def remove(self, index):\n self.valid[index] = False\n self.num_elements -= 1\n if (self.size > self.init_size and self.num_elements < self.size / 4):\n self.refresh()\n\n \n def get_random(self):\n found = False\n while not found:\n i = random.randint(0, self.current_index - 1)\n if (self.valid[i] == True):\n return self.array[i]\n\n\n\n\nclass RandomizedSet:\n\n def __init__(self):\n self.hashtable = {}\n self.dynamic_list = DynamicList(init_size = 5, hash_table = self.hashtable)\n \n def insert(self, val: int) -> bool:\n if val in self.hashtable:\n return False\n i = self.dynamic_list.insert(val)\n self.hashtable[val] = i\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.hashtable:\n return False\n i = self.hashtable[val]\n self.dynamic_list.remove(i)\n del self.hashtable[val]\n return True\n\n def getRandom(self) -> int:\n return self.dynamic_list.get_random()\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"360"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.vals = {}\n self.list = []\n\n def insert(self, val: int) -> bool:\n print(len(self.vals))\n if val in self.vals:\n return False \n \n self.list.append(val)\n self.vals[val] = len(self.list) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.vals:\n return False \n index, lastElement = self.vals[val], self.list[-1]\n self.list[index] = lastElement\n self.list.pop()\n\n self.vals[lastElement] = index\n del self.vals[val]\n\n return True\n \n\n def getRandom(self) -> int:\n return choices(self.list)[0]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"360"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.setstore = {}\n \n\n def insert(self, val: int) -> bool:\n if val in self.setstore:\n return False\n else:\n self.setstore[val] = True\n return True\n\n def remove(self, val: int) -> bool:\n return self.setstore.pop(val, False)\n\n def getRandom(self) -> int:\n dict_keys = list(self.setstore.keys())\n return dict_keys[int(len(dict_keys)*random.random())]\n\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"364"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.set = set()\n self.list = []\n \n\n def insert(self, val: int) -> bool:\n if ({val}.issubset(self.set)):\n return False\n else:\n self.set.add(val)\n self.list.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if ({val}.issubset(self.set)):\n self.set.remove(val)\n return True\n else:\n return False\n \n def getRandom(self) -> int:\n i = random.randint(0, len(self.list) - 1)\n while (not {self.list[i]}.issubset(self.set)):\n i = random.randint(0, len(self.list) - 1)\n return self.list[i]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"364"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.random_set = set()\n self.random_array = []\n self.prev_random = 0\n self.count = 0\n\n def insert(self, val: int) -> bool:\n if val not in self.random_set:\n self.random_set.add(val)\n self.random_array.append(val)\n return True\n \n else:\n return False \n \n\n def remove(self, val: int) -> bool:\n if val in self.random_set:\n self.random_set.remove(val)\n self.random_array.remove(val)\n return True\n \n else:\n return False \n\n def getRandom(self) -> int:\n self.count += 1\n\n if len(self.random_array) > 1: \n random_index = (self.count + random.choice([0, 1])) % len(self.random_array)\n random_val = self.random_array[random_index]\n \n else:\n random_val = self.random_array[0]\n\n\n return random.choice(self.random_array)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"369"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.set_dict = {}\n self.arr = []\n \n\n def insert(self, val: int) -> bool:\n check_val = self.set_dict.get(val)\n if check_val != None:\n return False\n \n self.arr.append(val)\n self.set_dict[val] = val\n return True\n \n\n def remove(self, val: int) -> bool:\n check_val = self.set_dict.get(val);\n if check_val != None:\n del self.set_dict[val]\n self.arr = list(self.set_dict.keys())\n return True\n return False\n\n def getRandom(self) -> int:\n idx = random.randint(0, len(self.arr)-1)\n return self.arr[idx]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"369"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.item_number = {}\n self.number_item = {}\n self.total = 0\n\n def insert(self, val: int) -> bool:\n if str(val) not in self.item_number:\n self.item_number[str(val)] = self.total\n self.number_item[str(self.total)] = val\n self.total += 1\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if str(val) in self.item_number:\n del self.number_item[str(self.item_number[str(val)])]\n del self.item_number[str(val)]\n return True\n else:\n return False\n def getRandom(self) -> int:\n res = str(random.randint(0,self.total))\n while res not in self.number_item:\n res = str(random.randint(0,self.total))\n return self.number_item[res]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"373"},{"code":"from random import randint\n\nclass RandomizedSet:\n\n def __init__(self):\n self.contained = set()\n self.removed = set()\n self.arr = []\n\n def insert(self, val: int) -> bool:\n self.clean()\n if val in self.contained:\n return False\n self.contained.add(val)\n if val not in self.removed:\n self.arr.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n self.clean()\n if val not in self.contained:\n return False\n self.contained.remove(val)\n self.removed.add(val)\n return True\n\n def getRandom(self) -> int:\n self.clean()\n n = len(self.arr)\n ind = randint(0, n-1)\n while self.arr[ind] not in self.contained:\n ind = randint(0, n-1)\n return self.arr[ind]\n \n def clean(self):\n if len(self.removed) > len(self.contained):\n self.removed = set()\n self.arr = list(self.contained)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"373"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n # RandomizedSet() Initializes the RandomizedSet object.\n self.data = set()\n self.data_l = list()\n\n def insert(self, val: int) -> bool:\n # bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.\n if val in self.data:\n return False\n self.data.add(val)\n self.data_l.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n # bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.\n if val not in self.data:\n return False\n self.data.remove(val)\n self.data_l = list(self.data)\n return True\n\n def getRandom(self) -> int:\n # int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.\n return random.choice(self.data_l)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"377"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.value_to_idx = {}\n self.values = []\n\n def insert(self, val: int) -> bool:\n if val in self.values:\n return False\n self.values.append(val)\n self.value_to_idx[val] = len(self.values) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.value_to_idx:\n return False\n idx = self.value_to_idx.pop(val)\n if idx == len(self.values) - 1:\n self.values.pop()\n return True\n\n # swap\n self.value_to_idx[self.values[-1]] = idx\n self.values[idx], self.values[-1] = self.values[-1], self.values[idx]\n _ = self.values.pop()\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"377"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.rset = {}\n\n def insert(self, val: int) -> bool:\n exists = self.rset.get(val)\n self.rset[val] = True\n return not exists\n\n def remove(self, val: int) -> bool:\n exists = self.rset.get(val)\n if exists:\n self.rset.pop(val)\n return exists\n\n def getRandom(self) -> int:\n return random.choice(list(self.rset.keys()))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"381"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.freq = {}\n\n def insert(self, val: int) -> bool:\n if val in self.freq:\n return False\n else:\n self.freq[val]=True\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.freq:\n del self.freq[val]\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.freq.keys()))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"381"},{"code":"from random import choice\nclass RandomizedSet:\n\n def __init__(self):\n self.rSet = dict()\n\n def insert(self, val: int) -> bool:\n if self.rSet.get(val) == True:\n return False\n self.rSet[val]=1\n return True\n\n def remove(self, val: int) -> bool:\n if self.rSet.get(val)==True:\n del self.rSet[val]\n return True\n return False\n \n\n def getRandom(self) -> int:\n return choice(list(self.rSet.keys()))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"386"},{"code":"from random import choice\nclass RandomizedSet:\n\n def __init__(self):\n self.map = {}\n self.n = 0\n\n def insert(self, val: int) -> bool: # constan time\n if val in self.map: return False\n\n self.map[val] = self.n\n self.n+=1\n return True\n \n\n def remove(self, val: int) -> bool: # improve\n if val not in self.map: return False\n self.n-=1\n del self.map[val]\n return True\n\n def getRandom(self) -> int:\n return choice(list(self.map.keys()))\n \n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"386"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.set_map = {}\n\n def insert(self, val: int) -> bool:\n try:\n self.set_map[val]\n return False\n except:\n self.set_map[val] = val\n return True\n\n def remove(self, val: int) -> bool:\n try:\n self.set_map[val]\n del self.set_map[val]\n return True\n except:\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(list(self.set_map.keys()))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"390"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.hass = dict()\n\n def insert(self, val: int) -> bool:\n if val not in self.hass:\n self.hass[val] = 0\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.hass:\n del self.hass[val]\n return True\n return False\n\n def getRandom(self) -> int:\n c = list(self.hass.keys())\n return choice(c)\n\n \n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"390"},{"code":"с=Counter;с.insert=lambda s,x:s.update({x})or s[x]<2;с.remove=lambda s,x:s.pop(x,0);с.getRandom=lambda s:choice([*s]);RandomizedSet=с","runtime":"394"},{"code":"from random import randrange\n\nclass RandomizedSet:\n\n def __init__(self):\n self.vals = {}\n\n def insert(self, val: int) -> bool:\n if val in self.vals:\n return False\n self.vals[val] = True\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.vals:\n return False\n self.vals.pop(val)\n return True\n\n def getRandom(self) -> int:\n r = randrange(len(self.vals))\n keys = list(self.vals.keys())\n k = keys[r]\n return keys[r]\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"394"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.set = {}\n\n def insert(self, val: int) -> bool:\n if val in self.set:\n return False\n else:\n self.set[val] = 1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.set:\n del self.set[val]\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.set.keys()))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"399"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.items = {}\n\n def insert(self, val: int) -> bool:\n if val in self.items:\n print(val)\n return False\n self.items[val] = val\n return True \n\n def remove(self, val: int) -> bool:\n if val not in self.items:\n return False\n self.items.pop(val)\n return True \n\n def getRandom(self) -> int:\n values = list(self.items.values())\n return random.choice(values)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"399"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.storage = {}\n\n def insert(self, val: int) -> bool:\n if val in self.storage:\n return False\n self.storage[val] = 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.storage:\n return False\n self.storage.pop(val)\n return True\n\n def getRandom(self) -> int:\n return random.choice(list(self.storage.keys())) \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"403"},{"code":"from random import choice\n\nclass RandomizedSet:\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.dict = {}\n \n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the set. Returns true if the set did not already contain the specified element.\n \"\"\"\n if self.dict.get(val):\n return False\n self.dict[val] = True\n return True\n \n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the set. Returns true if the set contained the specified element.\n \"\"\"\n if self.dict.get(val):\n self.dict.pop(val)\n return True\n \n return False\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the set.\n \"\"\"\n return choice(list(self.dict.keys()))","runtime":"403"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.val_ix = dict()\n self.rlist = []\n \n\n def insert(self, val: int) -> bool:\n added = False\n if val not in self.val_ix:\n added = True\n self.rlist.append(val)\n self.val_ix[val] = len(self.rlist) -1\n\n return added\n\n\n def remove(self, val: int) -> bool:\n removed = False\n if val in self.val_ix:\n removed = True\n ix_to_delete = self.val_ix[val]\n # removing is O(N) so switch it to last value in list and pop it\n self.rlist[ix_to_delete], self.rlist[-1] = self.rlist[-1], self.rlist[ix_to_delete]\n # update key - val\n self.val_ix[self.rlist[ix_to_delete]] = ix_to_delete\n del self.val_ix[val]\n self.rlist.pop()\n return removed\n \n \n def getRandom(self) -> int:\n return random.sample(self.rlist, 1)[0]\n \n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"407"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.__dict = {}\n \n\n def insert(self, val: int) -> bool:\n if val not in self.__dict:\n self.__dict[val] = 1\n return True\n return False\n \n\n def remove(self, val: int) -> bool:\n if val in self.__dict:\n del self.__dict[val]\n return True\n return False\n \n\n def getRandom(self) -> int:\n return list(self.__dict)[random.randrange(len(self.__dict))]\n\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"407"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.dict = {}\n\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n else:\n self.dict[val] = None\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.dict:\n return False\n else:\n del self.dict[val]\n return True \n\n def getRandom(self) -> int:\n length = len(self.dict.keys()) - 1 \n return list(self.dict.keys())[random.randint(0, length)]\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"424"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.val_dict = dict()\n\n def insert(self, val: int) -> bool:\n if val in self.val_dict:\n return False\n\n self.val_dict[val] = val\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.val_dict:\n del self.val_dict[val]\n return True\n \n return False\n \n\n def getRandom(self) -> int:\n\n vals = list(self.val_dict.values())\n return vals[randint(0, len(vals) - 1)]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"424"},{"code":"from random import randint\n\nclass RandomizedSet:\n\n def __init__(self):\n self.data = {}\n \n\n def insert(self, val: int) -> bool:\n if val in self.data:\n return False\n self.data[val] = True\n return True\n\n\n def remove(self, val: int) -> bool:\n if val in self.data:\n del self.data[val]\n return True\n return False\n \n\n def getRandom(self) -> int:\n i = randint(0, len(self.data) - 1)\n return list(self.data.keys())[i]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"428"},{"code":"from random import choice\nclass RandomizedSet:\n\n def __init__(self):\n self.indices = {}\n self.list = []\n\n def insert(self, val: int) -> bool:\n if val in self.list:\n return False\n self.list.append(val)\n self.indices[val] = len(self.list) - 1\n return True\n \n def remove(self, val: int) -> bool:\n if val in self.list:\n lastVal = self.list[-1]\n removeInd = self.indices[val]\n self.list[removeInd] = lastVal\n self.indices[lastVal] = removeInd\n self.list.pop()\n del self.indices[val]\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return choice(self.list)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"428"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.values = [] \n self.map = {} \n\n def insert(self, val: int) -> bool:\n if val in self.values:\n return False\n self.values.append(val) \n self.map[val] = len(self.values) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.values:\n return False\n index = self.map[val]\n # swapping\n tempLast = self.values[-1]\n self.values[-1] = val\n self.values[index] = tempLast\n # update hashmap \n self.map[tempLast] = index\n # remove val\n self.values.pop()\n del self.map[val]\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.values)\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"433"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = set()\n \n\n def insert(self, val: int) -> bool:\n if val in self.set:\n return False\n else:\n self.set.add(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(tuple(self.set))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"433"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.randomSet = set()\n\n def insert(self, val: int) -> bool:\n if val in self.randomSet:\n return False\n else:\n self.randomSet.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.randomSet:\n self.randomSet.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n \n return choice(tuple(self.randomSet))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"437"},{"code":"from random import randint\n\nclass RandomizedSet:\n\n def __init__(self):\n self.data = {}\n \n\n def insert(self, val: int) -> bool:\n if val in self.data:\n return False\n self.data[val] = True\n return True\n\n\n def remove(self, val: int) -> bool:\n if val in self.data:\n del self.data[val]\n return True\n return False\n \n\n def getRandom(self) -> int:\n i = randint(0, len(self.data) - 1)\n return list(self.data.keys())[i]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"437"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.nums_list = []\n self.nums_map = {}\n\n def insert(self, val: int) -> bool:\n if val in self.nums_list:\n return False\n self.nums_map[val] = len(self.nums_list)\n self.nums_list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.nums_list:\n return False\n last_val = self.nums_list[-1]\n val_idx = self.nums_map[val]\n self.nums_list[val_idx] = last_val\n del self.nums_map[val]\n self.nums_list.pop()\n self.nums_map[last_val] = val_idx\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.nums_list)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"441"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.arr = set()\n \n\n def insert(self, val: int) -> bool:\n if val in self.arr:\n return False\n self.arr.add(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.arr:\n self.arr.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.arr))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"441"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.items = set()\n \n\n def insert(self, val: int) -> bool:\n if val in self.items:\n return False\n\n self.items.add(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.items:\n return False\n \n self.items.remove(val)\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(tuple(self.items))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"446"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.data = []\n self.data_map = {}\n\n def insert(self, val: int) -> bool:\n if val in self.data:\n return False\n \n self.data_map[val] = len(self.data)\n self.data.append(val)\n\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.data:\n return False\n\n ind = self.data_map[val]\n last_val = self.data[-1]\n self.data[ind] = last_val\n self.data_map[last_val] = ind\n self.data[-1] = val\n\n\n self.data.pop()\n self.data_map.pop(val)\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.data)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"446"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.mySet=set()\n\n def insert(self, val: int) -> bool:\n if val in self.mySet:\n ret=False\n else:\n ret=True\n self.mySet.add(val)\n return(ret)\n\n def remove(self, val: int) -> bool:\n try:\n self.mySet.remove(val)\n return(True)\n except:\n return(False)\n\n def getRandom(self) -> int:\n return(random.choice(list(self.mySet)))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"450"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.ran = set()\n \n\n def insert(self, val: int) -> bool:\n if val not in self.ran:\n self.ran.add(val)\n return True\n else:\n return False\n \n\n def remove(self, val: int) -> bool:\n if val in self.ran:\n self.ran.remove(val)\n return True\n else:\n return False\n\n \n\n def getRandom(self) -> int:\n return random.choice(list(self.ran))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"450"},{"code":"class RandomizedSet:\n def __init__(self):\n self.ran = set()\n def insert(self, val: int) -> bool:\n if val not in self.ran:\n self.ran.add(val)\n return True\n else:\n return False\n def remove(self, val: int) -> bool:\n if val in self.ran:\n self.ran.remove(val)\n return True\n else:\n return False\n def getRandom(self) -> int:\n return random.choice(list(self.ran))\n ","runtime":"454"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = set()\n\n def insert(self, val: int) -> bool:\n if val not in self.set:\n self.set.add(val)\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.set))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"454"},{"code":"class RandomizedSet:\n\n def __init__(self):\n # 初始化时创建一个空的集合 self.rset 用于存储元素\n self.rset = set()\n \n def insert(self, val: int) -> bool:\n # 检查元素 val 是否不在集合中\n if val not in self.rset:\n # 如果不在集合中，则将该元素添加到集合\n self.rset.add(val)\n # 返回 True 表示成功插入\n return True\n # 如果元素已经存在于集合中，返回 False 表示插入失败\n return False\n \n\n def remove(self, val: int) -> bool:\n # 检查元素 val 是否在集合中\n if val in self.rset:\n # 如果在集合中，则将该元素从集合中移除\n self.rset.remove(val)\n # 返回 True 表示成功移除\n return True\n # 如果元素不在集合中，返回 False 表示移除失败\n return False\n \n\n def getRandom(self) -> int:\n # 直接从集合转换的列表中随机选择一个元素并返回\n return random.choice(list(self.rset))","runtime":"458"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.mySet = set()\n\n def insert(self, val: int) -> bool:\n if val in self.mySet:\n return False\n else:\n self.mySet.add(val)\n return True\n def remove(self, val: int) -> bool:\n if val not in self.mySet:\n return False\n else:\n self.mySet.remove(val)\n return True\n def getRandom(self) -> int:\n # l = len(self.mySet)\n # ix = random.randint(0,l-1)\n return random.choice(list(self.mySet))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"458"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = set()\n\n def insert(self, val: int) -> bool:\n if val not in self.set:\n self.set.add(val)\n return True\n return False\n\n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n import random\n return random.choice(tuple(self.set))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"463"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.data = set()\n \n def insert(self, val: int) -> bool:\n if val in self.data:\n return False\n self.data.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.data:\n self.data.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(tuple(self.data))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"463"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.vals_map = {}\n self.vals = []\n\n def insert(self, val: int) -> bool:\n if val in self.vals:\n return False\n\n self.vals_map[val] = len(self.vals)\n self.vals.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.vals:\n return False\n\n # need to move the element to end of list before removing\n curVal, curInd = val, self.vals_map[val]\n endVal, endInd = self.vals[-1], len(self.vals) - 1\n self.vals[curInd], self.vals[endInd] = endVal, curVal\n self.vals_map[endVal] = curInd\n self.vals_map.pop(curVal)\n self.vals.pop()\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.vals) \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"467"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.rng = set()\n\n def insert(self, val: int) -> bool:\n if val not in self.rng:\n self.rng.add(val) \n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.rng:\n self.rng.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.rng))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"467"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.content = set()\n\n def insert(self, val: int) -> bool:\n if val in self.content: return False\n self.content.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.content: return False\n self.content.remove(val)\n return True\n\n def getRandom(self) -> int:\n return random.choice(tuple(self.content))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"471"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.set1 = set() \n\n def insert(self, val: int) -> bool:\n if val not in self.set1:\n self.set1.add(val)\n return True \n else:\n return False\n \n def remove(self, val: int) -> bool:\n if val in self.set1:\n self.set1.remove(val)\n return True\n else:\n \n return False\n \n def getRandom(self) -> int:\n return random.choice(list(self.set1)) \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"471"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.random_set = set()\n\n def insert(self, val: int) -> bool:\n if val in self.random_set:\n return False\n else:\n self.random_set.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.random_set:\n self.random_set.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.random_set))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"476"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set=[]\n\n def insert(self, val: int) -> bool:\n if val in self.set:\n return False\n self.set.append(val)\n return True \n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n inx=random.randint(0,len(self.set)-1)\n return self.set[inx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"476"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.a = []\n\n def insert(self, val: int) -> bool:\n while val not in self.a:\n self.a.append(val)\n return True\n return False\n\n def remove(self, val: int) -> bool:\n while val in self.a:\n self.a.remove(val)\n return True\n return False\n \n def getRandom(self) -> int:\n ran = random.choice(self.a)\n return ran\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"480"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = []\n \n\n def insert(self, val: int) -> bool:\n if val in self.set : return False\n \n self.set.append(val)\n return True\n\n \n\n def remove(self, val: int) -> bool:\n if val not in self.set : return False\n self.set.remove(val)\n return True\n \n def getRandom(self) -> int:\n return random.choice(self.set)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"480"},{"code":"from random import randrange\nclass RandomizedSet:\n\n def __init__(self):\n self.r_set = set()\n\n def insert(self, val: int) -> bool:\n if val in self.r_set:\n return False\n\n self.r_set.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.r_set:\n return False\n\n self.r_set.remove(val)\n return True\n\n def getRandom(self) -> int:\n max_len = len(self.r_set)\n random_index = randrange(0, max_len)\n\n return list(self.r_set)[random_index]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"484"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.Set = set()\n self.len = 0\n\n def insert(self, val: int) -> bool:\n if val in self.Set:\n return False\n else:\n self.Set.add(val)\n self.len+=1\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.Set:\n self.Set.remove(val)\n self.len-=1\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n ind = random.randint(0,self.len-1)\n return list(self.Set)[ind]\n\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"484"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.lst = set()\n\n def insert(self, val: int) -> bool:\n if val in self.lst:\n return False\n self.lst.add(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.lst:\n self.lst.remove(val)\n return True\n return False\n\n\n def getRandom(self) -> int:\n index = list(self.lst)\n return index[random.randint(0, len(index)-1)]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"488"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.my_set = set()\n \n\n def insert(self, val: int) -> bool:\n if val in self.my_set:\n return False\n self.my_set.add(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n try:\n self.my_set.remove(val)\n except KeyError:\n return False \n return True \n\n def getRandom(self) -> int:\n return random.choice(list(self.my_set))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"488"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = set()\n\n def insert(self, val: int) -> bool:\n was_in_set = val not in self.set\n self.set.add(val)\n return was_in_set\n\n def remove(self, val: int) -> bool:\n was_in_set = val in self.set\n if was_in_set:\n self.set.remove(val)\n return was_in_set\n \n def getRandom(self) -> int:\n import random\n return random.choice(list(self.set))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"493"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = []\n \n\n def insert(self, val: int) -> bool:\n if val in self.set : return False\n \n self.set.append(val)\n return True\n\n \n\n def remove(self, val: int) -> bool:\n if val not in self.set : return False\n self.set.remove(val)\n return True\n \n def getRandom(self) -> int:\n return random.choice(self.set)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"493"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.data = set()\n \n\n def insert(self, val: int) -> bool:\n if val not in self.data:\n self.data.add(val)\n return True\n return False\n \n\n def remove(self, val: int) -> bool:\n if val in self.data:\n self.data.remove(val)\n return True\n return False\n \n\n def getRandom(self) -> int:\n nums = list(self.data)\n r = random.randint(0, len(nums) - 1)\n return nums[r]\n # return random.choice(list(self.data))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"497"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.set1 = set() \n\n def insert(self, val: int) -> bool:\n if val not in self.set1:\n self.set1.add(val)\n return True \n else:\n return False\n \n def remove(self, val: int) -> bool:\n if val in self.set1:\n self.set1.remove(val)\n return True\n else:\n \n return False\n \n def getRandom(self) -> int:\n ind = random.randint(0,len(self.set1) -1 )\n return list(self.set1)[ind] \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"497"},{"code":"import random\n\nclass RandomizedSet:\n def __init__(self):\n self.randSet = []\n\n def insert(self, val: int) -> bool:\n if val in self.randSet:\n return False\n self.randSet.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.randSet:\n self.randSet.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n random_num = random.randint(0,len(self.randSet)-1)\n return self.randSet[random_num]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"501"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.finalSet = list()\n self.index = 0\n \n\n def insert(self, val: int) -> bool:\n if val not in self.finalSet:\n self.finalSet.append(val)\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.finalSet:\n self.finalSet.remove(val)\n return True\n return False \n \n\n def getRandom(self) -> int:\n index = (random.randint(0, len(self.finalSet) - 1))\n return self.finalSet[index]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"501"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.my_set = []\n\n def insert(self, val: int) -> bool:\n if val in self.my_set:\n return False\n self.my_set.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.my_set:\n self.my_set.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.my_set))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"505"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set=set()\n\n def insert(self, val: int) -> bool:\n if val in self.set:\n return False\n else:\n self.set.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return list(self.set)[random.randint(0,len(self.set)-1)]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"505"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.data = set()\n\n def insert(self, val: int) -> bool:\n if val not in self.data:\n self.data.add(val)\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.data:\n self.data.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n idx = random.randint(0,len(self.data)-1)\n return list(self.data)[idx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"510"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.rand_set = []\n \n\n def insert(self, val: int) -> bool:\n if val in self.rand_set:\n return False\n self.rand_set.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.rand_set:\n self.rand_set.remove(val)\n return True\n return False\n\n\n def getRandom(self) -> int:\n return random.choice(self.rand_set)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"510"},{"code":"\nclass RandomizedSet:\n\n def __init__(self):\n self.set = set()\n\n def insert(self, val: int) -> bool:\n was_in_set = val not in self.set\n self.set.add(val)\n return was_in_set\n\n def remove(self, val: int) -> bool:\n was_in_set = val in self.set\n if was_in_set:\n self.set.remove(val)\n return was_in_set\n \n def getRandom(self) -> int:\n import random\n choice = random.choice(list(self.set))\n return choice\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"514"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.thisset = [] \n\n def insert(self, val: int) -> bool:\n if val in self.thisset:\n return False\n else:\n (self.thisset).append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.thisset:\n (self.thisset).remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n n = len(self.thisset)\n return (self.thisset)[random.randint(0, len(self.thisset)-1)]\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"514"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.list1 = []\n \n\n def insert(self, val: int) -> bool:\n if(val in self.list1):\n return False\n else:\n self.list1.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if(val in self.list1):\n self.list1.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.list1)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"518"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.array=[]\n def insert(self, val: int) -> bool:\n if val in self.array:\n return False\n else:\n self.array.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.array:\n self.array.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n val=self.array[random.randint(0,len(self.array)-1)]\n return val\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"518"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.this_set = []\n\n def insert(self, val: int) -> bool:\n if val in self.this_set:\n return False\n \n self.this_set.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.this_set:\n return False\n self.this_set.remove(val)\n\n return True\n\n def getRandom(self) -> int:\n if len(self.this_set) == 0:\n return False\n\n return self.this_set[random.randint(0, len(self.this_set) - 1)]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"523"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list_set = [] \n\n def insert(self, val: int) -> bool:\n if val in self.list_set:\n return False\n self.list_set.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.list_set:\n self.list_set.remove(val)\n return True\n return False\n \n\n def getRandom(self) -> int:\n import random\n return random.choice(self.list_set)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"523"},{"code":"class RandomizedSet:\n import random\n\n def __init__(self):\n self.set={}\n\n def insert(self, val: int) -> bool:\n if val in self.set: return False\n else: \n self.set[val]=1\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.pop(val)\n return True\n else: return False\n \n def listify(self) -> list:\n return [_ for _ in self.set]\n \n def getRandom(self) -> int:\n z = self.listify() # Fix: Call listify with self\n return self.random.choice(z) \n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"527"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.lst=list()\n def insert(self, val: int) -> bool:\n if val not in self.lst:\n self.lst.append(val)\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.lst:\n self.lst.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n index=random.randrange(0,len(self.lst))\n return self.lst[index]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"527"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.arr = []\n \n\n def insert(self, val: int) -> bool:\n if val not in self.arr:\n self.arr.append(val)\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val not in self.arr:\n return False\n else:\n idx = self.arr.index(val)\n self.arr.pop(idx)\n return True\n \n\n def getRandom(self) -> int:\n total = len(self.arr)-1\n target = random.randint(0,total)\n return self.arr[target]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"531"},{"code":"import random\nclass RandomizedSet:\n def __init__(self):\n self.randomized_set = set()\n \n\n def insert(self, val: int) -> bool:\n if val in self.randomized_set:\n return False\n self.randomized_set.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.randomized_set:\n return False\n self.randomized_set.remove(val)\n return True\n\n def getRandom(self) -> int:\n r1 = random.randint(0, len(self.randomized_set))\n idx = 0\n for item in self.randomized_set:\n if r1 == idx:\n return item\n idx += 1\n item = self.randomized_set.pop()\n self.randomized_set.add(item)\n return item\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"531"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.thisset = [] \n\n def insert(self, val: int) -> bool:\n if val in self.thisset:\n return False\n else:\n (self.thisset).append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.thisset:\n (self.thisset).remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n n = len(self.thisset)\n return (self.thisset)[random.randint(0, len(self.thisset)-1)]\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"535"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = []\n\n def insert(self, val: int) -> bool:\n return (val not in self.set and not self.set.append(val))\n\n def remove(self, val: int) -> bool:\n return val in self.set and not self.set.remove(val)\n \n def getRandom(self) -> int:\n end = len(self.set)\n index = random.randrange(end)\n return self.set[index]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"535"}],"string":"[\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.data = {}\\n self.nums = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n return False\\n \\n self.nums.append(val)\\n self.data[val] = len(self.nums) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.data:\\n return False\\n \\n val_index = self.data[val]\\n last_element = self.nums[-1]\\n\\n self.nums[val_index] = last_element\\n self.data[last_element] = val_index\\n\\n self.nums.pop()\\n del self.data[val]\\n \\n return True\\n\\n\\n def getRandom(self) -> int:\\n rand = int(len(self.nums) * random.random())\\n return self.nums[rand]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.ds = dict()\\n self.array = list()\\n self.top = 0\\n\\n def insert(self, val: int) -> bool:\\n if val in self.ds: return False\\n self.ds[val] = self.top\\n self.array.append(val)\\n self.top += 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.ds:\\n index = self.ds[val]\\n self.array[-1], self.array[index] = self.array[index], self.array[-1]\\n self.ds[self.array[index]] = index\\n del self.ds[val]\\n self.top -= 1\\n self.array.pop()\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n mod = math.floor(random.random() * self.top)\\n return self.array[mod]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.map = {}\\n self.lst = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.map:\\n return False\\n else:\\n n = len(self.lst)\\n self.map[val] = n\\n self.lst.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.map:\\n return False\\n else:\\n idx = self.map[val]\\n temp = self.lst[-1]\\n self.lst[-1] = self.lst[idx]\\n self.lst[idx] = temp\\n self.map[temp] = idx\\n self.lst.pop()\\n self.map.pop(val)\\n return True\\n\\n def getRandom(self) -> int:\\n rand = int(random.random() * len(self.lst))\\n return self.lst[rand]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"202\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.info={}\\n self.pool=[]\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.info:\\n return False\\n self.info[val]=len(self.pool)\\n self.pool.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.info:\\n return False\\n pos=self.info[val]\\n del self.info[val]\\n if pos==len(self.pool)-1:\\n self.pool.pop()\\n else:\\n target=self.pool[-1]\\n self.pool[pos]=target\\n self.info[target]=pos\\n self.pool.pop()\\n return True\\n \\n\\n def getRandom(self) -> int:\\n pos=int(random.random()*len(self.pool))\\n return self.pool[pos]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"206\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.dict = {}\\n self.index = []\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n else:\\n self.index.append(val)\\n self.dict[val] = len(self.index) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.dict:\\n location = self.dict[val]\\n end = self.index.pop()\\n del self.dict[val]\\n if self.index and location <= len(self.index) - 1:\\n # print(self.index, location)\\n self.index[location] = end\\n self.dict[end] = location\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.index[int(random.random() * len(self.index))]\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"206\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.valuesIndex = dict()\\n self.values = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.valuesIndex:\\n return False\\n self.valuesIndex[val] = len(self.values)\\n self.values.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.valuesIndex:\\n return False\\n valIndex = self.valuesIndex[val]\\n topVal = self.values[-1]\\n self.values[valIndex] = topVal\\n self.valuesIndex[topVal] = valIndex\\n del self.values[-1]\\n del self.valuesIndex[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return self.values[int(random.random() * len(self.values))]\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.indices = {}\\n self.items = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.indices:\\n return False\\n self.items.append(val)\\n self.indices[val] = len(self.items) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.indices:\\n return False\\n idx = self.indices[val]\\n last_element = self.items[-1]\\n \\n # Move the last element to the position of the element to delete, only if it's not the same element\\n self.items[idx] = last_element\\n self.indices[last_element] = idx\\n \\n # Remove the last element\\n self.items.pop()\\n del self.indices[val]\\n \\n return True\\n\\n def getRandom(self) -> int:\\n idx = floor(random.random() * len(self.items))\\n return self.items[idx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"from random import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.list = []\\n self.dict = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n else:\\n self.dict[val] = len(self.list)\\n self.list.append(val)\\n return True\\n\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.dict:\\n return False\\n else:\\n idx = self.dict[val]\\n self.list[idx] = self.list[-1]\\n self.dict[self.list[-1]] = idx\\n del self.list[-1]\\n del self.dict[val]\\n return True\\n\\n\\n def getRandom(self) -> int:\\n return self.list[int(random() * len(self.list))]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.map = {}\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.map:\\n return False\\n \\n self.map[val] = len(self.list)\\n self.list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.map:\\n return False\\n \\n idx = self.map[val]\\n self.list[idx] = self.list[-1]\\n self.map[self.list[idx]] = idx\\n self.map.pop(val)\\n self.list.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n index = int(random.random() * len(self.list))\\n return self.list[index]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n def __init__(self):\\n self.val_to_index = {} # Map from value to index in list\\n self.values = [] # List of values\\n\\n def insert(self, val: int) -> bool:\\n if val in self.val_to_index:\\n return False\\n # Add the value to the list and map it to the index\\n self.val_to_index[val] = len(self.values)\\n self.values.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.val_to_index:\\n return False\\n # Get the index of the value to remove\\n index = self.val_to_index[val]\\n # Move the last element to the position of the element to remove\\n last_val = self.values[-1]\\n self.values[index] = last_val\\n self.val_to_index[last_val] = index\\n # Remove the last element from the list and the map\\n self.values.pop()\\n del self.val_to_index[val]\\n return True\\n\\n def getRandom(self) -> int:\\n # Return a random element from the list\\n return random.choice(self.values)\\n\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.elements = set()\\n self.elt_list = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.elements:\\n return False\\n else:\\n self.elements.add(val)\\n self.elt_list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.elements:\\n return False\\n else:\\n self.elements.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n if len(self.elt_list) * 2 <= len(self.elements):\\n self.elt_list = list(self.elements)\\n\\n rand_elt = random.sample(self.elt_list, 1)\\n while rand_elt[0] not in self.elements:\\n rand_elt = random.sample(self.elt_list, 1)\\n\\n return rand_elt[0] \\n\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.elt_list = []\\n self.value_pos = {} # records the position of value in the list\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.value_pos:\\n return False\\n else:\\n self.value_pos[val] = len(self.elt_list)\\n self.elt_list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.value_pos:\\n return False\\n else:\\n i = self.value_pos[val]\\n self.value_pos.pop(val)\\n if i != len(self.elt_list) - 1:\\n self.elt_list[i] = self.elt_list[-1]\\n self.value_pos[self.elt_list[i]] = i\\n self.elt_list.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.elt_list)\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\\n\",\n \"runtime\": \"219\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n # dictionary hash map method \\n self.dict = {}\\n self.lst = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n else:\\n n = len(self.lst)\\n self.dict[val] = n\\n self.lst.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.dict:\\n return False\\n else:\\n idx = self.dict[val]\\n temp = self.lst[-1]\\n self.lst[-1] = self.lst[idx]\\n self.lst[idx] = temp\\n self.dict[temp] = idx\\n self.lst.pop()\\n self.dict.pop(val)\\n return True\\n \\n def getRandom(self) -> int:\\n rand = int(random.random() * len(self.lst))\\n return self.lst[rand]\\n \\n \\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.store = []\\n self.dic = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.dic:\\n self.store.append(val)\\n self.dic[val] = len(self.store) - 1\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.dic:\\n if self.dic[val] == len(self.store)-1:\\n self.store.pop()\\n else:\\n last = self.store[-1]\\n self.store[self.dic[val]], self.store[-1] = self.store[-1], self.store[self.dic[val]]\\n self.dic[last] = self.dic[val]\\n self.store.pop()\\n del self.dic[val]\\n return True\\n else:\\n return False\\n \\n def getRandom(self) -> int:\\n return random.choice(self.store)\\n \\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.map = dict()\\n self.arrMap = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.map:\\n return False\\n\\n index = len(self.arrMap)\\n self.map[val] = index\\n\\n self.arrMap.append(val)\\n\\n # print(f'map after insert of {val}: {self.map}')\\n # print(f'arr after insert of {val}: {self.arrMap}')\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.map:\\n return False\\n\\n remove_index = self.map.get(val)\\n last_num = self.arrMap[len(self.arrMap) - 1]\\n\\n # Swap the last number and the number to be removed\\n self.arrMap[remove_index], self.arrMap[len(self.arrMap) - 1] = self.arrMap[len(self.arrMap) - 1], self.arrMap[remove_index]\\n\\n # Remove the element\\n self.arrMap.pop()\\n\\n # adjust the last num mapping\\n self.map[last_num] = remove_index\\n\\n # remove entry for val\\n self.map.pop(val)\\n\\n # print(f'map after remove of {val}: {self.map}')\\n # print(f'arr after remove of {val}: {self.arrMap}')\\n\\n return True\\n\\n\\n\\n def getRandom(self) -> int:\\n rnd = random.random() * len(self.arrMap)\\n rand_index = math.floor(rnd)\\n\\n return self.arrMap[rand_index]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.random = {} # key: element, val: idx\\n self.elements = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.random:\\n return False\\n self.random[val] = len(self.elements)\\n self.elements.append(val)\\n return True\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.random:\\n return False\\n idx = self.random[val]\\n lastVal = self.elements[-1]\\n self.elements[idx] = lastVal\\n self.random[lastVal] = idx\\n self.elements.pop()\\n del self.random[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.elements)\\n \\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"228\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.cache={}\\n self.data=[]\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.cache:return False\\n self.cache[val]=len(self.data)\\n self.data.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.cache:return False\\n lastVal=self.data[-1]\\n index=self.cache[val]\\n self.cache[lastVal]=index\\n self.data[index]=lastVal\\n del self.cache[val]\\n self.data.pop()\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.data)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"232\"\n },\n {\n \"code\": \"from random import randint\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.num_list = list()\\n self.num_map = dict()\\n \\n def insert(self, val: int) -> bool:\\n if val in self.num_map:\\n return False\\n \\n self.num_map[val] = len(self.num_list)\\n self.num_list.append(val)\\n\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.num_map:\\n return False\\n\\n val_idx = self.num_map[val]\\n self.num_map[self.num_list[-1]] = val_idx\\n self.num_list[val_idx] = self.num_list[-1]\\n\\n self.num_list.pop()\\n self.num_map.pop(val)\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.num_list)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"232\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.items = {}\\n self.indexes = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.items:\\n return False\\n self.items[val] = len(self.indexes)\\n self.indexes.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.items:\\n return False\\n idx = self.items[val]\\n last_item = self.indexes[-1]\\n self.indexes[idx] = last_item\\n self.indexes.pop()\\n self.items[last_item] = idx\\n del self.items[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.indexes)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\\n\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.data = []\\n self.map_data = {} \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.map_data:\\n self.map_data[val] = len(self.data)\\n self.data.append(val)\\n return True \\n else:\\n return False\\n \\n def remove(self, val: int) -> bool:\\n if val in self.map_data:\\n val_ind = self.map_data[val]\\n val_to_be_replaced = self.data[-1]\\n\\n self.map_data[val_to_be_replaced] = val_ind\\n \\n self.data[val_ind] = val_to_be_replaced\\n self.data.pop()\\n self.map_data.pop(val)\\n return True\\n else:\\n return False\\n \\n def getRandom(self) -> int:\\n return random.choice(self.data) \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.numMap = {}\\n self.numList = []\\n\\n def insert(self, val: int) -> bool:\\n # Return true if val not in map\\n not_in_map = val not in self.numMap\\n\\n if not_in_map:\\n # We will be adding this val at the end/new right index\\n # in the list \\n self.numMap[val] = len(self.numList)\\n self.numList.append(val)\\n \\n return not_in_map\\n\\n def remove(self, val: int) -> bool:\\n in_map = val in self.numMap\\n\\n if in_map:\\n index = self.numMap[val]\\n lastVal = self.numList[-1]\\n self.numList[index] = lastVal\\n self.numList.pop()\\n\\n self.numMap[lastVal] = index\\n del self.numMap[val]\\n\\n return in_map\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.numList)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"240\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list = []\\n self.map = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.map:\\n return False\\n self.list.append(val)\\n self.map[val] = len(self.list)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.map:\\n # get value of top element and index of value to be removed\\n replace_val, remove_val_index = self.list[-1], self.map[val]\\n self.list[remove_val_index], self.map[replace_val] = replace_val, remove_val_index\\n # delete value in map\\n del self.map[val]\\n self.list.pop()\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"240\"\n },\n {\n \"code\": \"class RandomizedSet:\\n def __init__(self):\\n self.lst=[]\\n self.idx_map={}\\n def search(self, val):\\n return val in self.idx_map\\n def insert(self, val: int) -> bool:\\n if self.search(val):\\n return False \\n self.lst.append(val)\\n self.idx_map[val] = len(self.lst) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if not self.search(val):\\n return False\\n idx = self.idx_map[val]\\n self.lst[idx] = self.lst[-1]\\n self.idx_map[self.lst[-1]] = idx\\n self.lst.pop()\\n del self.idx_map[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.lst)\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"from random import choice\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.mylist = []\\n self.mydict = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.mydict:\\n return False\\n\\n new_idx = len(self.mylist)\\n self.mydict[val] = new_idx\\n self.mylist.append(val)\\n\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.mydict:\\n return False\\n\\n last_element = self.mylist[-1]\\n idx = self.mydict[val]\\n\\n self.mylist[idx] = last_element\\n self.mydict[last_element] = idx\\n\\n self.mylist.pop()\\n del self.mydict[val]\\n\\n return True\\n\\n def getRandom(self) -> int:\\n return choice(self.mylist)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"245\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.numMap = {}\\n self.numList = []\\n\\n def insert(self, val: int) -> bool:\\n res = val not in self.numMap\\n if res:\\n self.numMap[val] = len(self.numList)\\n self.numList.append(val)\\n return res\\n\\n def remove(self, val: int) -> bool:\\n res = val in self.numMap\\n if res:\\n idx = self.numMap[val]\\n lastVal = self.numList[-1]\\n self.numMap[lastVal] = idx\\n self.numList[idx] = lastVal\\n self.numList.pop()\\n del self.numMap[val]\\n return res\\n\\n def getRandom(self) -> int:\\n return random.choice(self.numList)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list=[]\\n self.mp={}\\n \\n def search(self, val):\\n return val in self.mp\\n\\n def insert(self, val: int) -> bool:\\n if self.search(val):\\n return False\\n self.list.append(val)\\n self.mp[val]=len(self.list)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if not self.search(val):\\n return False\\n idx=self.mp[val]\\n self.list[idx]=self.list[-1]\\n self.mp[self.list[-1]]=idx\\n self.list.pop()\\n del self.mp[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"249\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.s = dict()\\n self.l = list()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.s:\\n return False\\n else:\\n self.l.append(val)\\n self.s[val] = len(self.l) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.s:\\n return False\\n else:\\n index = self.s[val]\\n last_val = self.l[len(self.l) - 1]\\n self.s[last_val] = index\\n\\n self.l[len(self.l) - 1], self.l[index] = self.l[index], self.l[len(self.l) - 1]\\n\\n del self.s[val]\\n self.l.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.l)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"253\"\n },\n {\n \"code\": \"class RandomizedSet:\\n def __init__(self):\\n self.vals = []\\n self.valToIndex = collections.defaultdict(int) # {val: index in vals}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.valToIndex:\\n return False\\n self.valToIndex[val] = len(self.vals)\\n self.vals.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.valToIndex:\\n return False\\n index = self.valToIndex[val]\\n # The order of the following two lines is important when vals.size() == 1.\\n self.valToIndex[self.vals[-1]] = index\\n del self.valToIndex[val]\\n self.vals[index] = self.vals[-1]\\n self.vals.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n index = random.randint(0, len(self.vals) - 1)\\n return self.vals[index]\",\n \"runtime\": \"253\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.rand_map = {}\\n self.rand_list = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.rand_map:\\n return False\\n self.rand_map[val] = len(self.rand_list)\\n self.rand_list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.rand_map:\\n last_elem, index = self.rand_list[-1], self.rand_map[val]\\n self.rand_list[index], self.rand_map[last_elem] = last_elem, index\\n self.rand_list.pop()\\n del self.rand_map[val]\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return choice(self.rand_list)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"import math\\nfrom random import random\\nclass RandomizedSet:\\n sett = []\\n def __init__(self):\\n self.sett = []\\n\\n def insert(self, val: int) -> bool:\\n #print(f\\\"inserting {val} into set:\\\")\\n #print(self.sett)\\n if len(self.sett) == 0:\\n self.sett = [val]\\n return True\\n i = self.getidx(val)\\n if i > 0:\\n return False\\n elif i == 0:\\n if self.sett[0] == val:\\n return False\\n else:\\n self.sett.insert(0,val)\\n return True\\n else:\\n self.sett.insert(-i,val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n # print(f\\\"removing {val} from set:\\\")\\n #print(self.sett)\\n if len(self.sett) == 0:\\n return False\\n i = self.getidx(val)\\n if i >= 0:\\n if i == len(self.sett):\\n return False\\n if self.sett[i] == val:\\n del self.sett[i]\\n return True\\n else:\\n return False\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n i = math.floor(random() * len(self.sett))\\n return self.sett[i]\\n \\n def getidx(self, val: int) -> int:\\n top = len(self.sett)\\n if top == 0:\\n return 0\\n bot = 0\\n i = math.floor((top + bot) / 2)\\n c = 0\\n while self.sett[i] != val:\\n if self.sett[i] > val:\\n top = i\\n else:\\n bot = i\\n i = math.floor((top + bot) / 2)\\n if top == bot + 1:\\n if val > self.sett[i]:\\n return 0-top\\n else:\\n return 0-bot\\n elif top == bot:\\n return bot\\n return i\\n\\n \\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n # Dictionary to store value -> index mapping\\n self.val_to_index = {}\\n # List to store the values\\n self.values = []\\n\\n def insert(self, val: int) -> bool:\\n # If the value already exists in the set, return False\\n if val in self.val_to_index:\\n return False\\n # Otherwise, add it to the list and store its index in the dictionary\\n self.values.append(val)\\n self.val_to_index[val] = len(self.values) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n # If the value doesn't exist in the set, return False\\n if val not in self.val_to_index:\\n return False\\n # Get the index of the element to remove\\n index_to_remove = self.val_to_index[val]\\n # Swap the element to remove with the last element in the list\\n last_element = self.values[-1]\\n self.values[index_to_remove] = last_element\\n self.val_to_index[last_element] = index_to_remove\\n # Remove the last element from the list and delete the value from the dictionary\\n self.values.pop()\\n del self.val_to_index[val]\\n return True\\n\\n def getRandom(self) -> int:\\n # Return a random element from the list\\n return random.choice(self.values)\\n\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"class RandomizedSet:\\n def __init__(self):\\n self.values = []\\n self.indices = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.indices:\\n return False\\n self.values.append(val)\\n self.indices[val] = len(self.values)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.indices:\\n return False\\n index = self.indices.pop(val)\\n if index == len(self.values)-1:\\n self.values.pop()\\n else:\\n repl = self.values.pop()\\n self.values[index] = repl\\n self.indices[repl] = index\\n return True\\n\\n def getRandom(self) -> int:\\n i = randint(0, len(self.values)-1)\\n return self.values[i]\",\n \"runtime\": \"262\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.rand_set = {}\\n self.rand_set_array = []\\n self.index = 0\\n self.removes = 0\\n\\n def insert(self, val: int) -> bool:\\n if self.rand_set.get(val) is not None:\\n return False\\n self.rand_set[val] = self.index\\n self.rand_set_array.append(val)\\n self.index += 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.rand_set.get(val) is not None:\\n last = self.rand_set_array[-1]\\n index = self.rand_set[val]\\n self.rand_set_array[index] = last\\n self.rand_set_array.pop(-1)\\n\\n self.rand_set[last] = index\\n del self.rand_set[val]\\n self.index -= 1\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.rand_set_array)\\n\\n def getRandom(self) -> int:\\n return random.choice(self.rand_set_array)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class RandomizedSet:\\n def __init__(self):\\n self.v = []\\n self.mp = {}\\n \\n def search(self, val: int) -> bool:\\n return val in self.mp\\n \\n def insert(self, val: int) -> bool:\\n if val in self.mp:\\n return False\\n \\n self.v.append(val)\\n self.mp[val] = len(self.v) - 1\\n return True\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.mp:\\n return False\\n \\n # Get index of the element to remove\\n index = self.mp[val]\\n last_element = self.v[-1]\\n \\n # Swap with the last element and remove\\n self.v[index] = last_element\\n self.mp[last_element] = index\\n self.v.pop()\\n del self.mp[val]\\n \\n return True\\n \\n def getRandom(self) -> int:\\n return random.choice(self.v)\\n\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.pos = {}\\n self.nums = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.pos:\\n return False\\n else:\\n self.nums.append(val)\\n self.pos[val]=len(self.nums)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.pos:\\n #swap number with last index, then delete assuming last\\n valIdx = self.pos[val]\\n lastElement = self.nums[-1]\\n self.nums[valIdx],self.nums[-1] = lastElement,self.nums[valIdx]\\n self.pos[val],self.pos[lastElement] = self.pos[lastElement],self.pos[val]\\n\\n del self.pos[val]\\n self.nums.pop()\\n\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.nums[random.randint(0,len(self.nums)-1)]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.st = {}\\n self.ls = []\\n self.size = 0\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.st:\\n self.ls.append(val)\\n self.st[val] = len(self.ls)-1\\n self.size += 1\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.st:\\n ix = self.st[val]\\n if ix != len(self.ls)-1:\\n self.ls[ix], self.ls[-1] = self.ls[-1], self.ls[ix]\\n self.st[self.ls[ix]] = ix\\n self.ls.pop()\\n del self.st[val]\\n self.size -= 1\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n ix = random.randint(0, self.size-1)\\n return self.ls[ix]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.s = []\\n self.d = dict()\\n \\n \\n\\n def insert(self, val: int) -> bool:\\n #print(val, self.s, self.d)\\n if val in self.d:\\n return False\\n else:\\n self.s.append(val)\\n self.d[val] = len(self.s)-1\\n return True\\n \\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.d:\\n return False\\n idx = self.d[val]\\n self.d[self.s[-1]] = idx\\n self.s[idx] = self.s[-1]\\n self.s.pop()\\n del self.d[val]\\n return True\\n \\n \\n \\n\\n def getRandom(self) -> int:\\n n = len(self.s)-1\\n r = random.randint(0, n)\\n return self.s[r]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.array = []\\n self.hmp = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.hmp:\\n return False\\n\\n self.hmp[val] = len(self.array)\\n self.array.append(val)\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.hmp:\\n return False\\n\\n if self.hmp[val] != len(self.array) - 1:\\n ind = self.hmp[val]\\n self.array[ind] = self.array[len(self.array) - 1]\\n self.hmp[self.array[ind]] = ind\\n\\n self.hmp.pop(val)\\n self.array.pop(len(self.array) - 1)\\n return True\\n\\n def getRandom(self) -> int:\\n return self.array[randint(0, len(self.array)-1)]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.array = []\\n self.mapping = dict()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.mapping.keys():\\n return False\\n\\n self.array.append(val)\\n self.mapping[val] = len(self.array) - 1\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.mapping.keys():\\n return False\\n\\n idx = self.mapping[val]\\n last_idx = len(self.array) - 1\\n\\n if idx == last_idx:\\n self.array.pop()\\n self.mapping.pop(val, None)\\n else:\\n self.array[idx] = self.array[last_idx]\\n self.array.pop()\\n\\n self.mapping[self.array[idx]] = idx\\n self.mapping.pop(val, None)\\n\\n return True\\n\\n def getRandom(self) -> int:\\n idx = random.randint(0, len(self.array) - 1)\\n return self.array[idx]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"292\"\n },\n {\n \"code\": \"from random import randint\\n\\n\\nclass RandomizedSet:\\n contents_by_val: dict[int, int] # value, id\\n contents_by_index: dict[int, int] # index, value\\n\\n def __init__(self):\\n self.contents_by_val = {}\\n self.contents_by_index = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.contents_by_val:\\n return False\\n\\n index: int = len(self.contents_by_val)\\n self.contents_by_index[index] = val\\n self.contents_by_val[val] = index\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.contents_by_val:\\n return False\\n\\n index: int = self.contents_by_val[val]\\n\\n # If the removal will leave a gap, fill it\\n if index < len(self.contents_by_val):\\n last_index: int = len(self.contents_by_index) - 1\\n last_val: int = self.contents_by_index[last_index]\\n self.contents_by_val[last_val] = index\\n self.contents_by_index[index] = last_val\\n del self.contents_by_index[last_index]\\n del self.contents_by_val[val]\\n return True\\n\\n # Otherwise just remove the entries\\n del self.contents_by_val[val]\\n del self.contents_by_index[index]\\n return True\\n\\n def getRandom(self) -> int:\\n return self.contents_by_index[randint(0, len(self.contents_by_index) - 1)]\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\\n\",\n \"runtime\": \"292\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.List = []\\n self.KeyDict = {}\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.KeyDict:\\n self.List.append(val)\\n self.KeyDict[val] = len(self.List)-1\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.KeyDict:\\n a = self.List.pop()\\n if a!=val:\\n self.List[self.KeyDict[val]] = a\\n self.KeyDict[a] = self.KeyDict[val]\\n self.KeyDict.pop(val)\\n return True\\n else:\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return self.List[random.randint(0, len(self.List) - 1)]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"296\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.map={}\\n self.list=[]\\n\\n def insert(self, val: int) -> bool:\\n res=val not in self.map\\n if res:\\n self.map[val]=len(self.list)\\n self.list.append(val)\\n \\n return res\\n\\n def remove(self, val: int) -> bool:\\n res=val in self.map\\n if res:\\n inx=self.map[val]\\n lastVal=self.list[-1]\\n self.list[inx]=lastVal\\n self.map[lastVal]=inx\\n self.list.pop()\\n del self.map[val]\\n return res\\n\\n def getRandom(self) -> int:\\n inx=random.randint(0,len(self.list)-1)\\n return self.list[inx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"296\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.nums, self.pos = [], {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.pos:\\n return False\\n\\n self.nums.append(val)\\n self.pos[val] = len(self.nums) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.pos:\\n idx, last = self.pos[val], self.nums[-1]\\n self.nums[idx] = last \\n self.pos[last] = idx\\n self.nums.pop()\\n self.pos.pop(val, 0)\\n return True\\n return False\\n \\n def getRandom(self) -> int:\\n\\n return self.nums[random.randint(0, len(self.nums) - 1)]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.idx_to_val = {}\\n self.val_to_idx = {}\\n self.size = 0\\n\\n def insert(self, val: int) -> bool:\\n if val in self.val_to_idx:\\n # print(f'{val} already present in RandomizedSet')\\n return False\\n self.size += 1\\n idx = self.size\\n self.idx_to_val[idx] = val\\n self.val_to_idx[val] = idx\\n # print(f'after insert {val}, size={self.size}, idx_to_val={self.idx_to_val}, val_to_idx={self.val_to_idx}')\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.val_to_idx:\\n # print(f'{val} not present in RandomizedSet')\\n return False\\n if self.size == 1:\\n del self.val_to_idx[val]\\n del self.idx_to_val[1]\\n else:\\n idx = self.val_to_idx[val]\\n repl_val = self.idx_to_val[self.size]\\n self.val_to_idx[repl_val] = idx\\n self.idx_to_val[idx] = repl_val\\n del self.val_to_idx[val]\\n del self.idx_to_val[self.size]\\n self.size -= 1\\n # print(f'after remove {val}, size={self.size}, idx_to_val={self.idx_to_val}, val_to_idx={self.val_to_idx}')\\n return True\\n\\n def getRandom(self) -> int:\\n idx = random.randint(1, self.size)\\n return self.idx_to_val[idx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.data = {}\\n self.arr = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n return False\\n else:\\n self.arr.append(val)\\n self.data[val] = len(self.arr) - 1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.data:\\n return False\\n else:\\n idx_of_delete = self.data[val]\\n last_number = self.arr[-1]\\n self.arr[-1], self.arr[idx_of_delete] = val, last_number\\n self.arr.pop()\\n self.data[last_number] = idx_of_delete\\n del self.data[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n random_int = random.randint(0, len(self.arr) - 1)\\n return self.arr[random_int]\\n \\n \\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.record = []\\n self.weights = []\\n self.map = {}\\n self.last = -1\\n\\n def insert(self, val: int) -> bool:\\n if self.map.get(val, None) is not None:\\n return False\\n self.last += 1\\n self.map[val] = self.last\\n if self.last >= len(self.record):\\n self.record.append(val)\\n self.weights.append(1)\\n else:\\n self.record[self.last] = val\\n self.weights[self.last] = 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.map.get(val, None) is None:\\n return False\\n self.map[self.record[self.last]] = self.map[val]\\n self.record[self.map[val]] = self.record[self.last]\\n self.map[val] = None\\n self.weights[self.last] = 0\\n self.last -= 1\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.record[:(self.last+1)])\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.tableSet = set()\\n self.table = []\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.tableSet:\\n self.tableSet.add(val)\\n self.table.append(val)\\n\\n return True\\n return False\\n \\n def remove(self, val: int) -> bool:\\n if val in self.tableSet:\\n self.tableSet.remove(val)\\n idx = self.table.index(val)\\n self.table[idx] = self.table[-1]\\n self.table.pop()\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n idx = random.randrange(0, len(self.table))\\n return self.table[idx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class RandomizedSet:\\n \\n def __init__(self):\\n self.val_to_idx = {}\\n self.vals = []\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.val_to_idx:\\n self.val_to_idx[val] = len(self.val_to_idx)\\n self.vals.append(val)\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.val_to_idx:\\n i = self.val_to_idx[val]\\n self.vals[i] = self.vals[-1]\\n self.val_to_idx[self.vals[-1]] = i\\n del self.val_to_idx[val]\\n self.vals.pop()\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n import random\\n return self.vals[random.randint(0, len(self.vals)-1)]\\n \\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.l = []\\n self.d = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.d:\\n return False\\n else:\\n self.l.append(val)\\n self.d[val] = len(self.l) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.d:\\n self.l[self.d[val]] = self.l[-1]\\n self.d[self.l[-1]] = self.d[val]\\n del self.d[val]\\n self.l.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n import random\\n return random.choice(list(self.l))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"313\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.map = {}\\n self.lst = []\\n \\n def insert(self, val: int) -> bool:\\n if val in self.map:\\n return False\\n \\n self.map[val] = len(self.lst)\\n self.lst.append(val)\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.lst:\\n return False\\n\\n last_element = self.lst[-1]\\n index_del_element = self.map[val]\\n\\n self.lst[index_del_element] = last_element\\n self.map[last_element] = index_del_element\\n\\n self.lst.pop()\\n del self.map[val]\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.lst)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"313\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.index = {}\\n self.data = [0] * (2 * 10 ** 5 + 1)\\n self.idx = 0\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.index:\\n return False\\n self.data[self.idx] = val\\n self.index[val] = self.idx\\n self.idx += 1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if not val in self.index:\\n return False\\n val_position = self.index[val]\\n last_position = self.idx - 1\\n last_val = self.data[last_position]\\n\\n # exchange value\\n self.data[val_position], self.data[last_position] = self.data[last_position], self.data[val_position]\\n\\n # update index\\n self.index[last_val] = val_position\\n del self.index[val]\\n \\n self.idx -= 1\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.data[:self.idx])\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.data = []\\n self.mapping = dict()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.mapping:\\n return False\\n else:\\n self.mapping[val] = len(self.data)\\n self.data.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.data:\\n last, idx = self.data[-1], self.mapping[val]\\n self.data[idx], self.mapping[last] = last, idx \\n self.data.pop()\\n del self.mapping[val]\\n return True\\n else:\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.data)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"from random import choice\\n\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.dict = {}\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n self.list.append(val)\\n self.dict[val] = len(self.list)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.list:\\n return False\\n i,last_el = self.dict[val],self.list[-1]\\n self.list[i],self.dict[last_el] = last_el,i\\n self.list.pop()\\n del self.dict[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class RandomizedSet:\\n d = {}\\n arr = []\\n def __init__(self):\\n self.d = {}\\n self.arr = []\\n\\n def insert(self, val: int) -> bool:\\n print(\\\"insert\\\")\\n if val not in self.d:\\n self.d[val] = len(self.arr)\\n self.arr.append(val)\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.d:\\n other_val = self.arr[-1]\\n index, other_index = self.d[val], self.d[other_val]\\n\\n self.d[other_val]= index\\n self.d.pop(val)\\n\\n self.arr[index] = other_val\\n self.arr.pop()\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n print(\\\"random\\\")\\n index = random.randint(0, len(self.arr) - 1)\\n return self.arr[index]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"'''\\n\\nInsert and delete in O(1) time is trivial. Just use a set.\\nGetRandom is a bit more annoying. For that, we ideally have all of the data indexed as an array...\\n\\nOk, so... let's just do that?\\n- Have an array that keeps unique elements. Append to it as needed.\\n- Have a dict that maps from elem --> idx.\\n\\nInsertions are easy.\\nGetting random is easy.\\n\\nHow do we remove? We need O(1) removal from an array.\\n\\nHonestly, we get *average* O(1) just by using a hashset.\\n- Pick random: if you \\\"miss\\\", just reroll.\\n\\n'''\\n\\nimport random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.val_to_idx = {}\\n self.data = []\\n\\n def prune(self):\\n if len(self.data) > len(self.val_to_idx) * 2:\\n self.data = [val for val in self.data if val is not None]\\n self.val_to_idx = dict(zip(self.data, range(len(self.data))))\\n\\n def insert(self, val: int) -> bool:\\n self.prune()\\n if val in self.val_to_idx:\\n return False\\n self.val_to_idx[val] = len(self.data)\\n self.data.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n self.prune()\\n present = val in self.val_to_idx\\n if present:\\n idx = self.val_to_idx[val]\\n del self.val_to_idx[val]\\n self.data[idx] = None\\n return present\\n\\n def getRandom(self) -> int:\\n while True:\\n idx = random.randint(0, len(self.data) - 1)\\n if self.data[idx] is not None:\\n return self.data[idx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.arr=[]\\n self.idx={}\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.idx:\\n self.arr.append(val)\\n self.idx[val]=len(self.arr)-1\\n return True\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.arr:\\n id=self.idx[val]\\n self.arr[id]=self.arr[-1]\\n self.idx[self.arr[-1]]=id\\n self.arr.pop()\\n del self.idx[val]\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.arr)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.vals = set()\\n self.items = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.vals:\\n return False\\n self.vals.add(val)\\n self.items.append(val)\\n return True\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.vals:\\n return False\\n self.vals.remove(val)\\n self.items.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n idx = random.randint(0,len(self.items)-1)\\n return self.items[idx]\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list = set()\\n self.hashmap = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.list:\\n return False\\n else:\\n self.list.add(val)\\n self.hashmap.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.list:\\n return False\\n else:\\n self.list.remove(val)\\n last = self.hashmap[-1]\\n index_of_val = self.hashmap.index(val)\\n self.hashmap[index_of_val] = last\\n self.hashmap.pop()\\n\\n return True \\n\\n def getRandom(self) -> int:\\n randomIndex = random.randint(0, len(self.list) -1)\\n return self.hashmap[randomIndex]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"330\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.dict = dict()\\n self.list = []\\n self.len = 0 \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.dict:\\n self.list.append(val)\\n self.dict[val] = self.len\\n self.len += 1\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.dict:\\n self.dict.pop(val, None)\\n self.list.remove(val)\\n self.len -= 1\\n return True\\n else:\\n return False \\n\\n def getRandom(self) -> int:\\n return self.list[random.randint(0, self.len-1)]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.r_set = set()\\n self.r_list = list()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.r_set:\\n return False\\n self.r_set.add(val)\\n self.r_list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.r_set:\\n self.r_set.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n ran = random.randint(0, len(self.r_list) - 1)\\n while (self.r_list[ran] not in self.r_set):\\n ran = random.randint(0, len(self.r_list) - 1)\\n return self.r_list[ran]\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"334\"\n },\n {\n \"code\": \"from random import randint\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.s1 = set()\\n self.s2 = set()\\n self.l = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.s1:\\n return False\\n elif val not in self.s2:\\n self.s2.add(val)\\n self.l.append(val)\\n self.s1.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.s1:\\n self.s1.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n val = self.l[randint(0, len(self.l)-1)]\\n while val not in self.s1:\\n val = self.l[randint(0, len(self.l)-1)]\\n return val\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"339\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.l=[]\\n self.m={}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.m:\\n self.l.append(val)\\n self.m[val]=val\\n return True\\n return False \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.m:\\n return False\\n else:\\n ele=self.m[val]\\n self.l.remove(ele)\\n del self.m[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n r1 = random.randint(0,len(self.l)-1)\\n return self.l[r1]\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"339\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.nums = []\\n self.indexes = {}\\n self.voids = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.indexes:\\n return False\\n\\n self.indexes[val] = len(self.nums)\\n self.nums.append(val)\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.indexes:\\n return False\\n \\n i = self.indexes[val]\\n self.voids.add(i)\\n del(self.indexes[val])\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n n = len(self.nums) - 1\\n i = random.randint(0, n)\\n\\n while i in self.voids:\\n i = random.randint(0, n)\\n\\n\\n return self.nums[i]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.s = {}\\n self.a = []\\n self.index = 0\\n\\n def insert(self, val: int) -> bool:\\n if val in self.s:\\n return False\\n else:\\n self.s[val] = self.index\\n self.index += 1\\n self.a.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.s:\\n self.index -= 1\\n i = self.s[val]\\n last = self.a[-1]\\n self.a[i] = last\\n self.s[last] = i\\n self.s.pop(val)\\n self.a.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choices(self.a,k=1)[0]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"343\"\n },\n {\n \"code\": \"import random\\nimport time\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n\\n timestamp = time.time()\\n \\n self.my_set = set()\\n self.my_list = []\\n\\n def insert(self, val: int) -> bool:\\n\\n if val in self.my_set:\\n insert_exist = True\\n\\n else: \\n insert_exist = False\\n self.my_set.add(val)\\n self.my_list.append(val)\\n\\n return not insert_exist\\n \\n\\n def remove(self, val: int) -> bool:\\n \\n if val in self.my_set:\\n remove_exist = True\\n self.my_set.remove(val)\\n self.my_list.remove(val)\\n \\n else: \\n remove_exist = False\\n\\n return remove_exist\\n\\n\\n def getRandom(self) -> int:\\n \\n random_element = random.choice(self.my_list)\\n print(random_element)\\n\\n\\n return random_element\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"347\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.vals = collections.OrderedDict()\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.vals:\\n return False\\n self.list.append(val)\\n self.vals[val] = len(self.list) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.vals:\\n return False\\n \\n lastElement, index = self.list[-1], self.vals[val]\\n self.list[index] = lastElement\\n self.list.pop()\\n\\n self.vals[lastElement] = index\\n del self.vals[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return choices(self.list)[0]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"347\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.num_index = {}\\n self.index_num = {}\\n self.count = 0\\n self.spare_indexes = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.num_index:\\n return False\\n if len(self.spare_indexes) > 0:\\n index = self.spare_indexes.pop()\\n self.num_index[val] = index\\n self.index_num[index] = val\\n \\n else:\\n self.num_index[val] = self.count\\n self.index_num[self.count] = val\\n self.count += 1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.num_index:\\n return False\\n index = self.num_index[val]\\n self.spare_indexes.append(index)\\n del self.num_index[val]\\n del self.index_num[index]\\n\\n return True\\n\\n def getRandom(self) -> int:\\n while True:\\n index = random.randint(0, self.count)\\n if index in self.index_num:\\n return self.index_num[index]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"352\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.baseval = float('inf')\\n self.vals = []\\n self.allinserts = []\\n\\n def insert(self, val: int) -> bool:\\n if len(self.vals) == 0:\\n self.baseval = abs(val)\\n self.allinserts = [val]\\n if val < 0:\\n self.vals = [1]\\n else:\\n self.vals = [2]\\n return True\\n if abs(val) > len(self.vals) - 1 + self.baseval:\\n tempvals = [0] * (abs(val) + 1 - self.baseval)\\n tempvals[:len(self.vals)] = self.vals\\n self.vals = tempvals\\n if val < 0:\\n self.vals[abs(val) - self.baseval] = 1\\n self.allinserts.append(val)\\n return True\\n else:\\n self.vals[val - self.baseval] = 2\\n self.allinserts.append(val)\\n return True\\n elif abs(val) < self.baseval:\\n tempvals = [0] * (len(self.vals) + (self.baseval - abs(val)))\\n tempvals[self.baseval - abs(val):] = self.vals\\n self.vals = tempvals\\n self.baseval = abs(val)\\n if val < 0:\\n self.vals[abs(val) - self.baseval] = 1\\n self.allinserts.append(val)\\n return True\\n else:\\n self.vals[val - self.baseval] = 2\\n self.allinserts.append(val)\\n return True\\n else:\\n if val < 0:\\n if self.vals[abs(val) - self.baseval] == 1:\\n return False\\n elif self.vals[abs(val) - self.baseval] == 0:\\n self.vals[abs(val) - self.baseval] = 1\\n self.allinserts.append(val)\\n return True\\n elif self.vals[abs(val) - self.baseval] == 3:\\n return False\\n else:\\n self.vals[abs(val) - self.baseval] = 3\\n self.allinserts.append(val)\\n return True\\n else:\\n if self.vals[val - self.baseval] == 1:\\n self.vals[val - self.baseval] = 3\\n self.allinserts.append(val)\\n return True\\n elif self.vals[val - self.baseval] == 0:\\n self.vals[val - self.baseval] = 2\\n self.allinserts.append(val)\\n return True\\n elif self.vals[val - self.baseval] == 3:\\n return False\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if len(self.vals) == 0 or abs(val) > len(self.vals) - 1 + self.baseval or abs(val) < self.baseval:\\n return False\\n if val < 0:\\n if self.vals[abs(val) - self.baseval] == 1:\\n self.vals[abs(val) - self.baseval] = 0\\n return True\\n elif self.vals[abs(val) - self.baseval] == 0:\\n return False\\n elif self.vals[abs(val) - self.baseval] == 3:\\n self.vals[abs(val) - self.baseval] = 2\\n return True\\n else:\\n return False\\n if val >= 0:\\n if self.vals[val - self.baseval] == 1:\\n return False\\n elif self.vals[val - self.baseval] == 0:\\n return False\\n elif self.vals[val - self.baseval] == 3:\\n self.vals[val - self.baseval] = 1\\n return True\\n else:\\n self.vals[val - self.baseval] = 0\\n return True\\n\\n def getRandom(self) -> int:\\n while True:\\n candidate = random.choice(self.allinserts)\\n if candidate < 0:\\n if self.vals[abs(candidate) - self.baseval] == 1 or self.vals[abs(candidate) - self.baseval] == 3:\\n return candidate\\n else:\\n if self.vals[candidate - self.baseval] == 2 or self.vals[candidate - self.baseval] == 3:\\n return candidate\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"352\"\n },\n {\n \"code\": \"class DynamicList:\\n def __init__(self, init_size = 10, hash_table = {}):\\n self.array = [0 for _ in range(init_size)]\\n self.size = init_size\\n self.init_size = init_size\\n self.num_elements = 0\\n self.current_index = 0\\n self.valid = [False for _ in range(init_size)]\\n self.hash_table = hash_table\\n\\n def refresh(self):\\n new_size = int(self.size / 2)\\n new_array = [0 for _ in range(new_size)]\\n new_valid = [False for _ in range(new_size)]\\n j = 0\\n for i in range(self.current_index):\\n if self.valid[i] == True:\\n val = self.array[i]\\n self.hash_table[val] = j\\n new_array[j] = val\\n new_valid[j] = True\\n j += 1\\n \\n\\n self.array = new_array\\n self.valid = new_valid\\n self.num_elements = j - 1\\n self.current_index = j\\n self.size = new_size\\n\\n def insert(self, val):\\n i = self.current_index\\n if i > self.size - 1:\\n #double the size of the array\\n self.array.extend([0 for _ in range(self.size)])\\n self.valid.extend([False for _ in range(self.size)])\\n self.size *= 2\\n\\n self.array[i] = val\\n self.valid[i] = True\\n self.current_index += 1\\n self.num_elements += 1\\n return i\\n\\n def remove(self, index):\\n self.valid[index] = False\\n self.num_elements -= 1\\n if (self.size > self.init_size and self.num_elements < self.size / 4):\\n self.refresh()\\n\\n \\n def get_random(self):\\n found = False\\n while not found:\\n i = random.randint(0, self.current_index - 1)\\n if (self.valid[i] == True):\\n return self.array[i]\\n\\n\\n\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.hashtable = {}\\n self.dynamic_list = DynamicList(init_size = 50, hash_table = self.hashtable)\\n \\n def insert(self, val: int) -> bool:\\n if val in self.hashtable:\\n return False\\n i = self.dynamic_list.insert(val)\\n self.hashtable[val] = i\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.hashtable:\\n return False\\n i = self.hashtable[val]\\n self.dynamic_list.remove(i)\\n del self.hashtable[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return self.dynamic_list.get_random()\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"356\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.seen = set()\\n self.arr = []\\n \\n def insert(self, val: int) -> bool:\\n if val not in self.seen:\\n self.seen.add(val)\\n self.arr.append(val)\\n return True\\n return False\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.seen:\\n return False\\n self.seen.remove(val)\\n return True\\n \\n def getRandom(self) -> int:\\n while True:\\n N = len(self.arr)\\n r = random.randint(0, N-1)\\n if self.arr[r] in self.seen:\\n return self.arr[r]\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"356\"\n },\n {\n \"code\": \"class DynamicList:\\n def __init__(self, init_size = 10, hash_table = {}):\\n self.array = [0 for _ in range(init_size)]\\n self.size = init_size\\n self.init_size = init_size\\n self.num_elements = 0\\n self.current_index = 0\\n self.valid = [False for _ in range(init_size)]\\n self.hash_table = hash_table\\n\\n def refresh(self):\\n new_size = int(self.size / 2)\\n new_array = [0 for _ in range(new_size)]\\n new_valid = [False for _ in range(new_size)]\\n j = 0\\n for i in range(self.current_index):\\n if self.valid[i] == True:\\n val = self.array[i]\\n self.hash_table[val] = j\\n new_array[j] = val\\n new_valid[j] = True\\n j += 1\\n \\n\\n self.array = new_array\\n self.valid = new_valid\\n self.num_elements = j - 1\\n self.current_index = j\\n self.size = new_size\\n\\n def insert(self, val):\\n i = self.current_index\\n if i > self.size - 1:\\n #double the size of the array\\n self.array.extend([0 for _ in range(self.size)])\\n self.valid.extend([False for _ in range(self.size)])\\n self.size *= 2\\n\\n self.array[i] = val\\n self.valid[i] = True\\n self.current_index += 1\\n self.num_elements += 1\\n return i\\n\\n def remove(self, index):\\n self.valid[index] = False\\n self.num_elements -= 1\\n if (self.size > self.init_size and self.num_elements < self.size / 4):\\n self.refresh()\\n\\n \\n def get_random(self):\\n found = False\\n while not found:\\n i = random.randint(0, self.current_index - 1)\\n if (self.valid[i] == True):\\n return self.array[i]\\n\\n\\n\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.hashtable = {}\\n self.dynamic_list = DynamicList(init_size = 5, hash_table = self.hashtable)\\n \\n def insert(self, val: int) -> bool:\\n if val in self.hashtable:\\n return False\\n i = self.dynamic_list.insert(val)\\n self.hashtable[val] = i\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.hashtable:\\n return False\\n i = self.hashtable[val]\\n self.dynamic_list.remove(i)\\n del self.hashtable[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return self.dynamic_list.get_random()\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.vals = {}\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n print(len(self.vals))\\n if val in self.vals:\\n return False \\n \\n self.list.append(val)\\n self.vals[val] = len(self.list) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.vals:\\n return False \\n index, lastElement = self.vals[val], self.list[-1]\\n self.list[index] = lastElement\\n self.list.pop()\\n\\n self.vals[lastElement] = index\\n del self.vals[val]\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return choices(self.list)[0]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.setstore = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.setstore:\\n return False\\n else:\\n self.setstore[val] = True\\n return True\\n\\n def remove(self, val: int) -> bool:\\n return self.setstore.pop(val, False)\\n\\n def getRandom(self) -> int:\\n dict_keys = list(self.setstore.keys())\\n return dict_keys[int(len(dict_keys)*random.random())]\\n\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n self.list = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if ({val}.issubset(self.set)):\\n return False\\n else:\\n self.set.add(val)\\n self.list.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if ({val}.issubset(self.set)):\\n self.set.remove(val)\\n return True\\n else:\\n return False\\n \\n def getRandom(self) -> int:\\n i = random.randint(0, len(self.list) - 1)\\n while (not {self.list[i]}.issubset(self.set)):\\n i = random.randint(0, len(self.list) - 1)\\n return self.list[i]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.random_set = set()\\n self.random_array = []\\n self.prev_random = 0\\n self.count = 0\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.random_set:\\n self.random_set.add(val)\\n self.random_array.append(val)\\n return True\\n \\n else:\\n return False \\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.random_set:\\n self.random_set.remove(val)\\n self.random_array.remove(val)\\n return True\\n \\n else:\\n return False \\n\\n def getRandom(self) -> int:\\n self.count += 1\\n\\n if len(self.random_array) > 1: \\n random_index = (self.count + random.choice([0, 1])) % len(self.random_array)\\n random_val = self.random_array[random_index]\\n \\n else:\\n random_val = self.random_array[0]\\n\\n\\n return random.choice(self.random_array)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"369\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set_dict = {}\\n self.arr = []\\n \\n\\n def insert(self, val: int) -> bool:\\n check_val = self.set_dict.get(val)\\n if check_val != None:\\n return False\\n \\n self.arr.append(val)\\n self.set_dict[val] = val\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n check_val = self.set_dict.get(val);\\n if check_val != None:\\n del self.set_dict[val]\\n self.arr = list(self.set_dict.keys())\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n idx = random.randint(0, len(self.arr)-1)\\n return self.arr[idx]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"369\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.item_number = {}\\n self.number_item = {}\\n self.total = 0\\n\\n def insert(self, val: int) -> bool:\\n if str(val) not in self.item_number:\\n self.item_number[str(val)] = self.total\\n self.number_item[str(self.total)] = val\\n self.total += 1\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if str(val) in self.item_number:\\n del self.number_item[str(self.item_number[str(val)])]\\n del self.item_number[str(val)]\\n return True\\n else:\\n return False\\n def getRandom(self) -> int:\\n res = str(random.randint(0,self.total))\\n while res not in self.number_item:\\n res = str(random.randint(0,self.total))\\n return self.number_item[res]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"373\"\n },\n {\n \"code\": \"from random import randint\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.contained = set()\\n self.removed = set()\\n self.arr = []\\n\\n def insert(self, val: int) -> bool:\\n self.clean()\\n if val in self.contained:\\n return False\\n self.contained.add(val)\\n if val not in self.removed:\\n self.arr.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n self.clean()\\n if val not in self.contained:\\n return False\\n self.contained.remove(val)\\n self.removed.add(val)\\n return True\\n\\n def getRandom(self) -> int:\\n self.clean()\\n n = len(self.arr)\\n ind = randint(0, n-1)\\n while self.arr[ind] not in self.contained:\\n ind = randint(0, n-1)\\n return self.arr[ind]\\n \\n def clean(self):\\n if len(self.removed) > len(self.contained):\\n self.removed = set()\\n self.arr = list(self.contained)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"373\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n # RandomizedSet() Initializes the RandomizedSet object.\\n self.data = set()\\n self.data_l = list()\\n\\n def insert(self, val: int) -> bool:\\n # bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.\\n if val in self.data:\\n return False\\n self.data.add(val)\\n self.data_l.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n # bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.\\n if val not in self.data:\\n return False\\n self.data.remove(val)\\n self.data_l = list(self.data)\\n return True\\n\\n def getRandom(self) -> int:\\n # int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.\\n return random.choice(self.data_l)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.value_to_idx = {}\\n self.values = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.values:\\n return False\\n self.values.append(val)\\n self.value_to_idx[val] = len(self.values) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.value_to_idx:\\n return False\\n idx = self.value_to_idx.pop(val)\\n if idx == len(self.values) - 1:\\n self.values.pop()\\n return True\\n\\n # swap\\n self.value_to_idx[self.values[-1]] = idx\\n self.values[idx], self.values[-1] = self.values[-1], self.values[idx]\\n _ = self.values.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"377\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.rset = {}\\n\\n def insert(self, val: int) -> bool:\\n exists = self.rset.get(val)\\n self.rset[val] = True\\n return not exists\\n\\n def remove(self, val: int) -> bool:\\n exists = self.rset.get(val)\\n if exists:\\n self.rset.pop(val)\\n return exists\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.rset.keys()))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.freq = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.freq:\\n return False\\n else:\\n self.freq[val]=True\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.freq:\\n del self.freq[val]\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.freq.keys()))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"from random import choice\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.rSet = dict()\\n\\n def insert(self, val: int) -> bool:\\n if self.rSet.get(val) == True:\\n return False\\n self.rSet[val]=1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.rSet.get(val)==True:\\n del self.rSet[val]\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return choice(list(self.rSet.keys()))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"386\"\n },\n {\n \"code\": \"from random import choice\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.map = {}\\n self.n = 0\\n\\n def insert(self, val: int) -> bool: # constan time\\n if val in self.map: return False\\n\\n self.map[val] = self.n\\n self.n+=1\\n return True\\n \\n\\n def remove(self, val: int) -> bool: # improve\\n if val not in self.map: return False\\n self.n-=1\\n del self.map[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return choice(list(self.map.keys()))\\n \\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"386\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set_map = {}\\n\\n def insert(self, val: int) -> bool:\\n try:\\n self.set_map[val]\\n return False\\n except:\\n self.set_map[val] = val\\n return True\\n\\n def remove(self, val: int) -> bool:\\n try:\\n self.set_map[val]\\n del self.set_map[val]\\n return True\\n except:\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.set_map.keys()))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"390\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.hass = dict()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.hass:\\n self.hass[val] = 0\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.hass:\\n del self.hass[val]\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n c = list(self.hass.keys())\\n return choice(c)\\n\\n \\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"390\"\n },\n {\n \"code\": \"с=Counter;с.insert=lambda s,x:s.update({x})or s[x]<2;с.remove=lambda s,x:s.pop(x,0);с.getRandom=lambda s:choice([*s]);RandomizedSet=с\",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"from random import randrange\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.vals = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.vals:\\n return False\\n self.vals[val] = True\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.vals:\\n return False\\n self.vals.pop(val)\\n return True\\n\\n def getRandom(self) -> int:\\n r = randrange(len(self.vals))\\n keys = list(self.vals.keys())\\n k = keys[r]\\n return keys[r]\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.set:\\n return False\\n else:\\n self.set[val] = 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n del self.set[val]\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.set.keys()))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"399\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.items = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.items:\\n print(val)\\n return False\\n self.items[val] = val\\n return True \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.items:\\n return False\\n self.items.pop(val)\\n return True \\n\\n def getRandom(self) -> int:\\n values = list(self.items.values())\\n return random.choice(values)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"399\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.storage = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.storage:\\n return False\\n self.storage[val] = 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.storage:\\n return False\\n self.storage.pop(val)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.storage.keys())) \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"403\"\n },\n {\n \"code\": \"from random import choice\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.dict = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the set. Returns true if the set did not already contain the specified element.\\n \\\"\\\"\\\"\\n if self.dict.get(val):\\n return False\\n self.dict[val] = True\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the set. Returns true if the set contained the specified element.\\n \\\"\\\"\\\"\\n if self.dict.get(val):\\n self.dict.pop(val)\\n return True\\n \\n return False\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the set.\\n \\\"\\\"\\\"\\n return choice(list(self.dict.keys()))\",\n \"runtime\": \"403\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.val_ix = dict()\\n self.rlist = []\\n \\n\\n def insert(self, val: int) -> bool:\\n added = False\\n if val not in self.val_ix:\\n added = True\\n self.rlist.append(val)\\n self.val_ix[val] = len(self.rlist) -1\\n\\n return added\\n\\n\\n def remove(self, val: int) -> bool:\\n removed = False\\n if val in self.val_ix:\\n removed = True\\n ix_to_delete = self.val_ix[val]\\n # removing is O(N) so switch it to last value in list and pop it\\n self.rlist[ix_to_delete], self.rlist[-1] = self.rlist[-1], self.rlist[ix_to_delete]\\n # update key - val\\n self.val_ix[self.rlist[ix_to_delete]] = ix_to_delete\\n del self.val_ix[val]\\n self.rlist.pop()\\n return removed\\n \\n \\n def getRandom(self) -> int:\\n return random.sample(self.rlist, 1)[0]\\n \\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"407\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.__dict = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.__dict:\\n self.__dict[val] = 1\\n return True\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.__dict:\\n del self.__dict[val]\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return list(self.__dict)[random.randrange(len(self.__dict))]\\n\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"407\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.dict = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n else:\\n self.dict[val] = None\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.dict:\\n return False\\n else:\\n del self.dict[val]\\n return True \\n\\n def getRandom(self) -> int:\\n length = len(self.dict.keys()) - 1 \\n return list(self.dict.keys())[random.randint(0, length)]\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"424\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.val_dict = dict()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.val_dict:\\n return False\\n\\n self.val_dict[val] = val\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.val_dict:\\n del self.val_dict[val]\\n return True\\n \\n return False\\n \\n\\n def getRandom(self) -> int:\\n\\n vals = list(self.val_dict.values())\\n return vals[randint(0, len(vals) - 1)]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"424\"\n },\n {\n \"code\": \"from random import randint\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.data = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n return False\\n self.data[val] = True\\n return True\\n\\n\\n def remove(self, val: int) -> bool:\\n if val in self.data:\\n del self.data[val]\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n i = randint(0, len(self.data) - 1)\\n return list(self.data.keys())[i]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"from random import choice\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.indices = {}\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.list:\\n return False\\n self.list.append(val)\\n self.indices[val] = len(self.list) - 1\\n return True\\n \\n def remove(self, val: int) -> bool:\\n if val in self.list:\\n lastVal = self.list[-1]\\n removeInd = self.indices[val]\\n self.list[removeInd] = lastVal\\n self.indices[lastVal] = removeInd\\n self.list.pop()\\n del self.indices[val]\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"428\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.values = [] \\n self.map = {} \\n\\n def insert(self, val: int) -> bool:\\n if val in self.values:\\n return False\\n self.values.append(val) \\n self.map[val] = len(self.values) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.values:\\n return False\\n index = self.map[val]\\n # swapping\\n tempLast = self.values[-1]\\n self.values[-1] = val\\n self.values[index] = tempLast\\n # update hashmap \\n self.map[tempLast] = index\\n # remove val\\n self.values.pop()\\n del self.map[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.set:\\n return False\\n else:\\n self.set.add(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(tuple(self.set))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"433\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.randomSet = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.randomSet:\\n return False\\n else:\\n self.randomSet.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.randomSet:\\n self.randomSet.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n \\n return choice(tuple(self.randomSet))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"437\"\n },\n {\n \"code\": \"from random import randint\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.data = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n return False\\n self.data[val] = True\\n return True\\n\\n\\n def remove(self, val: int) -> bool:\\n if val in self.data:\\n del self.data[val]\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n i = randint(0, len(self.data) - 1)\\n return list(self.data.keys())[i]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"437\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.nums_list = []\\n self.nums_map = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.nums_list:\\n return False\\n self.nums_map[val] = len(self.nums_list)\\n self.nums_list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.nums_list:\\n return False\\n last_val = self.nums_list[-1]\\n val_idx = self.nums_map[val]\\n self.nums_list[val_idx] = last_val\\n del self.nums_map[val]\\n self.nums_list.pop()\\n self.nums_map[last_val] = val_idx\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nums_list)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.arr = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.arr:\\n return False\\n self.arr.add(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.arr:\\n self.arr.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.arr))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"441\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.items = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.items:\\n return False\\n\\n self.items.add(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.items:\\n return False\\n \\n self.items.remove(val)\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(tuple(self.items))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.data = []\\n self.data_map = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n return False\\n \\n self.data_map[val] = len(self.data)\\n self.data.append(val)\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.data:\\n return False\\n\\n ind = self.data_map[val]\\n last_val = self.data[-1]\\n self.data[ind] = last_val\\n self.data_map[last_val] = ind\\n self.data[-1] = val\\n\\n\\n self.data.pop()\\n self.data_map.pop(val)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.data)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"446\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.mySet=set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.mySet:\\n ret=False\\n else:\\n ret=True\\n self.mySet.add(val)\\n return(ret)\\n\\n def remove(self, val: int) -> bool:\\n try:\\n self.mySet.remove(val)\\n return(True)\\n except:\\n return(False)\\n\\n def getRandom(self) -> int:\\n return(random.choice(list(self.mySet)))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.ran = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.ran:\\n self.ran.add(val)\\n return True\\n else:\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.ran:\\n self.ran.remove(val)\\n return True\\n else:\\n return False\\n\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.ran))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"class RandomizedSet:\\n def __init__(self):\\n self.ran = set()\\n def insert(self, val: int) -> bool:\\n if val not in self.ran:\\n self.ran.add(val)\\n return True\\n else:\\n return False\\n def remove(self, val: int) -> bool:\\n if val in self.ran:\\n self.ran.remove(val)\\n return True\\n else:\\n return False\\n def getRandom(self) -> int:\\n return random.choice(list(self.ran))\\n \",\n \"runtime\": \"454\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.set:\\n self.set.add(val)\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.set))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"454\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n # 初始化时创建一个空的集合 self.rset 用于存储元素\\n self.rset = set()\\n \\n def insert(self, val: int) -> bool:\\n # 检查元素 val 是否不在集合中\\n if val not in self.rset:\\n # 如果不在集合中，则将该元素添加到集合\\n self.rset.add(val)\\n # 返回 True 表示成功插入\\n return True\\n # 如果元素已经存在于集合中，返回 False 表示插入失败\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n # 检查元素 val 是否在集合中\\n if val in self.rset:\\n # 如果在集合中，则将该元素从集合中移除\\n self.rset.remove(val)\\n # 返回 True 表示成功移除\\n return True\\n # 如果元素不在集合中，返回 False 表示移除失败\\n return False\\n \\n\\n def getRandom(self) -> int:\\n # 直接从集合转换的列表中随机选择一个元素并返回\\n return random.choice(list(self.rset))\",\n \"runtime\": \"458\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.mySet = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.mySet:\\n return False\\n else:\\n self.mySet.add(val)\\n return True\\n def remove(self, val: int) -> bool:\\n if val not in self.mySet:\\n return False\\n else:\\n self.mySet.remove(val)\\n return True\\n def getRandom(self) -> int:\\n # l = len(self.mySet)\\n # ix = random.randint(0,l-1)\\n return random.choice(list(self.mySet))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"458\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.set:\\n self.set.add(val)\\n return True\\n return False\\n\\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n import random\\n return random.choice(tuple(self.set))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"463\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.data = set()\\n \\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n return False\\n self.data.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.data:\\n self.data.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(tuple(self.data))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"463\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.vals_map = {}\\n self.vals = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.vals:\\n return False\\n\\n self.vals_map[val] = len(self.vals)\\n self.vals.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.vals:\\n return False\\n\\n # need to move the element to end of list before removing\\n curVal, curInd = val, self.vals_map[val]\\n endVal, endInd = self.vals[-1], len(self.vals) - 1\\n self.vals[curInd], self.vals[endInd] = endVal, curVal\\n self.vals_map[endVal] = curInd\\n self.vals_map.pop(curVal)\\n self.vals.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.vals) \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"467\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.rng = set()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.rng:\\n self.rng.add(val) \\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.rng:\\n self.rng.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.rng))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"467\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.content = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.content: return False\\n self.content.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.content: return False\\n self.content.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(tuple(self.content))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"471\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set1 = set() \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.set1:\\n self.set1.add(val)\\n return True \\n else:\\n return False\\n \\n def remove(self, val: int) -> bool:\\n if val in self.set1:\\n self.set1.remove(val)\\n return True\\n else:\\n \\n return False\\n \\n def getRandom(self) -> int:\\n return random.choice(list(self.set1)) \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"471\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.random_set = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.random_set:\\n return False\\n else:\\n self.random_set.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.random_set:\\n self.random_set.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.random_set))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"476\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set=[]\\n\\n def insert(self, val: int) -> bool:\\n if val in self.set:\\n return False\\n self.set.append(val)\\n return True \\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n inx=random.randint(0,len(self.set)-1)\\n return self.set[inx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"476\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.a = []\\n\\n def insert(self, val: int) -> bool:\\n while val not in self.a:\\n self.a.append(val)\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n while val in self.a:\\n self.a.remove(val)\\n return True\\n return False\\n \\n def getRandom(self) -> int:\\n ran = random.choice(self.a)\\n return ran\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"480\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.set : return False\\n \\n self.set.append(val)\\n return True\\n\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.set : return False\\n self.set.remove(val)\\n return True\\n \\n def getRandom(self) -> int:\\n return random.choice(self.set)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"480\"\n },\n {\n \"code\": \"from random import randrange\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.r_set = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.r_set:\\n return False\\n\\n self.r_set.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.r_set:\\n return False\\n\\n self.r_set.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n max_len = len(self.r_set)\\n random_index = randrange(0, max_len)\\n\\n return list(self.r_set)[random_index]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.Set = set()\\n self.len = 0\\n\\n def insert(self, val: int) -> bool:\\n if val in self.Set:\\n return False\\n else:\\n self.Set.add(val)\\n self.len+=1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.Set:\\n self.Set.remove(val)\\n self.len-=1\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n ind = random.randint(0,self.len-1)\\n return list(self.Set)[ind]\\n\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.lst = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.lst:\\n return False\\n self.lst.add(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.lst:\\n self.lst.remove(val)\\n return True\\n return False\\n\\n\\n def getRandom(self) -> int:\\n index = list(self.lst)\\n return index[random.randint(0, len(index)-1)]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"488\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.my_set = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.my_set:\\n return False\\n self.my_set.add(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n try:\\n self.my_set.remove(val)\\n except KeyError:\\n return False \\n return True \\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.my_set))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"488\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n\\n def insert(self, val: int) -> bool:\\n was_in_set = val not in self.set\\n self.set.add(val)\\n return was_in_set\\n\\n def remove(self, val: int) -> bool:\\n was_in_set = val in self.set\\n if was_in_set:\\n self.set.remove(val)\\n return was_in_set\\n \\n def getRandom(self) -> int:\\n import random\\n return random.choice(list(self.set))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"493\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.set : return False\\n \\n self.set.append(val)\\n return True\\n\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.set : return False\\n self.set.remove(val)\\n return True\\n \\n def getRandom(self) -> int:\\n return random.choice(self.set)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"493\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.data = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.data:\\n self.data.add(val)\\n return True\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.data:\\n self.data.remove(val)\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n nums = list(self.data)\\n r = random.randint(0, len(nums) - 1)\\n return nums[r]\\n # return random.choice(list(self.data))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"497\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set1 = set() \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.set1:\\n self.set1.add(val)\\n return True \\n else:\\n return False\\n \\n def remove(self, val: int) -> bool:\\n if val in self.set1:\\n self.set1.remove(val)\\n return True\\n else:\\n \\n return False\\n \\n def getRandom(self) -> int:\\n ind = random.randint(0,len(self.set1) -1 )\\n return list(self.set1)[ind] \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"497\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n def __init__(self):\\n self.randSet = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.randSet:\\n return False\\n self.randSet.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.randSet:\\n self.randSet.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n random_num = random.randint(0,len(self.randSet)-1)\\n return self.randSet[random_num]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.finalSet = list()\\n self.index = 0\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.finalSet:\\n self.finalSet.append(val)\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.finalSet:\\n self.finalSet.remove(val)\\n return True\\n return False \\n \\n\\n def getRandom(self) -> int:\\n index = (random.randint(0, len(self.finalSet) - 1))\\n return self.finalSet[index]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"501\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.my_set = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.my_set:\\n return False\\n self.my_set.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.my_set:\\n self.my_set.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.my_set))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"505\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set=set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.set:\\n return False\\n else:\\n self.set.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return list(self.set)[random.randint(0,len(self.set)-1)]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"505\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.data = set()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.data:\\n self.data.add(val)\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.data:\\n self.data.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n idx = random.randint(0,len(self.data)-1)\\n return list(self.data)[idx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"510\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.rand_set = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.rand_set:\\n return False\\n self.rand_set.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.rand_set:\\n self.rand_set.remove(val)\\n return True\\n return False\\n\\n\\n def getRandom(self) -> int:\\n return random.choice(self.rand_set)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"510\"\n },\n {\n \"code\": \"\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n\\n def insert(self, val: int) -> bool:\\n was_in_set = val not in self.set\\n self.set.add(val)\\n return was_in_set\\n\\n def remove(self, val: int) -> bool:\\n was_in_set = val in self.set\\n if was_in_set:\\n self.set.remove(val)\\n return was_in_set\\n \\n def getRandom(self) -> int:\\n import random\\n choice = random.choice(list(self.set))\\n return choice\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.thisset = [] \\n\\n def insert(self, val: int) -> bool:\\n if val in self.thisset:\\n return False\\n else:\\n (self.thisset).append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.thisset:\\n (self.thisset).remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n n = len(self.thisset)\\n return (self.thisset)[random.randint(0, len(self.thisset)-1)]\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"514\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.list1 = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if(val in self.list1):\\n return False\\n else:\\n self.list1.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if(val in self.list1):\\n self.list1.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.list1)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"518\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.array=[]\\n def insert(self, val: int) -> bool:\\n if val in self.array:\\n return False\\n else:\\n self.array.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.array:\\n self.array.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n val=self.array[random.randint(0,len(self.array)-1)]\\n return val\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"518\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.this_set = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.this_set:\\n return False\\n \\n self.this_set.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.this_set:\\n return False\\n self.this_set.remove(val)\\n\\n return True\\n\\n def getRandom(self) -> int:\\n if len(self.this_set) == 0:\\n return False\\n\\n return self.this_set[random.randint(0, len(self.this_set) - 1)]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"523\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list_set = [] \\n\\n def insert(self, val: int) -> bool:\\n if val in self.list_set:\\n return False\\n self.list_set.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.list_set:\\n self.list_set.remove(val)\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n import random\\n return random.choice(self.list_set)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"523\"\n },\n {\n \"code\": \"class RandomizedSet:\\n import random\\n\\n def __init__(self):\\n self.set={}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.set: return False\\n else: \\n self.set[val]=1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.pop(val)\\n return True\\n else: return False\\n \\n def listify(self) -> list:\\n return [_ for _ in self.set]\\n \\n def getRandom(self) -> int:\\n z = self.listify() # Fix: Call listify with self\\n return self.random.choice(z) \\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"527\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.lst=list()\\n def insert(self, val: int) -> bool:\\n if val not in self.lst:\\n self.lst.append(val)\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.lst:\\n self.lst.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n index=random.randrange(0,len(self.lst))\\n return self.lst[index]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"527\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.arr = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.arr:\\n self.arr.append(val)\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.arr:\\n return False\\n else:\\n idx = self.arr.index(val)\\n self.arr.pop(idx)\\n return True\\n \\n\\n def getRandom(self) -> int:\\n total = len(self.arr)-1\\n target = random.randint(0,total)\\n return self.arr[target]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n def __init__(self):\\n self.randomized_set = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.randomized_set:\\n return False\\n self.randomized_set.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.randomized_set:\\n return False\\n self.randomized_set.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n r1 = random.randint(0, len(self.randomized_set))\\n idx = 0\\n for item in self.randomized_set:\\n if r1 == idx:\\n return item\\n idx += 1\\n item = self.randomized_set.pop()\\n self.randomized_set.add(item)\\n return item\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"531\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.thisset = [] \\n\\n def insert(self, val: int) -> bool:\\n if val in self.thisset:\\n return False\\n else:\\n (self.thisset).append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.thisset:\\n (self.thisset).remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n n = len(self.thisset)\\n return (self.thisset)[random.randint(0, len(self.thisset)-1)]\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"535\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = []\\n\\n def insert(self, val: int) -> bool:\\n return (val not in self.set and not self.set.append(val))\\n\\n def remove(self, val: int) -> bool:\\n return val in self.set and not self.set.remove(val)\\n \\n def getRandom(self) -> int:\\n end = len(self.set)\\n index = random.randrange(end)\\n return self.set[index]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"535\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":147,"string":"147"},"mm_list":{"kind":"list like","value":[{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.setContents = set()\n \n\n def insert(self, val: int) -> bool:\n if val in self.setContents:\n return False\n self.setContents.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if not val in self.setContents:\n return False\n self.setContents.remove(val)\n return True \n\n def getRandom(self) -> int:\n setContentList = list(self.setContents)\n return random.choice(setContentList)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"62100"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.items = set()\n\n def insert(self, val: int) -> bool:\n if val in self.items:\n return False\n self.items.add(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.items:\n return False\n self.items.remove(val)\n return True\n\n def getRandom(self) -> int:\n return random.choice(list(self.items))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"62200"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.container = list()\n\n def insert(self, val: int) -> bool:\n if val not in self.container:\n self.container.append(val)\n return True\n else:\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.container:\n self.container.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n random.shuffle(self.container)\n return self.container[0]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"62300"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.objects = set()\n\n def insert(self, val: int) -> bool:\n if val not in self.objects:\n self.objects.add(val)\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.objects:\n self.objects.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(list(self.objects))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"62400"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.data = []\n self.map = {}\n\n def insert(self, val: int) -> bool:\n if val in self.map:\n return False\n\n self.data.append(val)\n self.map[val] = len(self.data) - 1\n\n return True\n\n\n def remove(self, val: int) -> bool:\n \n if val not in self.map:\n return False\n\n val_idx = self.map[val]\n length = len(self.data)\n last_val = self.data[length-1]\n\n self.data[val_idx] = last_val\n self.map[last_val] = val_idx\n del self.map[val]\n del self.data[length-1]\n\n return True\n\n def getRandom(self) -> int:\n length = len(self.data)\n random_idx = random.randrange(length)\n return self.data[random_idx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"62500"},{"code":"from random import choice\n\nclass RandomizedSet:\n\n def __init__(self):\n self.__values = set()\n\n def insert(self, val: int) -> bool:\n p = val in self.__values\n self.__values.add(val)\n return not p\n\n def remove(self, val: int) -> bool:\n p = val in self.__values\n\n if p:\n self.__values.remove(val)\n\n return p\n\n def getRandom(self) -> int:\n return choice(list(self.__values))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"62600"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.value_to_idx: Dict[int, int] = {}\n self.values: List[int] = []\n \n def insert(self, val: int) -> bool:\n if val in self.value_to_idx:\n return False\n\n self.values.append(val)\n self.value_to_idx[val] = len(self.values) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.value_to_idx:\n return False\n \n idx = self.value_to_idx[val]\n last_value = self.values[-1]\n # swep\n self.values[idx] = self.values[-1]\n self.values.pop()\n self.value_to_idx.pop(val, None)\n if last_value != val:\n self.value_to_idx[last_value] = idx\n return True\n \n def getRandom(self) -> int:\n return random.choice(self.values)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63000"},{"code":"from random import choice\n\nclass RandomizedSet:\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.dict = {}\n \n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the set. Returns true if the set did not already contain the specified element.\n \"\"\"\n if self.dict.get(val):\n return False\n self.dict[val] = True\n return True\n \n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the set. Returns true if the set contained the specified element.\n \"\"\"\n if self.dict.get(val):\n self.dict.pop(val)\n return True\n \n return False\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the set.\n \"\"\"\n return choice(list(self.dict.keys()))","memory":"63100"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.table = {}\n\n def insert(self, val: int) -> bool:\n try:\n self.table[val] += 1\n return False\n except KeyError:\n self.table[val] = 1\n return True\n\n def remove(self, val: int) -> bool:\n try:\n self.table[val] += 1\n self.table.pop(val)\n return True\n except KeyError:\n return False\n def getRandom(self) -> int:\n randInt = random.randint(0, len(self.table.keys())-1)\n randKey = list(self.table.keys())[randInt]\n return randKey\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63200"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n self.dict = {}\n \n\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n else:\n self.dict[val] = val\n return True\n \n\n def remove(self, val: int) -> bool:\n if val in self.dict:\n del(self.dict[val])\n return True\n else:\n return False\n \n def getRandom(self) -> int:\n return random.choice(list(self.dict.keys()))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63200"},{"code":"from random import Random\n\nclass RandomizedSet:\n\n def __init__(self):\n self.rand = Random()\n self.set = {}\n print(self.rand.randrange(0,100))\n \n\n def insert(self, val: int) -> bool:\n \n if self.set.get(val):\n return False\n else:\n self.set[val] = 1\n return True\n \n\n def remove(self, val: int) -> bool:\n if self.set.get(val):\n del self.set[val]\n return True\n else:\n return False\n \n\n def getRandom(self) -> int:\n return self.rand.choice(list(self.set.keys()))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63300"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list =[]\n self.seen = defaultdict(int)\n self.count =-1\n \n\n def insert(self, val: int) -> bool:\n if val in self.seen:\n return False\n self.list.append(val)\n self.count +=1\n self.seen[val] = len(self.list)-1\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.seen:\n return False\n else:\n index=self.seen[val]\n \n self.list[-1],self.list[index]= self.list[index],self.list[-1] \n self.seen[self.list[index]] =index \n self.list.pop()\n \n \n del self.seen[val]\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.list)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63400"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set = set()\n\n def insert(self, val: int) -> bool:\n old_len = len(self.set)\n self.set.add(val)\n if old_len==len(self.set):\n return False\n else:\n return True\n def remove(self, val: int) -> bool:\n old_len = len(self.set)\n self.set.discard(val)\n if old_len==len(self.set):\n return False\n else:\n return True\n\n def getRandom(self) -> int:\n return random.choice(list(self.set))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63400"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list =[]\n self.seen = defaultdict(int)\n self.count =-1\n \n\n def insert(self, val: int) -> bool:\n if val in self.seen:\n return False\n self.list.append(val)\n self.count +=1\n self.seen[val] = len(self.list)-1\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.seen:\n return False\n else:\n index=self.seen[val]\n if len(self.list)>=2:\n self.list[-1],self.list[index]= self.list[index],self.list[-1]\n \n self.seen[self.list[index]] =index \n self.list.pop()\n \n del self.seen[val]\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.list)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63500"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.list =[]\n self.seen = defaultdict(int)\n self.count =-1\n \n\n def insert(self, val: int) -> bool:\n if val in self.seen:\n return False\n self.list.append(val)\n self.count +=1\n self.seen[val] = len(self.list)-1\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.seen:\n return False\n else:\n index=self.seen[val]\n \n self.list[-1],self.list[index]= self.list[index],self.list[-1] \n self.seen[self.list[index]] =index \n self.list.pop()\n \n del self.seen[val]\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.list)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63500"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.st = {}\n self.ls = []\n self.size = 0\n\n def insert(self, val: int) -> bool:\n if val not in self.st:\n self.ls.append(val)\n self.st[val] = len(self.ls)-1\n self.size += 1\n return True\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.st:\n ix = self.st[val]\n if ix != len(self.ls)-1:\n self.ls[ix], self.ls[-1] = self.ls[-1], self.ls[ix]\n self.st[self.ls[ix]] = ix\n self.ls.pop()\n del self.st[val]\n self.size -= 1\n return True\n return False\n\n def getRandom(self) -> int:\n ix = random.randint(0, self.size-1)\n return self.ls[ix]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63600"},{"code":"import random\n\n\nclass RandomizedSet:\n\n def __init__(self):\n self.st = set()\n\n def insert(self, val: int) -> bool:\n ret = val not in self.st\n self.st.add(val)\n return ret\n\n def remove(self, val: int) -> bool:\n ret = val in self.st\n if ret:\n self.st.remove(val)\n return ret\n\n def getRandom(self) -> int:\n return random.choice(list(self.st))\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63600"},{"code":"class RandomizedSet:\n def __init__(self):\n self.values = []\n self.indices = {}\n\n def insert(self, val: int) -> bool:\n if val in self.indices:\n return False\n self.values.append(val)\n self.indices[val] = len(self.values)-1\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.indices:\n return False\n index = self.indices.pop(val)\n if index == len(self.values)-1:\n self.values.pop()\n else:\n repl = self.values.pop()\n self.values[index] = repl\n self.indices[repl] = index\n return True\n\n def getRandom(self) -> int:\n i = randint(0, len(self.values)-1)\n return self.values[i]","memory":"63700"},{"code":"from random import choice\nclass RandomizedSet:\n\n def __init__(self):\n self.list = []\n self.hashMap = {}\n \n def insert(self, val: int) -> bool:\n if val in self.hashMap:\n return False\n self.list.append(val)\n self.hashMap[val] = len(self.list) - 1\n return True\n\n def remove(self, val: int) -> bool:\n if not val in self.hashMap:\n return False\n removingIndex = self.hashMap[val]\n self.list[removingIndex] = self.list[-1]\n self.hashMap[self.list[-1]] = removingIndex\n self.list.pop()\n del self.hashMap[val]\n return True \n \n\n def getRandom(self) -> int:\n return choice(self.list)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63700"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.valToIndex = {}\n self.vals = []\n\n def insert(self, val: int) -> bool:\n if val in self.valToIndex:\n return False\n self.valToIndex[val] = len(self.vals)\n self.vals.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.valToIndex:\n return False\n index = self.valToIndex[val]\n self.vals[index], self.vals[-1] = self.vals[-1], self.vals[index]\n self.valToIndex[self.vals[index]] = index\n self.vals.pop()\n del self.valToIndex[val]\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.vals)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63800"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.nums=[]\n self.dict={}\n\n def insert(self, val: int) -> bool:\n for i in self.nums:\n if(val==i):\n return False\n self.nums.append(val)\n self.dict[val]=len(self.nums)-1\n return True\n\n def remove(self, val: int) -> bool:\n for i in self.nums:\n if(val==i):\n self.dict[self.nums[-1]]=self.dict[i]\n self.nums[self.dict[i]]=self.nums[-1]\n self.nums.pop()\n del self.dict[i]\n return True \n return False \n\n def getRandom(self) -> int:\n import random\n # n=random(0,len(self.nums))\n return self.nums[random.randint(0,len(self.nums)-1)]\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63800"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.dict = {}\n self.list = []\n\n def insert(self, val: int) -> bool:\n if val in self.dict:\n return False\n \n self.dict[val] = len(self.list)\n self.list.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.dict:\n lastElem, idx = self.list[-1], self.dict[val]\n self.list[idx], self.dict[lastElem] = lastElem, idx\n self.list.pop()\n del self.dict[val]\n return True\n \n return False\n\n def getRandom(self) -> int:\n return choice(self.list)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63900"},{"code":"import random\nclass RandomizedSet:\n\n def __init__(self):\n \n self.set = set()\n\n def insert(self, val: int) -> bool:\n was_in_set = val not in self.set\n self.set.add(val)\n return was_in_set\n\n def remove(self, val: int) -> bool:\n was_in_set = val in self.set\n if was_in_set:\n self.set.remove(val)\n return was_in_set\n \n def getRandom(self) -> int:\n \n return random.choice(list(self.set))\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"63900"},{"code":"EMPTY = 0\nOCCUPIED = 1\nDELETED = 2\n\nclass RandomizedSet:\n def __init__(self):\n self.n = 1\n self.buckets = [0]\n self.flags = [EMPTY]\n self.count = 0\n\n def __rehash(self, new_n: int):\n new_buckets = [0 for _ in range(new_n)]\n new_flags = [EMPTY for _ in range(new_n)]\n for i in range(self.n):\n if self.flags[i] != OCCUPIED:\n continue\n elem = self.buckets[i]\n new_spot = elem % new_n\n while new_flags[new_spot] == OCCUPIED:\n new_spot += 1\n new_spot %= new_n\n new_buckets[new_spot] = elem\n new_flags[new_spot] = True\n self.n = new_n\n self.buckets = new_buckets\n self.flags = new_flags\n print(self.buckets)\n\n def insert(self, val: int) -> bool:\n i = val % self.n\n insert_to = None\n while self.flags[i] != EMPTY:\n if self.flags[i] == OCCUPIED and self.buckets[i] == val:\n return False\n if self.flags[i] == DELETED and insert_to is None:\n insert_to = i\n i += 1\n i %= self.n\n\n self.buckets[i] = val\n self.flags[i] = OCCUPIED\n self.count += 1\n\n if self.count / self.n > 0.5:\n new_n = self.n * 2\n self.__rehash(new_n)\n\n return True\n\n def remove(self, val: int) -> bool:\n i = val % self.n\n while not (self.flags[i] == OCCUPIED and self.buckets[i] == val):\n if self.flags[i] == DELETED and self.buckets[i] == val:\n return False\n if self.flags[i] == EMPTY:\n return False\n i += 1\n i %= self.n\n\n self.flags[i] = DELETED\n self.count -= 1\n\n if self.count / self.n < 0.5:\n new_n = self.n // 2\n self.__rehash(new_n)\n\n return True\n\n def getRandom(self) -> int:\n while True:\n i = randint(0, self.n-1)\n if self.flags[i] == OCCUPIED:\n return self.buckets[i]\n","memory":"64000"},{"code":"EMPTY = 0\nOCCUPIED = 1\nDELETED = 2\n\nclass RandomizedSet:\n def __init__(self):\n self.n = 1\n self.buckets = [0]\n self.flags = [EMPTY]\n self.count = 0\n\n def __rehash(self, new_n: int):\n new_buckets = [0 for _ in range(new_n)]\n new_flags = [EMPTY for _ in range(new_n)]\n for i in range(self.n):\n if self.flags[i] != OCCUPIED:\n continue\n elem = self.buckets[i]\n new_spot = elem % new_n\n while new_flags[new_spot] == OCCUPIED:\n new_spot += 1\n new_spot %= new_n\n new_buckets[new_spot] = elem\n new_flags[new_spot] = True\n self.n = new_n\n self.buckets = new_buckets\n self.flags = new_flags\n print(self.buckets)\n\n def insert(self, val: int) -> bool:\n i = val % self.n\n insert_to = None\n while self.flags[i] != EMPTY:\n if self.flags[i] == OCCUPIED and self.buckets[i] == val:\n return False\n if self.flags[i] == DELETED and insert_to is None:\n insert_to = i\n i += 1\n i %= self.n\n\n self.buckets[i] = val\n self.flags[i] = OCCUPIED\n self.count += 1\n\n if self.count / self.n >= 0.75:\n new_n = self.n * 2\n self.__rehash(new_n)\n\n return True\n\n def remove(self, val: int) -> bool:\n i = val % self.n\n while not (self.flags[i] == OCCUPIED and self.buckets[i] == val):\n if self.flags[i] == DELETED and self.buckets[i] == val:\n return False\n if self.flags[i] == EMPTY:\n return False\n i += 1\n i %= self.n\n\n self.flags[i] = DELETED\n self.count -= 1\n\n if self.count / self.n <= 0.25:\n new_n = self.n // 2\n self.__rehash(new_n)\n\n return True\n\n def getRandom(self) -> int:\n while True:\n i = randint(0, self.n-1)\n if self.flags[i] == OCCUPIED:\n return self.buckets[i]\n","memory":"64000"},{"code":"import random\n\nclass RandomizedSet:\n\n def __init__(self):\n # List to store the values\n self.values = []\n\n def insert(self, val: int) -> bool:\n # If the value already exists in the set, return False\n if val in self.values:\n return False\n # Otherwise, add it to the list\n self.values.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n # If the value doesn't exist in the set, return False\n if val not in self.values:\n return False\n # Find the value and remove it (O(n) operation)\n self.values.remove(val)\n return True\n\n def getRandom(self) -> int:\n # Return a random element from the list\n return random.choice(self.values)\n","memory":"64099"},{"code":"class RandomizedSet:\n\n def __init__(self):\n self.set=[]\n\n def insert(self, val: int) -> bool:\n if val in self.set:\n return False\n self.set.append(val)\n return True \n\n def remove(self, val: int) -> bool:\n if val in self.set:\n self.set.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n inx=random.randint(0,len(self.set)-1)\n return self.set[inx]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"64099"}],"string":"[\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.setContents = set()\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.setContents:\\n return False\\n self.setContents.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if not val in self.setContents:\\n return False\\n self.setContents.remove(val)\\n return True \\n\\n def getRandom(self) -> int:\\n setContentList = list(self.setContents)\\n return random.choice(setContentList)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"62100\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.items = set()\\n\\n def insert(self, val: int) -> bool:\\n if val in self.items:\\n return False\\n self.items.add(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.items:\\n return False\\n self.items.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.items))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"62200\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.container = list()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.container:\\n self.container.append(val)\\n return True\\n else:\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.container:\\n self.container.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n random.shuffle(self.container)\\n return self.container[0]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"62300\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.objects = set()\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.objects:\\n self.objects.add(val)\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.objects:\\n self.objects.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.objects))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"62400\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.data = []\\n self.map = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.map:\\n return False\\n\\n self.data.append(val)\\n self.map[val] = len(self.data) - 1\\n\\n return True\\n\\n\\n def remove(self, val: int) -> bool:\\n \\n if val not in self.map:\\n return False\\n\\n val_idx = self.map[val]\\n length = len(self.data)\\n last_val = self.data[length-1]\\n\\n self.data[val_idx] = last_val\\n self.map[last_val] = val_idx\\n del self.map[val]\\n del self.data[length-1]\\n\\n return True\\n\\n def getRandom(self) -> int:\\n length = len(self.data)\\n random_idx = random.randrange(length)\\n return self.data[random_idx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"62500\"\n },\n {\n \"code\": \"from random import choice\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.__values = set()\\n\\n def insert(self, val: int) -> bool:\\n p = val in self.__values\\n self.__values.add(val)\\n return not p\\n\\n def remove(self, val: int) -> bool:\\n p = val in self.__values\\n\\n if p:\\n self.__values.remove(val)\\n\\n return p\\n\\n def getRandom(self) -> int:\\n return choice(list(self.__values))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"62600\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.value_to_idx: Dict[int, int] = {}\\n self.values: List[int] = []\\n \\n def insert(self, val: int) -> bool:\\n if val in self.value_to_idx:\\n return False\\n\\n self.values.append(val)\\n self.value_to_idx[val] = len(self.values) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.value_to_idx:\\n return False\\n \\n idx = self.value_to_idx[val]\\n last_value = self.values[-1]\\n # swep\\n self.values[idx] = self.values[-1]\\n self.values.pop()\\n self.value_to_idx.pop(val, None)\\n if last_value != val:\\n self.value_to_idx[last_value] = idx\\n return True\\n \\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63000\"\n },\n {\n \"code\": \"from random import choice\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.dict = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the set. Returns true if the set did not already contain the specified element.\\n \\\"\\\"\\\"\\n if self.dict.get(val):\\n return False\\n self.dict[val] = True\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the set. Returns true if the set contained the specified element.\\n \\\"\\\"\\\"\\n if self.dict.get(val):\\n self.dict.pop(val)\\n return True\\n \\n return False\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the set.\\n \\\"\\\"\\\"\\n return choice(list(self.dict.keys()))\",\n \"memory\": \"63100\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.table = {}\\n\\n def insert(self, val: int) -> bool:\\n try:\\n self.table[val] += 1\\n return False\\n except KeyError:\\n self.table[val] = 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n try:\\n self.table[val] += 1\\n self.table.pop(val)\\n return True\\n except KeyError:\\n return False\\n def getRandom(self) -> int:\\n randInt = random.randint(0, len(self.table.keys())-1)\\n randKey = list(self.table.keys())[randInt]\\n return randKey\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63200\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.dict = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n else:\\n self.dict[val] = val\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.dict:\\n del(self.dict[val])\\n return True\\n else:\\n return False\\n \\n def getRandom(self) -> int:\\n return random.choice(list(self.dict.keys()))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63200\"\n },\n {\n \"code\": \"from random import Random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.rand = Random()\\n self.set = {}\\n print(self.rand.randrange(0,100))\\n \\n\\n def insert(self, val: int) -> bool:\\n \\n if self.set.get(val):\\n return False\\n else:\\n self.set[val] = 1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if self.set.get(val):\\n del self.set[val]\\n return True\\n else:\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return self.rand.choice(list(self.set.keys()))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63300\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list =[]\\n self.seen = defaultdict(int)\\n self.count =-1\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.seen:\\n return False\\n self.list.append(val)\\n self.count +=1\\n self.seen[val] = len(self.list)-1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.seen:\\n return False\\n else:\\n index=self.seen[val]\\n \\n self.list[-1],self.list[index]= self.list[index],self.list[-1] \\n self.seen[self.list[index]] =index \\n self.list.pop()\\n \\n \\n del self.seen[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63400\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set = set()\\n\\n def insert(self, val: int) -> bool:\\n old_len = len(self.set)\\n self.set.add(val)\\n if old_len==len(self.set):\\n return False\\n else:\\n return True\\n def remove(self, val: int) -> bool:\\n old_len = len(self.set)\\n self.set.discard(val)\\n if old_len==len(self.set):\\n return False\\n else:\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.set))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63400\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list =[]\\n self.seen = defaultdict(int)\\n self.count =-1\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.seen:\\n return False\\n self.list.append(val)\\n self.count +=1\\n self.seen[val] = len(self.list)-1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.seen:\\n return False\\n else:\\n index=self.seen[val]\\n if len(self.list)>=2:\\n self.list[-1],self.list[index]= self.list[index],self.list[-1]\\n \\n self.seen[self.list[index]] =index \\n self.list.pop()\\n \\n del self.seen[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63500\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.list =[]\\n self.seen = defaultdict(int)\\n self.count =-1\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.seen:\\n return False\\n self.list.append(val)\\n self.count +=1\\n self.seen[val] = len(self.list)-1\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.seen:\\n return False\\n else:\\n index=self.seen[val]\\n \\n self.list[-1],self.list[index]= self.list[index],self.list[-1] \\n self.seen[self.list[index]] =index \\n self.list.pop()\\n \\n del self.seen[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63500\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.st = {}\\n self.ls = []\\n self.size = 0\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.st:\\n self.ls.append(val)\\n self.st[val] = len(self.ls)-1\\n self.size += 1\\n return True\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.st:\\n ix = self.st[val]\\n if ix != len(self.ls)-1:\\n self.ls[ix], self.ls[-1] = self.ls[-1], self.ls[ix]\\n self.st[self.ls[ix]] = ix\\n self.ls.pop()\\n del self.st[val]\\n self.size -= 1\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n ix = random.randint(0, self.size-1)\\n return self.ls[ix]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63600\"\n },\n {\n \"code\": \"import random\\n\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.st = set()\\n\\n def insert(self, val: int) -> bool:\\n ret = val not in self.st\\n self.st.add(val)\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n ret = val in self.st\\n if ret:\\n self.st.remove(val)\\n return ret\\n\\n def getRandom(self) -> int:\\n return random.choice(list(self.st))\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63600\"\n },\n {\n \"code\": \"class RandomizedSet:\\n def __init__(self):\\n self.values = []\\n self.indices = {}\\n\\n def insert(self, val: int) -> bool:\\n if val in self.indices:\\n return False\\n self.values.append(val)\\n self.indices[val] = len(self.values)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.indices:\\n return False\\n index = self.indices.pop(val)\\n if index == len(self.values)-1:\\n self.values.pop()\\n else:\\n repl = self.values.pop()\\n self.values[index] = repl\\n self.indices[repl] = index\\n return True\\n\\n def getRandom(self) -> int:\\n i = randint(0, len(self.values)-1)\\n return self.values[i]\",\n \"memory\": \"63700\"\n },\n {\n \"code\": \"from random import choice\\nclass RandomizedSet:\\n\\n def __init__(self):\\n self.list = []\\n self.hashMap = {}\\n \\n def insert(self, val: int) -> bool:\\n if val in self.hashMap:\\n return False\\n self.list.append(val)\\n self.hashMap[val] = len(self.list) - 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if not val in self.hashMap:\\n return False\\n removingIndex = self.hashMap[val]\\n self.list[removingIndex] = self.list[-1]\\n self.hashMap[self.list[-1]] = removingIndex\\n self.list.pop()\\n del self.hashMap[val]\\n return True \\n \\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63700\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.valToIndex = {}\\n self.vals = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.valToIndex:\\n return False\\n self.valToIndex[val] = len(self.vals)\\n self.vals.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.valToIndex:\\n return False\\n index = self.valToIndex[val]\\n self.vals[index], self.vals[-1] = self.vals[-1], self.vals[index]\\n self.valToIndex[self.vals[index]] = index\\n self.vals.pop()\\n del self.valToIndex[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.vals)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63800\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.nums=[]\\n self.dict={}\\n\\n def insert(self, val: int) -> bool:\\n for i in self.nums:\\n if(val==i):\\n return False\\n self.nums.append(val)\\n self.dict[val]=len(self.nums)-1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n for i in self.nums:\\n if(val==i):\\n self.dict[self.nums[-1]]=self.dict[i]\\n self.nums[self.dict[i]]=self.nums[-1]\\n self.nums.pop()\\n del self.dict[i]\\n return True \\n return False \\n\\n def getRandom(self) -> int:\\n import random\\n # n=random(0,len(self.nums))\\n return self.nums[random.randint(0,len(self.nums)-1)]\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63800\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.dict = {}\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.dict:\\n return False\\n \\n self.dict[val] = len(self.list)\\n self.list.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.dict:\\n lastElem, idx = self.list[-1], self.dict[val]\\n self.list[idx], self.dict[lastElem] = lastElem, idx\\n self.list.pop()\\n del self.dict[val]\\n return True\\n \\n return False\\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63900\"\n },\n {\n \"code\": \"import random\\nclass RandomizedSet:\\n\\n def __init__(self):\\n \\n self.set = set()\\n\\n def insert(self, val: int) -> bool:\\n was_in_set = val not in self.set\\n self.set.add(val)\\n return was_in_set\\n\\n def remove(self, val: int) -> bool:\\n was_in_set = val in self.set\\n if was_in_set:\\n self.set.remove(val)\\n return was_in_set\\n \\n def getRandom(self) -> int:\\n \\n return random.choice(list(self.set))\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"63900\"\n },\n {\n \"code\": \"EMPTY = 0\\nOCCUPIED = 1\\nDELETED = 2\\n\\nclass RandomizedSet:\\n def __init__(self):\\n self.n = 1\\n self.buckets = [0]\\n self.flags = [EMPTY]\\n self.count = 0\\n\\n def __rehash(self, new_n: int):\\n new_buckets = [0 for _ in range(new_n)]\\n new_flags = [EMPTY for _ in range(new_n)]\\n for i in range(self.n):\\n if self.flags[i] != OCCUPIED:\\n continue\\n elem = self.buckets[i]\\n new_spot = elem % new_n\\n while new_flags[new_spot] == OCCUPIED:\\n new_spot += 1\\n new_spot %= new_n\\n new_buckets[new_spot] = elem\\n new_flags[new_spot] = True\\n self.n = new_n\\n self.buckets = new_buckets\\n self.flags = new_flags\\n print(self.buckets)\\n\\n def insert(self, val: int) -> bool:\\n i = val % self.n\\n insert_to = None\\n while self.flags[i] != EMPTY:\\n if self.flags[i] == OCCUPIED and self.buckets[i] == val:\\n return False\\n if self.flags[i] == DELETED and insert_to is None:\\n insert_to = i\\n i += 1\\n i %= self.n\\n\\n self.buckets[i] = val\\n self.flags[i] = OCCUPIED\\n self.count += 1\\n\\n if self.count / self.n > 0.5:\\n new_n = self.n * 2\\n self.__rehash(new_n)\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n i = val % self.n\\n while not (self.flags[i] == OCCUPIED and self.buckets[i] == val):\\n if self.flags[i] == DELETED and self.buckets[i] == val:\\n return False\\n if self.flags[i] == EMPTY:\\n return False\\n i += 1\\n i %= self.n\\n\\n self.flags[i] = DELETED\\n self.count -= 1\\n\\n if self.count / self.n < 0.5:\\n new_n = self.n // 2\\n self.__rehash(new_n)\\n\\n return True\\n\\n def getRandom(self) -> int:\\n while True:\\n i = randint(0, self.n-1)\\n if self.flags[i] == OCCUPIED:\\n return self.buckets[i]\\n\",\n \"memory\": \"64000\"\n },\n {\n \"code\": \"EMPTY = 0\\nOCCUPIED = 1\\nDELETED = 2\\n\\nclass RandomizedSet:\\n def __init__(self):\\n self.n = 1\\n self.buckets = [0]\\n self.flags = [EMPTY]\\n self.count = 0\\n\\n def __rehash(self, new_n: int):\\n new_buckets = [0 for _ in range(new_n)]\\n new_flags = [EMPTY for _ in range(new_n)]\\n for i in range(self.n):\\n if self.flags[i] != OCCUPIED:\\n continue\\n elem = self.buckets[i]\\n new_spot = elem % new_n\\n while new_flags[new_spot] == OCCUPIED:\\n new_spot += 1\\n new_spot %= new_n\\n new_buckets[new_spot] = elem\\n new_flags[new_spot] = True\\n self.n = new_n\\n self.buckets = new_buckets\\n self.flags = new_flags\\n print(self.buckets)\\n\\n def insert(self, val: int) -> bool:\\n i = val % self.n\\n insert_to = None\\n while self.flags[i] != EMPTY:\\n if self.flags[i] == OCCUPIED and self.buckets[i] == val:\\n return False\\n if self.flags[i] == DELETED and insert_to is None:\\n insert_to = i\\n i += 1\\n i %= self.n\\n\\n self.buckets[i] = val\\n self.flags[i] = OCCUPIED\\n self.count += 1\\n\\n if self.count / self.n >= 0.75:\\n new_n = self.n * 2\\n self.__rehash(new_n)\\n\\n return True\\n\\n def remove(self, val: int) -> bool:\\n i = val % self.n\\n while not (self.flags[i] == OCCUPIED and self.buckets[i] == val):\\n if self.flags[i] == DELETED and self.buckets[i] == val:\\n return False\\n if self.flags[i] == EMPTY:\\n return False\\n i += 1\\n i %= self.n\\n\\n self.flags[i] = DELETED\\n self.count -= 1\\n\\n if self.count / self.n <= 0.25:\\n new_n = self.n // 2\\n self.__rehash(new_n)\\n\\n return True\\n\\n def getRandom(self) -> int:\\n while True:\\n i = randint(0, self.n-1)\\n if self.flags[i] == OCCUPIED:\\n return self.buckets[i]\\n\",\n \"memory\": \"64000\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedSet:\\n\\n def __init__(self):\\n # List to store the values\\n self.values = []\\n\\n def insert(self, val: int) -> bool:\\n # If the value already exists in the set, return False\\n if val in self.values:\\n return False\\n # Otherwise, add it to the list\\n self.values.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n # If the value doesn't exist in the set, return False\\n if val not in self.values:\\n return False\\n # Find the value and remove it (O(n) operation)\\n self.values.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n # Return a random element from the list\\n return random.choice(self.values)\\n\",\n \"memory\": \"64099\"\n },\n {\n \"code\": \"class RandomizedSet:\\n\\n def __init__(self):\\n self.set=[]\\n\\n def insert(self, val: int) -> bool:\\n if val in self.set:\\n return False\\n self.set.append(val)\\n return True \\n\\n def remove(self, val: int) -> bool:\\n if val in self.set:\\n self.set.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n inx=random.randint(0,len(self.set)-1)\\n return self.set[inx]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"64099\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":27,"string":"27"}}},{"rowIdx":284,"cells":{"question_id":{"kind":"number","value":381,"string":"381"},"name":{"kind":"string","value":"insert-delete-getrandom-o1-duplicates-allowed"},"content":{"kind":"string","value":"<p><code>RandomizedCollection</code> is a data structure that contains a collection of numbers, possibly duplicates (i.e., a multiset). It should support inserting and removing specific elements and also reporting a random element.</p>\n\n<p>Implement the <code>RandomizedCollection</code> class:</p>\n\n<ul>\n\t<li><code>RandomizedCollection()</code> Initializes the empty <code>RandomizedCollection</code> object.</li>\n\t<li><code>bool insert(int val)</code> Inserts an item <code>val</code> into the multiset, even if the item is already present. Returns <code>true</code> if the item is not present, <code>false</code> otherwise.</li>\n\t<li><code>bool remove(int val)</code> Removes an item <code>val</code> from the multiset if present. Returns <code>true</code> if the item is present, <code>false</code> otherwise. Note that if <code>val</code> has multiple occurrences in the multiset, we only remove one of them.</li>\n\t<li><code>int getRandom()</code> Returns a random element from the current multiset of elements. The probability of each element being returned is <strong>linearly related</strong> to the number of the same values the multiset contains.</li>\n</ul>\n\n<p>You must implement the functions of the class such that each function works on <strong>average</strong> <code>O(1)</code> time complexity.</p>\n\n<p><strong>Note:</strong> The test cases are generated such that <code>getRandom</code> will only be called if there is <strong>at least one</strong> item in the <code>RandomizedCollection</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input</strong>\n["RandomizedCollection", "insert", "insert", "insert", "getRandom", "remove", "getRandom"]\n[[], [1], [1], [2], [], [1], []]\n<strong>Output</strong>\n[null, true, false, true, 2, true, 1]\n\n<strong>Explanation</strong>\nRandomizedCollection randomizedCollection = new RandomizedCollection();\nrandomizedCollection.insert(1); // return true since the collection does not contain 1.\n // Inserts 1 into the collection.\nrandomizedCollection.insert(1); // return false since the collection contains 1.\n // Inserts another 1 into the collection. Collection now contains [1,1].\nrandomizedCollection.insert(2); // return true since the collection does not contain 2.\n // Inserts 2 into the collection. Collection now contains [1,1,2].\nrandomizedCollection.getRandom(); // getRandom should:\n // - return 1 with probability 2/3, or\n // - return 2 with probability 1/3.\nrandomizedCollection.remove(1); // return true since the collection contains 1.\n // Removes 1 from the collection. Collection now contains [1,2].\nrandomizedCollection.getRandom(); // getRandom should return 1 or 2, both equally likely.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>-2<sup>31</sup> <= val <= 2<sup>31</sup> - 1</code></li>\n\t<li>At most <code>2 * 10<sup>5</sup></code> calls <strong>in total</strong> will be made to <code>insert</code>, <code>remove</code>, and <code>getRandom</code>.</li>\n\t<li>There will be <strong>at least one</strong> element in the data structure when <code>getRandom</code> is called.</li>\n</ul>\n"},"acRate":{"kind":"number","value":35.615737152807675,"string":"35.615737"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","hash-table","math","design","randomized"],"string":"[\n \"array\",\n \"hash-table\",\n \"math\",\n \"design\",\n \"randomized\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"229\", 0.232], [\"236\", 0.5800000000000001], [\"243\", 0.9279999999999999], [\"250\", 0.6960000000000001], [\"257\", 3.9443], [\"263\", 9.0486], [\"270\", 12.993], [\"277\", 14.5012], [\"284\", 9.5127], [\"291\", 7.076400000000001], [\"298\", 6.9607], [\"305\", 6.148499999999999], [\"312\", 4.292400000000001], [\"319\", 3.4803], [\"326\", 3.5961000000000003], [\"332\", 1.9719999999999998], [\"339\", 2.204], [\"346\", 0.696], [\"353\", 0.116], [\"360\", 0.464], [\"367\", 0.232], [\"374\", 0.116], [\"381\", 0.116], [\"388\", 0.232], [\"395\", 0.116], [\"401\", 0.116], [\"408\", 0.116], [\"415\", 0.116], [\"422\", 0.116], [\"429\", 0.116], [\"436\", 0.116], [\"443\", 0.116], [\"450\", 0.116], [\"457\", 0.116], [\"464\", 0.116], [\"470\", 0.232], [\"477\", 0.116], [\"484\", 0.116], [\"491\", 0.232], [\"498\", 0.116], [\"505\", 0.116], [\"512\", 0.116], [\"519\", 0.232], [\"526\", 0.232], [\"533\", 0.116], [\"539\", 0.116], [\"546\", 0.116], [\"553\", 0.116], [\"560\", 0.116], [\"567\", 0.116], [\"574\", 0.116], [\"581\", 0.116], [\"588\", 0.116], [\"595\", 0.116], [\"602\", 0.116], [\"608\", 0.116], [\"615\", 0.116], [\"622\", 0.116], [\"629\", 0.116], [\"636\", 0.116], [\"643\", 0.116]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"66500\", 0.116], [\"66600\", 0.58], [\"66700\", 0.8121], [\"66800\", 3.2483], [\"66900\", 2.7842], [\"67000\", 0.9281], [\"67100\", 1.2761], [\"67200\", 1.2761], [\"67300\", 0.8121], [\"67400\", 0.58], [\"67600\", 1.6241], [\"67700\", 1.7401], [\"67800\", 1.5081], [\"67900\", 1.6241], [\"68000\", 1.5081], [\"68100\", 3.5963], [\"68200\", 8.5847], [\"68300\", 10.7889], [\"68400\", 19.9536], [\"68500\", 12.065], [\"68600\", 5.8005], [\"68700\", 3.2483], [\"68800\", 3.1323], [\"68900\", 3.4803], [\"69000\", 0.58], [\"69100\", 1.1601], [\"69200\", 1.5081]]}"},"rt_list":{"kind":"list like","value":[{"code":"class RandomizedCollection:\n def __init__(self):\n self.dict = collections.defaultdict(set)\n self.lst = []\n \n def insert(self, val: int) -> bool:\n self.dict[val].add(len(self.lst))\n self.lst.append(val)\n return len(self.dict[val]) == 1\n \n def remove(self, val: int) -> bool:\n if self.dict[val]:\n ind, tail = self.dict[val].pop(), self.lst[-1]\n self.lst[ind] = tail\n if self.dict[tail]:\n self.dict[tail].add(ind)\n self.dict[tail].discard(len(self.lst)-1)\n self.lst.pop()\n return True\n return False\n \n def getRandom(self) -> int:\n return self.lst[int(random.random()*len(self.lst))]\n\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"229"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.nums = []\n self.d = defaultdict(set)\n \n\n def insert(self, val: int) -> bool:\n if val in self.d and len(self.d[val]) > 0:\n res = False\n else:\n res = True\n self.nums.append(val)\n # store element positions\n self.d[val].add(len(self.nums)-1)\n return res\n \n\n def remove(self, val: int) -> bool:\n if val in self.d and len(self.d[val]) > 0:\n pos = self.d[val].pop() # element to remove position \n lpos = len(self.nums)-1 # last position\n lval = self.nums[lpos] # last val\n \n self.d[lval].add(pos) \n self.d[lval].remove(lpos)\n \n # swap with last\n self.nums[pos] = lval\n \n # remove element\n self.nums.pop()\n return True\n return False\n \n\n def getRandom(self) -> int:\n size = len(self.nums)\n i = int(random.random()*size)\n return self.nums[i]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"229"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.items = []\n self.indexSet = defaultdict(set)\n self.size = 0\n\n def insert(self, val: int) -> bool:\n self.items.append(val)\n res = len(self.indexSet[val]) == 0\n self.indexSet[val].add(self.size)\n self.size += 1\n return res\n\n def remove(self, val: int) -> bool:\n if not self.indexSet[val]:\n return False\n index = self.indexSet[val].pop()\n top = self.items[-1]\n self.items[index] = top\n self.indexSet[top].add(index)\n self.indexSet[top].discard(self.size - 1)\n self.items.pop()\n self.size -= 1\n return True\n\n def getRandom(self) -> int:\n index = int(random.random() * self.size)\n return self.items[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"236"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.n = 0\n self.num_map = {}\n self.nums = []\n\n def insert(self, val: int) -> bool:\n not_present = False\n if val not in self.num_map:\n self.num_map[val] = set()\n not_present = True\n\n self.nums.append(val) # add value to list\n self.num_map[val].add(self.n)\n self.n += 1\n\n return not_present\n \n\n def remove(self, val: int) -> bool:\n if val not in self.num_map:\n return False\n\n index_remove = next(iter(self.num_map[val]))\n self.num_map[val].remove(index_remove)\n self.nums[index_remove] = self.nums[-1]\n end_val = self.nums[-1]\n if self.n-1 in self.num_map[end_val]:\n self.num_map[end_val].remove(self.n-1)\n self.num_map[end_val].add(index_remove)\n self.nums.pop(-1)\n self.n -= 1\n\n if len(self.num_map[val]) == 0:\n del self.num_map[val]\n\n return True\n \n\n def getRandom(self) -> int:\n idx = int(random.random() * self.n)\n return self.nums[idx]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"236"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.n = 0\n self.num_map = {}\n self.nums = []\n\n def insert(self, val: int) -> bool:\n not_present = False\n if val not in self.num_map:\n self.num_map[val] = set()\n not_present = True\n\n self.nums.append(val) # add value to list\n self.num_map[val].add(self.n)\n self.n += 1\n\n return not_present\n \n\n def remove(self, val: int) -> bool:\n if val not in self.num_map:\n return False\n\n index_remove = next(iter(self.num_map[val]))\n self.num_map[val].remove(index_remove)\n self.nums[index_remove] = self.nums[-1]\n end_val = self.nums[-1]\n if self.n-1 in self.num_map[end_val]:\n self.num_map[end_val].remove(self.n-1)\n self.num_map[end_val].add(index_remove)\n self.nums.pop(-1)\n self.n -= 1\n\n if len(self.num_map[val]) == 0:\n del self.num_map[val]\n\n return True\n \n\n def getRandom(self) -> int:\n idx = int(random.random() * self.n)\n return self.nums[idx]","runtime":"243"},{"code":"\nfrom random import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.arr = []\n self.val2pos = {}\n\n def insert(self, val: int) -> bool:\n if not val in self.val2pos: self.val2pos[val] = []\n self.val2pos[val].append(len(self.arr))\n self.arr.append([val, len(self.val2pos[val])-1])\n return len(self.val2pos[val])==1\n\n def remove(self, val: int) -> bool:\n if not (val in self.val2pos and len(self.val2pos[val])>0): return False\n idx = self.val2pos[val].pop(-1)\n last = self.arr.pop(-1)\n if idx==len(self.arr): return True\n self.val2pos[last[0]][last[1]] = idx\n self.arr[idx] = last \n\n return True\n\n def getRandom(self) -> int:\n return self.arr[int(random()*len(self.arr))][0]\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"243"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n # clarify\n # array\n # dict (val -> idxs)\n self.arr = []\n self.dict = {}\n\n def insert(self, val: int) -> bool:\n present = val in self.dict and len(self.dict[val]) > 0\n if val not in self.dict:\n self.dict[val] = set()\n idx = len(self.arr)\n self.dict[val].add(idx)\n self.arr.append(val)\n return not present\n\n def remove(self, val: int) -> bool:\n if val not in self.dict or len(self.dict[val])==0: return False\n # Find any idx of val\n # Overwrite it with last element\n # Update as necessary (dict[last_element] needs to point to new idx)\n # Edge case: the two elements are the same (?)\n # Pop last element from array\n idx = self.dict[val].pop()\n if idx == len(self.arr)-1: \n # Last element IS the element we remove. No update needed\n self.arr.pop()\n return True\n # Update last element dict\n last_val = self.arr.pop()\n last_idx = len(self.arr)\n self.dict[last_val].remove(last_idx)\n # Put it in idx (instead of the val we just removed)\n self.arr[idx] = last_val\n self.dict[last_val].add(idx)\n return True\n def getRandom(self) -> int:\n return self.arr[int(random.random() * len(self.arr))]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"250"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.list = []\n self.indices = defaultdict(set)\n\n def insert(self, val: int) -> bool:\n self.list.append(val)\n self.indices[val].add(len(self.list) - 1)\n return len(self.indices[val]) == 1\n\n def remove(self, val: int) -> bool:\n if val not in self.indices or len(self.indices[val]) == 0:\n return False\n\n curIdx = self.indices[val].pop()\n lastIdx = len(self.list) - 1\n self.indices[self.list[lastIdx]].add(curIdx)\n self.indices[self.list[lastIdx]].remove(lastIdx) \n self.list[lastIdx], self.list[curIdx] = self.list[curIdx], self.list[lastIdx]\n self.list.pop()\n return True\n\n def getRandom(self) -> int:\n return choice(self.list)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"250"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.nums = []\n self.d = defaultdict(set)\n \n\n def insert(self, val: int) -> bool:\n if val in self.d and len(self.d[val]) > 0:\n res = False\n else:\n res = True\n self.nums.append(val)\n # store element positions\n self.d[val].add(len(self.nums)-1)\n return res\n \n\n def remove(self, val: int) -> bool:\n if val in self.d and len(self.d[val]) > 0:\n pos = self.d[val].pop() # element to remove position \n lpos = len(self.nums)-1 # last position\n lval = self.nums[lpos] # last val\n \n self.d[lval].add(pos) \n self.d[lval].remove(lpos)\n \n # swap with last\n self.nums[pos] = lval \n \n # remove element\n self.nums.pop()\n return True\n return False\n \n\n def getRandom(self) -> int:\n size = len(self.nums)\n i = int(random.random()*size)\n return self.nums[i]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"257"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.hm = defaultdict(set)\n self.list = []\n\n def insert(self, val: int) -> bool:\n self.list.append(val)\n self.hm[val].add(len(self.list) - 1)\n\n if len(self.hm[val]) == 1:\n return True\n \n return False\n\n def remove(self, val: int) -> bool:\n if len(self.hm[val]) == 0:\n return False\n \n remove, last = self.hm[val].pop(), self.list[-1]\n self.list[remove] = last\n\n self.hm[last].add(remove)\n self.hm[last].remove(len(self.list) - 1)\n\n self.list.pop()\n\n return True\n\n def getRandom(self) -> int:\n return choice(self.list)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"257"},{"code":"import random\nfrom collections import defaultdict\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.indices = defaultdict(set)\n self.arr = []\n\n def insert(self, val: int) -> bool:\n res = True\n if val in self.indices:\n res = False\n self.indices[val].add(len(self.arr)) \n self.arr.append(val)\n return res\n\n def remove(self, val: int) -> bool:\n # print(\"Start: \", self.indices, self.arr)\n if val not in self.indices:\n return False\n \n last_val = self.arr[-1]\n idx_last = len(self.arr) - 1\n\n if last_val == val:\n self.indices[last_val].remove(idx_last)\n self.arr.pop()\n if not self.indices[last_val]:\n del self.indices[last_val]\n return True\n\n idx_val = self.indices[val].pop()\n \n # swap value in arr\n self.arr[idx_val], self.arr[idx_last] = self.arr[idx_last], self.arr[idx_val]\n self.indices[last_val].remove(idx_last)\n self.indices[last_val].add(idx_val)\n \n if not self.indices[val]:\n del self.indices[val]\n\n self.arr.pop()\n\n # print(\"End: \", self.indices, self.arr)\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.arr)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"263"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.storage = []\n self.record = dict()\n\n def insert(self, val: int) -> bool:\n res = False\n self.storage.append(val)\n if val not in self.record:\n res = True\n self.record[val] = set()\n self.record[val].add(len(self.storage) - 1)\n return res\n\n def remove(self, val: int) -> bool:\n res = False\n if val in self.record:\n res = True\n idx = self.record[val].pop()\n if len(self.record[val]) == 0:\n del self.record[val]\n if idx == len(self.storage) - 1:\n self.storage.pop()\n else:\n swap = len(self.storage) - 1\n swap_val = self.storage[-1]\n self.storage[idx] = self.storage[-1]\n self.storage.pop()\n self.record[swap_val].remove(swap)\n self.record[swap_val].add(idx)\n return res\n\n def getRandom(self) -> int:\n return random.choice(self.storage)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"263"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.lst=[]\n self.dict=defaultdict(set)\n \n\n def insert(self, val: int) -> bool:\n self.lst.append(val)\n self.dict[val].add(len(self.lst)-1)\n return len(self.dict[val])==1\n\n def remove(self, val: int) -> bool:\n if not self.dict[val]:\n return False\n\n idx=self.dict[val].pop()\n self.lst[idx]=None\n return True\n \n\n def getRandom(self) -> int:\n x=None\n while x is None:\n x=random.choice(self.lst)\n return x\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"270"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.lst = []\n self.dict = defaultdict(set)\n \n\n def insert(self, val: int) -> bool:\n self.dict[val].add(len(self.lst))\n self.lst.append(val)\n return len(self.dict[val]) == 1\n \n\n def remove(self, val: int) -> bool:\n if not self.dict[val]:\n return False\n\n _temp_idx = self.dict[val].pop() \n _replace_val = self.lst[-1]\n self.lst[_temp_idx] = _replace_val\n self.dict[_replace_val].add(_temp_idx)\n self.dict[_replace_val].remove(len(self.lst)-1)\n self.lst.pop()\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.lst)\n\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"270"},{"code":"import random\nfrom collections import defaultdict\n\nclass RandomizedCollection:\n def __init__(self):\n self.nums = [] # List to store the elements\n self.idx_map = defaultdict(set) # HashMap to store indices of each value\n\n def insert(self, val: int) -> bool:\n # Add the value to the nums list\n self.nums.append(val)\n # Record the index where this value is stored in the list\n self.idx_map[val].add(len(self.nums) - 1)\n # Return True if it's the first occurrence of the value\n return len(self.idx_map[val]) == 1\n\n def remove(self, val: int) -> bool:\n if not self.idx_map[val]:\n return False\n \n # Get an index of the value to remove\n remove_idx = self.idx_map[val].pop()\n last_val = self.nums[-1]\n \n # Move the last element to the position of the element to be removed\n self.nums[remove_idx] = last_val\n # Update the hashmap for the last element\n self.idx_map[last_val].add(remove_idx)\n self.idx_map[last_val].discard(len(self.nums) - 1)\n \n # Remove the last element from the list\n self.nums.pop()\n \n return True\n\n def getRandom(self) -> int:\n # Get a random element from the list\n return random.choice(self.nums)\n","runtime":"277"},{"code":"class RandomizedCollection:\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.vals = [] # list to store values\n self.indices = {} # hash map to store indices of each value\n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n \"\"\"\n self.vals.append(val) # add value to end of list\n if val in self.indices: # if value already exists in hash map\n self.indices[val].add(len(self.vals)-1) # add index to set of indices\n return False\n else:\n self.indices[val] = {len(self.vals)-1} # create new set with index\n return True\n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n \"\"\"\n if val not in self.indices: # if value doesn't exist in hash map\n return False\n \n index = self.indices[val].pop() # get an index of the value and remove it from set\n last_val = self.vals[-1] # get the last value in list\n if index != len(self.vals)-1: # if index is not the last index\n self.vals[index] = last_val # replace value at index with last value\n self.indices[last_val].discard(len(self.vals)-1) # remove last index from set\n self.indices[last_val].add(index) # add index to set of last value\n \n self.vals.pop() # remove last value from list\n if not self.indices[val]: # if set of indices is empty\n del self.indices[val] # remove key from hash map\n \n return True\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the collection.\n \"\"\"\n return random.choice(self.vals) # return a random value from the list","runtime":"277"},{"code":"from collections import defaultdict\nfrom random import choice\n\nclass RandomizedCollection:\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.lst = []\n self.idx = defaultdict(set)\n\n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n \"\"\"\n self.idx[val].add(len(self.lst))\n self.lst.append(val)\n return len(self.idx[val]) == 1\n\n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n \"\"\"\n if not self.idx[val]: return False\n remove, last = self.idx[val].pop(), self.lst[-1]\n self.lst[remove] = last\n self.idx[last].add(remove)\n self.idx[last].discard(len(self.lst) - 1)\n\n self.lst.pop()\n return True\n\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the collection.\n \"\"\"\n return choice(self.lst)\n","runtime":"284"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.l =[]\n self.h = defaultdict(list)\n \n\n def insert(self, val: int) -> bool:\n if val not in self.h:\n self.l.append(val)\n self.h[val].append(len(self.l)-1)\n return True\n else:\n self.l.append(val)\n self.h[val].append(len(self.l)-1)\n return False\n\n \n\n def remove(self, val: int) -> bool:\n if val not in self.h:\n return False\n else:\n # finding the high index in where val is in l\n last_ind_val = self.h[val].pop()\n #last element in list\n if last_ind_val == len(self.l)-1:\n self.l.pop()\n else:\n last_element = self.l[-1]\n self.h[last_element].remove(len(self.l)-1)\n self.h[last_element].append(last_ind_val)\n self.l[last_ind_val]= last_element\n self.l[-1] = val\n self.l.pop()\n if len(self.h[val]) == 0:\n del self.h[val]\n return True\n\n\n\n \n\n def getRandom(self) -> int:\n return random.choice(self.l)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"284"},{"code":"import random\nfrom collections import defaultdict\nclass DLLNode:\n def __init__(self, val: int):\n self.val = val\n self.next = None\n self.prev = None\n\nclass RandomizedCollection:\n def __init__(self):\n # linked list\n self.head = DLLNode(None)\n self.tail = DLLNode(None)\n self.head.next = self.tail\n self.tail.prev = self.head\n self.nodes = defaultdict(list)\n\n # for getrandom\n self.randlist = []\n self.randlistpos = defaultdict(set)\n \n def appendNode(self, node: DLLNode) -> None:\n node.next = self.tail\n node.prev = self.tail.prev\n self.tail.prev.next = node\n self.tail.prev = node\n \n def removeNode(self, node: DLLNode) -> None:\n node.prev.next = node.next\n node.next.prev = node.prev\n\n def insert(self, val: int) -> bool:\n toReturn = True\n if val in self.nodes: toReturn = False\n\n # insert in linked list\n newNode = DLLNode(val)\n self.nodes[val].append(newNode)\n self.appendNode(newNode)\n\n # insert in randlist\n self.randlist.append(val)\n self.randlistpos[val].add(len(self.randlist) - 1)\n return toReturn\n\n def remove(self, val: int) -> bool:\n toReturn = True\n if val not in self.nodes: return False\n \n # remove from linked list\n node = self.nodes[val].pop()\n self.removeNode(node)\n if len(self.nodes[val]) == 0: self.nodes.pop(val)\n\n # remove from randlist\n pos = self.randlistpos[val].pop()\n lastval = self.randlist[-1]\n self.randlist[pos], self.randlist[-1] = self.randlist[-1], self.randlist[pos]\n self.randlistpos[lastval].discard(len(self.randlist) - 1) # this will silently fail if one element\n self.randlistpos[lastval].add(pos)\n\n self.randlist.pop()\n if len(self.randlistpos[val]) == 0: self.randlistpos.pop(val)\n return toReturn\n\n def getRandom(self) -> int:\n if not self.randlist:\n raise ValueError(\"Set is empty\")\n return random.choice(self.randlist)\n \n def getOldest(self) -> int:\n if self.head.next == self.tail:\n raise ValueError(\"Set is empty\")\n return self.head.next.val\n \n def getNewest(self) -> int:\n if self.tail.prev == self.head:\n raise ValueError(\"Set is empty\")\n return self.tail.prev.val","runtime":"291"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.numbers = []\n self.indexes = {}\n \n\n def insert(self, val: int) -> bool:\n in_list = not (val in self.indexes)\n self.numbers.append(val)\n self.indexes.setdefault(val,set())\n self.indexes[val].add(len(self.numbers)-1)\n return in_list\n\n def remove(self, val: int) -> bool:\n if val in self.indexes:\n index = self.indexes[val].pop() # I get an index for the item to remove\n if len(self.indexes[val]) == 0:\n del self.indexes[val]\n\n last_value = self.numbers[-1]\n if index != len(self.numbers) - 1: #In case we try to remove the last item, no swap required! \n self.indexes[last_value].remove(len(self.numbers) - 1) # I remove the last number index in the map\n self.indexes[last_value].add(index) # And I update the set with the new position\n self.numbers[index] = last_value\n\n self.numbers.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.numbers)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"291"},{"code":"import random\nclass RandomizedCollection:\n\n def __init__(self):\n self.vals=[]\n self.indices={}#to store indices of each element\n\n def insert(self, val: int) -> bool:\n self.vals.append(val)\n if val in self.indices:\n self.indices[val].add(len(self.vals)-1)\n return False\n else:\n self.indices[val]={len(self.vals)-1}\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.indices:\n return False\n\n index=self.indices[val].pop()\n last_val=self.vals[-1]\n if index!=len(self.vals)-1:\n self.vals[index]=last_val \n self.indices[last_val].discard(len(self.vals)-1)\n self.indices[last_val].add(index)\n\n self.vals.pop()\n if not self.indices[val]:\n del self.indices[val] \n\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.vals)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"298"},{"code":"import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.collection = []\n self.placement = {}\n \n\n def insert(self, val: int) -> bool:\n if val not in self.placement:\n if val not in self.placement:\n self.placement[val] = set()\n self.placement[val].add(len(self.collection))\n self.collection.append(val)\n return True\n else:\n if val not in self.placement:\n self.placement[val] = set()\n self.placement[val].add(len(self.collection))\n self.collection.append(val)\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.placement and self.placement[val]:\n removal = self.placement[val].pop()\n replace = self.collection[-1]\n \n # swap last val placement with thing to remove in dict\n self.collection[removal] = replace\n\n if removal != (len(self.collection) - 1):\n # swap last val placement with thing to remove in list\n self.placement[replace].remove(len(self.collection) - 1)\n self.placement[replace].add(removal)\n\n self.collection.pop()\n \n if not self.placement[val]:\n del self.placement[val]\n\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return self.collection[random.randint(0, len(self.collection) - 1)]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"298"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.dict = {}\n #key is the number, and value is a list [set of indices in nums, occurrences]\n self.nums = []\n #list of numbers inserted\n \n def insert(self, val: int) -> bool:\n self.nums.append(val)\n if val in self.dict:\n self.dict[val].add(len(self.nums)-1)\n return False\n else:\n self.dict[val] = {len(self.nums)-1}\n return True\n \n\n def remove(self, val: int) -> bool:\n if val not in self.dict:\n return False\n\n index = self.dict[val].pop()\n last_val = self.nums[-1]\n\n if(last_val != val):\n self.nums[index] = last_val\n self.dict[last_val].discard(len(self.nums)-1)\n self.dict[last_val].add(index)\n self.nums.pop()\n else:\n self.dict[val].add(index)\n self.dict[val].discard(len(self.nums)-1)\n self.nums.pop()\n\n if len(self.dict[val])==0:\n del self.dict[val]\n return True\n \n\n def getRandom(self) -> int:\n return self.nums[random.randint(0, len(self.nums)-1)]\n\n \n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"305"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.map = defaultdict(set)\n self.arr = []\n self.index = 0\n\n def insert(self, val: int) -> bool:\n valid = False\n if val not in self.map or len(self.map[val]) == 0:\n valid = True\n\n self.map[val].add(self.index)\n self.arr.append(val)\n self.index+=1\n\n return valid\n\n\n\n \n def remove(self, val: int) -> bool:\n if val not in self.map or len(self.map[val]) == 0:\n return False\n \n \n last_value = self.arr[self.index-1] \n index_remove = self.map[val].pop()\n self.arr[index_remove], self.arr[self.index-1] = self.arr[self.index-1], self.arr[index_remove]\n self.arr.pop()\n \n \n self.map[last_value].add(index_remove) \n self.map[last_value].remove(self.index-1)\n \n \n self.index-=1\n \n return True\n\n def getRandom(self) -> int:\n if self.arr:\n random_integer = random.randint(0, len(self.arr)-1)\n return self.arr[random_integer]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"305"},{"code":"import random\nfrom collections import defaultdict\nclass DLLNode:\n def __init__(self, val: int):\n self.val = val\n self.next = None\n self.prev = None\n\nclass RandomizedCollection:\n def __init__(self):\n # linked list\n self.head = DLLNode(None)\n self.tail = DLLNode(None)\n self.head.next = self.tail\n self.tail.prev = self.head\n self.nodes = defaultdict(list)\n\n # for getrandom\n self.randlist = []\n self.randlistpos = defaultdict(set)\n \n def appendNode(self, node: DLLNode) -> None:\n node.next = self.tail\n node.prev = self.tail.prev\n self.tail.prev.next = node\n self.tail.prev = node\n \n def removeNode(self, node: DLLNode) -> None:\n node.prev.next = node.next\n node.next.prev = node.prev\n\n def insert(self, val: int) -> bool:\n toReturn = True\n if val in self.nodes: toReturn = False\n\n # insert in linked list\n newNode = DLLNode(val)\n self.nodes[val].append(newNode)\n self.appendNode(newNode)\n\n # insert in randlist\n self.randlist.append(val)\n self.randlistpos[val].add(len(self.randlist) - 1)\n return toReturn\n\n def remove(self, val: int) -> bool:\n toReturn = True\n if val not in self.nodes: return False\n \n # remove from linked list\n node = self.nodes[val].pop()\n self.removeNode(node)\n if len(self.nodes[val]) == 0: self.nodes.pop(val)\n\n # remove from randlist\n pos = self.randlistpos[val].pop()\n lastval = self.randlist[-1]\n if pos != len(self.randlist) - 1:\n self.randlist[pos], self.randlist[-1] = self.randlist[-1], self.randlist[pos]\n self.randlistpos[lastval].discard(len(self.randlist) - 1)\n self.randlistpos[lastval].add(pos)\n\n self.randlist.pop()\n if len(self.randlistpos[val]) == 0: self.randlistpos.pop(val)\n return toReturn\n\n def getRandom(self) -> int:\n if not self.randlist:\n raise ValueError(\"Set is empty\")\n return random.choice(self.randlist)\n \n def getOldest(self) -> int:\n if self.head.next == self.tail:\n raise ValueError(\"Set is empty\")\n return self.head.next.val\n \n def getNewest(self) -> int:\n if self.tail.prev == self.head:\n raise ValueError(\"Set is empty\")\n return self.tail.prev.val","runtime":"312"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.map = defaultdict(set)\n self.arr = []\n self.index = 0\n\n def insert(self, val: int) -> bool:\n valid = False\n if val not in self.map or len(self.map[val]) == 0:\n valid = True\n\n self.map[val].add(self.index)\n self.arr.append(val)\n self.index+=1\n\n return valid\n\n\n\n \n def remove(self, val: int) -> bool:\n if val not in self.map or len(self.map[val]) == 0:\n return False\n \n \n last_value = self.arr[self.index-1] \n index_remove = self.map[val].pop()\n self.arr[index_remove], self.arr[self.index-1] = self.arr[self.index-1], self.arr[index_remove]\n self.arr.pop()\n \n\n if self.index-1 != index_remove:\n self.map[last_value].remove(self.index-1)\n self.map[last_value].add(index_remove)\n \n self.index-=1\n \n return True\n\n def getRandom(self) -> int:\n if self.arr:\n random_integer = random.randint(0, len(self.arr)-1)\n return self.arr[random_integer]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"312"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.m = defaultdict(list)\n self.l = [] # [value, index]\n\n def insert(self, val: int) -> bool:\n res = True\n if val in self.m and len(self.m[val]) > 0:\n res = False\n self.m[val].append(len(self.l))\n self.l.append([val, len(self.m[val]) - 1]) \n return res\n\n def remove(self, val: int) -> bool:\n if val not in self.m or len(self.m[val]) == 0:\n return False\n \n # delete val from list (require swap)\n cur_i = self.m[val][-1]\n\n if cur_i == len(self.l) - 1:\n self.m[val].pop()\n self.l.pop()\n return True\n\n last = self.l[-1]\n self.m[last[0]][last[1]] = cur_i\n self.l[cur_i] = self.l[-1]\n self.l.pop()\n self.m[val].pop()\n \n \n return True\n\n\n def getRandom(self) -> int:\n n = random.randrange(0, len(self.l))\n return self.l[n][0]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"319"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d = defaultdict(int)\n self.li=[]\n\n def insert(self, val: int) -> bool:\n self.li.append(val)\n self.d[val]+=1\n if self.d[val]!=1:\n return False\n return True\n \n\n def remove(self, val: int) -> bool:\n if self.d[val]!=0:\n self.li.remove(val)\n self.d[val]-=1\n return True\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.li)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"319"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d=defaultdict(int)\n self.li=[]\n \n\n def insert(self, val: int) -> bool:\n self.li.append(val)\n self.d[val]+=1\n if self.d[val]!=1:\n return False\n return True\n\n def remove(self, val: int) -> bool:\n if self.d[val]!=0:\n self.li.remove(val)\n self.d[val]-=1\n return True\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.li)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"326"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.record = defaultdict(set)\n self.arr = []\n \n\n def insert(self, val: int) -> bool:\n ret = False\n if val not in self.record:\n ret = True \n idx = len(self.arr)\n self.record[val].add(idx)\n self.arr.append(val)\n return ret\n\n def remove(self, val: int) -> bool:\n ret = False\n if val in self.record:\n # 先找出 被remove元素的一个index\n idxToRemove = self.record[val].pop()\n # 最后一个元素的index\n lastIdx = len(self.arr)-1\n if idxToRemove != lastIdx:\n # 交换位置\n lastVal = self.arr[lastIdx]\n # 交换set里的index\n self.record[lastVal].remove(lastIdx)\n self.record[lastVal].add(idxToRemove) \n self.arr[idxToRemove] = lastVal\n \n self.arr.pop()\n if len(self.record[val]) == 0:\n del(self.record[val])\n ret = True\n\n return ret\n\n def getRandom(self) -> int:\n idx = random.randint(0, len(self.arr)-1)\n return self.arr[idx]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"326"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.m = {}\n self.keys = []\n\n def insert(self, val: int) -> bool:\n if val not in self.m:\n self.m[val] = []\n ret = len(self.m[val]) == 0\n self.keys.append(val) \n self.m[val].append(len(self.keys) - 1)\n # print(self.m, self.keys)\n return ret\n\n def remove(self, val: int) -> bool:\n print(f'remove{val}')\n if val not in self.m or len(self.m[val]) == 0:\n return False\n index = self.m[val].pop()\n # print(f'index{index}')\n if index == len(self.keys) - 1:\n self.keys.pop()\n else:\n last = self.keys.pop()\n self.keys[index] = last\n self.m[last][len(self.m[last]) - 1] = index\n self.m[last].sort()\n\n # print(self.m, self.keys)\n return True \n\n def getRandom(self) -> int:\n return self.keys[random.randint(0, len(self.keys) - 1)]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"332"},{"code":"class RandomizedCollection:\n def __init__(self):\n self.counts_table = dict()\n self.values_pool, self.pool_size = [], 0\n\n def insert(self, val: int) -> bool:\n if val not in self.counts_table.keys():\n self.counts_table.update({val: 0})\n self.counts_table[val] += 1\n\n self.values_pool.append(val)\n self.pool_size += 1\n return self.counts_table[val] == 1\n\n def remove(self, val: int) -> bool:\n if val not in self.counts_table.keys():\n return False\n if self.counts_table[val] == 0:\n return False\n \n self.counts_table[val] -= 1\n self.values_pool.remove(val)\n self.pool_size -= 1\n return True\n \n def getRandom(self) -> int:\n return self.values_pool[random.randrange(self.pool_size)]\n","runtime":"332"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d=defaultdict(int)\n self.li=[]\n \n def insert(self, val: int) -> bool:\n self.li.append(val)\n self.d[val]+=1\n if self.d[val]!=1:\n return False\n return True\n\n def remove(self, val: int) -> bool:\n if self.d[val]!=0:\n self.li.remove(val)\n self.d[val]-=1\n return True\n return False\n \n def getRandom(self) -> int:\n return random.choice(self.li)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"339"},{"code":"class RandomizedCollection:\n def __init__(self):\n self.vals = []\n self.valToIndices = collections.defaultdict(list)\n\n def insert(self, val: int) -> bool:\n self.valToIndices[val].append(len(self.vals))\n self.vals.append([val, len(self.valToIndices[val]) - 1])\n return len(self.valToIndices[val]) == 1\n\n def remove(self, val: int) -> bool:\n if val not in self.valToIndices or self.valToIndices[val] == []:\n return False\n\n index = self.valToIndices[val][-1]\n self.valToIndices[self.vals[-1][0]][self.vals[-1][1]] = index\n self.valToIndices[val].pop()\n self.vals[index] = self.vals[-1]\n self.vals.pop()\n return True\n\n def getRandom(self) -> int:\n index = random.randint(0, len(self.vals) - 1)\n return self.vals[index][0]","runtime":"339"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.vals=[]\n self.valToIndices=collections.defaultdict(list)\n def insert(self, val: int) -> bool:\n self.valToIndices[val].append(len(self.vals))\n self.vals.append([val,len(self.valToIndices[val])-1])\n return len(self.valToIndices[val])==1\n def remove(self, val: int) -> bool:\n if val not in self.valToIndices or self.valToIndices[val]==[]:\n return False\n index=self.valToIndices[val][-1]\n self.valToIndices[self.vals[-1][0]][self.vals[-1][1]]=index\n self.valToIndices[val].pop()\n self.vals[index] = self.vals[-1]\n self.vals.pop()\n return True\n def getRandom(self) -> int:\n index=random.randint(0,len(self.vals)-1)\n return self.vals[index][0]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"346"},{"code":"from random import randint\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.mpp = {}\n self.arr = []\n\n def insert(self, val: int) -> bool:\n ans = val not in self.mpp\n if not ans:\n self.mpp[val] += 1\n else:\n self.mpp[val] = 1\n self.arr.append(val)\n return ans\n\n def remove(self, val: int) -> bool:\n ans = val in self.mpp\n if ans:\n self.mpp[val] -= 1\n self.arr.remove(val)\n\n if self.mpp[val] == 0:\n del self.mpp[val]\n\n return ans\n\n def getRandom(self) -> int:\n return self.arr[randint(0,len(self.arr)-1)]\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"346"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.vals = []\n self.db = {}\n\n\n def insert(self, val: int) -> bool:\n self.vals.append(val)\n if val in self.db:\n self.db[val].add(len(self.vals) - 1)\n else:\n self.db[val] = {len(self.vals) - 1}\n \n return len(self.db[val]) == 1\n\n\n def remove(self, val: int) -> bool:\n if val not in self.vals:\n return False\n \n print(f\"removing {val}\")\n last_index = self.db[val].pop()\n last_val = self.vals[-1]\n\n if last_index != len(self.vals) - 1:\n self.vals[last_index] = last_val\n self.db[last_val].discard(len(self.vals) - 1)\n self.db[last_val].add(last_index)\n \n self.vals.pop()\n\n return True\n \n\n def getRandom(self) -> int:\n return random.choice(self.vals)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"353"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.pool = []\n self.value_index = defaultdict(list)\n\n def insert(self, val: int) -> bool:\n self.value_index[val].append(len(self.pool))\n self.pool.append((val,len(self.value_index[val])-1))\n return len(self.value_index.get(val)) == 1\n\n def remove(self, val: int) -> bool:\n if not self.value_index[val]:\n return False\n\n remove_idx = self.value_index[val][-1]\n last_element = self.pool[-1]\n self.value_index[last_element[0]][last_element[1]] = remove_idx\n self.pool[remove_idx] = self.pool[-1]\n self.value_index[val].pop()\n self.pool.pop()\n\n return True\n\n def getRandom(self) -> int:\n random_idx = random.randint(0, len(self.pool) - 1)\n return self.pool[random_idx][0]\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()\n","runtime":"360"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.n = 0\n self.num_map = {}\n self.nums = []\n\n def insert(self, val: int) -> bool:\n not_present = False\n if val not in self.num_map:\n self.num_map[val] = set()\n not_present = True\n\n self.nums.append(val) # add value to list\n self.num_map[val].add(self.n)\n self.n += 1\n\n return not_present\n \n\n def remove(self, val: int) -> bool:\n if val not in self.num_map:\n return False\n\n index_remove = next(iter(self.num_map[val]))\n self.num_map[val].remove(index_remove)\n self.nums[index_remove] = self.nums[-1]\n end_val = self.nums[-1]\n if self.n-1 in self.num_map[end_val]:\n self.num_map[end_val].remove(self.n-1)\n self.num_map[end_val].add(index_remove)\n self.nums.pop(-1)\n self.n -= 1\n\n if len(self.num_map[val]) == 0:\n del self.num_map[val]\n\n return True\n \n\n def getRandom(self) -> int:\n return random.sample(self.nums, 1)[0]","runtime":"381"},{"code":"from sortedcontainers import SortedList\nimport random\nclass RandomizedCollection:\n\n def __init__(self):\n self.arr=SortedList([])\n self.dc=defaultdict(lambda:0)\n\n def insert(self, val: int) -> bool:\n self.arr.add(val)\n self.dc[val]+=1\n return self.dc[val]==1\n def remove(self, val: int) -> bool:\n if(self.dc[val]>0):\n self.arr.discard(val)\n self.dc[val]-=1\n return True\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.arr)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"388"},{"code":"from sortedcontainers import SortedList\nclass RandomizedCollection:\n\n def __init__(self):\n self.dict = {}\n self.array = SortedList()\n \n\n def insert(self, val: int) -> bool:\n exists = val in self.dict\n self.dict[val] = self.dict.get(val, 0) + 1\n self.array.add(val)\n return not exists\n\n def remove(self, val: int) -> bool:\n exists = val in self.dict\n if exists:\n self.dict[val] -= 1\n if self.dict[val] == 0:\n del self.dict[val]\n self.array.remove(val)\n return exists\n\n def getRandom(self) -> int:\n return random.choice(self.array)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"395"},{"code":"from sortedcontainers import SortedList\nimport random\nclass RandomizedCollection:\n\n def __init__(self):\n self.arr=SortedList([])\n self.dict=defaultdict(lambda:0)\n\n def insert(self, val: int) -> bool:\n self.arr.add(val)\n self.dict[val]+=1\n return self.dict[val]==1\n \n def remove(self, val: int) -> bool:\n if(self.dict[val]>0):\n self.arr.discard(val)\n self.dict[val]-=1\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.arr)\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"401"},{"code":"from collections import defaultdict\nclass RandomizedCollection:\n vals: List[int]\n indexes: dict[int, int]\n\n def __init__(self):\n # getRandom: list O(1)\n # check present: map: number -> index\n # swap with the last element if remove\n self.vals: List[int] = []\n self.indexes = defaultdict(set)\n \n def insert(self, val: int) -> bool:\n notPresent = val not in self.indexes\n self.indexes[val].add(len(self.vals))\n self.vals.append(val)\n return notPresent\n \n def remove(self, val: int) -> bool:\n if val not in self.indexes:\n return False\n indexes = self.indexes[val]\n index = next(iter(indexes))\n self.vals[index], self.vals[-1] = self.vals[-1], self.vals[index]\n \n if len(self.indexes[val]) == 1:\n del self.indexes[val]\n else:\n self.indexes[val].remove(index)\n self.vals.pop()\n\n if index < len(self.vals):\n updateVal = self.vals[index]\n self.indexes[updateVal].add(index)\n self.indexes[updateVal].remove(len(self.vals))\n return True\n\n def getRandom(self) -> int:\n return random.sample(self.vals, 1)[0]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"408"},{"code":"from sortedcontainers import SortedList\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.sl = SortedList() \n\n def insert(self, val: int) -> bool:\n idx = self.sl.bisect_left(val)\n ret = idx < len(self.sl) and self.sl[idx] == val\n self.sl.add(val)\n return not ret\n\n def remove(self, val: int) -> bool:\n idx = self.sl.bisect_left(val)\n if idx >= len(self.sl) or self.sl[idx] != val:\n return False\n self.sl.remove(val)\n return True\n\n def getRandom(self) -> int:\n idx = random.randrange(0, len(self.sl))\n return self.sl[idx]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"415"},{"code":"import random\n\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.data = {}\n self.list_data = []\n\n def insert(self, val: int) -> bool:\n entry = self.data.get(val)\n retval = entry is None\n insertion_index = len(self.list_data)\n\n if not entry:\n entry = []\n \n self.list_data.append(val)\n entry.append(insertion_index)\n self.data[val] = entry\n return retval\n\n def remove(self, val: int) -> bool:\n entry = self.data.get(val)\n retval = entry is not None\n\n if entry:\n assert len(entry) > 0\n index_to_remove = entry.pop()\n last_element = self.list_data[-1]\n last_index = len(self.list_data) - 1\n\n if index_to_remove != last_index:\n self.list_data[index_to_remove] = last_element\n replacement_entry = self.data[last_element]\n replacement_entry[replacement_entry.index(last_index)] = index_to_remove\n self.data[last_element] = replacement_entry\n \n if len(entry) == 0:\n self.data.pop(val)\n else:\n self.data[val] = entry\n \n self.list_data.pop()\n return retval\n\n def getRandom(self) -> int:\n return random.sample(self.list_data, k=1)[0]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"422"},{"code":"from sortedcontainers import SortedDict\nimport random\n\nfrom queue import PriorityQueue\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.fq_map = SortedDict()\n self.list_version = [] \n\n\n def _verbose(self):\n for key, value in self.fq_map.items():\n print(key, value.queue)\n print(self.list_version)\n\n\n def insert(self, val: int) -> bool:\n if val not in self.fq_map or self.fq_map[val].empty():\n self.fq_map[val] = PriorityQueue()\n self.fq_map[val].put(-len(self.list_version))\n self.list_version.append(val)\n # self._verbose()\n return True\n else:\n self.fq_map[val].put(-len(self.list_version))\n self.list_version.append(val)\n # self._verbose()\n return False\n \n\n def remove(self, val: int) -> bool:\n if val not in self.fq_map or self.fq_map[val].empty():\n # self._verbose()\n return False\n \n \n replacement_index = -self.fq_map[val].get()\n last_item = self.list_version[-1]\n\n # print(\"stuck here?\")\n # return True\n \n \n # update stuff\n self.list_version[replacement_index] = last_item\n # print(\"pre?\")\n # return True\n if last_item != val:\n # for when the last item IS the one we want to remove \n foo = self.fq_map[last_item].get(False) # should always be the last index by definition\n # print(f\"remove halfway {foo}\")\n # self._verbose()\n # return True\n self.fq_map[last_item].put(-replacement_index) # what the hell, fix this this \n # self.fq_map[val] = self.fq_map[val][:-1] # already done earlier \n self.list_version = self.list_version[:-1]\n\n\n # self._verbose()\n return True\n\n def getRandom(self) -> int:\n random_int = random.randint(0, len(self.list_version) - 1)\n\n # self._verbose()\n return self.list_version[random_int]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"429"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.randomized_dict=dict()\n self.need_construct=True\n self.random_list=[]\n \n\n def insert(self, val: int) -> bool:\n self.need_construct=True\n if self.randomized_dict.get(val) is None:\n self.randomized_dict[val]=1\n return True\n else:\n self.randomized_dict[val]+=1\n return False\n\n def remove(self, val: int) -> bool:\n self.need_construct=True\n if self.randomized_dict.get(val) != None:\n self.randomized_dict[val]-=1\n if self.randomized_dict[val]==0:\n self.randomized_dict.pop(val)\n return True\n return False\n\n def getRandom(self) -> int:\n if(self.need_construct==True):\n self.construct_list()\n self.need_construct=False\n return random.choice(self.random_list)\n # return random.choices(list(self.randomized_dict.keys()), weights=list(self.randomized_dict.values()))[0]\n # iterators = [itertools.repeat(key, value) for key, value in self.randomized_dict.items()]\n # return random.choice(list(itertools.chain.from_iterable(iterators))) \n\n\n def construct_list(self)-> None:\n self.random_list= [key for key, value in self.randomized_dict.items() for _ in range(value)]\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"436"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.c = Counter()\n self.nb = 0\n self.s = []\n self.cal = True\n\n def insert(self, val: int) -> bool:\n self.cal = True\n if val in self.c.keys():\n self.c[val] += 1\n self.nb += 1\n return False\n else : \n self.c[val] = 1\n self.nb += 1\n return True\n\n def remove(self, val: int) -> bool:\n self.cal = True\n if val in self.c.keys():\n self.c[val] -= 1\n self.nb -= 1\n if self.c[val] == 0:\n del self.c[val]\n\n return True\n \n else:\n return False\n\n def getRandom(self) -> int:\n i = random.randint(0,self.nb-1)\n if self.cal :\n self.s = list(self.c.elements())\n self.cal = False\n return self.s[i]\n \n\n\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"443"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"450"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"457"},{"code":"import random\nimport collections\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.nums = [] # actual list\n self.numsDict = collections.defaultdict(set)\n # keeps track of value and idx in nums\n\n def insert(self, val: int) -> bool:\n if val not in self.nums:\n ret = True\n else:\n ret = False\n self.nums.append(val)\n self.numsDict[val].add(len(self.nums)-1)\n\n return ret\n\n def remove(self, val: int) -> bool:\n if val in self.nums:\n idx = self.numsDict[val].pop()\n self.nums[idx] = self.nums[-1]\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\n self.numsDict[self.nums[idx]].add(idx)\n self.nums.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.nums)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"464"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.multiset = []\n\n def insert(self, val: int) -> bool:\n res = True\n if val in self.multiset:\n res = False\n self.multiset.append(val)\n return res\n\n def remove(self, val: int) -> bool:\n if val in self.multiset:\n self.multiset.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.multiset)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"470"},{"code":"from dataclasses import dataclass\nfrom random import choice\nfrom typing import NewType\n\n\nAmount = NewType(\"Amount\", int)\nValue = NewType(\"Value\", int)\n\nNO_AMOUNT = Amount(0)\n\n\n@dataclass\nclass Cache:\n values: list[Value]\n\n\nclass RandomizedCollection:\n def __init__(self):\n self._items = dict[Value, Amount]()\n self._cache = None\n\n def insert(self, val: Value) -> bool:\n self._items[val] = Amount((amount := self._items.get(val, NO_AMOUNT)) + 1)\n self._cache = None\n return amount == NO_AMOUNT\n\n def remove(self, val: Value) -> bool:\n if (amount := self._items.get(val)) is None:\n return False\n new_amount = Amount(amount - 1)\n if new_amount == NO_AMOUNT:\n del self._items[val]\n else:\n self._items[val] = new_amount\n self._cache = None\n return True\n\n def _buildCache(self) -> Cache:\n if (cache := self._cache) is not None:\n return cache\n values = list[Value]()\n for value, weight in self._items.items():\n for _ in range(weight):\n values.append(value)\n self._cache = (cache := Cache(values))\n return cache\n\n def getRandom(self) -> Value:\n cache = self._buildCache()\n return choice(cache.values)\n","runtime":"477"},{"code":"import random\nimport collections\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.nums = [] # actual list\n self.numsDict = collections.defaultdict(set)\n # keeps track of value and idx in nums\n\n def insert(self, val: int) -> bool:\n if val not in self.nums:\n ret = True\n else:\n ret = False\n self.nums.append(val)\n self.numsDict[val].add(len(self.nums)-1)\n\n return ret\n\n def remove(self, val: int) -> bool:\n if val in self.nums:\n idx = self.numsDict[val].pop()\n self.nums[idx] = self.nums[-1]\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\n self.numsDict[self.nums[idx]].add(idx)\n self.nums.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.nums)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"484"},{"code":"import random\nimport collections\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.nums = [] # actual list\n self.numsDict = collections.defaultdict(set)\n # keeps track of value and idx in nums\n\n def insert(self, val: int) -> bool:\n if val not in self.nums:\n ret = True\n else:\n ret = False\n self.nums.append(val)\n self.numsDict[val].add(len(self.nums)-1)\n\n return ret\n\n def remove(self, val: int) -> bool:\n if val in self.nums:\n idx = self.numsDict[val].pop()\n self.nums[idx] = self.nums[-1]\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\n self.numsDict[self.nums[idx]].add(idx)\n self.nums.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.nums)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"491"},{"code":"import random\n\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.multiset = []\n \n\n def insert(self, val: int) -> bool:\n res = True\n if val in self.multiset:\n res = False\n self.multiset.append(val)\n return res\n\n def remove(self, val: int) -> bool:\n if val in self.multiset:\n self.multiset.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.multiset)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"498"},{"code":"import random\nimport collections\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.nums = [] # actual list\n self.numsDict = collections.defaultdict(set)\n # keeps track of value and idx in nums\n\n def insert(self, val: int) -> bool:\n if val not in self.nums:\n ret = True\n else:\n ret = False\n self.nums.append(val)\n self.numsDict[val].add(len(self.nums)-1)\n\n return ret\n\n def remove(self, val: int) -> bool:\n if val in self.nums:\n idx = self.numsDict[val].pop()\n #if idx != len(self.nums) - 1:\n self.nums[idx] = self.nums[-1]\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\n self.numsDict[self.nums[idx]].add(idx)\n self.nums.pop()\n\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.nums)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"505"},{"code":"import random\nclass RandomizedCollection:\n def __init__(self):\n self.collection=[]\n # self.collection_without_duplicates=[]\n\n def insert(self, val: int) -> bool:\n if val not in self.collection:\n self.collection.append(val)\n # self.collection_without_duplicates.append(val)\n return True\n else:\n self.collection.append(val)\n return False\n def remove(self, val: int) -> bool:\n if val not in self.collection:\n return False\n self.collection.remove(val)\n #if val not in self.collection:\n # self.collection_without_duplicates.remove(val)\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.collection)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"512"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.items=[]\n \n def insert(self, val: int) -> bool:\n \n \n flag=True\n if val in self.items:\n flag=False\n\n self.items.append(val)\n\n \n return flag\n\n \n\n def remove(self, val: int) -> bool:\n \n if val in self.items:\n self.items.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.items)\n \n\n\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"519"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"526"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"533"},{"code":"import random\nimport collections\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.nums = [] # actual list\n self.numsDict = collections.defaultdict(set)\n # keeps track of value and idx in nums\n\n def insert(self, val: int) -> bool:\n if val not in self.nums:\n ret = True\n else:\n ret = False\n self.nums.append(val)\n self.numsDict[val].add(len(self.nums)-1)\n\n return ret\n\n def remove(self, val: int) -> bool:\n if val in self.nums:\n idx = self.numsDict[val].pop()\n if idx != len(self.nums) - 1:\n self.nums[idx] = self.nums[-1]\n \n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\n self.numsDict[self.nums[idx]].add(idx)\n self.nums.pop()\n\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.nums)\n \n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"539"},{"code":"import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.collection = []\n self.count = 0\n \n\n def insert(self, val: int) -> bool:\n if val not in self.collection:\n self.collection.append(val)\n self.count+=1\n return True\n else:\n self.collection.append(val)\n self.count+=1\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.collection:\n self.collection.remove(val)\n self.count -= 1\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return self.collection[random.randint(0, self.count - 1)]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"546"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.data = []\n \n\n def insert(self, val: int) -> bool:\n if val in self.data:\n self.data.append(val)\n return False\n else:\n self.data.append(val)\n return True\n \n\n def remove(self, val: int) -> bool:\n try:\n i = self.data.index(val)\n self.data.pop(i)\n return True\n except ValueError:\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.data)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"553"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.values = list()\n \n\n def insert(self, val: int) -> bool:\n match = val not in self.values\n self.values.append(val)\n return match\n\n def remove(self, val: int) -> bool:\n if val in self.values:\n self.values.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"560"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"567"},{"code":"import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.s = []\n\n def insert(self, val: int) -> bool:\n already_present = val in self.s\n self.s.append(val)\n return not already_present\n\n def remove(self, val: int) -> bool:\n if val in self.s:\n self.s.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.s)\n","runtime":"574"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"581"},{"code":"import random\nclass RandomizedCollection(object):\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.s = []\n \n\n def insert(self, val):\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.append(val)\n return False\n else:\n self.s.append(val)\n return True \n \n\n def remove(self, val):\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n :type val: int\n :rtype: bool\n \"\"\"\n if val in self.s:\n self.s.remove(val)\n return True \n else:\n return False\n\n def getRandom(self):\n \"\"\"\n Get a random element from the collection.\n :rtype: int\n \"\"\"\n index = int(random.random() * len(self.s))\n return self.s[index]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"588"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.container = []\n\n def insert(self, val: int) -> bool:\n present = val not in self.container\n self.container.append(val)\n return present\n\n def remove(self, val: int) -> bool:\n if val in self.container:\n self.container.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return choice(self.container)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"595"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.arr=[]\n\n def insert(self, val: int) -> bool:\n k=True\n if val in self.arr:\n k=False\n self.arr.append(val)\n return k\n\n def remove(self, val: int) -> bool:\n k=False\n if val in self.arr:\n self.arr.remove(val)\n k=True\n return k\n\n def getRandom(self) -> int:\n return random.choice(self.arr)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"602"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.lst=[]\n\n def insert(self, val: int) -> bool:\n value= val not in self.lst\n self.lst.append(val)\n return value\n \n\n def remove(self, val: int) -> bool:\n value= val in self.lst\n if value:\n self.lst.remove(val)\n return value \n\n def getRandom(self) -> int:\n return random.choice(self.lst)\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"608"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.container = []\n\n def insert(self, val: int) -> bool:\n present = val not in self.container\n self.container.append(val)\n return present\n\n def remove(self, val: int) -> bool:\n if val in self.container:\n self.container.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return choice(self.container)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"615"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.a = []\n \n def insert(self, val: int) -> bool:\n if val in self.a:\n self.a.append(val)\n return 0\n self.a.append(val)\n return 1\n\n def remove(self, val: int) -> bool:\n if val in self.a:\n self.a.remove(val)\n return 1\n return 0\n \n def getRandom(self) -> int:\n return random.choice(self.a)\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"622"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.values = list()\n\n def insert(self, val: int) -> bool:\n match = val not in self.values\n self.values.append(val)\n return match\n\n def remove(self, val: int) -> bool:\n if val in self.values:\n self.values.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"629"},{"code":"import random\nclass RandomizedCollection:\n\n def __init__(self):\n self.lst = []\n\n def insert(self, val: int) -> bool:\n if val not in self.lst:\n self.lst.append(val)\n return True\n else:\n self.lst.append(val)\n return False \n\n def remove(self, val: int) -> bool:\n if val in self.lst:\n self.lst.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n ind = random.randint(0, len(self.lst) - 1)\n return self.lst[ind]\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","runtime":"636"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.elements = list()\n def search(self,val):\n return val in self.elements\n\n def insert(self, val: int) -> bool:\n a=self.search(val)\n self.elements.append(val)\n return not a\n\n def remove(self, val: int) -> bool:\n if val not in self.elements:\n return False\n self.elements.remove(val)\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.elements)","runtime":"643"}],"string":"[\n {\n \"code\": \"class RandomizedCollection:\\n def __init__(self):\\n self.dict = collections.defaultdict(set)\\n self.lst = []\\n \\n def insert(self, val: int) -> bool:\\n self.dict[val].add(len(self.lst))\\n self.lst.append(val)\\n return len(self.dict[val]) == 1\\n \\n def remove(self, val: int) -> bool:\\n if self.dict[val]:\\n ind, tail = self.dict[val].pop(), self.lst[-1]\\n self.lst[ind] = tail\\n if self.dict[tail]:\\n self.dict[tail].add(ind)\\n self.dict[tail].discard(len(self.lst)-1)\\n self.lst.pop()\\n return True\\n return False\\n \\n def getRandom(self) -> int:\\n return self.lst[int(random.random()*len(self.lst))]\\n\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"229\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = []\\n self.d = defaultdict(set)\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.d and len(self.d[val]) > 0:\\n res = False\\n else:\\n res = True\\n self.nums.append(val)\\n # store element positions\\n self.d[val].add(len(self.nums)-1)\\n return res\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.d and len(self.d[val]) > 0:\\n pos = self.d[val].pop() # element to remove position \\n lpos = len(self.nums)-1 # last position\\n lval = self.nums[lpos] # last val\\n \\n self.d[lval].add(pos) \\n self.d[lval].remove(lpos)\\n \\n # swap with last\\n self.nums[pos] = lval\\n \\n # remove element\\n self.nums.pop()\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n size = len(self.nums)\\n i = int(random.random()*size)\\n return self.nums[i]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"229\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.items = []\\n self.indexSet = defaultdict(set)\\n self.size = 0\\n\\n def insert(self, val: int) -> bool:\\n self.items.append(val)\\n res = len(self.indexSet[val]) == 0\\n self.indexSet[val].add(self.size)\\n self.size += 1\\n return res\\n\\n def remove(self, val: int) -> bool:\\n if not self.indexSet[val]:\\n return False\\n index = self.indexSet[val].pop()\\n top = self.items[-1]\\n self.items[index] = top\\n self.indexSet[top].add(index)\\n self.indexSet[top].discard(self.size - 1)\\n self.items.pop()\\n self.size -= 1\\n return True\\n\\n def getRandom(self) -> int:\\n index = int(random.random() * self.size)\\n return self.items[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.n = 0\\n self.num_map = {}\\n self.nums = []\\n\\n def insert(self, val: int) -> bool:\\n not_present = False\\n if val not in self.num_map:\\n self.num_map[val] = set()\\n not_present = True\\n\\n self.nums.append(val) # add value to list\\n self.num_map[val].add(self.n)\\n self.n += 1\\n\\n return not_present\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.num_map:\\n return False\\n\\n index_remove = next(iter(self.num_map[val]))\\n self.num_map[val].remove(index_remove)\\n self.nums[index_remove] = self.nums[-1]\\n end_val = self.nums[-1]\\n if self.n-1 in self.num_map[end_val]:\\n self.num_map[end_val].remove(self.n-1)\\n self.num_map[end_val].add(index_remove)\\n self.nums.pop(-1)\\n self.n -= 1\\n\\n if len(self.num_map[val]) == 0:\\n del self.num_map[val]\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n idx = int(random.random() * self.n)\\n return self.nums[idx]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"236\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.n = 0\\n self.num_map = {}\\n self.nums = []\\n\\n def insert(self, val: int) -> bool:\\n not_present = False\\n if val not in self.num_map:\\n self.num_map[val] = set()\\n not_present = True\\n\\n self.nums.append(val) # add value to list\\n self.num_map[val].add(self.n)\\n self.n += 1\\n\\n return not_present\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.num_map:\\n return False\\n\\n index_remove = next(iter(self.num_map[val]))\\n self.num_map[val].remove(index_remove)\\n self.nums[index_remove] = self.nums[-1]\\n end_val = self.nums[-1]\\n if self.n-1 in self.num_map[end_val]:\\n self.num_map[end_val].remove(self.n-1)\\n self.num_map[end_val].add(index_remove)\\n self.nums.pop(-1)\\n self.n -= 1\\n\\n if len(self.num_map[val]) == 0:\\n del self.num_map[val]\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n idx = int(random.random() * self.n)\\n return self.nums[idx]\",\n \"runtime\": \"243\"\n },\n {\n \"code\": \"\\nfrom random import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.arr = []\\n self.val2pos = {}\\n\\n def insert(self, val: int) -> bool:\\n if not val in self.val2pos: self.val2pos[val] = []\\n self.val2pos[val].append(len(self.arr))\\n self.arr.append([val, len(self.val2pos[val])-1])\\n return len(self.val2pos[val])==1\\n\\n def remove(self, val: int) -> bool:\\n if not (val in self.val2pos and len(self.val2pos[val])>0): return False\\n idx = self.val2pos[val].pop(-1)\\n last = self.arr.pop(-1)\\n if idx==len(self.arr): return True\\n self.val2pos[last[0]][last[1]] = idx\\n self.arr[idx] = last \\n\\n return True\\n\\n def getRandom(self) -> int:\\n return self.arr[int(random()*len(self.arr))][0]\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"243\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n # clarify\\n # array\\n # dict (val -> idxs)\\n self.arr = []\\n self.dict = {}\\n\\n def insert(self, val: int) -> bool:\\n present = val in self.dict and len(self.dict[val]) > 0\\n if val not in self.dict:\\n self.dict[val] = set()\\n idx = len(self.arr)\\n self.dict[val].add(idx)\\n self.arr.append(val)\\n return not present\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.dict or len(self.dict[val])==0: return False\\n # Find any idx of val\\n # Overwrite it with last element\\n # Update as necessary (dict[last_element] needs to point to new idx)\\n # Edge case: the two elements are the same (?)\\n # Pop last element from array\\n idx = self.dict[val].pop()\\n if idx == len(self.arr)-1: \\n # Last element IS the element we remove. No update needed\\n self.arr.pop()\\n return True\\n # Update last element dict\\n last_val = self.arr.pop()\\n last_idx = len(self.arr)\\n self.dict[last_val].remove(last_idx)\\n # Put it in idx (instead of the val we just removed)\\n self.arr[idx] = last_val\\n self.dict[last_val].add(idx)\\n return True\\n def getRandom(self) -> int:\\n return self.arr[int(random.random() * len(self.arr))]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"250\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.list = []\\n self.indices = defaultdict(set)\\n\\n def insert(self, val: int) -> bool:\\n self.list.append(val)\\n self.indices[val].add(len(self.list) - 1)\\n return len(self.indices[val]) == 1\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.indices or len(self.indices[val]) == 0:\\n return False\\n\\n curIdx = self.indices[val].pop()\\n lastIdx = len(self.list) - 1\\n self.indices[self.list[lastIdx]].add(curIdx)\\n self.indices[self.list[lastIdx]].remove(lastIdx) \\n self.list[lastIdx], self.list[curIdx] = self.list[curIdx], self.list[lastIdx]\\n self.list.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"250\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = []\\n self.d = defaultdict(set)\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.d and len(self.d[val]) > 0:\\n res = False\\n else:\\n res = True\\n self.nums.append(val)\\n # store element positions\\n self.d[val].add(len(self.nums)-1)\\n return res\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.d and len(self.d[val]) > 0:\\n pos = self.d[val].pop() # element to remove position \\n lpos = len(self.nums)-1 # last position\\n lval = self.nums[lpos] # last val\\n \\n self.d[lval].add(pos) \\n self.d[lval].remove(lpos)\\n \\n # swap with last\\n self.nums[pos] = lval \\n \\n # remove element\\n self.nums.pop()\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n size = len(self.nums)\\n i = int(random.random()*size)\\n return self.nums[i]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.hm = defaultdict(set)\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n self.list.append(val)\\n self.hm[val].add(len(self.list) - 1)\\n\\n if len(self.hm[val]) == 1:\\n return True\\n \\n return False\\n\\n def remove(self, val: int) -> bool:\\n if len(self.hm[val]) == 0:\\n return False\\n \\n remove, last = self.hm[val].pop(), self.list[-1]\\n self.list[remove] = last\\n\\n self.hm[last].add(remove)\\n self.hm[last].remove(len(self.list) - 1)\\n\\n self.list.pop()\\n\\n return True\\n\\n def getRandom(self) -> int:\\n return choice(self.list)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"import random\\nfrom collections import defaultdict\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.indices = defaultdict(set)\\n self.arr = []\\n\\n def insert(self, val: int) -> bool:\\n res = True\\n if val in self.indices:\\n res = False\\n self.indices[val].add(len(self.arr)) \\n self.arr.append(val)\\n return res\\n\\n def remove(self, val: int) -> bool:\\n # print(\\\"Start: \\\", self.indices, self.arr)\\n if val not in self.indices:\\n return False\\n \\n last_val = self.arr[-1]\\n idx_last = len(self.arr) - 1\\n\\n if last_val == val:\\n self.indices[last_val].remove(idx_last)\\n self.arr.pop()\\n if not self.indices[last_val]:\\n del self.indices[last_val]\\n return True\\n\\n idx_val = self.indices[val].pop()\\n \\n # swap value in arr\\n self.arr[idx_val], self.arr[idx_last] = self.arr[idx_last], self.arr[idx_val]\\n self.indices[last_val].remove(idx_last)\\n self.indices[last_val].add(idx_val)\\n \\n if not self.indices[val]:\\n del self.indices[val]\\n\\n self.arr.pop()\\n\\n # print(\\\"End: \\\", self.indices, self.arr)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.arr)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.storage = []\\n self.record = dict()\\n\\n def insert(self, val: int) -> bool:\\n res = False\\n self.storage.append(val)\\n if val not in self.record:\\n res = True\\n self.record[val] = set()\\n self.record[val].add(len(self.storage) - 1)\\n return res\\n\\n def remove(self, val: int) -> bool:\\n res = False\\n if val in self.record:\\n res = True\\n idx = self.record[val].pop()\\n if len(self.record[val]) == 0:\\n del self.record[val]\\n if idx == len(self.storage) - 1:\\n self.storage.pop()\\n else:\\n swap = len(self.storage) - 1\\n swap_val = self.storage[-1]\\n self.storage[idx] = self.storage[-1]\\n self.storage.pop()\\n self.record[swap_val].remove(swap)\\n self.record[swap_val].add(idx)\\n return res\\n\\n def getRandom(self) -> int:\\n return random.choice(self.storage)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.lst=[]\\n self.dict=defaultdict(set)\\n \\n\\n def insert(self, val: int) -> bool:\\n self.lst.append(val)\\n self.dict[val].add(len(self.lst)-1)\\n return len(self.dict[val])==1\\n\\n def remove(self, val: int) -> bool:\\n if not self.dict[val]:\\n return False\\n\\n idx=self.dict[val].pop()\\n self.lst[idx]=None\\n return True\\n \\n\\n def getRandom(self) -> int:\\n x=None\\n while x is None:\\n x=random.choice(self.lst)\\n return x\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"270\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.lst = []\\n self.dict = defaultdict(set)\\n \\n\\n def insert(self, val: int) -> bool:\\n self.dict[val].add(len(self.lst))\\n self.lst.append(val)\\n return len(self.dict[val]) == 1\\n \\n\\n def remove(self, val: int) -> bool:\\n if not self.dict[val]:\\n return False\\n\\n _temp_idx = self.dict[val].pop() \\n _replace_val = self.lst[-1]\\n self.lst[_temp_idx] = _replace_val\\n self.dict[_replace_val].add(_temp_idx)\\n self.dict[_replace_val].remove(len(self.lst)-1)\\n self.lst.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.lst)\\n\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"270\"\n },\n {\n \"code\": \"import random\\nfrom collections import defaultdict\\n\\nclass RandomizedCollection:\\n def __init__(self):\\n self.nums = [] # List to store the elements\\n self.idx_map = defaultdict(set) # HashMap to store indices of each value\\n\\n def insert(self, val: int) -> bool:\\n # Add the value to the nums list\\n self.nums.append(val)\\n # Record the index where this value is stored in the list\\n self.idx_map[val].add(len(self.nums) - 1)\\n # Return True if it's the first occurrence of the value\\n return len(self.idx_map[val]) == 1\\n\\n def remove(self, val: int) -> bool:\\n if not self.idx_map[val]:\\n return False\\n \\n # Get an index of the value to remove\\n remove_idx = self.idx_map[val].pop()\\n last_val = self.nums[-1]\\n \\n # Move the last element to the position of the element to be removed\\n self.nums[remove_idx] = last_val\\n # Update the hashmap for the last element\\n self.idx_map[last_val].add(remove_idx)\\n self.idx_map[last_val].discard(len(self.nums) - 1)\\n \\n # Remove the last element from the list\\n self.nums.pop()\\n \\n return True\\n\\n def getRandom(self) -> int:\\n # Get a random element from the list\\n return random.choice(self.nums)\\n\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.vals = [] # list to store values\\n self.indices = {} # hash map to store indices of each value\\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n \\\"\\\"\\\"\\n self.vals.append(val) # add value to end of list\\n if val in self.indices: # if value already exists in hash map\\n self.indices[val].add(len(self.vals)-1) # add index to set of indices\\n return False\\n else:\\n self.indices[val] = {len(self.vals)-1} # create new set with index\\n return True\\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n \\\"\\\"\\\"\\n if val not in self.indices: # if value doesn't exist in hash map\\n return False\\n \\n index = self.indices[val].pop() # get an index of the value and remove it from set\\n last_val = self.vals[-1] # get the last value in list\\n if index != len(self.vals)-1: # if index is not the last index\\n self.vals[index] = last_val # replace value at index with last value\\n self.indices[last_val].discard(len(self.vals)-1) # remove last index from set\\n self.indices[last_val].add(index) # add index to set of last value\\n \\n self.vals.pop() # remove last value from list\\n if not self.indices[val]: # if set of indices is empty\\n del self.indices[val] # remove key from hash map\\n \\n return True\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n \\\"\\\"\\\"\\n return random.choice(self.vals) # return a random value from the list\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom random import choice\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.lst = []\\n self.idx = defaultdict(set)\\n\\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n \\\"\\\"\\\"\\n self.idx[val].add(len(self.lst))\\n self.lst.append(val)\\n return len(self.idx[val]) == 1\\n\\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n \\\"\\\"\\\"\\n if not self.idx[val]: return False\\n remove, last = self.idx[val].pop(), self.lst[-1]\\n self.lst[remove] = last\\n self.idx[last].add(remove)\\n self.idx[last].discard(len(self.lst) - 1)\\n\\n self.lst.pop()\\n return True\\n\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n \\\"\\\"\\\"\\n return choice(self.lst)\\n\",\n \"runtime\": \"284\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.l =[]\\n self.h = defaultdict(list)\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.h:\\n self.l.append(val)\\n self.h[val].append(len(self.l)-1)\\n return True\\n else:\\n self.l.append(val)\\n self.h[val].append(len(self.l)-1)\\n return False\\n\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.h:\\n return False\\n else:\\n # finding the high index in where val is in l\\n last_ind_val = self.h[val].pop()\\n #last element in list\\n if last_ind_val == len(self.l)-1:\\n self.l.pop()\\n else:\\n last_element = self.l[-1]\\n self.h[last_element].remove(len(self.l)-1)\\n self.h[last_element].append(last_ind_val)\\n self.l[last_ind_val]= last_element\\n self.l[-1] = val\\n self.l.pop()\\n if len(self.h[val]) == 0:\\n del self.h[val]\\n return True\\n\\n\\n\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.l)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"284\"\n },\n {\n \"code\": \"import random\\nfrom collections import defaultdict\\nclass DLLNode:\\n def __init__(self, val: int):\\n self.val = val\\n self.next = None\\n self.prev = None\\n\\nclass RandomizedCollection:\\n def __init__(self):\\n # linked list\\n self.head = DLLNode(None)\\n self.tail = DLLNode(None)\\n self.head.next = self.tail\\n self.tail.prev = self.head\\n self.nodes = defaultdict(list)\\n\\n # for getrandom\\n self.randlist = []\\n self.randlistpos = defaultdict(set)\\n \\n def appendNode(self, node: DLLNode) -> None:\\n node.next = self.tail\\n node.prev = self.tail.prev\\n self.tail.prev.next = node\\n self.tail.prev = node\\n \\n def removeNode(self, node: DLLNode) -> None:\\n node.prev.next = node.next\\n node.next.prev = node.prev\\n\\n def insert(self, val: int) -> bool:\\n toReturn = True\\n if val in self.nodes: toReturn = False\\n\\n # insert in linked list\\n newNode = DLLNode(val)\\n self.nodes[val].append(newNode)\\n self.appendNode(newNode)\\n\\n # insert in randlist\\n self.randlist.append(val)\\n self.randlistpos[val].add(len(self.randlist) - 1)\\n return toReturn\\n\\n def remove(self, val: int) -> bool:\\n toReturn = True\\n if val not in self.nodes: return False\\n \\n # remove from linked list\\n node = self.nodes[val].pop()\\n self.removeNode(node)\\n if len(self.nodes[val]) == 0: self.nodes.pop(val)\\n\\n # remove from randlist\\n pos = self.randlistpos[val].pop()\\n lastval = self.randlist[-1]\\n self.randlist[pos], self.randlist[-1] = self.randlist[-1], self.randlist[pos]\\n self.randlistpos[lastval].discard(len(self.randlist) - 1) # this will silently fail if one element\\n self.randlistpos[lastval].add(pos)\\n\\n self.randlist.pop()\\n if len(self.randlistpos[val]) == 0: self.randlistpos.pop(val)\\n return toReturn\\n\\n def getRandom(self) -> int:\\n if not self.randlist:\\n raise ValueError(\\\"Set is empty\\\")\\n return random.choice(self.randlist)\\n \\n def getOldest(self) -> int:\\n if self.head.next == self.tail:\\n raise ValueError(\\\"Set is empty\\\")\\n return self.head.next.val\\n \\n def getNewest(self) -> int:\\n if self.tail.prev == self.head:\\n raise ValueError(\\\"Set is empty\\\")\\n return self.tail.prev.val\",\n \"runtime\": \"291\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.numbers = []\\n self.indexes = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n in_list = not (val in self.indexes)\\n self.numbers.append(val)\\n self.indexes.setdefault(val,set())\\n self.indexes[val].add(len(self.numbers)-1)\\n return in_list\\n\\n def remove(self, val: int) -> bool:\\n if val in self.indexes:\\n index = self.indexes[val].pop() # I get an index for the item to remove\\n if len(self.indexes[val]) == 0:\\n del self.indexes[val]\\n\\n last_value = self.numbers[-1]\\n if index != len(self.numbers) - 1: #In case we try to remove the last item, no swap required! \\n self.indexes[last_value].remove(len(self.numbers) - 1) # I remove the last number index in the map\\n self.indexes[last_value].add(index) # And I update the set with the new position\\n self.numbers[index] = last_value\\n\\n self.numbers.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.numbers)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"291\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.vals=[]\\n self.indices={}#to store indices of each element\\n\\n def insert(self, val: int) -> bool:\\n self.vals.append(val)\\n if val in self.indices:\\n self.indices[val].add(len(self.vals)-1)\\n return False\\n else:\\n self.indices[val]={len(self.vals)-1}\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.indices:\\n return False\\n\\n index=self.indices[val].pop()\\n last_val=self.vals[-1]\\n if index!=len(self.vals)-1:\\n self.vals[index]=last_val \\n self.indices[last_val].discard(len(self.vals)-1)\\n self.indices[last_val].add(index)\\n\\n self.vals.pop()\\n if not self.indices[val]:\\n del self.indices[val] \\n\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.vals)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"298\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.collection = []\\n self.placement = {}\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.placement:\\n if val not in self.placement:\\n self.placement[val] = set()\\n self.placement[val].add(len(self.collection))\\n self.collection.append(val)\\n return True\\n else:\\n if val not in self.placement:\\n self.placement[val] = set()\\n self.placement[val].add(len(self.collection))\\n self.collection.append(val)\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.placement and self.placement[val]:\\n removal = self.placement[val].pop()\\n replace = self.collection[-1]\\n \\n # swap last val placement with thing to remove in dict\\n self.collection[removal] = replace\\n\\n if removal != (len(self.collection) - 1):\\n # swap last val placement with thing to remove in list\\n self.placement[replace].remove(len(self.collection) - 1)\\n self.placement[replace].add(removal)\\n\\n self.collection.pop()\\n \\n if not self.placement[val]:\\n del self.placement[val]\\n\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.collection[random.randint(0, len(self.collection) - 1)]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"298\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.dict = {}\\n #key is the number, and value is a list [set of indices in nums, occurrences]\\n self.nums = []\\n #list of numbers inserted\\n \\n def insert(self, val: int) -> bool:\\n self.nums.append(val)\\n if val in self.dict:\\n self.dict[val].add(len(self.nums)-1)\\n return False\\n else:\\n self.dict[val] = {len(self.nums)-1}\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.dict:\\n return False\\n\\n index = self.dict[val].pop()\\n last_val = self.nums[-1]\\n\\n if(last_val != val):\\n self.nums[index] = last_val\\n self.dict[last_val].discard(len(self.nums)-1)\\n self.dict[last_val].add(index)\\n self.nums.pop()\\n else:\\n self.dict[val].add(index)\\n self.dict[val].discard(len(self.nums)-1)\\n self.nums.pop()\\n\\n if len(self.dict[val])==0:\\n del self.dict[val]\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return self.nums[random.randint(0, len(self.nums)-1)]\\n\\n \\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.map = defaultdict(set)\\n self.arr = []\\n self.index = 0\\n\\n def insert(self, val: int) -> bool:\\n valid = False\\n if val not in self.map or len(self.map[val]) == 0:\\n valid = True\\n\\n self.map[val].add(self.index)\\n self.arr.append(val)\\n self.index+=1\\n\\n return valid\\n\\n\\n\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.map or len(self.map[val]) == 0:\\n return False\\n \\n \\n last_value = self.arr[self.index-1] \\n index_remove = self.map[val].pop()\\n self.arr[index_remove], self.arr[self.index-1] = self.arr[self.index-1], self.arr[index_remove]\\n self.arr.pop()\\n \\n \\n self.map[last_value].add(index_remove) \\n self.map[last_value].remove(self.index-1)\\n \\n \\n self.index-=1\\n \\n return True\\n\\n def getRandom(self) -> int:\\n if self.arr:\\n random_integer = random.randint(0, len(self.arr)-1)\\n return self.arr[random_integer]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"import random\\nfrom collections import defaultdict\\nclass DLLNode:\\n def __init__(self, val: int):\\n self.val = val\\n self.next = None\\n self.prev = None\\n\\nclass RandomizedCollection:\\n def __init__(self):\\n # linked list\\n self.head = DLLNode(None)\\n self.tail = DLLNode(None)\\n self.head.next = self.tail\\n self.tail.prev = self.head\\n self.nodes = defaultdict(list)\\n\\n # for getrandom\\n self.randlist = []\\n self.randlistpos = defaultdict(set)\\n \\n def appendNode(self, node: DLLNode) -> None:\\n node.next = self.tail\\n node.prev = self.tail.prev\\n self.tail.prev.next = node\\n self.tail.prev = node\\n \\n def removeNode(self, node: DLLNode) -> None:\\n node.prev.next = node.next\\n node.next.prev = node.prev\\n\\n def insert(self, val: int) -> bool:\\n toReturn = True\\n if val in self.nodes: toReturn = False\\n\\n # insert in linked list\\n newNode = DLLNode(val)\\n self.nodes[val].append(newNode)\\n self.appendNode(newNode)\\n\\n # insert in randlist\\n self.randlist.append(val)\\n self.randlistpos[val].add(len(self.randlist) - 1)\\n return toReturn\\n\\n def remove(self, val: int) -> bool:\\n toReturn = True\\n if val not in self.nodes: return False\\n \\n # remove from linked list\\n node = self.nodes[val].pop()\\n self.removeNode(node)\\n if len(self.nodes[val]) == 0: self.nodes.pop(val)\\n\\n # remove from randlist\\n pos = self.randlistpos[val].pop()\\n lastval = self.randlist[-1]\\n if pos != len(self.randlist) - 1:\\n self.randlist[pos], self.randlist[-1] = self.randlist[-1], self.randlist[pos]\\n self.randlistpos[lastval].discard(len(self.randlist) - 1)\\n self.randlistpos[lastval].add(pos)\\n\\n self.randlist.pop()\\n if len(self.randlistpos[val]) == 0: self.randlistpos.pop(val)\\n return toReturn\\n\\n def getRandom(self) -> int:\\n if not self.randlist:\\n raise ValueError(\\\"Set is empty\\\")\\n return random.choice(self.randlist)\\n \\n def getOldest(self) -> int:\\n if self.head.next == self.tail:\\n raise ValueError(\\\"Set is empty\\\")\\n return self.head.next.val\\n \\n def getNewest(self) -> int:\\n if self.tail.prev == self.head:\\n raise ValueError(\\\"Set is empty\\\")\\n return self.tail.prev.val\",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.map = defaultdict(set)\\n self.arr = []\\n self.index = 0\\n\\n def insert(self, val: int) -> bool:\\n valid = False\\n if val not in self.map or len(self.map[val]) == 0:\\n valid = True\\n\\n self.map[val].add(self.index)\\n self.arr.append(val)\\n self.index+=1\\n\\n return valid\\n\\n\\n\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.map or len(self.map[val]) == 0:\\n return False\\n \\n \\n last_value = self.arr[self.index-1] \\n index_remove = self.map[val].pop()\\n self.arr[index_remove], self.arr[self.index-1] = self.arr[self.index-1], self.arr[index_remove]\\n self.arr.pop()\\n \\n\\n if self.index-1 != index_remove:\\n self.map[last_value].remove(self.index-1)\\n self.map[last_value].add(index_remove)\\n \\n self.index-=1\\n \\n return True\\n\\n def getRandom(self) -> int:\\n if self.arr:\\n random_integer = random.randint(0, len(self.arr)-1)\\n return self.arr[random_integer]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"312\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.m = defaultdict(list)\\n self.l = [] # [value, index]\\n\\n def insert(self, val: int) -> bool:\\n res = True\\n if val in self.m and len(self.m[val]) > 0:\\n res = False\\n self.m[val].append(len(self.l))\\n self.l.append([val, len(self.m[val]) - 1]) \\n return res\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.m or len(self.m[val]) == 0:\\n return False\\n \\n # delete val from list (require swap)\\n cur_i = self.m[val][-1]\\n\\n if cur_i == len(self.l) - 1:\\n self.m[val].pop()\\n self.l.pop()\\n return True\\n\\n last = self.l[-1]\\n self.m[last[0]][last[1]] = cur_i\\n self.l[cur_i] = self.l[-1]\\n self.l.pop()\\n self.m[val].pop()\\n \\n \\n return True\\n\\n\\n def getRandom(self) -> int:\\n n = random.randrange(0, len(self.l))\\n return self.l[n][0]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"319\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d = defaultdict(int)\\n self.li=[]\\n\\n def insert(self, val: int) -> bool:\\n self.li.append(val)\\n self.d[val]+=1\\n if self.d[val]!=1:\\n return False\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if self.d[val]!=0:\\n self.li.remove(val)\\n self.d[val]-=1\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.li)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"319\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d=defaultdict(int)\\n self.li=[]\\n \\n\\n def insert(self, val: int) -> bool:\\n self.li.append(val)\\n self.d[val]+=1\\n if self.d[val]!=1:\\n return False\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.d[val]!=0:\\n self.li.remove(val)\\n self.d[val]-=1\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.li)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.record = defaultdict(set)\\n self.arr = []\\n \\n\\n def insert(self, val: int) -> bool:\\n ret = False\\n if val not in self.record:\\n ret = True \\n idx = len(self.arr)\\n self.record[val].add(idx)\\n self.arr.append(val)\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n ret = False\\n if val in self.record:\\n # 先找出 被remove元素的一个index\\n idxToRemove = self.record[val].pop()\\n # 最后一个元素的index\\n lastIdx = len(self.arr)-1\\n if idxToRemove != lastIdx:\\n # 交换位置\\n lastVal = self.arr[lastIdx]\\n # 交换set里的index\\n self.record[lastVal].remove(lastIdx)\\n self.record[lastVal].add(idxToRemove) \\n self.arr[idxToRemove] = lastVal\\n \\n self.arr.pop()\\n if len(self.record[val]) == 0:\\n del(self.record[val])\\n ret = True\\n\\n return ret\\n\\n def getRandom(self) -> int:\\n idx = random.randint(0, len(self.arr)-1)\\n return self.arr[idx]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"326\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.m = {}\\n self.keys = []\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.m:\\n self.m[val] = []\\n ret = len(self.m[val]) == 0\\n self.keys.append(val) \\n self.m[val].append(len(self.keys) - 1)\\n # print(self.m, self.keys)\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n print(f'remove{val}')\\n if val not in self.m or len(self.m[val]) == 0:\\n return False\\n index = self.m[val].pop()\\n # print(f'index{index}')\\n if index == len(self.keys) - 1:\\n self.keys.pop()\\n else:\\n last = self.keys.pop()\\n self.keys[index] = last\\n self.m[last][len(self.m[last]) - 1] = index\\n self.m[last].sort()\\n\\n # print(self.m, self.keys)\\n return True \\n\\n def getRandom(self) -> int:\\n return self.keys[random.randint(0, len(self.keys) - 1)]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"332\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n def __init__(self):\\n self.counts_table = dict()\\n self.values_pool, self.pool_size = [], 0\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.counts_table.keys():\\n self.counts_table.update({val: 0})\\n self.counts_table[val] += 1\\n\\n self.values_pool.append(val)\\n self.pool_size += 1\\n return self.counts_table[val] == 1\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.counts_table.keys():\\n return False\\n if self.counts_table[val] == 0:\\n return False\\n \\n self.counts_table[val] -= 1\\n self.values_pool.remove(val)\\n self.pool_size -= 1\\n return True\\n \\n def getRandom(self) -> int:\\n return self.values_pool[random.randrange(self.pool_size)]\\n\",\n \"runtime\": \"332\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d=defaultdict(int)\\n self.li=[]\\n \\n def insert(self, val: int) -> bool:\\n self.li.append(val)\\n self.d[val]+=1\\n if self.d[val]!=1:\\n return False\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.d[val]!=0:\\n self.li.remove(val)\\n self.d[val]-=1\\n return True\\n return False\\n \\n def getRandom(self) -> int:\\n return random.choice(self.li)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"339\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n def __init__(self):\\n self.vals = []\\n self.valToIndices = collections.defaultdict(list)\\n\\n def insert(self, val: int) -> bool:\\n self.valToIndices[val].append(len(self.vals))\\n self.vals.append([val, len(self.valToIndices[val]) - 1])\\n return len(self.valToIndices[val]) == 1\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.valToIndices or self.valToIndices[val] == []:\\n return False\\n\\n index = self.valToIndices[val][-1]\\n self.valToIndices[self.vals[-1][0]][self.vals[-1][1]] = index\\n self.valToIndices[val].pop()\\n self.vals[index] = self.vals[-1]\\n self.vals.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n index = random.randint(0, len(self.vals) - 1)\\n return self.vals[index][0]\",\n \"runtime\": \"339\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.vals=[]\\n self.valToIndices=collections.defaultdict(list)\\n def insert(self, val: int) -> bool:\\n self.valToIndices[val].append(len(self.vals))\\n self.vals.append([val,len(self.valToIndices[val])-1])\\n return len(self.valToIndices[val])==1\\n def remove(self, val: int) -> bool:\\n if val not in self.valToIndices or self.valToIndices[val]==[]:\\n return False\\n index=self.valToIndices[val][-1]\\n self.valToIndices[self.vals[-1][0]][self.vals[-1][1]]=index\\n self.valToIndices[val].pop()\\n self.vals[index] = self.vals[-1]\\n self.vals.pop()\\n return True\\n def getRandom(self) -> int:\\n index=random.randint(0,len(self.vals)-1)\\n return self.vals[index][0]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"346\"\n },\n {\n \"code\": \"from random import randint\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.mpp = {}\\n self.arr = []\\n\\n def insert(self, val: int) -> bool:\\n ans = val not in self.mpp\\n if not ans:\\n self.mpp[val] += 1\\n else:\\n self.mpp[val] = 1\\n self.arr.append(val)\\n return ans\\n\\n def remove(self, val: int) -> bool:\\n ans = val in self.mpp\\n if ans:\\n self.mpp[val] -= 1\\n self.arr.remove(val)\\n\\n if self.mpp[val] == 0:\\n del self.mpp[val]\\n\\n return ans\\n\\n def getRandom(self) -> int:\\n return self.arr[randint(0,len(self.arr)-1)]\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"346\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.vals = []\\n self.db = {}\\n\\n\\n def insert(self, val: int) -> bool:\\n self.vals.append(val)\\n if val in self.db:\\n self.db[val].add(len(self.vals) - 1)\\n else:\\n self.db[val] = {len(self.vals) - 1}\\n \\n return len(self.db[val]) == 1\\n\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.vals:\\n return False\\n \\n print(f\\\"removing {val}\\\")\\n last_index = self.db[val].pop()\\n last_val = self.vals[-1]\\n\\n if last_index != len(self.vals) - 1:\\n self.vals[last_index] = last_val\\n self.db[last_val].discard(len(self.vals) - 1)\\n self.db[last_val].add(last_index)\\n \\n self.vals.pop()\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.vals)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"353\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.pool = []\\n self.value_index = defaultdict(list)\\n\\n def insert(self, val: int) -> bool:\\n self.value_index[val].append(len(self.pool))\\n self.pool.append((val,len(self.value_index[val])-1))\\n return len(self.value_index.get(val)) == 1\\n\\n def remove(self, val: int) -> bool:\\n if not self.value_index[val]:\\n return False\\n\\n remove_idx = self.value_index[val][-1]\\n last_element = self.pool[-1]\\n self.value_index[last_element[0]][last_element[1]] = remove_idx\\n self.pool[remove_idx] = self.pool[-1]\\n self.value_index[val].pop()\\n self.pool.pop()\\n\\n return True\\n\\n def getRandom(self) -> int:\\n random_idx = random.randint(0, len(self.pool) - 1)\\n return self.pool[random_idx][0]\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\\n\",\n \"runtime\": \"360\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.n = 0\\n self.num_map = {}\\n self.nums = []\\n\\n def insert(self, val: int) -> bool:\\n not_present = False\\n if val not in self.num_map:\\n self.num_map[val] = set()\\n not_present = True\\n\\n self.nums.append(val) # add value to list\\n self.num_map[val].add(self.n)\\n self.n += 1\\n\\n return not_present\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.num_map:\\n return False\\n\\n index_remove = next(iter(self.num_map[val]))\\n self.num_map[val].remove(index_remove)\\n self.nums[index_remove] = self.nums[-1]\\n end_val = self.nums[-1]\\n if self.n-1 in self.num_map[end_val]:\\n self.num_map[end_val].remove(self.n-1)\\n self.num_map[end_val].add(index_remove)\\n self.nums.pop(-1)\\n self.n -= 1\\n\\n if len(self.num_map[val]) == 0:\\n del self.num_map[val]\\n\\n return True\\n \\n\\n def getRandom(self) -> int:\\n return random.sample(self.nums, 1)[0]\",\n \"runtime\": \"381\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport random\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.arr=SortedList([])\\n self.dc=defaultdict(lambda:0)\\n\\n def insert(self, val: int) -> bool:\\n self.arr.add(val)\\n self.dc[val]+=1\\n return self.dc[val]==1\\n def remove(self, val: int) -> bool:\\n if(self.dc[val]>0):\\n self.arr.discard(val)\\n self.dc[val]-=1\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.arr)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"388\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.dict = {}\\n self.array = SortedList()\\n \\n\\n def insert(self, val: int) -> bool:\\n exists = val in self.dict\\n self.dict[val] = self.dict.get(val, 0) + 1\\n self.array.add(val)\\n return not exists\\n\\n def remove(self, val: int) -> bool:\\n exists = val in self.dict\\n if exists:\\n self.dict[val] -= 1\\n if self.dict[val] == 0:\\n del self.dict[val]\\n self.array.remove(val)\\n return exists\\n\\n def getRandom(self) -> int:\\n return random.choice(self.array)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"395\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\nimport random\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.arr=SortedList([])\\n self.dict=defaultdict(lambda:0)\\n\\n def insert(self, val: int) -> bool:\\n self.arr.add(val)\\n self.dict[val]+=1\\n return self.dict[val]==1\\n \\n def remove(self, val: int) -> bool:\\n if(self.dict[val]>0):\\n self.arr.discard(val)\\n self.dict[val]-=1\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.arr)\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"401\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass RandomizedCollection:\\n vals: List[int]\\n indexes: dict[int, int]\\n\\n def __init__(self):\\n # getRandom: list O(1)\\n # check present: map: number -> index\\n # swap with the last element if remove\\n self.vals: List[int] = []\\n self.indexes = defaultdict(set)\\n \\n def insert(self, val: int) -> bool:\\n notPresent = val not in self.indexes\\n self.indexes[val].add(len(self.vals))\\n self.vals.append(val)\\n return notPresent\\n \\n def remove(self, val: int) -> bool:\\n if val not in self.indexes:\\n return False\\n indexes = self.indexes[val]\\n index = next(iter(indexes))\\n self.vals[index], self.vals[-1] = self.vals[-1], self.vals[index]\\n \\n if len(self.indexes[val]) == 1:\\n del self.indexes[val]\\n else:\\n self.indexes[val].remove(index)\\n self.vals.pop()\\n\\n if index < len(self.vals):\\n updateVal = self.vals[index]\\n self.indexes[updateVal].add(index)\\n self.indexes[updateVal].remove(len(self.vals))\\n return True\\n\\n def getRandom(self) -> int:\\n return random.sample(self.vals, 1)[0]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"408\"\n },\n {\n \"code\": \"from sortedcontainers import SortedList\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.sl = SortedList() \\n\\n def insert(self, val: int) -> bool:\\n idx = self.sl.bisect_left(val)\\n ret = idx < len(self.sl) and self.sl[idx] == val\\n self.sl.add(val)\\n return not ret\\n\\n def remove(self, val: int) -> bool:\\n idx = self.sl.bisect_left(val)\\n if idx >= len(self.sl) or self.sl[idx] != val:\\n return False\\n self.sl.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n idx = random.randrange(0, len(self.sl))\\n return self.sl[idx]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"415\"\n },\n {\n \"code\": \"import random\\n\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.data = {}\\n self.list_data = []\\n\\n def insert(self, val: int) -> bool:\\n entry = self.data.get(val)\\n retval = entry is None\\n insertion_index = len(self.list_data)\\n\\n if not entry:\\n entry = []\\n \\n self.list_data.append(val)\\n entry.append(insertion_index)\\n self.data[val] = entry\\n return retval\\n\\n def remove(self, val: int) -> bool:\\n entry = self.data.get(val)\\n retval = entry is not None\\n\\n if entry:\\n assert len(entry) > 0\\n index_to_remove = entry.pop()\\n last_element = self.list_data[-1]\\n last_index = len(self.list_data) - 1\\n\\n if index_to_remove != last_index:\\n self.list_data[index_to_remove] = last_element\\n replacement_entry = self.data[last_element]\\n replacement_entry[replacement_entry.index(last_index)] = index_to_remove\\n self.data[last_element] = replacement_entry\\n \\n if len(entry) == 0:\\n self.data.pop(val)\\n else:\\n self.data[val] = entry\\n \\n self.list_data.pop()\\n return retval\\n\\n def getRandom(self) -> int:\\n return random.sample(self.list_data, k=1)[0]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"422\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\nimport random\\n\\nfrom queue import PriorityQueue\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.fq_map = SortedDict()\\n self.list_version = [] \\n\\n\\n def _verbose(self):\\n for key, value in self.fq_map.items():\\n print(key, value.queue)\\n print(self.list_version)\\n\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.fq_map or self.fq_map[val].empty():\\n self.fq_map[val] = PriorityQueue()\\n self.fq_map[val].put(-len(self.list_version))\\n self.list_version.append(val)\\n # self._verbose()\\n return True\\n else:\\n self.fq_map[val].put(-len(self.list_version))\\n self.list_version.append(val)\\n # self._verbose()\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n if val not in self.fq_map or self.fq_map[val].empty():\\n # self._verbose()\\n return False\\n \\n \\n replacement_index = -self.fq_map[val].get()\\n last_item = self.list_version[-1]\\n\\n # print(\\\"stuck here?\\\")\\n # return True\\n \\n \\n # update stuff\\n self.list_version[replacement_index] = last_item\\n # print(\\\"pre?\\\")\\n # return True\\n if last_item != val:\\n # for when the last item IS the one we want to remove \\n foo = self.fq_map[last_item].get(False) # should always be the last index by definition\\n # print(f\\\"remove halfway {foo}\\\")\\n # self._verbose()\\n # return True\\n self.fq_map[last_item].put(-replacement_index) # what the hell, fix this this \\n # self.fq_map[val] = self.fq_map[val][:-1] # already done earlier \\n self.list_version = self.list_version[:-1]\\n\\n\\n # self._verbose()\\n return True\\n\\n def getRandom(self) -> int:\\n random_int = random.randint(0, len(self.list_version) - 1)\\n\\n # self._verbose()\\n return self.list_version[random_int]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"429\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.randomized_dict=dict()\\n self.need_construct=True\\n self.random_list=[]\\n \\n\\n def insert(self, val: int) -> bool:\\n self.need_construct=True\\n if self.randomized_dict.get(val) is None:\\n self.randomized_dict[val]=1\\n return True\\n else:\\n self.randomized_dict[val]+=1\\n return False\\n\\n def remove(self, val: int) -> bool:\\n self.need_construct=True\\n if self.randomized_dict.get(val) != None:\\n self.randomized_dict[val]-=1\\n if self.randomized_dict[val]==0:\\n self.randomized_dict.pop(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n if(self.need_construct==True):\\n self.construct_list()\\n self.need_construct=False\\n return random.choice(self.random_list)\\n # return random.choices(list(self.randomized_dict.keys()), weights=list(self.randomized_dict.values()))[0]\\n # iterators = [itertools.repeat(key, value) for key, value in self.randomized_dict.items()]\\n # return random.choice(list(itertools.chain.from_iterable(iterators))) \\n\\n\\n def construct_list(self)-> None:\\n self.random_list= [key for key, value in self.randomized_dict.items() for _ in range(value)]\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"436\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.c = Counter()\\n self.nb = 0\\n self.s = []\\n self.cal = True\\n\\n def insert(self, val: int) -> bool:\\n self.cal = True\\n if val in self.c.keys():\\n self.c[val] += 1\\n self.nb += 1\\n return False\\n else : \\n self.c[val] = 1\\n self.nb += 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n self.cal = True\\n if val in self.c.keys():\\n self.c[val] -= 1\\n self.nb -= 1\\n if self.c[val] == 0:\\n del self.c[val]\\n\\n return True\\n \\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n i = random.randint(0,self.nb-1)\\n if self.cal :\\n self.s = list(self.c.elements())\\n self.cal = False\\n return self.s[i]\\n \\n\\n\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"443\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"450\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"457\"\n },\n {\n \"code\": \"import random\\nimport collections\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = [] # actual list\\n self.numsDict = collections.defaultdict(set)\\n # keeps track of value and idx in nums\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.nums:\\n ret = True\\n else:\\n ret = False\\n self.nums.append(val)\\n self.numsDict[val].add(len(self.nums)-1)\\n\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n if val in self.nums:\\n idx = self.numsDict[val].pop()\\n self.nums[idx] = self.nums[-1]\\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\\n self.numsDict[self.nums[idx]].add(idx)\\n self.nums.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nums)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"464\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.multiset = []\\n\\n def insert(self, val: int) -> bool:\\n res = True\\n if val in self.multiset:\\n res = False\\n self.multiset.append(val)\\n return res\\n\\n def remove(self, val: int) -> bool:\\n if val in self.multiset:\\n self.multiset.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.multiset)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"470\"\n },\n {\n \"code\": \"from dataclasses import dataclass\\nfrom random import choice\\nfrom typing import NewType\\n\\n\\nAmount = NewType(\\\"Amount\\\", int)\\nValue = NewType(\\\"Value\\\", int)\\n\\nNO_AMOUNT = Amount(0)\\n\\n\\n@dataclass\\nclass Cache:\\n values: list[Value]\\n\\n\\nclass RandomizedCollection:\\n def __init__(self):\\n self._items = dict[Value, Amount]()\\n self._cache = None\\n\\n def insert(self, val: Value) -> bool:\\n self._items[val] = Amount((amount := self._items.get(val, NO_AMOUNT)) + 1)\\n self._cache = None\\n return amount == NO_AMOUNT\\n\\n def remove(self, val: Value) -> bool:\\n if (amount := self._items.get(val)) is None:\\n return False\\n new_amount = Amount(amount - 1)\\n if new_amount == NO_AMOUNT:\\n del self._items[val]\\n else:\\n self._items[val] = new_amount\\n self._cache = None\\n return True\\n\\n def _buildCache(self) -> Cache:\\n if (cache := self._cache) is not None:\\n return cache\\n values = list[Value]()\\n for value, weight in self._items.items():\\n for _ in range(weight):\\n values.append(value)\\n self._cache = (cache := Cache(values))\\n return cache\\n\\n def getRandom(self) -> Value:\\n cache = self._buildCache()\\n return choice(cache.values)\\n\",\n \"runtime\": \"477\"\n },\n {\n \"code\": \"import random\\nimport collections\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = [] # actual list\\n self.numsDict = collections.defaultdict(set)\\n # keeps track of value and idx in nums\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.nums:\\n ret = True\\n else:\\n ret = False\\n self.nums.append(val)\\n self.numsDict[val].add(len(self.nums)-1)\\n\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n if val in self.nums:\\n idx = self.numsDict[val].pop()\\n self.nums[idx] = self.nums[-1]\\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\\n self.numsDict[self.nums[idx]].add(idx)\\n self.nums.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nums)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"484\"\n },\n {\n \"code\": \"import random\\nimport collections\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = [] # actual list\\n self.numsDict = collections.defaultdict(set)\\n # keeps track of value and idx in nums\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.nums:\\n ret = True\\n else:\\n ret = False\\n self.nums.append(val)\\n self.numsDict[val].add(len(self.nums)-1)\\n\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n if val in self.nums:\\n idx = self.numsDict[val].pop()\\n self.nums[idx] = self.nums[-1]\\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\\n self.numsDict[self.nums[idx]].add(idx)\\n self.nums.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nums)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"491\"\n },\n {\n \"code\": \"import random\\n\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.multiset = []\\n \\n\\n def insert(self, val: int) -> bool:\\n res = True\\n if val in self.multiset:\\n res = False\\n self.multiset.append(val)\\n return res\\n\\n def remove(self, val: int) -> bool:\\n if val in self.multiset:\\n self.multiset.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.multiset)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"498\"\n },\n {\n \"code\": \"import random\\nimport collections\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = [] # actual list\\n self.numsDict = collections.defaultdict(set)\\n # keeps track of value and idx in nums\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.nums:\\n ret = True\\n else:\\n ret = False\\n self.nums.append(val)\\n self.numsDict[val].add(len(self.nums)-1)\\n\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n if val in self.nums:\\n idx = self.numsDict[val].pop()\\n #if idx != len(self.nums) - 1:\\n self.nums[idx] = self.nums[-1]\\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\\n self.numsDict[self.nums[idx]].add(idx)\\n self.nums.pop()\\n\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nums)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"505\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection:\\n def __init__(self):\\n self.collection=[]\\n # self.collection_without_duplicates=[]\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.collection:\\n self.collection.append(val)\\n # self.collection_without_duplicates.append(val)\\n return True\\n else:\\n self.collection.append(val)\\n return False\\n def remove(self, val: int) -> bool:\\n if val not in self.collection:\\n return False\\n self.collection.remove(val)\\n #if val not in self.collection:\\n # self.collection_without_duplicates.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.collection)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"512\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.items=[]\\n \\n def insert(self, val: int) -> bool:\\n \\n \\n flag=True\\n if val in self.items:\\n flag=False\\n\\n self.items.append(val)\\n\\n \\n return flag\\n\\n \\n\\n def remove(self, val: int) -> bool:\\n \\n if val in self.items:\\n self.items.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.items)\\n \\n\\n\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"519\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"526\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"533\"\n },\n {\n \"code\": \"import random\\nimport collections\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.nums = [] # actual list\\n self.numsDict = collections.defaultdict(set)\\n # keeps track of value and idx in nums\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.nums:\\n ret = True\\n else:\\n ret = False\\n self.nums.append(val)\\n self.numsDict[val].add(len(self.nums)-1)\\n\\n return ret\\n\\n def remove(self, val: int) -> bool:\\n if val in self.nums:\\n idx = self.numsDict[val].pop()\\n if idx != len(self.nums) - 1:\\n self.nums[idx] = self.nums[-1]\\n \\n self.numsDict[self.nums[idx]].discard(len(self.nums)-1)\\n self.numsDict[self.nums[idx]].add(idx)\\n self.nums.pop()\\n\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nums)\\n \\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"539\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.collection = []\\n self.count = 0\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.collection:\\n self.collection.append(val)\\n self.count+=1\\n return True\\n else:\\n self.collection.append(val)\\n self.count+=1\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.collection:\\n self.collection.remove(val)\\n self.count -= 1\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.collection[random.randint(0, self.count - 1)]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"546\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.data = []\\n \\n\\n def insert(self, val: int) -> bool:\\n if val in self.data:\\n self.data.append(val)\\n return False\\n else:\\n self.data.append(val)\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n try:\\n i = self.data.index(val)\\n self.data.pop(i)\\n return True\\n except ValueError:\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.data)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"553\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.values = list()\\n \\n\\n def insert(self, val: int) -> bool:\\n match = val not in self.values\\n self.values.append(val)\\n return match\\n\\n def remove(self, val: int) -> bool:\\n if val in self.values:\\n self.values.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"560\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"567\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.s = []\\n\\n def insert(self, val: int) -> bool:\\n already_present = val in self.s\\n self.s.append(val)\\n return not already_present\\n\\n def remove(self, val: int) -> bool:\\n if val in self.s:\\n self.s.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.s)\\n\",\n \"runtime\": \"574\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"581\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection(object):\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.s = []\\n \\n\\n def insert(self, val):\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.append(val)\\n return False\\n else:\\n self.s.append(val)\\n return True \\n \\n\\n def remove(self, val):\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n :type val: int\\n :rtype: bool\\n \\\"\\\"\\\"\\n if val in self.s:\\n self.s.remove(val)\\n return True \\n else:\\n return False\\n\\n def getRandom(self):\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n :rtype: int\\n \\\"\\\"\\\"\\n index = int(random.random() * len(self.s))\\n return self.s[index]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"588\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.container = []\\n\\n def insert(self, val: int) -> bool:\\n present = val not in self.container\\n self.container.append(val)\\n return present\\n\\n def remove(self, val: int) -> bool:\\n if val in self.container:\\n self.container.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return choice(self.container)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"595\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.arr=[]\\n\\n def insert(self, val: int) -> bool:\\n k=True\\n if val in self.arr:\\n k=False\\n self.arr.append(val)\\n return k\\n\\n def remove(self, val: int) -> bool:\\n k=False\\n if val in self.arr:\\n self.arr.remove(val)\\n k=True\\n return k\\n\\n def getRandom(self) -> int:\\n return random.choice(self.arr)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"602\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.lst=[]\\n\\n def insert(self, val: int) -> bool:\\n value= val not in self.lst\\n self.lst.append(val)\\n return value\\n \\n\\n def remove(self, val: int) -> bool:\\n value= val in self.lst\\n if value:\\n self.lst.remove(val)\\n return value \\n\\n def getRandom(self) -> int:\\n return random.choice(self.lst)\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"608\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.container = []\\n\\n def insert(self, val: int) -> bool:\\n present = val not in self.container\\n self.container.append(val)\\n return present\\n\\n def remove(self, val: int) -> bool:\\n if val in self.container:\\n self.container.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return choice(self.container)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"615\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.a = []\\n \\n def insert(self, val: int) -> bool:\\n if val in self.a:\\n self.a.append(val)\\n return 0\\n self.a.append(val)\\n return 1\\n\\n def remove(self, val: int) -> bool:\\n if val in self.a:\\n self.a.remove(val)\\n return 1\\n return 0\\n \\n def getRandom(self) -> int:\\n return random.choice(self.a)\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"622\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.values = list()\\n\\n def insert(self, val: int) -> bool:\\n match = val not in self.values\\n self.values.append(val)\\n return match\\n\\n def remove(self, val: int) -> bool:\\n if val in self.values:\\n self.values.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"629\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.lst = []\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.lst:\\n self.lst.append(val)\\n return True\\n else:\\n self.lst.append(val)\\n return False \\n\\n def remove(self, val: int) -> bool:\\n if val in self.lst:\\n self.lst.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n ind = random.randint(0, len(self.lst) - 1)\\n return self.lst[ind]\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"runtime\": \"636\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.elements = list()\\n def search(self,val):\\n return val in self.elements\\n\\n def insert(self, val: int) -> bool:\\n a=self.search(val)\\n self.elements.append(val)\\n return not a\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.elements:\\n return False\\n self.elements.remove(val)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.elements)\",\n \"runtime\": \"643\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":77,"string":"77"},"mm_list":{"kind":"list like","value":[{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.a = []\n\n def insert(self, val: int) -> bool:\n if val in self.a:\n self.a.append(val)\n return False\n else:\n self.a.append(val)\n return True\n \n def remove(self, val: int) -> bool:\n if val in self.a:\n self.a.remove(val)\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n if len(self.a)>0:\n return random.choice(self.a)\n else:\n return -1\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"66500"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.listt=[]\n import random\n\n def insert(self, val: int) -> bool:\n if val not in self.listt:\n self.listt.append(val)\n return True\n else:\n self.listt.append(val)\n return False\n \n\n def remove(self, val: int) -> bool:\n if val in self.listt:\n self.listt.remove(val)\n return True\n else:\n return False\n \n\n def getRandom(self) -> int:\n k=len(self.listt)\n index=random.randint(0,k-1)\n return self.listt[index]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"66600"},{"code":"import random\nclass RandomizedCollection:\n\n def __init__(self):\n self.set={}\n self.check=[]\n\n def insert(self, val: int) -> bool:\n if self.set.get(val,0):\n self.set[val]+=1\n self.check.append(val)\n return False\n self.set[val]=1\n self.check.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n \n if self.set.get(val,0):\n if self.set[val]>1:\n self.set[val]-=1\n else:\n del self.set[val]\n self.check.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n \n return random.choice(self.check)\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"66700"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.multiset = []\n\n def insert(self, val: int) -> bool:\n res = True\n if val in self.multiset:\n res = False\n self.multiset.append(val)\n return res\n\n def remove(self, val: int) -> bool:\n if val in self.multiset:\n self.multiset.remove(val)\n return True\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.multiset)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"66800"},{"code":"import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.collection = []\n self.count = 0\n \n\n def insert(self, val: int) -> bool:\n if val not in self.collection:\n self.collection.append(val)\n self.count+=1\n return True\n else:\n self.collection.append(val)\n self.count+=1\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.collection:\n self.collection.remove(val)\n self.count -= 1\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return self.collection[random.randint(0, self.count - 1)]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"66900"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.a=[]\n\n def insert(self, val: int) -> bool:\n print(val in self.a)\n if(val in self.a):\n self.a.append(val)\n return False\n else:\n self.a.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n try:\n self.a.remove(val)\n return True\n except:\n return False\n\n def getRandom(self) -> int:\n return self.a[random.randint(0, len(self.a)-1)]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"66900"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.a=[]\n\n def insert(self, val: int) -> bool:\n print(val in self.a)\n if(val in self.a):\n self.a.append(val)\n return False\n else:\n self.a.append(val)\n return True\n\n def remove(self, val: int) -> bool:\n try:\n self.a.remove(val)\n return True\n except:\n return False\n\n def getRandom(self) -> int:\n return self.a[random.randint(0, len(self.a)-1)]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67000"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d = defaultdict(int)\n self.l = []\n \n def insert(self, val: int) -> bool:\n self.l.append(val)\n self.d[val] += 1\n if self.d[val] != 1: return False\n return True\n\n def remove(self, val: int) -> bool:\n if self.d[val] != 0:\n self.l.remove(val)\n self.d[val] -= 1\n return True\n return False\n\n def getRandom(self) -> int: return random.choice(self.l)","memory":"67100"},{"code":"import random\nfrom collections import defaultdict\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.d = defaultdict(int)\n self.list = []\n \n \n\n def insert(self, val: int) -> bool:\n\n if val not in self.list:\n\n self.list.append(val)\n self.d[val] += 1\n return True\n self.list.append(val) # Still append to the list to allow duplicates\n self.d[val] += 1\n return False\n\n\n \n\n\n \n\n def remove(self, val: int) -> bool:\n if val in self.list:\n self.list.remove(val)\n self.d[val] -= 1\n if self.d[val] == 0:\n del self.d[val]\n return True\n return False\n\n \n \n\n def getRandom(self) -> int:\n\n if not self.list:\n raise IndexError(\"Cannot choose from an empty sequence\")\n return random.choice(self.list)\n\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67200"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d=defaultdict(int)\n self.li=[]\n \n\n def insert(self, val: int) -> bool:\n self.li.append(val)\n self.d[val]+=1\n if self.d[val]!=1:\n return False\n return True\n\n def remove(self, val: int) -> bool:\n if self.d[val]!=0:\n self.li.remove(val)\n self.d[val]-=1\n return True\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.li)\n \n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67300"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d = defaultdict(int)\n self.li=[]\n\n def insert(self, val: int) -> bool:\n self.li.append(val)\n self.d[val]+=1\n if self.d[val]!=1:\n return False\n return True\n \n\n def remove(self, val: int) -> bool:\n if self.d[val]!=0:\n self.li.remove(val)\n self.d[val]-=1\n return True\n return False\n \n\n def getRandom(self) -> int:\n return random.choice(self.li)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67300"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.c = Counter()\n self.nb = 0\n self.s = []\n self.cal = True\n\n def insert(self, val: int) -> bool:\n self.cal = True\n if val in self.c.keys():\n self.c[val] += 1\n self.nb += 1\n return False\n else : \n self.c[val] = 1\n self.nb += 1\n return True\n\n def remove(self, val: int) -> bool:\n self.cal = True\n if val in self.c.keys():\n self.c[val] -= 1\n self.nb -= 1\n if self.c[val] == 0:\n del self.c[val]\n\n return True\n \n else:\n return False\n\n def getRandom(self) -> int:\n i = random.randint(0,self.nb-1)\n if self.cal :\n self.s = list(self.c.elements())\n self.cal = False\n return self.s[i]\n \n\n\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67400"},{"code":"import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.list = []\n self.keys = {}\n\n def insert(self, val: int) -> bool:\n self.list.append(val)\n if val not in self.keys:\n self.keys[val] = [len(self.list) - 1]\n return True\n else :\n self.keys[val].append(len(self.list) - 1)\n return False\n\n def remove(self, val: int) -> bool:\n if val in self.keys:\n index = self.keys[val][-1]\n last_val = self.list[-1]\n # a\n # a:[3, 2, 7, 5]\n\n \n self.list[index] = last_val\n self.keys[last_val].sort()\n self.keys[last_val][-1] = index\n \n\n self.list.pop()\n self.keys[val].pop()\n if len(self.keys[val]) == 0:\n del self.keys[val]\n\n return True\n return False\n \n def getRandom(self) -> int:\n return random.choice(self.list)\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67600"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.index = dict()\n self.list = list()\n\n def insert(self, val: int) -> bool:\n retval = not val in self.index\n\n self.index.setdefault(val, list())\n self.index[val].append(len(self.list))\n\n self.list.append(val)\n\n return retval\n\n def remove(self, val: int) -> bool:\n if val in self.index:\n indexList = self.index[val]\n\n index = indexList.pop()\n\n if not indexList:\n del self.index[val]\n\n if index < len(self.list) - 1:\n endIndexList = self.index[self.list[-1]]\n\n for i in range(len(endIndexList)):\n if endIndexList[i] == len(self.list) - 1:\n endIndexList[i] = index\n break\n\n self.list[-1], self.list[index] = self.list[index], self.list[-1]\n\n self.list.pop()\n\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return self.list[random.randint(0, len(self.list) - 1)]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67700"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.vals = []\n self.ind_hash = collections.defaultdict(list)\n \n def insert(self, val: int) -> bool:\n ind = len(self.vals)\n self.vals.append(val)\n if val not in self.ind_hash:\n self.ind_hash[val] = [ind]\n return True\n else:\n self.ind_hash[val].append(ind)\n return False\n\n def remove(self, val: int) -> bool:\n if val not in self.ind_hash:\n return False\n \n # cur last elem\n last_ind = len(self.vals)-1\n last = self.vals[last_ind]\n # to del ind, the last one\n del_ind = self.ind_hash[val].pop()\n\n if len(self.ind_hash[val]) == 0:\n del self.ind_hash[val]\n\n # change ind\n if del_ind != last_ind:\n self.vals[del_ind] = last\n self.ind_hash[self.vals[del_ind]].remove(last_ind)\n self.ind_hash[self.vals[del_ind]].append(del_ind)\n # change num\n\n self.vals.pop()\n return True\n\n def getRandom(self) -> int:\n if self.vals:\n return self.vals[random.randint(0,len(self.vals)-1)]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67800"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.dict = {}\n self.list = []\n\n def insert(self, val: int) -> bool:\n idx = len(self.list)\n\n if val in self.dict:\n retval = False\n self.dict[val].append(idx)\n else:\n retval = True\n self.dict[val] = [idx]\n \n self.list.append(val)\n\n return retval\n\n\n def remove(self, val: int) -> bool:\n if val not in self.dict:\n return False\n\n if len(self.list) == 1:\n self.dict = {}\n self.list = []\n else:\n idx = self.dict[val].pop()\n endval = self.list[-1]\n\n self.list[idx] = endval\n if idx != len(self.list)-1:\n self.dict[endval].append(idx)\n self.dict[endval].remove(len(self.list)-1)\n\n if len(self.dict[val]) == 0:\n del self.dict[val]\n self.list.pop()\n\n return True\n\n\n def getRandom(self) -> int:\n return random.choice(self.list)\n\n\n# Your RandomizedSet object will be instantiated and called as such:\n# obj = RandomizedSet()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"67900"},{"code":"import random\nclass RandomizedCollection:\n def __init__(self):\n self.values = []\n self.value_to_indexes_map = {}\n\n def insert(self, val: int) -> bool:\n self.value_to_indexes_map.setdefault(val, []).append(len(self.values))\n self.values.append(val)\n return len(self.value_to_indexes_map[val]) == 1\n\n def remove(self, val: int) -> bool:\n indexes = self.value_to_indexes_map.get(val, [])\n if not indexes:\n return False\n\n index = indexes.pop()\n last_index = len(self.values) - 1\n if index == last_index:\n self.values.pop()\n return True\n\n last_val = self.values[last_index]\n self.values[index] = last_val\n self.values.pop()\n self.value_to_indexes_map[last_val].remove(last_index)\n self.value_to_indexes_map[last_val].append(index)\n return True\n\n def getRandom(self) -> int:\n index = random.randint(0, len(self.values) - 1)\n return self.values[index]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"68000"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n from collections import defaultdict\n self.list = []\n self.v2i = defaultdict(list)\n self.n = 0\n\n def insert(self, val: int) -> bool:\n exists = self.v2i[val] != []\n self.list.append(val)\n self.v2i[val].append(self.n)\n self.n += 1\n return not exists\n\n def remove(self, val: int) -> bool:\n exists = self.v2i[val] != []\n if exists:\n i = self.v2i[val].pop()\n if i != self.n - 1:\n v = self.list[self.n-1]\n self.list[i] = v\n self.v2i[v].remove(self.n-1)\n self.v2i[v].append(i)\n self.list.pop()\n self.n -= 1\n return exists\n\n\n def getRandom(self) -> int:\n return random.choice(self.list)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"68100"},{"code":"import random\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.values = []\n self.idxs_map = {}\n\n def insert(self, val: int) -> bool:\n self.values.append(val)\n val_idx = len(self.values) - 1\n if val in self.idxs_map:\n self.idxs_map[val].append(val_idx)\n # print('i', val, self.values, self.idxs_map)\n return False\n else:\n self.idxs_map[val] = [val_idx]\n # print('i', val, self.values, self.idxs_map)\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.idxs_map:\n return False\n \n # for each idx ri to remove\n # get the value pv at the end of the list\n # remove from the self.idxs_map[pv] the last index, and append the ri\n # set the value at ri to the value to preserve pv\n # pop the last item from values\n # now that all are removed, del the val from idxs_map\n ri = self.idxs_map[val].pop()\n pi = len(self.values) - 1\n pv = self.values[pi]\n # print({ 'pi': pi, 'pv': pv, 'ri': ri, 'val': val , 'idxs_map': self.idxs_map, 'values': self.values })\n self.idxs_map[pv].append(ri)\n self.idxs_map[pv].remove(pi)\n self.values[ri] = pv\n self.values.pop()\n if len(self.idxs_map[val]) == 0:\n del self.idxs_map[val]\n # print('r', val, self.values, self.idxs_map)\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"68200"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.set = []\n self.map = {}\n\n def insert(self, val: int) -> bool:\n ret = False\n if val in self.map:\n self.map[val].add(len(self.set))\n else:\n ret = True\n self.map[val] = {len(self.set)}\n self.set.append(val)\n return ret\n \n def remove(self, val: int) -> bool:\n if val in self.map:\n cur = self.map[val].pop()\n if not self.map[val]:\n del self.map[val]\n if len(self.set) > 1 and cur != len(self.set)-1:\n temp = self.set[-1]\n self.set[-1] = set[cur]\n self.set[cur] = temp\n self.map[temp].remove(len(self.set)-1)\n self.map[temp].add(cur)\n self.set.pop()\n return True\n else:\n return False\n\n def getRandom(self) -> int:\n return random.choice(self.set)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"68200"},{"code":"from collections import defaultdict\nfrom random import choice\n\nclass RandomizedCollection:\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.lst = []\n self.idx = defaultdict(set)\n\n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n \"\"\"\n self.idx[val].add(len(self.lst))\n self.lst.append(val)\n return len(self.idx[val]) == 1\n\n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n \"\"\"\n if not self.idx[val]: return False\n remove, last = self.idx[val].pop(), self.lst[-1]\n self.lst[remove] = last\n self.idx[last].add(remove)\n self.idx[last].discard(len(self.lst) - 1)\n\n self.lst.pop()\n return True\n\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the collection.\n \"\"\"\n return choice(self.lst)\n","memory":"68300"},{"code":"from collections import defaultdict\nfrom random import choice\n\nclass RandomizedCollection:\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.lst = []\n self.dict = defaultdict(set)\n\n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n \"\"\"\n\n self.lst.append(val)\n self.dict[val].add(len(self.lst) - 1)\n return len(self.dict[val]) == 1\n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n \"\"\"\n if not self.dict[val]:\n return False\n \n x = self.dict[val].pop()\n self.lst[x] = None\n return True\n\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the collection.\n \"\"\"\n x = None\n while x is None:\n x = choice(self.lst)\n return x","memory":"68700"},{"code":"class RandomizedCollection:\n\n def __init__(self):\n self.d = defaultdict(set)\n self.arr = []\n\n def insert(self, val: int) -> bool:\n if val in self.d:\n self.arr.append(val)\n self.d[val].add(len(self.arr) -1)\n return False\n else:\n self.arr.append(val)\n self.d[val].add(len(self.arr) -1)\n return True\n\n def remove(self, val: int) -> bool:\n if val in self.d:\n #case 1 if val is the last element\n if val == self.arr[-1]:\n self.d[val].remove(len(self.arr) - 1)\n if len(self.d[val]) == 0:\n del self.d[val]\n self.arr = self.arr[:-1]\n return True\n \n #case 2 val is not the last element \n val_idx = self.d[val].pop()\n if len(self.d[val]) == 0:\n del self.d[val]\n replace_val = self.arr[-1]\n #print(self.arr, self.d)\n self.arr[val_idx], self.arr[-1] = replace_val, val\n self.d[replace_val].add(val_idx)\n self.d[replace_val].remove(len(self.arr) -1)\n self.arr = self.arr[:-1]\n #print(self.arr, self.d)\n return True\n else:\n return False\n \n def getRandom(self) -> int:\n c = random.randint(0,len(self.arr)-1)\n return self.arr[c]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"68800"},{"code":"\nfrom random import choice\n\nclass RandomizedCollection:\n\n def __init__(self):\n \"\"\"\n Initialize your data structure here.\n \"\"\"\n self.lst = []\n self.idx = defaultdict(set)\n\n\n def insert(self, val: int) -> bool:\n \"\"\"\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\n \"\"\"\n self.idx[val].add(len(self.lst))\n self.lst.append(val)\n return len(self.idx[val]) == 1\n\n\n def remove(self, val: int) -> bool:\n \"\"\"\n Removes a value from the collection. Returns true if the collection contained the specified element.\n \"\"\"\n if not self.idx[val]: return False\n remove, last = self.idx[val].pop(), self.lst[-1]\n self.lst[remove] = last\n self.idx[last].add(remove)\n self.idx[last].discard(len(self.lst) - 1)\n\n self.lst.pop()\n return True\n\n\n def getRandom(self) -> int:\n \"\"\"\n Get a random element from the collection.\n \"\"\"\n idx = random.randint(0,len(self.lst)-1)\n return self.lst[idx]\n","memory":"68900"},{"code":"from random import randint\nfrom heapq import heappushpop, heappush, heappop\nclass RandomizedCollection:\n\n def __init__(self):\n self.ls = []\n self.occ = dict()\n self.occs = dict()\n\n def insert(self, val: int) -> bool:\n present = val in self.occs\n if present:\n self.occs[val].add(len(self.ls))\n else:\n s = set()\n s.add(len(self.ls))\n self.occs[val] = s\n \n self.ls.append(val)\n return not present\n\n\n present = val in self.occ\n if present:\n heappush(self.occ[val], -len(self.ls))\n else:\n self.occ[val] = [-len(self.ls)]\n self.ls.append(val)\n return not present\n\n def remove(self, val: int) -> bool:\n if val not in self.occs:\n return False\n \n victimindx = self.occs[val].pop()\n if len(self.occs[val]) == 0:\n del self.occs[val]\n lastindx = len(self.ls) - 1\n lastval = self.ls[lastindx]\n if victimindx == lastindx:\n self.ls.pop()\n return True\n \n self.ls[victimindx] = lastval\n # The thing\n self.occs[lastval].remove(lastindx)\n #\n self.occs[lastval].add(victimindx)\n self.ls.pop()\n return True\n\n if val not in self.occ:\n return False\n \n popped = -heappop(self.occ[val])\n if len(self.occ[val]) == 0:\n del self.occ[val]\n \n if popped == len(self.ls) - 1:\n self.ls.pop()\n return True\n \n self.ls[len(self.ls) - 1], self.ls[popped] = self.ls[popped], self.ls[len(self.ls) - 1]\n self.ls.pop()\n heappop(self.occ[self.ls[popped]])\n heappush(self.occ[self.ls[popped]], -popped)\n\n return True\n\n def getRandom(self) -> int:\n return self.ls[randint(0, len(self.ls)-1)]\n \n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"69000"},{"code":"import random\nfrom collections import defaultdict\n\n\nclass RandomizedCollection:\n\n def __init__(self):\n self.table = defaultdict(set)\n self.size = -1\n self.array = []\n\n def insert(self, val: int) -> bool:\n self.size += 1\n self.table[val].add(self.size)\n if self.size == len(self.array):\n self.array.append(val)\n else:\n self.array[self.size] = val\n\n return len(self.table[val]) == 1\n\n def remove(self, val: int) -> bool:\n if val not in self.table:\n return False\n index = self.table[val].pop()\n if not self.table[val]:\n self.table.pop(val)\n if index != self.size:\n remap = self.array[self.size]\n self.table[remap].add(index)\n self.table[remap].discard(self.size)\n self.array[index] = remap\n self.size -= 1\n return True\n \n def getRandom(self) -> int:\n randint = random.randint(0, self.size)\n return self.array[randint]\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"69100"},{"code":"import random\nclass RandomizedCollection:\n\n def __init__(self):\n self.stack = []\n self.pos = {}\n\n def insert(self, val: int) -> bool:\n self.stack.append(val)\n idx = len(self.stack) - 1\n # print(self.stack, self.pos, val)\n if val in self.pos:\n self.pos[val].add(idx)\n return False\n else:\n self.pos[val] = set([idx])\n return True\n\n def remove(self, val: int) -> bool:\n if val not in self.pos:\n return False\n idx = 0\n for idx in self.pos[val]:\n break\n self.pos[val].remove(idx)\n # print(idx)\n if idx == len(self.stack) - 1:\n self.stack.pop()\n else:\n last = self.stack.pop()\n self.stack[idx] = last\n self.pos[last].remove(len(self.stack))\n self.pos[last].add(idx)\n if len(self.pos[val]) == 0:\n del self.pos[val]\n return True\n\n def getRandom(self) -> int:\n return random.choice(self.stack)\n\n\n# Your RandomizedCollection object will be instantiated and called as such:\n# obj = RandomizedCollection()\n# param_1 = obj.insert(val)\n# param_2 = obj.remove(val)\n# param_3 = obj.getRandom()","memory":"69200"}],"string":"[\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.a = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.a:\\n self.a.append(val)\\n return False\\n else:\\n self.a.append(val)\\n return True\\n \\n def remove(self, val: int) -> bool:\\n if val in self.a:\\n self.a.remove(val)\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n if len(self.a)>0:\\n return random.choice(self.a)\\n else:\\n return -1\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"66500\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.listt=[]\\n import random\\n\\n def insert(self, val: int) -> bool:\\n if val not in self.listt:\\n self.listt.append(val)\\n return True\\n else:\\n self.listt.append(val)\\n return False\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.listt:\\n self.listt.remove(val)\\n return True\\n else:\\n return False\\n \\n\\n def getRandom(self) -> int:\\n k=len(self.listt)\\n index=random.randint(0,k-1)\\n return self.listt[index]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"66600\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.set={}\\n self.check=[]\\n\\n def insert(self, val: int) -> bool:\\n if self.set.get(val,0):\\n self.set[val]+=1\\n self.check.append(val)\\n return False\\n self.set[val]=1\\n self.check.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n \\n if self.set.get(val,0):\\n if self.set[val]>1:\\n self.set[val]-=1\\n else:\\n del self.set[val]\\n self.check.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n \\n return random.choice(self.check)\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"66700\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.multiset = []\\n\\n def insert(self, val: int) -> bool:\\n res = True\\n if val in self.multiset:\\n res = False\\n self.multiset.append(val)\\n return res\\n\\n def remove(self, val: int) -> bool:\\n if val in self.multiset:\\n self.multiset.remove(val)\\n return True\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.multiset)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"66800\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.collection = []\\n self.count = 0\\n \\n\\n def insert(self, val: int) -> bool:\\n if val not in self.collection:\\n self.collection.append(val)\\n self.count+=1\\n return True\\n else:\\n self.collection.append(val)\\n self.count+=1\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.collection:\\n self.collection.remove(val)\\n self.count -= 1\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.collection[random.randint(0, self.count - 1)]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"66900\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.a=[]\\n\\n def insert(self, val: int) -> bool:\\n print(val in self.a)\\n if(val in self.a):\\n self.a.append(val)\\n return False\\n else:\\n self.a.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n try:\\n self.a.remove(val)\\n return True\\n except:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.a[random.randint(0, len(self.a)-1)]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"66900\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.a=[]\\n\\n def insert(self, val: int) -> bool:\\n print(val in self.a)\\n if(val in self.a):\\n self.a.append(val)\\n return False\\n else:\\n self.a.append(val)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n try:\\n self.a.remove(val)\\n return True\\n except:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.a[random.randint(0, len(self.a)-1)]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67000\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d = defaultdict(int)\\n self.l = []\\n \\n def insert(self, val: int) -> bool:\\n self.l.append(val)\\n self.d[val] += 1\\n if self.d[val] != 1: return False\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.d[val] != 0:\\n self.l.remove(val)\\n self.d[val] -= 1\\n return True\\n return False\\n\\n def getRandom(self) -> int: return random.choice(self.l)\",\n \"memory\": \"67100\"\n },\n {\n \"code\": \"import random\\nfrom collections import defaultdict\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.d = defaultdict(int)\\n self.list = []\\n \\n \\n\\n def insert(self, val: int) -> bool:\\n\\n if val not in self.list:\\n\\n self.list.append(val)\\n self.d[val] += 1\\n return True\\n self.list.append(val) # Still append to the list to allow duplicates\\n self.d[val] += 1\\n return False\\n\\n\\n \\n\\n\\n \\n\\n def remove(self, val: int) -> bool:\\n if val in self.list:\\n self.list.remove(val)\\n self.d[val] -= 1\\n if self.d[val] == 0:\\n del self.d[val]\\n return True\\n return False\\n\\n \\n \\n\\n def getRandom(self) -> int:\\n\\n if not self.list:\\n raise IndexError(\\\"Cannot choose from an empty sequence\\\")\\n return random.choice(self.list)\\n\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67200\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d=defaultdict(int)\\n self.li=[]\\n \\n\\n def insert(self, val: int) -> bool:\\n self.li.append(val)\\n self.d[val]+=1\\n if self.d[val]!=1:\\n return False\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if self.d[val]!=0:\\n self.li.remove(val)\\n self.d[val]-=1\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.li)\\n \\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67300\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d = defaultdict(int)\\n self.li=[]\\n\\n def insert(self, val: int) -> bool:\\n self.li.append(val)\\n self.d[val]+=1\\n if self.d[val]!=1:\\n return False\\n return True\\n \\n\\n def remove(self, val: int) -> bool:\\n if self.d[val]!=0:\\n self.li.remove(val)\\n self.d[val]-=1\\n return True\\n return False\\n \\n\\n def getRandom(self) -> int:\\n return random.choice(self.li)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67300\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.c = Counter()\\n self.nb = 0\\n self.s = []\\n self.cal = True\\n\\n def insert(self, val: int) -> bool:\\n self.cal = True\\n if val in self.c.keys():\\n self.c[val] += 1\\n self.nb += 1\\n return False\\n else : \\n self.c[val] = 1\\n self.nb += 1\\n return True\\n\\n def remove(self, val: int) -> bool:\\n self.cal = True\\n if val in self.c.keys():\\n self.c[val] -= 1\\n self.nb -= 1\\n if self.c[val] == 0:\\n del self.c[val]\\n\\n return True\\n \\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n i = random.randint(0,self.nb-1)\\n if self.cal :\\n self.s = list(self.c.elements())\\n self.cal = False\\n return self.s[i]\\n \\n\\n\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67400\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.list = []\\n self.keys = {}\\n\\n def insert(self, val: int) -> bool:\\n self.list.append(val)\\n if val not in self.keys:\\n self.keys[val] = [len(self.list) - 1]\\n return True\\n else :\\n self.keys[val].append(len(self.list) - 1)\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val in self.keys:\\n index = self.keys[val][-1]\\n last_val = self.list[-1]\\n # a\\n # a:[3, 2, 7, 5]\\n\\n \\n self.list[index] = last_val\\n self.keys[last_val].sort()\\n self.keys[last_val][-1] = index\\n \\n\\n self.list.pop()\\n self.keys[val].pop()\\n if len(self.keys[val]) == 0:\\n del self.keys[val]\\n\\n return True\\n return False\\n \\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67600\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.index = dict()\\n self.list = list()\\n\\n def insert(self, val: int) -> bool:\\n retval = not val in self.index\\n\\n self.index.setdefault(val, list())\\n self.index[val].append(len(self.list))\\n\\n self.list.append(val)\\n\\n return retval\\n\\n def remove(self, val: int) -> bool:\\n if val in self.index:\\n indexList = self.index[val]\\n\\n index = indexList.pop()\\n\\n if not indexList:\\n del self.index[val]\\n\\n if index < len(self.list) - 1:\\n endIndexList = self.index[self.list[-1]]\\n\\n for i in range(len(endIndexList)):\\n if endIndexList[i] == len(self.list) - 1:\\n endIndexList[i] = index\\n break\\n\\n self.list[-1], self.list[index] = self.list[index], self.list[-1]\\n\\n self.list.pop()\\n\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return self.list[random.randint(0, len(self.list) - 1)]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67700\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.vals = []\\n self.ind_hash = collections.defaultdict(list)\\n \\n def insert(self, val: int) -> bool:\\n ind = len(self.vals)\\n self.vals.append(val)\\n if val not in self.ind_hash:\\n self.ind_hash[val] = [ind]\\n return True\\n else:\\n self.ind_hash[val].append(ind)\\n return False\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.ind_hash:\\n return False\\n \\n # cur last elem\\n last_ind = len(self.vals)-1\\n last = self.vals[last_ind]\\n # to del ind, the last one\\n del_ind = self.ind_hash[val].pop()\\n\\n if len(self.ind_hash[val]) == 0:\\n del self.ind_hash[val]\\n\\n # change ind\\n if del_ind != last_ind:\\n self.vals[del_ind] = last\\n self.ind_hash[self.vals[del_ind]].remove(last_ind)\\n self.ind_hash[self.vals[del_ind]].append(del_ind)\\n # change num\\n\\n self.vals.pop()\\n return True\\n\\n def getRandom(self) -> int:\\n if self.vals:\\n return self.vals[random.randint(0,len(self.vals)-1)]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67800\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.dict = {}\\n self.list = []\\n\\n def insert(self, val: int) -> bool:\\n idx = len(self.list)\\n\\n if val in self.dict:\\n retval = False\\n self.dict[val].append(idx)\\n else:\\n retval = True\\n self.dict[val] = [idx]\\n \\n self.list.append(val)\\n\\n return retval\\n\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.dict:\\n return False\\n\\n if len(self.list) == 1:\\n self.dict = {}\\n self.list = []\\n else:\\n idx = self.dict[val].pop()\\n endval = self.list[-1]\\n\\n self.list[idx] = endval\\n if idx != len(self.list)-1:\\n self.dict[endval].append(idx)\\n self.dict[endval].remove(len(self.list)-1)\\n\\n if len(self.dict[val]) == 0:\\n del self.dict[val]\\n self.list.pop()\\n\\n return True\\n\\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n\\n\\n# Your RandomizedSet object will be instantiated and called as such:\\n# obj = RandomizedSet()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"67900\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection:\\n def __init__(self):\\n self.values = []\\n self.value_to_indexes_map = {}\\n\\n def insert(self, val: int) -> bool:\\n self.value_to_indexes_map.setdefault(val, []).append(len(self.values))\\n self.values.append(val)\\n return len(self.value_to_indexes_map[val]) == 1\\n\\n def remove(self, val: int) -> bool:\\n indexes = self.value_to_indexes_map.get(val, [])\\n if not indexes:\\n return False\\n\\n index = indexes.pop()\\n last_index = len(self.values) - 1\\n if index == last_index:\\n self.values.pop()\\n return True\\n\\n last_val = self.values[last_index]\\n self.values[index] = last_val\\n self.values.pop()\\n self.value_to_indexes_map[last_val].remove(last_index)\\n self.value_to_indexes_map[last_val].append(index)\\n return True\\n\\n def getRandom(self) -> int:\\n index = random.randint(0, len(self.values) - 1)\\n return self.values[index]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"68000\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n from collections import defaultdict\\n self.list = []\\n self.v2i = defaultdict(list)\\n self.n = 0\\n\\n def insert(self, val: int) -> bool:\\n exists = self.v2i[val] != []\\n self.list.append(val)\\n self.v2i[val].append(self.n)\\n self.n += 1\\n return not exists\\n\\n def remove(self, val: int) -> bool:\\n exists = self.v2i[val] != []\\n if exists:\\n i = self.v2i[val].pop()\\n if i != self.n - 1:\\n v = self.list[self.n-1]\\n self.list[i] = v\\n self.v2i[v].remove(self.n-1)\\n self.v2i[v].append(i)\\n self.list.pop()\\n self.n -= 1\\n return exists\\n\\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"68100\"\n },\n {\n \"code\": \"import random\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.values = []\\n self.idxs_map = {}\\n\\n def insert(self, val: int) -> bool:\\n self.values.append(val)\\n val_idx = len(self.values) - 1\\n if val in self.idxs_map:\\n self.idxs_map[val].append(val_idx)\\n # print('i', val, self.values, self.idxs_map)\\n return False\\n else:\\n self.idxs_map[val] = [val_idx]\\n # print('i', val, self.values, self.idxs_map)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.idxs_map:\\n return False\\n \\n # for each idx ri to remove\\n # get the value pv at the end of the list\\n # remove from the self.idxs_map[pv] the last index, and append the ri\\n # set the value at ri to the value to preserve pv\\n # pop the last item from values\\n # now that all are removed, del the val from idxs_map\\n ri = self.idxs_map[val].pop()\\n pi = len(self.values) - 1\\n pv = self.values[pi]\\n # print({ 'pi': pi, 'pv': pv, 'ri': ri, 'val': val , 'idxs_map': self.idxs_map, 'values': self.values })\\n self.idxs_map[pv].append(ri)\\n self.idxs_map[pv].remove(pi)\\n self.values[ri] = pv\\n self.values.pop()\\n if len(self.idxs_map[val]) == 0:\\n del self.idxs_map[val]\\n # print('r', val, self.values, self.idxs_map)\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"68200\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.set = []\\n self.map = {}\\n\\n def insert(self, val: int) -> bool:\\n ret = False\\n if val in self.map:\\n self.map[val].add(len(self.set))\\n else:\\n ret = True\\n self.map[val] = {len(self.set)}\\n self.set.append(val)\\n return ret\\n \\n def remove(self, val: int) -> bool:\\n if val in self.map:\\n cur = self.map[val].pop()\\n if not self.map[val]:\\n del self.map[val]\\n if len(self.set) > 1 and cur != len(self.set)-1:\\n temp = self.set[-1]\\n self.set[-1] = set[cur]\\n self.set[cur] = temp\\n self.map[temp].remove(len(self.set)-1)\\n self.map[temp].add(cur)\\n self.set.pop()\\n return True\\n else:\\n return False\\n\\n def getRandom(self) -> int:\\n return random.choice(self.set)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"68200\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom random import choice\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.lst = []\\n self.idx = defaultdict(set)\\n\\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n \\\"\\\"\\\"\\n self.idx[val].add(len(self.lst))\\n self.lst.append(val)\\n return len(self.idx[val]) == 1\\n\\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n \\\"\\\"\\\"\\n if not self.idx[val]: return False\\n remove, last = self.idx[val].pop(), self.lst[-1]\\n self.lst[remove] = last\\n self.idx[last].add(remove)\\n self.idx[last].discard(len(self.lst) - 1)\\n\\n self.lst.pop()\\n return True\\n\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n \\\"\\\"\\\"\\n return choice(self.lst)\\n\",\n \"memory\": \"68300\"\n },\n {\n \"code\": \"from collections import defaultdict\\nfrom random import choice\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.lst = []\\n self.dict = defaultdict(set)\\n\\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n \\\"\\\"\\\"\\n\\n self.lst.append(val)\\n self.dict[val].add(len(self.lst) - 1)\\n return len(self.dict[val]) == 1\\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n \\\"\\\"\\\"\\n if not self.dict[val]:\\n return False\\n \\n x = self.dict[val].pop()\\n self.lst[x] = None\\n return True\\n\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n \\\"\\\"\\\"\\n x = None\\n while x is None:\\n x = choice(self.lst)\\n return x\",\n \"memory\": \"68700\"\n },\n {\n \"code\": \"class RandomizedCollection:\\n\\n def __init__(self):\\n self.d = defaultdict(set)\\n self.arr = []\\n\\n def insert(self, val: int) -> bool:\\n if val in self.d:\\n self.arr.append(val)\\n self.d[val].add(len(self.arr) -1)\\n return False\\n else:\\n self.arr.append(val)\\n self.d[val].add(len(self.arr) -1)\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val in self.d:\\n #case 1 if val is the last element\\n if val == self.arr[-1]:\\n self.d[val].remove(len(self.arr) - 1)\\n if len(self.d[val]) == 0:\\n del self.d[val]\\n self.arr = self.arr[:-1]\\n return True\\n \\n #case 2 val is not the last element \\n val_idx = self.d[val].pop()\\n if len(self.d[val]) == 0:\\n del self.d[val]\\n replace_val = self.arr[-1]\\n #print(self.arr, self.d)\\n self.arr[val_idx], self.arr[-1] = replace_val, val\\n self.d[replace_val].add(val_idx)\\n self.d[replace_val].remove(len(self.arr) -1)\\n self.arr = self.arr[:-1]\\n #print(self.arr, self.d)\\n return True\\n else:\\n return False\\n \\n def getRandom(self) -> int:\\n c = random.randint(0,len(self.arr)-1)\\n return self.arr[c]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"68800\"\n },\n {\n \"code\": \"\\nfrom random import choice\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n \\\"\\\"\\\"\\n Initialize your data structure here.\\n \\\"\\\"\\\"\\n self.lst = []\\n self.idx = defaultdict(set)\\n\\n\\n def insert(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Inserts a value to the collection. Returns true if the collection did not already contain the specified element.\\n \\\"\\\"\\\"\\n self.idx[val].add(len(self.lst))\\n self.lst.append(val)\\n return len(self.idx[val]) == 1\\n\\n\\n def remove(self, val: int) -> bool:\\n \\\"\\\"\\\"\\n Removes a value from the collection. Returns true if the collection contained the specified element.\\n \\\"\\\"\\\"\\n if not self.idx[val]: return False\\n remove, last = self.idx[val].pop(), self.lst[-1]\\n self.lst[remove] = last\\n self.idx[last].add(remove)\\n self.idx[last].discard(len(self.lst) - 1)\\n\\n self.lst.pop()\\n return True\\n\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Get a random element from the collection.\\n \\\"\\\"\\\"\\n idx = random.randint(0,len(self.lst)-1)\\n return self.lst[idx]\\n\",\n \"memory\": \"68900\"\n },\n {\n \"code\": \"from random import randint\\nfrom heapq import heappushpop, heappush, heappop\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.ls = []\\n self.occ = dict()\\n self.occs = dict()\\n\\n def insert(self, val: int) -> bool:\\n present = val in self.occs\\n if present:\\n self.occs[val].add(len(self.ls))\\n else:\\n s = set()\\n s.add(len(self.ls))\\n self.occs[val] = s\\n \\n self.ls.append(val)\\n return not present\\n\\n\\n present = val in self.occ\\n if present:\\n heappush(self.occ[val], -len(self.ls))\\n else:\\n self.occ[val] = [-len(self.ls)]\\n self.ls.append(val)\\n return not present\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.occs:\\n return False\\n \\n victimindx = self.occs[val].pop()\\n if len(self.occs[val]) == 0:\\n del self.occs[val]\\n lastindx = len(self.ls) - 1\\n lastval = self.ls[lastindx]\\n if victimindx == lastindx:\\n self.ls.pop()\\n return True\\n \\n self.ls[victimindx] = lastval\\n # The thing\\n self.occs[lastval].remove(lastindx)\\n #\\n self.occs[lastval].add(victimindx)\\n self.ls.pop()\\n return True\\n\\n if val not in self.occ:\\n return False\\n \\n popped = -heappop(self.occ[val])\\n if len(self.occ[val]) == 0:\\n del self.occ[val]\\n \\n if popped == len(self.ls) - 1:\\n self.ls.pop()\\n return True\\n \\n self.ls[len(self.ls) - 1], self.ls[popped] = self.ls[popped], self.ls[len(self.ls) - 1]\\n self.ls.pop()\\n heappop(self.occ[self.ls[popped]])\\n heappush(self.occ[self.ls[popped]], -popped)\\n\\n return True\\n\\n def getRandom(self) -> int:\\n return self.ls[randint(0, len(self.ls)-1)]\\n \\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"69000\"\n },\n {\n \"code\": \"import random\\nfrom collections import defaultdict\\n\\n\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.table = defaultdict(set)\\n self.size = -1\\n self.array = []\\n\\n def insert(self, val: int) -> bool:\\n self.size += 1\\n self.table[val].add(self.size)\\n if self.size == len(self.array):\\n self.array.append(val)\\n else:\\n self.array[self.size] = val\\n\\n return len(self.table[val]) == 1\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.table:\\n return False\\n index = self.table[val].pop()\\n if not self.table[val]:\\n self.table.pop(val)\\n if index != self.size:\\n remap = self.array[self.size]\\n self.table[remap].add(index)\\n self.table[remap].discard(self.size)\\n self.array[index] = remap\\n self.size -= 1\\n return True\\n \\n def getRandom(self) -> int:\\n randint = random.randint(0, self.size)\\n return self.array[randint]\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"69100\"\n },\n {\n \"code\": \"import random\\nclass RandomizedCollection:\\n\\n def __init__(self):\\n self.stack = []\\n self.pos = {}\\n\\n def insert(self, val: int) -> bool:\\n self.stack.append(val)\\n idx = len(self.stack) - 1\\n # print(self.stack, self.pos, val)\\n if val in self.pos:\\n self.pos[val].add(idx)\\n return False\\n else:\\n self.pos[val] = set([idx])\\n return True\\n\\n def remove(self, val: int) -> bool:\\n if val not in self.pos:\\n return False\\n idx = 0\\n for idx in self.pos[val]:\\n break\\n self.pos[val].remove(idx)\\n # print(idx)\\n if idx == len(self.stack) - 1:\\n self.stack.pop()\\n else:\\n last = self.stack.pop()\\n self.stack[idx] = last\\n self.pos[last].remove(len(self.stack))\\n self.pos[last].add(idx)\\n if len(self.pos[val]) == 0:\\n del self.pos[val]\\n return True\\n\\n def getRandom(self) -> int:\\n return random.choice(self.stack)\\n\\n\\n# Your RandomizedCollection object will be instantiated and called as such:\\n# obj = RandomizedCollection()\\n# param_1 = obj.insert(val)\\n# param_2 = obj.remove(val)\\n# param_3 = obj.getRandom()\",\n \"memory\": \"69200\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":27,"string":"27"}}},{"rowIdx":285,"cells":{"question_id":{"kind":"number","value":382,"string":"382"},"name":{"kind":"string","value":"linked-list-random-node"},"content":{"kind":"string","value":"<p>Given a singly linked list, return a random node's value from the linked list. Each node must have the <strong>same probability</strong> of being chosen.</p>\n\n<p>Implement the <code>Solution</code> class:</p>\n\n<ul>\n\t<li><code>Solution(ListNode head)</code> Initializes the object with the head of the singly-linked list <code>head</code>.</li>\n\t<li><code>int getRandom()</code> Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be chosen.</li>\n</ul>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/16/getrand-linked-list.jpg\" style=\"width: 302px; height: 62px;\" />\n<pre>\n<strong>Input</strong>\n["Solution", "getRandom", "getRandom", "getRandom", "getRandom", "getRandom"]\n[[[1, 2, 3]], [], [], [], [], []]\n<strong>Output</strong>\n[null, 1, 3, 2, 2, 3]\n\n<strong>Explanation</strong>\nSolution solution = new Solution([1, 2, 3]);\nsolution.getRandom(); // return 1\nsolution.getRandom(); // return 3\nsolution.getRandom(); // return 2\nsolution.getRandom(); // return 2\nsolution.getRandom(); // return 3\n// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li>The number of nodes in the linked list will be in the range <code>[1, 10<sup>4</sup>]</code>.</li>\n\t<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li>\n\t<li>At most <code>10<sup>4</sup></code> calls will be made to <code>getRandom</code>.</li>\n</ul>\n\n<p> </p>\n<p><strong>Follow up:</strong></p>\n\n<ul>\n\t<li>What if the linked list is extremely large and its length is unknown to you?</li>\n\t<li>Could you solve this efficiently without using extra space?</li>\n</ul>\n"},"acRate":{"kind":"number","value":63.40973622066258,"string":"63.409736"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["linked-list","math","reservoir-sampling","randomized"],"string":"[\n \"linked-list\",\n \"math\",\n \"reservoir-sampling\",\n \"randomized\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"40\", 0.1093], [\"42\", 0.2186], [\"43\", 0.3279], [\"44\", 0.6557], [\"45\", 0.5464], [\"46\", 0.765], [\"47\", 0.765], [\"48\", 0.8743], [\"49\", 1.6393], [\"50\", 1.5301], [\"51\", 1.4208], [\"52\", 2.623], [\"53\", 2.7322], [\"54\", 3.2787], [\"55\", 5.3552], [\"56\", 3.388], [\"57\", 3.2787], [\"58\", 4.0437], [\"59\", 4.3716], [\"60\", 4.3716], [\"61\", 3.9344], [\"62\", 3.9344], [\"63\", 2.4044], [\"64\", 3.2787], [\"65\", 1.9672], [\"66\", 2.7322], [\"67\", 2.5137], [\"68\", 1.5301], [\"69\", 0.9836], [\"70\", 1.7486], [\"71\", 0.765], [\"72\", 0.8743], [\"73\", 0.5464], [\"74\", 0.5464], [\"75\", 0.3279], [\"76\", 0.5464], [\"77\", 0.1093], [\"78\", 0.1093], [\"79\", 0.1093], [\"80\", 0.1093], [\"82\", 0.1093], [\"83\", 0.3279], [\"86\", 0.1093], [\"88\", 0.1093], [\"89\", 0.1093], [\"91\", 0.2186], [\"96\", 0.3279], [\"97\", 0.2186], [\"98\", 0.1093], [\"99\", 0.6557], [\"100\", 0.3279], [\"101\", 0.6557], [\"102\", 0.5464], [\"103\", 0.6557], [\"104\", 0.6557], [\"105\", 0.8743], [\"106\", 1.4208], [\"107\", 1.3115], [\"108\", 1.4208], [\"109\", 1.0929], [\"110\", 1.7486], [\"111\", 1.6393], [\"112\", 1.3115], [\"113\", 1.2022], [\"114\", 0.9836], [\"115\", 0.5464], [\"116\", 0.765], [\"117\", 0.9836], [\"118\", 1.3115], [\"119\", 1.2022]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18900\", 0.1093], [\"19000\", 0.3279], [\"19100\", 2.623], [\"19200\", 26.6667], [\"19300\", 52.0219], [\"19400\", 12.459], [\"19500\", 0.6557]]}"},"rt_list":{"kind":"list like","value":[{"code":"from random import choice\n\n\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.vals = []\n while head is not None:\n self.vals.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return choice(self.vals)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"40"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.res = []\n curr = head\n while curr:\n self.res.append(curr.val)\n curr = curr.next\n\n def getRandom(self) -> int:\n return self.res[random.randint(0,len(self.res) - 1)]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"42"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.list = []\n while head:\n self.list.append(head.val)\n head = head.next \n \n\n def getRandom(self) -> int:\n return self.list[random.randrange(len(self.list))]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"43"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.list = []\n while head:\n self.list.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return random.choice(self.list)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"44"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.nodes = []\n curr = head\n while curr:\n self.nodes.append(curr)\n curr = curr.next\n self.len = len(self.nodes)\n\n def getRandom(self) -> int:\n i = random.randint(0, self.len - 1)\n return self.nodes[i].val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"45"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n c = head\n self.nodes = []\n while c:\n self.nodes.append(c)\n c = c.next\n\n def getRandom(self) -> int:\n return random.choice(self.nodes).val\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"46"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.List=[]\n while head:\n self.List.append(head.val)\n head=head.next\n \n\n def getRandom(self) -> int:\n return self.List[random.randrange(len(self.List))]\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"47"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.d = []\n while(head):\n self.d.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return random.choice(self.d)\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"48"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.range = []\n while head:\n self.range.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n idx = int(random.random() * len(self.range))\n return self.range[idx]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"49"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.ans=[]\n curr=head\n while(curr!=None):\n self.ans.append(curr)\n curr=curr.next\n self.length=len(self.ans) \n\n def getRandom(self) -> int:\n idx=random.randint(0,self.length-1)\n return self.ans[idx].val\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"50"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.store = []\n current = head\n while current:\n self.store.append(current.val)\n current = current.next\n\n def getRandom(self) -> int:\n idx = int(random.random() * len(self.store))\n return self.store[idx]\n \n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"51"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.res = []\n curr = head\n while curr:\n self.res.append(curr.val)\n curr = curr.next\n\n def getRandom(self) -> int:\n return self.res[random.randint(0,len(self.res) - 1)]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"52"},{"code":"class Solution:\n\n def __init__(self, head: ListNode):\n self.res = []\n curr = head\n while curr:\n self.res.append(curr)\n curr = curr.next\n self.length = len(self.res)\n\n def getRandom(self) -> int:\n index = random.randint(0, self.length - 1)\n return self.res[index].val","runtime":"52"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n length = 0\n while head:\n head = head.next\n length += 1\n self.length = length\n\n def getRandom(self) -> int:\n cdf_sample = random.uniform(0, 1.0)\n # head = copy.deepcopy(self.head)\n head = self.head\n index = 1\n while head:\n # print(cdf_sample, index/self.length)\n if cdf_sample <= index/self.length:\n # print(f'returning {head.val}')\n return head.val\n head = head.next\n index += 1\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"53"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.arr = []\n\n def createList(self):\n while self.head != None:\n self.arr.append(self.head.val)\n self.head = self.head.next\n \n def getRandom(self) -> int:\n if len(self.arr) == 0:\n self.createList()\n index = random.randint(0, len(self.arr) - 1)\n return self.arr[index]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"54"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.root = []\n self.linedListToList(head)\n \n def linedListToList(self,data) : \n while(data is not None):\n self.root.append(data.val)\n data = data.next\n \n def getRandom(self) -> int:\n \n return random.choice(self.root)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"54"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n count = 1\n cur = self.head\n while cur:\n val = random.random()\n if val < 1 / count:\n chosen_value = cur.val\n cur = cur.next\n count += 1\n return chosen_value\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"55"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n # O(n)\n self.node = []\n while head:\n self.node.append(head)\n head = head.next\n\n def getRandom(self) -> int:\n i = random.randint(0, len(self.node)-1)\n return self.node[i].val\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"55"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.a=[]\n b=head\n while(b):\n self.a.append(b.val)\n b=b.next\n\n def getRandom(self) -> int:\n return random.choice(self.a)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"56"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n \n def get_len(self, head):\n if not head: return 0\n return 1 + self.get_len(head.next)\n\n def __init__(self, head: Optional[ListNode]):\n self.len = self.get_len(head)\n self.head = head\n \n \n\n def getRandom(self) -> int:\n rand_index = random.randint(1, self.len)\n \n head = self.head\n while head:\n rand_index -= 1\n if rand_index == 0:\n return head.val\n head = head.next\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"57"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.arr = []\n while head:\n self.arr.append(head)\n head = head.next\n \n def getRandom(self) -> int:\n return random.choice(self.arr).val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"58"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n curr = head\n n = 0\n while curr:\n n += 1\n curr = curr.next\n self.n = n\n def getRandom(self) -> int:\n idx = random.randint(0, self.n-1)\n i = 0\n curr = self.head\n while i < idx:\n curr = curr.next\n i += 1\n return curr.val\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"59"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n length = 0\n while head:\n head = head.next\n length += 1\n self.length = length\n\n def getRandom(self) -> int:\n cdf_sample = random.uniform(0, 1.0)\n # head = copy.deepcopy(self.head)\n head = self.head\n index = 1\n while head:\n # print(cdf_sample, index/self.length)\n if cdf_sample <= index/self.length:\n # print(f'returning {head.val}')\n return head.val\n head = head.next\n index += 1\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"59"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.vals = []\n if head.val or head.val == 0:\n while head.next or head.next == 0:\n self.vals.append(head.val)\n head = head.next\n self.vals.append(head.val)\n\n def getRandom(self) -> int:\n if self.vals:\n return random.choice(self.vals)\n return 0\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"60"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.res = []\n while head:\n self.res.append(head.val)\n head = head.next\n return\n\n def getRandom(self) -> int:\n t = randint(0,len(self.res)-1)\n return self.res[t]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"60"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.values = []\n \n while head is not None:\n self.values.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"61"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.n = 0\n while head is not None:\n self.n += 1\n head = head.next\n\n def getRandom(self) -> int:\n rand_n = random.randrange(self.n)\n head = self.head\n for _ in range(rand_n):\n head = head.next\n return head.val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"61"},{"code":"class Solution:\n\n def __init__(self, head: ListNode):\n self.nodes = []\n while head:\n self.nodes.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return random.choice(self.nodes)","runtime":"62"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nfrom random import random\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n cur_node = self.head\n\n res = -1\n i = 1\n while(cur_node):\n if(random() < (1 / i)):\n res = cur_node.val\n i += 1\n cur_node = cur_node.next\n \n return res\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"63"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.rnd = Random()\n size = 0\n curr = head\n while curr:\n curr = curr.next\n size += 1\n self.size = size\n\n def getRandom(self) -> int:\n selection = self.rnd.randint(0, self.size - 1)\n curr = self.head\n while selection:\n curr = curr.next\n selection -= 1\n return curr.val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"63"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.node_count = 0\n node = head\n while node is not None:\n self.node_count += 1\n node = node.next\n\n def getRandom(self) -> int:\n selected_idx = random.randrange(0, self.node_count)\n node = self.head\n for _ in range(selected_idx):\n node = node.next\n return node.val\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"64"},{"code":"class Solution:\n\n def __init__(self, head: ListNode):\n self.res = []\n curr = head\n while curr:\n self.res.append(curr)\n curr = curr.next\n self.length = len(self.res)\n\n def getRandom(self) -> int:\n index = random.randint(0, self.length - 1)\n return self.res[index].val","runtime":"64"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.d = {}\n count = 0\n node = head\n while node:\n self.d[count] = node\n count += 1\n node = node.next\n self.total = count\n \n\n def getRandom(self) -> int:\n rand = random.randint(0, self.total-1)\n return self.d[rand].val\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"65"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.length = 0\n while head.next:\n self.length += 1\n head = head.next\n\n def getRandom(self) -> int:\n random_indx = random.randint(0, self.length)\n node = self.head\n random_node = None\n while node:\n if random_indx == 0:\n random_node = node.val\n random_indx -= 1\n node = node.next\n return random_node\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"66"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.n = 0\n while head is not None:\n self.n += 1\n head = head.next\n\n def getRandom(self) -> int:\n rand_n = random.randint(0, self.n - 1)\n head = self.head\n for _ in range(rand_n):\n head = head.next\n return head.val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"67"},{"code":"import random\n\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: ListNode):\n self.head = head\n\n def getRandom(self) -> int:\n result = None\n current = self.head\n count = 0\n \n while current:\n count += 1\n if random.random() < 1 / count:\n result = current.val\n current = current.next\n \n return result\n\n# Example usage:\n# head = ListNode(1, ListNode(2, ListNode(3)))\n# obj = Solution(head)\n# print(obj.getRandom()) # Output will be one of 1, 2, or 3 with equal probability","runtime":"68"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.elems = []\n while head:\n self.elems.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return random.choices(self.elems)[0]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"69"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n def __init__(self, head: ListNode):\n self.head = head # Store the head of the linked list\n \n def getRandom(self) -> int:\n # Initialize variables\n result = None\n current = self.head\n index = 0\n \n # Traverse the linked list\n while current is not None:\n # Increment index\n index += 1\n \n # Use reservoir sampling: with probability 1/index, select the current node\n if random.random() < 1 / index:\n result = current.val\n \n # Move to the next node\n current = current.next\n \n return result\n","runtime":"70"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n scope = 1\n chosen_value = 0\n curr = self.head\n while curr:\n if random.random() <= 1 / scope:\n chosen_value = curr.val\n curr = curr.next\n scope += 1\n return chosen_value\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"71"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self._h = head\n\n def getRandom(self) -> int:\n n = 1\n rv = 0\n cn = self._h\n \n while cn:\n if random.random() < 1 / n:\n rv = cn.val\n cn = cn.next\n n += 1\n \n return rv\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"72"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n num_nodes = 0\n current_node = self.head\n\n while current_node != None:\n num_nodes += 1\n current_node = current_node.next\n\n if num_nodes == 1:\n return 1\n\n random_node = random.randint(0, num_nodes - 1)\n\n current_node = self.head\n node_count = 0\n while current_node != None and node_count != (random_node):\n node_count += 1\n current_node = current_node.next\n\n return current_node.val\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"73"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n n = 1\n val = 0\n cur = self.head\n while cur:\n if random.random() < 1 / n:\n val = cur.val\n cur = cur.next\n n += 1\n \n return val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"74"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: ListNode):\n self.head = head\n\n def getRandom(self) -> int:\n result = self.head.val\n node, n = self.head, 1\n while node:\n if random.random() < 1 / n:\n result = node.val\n node = node.next\n n += 1\n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"75"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.aux=[]\n while head!=None:\n self.aux.append(head.val)\n head=head.next\n self.prob=[1/len(self.aux)]*len(self.aux)\n \n\n def getRandom(self) -> int:\n return random.choices(self.aux,self.prob)[0]\n\n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"76"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n a = {}\n tail = self.head\n count = 1 \n while tail:\n a[count] = tail\n tail = tail.next\n count += 1 \n # print(a)\n b = random.randint(1,count-1)\n c = a[b]\n return c.val \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"77"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.rand = random.Random()#a float [0, 1)\n \n\n def getRandom(self) -> int:\n temp = self.head #因为会被call很多次，所以要用一个temp\n selected = -1\n i = 1\n \n while temp:\n if self.rand.random() < 1.0 / i:#<\n selected = temp.val #\n temp = temp.next\n i += 1\n \n return selected\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"78"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n result = self.head.val\n node, n = self.head, 1\n while node:\n if random.random() < 1 / n:\n result = node.val\n node = node.next\n n += 1\n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"79"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\n\nclass Solution:\n nums = []\n def __init__(self, head):\n self.nums.clear()\n while (head != None):\n print(head.val)\n self.nums.append(head.val)\n head = head.next \n\n def getRandom(self):\n print(self.nums)\n return random.choice(self.nums)\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"80"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head=head\n self.counter=0\n \n temp=self.head\n while temp:\n \n self.counter+=1\n temp=temp.next\n \n \n \n \n \n \n \n \n \n\n def getRandom(self) -> int:\n \n value=random.randint(0,self.counter-1)\n print(\"this is value\",value)\n temp=self.head\n \n \n def recursion(head,value):\n \n if value==0:\n return head.val\n \n if not head:\n return \n \n \n \n return recursion(head.next,value-1)\n \n return recursion(self.head,value)\n \n \n \n \n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"82"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.n = self.getLen()\n\n def getRandom(self) -> int:\n node, k = self.head, self.n\n while randrange(k):\n node = node.next\n k -= 1\n return node.val\n \n def getLen(self) -> int:\n node, cnt = self.head, 0\n while node:\n node = node.next\n cnt += 1\n return cnt\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"83"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.n = self.getLen()\n\n def getRandom(self) -> int:\n node, k = self.head, self.n\n while randint(0, k-1):\n node = node.next\n k -= 1\n return node.val\n \n def getLen(self) -> int:\n node, cnt = self.head, 0\n while node:\n node = node.next\n cnt += 1\n return cnt\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"83"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n cur_size = 0\n walk = head\n while walk:\n cur_size += 1\n walk = walk.next\n self.size = cur_size\n \n\n def getRandom(self) -> int:\n n = self.size\n walk = self.head\n while random.randint(1, n) != 1:\n n -= 1\n walk = walk.next\n return walk.val\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"86"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.linkedlist = head\n\n def getRandom(self) -> int:\n random_num = 0\n curr=self.linkedlist\n elements_list = []\n while curr!=None:\n elements_list.append(curr.val)\n random_num=random.choice(elements_list)\n curr=curr.next\n return random_num\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"88"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n \n \n curr = self.head\n k = 0\n res = 0\n while curr :\n\n if k == 0 :\n res = curr.val\n \n \n else :\n \n idx = random.randint(0,k)\n if idx == k :\n res = curr.val\n\n k = k+1\n curr = curr.next\n \n return res\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"97"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n\n def getRandom(self) -> int:\n n = 0\n cur = self.head\n pick = None\n\n while cur:\n n += 1\n idx = random.randrange(n)\n if idx < 1:\n pick = cur\n cur = cur.next\n \n return pick.val\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"98"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n result = None\n current = self.head\n count = 0\n \n while current:\n count += 1\n # Generate a random number between 1 and the count of nodes visited so far\n # If the random number is 1, replace the result with the current node's value\n if random.randint(1, count) == 1:\n result = current.val\n current = current.next\n \n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"99"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n\n def getRandom(self) -> int:\n count = 0\n ret = -1\n cur = self.head\n while cur:\n count += 1\n if random.randrange(count) == 0:\n ret = cur.val\n cur = cur.next\n return ret\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"100"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n result = self.head.val\n current, n = self.head.next, 1\n while current:\n if random.randint(0, n) == 0:\n result = current.val\n current = current.next\n n += 1\n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"101"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n result = None\n current = self.head\n count = 0\n \n while current:\n count += 1\n if random.randint(1, count) == 1:\n result = current.val\n current = current.next\n \n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"102"},{"code":"# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\nfrom typing import Optional\nimport random\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n def getRandom(self) -> int:\n idx = 0\n samples = []\n k = 1\n node = self.head\n while node:\n if idx < k:\n samples.append(node.val)\n else:\n selected_idx = random.randrange(0, idx+1)\n if selected_idx < k:\n samples[selected_idx] = node.val\n \n idx += 1\n node = node.next\n return samples[0]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"103"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n result, node, index = self.head.val, self.head.next, 1\n while node:\n if random.randint(0, index) == 0:\n result = node.val\n node = node.next\n index += 1\n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"104"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\nclass Solution:\n\n def __init__(self, head: ListNode):\n self.head = head\n\n def getRandom(self) -> int:\n result, node, index = self.head, self.head.next, 1\n while node:\n if random.randint(0, index) == 0:\n result = node\n node = node.next\n index += 1\n return result.val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"105"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n\n def getRandom(self) -> int:\n curr = self.head\n count = 1\n val = curr.val\n while curr.next is not None:\n curr = curr.next\n count += 1\n if randint(1, count) == 1:\n val = curr.val\n return val\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"105"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n ans = self.head.val\n i = 0\n cur = self.head\n while cur:\n if random.randint(0, i) == 0:\n ans = cur.val\n cur = cur.next\n i += 1\n\n return ans\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"106"},{"code":"# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\nfrom typing import Optional\nimport random\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n def getRandom(self) -> int:\n idx = 0\n samples = []\n k = 1\n node = self.head\n while node:\n if idx < k:\n samples.append(node.val)\n else:\n selected_idx = random.randrange(0, idx+1)\n if selected_idx < k:\n samples[selected_idx] = node.val\n \n idx += 1\n node = node.next\n return samples[0]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"106"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n curr = self.head\n ct = 0\n picked_val = 0\n\n while curr:\n if random.randint(0, ct) == ct:\n picked_val = curr.val\n \n ct += 1\n curr = curr.next\n \n return picked_val\n \n# Think reservoir sampling when you find random things.\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"107"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\n\nclass Solution:\n def __init__(self, head: ListNode | None):\n self.head = head\n\n def getRandom(self) -> int:\n res = -1\n i = 1\n curr = self.head\n\n while curr:\n if random.randint(0, i - 1) == 0:\n res = curr.val\n curr = curr.next\n i += 1\n\n return res","runtime":"108"},{"code":"import random\n\n\nclass Solution:\n\n def __init__(self, head: ListNode):\n \"\"\"\n Initializes the object with the head of the singly-linked list head.\n \"\"\"\n self.head = head\n\n def getRandom(self) -> int:\n \"\"\"\n Returns a random node's value from the list.\n \"\"\"\n result = self.head.val\n current_node = self.head.next\n index = 1\n\n # Traverse the list starting from the second node\n while current_node:\n # Randomly select the current node's value with a probability of 1 / (index + 1)\n if random.randint(0, index) == 0:\n result = current_node.val\n current_node = current_node.next\n index += 1\n \n return result\n","runtime":"109"},{"code":"import random\n\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n def __init__(self, head: ListNode):\n self.head = head\n \n def getRandom(self) -> int:\n current = self.head\n reservoir = None\n count = 0\n \n while current:\n count += 1\n # Decide whether to replace the reservoir with the current node\n if random.randint(1, count) == count:\n reservoir = current.val\n current = current.next\n \n return reservoir\n","runtime":"110"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n # Reservoir sampling and K == 1\n def getRandom(self) -> int:\n ans = 0\n p, i = self.head, 0\n while p is not None:\n if random.randint(0, i) == 0:\n ans = p.val\n p = p.next\n i += 1\n return ans\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"110"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n current = self.head\n resorvoir = current.val\n count = 1\n while current:\n if random.randint(1,count)==1:\n resorvoir = current.val\n current = current.next\n count+=1\n return resorvoir\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"111"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n INF = int(2e9)\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n def getRandom(self) -> int:\n count,output = 0, 0\n temp = self.head\n while temp:\n count += 1\n if random.randint(1,count) == 1: \n # both bounds included, == k can be anything \n # for 1 <= k <= count since prob is 1/count\n output = temp.val\n temp = temp.next\n return output\n\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"112"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.L = head\n \n\n def getRandom(self) -> int:\n chosen = None\n elems = 1\n p = self.L\n while p:\n pick = random.randint(1, elems)\n if pick == 1:\n chosen = p\n elems += 1\n p = p.next\n return chosen.val\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"112"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.head =head\n\n def getRandom(self) -> int:\n temp, i = self.head, 0\n ans = 0\n\n while temp:\n if randint(0,i) == 0:\n ans = temp.val\n i+=1\n temp = temp.next\n \n return ans\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"113"},{"code":"# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\nfrom typing import Optional\nimport random\nclass Solution:\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n def getRandom(self) -> int:\n idx = 0\n samples = []\n k = 1\n node = self.head\n while node:\n if idx < k:\n samples.append(node.val)\n else:\n selected_idx = random.randint(0, idx)\n if selected_idx < k:\n samples[selected_idx] = node.val\n \n idx += 1\n node = node.next\n return samples[0]\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"114"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\n\nclass Solution:\n def __init__(self, head: ListNode | None):\n self.head = head\n\n def getRandom(self) -> int:\n res = -1\n i = 1\n curr = self.head\n\n while curr:\n if random.randint(0, i - 1) == 0:\n res = curr.val\n curr = curr.next\n i += 1\n\n return res","runtime":"115"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n \n\n def getRandom(self) -> int:\n\n curr = self.head\n val = curr.val\n i = 0\n while curr.next:\n curr = curr.next\n i += 1\n if random.randint(0,i) == 0:\n val = curr.val\n \n return val\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"116"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n result = None\n current = self.head\n count = 0\n \n while current:\n count += 1\n if random.randint(1, count) == 1:\n result = current.val\n current = current.next\n \n return result\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"117"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nimport random\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def getRandom(self) -> int:\n if self.head.next is None:\n return self.head.val\n \n result = self.head\n curr = self.head\n n = 1\n\n while curr:\n if random.randint(1,n) == 1:\n result = curr\n curr = curr.next\n n += 1\n \n return result.val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"118"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.cur = head\n self.result = 0\n\n def getRandom(self) -> int:\n count = 0\n while self.cur != None:\n count += 1\n if random.randint(1, count) == 1:\n self.result = self.cur.val\n self.cur = self.cur.next\n self.cur = self.head\n return self.result\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","runtime":"119"}],"string":"[\n {\n \"code\": \"from random import choice\\n\\n\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.vals = []\\n while head is not None:\\n self.vals.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return choice(self.vals)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.res = []\\n curr = head\\n while curr:\\n self.res.append(curr.val)\\n curr = curr.next\\n\\n def getRandom(self) -> int:\\n return self.res[random.randint(0,len(self.res) - 1)]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.list = []\\n while head:\\n self.list.append(head.val)\\n head = head.next \\n \\n\\n def getRandom(self) -> int:\\n return self.list[random.randrange(len(self.list))]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.list = []\\n while head:\\n self.list.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.list)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.nodes = []\\n curr = head\\n while curr:\\n self.nodes.append(curr)\\n curr = curr.next\\n self.len = len(self.nodes)\\n\\n def getRandom(self) -> int:\\n i = random.randint(0, self.len - 1)\\n return self.nodes[i].val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n c = head\\n self.nodes = []\\n while c:\\n self.nodes.append(c)\\n c = c.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nodes).val\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.List=[]\\n while head:\\n self.List.append(head.val)\\n head=head.next\\n \\n\\n def getRandom(self) -> int:\\n return self.List[random.randrange(len(self.List))]\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.d = []\\n while(head):\\n self.d.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.d)\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.range = []\\n while head:\\n self.range.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n idx = int(random.random() * len(self.range))\\n return self.range[idx]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.ans=[]\\n curr=head\\n while(curr!=None):\\n self.ans.append(curr)\\n curr=curr.next\\n self.length=len(self.ans) \\n\\n def getRandom(self) -> int:\\n idx=random.randint(0,self.length-1)\\n return self.ans[idx].val\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.store = []\\n current = head\\n while current:\\n self.store.append(current.val)\\n current = current.next\\n\\n def getRandom(self) -> int:\\n idx = int(random.random() * len(self.store))\\n return self.store[idx]\\n \\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.res = []\\n curr = head\\n while curr:\\n self.res.append(curr.val)\\n curr = curr.next\\n\\n def getRandom(self) -> int:\\n return self.res[random.randint(0,len(self.res) - 1)]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, head: ListNode):\\n self.res = []\\n curr = head\\n while curr:\\n self.res.append(curr)\\n curr = curr.next\\n self.length = len(self.res)\\n\\n def getRandom(self) -> int:\\n index = random.randint(0, self.length - 1)\\n return self.res[index].val\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n length = 0\\n while head:\\n head = head.next\\n length += 1\\n self.length = length\\n\\n def getRandom(self) -> int:\\n cdf_sample = random.uniform(0, 1.0)\\n # head = copy.deepcopy(self.head)\\n head = self.head\\n index = 1\\n while head:\\n # print(cdf_sample, index/self.length)\\n if cdf_sample <= index/self.length:\\n # print(f'returning {head.val}')\\n return head.val\\n head = head.next\\n index += 1\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.arr = []\\n\\n def createList(self):\\n while self.head != None:\\n self.arr.append(self.head.val)\\n self.head = self.head.next\\n \\n def getRandom(self) -> int:\\n if len(self.arr) == 0:\\n self.createList()\\n index = random.randint(0, len(self.arr) - 1)\\n return self.arr[index]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.root = []\\n self.linedListToList(head)\\n \\n def linedListToList(self,data) : \\n while(data is not None):\\n self.root.append(data.val)\\n data = data.next\\n \\n def getRandom(self) -> int:\\n \\n return random.choice(self.root)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n count = 1\\n cur = self.head\\n while cur:\\n val = random.random()\\n if val < 1 / count:\\n chosen_value = cur.val\\n cur = cur.next\\n count += 1\\n return chosen_value\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n # O(n)\\n self.node = []\\n while head:\\n self.node.append(head)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n i = random.randint(0, len(self.node)-1)\\n return self.node[i].val\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.a=[]\\n b=head\\n while(b):\\n self.a.append(b.val)\\n b=b.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.a)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n \\n def get_len(self, head):\\n if not head: return 0\\n return 1 + self.get_len(head.next)\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.len = self.get_len(head)\\n self.head = head\\n \\n \\n\\n def getRandom(self) -> int:\\n rand_index = random.randint(1, self.len)\\n \\n head = self.head\\n while head:\\n rand_index -= 1\\n if rand_index == 0:\\n return head.val\\n head = head.next\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.arr = []\\n while head:\\n self.arr.append(head)\\n head = head.next\\n \\n def getRandom(self) -> int:\\n return random.choice(self.arr).val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n curr = head\\n n = 0\\n while curr:\\n n += 1\\n curr = curr.next\\n self.n = n\\n def getRandom(self) -> int:\\n idx = random.randint(0, self.n-1)\\n i = 0\\n curr = self.head\\n while i < idx:\\n curr = curr.next\\n i += 1\\n return curr.val\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n length = 0\\n while head:\\n head = head.next\\n length += 1\\n self.length = length\\n\\n def getRandom(self) -> int:\\n cdf_sample = random.uniform(0, 1.0)\\n # head = copy.deepcopy(self.head)\\n head = self.head\\n index = 1\\n while head:\\n # print(cdf_sample, index/self.length)\\n if cdf_sample <= index/self.length:\\n # print(f'returning {head.val}')\\n return head.val\\n head = head.next\\n index += 1\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.vals = []\\n if head.val or head.val == 0:\\n while head.next or head.next == 0:\\n self.vals.append(head.val)\\n head = head.next\\n self.vals.append(head.val)\\n\\n def getRandom(self) -> int:\\n if self.vals:\\n return random.choice(self.vals)\\n return 0\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.res = []\\n while head:\\n self.res.append(head.val)\\n head = head.next\\n return\\n\\n def getRandom(self) -> int:\\n t = randint(0,len(self.res)-1)\\n return self.res[t]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.values = []\\n \\n while head is not None:\\n self.values.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.n = 0\\n while head is not None:\\n self.n += 1\\n head = head.next\\n\\n def getRandom(self) -> int:\\n rand_n = random.randrange(self.n)\\n head = self.head\\n for _ in range(rand_n):\\n head = head.next\\n return head.val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, head: ListNode):\\n self.nodes = []\\n while head:\\n self.nodes.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.nodes)\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nfrom random import random\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n cur_node = self.head\\n\\n res = -1\\n i = 1\\n while(cur_node):\\n if(random() < (1 / i)):\\n res = cur_node.val\\n i += 1\\n cur_node = cur_node.next\\n \\n return res\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.rnd = Random()\\n size = 0\\n curr = head\\n while curr:\\n curr = curr.next\\n size += 1\\n self.size = size\\n\\n def getRandom(self) -> int:\\n selection = self.rnd.randint(0, self.size - 1)\\n curr = self.head\\n while selection:\\n curr = curr.next\\n selection -= 1\\n return curr.val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.node_count = 0\\n node = head\\n while node is not None:\\n self.node_count += 1\\n node = node.next\\n\\n def getRandom(self) -> int:\\n selected_idx = random.randrange(0, self.node_count)\\n node = self.head\\n for _ in range(selected_idx):\\n node = node.next\\n return node.val\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, head: ListNode):\\n self.res = []\\n curr = head\\n while curr:\\n self.res.append(curr)\\n curr = curr.next\\n self.length = len(self.res)\\n\\n def getRandom(self) -> int:\\n index = random.randint(0, self.length - 1)\\n return self.res[index].val\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.d = {}\\n count = 0\\n node = head\\n while node:\\n self.d[count] = node\\n count += 1\\n node = node.next\\n self.total = count\\n \\n\\n def getRandom(self) -> int:\\n rand = random.randint(0, self.total-1)\\n return self.d[rand].val\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.length = 0\\n while head.next:\\n self.length += 1\\n head = head.next\\n\\n def getRandom(self) -> int:\\n random_indx = random.randint(0, self.length)\\n node = self.head\\n random_node = None\\n while node:\\n if random_indx == 0:\\n random_node = node.val\\n random_indx -= 1\\n node = node.next\\n return random_node\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.n = 0\\n while head is not None:\\n self.n += 1\\n head = head.next\\n\\n def getRandom(self) -> int:\\n rand_n = random.randint(0, self.n - 1)\\n head = self.head\\n for _ in range(rand_n):\\n head = head.next\\n return head.val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"import random\\n\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: ListNode):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = None\\n current = self.head\\n count = 0\\n \\n while current:\\n count += 1\\n if random.random() < 1 / count:\\n result = current.val\\n current = current.next\\n \\n return result\\n\\n# Example usage:\\n# head = ListNode(1, ListNode(2, ListNode(3)))\\n# obj = Solution(head)\\n# print(obj.getRandom()) # Output will be one of 1, 2, or 3 with equal probability\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.elems = []\\n while head:\\n self.elems.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return random.choices(self.elems)[0]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n def __init__(self, head: ListNode):\\n self.head = head # Store the head of the linked list\\n \\n def getRandom(self) -> int:\\n # Initialize variables\\n result = None\\n current = self.head\\n index = 0\\n \\n # Traverse the linked list\\n while current is not None:\\n # Increment index\\n index += 1\\n \\n # Use reservoir sampling: with probability 1/index, select the current node\\n if random.random() < 1 / index:\\n result = current.val\\n \\n # Move to the next node\\n current = current.next\\n \\n return result\\n\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n scope = 1\\n chosen_value = 0\\n curr = self.head\\n while curr:\\n if random.random() <= 1 / scope:\\n chosen_value = curr.val\\n curr = curr.next\\n scope += 1\\n return chosen_value\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self._h = head\\n\\n def getRandom(self) -> int:\\n n = 1\\n rv = 0\\n cn = self._h\\n \\n while cn:\\n if random.random() < 1 / n:\\n rv = cn.val\\n cn = cn.next\\n n += 1\\n \\n return rv\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n num_nodes = 0\\n current_node = self.head\\n\\n while current_node != None:\\n num_nodes += 1\\n current_node = current_node.next\\n\\n if num_nodes == 1:\\n return 1\\n\\n random_node = random.randint(0, num_nodes - 1)\\n\\n current_node = self.head\\n node_count = 0\\n while current_node != None and node_count != (random_node):\\n node_count += 1\\n current_node = current_node.next\\n\\n return current_node.val\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n n = 1\\n val = 0\\n cur = self.head\\n while cur:\\n if random.random() < 1 / n:\\n val = cur.val\\n cur = cur.next\\n n += 1\\n \\n return val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: ListNode):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = self.head.val\\n node, n = self.head, 1\\n while node:\\n if random.random() < 1 / n:\\n result = node.val\\n node = node.next\\n n += 1\\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.aux=[]\\n while head!=None:\\n self.aux.append(head.val)\\n head=head.next\\n self.prob=[1/len(self.aux)]*len(self.aux)\\n \\n\\n def getRandom(self) -> int:\\n return random.choices(self.aux,self.prob)[0]\\n\\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n a = {}\\n tail = self.head\\n count = 1 \\n while tail:\\n a[count] = tail\\n tail = tail.next\\n count += 1 \\n # print(a)\\n b = random.randint(1,count-1)\\n c = a[b]\\n return c.val \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.rand = random.Random()#a float [0, 1)\\n \\n\\n def getRandom(self) -> int:\\n temp = self.head #因为会被call很多次，所以要用一个temp\\n selected = -1\\n i = 1\\n \\n while temp:\\n if self.rand.random() < 1.0 / i:#<\\n selected = temp.val #\\n temp = temp.next\\n i += 1\\n \\n return selected\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = self.head.val\\n node, n = self.head, 1\\n while node:\\n if random.random() < 1 / n:\\n result = node.val\\n node = node.next\\n n += 1\\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\n\\nclass Solution:\\n nums = []\\n def __init__(self, head):\\n self.nums.clear()\\n while (head != None):\\n print(head.val)\\n self.nums.append(head.val)\\n head = head.next \\n\\n def getRandom(self):\\n print(self.nums)\\n return random.choice(self.nums)\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head=head\\n self.counter=0\\n \\n temp=self.head\\n while temp:\\n \\n self.counter+=1\\n temp=temp.next\\n \\n \\n \\n \\n \\n \\n \\n \\n \\n\\n def getRandom(self) -> int:\\n \\n value=random.randint(0,self.counter-1)\\n print(\\\"this is value\\\",value)\\n temp=self.head\\n \\n \\n def recursion(head,value):\\n \\n if value==0:\\n return head.val\\n \\n if not head:\\n return \\n \\n \\n \\n return recursion(head.next,value-1)\\n \\n return recursion(self.head,value)\\n \\n \\n \\n \\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.n = self.getLen()\\n\\n def getRandom(self) -> int:\\n node, k = self.head, self.n\\n while randrange(k):\\n node = node.next\\n k -= 1\\n return node.val\\n \\n def getLen(self) -> int:\\n node, cnt = self.head, 0\\n while node:\\n node = node.next\\n cnt += 1\\n return cnt\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.n = self.getLen()\\n\\n def getRandom(self) -> int:\\n node, k = self.head, self.n\\n while randint(0, k-1):\\n node = node.next\\n k -= 1\\n return node.val\\n \\n def getLen(self) -> int:\\n node, cnt = self.head, 0\\n while node:\\n node = node.next\\n cnt += 1\\n return cnt\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n cur_size = 0\\n walk = head\\n while walk:\\n cur_size += 1\\n walk = walk.next\\n self.size = cur_size\\n \\n\\n def getRandom(self) -> int:\\n n = self.size\\n walk = self.head\\n while random.randint(1, n) != 1:\\n n -= 1\\n walk = walk.next\\n return walk.val\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.linkedlist = head\\n\\n def getRandom(self) -> int:\\n random_num = 0\\n curr=self.linkedlist\\n elements_list = []\\n while curr!=None:\\n elements_list.append(curr.val)\\n random_num=random.choice(elements_list)\\n curr=curr.next\\n return random_num\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n \\n \\n curr = self.head\\n k = 0\\n res = 0\\n while curr :\\n\\n if k == 0 :\\n res = curr.val\\n \\n \\n else :\\n \\n idx = random.randint(0,k)\\n if idx == k :\\n res = curr.val\\n\\n k = k+1\\n curr = curr.next\\n \\n return res\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n\\n def getRandom(self) -> int:\\n n = 0\\n cur = self.head\\n pick = None\\n\\n while cur:\\n n += 1\\n idx = random.randrange(n)\\n if idx < 1:\\n pick = cur\\n cur = cur.next\\n \\n return pick.val\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = None\\n current = self.head\\n count = 0\\n \\n while current:\\n count += 1\\n # Generate a random number between 1 and the count of nodes visited so far\\n # If the random number is 1, replace the result with the current node's value\\n if random.randint(1, count) == 1:\\n result = current.val\\n current = current.next\\n \\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n\\n def getRandom(self) -> int:\\n count = 0\\n ret = -1\\n cur = self.head\\n while cur:\\n count += 1\\n if random.randrange(count) == 0:\\n ret = cur.val\\n cur = cur.next\\n return ret\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = self.head.val\\n current, n = self.head.next, 1\\n while current:\\n if random.randint(0, n) == 0:\\n result = current.val\\n current = current.next\\n n += 1\\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = None\\n current = self.head\\n count = 0\\n \\n while current:\\n count += 1\\n if random.randint(1, count) == 1:\\n result = current.val\\n current = current.next\\n \\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\nfrom typing import Optional\\nimport random\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n def getRandom(self) -> int:\\n idx = 0\\n samples = []\\n k = 1\\n node = self.head\\n while node:\\n if idx < k:\\n samples.append(node.val)\\n else:\\n selected_idx = random.randrange(0, idx+1)\\n if selected_idx < k:\\n samples[selected_idx] = node.val\\n \\n idx += 1\\n node = node.next\\n return samples[0]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result, node, index = self.head.val, self.head.next, 1\\n while node:\\n if random.randint(0, index) == 0:\\n result = node.val\\n node = node.next\\n index += 1\\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, head: ListNode):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result, node, index = self.head, self.head.next, 1\\n while node:\\n if random.randint(0, index) == 0:\\n result = node\\n node = node.next\\n index += 1\\n return result.val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n\\n def getRandom(self) -> int:\\n curr = self.head\\n count = 1\\n val = curr.val\\n while curr.next is not None:\\n curr = curr.next\\n count += 1\\n if randint(1, count) == 1:\\n val = curr.val\\n return val\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n ans = self.head.val\\n i = 0\\n cur = self.head\\n while cur:\\n if random.randint(0, i) == 0:\\n ans = cur.val\\n cur = cur.next\\n i += 1\\n\\n return ans\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\nfrom typing import Optional\\nimport random\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n def getRandom(self) -> int:\\n idx = 0\\n samples = []\\n k = 1\\n node = self.head\\n while node:\\n if idx < k:\\n samples.append(node.val)\\n else:\\n selected_idx = random.randrange(0, idx+1)\\n if selected_idx < k:\\n samples[selected_idx] = node.val\\n \\n idx += 1\\n node = node.next\\n return samples[0]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n curr = self.head\\n ct = 0\\n picked_val = 0\\n\\n while curr:\\n if random.randint(0, ct) == ct:\\n picked_val = curr.val\\n \\n ct += 1\\n curr = curr.next\\n \\n return picked_val\\n \\n# Think reservoir sampling when you find random things.\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\n\\nclass Solution:\\n def __init__(self, head: ListNode | None):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n res = -1\\n i = 1\\n curr = self.head\\n\\n while curr:\\n if random.randint(0, i - 1) == 0:\\n res = curr.val\\n curr = curr.next\\n i += 1\\n\\n return res\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"import random\\n\\n\\nclass Solution:\\n\\n def __init__(self, head: ListNode):\\n \\\"\\\"\\\"\\n Initializes the object with the head of the singly-linked list head.\\n \\\"\\\"\\\"\\n self.head = head\\n\\n def getRandom(self) -> int:\\n \\\"\\\"\\\"\\n Returns a random node's value from the list.\\n \\\"\\\"\\\"\\n result = self.head.val\\n current_node = self.head.next\\n index = 1\\n\\n # Traverse the list starting from the second node\\n while current_node:\\n # Randomly select the current node's value with a probability of 1 / (index + 1)\\n if random.randint(0, index) == 0:\\n result = current_node.val\\n current_node = current_node.next\\n index += 1\\n \\n return result\\n\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"import random\\n\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n def __init__(self, head: ListNode):\\n self.head = head\\n \\n def getRandom(self) -> int:\\n current = self.head\\n reservoir = None\\n count = 0\\n \\n while current:\\n count += 1\\n # Decide whether to replace the reservoir with the current node\\n if random.randint(1, count) == count:\\n reservoir = current.val\\n current = current.next\\n \\n return reservoir\\n\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n # Reservoir sampling and K == 1\\n def getRandom(self) -> int:\\n ans = 0\\n p, i = self.head, 0\\n while p is not None:\\n if random.randint(0, i) == 0:\\n ans = p.val\\n p = p.next\\n i += 1\\n return ans\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n current = self.head\\n resorvoir = current.val\\n count = 1\\n while current:\\n if random.randint(1,count)==1:\\n resorvoir = current.val\\n current = current.next\\n count+=1\\n return resorvoir\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n INF = int(2e9)\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n def getRandom(self) -> int:\\n count,output = 0, 0\\n temp = self.head\\n while temp:\\n count += 1\\n if random.randint(1,count) == 1: \\n # both bounds included, == k can be anything \\n # for 1 <= k <= count since prob is 1/count\\n output = temp.val\\n temp = temp.next\\n return output\\n\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.L = head\\n \\n\\n def getRandom(self) -> int:\\n chosen = None\\n elems = 1\\n p = self.L\\n while p:\\n pick = random.randint(1, elems)\\n if pick == 1:\\n chosen = p\\n elems += 1\\n p = p.next\\n return chosen.val\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.head =head\\n\\n def getRandom(self) -> int:\\n temp, i = self.head, 0\\n ans = 0\\n\\n while temp:\\n if randint(0,i) == 0:\\n ans = temp.val\\n i+=1\\n temp = temp.next\\n \\n return ans\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\nfrom typing import Optional\\nimport random\\nclass Solution:\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n def getRandom(self) -> int:\\n idx = 0\\n samples = []\\n k = 1\\n node = self.head\\n while node:\\n if idx < k:\\n samples.append(node.val)\\n else:\\n selected_idx = random.randint(0, idx)\\n if selected_idx < k:\\n samples[selected_idx] = node.val\\n \\n idx += 1\\n node = node.next\\n return samples[0]\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\n\\nclass Solution:\\n def __init__(self, head: ListNode | None):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n res = -1\\n i = 1\\n curr = self.head\\n\\n while curr:\\n if random.randint(0, i - 1) == 0:\\n res = curr.val\\n curr = curr.next\\n i += 1\\n\\n return res\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n \\n\\n def getRandom(self) -> int:\\n\\n curr = self.head\\n val = curr.val\\n i = 0\\n while curr.next:\\n curr = curr.next\\n i += 1\\n if random.randint(0,i) == 0:\\n val = curr.val\\n \\n return val\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n result = None\\n current = self.head\\n count = 0\\n \\n while current:\\n count += 1\\n if random.randint(1, count) == 1:\\n result = current.val\\n current = current.next\\n \\n return result\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nimport random\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def getRandom(self) -> int:\\n if self.head.next is None:\\n return self.head.val\\n \\n result = self.head\\n curr = self.head\\n n = 1\\n\\n while curr:\\n if random.randint(1,n) == 1:\\n result = curr\\n curr = curr.next\\n n += 1\\n \\n return result.val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.cur = head\\n self.result = 0\\n\\n def getRandom(self) -> int:\\n count = 0\\n while self.cur != None:\\n count += 1\\n if random.randint(1, count) == 1:\\n self.result = self.cur.val\\n self.cur = self.cur.next\\n self.cur = self.head\\n return self.result\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"runtime\": \"119\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":80,"string":"80"},"mm_list":{"kind":"list like","value":[{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n\n def get_length(self):\n count = 0\n itr = self.head\n while itr:\n count += 1\n itr = itr.next\n return count\n\n def getRandom(self) -> int:\n chosen = random.randrange(self.get_length())\n itr = self.head\n for i in range(chosen):\n itr = itr.next\n return itr.val\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"18900"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.values = []\n self.traverse(head)\n \n def traverse(self, head):\n temp = head\n while temp:\n self.values.append(temp.val)\n temp = temp.next\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19000"},{"code":"import random\n\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n def __init__(self, head: ListNode):\n self.head = head\n \n def getRandom(self) -> int:\n current = self.head\n reservoir = None\n count = 0\n \n while current:\n count += 1\n # Decide whether to replace the reservoir with the current node\n if random.randint(1, count) == count:\n reservoir = current.val\n current = current.next\n \n return reservoir\n","memory":"19100"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.values = []\n \n while head is not None:\n self.values.append(head.val)\n head = head.next\n\n def getRandom(self) -> int:\n return random.choice(self.values)\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19200"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.n = 0\n while head is not None:\n self.n += 1\n head = head.next\n\n def getRandom(self) -> int:\n rand_n = random.randrange(self.n)\n head = self.head\n for _ in range(rand_n):\n head = head.next\n return head.val\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19200"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.arr = []\n\n def createList(self):\n while self.head != None:\n self.arr.append(self.head.val)\n self.head = self.head.next\n \n def getRandom(self) -> int:\n if len(self.arr) == 0:\n self.createList()\n index = random.randint(0, len(self.arr) - 1)\n return self.arr[index]\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19300"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.root = []\n self.linedListToList(head)\n \n def linedListToList(self,data) : \n while(data is not None):\n self.root.append(data.val)\n data = data.next\n \n def getRandom(self) -> int:\n \n return random.choice(self.root)\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19300"},{"code":"# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.vals = []\n if head.val or head.val == 0:\n while head.next or head.next == 0:\n self.vals.append(head.val)\n head = head.next\n self.vals.append(head.val)\n\n def getRandom(self) -> int:\n if self.vals:\n return random.choice(self.vals)\n return 0\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19400"},{"code":"import random\n# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n\n def __init__(self, head: Optional[ListNode]):\n self.head = head\n self.node_count = 0\n node = head\n while node is not None:\n self.node_count += 1\n node = node.next\n\n def getRandom(self) -> int:\n selected_idx = random.randrange(0, self.node_count)\n node = self.head\n for _ in range(selected_idx):\n node = node.next\n return node.val\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(head)\n# param_1 = obj.getRandom()","memory":"19400"},{"code":"import random\n\n# Definition for singly-linked list.\nclass ListNode:\n def __init__(self, val=0, next=None):\n self.val = val\n self.next = next\n\nclass Solution:\n def __init__(self, head: ListNode):\n self.stack = [] \n self.n = 0 \n while head:\n self.stack.append(head.val)\n self.n += 1\n head = head.next\n\n tp = 0 \n self.cumm = []\n for i in range(self.n):\n tp += 1 / self.n \n self.cumm.append(tp)\n \n def getRandom(self) -> int:\n curr = random.random() \n for i in range(len(self.cumm)):\n if curr < self.cumm[i]:\n return self.stack[i] \n\n","memory":"19500"}],"string":"[\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n\\n def get_length(self):\\n count = 0\\n itr = self.head\\n while itr:\\n count += 1\\n itr = itr.next\\n return count\\n\\n def getRandom(self) -> int:\\n chosen = random.randrange(self.get_length())\\n itr = self.head\\n for i in range(chosen):\\n itr = itr.next\\n return itr.val\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.values = []\\n self.traverse(head)\\n \\n def traverse(self, head):\\n temp = head\\n while temp:\\n self.values.append(temp.val)\\n temp = temp.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"import random\\n\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n def __init__(self, head: ListNode):\\n self.head = head\\n \\n def getRandom(self) -> int:\\n current = self.head\\n reservoir = None\\n count = 0\\n \\n while current:\\n count += 1\\n # Decide whether to replace the reservoir with the current node\\n if random.randint(1, count) == count:\\n reservoir = current.val\\n current = current.next\\n \\n return reservoir\\n\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.values = []\\n \\n while head is not None:\\n self.values.append(head.val)\\n head = head.next\\n\\n def getRandom(self) -> int:\\n return random.choice(self.values)\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.n = 0\\n while head is not None:\\n self.n += 1\\n head = head.next\\n\\n def getRandom(self) -> int:\\n rand_n = random.randrange(self.n)\\n head = self.head\\n for _ in range(rand_n):\\n head = head.next\\n return head.val\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.arr = []\\n\\n def createList(self):\\n while self.head != None:\\n self.arr.append(self.head.val)\\n self.head = self.head.next\\n \\n def getRandom(self) -> int:\\n if len(self.arr) == 0:\\n self.createList()\\n index = random.randint(0, len(self.arr) - 1)\\n return self.arr[index]\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.root = []\\n self.linedListToList(head)\\n \\n def linedListToList(self,data) : \\n while(data is not None):\\n self.root.append(data.val)\\n data = data.next\\n \\n def getRandom(self) -> int:\\n \\n return random.choice(self.root)\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.vals = []\\n if head.val or head.val == 0:\\n while head.next or head.next == 0:\\n self.vals.append(head.val)\\n head = head.next\\n self.vals.append(head.val)\\n\\n def getRandom(self) -> int:\\n if self.vals:\\n return random.choice(self.vals)\\n return 0\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"import random\\n# Definition for singly-linked list.\\n# class ListNode:\\n# def __init__(self, val=0, next=None):\\n# self.val = val\\n# self.next = next\\nclass Solution:\\n\\n def __init__(self, head: Optional[ListNode]):\\n self.head = head\\n self.node_count = 0\\n node = head\\n while node is not None:\\n self.node_count += 1\\n node = node.next\\n\\n def getRandom(self) -> int:\\n selected_idx = random.randrange(0, self.node_count)\\n node = self.head\\n for _ in range(selected_idx):\\n node = node.next\\n return node.val\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(head)\\n# param_1 = obj.getRandom()\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"import random\\n\\n# Definition for singly-linked list.\\nclass ListNode:\\n def __init__(self, val=0, next=None):\\n self.val = val\\n self.next = next\\n\\nclass Solution:\\n def __init__(self, head: ListNode):\\n self.stack = [] \\n self.n = 0 \\n while head:\\n self.stack.append(head.val)\\n self.n += 1\\n head = head.next\\n\\n tp = 0 \\n self.cumm = []\\n for i in range(self.n):\\n tp += 1 / self.n \\n self.cumm.append(tp)\\n \\n def getRandom(self) -> int:\\n curr = random.random() \\n for i in range(len(self.cumm)):\\n if curr < self.cumm[i]:\\n return self.stack[i] \\n\\n\",\n \"memory\": \"19500\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":286,"cells":{"question_id":{"kind":"number","value":383,"string":"383"},"name":{"kind":"string","value":"ransom-note"},"content":{"kind":"string","value":"<p>Given two strings <code>ransomNote</code> and <code>magazine</code>, return <code>true</code><em> if </em><code>ransomNote</code><em> can be constructed by using the letters from </em><code>magazine</code><em> and </em><code>false</code><em> otherwise</em>.</p>\n\n<p>Each letter in <code>magazine</code> can only be used once in <code>ransomNote</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> ransomNote = \"a\", magazine = \"b\"\n<strong>Output:</strong> false\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> ransomNote = \"aa\", magazine = \"ab\"\n<strong>Output:</strong> false\n</pre><p><strong class=\"example\">Example 3:</strong></p>\n<pre><strong>Input:</strong> ransomNote = \"aa\", magazine = \"aab\"\n<strong>Output:</strong> true\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= ransomNote.length, magazine.length <= 10<sup>5</sup></code></li>\n\t<li><code>ransomNote</code> and <code>magazine</code> consist of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":62.61499244221837,"string":"62.614992"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["hash-table","string","counting"],"string":"[\n \"hash-table\",\n \"string\",\n \"counting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"17\", 0.0037], [\"20\", 0.0037], [\"22\", 0.0148], [\"23\", 0.0111], [\"24\", 0.0185], [\"25\", 0.0148], [\"26\", 0.0554], [\"27\", 0.0406], [\"28\", 0.0665], [\"29\", 0.0849], [\"30\", 0.2401], [\"31\", 0.2068], [\"32\", 0.2511], [\"33\", 0.3361], [\"34\", 0.4986], [\"35\", 0.5134], [\"36\", 0.4912], [\"37\", 0.6352], [\"38\", 0.9196], [\"39\", 0.9196], [\"40\", 0.9344], [\"41\", 1.2299], [\"42\", 1.4847], [\"43\", 1.3259], [\"44\", 1.5623], [\"45\", 1.7949], [\"46\", 1.9021], [\"47\", 1.9353], [\"48\", 2.1015], [\"49\", 2.36], [\"50\", 2.8143], [\"51\", 2.6592], [\"52\", 2.9214], [\"53\", 3.1467], [\"54\", 3.3388], [\"55\", 3.191], [\"56\", 3.1578], [\"57\", 3.0137], [\"58\", 3.42], [\"59\", 3.4606], [\"60\", 3.1873], [\"61\", 3.1578], [\"62\", 3.3351], [\"63\", 3.4089], [\"64\", 3.0396], [\"65\", 2.8845], [\"66\", 3.1541], [\"67\", 2.7404], [\"68\", 2.408], [\"69\", 2.2455], [\"70\", 1.9279], [\"71\", 1.7654], [\"72\", 1.3702], [\"73\", 1.0784], [\"74\", 0.9676], [\"75\", 0.6759], [\"76\", 0.5688], [\"77\", 0.5466], [\"78\", 0.4543], [\"79\", 0.4949], [\"80\", 0.2807], [\"81\", 0.3546], [\"82\", 0.2438], [\"83\", 0.2364], [\"84\", 0.1551], [\"85\", 0.1847], [\"86\", 0.2068], [\"87\", 0.1957], [\"88\", 0.1588], [\"89\", 0.133], [\"90\", 0.1256], [\"91\", 0.1219]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0037], [\"16200\", 0.0037], [\"16300\", 0.048], [\"16400\", 0.7202], [\"16500\", 9.0006], [\"16600\", 26.1375], [\"16700\", 41.9634], [\"16800\", 14.921]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(ransomNote) > len(magazine):\n return False\n \n for c in set(ransomNote):\n if magazine.count(c) < ransomNote.count(c):\n return False\n return True","runtime":"17"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n if len(ransomNote)>len(magazine):\n return False\n\n for char in ransomNote:\n if char in magazine:\n magazine = magazine.replace(char,'',1)\n else:\n return False\n \n return True\n \n \n ","runtime":"20"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for i in ransomNote:\n if i not in magazine:\n return False\n else:\n magazine = magazine.replace(i,\"\",1)\n return True\n \n\n # letter_count = {}\n # for i in ransomNote:\n # if letter_count.get(i) is None:\n # letter_count[i] = ransomNote.count(i)\n \n # for letter in letter_count.keys():\n # if letter_count[letter] > magazine.count(letter):\n # return False\n\n # return True","runtime":"22"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n #if len(ransomNote) >= len(magazine):\n # return False\n #dict = {}\n #for char in magazine:\n # if char in dict:\n # dict[char] += 1\n # else:\n # dict[char] =1\n \n # for char in ransomNote:\n # if char in dict:\n # dict[char] -=1\n # else:\n # return False\n #return True\n alphabet = [0] * 26\n for c in ransomNote:\n idx = ord(c) - ord('a')\n i = magazine.find(c, alphabet[idx])\n if i == -1:\n return False\n alphabet[idx] = i + 1\n return True\n","runtime":"23"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool: \n for x in ransomNote:\n if x in magazine:\n magazine = magazine[:magazine.find(x)] + magazine[magazine.find(x) + 1:]\n else:\n return False\n return True","runtime":"24"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for letter in ransomNote:\n if letter in magazine:\n magazine = magazine.replace(letter, '', 1)\n else:\n return False\n \n return True\n\n # This works but the solution above is way faster\n # mag_dict = {}\n # # O(n) creation of dictionary\n # for letter in magazine:\n # if mag_dict.get(letter) == None:\n # mag_dict[letter] = 1\n # else:\n # mag_dict[letter] = mag_dict.get(letter) + 1\n\n # # O(n) loop through ransomNote\n # for letter in ransomNote:\n # if mag_dict.get(letter) and mag_dict.get(letter) > 0:\n # mag_dict[letter] = mag_dict.get(letter) - 1 \n # else:\n # return False\n\n # return True\n\n","runtime":"25"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for letter in list(set(ransomNote)):\n if ransomNote.count(letter) > magazine.count(letter): return False\n return True","runtime":"25"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n \n for x in ransomNote:\n if x not in magazine:\n return False\n else:\n magazine = magazine.replace(x,'',1)\n \n return True","runtime":"26"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransomNoteCounter = Counter(ransomNote)\n magazineCounter = Counter(magazine)\n\n for k, v in ransomNoteCounter.items():\n if k not in magazineCounter or magazineCounter[k] < v:\n return False\n return True","runtime":"27"},{"code":"from collections import defaultdict\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n char_count = defaultdict(int)\n for char in ransomNote:\n char_count[char] += 1\n \n for letter, freq in char_count.items():\n if freq > magazine.count(letter):\n return False\n \n return True\n \n\n ","runtime":"28"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n #iterate through a list of a set of the ransomNote\n for i in list(set(ransomNote)):\n #if the count at i for that letter does not match return false\n if ransomNote.count(i) > magazine.count(i):\n return False\n #return true\n return True\n\n ","runtime":"29"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for char in ransomNote:\n if char in magazine:\n magazine = magazine.replace(char, '', 1)\n else:\n return False\n return True","runtime":"30"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(ransomNote) > len(magazine):\n return False\n else:\n for letter in ransomNote:\n temp = magazine\n magazine = magazine.replace(letter, \"\", 1)\n if magazine == temp:\n return False\n return True\n","runtime":"31"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n for letter in list(set(ransomNote)):\n if ransomNote.count(letter) > magazine.count(letter): return False\n return True\n\n # h = {}\n # for i in magazine:\n # if i not in h:\n # h[i] = 1\n # else:\n # h[i] += 1\n # for i in ransomNote:\n # if i not in h:\n # return False\n # else:\n # if h[i] < 1:\n # return False\n # else:\n # h[i] -= 1\n # return True","runtime":"31"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n c1 = Counter(ransomNote)\n c2 = Counter(magazine)\n return (c1 & c2) == c1\n ","runtime":"32"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for c in ransomNote:\n if c in magazine:\n magazine = magazine.replace(c, '', 1)\n else:\n return False\n return True\n ","runtime":"33"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for letter in list(set(ransomNote)):\n if ransomNote.count(letter) > magazine.count(letter): return False\n return True","runtime":"33"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n set_a = set(ransomNote)\n \n for i in set_a:\n if magazine.count(i) < ransomNote.count(i):\n return False\n return True","runtime":"34"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for i in ransomNote:\n if i in magazine:\n magazine = magazine.replace(i,'',1)\n else:\n return False\n return True","runtime":"35"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n while ransomNote:\n for char in ransomNote:\n if char not in magazine:\n return False\n else:\n index = magazine.index(char)\n magazine = magazine[:index] + magazine[index+1:]\n ransomNote = ransomNote[1:]\n return True","runtime":"36"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n seen = set(ransomNote)\n\n for char in seen:\n if magazine.count(char) < ransomNote.count(char):\n return False\n return True","runtime":"37"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for ele in ransomNote:\n if ele not in magazine:\n return False\n else:\n magazine=magazine.replace(ele,\"\",1)\n return True\n ","runtime":"38"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for i in ransomNote:\n if i in magazine:\n magazine = magazine.replace(i,\" \",1)\n else:\n return False\n return True\n ","runtime":"40"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n rNset = set(ransomNote)\n mset = set(magazine)\n\n for char in rNset:\n if ransomNote.count(char) > magazine.count(char):\n return False\n\n return True","runtime":"40"},{"code":"# class Solution:\n# def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n# \"\"\"\n# Time = O(m), Space = O(k) or O(1), Approach 3: One Hashmap\n# m is the length of magazine, and k is the number of unique \n# characters across both the ransom note and magazine\n# \"\"\"\n# # 1) counter the letters in magazine string.\n# # 2) iterate through the ransomNote to check if there are\n# # still enough letters in magazines to match\n\n# if len(ransomNote) > len(magazine):\n# return False\n\n# hashmap = collections.Counter(magazine) # 1)\n\n# for char in ransomNote: # 2)\n# if hashmap[char] <= 0:\n# return False\n\n# hashmap[char] -= 1\n\n# return True \n\nclass Solution:\n def canConstruct(self, ransomNote, magazine):\n if len(ransomNote) > len(magazine):\n return False\n\n hashmap = collections.Counter(magazine)\n\n for char in ransomNote:\n if hashmap[char] <= 0:\n return False\n\n hashmap[char] -= 1\n\n return True","runtime":"41"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n # For each character, c, in the ransom note.\n for c in ransomNote:\n # If there are none of c left in the String, return False.\n if c not in magazine:\n return False\n # Find the index of the first occurrence of c in the magazine.\n location = magazine.index(c)\n # Use splicing to make a new string with the characters \n # before \"location\" (but not including), and the characters \n #after \"location\". \n magazine = magazine[:location] + magazine[location + 1:]\n # If we got this far, we can successfully build the note.\n return True","runtime":"41"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n st1, st2 = Counter(ransomNote), Counter(magazine)\n if st1 & st2 == st1:\n return True\n return False","runtime":"42"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for c in set(ransomNote):\n if c not in magazine or ransomNote.count(c) > magazine.count(c):\n return False\n return True\n","runtime":"42"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n counts_magazine = Counter(magazine)\n counts_ransomNote = Counter(ransomNote)\n for k in counts_ransomNote:\n if k not in counts_magazine or counts_magazine[k] < counts_ransomNote[k]:\n return False\n return True","runtime":"43"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n st1, st2 = Counter(ransomNote), Counter(magazine)\n if st1 & st2 == st1:\n return True\n return False","runtime":"43"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n magazine_chars = {}\n \n for char in ransomNote:\n if char in magazine:\n char_index = magazine.index(char)\n magazine = magazine[:char_index] + magazine[char_index+1:]\n else:\n return False\n return True","runtime":"44"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransomDict = {}\n \n for char in ransomNote:\n if char not in ransomDict:\n ransomDict[char] = 0\n \n ransomDict[char] += 1\n \n operations_done = 0\n\n for char in magazine:\n if char in ransomDict and ransomDict[char] > 0:\n ransomDict[char] -=1\n operations_done += 1\n \n if operations_done == len(ransomNote):\n return True\n \n return False\n\n\n # for char in magazine:\n # print(char)\n # ransomNote = ransomNote.replace(char, \"\", 1)\n # print(\"here\")\n # print(ransomNote)\n \n # return ransomNote == \"\"","runtime":"44"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n dic = Counter(magazine)\n for letter in ransomNote:\n if letter in dic:\n if dic[letter] == 1:\n del dic[letter]\n else:\n dic[letter] -= 1\n else:\n return False\n return True","runtime":"45"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for letter in set(ransomNote):\n if ransomNote.count(letter) > magazine.count(letter):\n return False\n return True\n ","runtime":"45"},{"code":"from collections import defaultdict, Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n d = dict(Counter(magazine))\n for x in ransomNote:\n if x not in d:\n return False\n else:\n d[x] -= 1\n if d[x] == 0:\n del d[x]\n return True","runtime":"46"},{"code":"from collections import defaultdict\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mag= defaultdict(int)\n ran=defaultdict(int)\n for char in magazine:\n mag[char]=mag[char]+1\n for char in ransomNote:\n if char not in mag:\n return False\n else :\n mag[char]=mag[char]-1\n if mag[char] <0 :\n return False\n return True","runtime":"46"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n countM = Counter(magazine)\n countR = Counter(ransomNote)\n for char, count in countR.items():\n magazine_count = countM[char]\n if magazine_count < count:\n return False\n return True","runtime":"47"},{"code":"from collections import Counter\n\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n # Count the frequency of each letter in ransomNote and magazine\n ransom_count = Counter(ransomNote)\n magazine_count = Counter(magazine)\n \n # Check if each letter in ransomNote has enough occurrences in magazine\n for letter, count in ransom_count.items():\n if magazine_count[letter] < count:\n return False\n \n return True","runtime":"47"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n r = Counter(ransomNote)\n m = Counter(magazine)\n for k,v in r.items():\n if v > m[k]:\n return False\n\n return True","runtime":"48"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n d={i:magazine.count(i) for i in set(magazine)}\n for char in ransomNote:\n try:\n if d[char]==0:\n return False\n d[char]-=1\n except KeyError:\n return False\n return True \n ","runtime":"48"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n m = Counter(magazine)\n r = Counter(ransomNote)\n\n for char , count in r.items():\n if m[char]<count:\n return False\n\n return True\n\n\n","runtime":"49"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n letters_dict = Counter(magazine)\n for char in ransomNote:\n if letters_dict.get(char, 0) < 1:\n return False\n letters_dict[char] -= 1\n\n return True","runtime":"49"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n count = Counter(magazine)\n for c in ransomNote:\n if c not in count:\n print(count, c)\n return False\n count[c] -= 1\n if count[c] == 0:\n del count[c]\n return True\n\n#Time: O(n)\n#Space: O(26) = O(1)","runtime":"50"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n from collections import Counter\n\n mag = Counter(magazine)\n\n for c in ransomNote:\n if c in mag:\n mag[c] -= 1\n else:\n return False\n\n if mag[c] < 0:\n return False\n \n return True\n ","runtime":"50"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n r_count = {}\n m_count = {}\n for i in ransomNote:\n if i not in magazine:\n return False\n if i not in r_count:\n r_count[i] = 1\n else:\n r_count[i] += 1\n for j in magazine:\n if j not in m_count:\n m_count[j] = 1\n else:\n m_count[j] += 1\n for i in r_count:\n if r_count[i] > m_count[i]:\n return False\n return True\n ","runtime":"51"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n countMagazine = defaultdict(int)\n for letter in magazine:\n countMagazine[letter] += 1\n countRansomNote = defaultdict(int)\n for letter in ransomNote:\n countRansomNote[letter] += 1\n if letter not in countMagazine:\n return False\n elif countRansomNote[letter] > countMagazine[letter]:\n return False\n return True","runtime":"51"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n # hashmap_ransomNote = {char:ransomNote.count(char) for char in ransomNote}\n\n # for key, value in hashmap_ransomNote.items():\n # if key not in magazine or value > magazine.count(key):\n # return False\n\n # return True\n\n hashmap_ransomNote = {}\n hashmap_magazine = {}\n\n for l in ransomNote:\n hashmap_ransomNote[l] = hashmap_ransomNote.get(l, 0) + 1\n \n for l in magazine:\n hashmap_magazine[l] = hashmap_magazine.get(l, 0) + 1\n \n for key, val in hashmap_ransomNote.items():\n if key not in hashmap_magazine or val > hashmap_magazine[key]:\n return False\n \n return True","runtime":"52"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n magazine_letter_dict = defaultdict(int)\n ransom_note_letter_dict = defaultdict(int)\n \n for letter in ransomNote:\n ransom_note_letter_dict[letter] += 1\n \n for letter in magazine:\n magazine_letter_dict[letter] += 1\n \n for letter in ransom_note_letter_dict:\n if letter not in magazine_letter_dict:\n return False\n elif ransom_note_letter_dict[letter] > magazine_letter_dict[letter]:\n return False\n else:\n continue\n return True\n \n \n ","runtime":"52"},{"code":"from collections import Counter\n\n\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(magazine) < len(ransomNote):\n return False\n\n magazineMap = Counter(magazine)\n\n for char in ransomNote:\n if char not in magazineMap or magazineMap[char] <= 0:\n return False\n \n magazineMap[char] -= 1\n\n return True\n","runtime":"53"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n ransomCount = {}\n magazineCount = {}\n\n for i in ransomNote:\n ransomCount[i] = ransomCount.get(i, 0) + 1\n \n for i in magazine:\n magazineCount[i] = magazineCount.get(i, 0) + 1\n\n for key, value in ransomCount.items():\n if key not in magazineCount or ransomCount[key] > magazineCount[key]:\n return False\n \n return True","runtime":"53"},{"code":"from collections import Counter\n\n\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(magazine) < len(ransomNote):\n return False\n\n magazineMap = Counter(magazine)\n\n for char in ransomNote:\n if char not in magazineMap:\n return False\n\n if magazineMap[char] == 0:\n return False\n \n magazineMap[char] -= 1\n\n return True\n","runtime":"54"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n table = {}\n for letter in magazine:\n if letter not in table:\n table[letter] = 1\n else:\n table[letter] += 1 \n for letters in ransomNote:\n if letters in table:\n table[letters] -= 1\n if table[letters] == 0:\n del table[letters]\n else:\n return False\n return True","runtime":"54"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n result = Counter(ransomNote) - Counter(magazine)\n if len(result) == 0:\n return True\n else:\n return False\n\n ","runtime":"55"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> int:\n # Count the frequency of each character in ransomNote and magazine\n ransomCount = Counter(ransomNote)\n magazineCount = Counter(magazine)\n \n # Check if magazine has enough characters to match the counts in ransomNote\n for char, count in ransomCount.items():\n if magazineCount[char] < count:\n return 0 # Return 0 for False\n \n return 1 # Return 1 for True\n ","runtime":"55"},{"code":"from collections import Counter\n\n\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(magazine) < len(ransomNote):\n return False\n\n magazineMap = Counter(magazine)\n\n for char in ransomNote:\n if char not in magazineMap:\n return False\n\n if magazineMap[char] == 0:\n return False\n \n magazineMap[char] -= 1\n\n return True\n","runtime":"56"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for char in magazine:\n ransomNote = ransomNote.replace(char, '', 1)\n return ransomNote == ''","runtime":"56"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ma_dic = {'a': 0,\n 'b': 0,\n 'c': 0,\n 'd': 0,\n 'e': 0,\n 'f': 0,\n 'g': 0,\n 'h': 0,\n 'i': 0,\n 'j': 0,\n 'k': 0,\n 'l': 0,\n 'm': 0,\n 'n': 0,\n 'o': 0,\n 'p': 0,\n 'q': 0,\n 'r': 0,\n 's': 0,\n 't': 0,\n 'u': 0,\n 'v': 0,\n 'w': 0,\n 'x': 0,\n 'y': 0,\n 'z': 0}\n note_dic = {'a': 0,\n 'b': 0,\n 'c': 0,\n 'd': 0,\n 'e': 0,\n 'f': 0,\n 'g': 0,\n 'h': 0,\n 'i': 0,\n 'j': 0,\n 'k': 0,\n 'l': 0,\n 'm': 0,\n 'n': 0,\n 'o': 0,\n 'p': 0,\n 'q': 0,\n 'r': 0,\n 's': 0,\n 't': 0,\n 'u': 0,\n 'v': 0,\n 'w': 0,\n 'x': 0,\n 'y': 0,\n 'z': 0}\n for c in magazine:\n ma_dic[c] += 1\n for c in ransomNote:\n note_dic[c] += 1\n for c in note_dic:\n if note_dic[c] > ma_dic[c]:\n return False\n return True","runtime":"57"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n magazine_letter_dict = defaultdict(int)\n ransom_note_letter_dict = defaultdict(int)\n \n for letter in ransomNote:\n ransom_note_letter_dict[letter] += 1\n \n for letter in magazine:\n magazine_letter_dict[letter] += 1\n \n for letter in ransom_note_letter_dict:\n if letter not in magazine_letter_dict:\n return False\n elif ransom_note_letter_dict[letter] > magazine_letter_dict[letter]:\n return False\n else:\n continue\n return True\n \n \n ","runtime":"57"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n rd, md = Counter(ransomNote), Counter(magazine)\n return all(rd[c] <= md[c] for c in rd)","runtime":"58"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n m = {}\n\n for i in magazine:\n m[i] = m.get(i, 0) + 1\n\n for ch in ransomNote:\n if ch not in m:\n return False\n m[ch] -= 1\n if m[ch] == 0:\n del m[ch]\n return True \n\n ","runtime":"58"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n letter_counter = Counter(ransomNote)\n for letter in magazine:\n if letter in letter_counter:\n letter_counter[letter] -= 1\n if not letter_counter[letter]:\n del letter_counter[letter]\n if letter_counter:\n return False\n\n return True","runtime":"59"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n rmap = dict()\n\n for i in range(len(magazine)):\n ch = magazine[i]\n rmap[ch] = rmap.get(ch, 0) + 1\n\n for i in range(len(ransomNote)):\n ch = ransomNote[i]\n if ch not in rmap or rmap[ch] <= 0:\n return False\n else:\n rmap[ch] = rmap.get(ch, 0) - 1\n\n return True\n ","runtime":"59"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ma_dic = {'a': 0,\n 'b': 0,\n 'c': 0,\n 'd': 0,\n 'e': 0,\n 'f': 0,\n 'g': 0,\n 'h': 0,\n 'i': 0,\n 'j': 0,\n 'k': 0,\n 'l': 0,\n 'm': 0,\n 'n': 0,\n 'o': 0,\n 'p': 0,\n 'q': 0,\n 'r': 0,\n 's': 0,\n 't': 0,\n 'u': 0,\n 'v': 0,\n 'w': 0,\n 'x': 0,\n 'y': 0,\n 'z': 0}\n note_dic = {'a': 0,\n 'b': 0,\n 'c': 0,\n 'd': 0,\n 'e': 0,\n 'f': 0,\n 'g': 0,\n 'h': 0,\n 'i': 0,\n 'j': 0,\n 'k': 0,\n 'l': 0,\n 'm': 0,\n 'n': 0,\n 'o': 0,\n 'p': 0,\n 'q': 0,\n 'r': 0,\n 's': 0,\n 't': 0,\n 'u': 0,\n 'v': 0,\n 'w': 0,\n 'x': 0,\n 'y': 0,\n 'z': 0}\n for c in magazine:\n ma_dic[c] += 1\n for c in ransomNote:\n note_dic[c] += 1\n for c in note_dic:\n if note_dic[c] > ma_dic[c]:\n return False\n return True","runtime":"60"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n nr=len(ransomNote)\n nm=len(magazine)\n magazine=list(magazine)\n if nm < nr :\n return False\n else:\n for i in range (0,nr):\n \n flag=False\n for n in range (0, len(magazine)):\n \n if magazine[n] == ransomNote[i]:\n magazine.remove(magazine[n])\n flag=True\n break\n \n if not flag:\n return False\n \n\n return True","runtime":"60"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransomNoteDict = {}\n magazineDict = {}\n for char in ransomNote:\n if char in ransomNoteDict:\n ransomNoteDict[char] += 1 \n else:\n ransomNoteDict[char] = 1 \n\n for char in magazine:\n if char in magazineDict:\n magazineDict[char] += 1 \n else:\n magazineDict[char] = 1 \n\n check = False\n for key, value in ransomNoteDict.items():\n if key in magazineDict:\n if value <= magazineDict[key]:\n check = True\n else:\n check = False\n break\n else:\n check = False\n break\n return check","runtime":"61"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransomCount = Counter(ransomNote)\n magCount = Counter(magazine)\n for k, v in ransomCount.items():\n if k not in list(magCount.keys()):\n return False\n elif k in list(magCount.keys()) and v > magCount[k]:\n return False\n return True","runtime":"61"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n \n counter = {}\n\n for c in magazine:\n if c in counter:\n counter[c] += 1\n else:\n counter[c] = 1\n\n\n for c in ransomNote:\n if c not in counter:\n return False\n if counter[c] == 1:\n del counter[c]\n else: counter[c] -= 1\n\n return True\n\n\n# can also use #COLLECTIONS counter = Counter(magazine)","runtime":"62"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n glossary = {}\n for i in magazine:\n glossary[i] = glossary.get(i, 0) + 1 \n for i in ransomNote:\n if(i not in glossary.keys()):\n return False\n glossary[i] = glossary[i] - 1\n if(glossary[i] < 0):\n return False\n return True","runtime":"62"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n hash_set = {}\n\n for letter in ransomNote:\n if letter in hash_set:\n hash_set[letter] +=1 \n else:\n hash_set[letter] = 1\n\n for letter in magazine:\n if letter in hash_set:\n hash_set[letter] -= 1\n\n for letter in hash_set:\n if hash_set[letter] > 0: return False\n\n return True\n ","runtime":"63"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n countMagazine = defaultdict(int)\n for letter in magazine:\n countMagazine[letter] += 1\n for letter in ransomNote:\n if letter not in countMagazine:\n return False\n countMagazine[letter] -= 1\n if countMagazine[letter] < 0:\n return False\n return True","runtime":"63"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n hashMap = {}\n\n for m in magazine: \n if m not in hashMap:\n hashMap[m] = 1\n else:\n hashMap[m] = hashMap[m] + 1\n \n for n in ransomNote:\n if n in hashMap and hashMap[n] > 0:\n hashMap[n] = hashMap[n] - 1\n else:\n return False\n \n return True","runtime":"64"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mag_count = defaultdict(int)\n\n for c in magazine:\n mag_count[c] += 1\n \n for c in ransomNote:\n mag_count[c] -= 1\n if mag_count[c] < 0:\n return False\n \n return True\n ","runtime":"64"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n table = {}\n for letter in magazine:\n if letter not in table:\n table[letter] = 1\n else:\n table[letter] += 1 \n for letters in ransomNote:\n if letters in table:\n table[letters] -= 1\n if table[letters] == 0:\n del table[letters]\n else:\n return False\n return True","runtime":"65"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n a = {}\n for i in magazine:\n if i in a:\n a[i]+=1\n else:\n a[i]=1\n for i in ransomNote:\n if i not in a:\n return False\n else:\n a[i]-=1\n if a[i]<0:\n return False\n return True","runtime":"65"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n r={}\n m={}\n for i in ransomNote:\n r[i] = r.get(i, 0) + 1\n for i in magazine:\n m[i] = m.get(i, 0) + 1\n \n for i in r:\n if (i not in m) or (r[i]>m[i]):\n return False\n return True\n ","runtime":"66"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransom_counts = {}\n magazine_counts = {}\n\n for letter in ransomNote:\n if letter in ransom_counts:\n ransom_counts[letter] += 1\n else:\n ransom_counts[letter] = 1\n\n for letter in magazine:\n if letter in magazine_counts:\n magazine_counts[letter] += 1\n else:\n magazine_counts[letter] = 1\n\n for letter, counts in ransom_counts.items():\n if letter not in magazine_counts or counts > magazine_counts[letter]:\n return False\n \n return True\n","runtime":"66"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n a = [0] * 26\n for i in magazine:\n a[ord(i)-ord('a')] += 1\n for i in ransomNote:\n a[ord(i) - ord('a')] -= 1\n if a[ord(i) - ord('a')] < 0:\n return False\n return True","runtime":"67"},{"code":"from collections import defaultdict\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n rn_dict = defaultdict(int)\n m_dict = defaultdict(int)\n for x in ransomNote:\n rn_dict[x] +=1\n for y in magazine:\n m_dict[y] += 1\n \n for i in ransomNote:\n if m_dict[i] >= 1:\n m_dict[i] -= 1\n else:\n return False\n return True\n \n ","runtime":"67"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransom_counts = {}\n for letter in ransomNote:\n if letter in ransom_counts:\n ransom_counts[letter] += 1\n else:\n ransom_counts[letter] = 1\n \n magazine_counts = {}\n for letter in magazine:\n if letter in magazine_counts:\n magazine_counts[letter] += 1\n else:\n magazine_counts[letter] = 1 \n \n for letter, count in ransom_counts.items():\n if letter not in magazine_counts or magazine_counts[letter] < count:\n return False\n \n return True\n \n ","runtime":"68"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n nr=len(ransomNote)\n nm=len(magazine)\n magazine=list(magazine)\n if nm < nr :\n return False\n else:\n for i in range (0,nr):\n \n flag=False\n for n in range (0, len(magazine)):\n \n if magazine[n] == ransomNote[i]:\n magazine.remove(magazine[n])\n flag=True\n break\n \n if not flag:\n return False\n \n\n return True","runtime":"68"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n temp=[i for i in magazine]\n if len(ransomNote)> len(magazine):\n return False\n for i in range(len(ransomNote)):\n if ransomNote[i] not in temp:\n return False\n\n temp.remove(ransomNote[i])\n return True","runtime":"69"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n counts = {}\n for letter in magazine:\n counts[letter] = counts.get(letter, 0)+1\n\n for letter in ransomNote:\n if letter not in counts or counts[letter] == 0:\n return False \n else:\n counts[letter]-=1\n\n return True\n \n ","runtime":"69"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n dic = {}\n for mag in magazine:\n if mag not in dic:\n dic[mag] = 1\n else:\n dic[mag] += 1\n for letter in ransomNote:\n if letter in dic:\n if dic[letter] == 1:\n del dic[letter]\n else:\n dic[letter] -= 1\n else:\n return False\n return True","runtime":"73"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n dic = {}\n for e in magazine:\n if dic.get(e):\n dic[e] += 1\n else:\n dic[e] = 1\n \n for e in ransomNote:\n if not dic.get(e):\n return False\n elif dic[e] == 0:\n return False\n else:\n dic[e] -= 1\n \n return True","runtime":"73"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n d={}\n for c in magazine:\n if c not in d:\n d[c]=1\n else:\n d[c]+=1\n for i in ransomNote:\n if i in d and d[i]>0:\n d[i]-=1\n else:\n return False\n return True \n\n ","runtime":"74"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mp = {}\n for s in magazine:\n if s not in mp:\n mp[s] = 1\n else:\n mp[s] += 1\n \n for s in ransomNote:\n if s not in mp or mp[s] == 0:\n return False\n else:\n mp[s] -= 1\n\n return True","runtime":"74"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mag = dict()\n for c in magazine:\n mag.setdefault(c, 0)\n mag[c] += 1\n #print(mag)\n for c in ransomNote:\n mag_c = mag.get(c)\n #print(c, mag_c)\n if not mag_c:\n return False\n mag[c] -= 1\n return True\n","runtime":"75"},{"code":"class Solution:\n \"\"\" \n Hash map. O(m) time & O(1) space. \n O(1) space bc there's only 26 characters. \n \"\"\"\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(ransomNote) > len(magazine):\n return False\n mag_dict = {}\n for i in magazine:\n if mag_dict.get(i):\n mag_dict[i] += 1\n else:\n mag_dict[i] = 1\n for i in ransomNote:\n if mag_dict.get(i):\n mag_dict[i] -= 1\n else:\n return False\n return True","runtime":"75"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n hmap = {}\n for i in range(len(magazine)):\n if magazine[i] in hmap:\n hmap[magazine[i]] += 1 \n else: \n hmap[magazine[i]] = 1\n\n for note in ransomNote:\n if note in hmap and hmap[note] >= 1:\n hmap[note] -= 1\n else:\n return False\n \n return True\n","runtime":"76"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n dictM = {}\n\n for m in magazine:\n if(m in dictM):\n dictM[m] += 1\n else:\n dictM[m] = 1\n\n for r in ransomNote:\n if(r in dictM):\n num = dictM[r] - 1\n if(num < 0):\n return False\n dictM[r] = num\n else:\n return False\n\n return True","runtime":"76"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mg={}\n for i in magazine:\n if i not in mg:\n mg[i]=1\n else:\n mg[i]+=1\n print(mg)\n for j in ransomNote:\n if j not in mg:\n return False\n elif j in mg and mg[j]<=0:\n return False\n else:\n mg[j]-=1\n return True","runtime":"77"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n i,j = 0,0\n Map ={}\n for c in magazine:\n if c not in Map:\n Map[c] = 1\n else:\n Map[c]+=1\n for c in ransomNote:\n if c not in Map or Map[c] ==0:\n return False\n else:\n Map[c]-=1\n return True","runtime":"77"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if ransomNote == \"\":\n return True\n\n if len(magazine) < len(ransomNote):\n return False\n\n ransomNote_state = {}\n magazine_state = {}\n\n for r_char in ransomNote:\n if r_char not in ransomNote_state:\n ransomNote_state[r_char] = 1\n continue\n ransomNote_state[r_char] += 1\n\n for m_char in magazine:\n if m_char in ransomNote:\n if m_char not in magazine_state:\n magazine_state[m_char] = 1\n continue\n magazine_state[m_char] += 1\n for r_char, count in ransomNote_state.items():\n if r_char not in magazine_state:\n return False\n if magazine_state[r_char] < count:\n return False\n return True\n","runtime":"78"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(ransomNote) > len(magazine):\n return False\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","runtime":"78"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","runtime":"79"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(ransomNote) > len(magazine):\n return False\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","runtime":"79"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n n = len(ransomNote)\n m = len(magazine)\n\n if n > m:\n return False\n\n chars = {}\n for i in range(m):\n if i < n:\n if ransomNote[i] not in chars:\n chars[ransomNote[i]] = 1\n else:\n chars[ransomNote[i]] += 1\n\n if magazine[i] not in chars:\n chars[magazine[i]] = -1\n else:\n chars[magazine[i]] -= 1\n\n for v in chars.values():\n if v > 0:\n return False\n \n return True","runtime":"80"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n charSet = dict()\n\n for c in magazine:\n if c not in charSet:\n charSet[c] = 0\n charSet[c] += 1\n \n for c in ransomNote:\n if c not in charSet or charSet[c] == 0:\n return False\n\n charSet[c] -= 1\n \n return True","runtime":"80"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ran = {}\n mag = {}\n\n # Build frequency dictionary for ransomNote\n for i in range(len(ransomNote)):\n ran[ransomNote[i]] = ran.get(ransomNote[i], 0) + 1\n\n # Build frequency dictionary for magazine\n for i in range(len(magazine)):\n mag[magazine[i]] = mag.get(magazine[i], 0) + 1\n\n # Check if the ransom note can be constructed from the magazine\n for char, count in ran.items():\n if mag.get(char, 0) < count: # If magazine doesn't have enough of the char\n return False\n\n return True\n","runtime":"81"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n if len(ransomNote)>len(magazine):\n return False\n\n magazine = list(magazine) \n for i in range(len(ransomNote)):\n for j in range(len(magazine)):\n if ransomNote[i] == magazine[j]:\n magazine.pop(j)\n if i ==len(ransomNote)-1:\n return True\n break\n elif j==len(magazine)-1:\n return False\n else:\n continue\n\n \n return False\n\n \n \n ","runtime":"82"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n letters = {}\n\n for i in range (len(magazine)):\n if magazine[i] in letters: \n letters[magazine[i]] += 1\n else: \n letters[magazine[i]] = 1\n \n print(letters)\n for i in range(len(ransomNote)):\n print(f\"letters {letters} rN {ransomNote}\")\n if ransomNote[i] not in letters or letters[ransomNote[i]] == 0:\n return False \n else: \n letters[ransomNote[i]] -= 1 \n\n return True\n ","runtime":"83"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","runtime":"84"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n\n r_map = defaultdict()\n m_map = defaultdict()\n\n for i in range(len(ransomNote)):\n if ransomNote[i] in r_map:\n v = r_map[ransomNote[i]]\n v += 1\n r_map[ransomNote[i]] = v\n else:\n r_map[ransomNote[i]] = 1\n\n for j in range(len(magazine)):\n if magazine[j] in m_map:\n v = m_map[magazine[j]]\n v += 1\n m_map[magazine[j]] = v\n else:\n m_map[magazine[j]] = 1\n\n print(r_map)\n print(m_map)\n\n if len(m_map) < len(r_map):\n return 0\n\n for key, value in r_map.items():\n if key not in m_map or m_map[key] < value:\n return 0\n return 1\n\n\n\n \n\n\n\n ","runtime":"85"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","runtime":"86"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(ransomNote) > len(magazine):\n return False\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","runtime":"86"},{"code":"class Solution:\n def canConstruct(self, ran: str, mag: str) -> bool:\n i=0\n j=0\n ran=sorted(ran)\n mag=sorted(mag)\n s=\"\"\n while i<len(ran) and j<len(mag):\n if ran[i]==mag[j]:\n s+=ran[i]\n i+=1\n j+=1\n else:\n j+=1\n if len(s)==len(ran):\n return True\n return False","runtime":"87"},{"code":"from collections import Counter\n\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n # O(N) solution\n count = Counter()\n for ltr in magazine:\n count[ltr] += 1\n \n for ltr in ransomNote:\n if ltr not in count:\n return False\n\n if count[ltr] <= 0:\n return False \n\n count[ltr] -= 1\n \n return True\n ","runtime":"88"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n notes = list(magazine)\n count = 0\n rans = list(ransomNote)\n while len(notes) > 0:\n n = notes.pop()\n if n in rans:\n count += 1\n rans.remove(n)\n return count == len(ransomNote)\n\n ","runtime":"89"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n d1={}\n d2={}\n for i in ransomNote:\n if i in d1:\n d1[i]+=1\n else:\n d1[i]=1\n\n for i in magazine:\n if i in d2:\n d2[i]+=1\n else:\n d2[i]=1\n \n for i in list(set(ransomNote)):\n if i in list(set(magazine)):\n if d1[i]>d2[i]:\n return False\n else:\n return False \n return True\n \n \n \n ","runtime":"90"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n rcount = defaultdict(int)\n for r in ransomNote:\n rcount[r] += 1\n \n for m in magazine:\n rcount[m] -= 1\n if rcount[m] < 1:\n del rcount[m]\n if not bool(rcount):\n return True\n else:\n return False","runtime":"91"}],"string":"[\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(ransomNote) > len(magazine):\\n return False\\n \\n for c in set(ransomNote):\\n if magazine.count(c) < ransomNote.count(c):\\n return False\\n return True\",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n if len(ransomNote)>len(magazine):\\n return False\\n\\n for char in ransomNote:\\n if char in magazine:\\n magazine = magazine.replace(char,'',1)\\n else:\\n return False\\n \\n return True\\n \\n \\n \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for i in ransomNote:\\n if i not in magazine:\\n return False\\n else:\\n magazine = magazine.replace(i,\\\"\\\",1)\\n return True\\n \\n\\n # letter_count = {}\\n # for i in ransomNote:\\n # if letter_count.get(i) is None:\\n # letter_count[i] = ransomNote.count(i)\\n \\n # for letter in letter_count.keys():\\n # if letter_count[letter] > magazine.count(letter):\\n # return False\\n\\n # return True\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n #if len(ransomNote) >= len(magazine):\\n # return False\\n #dict = {}\\n #for char in magazine:\\n # if char in dict:\\n # dict[char] += 1\\n # else:\\n # dict[char] =1\\n \\n # for char in ransomNote:\\n # if char in dict:\\n # dict[char] -=1\\n # else:\\n # return False\\n #return True\\n alphabet = [0] * 26\\n for c in ransomNote:\\n idx = ord(c) - ord('a')\\n i = magazine.find(c, alphabet[idx])\\n if i == -1:\\n return False\\n alphabet[idx] = i + 1\\n return True\\n\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool: \\n for x in ransomNote:\\n if x in magazine:\\n magazine = magazine[:magazine.find(x)] + magazine[magazine.find(x) + 1:]\\n else:\\n return False\\n return True\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for letter in ransomNote:\\n if letter in magazine:\\n magazine = magazine.replace(letter, '', 1)\\n else:\\n return False\\n \\n return True\\n\\n # This works but the solution above is way faster\\n # mag_dict = {}\\n # # O(n) creation of dictionary\\n # for letter in magazine:\\n # if mag_dict.get(letter) == None:\\n # mag_dict[letter] = 1\\n # else:\\n # mag_dict[letter] = mag_dict.get(letter) + 1\\n\\n # # O(n) loop through ransomNote\\n # for letter in ransomNote:\\n # if mag_dict.get(letter) and mag_dict.get(letter) > 0:\\n # mag_dict[letter] = mag_dict.get(letter) - 1 \\n # else:\\n # return False\\n\\n # return True\\n\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for letter in list(set(ransomNote)):\\n if ransomNote.count(letter) > magazine.count(letter): return False\\n return True\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n \\n for x in ransomNote:\\n if x not in magazine:\\n return False\\n else:\\n magazine = magazine.replace(x,'',1)\\n \\n return True\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransomNoteCounter = Counter(ransomNote)\\n magazineCounter = Counter(magazine)\\n\\n for k, v in ransomNoteCounter.items():\\n if k not in magazineCounter or magazineCounter[k] < v:\\n return False\\n return True\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n char_count = defaultdict(int)\\n for char in ransomNote:\\n char_count[char] += 1\\n \\n for letter, freq in char_count.items():\\n if freq > magazine.count(letter):\\n return False\\n \\n return True\\n \\n\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n #iterate through a list of a set of the ransomNote\\n for i in list(set(ransomNote)):\\n #if the count at i for that letter does not match return false\\n if ransomNote.count(i) > magazine.count(i):\\n return False\\n #return true\\n return True\\n\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for char in ransomNote:\\n if char in magazine:\\n magazine = magazine.replace(char, '', 1)\\n else:\\n return False\\n return True\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(ransomNote) > len(magazine):\\n return False\\n else:\\n for letter in ransomNote:\\n temp = magazine\\n magazine = magazine.replace(letter, \\\"\\\", 1)\\n if magazine == temp:\\n return False\\n return True\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n for letter in list(set(ransomNote)):\\n if ransomNote.count(letter) > magazine.count(letter): return False\\n return True\\n\\n # h = {}\\n # for i in magazine:\\n # if i not in h:\\n # h[i] = 1\\n # else:\\n # h[i] += 1\\n # for i in ransomNote:\\n # if i not in h:\\n # return False\\n # else:\\n # if h[i] < 1:\\n # return False\\n # else:\\n # h[i] -= 1\\n # return True\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n c1 = Counter(ransomNote)\\n c2 = Counter(magazine)\\n return (c1 & c2) == c1\\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for c in ransomNote:\\n if c in magazine:\\n magazine = magazine.replace(c, '', 1)\\n else:\\n return False\\n return True\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for letter in list(set(ransomNote)):\\n if ransomNote.count(letter) > magazine.count(letter): return False\\n return True\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n set_a = set(ransomNote)\\n \\n for i in set_a:\\n if magazine.count(i) < ransomNote.count(i):\\n return False\\n return True\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for i in ransomNote:\\n if i in magazine:\\n magazine = magazine.replace(i,'',1)\\n else:\\n return False\\n return True\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n while ransomNote:\\n for char in ransomNote:\\n if char not in magazine:\\n return False\\n else:\\n index = magazine.index(char)\\n magazine = magazine[:index] + magazine[index+1:]\\n ransomNote = ransomNote[1:]\\n return True\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n seen = set(ransomNote)\\n\\n for char in seen:\\n if magazine.count(char) < ransomNote.count(char):\\n return False\\n return True\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for ele in ransomNote:\\n if ele not in magazine:\\n return False\\n else:\\n magazine=magazine.replace(ele,\\\"\\\",1)\\n return True\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for i in ransomNote:\\n if i in magazine:\\n magazine = magazine.replace(i,\\\" \\\",1)\\n else:\\n return False\\n return True\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n rNset = set(ransomNote)\\n mset = set(magazine)\\n\\n for char in rNset:\\n if ransomNote.count(char) > magazine.count(char):\\n return False\\n\\n return True\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"# class Solution:\\n# def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n# \\\"\\\"\\\"\\n# Time = O(m), Space = O(k) or O(1), Approach 3: One Hashmap\\n# m is the length of magazine, and k is the number of unique \\n# characters across both the ransom note and magazine\\n# \\\"\\\"\\\"\\n# # 1) counter the letters in magazine string.\\n# # 2) iterate through the ransomNote to check if there are\\n# # still enough letters in magazines to match\\n\\n# if len(ransomNote) > len(magazine):\\n# return False\\n\\n# hashmap = collections.Counter(magazine) # 1)\\n\\n# for char in ransomNote: # 2)\\n# if hashmap[char] <= 0:\\n# return False\\n\\n# hashmap[char] -= 1\\n\\n# return True \\n\\nclass Solution:\\n def canConstruct(self, ransomNote, magazine):\\n if len(ransomNote) > len(magazine):\\n return False\\n\\n hashmap = collections.Counter(magazine)\\n\\n for char in ransomNote:\\n if hashmap[char] <= 0:\\n return False\\n\\n hashmap[char] -= 1\\n\\n return True\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n # For each character, c, in the ransom note.\\n for c in ransomNote:\\n # If there are none of c left in the String, return False.\\n if c not in magazine:\\n return False\\n # Find the index of the first occurrence of c in the magazine.\\n location = magazine.index(c)\\n # Use splicing to make a new string with the characters \\n # before \\\"location\\\" (but not including), and the characters \\n #after \\\"location\\\". \\n magazine = magazine[:location] + magazine[location + 1:]\\n # If we got this far, we can successfully build the note.\\n return True\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n st1, st2 = Counter(ransomNote), Counter(magazine)\\n if st1 & st2 == st1:\\n return True\\n return False\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for c in set(ransomNote):\\n if c not in magazine or ransomNote.count(c) > magazine.count(c):\\n return False\\n return True\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n counts_magazine = Counter(magazine)\\n counts_ransomNote = Counter(ransomNote)\\n for k in counts_ransomNote:\\n if k not in counts_magazine or counts_magazine[k] < counts_ransomNote[k]:\\n return False\\n return True\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n st1, st2 = Counter(ransomNote), Counter(magazine)\\n if st1 & st2 == st1:\\n return True\\n return False\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n magazine_chars = {}\\n \\n for char in ransomNote:\\n if char in magazine:\\n char_index = magazine.index(char)\\n magazine = magazine[:char_index] + magazine[char_index+1:]\\n else:\\n return False\\n return True\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransomDict = {}\\n \\n for char in ransomNote:\\n if char not in ransomDict:\\n ransomDict[char] = 0\\n \\n ransomDict[char] += 1\\n \\n operations_done = 0\\n\\n for char in magazine:\\n if char in ransomDict and ransomDict[char] > 0:\\n ransomDict[char] -=1\\n operations_done += 1\\n \\n if operations_done == len(ransomNote):\\n return True\\n \\n return False\\n\\n\\n # for char in magazine:\\n # print(char)\\n # ransomNote = ransomNote.replace(char, \\\"\\\", 1)\\n # print(\\\"here\\\")\\n # print(ransomNote)\\n \\n # return ransomNote == \\\"\\\"\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n dic = Counter(magazine)\\n for letter in ransomNote:\\n if letter in dic:\\n if dic[letter] == 1:\\n del dic[letter]\\n else:\\n dic[letter] -= 1\\n else:\\n return False\\n return True\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for letter in set(ransomNote):\\n if ransomNote.count(letter) > magazine.count(letter):\\n return False\\n return True\\n \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"from collections import defaultdict, Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n d = dict(Counter(magazine))\\n for x in ransomNote:\\n if x not in d:\\n return False\\n else:\\n d[x] -= 1\\n if d[x] == 0:\\n del d[x]\\n return True\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mag= defaultdict(int)\\n ran=defaultdict(int)\\n for char in magazine:\\n mag[char]=mag[char]+1\\n for char in ransomNote:\\n if char not in mag:\\n return False\\n else :\\n mag[char]=mag[char]-1\\n if mag[char] <0 :\\n return False\\n return True\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n countM = Counter(magazine)\\n countR = Counter(ransomNote)\\n for char, count in countR.items():\\n magazine_count = countM[char]\\n if magazine_count < count:\\n return False\\n return True\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n # Count the frequency of each letter in ransomNote and magazine\\n ransom_count = Counter(ransomNote)\\n magazine_count = Counter(magazine)\\n \\n # Check if each letter in ransomNote has enough occurrences in magazine\\n for letter, count in ransom_count.items():\\n if magazine_count[letter] < count:\\n return False\\n \\n return True\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n r = Counter(ransomNote)\\n m = Counter(magazine)\\n for k,v in r.items():\\n if v > m[k]:\\n return False\\n\\n return True\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n d={i:magazine.count(i) for i in set(magazine)}\\n for char in ransomNote:\\n try:\\n if d[char]==0:\\n return False\\n d[char]-=1\\n except KeyError:\\n return False\\n return True \\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n m = Counter(magazine)\\n r = Counter(ransomNote)\\n\\n for char , count in r.items():\\n if m[char]<count:\\n return False\\n\\n return True\\n\\n\\n\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n letters_dict = Counter(magazine)\\n for char in ransomNote:\\n if letters_dict.get(char, 0) < 1:\\n return False\\n letters_dict[char] -= 1\\n\\n return True\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n count = Counter(magazine)\\n for c in ransomNote:\\n if c not in count:\\n print(count, c)\\n return False\\n count[c] -= 1\\n if count[c] == 0:\\n del count[c]\\n return True\\n\\n#Time: O(n)\\n#Space: O(26) = O(1)\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n from collections import Counter\\n\\n mag = Counter(magazine)\\n\\n for c in ransomNote:\\n if c in mag:\\n mag[c] -= 1\\n else:\\n return False\\n\\n if mag[c] < 0:\\n return False\\n \\n return True\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n r_count = {}\\n m_count = {}\\n for i in ransomNote:\\n if i not in magazine:\\n return False\\n if i not in r_count:\\n r_count[i] = 1\\n else:\\n r_count[i] += 1\\n for j in magazine:\\n if j not in m_count:\\n m_count[j] = 1\\n else:\\n m_count[j] += 1\\n for i in r_count:\\n if r_count[i] > m_count[i]:\\n return False\\n return True\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n countMagazine = defaultdict(int)\\n for letter in magazine:\\n countMagazine[letter] += 1\\n countRansomNote = defaultdict(int)\\n for letter in ransomNote:\\n countRansomNote[letter] += 1\\n if letter not in countMagazine:\\n return False\\n elif countRansomNote[letter] > countMagazine[letter]:\\n return False\\n return True\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n # hashmap_ransomNote = {char:ransomNote.count(char) for char in ransomNote}\\n\\n # for key, value in hashmap_ransomNote.items():\\n # if key not in magazine or value > magazine.count(key):\\n # return False\\n\\n # return True\\n\\n hashmap_ransomNote = {}\\n hashmap_magazine = {}\\n\\n for l in ransomNote:\\n hashmap_ransomNote[l] = hashmap_ransomNote.get(l, 0) + 1\\n \\n for l in magazine:\\n hashmap_magazine[l] = hashmap_magazine.get(l, 0) + 1\\n \\n for key, val in hashmap_ransomNote.items():\\n if key not in hashmap_magazine or val > hashmap_magazine[key]:\\n return False\\n \\n return True\",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n magazine_letter_dict = defaultdict(int)\\n ransom_note_letter_dict = defaultdict(int)\\n \\n for letter in ransomNote:\\n ransom_note_letter_dict[letter] += 1\\n \\n for letter in magazine:\\n magazine_letter_dict[letter] += 1\\n \\n for letter in ransom_note_letter_dict:\\n if letter not in magazine_letter_dict:\\n return False\\n elif ransom_note_letter_dict[letter] > magazine_letter_dict[letter]:\\n return False\\n else:\\n continue\\n return True\\n \\n \\n \",\n \"runtime\": \"52\"\n },\n {\n \"code\": \"from collections import Counter\\n\\n\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(magazine) < len(ransomNote):\\n return False\\n\\n magazineMap = Counter(magazine)\\n\\n for char in ransomNote:\\n if char not in magazineMap or magazineMap[char] <= 0:\\n return False\\n \\n magazineMap[char] -= 1\\n\\n return True\\n\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n ransomCount = {}\\n magazineCount = {}\\n\\n for i in ransomNote:\\n ransomCount[i] = ransomCount.get(i, 0) + 1\\n \\n for i in magazine:\\n magazineCount[i] = magazineCount.get(i, 0) + 1\\n\\n for key, value in ransomCount.items():\\n if key not in magazineCount or ransomCount[key] > magazineCount[key]:\\n return False\\n \\n return True\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"from collections import Counter\\n\\n\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(magazine) < len(ransomNote):\\n return False\\n\\n magazineMap = Counter(magazine)\\n\\n for char in ransomNote:\\n if char not in magazineMap:\\n return False\\n\\n if magazineMap[char] == 0:\\n return False\\n \\n magazineMap[char] -= 1\\n\\n return True\\n\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n table = {}\\n for letter in magazine:\\n if letter not in table:\\n table[letter] = 1\\n else:\\n table[letter] += 1 \\n for letters in ransomNote:\\n if letters in table:\\n table[letters] -= 1\\n if table[letters] == 0:\\n del table[letters]\\n else:\\n return False\\n return True\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n result = Counter(ransomNote) - Counter(magazine)\\n if len(result) == 0:\\n return True\\n else:\\n return False\\n\\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> int:\\n # Count the frequency of each character in ransomNote and magazine\\n ransomCount = Counter(ransomNote)\\n magazineCount = Counter(magazine)\\n \\n # Check if magazine has enough characters to match the counts in ransomNote\\n for char, count in ransomCount.items():\\n if magazineCount[char] < count:\\n return 0 # Return 0 for False\\n \\n return 1 # Return 1 for True\\n \",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"from collections import Counter\\n\\n\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(magazine) < len(ransomNote):\\n return False\\n\\n magazineMap = Counter(magazine)\\n\\n for char in ransomNote:\\n if char not in magazineMap:\\n return False\\n\\n if magazineMap[char] == 0:\\n return False\\n \\n magazineMap[char] -= 1\\n\\n return True\\n\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for char in magazine:\\n ransomNote = ransomNote.replace(char, '', 1)\\n return ransomNote == ''\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ma_dic = {'a': 0,\\n 'b': 0,\\n 'c': 0,\\n 'd': 0,\\n 'e': 0,\\n 'f': 0,\\n 'g': 0,\\n 'h': 0,\\n 'i': 0,\\n 'j': 0,\\n 'k': 0,\\n 'l': 0,\\n 'm': 0,\\n 'n': 0,\\n 'o': 0,\\n 'p': 0,\\n 'q': 0,\\n 'r': 0,\\n 's': 0,\\n 't': 0,\\n 'u': 0,\\n 'v': 0,\\n 'w': 0,\\n 'x': 0,\\n 'y': 0,\\n 'z': 0}\\n note_dic = {'a': 0,\\n 'b': 0,\\n 'c': 0,\\n 'd': 0,\\n 'e': 0,\\n 'f': 0,\\n 'g': 0,\\n 'h': 0,\\n 'i': 0,\\n 'j': 0,\\n 'k': 0,\\n 'l': 0,\\n 'm': 0,\\n 'n': 0,\\n 'o': 0,\\n 'p': 0,\\n 'q': 0,\\n 'r': 0,\\n 's': 0,\\n 't': 0,\\n 'u': 0,\\n 'v': 0,\\n 'w': 0,\\n 'x': 0,\\n 'y': 0,\\n 'z': 0}\\n for c in magazine:\\n ma_dic[c] += 1\\n for c in ransomNote:\\n note_dic[c] += 1\\n for c in note_dic:\\n if note_dic[c] > ma_dic[c]:\\n return False\\n return True\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n magazine_letter_dict = defaultdict(int)\\n ransom_note_letter_dict = defaultdict(int)\\n \\n for letter in ransomNote:\\n ransom_note_letter_dict[letter] += 1\\n \\n for letter in magazine:\\n magazine_letter_dict[letter] += 1\\n \\n for letter in ransom_note_letter_dict:\\n if letter not in magazine_letter_dict:\\n return False\\n elif ransom_note_letter_dict[letter] > magazine_letter_dict[letter]:\\n return False\\n else:\\n continue\\n return True\\n \\n \\n \",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n rd, md = Counter(ransomNote), Counter(magazine)\\n return all(rd[c] <= md[c] for c in rd)\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n m = {}\\n\\n for i in magazine:\\n m[i] = m.get(i, 0) + 1\\n\\n for ch in ransomNote:\\n if ch not in m:\\n return False\\n m[ch] -= 1\\n if m[ch] == 0:\\n del m[ch]\\n return True \\n\\n \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n letter_counter = Counter(ransomNote)\\n for letter in magazine:\\n if letter in letter_counter:\\n letter_counter[letter] -= 1\\n if not letter_counter[letter]:\\n del letter_counter[letter]\\n if letter_counter:\\n return False\\n\\n return True\",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n rmap = dict()\\n\\n for i in range(len(magazine)):\\n ch = magazine[i]\\n rmap[ch] = rmap.get(ch, 0) + 1\\n\\n for i in range(len(ransomNote)):\\n ch = ransomNote[i]\\n if ch not in rmap or rmap[ch] <= 0:\\n return False\\n else:\\n rmap[ch] = rmap.get(ch, 0) - 1\\n\\n return True\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ma_dic = {'a': 0,\\n 'b': 0,\\n 'c': 0,\\n 'd': 0,\\n 'e': 0,\\n 'f': 0,\\n 'g': 0,\\n 'h': 0,\\n 'i': 0,\\n 'j': 0,\\n 'k': 0,\\n 'l': 0,\\n 'm': 0,\\n 'n': 0,\\n 'o': 0,\\n 'p': 0,\\n 'q': 0,\\n 'r': 0,\\n 's': 0,\\n 't': 0,\\n 'u': 0,\\n 'v': 0,\\n 'w': 0,\\n 'x': 0,\\n 'y': 0,\\n 'z': 0}\\n note_dic = {'a': 0,\\n 'b': 0,\\n 'c': 0,\\n 'd': 0,\\n 'e': 0,\\n 'f': 0,\\n 'g': 0,\\n 'h': 0,\\n 'i': 0,\\n 'j': 0,\\n 'k': 0,\\n 'l': 0,\\n 'm': 0,\\n 'n': 0,\\n 'o': 0,\\n 'p': 0,\\n 'q': 0,\\n 'r': 0,\\n 's': 0,\\n 't': 0,\\n 'u': 0,\\n 'v': 0,\\n 'w': 0,\\n 'x': 0,\\n 'y': 0,\\n 'z': 0}\\n for c in magazine:\\n ma_dic[c] += 1\\n for c in ransomNote:\\n note_dic[c] += 1\\n for c in note_dic:\\n if note_dic[c] > ma_dic[c]:\\n return False\\n return True\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n nr=len(ransomNote)\\n nm=len(magazine)\\n magazine=list(magazine)\\n if nm < nr :\\n return False\\n else:\\n for i in range (0,nr):\\n \\n flag=False\\n for n in range (0, len(magazine)):\\n \\n if magazine[n] == ransomNote[i]:\\n magazine.remove(magazine[n])\\n flag=True\\n break\\n \\n if not flag:\\n return False\\n \\n\\n return True\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransomNoteDict = {}\\n magazineDict = {}\\n for char in ransomNote:\\n if char in ransomNoteDict:\\n ransomNoteDict[char] += 1 \\n else:\\n ransomNoteDict[char] = 1 \\n\\n for char in magazine:\\n if char in magazineDict:\\n magazineDict[char] += 1 \\n else:\\n magazineDict[char] = 1 \\n\\n check = False\\n for key, value in ransomNoteDict.items():\\n if key in magazineDict:\\n if value <= magazineDict[key]:\\n check = True\\n else:\\n check = False\\n break\\n else:\\n check = False\\n break\\n return check\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransomCount = Counter(ransomNote)\\n magCount = Counter(magazine)\\n for k, v in ransomCount.items():\\n if k not in list(magCount.keys()):\\n return False\\n elif k in list(magCount.keys()) and v > magCount[k]:\\n return False\\n return True\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n \\n counter = {}\\n\\n for c in magazine:\\n if c in counter:\\n counter[c] += 1\\n else:\\n counter[c] = 1\\n\\n\\n for c in ransomNote:\\n if c not in counter:\\n return False\\n if counter[c] == 1:\\n del counter[c]\\n else: counter[c] -= 1\\n\\n return True\\n\\n\\n# can also use #COLLECTIONS counter = Counter(magazine)\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n glossary = {}\\n for i in magazine:\\n glossary[i] = glossary.get(i, 0) + 1 \\n for i in ransomNote:\\n if(i not in glossary.keys()):\\n return False\\n glossary[i] = glossary[i] - 1\\n if(glossary[i] < 0):\\n return False\\n return True\",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n hash_set = {}\\n\\n for letter in ransomNote:\\n if letter in hash_set:\\n hash_set[letter] +=1 \\n else:\\n hash_set[letter] = 1\\n\\n for letter in magazine:\\n if letter in hash_set:\\n hash_set[letter] -= 1\\n\\n for letter in hash_set:\\n if hash_set[letter] > 0: return False\\n\\n return True\\n \",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n countMagazine = defaultdict(int)\\n for letter in magazine:\\n countMagazine[letter] += 1\\n for letter in ransomNote:\\n if letter not in countMagazine:\\n return False\\n countMagazine[letter] -= 1\\n if countMagazine[letter] < 0:\\n return False\\n return True\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n hashMap = {}\\n\\n for m in magazine: \\n if m not in hashMap:\\n hashMap[m] = 1\\n else:\\n hashMap[m] = hashMap[m] + 1\\n \\n for n in ransomNote:\\n if n in hashMap and hashMap[n] > 0:\\n hashMap[n] = hashMap[n] - 1\\n else:\\n return False\\n \\n return True\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mag_count = defaultdict(int)\\n\\n for c in magazine:\\n mag_count[c] += 1\\n \\n for c in ransomNote:\\n mag_count[c] -= 1\\n if mag_count[c] < 0:\\n return False\\n \\n return True\\n \",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n table = {}\\n for letter in magazine:\\n if letter not in table:\\n table[letter] = 1\\n else:\\n table[letter] += 1 \\n for letters in ransomNote:\\n if letters in table:\\n table[letters] -= 1\\n if table[letters] == 0:\\n del table[letters]\\n else:\\n return False\\n return True\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n a = {}\\n for i in magazine:\\n if i in a:\\n a[i]+=1\\n else:\\n a[i]=1\\n for i in ransomNote:\\n if i not in a:\\n return False\\n else:\\n a[i]-=1\\n if a[i]<0:\\n return False\\n return True\",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n r={}\\n m={}\\n for i in ransomNote:\\n r[i] = r.get(i, 0) + 1\\n for i in magazine:\\n m[i] = m.get(i, 0) + 1\\n \\n for i in r:\\n if (i not in m) or (r[i]>m[i]):\\n return False\\n return True\\n \",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransom_counts = {}\\n magazine_counts = {}\\n\\n for letter in ransomNote:\\n if letter in ransom_counts:\\n ransom_counts[letter] += 1\\n else:\\n ransom_counts[letter] = 1\\n\\n for letter in magazine:\\n if letter in magazine_counts:\\n magazine_counts[letter] += 1\\n else:\\n magazine_counts[letter] = 1\\n\\n for letter, counts in ransom_counts.items():\\n if letter not in magazine_counts or counts > magazine_counts[letter]:\\n return False\\n \\n return True\\n\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n a = [0] * 26\\n for i in magazine:\\n a[ord(i)-ord('a')] += 1\\n for i in ransomNote:\\n a[ord(i) - ord('a')] -= 1\\n if a[ord(i) - ord('a')] < 0:\\n return False\\n return True\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"from collections import defaultdict\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n rn_dict = defaultdict(int)\\n m_dict = defaultdict(int)\\n for x in ransomNote:\\n rn_dict[x] +=1\\n for y in magazine:\\n m_dict[y] += 1\\n \\n for i in ransomNote:\\n if m_dict[i] >= 1:\\n m_dict[i] -= 1\\n else:\\n return False\\n return True\\n \\n \",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransom_counts = {}\\n for letter in ransomNote:\\n if letter in ransom_counts:\\n ransom_counts[letter] += 1\\n else:\\n ransom_counts[letter] = 1\\n \\n magazine_counts = {}\\n for letter in magazine:\\n if letter in magazine_counts:\\n magazine_counts[letter] += 1\\n else:\\n magazine_counts[letter] = 1 \\n \\n for letter, count in ransom_counts.items():\\n if letter not in magazine_counts or magazine_counts[letter] < count:\\n return False\\n \\n return True\\n \\n \",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n nr=len(ransomNote)\\n nm=len(magazine)\\n magazine=list(magazine)\\n if nm < nr :\\n return False\\n else:\\n for i in range (0,nr):\\n \\n flag=False\\n for n in range (0, len(magazine)):\\n \\n if magazine[n] == ransomNote[i]:\\n magazine.remove(magazine[n])\\n flag=True\\n break\\n \\n if not flag:\\n return False\\n \\n\\n return True\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n temp=[i for i in magazine]\\n if len(ransomNote)> len(magazine):\\n return False\\n for i in range(len(ransomNote)):\\n if ransomNote[i] not in temp:\\n return False\\n\\n temp.remove(ransomNote[i])\\n return True\",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n counts = {}\\n for letter in magazine:\\n counts[letter] = counts.get(letter, 0)+1\\n\\n for letter in ransomNote:\\n if letter not in counts or counts[letter] == 0:\\n return False \\n else:\\n counts[letter]-=1\\n\\n return True\\n \\n \",\n \"runtime\": \"69\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n dic = {}\\n for mag in magazine:\\n if mag not in dic:\\n dic[mag] = 1\\n else:\\n dic[mag] += 1\\n for letter in ransomNote:\\n if letter in dic:\\n if dic[letter] == 1:\\n del dic[letter]\\n else:\\n dic[letter] -= 1\\n else:\\n return False\\n return True\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n dic = {}\\n for e in magazine:\\n if dic.get(e):\\n dic[e] += 1\\n else:\\n dic[e] = 1\\n \\n for e in ransomNote:\\n if not dic.get(e):\\n return False\\n elif dic[e] == 0:\\n return False\\n else:\\n dic[e] -= 1\\n \\n return True\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n d={}\\n for c in magazine:\\n if c not in d:\\n d[c]=1\\n else:\\n d[c]+=1\\n for i in ransomNote:\\n if i in d and d[i]>0:\\n d[i]-=1\\n else:\\n return False\\n return True \\n\\n \",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mp = {}\\n for s in magazine:\\n if s not in mp:\\n mp[s] = 1\\n else:\\n mp[s] += 1\\n \\n for s in ransomNote:\\n if s not in mp or mp[s] == 0:\\n return False\\n else:\\n mp[s] -= 1\\n\\n return True\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mag = dict()\\n for c in magazine:\\n mag.setdefault(c, 0)\\n mag[c] += 1\\n #print(mag)\\n for c in ransomNote:\\n mag_c = mag.get(c)\\n #print(c, mag_c)\\n if not mag_c:\\n return False\\n mag[c] -= 1\\n return True\\n\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n \\\"\\\"\\\" \\n Hash map. O(m) time & O(1) space. \\n O(1) space bc there's only 26 characters. \\n \\\"\\\"\\\"\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(ransomNote) > len(magazine):\\n return False\\n mag_dict = {}\\n for i in magazine:\\n if mag_dict.get(i):\\n mag_dict[i] += 1\\n else:\\n mag_dict[i] = 1\\n for i in ransomNote:\\n if mag_dict.get(i):\\n mag_dict[i] -= 1\\n else:\\n return False\\n return True\",\n \"runtime\": \"75\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n hmap = {}\\n for i in range(len(magazine)):\\n if magazine[i] in hmap:\\n hmap[magazine[i]] += 1 \\n else: \\n hmap[magazine[i]] = 1\\n\\n for note in ransomNote:\\n if note in hmap and hmap[note] >= 1:\\n hmap[note] -= 1\\n else:\\n return False\\n \\n return True\\n\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n dictM = {}\\n\\n for m in magazine:\\n if(m in dictM):\\n dictM[m] += 1\\n else:\\n dictM[m] = 1\\n\\n for r in ransomNote:\\n if(r in dictM):\\n num = dictM[r] - 1\\n if(num < 0):\\n return False\\n dictM[r] = num\\n else:\\n return False\\n\\n return True\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mg={}\\n for i in magazine:\\n if i not in mg:\\n mg[i]=1\\n else:\\n mg[i]+=1\\n print(mg)\\n for j in ransomNote:\\n if j not in mg:\\n return False\\n elif j in mg and mg[j]<=0:\\n return False\\n else:\\n mg[j]-=1\\n return True\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n i,j = 0,0\\n Map ={}\\n for c in magazine:\\n if c not in Map:\\n Map[c] = 1\\n else:\\n Map[c]+=1\\n for c in ransomNote:\\n if c not in Map or Map[c] ==0:\\n return False\\n else:\\n Map[c]-=1\\n return True\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if ransomNote == \\\"\\\":\\n return True\\n\\n if len(magazine) < len(ransomNote):\\n return False\\n\\n ransomNote_state = {}\\n magazine_state = {}\\n\\n for r_char in ransomNote:\\n if r_char not in ransomNote_state:\\n ransomNote_state[r_char] = 1\\n continue\\n ransomNote_state[r_char] += 1\\n\\n for m_char in magazine:\\n if m_char in ransomNote:\\n if m_char not in magazine_state:\\n magazine_state[m_char] = 1\\n continue\\n magazine_state[m_char] += 1\\n for r_char, count in ransomNote_state.items():\\n if r_char not in magazine_state:\\n return False\\n if magazine_state[r_char] < count:\\n return False\\n return True\\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(ransomNote) > len(magazine):\\n return False\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"runtime\": \"78\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(ransomNote) > len(magazine):\\n return False\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n n = len(ransomNote)\\n m = len(magazine)\\n\\n if n > m:\\n return False\\n\\n chars = {}\\n for i in range(m):\\n if i < n:\\n if ransomNote[i] not in chars:\\n chars[ransomNote[i]] = 1\\n else:\\n chars[ransomNote[i]] += 1\\n\\n if magazine[i] not in chars:\\n chars[magazine[i]] = -1\\n else:\\n chars[magazine[i]] -= 1\\n\\n for v in chars.values():\\n if v > 0:\\n return False\\n \\n return True\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n charSet = dict()\\n\\n for c in magazine:\\n if c not in charSet:\\n charSet[c] = 0\\n charSet[c] += 1\\n \\n for c in ransomNote:\\n if c not in charSet or charSet[c] == 0:\\n return False\\n\\n charSet[c] -= 1\\n \\n return True\",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ran = {}\\n mag = {}\\n\\n # Build frequency dictionary for ransomNote\\n for i in range(len(ransomNote)):\\n ran[ransomNote[i]] = ran.get(ransomNote[i], 0) + 1\\n\\n # Build frequency dictionary for magazine\\n for i in range(len(magazine)):\\n mag[magazine[i]] = mag.get(magazine[i], 0) + 1\\n\\n # Check if the ransom note can be constructed from the magazine\\n for char, count in ran.items():\\n if mag.get(char, 0) < count: # If magazine doesn't have enough of the char\\n return False\\n\\n return True\\n\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n if len(ransomNote)>len(magazine):\\n return False\\n\\n magazine = list(magazine) \\n for i in range(len(ransomNote)):\\n for j in range(len(magazine)):\\n if ransomNote[i] == magazine[j]:\\n magazine.pop(j)\\n if i ==len(ransomNote)-1:\\n return True\\n break\\n elif j==len(magazine)-1:\\n return False\\n else:\\n continue\\n\\n \\n return False\\n\\n \\n \\n \",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n letters = {}\\n\\n for i in range (len(magazine)):\\n if magazine[i] in letters: \\n letters[magazine[i]] += 1\\n else: \\n letters[magazine[i]] = 1\\n \\n print(letters)\\n for i in range(len(ransomNote)):\\n print(f\\\"letters {letters} rN {ransomNote}\\\")\\n if ransomNote[i] not in letters or letters[ransomNote[i]] == 0:\\n return False \\n else: \\n letters[ransomNote[i]] -= 1 \\n\\n return True\\n \",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n\\n r_map = defaultdict()\\n m_map = defaultdict()\\n\\n for i in range(len(ransomNote)):\\n if ransomNote[i] in r_map:\\n v = r_map[ransomNote[i]]\\n v += 1\\n r_map[ransomNote[i]] = v\\n else:\\n r_map[ransomNote[i]] = 1\\n\\n for j in range(len(magazine)):\\n if magazine[j] in m_map:\\n v = m_map[magazine[j]]\\n v += 1\\n m_map[magazine[j]] = v\\n else:\\n m_map[magazine[j]] = 1\\n\\n print(r_map)\\n print(m_map)\\n\\n if len(m_map) < len(r_map):\\n return 0\\n\\n for key, value in r_map.items():\\n if key not in m_map or m_map[key] < value:\\n return 0\\n return 1\\n\\n\\n\\n \\n\\n\\n\\n \",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(ransomNote) > len(magazine):\\n return False\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ran: str, mag: str) -> bool:\\n i=0\\n j=0\\n ran=sorted(ran)\\n mag=sorted(mag)\\n s=\\\"\\\"\\n while i<len(ran) and j<len(mag):\\n if ran[i]==mag[j]:\\n s+=ran[i]\\n i+=1\\n j+=1\\n else:\\n j+=1\\n if len(s)==len(ran):\\n return True\\n return False\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n # O(N) solution\\n count = Counter()\\n for ltr in magazine:\\n count[ltr] += 1\\n \\n for ltr in ransomNote:\\n if ltr not in count:\\n return False\\n\\n if count[ltr] <= 0:\\n return False \\n\\n count[ltr] -= 1\\n \\n return True\\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n notes = list(magazine)\\n count = 0\\n rans = list(ransomNote)\\n while len(notes) > 0:\\n n = notes.pop()\\n if n in rans:\\n count += 1\\n rans.remove(n)\\n return count == len(ransomNote)\\n\\n \",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n d1={}\\n d2={}\\n for i in ransomNote:\\n if i in d1:\\n d1[i]+=1\\n else:\\n d1[i]=1\\n\\n for i in magazine:\\n if i in d2:\\n d2[i]+=1\\n else:\\n d2[i]=1\\n \\n for i in list(set(ransomNote)):\\n if i in list(set(magazine)):\\n if d1[i]>d2[i]:\\n return False\\n else:\\n return False \\n return True\\n \\n \\n \\n \",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n rcount = defaultdict(int)\\n for r in ransomNote:\\n rcount[r] += 1\\n \\n for m in magazine:\\n rcount[m] -= 1\\n if rcount[m] < 1:\\n del rcount[m]\\n if not bool(rcount):\\n return True\\n else:\\n return False\",\n \"runtime\": \"91\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":110,"string":"110"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(magazine) < len(ransomNote):\n return False\n \n s = {}\n for i, c in enumerate(magazine):\n if c in s:\n s[c] += 1\n else:\n s[c] = 1\n\n count = 0\n for i in ransomNote:\n if i in s and s[i] > 0:\n s[i] -= 1\n count += 1\n \n if count == len(ransomNote):\n return True\n else:\n return False","memory":"16000"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransomNoteMap = {}\n for c in ransomNote:\n ransomNoteMap[c] = ransomNoteMap.get(c, 0) + 1\n \n for c in magazine:\n if c in ransomNoteMap.keys():\n ransomNoteMap[c] = ransomNoteMap[c] - 1\n if ransomNoteMap[c] == 0:\n ransomNoteMap.pop(c)\n if ransomNoteMap == {}:\n return True\n \n \n return False","memory":"16200"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n frequency_ransomNote = {}\n for character in ransomNote:\n if character not in frequency_ransomNote.keys():\n frequency_ransomNote[character] = 1\n else:\n frequency_ransomNote[character] += 1\n frequency_magazine = {}\n for character in magazine:\n if character not in frequency_magazine.keys():\n frequency_magazine[character] = 1\n else:\n frequency_magazine[character] += 1\n \n for character in ransomNote:\n if (character not in set(magazine) or \n frequency_magazine[character] < frequency_ransomNote[character]):\n return False\n\n return True","memory":"16300"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n frequency_ransomNote = {}\n for character in ransomNote:\n if character not in frequency_ransomNote.keys():\n frequency_ransomNote[character] = 1\n else:\n frequency_ransomNote[character] += 1\n frequency_magazine = {}\n for character in magazine:\n if character not in frequency_magazine.keys():\n frequency_magazine[character] = 1\n else:\n frequency_magazine[character] += 1\n \n for character in ransomNote:\n if (character not in set(magazine) or \n frequency_magazine[character] < frequency_ransomNote[character]):\n return False\n\n return True","memory":"16400"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mag_map = {}\n\n for char in magazine: \n if char not in mag_map: \n mag_map[char] = 1\n else:\n mag_map[char] += 1\n \n for char in ransomNote: \n if char not in mag_map or mag_map[char] == 0:\n return False\n else: \n mag_map[char] -= 1\n \n return True\n ","memory":"16400"},{"code":"from collections import Counter\n\n\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n if len(magazine) < len(ransomNote):\n return False\n\n magazineMap = Counter(magazine)\n\n for char in ransomNote:\n if char not in magazineMap:\n return False\n\n if magazineMap[char] == 0:\n return False\n \n magazineMap[char] -= 1\n\n return True\n","memory":"16500"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n result = Counter(ransomNote) - Counter(magazine)\n if len(result) == 0:\n return True\n else:\n return False\n\n ","memory":"16500"},{"code":"from collections import Counter\nclass Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n counter = Counter()\n for c in magazine:\n counter[c] += 1\n for c in ransomNote:\n if counter[c] < 1:\n return False\n counter[c] -= 1\n return True\n","memory":"16600"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n for i in ransomNote:\n if i in magazine:\n magazine = magazine.replace(i,'',1)\n else:\n return False\n return True","memory":"16600"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n mag_chars = Counter(magazine)\n ransom_chars = Counter(ransomNote)\n for c in ransom_chars:\n if ransom_chars[c] > mag_chars[c]:\n return False\n return True","memory":"16700"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n letters = Counter(magazine)\n\n for c in ransomNote:\n if c in letters and letters[c] > 0:\n letters[c] -= 1\n else:\n return False\n return True","memory":"16700"},{"code":"class Solution(object):\n def canConstruct(self, ransomNote, magazine):\n st1, st2 = Counter(ransomNote), Counter(magazine)\n if st1 & st2 == st1:\n return True\n return False","memory":"16800"},{"code":"class Solution:\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\n ransom_note_counter = Counter(ransomNote)\n magazine_counter = Counter(magazine)\n\n for i in range(len(ransomNote)):\n if ransomNote[i] in magazine_counter:\n ransom_note_counter[ransomNote[i]] -= 1\n magazine_counter[ransomNote[i]] -= 1\n if magazine_counter[ransomNote[i]] == 0:\n del magazine_counter[ransomNote[i]]\n if ransom_note_counter[ransomNote[i]] == 0:\n del ransom_note_counter[ransomNote[i]]\n else:\n return False\n\n return len(ransom_note_counter) == 0","memory":"16800"}],"string":"[\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(magazine) < len(ransomNote):\\n return False\\n \\n s = {}\\n for i, c in enumerate(magazine):\\n if c in s:\\n s[c] += 1\\n else:\\n s[c] = 1\\n\\n count = 0\\n for i in ransomNote:\\n if i in s and s[i] > 0:\\n s[i] -= 1\\n count += 1\\n \\n if count == len(ransomNote):\\n return True\\n else:\\n return False\",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransomNoteMap = {}\\n for c in ransomNote:\\n ransomNoteMap[c] = ransomNoteMap.get(c, 0) + 1\\n \\n for c in magazine:\\n if c in ransomNoteMap.keys():\\n ransomNoteMap[c] = ransomNoteMap[c] - 1\\n if ransomNoteMap[c] == 0:\\n ransomNoteMap.pop(c)\\n if ransomNoteMap == {}:\\n return True\\n \\n \\n return False\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n frequency_ransomNote = {}\\n for character in ransomNote:\\n if character not in frequency_ransomNote.keys():\\n frequency_ransomNote[character] = 1\\n else:\\n frequency_ransomNote[character] += 1\\n frequency_magazine = {}\\n for character in magazine:\\n if character not in frequency_magazine.keys():\\n frequency_magazine[character] = 1\\n else:\\n frequency_magazine[character] += 1\\n \\n for character in ransomNote:\\n if (character not in set(magazine) or \\n frequency_magazine[character] < frequency_ransomNote[character]):\\n return False\\n\\n return True\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n frequency_ransomNote = {}\\n for character in ransomNote:\\n if character not in frequency_ransomNote.keys():\\n frequency_ransomNote[character] = 1\\n else:\\n frequency_ransomNote[character] += 1\\n frequency_magazine = {}\\n for character in magazine:\\n if character not in frequency_magazine.keys():\\n frequency_magazine[character] = 1\\n else:\\n frequency_magazine[character] += 1\\n \\n for character in ransomNote:\\n if (character not in set(magazine) or \\n frequency_magazine[character] < frequency_ransomNote[character]):\\n return False\\n\\n return True\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mag_map = {}\\n\\n for char in magazine: \\n if char not in mag_map: \\n mag_map[char] = 1\\n else:\\n mag_map[char] += 1\\n \\n for char in ransomNote: \\n if char not in mag_map or mag_map[char] == 0:\\n return False\\n else: \\n mag_map[char] -= 1\\n \\n return True\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"from collections import Counter\\n\\n\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n if len(magazine) < len(ransomNote):\\n return False\\n\\n magazineMap = Counter(magazine)\\n\\n for char in ransomNote:\\n if char not in magazineMap:\\n return False\\n\\n if magazineMap[char] == 0:\\n return False\\n \\n magazineMap[char] -= 1\\n\\n return True\\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n result = Counter(ransomNote) - Counter(magazine)\\n if len(result) == 0:\\n return True\\n else:\\n return False\\n\\n \",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n counter = Counter()\\n for c in magazine:\\n counter[c] += 1\\n for c in ransomNote:\\n if counter[c] < 1:\\n return False\\n counter[c] -= 1\\n return True\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n for i in ransomNote:\\n if i in magazine:\\n magazine = magazine.replace(i,'',1)\\n else:\\n return False\\n return True\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n mag_chars = Counter(magazine)\\n ransom_chars = Counter(ransomNote)\\n for c in ransom_chars:\\n if ransom_chars[c] > mag_chars[c]:\\n return False\\n return True\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n letters = Counter(magazine)\\n\\n for c in ransomNote:\\n if c in letters and letters[c] > 0:\\n letters[c] -= 1\\n else:\\n return False\\n return True\",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution(object):\\n def canConstruct(self, ransomNote, magazine):\\n st1, st2 = Counter(ransomNote), Counter(magazine)\\n if st1 & st2 == st1:\\n return True\\n return False\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def canConstruct(self, ransomNote: str, magazine: str) -> bool:\\n ransom_note_counter = Counter(ransomNote)\\n magazine_counter = Counter(magazine)\\n\\n for i in range(len(ransomNote)):\\n if ransomNote[i] in magazine_counter:\\n ransom_note_counter[ransomNote[i]] -= 1\\n magazine_counter[ransomNote[i]] -= 1\\n if magazine_counter[ransomNote[i]] == 0:\\n del magazine_counter[ransomNote[i]]\\n if ransom_note_counter[ransomNote[i]] == 0:\\n del ransom_note_counter[ransomNote[i]]\\n else:\\n return False\\n\\n return len(ransom_note_counter) == 0\",\n \"memory\": \"16800\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":13,"string":"13"}}},{"rowIdx":287,"cells":{"question_id":{"kind":"number","value":384,"string":"384"},"name":{"kind":"string","value":"shuffle-an-array"},"content":{"kind":"string","value":"<p>Given an integer array <code>nums</code>, design an algorithm to randomly shuffle the array. All permutations of the array should be <strong>equally likely</strong> as a result of the shuffling.</p>\n\n<p>Implement the <code>Solution</code> class:</p>\n\n<ul>\n\t<li><code>Solution(int[] nums)</code> Initializes the object with the integer array <code>nums</code>.</li>\n\t<li><code>int[] reset()</code> Resets the array to its original configuration and returns it.</li>\n\t<li><code>int[] shuffle()</code> Returns a random shuffling of the array.</li>\n</ul>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input</strong>\n["Solution", "shuffle", "reset", "shuffle"]\n[[[1, 2, 3]], [], [], []]\n<strong>Output</strong>\n[null, [3, 1, 2], [1, 2, 3], [1, 3, 2]]\n\n<strong>Explanation</strong>\nSolution solution = new Solution([1, 2, 3]);\nsolution.shuffle(); // Shuffle the array [1,2,3] and return its result.\n // Any permutation of [1,2,3] must be equally likely to be returned.\n // Example: return [3, 1, 2]\nsolution.reset(); // Resets the array back to its original configuration [1,2,3]. Return [1, 2, 3]\nsolution.shuffle(); // Returns the random shuffling of array [1,2,3]. Example: return [1, 3, 2]\n\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 50</code></li>\n\t<li><code>-10<sup>6</sup> <= nums[i] <= 10<sup>6</sup></code></li>\n\t<li>All the elements of <code>nums</code> are <strong>unique</strong>.</li>\n\t<li>At most <code>10<sup>4</sup></code> calls <strong>in total</strong> will be made to <code>reset</code> and <code>shuffle</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":58.536316450113645,"string":"58.536316"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","math","randomized"],"string":"[\n \"array\",\n \"math\",\n \"randomized\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"87\", 0.0621], [\"88\", 0.1241], [\"89\", 0.0621], [\"90\", 0.1241], [\"91\", 0.1862], [\"92\", 0.1862], [\"93\", 0.3104], [\"94\", 0.3104], [\"95\", 0.5587], [\"96\", 0.6828], [\"97\", 0.6207], [\"98\", 1.3035], [\"99\", 1.0552], [\"100\", 1.9243], [\"101\", 1.9863], [\"102\", 1.9243], [\"103\", 2.2346], [\"104\", 2.1726], [\"105\", 2.9174], [\"106\", 3.4761], [\"107\", 2.9174], [\"108\", 3.4761], [\"109\", 3.2899], [\"110\", 3.5382], [\"111\", 3.9106], [\"112\", 3.352], [\"113\", 5.0279], [\"114\", 4.9659], [\"115\", 4.5934], [\"116\", 4.0348], [\"117\", 3.8485], [\"118\", 4.3451], [\"119\", 3.7244], [\"120\", 4.1589], [\"121\", 2.4829], [\"122\", 2.2346], [\"123\", 2.2967], [\"124\", 2.2346], [\"125\", 2.1726], [\"126\", 1.4898], [\"127\", 1.1794], [\"128\", 0.9311], [\"129\", 0.3724], [\"130\", 0.3104], [\"131\", 0.4345], [\"132\", 0.3104], [\"133\", 0.4966], [\"134\", 0.3724], [\"135\", 0.2483]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"19700\", 0.0621], [\"19800\", 0.0621], [\"19900\", 1.0552], [\"20000\", 14.401], [\"20100\", 60.211]]}"},"rt_list":{"kind":"list like","value":[{"code":"import math\nimport random\nclass doubleLinked:\n def __init__(self, val=-1, prev=None, next=None):\n self.val = val\n self.prev = prev\n self.next = next\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n \"\"\"\n sol = []\n for loop 0 -> len(list)-1\n set_idx = set(list(range(len(list)))) -> all indicies \n while set_idx\n rand_i = rand() * len(set)\n remove node at rand_i position from root in linked list\n append value at rand_i index to sol\n del value at rand_i index\n return sol\n \"\"\"\n # Optimal approach\n sol = self.original[:]\n for i in range(len(sol)):\n rand_int = math.floor(random.random() * (len(sol) - i)) + i\n sol[i], sol[rand_int] = sol[rand_int], sol[i]\n return sol\n # My stupid approach that seemed wise\n sol = []\n # Nums list -> Doubly Linked List\n root = doubleLinked()\n pre_node = root\n for i in range(len(self.original)):\n new_node = doubleLinked(val = self.original[i], prev = pre_node)\n pre_node.next = new_node\n pre_node = new_node\n # Create shuffled list\n n_nodes = len(self.original)\n # while root.next:\n while n_nodes > 0:\n rand_i = math.floor(random.random() * n_nodes) + 1 # 0 -> number of remained nodes\n # find the node\n selected_node = root\n while rand_i > 0:\n selected_node = selected_node.next\n rand_i -= 1\n # Append value\n sol.append(selected_node.val)\n # Remove node\n selected_node.prev.next = selected_node.next\n if selected_node.next:\n selected_node.next.prev = selected_node.prev\n n_nodes -= 1\n return sol\n \n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"87"},{"code":"\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self._origin_nums = nums.copy()\n self._nums = nums\n \n\n def reset(self) -> List[int]:\n return self._origin_nums\n \n\n def shuffle(self) -> List[int]:\n random.shuffle(self._nums)\n return self._nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"88"},{"code":"from random import shuffle\nclass Solution:\n def __init__(self, nums: List[int]):\n self.arr = nums\n self.saved_ori = nums.copy()\n\n def reset(self) -> List[int]:\n self.arr = self.saved_ori.copy()\n return self.saved_ori\n\n def shuffle(self) -> List[int]:\n shuffle(self.arr)\n return self.arr\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"89"},{"code":"from collections import defaultdict\n\nclass Solution:\n '''\n [15:58]\n nums = [1,2,3]\n - store a copy of the original array\n - shuffle is the same to swapping a couple of times the elements \n '''\n\n def __init__(self, nums: List[int]):\n self.array = nums\n self.orig = list(nums)\n \n def reset(self) -> List[int]:\n # O(1)/O(1)\n self.array = self.orig\n self.orig = list(self.orig)\n return self.array\n\n def shuffle(self) -> List[int]:\n # shuffle N times\n for i in range(len(self.array)):\n idx = int(random.random() * len(self.array))\n self.array[i], self.array[idx] = self.array[idx], self.array[i]\n return self.array\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"90"},{"code":"import random\nfrom typing import List\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums[:]\n self.nums = nums[:]\n\n def reset(self) -> List[int]:\n self.nums = self.original[:]\n return self.nums\n\n def shuffle(self) -> List[int]:\n random.shuffle(self.nums)\n return self.nums\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"91"},{"code":"class Solution:\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n cpy = self.nums[:]\n random.shuffle(cpy)\n return cpy\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"91"},{"code":"class Solution:\n\n # def __init__(self, nums: List[int]):\n # self.nums = nums \n\n # def reset(self) -> List[int]:\n # self.nums.sort()\n # return self.nums\n\n # def shuffle(self) -> List[int]:\n # import random as r\n # for i in range(len(self.nums)):\n # new_index = r.randint(0, len(self.nums) - 1)\n # temp = self.nums[i]\n # self.nums[i] = self.nums[new_index]\n # self.nums[new_index] = temp\n # return self.nums\n\n def __init__(self, nums):\n self.nums = nums\n self.shuffles = nums[:]\n \n\n def reset(self):\n return self.nums\n \n\n def shuffle(self):\n random.shuffle(self.shuffles)\n return self.shuffles\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"92"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.shuffles = nums[:]\n \n\n def reset(self) -> List[int]:\n return self.nums\n \n\n def shuffle(self) -> List[int]:\n random.shuffle(self.shuffles)\n return self.shuffles\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"93"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n arr = self.original.copy()\n random.shuffle(arr)\n return arr\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"94"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.shuffled = nums[:]\n\n def reset(self) -> List[int]:\n self.shuffled = self.nums[:]\n return self.nums\n\n def shuffle(self) -> List[int]:\n count = len(self.shuffled)\n for n in range(count):\n y = randrange(count)\n self.shuffled[n], self.shuffled[y] = self.shuffled[y], self.shuffled[n]\n return self.shuffled\n","runtime":"95"},{"code":"import random\nclass Solution:\n def __init__(self, nums: List[int]):\n self.original = nums.copy()\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n nums = self.original.copy() # refresh the copy everytime it calls the function\n L = len(nums)\n \n for i in range(L-1):\n # generate a random index between the current index i and L-1\n # then we can swap the random index number with the current element\n # since each index is drawn randomly, so each permuation is also randomly drawn\n randomIndex = random.randint(i, L-1)\n nums[i], nums[randomIndex] = nums[randomIndex], nums[i]\n return nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"96"},{"code":"import random\n\nclass Solution:\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n out = self.nums.copy()\n random.shuffle(out)\n return out\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"97"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums[:]\n self.current = nums\n \n\n def reset(self) -> List[int]:\n return self.original\n \n\n def shuffle(self) -> List[int]:\n idx = random.randrange(0, len(self.current))\n temp = self.current[idx]\n self.current[idx] = self.current[0]\n self.current[0] = temp\n return self.current\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"98"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums=nums\n self.shuffles=nums[:]#copy list\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n random.shuffle(self.shuffles)\n return self.shuffles\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()\n","runtime":"99"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums\n\n def reset(self) -> List[int]:\n return self.original[:]\n\n def shuffle(self) -> List[int]:\n i = 0\n shuffle = self.original[:]\n while i < len(shuffle):\n j = random.randint(i, len(shuffle) - 1)\n shuffle[i], shuffle[j] = shuffle[j], shuffle[i]\n i = j + 1\n i = len(shuffle) - 1\n #while i >= 0:\n # j = random.randint(0, i)\n # shuffle[i], shuffle[j] = shuffle[j], shuffle[i]\n # i = j - 1\n return shuffle\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"100"},{"code":"class Solution:\n def __init__(self, nums: list[int]):\n self.nums = nums\n\n def reset(self) -> list[int]:\n \"\"\"\n Resets the array to its original configuration and return it.\n \"\"\"\n return self.nums\n\n def shuffle(self) -> list[int]:\n \"\"\"\n Returns a random shuffling of the array.\n \"\"\"\n A = self.nums.copy()\n for i in range(len(A) - 1, 0, -1):\n j = random.randint(0, i)\n A[i], A[j] = A[j], A[i]\n return A","runtime":"101"},{"code":"import random\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n copy = self.nums[:]\n random.shuffle(copy)\n return copy \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"101"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.shuffled = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.shuffled.copy()\n\n count = len(self.nums)\n for n in range(0, count):\n y = randrange(0, count)\n a = result[n]\n result[n] = result[y]\n result[y] = a\n\n self.shuffled = result\n return result\n \n# for n in range(0, len(self.nums)):\n# avaialbe.append(n)\n \n# index = []\n# while len(avaialbe) > 0:\n# i = randrange(0, len(avaialbe))\n# index.append(avaialbe[i])\n# del(avaialbe[i])\n \n# result = []\n# for i in index:\n# result.append(self.nums[i])\n# return result\n\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"102"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n \n\n def reset(self) -> List[int]:\n return self.nums\n \n\n def shuffle(self) -> List[int]:\n copy = self.nums[:]\n for i in range(len(copy)):\n j = random.randrange(i+1)\n copy[i], copy[j] = copy[j], copy[i]\n return copy\n \n \n \n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"106"},{"code":"import random\nclass Solution:\n def __init__(self, nums: List[int]):\n self.nums = nums \n self.original = list(nums)\n\n def reset(self) -> List[int]:\n self.nums = self.original \n self.original = list(self.original)\n return self.nums\n\n def shuffle(self) -> List[int]: \n for i in range(len(self.nums)):\n swap = random.randrange(i, len(self.nums))\n self.nums[i], self.nums[swap] = self.nums[swap], self.nums[i]\n return self.nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"107"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.initial_position = tuple(nums)\n self.scrambled = nums\n \n\n def reset(self) -> List[int]:\n self.scrambled = list(self.initial_position)\n return self.scrambled\n\n def shuffle(self) -> List[int]:\n random.shuffle(self.scrambled)\n return self.scrambled\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"107"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n \n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n a = self.nums[:]\n random.shuffle(a)\n return a\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"108"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n \n def shuffle(self) -> List[int]:\n elements_copy = self.nums[:]\n random.shuffle(elements_copy)\n return elements_copy\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"109"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.nums[:]\n\n count = len(result)\n for n in range(0, count):\n y = randrange(0, count)\n result[n], result[y] = result[y], result[n]\n\n return result\n","runtime":"109"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums[:]\n self.nums = nums[:]\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n random.shuffle(self.nums)\n return self.nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"110"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n \n\n def shuffle(self) -> List[int]:\n res = self.nums[:]\n n = len(res)\n remainSize = n\n\n for i in range(n-1, -1, -1):\n j = random.randint(0, remainSize-1)\n res[i], res[j] = res[j], res[i]\n remainSize -= 1\n \n return res\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"110"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.array = nums\n self.o_nums = list(nums)\n\n def reset(self) -> List[int]:\n self.array = self.o_nums\n self.o_nums = list(self.o_nums)\n return self.array\n\n def shuffle(self) -> List[int]:\n temp = list(self.array)\n\n for i in range(len(self.array)):\n remove = random.randrange(len(temp))\n self.array[i] = temp.pop(remove)\n return self.array\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"111"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.original = nums.copy() # deep copy, will not reflect changes, nums changed, original will not change\n # .view() is shallow copy, different id, changes will reflect\n\n def reset(self) -> List[int]:\n self.nums = self.original.copy() # nums changed, original will not change\n return self.nums\n\n def shuffle(self) -> List[int]:\n for i in range(len(self.nums)):\n j = random.randrange(i, len(self.nums))\n self.nums[i], self.nums[j] = self.nums[j], self.nums[i]\n return self.nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"111"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.nums[:]\n\n count = len(result)\n for n in range(0, count):\n y = randrange(0, count)\n a = result[n]\n result[n] = result[y]\n result[y] = a\n\n return result\n","runtime":"112"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = list(nums)\n self.nums = nums\n \n\n def reset(self) -> List[int]:\n self.nums = self.original\n self.original = list(self.original)\n return self.nums\n\n\n def shuffle(self) -> List[int]:\n for i in range(len(self.nums)):\n index = random.randrange(i, len(self.nums))\n self.nums[i], self.nums[index] = self.nums[index], self.nums[i]\n \n return self.nums\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"112"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.nums[:]\n\n count = len(result)\n for n in range(0, count):\n y = randrange(0, count)\n result[n], result[y] = result[y], result[n]\n\n return result\n","runtime":"113"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.nums.copy()\n\n count = len(self.nums)\n for n in range(0, count):\n y = randrange(0, count)\n if n != y:\n a = result[n]\n result[n] = result[y]\n result[y] = a\n\n return result\n \n# for n in range(0, len(self.nums)):\n# avaialbe.append(n)\n \n# index = []\n# while len(avaialbe) > 0:\n# i = randrange(0, len(avaialbe))\n# index.append(avaialbe[i])\n# del(avaialbe[i])\n \n# result = []\n# for i in index:\n# result.append(self.nums[i])\n# return result\n\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"114"},{"code":"from random import randint\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.og = nums\n\n def reset(self) -> List[int]:\n return self.og\n\n def shuffle(self) -> List[int]:\n randList = []\n ogCopy = self.og[:]\n while len(ogCopy) > 1:\n randIndex = randint(0, len(ogCopy) - 1)\n randList.append(ogCopy[randIndex])\n ogCopy = ogCopy[:randIndex] + ogCopy[randIndex + 1:]\n return randList + ogCopy\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"114"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n copy_nums = self.nums.copy()\n random.shuffle(copy_nums)\n return copy_nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"115"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.A = nums\n \n\n def reset(self) -> List[int]:\n return self.A\n\n def shuffle(self) -> List[int]:\n A = self.A[:]\n \n for i in range(len(A)):\n p = randint(0, len(A)-1)\n A[p],A[i]=A[i],A[p]\n return A\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"116"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.original = nums.copy() # reference to the original\n\n def reset(self) -> List[int]:\n self.nums = self.original.copy()\n return self.nums\n\n def shuffle(self) -> List[int]:\n for i in range(len(self.nums)):\n j = random.randrange(i, len(self.nums))\n self.nums[i], self.nums[j] = self.nums[j], self.nums[i]\n return self.nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"117"},{"code":"from typing import List\nimport random\nclass Solution:\n def __init__(self, nums: List[int]):\n self.originals = nums.copy()\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.originals\n\n def shuffle(self) -> List[int]:\n for idx in range(len(self.nums)):\n new_idx = random.randrange(idx, len(self.nums))\n self.nums[idx], self.nums[new_idx] = self.nums[new_idx], self.nums[idx]\n return self.nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"118"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums.copy()\n self.array = nums\n self.n = len(nums)\n\n def reset(self) -> List[int]:\n self.array = self.original.copy()\n return self.original\n\n def shuffle(self) -> List[int]:\n for i in range(self.n):\n index_to_swap = randint(i, self.n-1)\n self.array[i], self.array[index_to_swap] = self.array[index_to_swap], self.array[i]\n return self.array\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"119"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.original = list(nums)\n\n def reset(self) -> List[int]:\n self.array = self.original\n self.original = list(self.original)\n return self.array\n\n\n def shuffle(self) -> List[int]:\n aux = list(self.nums)\n\n for idx in range(len(self.nums)):\n remove_idx = random.randrange(len(aux))\n self.nums[idx] = aux.pop(remove_idx)\n return self.nums\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"120"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.nums.copy()\n\n count = len(self.nums)\n for n in range(0, count):\n y = randrange(0, count)\n if n != y:\n a = result[n]\n result[n] = result[y]\n result[y] = a\n\n return result\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"120"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n avaialbe = []\n count = len(self.nums)\n for n in range(0, count):\n avaialbe.append(n)\n \n index = []\n while len(avaialbe) > 0:\n i = randrange(0, len(avaialbe))\n index.append(avaialbe[i])\n del(avaialbe[i])\n \n result = []\n for i in index:\n result.append(self.nums[i])\n \n return result\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"121"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums[:]\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n return random.sample(self.original, k=len(self.original))\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"122"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n \n def shuffle(self) -> List[int]:\n result = self.nums.copy()\n for i, v in enumerate(result):\n s = random.randint(0, len(self.nums) - 1)\n result[i], result[s] = result[s], result[i]\n return result","runtime":"123"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = list(nums)\n self.nums = nums\n \n\n def reset(self) -> List[int]:\n self.nums = self.original\n self.original = list(self.original)\n return self.nums\n\n\n def shuffle(self) -> List[int]:\n for i in range(len(self.nums)):\n index = random.randrange(i, len(self.nums))\n self.nums[i], self.nums[index] = self.nums[index], self.nums[i]\n \n return self.nums\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"123"},{"code":"class Solution:\n\tdef __init__(self, nums: List[int]):\n\t\tself.arr = nums[:] # Deep Copy, Can also use Shallow Copy concept!\n\t\t# self.arr = nums # Shallow Copy would be something like this!\n\n\tdef reset(self) -> List[int]:\n\t\treturn self.arr\n\n\tdef shuffle(self) -> List[int]:\n\t\tans = self.arr[:]\n\t\tfor i in range(len(ans)):\n\t\t\tswp_num = random.randrange(i, len(ans)) # Fisher-Yates Algorithm\n\t\t\tans[i], ans[swp_num] = ans[swp_num], ans[i]\n\t\treturn ans","runtime":"124"},{"code":"class Solution:\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.original = list(nums)\n\n def reset(self) -> List[int]:\n self.nums = list(self.original)\n return self.nums\n\n def shuffle(self) -> List[int]:\n n = len(self.nums)\n for i in range(n):\n # Choose a random index j from i to n-1\n j = random.randrange(0, n)\n # Swap nums[i] and nums[j]\n self.nums[i], self.nums[j] = self.nums[j], self.nums[i]\n return self.nums\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"125"},{"code":"import random\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums[::]\n self.arr = nums\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n for i in range(len(self.arr)):\n new_index = random.randint(0,len(self.arr) - 1)\n temp = self.arr[new_index]\n self.arr[new_index] = self.arr[i]\n self.arr[i] = temp\n return self.arr\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"126"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.original = nums\n self.len = len(nums)\n\n def reset(self) -> List[int]:\n return self.original\n\n def shuffle(self) -> List[int]:\n shuffled = []\n indices = set([i for i in range(0, self.len)])\n count = 0\n while count != self.len:\n i = random.choice(list(indices))\n count += 1\n indices.remove(i)\n shuffled.append(self.original[i])\n return shuffled\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"127"},{"code":"import random\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.list = nums\n \n\n def reset(self) -> List[int]:\n return self.list\n\n def shuffle(self) -> List[int]:\n return random.sample(self.list, len(self.list))\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"128"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.array = nums\n self.original = list(nums)\n \n\n def reset(self) -> List[int]:\n self.array = self.original\n self.original = list(self.original)\n return self.array\n \n\n def shuffle(self) -> List[int]:\n self.choices = list(self.array)\n for i in range(len(self.array)):\n choice = random.randrange(len(self.choices))\n self.array[i] = self.choices[choice]\n self.choices[choice], self.choices[-1] = self.choices[-1], self.choices[choice]\n self.choices.pop()\n return self.array\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"129"},{"code":"import random\n\nclass Solution:\n def __init__(self, nums: List[int]):\n self._nums = nums\n\n def reset(self) -> List[int]:\n \n return self._nums\n\n def shuffle(self) -> List[int]:\n nums = copy.deepcopy(self._nums)\n random.shuffle(nums)\n return nums\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"130"},{"code":"import random\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.shuffled = nums[:]\n self.n = len(nums)\n\n def reset(self) -> List[int]:\n self.shuffled = self.nums[:]\n return self.nums\n\n\n def shuffle(self) -> List[int]:\n # assume anything between self.shuffled[0:start] has been renewed by the loop below\n for start in range(self.n):\n idx = random.randrange(start,self.n)\n # swap self.nums[start] and self.nums[idx]\n self.shuffled[start],self.shuffled[idx] = self.shuffled[idx],self.shuffled[start]\n return self.shuffled\n\n\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"131"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.arr = nums[:]\n self.origin = nums\n\n def reset(self) -> List[int]:\n self.arr = self.origin[:]\n return self.arr\n \n\n def shuffle(self) -> List[int]:\n for i in range(len(self.arr)):\n rnd_idx = random.randint(i, len(self.arr)-1)\n self.arr[rnd_idx], self.arr[i] = self.arr[i], self.arr[rnd_idx]\n print(self.arr)\n return self.arr\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"132"},{"code":"import random\nfrom typing import List\n\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n \n def shuffle(self) -> List[int]:\n shuffled_list: List[int] = [0] * len(self.nums)\n new_indices = random.sample(range(0, len(self.nums)), len(self.nums))\n for num, new_idx in zip(self.nums, new_indices):\n shuffled_list[new_idx] = num\n return shuffled_list\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()\n","runtime":"133"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.orig = nums\n\n def reset(self) -> List[int]:\n self.nums = self.orig\n return self.nums\n\n def permutation(self, res):\n if len(res) == len(self.nums):\n return res\n\n next_possible = list(filter(lambda x: x not in res, self.nums))\n next_val = random.choice(next_possible)\n return self.permutation([*res, next_val])\n\n def shuffle(self) -> List[int]:\n self.nums = self.permutation([])\n return self.nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"134"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n self.n = len(nums)\n self.org = nums[:]\n \n def reset(self) -> List[int]:\n return self.org\n\n def shuffle(self) -> List[int]:\n arr = self.nums\n for i in range(self.n):\n a = random.randint(0, self.n -1)\n b = random.randint(0, self.n -1)\n arr[a] , arr[b] = arr[b], arr[a]\n return arr\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","runtime":"135"}],"string":"[\n {\n \"code\": \"import math\\nimport random\\nclass doubleLinked:\\n def __init__(self, val=-1, prev=None, next=None):\\n self.val = val\\n self.prev = prev\\n self.next = next\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n \\\"\\\"\\\"\\n sol = []\\n for loop 0 -> len(list)-1\\n set_idx = set(list(range(len(list)))) -> all indicies \\n while set_idx\\n rand_i = rand() * len(set)\\n remove node at rand_i position from root in linked list\\n append value at rand_i index to sol\\n del value at rand_i index\\n return sol\\n \\\"\\\"\\\"\\n # Optimal approach\\n sol = self.original[:]\\n for i in range(len(sol)):\\n rand_int = math.floor(random.random() * (len(sol) - i)) + i\\n sol[i], sol[rand_int] = sol[rand_int], sol[i]\\n return sol\\n # My stupid approach that seemed wise\\n sol = []\\n # Nums list -> Doubly Linked List\\n root = doubleLinked()\\n pre_node = root\\n for i in range(len(self.original)):\\n new_node = doubleLinked(val = self.original[i], prev = pre_node)\\n pre_node.next = new_node\\n pre_node = new_node\\n # Create shuffled list\\n n_nodes = len(self.original)\\n # while root.next:\\n while n_nodes > 0:\\n rand_i = math.floor(random.random() * n_nodes) + 1 # 0 -> number of remained nodes\\n # find the node\\n selected_node = root\\n while rand_i > 0:\\n selected_node = selected_node.next\\n rand_i -= 1\\n # Append value\\n sol.append(selected_node.val)\\n # Remove node\\n selected_node.prev.next = selected_node.next\\n if selected_node.next:\\n selected_node.next.prev = selected_node.prev\\n n_nodes -= 1\\n return sol\\n \\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self._origin_nums = nums.copy()\\n self._nums = nums\\n \\n\\n def reset(self) -> List[int]:\\n return self._origin_nums\\n \\n\\n def shuffle(self) -> List[int]:\\n random.shuffle(self._nums)\\n return self._nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"from random import shuffle\\nclass Solution:\\n def __init__(self, nums: List[int]):\\n self.arr = nums\\n self.saved_ori = nums.copy()\\n\\n def reset(self) -> List[int]:\\n self.arr = self.saved_ori.copy()\\n return self.saved_ori\\n\\n def shuffle(self) -> List[int]:\\n shuffle(self.arr)\\n return self.arr\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n '''\\n [15:58]\\n nums = [1,2,3]\\n - store a copy of the original array\\n - shuffle is the same to swapping a couple of times the elements \\n '''\\n\\n def __init__(self, nums: List[int]):\\n self.array = nums\\n self.orig = list(nums)\\n \\n def reset(self) -> List[int]:\\n # O(1)/O(1)\\n self.array = self.orig\\n self.orig = list(self.orig)\\n return self.array\\n\\n def shuffle(self) -> List[int]:\\n # shuffle N times\\n for i in range(len(self.array)):\\n idx = int(random.random() * len(self.array))\\n self.array[i], self.array[idx] = self.array[idx], self.array[i]\\n return self.array\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"import random\\nfrom typing import List\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums[:]\\n self.nums = nums[:]\\n\\n def reset(self) -> List[int]:\\n self.nums = self.original[:]\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n random.shuffle(self.nums)\\n return self.nums\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n cpy = self.nums[:]\\n random.shuffle(cpy)\\n return cpy\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n\\n # def __init__(self, nums: List[int]):\\n # self.nums = nums \\n\\n # def reset(self) -> List[int]:\\n # self.nums.sort()\\n # return self.nums\\n\\n # def shuffle(self) -> List[int]:\\n # import random as r\\n # for i in range(len(self.nums)):\\n # new_index = r.randint(0, len(self.nums) - 1)\\n # temp = self.nums[i]\\n # self.nums[i] = self.nums[new_index]\\n # self.nums[new_index] = temp\\n # return self.nums\\n\\n def __init__(self, nums):\\n self.nums = nums\\n self.shuffles = nums[:]\\n \\n\\n def reset(self):\\n return self.nums\\n \\n\\n def shuffle(self):\\n random.shuffle(self.shuffles)\\n return self.shuffles\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.shuffles = nums[:]\\n \\n\\n def reset(self) -> List[int]:\\n return self.nums\\n \\n\\n def shuffle(self) -> List[int]:\\n random.shuffle(self.shuffles)\\n return self.shuffles\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n arr = self.original.copy()\\n random.shuffle(arr)\\n return arr\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.shuffled = nums[:]\\n\\n def reset(self) -> List[int]:\\n self.shuffled = self.nums[:]\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n count = len(self.shuffled)\\n for n in range(count):\\n y = randrange(count)\\n self.shuffled[n], self.shuffled[y] = self.shuffled[y], self.shuffled[n]\\n return self.shuffled\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n def __init__(self, nums: List[int]):\\n self.original = nums.copy()\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n nums = self.original.copy() # refresh the copy everytime it calls the function\\n L = len(nums)\\n \\n for i in range(L-1):\\n # generate a random index between the current index i and L-1\\n # then we can swap the random index number with the current element\\n # since each index is drawn randomly, so each permuation is also randomly drawn\\n randomIndex = random.randint(i, L-1)\\n nums[i], nums[randomIndex] = nums[randomIndex], nums[i]\\n return nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n out = self.nums.copy()\\n random.shuffle(out)\\n return out\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums[:]\\n self.current = nums\\n \\n\\n def reset(self) -> List[int]:\\n return self.original\\n \\n\\n def shuffle(self) -> List[int]:\\n idx = random.randrange(0, len(self.current))\\n temp = self.current[idx]\\n self.current[idx] = self.current[0]\\n self.current[0] = temp\\n return self.current\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums=nums\\n self.shuffles=nums[:]#copy list\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n random.shuffle(self.shuffles)\\n return self.shuffles\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\\n\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums\\n\\n def reset(self) -> List[int]:\\n return self.original[:]\\n\\n def shuffle(self) -> List[int]:\\n i = 0\\n shuffle = self.original[:]\\n while i < len(shuffle):\\n j = random.randint(i, len(shuffle) - 1)\\n shuffle[i], shuffle[j] = shuffle[j], shuffle[i]\\n i = j + 1\\n i = len(shuffle) - 1\\n #while i >= 0:\\n # j = random.randint(0, i)\\n # shuffle[i], shuffle[j] = shuffle[j], shuffle[i]\\n # i = j - 1\\n return shuffle\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, nums: list[int]):\\n self.nums = nums\\n\\n def reset(self) -> list[int]:\\n \\\"\\\"\\\"\\n Resets the array to its original configuration and return it.\\n \\\"\\\"\\\"\\n return self.nums\\n\\n def shuffle(self) -> list[int]:\\n \\\"\\\"\\\"\\n Returns a random shuffling of the array.\\n \\\"\\\"\\\"\\n A = self.nums.copy()\\n for i in range(len(A) - 1, 0, -1):\\n j = random.randint(0, i)\\n A[i], A[j] = A[j], A[i]\\n return A\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n copy = self.nums[:]\\n random.shuffle(copy)\\n return copy \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.shuffled = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.shuffled.copy()\\n\\n count = len(self.nums)\\n for n in range(0, count):\\n y = randrange(0, count)\\n a = result[n]\\n result[n] = result[y]\\n result[y] = a\\n\\n self.shuffled = result\\n return result\\n \\n# for n in range(0, len(self.nums)):\\n# avaialbe.append(n)\\n \\n# index = []\\n# while len(avaialbe) > 0:\\n# i = randrange(0, len(avaialbe))\\n# index.append(avaialbe[i])\\n# del(avaialbe[i])\\n \\n# result = []\\n# for i in index:\\n# result.append(self.nums[i])\\n# return result\\n\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n \\n\\n def reset(self) -> List[int]:\\n return self.nums\\n \\n\\n def shuffle(self) -> List[int]:\\n copy = self.nums[:]\\n for i in range(len(copy)):\\n j = random.randrange(i+1)\\n copy[i], copy[j] = copy[j], copy[i]\\n return copy\\n \\n \\n \\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n def __init__(self, nums: List[int]):\\n self.nums = nums \\n self.original = list(nums)\\n\\n def reset(self) -> List[int]:\\n self.nums = self.original \\n self.original = list(self.original)\\n return self.nums\\n\\n def shuffle(self) -> List[int]: \\n for i in range(len(self.nums)):\\n swap = random.randrange(i, len(self.nums))\\n self.nums[i], self.nums[swap] = self.nums[swap], self.nums[i]\\n return self.nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.initial_position = tuple(nums)\\n self.scrambled = nums\\n \\n\\n def reset(self) -> List[int]:\\n self.scrambled = list(self.initial_position)\\n return self.scrambled\\n\\n def shuffle(self) -> List[int]:\\n random.shuffle(self.scrambled)\\n return self.scrambled\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n \\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n a = self.nums[:]\\n random.shuffle(a)\\n return a\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n \\n def shuffle(self) -> List[int]:\\n elements_copy = self.nums[:]\\n random.shuffle(elements_copy)\\n return elements_copy\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.nums[:]\\n\\n count = len(result)\\n for n in range(0, count):\\n y = randrange(0, count)\\n result[n], result[y] = result[y], result[n]\\n\\n return result\\n\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums[:]\\n self.nums = nums[:]\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n random.shuffle(self.nums)\\n return self.nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n \\n\\n def shuffle(self) -> List[int]:\\n res = self.nums[:]\\n n = len(res)\\n remainSize = n\\n\\n for i in range(n-1, -1, -1):\\n j = random.randint(0, remainSize-1)\\n res[i], res[j] = res[j], res[i]\\n remainSize -= 1\\n \\n return res\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.array = nums\\n self.o_nums = list(nums)\\n\\n def reset(self) -> List[int]:\\n self.array = self.o_nums\\n self.o_nums = list(self.o_nums)\\n return self.array\\n\\n def shuffle(self) -> List[int]:\\n temp = list(self.array)\\n\\n for i in range(len(self.array)):\\n remove = random.randrange(len(temp))\\n self.array[i] = temp.pop(remove)\\n return self.array\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.original = nums.copy() # deep copy, will not reflect changes, nums changed, original will not change\\n # .view() is shallow copy, different id, changes will reflect\\n\\n def reset(self) -> List[int]:\\n self.nums = self.original.copy() # nums changed, original will not change\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n for i in range(len(self.nums)):\\n j = random.randrange(i, len(self.nums))\\n self.nums[i], self.nums[j] = self.nums[j], self.nums[i]\\n return self.nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.nums[:]\\n\\n count = len(result)\\n for n in range(0, count):\\n y = randrange(0, count)\\n a = result[n]\\n result[n] = result[y]\\n result[y] = a\\n\\n return result\\n\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = list(nums)\\n self.nums = nums\\n \\n\\n def reset(self) -> List[int]:\\n self.nums = self.original\\n self.original = list(self.original)\\n return self.nums\\n\\n\\n def shuffle(self) -> List[int]:\\n for i in range(len(self.nums)):\\n index = random.randrange(i, len(self.nums))\\n self.nums[i], self.nums[index] = self.nums[index], self.nums[i]\\n \\n return self.nums\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.nums[:]\\n\\n count = len(result)\\n for n in range(0, count):\\n y = randrange(0, count)\\n result[n], result[y] = result[y], result[n]\\n\\n return result\\n\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.nums.copy()\\n\\n count = len(self.nums)\\n for n in range(0, count):\\n y = randrange(0, count)\\n if n != y:\\n a = result[n]\\n result[n] = result[y]\\n result[y] = a\\n\\n return result\\n \\n# for n in range(0, len(self.nums)):\\n# avaialbe.append(n)\\n \\n# index = []\\n# while len(avaialbe) > 0:\\n# i = randrange(0, len(avaialbe))\\n# index.append(avaialbe[i])\\n# del(avaialbe[i])\\n \\n# result = []\\n# for i in index:\\n# result.append(self.nums[i])\\n# return result\\n\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"from random import randint\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.og = nums\\n\\n def reset(self) -> List[int]:\\n return self.og\\n\\n def shuffle(self) -> List[int]:\\n randList = []\\n ogCopy = self.og[:]\\n while len(ogCopy) > 1:\\n randIndex = randint(0, len(ogCopy) - 1)\\n randList.append(ogCopy[randIndex])\\n ogCopy = ogCopy[:randIndex] + ogCopy[randIndex + 1:]\\n return randList + ogCopy\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n copy_nums = self.nums.copy()\\n random.shuffle(copy_nums)\\n return copy_nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.A = nums\\n \\n\\n def reset(self) -> List[int]:\\n return self.A\\n\\n def shuffle(self) -> List[int]:\\n A = self.A[:]\\n \\n for i in range(len(A)):\\n p = randint(0, len(A)-1)\\n A[p],A[i]=A[i],A[p]\\n return A\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.original = nums.copy() # reference to the original\\n\\n def reset(self) -> List[int]:\\n self.nums = self.original.copy()\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n for i in range(len(self.nums)):\\n j = random.randrange(i, len(self.nums))\\n self.nums[i], self.nums[j] = self.nums[j], self.nums[i]\\n return self.nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"from typing import List\\nimport random\\nclass Solution:\\n def __init__(self, nums: List[int]):\\n self.originals = nums.copy()\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.originals\\n\\n def shuffle(self) -> List[int]:\\n for idx in range(len(self.nums)):\\n new_idx = random.randrange(idx, len(self.nums))\\n self.nums[idx], self.nums[new_idx] = self.nums[new_idx], self.nums[idx]\\n return self.nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums.copy()\\n self.array = nums\\n self.n = len(nums)\\n\\n def reset(self) -> List[int]:\\n self.array = self.original.copy()\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n for i in range(self.n):\\n index_to_swap = randint(i, self.n-1)\\n self.array[i], self.array[index_to_swap] = self.array[index_to_swap], self.array[i]\\n return self.array\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.original = list(nums)\\n\\n def reset(self) -> List[int]:\\n self.array = self.original\\n self.original = list(self.original)\\n return self.array\\n\\n\\n def shuffle(self) -> List[int]:\\n aux = list(self.nums)\\n\\n for idx in range(len(self.nums)):\\n remove_idx = random.randrange(len(aux))\\n self.nums[idx] = aux.pop(remove_idx)\\n return self.nums\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.nums.copy()\\n\\n count = len(self.nums)\\n for n in range(0, count):\\n y = randrange(0, count)\\n if n != y:\\n a = result[n]\\n result[n] = result[y]\\n result[y] = a\\n\\n return result\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n avaialbe = []\\n count = len(self.nums)\\n for n in range(0, count):\\n avaialbe.append(n)\\n \\n index = []\\n while len(avaialbe) > 0:\\n i = randrange(0, len(avaialbe))\\n index.append(avaialbe[i])\\n del(avaialbe[i])\\n \\n result = []\\n for i in index:\\n result.append(self.nums[i])\\n \\n return result\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums[:]\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n return random.sample(self.original, k=len(self.original))\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n \\n def shuffle(self) -> List[int]:\\n result = self.nums.copy()\\n for i, v in enumerate(result):\\n s = random.randint(0, len(self.nums) - 1)\\n result[i], result[s] = result[s], result[i]\\n return result\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = list(nums)\\n self.nums = nums\\n \\n\\n def reset(self) -> List[int]:\\n self.nums = self.original\\n self.original = list(self.original)\\n return self.nums\\n\\n\\n def shuffle(self) -> List[int]:\\n for i in range(len(self.nums)):\\n index = random.randrange(i, len(self.nums))\\n self.nums[i], self.nums[index] = self.nums[index], self.nums[i]\\n \\n return self.nums\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n\\tdef __init__(self, nums: List[int]):\\n\\t\\tself.arr = nums[:] # Deep Copy, Can also use Shallow Copy concept!\\n\\t\\t# self.arr = nums # Shallow Copy would be something like this!\\n\\n\\tdef reset(self) -> List[int]:\\n\\t\\treturn self.arr\\n\\n\\tdef shuffle(self) -> List[int]:\\n\\t\\tans = self.arr[:]\\n\\t\\tfor i in range(len(ans)):\\n\\t\\t\\tswp_num = random.randrange(i, len(ans)) # Fisher-Yates Algorithm\\n\\t\\t\\tans[i], ans[swp_num] = ans[swp_num], ans[i]\\n\\t\\treturn ans\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.original = list(nums)\\n\\n def reset(self) -> List[int]:\\n self.nums = list(self.original)\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n n = len(self.nums)\\n for i in range(n):\\n # Choose a random index j from i to n-1\\n j = random.randrange(0, n)\\n # Swap nums[i] and nums[j]\\n self.nums[i], self.nums[j] = self.nums[j], self.nums[i]\\n return self.nums\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"125\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums[::]\\n self.arr = nums\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n for i in range(len(self.arr)):\\n new_index = random.randint(0,len(self.arr) - 1)\\n temp = self.arr[new_index]\\n self.arr[new_index] = self.arr[i]\\n self.arr[i] = temp\\n return self.arr\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.original = nums\\n self.len = len(nums)\\n\\n def reset(self) -> List[int]:\\n return self.original\\n\\n def shuffle(self) -> List[int]:\\n shuffled = []\\n indices = set([i for i in range(0, self.len)])\\n count = 0\\n while count != self.len:\\n i = random.choice(list(indices))\\n count += 1\\n indices.remove(i)\\n shuffled.append(self.original[i])\\n return shuffled\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.list = nums\\n \\n\\n def reset(self) -> List[int]:\\n return self.list\\n\\n def shuffle(self) -> List[int]:\\n return random.sample(self.list, len(self.list))\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.array = nums\\n self.original = list(nums)\\n \\n\\n def reset(self) -> List[int]:\\n self.array = self.original\\n self.original = list(self.original)\\n return self.array\\n \\n\\n def shuffle(self) -> List[int]:\\n self.choices = list(self.array)\\n for i in range(len(self.array)):\\n choice = random.randrange(len(self.choices))\\n self.array[i] = self.choices[choice]\\n self.choices[choice], self.choices[-1] = self.choices[-1], self.choices[choice]\\n self.choices.pop()\\n return self.array\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"129\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n def __init__(self, nums: List[int]):\\n self._nums = nums\\n\\n def reset(self) -> List[int]:\\n \\n return self._nums\\n\\n def shuffle(self) -> List[int]:\\n nums = copy.deepcopy(self._nums)\\n random.shuffle(nums)\\n return nums\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"import random\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.shuffled = nums[:]\\n self.n = len(nums)\\n\\n def reset(self) -> List[int]:\\n self.shuffled = self.nums[:]\\n return self.nums\\n\\n\\n def shuffle(self) -> List[int]:\\n # assume anything between self.shuffled[0:start] has been renewed by the loop below\\n for start in range(self.n):\\n idx = random.randrange(start,self.n)\\n # swap self.nums[start] and self.nums[idx]\\n self.shuffled[start],self.shuffled[idx] = self.shuffled[idx],self.shuffled[start]\\n return self.shuffled\\n\\n\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"131\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.arr = nums[:]\\n self.origin = nums\\n\\n def reset(self) -> List[int]:\\n self.arr = self.origin[:]\\n return self.arr\\n \\n\\n def shuffle(self) -> List[int]:\\n for i in range(len(self.arr)):\\n rnd_idx = random.randint(i, len(self.arr)-1)\\n self.arr[rnd_idx], self.arr[i] = self.arr[i], self.arr[rnd_idx]\\n print(self.arr)\\n return self.arr\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"132\"\n },\n {\n \"code\": \"import random\\nfrom typing import List\\n\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n \\n def shuffle(self) -> List[int]:\\n shuffled_list: List[int] = [0] * len(self.nums)\\n new_indices = random.sample(range(0, len(self.nums)), len(self.nums))\\n for num, new_idx in zip(self.nums, new_indices):\\n shuffled_list[new_idx] = num\\n return shuffled_list\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\\n\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.orig = nums\\n\\n def reset(self) -> List[int]:\\n self.nums = self.orig\\n return self.nums\\n\\n def permutation(self, res):\\n if len(res) == len(self.nums):\\n return res\\n\\n next_possible = list(filter(lambda x: x not in res, self.nums))\\n next_val = random.choice(next_possible)\\n return self.permutation([*res, next_val])\\n\\n def shuffle(self) -> List[int]:\\n self.nums = self.permutation([])\\n return self.nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n self.n = len(nums)\\n self.org = nums[:]\\n \\n def reset(self) -> List[int]:\\n return self.org\\n\\n def shuffle(self) -> List[int]:\\n arr = self.nums\\n for i in range(self.n):\\n a = random.randint(0, self.n -1)\\n b = random.randint(0, self.n -1)\\n arr[a] , arr[b] = arr[b], arr[a]\\n return arr\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"runtime\": \"135\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":56,"string":"56"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n keys = self.nums.copy()\n perm = []\n while keys:\n index = floor(random.random()*len(keys))\n keys[-1], keys[index] = keys[index], keys[-1]\n perm.append(keys.pop())\n return perm\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","memory":"19700"},{"code":"class Solution:\n def __init__(self, nums: List[int]):\n self.array = nums\n self.original = list(nums)\n\n def reset(self) -> List[int]:\n return self.original\n \n\n def shuffle(self) -> List[int]:\n n = len(self.array)\n for i in range(n):\n j = random.randrange(i, n)\n self.array[i], self.array[j] = self.array[j], self.array[i]\n return self.array\n","memory":"19800"},{"code":"import random \n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n print(self.nums)\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n return sorted(self.nums, key=lambda x: random.random())\n\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()\n\n","memory":"19900"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n avaialbe = []\n count = len(self.nums)\n for n in range(0, count):\n avaialbe.append(n)\n \n index = []\n while len(avaialbe) > 0:\n i = randrange(0, len(avaialbe))\n index.append(avaialbe[i])\n del(avaialbe[i])\n \n result = []\n for i in index:\n result.append(self.nums[i])\n \n return result\n \n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","memory":"20000"},{"code":"import random\n\nclass Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n result = self.nums[:]\n\n count = len(result)\n for n in range(count):\n y = randrange(count)\n result[n], result[y] = result[y], result[n]\n\n return result\n","memory":"20000"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.nums = nums\n\n def reset(self) -> List[int]:\n return self.nums\n\n def shuffle(self) -> List[int]:\n copy_nums = self.nums.copy()\n random.shuffle(copy_nums)\n return copy_nums\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","memory":"20100"},{"code":"class Solution:\n\n def __init__(self, nums: List[int]):\n self.array = nums\n self.o_nums = list(nums)\n\n def reset(self) -> List[int]:\n self.array = self.o_nums\n self.o_nums = list(self.o_nums)\n return self.array\n\n def shuffle(self) -> List[int]:\n temp = list(self.array)\n\n for i in range(len(self.array)):\n remove = random.randrange(len(temp))\n self.array[i] = temp.pop(remove)\n return self.array\n\n\n# Your Solution object will be instantiated and called as such:\n# obj = Solution(nums)\n# param_1 = obj.reset()\n# param_2 = obj.shuffle()","memory":"20100"}],"string":"[\n {\n \"code\": \"class Solution:\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n keys = self.nums.copy()\\n perm = []\\n while keys:\\n index = floor(random.random()*len(keys))\\n keys[-1], keys[index] = keys[index], keys[-1]\\n perm.append(keys.pop())\\n return perm\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self, nums: List[int]):\\n self.array = nums\\n self.original = list(nums)\\n\\n def reset(self) -> List[int]:\\n return self.original\\n \\n\\n def shuffle(self) -> List[int]:\\n n = len(self.array)\\n for i in range(n):\\n j = random.randrange(i, n)\\n self.array[i], self.array[j] = self.array[j], self.array[i]\\n return self.array\\n\",\n \"memory\": \"19800\"\n },\n {\n \"code\": \"import random \\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n print(self.nums)\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n return sorted(self.nums, key=lambda x: random.random())\\n\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\\n\\n\",\n \"memory\": \"19900\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n avaialbe = []\\n count = len(self.nums)\\n for n in range(0, count):\\n avaialbe.append(n)\\n \\n index = []\\n while len(avaialbe) > 0:\\n i = randrange(0, len(avaialbe))\\n index.append(avaialbe[i])\\n del(avaialbe[i])\\n \\n result = []\\n for i in index:\\n result.append(self.nums[i])\\n \\n return result\\n \\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"import random\\n\\nclass Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n result = self.nums[:]\\n\\n count = len(result)\\n for n in range(count):\\n y = randrange(count)\\n result[n], result[y] = result[y], result[n]\\n\\n return result\\n\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.nums = nums\\n\\n def reset(self) -> List[int]:\\n return self.nums\\n\\n def shuffle(self) -> List[int]:\\n copy_nums = self.nums.copy()\\n random.shuffle(copy_nums)\\n return copy_nums\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n\\n def __init__(self, nums: List[int]):\\n self.array = nums\\n self.o_nums = list(nums)\\n\\n def reset(self) -> List[int]:\\n self.array = self.o_nums\\n self.o_nums = list(self.o_nums)\\n return self.array\\n\\n def shuffle(self) -> List[int]:\\n temp = list(self.array)\\n\\n for i in range(len(self.array)):\\n remove = random.randrange(len(temp))\\n self.array[i] = temp.pop(remove)\\n return self.array\\n\\n\\n# Your Solution object will be instantiated and called as such:\\n# obj = Solution(nums)\\n# param_1 = obj.reset()\\n# param_2 = obj.shuffle()\",\n \"memory\": \"20100\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":288,"cells":{"question_id":{"kind":"number","value":385,"string":"385"},"name":{"kind":"string","value":"mini-parser"},"content":{"kind":"string","value":"<p>Given a string s represents the serialization of a nested list, implement a parser to deserialize it and return <em>the deserialized</em> <code>NestedInteger</code>.</p>\n\n<p>Each element is either an integer or a list whose elements may also be integers or other lists.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "324"\n<strong>Output:</strong> 324\n<strong>Explanation:</strong> You should return a NestedInteger object which contains a single integer 324.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "[123,[456,[789]]]"\n<strong>Output:</strong> [123,[456,[789]]]\n<strong>Explanation:</strong> Return a NestedInteger object containing a nested list with 2 elements:\n1. An integer containing value 123.\n2. A nested list containing two elements:\n i. An integer containing value 456.\n ii. A nested list with one element:\n a. An integer containing value 789\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>s</code> consists of digits, square brackets <code>"[]"</code>, negative sign <code>'-'</code>, and commas <code>','</code>.</li>\n\t<li><code>s</code> is the serialization of valid <code>NestedInteger</code>.</li>\n\t<li>All the values in the input are in the range <code>[-10<sup>6</sup>, 10<sup>6</sup>]</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":38.763475657193666,"string":"38.763476"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["string","stack","depth-first-search"],"string":"[\n \"string\",\n \"stack\",\n \"depth-first-search\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"35\", 0.2591], [\"39\", 0.2591], [\"40\", 0.2591], [\"41\", 1.0363], [\"42\", 1.2953], [\"43\", 1.2953], [\"44\", 0.7772], [\"45\", 1.0363], [\"46\", 3.6269], [\"47\", 3.1088], [\"48\", 3.1088], [\"49\", 0.7772], [\"50\", 3.3679], [\"51\", 7.772], [\"52\", 6.4767], [\"53\", 6.2176], [\"54\", 4.6632], [\"55\", 6.7358], [\"56\", 5.4404], [\"57\", 4.6632], [\"58\", 4.1451], [\"59\", 4.1451], [\"60\", 4.6632], [\"61\", 5.9585], [\"62\", 2.8497], [\"63\", 2.3316], [\"64\", 3.3679], [\"65\", 1.5544], [\"66\", 0.7772], [\"67\", 0.7772], [\"68\", 0.2591], [\"71\", 0.2591], [\"72\", 0.5181], [\"74\", 0.7772], [\"75\", 0.2591]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18100\", 0.5181], [\"18200\", 0.7772], [\"18300\", 0.2591], [\"18400\", 0.7772], [\"18500\", 0.5181], [\"18900\", 2.8497], [\"19000\", 34.9741], [\"19100\", 39.8964], [\"19200\", 4.6632], [\"19300\", 2.0725], [\"19400\", 0.7772], [\"19500\", 0.2591], [\"19700\", 0.2591], [\"20000\", 0.2591], [\"20100\", 1.0363], [\"20200\", 0.2591], [\"20500\", 0.2591], [\"24600\", 0.2591], [\"24700\", 0.2591], [\"26000\", 0.5181]]}"},"rt_list":{"kind":"list like","value":[{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] != '[':\n return NestedInteger(int(s))\n stack = []\n for i, c in enumerate(s):\n if c == '[':\n stack.append(NestedInteger())\n start = i + 1\n elif c == ',':\n if i > start:\n num = int(s[start:i])\n stack[-1].add(NestedInteger(num))\n start = i + 1\n elif c == ']':\n popped = stack.pop()\n if i > start:\n num = int(s[start:i])\n popped.add(NestedInteger(num))\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n start = i + 1\n ","runtime":"35"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] != '[': return NestedInteger(int(s))\n stack = []\n\n for i, ch in enumerate(s):\n if ch == \"[\":\n stack.append(NestedInteger())\n start = i + 1\n elif ch == \",\":\n if i > start:\n num = int(s[start:i])\n stack[-1].add(NestedInteger(num))\n start = i + 1\n elif ch == \"]\":\n popped = stack.pop()\n if i > start:\n num = int(s[start:i])\n popped.add(NestedInteger(num))\n \n if stack: stack[-1].add(popped)\n else: return popped\n start = i + 1","runtime":"39"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if \"[\" not in s:\n return NestedInteger(int(s))\n s = list(s)\n out = []\n number = \"\"\n for i, c in enumerate(s):\n if c == \"[\":\n out.append(NestedInteger())\n elif c == \"]\":\n ni = out.pop()\n if number != \"\":\n ni.add(NestedInteger(int(number)))\n number = \"\"\n if len(out) > 0:\n out[-1].add(ni)\n else:\n return ni\n elif c == \",\" and number != \"\":\n out[-1].add(NestedInteger(int(number)))\n number = \"\"\n elif c.isdigit() or c == \"-\":\n number += c","runtime":"40"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def nestedInteger(x):\n return NestedInteger(int(x))\n \n stack = []\n current = None\n num = ''\n \n for char in s:\n if char == '[':\n if current:\n stack.append(current)\n current = NestedInteger()\n elif char == ']':\n if num:\n current.add(nestedInteger(num))\n num = ''\n if stack:\n stack[-1].add(current)\n current = stack.pop()\n elif char == '-':\n if num:\n current.add(nestedInteger(num))\n num = ''\n num += char\n elif char.isdigit():\n num += char\n elif char == ',':\n if num:\n current.add(nestedInteger(num))\n num = ''\n \n return current if current else nestedInteger(s)","runtime":"41"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def recursion(self, s: str) -> NestedInteger:\n if len(s) == 0:\n return NestedInteger()\n \n if s == '[]':\n return NestedInteger()\n \n if '[' not in s and ',' not in s:\n return NestedInteger(int(s))\n \n\n current_s = \"\"\n nested = NestedInteger()\n braces_count = 0\n\n for c in s[1:-1]:\n if c == '[':\n braces_count += 1\n\n if c == ']':\n braces_count -= 1\n\n if c == ',' and braces_count == 0:\n nested.add(self.deserialize(current_s))\n current_s = \"\"\n continue\n\n current_s += c\n \n nested.add(self.deserialize(current_s))\n return nested\n\n def iterative(self, s: str) -> NestedInteger:\n # solution using stack\n if len(s) == 0:\n return NestedInteger()\n \n if s == '[]':\n return NestedInteger()\n \n if '[' not in s and ',' not in s:\n return NestedInteger(int(s))\n\n stack = []\n current = None # current NestedInteger which we are constructing\n number = \"\"\n\n for c in s:\n if c == '[':\n if current:\n stack.append(current)\n current = NestedInteger()\n continue\n \n if c == ']':\n if number:\n current.add(NestedInteger(int(number)))\n number = \"\" \n if stack:\n top = stack.pop()\n top.add(current)\n current = top\n continue\n \n if c == ',' and number:\n current.add(NestedInteger(int(number)))\n number = \"\"\n continue\n \n if c != ',':\n number += c\n\n return current\n\n def deserialize(self, s: str) -> NestedInteger:\n return self.iterative(s)","runtime":"42"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if not s:\n return None\n if s[0] != '[':\n return NestedInteger(int(s))\n \n stack = []\n num = None\n negative = False\n for i, ch in enumerate(s):\n if ch == '[':\n stack.append(NestedInteger())\n elif ch == ']':\n if num is not None:\n if negative:\n num = -num\n negative = False\n stack[-1].add(NestedInteger(num))\n num = None\n if len(stack) > 1:\n top = stack.pop()\n stack[-1].add(top)\n elif ch == ',':\n if num is not None:\n if negative:\n num = -num\n negative = False\n stack[-1].add(NestedInteger(num))\n num = None\n elif ch == '-':\n negative = True\n else:\n if num is None:\n num = 0\n num = num * 10 + int(ch)\n return stack[0]","runtime":"43"},{"code":"class NestedInteger:\n def __init__(self, value=None):\n if value is not None:\n if isinstance(value, list):\n self.nested_list = value\n else:\n self.integer = value\n\n def isInteger(self):\n return hasattr(self, 'integer')\n\n def getInteger(self):\n return self.integer if self.isInteger() else None\n\n def setInteger(self, value):\n self.integer = value\n\n def add(self, elem):\n if not hasattr(self, 'nested_list'):\n self.nested_list = []\n self.nested_list.append(elem)\n\n def getList(self):\n return self.nested_list if not self.isInteger() else None\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def nestedInteger(x):\n if isinstance(x, int):\n return NestedInteger(x)\n return NestedInteger([nestedInteger(i) for i in x])\n\n import json\n return nestedInteger(json.loads(s))","runtime":"43"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n # If s doesn't start with a '[', it must be a single integer, so create a NestedInteger object with that value\n if s[0] != '[':\n return NestedInteger(int(s))\n\n # Create an empty stack to keep track of NestedInteger objects and sublists as we parse the input string\n stack = []\n\n # Loop through each character in the string\n for i, c in enumerate(s):\n if c == '[':\n # If we encounter an opening bracket, push a new empty NestedInteger object onto the stack and set the starting index for the next element\n stack.append(NestedInteger())\n start = i + 1\n elif c == ',':\n # If we encounter a comma, check if there was a number between the previous comma or opening bracket and this one.\n # If there was, create a new NestedInteger object with that value and add it to the NestedInteger object on the top of the stack\n if i > start:\n num = int(s[start:i])\n stack[-1].add(NestedInteger(num))\n # Update the starting index for the next element to be parsed\n start = i + 1\n elif c == ']':\n # If we encounter a closing bracket, pop the top NestedInteger object from the stack and check if there was a number between the previous comma or opening bracket and this one.\n # If there was, create a new NestedInteger object with that value and add it to the popped NestedInteger object\n popped = stack.pop()\n if i > start:\n num = int(s[start:i])\n popped.add(NestedInteger(num))\n # If there are still NestedInteger objects on the stack, add the popped NestedInteger to the one on top. Otherwise, return the popped NestedInteger\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n # Update the starting index for the next element to be parsed\n start = i + 1","runtime":"44"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s == '[]':\n return NestedInteger()\n depth = 0\n stack = []\n currint = 0\n sign = 1\n last = None\n last_c = ''\n for c in s:\n if last_c.isdigit() and not c.isdigit():\n if stack:\n stack[-1].add(NestedInteger(sign * currint))\n currint = 0\n sign = 1\n last_c = c\n if c == '-':\n sign = -1\n elif c.isdigit():\n currint = currint * 10 + int(c)\n elif c == '[':\n newN = NestedInteger()\n if stack:\n stack[-1].add(newN)\n stack.append(newN)\n elif c == ']':\n last = stack.pop()\n return last if last else NestedInteger(sign * currint) ","runtime":"45"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def __init__(self, value=None):\n \"\"\"\n If value is not specified, initializes an empty list.\n Otherwise initializes a single integer equal to value.\n \"\"\"\n if value is None:\n self.data = []\n else:\n self.data = value\n\n def isInteger(self):\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n :rtype bool\n \"\"\"\n return type(self.data) == int\n\n def add(self, elem):\n \"\"\"\n Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n :rtype void\n \"\"\"\n if not self.isInteger():\n self.data.append(elem)\n else:\n raise TypeError('Cannot add to an integer NestedInteger')\n\n def setInteger(self, value):\n \"\"\"\n Set this NestedInteger to hold a single integer equal to value.\n :rtype void\n \"\"\"\n self.data = value\n\n def getInteger(self):\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n :rtype int\n \"\"\"\n if self.isInteger():\n return self.data\n return None\n\n def getList(self):\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n :rtype List[NestedInteger]\n \"\"\"\n if not self.isInteger():\n return self.data\n return None\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] != '[':\n # Base case: single integer\n return NestedInteger(int(s))\n stack = []\n current = None\n l = 0 # Start of the number\n for r in range(len(s)):\n if s[r] == '[':\n if current is not None:\n stack.append(current)\n current = NestedInteger()\n l = r + 1\n elif s[r] == ']':\n if s[r-1].isdigit() or s[r-1] == '-':\n num = int(s[l:r])\n current.add(NestedInteger(num))\n if stack:\n top = stack.pop()\n top.add(current)\n current = top\n l = r + 1\n elif s[r] == ',':\n if s[r-1].isdigit() or s[r-1] == '-':\n num = int(s[l:r])\n current.add(NestedInteger(num))\n l = r + 1\n return current","runtime":"46"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def is_number(x):\n return x[0] in '0123456789-'\n\n stack = []\n current_num = ''\n\n for char in s:\n if char == '[':\n stack.append(NestedInteger())\n elif char == ']':\n if current_num:\n stack[-1].add(NestedInteger(int(current_num)))\n current_num = ''\n top = stack.pop()\n if stack:\n stack[-1].add(top)\n else:\n stack.append(top)\n elif char == ',':\n if current_num:\n stack[-1].add(NestedInteger(int(current_num)))\n current_num = ''\n else:\n current_num += char\n\n if current_num:\n return NestedInteger(int(current_num))\n else:\n return stack[-1]\n\n# Example usage:\n# s = \"324\"\n# s = \"[123,[456,[789]]]\"\n# solution = Solution()\n# result = solution.deserialize(s)\n# print(result.getList()) # This will print the nested list structure","runtime":"47"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n stack = []\n current_num = \"\"\n\n for char in s:\n if char.isdigit() or char == '-':\n current_num += char\n elif char == '[':\n stack.append(NestedInteger())\n elif char == ']' or char == ',':\n if current_num:\n num = int(current_num)\n current_num = \"\"\n stack[-1].add(NestedInteger(num))\n if char == ']' and len(stack) > 1:\n top = stack.pop()\n stack[-1].add(top)\n\n if current_num:\n return NestedInteger(int(current_num))\n else:\n return stack[-1]","runtime":"47"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def dfs(inp):\n if isinstance(inp,int):\n return NestedInteger(inp)\n l = NestedInteger()\n for e in inp:\n l.add(dfs(e))\n return l\n \n a = json.loads(s)\n return dfs(a)\n ","runtime":"48"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0]!='[':\n return NestedInteger(int(s))\n num = None\n stack = []\n sign = '+'\n for i,char_ in enumerate(s):\n if char_ == '[':\n nested_ = NestedInteger()\n stack.append(nested_)\n elif char_ == '-':\n sign = '-'\n elif char_ == ']':\n if num!=None:\n if sign=='-':\n num = -num\n stack[-1].add(NestedInteger(num))\n num=None\n sign='+'\n last_ = stack.pop()\n if stack:\n stack[-1].add(last_)\n last_= stack.pop()\n stack.append(last_)\n elif char_ == ',':\n if num!=None:\n if sign=='-':\n num = -num\n stack[-1].add(NestedInteger(num))\n num = None\n sign='+'\n else:\n if num==None:\n num = int(char_)\n else:\n num = 10*num+int(char_)\n print(len(stack))\n return stack[0]\n","runtime":"49"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n # If s doesn't start with a '[', it must be a single integer, so create a NestedInteger object with that value\n if s[0] != '[':\n return NestedInteger(int(s))\n\n # Create an empty stack to keep track of NestedInteger objects and sublists as we parse the input string\n stack = []\n\n # Loop through each character in the string\n for i, c in enumerate(s):\n if c == '[':\n # If we encounter an opening bracket, push a new empty NestedInteger object onto the stack and set the starting index for the next element\n stack.append(NestedInteger())\n start = i + 1\n elif c == ',':\n # If we encounter a comma, check if there was a number between the previous comma or opening bracket and this one.\n # If there was, create a new NestedInteger object with that value and add it to the NestedInteger object on the top of the stack\n if i > start:\n num = int(s[start:i])\n stack[-1].add(NestedInteger(num))\n # Update the starting index for the next element to be parsed\n start = i + 1\n elif c == ']':\n # If we encounter a closing bracket, pop the top NestedInteger object from the stack and check if there was a number between the previous comma or opening bracket and this one.\n # If there was, create a new NestedInteger object with that value and add it to the popped NestedInteger object\n popped = stack.pop()\n if i > start:\n num = int(s[start:i])\n popped.add(NestedInteger(num))\n # If there are still NestedInteger objects on the stack, add the popped NestedInteger to the one on top. Otherwise, return the popped NestedInteger\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n # Update the starting index for the next element to be parsed\n start = i + 1","runtime":"53"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def dfs(index: int) -> (NestedInteger, int):\n sign = 1\n if s[index] == '-':\n sign = -1\n index += 1\n if s[index].isdigit():\n i = index\n while i < len(s) and s[i].isdigit():\n i += 1\n result = NestedInteger(sign * int(s[index:i]))\n return result, i\n result = NestedInteger()\n index += 1\n while index < len(s) and s[index] != ']':\n element, index = dfs(index)\n result.add(element)\n if s[index] == ',':\n index += 1\n return result, index + 1\n return dfs(0)[0]\n","runtime":"54"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\n'''\nevery new list we append to the stack\nwhen ] we pop the stack and add to the next stack element\n'''\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n i = 0\n stack: List[NestedInteger] = []\n # stack = []\n curval = \"\"\n for ch in s:\n if ch == \"[\":\n stack.append(NestedInteger())\n elif ch == \"]\":\n if curval != \"\":\n tmp = NestedInteger()\n tmp.setInteger(int(curval))\n stack[-1].add(tmp)\n curval = \"\"\n\n # is only one means is last index\n if len(stack) == 1:\n return stack[-1]\n el = stack.pop()\n stack[-1].add(el)\n elif ch == \",\": # , before should have number or [123]\n if curval != \"\":\n tmp = NestedInteger()\n tmp.setInteger(int(curval))\n stack[-1].add(tmp)\n curval = \"\"\n else:\n curval = curval + ch\n\n # if outside of the loop, means not close by ], mean is single integer\n\n tmp = NestedInteger()\n tmp.setInteger(int(curval))\n return tmp","runtime":"54"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0]!='[': return NestedInteger(int(s))\n stack=[]\n for i,c in enumerate(s):\n if c=='[':\n stack.append(NestedInteger())\n start=i+1\n elif c==',':\n if i>start:\n num=int(s[start:i])\n stack[-1].add(NestedInteger(num))\n start=i+1\n elif c==']':\n popped=stack.pop()\n if i>start:\n num=int(s[start:i])\n popped.add(NestedInteger(num))\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n start=i+1","runtime":"55"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] != '[':\n return NestedInteger(int(s))\n\n stack = []\n\n for i, c in enumerate(s):\n if c == '[':\n stack.append(NestedInteger())\n start = i + 1\n elif c == ',':\n if i > start:\n num = int(s[start:i])\n stack[-1].add(NestedInteger(num))\n start = i + 1\n elif c == ']':\n popped = stack.pop()\n if i > start:\n num = int(s[start:i])\n popped.add(NestedInteger(num))\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n start = i + 1","runtime":"56"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n\n\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\n\n number_chars: list[str] = []\n\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\n number_chars.append(s[pos])\n pos += 1\n\n return NestedInteger(int(''.join(number_chars))), pos - 1\n \n if s[0].isnumeric() or s[0] == '-':\n return create_integer(0)[0]\n \n\n stack: list[NestedInteger] = []\n pos: int = 1\n\n outer_nested_integer: NestedInteger = NestedInteger(None)\n stack.append(outer_nested_integer)\n current_nested_integer = outer_nested_integer\n\n while stack:\n\n if s[pos].isnumeric() or s[pos] == '-':\n new_nested_integer, pos = create_integer(pos)\n current_nested_integer.add(new_nested_integer)\n\n elif s[pos] == '[':\n new_nested_integer: NestedInteger = NestedInteger()\n current_nested_integer.add(new_nested_integer)\n stack.append(new_nested_integer)\n current_nested_integer = new_nested_integer\n elif s[pos] == ']':\n stack.pop()\n if stack:\n current_nested_integer = stack[-1]\n \n pos += 1\n \n return outer_nested_integer\n\n","runtime":"57"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s == '[]':\n return NestedInteger()\n depth = 0\n stack = []\n currint = 0\n sign = 1\n last = None\n last_c = ''\n for c in s:\n if last_c.isdigit() and not c.isdigit():\n if stack:\n stack[-1].add(NestedInteger(sign * currint))\n currint = 0\n sign = 1\n last_c = c\n if c == '-':\n sign = -1\n elif c.isdigit():\n currint = currint * 10 + int(c)\n elif c == '[':\n newN = NestedInteger()\n if stack:\n stack[-1].add(newN)\n stack.append(newN)\n elif c == ']':\n last = stack.pop()\n return last if last else NestedInteger(sign * currint) ","runtime":"58"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s == '[]':\n return NestedInteger()\n depth = 0\n stack = []\n currint = 0\n sign = 1\n last = None\n last_c = ''\n for c in s:\n if last_c.isdigit() and not c.isdigit():\n if stack:\n stack[-1].add(NestedInteger(sign * currint))\n currint = 0\n sign = 1\n last_c = c\n if c == '-':\n sign = -1\n elif c.isdigit():\n currint = currint * 10 + int(c)\n elif c == '[':\n newN = NestedInteger()\n if stack:\n stack[-1].add(newN)\n stack.append(newN)\n elif c == ']':\n last = stack.pop()\n return last if last else NestedInteger(sign * currint) ","runtime":"58"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n idx = 1\n def recursive(self, s) -> NestedInteger:\n ni = NestedInteger()\n aNumber = \"\"\n while self.idx < len(s):\n if s[self.idx] == \"[\":\n self.idx += 1\n ni.add(self.recursive(s))\n elif s[self.idx] == \"-\" or s[self.idx].isnumeric():\n aNumber += s[self.idx]\n self.idx += 1\n elif s[self.idx] == \",\":\n if aNumber:\n ni.add(NestedInteger(int(aNumber)))\n aNumber = \"\"\n self.idx += 1\n else:\n if aNumber:\n ni.add(NestedInteger(int(aNumber)))\n aNumber = \"\"\n self.idx += 1\n return ni\n return ni\n\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] == \"-\" or s.isnumeric():\n return NestedInteger(int(s))\n return self.recursive(s)\n ","runtime":"59"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def helper(input):\n if isinstance(input, int):\n return NestedInteger(input)\n nestedList = NestedInteger()\n for subInput in input:\n nestedList.add(helper(subInput))\n return nestedList\n\n return helper(json.loads(s))\n \n","runtime":"60"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] != \"[\":\n return NestedInteger(int(s))\n\n stack = []\n i = 0\n cur = \"\"\n while i < len(s):\n if s[i] == '[':\n stack.append(NestedInteger())\n elif s[i] == '-' or s[i].isdigit():\n cur += s[i]\n elif s[i] == ',':\n if cur != \"\":\n stack[-1].add(NestedInteger(int(cur)))\n cur = \"\"\n elif s[i] == \"]\":\n popped = stack.pop()\n if cur != \"\":\n popped.add(NestedInteger(int(cur)))\n cur = \"\"\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n else:\n print(\"something went wrong\")\n i += 1\n\n return stack[-1]\n\n\n\n\n\n","runtime":"61"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n print(s)\n n = len(s)\n if s[0] != '[':\n return NestedInteger(int(s))\n else:\n res = NestedInteger()\n if n > 2:\n l = r = 0\n start = 1\n for i in range(1,n - 1):\n c = s[i]\n if c == '[':\n l += 1\n elif c == ']':\n r += 1\n elif c == ',':\n if l == r:\n val = self.deserialize(s[start:i])\n res.add(val)\n start = i + 1\n val = self.deserialize(s[start:n-1])\n res.add(val)\n return res\n ","runtime":"62"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n\n\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\n\n number_chars: list[str] = []\n\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\n number_chars.append(s[pos])\n pos += 1\n\n return NestedInteger(int(''.join(number_chars))), pos\n \n def create_list(pos: int) -> tuple[NestedInteger, int]:\n \n result: NestedInteger = NestedInteger(None) \n\n while s[pos] != ']':\n\n if s[pos].isnumeric() or s[pos] == '-':\n nested_integer, pos = create_integer(pos)\n result.add(nested_integer)\n continue \n elif s[pos] == '[':\n nested_integer, pos = create_list(pos + 1)\n result.add(nested_integer)\n continue \n\n pos += 1 \n\n pos += 1\n\n return result, pos\n \n\n \n if s[0] == '[':\n result, _ = create_list(1)\n else:\n result, _ = create_integer(0)\n\n return result\n\n","runtime":"63"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n s = eval(s)\n def helper(s):\n if isinstance(s, int):\n return NestedInteger(s)\n ret = NestedInteger()\n for i in s:\n ret.add(helper(i))\n return ret\n return helper(s)","runtime":"64"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def dfs(self,s):\n if isinstance(s,list):\n array = NestedInteger()\n for ele in s:\n array.add(self.dfs(ele))\n return array\n elif isinstance(s,int):\n return NestedInteger(s)\n def deserialize(self, s: str) -> NestedInteger:\n return self.dfs(eval(s))\n\n \n\n ","runtime":"65"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if not s:\n return None\n if s[0] != '[':\n return NestedInteger(int(s))\n \n stack = []\n curr = None\n l = 0 # l shall point to the start of a number substring; r shall point to the end+1 of a number substring\n \n for r, ch in enumerate(s):\n print(ch)\n if ch == '[':\n if curr is not None:\n stack.append(curr)\n curr = NestedInteger()\n l = r + 1\n elif ch == ']':\n num = s[l:r]\n if num:\n curr.add(NestedInteger(int(num)))\n if stack:\n pop = stack.pop()\n pop.add(curr)\n curr = pop\n l = r + 1\n elif ch == ',':\n if s[r - 1] != ']':\n num = s[l:r]\n curr.add(NestedInteger(int(num)))\n l = r + 1\n \n return curr","runtime":"66"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n\n\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\n\n number_chars: list[str] = []\n\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\n number_chars.append(s[pos])\n pos += 1\n\n return NestedInteger(int(''.join(number_chars))), pos\n \n def create_list(pos: int) -> tuple[NestedInteger, int]:\n \n result: NestedInteger = NestedInteger(None) \n\n while s[pos] != ']':\n\n if s[pos].isnumeric() or s[pos] == '-':\n nested_integer, pos = create_integer(pos)\n result.add(nested_integer)\n continue \n elif s[pos] == '[':\n nested_integer, pos = create_list(pos + 1)\n result.add(nested_integer)\n continue \n\n pos += 1 \n\n pos += 1\n\n return result, pos\n \n\n \n if s[0] == '[':\n result, _ = create_list(1)\n else:\n result, _ = create_integer(0)\n\n return result\n\n","runtime":"67"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n return self.find(eval(s))\n\n def find(self, s):\n if isinstance(s, int):\n return NestedInteger(s) \n n = NestedInteger() \n for x in s: \n n.add(self.find(x)) \n return n","runtime":"68"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def get_items(self, s: str):\n sum = 0\n target_split_locs = []\n for i in range(len(s)):\n if s[i] == '[':\n sum += 1\n if s[i] == ']':\n sum -= 1\n if s[i] == ',' and sum == 0:\n target_split_locs.append(i)\n return target_split_locs\n def deserialize(self, s: str) -> NestedInteger:\n if not str:\n return NestedInteger()\n print(s)\n if (s[0] == '-' and s[1:].isdigit()):\n return NestedInteger(-int(s[1:]))\n\n if s.isdigit():\n return NestedInteger(int(s))\n\n if (s[0] == '[') and (s[-1] == ']'):\n ni = NestedInteger()\n split_locs = self.get_items(s[1:-1])\n curr_point = 0\n for split_loc in split_locs:\n ni.add(self.deserialize(s[curr_point+1:split_loc+1]))\n curr_point = split_loc + 1\n if s[curr_point+1:-1]:\n ni.add(self.deserialize(s[curr_point+1:-1]))\n\n return ni\n","runtime":"71"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n return self.find(eval(s))\n\n def find(self, s):\n if type(s) == type(1):\n return NestedInteger(s)\n \n n = NestedInteger()\n\n for item in s:\n n.add(self.find(item))\n \n return n","runtime":"72"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n\n def parse_expr(self) -> NestedInteger:\n if self.next() == '[':\n return self.parse_list()\n else:\n return self.parse_integer()\n\n def parse_integer(self) -> NestedInteger:\n \n # go as far as you can with only string.ascii_digit\n\n acc = \"\"\n\n while self.is_next() and self.next() in self.num_digits:\n acc += self.next()\n self.pop()\n\n val = int(acc)\n\n return NestedInteger(val)\n\n def parse_list(self) -> NestedInteger:\n # the next char should be [\n self.pop()\n\n exprs = []\n \n if self.next() == ']':\n self.pop()\n return NestedInteger()\n\n exprs.append(self.parse_expr()) \n \n\n while self.next() == ',':\n # pop the ,\n self.pop()\n # parse the expr\n exprs.append(self.parse_expr())\n\n # the next char should be ]\n # pop it\n\n self.pop()\n\n # make a NestedInteger object\n\n o = NestedInteger()\n\n for e in exprs:\n o.add(e)\n\n return o\n\n\n def pop(self):\n self.i += 1\n\n def next(self):\n\n print(self.i)\n\n return self.s[self.i]\n\n def is_next(self):\n return self.i < len(self.s)\n\n def deserialize(self, s: str) -> NestedInteger:\n \n self.s = list(s)\n\n self.i = 0\n\n self.num_digits = \"1234567890-\"\n\n return self.parse_expr()\n\n\n\n\n\n\n\n\n\n","runtime":"74"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n\n def process(idx, isList = False):\n items = []\n val = \"\"\n print(\"Processing from\", idx)\n while idx < len(s): \n if s[idx].isnumeric() or s[idx] == \"-\":\n # ok append it. \n val += s[idx] # build the number. \n elif s[idx] == \"[\":\n # dealing with a new list.. so process it\n # and then return a NestedInteger\n new_idx, nested_int = process(idx + 1, True)\n idx = new_idx\n items.append(nested_int)\n continue\n elif s[idx] == \",\":\n # ok break it into items. \n if val != \"\":\n items.append(NestedInteger(int(val)) )\n val = \"\"\n\n elif s[idx] == \"]\":\n # ok so we processed to end of bracket return that?\n break # we have to break here. \n\n # return items, idx+1 \n \n idx += 1\n\n res = NestedInteger()\n if not isList and len(items) == 0:\n if val != \"\":\n res.setInteger(int(val))\n else:\n res = NestedInteger()\n for item in items:\n res.add(item)\n if val != \"\":\n res.add(NestedInteger(int(val)) ) \n print(\"return type is\", res)\n\n return idx + 1, res\n \n\n if s[0]== \"[\":\n idx, res= process(0, True)\n res = res.getList()[0]\n else:\n idx, res= process(0, False)\n return res\n\n ","runtime":"75"}],"string":"[\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n stack = []\\n for i, c in enumerate(s):\\n if c == '[':\\n stack.append(NestedInteger())\\n start = i + 1\\n elif c == ',':\\n if i > start:\\n num = int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n start = i + 1\\n elif c == ']':\\n popped = stack.pop()\\n if i > start:\\n num = int(s[start:i])\\n popped.add(NestedInteger(num))\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n start = i + 1\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] != '[': return NestedInteger(int(s))\\n stack = []\\n\\n for i, ch in enumerate(s):\\n if ch == \\\"[\\\":\\n stack.append(NestedInteger())\\n start = i + 1\\n elif ch == \\\",\\\":\\n if i > start:\\n num = int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n start = i + 1\\n elif ch == \\\"]\\\":\\n popped = stack.pop()\\n if i > start:\\n num = int(s[start:i])\\n popped.add(NestedInteger(num))\\n \\n if stack: stack[-1].add(popped)\\n else: return popped\\n start = i + 1\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if \\\"[\\\" not in s:\\n return NestedInteger(int(s))\\n s = list(s)\\n out = []\\n number = \\\"\\\"\\n for i, c in enumerate(s):\\n if c == \\\"[\\\":\\n out.append(NestedInteger())\\n elif c == \\\"]\\\":\\n ni = out.pop()\\n if number != \\\"\\\":\\n ni.add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n if len(out) > 0:\\n out[-1].add(ni)\\n else:\\n return ni\\n elif c == \\\",\\\" and number != \\\"\\\":\\n out[-1].add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n elif c.isdigit() or c == \\\"-\\\":\\n number += c\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def nestedInteger(x):\\n return NestedInteger(int(x))\\n \\n stack = []\\n current = None\\n num = ''\\n \\n for char in s:\\n if char == '[':\\n if current:\\n stack.append(current)\\n current = NestedInteger()\\n elif char == ']':\\n if num:\\n current.add(nestedInteger(num))\\n num = ''\\n if stack:\\n stack[-1].add(current)\\n current = stack.pop()\\n elif char == '-':\\n if num:\\n current.add(nestedInteger(num))\\n num = ''\\n num += char\\n elif char.isdigit():\\n num += char\\n elif char == ',':\\n if num:\\n current.add(nestedInteger(num))\\n num = ''\\n \\n return current if current else nestedInteger(s)\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def recursion(self, s: str) -> NestedInteger:\\n if len(s) == 0:\\n return NestedInteger()\\n \\n if s == '[]':\\n return NestedInteger()\\n \\n if '[' not in s and ',' not in s:\\n return NestedInteger(int(s))\\n \\n\\n current_s = \\\"\\\"\\n nested = NestedInteger()\\n braces_count = 0\\n\\n for c in s[1:-1]:\\n if c == '[':\\n braces_count += 1\\n\\n if c == ']':\\n braces_count -= 1\\n\\n if c == ',' and braces_count == 0:\\n nested.add(self.deserialize(current_s))\\n current_s = \\\"\\\"\\n continue\\n\\n current_s += c\\n \\n nested.add(self.deserialize(current_s))\\n return nested\\n\\n def iterative(self, s: str) -> NestedInteger:\\n # solution using stack\\n if len(s) == 0:\\n return NestedInteger()\\n \\n if s == '[]':\\n return NestedInteger()\\n \\n if '[' not in s and ',' not in s:\\n return NestedInteger(int(s))\\n\\n stack = []\\n current = None # current NestedInteger which we are constructing\\n number = \\\"\\\"\\n\\n for c in s:\\n if c == '[':\\n if current:\\n stack.append(current)\\n current = NestedInteger()\\n continue\\n \\n if c == ']':\\n if number:\\n current.add(NestedInteger(int(number)))\\n number = \\\"\\\" \\n if stack:\\n top = stack.pop()\\n top.add(current)\\n current = top\\n continue\\n \\n if c == ',' and number:\\n current.add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n continue\\n \\n if c != ',':\\n number += c\\n\\n return current\\n\\n def deserialize(self, s: str) -> NestedInteger:\\n return self.iterative(s)\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if not s:\\n return None\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n \\n stack = []\\n num = None\\n negative = False\\n for i, ch in enumerate(s):\\n if ch == '[':\\n stack.append(NestedInteger())\\n elif ch == ']':\\n if num is not None:\\n if negative:\\n num = -num\\n negative = False\\n stack[-1].add(NestedInteger(num))\\n num = None\\n if len(stack) > 1:\\n top = stack.pop()\\n stack[-1].add(top)\\n elif ch == ',':\\n if num is not None:\\n if negative:\\n num = -num\\n negative = False\\n stack[-1].add(NestedInteger(num))\\n num = None\\n elif ch == '-':\\n negative = True\\n else:\\n if num is None:\\n num = 0\\n num = num * 10 + int(ch)\\n return stack[0]\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class NestedInteger:\\n def __init__(self, value=None):\\n if value is not None:\\n if isinstance(value, list):\\n self.nested_list = value\\n else:\\n self.integer = value\\n\\n def isInteger(self):\\n return hasattr(self, 'integer')\\n\\n def getInteger(self):\\n return self.integer if self.isInteger() else None\\n\\n def setInteger(self, value):\\n self.integer = value\\n\\n def add(self, elem):\\n if not hasattr(self, 'nested_list'):\\n self.nested_list = []\\n self.nested_list.append(elem)\\n\\n def getList(self):\\n return self.nested_list if not self.isInteger() else None\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def nestedInteger(x):\\n if isinstance(x, int):\\n return NestedInteger(x)\\n return NestedInteger([nestedInteger(i) for i in x])\\n\\n import json\\n return nestedInteger(json.loads(s))\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n # If s doesn't start with a '[', it must be a single integer, so create a NestedInteger object with that value\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n\\n # Create an empty stack to keep track of NestedInteger objects and sublists as we parse the input string\\n stack = []\\n\\n # Loop through each character in the string\\n for i, c in enumerate(s):\\n if c == '[':\\n # If we encounter an opening bracket, push a new empty NestedInteger object onto the stack and set the starting index for the next element\\n stack.append(NestedInteger())\\n start = i + 1\\n elif c == ',':\\n # If we encounter a comma, check if there was a number between the previous comma or opening bracket and this one.\\n # If there was, create a new NestedInteger object with that value and add it to the NestedInteger object on the top of the stack\\n if i > start:\\n num = int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n # Update the starting index for the next element to be parsed\\n start = i + 1\\n elif c == ']':\\n # If we encounter a closing bracket, pop the top NestedInteger object from the stack and check if there was a number between the previous comma or opening bracket and this one.\\n # If there was, create a new NestedInteger object with that value and add it to the popped NestedInteger object\\n popped = stack.pop()\\n if i > start:\\n num = int(s[start:i])\\n popped.add(NestedInteger(num))\\n # If there are still NestedInteger objects on the stack, add the popped NestedInteger to the one on top. Otherwise, return the popped NestedInteger\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n # Update the starting index for the next element to be parsed\\n start = i + 1\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s == '[]':\\n return NestedInteger()\\n depth = 0\\n stack = []\\n currint = 0\\n sign = 1\\n last = None\\n last_c = ''\\n for c in s:\\n if last_c.isdigit() and not c.isdigit():\\n if stack:\\n stack[-1].add(NestedInteger(sign * currint))\\n currint = 0\\n sign = 1\\n last_c = c\\n if c == '-':\\n sign = -1\\n elif c.isdigit():\\n currint = currint * 10 + int(c)\\n elif c == '[':\\n newN = NestedInteger()\\n if stack:\\n stack[-1].add(newN)\\n stack.append(newN)\\n elif c == ']':\\n last = stack.pop()\\n return last if last else NestedInteger(sign * currint) \",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def __init__(self, value=None):\\n \\\"\\\"\\\"\\n If value is not specified, initializes an empty list.\\n Otherwise initializes a single integer equal to value.\\n \\\"\\\"\\\"\\n if value is None:\\n self.data = []\\n else:\\n self.data = value\\n\\n def isInteger(self):\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n :rtype bool\\n \\\"\\\"\\\"\\n return type(self.data) == int\\n\\n def add(self, elem):\\n \\\"\\\"\\\"\\n Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n :rtype void\\n \\\"\\\"\\\"\\n if not self.isInteger():\\n self.data.append(elem)\\n else:\\n raise TypeError('Cannot add to an integer NestedInteger')\\n\\n def setInteger(self, value):\\n \\\"\\\"\\\"\\n Set this NestedInteger to hold a single integer equal to value.\\n :rtype void\\n \\\"\\\"\\\"\\n self.data = value\\n\\n def getInteger(self):\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n :rtype int\\n \\\"\\\"\\\"\\n if self.isInteger():\\n return self.data\\n return None\\n\\n def getList(self):\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n :rtype List[NestedInteger]\\n \\\"\\\"\\\"\\n if not self.isInteger():\\n return self.data\\n return None\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] != '[':\\n # Base case: single integer\\n return NestedInteger(int(s))\\n stack = []\\n current = None\\n l = 0 # Start of the number\\n for r in range(len(s)):\\n if s[r] == '[':\\n if current is not None:\\n stack.append(current)\\n current = NestedInteger()\\n l = r + 1\\n elif s[r] == ']':\\n if s[r-1].isdigit() or s[r-1] == '-':\\n num = int(s[l:r])\\n current.add(NestedInteger(num))\\n if stack:\\n top = stack.pop()\\n top.add(current)\\n current = top\\n l = r + 1\\n elif s[r] == ',':\\n if s[r-1].isdigit() or s[r-1] == '-':\\n num = int(s[l:r])\\n current.add(NestedInteger(num))\\n l = r + 1\\n return current\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def is_number(x):\\n return x[0] in '0123456789-'\\n\\n stack = []\\n current_num = ''\\n\\n for char in s:\\n if char == '[':\\n stack.append(NestedInteger())\\n elif char == ']':\\n if current_num:\\n stack[-1].add(NestedInteger(int(current_num)))\\n current_num = ''\\n top = stack.pop()\\n if stack:\\n stack[-1].add(top)\\n else:\\n stack.append(top)\\n elif char == ',':\\n if current_num:\\n stack[-1].add(NestedInteger(int(current_num)))\\n current_num = ''\\n else:\\n current_num += char\\n\\n if current_num:\\n return NestedInteger(int(current_num))\\n else:\\n return stack[-1]\\n\\n# Example usage:\\n# s = \\\"324\\\"\\n# s = \\\"[123,[456,[789]]]\\\"\\n# solution = Solution()\\n# result = solution.deserialize(s)\\n# print(result.getList()) # This will print the nested list structure\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n stack = []\\n current_num = \\\"\\\"\\n\\n for char in s:\\n if char.isdigit() or char == '-':\\n current_num += char\\n elif char == '[':\\n stack.append(NestedInteger())\\n elif char == ']' or char == ',':\\n if current_num:\\n num = int(current_num)\\n current_num = \\\"\\\"\\n stack[-1].add(NestedInteger(num))\\n if char == ']' and len(stack) > 1:\\n top = stack.pop()\\n stack[-1].add(top)\\n\\n if current_num:\\n return NestedInteger(int(current_num))\\n else:\\n return stack[-1]\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def dfs(inp):\\n if isinstance(inp,int):\\n return NestedInteger(inp)\\n l = NestedInteger()\\n for e in inp:\\n l.add(dfs(e))\\n return l\\n \\n a = json.loads(s)\\n return dfs(a)\\n \",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0]!='[':\\n return NestedInteger(int(s))\\n num = None\\n stack = []\\n sign = '+'\\n for i,char_ in enumerate(s):\\n if char_ == '[':\\n nested_ = NestedInteger()\\n stack.append(nested_)\\n elif char_ == '-':\\n sign = '-'\\n elif char_ == ']':\\n if num!=None:\\n if sign=='-':\\n num = -num\\n stack[-1].add(NestedInteger(num))\\n num=None\\n sign='+'\\n last_ = stack.pop()\\n if stack:\\n stack[-1].add(last_)\\n last_= stack.pop()\\n stack.append(last_)\\n elif char_ == ',':\\n if num!=None:\\n if sign=='-':\\n num = -num\\n stack[-1].add(NestedInteger(num))\\n num = None\\n sign='+'\\n else:\\n if num==None:\\n num = int(char_)\\n else:\\n num = 10*num+int(char_)\\n print(len(stack))\\n return stack[0]\\n\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n # If s doesn't start with a '[', it must be a single integer, so create a NestedInteger object with that value\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n\\n # Create an empty stack to keep track of NestedInteger objects and sublists as we parse the input string\\n stack = []\\n\\n # Loop through each character in the string\\n for i, c in enumerate(s):\\n if c == '[':\\n # If we encounter an opening bracket, push a new empty NestedInteger object onto the stack and set the starting index for the next element\\n stack.append(NestedInteger())\\n start = i + 1\\n elif c == ',':\\n # If we encounter a comma, check if there was a number between the previous comma or opening bracket and this one.\\n # If there was, create a new NestedInteger object with that value and add it to the NestedInteger object on the top of the stack\\n if i > start:\\n num = int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n # Update the starting index for the next element to be parsed\\n start = i + 1\\n elif c == ']':\\n # If we encounter a closing bracket, pop the top NestedInteger object from the stack and check if there was a number between the previous comma or opening bracket and this one.\\n # If there was, create a new NestedInteger object with that value and add it to the popped NestedInteger object\\n popped = stack.pop()\\n if i > start:\\n num = int(s[start:i])\\n popped.add(NestedInteger(num))\\n # If there are still NestedInteger objects on the stack, add the popped NestedInteger to the one on top. Otherwise, return the popped NestedInteger\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n # Update the starting index for the next element to be parsed\\n start = i + 1\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def dfs(index: int) -> (NestedInteger, int):\\n sign = 1\\n if s[index] == '-':\\n sign = -1\\n index += 1\\n if s[index].isdigit():\\n i = index\\n while i < len(s) and s[i].isdigit():\\n i += 1\\n result = NestedInteger(sign * int(s[index:i]))\\n return result, i\\n result = NestedInteger()\\n index += 1\\n while index < len(s) and s[index] != ']':\\n element, index = dfs(index)\\n result.add(element)\\n if s[index] == ',':\\n index += 1\\n return result, index + 1\\n return dfs(0)[0]\\n\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\n'''\\nevery new list we append to the stack\\nwhen ] we pop the stack and add to the next stack element\\n'''\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n i = 0\\n stack: List[NestedInteger] = []\\n # stack = []\\n curval = \\\"\\\"\\n for ch in s:\\n if ch == \\\"[\\\":\\n stack.append(NestedInteger())\\n elif ch == \\\"]\\\":\\n if curval != \\\"\\\":\\n tmp = NestedInteger()\\n tmp.setInteger(int(curval))\\n stack[-1].add(tmp)\\n curval = \\\"\\\"\\n\\n # is only one means is last index\\n if len(stack) == 1:\\n return stack[-1]\\n el = stack.pop()\\n stack[-1].add(el)\\n elif ch == \\\",\\\": # , before should have number or [123]\\n if curval != \\\"\\\":\\n tmp = NestedInteger()\\n tmp.setInteger(int(curval))\\n stack[-1].add(tmp)\\n curval = \\\"\\\"\\n else:\\n curval = curval + ch\\n\\n # if outside of the loop, means not close by ], mean is single integer\\n\\n tmp = NestedInteger()\\n tmp.setInteger(int(curval))\\n return tmp\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0]!='[': return NestedInteger(int(s))\\n stack=[]\\n for i,c in enumerate(s):\\n if c=='[':\\n stack.append(NestedInteger())\\n start=i+1\\n elif c==',':\\n if i>start:\\n num=int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n start=i+1\\n elif c==']':\\n popped=stack.pop()\\n if i>start:\\n num=int(s[start:i])\\n popped.add(NestedInteger(num))\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n start=i+1\",\n \"runtime\": \"55\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n\\n stack = []\\n\\n for i, c in enumerate(s):\\n if c == '[':\\n stack.append(NestedInteger())\\n start = i + 1\\n elif c == ',':\\n if i > start:\\n num = int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n start = i + 1\\n elif c == ']':\\n popped = stack.pop()\\n if i > start:\\n num = int(s[start:i])\\n popped.add(NestedInteger(num))\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n start = i + 1\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n\\n\\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\\n\\n number_chars: list[str] = []\\n\\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\\n number_chars.append(s[pos])\\n pos += 1\\n\\n return NestedInteger(int(''.join(number_chars))), pos - 1\\n \\n if s[0].isnumeric() or s[0] == '-':\\n return create_integer(0)[0]\\n \\n\\n stack: list[NestedInteger] = []\\n pos: int = 1\\n\\n outer_nested_integer: NestedInteger = NestedInteger(None)\\n stack.append(outer_nested_integer)\\n current_nested_integer = outer_nested_integer\\n\\n while stack:\\n\\n if s[pos].isnumeric() or s[pos] == '-':\\n new_nested_integer, pos = create_integer(pos)\\n current_nested_integer.add(new_nested_integer)\\n\\n elif s[pos] == '[':\\n new_nested_integer: NestedInteger = NestedInteger()\\n current_nested_integer.add(new_nested_integer)\\n stack.append(new_nested_integer)\\n current_nested_integer = new_nested_integer\\n elif s[pos] == ']':\\n stack.pop()\\n if stack:\\n current_nested_integer = stack[-1]\\n \\n pos += 1\\n \\n return outer_nested_integer\\n\\n\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s == '[]':\\n return NestedInteger()\\n depth = 0\\n stack = []\\n currint = 0\\n sign = 1\\n last = None\\n last_c = ''\\n for c in s:\\n if last_c.isdigit() and not c.isdigit():\\n if stack:\\n stack[-1].add(NestedInteger(sign * currint))\\n currint = 0\\n sign = 1\\n last_c = c\\n if c == '-':\\n sign = -1\\n elif c.isdigit():\\n currint = currint * 10 + int(c)\\n elif c == '[':\\n newN = NestedInteger()\\n if stack:\\n stack[-1].add(newN)\\n stack.append(newN)\\n elif c == ']':\\n last = stack.pop()\\n return last if last else NestedInteger(sign * currint) \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s == '[]':\\n return NestedInteger()\\n depth = 0\\n stack = []\\n currint = 0\\n sign = 1\\n last = None\\n last_c = ''\\n for c in s:\\n if last_c.isdigit() and not c.isdigit():\\n if stack:\\n stack[-1].add(NestedInteger(sign * currint))\\n currint = 0\\n sign = 1\\n last_c = c\\n if c == '-':\\n sign = -1\\n elif c.isdigit():\\n currint = currint * 10 + int(c)\\n elif c == '[':\\n newN = NestedInteger()\\n if stack:\\n stack[-1].add(newN)\\n stack.append(newN)\\n elif c == ']':\\n last = stack.pop()\\n return last if last else NestedInteger(sign * currint) \",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n idx = 1\\n def recursive(self, s) -> NestedInteger:\\n ni = NestedInteger()\\n aNumber = \\\"\\\"\\n while self.idx < len(s):\\n if s[self.idx] == \\\"[\\\":\\n self.idx += 1\\n ni.add(self.recursive(s))\\n elif s[self.idx] == \\\"-\\\" or s[self.idx].isnumeric():\\n aNumber += s[self.idx]\\n self.idx += 1\\n elif s[self.idx] == \\\",\\\":\\n if aNumber:\\n ni.add(NestedInteger(int(aNumber)))\\n aNumber = \\\"\\\"\\n self.idx += 1\\n else:\\n if aNumber:\\n ni.add(NestedInteger(int(aNumber)))\\n aNumber = \\\"\\\"\\n self.idx += 1\\n return ni\\n return ni\\n\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] == \\\"-\\\" or s.isnumeric():\\n return NestedInteger(int(s))\\n return self.recursive(s)\\n \",\n \"runtime\": \"59\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def helper(input):\\n if isinstance(input, int):\\n return NestedInteger(input)\\n nestedList = NestedInteger()\\n for subInput in input:\\n nestedList.add(helper(subInput))\\n return nestedList\\n\\n return helper(json.loads(s))\\n \\n\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] != \\\"[\\\":\\n return NestedInteger(int(s))\\n\\n stack = []\\n i = 0\\n cur = \\\"\\\"\\n while i < len(s):\\n if s[i] == '[':\\n stack.append(NestedInteger())\\n elif s[i] == '-' or s[i].isdigit():\\n cur += s[i]\\n elif s[i] == ',':\\n if cur != \\\"\\\":\\n stack[-1].add(NestedInteger(int(cur)))\\n cur = \\\"\\\"\\n elif s[i] == \\\"]\\\":\\n popped = stack.pop()\\n if cur != \\\"\\\":\\n popped.add(NestedInteger(int(cur)))\\n cur = \\\"\\\"\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n else:\\n print(\\\"something went wrong\\\")\\n i += 1\\n\\n return stack[-1]\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"61\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n print(s)\\n n = len(s)\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n else:\\n res = NestedInteger()\\n if n > 2:\\n l = r = 0\\n start = 1\\n for i in range(1,n - 1):\\n c = s[i]\\n if c == '[':\\n l += 1\\n elif c == ']':\\n r += 1\\n elif c == ',':\\n if l == r:\\n val = self.deserialize(s[start:i])\\n res.add(val)\\n start = i + 1\\n val = self.deserialize(s[start:n-1])\\n res.add(val)\\n return res\\n \",\n \"runtime\": \"62\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n\\n\\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\\n\\n number_chars: list[str] = []\\n\\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\\n number_chars.append(s[pos])\\n pos += 1\\n\\n return NestedInteger(int(''.join(number_chars))), pos\\n \\n def create_list(pos: int) -> tuple[NestedInteger, int]:\\n \\n result: NestedInteger = NestedInteger(None) \\n\\n while s[pos] != ']':\\n\\n if s[pos].isnumeric() or s[pos] == '-':\\n nested_integer, pos = create_integer(pos)\\n result.add(nested_integer)\\n continue \\n elif s[pos] == '[':\\n nested_integer, pos = create_list(pos + 1)\\n result.add(nested_integer)\\n continue \\n\\n pos += 1 \\n\\n pos += 1\\n\\n return result, pos\\n \\n\\n \\n if s[0] == '[':\\n result, _ = create_list(1)\\n else:\\n result, _ = create_integer(0)\\n\\n return result\\n\\n\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n s = eval(s)\\n def helper(s):\\n if isinstance(s, int):\\n return NestedInteger(s)\\n ret = NestedInteger()\\n for i in s:\\n ret.add(helper(i))\\n return ret\\n return helper(s)\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def dfs(self,s):\\n if isinstance(s,list):\\n array = NestedInteger()\\n for ele in s:\\n array.add(self.dfs(ele))\\n return array\\n elif isinstance(s,int):\\n return NestedInteger(s)\\n def deserialize(self, s: str) -> NestedInteger:\\n return self.dfs(eval(s))\\n\\n \\n\\n \",\n \"runtime\": \"65\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if not s:\\n return None\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n \\n stack = []\\n curr = None\\n l = 0 # l shall point to the start of a number substring; r shall point to the end+1 of a number substring\\n \\n for r, ch in enumerate(s):\\n print(ch)\\n if ch == '[':\\n if curr is not None:\\n stack.append(curr)\\n curr = NestedInteger()\\n l = r + 1\\n elif ch == ']':\\n num = s[l:r]\\n if num:\\n curr.add(NestedInteger(int(num)))\\n if stack:\\n pop = stack.pop()\\n pop.add(curr)\\n curr = pop\\n l = r + 1\\n elif ch == ',':\\n if s[r - 1] != ']':\\n num = s[l:r]\\n curr.add(NestedInteger(int(num)))\\n l = r + 1\\n \\n return curr\",\n \"runtime\": \"66\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n\\n\\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\\n\\n number_chars: list[str] = []\\n\\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\\n number_chars.append(s[pos])\\n pos += 1\\n\\n return NestedInteger(int(''.join(number_chars))), pos\\n \\n def create_list(pos: int) -> tuple[NestedInteger, int]:\\n \\n result: NestedInteger = NestedInteger(None) \\n\\n while s[pos] != ']':\\n\\n if s[pos].isnumeric() or s[pos] == '-':\\n nested_integer, pos = create_integer(pos)\\n result.add(nested_integer)\\n continue \\n elif s[pos] == '[':\\n nested_integer, pos = create_list(pos + 1)\\n result.add(nested_integer)\\n continue \\n\\n pos += 1 \\n\\n pos += 1\\n\\n return result, pos\\n \\n\\n \\n if s[0] == '[':\\n result, _ = create_list(1)\\n else:\\n result, _ = create_integer(0)\\n\\n return result\\n\\n\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n return self.find(eval(s))\\n\\n def find(self, s):\\n if isinstance(s, int):\\n return NestedInteger(s) \\n n = NestedInteger() \\n for x in s: \\n n.add(self.find(x)) \\n return n\",\n \"runtime\": \"68\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def get_items(self, s: str):\\n sum = 0\\n target_split_locs = []\\n for i in range(len(s)):\\n if s[i] == '[':\\n sum += 1\\n if s[i] == ']':\\n sum -= 1\\n if s[i] == ',' and sum == 0:\\n target_split_locs.append(i)\\n return target_split_locs\\n def deserialize(self, s: str) -> NestedInteger:\\n if not str:\\n return NestedInteger()\\n print(s)\\n if (s[0] == '-' and s[1:].isdigit()):\\n return NestedInteger(-int(s[1:]))\\n\\n if s.isdigit():\\n return NestedInteger(int(s))\\n\\n if (s[0] == '[') and (s[-1] == ']'):\\n ni = NestedInteger()\\n split_locs = self.get_items(s[1:-1])\\n curr_point = 0\\n for split_loc in split_locs:\\n ni.add(self.deserialize(s[curr_point+1:split_loc+1]))\\n curr_point = split_loc + 1\\n if s[curr_point+1:-1]:\\n ni.add(self.deserialize(s[curr_point+1:-1]))\\n\\n return ni\\n\",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n return self.find(eval(s))\\n\\n def find(self, s):\\n if type(s) == type(1):\\n return NestedInteger(s)\\n \\n n = NestedInteger()\\n\\n for item in s:\\n n.add(self.find(item))\\n \\n return n\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n\\n def parse_expr(self) -> NestedInteger:\\n if self.next() == '[':\\n return self.parse_list()\\n else:\\n return self.parse_integer()\\n\\n def parse_integer(self) -> NestedInteger:\\n \\n # go as far as you can with only string.ascii_digit\\n\\n acc = \\\"\\\"\\n\\n while self.is_next() and self.next() in self.num_digits:\\n acc += self.next()\\n self.pop()\\n\\n val = int(acc)\\n\\n return NestedInteger(val)\\n\\n def parse_list(self) -> NestedInteger:\\n # the next char should be [\\n self.pop()\\n\\n exprs = []\\n \\n if self.next() == ']':\\n self.pop()\\n return NestedInteger()\\n\\n exprs.append(self.parse_expr()) \\n \\n\\n while self.next() == ',':\\n # pop the ,\\n self.pop()\\n # parse the expr\\n exprs.append(self.parse_expr())\\n\\n # the next char should be ]\\n # pop it\\n\\n self.pop()\\n\\n # make a NestedInteger object\\n\\n o = NestedInteger()\\n\\n for e in exprs:\\n o.add(e)\\n\\n return o\\n\\n\\n def pop(self):\\n self.i += 1\\n\\n def next(self):\\n\\n print(self.i)\\n\\n return self.s[self.i]\\n\\n def is_next(self):\\n return self.i < len(self.s)\\n\\n def deserialize(self, s: str) -> NestedInteger:\\n \\n self.s = list(s)\\n\\n self.i = 0\\n\\n self.num_digits = \\\"1234567890-\\\"\\n\\n return self.parse_expr()\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n\\n def process(idx, isList = False):\\n items = []\\n val = \\\"\\\"\\n print(\\\"Processing from\\\", idx)\\n while idx < len(s): \\n if s[idx].isnumeric() or s[idx] == \\\"-\\\":\\n # ok append it. \\n val += s[idx] # build the number. \\n elif s[idx] == \\\"[\\\":\\n # dealing with a new list.. so process it\\n # and then return a NestedInteger\\n new_idx, nested_int = process(idx + 1, True)\\n idx = new_idx\\n items.append(nested_int)\\n continue\\n elif s[idx] == \\\",\\\":\\n # ok break it into items. \\n if val != \\\"\\\":\\n items.append(NestedInteger(int(val)) )\\n val = \\\"\\\"\\n\\n elif s[idx] == \\\"]\\\":\\n # ok so we processed to end of bracket return that?\\n break # we have to break here. \\n\\n # return items, idx+1 \\n \\n idx += 1\\n\\n res = NestedInteger()\\n if not isList and len(items) == 0:\\n if val != \\\"\\\":\\n res.setInteger(int(val))\\n else:\\n res = NestedInteger()\\n for item in items:\\n res.add(item)\\n if val != \\\"\\\":\\n res.add(NestedInteger(int(val)) ) \\n print(\\\"return type is\\\", res)\\n\\n return idx + 1, res\\n \\n\\n if s[0]== \\\"[\\\":\\n idx, res= process(0, True)\\n res = res.getList()[0]\\n else:\\n idx, res= process(0, False)\\n return res\\n\\n \",\n \"runtime\": \"75\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":36,"string":"36"},"mm_list":{"kind":"list like","value":[{"code":"class NestedInteger:\n def __init__(self, value=None):\n if value is None:\n self.is_integer = False\n self.value = []\n elif isinstance(value, int):\n self.is_integer = True\n self.value = value\n else:\n raise ValueError(\"Invalid value\")\n \n def isInteger(self):\n return self.is_integer\n \n def getInteger(self):\n if self.is_integer:\n return self.value\n else:\n raise ValueError(\"This NestedInteger holds a nested list\")\n \n def setInteger(self, value):\n self.is_integer = True\n self.value = value\n \n def add(self, ni):\n if not self.is_integer:\n self.value.append(ni)\n else:\n raise ValueError(\"This NestedInteger holds an integer\")\n \n def getList(self):\n if not self.is_integer:\n return self.value\n else:\n raise ValueError(\"This NestedInteger holds a single integer\")\n \n def __str__(self):\n if self.is_integer:\n return str(self.value)\n else:\n return \"[\" + \", \".join(str(ni) for ni in self.value) + \"]\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def parse(index):\n if s[index[0]] == '[':\n index[0] += 1\n nested_integer = NestedInteger()\n while s[index[0]] != ']':\n if s[index[0]] == ',':\n index[0] += 1\n nested_integer.add(parse(index))\n index[0] += 1\n return nested_integer\n else:\n start = index[0]\n while index[0] < len(s) and s[index[0]] not in ',[]':\n index[0] += 1\n value = int(s[start:index[0]])\n return NestedInteger(value)\n \n return parse([0])\n\n# Example usage\nif __name__ == \"__main__\":\n sol = Solution()\n \n # Test cases\n s1 = \"324\"\n result1 = sol.deserialize(s1)\n print(\"Output for s1:\", result1) # Output: 324\n \n s2 = \"[123,[456,[789]]]\"\n result2 = sol.deserialize(s2)\n print(\"Output for s2:\", result2) # Output: [123, [456, [789]]]\n","memory":"18100"},{"code":"class NestedInteger:\n def __init__(self, value=None):\n if value is None:\n self.is_integer = False\n self.value = []\n elif isinstance(value, int):\n self.is_integer = True\n self.value = value\n else:\n raise ValueError(\"Invalid value\")\n \n def isInteger(self):\n return self.is_integer\n \n def getInteger(self):\n if self.is_integer:\n return self.value\n else:\n raise ValueError(\"This NestedInteger holds a nested list\")\n \n def setInteger(self, value):\n self.is_integer = True\n self.value = value\n \n def add(self, ni):\n if not self.is_integer:\n self.value.append(ni)\n else:\n raise ValueError(\"This NestedInteger holds an integer\")\n \n def getList(self):\n if not self.is_integer:\n return self.value\n else:\n raise ValueError(\"This NestedInteger holds a single integer\")\n \n def __str__(self):\n if self.is_integer:\n return str(self.value)\n else:\n return \"[\" + \", \".join(str(ni) for ni in self.value) + \"]\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def parse(index):\n if s[index[0]] == '[':\n index[0] += 1\n nested_integer = NestedInteger()\n while s[index[0]] != ']':\n if s[index[0]] == ',':\n index[0] += 1\n nested_integer.add(parse(index))\n index[0] += 1\n return nested_integer\n else:\n start = index[0]\n while index[0] < len(s) and s[index[0]] not in ',[]':\n index[0] += 1\n value = int(s[start:index[0]])\n return NestedInteger(value)\n \n return parse([0])\n\n\nif __name__ == \"__main__\":\n sol = Solution()\n \n \n s1 = \"324\"\n result1 = sol.deserialize(s1)\n print(\"Output for s1:\", result1) \n \n s2 = \"[123,[456,[789]]]\"\n result2 = sol.deserialize(s2)\n print(\"Output for s2:\", result2) \n","memory":"18100"},{"code":"class NestedInteger:\n def __init__(self, value=None):\n if value is not None:\n if isinstance(value, list):\n self.nested_list = value\n else:\n self.integer = value\n\n def isInteger(self):\n return hasattr(self, 'integer')\n\n def getInteger(self):\n return self.integer if self.isInteger() else None\n\n def setInteger(self, value):\n self.integer = value\n\n def add(self, elem):\n if not hasattr(self, 'nested_list'):\n self.nested_list = []\n self.nested_list.append(elem)\n\n def getList(self):\n return self.nested_list if not self.isInteger() else None\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def nestedInteger(x):\n if isinstance(x, int):\n return NestedInteger(x)\n return NestedInteger([nestedInteger(i) for i in x])\n\n import json\n return nestedInteger(json.loads(s))","memory":"18200"},{"code":"class NestedInteger:\n def __init__(self, value=None):\n if value is not None:\n if isinstance(value, int):\n self.is_int = True\n self.value = value\n else:\n self.is_int = False\n self.value = [NestedInteger(v) for v in value]\n else:\n self.is_int = False\n self.value = []\n\n def isInteger(self):\n return self.is_int\n\n def add(self, elem):\n if self.is_int:\n raise ValueError(\"Cannot add to an integer NestedInteger\")\n self.value.append(elem)\n\n def setInteger(self, value):\n if not isinstance(value, int):\n raise ValueError(\"Value must be an integer\")\n self.is_int = True\n self.value = value\n\n def getInteger(self):\n return self.value if self.is_int else None\n\n def getList(self):\n return None if self.is_int else self.value\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n def nestedInteger():\n if s[index[0]] == '[':\n index[0] += 1\n ni = NestedInteger()\n while s[index[0]] != ']':\n ni.add(nestedInteger())\n if s[index[0]] == ',':\n index[0] += 1\n index[0] += 1\n return ni\n else:\n is_negative = False\n if s[index[0]] == '-':\n is_negative = True\n index[0] += 1\n num = 0\n while index[0] < len(s) and s[index[0]].isdigit():\n num = num * 10 + int(s[index[0]])\n index[0] += 1\n if is_negative:\n num = -num\n return NestedInteger(num)\n \n index = [0]\n return nestedInteger()\n\n# Example usage:\n# sol = Solution()\n# result = sol.deserialize(\"[123,[456,[789]]]\")\n# print(result.getList())","memory":"18200"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def __init__(self, value=None):\n \"\"\"\n If value is not specified, initializes an empty list.\n Otherwise initializes a single integer equal to value.\n \"\"\"\n if value is None:\n self.data = []\n else:\n self.data = value\n\n def isInteger(self):\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n :rtype bool\n \"\"\"\n return type(self.data) == int\n\n def add(self, elem):\n \"\"\"\n Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n :rtype void\n \"\"\"\n if not self.isInteger():\n self.data.append(elem)\n else:\n raise TypeError('Cannot add to an integer NestedInteger')\n\n def setInteger(self, value):\n \"\"\"\n Set this NestedInteger to hold a single integer equal to value.\n :rtype void\n \"\"\"\n self.data = value\n\n def getInteger(self):\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n :rtype int\n \"\"\"\n if self.isInteger():\n return self.data\n return None\n\n def getList(self):\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n :rtype List[NestedInteger]\n \"\"\"\n if not self.isInteger():\n return self.data\n return None\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0] != '[':\n # Base case: single integer\n return NestedInteger(int(s))\n stack = []\n current = None\n l = 0 # Start of the number\n for r in range(len(s)):\n if s[r] == '[':\n if current is not None:\n stack.append(current)\n current = NestedInteger()\n l = r + 1\n elif s[r] == ']':\n if s[r-1].isdigit() or s[r-1] == '-':\n num = int(s[l:r])\n current.add(NestedInteger(num))\n if stack:\n top = stack.pop()\n top.add(current)\n current = top\n l = r + 1\n elif s[r] == ',':\n if s[r-1].isdigit() or s[r-1] == '-':\n num = int(s[l:r])\n current.add(NestedInteger(num))\n l = r + 1\n return current","memory":"18300"},{"code":"class NestedInteger:\n def __init__(self, value=None):\n if value is None:\n self._list = []\n self._integer = None\n else:\n self._list = None\n self._integer = value\n\n def isInteger(self):\n return self._integer is not None\n\n def add(self, elem):\n if self._list is not None:\n self._list.append(elem)\n\n def setInteger(self, value):\n self._integer = value\n self._list = None\n\n def getInteger(self):\n return self._integer\n\n def getList(self):\n return self._list\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if not s:\n return NestedInteger()\n\n if s[0] != '[': # If the string does not start with '[', it's a single integer.\n return NestedInteger(int(s))\n\n stack = []\n num = None\n negative = False\n\n for i, char in enumerate(s):\n if char == '-':\n negative = True\n elif char.isdigit():\n if num is None:\n num = 0\n num = num * 10 + int(char)\n elif char == '[':\n stack.append(NestedInteger())\n elif char in ',]':\n if num is not None:\n if negative:\n num = -num\n stack[-1].add(NestedInteger(num))\n num = None\n negative = False\n\n if char == ']' and len(stack) > 1:\n ni = stack.pop()\n stack[-1].add(ni)\n\n return stack[0]\n\n# Example usage:\nsolution = Solution()\nprint(solution.deserialize(\"324\").getInteger()) # Output: 324\nnested_list = solution.deserialize(\"[123,[456,[789]]]\")\nprint(nested_list.getList()) # Output: [123,[456,[789]]]","memory":"18400"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\nclass NestedInteger:\n def __init__(self, value=None):\n \"\"\"\n If value is not specified, initializes an empty list.\n Otherwise initializes a single integer equal to value.\n \"\"\"\n self._integer = value\n self._list = [] if value is None else None\n\n def isInteger(self):\n \"\"\"\n @return True if this NestedInteger holds a single integer, rather than a nested list.\n :rtype bool\n \"\"\"\n return self._integer is not None\n\n def add(self, elem):\n \"\"\"\n Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n :rtype void\n \"\"\"\n if self._list is not None:\n self._list.append(elem)\n\n def setInteger(self, value):\n \"\"\"\n Set this NestedInteger to hold a single integer equal to value.\n :rtype void\n \"\"\"\n self._integer = value\n self._list = None\n\n def getInteger(self):\n \"\"\"\n @return the single integer that this NestedInteger holds, if it holds a single integer\n Return None if this NestedInteger holds a nested list\n :rtype int\n \"\"\"\n return self._integer\n\n def getList(self):\n \"\"\"\n @return the nested list that this NestedInteger holds, if it holds a nested list\n Return None if this NestedInteger holds a single integer\n :rtype List[NestedInteger]\n \"\"\"\n return self._list\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if not s:\n return NestedInteger()\n \n # If the string is a single integer, return it as a NestedInteger\n if s[0] != '[':\n return NestedInteger(int(s))\n \n stack = []\n num = None\n negative = False\n \n for i, char in enumerate(s):\n if char == '-':\n negative = True\n elif char.isdigit():\n if num is None:\n num = 0\n num = num * 10 + int(char)\n elif char == '[':\n stack.append(NestedInteger())\n elif char in ',]':\n if num is not None:\n if negative:\n num = -num\n stack[-1].add(NestedInteger(num))\n num = None\n negative = False\n \n if char == ']' and len(stack) > 1:\n ni = stack.pop()\n stack[-1].add(ni)\n \n return stack[0]","memory":"18500"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n\n\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\n\n number_chars: list[str] = []\n\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\n number_chars.append(s[pos])\n pos += 1\n\n return NestedInteger(int(''.join(number_chars))), pos - 1\n \n if s[0].isnumeric() or s[0] == '-':\n return create_integer(0)[0]\n \n\n stack: list[NestedInteger] = []\n pos: int = 1\n\n outer_nested_integer: NestedInteger = NestedInteger(None)\n stack.append(outer_nested_integer)\n current_nested_integer = outer_nested_integer\n\n while stack:\n\n if s[pos].isnumeric() or s[pos] == '-':\n new_nested_integer, pos = create_integer(pos)\n current_nested_integer.add(new_nested_integer)\n\n elif s[pos] == '[':\n new_nested_integer: NestedInteger = NestedInteger()\n current_nested_integer.add(new_nested_integer)\n stack.append(new_nested_integer)\n current_nested_integer = new_nested_integer\n elif s[pos] == ']':\n stack.pop()\n if stack:\n current_nested_integer = stack[-1]\n \n pos += 1\n \n return outer_nested_integer\n\n","memory":"18900"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n print(s)\n n = len(s)\n if s[0] != '[':\n return NestedInteger(int(s))\n else:\n res = NestedInteger()\n if n > 2:\n l = r = 0\n start = 1\n for i in range(1,n - 1):\n c = s[i]\n if c == '[':\n l += 1\n elif c == ']':\n r += 1\n elif c == ',':\n if l == r:\n val = self.deserialize(s[start:i])\n res.add(val)\n start = i + 1\n val = self.deserialize(s[start:n-1])\n res.add(val)\n return res\n ","memory":"19000"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n # If s doesn't start with a '[', it must be a single integer, so create a NestedInteger object with that value\n if s[0] != '[':\n return NestedInteger(int(s))\n\n # Create an empty stack to keep track of NestedInteger objects and sublists as we parse the input string\n stack = []\n\n # Loop through each character in the string\n for i, c in enumerate(s):\n if c == '[':\n # If we encounter an opening bracket, push a new empty NestedInteger object onto the stack and set the starting index for the next element\n stack.append(NestedInteger())\n start = i + 1\n elif c == ',':\n # If we encounter a comma, check if there was a number between the previous comma or opening bracket and this one.\n # If there was, create a new NestedInteger object with that value and add it to the NestedInteger object on the top of the stack\n if i > start:\n num = int(s[start:i])\n stack[-1].add(NestedInteger(num))\n # Update the starting index for the next element to be parsed\n start = i + 1\n elif c == ']':\n # If we encounter a closing bracket, pop the top NestedInteger object from the stack and check if there was a number between the previous comma or opening bracket and this one.\n # If there was, create a new NestedInteger object with that value and add it to the popped NestedInteger object\n popped = stack.pop()\n if i > start:\n num = int(s[start:i])\n popped.add(NestedInteger(num))\n # If there are still NestedInteger objects on the stack, add the popped NestedInteger to the one on top. Otherwise, return the popped NestedInteger\n if stack:\n stack[-1].add(popped)\n else:\n return popped\n # Update the starting index for the next element to be parsed\n start = i + 1","memory":"19000"},{"code":"class Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if s[0]!='[':\n return NestedInteger(int(s))\n num = None\n stack = []\n sign = '+'\n for i,char_ in enumerate(s):\n if char_ == '[':\n nested_ = NestedInteger()\n stack.append(nested_)\n elif char_ == '-':\n sign = '-'\n elif char_ == ']':\n if num!=None:\n if sign=='-':\n num = -num\n stack[-1].add(NestedInteger(num))\n num=None\n sign='+'\n last_ = stack.pop()\n if stack:\n stack[-1].add(last_)\n last_= stack.pop()\n stack.append(last_)\n elif char_ == ',':\n if num!=None:\n if sign=='-':\n num = -num\n stack[-1].add(NestedInteger(num))\n num = None\n sign='+'\n else:\n if num==None:\n num = int(char_)\n else:\n num = 10*num+int(char_)\n print(len(stack))\n return stack[0]\n","memory":"19100"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if \"[\" not in s:\n return NestedInteger(int(s))\n s = list(s)\n out = []\n number = \"\"\n for i, c in enumerate(s):\n if c == \"[\":\n out.append(NestedInteger())\n elif c == \"]\":\n ni = out.pop()\n if number != \"\":\n ni.add(NestedInteger(int(number)))\n number = \"\"\n if len(out) > 0:\n out[-1].add(ni)\n else:\n return ni\n elif c == \",\" and number != \"\":\n out[-1].add(NestedInteger(int(number)))\n number = \"\"\n elif c.isdigit() or c == \"-\":\n number += c","memory":"19200"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n # parse char one by one\n # hint: s is always global, and will be effected by recursive calls\n def helper():\n num = ''\n while s[0].isdigit() or s[0] == '-':\n num += s.pop(0)\n \n if num: \n # s is a single number\n return NestedInteger(int(num))\n \n s.pop(0) # pop '['\n ret = NestedInteger()\n while s[0] != ']':\n ret.add(helper())\n if s[0] == ',':\n s.pop(0)\n s.pop(0) # pop ']'\n return ret\n\n s = list(s + '#')\n return helper()\n \n # eval trick\n # s = eval(s)\n # def helper(s):\n # if isinstance(s, int):\n # return NestedInteger(s)\n # ret = NestedInteger()\n # for i in s:\n # ret.add(helper(i))\n # return ret\n # return helper(s)","memory":"19300"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if \"[\" not in s:\n return NestedInteger(int(s))\n\n s = list(s)\n out = []\n number = \"\"\n for i, c in enumerate(s):\n if c == \"[\":\n out.append(NestedInteger())\n elif c == \"]\":\n ni = out.pop()\n if number != \"\":\n ni.add(NestedInteger(int(number)))\n number = \"\"\n if len(out) > 0:\n out[-1].add(ni)\n else:\n return ni\n elif c == \",\" and number != \"\":\n out[-1].add(NestedInteger(int(number)))\n number = \"\"\n elif c.isdigit() or c == \"-\":\n number += c","memory":"19400"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n\n def parse_expr(self) -> NestedInteger:\n if self.next() == '[':\n return self.parse_list()\n else:\n return self.parse_integer()\n\n def parse_integer(self) -> NestedInteger:\n \n # go as far as you can with only string.ascii_digit\n\n acc = \"\"\n\n while self.is_next() and self.next() in self.num_digits:\n acc += self.next()\n self.pop()\n\n val = int(acc)\n\n return NestedInteger(val)\n\n def parse_list(self) -> NestedInteger:\n # the next char should be [\n self.pop()\n\n exprs = []\n \n if self.next() == ']':\n self.pop()\n return NestedInteger()\n\n exprs.append(self.parse_expr()) \n \n\n while self.next() == ',':\n # pop the ,\n self.pop()\n # parse the expr\n exprs.append(self.parse_expr())\n\n # the next char should be ]\n # pop it\n\n self.pop()\n\n # make a NestedInteger object\n\n o = NestedInteger()\n\n for e in exprs:\n o.add(e)\n\n return o\n\n\n def pop(self):\n self.i += 1\n\n def next(self):\n\n print(self.i)\n\n return self.s[self.i]\n\n def is_next(self):\n return self.i < len(self.s)\n\n def deserialize(self, s: str) -> NestedInteger:\n \n self.s = list(s)\n\n self.i = 0\n\n self.num_digits = \"1234567890-\"\n\n return self.parse_expr()\n\n\n\n\n\n\n\n\n\n","memory":"19500"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n # tree = NestedInteger()\n tree = None\n flat = s.split(',')\n \n #depth_q = [tree]\n depth_q = []\n for el in flat:\n # if depth_q[-1] == tree and ('[' not in el):\n if len(depth_q) == 0 and ('[' not in el):\n # only top level\n # tree.setInteger(int(el))\n return NestedInteger(value=int(el))\n\n # [789]]], or [[[[-10],\n i = 0\n while el[i] == '[':\n lower_level = NestedInteger()\n if len(depth_q) > 0:\n depth_q[-1].add(lower_level)\n depth_q.append(lower_level)\n i += 1\n value = []\n while i < len(el) and el[i] != ']':\n value.append(el[i])\n i += 1\n\n if len(value) > 0:\n value = int(''.join(value))\n depth_q[-1].add(NestedInteger(value=value))\n \n while i < len(el) and el[i] == ']':\n tree = depth_q.pop()\n i += 1 \n\n # go up the queue\n return tree","memory":"19700"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if not s: return None\n if s[0] != '[': return NestedInteger(int(s))\n\n stack = []\n curr = None\n num = \"\"\n for ch in s:\n if ch == '[':\n if curr:\n stack.append(curr)\n curr = NestedInteger()\n elif ch == ']':\n if num:\n curr.add(NestedInteger(int(num)))\n num=\"\"\n if stack:\n temp = stack.pop()\n temp.add(curr)\n curr = temp\n elif ch == ',' and num:\n curr.add(NestedInteger(int(num)))\n num =\"\"\n elif ch.isdigit() or ch =='-':\n num +=ch\n print(curr)\n return curr\n \n","memory":"20000"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n if \"[\" not in s:\n return NestedInteger(value = int(s))\n \n def getTokens(s: str):\n n = len(s)\n i = 0\n tokens = []\n buffer = \"\"\n while i < n:\n if s[i] in \"[],\":\n if buffer:\n tokens.append(int(buffer))\n buffer=\"\"\n tokens.append(s[i])\n else:\n buffer+= s[i]\n i+=1\n return tokens\n\n tokens = getTokens(s)\n print(tokens)\n def parse(sub, i):\n nestedInteger = NestedInteger()\n while i < len(sub):\n if sub[i] == \"[\":\n v, i = parse(sub, i+1)\n nestedInteger.add(v)\n elif sub[i] == \"]\":\n return (nestedInteger, i)\n elif sub[i] == \",\":\n pass\n else:\n nestedInteger.add(NestedInteger(sub[i]))\n i += 1\n return (nestedInteger, i)\n \n v, i = parse(tokens, 0)\n print(v)\n \n return v.getList()[0]\n \n\n ","memory":"20100"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n stk = []\n for ch in s:\n if ch == ']':\n dq = deque()\n while stk and stk[-1] != '[':\n dq.appendleft(stk.pop())\n stk.pop() # pop [\n this = NestedInteger()\n for ele in dq:\n temp = ele\n if type(temp)==str:\n if temp == ',':\n continue\n else:\n temp = NestedInteger(int(ele))\n this.add(temp)\n stk.append(this)\n elif ch == ',':\n stk.append(ch)\n else:\n if ch.isdigit() and (stk and type(stk[-1]) == str):\n try:\n int(stk[-1])\n is_int = True\n except: \n is_int = (stk[-1] == '-')\n if is_int:\n stk.append(stk.pop() + ch)\n else:\n stk.append(ch)\n else:\n stk.append(ch)\n print(stk)\n return NestedInteger(int(stk[0])) if type(stk[0]) == str else stk[0]","memory":"20200"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n\n def process(idx, isList = False):\n items = []\n val = \"\"\n print(\"Processing from\", idx)\n while idx < len(s): \n if s[idx].isnumeric() or s[idx] == \"-\":\n # ok append it. \n val += s[idx] # build the number. \n elif s[idx] == \"[\":\n # dealing with a new list.. so process it\n # and then return a NestedInteger\n new_idx, nested_int = process(idx + 1, True)\n idx = new_idx\n items.append(nested_int)\n continue\n elif s[idx] == \",\":\n # ok break it into items. \n if val != \"\":\n items.append(NestedInteger(int(val)) )\n val = \"\"\n\n elif s[idx] == \"]\":\n # ok so we processed to end of bracket return that?\n break # we have to break here. \n\n # return items, idx+1 \n \n idx += 1\n\n res = NestedInteger()\n if not isList and len(items) == 0:\n if val != \"\":\n res.setInteger(int(val))\n else:\n res = NestedInteger()\n for item in items:\n res.add(item)\n if val != \"\":\n res.add(NestedInteger(int(val)) ) \n print(\"return type is\", res)\n\n return idx + 1, res\n \n\n if s[0]== \"[\":\n idx, res= process(0, True)\n res = res.getList()[0]\n else:\n idx, res= process(0, False)\n return res\n\n ","memory":"20500"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\n\nclass Parser:\n def parseChar(self, s, c):\n if s[0] != c:\n raise Exception(f'expected char {c}, found {s[0]}')\n return s[1:]\n\n\n def parseNum(self, s):\n i = 0\n while i < len(s) and s[i] in \"-0123456789\":\n i += 1\n return NestedInteger(int(s[:i])), s[i:]\n\n\n def parseElems(self, s):\n r = []\n\n try:\n elem, s = self.parseElem(s)\n r.append(elem)\n s = self.parseChar(s, ',')\n elems, s = self.parseElems(s)\n r.extend(elems)\n except:\n pass\n\n return r, s\n\n\n def parseList(self, s):\n s = self.parseChar(s, '[')\n elems, s = self.parseElems(s)\n s = self.parseChar(s, ']')\n\n n = NestedInteger()\n for elem in elems:\n n.add(elem)\n return n, s\n\n\n def parseElem(self, s):\n try:\n return self.parseNum(s)\n except:\n return self.parseList(s)\n\n\n def parse(self, s):\n result, _ = self.parseElem(s)\n return result\n\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n return Parser().parse(s)","memory":"24600"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\n\nclass Parser:\n def parseChar(self, s, c):\n if s[0] != c:\n raise Exception(f'expected char {c}, found {s[0]}')\n return s[1:]\n\n\n def parseNum(self, s):\n i = 0\n while i < len(s) and s[i] in \"-0123456789\":\n i += 1\n return NestedInteger(int(s[:i])), s[i:]\n\n\n def parseElems(self, s):\n r = []\n elem, s = self.parseElem(s)\n r = [elem]\n\n try:\n s = self.parseChar(s, ',')\n elems, s = self.parseElems(s)\n r.extend(elems)\n except:\n pass\n\n return r, s\n\n\n def parseList(self, s):\n n = NestedInteger()\n\n s = self.parseChar(s, '[')\n try:\n elems, s = self.parseElems(s)\n for elem in elems:\n n.add(elem)\n except:\n pass\n s = self.parseChar(s, ']')\n\n return n, s\n\n\n def parseElem(self, s):\n try:\n return self.parseNum(s)\n except:\n return self.parseList(s)\n\n\n def parse(self, s):\n result, _ = self.parseElem(s)\n return result\n\n\nclass Solution:\n def deserialize(self, s: str) -> NestedInteger:\n return Parser().parse(s)\n","memory":"24700"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, serialized_str: str) -> NestedInteger:\n # Convert the string into a Python data structure (list or integer) using eval\n data_structure = eval(serialized_str)\n # Process the data structure to create a NestedInteger object\n return self.process(data_structure)\n \n def process(self, data) -> NestedInteger:\n if isinstance(data, int):\n # Create a NestedInteger with a single integer value\n return NestedInteger(data)\n \n # Create a NestedInteger instance to hold nested values\n nested_integer = NestedInteger()\n \n # Process each element in the list\n for item in data:\n # Recursively process each item in the list\n nested_integer.add(self.process(item))\n \n return nested_integer\n","memory":"26000"},{"code":"# \"\"\"\n# This is the interface that allows for creating nested lists.\n# You should not implement it, or speculate about its implementation\n# \"\"\"\n#class NestedInteger:\n# def __init__(self, value=None):\n# \"\"\"\n# If value is not specified, initializes an empty list.\n# Otherwise initializes a single integer equal to value.\n# \"\"\"\n#\n# def isInteger(self):\n# \"\"\"\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\n# :rtype bool\n# \"\"\"\n#\n# def add(self, elem):\n# \"\"\"\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\n# :rtype void\n# \"\"\"\n#\n# def setInteger(self, value):\n# \"\"\"\n# Set this NestedInteger to hold a single integer equal to value.\n# :rtype void\n# \"\"\"\n#\n# def getInteger(self):\n# \"\"\"\n# @return the single integer that this NestedInteger holds, if it holds a single integer\n# Return None if this NestedInteger holds a nested list\n# :rtype int\n# \"\"\"\n#\n# def getList(self):\n# \"\"\"\n# @return the nested list that this NestedInteger holds, if it holds a nested list\n# Return None if this NestedInteger holds a single integer\n# :rtype List[NestedInteger]\n# \"\"\"\n\nclass Solution:\n def deserialize(self, serialized_str: str) -> NestedInteger:\n # Convert the string into a Python data structure (list or integer) using eval\n data_structure = eval(serialized_str)\n # Process the data structure to create a NestedInteger object\n return self.process(data_structure)\n \n def process(self, data) -> NestedInteger:\n if isinstance(data, int):\n # Create a NestedInteger with a single integer value\n return NestedInteger(data)\n \n # Create a NestedInteger instance to hold nested values\n nested_integer = NestedInteger()\n \n # Process each element in the list\n for item in data:\n # Recursively process each item in the list\n nested_integer.add(self.process(item))\n \n return nested_integer\n","memory":"26000"}],"string":"[\n {\n \"code\": \"class NestedInteger:\\n def __init__(self, value=None):\\n if value is None:\\n self.is_integer = False\\n self.value = []\\n elif isinstance(value, int):\\n self.is_integer = True\\n self.value = value\\n else:\\n raise ValueError(\\\"Invalid value\\\")\\n \\n def isInteger(self):\\n return self.is_integer\\n \\n def getInteger(self):\\n if self.is_integer:\\n return self.value\\n else:\\n raise ValueError(\\\"This NestedInteger holds a nested list\\\")\\n \\n def setInteger(self, value):\\n self.is_integer = True\\n self.value = value\\n \\n def add(self, ni):\\n if not self.is_integer:\\n self.value.append(ni)\\n else:\\n raise ValueError(\\\"This NestedInteger holds an integer\\\")\\n \\n def getList(self):\\n if not self.is_integer:\\n return self.value\\n else:\\n raise ValueError(\\\"This NestedInteger holds a single integer\\\")\\n \\n def __str__(self):\\n if self.is_integer:\\n return str(self.value)\\n else:\\n return \\\"[\\\" + \\\", \\\".join(str(ni) for ni in self.value) + \\\"]\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def parse(index):\\n if s[index[0]] == '[':\\n index[0] += 1\\n nested_integer = NestedInteger()\\n while s[index[0]] != ']':\\n if s[index[0]] == ',':\\n index[0] += 1\\n nested_integer.add(parse(index))\\n index[0] += 1\\n return nested_integer\\n else:\\n start = index[0]\\n while index[0] < len(s) and s[index[0]] not in ',[]':\\n index[0] += 1\\n value = int(s[start:index[0]])\\n return NestedInteger(value)\\n \\n return parse([0])\\n\\n# Example usage\\nif __name__ == \\\"__main__\\\":\\n sol = Solution()\\n \\n # Test cases\\n s1 = \\\"324\\\"\\n result1 = sol.deserialize(s1)\\n print(\\\"Output for s1:\\\", result1) # Output: 324\\n \\n s2 = \\\"[123,[456,[789]]]\\\"\\n result2 = sol.deserialize(s2)\\n print(\\\"Output for s2:\\\", result2) # Output: [123, [456, [789]]]\\n\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class NestedInteger:\\n def __init__(self, value=None):\\n if value is None:\\n self.is_integer = False\\n self.value = []\\n elif isinstance(value, int):\\n self.is_integer = True\\n self.value = value\\n else:\\n raise ValueError(\\\"Invalid value\\\")\\n \\n def isInteger(self):\\n return self.is_integer\\n \\n def getInteger(self):\\n if self.is_integer:\\n return self.value\\n else:\\n raise ValueError(\\\"This NestedInteger holds a nested list\\\")\\n \\n def setInteger(self, value):\\n self.is_integer = True\\n self.value = value\\n \\n def add(self, ni):\\n if not self.is_integer:\\n self.value.append(ni)\\n else:\\n raise ValueError(\\\"This NestedInteger holds an integer\\\")\\n \\n def getList(self):\\n if not self.is_integer:\\n return self.value\\n else:\\n raise ValueError(\\\"This NestedInteger holds a single integer\\\")\\n \\n def __str__(self):\\n if self.is_integer:\\n return str(self.value)\\n else:\\n return \\\"[\\\" + \\\", \\\".join(str(ni) for ni in self.value) + \\\"]\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def parse(index):\\n if s[index[0]] == '[':\\n index[0] += 1\\n nested_integer = NestedInteger()\\n while s[index[0]] != ']':\\n if s[index[0]] == ',':\\n index[0] += 1\\n nested_integer.add(parse(index))\\n index[0] += 1\\n return nested_integer\\n else:\\n start = index[0]\\n while index[0] < len(s) and s[index[0]] not in ',[]':\\n index[0] += 1\\n value = int(s[start:index[0]])\\n return NestedInteger(value)\\n \\n return parse([0])\\n\\n\\nif __name__ == \\\"__main__\\\":\\n sol = Solution()\\n \\n \\n s1 = \\\"324\\\"\\n result1 = sol.deserialize(s1)\\n print(\\\"Output for s1:\\\", result1) \\n \\n s2 = \\\"[123,[456,[789]]]\\\"\\n result2 = sol.deserialize(s2)\\n print(\\\"Output for s2:\\\", result2) \\n\",\n \"memory\": \"18100\"\n },\n {\n \"code\": \"class NestedInteger:\\n def __init__(self, value=None):\\n if value is not None:\\n if isinstance(value, list):\\n self.nested_list = value\\n else:\\n self.integer = value\\n\\n def isInteger(self):\\n return hasattr(self, 'integer')\\n\\n def getInteger(self):\\n return self.integer if self.isInteger() else None\\n\\n def setInteger(self, value):\\n self.integer = value\\n\\n def add(self, elem):\\n if not hasattr(self, 'nested_list'):\\n self.nested_list = []\\n self.nested_list.append(elem)\\n\\n def getList(self):\\n return self.nested_list if not self.isInteger() else None\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def nestedInteger(x):\\n if isinstance(x, int):\\n return NestedInteger(x)\\n return NestedInteger([nestedInteger(i) for i in x])\\n\\n import json\\n return nestedInteger(json.loads(s))\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"class NestedInteger:\\n def __init__(self, value=None):\\n if value is not None:\\n if isinstance(value, int):\\n self.is_int = True\\n self.value = value\\n else:\\n self.is_int = False\\n self.value = [NestedInteger(v) for v in value]\\n else:\\n self.is_int = False\\n self.value = []\\n\\n def isInteger(self):\\n return self.is_int\\n\\n def add(self, elem):\\n if self.is_int:\\n raise ValueError(\\\"Cannot add to an integer NestedInteger\\\")\\n self.value.append(elem)\\n\\n def setInteger(self, value):\\n if not isinstance(value, int):\\n raise ValueError(\\\"Value must be an integer\\\")\\n self.is_int = True\\n self.value = value\\n\\n def getInteger(self):\\n return self.value if self.is_int else None\\n\\n def getList(self):\\n return None if self.is_int else self.value\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n def nestedInteger():\\n if s[index[0]] == '[':\\n index[0] += 1\\n ni = NestedInteger()\\n while s[index[0]] != ']':\\n ni.add(nestedInteger())\\n if s[index[0]] == ',':\\n index[0] += 1\\n index[0] += 1\\n return ni\\n else:\\n is_negative = False\\n if s[index[0]] == '-':\\n is_negative = True\\n index[0] += 1\\n num = 0\\n while index[0] < len(s) and s[index[0]].isdigit():\\n num = num * 10 + int(s[index[0]])\\n index[0] += 1\\n if is_negative:\\n num = -num\\n return NestedInteger(num)\\n \\n index = [0]\\n return nestedInteger()\\n\\n# Example usage:\\n# sol = Solution()\\n# result = sol.deserialize(\\\"[123,[456,[789]]]\\\")\\n# print(result.getList())\",\n \"memory\": \"18200\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def __init__(self, value=None):\\n \\\"\\\"\\\"\\n If value is not specified, initializes an empty list.\\n Otherwise initializes a single integer equal to value.\\n \\\"\\\"\\\"\\n if value is None:\\n self.data = []\\n else:\\n self.data = value\\n\\n def isInteger(self):\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n :rtype bool\\n \\\"\\\"\\\"\\n return type(self.data) == int\\n\\n def add(self, elem):\\n \\\"\\\"\\\"\\n Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n :rtype void\\n \\\"\\\"\\\"\\n if not self.isInteger():\\n self.data.append(elem)\\n else:\\n raise TypeError('Cannot add to an integer NestedInteger')\\n\\n def setInteger(self, value):\\n \\\"\\\"\\\"\\n Set this NestedInteger to hold a single integer equal to value.\\n :rtype void\\n \\\"\\\"\\\"\\n self.data = value\\n\\n def getInteger(self):\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n :rtype int\\n \\\"\\\"\\\"\\n if self.isInteger():\\n return self.data\\n return None\\n\\n def getList(self):\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n :rtype List[NestedInteger]\\n \\\"\\\"\\\"\\n if not self.isInteger():\\n return self.data\\n return None\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0] != '[':\\n # Base case: single integer\\n return NestedInteger(int(s))\\n stack = []\\n current = None\\n l = 0 # Start of the number\\n for r in range(len(s)):\\n if s[r] == '[':\\n if current is not None:\\n stack.append(current)\\n current = NestedInteger()\\n l = r + 1\\n elif s[r] == ']':\\n if s[r-1].isdigit() or s[r-1] == '-':\\n num = int(s[l:r])\\n current.add(NestedInteger(num))\\n if stack:\\n top = stack.pop()\\n top.add(current)\\n current = top\\n l = r + 1\\n elif s[r] == ',':\\n if s[r-1].isdigit() or s[r-1] == '-':\\n num = int(s[l:r])\\n current.add(NestedInteger(num))\\n l = r + 1\\n return current\",\n \"memory\": \"18300\"\n },\n {\n \"code\": \"class NestedInteger:\\n def __init__(self, value=None):\\n if value is None:\\n self._list = []\\n self._integer = None\\n else:\\n self._list = None\\n self._integer = value\\n\\n def isInteger(self):\\n return self._integer is not None\\n\\n def add(self, elem):\\n if self._list is not None:\\n self._list.append(elem)\\n\\n def setInteger(self, value):\\n self._integer = value\\n self._list = None\\n\\n def getInteger(self):\\n return self._integer\\n\\n def getList(self):\\n return self._list\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if not s:\\n return NestedInteger()\\n\\n if s[0] != '[': # If the string does not start with '[', it's a single integer.\\n return NestedInteger(int(s))\\n\\n stack = []\\n num = None\\n negative = False\\n\\n for i, char in enumerate(s):\\n if char == '-':\\n negative = True\\n elif char.isdigit():\\n if num is None:\\n num = 0\\n num = num * 10 + int(char)\\n elif char == '[':\\n stack.append(NestedInteger())\\n elif char in ',]':\\n if num is not None:\\n if negative:\\n num = -num\\n stack[-1].add(NestedInteger(num))\\n num = None\\n negative = False\\n\\n if char == ']' and len(stack) > 1:\\n ni = stack.pop()\\n stack[-1].add(ni)\\n\\n return stack[0]\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.deserialize(\\\"324\\\").getInteger()) # Output: 324\\nnested_list = solution.deserialize(\\\"[123,[456,[789]]]\\\")\\nprint(nested_list.getList()) # Output: [123,[456,[789]]]\",\n \"memory\": \"18400\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\nclass NestedInteger:\\n def __init__(self, value=None):\\n \\\"\\\"\\\"\\n If value is not specified, initializes an empty list.\\n Otherwise initializes a single integer equal to value.\\n \\\"\\\"\\\"\\n self._integer = value\\n self._list = [] if value is None else None\\n\\n def isInteger(self):\\n \\\"\\\"\\\"\\n @return True if this NestedInteger holds a single integer, rather than a nested list.\\n :rtype bool\\n \\\"\\\"\\\"\\n return self._integer is not None\\n\\n def add(self, elem):\\n \\\"\\\"\\\"\\n Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n :rtype void\\n \\\"\\\"\\\"\\n if self._list is not None:\\n self._list.append(elem)\\n\\n def setInteger(self, value):\\n \\\"\\\"\\\"\\n Set this NestedInteger to hold a single integer equal to value.\\n :rtype void\\n \\\"\\\"\\\"\\n self._integer = value\\n self._list = None\\n\\n def getInteger(self):\\n \\\"\\\"\\\"\\n @return the single integer that this NestedInteger holds, if it holds a single integer\\n Return None if this NestedInteger holds a nested list\\n :rtype int\\n \\\"\\\"\\\"\\n return self._integer\\n\\n def getList(self):\\n \\\"\\\"\\\"\\n @return the nested list that this NestedInteger holds, if it holds a nested list\\n Return None if this NestedInteger holds a single integer\\n :rtype List[NestedInteger]\\n \\\"\\\"\\\"\\n return self._list\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if not s:\\n return NestedInteger()\\n \\n # If the string is a single integer, return it as a NestedInteger\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n \\n stack = []\\n num = None\\n negative = False\\n \\n for i, char in enumerate(s):\\n if char == '-':\\n negative = True\\n elif char.isdigit():\\n if num is None:\\n num = 0\\n num = num * 10 + int(char)\\n elif char == '[':\\n stack.append(NestedInteger())\\n elif char in ',]':\\n if num is not None:\\n if negative:\\n num = -num\\n stack[-1].add(NestedInteger(num))\\n num = None\\n negative = False\\n \\n if char == ']' and len(stack) > 1:\\n ni = stack.pop()\\n stack[-1].add(ni)\\n \\n return stack[0]\",\n \"memory\": \"18500\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n\\n\\n def create_integer(pos: int) -> tuple[NestedInteger, int]:\\n\\n number_chars: list[str] = []\\n\\n while pos < len(s) and (s[pos].isnumeric() or s[pos] == '-'):\\n number_chars.append(s[pos])\\n pos += 1\\n\\n return NestedInteger(int(''.join(number_chars))), pos - 1\\n \\n if s[0].isnumeric() or s[0] == '-':\\n return create_integer(0)[0]\\n \\n\\n stack: list[NestedInteger] = []\\n pos: int = 1\\n\\n outer_nested_integer: NestedInteger = NestedInteger(None)\\n stack.append(outer_nested_integer)\\n current_nested_integer = outer_nested_integer\\n\\n while stack:\\n\\n if s[pos].isnumeric() or s[pos] == '-':\\n new_nested_integer, pos = create_integer(pos)\\n current_nested_integer.add(new_nested_integer)\\n\\n elif s[pos] == '[':\\n new_nested_integer: NestedInteger = NestedInteger()\\n current_nested_integer.add(new_nested_integer)\\n stack.append(new_nested_integer)\\n current_nested_integer = new_nested_integer\\n elif s[pos] == ']':\\n stack.pop()\\n if stack:\\n current_nested_integer = stack[-1]\\n \\n pos += 1\\n \\n return outer_nested_integer\\n\\n\",\n \"memory\": \"18900\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n print(s)\\n n = len(s)\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n else:\\n res = NestedInteger()\\n if n > 2:\\n l = r = 0\\n start = 1\\n for i in range(1,n - 1):\\n c = s[i]\\n if c == '[':\\n l += 1\\n elif c == ']':\\n r += 1\\n elif c == ',':\\n if l == r:\\n val = self.deserialize(s[start:i])\\n res.add(val)\\n start = i + 1\\n val = self.deserialize(s[start:n-1])\\n res.add(val)\\n return res\\n \",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n # If s doesn't start with a '[', it must be a single integer, so create a NestedInteger object with that value\\n if s[0] != '[':\\n return NestedInteger(int(s))\\n\\n # Create an empty stack to keep track of NestedInteger objects and sublists as we parse the input string\\n stack = []\\n\\n # Loop through each character in the string\\n for i, c in enumerate(s):\\n if c == '[':\\n # If we encounter an opening bracket, push a new empty NestedInteger object onto the stack and set the starting index for the next element\\n stack.append(NestedInteger())\\n start = i + 1\\n elif c == ',':\\n # If we encounter a comma, check if there was a number between the previous comma or opening bracket and this one.\\n # If there was, create a new NestedInteger object with that value and add it to the NestedInteger object on the top of the stack\\n if i > start:\\n num = int(s[start:i])\\n stack[-1].add(NestedInteger(num))\\n # Update the starting index for the next element to be parsed\\n start = i + 1\\n elif c == ']':\\n # If we encounter a closing bracket, pop the top NestedInteger object from the stack and check if there was a number between the previous comma or opening bracket and this one.\\n # If there was, create a new NestedInteger object with that value and add it to the popped NestedInteger object\\n popped = stack.pop()\\n if i > start:\\n num = int(s[start:i])\\n popped.add(NestedInteger(num))\\n # If there are still NestedInteger objects on the stack, add the popped NestedInteger to the one on top. Otherwise, return the popped NestedInteger\\n if stack:\\n stack[-1].add(popped)\\n else:\\n return popped\\n # Update the starting index for the next element to be parsed\\n start = i + 1\",\n \"memory\": \"19000\"\n },\n {\n \"code\": \"class Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if s[0]!='[':\\n return NestedInteger(int(s))\\n num = None\\n stack = []\\n sign = '+'\\n for i,char_ in enumerate(s):\\n if char_ == '[':\\n nested_ = NestedInteger()\\n stack.append(nested_)\\n elif char_ == '-':\\n sign = '-'\\n elif char_ == ']':\\n if num!=None:\\n if sign=='-':\\n num = -num\\n stack[-1].add(NestedInteger(num))\\n num=None\\n sign='+'\\n last_ = stack.pop()\\n if stack:\\n stack[-1].add(last_)\\n last_= stack.pop()\\n stack.append(last_)\\n elif char_ == ',':\\n if num!=None:\\n if sign=='-':\\n num = -num\\n stack[-1].add(NestedInteger(num))\\n num = None\\n sign='+'\\n else:\\n if num==None:\\n num = int(char_)\\n else:\\n num = 10*num+int(char_)\\n print(len(stack))\\n return stack[0]\\n\",\n \"memory\": \"19100\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if \\\"[\\\" not in s:\\n return NestedInteger(int(s))\\n s = list(s)\\n out = []\\n number = \\\"\\\"\\n for i, c in enumerate(s):\\n if c == \\\"[\\\":\\n out.append(NestedInteger())\\n elif c == \\\"]\\\":\\n ni = out.pop()\\n if number != \\\"\\\":\\n ni.add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n if len(out) > 0:\\n out[-1].add(ni)\\n else:\\n return ni\\n elif c == \\\",\\\" and number != \\\"\\\":\\n out[-1].add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n elif c.isdigit() or c == \\\"-\\\":\\n number += c\",\n \"memory\": \"19200\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n # parse char one by one\\n # hint: s is always global, and will be effected by recursive calls\\n def helper():\\n num = ''\\n while s[0].isdigit() or s[0] == '-':\\n num += s.pop(0)\\n \\n if num: \\n # s is a single number\\n return NestedInteger(int(num))\\n \\n s.pop(0) # pop '['\\n ret = NestedInteger()\\n while s[0] != ']':\\n ret.add(helper())\\n if s[0] == ',':\\n s.pop(0)\\n s.pop(0) # pop ']'\\n return ret\\n\\n s = list(s + '#')\\n return helper()\\n \\n # eval trick\\n # s = eval(s)\\n # def helper(s):\\n # if isinstance(s, int):\\n # return NestedInteger(s)\\n # ret = NestedInteger()\\n # for i in s:\\n # ret.add(helper(i))\\n # return ret\\n # return helper(s)\",\n \"memory\": \"19300\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if \\\"[\\\" not in s:\\n return NestedInteger(int(s))\\n\\n s = list(s)\\n out = []\\n number = \\\"\\\"\\n for i, c in enumerate(s):\\n if c == \\\"[\\\":\\n out.append(NestedInteger())\\n elif c == \\\"]\\\":\\n ni = out.pop()\\n if number != \\\"\\\":\\n ni.add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n if len(out) > 0:\\n out[-1].add(ni)\\n else:\\n return ni\\n elif c == \\\",\\\" and number != \\\"\\\":\\n out[-1].add(NestedInteger(int(number)))\\n number = \\\"\\\"\\n elif c.isdigit() or c == \\\"-\\\":\\n number += c\",\n \"memory\": \"19400\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n\\n def parse_expr(self) -> NestedInteger:\\n if self.next() == '[':\\n return self.parse_list()\\n else:\\n return self.parse_integer()\\n\\n def parse_integer(self) -> NestedInteger:\\n \\n # go as far as you can with only string.ascii_digit\\n\\n acc = \\\"\\\"\\n\\n while self.is_next() and self.next() in self.num_digits:\\n acc += self.next()\\n self.pop()\\n\\n val = int(acc)\\n\\n return NestedInteger(val)\\n\\n def parse_list(self) -> NestedInteger:\\n # the next char should be [\\n self.pop()\\n\\n exprs = []\\n \\n if self.next() == ']':\\n self.pop()\\n return NestedInteger()\\n\\n exprs.append(self.parse_expr()) \\n \\n\\n while self.next() == ',':\\n # pop the ,\\n self.pop()\\n # parse the expr\\n exprs.append(self.parse_expr())\\n\\n # the next char should be ]\\n # pop it\\n\\n self.pop()\\n\\n # make a NestedInteger object\\n\\n o = NestedInteger()\\n\\n for e in exprs:\\n o.add(e)\\n\\n return o\\n\\n\\n def pop(self):\\n self.i += 1\\n\\n def next(self):\\n\\n print(self.i)\\n\\n return self.s[self.i]\\n\\n def is_next(self):\\n return self.i < len(self.s)\\n\\n def deserialize(self, s: str) -> NestedInteger:\\n \\n self.s = list(s)\\n\\n self.i = 0\\n\\n self.num_digits = \\\"1234567890-\\\"\\n\\n return self.parse_expr()\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"memory\": \"19500\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n # tree = NestedInteger()\\n tree = None\\n flat = s.split(',')\\n \\n #depth_q = [tree]\\n depth_q = []\\n for el in flat:\\n # if depth_q[-1] == tree and ('[' not in el):\\n if len(depth_q) == 0 and ('[' not in el):\\n # only top level\\n # tree.setInteger(int(el))\\n return NestedInteger(value=int(el))\\n\\n # [789]]], or [[[[-10],\\n i = 0\\n while el[i] == '[':\\n lower_level = NestedInteger()\\n if len(depth_q) > 0:\\n depth_q[-1].add(lower_level)\\n depth_q.append(lower_level)\\n i += 1\\n value = []\\n while i < len(el) and el[i] != ']':\\n value.append(el[i])\\n i += 1\\n\\n if len(value) > 0:\\n value = int(''.join(value))\\n depth_q[-1].add(NestedInteger(value=value))\\n \\n while i < len(el) and el[i] == ']':\\n tree = depth_q.pop()\\n i += 1 \\n\\n # go up the queue\\n return tree\",\n \"memory\": \"19700\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if not s: return None\\n if s[0] != '[': return NestedInteger(int(s))\\n\\n stack = []\\n curr = None\\n num = \\\"\\\"\\n for ch in s:\\n if ch == '[':\\n if curr:\\n stack.append(curr)\\n curr = NestedInteger()\\n elif ch == ']':\\n if num:\\n curr.add(NestedInteger(int(num)))\\n num=\\\"\\\"\\n if stack:\\n temp = stack.pop()\\n temp.add(curr)\\n curr = temp\\n elif ch == ',' and num:\\n curr.add(NestedInteger(int(num)))\\n num =\\\"\\\"\\n elif ch.isdigit() or ch =='-':\\n num +=ch\\n print(curr)\\n return curr\\n \\n\",\n \"memory\": \"20000\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n if \\\"[\\\" not in s:\\n return NestedInteger(value = int(s))\\n \\n def getTokens(s: str):\\n n = len(s)\\n i = 0\\n tokens = []\\n buffer = \\\"\\\"\\n while i < n:\\n if s[i] in \\\"[],\\\":\\n if buffer:\\n tokens.append(int(buffer))\\n buffer=\\\"\\\"\\n tokens.append(s[i])\\n else:\\n buffer+= s[i]\\n i+=1\\n return tokens\\n\\n tokens = getTokens(s)\\n print(tokens)\\n def parse(sub, i):\\n nestedInteger = NestedInteger()\\n while i < len(sub):\\n if sub[i] == \\\"[\\\":\\n v, i = parse(sub, i+1)\\n nestedInteger.add(v)\\n elif sub[i] == \\\"]\\\":\\n return (nestedInteger, i)\\n elif sub[i] == \\\",\\\":\\n pass\\n else:\\n nestedInteger.add(NestedInteger(sub[i]))\\n i += 1\\n return (nestedInteger, i)\\n \\n v, i = parse(tokens, 0)\\n print(v)\\n \\n return v.getList()[0]\\n \\n\\n \",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n stk = []\\n for ch in s:\\n if ch == ']':\\n dq = deque()\\n while stk and stk[-1] != '[':\\n dq.appendleft(stk.pop())\\n stk.pop() # pop [\\n this = NestedInteger()\\n for ele in dq:\\n temp = ele\\n if type(temp)==str:\\n if temp == ',':\\n continue\\n else:\\n temp = NestedInteger(int(ele))\\n this.add(temp)\\n stk.append(this)\\n elif ch == ',':\\n stk.append(ch)\\n else:\\n if ch.isdigit() and (stk and type(stk[-1]) == str):\\n try:\\n int(stk[-1])\\n is_int = True\\n except: \\n is_int = (stk[-1] == '-')\\n if is_int:\\n stk.append(stk.pop() + ch)\\n else:\\n stk.append(ch)\\n else:\\n stk.append(ch)\\n print(stk)\\n return NestedInteger(int(stk[0])) if type(stk[0]) == str else stk[0]\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n\\n def process(idx, isList = False):\\n items = []\\n val = \\\"\\\"\\n print(\\\"Processing from\\\", idx)\\n while idx < len(s): \\n if s[idx].isnumeric() or s[idx] == \\\"-\\\":\\n # ok append it. \\n val += s[idx] # build the number. \\n elif s[idx] == \\\"[\\\":\\n # dealing with a new list.. so process it\\n # and then return a NestedInteger\\n new_idx, nested_int = process(idx + 1, True)\\n idx = new_idx\\n items.append(nested_int)\\n continue\\n elif s[idx] == \\\",\\\":\\n # ok break it into items. \\n if val != \\\"\\\":\\n items.append(NestedInteger(int(val)) )\\n val = \\\"\\\"\\n\\n elif s[idx] == \\\"]\\\":\\n # ok so we processed to end of bracket return that?\\n break # we have to break here. \\n\\n # return items, idx+1 \\n \\n idx += 1\\n\\n res = NestedInteger()\\n if not isList and len(items) == 0:\\n if val != \\\"\\\":\\n res.setInteger(int(val))\\n else:\\n res = NestedInteger()\\n for item in items:\\n res.add(item)\\n if val != \\\"\\\":\\n res.add(NestedInteger(int(val)) ) \\n print(\\\"return type is\\\", res)\\n\\n return idx + 1, res\\n \\n\\n if s[0]== \\\"[\\\":\\n idx, res= process(0, True)\\n res = res.getList()[0]\\n else:\\n idx, res= process(0, False)\\n return res\\n\\n \",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\n\\nclass Parser:\\n def parseChar(self, s, c):\\n if s[0] != c:\\n raise Exception(f'expected char {c}, found {s[0]}')\\n return s[1:]\\n\\n\\n def parseNum(self, s):\\n i = 0\\n while i < len(s) and s[i] in \\\"-0123456789\\\":\\n i += 1\\n return NestedInteger(int(s[:i])), s[i:]\\n\\n\\n def parseElems(self, s):\\n r = []\\n\\n try:\\n elem, s = self.parseElem(s)\\n r.append(elem)\\n s = self.parseChar(s, ',')\\n elems, s = self.parseElems(s)\\n r.extend(elems)\\n except:\\n pass\\n\\n return r, s\\n\\n\\n def parseList(self, s):\\n s = self.parseChar(s, '[')\\n elems, s = self.parseElems(s)\\n s = self.parseChar(s, ']')\\n\\n n = NestedInteger()\\n for elem in elems:\\n n.add(elem)\\n return n, s\\n\\n\\n def parseElem(self, s):\\n try:\\n return self.parseNum(s)\\n except:\\n return self.parseList(s)\\n\\n\\n def parse(self, s):\\n result, _ = self.parseElem(s)\\n return result\\n\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n return Parser().parse(s)\",\n \"memory\": \"24600\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\n\\nclass Parser:\\n def parseChar(self, s, c):\\n if s[0] != c:\\n raise Exception(f'expected char {c}, found {s[0]}')\\n return s[1:]\\n\\n\\n def parseNum(self, s):\\n i = 0\\n while i < len(s) and s[i] in \\\"-0123456789\\\":\\n i += 1\\n return NestedInteger(int(s[:i])), s[i:]\\n\\n\\n def parseElems(self, s):\\n r = []\\n elem, s = self.parseElem(s)\\n r = [elem]\\n\\n try:\\n s = self.parseChar(s, ',')\\n elems, s = self.parseElems(s)\\n r.extend(elems)\\n except:\\n pass\\n\\n return r, s\\n\\n\\n def parseList(self, s):\\n n = NestedInteger()\\n\\n s = self.parseChar(s, '[')\\n try:\\n elems, s = self.parseElems(s)\\n for elem in elems:\\n n.add(elem)\\n except:\\n pass\\n s = self.parseChar(s, ']')\\n\\n return n, s\\n\\n\\n def parseElem(self, s):\\n try:\\n return self.parseNum(s)\\n except:\\n return self.parseList(s)\\n\\n\\n def parse(self, s):\\n result, _ = self.parseElem(s)\\n return result\\n\\n\\nclass Solution:\\n def deserialize(self, s: str) -> NestedInteger:\\n return Parser().parse(s)\\n\",\n \"memory\": \"24700\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, serialized_str: str) -> NestedInteger:\\n # Convert the string into a Python data structure (list or integer) using eval\\n data_structure = eval(serialized_str)\\n # Process the data structure to create a NestedInteger object\\n return self.process(data_structure)\\n \\n def process(self, data) -> NestedInteger:\\n if isinstance(data, int):\\n # Create a NestedInteger with a single integer value\\n return NestedInteger(data)\\n \\n # Create a NestedInteger instance to hold nested values\\n nested_integer = NestedInteger()\\n \\n # Process each element in the list\\n for item in data:\\n # Recursively process each item in the list\\n nested_integer.add(self.process(item))\\n \\n return nested_integer\\n\",\n \"memory\": \"26000\"\n },\n {\n \"code\": \"# \\\"\\\"\\\"\\n# This is the interface that allows for creating nested lists.\\n# You should not implement it, or speculate about its implementation\\n# \\\"\\\"\\\"\\n#class NestedInteger:\\n# def __init__(self, value=None):\\n# \\\"\\\"\\\"\\n# If value is not specified, initializes an empty list.\\n# Otherwise initializes a single integer equal to value.\\n# \\\"\\\"\\\"\\n#\\n# def isInteger(self):\\n# \\\"\\\"\\\"\\n# @return True if this NestedInteger holds a single integer, rather than a nested list.\\n# :rtype bool\\n# \\\"\\\"\\\"\\n#\\n# def add(self, elem):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a nested list and adds a nested integer elem to it.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def setInteger(self, value):\\n# \\\"\\\"\\\"\\n# Set this NestedInteger to hold a single integer equal to value.\\n# :rtype void\\n# \\\"\\\"\\\"\\n#\\n# def getInteger(self):\\n# \\\"\\\"\\\"\\n# @return the single integer that this NestedInteger holds, if it holds a single integer\\n# Return None if this NestedInteger holds a nested list\\n# :rtype int\\n# \\\"\\\"\\\"\\n#\\n# def getList(self):\\n# \\\"\\\"\\\"\\n# @return the nested list that this NestedInteger holds, if it holds a nested list\\n# Return None if this NestedInteger holds a single integer\\n# :rtype List[NestedInteger]\\n# \\\"\\\"\\\"\\n\\nclass Solution:\\n def deserialize(self, serialized_str: str) -> NestedInteger:\\n # Convert the string into a Python data structure (list or integer) using eval\\n data_structure = eval(serialized_str)\\n # Process the data structure to create a NestedInteger object\\n return self.process(data_structure)\\n \\n def process(self, data) -> NestedInteger:\\n if isinstance(data, int):\\n # Create a NestedInteger with a single integer value\\n return NestedInteger(data)\\n \\n # Create a NestedInteger instance to hold nested values\\n nested_integer = NestedInteger()\\n \\n # Process each element in the list\\n for item in data:\\n # Recursively process each item in the list\\n nested_integer.add(self.process(item))\\n \\n return nested_integer\\n\",\n \"memory\": \"26000\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":24,"string":"24"}}},{"rowIdx":289,"cells":{"question_id":{"kind":"number","value":386,"string":"386"},"name":{"kind":"string","value":"lexicographical-numbers"},"content":{"kind":"string","value":"<p>Given an integer <code>n</code>, return all the numbers in the range <code>[1, n]</code> sorted in lexicographical order.</p>\n\n<p>You must write an algorithm that runs in <code>O(n)</code> time and uses <code>O(1)</code> extra space. </p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> n = 13\n<strong>Output:</strong> [1,10,11,12,13,2,3,4,5,6,7,8,9]\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> n = 2\n<strong>Output:</strong> [1,2]\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 5 * 10<sup>4</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":64.73915271094323,"string":"64.739153"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["depth-first-search","trie"],"string":"[\n \"depth-first-search\",\n \"trie\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"42\", 0.24], [\"44\", 0.2401], [\"46\", 0.12], [\"49\", 0.4802], [\"51\", 0.3601], [\"53\", 0.7203], [\"56\", 0.9604], [\"58\", 1.4405000000000001], [\"60\", 3.6015], [\"63\", 4.0816], [\"65\", 4.2017], [\"67\", 10.2041], [\"70\", 5.5222], [\"72\", 7.8031], [\"74\", 10.444199999999999], [\"77\", 5.5222], [\"79\", 3.8415999999999997], [\"81\", 4.802], [\"84\", 1.8007], [\"86\", 0.4802], [\"88\", 0.8402], [\"91\", 0.6002000000000001], [\"93\", 0.2401], [\"95\", 0.7202], [\"98\", 0.2401], [\"100\", 0.3601], [\"102\", 0.8402], [\"105\", 1.2004], [\"107\", 1.0804], [\"109\", 1.4405], [\"112\", 1.9208], [\"114\", 0.9604], [\"116\", 0.9602999999999999], [\"119\", 0.6002], [\"121\", 0.3601], [\"123\", 0.6002000000000001], [\"126\", 0.3601], [\"128\", 0.48009999999999997], [\"130\", 0.6001], [\"133\", 0.7202], [\"135\", 0.4802], [\"138\", 1.6807], [\"140\", 1.6806], [\"142\", 0.7202], [\"145\", 1.2004000000000001], [\"147\", 0.3601], [\"149\", 0.9602999999999999], [\"152\", 0.3601], [\"154\", 0.24], [\"156\", 0.2401], [\"159\", 0.6002000000000001], [\"161\", 0.12], [\"163\", 0.2401], [\"166\", 0.3601], [\"168\", 0.3601], [\"170\", 0.2401], [\"173\", 0.12], [\"175\", 0.12], [\"177\", 0.12], [\"180\", 0.12], [\"182\", 0.12], [\"184\", 0.24], [\"187\", 0.12], [\"189\", 0.12], [\"191\", 0.2401], [\"194\", 0.12], [\"196\", 0.3601], [\"198\", 0.3601], [\"201\", 0.12], [\"203\", 0.12], [\"205\", 0.12], [\"208\", 0.12], [\"210\", 0.12], [\"212\", 0.12], [\"215\", 0.12], [\"217\", 0.12]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"20400\", 0.12], [\"20500\", 0.12], [\"22000\", 1.0804], [\"22100\", 3.1212], [\"22200\", 3.3613], [\"22300\", 5.042], [\"22400\", 12.7251], [\"22500\", 7.2029], [\"22600\", 1.0804], [\"22700\", 0.8403], [\"22800\", 1.5606], [\"22900\", 2.1609], [\"23000\", 0.3601], [\"23100\", 0.9604], [\"23200\", 2.1609], [\"23300\", 3.8415], [\"23400\", 6.0024], [\"23500\", 7.563], [\"23600\", 5.1621], [\"23700\", 0.2401], [\"23800\", 0.12], [\"24000\", 0.12], [\"24200\", 0.4802], [\"24300\", 0.12], [\"24600\", 0.12], [\"24700\", 0.3601], [\"24800\", 2.1609], [\"24900\", 11.1645], [\"25000\", 11.1645], [\"25100\", 1.0804], [\"25300\", 0.3601], [\"25400\", 0.3601], [\"25500\", 0.4802], [\"25700\", 0.2401], [\"25800\", 0.12], [\"26600\", 0.12], [\"27900\", 0.12], [\"28300\", 0.12], [\"28400\", 0.3601], [\"28500\", 0.8403], [\"28600\", 0.12], [\"28700\", 0.12]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n return sorted(range(1, n + 1), key=str)\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().lexicalOrder(nums)).replace(\" \", \"\"), file=f)\nexit(0)\n","runtime":"42"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n arr=[]\n ind=0\n num=1\n for i in range(n):\n arr.append(num)\n if num*10<=n:\n num=num*10\n elif num+1<=n and num%10!=9:\n num+=1\n else:\n while (num//10)%10==9:\n num=num//10\n num=(num//10)+1\n return arr","runtime":"42"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n num = 1\n for _ in range(n):\n res.append(num)\n if num * 10 <= n:\n num *= 10\n else:\n while num % 10 == 9 or num + 1 > n:\n num //= 10\n num += 1\n return res\n","runtime":"44"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n v = 1\n ans = []\n for i in range(n):\n ans.append(v)\n if v * 10 <= n:\n v *= 10\n else:\n while v % 10 == 9 or v + 1 > n:\n v //= 10\n v += 1\n return ans","runtime":"46"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> list[int]:\n ans = []\n curr = 1\n\n while len(ans) < n:\n ans.append(curr)\n if curr * 10 <= n:\n curr *= 10\n else:\n while curr % 10 == 9 or curr == n:\n curr //= 10\n curr += 1\n\n return ans","runtime":"49"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n strs = []\n for x in range(1, n + 1):\n strs.append(str(x))\n return [int(s) for s in sorted(strs)]","runtime":"51"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n curr = 1\n\n\n while len(ans) < n:\n ans.append(curr)\n\n #go to next level\n if curr * 10 <= n:\n curr *= 10\n\n # go next in same level\n else:\n while curr % 10 == 9 or curr == n:\n curr //= 10\n\n curr += 1\n \n return ans","runtime":"53"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lexicographicalNumbers = []\n currentNumber = 1\n\n # Generate numbers from 1 to n\n for i in range(n):\n lexicographicalNumbers.append(currentNumber)\n\n # If multiplying the current number by 10 is within the limit, do it\n if currentNumber * 10 <= n:\n currentNumber *= 10\n else:\n # Adjust the current number by moving up one digit\n while currentNumber % 10 == 9 or currentNumber >= n:\n currentNumber //= 10 # Remove the last digit\n currentNumber += 1 # Increment the number\n\n return lexicographicalNumbers","runtime":"56"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = [i+1 for i in range(n)]\n\n return sorted(res,key=str)","runtime":"58"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lexicographical_numbers = []\n current_number = 1\n\n # Generate numbers from 1 to n\n for _ in range(n):\n lexicographical_numbers.append(current_number)\n\n # If multiplying the current number by 10 is within the limit, do it\n if current_number * 10 <= n:\n current_number *= 10\n else:\n # Adjust the current number by moving up one digit\n while current_number % 10 == 9 or current_number >= n:\n current_number //= 10 # Remove the last digit\n current_number += 1 # Increment the number\n\n return lexicographical_numbers","runtime":"58"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n num = 1\n for _ in range(n):\n res.append(num)\n if num * 10 <= n:\n num *= 10\n else:\n while num % 10 == 9 or num + 1 > n:\n num //= 10\n num += 1\n return res","runtime":"60"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n \n def DFS(num):\n if num != 0:\n ans.append(num)\n if num*10 <= n:\n DFS(num*10)\n \n if not num%10:\n for i in range(1, 10):\n if num + i <= n:\n DFS(num+i)\n\n\n DFS(0)\n\n return ans\n\n \n\n","runtime":"60"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res, cur = [],1\n for i in range(n):\n res.append(cur)\n if cur*10<=n:\n cur*=10\n else:\n if cur>=n:\n cur//=10\n cur +=1\n while cur%10 ==0:\n cur //=10\n return res","runtime":"63"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n # Define a DFS function that generates numbers in lexicographical order\n def dfs(curr):\n if curr > n:\n return\n result.append(curr)\n # Try to append digits 0-9 to the current number\n for i in range(10):\n next_num = curr * 10 + i\n if next_num > n:\n return\n dfs(next_num)\n \n # Start from numbers 1 to 9 and perform DFS\n for i in range(1, 10):\n if i > n:\n break\n dfs(i)\n \n return result\n ","runtime":"67"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n a=[]\n for i in range(1,n+1):\n a.append(i)\n a=list(map(str,a))\n a.sort()\n a=list(map(int,a))\n return a","runtime":"67"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n return sorted(range(1,n+1), key=str)","runtime":"70"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = [1]\n bases = []\n while len(res) < n:\n prenum = res[-1]\n if prenum * 10 <= n:\n res.append(prenum * 10)\n if prenum % 10 != 9:\n bases.append(prenum)\n elif prenum + 1 <= n and prenum % 10 != 9:\n res.append(prenum + 1)\n else:\n el = bases.pop()\n res.append(el+1)\n return res\n\n \n ","runtime":"70"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n numbers = [str(x) for x in list(range(1,n+1))] \n numbers.sort()\n numbers = [int(x) for x in numbers]\n #print(numbers)\n return numbers","runtime":"72"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n numbers = [str(i) for i in range(1, n+1)]\n numbers.sort()\n return [int(i) for i in numbers]","runtime":"72"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n return [int(j) for j in sorted([str(i) for i in range(1, n + 1)])]","runtime":"74"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n for i in range(1,n+1):\n ans.append(str(i))\n ans = [int(n) for n in sorted(ans)]\n return ans","runtime":"74"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(cur, n, result):\n if cur > n:\n return\n result.append(cur)\n for i in range(10):\n if 10 * cur + i > n:\n return\n dfs(10 * cur + i, n, result)\n\n result = []\n for i in range(1, 10):\n dfs(i, n, result)\n return result","runtime":"77"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n cur=1\n res=[]\n for i in range(n):\n res.append(cur)\n if cur*10<=n:\n cur*=10\n else:\n while (cur==n or cur%10==9):\n cur//=10\n cur+=1\n return res\n","runtime":"77"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n l=[]\n for i in range(1,n+1):\n l.append(str(i))\n l.sort()\n for i in range(len(l)):\n l[i]=int(l[i])\n print(l)\n return l","runtime":"79"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n l=[]\n for i in range(1,n+1):\n l.append(str(i))\n l.sort()\n for i in range(n):\n l[i]=int(l[i])\n return l","runtime":"79"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n l = []\n for i in range(1,n+1):\n l.append(str(i))\n l.sort()\n for i in range(n):\n l[i] = int(l[i])\n return l","runtime":"81"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n s=[]\n for i in range(1,n+1):\n s.append(str(i))\n s.sort()\n res=[]\n for i in s:\n res.append(int(i))\n return res\n ","runtime":"81"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lst=[]\n for i in range(1,n+1):\n lst.append(str(i))\n lst.sort()\n for j in range(len(lst)):\n lst[j]=int(lst[j])\n return lst","runtime":"84"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n \n def dfs(curr):\n if curr > n:\n return\n if curr != 0:\n res.append(curr)\n \n for i in range(10):\n next_num = curr * 10 + i\n if next_num > n:\n return\n dfs(next_num)\n \n for i in range(1, 10):\n dfs(i)\n \n return res","runtime":"84"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n for i in range(1, 10):\n self.helper(i, n, res)\n return res\n \n def helper(self, num, n, res):\n if num > n:\n return\n res.append(num)\n for i in range(10):\n cur = num * 10 + i\n if cur > n:\n break\n self.helper(cur, n, res)\n ","runtime":"86"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n def go_level(level,prefix_val):\n for digit in range(1 if level==0 else 0,10):\n v = prefix_val*10 + digit\n if v> n:\n return\n result.append(v)\n go_level(level+1, v)\n \n \n go_level(0,0)\n return result\n ","runtime":"86"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n nums = []\n for i in range(1, 10):\n self.dfs(i, n, nums)\n return nums\n\n def dfs(self, start: int, n: int, nums):\n if start > n:\n return\n nums.append(start)\n for i in range(0, 10):\n if start * 10 + i > n:\n return\n self.dfs(start * 10 + i, n, nums)\n ","runtime":"88"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n def backtrack(n, path):\n if path > n:\n return\n elif path > 0:\n res.append(path)\n \n for i in range(10):\n if (path * 10 + i > n):\n return\n elif path * 10 + i > path:\n backtrack(n, path * 10 + i)\n backtrack(n, 0)\n return res\n ","runtime":"88"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n def backtrack(n, path):\n if path > n:\n return\n elif path > 0:\n res.append(path)\n for i in range(10):\n if (path * 10 + i > n):\n return\n elif path * 10 + i > path:\n backtrack(n, path * 10 + i)\n backtrack(n, 0)\n return res\n ","runtime":"91"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n a=[]\n for i in range(1,n+1):\n a+=[str(i)]\n a.sort()\n answer=[]\n for x in a:\n answer+=[int(x)]\n return answer\n\n ","runtime":"91"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n self.n = n\n self.n_str = str(n)\n self.res = []\n self.dfs(\"\", 0)\n return self.res\n \n def dfs(self, cur, i):\n \"\"\"\n append numbers at i-th digit and starting from cur\n \"\"\"\n if i >= len(self.n_str):\n return\n if len(cur) == 0:\n min_num = 1\n else:\n min_num = 0\n for num in range(min_num, 10):\n new_cur = cur + str(num)\n if int(new_cur) > self.n:\n return\n self.res.append(int(new_cur))\n self.dfs(new_cur, i+1)","runtime":"93"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(current):\n if current > n:\n return\n result.append(current)\n for i in range(10):\n if 10 * current + i <= n:\n dfs(10 * current + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]\nprint(solution.lexicalOrder(2)) # Output: [1,2]","runtime":"95"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n def dfs(num):\n ans.append(num)\n\n for i in range(0, 10):\n if (n2 := 10 * num + i) <= n:\n dfs(n2)\n\n for i in range(1, 10):\n if i <= n:\n dfs(i)\n else:\n break\n\n return ans\n","runtime":"95"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n def dfs(curr):\n if curr > n:\n return\n result.append(curr)\n for i in range(10):\n if 10 * curr + i <= n:\n dfs(10 * curr + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result","runtime":"98"},{"code":"class Solution:\n ret = []\n\n def lo(self,v,n):\n print(v)\n vv = v\n for i in range(10):\n #print(vv,i)\n v = vv + str(i)\n ii = int(v)\n if ii <= n:\n self.ret.append(ii)\n #print(\" >>\", v, ii, self.ret)\n self.lo(v,n)\n\n def lo0(self,v,n):\n self.ret = []\n for i in range(1,10):\n v = str(i)\n #print(\"...\", v, i, self.ret)\n if i <= n:\n self.ret.append(i)\n #print(\" ++\", v, i, self.ret)\n self.lo(v,n)\n\n def loo(self,v,n):\n print(v)\n ba = v*10\n for i in range(10):\n #print(vv,i)\n v = ba+i\n if v <= n:\n self.ret.append(v)\n #print(\" >>\", v, ii, self.ret)\n self.loo(v,n)\n else:\n return\n \n def loo0(self,v,n):\n self.ret = []\n for i in range(1,10):\n if i <= n:\n self.ret.append(i)\n #print(\" ++\", v, i, self.ret)\n self.loo(i,n)\n def lexicalOrder(self, n: int) -> List[int]:\n self.loo0(\"\", n)\n return self.ret\n ","runtime":"100"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(num):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]\nprint(solution.lexicalOrder(2)) # Output: [1,2]","runtime":"100"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n def dfs(num):\n ans.append(num)\n\n for i in range(0, 10):\n n2 = 10 * num + i\n if (n2) <= n:\n dfs(n2)\n\n for i in range(1, 10):\n if i <= n:\n dfs(i)\n\n return ans\n\n ","runtime":"102"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(num, n, result):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i, n, result)\n\n result = []\n for i in range(1, 10):\n dfs(i, n, result)\n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(solution.lexicalOrder(2)) # Output: [1, 2]","runtime":"102"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(num, n, result):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i, n, result)\n \n result = []\n for i in range(1, 10):\n dfs(i, n, result)\n return result","runtime":"105"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(num, n, result):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i, n, result)\n \n result = []\n for i in range(1, 10):\n dfs(i, n, result)\n return result","runtime":"105"},{"code":"from collections import deque\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n if(n<=9):\n ans=[i for i in range(1,n+1)]\n return ans\n ans=[]\n for i in range(1,10):\n self.dfs(i,n,ans)\n return ans\n\n def dfs(self,num,n,ans):\n ans.append(num)\n for i in range(0,10):\n num1=num*10+i\n if(num1<=n):\n self.dfs(num1,n,ans)","runtime":"107"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(current):\n if current > n:\n return\n result.append(current)\n for i in range(10):\n if 10 * current + i <= n:\n dfs(10 * current + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(solution.lexicalOrder(2)) # Output: [1, 2]","runtime":"107"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(num):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(solution.lexicalOrder(2)) # Output: [1, 2]","runtime":"109"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(cur):\n if cur > n:\n return\n res.append(cur)\n for i in range(10):\n if 10 * cur + i <= n:\n dfs(10 * cur + i)\n\n for i in range(1, 10):\n dfs(i)\n\n return res\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(solution.lexicalOrder(2)) # Output: [1, 2]","runtime":"109"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(num):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(solution.lexicalOrder(2)) # Output: [1, 2]","runtime":"112"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(current):\n if current > n:\n return\n result.append(current)\n for i in range(10):\n if 10 * current + i <= n:\n dfs(10 * current + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return result","runtime":"112"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n \n def dfs(curr):\n if curr > n:\n return\n result.append(curr)\n for digit in range(10):\n if curr * 10 + digit <= n:\n dfs(curr * 10 + digit)\n \n for i in range(1, 10):\n dfs(i)\n \n return result\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(solution.lexicalOrder(2)) # Output: [1, 2]","runtime":"114"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n \n def dfs(num):\n if num > n:\n return\n res.append(num)\n for i in range(10):\n if 10 * num + i <= n:\n dfs(10 * num + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return res\n\n# Example usage:\nsolution = Solution()\nprint(solution.lexicalOrder(13)) # Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]\nprint(solution.lexicalOrder(2)) # Output: [1,2]","runtime":"114"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(n, curr):\n \n if curr > n:\n return\n\n if curr <= n:\n res.append(int(curr))\n elif curr > n:\n return\n \n for i in range(0,10):\n nxt = curr*10 + i\n if nxt > n:\n continue\n dfs(n, nxt)\n nxt = curr//10\n \n for i in range(1,10):\n dfs(n, i)\n return res\n\n","runtime":"116"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \"\"\"\n Using DFS\n - for each number for loop to explore 0 to 9\n - check if the number is less than n\n \n Time: O(n)\n Space: O(1)\n \"\"\"\n result = []\n \n def DFS(num):\n for i in range(10):\n new_num = num*10 + i\n if 0 < new_num <= n:\n result.append(new_num)\n DFS(new_num)\n # print(result)\n \n DFS(0)\n return result","runtime":"116"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n arr = []\n\n def dfs(current):\n if current <= n:\n arr.append(current)\n else:\n return\n\n for i in range(10):\n dfs(current*10 + i)\n \n for i in range(1, 10):\n dfs(i)\n return arr\n\n ","runtime":"119"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(n, curr):\n \n if curr <= n:\n res.append(int(curr))\n elif curr > n:\n return\n \n for i in range(0,10):\n nxt = curr*10 + i\n if nxt > n:\n continue\n dfs(n, nxt)\n nxt = curr//10\n \n for i in range(1,10):\n dfs(n, i)\n return res\n\n","runtime":"121"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n def dfs(num):\n ans.append(num)\n\n for i in range(0, 10):\n if (n2 := 10 * num + i) <= n:\n dfs(n2)\n\n for i in range(1, 10):\n if i <= n:\n dfs(i)\n\n return ans","runtime":"121"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(num, n, result):\n if num > n:\n return\n result.append(num)\n for i in range(10):\n if num * 10 + i <= n:\n dfs(num * 10 + i, n, result)\n\n result = []\n for i in range(1, 10):\n dfs(i, n, result)\n return result","runtime":"123"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n nums = []\n\n def dfs(curr):\n for i in range(10):\n if curr + i > n:\n break\n print(curr + i, n)\n nums.append(curr + i)\n dfs((curr + i)*10)\n \n dfs(1)\n return nums[:n]\n \n","runtime":"123"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n if not n:\n return res\n for i in range(1, 10):\n self.dfs(i, n, res)\n return res\n \n def dfs(self, num, n, res):\n if num > n:\n return\n res.append(num)\n for i in range(10):\n new_num = 10*num + i\n self.dfs(new_num, n, res)","runtime":"126"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res=[]\n\n def dfs(curr):\n if curr>n:\n return\n res.append(curr)\n for i in range(0,10):\n dfs(curr*10+i)\n \n\n for i in range(1,10):\n dfs(i)\n return res\n","runtime":"126"},{"code":"from collections import deque\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n if(n<=9):\n ans=[i for i in range(1,n+1)]\n return ans\n ans=[]\n for i in range(1,10):\n self.dfs(i,n,ans)\n return ans\n\n def dfs(self,num,n,ans):\n ans.append(num)\n for i in range(0,10):\n num1=num*10+i\n if(num1<=n):\n self.dfs(num1,n,ans)","runtime":"128"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n \n def helper(i):\n if i <= n:\n res.append(i)\n else:\n return\n for j in range(10):\n helper(i * 10 + j)\n \n\n\n\n for i in range(1,min(10,n + 1)):\n helper(i)\n \n return res","runtime":"128"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(current_number):\n if current_number > n:\n return\n res.append(current_number)\n\n for i in range(10):\n dfs(current_number*10 + i)\n \n for i in range(1, 10):\n dfs(i)\n \n return res\n \n ","runtime":"130"},{"code":"class Solution:\n def dfs(self,result,current,n):\n if current>n:\n return \n result.append(current)\n for i in range(10):\n ele=current*10+i\n # if ele>n:\n # break\n self.dfs(result,ele,n)\n def lexicalOrder(self, n: int) -> List[int]:\n result=[]\n for i in range(1,10):\n self.dfs(result,i,n)\n return result","runtime":"130"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n def dfs(curNum):\n nonlocal ans, n \n if curNum > n:\n return\n\n ans.append(curNum)\n\n for i in range(10):\n dfs(curNum*10 + i)\n\n [dfs(j) for j in range(1, 10)]\n\n return ans","runtime":"133"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n def dfs(x, res):\n if x > n:\n return\n res.append(x)\n for j in range(10):\n dfs(x * 10 + j, res)\n \n results = []\n for i in range(1, 10):\n dfs(i, results)\n return results\n","runtime":"133"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n def dfs(number):\n if number > n: return\n ans.append(number)\n for i in range(10): \n # if number * 10 + i > n: break \n dfs(number * 10 + i)\n \n for i in range(1, 10):\n dfs(i)\n return ans","runtime":"135"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n def dfs(x):\n nonlocal ans\n nonlocal n\n if x <= n:\n ans.append(x)\n else:\n return\n\n for i in range(10):\n dfs(x * 10 + i)\n \n for x in range(1, 10):\n dfs(x)\n\n return ans\n","runtime":"135"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n # Initialize an empty list to store the results\n result = []\n \n # Define a function to recursively add numbers to the result list\n def dfs(current):\n if current > n:\n return\n result.append(current)\n for i in range(10):\n dfs(current * 10 + i)\n \n # Start DFS from 1, as we don't want to include leading zeros\n for i in range(1, 10):\n dfs(i)\n \n return result","runtime":"138"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(x, res):\n if x > n:\n return\n res.append(x)\n for j in range(10):\n dfs(x * 10 + j, res)\n results = []\n for i in range(1, 10):\n dfs(i, results)\n return results","runtime":"138"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n arr = []\n\n def dfs(current):\n if current <= n:\n arr.append(current)\n else:\n return\n\n for i in range(10):\n dfs(current*10 + i)\n \n for i in range(1, 10):\n dfs(i)\n return arr","runtime":"140"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.word = False\n\nclass PrefixTree:\n\n def __init__(self):\n self.root = TrieNode()\n \n\n def insert(self, word: str) -> None:\n curr = self.root\n for c in word:\n if c not in curr.children:\n curr.children[c] = TrieNode()\n curr = curr.children[c]\n curr.word = True\n\n \n def _dfs(self, node, prefix, words):\n if node.word:\n words.append(int(prefix))\n for char, child_node in node.children.items():\n self._dfs(child_node, prefix + char, words)\n\n def get_all_words(self):\n words = []\n self._dfs(self.root, \"\", words)\n return words\n \n # def returnTree(self):\n # result = []\n # curr = self.root\n # for c in curr:\n # result.append(c)\n # return result\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n # nums = []\n new = PrefixTree()\n\n for num in range(n):\n # nums.append(n + 1)\n \n new.insert(str(num + 1))\n\n return new.get_all_words()\n\n\n\n \n\n ","runtime":"149"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n def backtrack(n, path):\n if path > n:\n return\n if path > 0:\n res.append(path)\n if path * 10 > 0:\n backtrack(n, path * 10)\n for i in range(1, 10):\n backtrack(n, path * 10 + i)\n backtrack(n, 0)\n return res\n ","runtime":"149"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.num = None\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def insert(self, num):\n node = self.root\n for w in num:\n if w not in node.children: node.children[w] = TrieNode()\n node = node.children[w]\n node.isEnd = True\n node.num = int(num)\n \n def search(self):\n self.res = []\n self.searchDfs(self.root)\n return self.res\n \n def searchDfs(self, node):\n if node.num:\n self.res.append(node.num)\n if not node: return\n\n for w, n in node.children.items(): self.searchDfs(n)\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n for i in range(1, n + 1): trie.insert(str(i))\n\n return trie.search()\n","runtime":"152"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(n, curr):\n \n if curr > n:\n return\n\n if curr <= n and curr != 0:\n res.append(int(curr))\n elif curr > n:\n return\n \n for i in range(0,10):\n nxt = curr*10 + i\n if nxt > n:\n continue\n dfs(n, nxt)\n nxt = curr//10\n \n for i in range(1,10):\n dfs(n, i)\n return res\n\n","runtime":"152"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.endOfWord = False\n \n def insert(self, word):\n cur = self\n\n for c in word:\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.endOfWord = True\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n self.trie = TrieNode()\n for i in range(1, n+1):\n self.trie.insert(str(i))\n \n def dfs(node, cur, result):\n if node.endOfWord:\n result.append(int(''.join(cur)))\n for key in node.children.keys():\n cur.append(key)\n dfs(node.children[key], cur, result)\n cur.pop()\n \n\n\n result = []\n dfs(self.trie, [], result)\n # print(result)\n\n return result\n","runtime":"154"},{"code":"class Trie:\n def __init__(self):\n self.children=defaultdict(Trie)\n self.isEnd=False\n def insert(self,word):\n for char in word:\n self=self.children[char]\n self.isEnd=True\n def temp(self):\n def dfs(root,depth,temp_str):\n nonlocal final_list\n if not root: return ''\n for ch in sorted(root.children):\n ns=temp_str+ch\n final_list.append(ns)\n dfs(root.children[ch],depth+1,str(ns))\n final_list=[]\n dfs(self,0,'')\n return final_list\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n tr=Trie()\n for i in range(1,n+1):\n tr.insert(str(i))\n fin=list(map(int,tr.temp()))\n return fin","runtime":"154"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n def dfs(curr, level):\n if not curr <= n:\n return\n \n if curr != 0:\n ans.append(curr)\n\n if level == 0:\n for d in range(1,10):\n dfs(curr*10 + d, level+1)\n else:\n for d in range(0,10):\n dfs(curr*10 + d, level+1)\n\n dfs(0, 0)\n return ans","runtime":"156"},{"code":"class Trie:\n def __init__(self):\n self.children=defaultdict(Trie)\n self.isEnd=False\n def insert(self,word):\n for char in word:\n self=self.children[char]\n self.isEnd=True\n def temp(self):\n def dfs(root,temp_str):\n nonlocal final_list\n if not root: return ''\n for ch in sorted(root.children):\n ns=temp_str+ch\n final_list.append(ns)\n dfs(root.children[ch],str(ns))\n final_list=[]\n dfs(self,'')\n return final_list\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n # return sorted(list(range(1,n+1)),key=str)\n tr=Trie()\n for i in range(1,n+1):\n tr.insert(str(i))\n fin=list(map(int,tr.temp()))\n return fin","runtime":"159"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.endOfWord = False\n \n def insert(self, word):\n cur = self\n\n for c in word:\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.endOfWord = True\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n self.trie = TrieNode()\n for i in range(1, n+1):\n self.trie.insert(str(i))\n \n def dfs(node, cur, result):\n if node.endOfWord:\n result.append(int(''.join(cur)))\n for key in node.children.keys():\n cur.append(key)\n dfs(node.children[key], cur, result)\n cur.pop()\n \n\n\n result = []\n dfs(self.trie, [], result)\n # print(result)\n\n return result\n","runtime":"159"},{"code":"class Solution:\n def dfs(self, number, result, limit, visited):\n if number <= limit and number not in visited:\n result.append(number)\n visited.add(number)\n if (number) < limit:\n for i in range(10):\n if int(number*10+i) <= limit:\n self.dfs(number*10+i, result, limit, visited)\n \n def lexicalOrder(self, n):\n result = []\n visited = set()\n for i in range(1,n+1):\n if len(str(i)) < len(str(n)):\n self.dfs(i, result, n, visited)\n elif i not in visited:\n result.append(i)\n return result","runtime":"161"},{"code":"class Trie:\n def __init__(self):\n self.children=defaultdict(Trie)\n self.isEnd=False\n def insert(self,word):\n for char in word:\n self=self.children[char]\n self.isEnd=True\n def temp(self):\n def dfs(root,temp_str):\n nonlocal final_list\n if not root: return ''\n for ch in sorted(root.children):\n ns=temp_str+ch\n final_list.append(ns)\n dfs(root.children[ch],str(ns))\n final_list=[]\n dfs(self,'')\n return final_list\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n tr=Trie()\n for i in range(1,n+1):\n tr.insert(str(i))\n fin=list(map(int,tr.temp()))\n return fin","runtime":"163"},{"code":"class LexicoInt:\n def __init__(self, x):\n self.x = x\n self.s = str(x)\n self.n = len(self.s)\n\n def __lt__(self, other):\n for c1, c2 in zip(self.s, other.s):\n if c1 < c2:\n return True\n elif c1 > c2:\n return False\n\n return self.n < other.n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lexico_ints = [LexicoInt(x) for x in range(1, n + 1)]\n return [li.x for li in sorted(lexico_ints)]","runtime":"166"},{"code":"class TrieNode:\n\n def __init__(self, character):\n self.character = character\n self.children = [False] * 10\n self.isEnd = False\n\nclass Solution:\n\n def addWords(self, root, word):\n if not root:\n return\n currNode = root\n for c in word:\n index = ord(c) - ord('0')\n if not currNode.children[index]:\n currNode.children[index] = TrieNode(c)\n currNode = currNode.children[index]\n currNode.isEnd = True\n \n\n\n def lexicalOrder(self, n: int) -> List[int]:\n self.root = TrieNode(\"\\0\")\n for i in range(1, n + 1):\n self.addWords(self.root, str(i))\n res = []\n\n subset = []\n def dfs(node):\n if not node:\n return\n if node.isEnd:\n res.append(int(\"\".join(subset)))\n # We do not return yet\n for child in node.children:\n if child:\n subset.append(child.character)\n dfs(child)\n subset.pop()\n return\n dfs(self.root)\n return res\n \n \n\n ","runtime":"168"},{"code":"class TrieNode:\n def __init__(self, ch='#'):\n self.ch = ch\n self.cd = {}\n self.end = False\n \nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n def add(self, num):\n cur = self.root\n for c in num:\n if c not in cur.cd:\n cur.cd[c] = TrieNode(c)\n cur = cur.cd[c]\n cur.end = True\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n for i in range(1, n + 1):\n trie.add(str(i))\n ans = []\n def helper(cur, num):\n if cur.end:\n ans.append(int(''.join(num)))\n for c, nex in cur.cd.items():\n helper(nex, num + [c])\n helper(trie.root, [])\n return ans\n ","runtime":"170"},{"code":"class TrieNode:\n def __init__(self) -> None:\n self.children = {}\n self.isEnd = False\n\nclass Trie:\n def __init__(self) -> None:\n self.root = TrieNode()\n\n def Add(self,n):\n currentNode = self.root\n word = str(n)\n for char in word:\n val = int(char)\n if val not in currentNode.children:\n currentNode.children[val] = TrieNode()\n currentNode = currentNode.children[val]\n currentNode.isEnd = True\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n for i in range(1,n+1):\n trie.Add(i)\n res = []\n def dfs(curNode,val):\n for i in list(sorted(curNode.children.keys())):\n if curNode.children[i].isEnd:\n res.append(val*10+i)\n if curNode.children[i].children:\n dfs(curNode.children[i],val*10+i)\n \n dfs(trie.root,0) \n return res","runtime":"173"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n def algo(d, pref):\n if d == 0:\n if len(pref) and pref[0] == \"0\":\n return\n if pref == \"\":\n return\n if int(pref) <= n:\n res.append(int(pref))\n return\n return\n if pref != \"\" and pref[0] != \"0\" and int(pref) <= n:\n res.append(int(pref))\n for i in range(10):\n algo(d-1, pref + str(i))\n \n digits = len(str(n))\n algo(digits, \"\")\n return res","runtime":"175"},{"code":"class Solution:\n def dfs(self, number, result, limit, visited):\n if int(number) <= limit and int(number) not in visited:\n result.append(int(number))\n visited.add(int(number))\n if len(number) < len(str(limit)):\n for i in range(10):\n if int(number+str(i)) <= limit:\n self.dfs(number+str(i), result, limit, visited)\n \n def lexicalOrder(self, n):\n result = []\n visited = set()\n for i in range(1,n+1):\n if len(str(i)) < len(str(n)):\n self.dfs(str(i), result, n, visited)\n elif i not in visited:\n result.append(i)\n return result","runtime":"177"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(curr: str):\n if curr and int(curr) <= n:\n output.append(int(curr))\n for num in digits:\n if 0 < int(curr + num) <= n:\n dfs(curr + num)\n\n digits = [str(num) for num in range(10)] # '0' to '9'\n output = []\n dfs(\"\")\n return output","runtime":"180"},{"code":"'''\nhttps://www.youtube.com/watch?v=gwLbRIgMRSc\n'''\nclass TrieNode:\n def __init__(self):\n self.child = {}\n \nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def insert(self, x):\n cur = self.root\n\n for i, c in enumerate(x):\n if x[:i+1] not in cur.child:\n cur.child[x[:i+1]] = TrieNode()\n cur = cur.child[x[:i+1]]\n \n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n root = Trie()\n \n for i in range(1, n + 1):\n root.insert(str(i))\n \n res = []\n\n def dfs(r):\n for x in r.child:\n res.append(int(x))\n dfs(r.child[x])\n \n dfs(root.root)\n\n return res\n ","runtime":"182"},{"code":"class Solution:\n def dfs(self, n, s,L):\n N = ['0','1','2','3','4','5','6','7','8','9']\n S=s\n for i in N:\n s = S+i\n if int(s)<=n and s[0]!=\"0\":\n L.append(int(s))\n self.dfs(n,s,L)\n return L\n def lexicalOrder(self, n: int) -> List[int]:\n return self.dfs(n,'',[])\n ","runtime":"184"},{"code":"class TrieNode:\n\n def __init__(self) -> None:\n self.children = [None] * 10\n\n\nclass NumbersTrie:\n\n def __init__(self) -> None:\n self.root = TrieNode()\n\n def insert(self, number: int, /) -> None:\n \"\"\"Insert a number into the trie.\"\"\"\n node = self.root\n for digit in map(int, str(number)):\n if not node.children[digit]:\n node.children[digit] = TrieNode()\n node = node.children[digit]\n\n # DFS pre-order traversal from left-to-right.\n def numbers(self) -> list[int]:\n \"\"\"Return all numbers in the trie.\"\"\"\n numbers = []\n nodes = []\n for number in range(9, -1, -1):\n if node := self.root.children[number]:\n nodes.append((node, number))\n while nodes:\n node, number = nodes.pop()\n numbers.append(number)\n for digit in range(9, -1, -1):\n if child := node.children[digit]:\n nodes.append((child, number*10 + digit))\n return numbers\n\n\nclass Solution:\n\n def lexicalOrder(self, n: int) -> List[int]:\n \"\"\"Return all numbers from 1..n in lexicographic order.\"\"\"\n trie = NumbersTrie()\n for number in range(1, n + 1):\n trie.insert(number)\n return trie.numbers()","runtime":"184"},{"code":"class TrieNode():\n def __init__(self):\n self.children = [None]*10\n self.number = None\n\nclass Trie():\n def __init__(self):\n self.root = TrieNode()\n \n def add(self, num):\n cur = self.root\n str_num = str(num)\n for d_ in str_num:\n d = int(d_)\n if cur.children[d] is None:\n cur.children[d] = TrieNode()\n cur = cur.children[d]\n cur.number = num\n \n def get_items(self, node, res):\n if not node:\n return\n \n if node.number is not None:\n res.append(node.number)\n \n for i in range(10):\n if node.children[i] is not None:\n self.get_items(node.children[i], res)\n \n return res\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n\n for j in range(1, n+1):\n trie.add(j)\n \n return trie.get_items(trie.root, [])\n\n ","runtime":"187"},{"code":"class Solution:\n def dfs(self, n, s,L):\n N = ['0','1','2','3','4','5','6','7','8','9']\n S=s\n for i in N:\n s = S+i\n if int(s)<=n and s[0]!=\"0\":\n L.append(int(s))\n self.dfs(n,s,L)\n return L\n def lexicalOrder(self, n: int) -> List[int]:\n return self.dfs(n,'',[])\n ","runtime":"189"},{"code":"class TrieNode:\n def __init__(self):\n self.child = {}\n \nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def insert(self,x):\n cur = self.root\n for i,c in enumerate(x):\n if x[:i+1] not in cur.child:\n cur.child[x[:i+1]] = TrieNode()\n cur = cur.child[x[:i+1]]\n \n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n root = Trie()\n \n for i in range(1,n+1):\n root.insert(str(i))\n \n res = []\n\n def dfs(r):\n for x in r.child:\n res.append(int(x))\n dfs(r.child[x])\n \n dfs(root.root)\n\n return res\n ","runtime":"191"},{"code":"class TrieNode:\n def __init__(self):\n self.children = [None] * 10 # mapping from 0 to 9\n self.eon = False # end of number\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n \n def insert(self, num):\n node = self.root\n \n for digit in num:\n n = int(digit)\n if node.children[n] is None:\n node.children[n] = TrieNode()\n node = node.children[n]\n \n if node: \n node.eon = True\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lex = Trie()\n\n for num in range(1, n+1):\n lex.insert(str(num))\n \n res = []\n\n def preorder(node, prev):\n if not node:\n return \n \n # curr\n if node.eon:\n res.append(prev)\n\n # instead of this being a binary tree\n # we have to iter across all it's avl children\n for i, child in enumerate(node.children):\n if child:\n preorder(child, prev + str(i))\n \n root = lex.root\n # passing the index of the sorted order to prev\n for i, child in enumerate(root.children):\n preorder(child, str(i))\n \n\n return list(map(int, res))","runtime":"194"},{"code":"class TrieNode:\n\n def __init__(self) -> None:\n self.children = [None] * 10\n\n\nclass Trie:\n\n def __init__(self) -> None:\n self.root = TrieNode()\n\n # Time complexity: O(d), where d=len(number).\n # Space complexity: O(d).\n def insert(self, number: int, /) -> None:\n \"\"\"Insert a number into the trie.\"\"\"\n node = self.root\n for digit in map(int, str(number)):\n if not node.children[digit]:\n node.children[digit] = TrieNode()\n node = node.children[digit]\n\n # Key idea: DFS pre-order traversal from left-to-right.\n # Time complexity: O(n).\n # Space complexity: O(h) = O(log n).\n def numbers(self) -> list[int]:\n \"\"\"Return all numbers in the trie.\"\"\"\n numbers = []\n nodes = []\n # Initialize stack with all single digit numbers at the root of the Trie.\n for number in range(9, -1, -1):\n if node := self.root.children[number]:\n nodes.append((node, number))\n\n # DFS pre-order traversal from left to right (because we store node children from 0..10).\n while nodes:\n node, number = nodes.pop()\n numbers.append(number)\n for digit in range(9, -1, -1):\n if child := node.children[digit]:\n nodes.append((child, number*10 + digit))\n return numbers\n\n\nclass Solution:\n\n # Problem type: Trie.\n def lexicalOrder(self, n: int) -> List[int]:\n \"\"\"Return all numbers from 1..n in lexicographic order.\"\"\"\n trie = Trie()\n for number in range(1, n + 1):\n trie.insert(number)\n return trie.numbers()","runtime":"196"},{"code":"class TrieNode:\n def __init__(self) -> None:\n self.children = {}\n self.isEnd = False\n\nclass Trie:\n def __init__(self) -> None:\n self.root = TrieNode()\n\n def Add(self,n):\n currentNode = self.root\n word = str(n)\n for char in word:\n val = int(char)\n if val not in currentNode.children:\n currentNode.children[val] = TrieNode()\n currentNode = currentNode.children[val]\n currentNode.isEnd = True\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n for i in range(1,n+1):\n trie.Add(i)\n res = []\n def dfs(curNode,val):\n for i in list(sorted(curNode.children.keys())):\n if curNode.children[i].isEnd:\n res.append(val*10+i)\n if curNode.children[i]:\n dfs(curNode.children[i],val*10+i)\n \n dfs(trie.root,0) \n return res","runtime":"196"},{"code":"class Node:\n\n def __init__(self):\n self.childs = [None] * 10\n self.is_end = False \n\n\nclass Trie:\n\n def __init__(self):\n self.root = self._get_node()\n\n def _get_node(self):\n return Node()\n\n def insert(self, val: int):\n\n curr = self.root\n for digit in str(val):\n digit = int(digit)\n\n if curr.childs[digit] is None:\n curr.childs[digit] = self._get_node()\n \n curr = curr.childs[digit]\n \n curr.is_end = True\n\n def dfs(self):\n output = []\n\n def _helper(root, curr):\n if root.is_end:\n output.append(int(\"\".join(curr)))\n \n for i, child in enumerate(root.childs):\n if child is not None:\n curr.append(str(i))\n _helper(child, curr)\n curr.pop()\n\n _helper(self.root, [])\n return output\n \n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n\n trie = Trie()\n for num in range(1, n + 1):\n trie.insert(num)\n \n return trie.dfs()\n \n","runtime":"198"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n\n def dfs(cur: str):\n num = int(cur)\n if num > n:\n return\n ans.append(num)\n for char in '0123456789':\n dfs(cur + char)\n \n for start in '123456789':\n dfs(start)\n \n return ans\n","runtime":"201"},{"code":"class TrieNode:\n def __init__(self):\n self.children = [None] * 10\n self.number = None\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, num):\n node = self.root\n for n in num:\n if node.children[int(n)] is None:\n node.children[int(n)] = TrieNode()\n node = node.children[int(n)]\n node.number = int(num)\n \n def number_lexi_order(self):\n def lexi(node):\n if not node: return None\n if node.number: result.append(node.number)\n for i in range(10):\n if node.children[i] is not None:\n lexi(node.children[i])\n result = []\n lexi(self.root)\n return result\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n\n for i in range(1,n+1):\n trie.insert(str(i))\n\n return trie.number_lexi_order()","runtime":"203"},{"code":"class Node:\n def __init__(self):\n self.children = {}\n\nclass Trie:\n def __init__(self):\n self.root = Node()\n\n def insert(self, number):\n node = self.root\n\n for n in number:\n if n not in node.children:\n node.children[n] = Node()\n node = node.children[n]\n\n def getAllNumbers(self, n):\n ans = []\n\n for i in range(1, min(n+1, 10)):\n node = self.root.children[str(i)]\n self.dfs(node, ans, [str(i)])\n\n return ans\n\n\n def dfs(self, node, ans, num):\n ans.append(int(''.join(num)))\n\n for i in range(10):\n if str(i) not in node.children:\n continue\n num.append(str(i))\n self.dfs(node.children[str(i)], ans, num)\n num.pop()\n\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = Trie()\n\n for i in range(1, n+1):\n trie.insert(str(i))\n\n return trie.getAllNumbers(n)\n ","runtime":"205"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(cur):\n nonlocal res\n \n for i in range(10):\n t = int(cur + str(i))\n if t > 0 and t <= n:\n res.append(t)\n dfs(str(t))\n\n dfs(\"\")\n return res","runtime":"208"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.end = False\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = TrieNode()\n for i in range(1, n+1):\n cur = trie\n for c in str(i):\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.end = True\n\n cur = trie\n res = []\n \n def dfs(node, s):\n if node.end:\n res.append(int(\"\".join(s)))\n # return\n for i in range(10):\n c = str(i)\n if c in node.children:\n # print(c)\n dfs(node.children[c], s + [c])\n \n dfs(cur, [])\n return res\n \n\n\n\n\n ","runtime":"210"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.end = False\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = TrieNode()\n for i in range(1, n+1):\n cur = trie\n for c in str(i):\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.end = True\n\n cur = trie\n res = []\n \n def dfs(node, s):\n if node.end:\n res.append(int(\"\".join(s)))\n for i in range(10):\n c = str(i)\n if c in node.children:\n dfs(node.children[c], s + [c])\n dfs(cur, [])\n return res\n \n\n\n\n\n ","runtime":"212"},{"code":"from collections import defaultdict\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n TERMINATOR = \"*\"\n Tree = lambda : defaultdict(Tree)\n\n trie = Tree()\n\n for num in range(1,n+1):\n node = trie\n for d in str(num):\n node = node[int(d)]\n node[TERMINATOR]\n \n result = []\n def dfs(node,path):\n if TERMINATOR in node:\n result.append(Solution.digits2str(path))\n \n for i in range(10):\n if i in node:\n dfs(node[i],path+[i])\n \n for i in range(1,10):\n if i in trie:\n dfs(trie[i],[i])\n \n return result\n \n @staticmethod\n def digits2str(digits:List[int])->int: \n result = 0\n for d in digits:\n result *= 10\n result += d\n return result\n","runtime":"215"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def dfs(res, prev): \n for i in range(10): \n if int(prev+str(i))<=n: \n res.append(int(prev+str(i)))\n dfs(res, prev+str(i))\n return\n # curr = int(prev[:-1]+str(int(prev[-1])+1))\n # if (curr)<=n:\n # res.append(curr)\n # dfs(res, str(curr))\n # else: \n # return\n for i in range(1, 10): \n if i<=n: \n res.append(i)\n prev = str(i) \n dfs(res, prev)\n return res","runtime":"217"}],"string":"[\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n return sorted(range(1, n + 1), key=str)\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().lexicalOrder(nums)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\\n\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n arr=[]\\n ind=0\\n num=1\\n for i in range(n):\\n arr.append(num)\\n if num*10<=n:\\n num=num*10\\n elif num+1<=n and num%10!=9:\\n num+=1\\n else:\\n while (num//10)%10==9:\\n num=num//10\\n num=(num//10)+1\\n return arr\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n num = 1\\n for _ in range(n):\\n res.append(num)\\n if num * 10 <= n:\\n num *= 10\\n else:\\n while num % 10 == 9 or num + 1 > n:\\n num //= 10\\n num += 1\\n return res\\n\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n v = 1\\n ans = []\\n for i in range(n):\\n ans.append(v)\\n if v * 10 <= n:\\n v *= 10\\n else:\\n while v % 10 == 9 or v + 1 > n:\\n v //= 10\\n v += 1\\n return ans\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> list[int]:\\n ans = []\\n curr = 1\\n\\n while len(ans) < n:\\n ans.append(curr)\\n if curr * 10 <= n:\\n curr *= 10\\n else:\\n while curr % 10 == 9 or curr == n:\\n curr //= 10\\n curr += 1\\n\\n return ans\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n strs = []\\n for x in range(1, n + 1):\\n strs.append(str(x))\\n return [int(s) for s in sorted(strs)]\",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n curr = 1\\n\\n\\n while len(ans) < n:\\n ans.append(curr)\\n\\n #go to next level\\n if curr * 10 <= n:\\n curr *= 10\\n\\n # go next in same level\\n else:\\n while curr % 10 == 9 or curr == n:\\n curr //= 10\\n\\n curr += 1\\n \\n return ans\",\n \"runtime\": \"53\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lexicographicalNumbers = []\\n currentNumber = 1\\n\\n # Generate numbers from 1 to n\\n for i in range(n):\\n lexicographicalNumbers.append(currentNumber)\\n\\n # If multiplying the current number by 10 is within the limit, do it\\n if currentNumber * 10 <= n:\\n currentNumber *= 10\\n else:\\n # Adjust the current number by moving up one digit\\n while currentNumber % 10 == 9 or currentNumber >= n:\\n currentNumber //= 10 # Remove the last digit\\n currentNumber += 1 # Increment the number\\n\\n return lexicographicalNumbers\",\n \"runtime\": \"56\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = [i+1 for i in range(n)]\\n\\n return sorted(res,key=str)\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lexicographical_numbers = []\\n current_number = 1\\n\\n # Generate numbers from 1 to n\\n for _ in range(n):\\n lexicographical_numbers.append(current_number)\\n\\n # If multiplying the current number by 10 is within the limit, do it\\n if current_number * 10 <= n:\\n current_number *= 10\\n else:\\n # Adjust the current number by moving up one digit\\n while current_number % 10 == 9 or current_number >= n:\\n current_number //= 10 # Remove the last digit\\n current_number += 1 # Increment the number\\n\\n return lexicographical_numbers\",\n \"runtime\": \"58\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n num = 1\\n for _ in range(n):\\n res.append(num)\\n if num * 10 <= n:\\n num *= 10\\n else:\\n while num % 10 == 9 or num + 1 > n:\\n num //= 10\\n num += 1\\n return res\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n \\n def DFS(num):\\n if num != 0:\\n ans.append(num)\\n if num*10 <= n:\\n DFS(num*10)\\n \\n if not num%10:\\n for i in range(1, 10):\\n if num + i <= n:\\n DFS(num+i)\\n\\n\\n DFS(0)\\n\\n return ans\\n\\n \\n\\n\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res, cur = [],1\\n for i in range(n):\\n res.append(cur)\\n if cur*10<=n:\\n cur*=10\\n else:\\n if cur>=n:\\n cur//=10\\n cur +=1\\n while cur%10 ==0:\\n cur //=10\\n return res\",\n \"runtime\": \"63\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n # Define a DFS function that generates numbers in lexicographical order\\n def dfs(curr):\\n if curr > n:\\n return\\n result.append(curr)\\n # Try to append digits 0-9 to the current number\\n for i in range(10):\\n next_num = curr * 10 + i\\n if next_num > n:\\n return\\n dfs(next_num)\\n \\n # Start from numbers 1 to 9 and perform DFS\\n for i in range(1, 10):\\n if i > n:\\n break\\n dfs(i)\\n \\n return result\\n \",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n a=[]\\n for i in range(1,n+1):\\n a.append(i)\\n a=list(map(str,a))\\n a.sort()\\n a=list(map(int,a))\\n return a\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n return sorted(range(1,n+1), key=str)\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = [1]\\n bases = []\\n while len(res) < n:\\n prenum = res[-1]\\n if prenum * 10 <= n:\\n res.append(prenum * 10)\\n if prenum % 10 != 9:\\n bases.append(prenum)\\n elif prenum + 1 <= n and prenum % 10 != 9:\\n res.append(prenum + 1)\\n else:\\n el = bases.pop()\\n res.append(el+1)\\n return res\\n\\n \\n \",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n numbers = [str(x) for x in list(range(1,n+1))] \\n numbers.sort()\\n numbers = [int(x) for x in numbers]\\n #print(numbers)\\n return numbers\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n numbers = [str(i) for i in range(1, n+1)]\\n numbers.sort()\\n return [int(i) for i in numbers]\",\n \"runtime\": \"72\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n return [int(j) for j in sorted([str(i) for i in range(1, n + 1)])]\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n for i in range(1,n+1):\\n ans.append(str(i))\\n ans = [int(n) for n in sorted(ans)]\\n return ans\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(cur, n, result):\\n if cur > n:\\n return\\n result.append(cur)\\n for i in range(10):\\n if 10 * cur + i > n:\\n return\\n dfs(10 * cur + i, n, result)\\n\\n result = []\\n for i in range(1, 10):\\n dfs(i, n, result)\\n return result\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n cur=1\\n res=[]\\n for i in range(n):\\n res.append(cur)\\n if cur*10<=n:\\n cur*=10\\n else:\\n while (cur==n or cur%10==9):\\n cur//=10\\n cur+=1\\n return res\\n\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n l=[]\\n for i in range(1,n+1):\\n l.append(str(i))\\n l.sort()\\n for i in range(len(l)):\\n l[i]=int(l[i])\\n print(l)\\n return l\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n l=[]\\n for i in range(1,n+1):\\n l.append(str(i))\\n l.sort()\\n for i in range(n):\\n l[i]=int(l[i])\\n return l\",\n \"runtime\": \"79\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n l = []\\n for i in range(1,n+1):\\n l.append(str(i))\\n l.sort()\\n for i in range(n):\\n l[i] = int(l[i])\\n return l\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n s=[]\\n for i in range(1,n+1):\\n s.append(str(i))\\n s.sort()\\n res=[]\\n for i in s:\\n res.append(int(i))\\n return res\\n \",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lst=[]\\n for i in range(1,n+1):\\n lst.append(str(i))\\n lst.sort()\\n for j in range(len(lst)):\\n lst[j]=int(lst[j])\\n return lst\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n \\n def dfs(curr):\\n if curr > n:\\n return\\n if curr != 0:\\n res.append(curr)\\n \\n for i in range(10):\\n next_num = curr * 10 + i\\n if next_num > n:\\n return\\n dfs(next_num)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return res\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n for i in range(1, 10):\\n self.helper(i, n, res)\\n return res\\n \\n def helper(self, num, n, res):\\n if num > n:\\n return\\n res.append(num)\\n for i in range(10):\\n cur = num * 10 + i\\n if cur > n:\\n break\\n self.helper(cur, n, res)\\n \",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n def go_level(level,prefix_val):\\n for digit in range(1 if level==0 else 0,10):\\n v = prefix_val*10 + digit\\n if v> n:\\n return\\n result.append(v)\\n go_level(level+1, v)\\n \\n \\n go_level(0,0)\\n return result\\n \",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n nums = []\\n for i in range(1, 10):\\n self.dfs(i, n, nums)\\n return nums\\n\\n def dfs(self, start: int, n: int, nums):\\n if start > n:\\n return\\n nums.append(start)\\n for i in range(0, 10):\\n if start * 10 + i > n:\\n return\\n self.dfs(start * 10 + i, n, nums)\\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n def backtrack(n, path):\\n if path > n:\\n return\\n elif path > 0:\\n res.append(path)\\n \\n for i in range(10):\\n if (path * 10 + i > n):\\n return\\n elif path * 10 + i > path:\\n backtrack(n, path * 10 + i)\\n backtrack(n, 0)\\n return res\\n \",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n def backtrack(n, path):\\n if path > n:\\n return\\n elif path > 0:\\n res.append(path)\\n for i in range(10):\\n if (path * 10 + i > n):\\n return\\n elif path * 10 + i > path:\\n backtrack(n, path * 10 + i)\\n backtrack(n, 0)\\n return res\\n \",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n a=[]\\n for i in range(1,n+1):\\n a+=[str(i)]\\n a.sort()\\n answer=[]\\n for x in a:\\n answer+=[int(x)]\\n return answer\\n\\n \",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n self.n = n\\n self.n_str = str(n)\\n self.res = []\\n self.dfs(\\\"\\\", 0)\\n return self.res\\n \\n def dfs(self, cur, i):\\n \\\"\\\"\\\"\\n append numbers at i-th digit and starting from cur\\n \\\"\\\"\\\"\\n if i >= len(self.n_str):\\n return\\n if len(cur) == 0:\\n min_num = 1\\n else:\\n min_num = 0\\n for num in range(min_num, 10):\\n new_cur = cur + str(num)\\n if int(new_cur) > self.n:\\n return\\n self.res.append(int(new_cur))\\n self.dfs(new_cur, i+1)\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(current):\\n if current > n:\\n return\\n result.append(current)\\n for i in range(10):\\n if 10 * current + i <= n:\\n dfs(10 * current + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]\\nprint(solution.lexicalOrder(2)) # Output: [1,2]\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n def dfs(num):\\n ans.append(num)\\n\\n for i in range(0, 10):\\n if (n2 := 10 * num + i) <= n:\\n dfs(n2)\\n\\n for i in range(1, 10):\\n if i <= n:\\n dfs(i)\\n else:\\n break\\n\\n return ans\\n\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n def dfs(curr):\\n if curr > n:\\n return\\n result.append(curr)\\n for i in range(10):\\n if 10 * curr + i <= n:\\n dfs(10 * curr + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n ret = []\\n\\n def lo(self,v,n):\\n print(v)\\n vv = v\\n for i in range(10):\\n #print(vv,i)\\n v = vv + str(i)\\n ii = int(v)\\n if ii <= n:\\n self.ret.append(ii)\\n #print(\\\" >>\\\", v, ii, self.ret)\\n self.lo(v,n)\\n\\n def lo0(self,v,n):\\n self.ret = []\\n for i in range(1,10):\\n v = str(i)\\n #print(\\\"...\\\", v, i, self.ret)\\n if i <= n:\\n self.ret.append(i)\\n #print(\\\" ++\\\", v, i, self.ret)\\n self.lo(v,n)\\n\\n def loo(self,v,n):\\n print(v)\\n ba = v*10\\n for i in range(10):\\n #print(vv,i)\\n v = ba+i\\n if v <= n:\\n self.ret.append(v)\\n #print(\\\" >>\\\", v, ii, self.ret)\\n self.loo(v,n)\\n else:\\n return\\n \\n def loo0(self,v,n):\\n self.ret = []\\n for i in range(1,10):\\n if i <= n:\\n self.ret.append(i)\\n #print(\\\" ++\\\", v, i, self.ret)\\n self.loo(i,n)\\n def lexicalOrder(self, n: int) -> List[int]:\\n self.loo0(\\\"\\\", n)\\n return self.ret\\n \",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(num):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]\\nprint(solution.lexicalOrder(2)) # Output: [1,2]\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n def dfs(num):\\n ans.append(num)\\n\\n for i in range(0, 10):\\n n2 = 10 * num + i\\n if (n2) <= n:\\n dfs(n2)\\n\\n for i in range(1, 10):\\n if i <= n:\\n dfs(i)\\n\\n return ans\\n\\n \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(num, n, result):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i, n, result)\\n\\n result = []\\n for i in range(1, 10):\\n dfs(i, n, result)\\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\\nprint(solution.lexicalOrder(2)) # Output: [1, 2]\",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(num, n, result):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i, n, result)\\n \\n result = []\\n for i in range(1, 10):\\n dfs(i, n, result)\\n return result\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(num, n, result):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i, n, result)\\n \\n result = []\\n for i in range(1, 10):\\n dfs(i, n, result)\\n return result\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n if(n<=9):\\n ans=[i for i in range(1,n+1)]\\n return ans\\n ans=[]\\n for i in range(1,10):\\n self.dfs(i,n,ans)\\n return ans\\n\\n def dfs(self,num,n,ans):\\n ans.append(num)\\n for i in range(0,10):\\n num1=num*10+i\\n if(num1<=n):\\n self.dfs(num1,n,ans)\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(current):\\n if current > n:\\n return\\n result.append(current)\\n for i in range(10):\\n if 10 * current + i <= n:\\n dfs(10 * current + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\\nprint(solution.lexicalOrder(2)) # Output: [1, 2]\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(num):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\\nprint(solution.lexicalOrder(2)) # Output: [1, 2]\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(cur):\\n if cur > n:\\n return\\n res.append(cur)\\n for i in range(10):\\n if 10 * cur + i <= n:\\n dfs(10 * cur + i)\\n\\n for i in range(1, 10):\\n dfs(i)\\n\\n return res\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\\nprint(solution.lexicalOrder(2)) # Output: [1, 2]\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(num):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\\nprint(solution.lexicalOrder(2)) # Output: [1, 2]\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(current):\\n if current > n:\\n return\\n result.append(current)\\n for i in range(10):\\n if 10 * current + i <= n:\\n dfs(10 * current + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n \\n def dfs(curr):\\n if curr > n:\\n return\\n result.append(curr)\\n for digit in range(10):\\n if curr * 10 + digit <= n:\\n dfs(curr * 10 + digit)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]\\nprint(solution.lexicalOrder(2)) # Output: [1, 2]\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n \\n def dfs(num):\\n if num > n:\\n return\\n res.append(num)\\n for i in range(10):\\n if 10 * num + i <= n:\\n dfs(10 * num + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return res\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lexicalOrder(13)) # Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]\\nprint(solution.lexicalOrder(2)) # Output: [1,2]\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(n, curr):\\n \\n if curr > n:\\n return\\n\\n if curr <= n:\\n res.append(int(curr))\\n elif curr > n:\\n return\\n \\n for i in range(0,10):\\n nxt = curr*10 + i\\n if nxt > n:\\n continue\\n dfs(n, nxt)\\n nxt = curr//10\\n \\n for i in range(1,10):\\n dfs(n, i)\\n return res\\n\\n\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n Using DFS\\n - for each number for loop to explore 0 to 9\\n - check if the number is less than n\\n \\n Time: O(n)\\n Space: O(1)\\n \\\"\\\"\\\"\\n result = []\\n \\n def DFS(num):\\n for i in range(10):\\n new_num = num*10 + i\\n if 0 < new_num <= n:\\n result.append(new_num)\\n DFS(new_num)\\n # print(result)\\n \\n DFS(0)\\n return result\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n arr = []\\n\\n def dfs(current):\\n if current <= n:\\n arr.append(current)\\n else:\\n return\\n\\n for i in range(10):\\n dfs(current*10 + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n return arr\\n\\n \",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(n, curr):\\n \\n if curr <= n:\\n res.append(int(curr))\\n elif curr > n:\\n return\\n \\n for i in range(0,10):\\n nxt = curr*10 + i\\n if nxt > n:\\n continue\\n dfs(n, nxt)\\n nxt = curr//10\\n \\n for i in range(1,10):\\n dfs(n, i)\\n return res\\n\\n\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n def dfs(num):\\n ans.append(num)\\n\\n for i in range(0, 10):\\n if (n2 := 10 * num + i) <= n:\\n dfs(n2)\\n\\n for i in range(1, 10):\\n if i <= n:\\n dfs(i)\\n\\n return ans\",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(num, n, result):\\n if num > n:\\n return\\n result.append(num)\\n for i in range(10):\\n if num * 10 + i <= n:\\n dfs(num * 10 + i, n, result)\\n\\n result = []\\n for i in range(1, 10):\\n dfs(i, n, result)\\n return result\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n nums = []\\n\\n def dfs(curr):\\n for i in range(10):\\n if curr + i > n:\\n break\\n print(curr + i, n)\\n nums.append(curr + i)\\n dfs((curr + i)*10)\\n \\n dfs(1)\\n return nums[:n]\\n \\n\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n if not n:\\n return res\\n for i in range(1, 10):\\n self.dfs(i, n, res)\\n return res\\n \\n def dfs(self, num, n, res):\\n if num > n:\\n return\\n res.append(num)\\n for i in range(10):\\n new_num = 10*num + i\\n self.dfs(new_num, n, res)\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res=[]\\n\\n def dfs(curr):\\n if curr>n:\\n return\\n res.append(curr)\\n for i in range(0,10):\\n dfs(curr*10+i)\\n \\n\\n for i in range(1,10):\\n dfs(i)\\n return res\\n\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n if(n<=9):\\n ans=[i for i in range(1,n+1)]\\n return ans\\n ans=[]\\n for i in range(1,10):\\n self.dfs(i,n,ans)\\n return ans\\n\\n def dfs(self,num,n,ans):\\n ans.append(num)\\n for i in range(0,10):\\n num1=num*10+i\\n if(num1<=n):\\n self.dfs(num1,n,ans)\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n \\n def helper(i):\\n if i <= n:\\n res.append(i)\\n else:\\n return\\n for j in range(10):\\n helper(i * 10 + j)\\n \\n\\n\\n\\n for i in range(1,min(10,n + 1)):\\n helper(i)\\n \\n return res\",\n \"runtime\": \"128\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(current_number):\\n if current_number > n:\\n return\\n res.append(current_number)\\n\\n for i in range(10):\\n dfs(current_number*10 + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n \\n return res\\n \\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self,result,current,n):\\n if current>n:\\n return \\n result.append(current)\\n for i in range(10):\\n ele=current*10+i\\n # if ele>n:\\n # break\\n self.dfs(result,ele,n)\\n def lexicalOrder(self, n: int) -> List[int]:\\n result=[]\\n for i in range(1,10):\\n self.dfs(result,i,n)\\n return result\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n def dfs(curNum):\\n nonlocal ans, n \\n if curNum > n:\\n return\\n\\n ans.append(curNum)\\n\\n for i in range(10):\\n dfs(curNum*10 + i)\\n\\n [dfs(j) for j in range(1, 10)]\\n\\n return ans\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n def dfs(x, res):\\n if x > n:\\n return\\n res.append(x)\\n for j in range(10):\\n dfs(x * 10 + j, res)\\n \\n results = []\\n for i in range(1, 10):\\n dfs(i, results)\\n return results\\n\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n def dfs(number):\\n if number > n: return\\n ans.append(number)\\n for i in range(10): \\n # if number * 10 + i > n: break \\n dfs(number * 10 + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n return ans\",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n def dfs(x):\\n nonlocal ans\\n nonlocal n\\n if x <= n:\\n ans.append(x)\\n else:\\n return\\n\\n for i in range(10):\\n dfs(x * 10 + i)\\n \\n for x in range(1, 10):\\n dfs(x)\\n\\n return ans\\n\",\n \"runtime\": \"135\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n # Initialize an empty list to store the results\\n result = []\\n \\n # Define a function to recursively add numbers to the result list\\n def dfs(current):\\n if current > n:\\n return\\n result.append(current)\\n for i in range(10):\\n dfs(current * 10 + i)\\n \\n # Start DFS from 1, as we don't want to include leading zeros\\n for i in range(1, 10):\\n dfs(i)\\n \\n return result\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(x, res):\\n if x > n:\\n return\\n res.append(x)\\n for j in range(10):\\n dfs(x * 10 + j, res)\\n results = []\\n for i in range(1, 10):\\n dfs(i, results)\\n return results\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n arr = []\\n\\n def dfs(current):\\n if current <= n:\\n arr.append(current)\\n else:\\n return\\n\\n for i in range(10):\\n dfs(current*10 + i)\\n \\n for i in range(1, 10):\\n dfs(i)\\n return arr\",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.word = False\\n\\nclass PrefixTree:\\n\\n def __init__(self):\\n self.root = TrieNode()\\n \\n\\n def insert(self, word: str) -> None:\\n curr = self.root\\n for c in word:\\n if c not in curr.children:\\n curr.children[c] = TrieNode()\\n curr = curr.children[c]\\n curr.word = True\\n\\n \\n def _dfs(self, node, prefix, words):\\n if node.word:\\n words.append(int(prefix))\\n for char, child_node in node.children.items():\\n self._dfs(child_node, prefix + char, words)\\n\\n def get_all_words(self):\\n words = []\\n self._dfs(self.root, \\\"\\\", words)\\n return words\\n \\n # def returnTree(self):\\n # result = []\\n # curr = self.root\\n # for c in curr:\\n # result.append(c)\\n # return result\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n # nums = []\\n new = PrefixTree()\\n\\n for num in range(n):\\n # nums.append(n + 1)\\n \\n new.insert(str(num + 1))\\n\\n return new.get_all_words()\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n def backtrack(n, path):\\n if path > n:\\n return\\n if path > 0:\\n res.append(path)\\n if path * 10 > 0:\\n backtrack(n, path * 10)\\n for i in range(1, 10):\\n backtrack(n, path * 10 + i)\\n backtrack(n, 0)\\n return res\\n \",\n \"runtime\": \"149\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.num = None\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def insert(self, num):\\n node = self.root\\n for w in num:\\n if w not in node.children: node.children[w] = TrieNode()\\n node = node.children[w]\\n node.isEnd = True\\n node.num = int(num)\\n \\n def search(self):\\n self.res = []\\n self.searchDfs(self.root)\\n return self.res\\n \\n def searchDfs(self, node):\\n if node.num:\\n self.res.append(node.num)\\n if not node: return\\n\\n for w, n in node.children.items(): self.searchDfs(n)\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n for i in range(1, n + 1): trie.insert(str(i))\\n\\n return trie.search()\\n\",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(n, curr):\\n \\n if curr > n:\\n return\\n\\n if curr <= n and curr != 0:\\n res.append(int(curr))\\n elif curr > n:\\n return\\n \\n for i in range(0,10):\\n nxt = curr*10 + i\\n if nxt > n:\\n continue\\n dfs(n, nxt)\\n nxt = curr//10\\n \\n for i in range(1,10):\\n dfs(n, i)\\n return res\\n\\n\",\n \"runtime\": \"152\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.endOfWord = False\\n \\n def insert(self, word):\\n cur = self\\n\\n for c in word:\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.endOfWord = True\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n self.trie = TrieNode()\\n for i in range(1, n+1):\\n self.trie.insert(str(i))\\n \\n def dfs(node, cur, result):\\n if node.endOfWord:\\n result.append(int(''.join(cur)))\\n for key in node.children.keys():\\n cur.append(key)\\n dfs(node.children[key], cur, result)\\n cur.pop()\\n \\n\\n\\n result = []\\n dfs(self.trie, [], result)\\n # print(result)\\n\\n return result\\n\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n self.children=defaultdict(Trie)\\n self.isEnd=False\\n def insert(self,word):\\n for char in word:\\n self=self.children[char]\\n self.isEnd=True\\n def temp(self):\\n def dfs(root,depth,temp_str):\\n nonlocal final_list\\n if not root: return ''\\n for ch in sorted(root.children):\\n ns=temp_str+ch\\n final_list.append(ns)\\n dfs(root.children[ch],depth+1,str(ns))\\n final_list=[]\\n dfs(self,0,'')\\n return final_list\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n tr=Trie()\\n for i in range(1,n+1):\\n tr.insert(str(i))\\n fin=list(map(int,tr.temp()))\\n return fin\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n def dfs(curr, level):\\n if not curr <= n:\\n return\\n \\n if curr != 0:\\n ans.append(curr)\\n\\n if level == 0:\\n for d in range(1,10):\\n dfs(curr*10 + d, level+1)\\n else:\\n for d in range(0,10):\\n dfs(curr*10 + d, level+1)\\n\\n dfs(0, 0)\\n return ans\",\n \"runtime\": \"156\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n self.children=defaultdict(Trie)\\n self.isEnd=False\\n def insert(self,word):\\n for char in word:\\n self=self.children[char]\\n self.isEnd=True\\n def temp(self):\\n def dfs(root,temp_str):\\n nonlocal final_list\\n if not root: return ''\\n for ch in sorted(root.children):\\n ns=temp_str+ch\\n final_list.append(ns)\\n dfs(root.children[ch],str(ns))\\n final_list=[]\\n dfs(self,'')\\n return final_list\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n # return sorted(list(range(1,n+1)),key=str)\\n tr=Trie()\\n for i in range(1,n+1):\\n tr.insert(str(i))\\n fin=list(map(int,tr.temp()))\\n return fin\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.endOfWord = False\\n \\n def insert(self, word):\\n cur = self\\n\\n for c in word:\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.endOfWord = True\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n self.trie = TrieNode()\\n for i in range(1, n+1):\\n self.trie.insert(str(i))\\n \\n def dfs(node, cur, result):\\n if node.endOfWord:\\n result.append(int(''.join(cur)))\\n for key in node.children.keys():\\n cur.append(key)\\n dfs(node.children[key], cur, result)\\n cur.pop()\\n \\n\\n\\n result = []\\n dfs(self.trie, [], result)\\n # print(result)\\n\\n return result\\n\",\n \"runtime\": \"159\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, number, result, limit, visited):\\n if number <= limit and number not in visited:\\n result.append(number)\\n visited.add(number)\\n if (number) < limit:\\n for i in range(10):\\n if int(number*10+i) <= limit:\\n self.dfs(number*10+i, result, limit, visited)\\n \\n def lexicalOrder(self, n):\\n result = []\\n visited = set()\\n for i in range(1,n+1):\\n if len(str(i)) < len(str(n)):\\n self.dfs(i, result, n, visited)\\n elif i not in visited:\\n result.append(i)\\n return result\",\n \"runtime\": \"161\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n self.children=defaultdict(Trie)\\n self.isEnd=False\\n def insert(self,word):\\n for char in word:\\n self=self.children[char]\\n self.isEnd=True\\n def temp(self):\\n def dfs(root,temp_str):\\n nonlocal final_list\\n if not root: return ''\\n for ch in sorted(root.children):\\n ns=temp_str+ch\\n final_list.append(ns)\\n dfs(root.children[ch],str(ns))\\n final_list=[]\\n dfs(self,'')\\n return final_list\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n tr=Trie()\\n for i in range(1,n+1):\\n tr.insert(str(i))\\n fin=list(map(int,tr.temp()))\\n return fin\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class LexicoInt:\\n def __init__(self, x):\\n self.x = x\\n self.s = str(x)\\n self.n = len(self.s)\\n\\n def __lt__(self, other):\\n for c1, c2 in zip(self.s, other.s):\\n if c1 < c2:\\n return True\\n elif c1 > c2:\\n return False\\n\\n return self.n < other.n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lexico_ints = [LexicoInt(x) for x in range(1, n + 1)]\\n return [li.x for li in sorted(lexico_ints)]\",\n \"runtime\": \"166\"\n },\n {\n \"code\": \"class TrieNode:\\n\\n def __init__(self, character):\\n self.character = character\\n self.children = [False] * 10\\n self.isEnd = False\\n\\nclass Solution:\\n\\n def addWords(self, root, word):\\n if not root:\\n return\\n currNode = root\\n for c in word:\\n index = ord(c) - ord('0')\\n if not currNode.children[index]:\\n currNode.children[index] = TrieNode(c)\\n currNode = currNode.children[index]\\n currNode.isEnd = True\\n \\n\\n\\n def lexicalOrder(self, n: int) -> List[int]:\\n self.root = TrieNode(\\\"\\\\0\\\")\\n for i in range(1, n + 1):\\n self.addWords(self.root, str(i))\\n res = []\\n\\n subset = []\\n def dfs(node):\\n if not node:\\n return\\n if node.isEnd:\\n res.append(int(\\\"\\\".join(subset)))\\n # We do not return yet\\n for child in node.children:\\n if child:\\n subset.append(child.character)\\n dfs(child)\\n subset.pop()\\n return\\n dfs(self.root)\\n return res\\n \\n \\n\\n \",\n \"runtime\": \"168\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self, ch='#'):\\n self.ch = ch\\n self.cd = {}\\n self.end = False\\n \\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n def add(self, num):\\n cur = self.root\\n for c in num:\\n if c not in cur.cd:\\n cur.cd[c] = TrieNode(c)\\n cur = cur.cd[c]\\n cur.end = True\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n for i in range(1, n + 1):\\n trie.add(str(i))\\n ans = []\\n def helper(cur, num):\\n if cur.end:\\n ans.append(int(''.join(num)))\\n for c, nex in cur.cd.items():\\n helper(nex, num + [c])\\n helper(trie.root, [])\\n return ans\\n \",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self) -> None:\\n self.children = {}\\n self.isEnd = False\\n\\nclass Trie:\\n def __init__(self) -> None:\\n self.root = TrieNode()\\n\\n def Add(self,n):\\n currentNode = self.root\\n word = str(n)\\n for char in word:\\n val = int(char)\\n if val not in currentNode.children:\\n currentNode.children[val] = TrieNode()\\n currentNode = currentNode.children[val]\\n currentNode.isEnd = True\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n for i in range(1,n+1):\\n trie.Add(i)\\n res = []\\n def dfs(curNode,val):\\n for i in list(sorted(curNode.children.keys())):\\n if curNode.children[i].isEnd:\\n res.append(val*10+i)\\n if curNode.children[i].children:\\n dfs(curNode.children[i],val*10+i)\\n \\n dfs(trie.root,0) \\n return res\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n def algo(d, pref):\\n if d == 0:\\n if len(pref) and pref[0] == \\\"0\\\":\\n return\\n if pref == \\\"\\\":\\n return\\n if int(pref) <= n:\\n res.append(int(pref))\\n return\\n return\\n if pref != \\\"\\\" and pref[0] != \\\"0\\\" and int(pref) <= n:\\n res.append(int(pref))\\n for i in range(10):\\n algo(d-1, pref + str(i))\\n \\n digits = len(str(n))\\n algo(digits, \\\"\\\")\\n return res\",\n \"runtime\": \"175\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, number, result, limit, visited):\\n if int(number) <= limit and int(number) not in visited:\\n result.append(int(number))\\n visited.add(int(number))\\n if len(number) < len(str(limit)):\\n for i in range(10):\\n if int(number+str(i)) <= limit:\\n self.dfs(number+str(i), result, limit, visited)\\n \\n def lexicalOrder(self, n):\\n result = []\\n visited = set()\\n for i in range(1,n+1):\\n if len(str(i)) < len(str(n)):\\n self.dfs(str(i), result, n, visited)\\n elif i not in visited:\\n result.append(i)\\n return result\",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(curr: str):\\n if curr and int(curr) <= n:\\n output.append(int(curr))\\n for num in digits:\\n if 0 < int(curr + num) <= n:\\n dfs(curr + num)\\n\\n digits = [str(num) for num in range(10)] # '0' to '9'\\n output = []\\n dfs(\\\"\\\")\\n return output\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"'''\\nhttps://www.youtube.com/watch?v=gwLbRIgMRSc\\n'''\\nclass TrieNode:\\n def __init__(self):\\n self.child = {}\\n \\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def insert(self, x):\\n cur = self.root\\n\\n for i, c in enumerate(x):\\n if x[:i+1] not in cur.child:\\n cur.child[x[:i+1]] = TrieNode()\\n cur = cur.child[x[:i+1]]\\n \\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n root = Trie()\\n \\n for i in range(1, n + 1):\\n root.insert(str(i))\\n \\n res = []\\n\\n def dfs(r):\\n for x in r.child:\\n res.append(int(x))\\n dfs(r.child[x])\\n \\n dfs(root.root)\\n\\n return res\\n \",\n \"runtime\": \"182\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, n, s,L):\\n N = ['0','1','2','3','4','5','6','7','8','9']\\n S=s\\n for i in N:\\n s = S+i\\n if int(s)<=n and s[0]!=\\\"0\\\":\\n L.append(int(s))\\n self.dfs(n,s,L)\\n return L\\n def lexicalOrder(self, n: int) -> List[int]:\\n return self.dfs(n,'',[])\\n \",\n \"runtime\": \"184\"\n },\n {\n \"code\": \"class TrieNode:\\n\\n def __init__(self) -> None:\\n self.children = [None] * 10\\n\\n\\nclass NumbersTrie:\\n\\n def __init__(self) -> None:\\n self.root = TrieNode()\\n\\n def insert(self, number: int, /) -> None:\\n \\\"\\\"\\\"Insert a number into the trie.\\\"\\\"\\\"\\n node = self.root\\n for digit in map(int, str(number)):\\n if not node.children[digit]:\\n node.children[digit] = TrieNode()\\n node = node.children[digit]\\n\\n # DFS pre-order traversal from left-to-right.\\n def numbers(self) -> list[int]:\\n \\\"\\\"\\\"Return all numbers in the trie.\\\"\\\"\\\"\\n numbers = []\\n nodes = []\\n for number in range(9, -1, -1):\\n if node := self.root.children[number]:\\n nodes.append((node, number))\\n while nodes:\\n node, number = nodes.pop()\\n numbers.append(number)\\n for digit in range(9, -1, -1):\\n if child := node.children[digit]:\\n nodes.append((child, number*10 + digit))\\n return numbers\\n\\n\\nclass Solution:\\n\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\\"\\\"\\\"Return all numbers from 1..n in lexicographic order.\\\"\\\"\\\"\\n trie = NumbersTrie()\\n for number in range(1, n + 1):\\n trie.insert(number)\\n return trie.numbers()\",\n \"runtime\": \"184\"\n },\n {\n \"code\": \"class TrieNode():\\n def __init__(self):\\n self.children = [None]*10\\n self.number = None\\n\\nclass Trie():\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def add(self, num):\\n cur = self.root\\n str_num = str(num)\\n for d_ in str_num:\\n d = int(d_)\\n if cur.children[d] is None:\\n cur.children[d] = TrieNode()\\n cur = cur.children[d]\\n cur.number = num\\n \\n def get_items(self, node, res):\\n if not node:\\n return\\n \\n if node.number is not None:\\n res.append(node.number)\\n \\n for i in range(10):\\n if node.children[i] is not None:\\n self.get_items(node.children[i], res)\\n \\n return res\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n\\n for j in range(1, n+1):\\n trie.add(j)\\n \\n return trie.get_items(trie.root, [])\\n\\n \",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, n, s,L):\\n N = ['0','1','2','3','4','5','6','7','8','9']\\n S=s\\n for i in N:\\n s = S+i\\n if int(s)<=n and s[0]!=\\\"0\\\":\\n L.append(int(s))\\n self.dfs(n,s,L)\\n return L\\n def lexicalOrder(self, n: int) -> List[int]:\\n return self.dfs(n,'',[])\\n \",\n \"runtime\": \"189\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.child = {}\\n \\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def insert(self,x):\\n cur = self.root\\n for i,c in enumerate(x):\\n if x[:i+1] not in cur.child:\\n cur.child[x[:i+1]] = TrieNode()\\n cur = cur.child[x[:i+1]]\\n \\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n root = Trie()\\n \\n for i in range(1,n+1):\\n root.insert(str(i))\\n \\n res = []\\n\\n def dfs(r):\\n for x in r.child:\\n res.append(int(x))\\n dfs(r.child[x])\\n \\n dfs(root.root)\\n\\n return res\\n \",\n \"runtime\": \"191\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = [None] * 10 # mapping from 0 to 9\\n self.eon = False # end of number\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n \\n def insert(self, num):\\n node = self.root\\n \\n for digit in num:\\n n = int(digit)\\n if node.children[n] is None:\\n node.children[n] = TrieNode()\\n node = node.children[n]\\n \\n if node: \\n node.eon = True\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lex = Trie()\\n\\n for num in range(1, n+1):\\n lex.insert(str(num))\\n \\n res = []\\n\\n def preorder(node, prev):\\n if not node:\\n return \\n \\n # curr\\n if node.eon:\\n res.append(prev)\\n\\n # instead of this being a binary tree\\n # we have to iter across all it's avl children\\n for i, child in enumerate(node.children):\\n if child:\\n preorder(child, prev + str(i))\\n \\n root = lex.root\\n # passing the index of the sorted order to prev\\n for i, child in enumerate(root.children):\\n preorder(child, str(i))\\n \\n\\n return list(map(int, res))\",\n \"runtime\": \"194\"\n },\n {\n \"code\": \"class TrieNode:\\n\\n def __init__(self) -> None:\\n self.children = [None] * 10\\n\\n\\nclass Trie:\\n\\n def __init__(self) -> None:\\n self.root = TrieNode()\\n\\n # Time complexity: O(d), where d=len(number).\\n # Space complexity: O(d).\\n def insert(self, number: int, /) -> None:\\n \\\"\\\"\\\"Insert a number into the trie.\\\"\\\"\\\"\\n node = self.root\\n for digit in map(int, str(number)):\\n if not node.children[digit]:\\n node.children[digit] = TrieNode()\\n node = node.children[digit]\\n\\n # Key idea: DFS pre-order traversal from left-to-right.\\n # Time complexity: O(n).\\n # Space complexity: O(h) = O(log n).\\n def numbers(self) -> list[int]:\\n \\\"\\\"\\\"Return all numbers in the trie.\\\"\\\"\\\"\\n numbers = []\\n nodes = []\\n # Initialize stack with all single digit numbers at the root of the Trie.\\n for number in range(9, -1, -1):\\n if node := self.root.children[number]:\\n nodes.append((node, number))\\n\\n # DFS pre-order traversal from left to right (because we store node children from 0..10).\\n while nodes:\\n node, number = nodes.pop()\\n numbers.append(number)\\n for digit in range(9, -1, -1):\\n if child := node.children[digit]:\\n nodes.append((child, number*10 + digit))\\n return numbers\\n\\n\\nclass Solution:\\n\\n # Problem type: Trie.\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\\"\\\"\\\"Return all numbers from 1..n in lexicographic order.\\\"\\\"\\\"\\n trie = Trie()\\n for number in range(1, n + 1):\\n trie.insert(number)\\n return trie.numbers()\",\n \"runtime\": \"196\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self) -> None:\\n self.children = {}\\n self.isEnd = False\\n\\nclass Trie:\\n def __init__(self) -> None:\\n self.root = TrieNode()\\n\\n def Add(self,n):\\n currentNode = self.root\\n word = str(n)\\n for char in word:\\n val = int(char)\\n if val not in currentNode.children:\\n currentNode.children[val] = TrieNode()\\n currentNode = currentNode.children[val]\\n currentNode.isEnd = True\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n for i in range(1,n+1):\\n trie.Add(i)\\n res = []\\n def dfs(curNode,val):\\n for i in list(sorted(curNode.children.keys())):\\n if curNode.children[i].isEnd:\\n res.append(val*10+i)\\n if curNode.children[i]:\\n dfs(curNode.children[i],val*10+i)\\n \\n dfs(trie.root,0) \\n return res\",\n \"runtime\": \"196\"\n },\n {\n \"code\": \"class Node:\\n\\n def __init__(self):\\n self.childs = [None] * 10\\n self.is_end = False \\n\\n\\nclass Trie:\\n\\n def __init__(self):\\n self.root = self._get_node()\\n\\n def _get_node(self):\\n return Node()\\n\\n def insert(self, val: int):\\n\\n curr = self.root\\n for digit in str(val):\\n digit = int(digit)\\n\\n if curr.childs[digit] is None:\\n curr.childs[digit] = self._get_node()\\n \\n curr = curr.childs[digit]\\n \\n curr.is_end = True\\n\\n def dfs(self):\\n output = []\\n\\n def _helper(root, curr):\\n if root.is_end:\\n output.append(int(\\\"\\\".join(curr)))\\n \\n for i, child in enumerate(root.childs):\\n if child is not None:\\n curr.append(str(i))\\n _helper(child, curr)\\n curr.pop()\\n\\n _helper(self.root, [])\\n return output\\n \\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n\\n trie = Trie()\\n for num in range(1, n + 1):\\n trie.insert(num)\\n \\n return trie.dfs()\\n \\n\",\n \"runtime\": \"198\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n\\n def dfs(cur: str):\\n num = int(cur)\\n if num > n:\\n return\\n ans.append(num)\\n for char in '0123456789':\\n dfs(cur + char)\\n \\n for start in '123456789':\\n dfs(start)\\n \\n return ans\\n\",\n \"runtime\": \"201\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = [None] * 10\\n self.number = None\\n\\nclass Trie:\\n def __init__(self):\\n self.root = TrieNode()\\n\\n def insert(self, num):\\n node = self.root\\n for n in num:\\n if node.children[int(n)] is None:\\n node.children[int(n)] = TrieNode()\\n node = node.children[int(n)]\\n node.number = int(num)\\n \\n def number_lexi_order(self):\\n def lexi(node):\\n if not node: return None\\n if node.number: result.append(node.number)\\n for i in range(10):\\n if node.children[i] is not None:\\n lexi(node.children[i])\\n result = []\\n lexi(self.root)\\n return result\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n\\n for i in range(1,n+1):\\n trie.insert(str(i))\\n\\n return trie.number_lexi_order()\",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Node:\\n def __init__(self):\\n self.children = {}\\n\\nclass Trie:\\n def __init__(self):\\n self.root = Node()\\n\\n def insert(self, number):\\n node = self.root\\n\\n for n in number:\\n if n not in node.children:\\n node.children[n] = Node()\\n node = node.children[n]\\n\\n def getAllNumbers(self, n):\\n ans = []\\n\\n for i in range(1, min(n+1, 10)):\\n node = self.root.children[str(i)]\\n self.dfs(node, ans, [str(i)])\\n\\n return ans\\n\\n\\n def dfs(self, node, ans, num):\\n ans.append(int(''.join(num)))\\n\\n for i in range(10):\\n if str(i) not in node.children:\\n continue\\n num.append(str(i))\\n self.dfs(node.children[str(i)], ans, num)\\n num.pop()\\n\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = Trie()\\n\\n for i in range(1, n+1):\\n trie.insert(str(i))\\n\\n return trie.getAllNumbers(n)\\n \",\n \"runtime\": \"205\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(cur):\\n nonlocal res\\n \\n for i in range(10):\\n t = int(cur + str(i))\\n if t > 0 and t <= n:\\n res.append(t)\\n dfs(str(t))\\n\\n dfs(\\\"\\\")\\n return res\",\n \"runtime\": \"208\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.end = False\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = TrieNode()\\n for i in range(1, n+1):\\n cur = trie\\n for c in str(i):\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.end = True\\n\\n cur = trie\\n res = []\\n \\n def dfs(node, s):\\n if node.end:\\n res.append(int(\\\"\\\".join(s)))\\n # return\\n for i in range(10):\\n c = str(i)\\n if c in node.children:\\n # print(c)\\n dfs(node.children[c], s + [c])\\n \\n dfs(cur, [])\\n return res\\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.end = False\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = TrieNode()\\n for i in range(1, n+1):\\n cur = trie\\n for c in str(i):\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.end = True\\n\\n cur = trie\\n res = []\\n \\n def dfs(node, s):\\n if node.end:\\n res.append(int(\\\"\\\".join(s)))\\n for i in range(10):\\n c = str(i)\\n if c in node.children:\\n dfs(node.children[c], s + [c])\\n dfs(cur, [])\\n return res\\n \\n\\n\\n\\n\\n \",\n \"runtime\": \"212\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n TERMINATOR = \\\"*\\\"\\n Tree = lambda : defaultdict(Tree)\\n\\n trie = Tree()\\n\\n for num in range(1,n+1):\\n node = trie\\n for d in str(num):\\n node = node[int(d)]\\n node[TERMINATOR]\\n \\n result = []\\n def dfs(node,path):\\n if TERMINATOR in node:\\n result.append(Solution.digits2str(path))\\n \\n for i in range(10):\\n if i in node:\\n dfs(node[i],path+[i])\\n \\n for i in range(1,10):\\n if i in trie:\\n dfs(trie[i],[i])\\n \\n return result\\n \\n @staticmethod\\n def digits2str(digits:List[int])->int: \\n result = 0\\n for d in digits:\\n result *= 10\\n result += d\\n return result\\n\",\n \"runtime\": \"215\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def dfs(res, prev): \\n for i in range(10): \\n if int(prev+str(i))<=n: \\n res.append(int(prev+str(i)))\\n dfs(res, prev+str(i))\\n return\\n # curr = int(prev[:-1]+str(int(prev[-1])+1))\\n # if (curr)<=n:\\n # res.append(curr)\\n # dfs(res, str(curr))\\n # else: \\n # return\\n for i in range(1, 10): \\n if i<=n: \\n res.append(i)\\n prev = str(i) \\n dfs(res, prev)\\n return res\",\n \"runtime\": \"217\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":109,"string":"109"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n results = []\n \n def bkt(n: int, k: int, current: int):\n start = int(k == 0)\n for i in range(start, 10):\n if current * 10 + i <= n:\n yield current * 10 + i\n yield from bkt(n, k + 1, current * 10 + i)\n else:\n return\n return bkt(n, 0, 0)\n # return results\n","memory":"20400"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def bkt(n: int, k: int, current: int):\n start = int(k == 0)\n for i in range(start, 10):\n if current * 10 + i <= n:\n yield current * 10 + i\n yield from bkt(n, k + 1, current * 10 + i)\n else:\n return\n \n return bkt(n, 0, 0)\n \n","memory":"20500"},{"code":"from collections import deque\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n if(n<=9):\n ans=[i for i in range(1,n+1)]\n return ans\n ans=[]\n for i in range(1,10):\n self.dfs(i,n,ans)\n return ans\n\n def dfs(self,num,n,ans):\n ans.append(num)\n for i in range(0,10):\n num1=num*10+i\n if(num1<=n):\n self.dfs(num1,n,ans)","memory":"22000"},{"code":"from collections import deque\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n if(n<=9):\n ans=[i for i in range(1,n+1)]\n return ans\n ans=[]\n for i in range(1,10):\n self.dfs(i,n,ans)\n return ans\n\n def dfs(self,num,n,ans):\n ans.append(num)\n for i in range(0,10):\n num1=num*10+i\n if(num1<=n):\n self.dfs(num1,n,ans)","memory":"22000"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n cur=1\n res=[]\n for i in range(n):\n res.append(cur)\n if cur*10<=n:\n cur*=10\n else:\n while (cur==n or cur%10==9):\n cur//=10\n cur+=1\n return res\n","memory":"22100"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n l=[]\n for i in range(1,n+1):\n l.append(str(i))\n l.sort()\n for i in range(len(l)):\n l[i]=int(l[i])\n print(l)\n return l","memory":"22200"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n curr = 1\n for x in range(0,n):\n res.append(curr)\n if curr * 10 <= n:\n curr *= 10\n else:\n while (curr % 10) == 9 or curr == n:\n curr = curr // 10\n curr += 1\n return res\n\n\n \n","memory":"22200"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(x, res):\n if x > n:\n return\n res.append(x)\n for j in range(10):\n dfs(x * 10 + j, res)\n results = []\n for i in range(1, 10):\n dfs(i, results)\n return results","memory":"22300"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lst=[]\n for i in range(1,n+1):\n lst.append(str(i))\n lst.sort()\n for j in range(len(lst)):\n lst[j]=int(lst[j])\n return lst","memory":"22300"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> list[int]:\n ans = []\n curr = 1\n\n while len(ans) < n:\n ans.append(curr)\n if curr * 10 <= n:\n curr *= 10\n else:\n while curr % 10 == 9 or curr == n:\n curr //= 10\n curr += 1\n\n return ans","memory":"22400"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n lexicographical_numbers = []\n current_number = 1\n\n # Generate numbers from 1 to n\n for _ in range(n):\n lexicographical_numbers.append(current_number)\n\n # If multiplying the current number by 10 is within the limit, do it\n if current_number * 10 <= n:\n current_number *= 10\n else:\n # Adjust the current number by moving up one digit\n while current_number % 10 == 9 or current_number >= n:\n current_number //= 10 # Remove the last digit\n current_number += 1 # Increment the number\n\n return lexicographical_numbers","memory":"22400"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n x = 1\n\n for _ in range(n):\n res.append(x)\n if x * 10 <= n:\n x *= 10\n else:\n if x >= n:\n x //= 10\n x += 1\n while x % 10 == 0:\n x //= 10\n \n return res","memory":"22500"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n num = 1\n for _ in range(n):\n result.append(num)\n if num * 10 <= n:\n num *= 10\n else:\n while num % 10 == 9 or num + 1 > n:\n num //= 10\n num += 1\n return result","memory":"22500"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = [0] * n\n num = 1\n for i in range(n):\n ans[i] = num\n if num * 10 <= n:\n num *= 10\n else:\n while num % 10 == 9 or num + 1 > n:\n num //= 10\n num += 1\n return ans ","memory":"22600"},{"code":"class Solution:\n def lexicalOrder(self, n):\n fn = lambda a, b: 1 if str(a) > str(b) else -1\n return sorted([i for i in range(1, n+1)], key=cmp_to_key(fn))","memory":"22700"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n numlist = []\n for i in range(1, n + 1):\n numlist.append(i)\n numlist.sort(key=lambda x: str(x))\n return numlist\n\n ","memory":"22800"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n return sorted(range(1,n+1), key=str)","memory":"22900"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n cur = 1\n res = []\n\n for _ in range(n):\n res.append(cur)\n print(\"cur 1 = \", cur)\n\n if cur * 10 <= n:\n cur *= 10\n else:\n if cur == n:\n # print(\"cur 2 = \", cur)\n cur //= 10\n\n cur += 1\n \n while cur % 10 == 0:\n cur //= 10\n return res\n\n ","memory":"23000"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = [i+1 for i in range(n)]\n\n return sorted(res,key=str)","memory":"23100"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n return [int(j) for j in sorted([str(i) for i in range(1, n + 1)])]","memory":"23200"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n x = [str(x) for x in range(1, n + 1)]\n x.sort()\n return [int(i) for i in x]","memory":"23300"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n numbers = [str(i) for i in range(1, n+1)]\n numbers.sort()\n return [int(i) for i in numbers]","memory":"23400"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n numbers = [str(x) for x in list(range(1,n+1))] \n numbers.sort()\n numbers = [int(x) for x in numbers]\n #print(numbers)\n return numbers","memory":"23400"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n for i in range(1,n+1):\n ans.append(str(i))\n ans = [int(n) for n in sorted(ans)]\n return ans","memory":"23500"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n numbers_str = [str(x+1) for x in range(n)]\n out_list = [int(x) for x in sorted(numbers_str, key=str)]\n return out_list","memory":"24000"},{"code":"class Solution:\n def __init__(self) -> None:\n self.trie = {}\n self.node = \"\"\n self.lexicalOrderList = []\n def insert_derivative(self, word: str) -> None:\n current_node = self.trie\n for char in word:\n if char in current_node:\n pass\n else:\n current_node[char] = {}\n current_node = current_node[char]\n def depth_first_search(self, current_node: dict) -> None:\n for k, v in current_node.items():\n self.node += str(k)\n self.lexicalOrderList.append(int(self.node))\n if v == {}:\n self.node = self.node[:-1] # backtrack\n else:\n current_node = v # go to the next level\n self.depth_first_search(current_node) # traverse through all nodes at the next level\n self.node = self.node[:-1] # after traversing the current level, backtrack to its parent level\n def lexicalOrder(self, n: int) -> List[int]:\n \"\"\"\n thought:\n - our goal is to sort integers from 1 to n in lexicographical order.\n - lexicographical order means sorting numbers digit by digit, such as: 1, 10, 11, ..., 100, ..., 2, ...\n - we can use a Trie data structure to store the integers digit by digit and apply a Depth-First Search (DFS) algorithm to ensure the result is in lexicographical order.\n - the steps for Depth-First Search (DFS) are recursive, and the core concept is as follows:\n # Core concept: Go as deep as possible before backtracking. This means we should keep digging deeper until we reach the bottom of the Trie.\n # Steps:\n 1. Use a for loop to traverse through the Trie.\n - If we cannot go deeper (i.e., we've reached the bottom of the Trie), record the value and backtrack to the parent node.\n - If we can go deeper, record the value and call the function recursively to explore further down the Trie.\n 2. After completing each for loop, we have traversed all nodes at the current sub-level of the Trie. We then backtrack to the parent node to start another recursive loop.\n - the steps to achieve this are:\n (1) Build a Trie to store the integers from 1 to n.\n (2) Use recursion to perform Depth-First Search (DFS): traverse the Trie deeply first, then broadly, and append the results to the answer list.\n (3) Return the answer list.\n \"\"\"\n # build Trie\n for i in range(1, n+1):\n self.insert_derivative(str(i)) \n # use recursion to perform Depth-First Search (DFS)\n current_node = self.trie\n self.depth_first_search(current_node)\n return self.lexicalOrderList","memory":"24200"},{"code":"class Solution:\n def __init__(self) -> None:\n self.trie = {}\n self.node = \"\"\n self.lexicalOrderList = []\n def insert_derivative(self, word: str) -> None:\n current_node = self.trie\n for char in word:\n if char in current_node:\n pass\n else:\n current_node[char] = {}\n current_node = current_node[char]\n def depth_first_search(self, current_node: dict) -> None:\n for k, v in current_node.items():\n self.node += str(k)\n self.lexicalOrderList.append(int(self.node))\n if v == {}:\n self.node = self.node[:-1] # backtrack\n else:\n current_node = v # go to the next level\n self.depth_first_search(current_node) # traverse through all nodes at the next level\n self.node = self.node[:-1] # after traversing the current level, backtrack to its parent level\n def lexicalOrder(self, n: int) -> List[int]:\n \"\"\"\n thought:\n - our goal is to sort integers from 1 to n in lexicographical order.\n - lexicographical order means sorting numbers digit by digit, such as: 1, 10, 11, ..., 100, ..., 2, ...\n - we can use a Trie data structure to store the integers digit by digit and apply a Depth-First Search (DFS) algorithm to ensure the result is in lexicographical order.\n - the steps for Depth-First Search (DFS) are recursive, and the core concept is as follows:\n # Core concept: Go as deep as possible before backtracking. This means we should keep digging deeper until we reach the bottom of the Trie.\n # Steps:\n 1. Use a for loop to traverse through the Trie.\n - If we cannot go deeper (i.e., we've reached the bottom of the Trie), record the value and backtrack to the parent node.\n - If we can go deeper, record the value and call the function recursively to explore further down the Trie.\n 2. After completing each for loop, we have traversed all nodes at the current sub-level of the Trie. We then backtrack to the parent node to start another recursive loop.\n - the steps to achieve this are:\n (1) Build a Trie to store the integers from 1 to n.\n (2) Use recursion to perform Depth-First Search (DFS): traverse the Trie deeply first, then broadly, and append the results to the answer list.\n (3) Return the answer list.\n \"\"\"\n # build Trie\n for i in range(1, n+1):\n self.insert_derivative(str(i)) \n # use recursion to perform Depth-First Search (DFS)\n current_node = self.trie\n self.depth_first_search(current_node)\n return self.lexicalOrderList","memory":"24200"},{"code":"class Solution:\n def dfs(self, number, result, limit, visited):\n if number <= limit and number not in visited:\n result.append(number)\n visited.add(number)\n for i in range(10):\n if int(number*10+i) <= limit:\n self.dfs(number*10+i, result, limit, visited)\n \n def lexicalOrder(self, n):\n result = []\n visited = set()\n for i in range(1,n+1):\n if len(str(i)) < len(str(n)):\n self.dfs(i, result, n, visited)\n elif i not in visited:\n result.append(i)\n return result","memory":"24300"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n\n def traverse(current):\n if current > n:\n return\n \n res.append(current)\n for i in range(10):\n traverse(current * 10 + i)\n \n for i in range(1, 10):\n traverse(i)\n return res","memory":"24600"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n l=[]\n def dfs(u):\n if u*10>n:\n return\n for i in range(u*10,u*10+10):\n if i>n:\n break\n l.append(i)\n dfs(i)\n for i in range(1,10):\n if i>n:\n break\n l.append(i)\n dfs(i)\n return l\n ","memory":"24700"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n def dfs(x):\n nonlocal ans\n nonlocal n\n if x <= n:\n ans.append(x)\n else:\n return\n\n for i in range(10):\n dfs(x * 10 + i)\n \n for x in range(1, 10):\n dfs(x)\n\n return ans\n","memory":"24800"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(curr):\n nonlocal ans\n if int(''.join(curr)) <= n:\n ans.append(int(''.join(curr)))\n for d in range(10):\n if int(curr + str(d)) <= n:\n dfs(curr + str(d))\n ans = []\n for d in range(1, 10):\n dfs(str(d))\n return ans\n\n","memory":"24900"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(curr):\n nonlocal ans\n ans.append(int(''.join(curr)))\n for d in range(10):\n if int(curr + str(d)) <= n:\n dfs(curr + str(d))\n ans = []\n for d in range(1, 10):\n if d <= n:\n dfs(str(d))\n return ans\n\n","memory":"25000"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n result = []\n\n def dfs(baseIndex):\n if baseIndex * 10 > n:\n return\n\n for i in range(baseIndex * 10, baseIndex * 10 + 10):\n if i > n:\n break\n result.append(i)\n dfs(i)\n\n for i in range(1, 10):\n if i > n:\n break\n result.append(i)\n dfs(i)\n\n return result","memory":"25000"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n def dfs(curr: str):\n if curr and int(curr) <= n:\n output.append(int(curr))\n for num in digits:\n if 0 < int(curr + num) <= n:\n dfs(curr + num)\n elif int(curr + num) > n:\n break\n\n digits = [str(num) for num in range(10)] # '0' to '9'\n output = []\n dfs(\"\")\n return output","memory":"25100"},{"code":"# nlogn\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n return sorted([x for x in range(1, n+1)], key=lambda x: str(x))\n\n# lc n. note shouldn't be recursive (must be O(1) space)\nclass Solution:\n def lexicalOrder(self, n):\n res = [1]\n while len(res) < n:\n cur = res[-1] * 10\n while cur > n:\n cur //= 10\n cur += 1\n while cur % 10 == 0:\n cur //= 10\n res.append(cur)\n return res\n\n# note dfs - violates O(1) space requirement\nclass Solution:\n def lexicalOrder(self, n):\n res = []\n def dfs(cur):\n if cur > n:\n return\n res.append(cur)\n cur *= 10\n for x in range(10):\n if cur + x > n:\n return\n dfs(cur + x)\n for x in range(1, 10):\n dfs(x)\n return res","memory":"25100"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n nums = []\n\n def dfs(curr):\n for i in range(10):\n if curr + i > n:\n break\n print(curr + i, n)\n nums.append(curr + i)\n dfs((curr + i)*10)\n \n dfs(1)\n return nums[:n]\n \n","memory":"25300"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n l = list(range(1, n+1))\n ls = [str(item) for item in l]\n ls.sort()\n return [int(item) for item in ls]\n","memory":"25400"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n nums = []\n\n def dfs(curr):\n for i in range(10):\n if curr + i > n:\n break\n nums.append(curr + i)\n dfs((curr + i)*10)\n \n dfs(1)\n return nums[:n]\n \n","memory":"25500"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n nums = []\n\n def dfs(curr):\n for i in range(10):\n if curr + i > n:\n break\n nums.append(curr + i)\n dfs((curr + i)*10)\n \n dfs(1)\n return nums[:n]\n \n","memory":"25500"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n ans = []\n lst = list(range(1,n+1))\n for i, k in enumerate(lst):\n ans.append(str(k))\n ans = [int(n) for n in sorted(ans)]\n return ans","memory":"25700"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \"\"\"\n 11 -> [1, 1]\n 10 -> [1, 0]\n 1 -> [1]\n \"\"\"\n def numToDigits(num):\n return [int(d) for d in str(num)]\n \n nums = [num for num in range(1, n+1)]\n nums.sort(key=lambda x: numToDigits(x))\n\n return nums\n","memory":"25800"},{"code":"class Solution:\n def dfs(self, number, result, limit, visited):\n if int(number) <= limit and int(number) not in visited:\n result.append(int(number))\n visited.add(int(number))\n if len(number) < len(str(limit)):\n for i in range(10):\n if int(number+str(i)) <= limit:\n self.dfs(number+str(i), result, limit, visited)\n \n def lexicalOrder(self, n):\n result = []\n visited = set()\n for i in range(1,n+1):\n if len(str(i)) < len(str(n)):\n self.dfs(str(i), result, n, visited)\n elif i not in visited:\n result.append(i)\n return result","memory":"26600"},{"code":"class Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n nums=[str(i) for i in range(1,n+1)]\n nums.sort(key=lambda v:(v[0],v[1:]))\n for i in range(len(nums)):\n nums[i]=int(nums[i])\n return nums\n ","memory":"27900"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.endOfWord = False\n \n def insert(self, word):\n cur = self\n\n for c in word:\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.endOfWord = True\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n self.trie = TrieNode()\n for i in range(1, n+1):\n self.trie.insert(str(i))\n \n def dfs(node, cur, result):\n if node.endOfWord:\n result.append(int(''.join(cur)))\n for key in node.children.keys():\n cur.append(key)\n dfs(node.children[key], cur, result)\n cur.pop()\n \n\n\n result = []\n dfs(self.trie, [], result)\n # print(result)\n\n return result\n","memory":"28300"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.endOfWord = False\n \n def insert(self, word):\n cur = self\n\n for c in word:\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.endOfWord = True\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n \n self.trie = TrieNode()\n for i in range(1, n+1):\n self.trie.insert(str(i))\n \n def dfs(node, cur, result):\n if node.endOfWord:\n result.append(int(''.join(cur)))\n for key in node.children.keys():\n cur.append(key)\n dfs(node.children[key], cur, result)\n cur.pop()\n \n\n\n result = []\n dfs(self.trie, [], result)\n # print(result)\n\n return result\n","memory":"28400"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.end = False\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = TrieNode()\n for i in range(1, n+1):\n cur = trie\n for c in str(i):\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.end = True\n\n cur = trie\n res = []\n \n def dfs(node, s):\n if node.end:\n res.append(int(\"\".join(s)))\n # return\n for i in range(10):\n c = str(i)\n if c in node.children:\n # print(c)\n dfs(node.children[c], s + [c])\n \n dfs(cur, [])\n return res\n \n\n\n\n\n ","memory":"28500"},{"code":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.end = False\n\n\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n trie = TrieNode()\n for i in range(1, n+1):\n cur = trie\n for c in str(i):\n if c not in cur.children:\n cur.children[c] = TrieNode()\n cur = cur.children[c]\n cur.end = True\n\n cur = trie\n res = []\n \n def dfs(node, s):\n if node.end:\n res.append(int(\"\".join(s)))\n for i in range(10):\n c = str(i)\n if c in node.children:\n dfs(node.children[c], s + [c])\n dfs(cur, [])\n return res\n \n\n\n\n\n ","memory":"28500"},{"code":"class Trie:\n def __init__(self):\n self.children = {}\n self.isEndOfNumber = False\n\n def insert(self, number):\n node = self\n for digit in str(number):\n if digit not in node.children:\n node.children[digit] = Trie()\n node = node.children[digit]\n node.isEndOfNumber = True\n\n def search(self, node, curr):\n if node is None:\n return []\n res = []\n if node.isEndOfNumber:\n res.append(int(curr))\n for digit in sorted(node.children.keys()):\n res.extend(self.search(node.children[digit], curr + digit))\n \n return res\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n t = Trie()\n \n # Insert numbers 1 to n into the trie\n for i in range(1, n + 1):\n t.insert(i)\n \n # Pre-order traversal of the trie to get lexicographical order\n return t.search(t, \"\")\n\"\"\"\nFor O(N) solution follow DFS based solution, else we can convert \neach integer to string, and use python's sort to sort in lexicographical \norder.\n\nTree-like Structure:\nImagine numbers as forming a tree where each node has up to 10 children. \nThe root level (depth 0) has nodes 1 through 9. Each node at depth k \n(where k ≥ 1) represents the current number x, and its children are \n10*x, 10*x+1, ..., 10*x+9.\n\"\"\"\n\"\"\"\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n def dfs(curr):\n res.append(curr) \n for i in range(10): #Start with the smallest number at each level (i.e., 1, then 10, then 100, etc.).\n nextNum = curr * 10 + i \n if nextNum > n: #if nextNum is out of bounds, then go back to previous level\n break\n dfs(nextNum)\n\n for i in range(1, 10): #The root level (depth 0) has nodes 1 through 9\n if i <= n:\n dfs(i)\n return res\n\"\"\"\n\n\"\"\"\nO(NlogN) solution where N is the number given\nLexicographical order compares the first character of the strings. \nIf the first characters are the same, it moves to the next character.\nPython's sort() method sorts strings based on lexicographical order.\nBut given that we cant solve this solution in O(NlogN) need O(N)\n\"\"\"\n\"\"\"\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n for i in range(1, n+1):\n res.append(str(i))\n res.sort()\n for i in range(len(res)):\n res[i] = int(res[i])\n return res\n\"\"\"","memory":"28600"},{"code":"class Trie:\n def __init__(self):\n self.children = {}\n self.isEndOfNumber = False\n\n def insert(self, number):\n node = self\n for digit in str(number):\n if digit not in node.children:\n node.children[digit] = Trie()\n node = node.children[digit]\n node.isEndOfNumber = True\n\n def search(self, node, curr):\n if node is None:\n return []\n res = []\n if node.isEndOfNumber:\n res.append(int(curr))\n for digit in sorted(node.children.keys()):\n res.extend(self.search(node.children[digit], curr + digit))\n \n return res\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n t = Trie()\n \n # Insert numbers 1 to n into the trie\n for i in range(1, n + 1):\n t.insert(i)\n \n # Pre-order traversal of the trie to get lexicographical order\n return t.search(t, \"\")\n\"\"\"\nFor O(N) solution follow DFS based solution, else we can convert \neach integer to string, and use python's sort to sort in lexicographical \norder.\n\nTree-like Structure:\nImagine numbers as forming a tree where each node has up to 10 children. \nThe root level (depth 0) has nodes 1 through 9. Each node at depth k \n(where k ≥ 1) represents the current number x, and its children are \n10*x, 10*x+1, ..., 10*x+9.\n\"\"\"\n\"\"\"\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n def dfs(curr):\n res.append(curr) \n for i in range(10): #Start with the smallest number at each level (i.e., 1, then 10, then 100, etc.).\n nextNum = curr * 10 + i \n if nextNum > n: #if nextNum is out of bounds, then go back to previous level\n break\n dfs(nextNum)\n\n for i in range(1, 10): #The root level (depth 0) has nodes 1 through 9\n if i <= n:\n dfs(i)\n return res\n\"\"\"\n\n\"\"\"\nO(NlogN) solution where N is the number given\nLexicographical order compares the first character of the strings. \nIf the first characters are the same, it moves to the next character.\nPython's sort() method sorts strings based on lexicographical order.\nBut given that we cant solve this solution in O(NlogN) need O(N)\n\"\"\"\n\"\"\"\nclass Solution:\n def lexicalOrder(self, n: int) -> List[int]:\n res = []\n for i in range(1, n+1):\n res.append(str(i))\n res.sort()\n for i in range(len(res)):\n res[i] = int(res[i])\n return res\n\"\"\"","memory":"28700"}],"string":"[\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n results = []\\n \\n def bkt(n: int, k: int, current: int):\\n start = int(k == 0)\\n for i in range(start, 10):\\n if current * 10 + i <= n:\\n yield current * 10 + i\\n yield from bkt(n, k + 1, current * 10 + i)\\n else:\\n return\\n return bkt(n, 0, 0)\\n # return results\\n\",\n \"memory\": \"20400\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def bkt(n: int, k: int, current: int):\\n start = int(k == 0)\\n for i in range(start, 10):\\n if current * 10 + i <= n:\\n yield current * 10 + i\\n yield from bkt(n, k + 1, current * 10 + i)\\n else:\\n return\\n \\n return bkt(n, 0, 0)\\n \\n\",\n \"memory\": \"20500\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n if(n<=9):\\n ans=[i for i in range(1,n+1)]\\n return ans\\n ans=[]\\n for i in range(1,10):\\n self.dfs(i,n,ans)\\n return ans\\n\\n def dfs(self,num,n,ans):\\n ans.append(num)\\n for i in range(0,10):\\n num1=num*10+i\\n if(num1<=n):\\n self.dfs(num1,n,ans)\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n if(n<=9):\\n ans=[i for i in range(1,n+1)]\\n return ans\\n ans=[]\\n for i in range(1,10):\\n self.dfs(i,n,ans)\\n return ans\\n\\n def dfs(self,num,n,ans):\\n ans.append(num)\\n for i in range(0,10):\\n num1=num*10+i\\n if(num1<=n):\\n self.dfs(num1,n,ans)\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n cur=1\\n res=[]\\n for i in range(n):\\n res.append(cur)\\n if cur*10<=n:\\n cur*=10\\n else:\\n while (cur==n or cur%10==9):\\n cur//=10\\n cur+=1\\n return res\\n\",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n l=[]\\n for i in range(1,n+1):\\n l.append(str(i))\\n l.sort()\\n for i in range(len(l)):\\n l[i]=int(l[i])\\n print(l)\\n return l\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n curr = 1\\n for x in range(0,n):\\n res.append(curr)\\n if curr * 10 <= n:\\n curr *= 10\\n else:\\n while (curr % 10) == 9 or curr == n:\\n curr = curr // 10\\n curr += 1\\n return res\\n\\n\\n \\n\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(x, res):\\n if x > n:\\n return\\n res.append(x)\\n for j in range(10):\\n dfs(x * 10 + j, res)\\n results = []\\n for i in range(1, 10):\\n dfs(i, results)\\n return results\",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lst=[]\\n for i in range(1,n+1):\\n lst.append(str(i))\\n lst.sort()\\n for j in range(len(lst)):\\n lst[j]=int(lst[j])\\n return lst\",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> list[int]:\\n ans = []\\n curr = 1\\n\\n while len(ans) < n:\\n ans.append(curr)\\n if curr * 10 <= n:\\n curr *= 10\\n else:\\n while curr % 10 == 9 or curr == n:\\n curr //= 10\\n curr += 1\\n\\n return ans\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n lexicographical_numbers = []\\n current_number = 1\\n\\n # Generate numbers from 1 to n\\n for _ in range(n):\\n lexicographical_numbers.append(current_number)\\n\\n # If multiplying the current number by 10 is within the limit, do it\\n if current_number * 10 <= n:\\n current_number *= 10\\n else:\\n # Adjust the current number by moving up one digit\\n while current_number % 10 == 9 or current_number >= n:\\n current_number //= 10 # Remove the last digit\\n current_number += 1 # Increment the number\\n\\n return lexicographical_numbers\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n x = 1\\n\\n for _ in range(n):\\n res.append(x)\\n if x * 10 <= n:\\n x *= 10\\n else:\\n if x >= n:\\n x //= 10\\n x += 1\\n while x % 10 == 0:\\n x //= 10\\n \\n return res\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n num = 1\\n for _ in range(n):\\n result.append(num)\\n if num * 10 <= n:\\n num *= 10\\n else:\\n while num % 10 == 9 or num + 1 > n:\\n num //= 10\\n num += 1\\n return result\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = [0] * n\\n num = 1\\n for i in range(n):\\n ans[i] = num\\n if num * 10 <= n:\\n num *= 10\\n else:\\n while num % 10 == 9 or num + 1 > n:\\n num //= 10\\n num += 1\\n return ans \",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n):\\n fn = lambda a, b: 1 if str(a) > str(b) else -1\\n return sorted([i for i in range(1, n+1)], key=cmp_to_key(fn))\",\n \"memory\": \"22700\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n numlist = []\\n for i in range(1, n + 1):\\n numlist.append(i)\\n numlist.sort(key=lambda x: str(x))\\n return numlist\\n\\n \",\n \"memory\": \"22800\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n return sorted(range(1,n+1), key=str)\",\n \"memory\": \"22900\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n cur = 1\\n res = []\\n\\n for _ in range(n):\\n res.append(cur)\\n print(\\\"cur 1 = \\\", cur)\\n\\n if cur * 10 <= n:\\n cur *= 10\\n else:\\n if cur == n:\\n # print(\\\"cur 2 = \\\", cur)\\n cur //= 10\\n\\n cur += 1\\n \\n while cur % 10 == 0:\\n cur //= 10\\n return res\\n\\n \",\n \"memory\": \"23000\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = [i+1 for i in range(n)]\\n\\n return sorted(res,key=str)\",\n \"memory\": \"23100\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n return [int(j) for j in sorted([str(i) for i in range(1, n + 1)])]\",\n \"memory\": \"23200\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n x = [str(x) for x in range(1, n + 1)]\\n x.sort()\\n return [int(i) for i in x]\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n numbers = [str(i) for i in range(1, n+1)]\\n numbers.sort()\\n return [int(i) for i in numbers]\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n numbers = [str(x) for x in list(range(1,n+1))] \\n numbers.sort()\\n numbers = [int(x) for x in numbers]\\n #print(numbers)\\n return numbers\",\n \"memory\": \"23400\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n for i in range(1,n+1):\\n ans.append(str(i))\\n ans = [int(n) for n in sorted(ans)]\\n return ans\",\n \"memory\": \"23500\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n numbers_str = [str(x+1) for x in range(n)]\\n out_list = [int(x) for x in sorted(numbers_str, key=str)]\\n return out_list\",\n \"memory\": \"24000\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self) -> None:\\n self.trie = {}\\n self.node = \\\"\\\"\\n self.lexicalOrderList = []\\n def insert_derivative(self, word: str) -> None:\\n current_node = self.trie\\n for char in word:\\n if char in current_node:\\n pass\\n else:\\n current_node[char] = {}\\n current_node = current_node[char]\\n def depth_first_search(self, current_node: dict) -> None:\\n for k, v in current_node.items():\\n self.node += str(k)\\n self.lexicalOrderList.append(int(self.node))\\n if v == {}:\\n self.node = self.node[:-1] # backtrack\\n else:\\n current_node = v # go to the next level\\n self.depth_first_search(current_node) # traverse through all nodes at the next level\\n self.node = self.node[:-1] # after traversing the current level, backtrack to its parent level\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n thought:\\n - our goal is to sort integers from 1 to n in lexicographical order.\\n - lexicographical order means sorting numbers digit by digit, such as: 1, 10, 11, ..., 100, ..., 2, ...\\n - we can use a Trie data structure to store the integers digit by digit and apply a Depth-First Search (DFS) algorithm to ensure the result is in lexicographical order.\\n - the steps for Depth-First Search (DFS) are recursive, and the core concept is as follows:\\n # Core concept: Go as deep as possible before backtracking. This means we should keep digging deeper until we reach the bottom of the Trie.\\n # Steps:\\n 1. Use a for loop to traverse through the Trie.\\n - If we cannot go deeper (i.e., we've reached the bottom of the Trie), record the value and backtrack to the parent node.\\n - If we can go deeper, record the value and call the function recursively to explore further down the Trie.\\n 2. After completing each for loop, we have traversed all nodes at the current sub-level of the Trie. We then backtrack to the parent node to start another recursive loop.\\n - the steps to achieve this are:\\n (1) Build a Trie to store the integers from 1 to n.\\n (2) Use recursion to perform Depth-First Search (DFS): traverse the Trie deeply first, then broadly, and append the results to the answer list.\\n (3) Return the answer list.\\n \\\"\\\"\\\"\\n # build Trie\\n for i in range(1, n+1):\\n self.insert_derivative(str(i)) \\n # use recursion to perform Depth-First Search (DFS)\\n current_node = self.trie\\n self.depth_first_search(current_node)\\n return self.lexicalOrderList\",\n \"memory\": \"24200\"\n },\n {\n \"code\": \"class Solution:\\n def __init__(self) -> None:\\n self.trie = {}\\n self.node = \\\"\\\"\\n self.lexicalOrderList = []\\n def insert_derivative(self, word: str) -> None:\\n current_node = self.trie\\n for char in word:\\n if char in current_node:\\n pass\\n else:\\n current_node[char] = {}\\n current_node = current_node[char]\\n def depth_first_search(self, current_node: dict) -> None:\\n for k, v in current_node.items():\\n self.node += str(k)\\n self.lexicalOrderList.append(int(self.node))\\n if v == {}:\\n self.node = self.node[:-1] # backtrack\\n else:\\n current_node = v # go to the next level\\n self.depth_first_search(current_node) # traverse through all nodes at the next level\\n self.node = self.node[:-1] # after traversing the current level, backtrack to its parent level\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n thought:\\n - our goal is to sort integers from 1 to n in lexicographical order.\\n - lexicographical order means sorting numbers digit by digit, such as: 1, 10, 11, ..., 100, ..., 2, ...\\n - we can use a Trie data structure to store the integers digit by digit and apply a Depth-First Search (DFS) algorithm to ensure the result is in lexicographical order.\\n - the steps for Depth-First Search (DFS) are recursive, and the core concept is as follows:\\n # Core concept: Go as deep as possible before backtracking. This means we should keep digging deeper until we reach the bottom of the Trie.\\n # Steps:\\n 1. Use a for loop to traverse through the Trie.\\n - If we cannot go deeper (i.e., we've reached the bottom of the Trie), record the value and backtrack to the parent node.\\n - If we can go deeper, record the value and call the function recursively to explore further down the Trie.\\n 2. After completing each for loop, we have traversed all nodes at the current sub-level of the Trie. We then backtrack to the parent node to start another recursive loop.\\n - the steps to achieve this are:\\n (1) Build a Trie to store the integers from 1 to n.\\n (2) Use recursion to perform Depth-First Search (DFS): traverse the Trie deeply first, then broadly, and append the results to the answer list.\\n (3) Return the answer list.\\n \\\"\\\"\\\"\\n # build Trie\\n for i in range(1, n+1):\\n self.insert_derivative(str(i)) \\n # use recursion to perform Depth-First Search (DFS)\\n current_node = self.trie\\n self.depth_first_search(current_node)\\n return self.lexicalOrderList\",\n \"memory\": \"24200\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, number, result, limit, visited):\\n if number <= limit and number not in visited:\\n result.append(number)\\n visited.add(number)\\n for i in range(10):\\n if int(number*10+i) <= limit:\\n self.dfs(number*10+i, result, limit, visited)\\n \\n def lexicalOrder(self, n):\\n result = []\\n visited = set()\\n for i in range(1,n+1):\\n if len(str(i)) < len(str(n)):\\n self.dfs(i, result, n, visited)\\n elif i not in visited:\\n result.append(i)\\n return result\",\n \"memory\": \"24300\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n\\n def traverse(current):\\n if current > n:\\n return\\n \\n res.append(current)\\n for i in range(10):\\n traverse(current * 10 + i)\\n \\n for i in range(1, 10):\\n traverse(i)\\n return res\",\n \"memory\": \"24600\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n l=[]\\n def dfs(u):\\n if u*10>n:\\n return\\n for i in range(u*10,u*10+10):\\n if i>n:\\n break\\n l.append(i)\\n dfs(i)\\n for i in range(1,10):\\n if i>n:\\n break\\n l.append(i)\\n dfs(i)\\n return l\\n \",\n \"memory\": \"24700\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n def dfs(x):\\n nonlocal ans\\n nonlocal n\\n if x <= n:\\n ans.append(x)\\n else:\\n return\\n\\n for i in range(10):\\n dfs(x * 10 + i)\\n \\n for x in range(1, 10):\\n dfs(x)\\n\\n return ans\\n\",\n \"memory\": \"24800\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(curr):\\n nonlocal ans\\n if int(''.join(curr)) <= n:\\n ans.append(int(''.join(curr)))\\n for d in range(10):\\n if int(curr + str(d)) <= n:\\n dfs(curr + str(d))\\n ans = []\\n for d in range(1, 10):\\n dfs(str(d))\\n return ans\\n\\n\",\n \"memory\": \"24900\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(curr):\\n nonlocal ans\\n ans.append(int(''.join(curr)))\\n for d in range(10):\\n if int(curr + str(d)) <= n:\\n dfs(curr + str(d))\\n ans = []\\n for d in range(1, 10):\\n if d <= n:\\n dfs(str(d))\\n return ans\\n\\n\",\n \"memory\": \"25000\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n result = []\\n\\n def dfs(baseIndex):\\n if baseIndex * 10 > n:\\n return\\n\\n for i in range(baseIndex * 10, baseIndex * 10 + 10):\\n if i > n:\\n break\\n result.append(i)\\n dfs(i)\\n\\n for i in range(1, 10):\\n if i > n:\\n break\\n result.append(i)\\n dfs(i)\\n\\n return result\",\n \"memory\": \"25000\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n def dfs(curr: str):\\n if curr and int(curr) <= n:\\n output.append(int(curr))\\n for num in digits:\\n if 0 < int(curr + num) <= n:\\n dfs(curr + num)\\n elif int(curr + num) > n:\\n break\\n\\n digits = [str(num) for num in range(10)] # '0' to '9'\\n output = []\\n dfs(\\\"\\\")\\n return output\",\n \"memory\": \"25100\"\n },\n {\n \"code\": \"# nlogn\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n return sorted([x for x in range(1, n+1)], key=lambda x: str(x))\\n\\n# lc n. note shouldn't be recursive (must be O(1) space)\\nclass Solution:\\n def lexicalOrder(self, n):\\n res = [1]\\n while len(res) < n:\\n cur = res[-1] * 10\\n while cur > n:\\n cur //= 10\\n cur += 1\\n while cur % 10 == 0:\\n cur //= 10\\n res.append(cur)\\n return res\\n\\n# note dfs - violates O(1) space requirement\\nclass Solution:\\n def lexicalOrder(self, n):\\n res = []\\n def dfs(cur):\\n if cur > n:\\n return\\n res.append(cur)\\n cur *= 10\\n for x in range(10):\\n if cur + x > n:\\n return\\n dfs(cur + x)\\n for x in range(1, 10):\\n dfs(x)\\n return res\",\n \"memory\": \"25100\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n nums = []\\n\\n def dfs(curr):\\n for i in range(10):\\n if curr + i > n:\\n break\\n print(curr + i, n)\\n nums.append(curr + i)\\n dfs((curr + i)*10)\\n \\n dfs(1)\\n return nums[:n]\\n \\n\",\n \"memory\": \"25300\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n l = list(range(1, n+1))\\n ls = [str(item) for item in l]\\n ls.sort()\\n return [int(item) for item in ls]\\n\",\n \"memory\": \"25400\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n nums = []\\n\\n def dfs(curr):\\n for i in range(10):\\n if curr + i > n:\\n break\\n nums.append(curr + i)\\n dfs((curr + i)*10)\\n \\n dfs(1)\\n return nums[:n]\\n \\n\",\n \"memory\": \"25500\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n nums = []\\n\\n def dfs(curr):\\n for i in range(10):\\n if curr + i > n:\\n break\\n nums.append(curr + i)\\n dfs((curr + i)*10)\\n \\n dfs(1)\\n return nums[:n]\\n \\n\",\n \"memory\": \"25500\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n ans = []\\n lst = list(range(1,n+1))\\n for i, k in enumerate(lst):\\n ans.append(str(k))\\n ans = [int(n) for n in sorted(ans)]\\n return ans\",\n \"memory\": \"25700\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\\"\\\"\\\"\\n 11 -> [1, 1]\\n 10 -> [1, 0]\\n 1 -> [1]\\n \\\"\\\"\\\"\\n def numToDigits(num):\\n return [int(d) for d in str(num)]\\n \\n nums = [num for num in range(1, n+1)]\\n nums.sort(key=lambda x: numToDigits(x))\\n\\n return nums\\n\",\n \"memory\": \"25800\"\n },\n {\n \"code\": \"class Solution:\\n def dfs(self, number, result, limit, visited):\\n if int(number) <= limit and int(number) not in visited:\\n result.append(int(number))\\n visited.add(int(number))\\n if len(number) < len(str(limit)):\\n for i in range(10):\\n if int(number+str(i)) <= limit:\\n self.dfs(number+str(i), result, limit, visited)\\n \\n def lexicalOrder(self, n):\\n result = []\\n visited = set()\\n for i in range(1,n+1):\\n if len(str(i)) < len(str(n)):\\n self.dfs(str(i), result, n, visited)\\n elif i not in visited:\\n result.append(i)\\n return result\",\n \"memory\": \"26600\"\n },\n {\n \"code\": \"class Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n nums=[str(i) for i in range(1,n+1)]\\n nums.sort(key=lambda v:(v[0],v[1:]))\\n for i in range(len(nums)):\\n nums[i]=int(nums[i])\\n return nums\\n \",\n \"memory\": \"27900\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.endOfWord = False\\n \\n def insert(self, word):\\n cur = self\\n\\n for c in word:\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.endOfWord = True\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n self.trie = TrieNode()\\n for i in range(1, n+1):\\n self.trie.insert(str(i))\\n \\n def dfs(node, cur, result):\\n if node.endOfWord:\\n result.append(int(''.join(cur)))\\n for key in node.children.keys():\\n cur.append(key)\\n dfs(node.children[key], cur, result)\\n cur.pop()\\n \\n\\n\\n result = []\\n dfs(self.trie, [], result)\\n # print(result)\\n\\n return result\\n\",\n \"memory\": \"28300\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.endOfWord = False\\n \\n def insert(self, word):\\n cur = self\\n\\n for c in word:\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.endOfWord = True\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n \\n self.trie = TrieNode()\\n for i in range(1, n+1):\\n self.trie.insert(str(i))\\n \\n def dfs(node, cur, result):\\n if node.endOfWord:\\n result.append(int(''.join(cur)))\\n for key in node.children.keys():\\n cur.append(key)\\n dfs(node.children[key], cur, result)\\n cur.pop()\\n \\n\\n\\n result = []\\n dfs(self.trie, [], result)\\n # print(result)\\n\\n return result\\n\",\n \"memory\": \"28400\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.end = False\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = TrieNode()\\n for i in range(1, n+1):\\n cur = trie\\n for c in str(i):\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.end = True\\n\\n cur = trie\\n res = []\\n \\n def dfs(node, s):\\n if node.end:\\n res.append(int(\\\"\\\".join(s)))\\n # return\\n for i in range(10):\\n c = str(i)\\n if c in node.children:\\n # print(c)\\n dfs(node.children[c], s + [c])\\n \\n dfs(cur, [])\\n return res\\n \\n\\n\\n\\n\\n \",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"class TrieNode:\\n def __init__(self):\\n self.children = {}\\n self.end = False\\n\\n\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n trie = TrieNode()\\n for i in range(1, n+1):\\n cur = trie\\n for c in str(i):\\n if c not in cur.children:\\n cur.children[c] = TrieNode()\\n cur = cur.children[c]\\n cur.end = True\\n\\n cur = trie\\n res = []\\n \\n def dfs(node, s):\\n if node.end:\\n res.append(int(\\\"\\\".join(s)))\\n for i in range(10):\\n c = str(i)\\n if c in node.children:\\n dfs(node.children[c], s + [c])\\n dfs(cur, [])\\n return res\\n \\n\\n\\n\\n\\n \",\n \"memory\": \"28500\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n self.children = {}\\n self.isEndOfNumber = False\\n\\n def insert(self, number):\\n node = self\\n for digit in str(number):\\n if digit not in node.children:\\n node.children[digit] = Trie()\\n node = node.children[digit]\\n node.isEndOfNumber = True\\n\\n def search(self, node, curr):\\n if node is None:\\n return []\\n res = []\\n if node.isEndOfNumber:\\n res.append(int(curr))\\n for digit in sorted(node.children.keys()):\\n res.extend(self.search(node.children[digit], curr + digit))\\n \\n return res\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n t = Trie()\\n \\n # Insert numbers 1 to n into the trie\\n for i in range(1, n + 1):\\n t.insert(i)\\n \\n # Pre-order traversal of the trie to get lexicographical order\\n return t.search(t, \\\"\\\")\\n\\\"\\\"\\\"\\nFor O(N) solution follow DFS based solution, else we can convert \\neach integer to string, and use python's sort to sort in lexicographical \\norder.\\n\\nTree-like Structure:\\nImagine numbers as forming a tree where each node has up to 10 children. \\nThe root level (depth 0) has nodes 1 through 9. Each node at depth k \\n(where k ≥ 1) represents the current number x, and its children are \\n10*x, 10*x+1, ..., 10*x+9.\\n\\\"\\\"\\\"\\n\\\"\\\"\\\"\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n def dfs(curr):\\n res.append(curr) \\n for i in range(10): #Start with the smallest number at each level (i.e., 1, then 10, then 100, etc.).\\n nextNum = curr * 10 + i \\n if nextNum > n: #if nextNum is out of bounds, then go back to previous level\\n break\\n dfs(nextNum)\\n\\n for i in range(1, 10): #The root level (depth 0) has nodes 1 through 9\\n if i <= n:\\n dfs(i)\\n return res\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\nO(NlogN) solution where N is the number given\\nLexicographical order compares the first character of the strings. \\nIf the first characters are the same, it moves to the next character.\\nPython's sort() method sorts strings based on lexicographical order.\\nBut given that we cant solve this solution in O(NlogN) need O(N)\\n\\\"\\\"\\\"\\n\\\"\\\"\\\"\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n for i in range(1, n+1):\\n res.append(str(i))\\n res.sort()\\n for i in range(len(res)):\\n res[i] = int(res[i])\\n return res\\n\\\"\\\"\\\"\",\n \"memory\": \"28600\"\n },\n {\n \"code\": \"class Trie:\\n def __init__(self):\\n self.children = {}\\n self.isEndOfNumber = False\\n\\n def insert(self, number):\\n node = self\\n for digit in str(number):\\n if digit not in node.children:\\n node.children[digit] = Trie()\\n node = node.children[digit]\\n node.isEndOfNumber = True\\n\\n def search(self, node, curr):\\n if node is None:\\n return []\\n res = []\\n if node.isEndOfNumber:\\n res.append(int(curr))\\n for digit in sorted(node.children.keys()):\\n res.extend(self.search(node.children[digit], curr + digit))\\n \\n return res\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n t = Trie()\\n \\n # Insert numbers 1 to n into the trie\\n for i in range(1, n + 1):\\n t.insert(i)\\n \\n # Pre-order traversal of the trie to get lexicographical order\\n return t.search(t, \\\"\\\")\\n\\\"\\\"\\\"\\nFor O(N) solution follow DFS based solution, else we can convert \\neach integer to string, and use python's sort to sort in lexicographical \\norder.\\n\\nTree-like Structure:\\nImagine numbers as forming a tree where each node has up to 10 children. \\nThe root level (depth 0) has nodes 1 through 9. Each node at depth k \\n(where k ≥ 1) represents the current number x, and its children are \\n10*x, 10*x+1, ..., 10*x+9.\\n\\\"\\\"\\\"\\n\\\"\\\"\\\"\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n def dfs(curr):\\n res.append(curr) \\n for i in range(10): #Start with the smallest number at each level (i.e., 1, then 10, then 100, etc.).\\n nextNum = curr * 10 + i \\n if nextNum > n: #if nextNum is out of bounds, then go back to previous level\\n break\\n dfs(nextNum)\\n\\n for i in range(1, 10): #The root level (depth 0) has nodes 1 through 9\\n if i <= n:\\n dfs(i)\\n return res\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\nO(NlogN) solution where N is the number given\\nLexicographical order compares the first character of the strings. \\nIf the first characters are the same, it moves to the next character.\\nPython's sort() method sorts strings based on lexicographical order.\\nBut given that we cant solve this solution in O(NlogN) need O(N)\\n\\\"\\\"\\\"\\n\\\"\\\"\\\"\\nclass Solution:\\n def lexicalOrder(self, n: int) -> List[int]:\\n res = []\\n for i in range(1, n+1):\\n res.append(str(i))\\n res.sort()\\n for i in range(len(res)):\\n res[i] = int(res[i])\\n return res\\n\\\"\\\"\\\"\",\n \"memory\": \"28700\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":50,"string":"50"}}},{"rowIdx":290,"cells":{"question_id":{"kind":"number","value":387,"string":"387"},"name":{"kind":"string","value":"first-unique-character-in-a-string"},"content":{"kind":"string","value":"<p>Given a string <code>s</code>, find the <strong>first</strong> non-repeating character in it and return its index. If it <strong>does not</strong> exist, return <code>-1</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">s = "leetcode"</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">0</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>The character <code>'l'</code> at index 0 is the first character that does not occur at any other index.</p>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">s = "loveleetcode"</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">2</span></p>\n</div>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">s = "aabb"</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">-1</span></p>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10<sup>5</sup></code></li>\n\t<li><code>s</code> consists of only lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":62.5549283868931,"string":"62.554928"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["hash-table","string","queue","counting"],"string":"[\n \"hash-table\",\n \"string\",\n \"queue\",\n \"counting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"27\", 0.0499], [\"30\", 0.01], [\"34\", 0.0299], [\"37\", 0.1199], [\"40\", 0.0699], [\"44\", 0.06989999999999999], [\"47\", 0.11979999999999999], [\"50\", 0.2695], [\"54\", 0.3094], [\"57\", 0.7586], [\"60\", 0.7885], [\"64\", 1.0181], [\"67\", 1.5371], [\"70\", 1.1279000000000001], [\"74\", 1.2576], [\"77\", 2.0261], [\"80\", 2.645], [\"84\", 3.673], [\"87\", 6.3479], [\"90\", 5.6792], [\"94\", 5.23], [\"97\", 7.2462], [\"100\", 5.2301], [\"104\", 5.4696], [\"107\", 7.904999999999999], [\"110\", 5.3597], [\"114\", 5.399699999999999], [\"117\", 5.8187999999999995], [\"120\", 3.3336], [\"124\", 2.2756], [\"127\", 2.2058], [\"130\", 1.6168999999999998], [\"134\", 1.0579999999999998], [\"137\", 1.6568], [\"140\", 0.9282000000000001], [\"144\", 0.7585999999999999], [\"147\", 1.0081], [\"150\", 0.5589], [\"154\", 0.2994], [\"157\", 0.35929999999999995], [\"160\", 0.2993], [\"163\", 0.1397], [\"167\", 0.1996], [\"170\", 0.1996], [\"173\", 0.1198], [\"177\", 0.0798], [\"180\", 0.1498], [\"183\", 0.0399], [\"187\", 0.0798], [\"190\", 0.0999], [\"193\", 0.02], [\"197\", 0.06], [\"200\", 0.0699], [\"203\", 0.0699], [\"207\", 0.06], [\"210\", 0.07], [\"213\", 0.02], [\"217\", 0.05], [\"220\", 0.05], [\"223\", 0.01], [\"227\", 0.02], [\"230\", 0.02], [\"233\", 0.01], [\"237\", 0.0499], [\"240\", 0.0499], [\"243\", 0.03], [\"247\", 0.01], [\"250\", 0.04], [\"253\", 0.0499], [\"257\", 0.0798], [\"260\", 0.1098], [\"263\", 0.0799], [\"267\", 0.1497], [\"270\", 0.2294], [\"273\", 0.1796], [\"277\", 0.1297], [\"280\", 0.1199], [\"283\", 0.059899999999999995], [\"287\", 0.03], [\"290\", 0.0399]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16400\", 0.01], [\"16500\", 0.0299], [\"16600\", 0.02], [\"16700\", 0.02], [\"16800\", 0.0898], [\"16900\", 1.0081], [\"17000\", 15.0514], [\"17100\", 53.3187], [\"17200\", 18.0457], [\"17300\", 4.9007], [\"17400\", 2.106]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"map = {}\n for i in s:\n if i in map:\n map[i] = map[i] + 1\n else:\n map[i] = 1\n \n for i in map:\n if map[i] == 1:\n return s.index(i)\n return -1\n \n \"\"\"\n text = \"abcdefghijklmnopqrstuvwxyz\"\n idx = float(\"inf\")\n for i in text:\n if(i in s):\n x = s.find(i)\n if x==s.rfind(i):\n idx=min(idx,x)\n return -1 if idx == float(\"inf\") else idx","runtime":"27"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n letters = 'abcdefghijklmnopqrstuvwxyz'\n idx = 1_000_000\n for l in letters:\n idx_left = s.find(l)\n if idx_left != -1 and s.rfind(l) == idx_left:\n idx = min(idx, idx_left)\n return idx if idx != 1_000_000 else -1","runtime":"27"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n alphabeta = 'abcdefghijklmnopqrstuvwxyz'\n res = 100000\n\n for ch in alphabeta:\n index = s.find(ch)\n if index != -1 and s.rfind(ch) == index:\n res = min(res, index)\n \n return res if res != 100000 else -1\n\n\n# Solution 2: ---------------\n # count = collections.Counter(s)\n # count = {}\n # for ch in s:\n # if ch in count:\n # count[ch] += 1\n # else:\n # count[ch] = 1\n # # print(count)\n\n # for index, char in enumerate(s):\n # if count[char] == 1: \n # return index\n \n # return -1\n\n# Solution 1-1: -------------\n # char_dict = {}\n\n # for i in range(len(s)):\n # if s[i] not in char_dict:\n # char_dict[s[i]] = [i]\n # else:\n # char_dict[s[i]].append(i)\n \n # for key, value in char_dict.items():\n # if len(value) == 1:\n # return value[0]\n\n # return -1\n\n# Solution 1-2: ----------------\n # res = 0\n # char_dict = {}\n\n # for i in range(len(s)):\n # if s[i] not in char_dict:\n # char_dict[s[i]] = [i]\n # else:\n # char_dict[s[i]].append(i)\n # while res < len(s) and s[res] in char_dict and len(char_dict[s[res]]) > 1:\n # res += 1\n\n # if res == len(s):\n # return -1\n # else:\n # return res","runtime":"30"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n text = \"abcdefghijklmnopqrstuvwxyz\"\n idx = float(\"inf\")\n for i in text:\n if(i in s):\n x = s.find(i)\n if x==s.rfind(i):\n idx=min(idx,x)\n return -1 if idx == float(\"inf\") else idx","runtime":"34"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n text = \"abcdefghijklmnopqrstuvwxyz\"\n idx = float(\"inf\")\n for i in text:\n if (i in s):\n x = s.find(i)\n if x == s.rfind(i):\n idx = min(idx, x)\n return -1 if idx == float(\"inf\") else idx","runtime":"37"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"map = {}\n for i in s:\n if i in map:\n map[i] = map[i] + 1\n else:\n map[i] = 1\n \n for i in map:\n if map[i] == 1:\n return s.index(i)\n return -1\n \n \"\"\"\n text = \"abcdefghijklmnopqrstuvwxyz\"\n idx = float(\"inf\")\n for i in text:\n if(i in s):\n x = s.find(i)\n if x==s.rfind(i):\n idx=min(idx,x)\n return -1 if idx == float(\"inf\") else idx","runtime":"37"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n hashmap = {}\n res = float(\"inf\")\n \n for letter in set(s):\n hashmap[letter] = s.count(letter)\n \n for key, val in hashmap.items():\n if val == 1:\n res = min(res, s.index(key))\n \n if res != float(\"inf\"):\n return res\n else:\n return -1\n \n \n \n ","runtime":"40"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n arr = [s.index(i) for i in set(s) if s.count(i) == 1]\n return sorted(arr)[0] if arr else -1\n","runtime":"40"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n key = 'abcdefghijklmnopqrstuvwxyz' # Pre-defined order of characters\n idx = 10**5 # Set an initial large index\n \n # Iterate through each character in the pre-defined order\n for i in key:\n x = s.find(i) # Find the first occurrence of the character\n # Check if the character is unique (not found after the first occurrence)\n if x != -1 and x == s.rfind(i):\n idx = min(idx, x) # Update the minimum index\n \n # Return the minimum index if found, otherwise return -1\n return idx if idx != 10**5 else -1","runtime":"44"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"map = {}\n for i in s:\n if i in map:\n map[i] = map[i] + 1\n else:\n map[i] = 1\n \n for i in map:\n if map[i] == 1:\n return s.index(i)\n return -1\n \n \"\"\"\n text = \"abcdefghijklmnopqrstuvwxyz\"\n idx = float(\"inf\")\n for i in text:\n if(i in s):\n x = s.find(i)\n if x==s.rfind(i):\n idx=min(idx,x)\n return -1 if idx == float(\"inf\") else idx","runtime":"44"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n\n uniqueLetters = set(s)\n letterIndexes = []\n\n for uniqueLetter in uniqueLetters:\n if s.count(uniqueLetter) == 1: \n letterIndexes.append(s.index(uniqueLetter))\n \n if letterIndexes:\n return min(letterIndexes)\n return -1","runtime":"47"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n letters = string.ascii_lowercase\n print(letters)\n out = [s.index(l) for l in letters if s.count(l)==1]\n if(len(out)>=1):\n return min(out)\n return -1","runtime":"47"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n idx = []\n for ss in set(s):\n if s.count(ss) == 1:\n idx.append(s.index(ss))\n if idx:\n return min(idx)\n else:\n return -1\n\n\n","runtime":"50"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n st = set(s)\n mn = len(s) + 5\n for i in st:\n if s.count(i) == 1:\n mn = min(s.index(i), mn)\n\n if not len(s) + 5 == mn:\n return mn\n return -1","runtime":"50"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n st = set(s)\n l = set()\n for i in st:\n if s.count(i) == 1:\n l.add(i)\n mn = len(s)\n\n if len(l):\n for i in l:\n mn = min(s.index(i), mn)\n return mn\n return -1","runtime":"54"},{"code":"from string import ascii_lowercase as abc\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n instances_of_1 = []\n for i in abc:\n if s.count(i) == 1:\n instances_of_1.append(i)\n \n print(instances_of_1)\n\n if len(instances_of_1) == 0:\n return -1\n else:\n first_indexes = [s.find(i) for i in instances_of_1]\n return min(first_indexes)\n ","runtime":"54"},{"code":"from collections import Counter\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n \n freq = Counter(s)\n print(freq)\n\n # find the index\n for k,v in freq.items():\n if v == 1:\n return s.index(k)\n return -1","runtime":"57"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n s1 = Counter(s)\n for i,e in s1.items():\n if e==1:\n return s.index(i)\n return -1","runtime":"57"},{"code":"from collections import Counter \nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n t=Counter(s)\n for i in t:\n if(t[i]==1):\n return s.index(i)\n return -1","runtime":"60"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n _dict = Counter(s)\n\n for k, v in _dict.items():\n if v == 1:\n return s.find(k)\n\n return -1\n ","runtime":"60"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n '''\n dict1 = {}\n for i in s:\n if i in dict1:\n dict1[i] += 1\n else:\n dict1[i] = 1\n st = \" \"\n for key , value in dict1.items():\n if( value == 1):\n st = key\n break\n for i in range(len(s)):\n if (st == s[i]):\n return i\n return -1\n '''\n s1 = Counter(s)\n print(s1)\n for i,e in s1.items():\n if e==1:\n return s.index(i)\n return -1\n","runtime":"64"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n count = Counter(s)\n \n for i,v in count.items():\n if v==1:\n return s.index(i)\n \n return -1","runtime":"64"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen = set()\n for i in s:\n if i not in seen and s.count(i) == 1:\n return s.index(i)\n seen.add(i)\n return -1\n ","runtime":"67"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n res = []\n dup = set()\n for ch in s:\n if ch not in dup:\n if ch in res:\n dup.add(ch)\n res.remove(ch)\n else:\n res.append(ch)\n if len(res)==0:\n return -1\n for ch in res:\n return s.index(ch)\n\n","runtime":"67"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen = set()\n for i, c in enumerate(s):\n if c in seen:\n continue\n if s.count(c) == 1:\n return i\n seen.add(c)\n return -1","runtime":"70"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n countS = Counter(s)\n for key in countS:\n if countS[key] == 1:\n return s.find(key)\n return -1","runtime":"70"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dict = {}\n for i, char in enumerate(s):\n if char in dict:\n dict[char] = -1\n else:\n dict[char] = i\n \n min_val = min(dict.values())\n max_val = max(dict.values())\n if min_val == max_val == -1:\n return -1\n \n if min_val == -1:\n return sorted(set(list(dict.values())))[1]\n else:\n return sorted(set(list(dict.values())))[0]","runtime":"74"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n d = Counter(s)\n\n for k, v in d.items():\n if v == 1:\n return s.index(k)\n\n return -1","runtime":"74"},{"code":"from collections import Counter\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n\n frequencies = Counter(s)\n \n for key in list(frequencies.keys()):\n\n if frequencies[key] > 1:\n del frequencies[key]\n \n \n for i in range(len(s)):\n if s[i] in frequencies:\n return i\n \n return -1\n\n\n","runtime":"77"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n count = Counter(s)\n\n for index, ch in enumerate(s):\n if count[ch] == 1:\n return index\n return -1","runtime":"77"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n counter = collections.Counter(s)\n\n for index,val in enumerate(s):\n if counter[val] == 1:\n return index\n \n return -1\n ","runtime":"80"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n\n for x in Counter(s): \n if (s.count(x)==1):\n return s.find(x)\n return -1 \n\n \n \n\n ","runtime":"80"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dic=Counter(s)\n for i in range(len(s)):\n if dic[s[i]]==1:\n return i\n return -1","runtime":"84"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"\n :type s: str\n :rtype: int\n \"\"\"\n # build hash map: character and how often it appears\n count = collections.Counter(s)\n \n # find the index\n for idx, ch in enumerate(s):\n if count[ch] == 1:\n return idx \n return -1","runtime":"94"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n counter = Counter(s)\n for i in range(len(s)):\n if counter[s[i]] == 1:\n return i\n\n return -1","runtime":"94"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n count = Counter(s)\n\n for i,c in enumerate(s):\n if count[c]==1:\n return i\n return -1\n \n \n\n ","runtime":"97"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n # hashmap \n # return the one that has a 1 as freq \n \n hashmap = {}\n unique_idx = 0\n for idx, i in enumerate(s):\n if i in hashmap:\n hashmap[i].append(idx)\n else:\n hashmap[i] = [idx]\n \n for k, v in hashmap.items():\n if len(v) == 1:\n return v[0]\n return -1\n \n \n# unique = []\n \n# for idx, i in enumerate(s):\n# if i not in unique:\n# unique.append(i)\n# else:\n# unique.remove(i)\n# if unique:\n# return unique[0]\n# return -1","runtime":"97"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n map_ = {}\n \n for i in range(len(s)):\n if s[i] not in map_:\n map_[s[i]] = i\n else:\n map_[s[i]] = -1\n \n min_index = float(\"inf\")\n for v in map_.values():\n if v != -1 and v < min_index:\n min_index = v\n return min_index if min_index != float(\"inf\") else -1","runtime":"100"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n char_count={}\n for char in s:\n char_count[char] = char_count.get(char,0)+1\n for i,char in enumerate(s):\n if char_count[char]==1:\n return i\n return -1","runtime":"100"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n mp = {}\n for ch in s:\n mp[ch] = mp.get(ch, 0) +1\n \n for i in range(len(s)):\n if mp[s[i]] == 1:\n return i\n \n return -1\n \n\n \n \n\n \n ","runtime":"104"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n d={}\n for i in s:\n if i not in d:\n d[i]=1\n else:\n d[i]+=1\n for i in d:\n if d[i]==1:\n return s.index(i)\n return -1","runtime":"104"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n hmap = {}\n\n for c in s:\n hmap[c] = hmap.get(c, 0) + 1\n\n for i,c in enumerate(s):\n if hmap[c] == 1:\n return i\n\n return -1","runtime":"107"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n charCounter = {}\n\n for c in s:\n if c not in charCounter:\n charCounter[c] = 0\n charCounter[c] += 1\n \n for i in range(len(s)):\n if charCounter[s[i]] == 1:\n return i\n \n return -1","runtime":"107"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n umap = dict()\n\n for i in range(len(s)):\n ch = s[i]\n if ch in umap:\n umap[ch].append(i)\n else:\n umap[ch] = [i]\n \n for k,v in umap.items():\n if len(v) == 1:\n return v[0]\n \n return -1 ","runtime":"110"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n world = {}\n\n for char in s:\n try:\n world[char] += 1\n except KeyError:\n world[char] = 1\n \n for index in range(len(s)):\n #try:\n if world[s[index]] == 1:\n return index\n #world.pop(s[index])\n #except KeyError:\n #continue\n\n return -1\n \n ","runtime":"110"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n count =defaultdict(int)\n\n for c in s:\n count[c]+=1\n for i,c in enumerate(s):\n if count[c]==1:\n return i\n return -1 \n ","runtime":"114"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n counter = {}\n for c in s:\n if c not in counter:\n counter[c] = 0\n counter[c] += 1\n \n for i,val in enumerate(s):\n if counter[val] == 1:\n return i\n \n return -1\n ","runtime":"114"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n letter_dict = {}\n \n for i, letter in enumerate(s):\n if not letter in letter_dict:\n letter_dict[letter] = [1, i]\n else:\n letter_dict[letter][0] += 1\n print(letter_dict)\n for k,v in letter_dict.items():\n if v[0]==1:\n return v[1]\n return -1","runtime":"117"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n freq = {}\n #counting frequencies in a dictionary\n for i in s:\n if i in freq:\n freq[i] += 1\n else:\n freq[i] = 1\n \n for i in range(len(s)):\n if freq[s[i]] == 1:\n return i\n return -1 \n \n \n \n","runtime":"117"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n count = {}\n for char in s:\n if char in count:\n count[char] += 1\n else:\n count[char] = 1\n for index, char in enumerate(s):\n if count[char] == 1:\n return index\n return -1\nsol = Solution()\ns = \"leetcode\"\nprint(sol.firstUniqChar(s)) ","runtime":"120"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n d = {}\n\n for c in s:\n if c in d:\n d[c] += 1\n else:\n d[c] = 1\n \n for i in range(len(s)):\n if d[s[i]] == 1:\n return i\n \n return -1","runtime":"120"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n char_dict = {}\n queue = []\n for i in range(len(s)):\n if s[i] in char_dict.keys():\n char_dict[s[i]]+=1\n else:\n char_dict[s[i]]=1\n queue.append((s[i],i))\n for char, index in queue:\n if char_dict[char] == 1:\n return index\n return -1","runtime":"124"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n keep = {}\n for char in s:\n if char in keep.keys():\n keep[char] +=1\n else:\n keep[char] = 1\n \n for index,char in enumerate(s):\n if keep.get(char) == 1:\n return index\n \n return -1\n ","runtime":"124"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n char_count = {}\n\n # Count occurrences of each character\n for c in s:\n if c not in char_count:\n char_count[c] = 0\n char_count[c] += 1\n\n # Find the first character that occurs only once\n for i in range(len(s)):\n if char_count[s[i]] == 1:\n return i\n\n return -1\n","runtime":"127"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n char_count = {}\n\n for c in s:\n if c not in char_count:\n char_count[c]=0\n char_count[c]+=1\n\n for i in range(len(s)):\n if char_count[s[i]]==1:\n return i\n return -1","runtime":"127"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n # s = [i for i in s]\n d = {}\n for i in range(len(s)):\n if s[i] in d.keys():\n d[s[i]].append(i)\n else:\n d[s[i]] = [i]\n for k, v in d.items():\n if len(v) == 1:\n return v[0]\n else:\n return -1\n \n ","runtime":"130"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n\n char_positions = dict()\n \n for i in range(len(s)):\n\n if s[i] not in char_positions:\n char_positions[s[i]] = []\n\n char_positions[s[i]].append(i)\n\n for i in range(len(s)):\n if(len(char_positions[s[i]]) == 1):\n return char_positions[s[i]][0]\n\n return -1","runtime":"130"},{"code":"from collections import deque\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n map = {}\n\n for char in s: \n if map.get(char):\n count = map.get(char) + 1\n map[char] = count\n else:\n map[char] = 1\n\n for i in range(len(s)):\n if map.get(s[i]) == 1:\n return i\n return -1","runtime":"134"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n ans = []\n for i in s:\n if i not in ans:\n ans.append(i)\n for i in ans:\n if s.count(i) == 1:\n return s.index(i)\n return -1\n ","runtime":"134"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n s_to_c = {}\n for i, a in enumerate(s):\n if a not in s_to_c:\n s_to_c[a] = 1\n else:\n s_to_c[a] += 1\n \n for k, v in s_to_c.items():\n if v == 1:\n for i in range(len(s)):\n if s[i] == k:\n return i\n \n return -1\n ","runtime":"137"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dict = {}\n\n # O(N)\n for i in range(len(s)):\n if s[i] not in dict:\n dict[s[i]] = 1\n else:\n dict[s[i]] += 1\n\n # O(N)\n for i in range(len(s)):\n if dict[s[i]] == 1:\n return i\n \n return -1\n\n \n \n \n\n ","runtime":"137"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n ans = []\n for i in s:\n if i not in ans:\n ans.append(i)\n for i in ans:\n if s.count(i) == 1:\n return s.index(i)\n return -1\n ","runtime":"140"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dic = {}\n for i in range(len(s)):\n if s[i] not in dic:\n dic[s[i]] = 0\n dic[s[i]] += 1\n \n for i in range(len(s)):\n if dic[s[i]] == 1:\n return i\n \n return -1 \n #return min(dic.values()) if min(dic.values())!=float('inf') else -1\n ","runtime":"140"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n candidates = dict()\n non_candidates = set()\n\n for index, c in enumerate(s):\n if c not in candidates.keys() and c not in non_candidates:\n candidates[c] = index\n else:\n if c in candidates.keys():\n del candidates[c]\n non_candidates.add(c)\n \n if len(candidates.values()) > 0:\n return min(candidates.values())\n else:\n return -1 \n ","runtime":"144"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n print(set(s))\n l1=[]\n for i in range(len(s)):\n if s[i] not in l1 and s.count(s[i])==1:\n return i\n l1.append(s[i])\n return -1","runtime":"144"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n alpha = {i:0 for i in alphabet}\n n = len(s)\n for i in range(0, n):\n if s[i] in alpha:\n alpha[s[i]] += 1\n\n for i in range(n):\n if alpha.get(s[i]) == 1:\n return i\n \n return -1\n","runtime":"147"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n unique_dict = dict()\n for i in range(len(s)):\n if s[i] not in unique_dict.keys():\n unique_dict[s[i]] = [i]\n else:\n unique_dict[s[i]] = [].append(i)\n print(unique_dict)\n for z in unique_dict.values():\n if z != None:\n return z[0]\n return -1","runtime":"147"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n\n char_positions = dict()\n \n for i in range(len(s)):\n\n if s[i] not in char_positions:\n char_positions[s[i]] = 0\n\n char_positions[s[i]] += 1\n\n for i in range(len(s)):\n if(char_positions[s[i]] == 1):\n return i\n\n return -1","runtime":"150"},{"code":"from collections import Counter\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n \n hashmap = {}\n for i in range(len(s)):\n if s[i] in hashmap:\n hashmap[s[i]] += 1\n else:\n hashmap[s[i]] = 1\n\n for i in range(len(s)):\n if hashmap[s[i]] == 1:\n return i\n\n return -1","runtime":"150"},{"code":"from collections import OrderedDict\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n find=OrderedDict()\n for i,char in enumerate(s):\n if char in find:\n count, _ = find[char]\n find[char] = (count + 1, _) \n else:\n find[char] = (1, i)\n for char, (count,i) in find.items():\n if count==1:\n return i\n return -1","runtime":"154"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dic = {}\n for i in range(len(s)):\n if s[i] not in dic:\n dic[s[i]] = i \n else:\n dic[s[i]] = float('inf')\n return min(dic.values()) if min(dic.values())!=float('inf') else -1\n ","runtime":"154"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n freq_map = {}\n idx_map = {}\n\n for i in range(len(s)):\n if s[i] not in freq_map:\n freq_map[s[i]] = 1\n else:\n freq_map[s[i]] += 1\n idx_map[s[i]] = i\n\n candidates = []\n for k, v in freq_map.items():\n if v == 1:\n candidates.append(k)\n\n if len(candidates) == 0:\n return -1\n else:\n first_idx = idx_map[candidates[0]]\n first_char = candidates[0]\n for c in candidates:\n first_idx = min(first_idx, idx_map[c])\n\n print(first_char)\n return first_idx","runtime":"157"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n stack1=[]\n stack2=[]\n \n for i in range(len(s)):\n if s[i] in stack1:\n stack1.remove(s[i])\n stack2.append(s[i])\n \n elif s[i] in stack2:\n continue\n \n else:\n stack1.append(s[i])\n \n \n return -1 if not stack1 else s.index(stack1[0])\n ","runtime":"157"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n queue = deque()\n chars = [0] * 26\n\n for i, c in enumerate(s):\n chars[ord(c)-ord('a')]+=1\n if chars[ord(c)-ord('a')] == 1:\n queue.append((c, i))\n while queue and chars[ord(queue[0][0])-ord('a')] > 1:\n queue.popleft()\n \n if queue:\n return queue[0][1]\n else:\n return -1\n\n\n\n ","runtime":"160"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n chars = [-1] * 256\n for i in range(len(s)):\n if chars[ord(s[i])] == -1:\n chars[ord(s[i])] = [1, i]\n else:\n temp = chars[ord(s[i])]\n chars[ord(s[i])] = [temp[0]+1, temp[1]]\n min_index = 10 ** 6\n for i in chars:\n if i != -1:\n if i[0] == 1:\n min_index = min(min_index, i[1])\n if min_index == 10 ** 6:\n return -1\n return min_index ","runtime":"160"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n repeat_dict = {}\n for i in range(len(s)):\n if s[i] not in repeat_dict:\n repeat_dict[s[i]] = tuple((i,1))\n else:\n repeat_dict[s[i]] = tuple((i,repeat_dict[s[i]][1]+1))\n y_filtered = list(filter(lambda x: x[1][1] <=1, repeat_dict.items()))\n\n y = sorted(y_filtered, key = lambda x: x[1][0])\n if not y:\n return -1\n else:\n print(\"y: \",y)\n return y[0][1][0]\n\n # def dict_empty(self):\n # if self.repeat_dict not \n","runtime":"163"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n world = {}\n\n for char in s:\n try:\n world[char] += 1\n except KeyError:\n world[char] = 1\n \n for index in range(len(s)):\n try:\n if world[s[index]] == 1:\n return index\n world.pop(s[index])\n except KeyError:\n continue\n\n return -1\n \n ","runtime":"163"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"\n leetcode\n i\n l = 0\n e = 2\n t = 3\n c = 4\n o = 5\n d = 6\n e = 7\n \"\"\"\n n = len(s)\n seen = {}\n for i in range(n):\n char = s[i]\n if char in seen:\n seen[char] += 1\n else:\n seen[char] = 1\n for i in range(n):\n char = s[i]\n if (char in seen and seen[char] == 1):\n return i\n return -1\n ","runtime":"167"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n def charToIdx(ch):\n return ord(ch) - ord('a')\n a = [0] * 26\n for i, c in enumerate(s):\n idx = charToIdx(c)\n a[idx] += 1\n for i, c in enumerate(s):\n idx = charToIdx(c)\n if a[idx] == 1:\n return i\n return -1\n ","runtime":"167"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n if len(s) == 1:\n return 0\n left_dict = {}\n right_dict = {}\n is_present = set()\n left = 0\n right = len(s) - 1\n while left <= right:\n if s[left] in is_present:\n if s[left] in left_dict.keys():\n left_dict.pop(s[left])\n if s[left] in right_dict.keys():\n right_dict.pop(s[left])\n else:\n # print(\"Inserting \" + s[left] + \" to left dict\")\n left_dict[s[left]] = left\n is_present.add(s[left])\n if s[right] in is_present:\n if s[right] in right_dict.keys():\n # print(\"Popping \" + s[right] + \" from right_dict\")\n right_dict.pop(s[right])\n if s[right] in left_dict.keys():\n # print(\"Popping \" + s[right] + \" from right_dict\")\n left_dict.pop(s[right])\n else:\n # print(\"Inserting \" + s[right] + \" to right dict\")\n right_dict[s[right]] = right\n is_present.add(s[right])\n\n left +=1 \n right -= 1\n\n if len(left_dict) > 0:\n iterator = iter(left_dict.items())\n _, first_value = next(iterator)\n return first_value\n\n if len(right_dict) > 0:\n iterator = iter(reversed(right_dict.items()))\n _, first_value = next(iterator)\n return first_value\n\n return -1","runtime":"170"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n # charCounter = Counter(s)\n\n # for (i, char) in enumerate(s):\n # if charCounter[char] == 1:\n # return i\n \n # return -1\n\n charIndex = dict()\n\n for (i, char) in enumerate(s):\n charIndex[char] = i if char not in charIndex else float('inf')\n\n for char in s:\n if charIndex[char] != float('inf'):\n return charIndex[char]\n\n return -1 \n\n ","runtime":"170"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n last_appear = {}\n for i, c in enumerate(s):\n last_appear[c] = i\n \n seen = set()\n for i, c in enumerate(s):\n print(c)\n if c in seen:\n continue\n seen.add(c)\n if last_appear[c] == i:\n return i\n \n return -1","runtime":"173"},{"code":"def find_index(lst,s):\n for i in range(0,len(lst)):\n if s==lst[i]:\n return i\n return -1\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n lst=[]\n dic={}\n for i in range(0,len(s)):\n temp=dic.get(s[i],\"none\")\n if temp==\"none\":\n dic[s[i]]=1\n else:\n dic[s[i]]+=1\n print(dic)\n print(f\"lst {lst}\")\n for i,j in enumerate(s):\n temp=dic.get(s[i])\n if temp==1:\n return i\n return -1","runtime":"173"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n n = len(s)\n mp = {}\n\n def traverse(idx):\n if idx < 0:\n return\n\n if s[idx] not in mp:\n mp[s[idx]] = 1\n else:\n mp[s[idx]] += 1\n\n traverse(idx - 1)\n\n traverse(n - 1)\n for i in range(n):\n if mp[s[i]] == 1:\n return i\n\n return -1","runtime":"177"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n s_c = Counter(s)\n seen = [-1 for _ in range(26)]\n for i, char in enumerate(s):\n if seen[ord(char) - 97] == -1:\n seen[ord(char) - 97] = i\n else:\n seen[ord(char)- 97] = float(\"inf\")\n smallest = float(\"inf\")\n for val in seen:\n if val != float(\"inf\") and val != -1:\n smallest = min(smallest, val)\n return smallest if smallest != float(\"inf\") else -1\n\n \n\n ","runtime":"177"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n chars = [0] * 26\n\n maxCharQty = -1\n for letter in s:\n asc = ord(letter) - 97\n chars[asc] += 1\n maxCharQty = max(chars[asc], maxCharQty)\n\n if maxCharQty == 1:\n return 0\n\n count = 0\n for letter in s:\n n = ord(letter) - 97\n if chars[n] == 1:\n return count\n count += 1\n\n return -1\n","runtime":"180"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"\n // maintain a map\n \n \n iterate through the characters\n \n if its in the map:\n continue\n \n if its not in the map\n add to the map, initialize count 0\n \n \n \"\"\"\n \n hmap = {}\n \n \n for i in range(len(s)):\n char = s[i]\n \n count = 0\n if char in hmap:\n x = hmap[char]\n count = x[1]\n \n #index, count\n count+=1\n hmap[char] = tuple([i, count])\n \n low = len(s) + 1\n for index, freq in hmap.values():\n if freq == 1:\n low = min(low, index)\n\n return low if low != len(s) + 1 else -1","runtime":"180"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n yoasobi = {}\n for i in range(0,len(s)):\n if yoasobi.get(s[i],[0,0]) == [0,0]:\n yoasobi[s[i]] = [1,i]\n else:\n yoasobi[s[i]] = []\n for ikura in s:\n if yoasobi[ikura]:\n return yoasobi[ikura][1]\n return -1","runtime":"183"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen = defaultdict(int)\n queue = deque([])\n\n for i in range(len(s)):\n seen[s[i]] += 1\n queue.append((s[i],i))\n while queue and seen[queue[0][0]] > 1:\n queue.popleft()\n\n return queue[0][1] if queue else -1","runtime":"183"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen_once = 0\n seen_twice = 0\n \n \n \n for i, ch in enumerate(s):\n asci_value = ord(ch) - ord('a')\n mask = 1 << asci_value \n if mask & seen_once == 0 and mask & seen_twice == 0:\n seen_once |= mask\n elif mask & seen_once:\n seen_twice |= mask\n seen_once &= ~mask\n \n for i, ch in enumerate(s):\n asci_value = ord(ch) - ord('a')\n mask = 1 << asci_value\n if mask & seen_once:\n print(mask & seen_once)\n return i\n\n \n return -1","runtime":"187"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n def charToIdx(ch):\n return ord(ch) - ord('a')\n a = [0] * 26\n for i, c in enumerate(s):\n idx = charToIdx(c)\n a[idx] += 1\n for i, c in enumerate(s):\n idx = charToIdx(c)\n if a[idx] == 1:\n return i\n return -1\n ","runtime":"187"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n mapper = OrderedDict()\n \n for i, l in enumerate(s):\n if mapper.get(l) is None:\n mapper[l] = [i, 1]\n else:\n index, count = mapper.get(l)\n mapper[l] = [index, count + 1]\n\n for k in mapper:\n index, count = mapper[k]\n\n if count == 1:\n return index\n\n return -1","runtime":"190"},{"code":"'''\n Observations: \n - input: a string 's'\n - output: index value of first non-repeating character\n\n Simulate: \n Input: s = \"leetcode\"\n Output: 0\n\n - does order matter? \n - can we rearrange the characters? -- yes\n - can input only contain duplicates? - yes \n\n sort s \n iterate while keeping count and if we iterate next and character does not reappear, return it \n\n pseudocode: \n sortedString = ''.join(sorted(s))\n \n hashTable = {} \n\n for c in sortedString: \n if c not in hashTable: \n hashTable[c] = 1 \n else: \n hashTable[c] += 1\n \n for key, value in hashTable: \n if value == 1: \n return key\n \n return -1 \n\n'''\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n sortedString = ''.join(sorted(s))\n\n hashTable = {} \n\n for c in sortedString: \n if c not in hashTable:\n hashTable[c] = 1\n else: \n hashTable[c] += 1\n\n for index, c in enumerate(s): \n if hashTable[c] == 1:\n return index\n\n return -1 ","runtime":"190"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n l = len(s)\n val_fidx = dict()\n val_occur = dict()\n for i in range(l):\n if s[i] not in val_fidx:\n val_fidx[s[i]] = i\n if s[i] in val_occur:\n val_occur[s[i]] += 1\n if s[i] not in val_occur:\n val_occur[s[i]] = 1\n\n \n min_idx = l\n for i in range(l):\n if val_occur[s[i]] == 1 and val_fidx[s[i]] < min_idx:\n min_idx = val_fidx[s[i]]\n \n if min_idx == l:\n return -1\n else:\n return min_idx\n ","runtime":"203"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n d = defaultdict(int)\n q = deque()\n for idx, num in enumerate(s):\n if num in d:\n d[num] = d[num] + 1\n else:\n d[num] = 1\n q.append((num, idx))\n while q and d[q[0][0]] > 1:\n q.popleft()\n return -1 if not q else q.popleft()[1]\n","runtime":"203"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n char_dict = defaultdict()\n for char in s:\n char_dict[char] = char_dict.get(char, 0) + 1\n print(char_dict)\n\n for i in range(0, len(s)):\n print(s[0])\n if char_dict[s[i]] == 1:\n return i\n \n return -1","runtime":"207"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n occur = {}\n repeat = []\n for i in range(len(s)):\n if s[i] in occur:\n occur[s[i]] = i\n repeat.append(s[i])\n else:\n occur[s[i]] = i\n \n for i in range(len(s)):\n if s[i] not in repeat:\n return i\n return -1","runtime":"207"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n temp=[0]*26\n for i in range(len(s)):\n if temp[ord(s[i])-ord('a')]==0:\n temp[ord(s[i])-ord('a')]=1\n else:\n temp[ord(s[i])-ord('a')]=-1\n for i in range(len(s)):\n if temp[ord(s[i])-ord('a')]==1:\n return i\n return -1","runtime":"210"},{"code":"\n\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n\n q = deque()\n frequency_map = {}\n\n\n for index,char in enumerate(s):\n\n if char in frequency_map:\n frequency_map[char] +=1 \n else:\n frequency_map[char] = 1\n \n while q and frequency_map[q[0][0]] > 1:\n\n q.popleft()\n \n\n q.append((char,index))\n \n if q and frequency_map[q[0][0]] <= 1:\n return q[0][1]\n \n else:\n return -1\n\n\n\n ","runtime":"210"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n queue = deque()\n chars = Counter()\n\n for i, c in enumerate(s):\n chars[c]+=1\n if chars[c] == 1:\n queue.append((c, i))\n while queue and chars[queue[0][0]] > 1:\n queue.popleft()\n \n if queue:\n return queue[0][1]\n else:\n return -1\n\n\n\n ","runtime":"213"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n q=[]\n cf=[0]*26\n\n for i,c in enumerate(s):\n ind=ord(c)-ord('a')\n cf[ind]+=1\n q.append((c,i))\n\n while q and cf[ord(q[0][0])-ord('a')]>1:\n q.pop(0)\n \n return q[0][1] if q else -1\n","runtime":"217"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n #return s.count('')\n \n result = {}\n \n for i in range(len(s)):\n if s[i] not in result:\n result[s[i]] = [i, 1]\n else:\n result[s[i]] += [i, 1]\n print(result)\n for val in result.values():\n print(\"val\", val[0], val[1])\n if len(val) ==2 and val[1] == 1:\n #print(key, result[key])\n return val[0]\n return -1","runtime":"217"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n #return s.count('')\n \n result = {}\n \n for i in range(len(s)):\n if s[i] not in result:\n result[s[i]] = [i, 1]\n else:\n result[s[i]] += [i, 1]\n print(result)\n for val in result.values():\n if len(val) ==2 and val[1] == 1:\n return val[0]\n return -1","runtime":"220"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n #return s.count('')\n \n result = {}\n \n for i in range(len(s)):\n if s[i] not in result:\n result[s[i]] = [i, 1]\n else:\n result[s[i]] += [i, 1]\n print(result)\n for val in result.values():\n if len(val) ==2 and val[1] == 1:\n return val[0]\n return -1","runtime":"220"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n maps = {}\n filter = set()\n for i in s:\n if i not in maps:\n maps[i]=1\n filter.add(i)\n else:\n maps[i]+=1\n try:\n filter.remove(i)\n except Exception:\n pass\n for idx,i in enumerate(s):\n if i in filter:\n return idx\n return -1\n","runtime":"223"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \"\"\"\n s non repeating chat in the string ..\n 1. getting the chars frequancy in a map char: ferq\n 2. iterate the string and when the frequancy is 1 return index\n\n \"\"\"\n letter_freq_map = {}\n char_list = list(s)\n for i in range(len(s)):\n letter =\"\".join(char_list[i]) \n if letter_freq_map.get(letter) == None:\n letter_freq_map[letter] = 1\n else:\n letter_freq_map[letter] +=1\n\n for i in range(len(s)):\n if letter_freq_map[s[i]] == 1:\n return i\n return -1","runtime":"227"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n l = dict()\n for i,j in enumerate(s):\n if j in l.values():\n continue\n else:\n l[i] = j\n\n li =[]\n for i in l.keys():\n if s.count(l[i])<=1:\n li.append(i)\n\n \n if li:\n return li[0]\n else:\n return -1 ","runtime":"230"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n l=[i for i in s]\n s=''\n for k in l:\n if k not in s:\n s+=k\n r=-1\n for j in s:\n if l.count(j)==1:\n r=l.index(j)\n break\n return r","runtime":"233"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n l=[]\n c=''\n for k in s:\n l.append(k)\n if k not in c:\n c+=k\n r=-1\n for j in c:\n if l.count(j)==1:\n r=l.index(j)\n break\n return r","runtime":"237"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n lis = list(s)\n dup = []\n data = {}\n for p,i in enumerate(lis):\n if i not in data and i not in dup: \n data[i]=p\n else: \n if i in dup:\n pass\n else:\n dup.append(i)\n del data[i]\n l=list(data.values())\n return -1 if not l else l[0] ","runtime":"237"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen_letters = []\n count = 0\n right = len(s)\n \n while count < right:\n \n if s[count] in seen_letters and count + 1 < right:\n count += 1\n \n char = s[count]\n \n find = s[count+1:].find(char)\n if find is -1 and char not in seen_letters:\n return count\n else:\n seen_letters.append(char)\n \n count += 1\n return -1","runtime":"240"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n caracteres = []\n repetidos = []\n for letra in s:\n if letra not in caracteres:\n caracteres += [letra]\n else:\n repetidos += [letra]\n for letra in s:\n if letra not in repetidos:\n try:\n return s.index(letra)\n except ValueError:\n return -1\n return -1\n\n\n ","runtime":"240"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen_letters = []\n count = 0\n right = len(s)\n \n while count < right:\n \n if s[count] in seen_letters and count + 1 < right:\n count += 1\n \n char = s[count]\n \n find = s[count+1:].find(char)\n if find is -1 and char not in seen_letters:\n return count\n else:\n seen_letters.append(char)\n \n count += 1\n return -1","runtime":"243"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen_letters = []\n count = 0\n right = len(s)\n \n while count < right:\n \n if s[count] in seen_letters and count + 1 < right:\n count += 1\n \n char = s[count]\n \n find = s[count+1:].find(char)\n if find is -1 and char not in seen_letters:\n return count\n else:\n seen_letters.append(char)\n \n count += 1\n return -1","runtime":"243"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n lis = list(s)\n dup = []\n data = {}\n for p,i in enumerate(lis):\n if i not in data and i not in dup: \n data[i]=p\n else: \n if i in dup:\n pass\n else:\n dup.append(i)\n del data[i]\n l=list(data.values())\n return -1 if not l else l[0] ","runtime":"247"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n L = []\n c = []\n for i in range (len(s)):\n if s[i] in L and s[i] in c:\n c.remove(s[i])\n elif s[i] not in L :\n L.append(s[i])\n c.append(s[i])\n if c:\n return s.index(c[0])\n return -1","runtime":"250"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n charDict = {}\n \n for i in range(len(s)):\n char = s[i]\n curDict = charDict.get(char, [])\n curDict.append(i)\n charDict.update({char: curDict})\n \n print(charDict)\n \n mins = []\n for indices in charDict.values():\n if len(indices) == 1:\n mins.extend(indices)\n \n return min(mins) if len(mins) > 0 else -1","runtime":"250"},{"code":"import collections\nclass Solution:\n # SOLUTION COPIED FROM: https://leetcode.com/discuss/general-discussion/4753055/387.-First-Unique-Character-in-a-String/\n def firstUniqChar(self, s: str) -> int:\n char_counts = {}\n q = collections.deque()\n ans = -1\n\n for i in range(len(s)):\n if s[i] in char_counts:\n char_counts[s[i]] += 1\n else:\n char_counts[s[i]] = 1\n\n q.append([s[i], i])\n\n while q:\n if char_counts[q[0][0]] > 1:\n q.popleft()\n else:\n ans = q[0][1]\n break\n \n return ans","runtime":"253"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n sorted_s = sorted(s)\n blacklist=[]\n whitelist=[]\n for index,letter in enumerate(sorted_s):\n try:\n if letter != sorted_s[index+1] and letter not in blacklist:\n whitelist.append(letter)\n blacklist.append(letter)\n except:\n if letter not in blacklist:\n whitelist.append(letter)\n for index,letter in enumerate(s):\n if letter in whitelist:\n return index\n return -1","runtime":"253"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\n alpha = {i:0 for i in alphabet}\n n = len(s)\n for i in range(0, n):\n if s[i] in alpha:\n alpha[s[i]] += 1\n \n print(alpha)\n\n for i in s:\n print(alpha.get(i))\n if alpha.get(i) == 1:\n return s.find(i)\n \n return -1\n","runtime":"257"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n char_to_count = reduce(lambda acc, c: {**acc, c: acc.get(c, 0) + 1}, s, {})\n for i, c in enumerate(s):\n if char_to_count[c] == 1:\n return i\n return -1","runtime":"257"},{"code":"from collections import Counter\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n \n freq = Counter(s)\n print(freq)\n\n # find the index\n for idx, ch in enumerate(s):\n print(idx, ch)\n if freq[ch] == 1:\n return idx \n return -1","runtime":"260"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n for i in range(len(s)):\n if(s[i] not in s[:i] and s[i] not in s[i+1:]):\n return i\n return -1\n\n ","runtime":"260"},{"code":"class Solution:\n def firstUniqChar(self, s):\n # if len(s)//2 == len(set(s)):\n # return -1\n # if len(s)==1:\n # return 0\n for i in range(len(s)):\n if s[i] not in s[0:i] and s[i] not in s[i+1::]:\n return i\n return -1\n ","runtime":"263"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n seen = {}\n for index in range(len(s)):\n if s[index] not in seen:\n seen[s[index]] = index\n else:\n seen[s[index]] = float(\"inf\")\n minimum = min(list(seen.values()))\n if minimum == float(\"inf\"):\n return -1\n return minimum","runtime":"263"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n l = len(s)\n for i in range(0,l):\n if (s[i] not in s[:i]) and (s[i] not in s[i+1:]):\n return i\n return -1\n ","runtime":"267"},{"code":"class Solution:\n\tdef firstUniqChar(self, s: str) -> int:\n\t\tfor i in range(len(s)):\n\t\t\tif s[i] not in s[:i] and s[i] not in s[i+1:]:\n\t\t\t\treturn i\n\t\treturn -1","runtime":"267"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n hashmap = {}\n for index, value in enumerate(s):\n if value in hashmap:\n hashmap[value] = hashmap[value] = [1]*100\n else:\n hashmap[value] = [index]\n for element in hashmap:\n if len(hashmap[element]) == 1:\n return hashmap[element][0]\n return -1","runtime":"270"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n for i in range(len(s)):\n if not (s[i] in s[:i] or s[i] in s[i+1:]):\n return i\n \n return -1","runtime":"270"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n a=len(s)\n for i in range(0,a):\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\n return i\n return -1\n \n","runtime":"273"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n split=list(s)\n duplicate=set()\n indexes={}\n count={}\n for i in split:\n num=1\n if i not in duplicate:\n duplicate.add(i)\n else:\n num+=1 \n count[i]=num\n indexes[i]=split.index(i)\n for key,values in count.items():\n if values == 1:\n return indexes[key]\n return -1\n ","runtime":"273"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n hash={}\n lenght = len(s)\n for i in range(lenght):\n print(s[i])\n if s[i] in hash:\n hash[s[i]] = -2\n else:\n hash[s[i]] = i\n \n for i in hash.values():\n print(hash)\n if i > -1:\n return i\n \n return -1","runtime":"277"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n # d = {}\n # for elem in set(s):\n # if s.count(elem) == 1:\n # d[elem] = s.index(elem)\n # if d:\n # return min(d.values())\n # else:\n # return -1\n\n for i in range(len(s)):\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\n return i\n return -1\n\n\n ","runtime":"277"},{"code":"from abc import ABC, abstractmethod\n\nclass MyDict(ABC):\n @abstractmethod\n def __getitem__(self, key):\n pass\n\n @abstractmethod\n def __setitem__(self, key, value):\n pass\n\n @abstractmethod\n def __missing__(self, value):\n pass\n\n @abstractmethod\n def __contains__(self, key):\n pass\n\n\nclass DefaultDict(MyDict):\n def __init__(self, default_factory=None):\n self.default_factory = default_factory\n self.d = {}\n\n def __getitem__(self, key):\n if key not in self:\n return self.__missing__(key)\n return self.d[key]\n\n def __setitem__(self, key, value):\n self.d[key] = value\n\n def __missing__(self, key):\n if self.default_factory is None:\n raise KeyError\n self.d[key] = self.default_factory()\n return self.d[key]\n\n def __contains__(self, key):\n return key in self.d\n\n def __repr__(self):\n return repr(self.d)\n\n\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n char_to_count = DefaultDict(int)\n for c in s:\n char_to_count[c] += 1\n for i, c in enumerate(s):\n if char_to_count[c] == 1:\n return i\n return -1\n","runtime":"280"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n for i in range(len(s)):\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\n return i\n \n return -1","runtime":"280"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n for i in range(len(s)):\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\n return i\n return -1 \n \n ","runtime":"283"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n for i in range(len(s)):\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\n return i\n return -1 \n \n ","runtime":"283"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n # d = {}\n # for elem in set(s):\n # if s.count(elem) == 1:\n # d[elem] = s.index(elem)\n # if d:\n # return min(d.values())\n # else:\n # return -1\n\n for i in range(len(s)):\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\n return i\n return -1\n\n\n ","runtime":"287"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n d = {}\n for i in range(len(s)):\n if s[i] in s[:i] or s[i] in s[i+1:]:\n continue\n else:\n return i\n return -1","runtime":"287"},{"code":"class Solution(object):\n def firstUniqChar(self, s):\n \"\"\"\n :type s: str\n :rtype: int\n \"\"\"\n chars = {}\n removedChars = []\n for index, char in enumerate(s):\n if char in chars or char in removedChars:\n if char in chars: chars.pop(char)\n removedChars.append(char)\n else:\n chars[char] = index\n \n if chars != {}:\n for key in chars:\n return chars[key]\n else:\n return -1\n","runtime":"290"},{"code":"from collections import Counter\n\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n counts = Counter(s)\n\n for i,char in enumerate(s):\n print(i)\n print(char)\n if counts[char] == 1:\n return i\n return -1\n\n\n\n\n\n ","runtime":"290"}],"string":"[\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"map = {}\\n for i in s:\\n if i in map:\\n map[i] = map[i] + 1\\n else:\\n map[i] = 1\\n \\n for i in map:\\n if map[i] == 1:\\n return s.index(i)\\n return -1\\n \\n \\\"\\\"\\\"\\n text = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n idx = float(\\\"inf\\\")\\n for i in text:\\n if(i in s):\\n x = s.find(i)\\n if x==s.rfind(i):\\n idx=min(idx,x)\\n return -1 if idx == float(\\\"inf\\\") else idx\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n letters = 'abcdefghijklmnopqrstuvwxyz'\\n idx = 1_000_000\\n for l in letters:\\n idx_left = s.find(l)\\n if idx_left != -1 and s.rfind(l) == idx_left:\\n idx = min(idx, idx_left)\\n return idx if idx != 1_000_000 else -1\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n alphabeta = 'abcdefghijklmnopqrstuvwxyz'\\n res = 100000\\n\\n for ch in alphabeta:\\n index = s.find(ch)\\n if index != -1 and s.rfind(ch) == index:\\n res = min(res, index)\\n \\n return res if res != 100000 else -1\\n\\n\\n# Solution 2: ---------------\\n # count = collections.Counter(s)\\n # count = {}\\n # for ch in s:\\n # if ch in count:\\n # count[ch] += 1\\n # else:\\n # count[ch] = 1\\n # # print(count)\\n\\n # for index, char in enumerate(s):\\n # if count[char] == 1: \\n # return index\\n \\n # return -1\\n\\n# Solution 1-1: -------------\\n # char_dict = {}\\n\\n # for i in range(len(s)):\\n # if s[i] not in char_dict:\\n # char_dict[s[i]] = [i]\\n # else:\\n # char_dict[s[i]].append(i)\\n \\n # for key, value in char_dict.items():\\n # if len(value) == 1:\\n # return value[0]\\n\\n # return -1\\n\\n# Solution 1-2: ----------------\\n # res = 0\\n # char_dict = {}\\n\\n # for i in range(len(s)):\\n # if s[i] not in char_dict:\\n # char_dict[s[i]] = [i]\\n # else:\\n # char_dict[s[i]].append(i)\\n # while res < len(s) and s[res] in char_dict and len(char_dict[s[res]]) > 1:\\n # res += 1\\n\\n # if res == len(s):\\n # return -1\\n # else:\\n # return res\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n text = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n idx = float(\\\"inf\\\")\\n for i in text:\\n if(i in s):\\n x = s.find(i)\\n if x==s.rfind(i):\\n idx=min(idx,x)\\n return -1 if idx == float(\\\"inf\\\") else idx\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n text = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n idx = float(\\\"inf\\\")\\n for i in text:\\n if (i in s):\\n x = s.find(i)\\n if x == s.rfind(i):\\n idx = min(idx, x)\\n return -1 if idx == float(\\\"inf\\\") else idx\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"map = {}\\n for i in s:\\n if i in map:\\n map[i] = map[i] + 1\\n else:\\n map[i] = 1\\n \\n for i in map:\\n if map[i] == 1:\\n return s.index(i)\\n return -1\\n \\n \\\"\\\"\\\"\\n text = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n idx = float(\\\"inf\\\")\\n for i in text:\\n if(i in s):\\n x = s.find(i)\\n if x==s.rfind(i):\\n idx=min(idx,x)\\n return -1 if idx == float(\\\"inf\\\") else idx\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n hashmap = {}\\n res = float(\\\"inf\\\")\\n \\n for letter in set(s):\\n hashmap[letter] = s.count(letter)\\n \\n for key, val in hashmap.items():\\n if val == 1:\\n res = min(res, s.index(key))\\n \\n if res != float(\\\"inf\\\"):\\n return res\\n else:\\n return -1\\n \\n \\n \\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n arr = [s.index(i) for i in set(s) if s.count(i) == 1]\\n return sorted(arr)[0] if arr else -1\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n key = 'abcdefghijklmnopqrstuvwxyz' # Pre-defined order of characters\\n idx = 10**5 # Set an initial large index\\n \\n # Iterate through each character in the pre-defined order\\n for i in key:\\n x = s.find(i) # Find the first occurrence of the character\\n # Check if the character is unique (not found after the first occurrence)\\n if x != -1 and x == s.rfind(i):\\n idx = min(idx, x) # Update the minimum index\\n \\n # Return the minimum index if found, otherwise return -1\\n return idx if idx != 10**5 else -1\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"map = {}\\n for i in s:\\n if i in map:\\n map[i] = map[i] + 1\\n else:\\n map[i] = 1\\n \\n for i in map:\\n if map[i] == 1:\\n return s.index(i)\\n return -1\\n \\n \\\"\\\"\\\"\\n text = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n idx = float(\\\"inf\\\")\\n for i in text:\\n if(i in s):\\n x = s.find(i)\\n if x==s.rfind(i):\\n idx=min(idx,x)\\n return -1 if idx == float(\\\"inf\\\") else idx\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n\\n uniqueLetters = set(s)\\n letterIndexes = []\\n\\n for uniqueLetter in uniqueLetters:\\n if s.count(uniqueLetter) == 1: \\n letterIndexes.append(s.index(uniqueLetter))\\n \\n if letterIndexes:\\n return min(letterIndexes)\\n return -1\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n letters = string.ascii_lowercase\\n print(letters)\\n out = [s.index(l) for l in letters if s.count(l)==1]\\n if(len(out)>=1):\\n return min(out)\\n return -1\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n idx = []\\n for ss in set(s):\\n if s.count(ss) == 1:\\n idx.append(s.index(ss))\\n if idx:\\n return min(idx)\\n else:\\n return -1\\n\\n\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n st = set(s)\\n mn = len(s) + 5\\n for i in st:\\n if s.count(i) == 1:\\n mn = min(s.index(i), mn)\\n\\n if not len(s) + 5 == mn:\\n return mn\\n return -1\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n st = set(s)\\n l = set()\\n for i in st:\\n if s.count(i) == 1:\\n l.add(i)\\n mn = len(s)\\n\\n if len(l):\\n for i in l:\\n mn = min(s.index(i), mn)\\n return mn\\n return -1\",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"from string import ascii_lowercase as abc\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n instances_of_1 = []\\n for i in abc:\\n if s.count(i) == 1:\\n instances_of_1.append(i)\\n \\n print(instances_of_1)\\n\\n if len(instances_of_1) == 0:\\n return -1\\n else:\\n first_indexes = [s.find(i) for i in instances_of_1]\\n return min(first_indexes)\\n \",\n \"runtime\": \"54\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n freq = Counter(s)\\n print(freq)\\n\\n # find the index\\n for k,v in freq.items():\\n if v == 1:\\n return s.index(k)\\n return -1\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n s1 = Counter(s)\\n for i,e in s1.items():\\n if e==1:\\n return s.index(i)\\n return -1\",\n \"runtime\": \"57\"\n },\n {\n \"code\": \"from collections import Counter \\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n t=Counter(s)\\n for i in t:\\n if(t[i]==1):\\n return s.index(i)\\n return -1\",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n _dict = Counter(s)\\n\\n for k, v in _dict.items():\\n if v == 1:\\n return s.find(k)\\n\\n return -1\\n \",\n \"runtime\": \"60\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n '''\\n dict1 = {}\\n for i in s:\\n if i in dict1:\\n dict1[i] += 1\\n else:\\n dict1[i] = 1\\n st = \\\" \\\"\\n for key , value in dict1.items():\\n if( value == 1):\\n st = key\\n break\\n for i in range(len(s)):\\n if (st == s[i]):\\n return i\\n return -1\\n '''\\n s1 = Counter(s)\\n print(s1)\\n for i,e in s1.items():\\n if e==1:\\n return s.index(i)\\n return -1\\n\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n count = Counter(s)\\n \\n for i,v in count.items():\\n if v==1:\\n return s.index(i)\\n \\n return -1\",\n \"runtime\": \"64\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen = set()\\n for i in s:\\n if i not in seen and s.count(i) == 1:\\n return s.index(i)\\n seen.add(i)\\n return -1\\n \",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n res = []\\n dup = set()\\n for ch in s:\\n if ch not in dup:\\n if ch in res:\\n dup.add(ch)\\n res.remove(ch)\\n else:\\n res.append(ch)\\n if len(res)==0:\\n return -1\\n for ch in res:\\n return s.index(ch)\\n\\n\",\n \"runtime\": \"67\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen = set()\\n for i, c in enumerate(s):\\n if c in seen:\\n continue\\n if s.count(c) == 1:\\n return i\\n seen.add(c)\\n return -1\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n countS = Counter(s)\\n for key in countS:\\n if countS[key] == 1:\\n return s.find(key)\\n return -1\",\n \"runtime\": \"70\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dict = {}\\n for i, char in enumerate(s):\\n if char in dict:\\n dict[char] = -1\\n else:\\n dict[char] = i\\n \\n min_val = min(dict.values())\\n max_val = max(dict.values())\\n if min_val == max_val == -1:\\n return -1\\n \\n if min_val == -1:\\n return sorted(set(list(dict.values())))[1]\\n else:\\n return sorted(set(list(dict.values())))[0]\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n d = Counter(s)\\n\\n for k, v in d.items():\\n if v == 1:\\n return s.index(k)\\n\\n return -1\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n\\n frequencies = Counter(s)\\n \\n for key in list(frequencies.keys()):\\n\\n if frequencies[key] > 1:\\n del frequencies[key]\\n \\n \\n for i in range(len(s)):\\n if s[i] in frequencies:\\n return i\\n \\n return -1\\n\\n\\n\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n count = Counter(s)\\n\\n for index, ch in enumerate(s):\\n if count[ch] == 1:\\n return index\\n return -1\",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n counter = collections.Counter(s)\\n\\n for index,val in enumerate(s):\\n if counter[val] == 1:\\n return index\\n \\n return -1\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n\\n for x in Counter(s): \\n if (s.count(x)==1):\\n return s.find(x)\\n return -1 \\n\\n \\n \\n\\n \",\n \"runtime\": \"80\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dic=Counter(s)\\n for i in range(len(s)):\\n if dic[s[i]]==1:\\n return i\\n return -1\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"\\n :type s: str\\n :rtype: int\\n \\\"\\\"\\\"\\n # build hash map: character and how often it appears\\n count = collections.Counter(s)\\n \\n # find the index\\n for idx, ch in enumerate(s):\\n if count[ch] == 1:\\n return idx \\n return -1\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n counter = Counter(s)\\n for i in range(len(s)):\\n if counter[s[i]] == 1:\\n return i\\n\\n return -1\",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n count = Counter(s)\\n\\n for i,c in enumerate(s):\\n if count[c]==1:\\n return i\\n return -1\\n \\n \\n\\n \",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n # hashmap \\n # return the one that has a 1 as freq \\n \\n hashmap = {}\\n unique_idx = 0\\n for idx, i in enumerate(s):\\n if i in hashmap:\\n hashmap[i].append(idx)\\n else:\\n hashmap[i] = [idx]\\n \\n for k, v in hashmap.items():\\n if len(v) == 1:\\n return v[0]\\n return -1\\n \\n \\n# unique = []\\n \\n# for idx, i in enumerate(s):\\n# if i not in unique:\\n# unique.append(i)\\n# else:\\n# unique.remove(i)\\n# if unique:\\n# return unique[0]\\n# return -1\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n map_ = {}\\n \\n for i in range(len(s)):\\n if s[i] not in map_:\\n map_[s[i]] = i\\n else:\\n map_[s[i]] = -1\\n \\n min_index = float(\\\"inf\\\")\\n for v in map_.values():\\n if v != -1 and v < min_index:\\n min_index = v\\n return min_index if min_index != float(\\\"inf\\\") else -1\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_count={}\\n for char in s:\\n char_count[char] = char_count.get(char,0)+1\\n for i,char in enumerate(s):\\n if char_count[char]==1:\\n return i\\n return -1\",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n mp = {}\\n for ch in s:\\n mp[ch] = mp.get(ch, 0) +1\\n \\n for i in range(len(s)):\\n if mp[s[i]] == 1:\\n return i\\n \\n return -1\\n \\n\\n \\n \\n\\n \\n \",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n d={}\\n for i in s:\\n if i not in d:\\n d[i]=1\\n else:\\n d[i]+=1\\n for i in d:\\n if d[i]==1:\\n return s.index(i)\\n return -1\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n hmap = {}\\n\\n for c in s:\\n hmap[c] = hmap.get(c, 0) + 1\\n\\n for i,c in enumerate(s):\\n if hmap[c] == 1:\\n return i\\n\\n return -1\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n charCounter = {}\\n\\n for c in s:\\n if c not in charCounter:\\n charCounter[c] = 0\\n charCounter[c] += 1\\n \\n for i in range(len(s)):\\n if charCounter[s[i]] == 1:\\n return i\\n \\n return -1\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n umap = dict()\\n\\n for i in range(len(s)):\\n ch = s[i]\\n if ch in umap:\\n umap[ch].append(i)\\n else:\\n umap[ch] = [i]\\n \\n for k,v in umap.items():\\n if len(v) == 1:\\n return v[0]\\n \\n return -1 \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n world = {}\\n\\n for char in s:\\n try:\\n world[char] += 1\\n except KeyError:\\n world[char] = 1\\n \\n for index in range(len(s)):\\n #try:\\n if world[s[index]] == 1:\\n return index\\n #world.pop(s[index])\\n #except KeyError:\\n #continue\\n\\n return -1\\n \\n \",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n count =defaultdict(int)\\n\\n for c in s:\\n count[c]+=1\\n for i,c in enumerate(s):\\n if count[c]==1:\\n return i\\n return -1 \\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n counter = {}\\n for c in s:\\n if c not in counter:\\n counter[c] = 0\\n counter[c] += 1\\n \\n for i,val in enumerate(s):\\n if counter[val] == 1:\\n return i\\n \\n return -1\\n \",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n letter_dict = {}\\n \\n for i, letter in enumerate(s):\\n if not letter in letter_dict:\\n letter_dict[letter] = [1, i]\\n else:\\n letter_dict[letter][0] += 1\\n print(letter_dict)\\n for k,v in letter_dict.items():\\n if v[0]==1:\\n return v[1]\\n return -1\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n freq = {}\\n #counting frequencies in a dictionary\\n for i in s:\\n if i in freq:\\n freq[i] += 1\\n else:\\n freq[i] = 1\\n \\n for i in range(len(s)):\\n if freq[s[i]] == 1:\\n return i\\n return -1 \\n \\n \\n \\n\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n count = {}\\n for char in s:\\n if char in count:\\n count[char] += 1\\n else:\\n count[char] = 1\\n for index, char in enumerate(s):\\n if count[char] == 1:\\n return index\\n return -1\\nsol = Solution()\\ns = \\\"leetcode\\\"\\nprint(sol.firstUniqChar(s)) \",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n d = {}\\n\\n for c in s:\\n if c in d:\\n d[c] += 1\\n else:\\n d[c] = 1\\n \\n for i in range(len(s)):\\n if d[s[i]] == 1:\\n return i\\n \\n return -1\",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_dict = {}\\n queue = []\\n for i in range(len(s)):\\n if s[i] in char_dict.keys():\\n char_dict[s[i]]+=1\\n else:\\n char_dict[s[i]]=1\\n queue.append((s[i],i))\\n for char, index in queue:\\n if char_dict[char] == 1:\\n return index\\n return -1\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n keep = {}\\n for char in s:\\n if char in keep.keys():\\n keep[char] +=1\\n else:\\n keep[char] = 1\\n \\n for index,char in enumerate(s):\\n if keep.get(char) == 1:\\n return index\\n \\n return -1\\n \",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_count = {}\\n\\n # Count occurrences of each character\\n for c in s:\\n if c not in char_count:\\n char_count[c] = 0\\n char_count[c] += 1\\n\\n # Find the first character that occurs only once\\n for i in range(len(s)):\\n if char_count[s[i]] == 1:\\n return i\\n\\n return -1\\n\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_count = {}\\n\\n for c in s:\\n if c not in char_count:\\n char_count[c]=0\\n char_count[c]+=1\\n\\n for i in range(len(s)):\\n if char_count[s[i]]==1:\\n return i\\n return -1\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n # s = [i for i in s]\\n d = {}\\n for i in range(len(s)):\\n if s[i] in d.keys():\\n d[s[i]].append(i)\\n else:\\n d[s[i]] = [i]\\n for k, v in d.items():\\n if len(v) == 1:\\n return v[0]\\n else:\\n return -1\\n \\n \",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n\\n char_positions = dict()\\n \\n for i in range(len(s)):\\n\\n if s[i] not in char_positions:\\n char_positions[s[i]] = []\\n\\n char_positions[s[i]].append(i)\\n\\n for i in range(len(s)):\\n if(len(char_positions[s[i]]) == 1):\\n return char_positions[s[i]][0]\\n\\n return -1\",\n \"runtime\": \"130\"\n },\n {\n \"code\": \"from collections import deque\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n map = {}\\n\\n for char in s: \\n if map.get(char):\\n count = map.get(char) + 1\\n map[char] = count\\n else:\\n map[char] = 1\\n\\n for i in range(len(s)):\\n if map.get(s[i]) == 1:\\n return i\\n return -1\",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n ans = []\\n for i in s:\\n if i not in ans:\\n ans.append(i)\\n for i in ans:\\n if s.count(i) == 1:\\n return s.index(i)\\n return -1\\n \",\n \"runtime\": \"134\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n s_to_c = {}\\n for i, a in enumerate(s):\\n if a not in s_to_c:\\n s_to_c[a] = 1\\n else:\\n s_to_c[a] += 1\\n \\n for k, v in s_to_c.items():\\n if v == 1:\\n for i in range(len(s)):\\n if s[i] == k:\\n return i\\n \\n return -1\\n \",\n \"runtime\": \"137\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dict = {}\\n\\n # O(N)\\n for i in range(len(s)):\\n if s[i] not in dict:\\n dict[s[i]] = 1\\n else:\\n dict[s[i]] += 1\\n\\n # O(N)\\n for i in range(len(s)):\\n if dict[s[i]] == 1:\\n return i\\n \\n return -1\\n\\n \\n \\n \\n\\n \",\n \"runtime\": \"137\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n ans = []\\n for i in s:\\n if i not in ans:\\n ans.append(i)\\n for i in ans:\\n if s.count(i) == 1:\\n return s.index(i)\\n return -1\\n \",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dic = {}\\n for i in range(len(s)):\\n if s[i] not in dic:\\n dic[s[i]] = 0\\n dic[s[i]] += 1\\n \\n for i in range(len(s)):\\n if dic[s[i]] == 1:\\n return i\\n \\n return -1 \\n #return min(dic.values()) if min(dic.values())!=float('inf') else -1\\n \",\n \"runtime\": \"140\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n candidates = dict()\\n non_candidates = set()\\n\\n for index, c in enumerate(s):\\n if c not in candidates.keys() and c not in non_candidates:\\n candidates[c] = index\\n else:\\n if c in candidates.keys():\\n del candidates[c]\\n non_candidates.add(c)\\n \\n if len(candidates.values()) > 0:\\n return min(candidates.values())\\n else:\\n return -1 \\n \",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n print(set(s))\\n l1=[]\\n for i in range(len(s)):\\n if s[i] not in l1 and s.count(s[i])==1:\\n return i\\n l1.append(s[i])\\n return -1\",\n \"runtime\": \"144\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\\n alpha = {i:0 for i in alphabet}\\n n = len(s)\\n for i in range(0, n):\\n if s[i] in alpha:\\n alpha[s[i]] += 1\\n\\n for i in range(n):\\n if alpha.get(s[i]) == 1:\\n return i\\n \\n return -1\\n\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n unique_dict = dict()\\n for i in range(len(s)):\\n if s[i] not in unique_dict.keys():\\n unique_dict[s[i]] = [i]\\n else:\\n unique_dict[s[i]] = [].append(i)\\n print(unique_dict)\\n for z in unique_dict.values():\\n if z != None:\\n return z[0]\\n return -1\",\n \"runtime\": \"147\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n\\n char_positions = dict()\\n \\n for i in range(len(s)):\\n\\n if s[i] not in char_positions:\\n char_positions[s[i]] = 0\\n\\n char_positions[s[i]] += 1\\n\\n for i in range(len(s)):\\n if(char_positions[s[i]] == 1):\\n return i\\n\\n return -1\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n hashmap = {}\\n for i in range(len(s)):\\n if s[i] in hashmap:\\n hashmap[s[i]] += 1\\n else:\\n hashmap[s[i]] = 1\\n\\n for i in range(len(s)):\\n if hashmap[s[i]] == 1:\\n return i\\n\\n return -1\",\n \"runtime\": \"150\"\n },\n {\n \"code\": \"from collections import OrderedDict\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n find=OrderedDict()\\n for i,char in enumerate(s):\\n if char in find:\\n count, _ = find[char]\\n find[char] = (count + 1, _) \\n else:\\n find[char] = (1, i)\\n for char, (count,i) in find.items():\\n if count==1:\\n return i\\n return -1\",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dic = {}\\n for i in range(len(s)):\\n if s[i] not in dic:\\n dic[s[i]] = i \\n else:\\n dic[s[i]] = float('inf')\\n return min(dic.values()) if min(dic.values())!=float('inf') else -1\\n \",\n \"runtime\": \"154\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n freq_map = {}\\n idx_map = {}\\n\\n for i in range(len(s)):\\n if s[i] not in freq_map:\\n freq_map[s[i]] = 1\\n else:\\n freq_map[s[i]] += 1\\n idx_map[s[i]] = i\\n\\n candidates = []\\n for k, v in freq_map.items():\\n if v == 1:\\n candidates.append(k)\\n\\n if len(candidates) == 0:\\n return -1\\n else:\\n first_idx = idx_map[candidates[0]]\\n first_char = candidates[0]\\n for c in candidates:\\n first_idx = min(first_idx, idx_map[c])\\n\\n print(first_char)\\n return first_idx\",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n stack1=[]\\n stack2=[]\\n \\n for i in range(len(s)):\\n if s[i] in stack1:\\n stack1.remove(s[i])\\n stack2.append(s[i])\\n \\n elif s[i] in stack2:\\n continue\\n \\n else:\\n stack1.append(s[i])\\n \\n \\n return -1 if not stack1 else s.index(stack1[0])\\n \",\n \"runtime\": \"157\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n queue = deque()\\n chars = [0] * 26\\n\\n for i, c in enumerate(s):\\n chars[ord(c)-ord('a')]+=1\\n if chars[ord(c)-ord('a')] == 1:\\n queue.append((c, i))\\n while queue and chars[ord(queue[0][0])-ord('a')] > 1:\\n queue.popleft()\\n \\n if queue:\\n return queue[0][1]\\n else:\\n return -1\\n\\n\\n\\n \",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n chars = [-1] * 256\\n for i in range(len(s)):\\n if chars[ord(s[i])] == -1:\\n chars[ord(s[i])] = [1, i]\\n else:\\n temp = chars[ord(s[i])]\\n chars[ord(s[i])] = [temp[0]+1, temp[1]]\\n min_index = 10 ** 6\\n for i in chars:\\n if i != -1:\\n if i[0] == 1:\\n min_index = min(min_index, i[1])\\n if min_index == 10 ** 6:\\n return -1\\n return min_index \",\n \"runtime\": \"160\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n repeat_dict = {}\\n for i in range(len(s)):\\n if s[i] not in repeat_dict:\\n repeat_dict[s[i]] = tuple((i,1))\\n else:\\n repeat_dict[s[i]] = tuple((i,repeat_dict[s[i]][1]+1))\\n y_filtered = list(filter(lambda x: x[1][1] <=1, repeat_dict.items()))\\n\\n y = sorted(y_filtered, key = lambda x: x[1][0])\\n if not y:\\n return -1\\n else:\\n print(\\\"y: \\\",y)\\n return y[0][1][0]\\n\\n # def dict_empty(self):\\n # if self.repeat_dict not \\n\",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n world = {}\\n\\n for char in s:\\n try:\\n world[char] += 1\\n except KeyError:\\n world[char] = 1\\n \\n for index in range(len(s)):\\n try:\\n if world[s[index]] == 1:\\n return index\\n world.pop(s[index])\\n except KeyError:\\n continue\\n\\n return -1\\n \\n \",\n \"runtime\": \"163\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"\\n leetcode\\n i\\n l = 0\\n e = 2\\n t = 3\\n c = 4\\n o = 5\\n d = 6\\n e = 7\\n \\\"\\\"\\\"\\n n = len(s)\\n seen = {}\\n for i in range(n):\\n char = s[i]\\n if char in seen:\\n seen[char] += 1\\n else:\\n seen[char] = 1\\n for i in range(n):\\n char = s[i]\\n if (char in seen and seen[char] == 1):\\n return i\\n return -1\\n \",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n def charToIdx(ch):\\n return ord(ch) - ord('a')\\n a = [0] * 26\\n for i, c in enumerate(s):\\n idx = charToIdx(c)\\n a[idx] += 1\\n for i, c in enumerate(s):\\n idx = charToIdx(c)\\n if a[idx] == 1:\\n return i\\n return -1\\n \",\n \"runtime\": \"167\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n if len(s) == 1:\\n return 0\\n left_dict = {}\\n right_dict = {}\\n is_present = set()\\n left = 0\\n right = len(s) - 1\\n while left <= right:\\n if s[left] in is_present:\\n if s[left] in left_dict.keys():\\n left_dict.pop(s[left])\\n if s[left] in right_dict.keys():\\n right_dict.pop(s[left])\\n else:\\n # print(\\\"Inserting \\\" + s[left] + \\\" to left dict\\\")\\n left_dict[s[left]] = left\\n is_present.add(s[left])\\n if s[right] in is_present:\\n if s[right] in right_dict.keys():\\n # print(\\\"Popping \\\" + s[right] + \\\" from right_dict\\\")\\n right_dict.pop(s[right])\\n if s[right] in left_dict.keys():\\n # print(\\\"Popping \\\" + s[right] + \\\" from right_dict\\\")\\n left_dict.pop(s[right])\\n else:\\n # print(\\\"Inserting \\\" + s[right] + \\\" to right dict\\\")\\n right_dict[s[right]] = right\\n is_present.add(s[right])\\n\\n left +=1 \\n right -= 1\\n\\n if len(left_dict) > 0:\\n iterator = iter(left_dict.items())\\n _, first_value = next(iterator)\\n return first_value\\n\\n if len(right_dict) > 0:\\n iterator = iter(reversed(right_dict.items()))\\n _, first_value = next(iterator)\\n return first_value\\n\\n return -1\",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n # charCounter = Counter(s)\\n\\n # for (i, char) in enumerate(s):\\n # if charCounter[char] == 1:\\n # return i\\n \\n # return -1\\n\\n charIndex = dict()\\n\\n for (i, char) in enumerate(s):\\n charIndex[char] = i if char not in charIndex else float('inf')\\n\\n for char in s:\\n if charIndex[char] != float('inf'):\\n return charIndex[char]\\n\\n return -1 \\n\\n \",\n \"runtime\": \"170\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n last_appear = {}\\n for i, c in enumerate(s):\\n last_appear[c] = i\\n \\n seen = set()\\n for i, c in enumerate(s):\\n print(c)\\n if c in seen:\\n continue\\n seen.add(c)\\n if last_appear[c] == i:\\n return i\\n \\n return -1\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"def find_index(lst,s):\\n for i in range(0,len(lst)):\\n if s==lst[i]:\\n return i\\n return -1\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n lst=[]\\n dic={}\\n for i in range(0,len(s)):\\n temp=dic.get(s[i],\\\"none\\\")\\n if temp==\\\"none\\\":\\n dic[s[i]]=1\\n else:\\n dic[s[i]]+=1\\n print(dic)\\n print(f\\\"lst {lst}\\\")\\n for i,j in enumerate(s):\\n temp=dic.get(s[i])\\n if temp==1:\\n return i\\n return -1\",\n \"runtime\": \"173\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n n = len(s)\\n mp = {}\\n\\n def traverse(idx):\\n if idx < 0:\\n return\\n\\n if s[idx] not in mp:\\n mp[s[idx]] = 1\\n else:\\n mp[s[idx]] += 1\\n\\n traverse(idx - 1)\\n\\n traverse(n - 1)\\n for i in range(n):\\n if mp[s[i]] == 1:\\n return i\\n\\n return -1\",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n s_c = Counter(s)\\n seen = [-1 for _ in range(26)]\\n for i, char in enumerate(s):\\n if seen[ord(char) - 97] == -1:\\n seen[ord(char) - 97] = i\\n else:\\n seen[ord(char)- 97] = float(\\\"inf\\\")\\n smallest = float(\\\"inf\\\")\\n for val in seen:\\n if val != float(\\\"inf\\\") and val != -1:\\n smallest = min(smallest, val)\\n return smallest if smallest != float(\\\"inf\\\") else -1\\n\\n \\n\\n \",\n \"runtime\": \"177\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n chars = [0] * 26\\n\\n maxCharQty = -1\\n for letter in s:\\n asc = ord(letter) - 97\\n chars[asc] += 1\\n maxCharQty = max(chars[asc], maxCharQty)\\n\\n if maxCharQty == 1:\\n return 0\\n\\n count = 0\\n for letter in s:\\n n = ord(letter) - 97\\n if chars[n] == 1:\\n return count\\n count += 1\\n\\n return -1\\n\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"\\n // maintain a map\\n \\n \\n iterate through the characters\\n \\n if its in the map:\\n continue\\n \\n if its not in the map\\n add to the map, initialize count 0\\n \\n \\n \\\"\\\"\\\"\\n \\n hmap = {}\\n \\n \\n for i in range(len(s)):\\n char = s[i]\\n \\n count = 0\\n if char in hmap:\\n x = hmap[char]\\n count = x[1]\\n \\n #index, count\\n count+=1\\n hmap[char] = tuple([i, count])\\n \\n low = len(s) + 1\\n for index, freq in hmap.values():\\n if freq == 1:\\n low = min(low, index)\\n\\n return low if low != len(s) + 1 else -1\",\n \"runtime\": \"180\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n yoasobi = {}\\n for i in range(0,len(s)):\\n if yoasobi.get(s[i],[0,0]) == [0,0]:\\n yoasobi[s[i]] = [1,i]\\n else:\\n yoasobi[s[i]] = []\\n for ikura in s:\\n if yoasobi[ikura]:\\n return yoasobi[ikura][1]\\n return -1\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen = defaultdict(int)\\n queue = deque([])\\n\\n for i in range(len(s)):\\n seen[s[i]] += 1\\n queue.append((s[i],i))\\n while queue and seen[queue[0][0]] > 1:\\n queue.popleft()\\n\\n return queue[0][1] if queue else -1\",\n \"runtime\": \"183\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen_once = 0\\n seen_twice = 0\\n \\n \\n \\n for i, ch in enumerate(s):\\n asci_value = ord(ch) - ord('a')\\n mask = 1 << asci_value \\n if mask & seen_once == 0 and mask & seen_twice == 0:\\n seen_once |= mask\\n elif mask & seen_once:\\n seen_twice |= mask\\n seen_once &= ~mask\\n \\n for i, ch in enumerate(s):\\n asci_value = ord(ch) - ord('a')\\n mask = 1 << asci_value\\n if mask & seen_once:\\n print(mask & seen_once)\\n return i\\n\\n \\n return -1\",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n def charToIdx(ch):\\n return ord(ch) - ord('a')\\n a = [0] * 26\\n for i, c in enumerate(s):\\n idx = charToIdx(c)\\n a[idx] += 1\\n for i, c in enumerate(s):\\n idx = charToIdx(c)\\n if a[idx] == 1:\\n return i\\n return -1\\n \",\n \"runtime\": \"187\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n mapper = OrderedDict()\\n \\n for i, l in enumerate(s):\\n if mapper.get(l) is None:\\n mapper[l] = [i, 1]\\n else:\\n index, count = mapper.get(l)\\n mapper[l] = [index, count + 1]\\n\\n for k in mapper:\\n index, count = mapper[k]\\n\\n if count == 1:\\n return index\\n\\n return -1\",\n \"runtime\": \"190\"\n },\n {\n \"code\": \"'''\\n Observations: \\n - input: a string 's'\\n - output: index value of first non-repeating character\\n\\n Simulate: \\n Input: s = \\\"leetcode\\\"\\n Output: 0\\n\\n - does order matter? \\n - can we rearrange the characters? -- yes\\n - can input only contain duplicates? - yes \\n\\n sort s \\n iterate while keeping count and if we iterate next and character does not reappear, return it \\n\\n pseudocode: \\n sortedString = ''.join(sorted(s))\\n \\n hashTable = {} \\n\\n for c in sortedString: \\n if c not in hashTable: \\n hashTable[c] = 1 \\n else: \\n hashTable[c] += 1\\n \\n for key, value in hashTable: \\n if value == 1: \\n return key\\n \\n return -1 \\n\\n'''\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n sortedString = ''.join(sorted(s))\\n\\n hashTable = {} \\n\\n for c in sortedString: \\n if c not in hashTable:\\n hashTable[c] = 1\\n else: \\n hashTable[c] += 1\\n\\n for index, c in enumerate(s): \\n if hashTable[c] == 1:\\n return index\\n\\n return -1 \",\n \"runtime\": \"190\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n l = len(s)\\n val_fidx = dict()\\n val_occur = dict()\\n for i in range(l):\\n if s[i] not in val_fidx:\\n val_fidx[s[i]] = i\\n if s[i] in val_occur:\\n val_occur[s[i]] += 1\\n if s[i] not in val_occur:\\n val_occur[s[i]] = 1\\n\\n \\n min_idx = l\\n for i in range(l):\\n if val_occur[s[i]] == 1 and val_fidx[s[i]] < min_idx:\\n min_idx = val_fidx[s[i]]\\n \\n if min_idx == l:\\n return -1\\n else:\\n return min_idx\\n \",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n d = defaultdict(int)\\n q = deque()\\n for idx, num in enumerate(s):\\n if num in d:\\n d[num] = d[num] + 1\\n else:\\n d[num] = 1\\n q.append((num, idx))\\n while q and d[q[0][0]] > 1:\\n q.popleft()\\n return -1 if not q else q.popleft()[1]\\n\",\n \"runtime\": \"203\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_dict = defaultdict()\\n for char in s:\\n char_dict[char] = char_dict.get(char, 0) + 1\\n print(char_dict)\\n\\n for i in range(0, len(s)):\\n print(s[0])\\n if char_dict[s[i]] == 1:\\n return i\\n \\n return -1\",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n occur = {}\\n repeat = []\\n for i in range(len(s)):\\n if s[i] in occur:\\n occur[s[i]] = i\\n repeat.append(s[i])\\n else:\\n occur[s[i]] = i\\n \\n for i in range(len(s)):\\n if s[i] not in repeat:\\n return i\\n return -1\",\n \"runtime\": \"207\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n temp=[0]*26\\n for i in range(len(s)):\\n if temp[ord(s[i])-ord('a')]==0:\\n temp[ord(s[i])-ord('a')]=1\\n else:\\n temp[ord(s[i])-ord('a')]=-1\\n for i in range(len(s)):\\n if temp[ord(s[i])-ord('a')]==1:\\n return i\\n return -1\",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"\\n\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n\\n q = deque()\\n frequency_map = {}\\n\\n\\n for index,char in enumerate(s):\\n\\n if char in frequency_map:\\n frequency_map[char] +=1 \\n else:\\n frequency_map[char] = 1\\n \\n while q and frequency_map[q[0][0]] > 1:\\n\\n q.popleft()\\n \\n\\n q.append((char,index))\\n \\n if q and frequency_map[q[0][0]] <= 1:\\n return q[0][1]\\n \\n else:\\n return -1\\n\\n\\n\\n \",\n \"runtime\": \"210\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n queue = deque()\\n chars = Counter()\\n\\n for i, c in enumerate(s):\\n chars[c]+=1\\n if chars[c] == 1:\\n queue.append((c, i))\\n while queue and chars[queue[0][0]] > 1:\\n queue.popleft()\\n \\n if queue:\\n return queue[0][1]\\n else:\\n return -1\\n\\n\\n\\n \",\n \"runtime\": \"213\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n q=[]\\n cf=[0]*26\\n\\n for i,c in enumerate(s):\\n ind=ord(c)-ord('a')\\n cf[ind]+=1\\n q.append((c,i))\\n\\n while q and cf[ord(q[0][0])-ord('a')]>1:\\n q.pop(0)\\n \\n return q[0][1] if q else -1\\n\",\n \"runtime\": \"217\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n #return s.count('')\\n \\n result = {}\\n \\n for i in range(len(s)):\\n if s[i] not in result:\\n result[s[i]] = [i, 1]\\n else:\\n result[s[i]] += [i, 1]\\n print(result)\\n for val in result.values():\\n print(\\\"val\\\", val[0], val[1])\\n if len(val) ==2 and val[1] == 1:\\n #print(key, result[key])\\n return val[0]\\n return -1\",\n \"runtime\": \"217\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n #return s.count('')\\n \\n result = {}\\n \\n for i in range(len(s)):\\n if s[i] not in result:\\n result[s[i]] = [i, 1]\\n else:\\n result[s[i]] += [i, 1]\\n print(result)\\n for val in result.values():\\n if len(val) ==2 and val[1] == 1:\\n return val[0]\\n return -1\",\n \"runtime\": \"220\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n #return s.count('')\\n \\n result = {}\\n \\n for i in range(len(s)):\\n if s[i] not in result:\\n result[s[i]] = [i, 1]\\n else:\\n result[s[i]] += [i, 1]\\n print(result)\\n for val in result.values():\\n if len(val) ==2 and val[1] == 1:\\n return val[0]\\n return -1\",\n \"runtime\": \"220\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n maps = {}\\n filter = set()\\n for i in s:\\n if i not in maps:\\n maps[i]=1\\n filter.add(i)\\n else:\\n maps[i]+=1\\n try:\\n filter.remove(i)\\n except Exception:\\n pass\\n for idx,i in enumerate(s):\\n if i in filter:\\n return idx\\n return -1\\n\",\n \"runtime\": \"223\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\\"\\\"\\\"\\n s non repeating chat in the string ..\\n 1. getting the chars frequancy in a map char: ferq\\n 2. iterate the string and when the frequancy is 1 return index\\n\\n \\\"\\\"\\\"\\n letter_freq_map = {}\\n char_list = list(s)\\n for i in range(len(s)):\\n letter =\\\"\\\".join(char_list[i]) \\n if letter_freq_map.get(letter) == None:\\n letter_freq_map[letter] = 1\\n else:\\n letter_freq_map[letter] +=1\\n\\n for i in range(len(s)):\\n if letter_freq_map[s[i]] == 1:\\n return i\\n return -1\",\n \"runtime\": \"227\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n l = dict()\\n for i,j in enumerate(s):\\n if j in l.values():\\n continue\\n else:\\n l[i] = j\\n\\n li =[]\\n for i in l.keys():\\n if s.count(l[i])<=1:\\n li.append(i)\\n\\n \\n if li:\\n return li[0]\\n else:\\n return -1 \",\n \"runtime\": \"230\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n l=[i for i in s]\\n s=''\\n for k in l:\\n if k not in s:\\n s+=k\\n r=-1\\n for j in s:\\n if l.count(j)==1:\\n r=l.index(j)\\n break\\n return r\",\n \"runtime\": \"233\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n l=[]\\n c=''\\n for k in s:\\n l.append(k)\\n if k not in c:\\n c+=k\\n r=-1\\n for j in c:\\n if l.count(j)==1:\\n r=l.index(j)\\n break\\n return r\",\n \"runtime\": \"237\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n lis = list(s)\\n dup = []\\n data = {}\\n for p,i in enumerate(lis):\\n if i not in data and i not in dup: \\n data[i]=p\\n else: \\n if i in dup:\\n pass\\n else:\\n dup.append(i)\\n del data[i]\\n l=list(data.values())\\n return -1 if not l else l[0] \",\n \"runtime\": \"237\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen_letters = []\\n count = 0\\n right = len(s)\\n \\n while count < right:\\n \\n if s[count] in seen_letters and count + 1 < right:\\n count += 1\\n \\n char = s[count]\\n \\n find = s[count+1:].find(char)\\n if find is -1 and char not in seen_letters:\\n return count\\n else:\\n seen_letters.append(char)\\n \\n count += 1\\n return -1\",\n \"runtime\": \"240\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n caracteres = []\\n repetidos = []\\n for letra in s:\\n if letra not in caracteres:\\n caracteres += [letra]\\n else:\\n repetidos += [letra]\\n for letra in s:\\n if letra not in repetidos:\\n try:\\n return s.index(letra)\\n except ValueError:\\n return -1\\n return -1\\n\\n\\n \",\n \"runtime\": \"240\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen_letters = []\\n count = 0\\n right = len(s)\\n \\n while count < right:\\n \\n if s[count] in seen_letters and count + 1 < right:\\n count += 1\\n \\n char = s[count]\\n \\n find = s[count+1:].find(char)\\n if find is -1 and char not in seen_letters:\\n return count\\n else:\\n seen_letters.append(char)\\n \\n count += 1\\n return -1\",\n \"runtime\": \"243\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen_letters = []\\n count = 0\\n right = len(s)\\n \\n while count < right:\\n \\n if s[count] in seen_letters and count + 1 < right:\\n count += 1\\n \\n char = s[count]\\n \\n find = s[count+1:].find(char)\\n if find is -1 and char not in seen_letters:\\n return count\\n else:\\n seen_letters.append(char)\\n \\n count += 1\\n return -1\",\n \"runtime\": \"243\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n lis = list(s)\\n dup = []\\n data = {}\\n for p,i in enumerate(lis):\\n if i not in data and i not in dup: \\n data[i]=p\\n else: \\n if i in dup:\\n pass\\n else:\\n dup.append(i)\\n del data[i]\\n l=list(data.values())\\n return -1 if not l else l[0] \",\n \"runtime\": \"247\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n L = []\\n c = []\\n for i in range (len(s)):\\n if s[i] in L and s[i] in c:\\n c.remove(s[i])\\n elif s[i] not in L :\\n L.append(s[i])\\n c.append(s[i])\\n if c:\\n return s.index(c[0])\\n return -1\",\n \"runtime\": \"250\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n charDict = {}\\n \\n for i in range(len(s)):\\n char = s[i]\\n curDict = charDict.get(char, [])\\n curDict.append(i)\\n charDict.update({char: curDict})\\n \\n print(charDict)\\n \\n mins = []\\n for indices in charDict.values():\\n if len(indices) == 1:\\n mins.extend(indices)\\n \\n return min(mins) if len(mins) > 0 else -1\",\n \"runtime\": \"250\"\n },\n {\n \"code\": \"import collections\\nclass Solution:\\n # SOLUTION COPIED FROM: https://leetcode.com/discuss/general-discussion/4753055/387.-First-Unique-Character-in-a-String/\\n def firstUniqChar(self, s: str) -> int:\\n char_counts = {}\\n q = collections.deque()\\n ans = -1\\n\\n for i in range(len(s)):\\n if s[i] in char_counts:\\n char_counts[s[i]] += 1\\n else:\\n char_counts[s[i]] = 1\\n\\n q.append([s[i], i])\\n\\n while q:\\n if char_counts[q[0][0]] > 1:\\n q.popleft()\\n else:\\n ans = q[0][1]\\n break\\n \\n return ans\",\n \"runtime\": \"253\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n sorted_s = sorted(s)\\n blacklist=[]\\n whitelist=[]\\n for index,letter in enumerate(sorted_s):\\n try:\\n if letter != sorted_s[index+1] and letter not in blacklist:\\n whitelist.append(letter)\\n blacklist.append(letter)\\n except:\\n if letter not in blacklist:\\n whitelist.append(letter)\\n for index,letter in enumerate(s):\\n if letter in whitelist:\\n return index\\n return -1\",\n \"runtime\": \"253\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\\n alpha = {i:0 for i in alphabet}\\n n = len(s)\\n for i in range(0, n):\\n if s[i] in alpha:\\n alpha[s[i]] += 1\\n \\n print(alpha)\\n\\n for i in s:\\n print(alpha.get(i))\\n if alpha.get(i) == 1:\\n return s.find(i)\\n \\n return -1\\n\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_to_count = reduce(lambda acc, c: {**acc, c: acc.get(c, 0) + 1}, s, {})\\n for i, c in enumerate(s):\\n if char_to_count[c] == 1:\\n return i\\n return -1\",\n \"runtime\": \"257\"\n },\n {\n \"code\": \"from collections import Counter\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n freq = Counter(s)\\n print(freq)\\n\\n # find the index\\n for idx, ch in enumerate(s):\\n print(idx, ch)\\n if freq[ch] == 1:\\n return idx \\n return -1\",\n \"runtime\": \"260\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n for i in range(len(s)):\\n if(s[i] not in s[:i] and s[i] not in s[i+1:]):\\n return i\\n return -1\\n\\n \",\n \"runtime\": \"260\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s):\\n # if len(s)//2 == len(set(s)):\\n # return -1\\n # if len(s)==1:\\n # return 0\\n for i in range(len(s)):\\n if s[i] not in s[0:i] and s[i] not in s[i+1::]:\\n return i\\n return -1\\n \",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n seen = {}\\n for index in range(len(s)):\\n if s[index] not in seen:\\n seen[s[index]] = index\\n else:\\n seen[s[index]] = float(\\\"inf\\\")\\n minimum = min(list(seen.values()))\\n if minimum == float(\\\"inf\\\"):\\n return -1\\n return minimum\",\n \"runtime\": \"263\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n l = len(s)\\n for i in range(0,l):\\n if (s[i] not in s[:i]) and (s[i] not in s[i+1:]):\\n return i\\n return -1\\n \",\n \"runtime\": \"267\"\n },\n {\n \"code\": \"class Solution:\\n\\tdef firstUniqChar(self, s: str) -> int:\\n\\t\\tfor i in range(len(s)):\\n\\t\\t\\tif s[i] not in s[:i] and s[i] not in s[i+1:]:\\n\\t\\t\\t\\treturn i\\n\\t\\treturn -1\",\n \"runtime\": \"267\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n hashmap = {}\\n for index, value in enumerate(s):\\n if value in hashmap:\\n hashmap[value] = hashmap[value] = [1]*100\\n else:\\n hashmap[value] = [index]\\n for element in hashmap:\\n if len(hashmap[element]) == 1:\\n return hashmap[element][0]\\n return -1\",\n \"runtime\": \"270\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n for i in range(len(s)):\\n if not (s[i] in s[:i] or s[i] in s[i+1:]):\\n return i\\n \\n return -1\",\n \"runtime\": \"270\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n a=len(s)\\n for i in range(0,a):\\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\\n return i\\n return -1\\n \\n\",\n \"runtime\": \"273\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n split=list(s)\\n duplicate=set()\\n indexes={}\\n count={}\\n for i in split:\\n num=1\\n if i not in duplicate:\\n duplicate.add(i)\\n else:\\n num+=1 \\n count[i]=num\\n indexes[i]=split.index(i)\\n for key,values in count.items():\\n if values == 1:\\n return indexes[key]\\n return -1\\n \",\n \"runtime\": \"273\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n hash={}\\n lenght = len(s)\\n for i in range(lenght):\\n print(s[i])\\n if s[i] in hash:\\n hash[s[i]] = -2\\n else:\\n hash[s[i]] = i\\n \\n for i in hash.values():\\n print(hash)\\n if i > -1:\\n return i\\n \\n return -1\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n # d = {}\\n # for elem in set(s):\\n # if s.count(elem) == 1:\\n # d[elem] = s.index(elem)\\n # if d:\\n # return min(d.values())\\n # else:\\n # return -1\\n\\n for i in range(len(s)):\\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\\n return i\\n return -1\\n\\n\\n \",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"from abc import ABC, abstractmethod\\n\\nclass MyDict(ABC):\\n @abstractmethod\\n def __getitem__(self, key):\\n pass\\n\\n @abstractmethod\\n def __setitem__(self, key, value):\\n pass\\n\\n @abstractmethod\\n def __missing__(self, value):\\n pass\\n\\n @abstractmethod\\n def __contains__(self, key):\\n pass\\n\\n\\nclass DefaultDict(MyDict):\\n def __init__(self, default_factory=None):\\n self.default_factory = default_factory\\n self.d = {}\\n\\n def __getitem__(self, key):\\n if key not in self:\\n return self.__missing__(key)\\n return self.d[key]\\n\\n def __setitem__(self, key, value):\\n self.d[key] = value\\n\\n def __missing__(self, key):\\n if self.default_factory is None:\\n raise KeyError\\n self.d[key] = self.default_factory()\\n return self.d[key]\\n\\n def __contains__(self, key):\\n return key in self.d\\n\\n def __repr__(self):\\n return repr(self.d)\\n\\n\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n char_to_count = DefaultDict(int)\\n for c in s:\\n char_to_count[c] += 1\\n for i, c in enumerate(s):\\n if char_to_count[c] == 1:\\n return i\\n return -1\\n\",\n \"runtime\": \"280\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n for i in range(len(s)):\\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\\n return i\\n \\n return -1\",\n \"runtime\": \"280\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n for i in range(len(s)):\\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\\n return i\\n return -1 \\n \\n \",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n for i in range(len(s)):\\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\\n return i\\n return -1 \\n \\n \",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n # d = {}\\n # for elem in set(s):\\n # if s.count(elem) == 1:\\n # d[elem] = s.index(elem)\\n # if d:\\n # return min(d.values())\\n # else:\\n # return -1\\n\\n for i in range(len(s)):\\n if s[i] not in s[:i] and s[i] not in s[i+1:]:\\n return i\\n return -1\\n\\n\\n \",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n d = {}\\n for i in range(len(s)):\\n if s[i] in s[:i] or s[i] in s[i+1:]:\\n continue\\n else:\\n return i\\n return -1\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution(object):\\n def firstUniqChar(self, s):\\n \\\"\\\"\\\"\\n :type s: str\\n :rtype: int\\n \\\"\\\"\\\"\\n chars = {}\\n removedChars = []\\n for index, char in enumerate(s):\\n if char in chars or char in removedChars:\\n if char in chars: chars.pop(char)\\n removedChars.append(char)\\n else:\\n chars[char] = index\\n \\n if chars != {}:\\n for key in chars:\\n return chars[key]\\n else:\\n return -1\\n\",\n \"runtime\": \"290\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n counts = Counter(s)\\n\\n for i,char in enumerate(s):\\n print(i)\\n print(char)\\n if counts[char] == 1:\\n return i\\n return -1\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"290\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":141,"string":"141"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n for i in range(len(s)):\n if not s[i] in (s[i + 1:] + s[:i]):\n return i\n else:\n return -1\n ","memory":"16400"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dic1 = {}\n for i in range(len(s)):\n if s[i] not in dic1:\n dic1[s[i]] = 1\n else:\n dic1[s[i]] += 1\n for i in range(len(s)):\n if dic1[s[i]] == 1:\n return i \n \n return -1 \n\n \n","memory":"16500"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n if len(s) > 10**5 or len(s) == 0:\n return -1\n\n if (len(s) == 1):\n return 0\n\n if (len(set(s)) == 1):\n return - 1\n\n else:\n\n for i in range(len(s)):\n if s.count(s[i]) == 1:\n return i\n\n if s.count(s[i]) == len(s) - 1:\n return s.index(s[-1])\n return - 1\n\n ","memory":"16600"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n Map = {}\n\n for i,c in enumerate(s):\n if c in Map:\n Map[c] = len(s)+1\n else:\n Map[c] = i\n return -1 if min(Map.values()) == len(s)+1 else min(Map.values()) ","memory":"16700"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n d = {}\n for c in s:\n d[c] = d.get(c,0)+1\n for i in range(0,len(s)):\n if d[s[i]]==1:\n return i\n return -1","memory":"16800"},{"code":"from collections import OrderedDict\nclass Solution:\n def firstUniqChar(self, s: str) -> int:\n find=OrderedDict()\n for i,char in enumerate(s):\n if char in find:\n count, _ = find[char]\n find[char] = (count + 1, _) \n else:\n find[char] = (1, i)\n for char, (count,i) in find.items():\n if count==1:\n return i\n return -1","memory":"16900"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n alphabet_idx = [0 for i in range(26)]\n for ch in s:\n alphabet_idx[ord(ch) - ord(\"a\")] += 1\n for i in range(len(s)):\n if alphabet_idx[ord(s[i])-ord(\"a\")] == 1:\n return i\n return -1\n \n \n ","memory":"16900"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n hset=collections.Counter(s)\n for i in range(len(s)):\n if hset[s[i]]==1:\n return i\n return -1","memory":"17000"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n count = {}\n for char in s:\n if char in count:\n count[char] += 1\n else:\n count[char] = 1\n for index, char in enumerate(s):\n if count[char] == 1:\n return index\n return -1\nsol = Solution()\ns = \"leetcode\"\nprint(sol.firstUniqChar(s)) ","memory":"17000"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n \n freq = defaultdict(int)\n for char in s:\n freq[char] += 1\n\n for i, char in enumerate(s):\n if freq[char] == 1:\n return i\n\n return -1\n ","memory":"17100"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n dic = {}\n for i in range(len(s)):\n if s[i] not in dic:\n dic[s[i]] = i \n else:\n dic[s[i]] = float('inf')\n return min(dic.values()) if min(dic.values())!=float('inf') else -1\n ","memory":"17100"},{"code":"class Solution:\n def firstUniqChar(self, s: str) -> int:\n d = {}\n \n for char in s:\n d[char] = d.get(char, 0) + 1\n \n for i, v in enumerate(s):\n if d[v] == 1:\n return i\n return -1\n \n ","memory":"17200"}],"string":"[\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n for i in range(len(s)):\\n if not s[i] in (s[i + 1:] + s[:i]):\\n return i\\n else:\\n return -1\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dic1 = {}\\n for i in range(len(s)):\\n if s[i] not in dic1:\\n dic1[s[i]] = 1\\n else:\\n dic1[s[i]] += 1\\n for i in range(len(s)):\\n if dic1[s[i]] == 1:\\n return i \\n \\n return -1 \\n\\n \\n\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n if len(s) > 10**5 or len(s) == 0:\\n return -1\\n\\n if (len(s) == 1):\\n return 0\\n\\n if (len(set(s)) == 1):\\n return - 1\\n\\n else:\\n\\n for i in range(len(s)):\\n if s.count(s[i]) == 1:\\n return i\\n\\n if s.count(s[i]) == len(s) - 1:\\n return s.index(s[-1])\\n return - 1\\n\\n \",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n Map = {}\\n\\n for i,c in enumerate(s):\\n if c in Map:\\n Map[c] = len(s)+1\\n else:\\n Map[c] = i\\n return -1 if min(Map.values()) == len(s)+1 else min(Map.values()) \",\n \"memory\": \"16700\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n d = {}\\n for c in s:\\n d[c] = d.get(c,0)+1\\n for i in range(0,len(s)):\\n if d[s[i]]==1:\\n return i\\n return -1\",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"from collections import OrderedDict\\nclass Solution:\\n def firstUniqChar(self, s: str) -> int:\\n find=OrderedDict()\\n for i,char in enumerate(s):\\n if char in find:\\n count, _ = find[char]\\n find[char] = (count + 1, _) \\n else:\\n find[char] = (1, i)\\n for char, (count,i) in find.items():\\n if count==1:\\n return i\\n return -1\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n alphabet_idx = [0 for i in range(26)]\\n for ch in s:\\n alphabet_idx[ord(ch) - ord(\\\"a\\\")] += 1\\n for i in range(len(s)):\\n if alphabet_idx[ord(s[i])-ord(\\\"a\\\")] == 1:\\n return i\\n return -1\\n \\n \\n \",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n hset=collections.Counter(s)\\n for i in range(len(s)):\\n if hset[s[i]]==1:\\n return i\\n return -1\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n count = {}\\n for char in s:\\n if char in count:\\n count[char] += 1\\n else:\\n count[char] = 1\\n for index, char in enumerate(s):\\n if count[char] == 1:\\n return index\\n return -1\\nsol = Solution()\\ns = \\\"leetcode\\\"\\nprint(sol.firstUniqChar(s)) \",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n \\n freq = defaultdict(int)\\n for char in s:\\n freq[char] += 1\\n\\n for i, char in enumerate(s):\\n if freq[char] == 1:\\n return i\\n\\n return -1\\n \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n dic = {}\\n for i in range(len(s)):\\n if s[i] not in dic:\\n dic[s[i]] = i \\n else:\\n dic[s[i]] = float('inf')\\n return min(dic.values()) if min(dic.values())!=float('inf') else -1\\n \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def firstUniqChar(self, s: str) -> int:\\n d = {}\\n \\n for char in s:\\n d[char] = d.get(char, 0) + 1\\n \\n for i, v in enumerate(s):\\n if d[v] == 1:\\n return i\\n return -1\\n \\n \",\n \"memory\": \"17200\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":12,"string":"12"}}},{"rowIdx":291,"cells":{"question_id":{"kind":"number","value":389,"string":"389"},"name":{"kind":"string","value":"find-the-difference"},"content":{"kind":"string","value":"<p>You are given two strings <code>s</code> and <code>t</code>.</p>\n\n<p>String <code>t</code> is generated by random shuffling string <code>s</code> and then add one more letter at a random position.</p>\n\n<p>Return the letter that was added to <code>t</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "abcd", t = "abcde"\n<strong>Output:</strong> "e"\n<strong>Explanation:</strong> 'e' is the letter that was added.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "", t = "y"\n<strong>Output:</strong> "y"\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>0 <= s.length <= 1000</code></li>\n\t<li><code>t.length == s.length + 1</code></li>\n\t<li><code>s</code> and <code>t</code> consist of lowercase English letters.</li>\n</ul>\n"},"acRate":{"kind":"number","value":59.56589093235151,"string":"59.565891"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["hash-table","string","bit-manipulation","sorting"],"string":"[\n \"hash-table\",\n \"string\",\n \"bit-manipulation\",\n \"sorting\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"18\", 0.0456], [\"19\", 0.0608], [\"20\", 0.0608], [\"21\", 0.076], [\"22\", 0.2583], [\"23\", 0.4407], [\"24\", 0.3799], [\"25\", 0.4862], [\"26\", 0.9117], [\"27\", 1.4739], [\"28\", 1.2308], [\"29\", 1.246], [\"30\", 2.7351], [\"31\", 3.7532], [\"32\", 3.3126], [\"33\", 3.6621], [\"34\", 5.7438], [\"35\", 6.1389], [\"36\", 5.5767], [\"37\", 5.4247], [\"38\", 7.6128], [\"39\", 7.1874], [\"40\", 6.7011], [\"41\", 5.7742], [\"42\", 5.6071], [\"43\", 4.8777], [\"44\", 3.6013], [\"45\", 2.7959], [\"46\", 2.4312], [\"47\", 1.4739], [\"48\", 1.0637], [\"49\", 0.9573], [\"50\", 0.5926], [\"51\", 0.4559], [\"52\", 0.5926]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16200\", 0.0608], [\"16300\", 0.3039], [\"16400\", 7.7952], [\"16500\", 31.91], [\"16600\", 44.0814]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_bin = [0] * 26\n t_bin = [0] * 26\n for i in s:\n s_bin[ord(i) - ord(\"a\")] += 1 # Count the occurrences of each character in s\n for i in t:\n t_bin[ord(i) - ord(\"a\")] += 1 # Count the occurrences of each character in t\n\n for i in range(26):\n if t_bin[i] != s_bin[i]: # Find the character that occurs one extra time in t\n return chr(i + ord(\"a\"))","runtime":"18"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n \n if len(t)>len(s):\n for i in t:\n if t.count(i)>s.count(i):\n return(i)\n break\n\n \n ","runtime":"19"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n \n # Compute the sum of ASCII values of all characters in 't'\n sum_t = sum(map(ord, t))\n \n # Compute the sum of ASCII values of all characters in 's'\n sum_s = sum(map(ord, s))\n \n # The additional character's ASCII value is the difference between these sums\n additional_char = chr(sum_t - sum_s)\n \n return additional_char","runtime":"19"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n \n #compute the sum of ascii values of all characters in 't'\n sum_t = sum(map(ord, t))\n\n #compute the sum of ascii values of all characters in 's'\n sum_s = sum(map(ord, s))\n\n #the additional character's ascii valus is the difference between these sums\n additional_char = chr(sum_t - sum_s) \n\n return additional_char ","runtime":"20"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n char_cnt = collections.defaultdict(int)\n for c in t:\n char_cnt[c] += 1\n for c in s:\n char_cnt[c] -= 1\n \n for char, cnt in char_cnt.items():\n if cnt == 1:\n return char\n ","runtime":"21"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if s.count(i) != t.count(i):\n return i","runtime":"22"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n sum_t = sum(map(ord, t))\n\n #compute the sum of ascii values of all characters in 's'\n sum_s = sum(map(ord, s))\n\n #the additional character's ascii valus is the difference between these sums\n additional_char = chr(sum_t - sum_s) \n\n return additional_char ","runtime":"22"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))\n ","runtime":"23"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n sums = sum(ord(c) for c in s)\n sumt = sum(ord(c) for c in t)\n return chr(sumt - sums)\n ","runtime":"23"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n count = Counter(s)\n count2 = Counter(t)\n for i in t:\n if i not in s or count[i] != count2[i]:\n return i ","runtime":"24"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if s.count(i) != t.count(i):\n return i\n\n\n","runtime":"25"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n cs=Counter(s)\n ct=Counter(t)\n for i in ct:\n if ct[i]>cs[i]:\n return i\n ","runtime":"25"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if s.count(i) != t.count(i):\n return i\n","runtime":"26"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for n in t:\n if n in s:\n s=s.replace(n,'',1)\n else:\n return n","runtime":"26"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for l in t:\n if s.count(l)!=t.count(l):\n return l\n ","runtime":"27"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n result=0\n for i in s:\n result^=ord(i)\n for j in t:\n result^=ord(j)\n return chr(result) ","runtime":"27"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n counts = Counter(s)\n for c, count in Counter(t).items():\n if c not in counts or count > counts[c]:\n return c","runtime":"28"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n res = sum(ord(t[i]) - ord(s[i]) for i in range(len(s)))\n return chr(res + ord(t[-1]))","runtime":"28"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if s.count(i)!=t.count(i):\n return i\n ","runtime":"29"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_sum = sum(ord(c) for c in s)\n t_sum = sum(ord(c) for c in t)\n return chr(t_sum-s_sum)\n ","runtime":"30"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for n in t:\n if n in s:\n s=s.replace(n,'',1)\n else:\n return n","runtime":"30"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_sum = 0\n t_sum = 0\n s_sum = sum(ord(c) for c in s)\n t_sum += sum(ord(c) for c in t)\n return chr(t_sum-s_sum)","runtime":"31"},{"code":"class Solution:\n def findTheDifference(self, s:str, t: str) -> str:\n result = 0\n for char in s + t:\n result ^= ord(char)\n return chr(result)","runtime":"31"},{"code":"class Solution(object):\n \"\"\"\n xor\n \"\"\"\n def findTheDifference(self, s, t):\n code = 0\n for ch in s + t:\n code ^= ord(ch)\n return chr(code)","runtime":"32"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n ans = 0\n for c in t:\n ans =ans+ ord(c)\n\n for c in s:\n ans =ans- ord(c) \n return chr(ans)","runtime":"32"},{"code":"from collections import Counter\n\nclass Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n # Count the frequency of characters in both strings\n count_s = Counter(s)\n count_t = Counter(t)\n \n # Find the character that appears in t but not in s or more times in t\n for char in count_t:\n if char not in count_s or count_t[char] > count_s[char]:\n return char\n \n # This line should never be reached if the problem constraints are met\n return \"\"\n\n# Test the solution\nsolution = Solution()\nprint(solution.findTheDifference(\"abcd\", \"abcde\")) # Should print \"e\"\nprint(solution.findTheDifference(\"\", \"a\")) # Should print \"a\"","runtime":"33"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n result=0\n for c in s:\n result^=ord(c)\n for c in t:\n result^=ord(c)\n return chr(result)","runtime":"33"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if t.count(i) != s.count(i):\n return i","runtime":"34"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n count_s = Counter(s)\n count_t = Counter(t)\n \n for char in count_t:\n if count_t[char] > count_s[char]:\n return char\n","runtime":"34"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s = sorted(s)\n t = sorted(t)\n\n for i in range(len(t)-1):\n if s[i]!=t[i]:\n return t[i]\n \n return t[-1]\n\n \n\n\n ","runtime":"35"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n b = defaultdict(int)\n for i in t:\n b[i] += 1\n for j in s:\n b[j] -= 1\n for key, val in b.items():\n if val == 1:\n return key\n ","runtime":"35"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n result = 0\n for char in s:\n result ^= ord(char)\n for char in t:\n result ^= ord(char)\n return chr(result)\n\n ","runtime":"36"},{"code":"from collections import defaultdict\n\nclass Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n d = defaultdict(int)\n\n for c in t:\n d[c] += 1\n\n for c in s:\n d[c] -= 1\n\n a = next(filter(lambda x: d[x], d))\n return a","runtime":"36"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n c1 = Counter(s)\n c2 = Counter(t)\n for k,v in c2.items():\n if k not in c1 or v != c1[k]:\n return k","runtime":"37"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for l in t:\n if s.count(l)!=t.count(l):\n return (l)\n ","runtime":"37"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n \n s_array= {}\n for i in s:\n s_array[i] = s_array.get(i, 0) + 1\n \n # Loop through string 't' and check each character\n for j in t:\n if j not in s_array or s_array[j] == 0:\n return j\n else:\n s_array[j] -= 1 # Decrease the count of the character\n \n return \"\" # Default return if no difference is found\n\n","runtime":"38"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n t_s = sorted(s)\n t_t = sorted(t)\n print(t_s)\n for i,c in enumerate(t_s):\n if t_t[i] != c:\n return t_t[i]\n return t_t[-1]\n","runtime":"38"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n a=set(s)\n b=set(t)\n for i in a:\n if s.count(i)!=t.count(i):return i\n return list(b-a)[0]","runtime":"39"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_set = set(s)\n t_set = set(t)\n\n print(t_set.difference(s_set))\n return \"\".join(list(t_set.difference(s_set)))\n\nfrom collections import Counter\n\nclass Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_dict = Counter(s)\n missing = []\n for char in t:\n if char in s_dict:\n s_dict[char] -= 1\n if s_dict[char] == 0:\n del s_dict[char]\n else:\n missing.append(char)\n \n return \"\".join(missing)\n\nclass Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_dict = Counter(s)\n missing = []\n for char in t:\n if char in s_dict:\n s_dict[char] -= 1\n if s_dict[char] == 0:\n del s_dict[char]\n else:\n return char\n\nclass Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n base = 0\n\n for char in s:\n base ^= ord(char)\n \n for char in t:\n base ^= ord(char)\n \n return chr(base)","runtime":"39"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n\n\n t_dict = {}\n\n for char in t: \n \n if char in t_dict: \n t_dict[char] += 1\n\n else:\n t_dict[char] = 1\n \n # remove characters encountered in s from t_dict\n\n for char in s:\n\n if char in t_dict:\n t_dict[char] -= 1\n \n # find the element with count 1\n\n for char, count in t_dict.items():\n if count == 1: \n return char\n","runtime":"40"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if i in s:\n s=s.replace(i,'',1)\n else:\n return i\n\n\n \n ","runtime":"40"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n tmap = dict()\n for i in s:\n tmap[i] = tmap.get(i, 1) + 1\n \n for i in t:\n if i not in tmap or tmap[i] <= 0:\n return i\n else:\n tmap[i] = tmap.get(i, 1) - 1\n\n for k, v in tmap.items():\n if v <= 0:\n return k\n \n return \"\"","runtime":"41"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_s=sorted(s)\n s_t=sorted(t)\n\n for i in range(len(s_s)):\n if(s_s[i] != s_t[i]):\n return s_t[i]\n return s_t[-1]","runtime":"41"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n mapping = {}\n s = sorted(s)\n t = sorted(t)\n for i in range(len(s)):\n if s[i] != t[i]:\n return t[i]\n return t[-1]\n ","runtime":"42"},{"code":"from collections import Counter\n\nclass Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n # sd = dict()\n # for c in s:\n # if c in sd:\n # sd[c] += 1\n # else:\n # sd[c] = 1\n # st = dict()\n # for c in t:\n # if c not in sd:\n # return c\n # else:\n # if c in st:\n # st[c] += 1\n # else:\n # st[c] = 1\n # for c in s:\n # if st[c] - sd[c] == 1:\n # return c\n \n cs = Counter(list(s))\n ct = Counter(list(t))\n for c in ct:\n if c not in cs:\n return c\n elif ct[c] - cs[c] == 1:\n return c","runtime":"42"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n count_s=dict()\n for i in s:\n if i in count_s:\n count_s[i]+=1\n else:\n count_s[i]=0\n\n count_t=dict()\n for i in t:\n if i in count_t:\n count_t[i]+=1\n else:\n count_t[i]=0\n for c in count_t:\n if c not in count_s:\n return c\n if count_s[c]<count_t[c]:\n return c\n\n\n \n ","runtime":"43"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n res=0\n for i in s:\n res^=ord(i)\n for j in t:\n res^=ord(j)\n return chr(res)","runtime":"43"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s_sum = sum(ord(c) for c in s)\n t_sum = sum(ord(c) for c in t)\n return chr(t_sum - s_sum)","runtime":"44"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s1=\"\"\n for i in t:\n if i in s:\n s=s.replace(i,'',1)\n else:\n return i","runtime":"44"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n sdt = dict()\n tdt = dict()\n for val in s :\n if val in sdt:\n sdt[val]+=1\n else :\n sdt[val] = 1\n ans = \"\"\n for val in t :\n if val in tdt:\n tdt[val]+=1\n else :\n tdt[val] = 1\n for val in t :\n if val not in sdt or tdt[val] != sdt[val]:\n ans = val\n return ans","runtime":"45"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n m = {}\n\n for c in t:\n m[c] = m.get(c, 0) + 1\n \n for c in s:\n m[c] -= 1\n if m[c] == 0:\n del m[c]\n \n return list(m.keys())[0]\n \n\n","runtime":"45"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if i in s:\n a = t.index(i)\n b = s.index(i)\n t = t[:a] + t[a + 1:]\n s = s[:b] + s[b + 1:]\n \n return t[0]","runtime":"46"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n\n sCount=Counter(s)\n tCount=Counter(t)\n\n for key , value in tCount.items():\n if sCount[key]!=value:\n return key\n ","runtime":"46"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n alpha = [0]*26\n\n for i in t:\n alpha[ord(i) - ord('a')] += 1\n \n for i in s:\n alpha[ord(i) - ord('a')] -= 1\n\n for i in range(26):\n if alpha[i] == 1:\n return chr(97 + i)\n\n \n\n ","runtime":"47"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n for i in t:\n if i in s:\n a = t.index(i)\n b = s.index(i)\n t = t[:a] + t[a + 1:]\n s = s[:b] + s[b + 1:]\n \n return t[0]","runtime":"48"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n ss = sorted(s)\n tt = sorted(t)\n for i in range(len(ss)):\n if tt[i] != ss[i]:\n return tt[i]\n return tt[-1]","runtime":"48"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s = list(s)\n t = list(t)\n for each in s:\n if each in t:\n t.remove(each)\n return t[0]\n ","runtime":"49"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n ans = set(t)-set(s)\n for x in ans:\n return x\n d = Counter(s)\n for i in range(len(t)):\n if t[i] in d:\n d[t[i]]-=1\n if d[t[i]]<0:\n return t[i]\n else:\n return t[i]","runtime":"49"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n sorted_s = sorted(s)\n\n for c in t:\n high = len(sorted_s) - 1\n low = 0\n while low <= high:\n middle = (high + low) // 2\n guess = sorted_s[middle]\n if c == guess:\n sorted_s.pop(middle)\n break\n elif c < guess:\n high = middle - 1\n else:\n low = middle + 1\n if low > high:\n return c","runtime":"50"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_bin = [0] * 26\\n t_bin = [0] * 26\\n for i in s:\\n s_bin[ord(i) - ord(\\\"a\\\")] += 1 # Count the occurrences of each character in s\\n for i in t:\\n t_bin[ord(i) - ord(\\\"a\\\")] += 1 # Count the occurrences of each character in t\\n\\n for i in range(26):\\n if t_bin[i] != s_bin[i]: # Find the character that occurs one extra time in t\\n return chr(i + ord(\\\"a\\\"))\",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n \\n if len(t)>len(s):\\n for i in t:\\n if t.count(i)>s.count(i):\\n return(i)\\n break\\n\\n \\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n \\n # Compute the sum of ASCII values of all characters in 't'\\n sum_t = sum(map(ord, t))\\n \\n # Compute the sum of ASCII values of all characters in 's'\\n sum_s = sum(map(ord, s))\\n \\n # The additional character's ASCII value is the difference between these sums\\n additional_char = chr(sum_t - sum_s)\\n \\n return additional_char\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n \\n #compute the sum of ascii values of all characters in 't'\\n sum_t = sum(map(ord, t))\\n\\n #compute the sum of ascii values of all characters in 's'\\n sum_s = sum(map(ord, s))\\n\\n #the additional character's ascii valus is the difference between these sums\\n additional_char = chr(sum_t - sum_s) \\n\\n return additional_char \",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n char_cnt = collections.defaultdict(int)\\n for c in t:\\n char_cnt[c] += 1\\n for c in s:\\n char_cnt[c] -= 1\\n \\n for char, cnt in char_cnt.items():\\n if cnt == 1:\\n return char\\n \",\n \"runtime\": \"21\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if s.count(i) != t.count(i):\\n return i\",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n sum_t = sum(map(ord, t))\\n\\n #compute the sum of ascii values of all characters in 's'\\n sum_s = sum(map(ord, s))\\n\\n #the additional character's ascii valus is the difference between these sums\\n additional_char = chr(sum_t - sum_s) \\n\\n return additional_char \",\n \"runtime\": \"22\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n sums = sum(ord(c) for c in s)\\n sumt = sum(ord(c) for c in t)\\n return chr(sumt - sums)\\n \",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n count = Counter(s)\\n count2 = Counter(t)\\n for i in t:\\n if i not in s or count[i] != count2[i]:\\n return i \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if s.count(i) != t.count(i):\\n return i\\n\\n\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n cs=Counter(s)\\n ct=Counter(t)\\n for i in ct:\\n if ct[i]>cs[i]:\\n return i\\n \",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if s.count(i) != t.count(i):\\n return i\\n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for n in t:\\n if n in s:\\n s=s.replace(n,'',1)\\n else:\\n return n\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for l in t:\\n if s.count(l)!=t.count(l):\\n return l\\n \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n result=0\\n for i in s:\\n result^=ord(i)\\n for j in t:\\n result^=ord(j)\\n return chr(result) \",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n counts = Counter(s)\\n for c, count in Counter(t).items():\\n if c not in counts or count > counts[c]:\\n return c\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n res = sum(ord(t[i]) - ord(s[i]) for i in range(len(s)))\\n return chr(res + ord(t[-1]))\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if s.count(i)!=t.count(i):\\n return i\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_sum = sum(ord(c) for c in s)\\n t_sum = sum(ord(c) for c in t)\\n return chr(t_sum-s_sum)\\n \",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for n in t:\\n if n in s:\\n s=s.replace(n,'',1)\\n else:\\n return n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_sum = 0\\n t_sum = 0\\n s_sum = sum(ord(c) for c in s)\\n t_sum += sum(ord(c) for c in t)\\n return chr(t_sum-s_sum)\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s:str, t: str) -> str:\\n result = 0\\n for char in s + t:\\n result ^= ord(char)\\n return chr(result)\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution(object):\\n \\\"\\\"\\\"\\n xor\\n \\\"\\\"\\\"\\n def findTheDifference(self, s, t):\\n code = 0\\n for ch in s + t:\\n code ^= ord(ch)\\n return chr(code)\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n ans = 0\\n for c in t:\\n ans =ans+ ord(c)\\n\\n for c in s:\\n ans =ans- ord(c) \\n return chr(ans)\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n # Count the frequency of characters in both strings\\n count_s = Counter(s)\\n count_t = Counter(t)\\n \\n # Find the character that appears in t but not in s or more times in t\\n for char in count_t:\\n if char not in count_s or count_t[char] > count_s[char]:\\n return char\\n \\n # This line should never be reached if the problem constraints are met\\n return \\\"\\\"\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.findTheDifference(\\\"abcd\\\", \\\"abcde\\\")) # Should print \\\"e\\\"\\nprint(solution.findTheDifference(\\\"\\\", \\\"a\\\")) # Should print \\\"a\\\"\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n result=0\\n for c in s:\\n result^=ord(c)\\n for c in t:\\n result^=ord(c)\\n return chr(result)\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if t.count(i) != s.count(i):\\n return i\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n count_s = Counter(s)\\n count_t = Counter(t)\\n \\n for char in count_t:\\n if count_t[char] > count_s[char]:\\n return char\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s = sorted(s)\\n t = sorted(t)\\n\\n for i in range(len(t)-1):\\n if s[i]!=t[i]:\\n return t[i]\\n \\n return t[-1]\\n\\n \\n\\n\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n b = defaultdict(int)\\n for i in t:\\n b[i] += 1\\n for j in s:\\n b[j] -= 1\\n for key, val in b.items():\\n if val == 1:\\n return key\\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n result = 0\\n for char in s:\\n result ^= ord(char)\\n for char in t:\\n result ^= ord(char)\\n return chr(result)\\n\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n d = defaultdict(int)\\n\\n for c in t:\\n d[c] += 1\\n\\n for c in s:\\n d[c] -= 1\\n\\n a = next(filter(lambda x: d[x], d))\\n return a\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n c1 = Counter(s)\\n c2 = Counter(t)\\n for k,v in c2.items():\\n if k not in c1 or v != c1[k]:\\n return k\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for l in t:\\n if s.count(l)!=t.count(l):\\n return (l)\\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n \\n s_array= {}\\n for i in s:\\n s_array[i] = s_array.get(i, 0) + 1\\n \\n # Loop through string 't' and check each character\\n for j in t:\\n if j not in s_array or s_array[j] == 0:\\n return j\\n else:\\n s_array[j] -= 1 # Decrease the count of the character\\n \\n return \\\"\\\" # Default return if no difference is found\\n\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n t_s = sorted(s)\\n t_t = sorted(t)\\n print(t_s)\\n for i,c in enumerate(t_s):\\n if t_t[i] != c:\\n return t_t[i]\\n return t_t[-1]\\n\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n a=set(s)\\n b=set(t)\\n for i in a:\\n if s.count(i)!=t.count(i):return i\\n return list(b-a)[0]\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_set = set(s)\\n t_set = set(t)\\n\\n print(t_set.difference(s_set))\\n return \\\"\\\".join(list(t_set.difference(s_set)))\\n\\nfrom collections import Counter\\n\\nclass Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_dict = Counter(s)\\n missing = []\\n for char in t:\\n if char in s_dict:\\n s_dict[char] -= 1\\n if s_dict[char] == 0:\\n del s_dict[char]\\n else:\\n missing.append(char)\\n \\n return \\\"\\\".join(missing)\\n\\nclass Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_dict = Counter(s)\\n missing = []\\n for char in t:\\n if char in s_dict:\\n s_dict[char] -= 1\\n if s_dict[char] == 0:\\n del s_dict[char]\\n else:\\n return char\\n\\nclass Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n base = 0\\n\\n for char in s:\\n base ^= ord(char)\\n \\n for char in t:\\n base ^= ord(char)\\n \\n return chr(base)\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n\\n\\n t_dict = {}\\n\\n for char in t: \\n \\n if char in t_dict: \\n t_dict[char] += 1\\n\\n else:\\n t_dict[char] = 1\\n \\n # remove characters encountered in s from t_dict\\n\\n for char in s:\\n\\n if char in t_dict:\\n t_dict[char] -= 1\\n \\n # find the element with count 1\\n\\n for char, count in t_dict.items():\\n if count == 1: \\n return char\\n\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if i in s:\\n s=s.replace(i,'',1)\\n else:\\n return i\\n\\n\\n \\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n tmap = dict()\\n for i in s:\\n tmap[i] = tmap.get(i, 1) + 1\\n \\n for i in t:\\n if i not in tmap or tmap[i] <= 0:\\n return i\\n else:\\n tmap[i] = tmap.get(i, 1) - 1\\n\\n for k, v in tmap.items():\\n if v <= 0:\\n return k\\n \\n return \\\"\\\"\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_s=sorted(s)\\n s_t=sorted(t)\\n\\n for i in range(len(s_s)):\\n if(s_s[i] != s_t[i]):\\n return s_t[i]\\n return s_t[-1]\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n mapping = {}\\n s = sorted(s)\\n t = sorted(t)\\n for i in range(len(s)):\\n if s[i] != t[i]:\\n return t[i]\\n return t[-1]\\n \",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n # sd = dict()\\n # for c in s:\\n # if c in sd:\\n # sd[c] += 1\\n # else:\\n # sd[c] = 1\\n # st = dict()\\n # for c in t:\\n # if c not in sd:\\n # return c\\n # else:\\n # if c in st:\\n # st[c] += 1\\n # else:\\n # st[c] = 1\\n # for c in s:\\n # if st[c] - sd[c] == 1:\\n # return c\\n \\n cs = Counter(list(s))\\n ct = Counter(list(t))\\n for c in ct:\\n if c not in cs:\\n return c\\n elif ct[c] - cs[c] == 1:\\n return c\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n count_s=dict()\\n for i in s:\\n if i in count_s:\\n count_s[i]+=1\\n else:\\n count_s[i]=0\\n\\n count_t=dict()\\n for i in t:\\n if i in count_t:\\n count_t[i]+=1\\n else:\\n count_t[i]=0\\n for c in count_t:\\n if c not in count_s:\\n return c\\n if count_s[c]<count_t[c]:\\n return c\\n\\n\\n \\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n res=0\\n for i in s:\\n res^=ord(i)\\n for j in t:\\n res^=ord(j)\\n return chr(res)\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s_sum = sum(ord(c) for c in s)\\n t_sum = sum(ord(c) for c in t)\\n return chr(t_sum - s_sum)\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s1=\\\"\\\"\\n for i in t:\\n if i in s:\\n s=s.replace(i,'',1)\\n else:\\n return i\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n sdt = dict()\\n tdt = dict()\\n for val in s :\\n if val in sdt:\\n sdt[val]+=1\\n else :\\n sdt[val] = 1\\n ans = \\\"\\\"\\n for val in t :\\n if val in tdt:\\n tdt[val]+=1\\n else :\\n tdt[val] = 1\\n for val in t :\\n if val not in sdt or tdt[val] != sdt[val]:\\n ans = val\\n return ans\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n m = {}\\n\\n for c in t:\\n m[c] = m.get(c, 0) + 1\\n \\n for c in s:\\n m[c] -= 1\\n if m[c] == 0:\\n del m[c]\\n \\n return list(m.keys())[0]\\n \\n\\n\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if i in s:\\n a = t.index(i)\\n b = s.index(i)\\n t = t[:a] + t[a + 1:]\\n s = s[:b] + s[b + 1:]\\n \\n return t[0]\",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n\\n sCount=Counter(s)\\n tCount=Counter(t)\\n\\n for key , value in tCount.items():\\n if sCount[key]!=value:\\n return key\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n alpha = [0]*26\\n\\n for i in t:\\n alpha[ord(i) - ord('a')] += 1\\n \\n for i in s:\\n alpha[ord(i) - ord('a')] -= 1\\n\\n for i in range(26):\\n if alpha[i] == 1:\\n return chr(97 + i)\\n\\n \\n\\n \",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n for i in t:\\n if i in s:\\n a = t.index(i)\\n b = s.index(i)\\n t = t[:a] + t[a + 1:]\\n s = s[:b] + s[b + 1:]\\n \\n return t[0]\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n ss = sorted(s)\\n tt = sorted(t)\\n for i in range(len(ss)):\\n if tt[i] != ss[i]:\\n return tt[i]\\n return tt[-1]\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s = list(s)\\n t = list(t)\\n for each in s:\\n if each in t:\\n t.remove(each)\\n return t[0]\\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n ans = set(t)-set(s)\\n for x in ans:\\n return x\\n d = Counter(s)\\n for i in range(len(t)):\\n if t[i] in d:\\n d[t[i]]-=1\\n if d[t[i]]<0:\\n return t[i]\\n else:\\n return t[i]\",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n sorted_s = sorted(s)\\n\\n for c in t:\\n high = len(sorted_s) - 1\\n low = 0\\n while low <= high:\\n middle = (high + low) // 2\\n guess = sorted_s[middle]\\n if c == guess:\\n sorted_s.pop(middle)\\n break\\n elif c < guess:\\n high = middle - 1\\n else:\\n low = middle + 1\\n if low > high:\\n return c\",\n \"runtime\": \"50\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":59,"string":"59"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s = sorted(s)\n t = sorted(t)\n\n for i in range(len(t)-1):\n if s[i]!=t[i]:\n return t[i]\n \n return t[-1]\n\n \n\n\n ","memory":"16200"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n res=0\n for i in s:\n res^=ord(i)\n for j in t:\n res^=ord(j)\n return chr(res)","memory":"16300"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n\n sorted_s = sorted(s)\n sorted_t = sorted(t)\n \n i = 0\n\n while i < len(s):\n if sorted_s[i] != sorted_t[i]:\n return sorted_t[i]\n i += 1\n \n return sorted_t[i]\n","memory":"16400"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n s=list(s)\n t=list(t)\n for i in t:\n if i not in s:\n return i\n if i in s:\n s[s.index(i)]=\"-\"\n ","memory":"16400"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n sdt = dict()\n tdt = dict()\n for val in s :\n if val in sdt:\n sdt[val]+=1\n else :\n sdt[val] = 1\n ans = \"\"\n for val in t :\n if val in tdt:\n tdt[val]+=1\n else :\n tdt[val] = 1\n for val in t :\n if val not in sdt or tdt[val] != sdt[val]:\n ans = val\n return ans","memory":"16500"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n result=0\n for c in s:\n result^=ord(c)\n for c in t:\n result^=ord(c)\n return chr(result)","memory":"16500"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n \n s_array= {}\n for i in s:\n s_array[i] = s_array.get(i, 0) + 1\n \n # Loop through string 't' and check each character\n for j in t:\n if j not in s_array or s_array[j] == 0:\n return j\n else:\n s_array[j] -= 1 # Decrease the count of the character\n \n return \"\" # Default return if no difference is found\n\n","memory":"16600"},{"code":"class Solution:\n def findTheDifference(self, s: str, t: str) -> str:\n counts = Counter(s)\n for c, count in Counter(t).items():\n if c not in counts or count > counts[c]:\n return c","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s = sorted(s)\\n t = sorted(t)\\n\\n for i in range(len(t)-1):\\n if s[i]!=t[i]:\\n return t[i]\\n \\n return t[-1]\\n\\n \\n\\n\\n \",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n res=0\\n for i in s:\\n res^=ord(i)\\n for j in t:\\n res^=ord(j)\\n return chr(res)\",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n\\n sorted_s = sorted(s)\\n sorted_t = sorted(t)\\n \\n i = 0\\n\\n while i < len(s):\\n if sorted_s[i] != sorted_t[i]:\\n return sorted_t[i]\\n i += 1\\n \\n return sorted_t[i]\\n\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n s=list(s)\\n t=list(t)\\n for i in t:\\n if i not in s:\\n return i\\n if i in s:\\n s[s.index(i)]=\\\"-\\\"\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n sdt = dict()\\n tdt = dict()\\n for val in s :\\n if val in sdt:\\n sdt[val]+=1\\n else :\\n sdt[val] = 1\\n ans = \\\"\\\"\\n for val in t :\\n if val in tdt:\\n tdt[val]+=1\\n else :\\n tdt[val] = 1\\n for val in t :\\n if val not in sdt or tdt[val] != sdt[val]:\\n ans = val\\n return ans\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n result=0\\n for c in s:\\n result^=ord(c)\\n for c in t:\\n result^=ord(c)\\n return chr(result)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n \\n s_array= {}\\n for i in s:\\n s_array[i] = s_array.get(i, 0) + 1\\n \\n # Loop through string 't' and check each character\\n for j in t:\\n if j not in s_array or s_array[j] == 0:\\n return j\\n else:\\n s_array[j] -= 1 # Decrease the count of the character\\n \\n return \\\"\\\" # Default return if no difference is found\\n\\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def findTheDifference(self, s: str, t: str) -> str:\\n counts = Counter(s)\\n for c, count in Counter(t).items():\\n if c not in counts or count > counts[c]:\\n return c\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":8,"string":"8"}}},{"rowIdx":292,"cells":{"question_id":{"kind":"number","value":390,"string":"390"},"name":{"kind":"string","value":"elimination-game"},"content":{"kind":"string","value":"<p>You have a list <code>arr</code> of all integers in the range <code>[1, n]</code> sorted in a strictly increasing order. Apply the following algorithm on <code>arr</code>:</p>\n\n<ul>\n\t<li>Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.</li>\n\t<li>Repeat the previous step again, but this time from right to left, remove the rightmost number and every other number from the remaining numbers.</li>\n\t<li>Keep repeating the steps again, alternating left to right and right to left, until a single number remains.</li>\n</ul>\n\n<p>Given the integer <code>n</code>, return <em>the last number that remains in</em> <code>arr</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 9\n<strong>Output:</strong> 6\n<strong>Explanation:</strong>\narr = [<u>1</u>, 2, <u>3</u>, 4, <u>5</u>, 6, <u>7</u>, 8, <u>9</u>]\narr = [2, <u>4</u>, 6, <u>8</u>]\narr = [<u>2</u>, 6]\narr = [6]\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 1\n<strong>Output:</strong> 1\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 10<sup>9</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":45.718633690580816,"string":"45.718634"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["math","recursion"],"string":"[\n \"math\",\n \"recursion\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"23\", 0.1873], [\"24\", 0.1873], [\"25\", 0.3745], [\"26\", 0.1873], [\"27\", 0.5618], [\"28\", 1.1236], [\"29\", 0.3745], [\"30\", 1.3109], [\"31\", 2.2472], [\"32\", 2.0599], [\"33\", 1.1236], [\"34\", 2.809], [\"35\", 5.8052], [\"36\", 4.8689], [\"37\", 3.7453], [\"38\", 3.3708], [\"39\", 8.2397], [\"40\", 6.1798], [\"41\", 4.8689], [\"42\", 7.1161], [\"43\", 5.4307], [\"44\", 4.6816], [\"45\", 4.6816], [\"46\", 4.3071], [\"47\", 5.4307], [\"48\", 2.4345], [\"49\", 4.6816], [\"50\", 2.809], [\"51\", 2.2472], [\"52\", 1.4981]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16300\", 0.1873], [\"16400\", 7.1161], [\"16500\", 30.1498], [\"16600\", 44.1948]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left = True # flag to keep track of left-to-right or right-to-left elimination\n remaining = n # keep track of the remaining numbers\n step = 1 # keep track of the step size\n head = 1 # keep track of the head of the remaining numbers\n while remaining > 1:\n # if we're going from left to right or from right to left with an odd number of remaining elements\n # or from right to left with an even number of remaining elements, then we need to update the head\n if left or remaining % 2 == 1:\n head += step\n step *= 2 # double the step size\n remaining //= 2 # divide the remaining elements by 2\n left = not left # flip the flag\n\n return head","runtime":"23"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left = True\n rem = n\n step = 1\n head = 1\n while rem >1 :\n if left or rem % 2 == 1:\n head += step\n \n step *= 2\n rem //=2\n left = not left\n return head ","runtime":"24"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left_to_right = True\n remaining = n\n step = 1\n head = 1\n \n while remaining > 1:\n if left_to_right or remaining % 2 == 1:\n head += step\n remaining //= 2\n step *= 2\n left_to_right = not left_to_right\n \n return head","runtime":"25"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n f=True\n diff=1\n ans=1\n while n>1:\n if f or n%2==1:\n ans+=diff\n diff*=2\n n=n//2\n f=not f\n return ans","runtime":"26"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n N = n # number of remaining numbers\n fwd = True # flag for forward/backward elimination\n m = 2 # elimination step/interval\n s = 0 # elimination base\n\n while N > 1:\n if fwd or N % 2 == 1: \n s += m // 2\n m *= 2\n N = N // 2\n fwd = not fwd # reverse the pass direction\n return s+1","runtime":"27"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left = True\n remaining = n\n step = 1\n head = 1\n while remaining > 1:\n if left or remaining % 2 == 1:\n head += step\n \n step *= 2\n remaining //= 2\n left = not left\n \n return head","runtime":"28"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n head=1\n step=1\n r=n\n l=True\n while r>1:\n if l or r%2==1:\n head+=step\n step*=2\n r//=2\n l=not l\n return head\n","runtime":"29"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n first = 1\n d = 1\n length = n\n\n l2r = True\n while length > 1:\n if l2r or length % 2:\n first += d\n\n d *= 2\n length //= 2\n l2r = not l2r\n\n return first","runtime":"30"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return 1 if n == 1 else 2 * (n // 2 + 1 - self.lastRemaining(n//2))\n ","runtime":"31"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left = True\n remaining = n\n step = 1\n head = 1\n \n while remaining > 1:\n if left or remaining % 2 == 1:\n head += step\n \n remaining //= 2\n step *= 2\n left = not left\n \n return head","runtime":"32"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n # Base case\n if n == 1:\n return 1\n \n # Recursive relation\n return 2 * (1 + n // 2 - self.lastRemaining(n // 2))\n\n# Example usage:\nsolution = Solution()\nprint(solution.lastRemaining(9)) # Output: 6\nprint(solution.lastRemaining(1)) # Output: 1","runtime":"33"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n l = 1\n r = n\n length = n\n direction = 1\n i=0\n while length>1:\n if direction == 1:\n l = l+2**i\n if length%2 == 1:\n r = r-2**i\n direction = -1\n else:\n r = r-2**i\n if length%2 == 1:\n l = l+2**i\n direction = 1\n i+=1\n length = length//2\n return l","runtime":"33"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n head = 1\n step = 1\n remaining = n\n left_to_right = True\n \n while remaining > 1:\n if left_to_right or remaining % 2 == 1:\n head += step\n remaining //= 2\n step *= 2\n left_to_right = not left_to_right\n \n return head","runtime":"34"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left_to_right = True\n head = 1\n step = 1\n remaining = n\n while remaining > 1:\n if left_to_right or remaining % 2 == 1:\n head += step\n remaining //= 2\n step *= 2\n left_to_right = not left_to_right\n return head","runtime":"35"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n def eliminate(n,a,d):\n if n==1:\n return a\n else:\n return eliminate(n//2,a+((n//2-1))*d+d//2,-(d)*2)\n\n return eliminate(n,1,2)","runtime":"35"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n isLeft = True\n remaining = n\n step =1\n head=1\n while remaining>1:\n # print (isLeft,remaining,remaining%2,head,step)\n if isLeft or remaining%2==1:\n head+=step\n step*=2\n remaining //=2\n isLeft=not isLeft\n return head \n ","runtime":"36"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left = True # flag to keep track of left-to-right or right-to-left elimination\n remaining = n # keep track of the remaining numbers\n step = 1 # keep track of the step size\n head = 1 # keep track of the head of the remaining numbers\n while remaining > 1:\n # if we're going from left to right or from right to left with an odd number of remaining elements\n # or from right to left with an even number of remaining elements, then we need to update the head\n if left or remaining % 2 == 1:\n head += step\n step *= 2 # double the step size\n remaining //= 2 # divide the remaining elements by 2\n left = not left # flip the flag\n\n return head","runtime":"37"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n # Initial step\n start = 1\n step = 1\n remaining = n\n left_to_right = True\n\n while remaining > 1:\n # If we are moving left to right or if we have an odd number of elements left\n if left_to_right or remaining % 2 == 1:\n start += step\n \n # Halve the step size\n step *= 2\n remaining //= 2\n \n # Toggle direction\n left_to_right = not left_to_right\n\n return start\n\n# Example usage:\nsolution = Solution()\nprint(solution.lastRemaining(9)) # Output: 6\nprint(solution.lastRemaining(1)) # Output: 1","runtime":"38"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n N = n # number of remaining numbers\n fwd = True # flag for forward/backward elimination\n m = 2 # elimination step/interval\n s = 0 # elimination base\n\n while N > 1:\n if fwd or N % 2 == 1: \n s += m // 2\n m *= 2\n N = N // 2\n fwd = not fwd # reverse the pass direction\n return s+1","runtime":"39"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left_to_right = True\n interval = 1 # step in the algorithm\n last_remaining = n # last number in array\n \n # length of the array is > 1\n while n > 1:\n # if array length is odd or going right to left\n if n%2 == 1 or not left_to_right:\n last_remaining = last_remaining - interval # subtract interval\n \n n = int(n/2) # get new size of array\n left_to_right = not left_to_right\n interval *= 2 # get new interval\n \n return last_remaining","runtime":"39"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return 1 if n == 1 else 2 * (1 + n // 2 - self.lastRemaining(n // 2))","runtime":"40"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n l = 1\n r = n\n length = n\n direction = 1\n i=0\n while length>1:\n if direction == 1:\n l = l+2**i\n if length%2 == 1:\n r = r-2**i\n direction = -1\n else:\n r = r-2**i\n if length%2 == 1:\n l = l+2**i\n direction = 1\n i+=1\n length = length//2\n return l","runtime":"41"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n l = 1\n r = n\n length = n\n direction = 1\n i=0\n while length>1:\n if direction == 1:\n l = l+2**i\n if length%2 == 1:\n r = r-2**i\n direction = -1\n else:\n r = r-2**i\n if length%2 == 1:\n l = l+2**i\n direction = 1\n i+=1\n length = length//2\n return l","runtime":"41"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n head = 1\n step = 1\n remaining = n\n left_to_right = True\n \n while remaining > 1:\n # We only change the head when we're moving left-to-right\n # or if the number of remaining elements is odd\n if left_to_right or remaining % 2 == 1:\n head += step\n \n # Update the remaining numbers and step size\n remaining //= 2\n step *= 2\n left_to_right = not left_to_right # Switch direction\n \n return head","runtime":"42"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n def helper(n, isLeftToRight):\n if n == 1:\n return 1\n if isLeftToRight:\n return 2 * helper(n // 2, False)\n else:\n if n % 2 == 1:\n return 2 * helper(n // 2, True)\n else:\n return 2 * helper(n // 2, True) - 1\n \n return helper(n, True)\n\n# Example usage:\nsolution = Solution()\nprint(solution.lastRemaining(9)) # Output: 6\nprint(solution.lastRemaining(1)) # Output: 1","runtime":"43"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n l = 1\n r = n\n length = n\n direction = 1\n i=0\n while length>1:\n if direction == 1:\n l = l+2**i\n if length%2 == 1:\n r = r-2**i\n direction = -1\n else:\n r = r-2**i\n if length%2 == 1:\n l = l+2**i\n direction = 1\n i+=1\n length = length//2\n return l","runtime":"43"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left = 1\n remain = n\n step = 1\n head = 1\n while remain > 1:\n if left or remain % 2:\n head += step\n step *= 2\n remain //= 2\n left ^= 1\n return head","runtime":"44"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return self.differentiator_func(n, 1, 1, True)\n\n def differentiator_func(self, n: int, diff: int, head: int, left: bool) -> int:\n if n == 1:\n return head\n \n if left or (not left and n % 2 == 1):\n head += diff\n \n diff *= 2\n return self.differentiator_func(n // 2, diff, head, not left)","runtime":"45"},{"code":"class Solution:\n '''\n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 - > 2 4 6 8 10 12 14 16 18 20 22 24\n 2 4 6 8 10 12 14 16 18 20 22 24 - > 2 6 10 14 18 22\n 2 6 10 14 18 22 - > 6 14 22\n 6 14 22 - > 14\n\n '''\n def lastRemaining(self, n: int) -> int:\n head = 1\n remaining = n\n step = 1\n left = True\n while remaining > 1:\n # if we're going from left to right or from right to left with an odd number of remaining elements\n # or from right to left with an even number of remaining elements, then we need to update the head\n if left or remaining % 2 == 1:\n head += step\n left = not left\n step += step\n remaining //= 2\n return head\n\n\n\n def lastRemainingBruteforce(self, n: int) -> int:\n if n == 1:\n return 1\n arr = []\n for i in range(2, n+1, 2):\n arr.append(i)\n start = 1\n while len(arr) != 1:\n tmp = []\n if start == 0:\n for i in range(1, len(arr), 2):\n tmp.append(arr[i])\n else:\n for i in range(len(arr)-2, -1, -2):\n tmp.append(arr[i])\n tmp = tmp[::-1]\n arr = tmp\n start = start ^ 1\n \n return arr[0]\n ","runtime":"46"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n def find(n,left_to_right):\n if(n==1):\n return 1\n if(left_to_right):\n return 2*find(n//2,False)\n else:\n return 2*find(n//2,True)-1+n%2\n return find(n,True)","runtime":"47"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n start=1\n step=1\n left=True\n remaining=n\n\n while remaining>1:\n if left or remaining%2==1:\n start+=step\n remaining//=2\n step*=2\n left=not left\n return start\n","runtime":"48"},{"code":"class Solution:\n\n def lastRemaining(self, n: int) -> int:\n return 1 if n==1 else 2*(n//2+1-self.lastRemaining(n//2))\n \n ","runtime":"49"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n \"\"\"\n arr = [i+1 for i in range(n)]\n pos = 1\n while len(arr) > 1:\n if pos > 0 or (pos < 0 and len(arr)%2 == 1):\n newArr = [arr[i] for i in range(len(arr)) if i%2 == 1]\n else:\n newArr = [arr[i] for i in range(len(arr)) if i%2 == 0]\n pos *= -1\n arr = newArr\n return arr[0]\n \"\"\"\n def f(k, parity):\n if k == 1:\n return 1\n if parity > 0:\n return f(k//2, parity*-1)*2\n else:\n if k%2 == 0:\n return f(k//2, parity*-1)*2-1\n else:\n return f(k//2, parity*-1)*2\n return f(n, 1)\n\n","runtime":"50"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n #Every round, the separation between elements doubles\n #And the spacing between elements remains uniform\n #Rather than going through and deleting elements from an actual list\n #We could determine the ends of the list and the spacing of the list\n\n def recFind(left, right, spacing, direction = 0):\n if left == right:\n return left\n else:\n if direction == 0:\n #Now need to figure out if the right will stay the same, or move left by one\n if ((right-left)//spacing)%2 == 0:\n right -= spacing\n \n left += spacing\n return recFind(left, right, 2*spacing, 1)\n\n elif direction == 1:\n if ((right-left)//spacing)%2 == 0:\n left += spacing\n \n right -= spacing\n\n return recFind(left, right, 2*spacing, 0)\n\n return recFind(1, n, 1)\n ","runtime":"50"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return 1 if n==1 else 2*(n//2+1-self.lastRemaining(n//2))\n\n \n\n ","runtime":"51"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return self.differentiator_func(n, 1, 1, True)\n\n def differentiator_func(self, n: int, diff: int, head: int, left: bool) -> int:\n if n == 1:\n return head\n \n if left or (not left and n % 2 == 1):\n head += diff\n \n diff *= 2\n return self.differentiator_func(n // 2, diff, head, not left)","runtime":"52"}],"string":"[\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left = True # flag to keep track of left-to-right or right-to-left elimination\\n remaining = n # keep track of the remaining numbers\\n step = 1 # keep track of the step size\\n head = 1 # keep track of the head of the remaining numbers\\n while remaining > 1:\\n # if we're going from left to right or from right to left with an odd number of remaining elements\\n # or from right to left with an even number of remaining elements, then we need to update the head\\n if left or remaining % 2 == 1:\\n head += step\\n step *= 2 # double the step size\\n remaining //= 2 # divide the remaining elements by 2\\n left = not left # flip the flag\\n\\n return head\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left = True\\n rem = n\\n step = 1\\n head = 1\\n while rem >1 :\\n if left or rem % 2 == 1:\\n head += step\\n \\n step *= 2\\n rem //=2\\n left = not left\\n return head \",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left_to_right = True\\n remaining = n\\n step = 1\\n head = 1\\n \\n while remaining > 1:\\n if left_to_right or remaining % 2 == 1:\\n head += step\\n remaining //= 2\\n step *= 2\\n left_to_right = not left_to_right\\n \\n return head\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n f=True\\n diff=1\\n ans=1\\n while n>1:\\n if f or n%2==1:\\n ans+=diff\\n diff*=2\\n n=n//2\\n f=not f\\n return ans\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n N = n # number of remaining numbers\\n fwd = True # flag for forward/backward elimination\\n m = 2 # elimination step/interval\\n s = 0 # elimination base\\n\\n while N > 1:\\n if fwd or N % 2 == 1: \\n s += m // 2\\n m *= 2\\n N = N // 2\\n fwd = not fwd # reverse the pass direction\\n return s+1\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left = True\\n remaining = n\\n step = 1\\n head = 1\\n while remaining > 1:\\n if left or remaining % 2 == 1:\\n head += step\\n \\n step *= 2\\n remaining //= 2\\n left = not left\\n \\n return head\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n head=1\\n step=1\\n r=n\\n l=True\\n while r>1:\\n if l or r%2==1:\\n head+=step\\n step*=2\\n r//=2\\n l=not l\\n return head\\n\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n first = 1\\n d = 1\\n length = n\\n\\n l2r = True\\n while length > 1:\\n if l2r or length % 2:\\n first += d\\n\\n d *= 2\\n length //= 2\\n l2r = not l2r\\n\\n return first\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return 1 if n == 1 else 2 * (n // 2 + 1 - self.lastRemaining(n//2))\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left = True\\n remaining = n\\n step = 1\\n head = 1\\n \\n while remaining > 1:\\n if left or remaining % 2 == 1:\\n head += step\\n \\n remaining //= 2\\n step *= 2\\n left = not left\\n \\n return head\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n # Base case\\n if n == 1:\\n return 1\\n \\n # Recursive relation\\n return 2 * (1 + n // 2 - self.lastRemaining(n // 2))\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lastRemaining(9)) # Output: 6\\nprint(solution.lastRemaining(1)) # Output: 1\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n l = 1\\n r = n\\n length = n\\n direction = 1\\n i=0\\n while length>1:\\n if direction == 1:\\n l = l+2**i\\n if length%2 == 1:\\n r = r-2**i\\n direction = -1\\n else:\\n r = r-2**i\\n if length%2 == 1:\\n l = l+2**i\\n direction = 1\\n i+=1\\n length = length//2\\n return l\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n head = 1\\n step = 1\\n remaining = n\\n left_to_right = True\\n \\n while remaining > 1:\\n if left_to_right or remaining % 2 == 1:\\n head += step\\n remaining //= 2\\n step *= 2\\n left_to_right = not left_to_right\\n \\n return head\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left_to_right = True\\n head = 1\\n step = 1\\n remaining = n\\n while remaining > 1:\\n if left_to_right or remaining % 2 == 1:\\n head += step\\n remaining //= 2\\n step *= 2\\n left_to_right = not left_to_right\\n return head\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n def eliminate(n,a,d):\\n if n==1:\\n return a\\n else:\\n return eliminate(n//2,a+((n//2-1))*d+d//2,-(d)*2)\\n\\n return eliminate(n,1,2)\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n isLeft = True\\n remaining = n\\n step =1\\n head=1\\n while remaining>1:\\n # print (isLeft,remaining,remaining%2,head,step)\\n if isLeft or remaining%2==1:\\n head+=step\\n step*=2\\n remaining //=2\\n isLeft=not isLeft\\n return head \\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left = True # flag to keep track of left-to-right or right-to-left elimination\\n remaining = n # keep track of the remaining numbers\\n step = 1 # keep track of the step size\\n head = 1 # keep track of the head of the remaining numbers\\n while remaining > 1:\\n # if we're going from left to right or from right to left with an odd number of remaining elements\\n # or from right to left with an even number of remaining elements, then we need to update the head\\n if left or remaining % 2 == 1:\\n head += step\\n step *= 2 # double the step size\\n remaining //= 2 # divide the remaining elements by 2\\n left = not left # flip the flag\\n\\n return head\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n # Initial step\\n start = 1\\n step = 1\\n remaining = n\\n left_to_right = True\\n\\n while remaining > 1:\\n # If we are moving left to right or if we have an odd number of elements left\\n if left_to_right or remaining % 2 == 1:\\n start += step\\n \\n # Halve the step size\\n step *= 2\\n remaining //= 2\\n \\n # Toggle direction\\n left_to_right = not left_to_right\\n\\n return start\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lastRemaining(9)) # Output: 6\\nprint(solution.lastRemaining(1)) # Output: 1\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n N = n # number of remaining numbers\\n fwd = True # flag for forward/backward elimination\\n m = 2 # elimination step/interval\\n s = 0 # elimination base\\n\\n while N > 1:\\n if fwd or N % 2 == 1: \\n s += m // 2\\n m *= 2\\n N = N // 2\\n fwd = not fwd # reverse the pass direction\\n return s+1\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left_to_right = True\\n interval = 1 # step in the algorithm\\n last_remaining = n # last number in array\\n \\n # length of the array is > 1\\n while n > 1:\\n # if array length is odd or going right to left\\n if n%2 == 1 or not left_to_right:\\n last_remaining = last_remaining - interval # subtract interval\\n \\n n = int(n/2) # get new size of array\\n left_to_right = not left_to_right\\n interval *= 2 # get new interval\\n \\n return last_remaining\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return 1 if n == 1 else 2 * (1 + n // 2 - self.lastRemaining(n // 2))\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n l = 1\\n r = n\\n length = n\\n direction = 1\\n i=0\\n while length>1:\\n if direction == 1:\\n l = l+2**i\\n if length%2 == 1:\\n r = r-2**i\\n direction = -1\\n else:\\n r = r-2**i\\n if length%2 == 1:\\n l = l+2**i\\n direction = 1\\n i+=1\\n length = length//2\\n return l\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n l = 1\\n r = n\\n length = n\\n direction = 1\\n i=0\\n while length>1:\\n if direction == 1:\\n l = l+2**i\\n if length%2 == 1:\\n r = r-2**i\\n direction = -1\\n else:\\n r = r-2**i\\n if length%2 == 1:\\n l = l+2**i\\n direction = 1\\n i+=1\\n length = length//2\\n return l\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n head = 1\\n step = 1\\n remaining = n\\n left_to_right = True\\n \\n while remaining > 1:\\n # We only change the head when we're moving left-to-right\\n # or if the number of remaining elements is odd\\n if left_to_right or remaining % 2 == 1:\\n head += step\\n \\n # Update the remaining numbers and step size\\n remaining //= 2\\n step *= 2\\n left_to_right = not left_to_right # Switch direction\\n \\n return head\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n def helper(n, isLeftToRight):\\n if n == 1:\\n return 1\\n if isLeftToRight:\\n return 2 * helper(n // 2, False)\\n else:\\n if n % 2 == 1:\\n return 2 * helper(n // 2, True)\\n else:\\n return 2 * helper(n // 2, True) - 1\\n \\n return helper(n, True)\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.lastRemaining(9)) # Output: 6\\nprint(solution.lastRemaining(1)) # Output: 1\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n l = 1\\n r = n\\n length = n\\n direction = 1\\n i=0\\n while length>1:\\n if direction == 1:\\n l = l+2**i\\n if length%2 == 1:\\n r = r-2**i\\n direction = -1\\n else:\\n r = r-2**i\\n if length%2 == 1:\\n l = l+2**i\\n direction = 1\\n i+=1\\n length = length//2\\n return l\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left = 1\\n remain = n\\n step = 1\\n head = 1\\n while remain > 1:\\n if left or remain % 2:\\n head += step\\n step *= 2\\n remain //= 2\\n left ^= 1\\n return head\",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return self.differentiator_func(n, 1, 1, True)\\n\\n def differentiator_func(self, n: int, diff: int, head: int, left: bool) -> int:\\n if n == 1:\\n return head\\n \\n if left or (not left and n % 2 == 1):\\n head += diff\\n \\n diff *= 2\\n return self.differentiator_func(n // 2, diff, head, not left)\",\n \"runtime\": \"45\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 - > 2 4 6 8 10 12 14 16 18 20 22 24\\n 2 4 6 8 10 12 14 16 18 20 22 24 - > 2 6 10 14 18 22\\n 2 6 10 14 18 22 - > 6 14 22\\n 6 14 22 - > 14\\n\\n '''\\n def lastRemaining(self, n: int) -> int:\\n head = 1\\n remaining = n\\n step = 1\\n left = True\\n while remaining > 1:\\n # if we're going from left to right or from right to left with an odd number of remaining elements\\n # or from right to left with an even number of remaining elements, then we need to update the head\\n if left or remaining % 2 == 1:\\n head += step\\n left = not left\\n step += step\\n remaining //= 2\\n return head\\n\\n\\n\\n def lastRemainingBruteforce(self, n: int) -> int:\\n if n == 1:\\n return 1\\n arr = []\\n for i in range(2, n+1, 2):\\n arr.append(i)\\n start = 1\\n while len(arr) != 1:\\n tmp = []\\n if start == 0:\\n for i in range(1, len(arr), 2):\\n tmp.append(arr[i])\\n else:\\n for i in range(len(arr)-2, -1, -2):\\n tmp.append(arr[i])\\n tmp = tmp[::-1]\\n arr = tmp\\n start = start ^ 1\\n \\n return arr[0]\\n \",\n \"runtime\": \"46\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n def find(n,left_to_right):\\n if(n==1):\\n return 1\\n if(left_to_right):\\n return 2*find(n//2,False)\\n else:\\n return 2*find(n//2,True)-1+n%2\\n return find(n,True)\",\n \"runtime\": \"47\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n start=1\\n step=1\\n left=True\\n remaining=n\\n\\n while remaining>1:\\n if left or remaining%2==1:\\n start+=step\\n remaining//=2\\n step*=2\\n left=not left\\n return start\\n\",\n \"runtime\": \"48\"\n },\n {\n \"code\": \"class Solution:\\n\\n def lastRemaining(self, n: int) -> int:\\n return 1 if n==1 else 2*(n//2+1-self.lastRemaining(n//2))\\n \\n \",\n \"runtime\": \"49\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n \\\"\\\"\\\"\\n arr = [i+1 for i in range(n)]\\n pos = 1\\n while len(arr) > 1:\\n if pos > 0 or (pos < 0 and len(arr)%2 == 1):\\n newArr = [arr[i] for i in range(len(arr)) if i%2 == 1]\\n else:\\n newArr = [arr[i] for i in range(len(arr)) if i%2 == 0]\\n pos *= -1\\n arr = newArr\\n return arr[0]\\n \\\"\\\"\\\"\\n def f(k, parity):\\n if k == 1:\\n return 1\\n if parity > 0:\\n return f(k//2, parity*-1)*2\\n else:\\n if k%2 == 0:\\n return f(k//2, parity*-1)*2-1\\n else:\\n return f(k//2, parity*-1)*2\\n return f(n, 1)\\n\\n\",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n #Every round, the separation between elements doubles\\n #And the spacing between elements remains uniform\\n #Rather than going through and deleting elements from an actual list\\n #We could determine the ends of the list and the spacing of the list\\n\\n def recFind(left, right, spacing, direction = 0):\\n if left == right:\\n return left\\n else:\\n if direction == 0:\\n #Now need to figure out if the right will stay the same, or move left by one\\n if ((right-left)//spacing)%2 == 0:\\n right -= spacing\\n \\n left += spacing\\n return recFind(left, right, 2*spacing, 1)\\n\\n elif direction == 1:\\n if ((right-left)//spacing)%2 == 0:\\n left += spacing\\n \\n right -= spacing\\n\\n return recFind(left, right, 2*spacing, 0)\\n\\n return recFind(1, n, 1)\\n \",\n \"runtime\": \"50\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return 1 if n==1 else 2*(n//2+1-self.lastRemaining(n//2))\\n\\n \\n\\n \",\n \"runtime\": \"51\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return self.differentiator_func(n, 1, 1, True)\\n\\n def differentiator_func(self, n: int, diff: int, head: int, left: bool) -> int:\\n if n == 1:\\n return head\\n \\n if left or (not left and n % 2 == 1):\\n head += diff\\n \\n diff *= 2\\n return self.differentiator_func(n // 2, diff, head, not left)\",\n \"runtime\": \"52\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":36,"string":"36"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n I=1\n First=1\n B=True\n while n>1:\n if n%2==0 and B:\n First+=I\n elif n%2!=0:\n First+=I\n B=not B\n I=2*I\n n=n//2 \n return(First)\n ","memory":"16300"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n if n == 1:\n return 1\n\n return 2 * (n//2 - self.lastRemaining(n//2) + 1)\n ","memory":"16400"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return self.differentiator_func(n, 1, 1, True)\n\n def differentiator_func(self, n: int, diff: int, head: int, left: bool) -> int:\n if n == 1:\n return head\n \n if left:\n head += diff\n elif not left and n % 2 == 1:\n head += diff\n elif not left and n % 2 == 0:\n # This condition is explicitly included, but it doesn't modify head\n pass\n \n diff *= 2\n return self.differentiator_func(n // 2, diff, head, not left)","memory":"16400"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n def find(n,left_to_right):\n if(n==1):\n return 1\n if(left_to_right):\n return 2*find(n//2,False)\n else:\n return 2*find(n//2,True)-1+n%2\n return find(n,True)","memory":"16500"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n return 1 if n == 1 else 2 * (1 + n // 2 - self.lastRemaining(n // 2))","memory":"16500"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n N = n # number of remaining numbers\n fwd = True # flag for forward/backward elimination\n m = 2 # elimination step/interval\n s = 0 # elimination base\n\n while N > 1:\n if fwd or N % 2 == 1: \n s += m // 2\n m *= 2\n N = N // 2\n fwd = not fwd # reverse the pass direction\n return s+1","memory":"16600"},{"code":"class Solution:\n def lastRemaining(self, n: int) -> int:\n left_to_right = True\n head = 1\n step = 1\n remaining = n\n while remaining > 1:\n if left_to_right or remaining % 2 == 1:\n head += step\n remaining //= 2\n step *= 2\n left_to_right = not left_to_right\n return head","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n I=1\\n First=1\\n B=True\\n while n>1:\\n if n%2==0 and B:\\n First+=I\\n elif n%2!=0:\\n First+=I\\n B=not B\\n I=2*I\\n n=n//2 \\n return(First)\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n if n == 1:\\n return 1\\n\\n return 2 * (n//2 - self.lastRemaining(n//2) + 1)\\n \",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return self.differentiator_func(n, 1, 1, True)\\n\\n def differentiator_func(self, n: int, diff: int, head: int, left: bool) -> int:\\n if n == 1:\\n return head\\n \\n if left:\\n head += diff\\n elif not left and n % 2 == 1:\\n head += diff\\n elif not left and n % 2 == 0:\\n # This condition is explicitly included, but it doesn't modify head\\n pass\\n \\n diff *= 2\\n return self.differentiator_func(n // 2, diff, head, not left)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n def find(n,left_to_right):\\n if(n==1):\\n return 1\\n if(left_to_right):\\n return 2*find(n//2,False)\\n else:\\n return 2*find(n//2,True)-1+n%2\\n return find(n,True)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n return 1 if n == 1 else 2 * (1 + n // 2 - self.lastRemaining(n // 2))\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n N = n # number of remaining numbers\\n fwd = True # flag for forward/backward elimination\\n m = 2 # elimination step/interval\\n s = 0 # elimination base\\n\\n while N > 1:\\n if fwd or N % 2 == 1: \\n s += m // 2\\n m *= 2\\n N = N // 2\\n fwd = not fwd # reverse the pass direction\\n return s+1\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def lastRemaining(self, n: int) -> int:\\n left_to_right = True\\n head = 1\\n step = 1\\n remaining = n\\n while remaining > 1:\\n if left_to_right or remaining % 2 == 1:\\n head += step\\n remaining //= 2\\n step *= 2\\n left_to_right = not left_to_right\\n return head\",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":7,"string":"7"}}},{"rowIdx":293,"cells":{"question_id":{"kind":"number","value":391,"string":"391"},"name":{"kind":"string","value":"perfect-rectangle"},"content":{"kind":"string","value":"<p>Given an array <code>rectangles</code> where <code>rectangles[i] = [x<sub>i</sub>, y<sub>i</sub>, a<sub>i</sub>, b<sub>i</sub>]</code> represents an axis-aligned rectangle. The bottom-left point of the rectangle is <code>(x<sub>i</sub>, y<sub>i</sub>)</code> and the top-right point of it is <code>(a<sub>i</sub>, b<sub>i</sub>)</code>.</p>\n\n<p>Return <code>true</code> <em>if all the rectangles together form an exact cover of a rectangular region</em>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/27/perectrec1-plane.jpg\" style=\"width: 300px; height: 294px;\" />\n<pre>\n<strong>Input:</strong> rectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\n<strong>Output:</strong> true\n<strong>Explanation:</strong> All 5 rectangles together form an exact cover of a rectangular region.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/27/perfectrec2-plane.jpg\" style=\"width: 300px; height: 294px;\" />\n<pre>\n<strong>Input:</strong> rectangles = [[1,1,2,3],[1,3,2,4],[3,1,4,2],[3,2,4,4]]\n<strong>Output:</strong> false\n<strong>Explanation:</strong> Because there is a gap between the two rectangular regions.\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/27/perfecrrec4-plane.jpg\" style=\"width: 300px; height: 294px;\" />\n<pre>\n<strong>Input:</strong> rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[2,2,4,4]]\n<strong>Output:</strong> false\n<strong>Explanation:</strong> Because two of the rectangles overlap with each other.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= rectangles.length <= 2 * 10<sup>4</sup></code></li>\n\t<li><code>rectangles[i].length == 4</code></li>\n\t<li><code>-10<sup>5</sup> <= x<sub>i</sub> < a<sub>i</sub> <= 10<sup>5</sup></code></li>\n\t<li><code>-10<sup>5</sup> <= y<sub>i</sub> < b<sub>i</sub> <= 10<sup>5</sup></code></li>\n</ul>\n"},"acRate":{"kind":"number","value":34.09888899566095,"string":"34.098889"},"difficulty":{"kind":"string","value":"Hard"},"topics":{"kind":"list like","value":["array","line-sweep"],"string":"[\n \"array\",\n \"line-sweep\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"81\", 0.3115], [\"88\", 0.3115], [\"256\", 0.3115], [\"260\", 0.3115], [\"265\", 0.3115], [\"266\", 0.3115], [\"267\", 0.3115], [\"268\", 0.6231], [\"270\", 0.6231], [\"271\", 0.9346], [\"272\", 1.2461], [\"273\", 0.9346], [\"274\", 0.9346], [\"275\", 1.8692], [\"276\", 2.1807], [\"277\", 1.5576], [\"278\", 0.6231], [\"279\", 1.2461], [\"280\", 1.5576], [\"281\", 3.1153], [\"282\", 1.8692], [\"283\", 2.1807], [\"284\", 0.9346], [\"285\", 0.9346], [\"286\", 2.4922], [\"287\", 2.8037], [\"288\", 3.1153], [\"289\", 1.8692], [\"290\", 2.4922], [\"291\", 1.5576], [\"292\", 2.1807], [\"293\", 1.5576], [\"294\", 2.8037], [\"295\", 4.0498], [\"296\", 1.8692], [\"297\", 2.8037], [\"298\", 2.1807], [\"299\", 1.8692], [\"300\", 4.0498], [\"301\", 2.4922], [\"302\", 3.4268], [\"303\", 2.1807], [\"304\", 1.5576], [\"305\", 0.9346], [\"306\", 1.8692], [\"307\", 1.8692], [\"308\", 2.1807], [\"309\", 1.2461], [\"310\", 1.8692], [\"311\", 1.5576], [\"313\", 0.3115], [\"314\", 0.9346], [\"316\", 0.3115], [\"317\", 0.6231], [\"322\", 0.3115], [\"324\", 0.3115], [\"328\", 0.3115], [\"331\", 0.3115], [\"353\", 0.3115], [\"355\", 0.3115], [\"357\", 0.3115], [\"364\", 0.3115], [\"375\", 0.3115], [\"394\", 0.3115], [\"772\", 0.3115], [\"1345\", 0.3115], [\"1431\", 0.3115], [\"1486\", 0.3115], [\"1569\", 0.3115], [\"1743\", 0.3115], [\"1831\", 0.3115], [\"1868\", 0.3115], [\"2381\", 0.3115], [\"2393\", 0.3115], [\"2427\", 0.3115], [\"2460\", 0.3115], [\"2784\", 0.3115], [\"3054\", 0.3115], [\"3123\", 0.3115], [\"3132\", 0.3115]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"20100\", 0.3115], [\"20200\", 0.3115], [\"21500\", 0.6231], [\"21700\", 0.3115], [\"21800\", 0.6231], [\"21900\", 0.9346], [\"22000\", 0.9346], [\"22100\", 2.4922], [\"22200\", 25.5452], [\"22300\", 33.6449], [\"22400\", 6.8536], [\"22500\", 0.3115], [\"22600\", 0.9346], [\"22900\", 0.3115], [\"23300\", 0.3115], [\"23700\", 0.6231], [\"23900\", 0.9346], [\"24000\", 0.3115], [\"24100\", 0.3115], [\"24200\", 0.3115], [\"24400\", 0.6231], [\"24500\", 3.4268], [\"24600\", 4.9844], [\"24700\", 1.8692], [\"24800\", 3.1153], [\"24900\", 1.8692], [\"25100\", 0.3115], [\"25200\", 0.3115], [\"25300\", 0.6231], [\"25400\", 0.3115], [\"26600\", 0.3115]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\n area = 0\n corners = set()\n\n for x, y, a, b in rectangles:\n left = min(left, x)\n bot = min(bot, y)\n right = max(right, a)\n top = max(top, b)\n\n area += (a - x) * (b - y)\n\n corners ^= {(x,y), (x,b), (a,y), (a,b)}\n\n expected_area = (right - left) * (top - bot)\n\n if area != expected_area or len(corners) != 4:\n return \"false\"\n\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\n return \"false\"\n\n return \"true\"\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().isRectangleCover(nums)).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"81"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\n area = 0\n corners = set()\n def checkCorner(corner):\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n for x, y, a, b in rectangles:\n left = min(left, x)\n bot = min(bot, y)\n right = max(right, a)\n top = max(top, b)\n\n area += (a - x) * (b - y)\n\n checkCorner((x, y))\n checkCorner((x, b))\n checkCorner((a, y))\n checkCorner((a, b))\n\n expected_area = (right - left) * (top - bot)\n\n if area != expected_area or len(corners) != 4:\n return \"false\"\n\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\n return \"false\"\n\n return \"true\"\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().isRectangleCover(nums)).replace(\" \", \"\"), file=f)\nexit(0)","runtime":"88"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n area = 0\n corners = set()\n a, c = lambda: (X - x) * (Y - y), lambda: {(x, y), (x, Y), (X, y), (X, Y)}\n for x, y, X, Y in rectangles:\n area += a()\n corners ^= c()\n x, y, X, Y = (f(z) for f, z in zip((min, min, max, max), zip(*rectangles)))\n return area == a() and corners == c()","runtime":"256"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n# the external corners must appear only once, and the ones inside have to be an even number (we filter them with xor).\n# the total area of all the rectangles together, has to be equal to the area created by the external corners\n\n corners = set()\n\n def getArea(x,y,a,b):\n return abs(a-x)*abs(b-y)\n \n totalArea = 0\n\n for x,y,a,b in rectangles:\n corners ^= {(x,y), (a,b), (x,b), (a,y)}\n totalArea += getArea(x,y,a,b)\n \n if len(corners) != 4:\n return False\n\n if getArea(*sorted(corners)[0], *sorted(corners)[3]) != totalArea:\n return False\n\n return True\n","runtime":"260"},{"code":"from typing import List\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n corners = set()\n area = 0\n for x1, y1, x2, y2 in rectangles:\n area += (x2 - x1) * (y2 - y1)\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\n if len(corners) != 4:\n return False\n x1, y1 = min(corners, key=lambda x: x[0] + x[1])\n x2, y2 = max(corners, key=lambda x: x[0] + x[1])\n return area == (x2 - x1) * (y2 - y1)","runtime":"265"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n corners = set()\n for x1, y1, x2, y2 in rectangles:\n area += (x2 - x1) * (y2 - y1)\n for corner in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n if len(corners) != 4:\n return False\n x1, y1 = float(\"inf\"), float(\"inf\")\n x2, y2 = float(\"-inf\"), float(\"-inf\")\n for x, y in corners:\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, x)\n y2 = max(y2, y)\n union_area = (x2 - x1) * (y2 - y1)\n if area != union_area:\n return False\n return area == (x2 - x1) * (y2 - y1)","runtime":"266"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n corners = set()\n a = lambda: (Y-y) * (X-x)\n\n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\n\n if len(corners) != 4: return False\n\n x, y = min(corners, key=lambda x: x[0] + x[1])\n X, Y = max(corners, key=lambda x: x[0] + x[1])\n\n return a() == area\n\n\n ","runtime":"267"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n corners = set()\n a = lambda: (Y-y) * (X-x)\n \n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\n\n if len(corners) != 4: return False\n x, y = min(corners, key=lambda x: x[0] + x[1])\n X, Y = max(corners, key=lambda x: x[0] + x[1])\n return a() == area","runtime":"271"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n corners = set()\n bottom = float('inf')\n top = -float('inf')\n right = -float('inf')\n left = float('inf')\n for x,y,a,b in rectangles:\n area += (a-x)*(b-y)\n for corner in (x,y),(x,b),(a,y),(a,b):\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n for x,y in corners:\n bottom = min(bottom,y)\n top = max(top,y)\n left = min(left,x)\n right = max(right,x)\n return area == (top-bottom)*(right-left) and len(corners) == 4\n ","runtime":"271"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n corners = set()\n a = lambda: (Y-y) * (X-x)\n \n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\n\n if len(corners) != 4: return False\n x, y = min(corners, key=lambda x: x[0] + x[1])\n X, Y = max(corners, key=lambda x: x[0] + x[1])\n return a() == area","runtime":"272"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Define a function to calculate the area of a rectangle\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Calculate the total area of all rectangles\n total_area = sum(area(rect) for rect in rectangles)\n \n # Find the bounding rectangle\n x1, y1 = min(rect[0] for rect in rectangles), min(rect[1] for rect in rectangles)\n x2, y2 = max(rect[2] for rect in rectangles), max(rect[3] for rect in rectangles)\n \n # Calculate the area of the bounding rectangle\n bounding_area = (x2 - x1) * (y2 - y1)\n \n # If the areas are not equal, return False\n if total_area != bounding_area:\n return False\n \n # Use a set to store the corners of the rectangles\n corners = set()\n \n # Iterate through each rectangle\n for rect in rectangles:\n # Define the corners of the current rectangle\n corners_rect = [(rect[0], rect[1]), (rect[2], rect[3]), (rect[0], rect[3]), (rect[2], rect[1])]\n \n # Update the set of corners\n for corner in corners_rect:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n # If the number of corners is not 4, return False\n if len(corners) != 4:\n return False\n \n # Check if the remaining corners are the corners of the bounding rectangle\n if (x1, y1) not in corners or (x2, y1) not in corners or (x1, y2) not in corners or (x2, y2) not in corners:\n return False\n \n # If all conditions are met, return True\n return True\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"273"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n area = 0\n corners = set()\n a, c = lambda: (X-x) * (Y-y), lambda: (x, y, X, Y)\n \n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x, y), (x, Y), (X, y), (X, Y)}\n \n if len(corners) != 4:\n return False\n \n x, y = min(corners, key=lambda c: c[0] + c[1])\n X, Y = max(corners, key=lambda c: c[0] + c[1])\n \n return area == a() and corners == {(x, y), (x, Y), (X, y), (X, Y)}","runtime":"274"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n border_points = set()\n for x, y, u, v in rectangles:\n area += (u - x) * (v - y)\n border_points ^= {(x, y), (x, v), (u, y), (u, v)}\n if len(border_points) != 4:\n return False\n x, y, u, v = (\n min(x for x, _ in border_points),\n min(y for _, y in border_points),\n max(x for x, _ in border_points),\n max(y for _, y in border_points)\n )\n return area == (u - x) * (v - y)","runtime":"275"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n corners = set()\n x_min, y_min, x_max, y_max = rectangles[-1]\n sum_area = 0\n for x, y, a, b in rectangles:\n if x < x_min:\n x_min = x\n if y < y_min:\n y_min = y\n if a > x_max:\n x_max = a\n if b > y_max:\n y_max = b\n sum_area += (a - x) * (b - y)\n for c in ((x, y), (x, b), (a, y), (a, b)):\n if c in corners:\n corners.remove(c)\n else:\n corners.add(c)\n return len(corners) == 4 and (x_max - x_min) * (y_max - y_min) == sum_area and x_min == min((q[0] for q in corners)) and x_max == max((q[0] for q in corners)) and y_min == min((q[1] for q in corners)) and y_max == max((q[1] for q in corners))","runtime":"276"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n area = 0\n corners = set()\n a, c = lambda: (X-x) * (Y-y), lambda: (x, y, X, Y)\n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x, y), (x, Y), (X, y), (X, Y)}\n if len(corners) != 4: return False\n x, y = min(corners, key=lambda c: c[0] + c[1])\n X, Y = max(corners, key=lambda c: c[0] + c[1])\n return area == a() and corners == {(x, y), (x, Y), (X, y), (X, Y)}","runtime":"277"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area=0\n corners=set()\n a=lambda:(Y-y)*(X-x)\n c=lambda k:k[0]+k[1]\n\n for x,y,X,Y in rectangles:\n area+=a()\n corners^={(x,Y),(X,y),(x,y),(X,Y)}\n \n if len(corners)!=4:\n return False\n \n x,y = min(corners,key=c)\n X,Y = max(corners,key=c)\n\n return area==a()","runtime":"278"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n area = 0\n corners = set()\n a, c, b, d = float('inf'), float('inf'), float('-inf'), float('-inf')\n \n for x, y, x2, y2 in rectangles:\n a, c = min(a, x), min(c, y)\n b, d = max(b, x2), max(d, y2)\n area += (x2 - x) * (y2 - y)\n corners ^= {(x, y), (x, y2), (x2, y), (x2, y2)}\n \n if corners != {(a, c), (a, d), (b, c), (b, d)}:\n return False\n \n return area == (b - a) * (d - c)","runtime":"279"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Helper function to get the area of a rectangle\n def getArea(rect):\n x1, y1, x2, y2 = rect\n return (x2 - x1) * (y2 - y1)\n \n # Initialize variables to track the bounding box and corner points\n area = 0\n corners = set()\n \n # Iterate through each rectangle\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n \n # Add the area of the current rectangle to the total area\n area += getArea(rect)\n \n # Define the corners of the current rectangle\n corners_rect = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n \n # Update the corner points set\n for corner in corners_rect:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n # If the number of remaining corners is not 4, return False\n if len(corners) != 4:\n return False\n \n # Calculate the bounding box of the union of all rectangles\n x1, y1 = min(corners, key=lambda x: x[0])[0], min(corners, key=lambda x: x[1])[1]\n x2, y2 = max(corners, key=lambda x: x[0])[0], max(corners, key=lambda x: x[1])[1]\n \n # Check if the area of the bounding box is equal to the total area of the rectangles\n return area == getArea([x1, y1, x2, y2])\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"280"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n area = 0\n corners = set()\n a = lambda: (Y-y) * (X-x)\n \n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\n\n if len(corners) != 4: return False\n x, y = min(corners, key=lambda x: x[0] + x[1])\n X, Y = max(corners, key=lambda x: x[0] + x[1])\n return a() == area","runtime":"281"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\n area = 0\n x1 = math.inf\n y1 = math.inf\n x2 = -math.inf\n y2 = -math.inf\n corners: set[tuple[int, int]] = set()\n\n for x, y, a, b in rectangles:\n area += (a - x) * (b - y)\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, a)\n y2 = max(y2, b)\n\n # the four points of the current rectangle\n for point in [(x, y), (x, b), (a, y), (a, b)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n if len(corners) != 4:\n return False\n if ((x1, y1) not in corners or\n (x1, y2) not in corners or\n (x2, y1) not in corners or\n (x2, y2) not in corners):\n return False\n return area == (x2 - x1) * (y2 - y1)","runtime":"282"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\n area = 0\n x1 = math.inf\n y1 = math.inf\n x2 = -math.inf\n y2 = -math.inf\n corners: set[tuple[int, int]] = set()\n\n for x, y, a, b in rectangles:\n area += (a - x) * (b - y)\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, a)\n y2 = max(y2, b)\n\n # the four points of the current rectangle\n for point in [(x, y), (x, b), (a, y), (a, b)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n if len(corners) != 4:\n return False\n if ((x1, y1) not in corners or\n (x1, y2) not in corners or\n (x2, y1) not in corners or\n (x2, y2) not in corners):\n return False\n return area == (x2 - x1) * (y2 - y1)","runtime":"283"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\n area = 0\n x1 = math.inf\n y1 = math.inf\n x2 = -math.inf\n y2 = -math.inf\n corners: set[tuple[int, int]] = set()\n\n for x, y, a, b in rectangles:\n area += (a - x) * (b - y)\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, a)\n y2 = max(y2, b)\n\n # the four points of the current rectangle\n for point in [(x, y), (x, b), (a, y), (a, b)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n if len(corners) != 4:\n return False\n if ((x1, y1) not in corners or\n (x1, y2) not in corners or\n (x2, y1) not in corners or\n (x2, y2) not in corners):\n return False\n return area == (x2 - x1) * (y2 - y1)","runtime":"284"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n total_area = 0\n corners = set()\n\n for x1, y1, x2, y2 in rectangles:\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n \n total_area += (x2 - x1) * (y2 - y1)\n \n for corner in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n if len(corners) != 4 or (min_x, min_y) not in corners or (min_x, max_y) not in corners or (max_x, min_y) not in corners or (max_x, max_y) not in corners:\n return False\n \n return total_area == (max_x - min_x) * (max_y - min_y)\n\n# Time O(n)\n# Space O(n)","runtime":"285"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n point_set: Set[tuple] = set()\n total_area: int = 0\n for x, y, a, b in rectangles:\n point_set ^= {(x, y), (x, b), (a, y), (a, b)}\n total_area += (x - a) * (y - b)\n\n if len(point_set) != 4:\n return False\n x_values = list(set([i for i, _ in point_set]))\n y_values = list(set([j for _, j in point_set]))\n area = abs(x_values[0] - x_values[1]) * abs(y_values[0] - y_values[1])\n\n return area == total_area\n \n \n\n ","runtime":"286"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n events = []\n for x, y, a, b in rectangles:\n events.append((x, 1, y, b))\n events.append((a, 0, y, b))\n n = len(events)\n events.sort()\n xStart, xEnd = events[0][0], events[-1][0]\n i = 0\n xPrev, stackPrev = -1, []\n while i < n:\n xVal, etypeVal, _, _ = events[i]\n stack = []\n while i < n:\n x, etype, y0, y1 = events[i]\n if x != xVal or etype != etypeVal:\n break\n if stack and stack[-1][1] == y0:\n y0 = stack.pop()[0]\n stack.append((y0, y1))\n i += 1\n if etypeVal == 1:\n if xVal == xStart:\n if len(stack) != 1:\n return False\n elif xVal != xPrev or stack != stackPrev:\n return False\n else:\n xPrev, stackPrev = xVal, stack\n return True\n","runtime":"287"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n area = 0\n corners = set()\n a = lambda: (Y-y) * (X-x)\n \n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\n\n if len(corners) != 4: return False\n x, y = min(corners, key=lambda x: x[0] + x[1])\n X, Y = max(corners, key=lambda x: x[0] + x[1])\n return a() == area","runtime":"288"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # simple problem\n # Check if area of each adds up to the final one\n # If not no solution but if it does then you need to make sure the number of corners are 4 only.\n # If the corners are more than that that means some corners do not match with other ones to fit end to end\n area = 0\n corners = set()\n a = lambda: (Y - y) * (X - x)\n c = lambda k: k[0] + k[1]\n \n for x, y, X, Y in rectangles:\n area += a()\n corners ^= {(x, Y), (X, y), (x, y), (X, Y)}\n \n if len(corners) != 4:\n return False\n x, y = min(corners, key = c)\n X, Y = max(corners, key = c)\n return area == a()","runtime":"289"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n corners = set()\n total_area = 0\n min_x1, min_y1 = float('inf'), float('inf')\n max_x2, max_y2 = float('-inf'), float('-inf')\n \n for x1, y1, x2, y2 in rectangles:\n # Update bounding box\n min_x1, min_y1 = min(min_x1, x1), min(min_y1, y1)\n max_x2, max_y2 = max(max_x2, x2), max(max_y2, y2)\n \n # Calculate total area\n total_area += (x2 - x1) * (y2 - y1)\n \n # Track corners\n for corner in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n # Check that only the four bounding box corners are left\n if corners != {(min_x1, min_y1), (min_x1, max_y2), (max_x2, min_y1), (max_x2, max_y2)}:\n return False\n \n # Check if total area matches bounding box area\n return total_area == (max_x2 - min_x1) * (max_y2 - min_y1)\n ","runtime":"290"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n corners = set()\n for x, y, X, Y in rectangles:\n area += (X-x)*(Y-y)\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\n if len(corners) != 4: return False\n x, y = min(corners, key=lambda x: x[0] + x[1])\n X, Y = max(corners, key=lambda x: x[0] + x[1])\n return (X-x)*(Y-y) == area","runtime":"291"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n if not rectangles or not rectangles[0]:\n return False\n\n x1, y1 = float('inf'), float('inf')\n x2 = float('-inf')\n y2 = float('-inf')\n\n points = set()\n area = 0\n\n for rect in rectangles:\n x1 = min(rect[0], x1)\n y1 = min(rect[1], y1)\n x2 = max(rect[2], x2)\n y2 = max(rect[3], y2)\n\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\n\n p1 = (rect[0], rect[1])\n p2 = (rect[0], rect[3])\n p3 = (rect[2], rect[3])\n p4 = (rect[2], rect[1])\n\n for point in [p1, p2, p3, p4]:\n if point in points:\n points.remove(point)\n else:\n points.add(point)\n\n expected_area = (x2 - x1) * (y2 - y1)\n\n if (x1, y1) not in points or (x1, y2) not in points or (x2, y1) not in points or (x2, y2) not in points or len(\n points) != 4:\n return False\n\n return area == expected_area","runtime":"292"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Helper function to calculate the area of a rectangle\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Initialize variables to track the bounding rectangle and corner points\n corners = set()\n area_sum = 0\n min_x, min_y, max_x, max_y = float('inf'), float('inf'), float('-inf'), float('-inf')\n \n # Iterate through each rectangle\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n \n area_sum += area(rect)\n \n # Update corner points\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\n \n # Check if the number of corners is 4 and they form the bounding rectangle\n if len(corners) != 4 or corners != {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}:\n return False\n \n # Check if the sum of areas is equal to the area of the bounding rectangle\n bounding_area = (max_x - min_x) * (max_y - min_y)\n return area_sum == bounding_area\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"293"},{"code":"class Solution(object):\n def isRectangleCover(self, rectangles):\n \"\"\"\n :type rectangles: List[List[int]]\n :rtype: bool\n \"\"\"\n hs = set()\n area = 0\n for rec in rectangles:\n top_left = (rec[0], rec[1])\n top_right = (rec[0], rec[3])\n bottom_left = (rec[2], rec[1])\n bottom_right = (rec[2], rec[3])\n area += (rec[2] - rec[0]) * (rec[3] - rec[1])\n for i in [top_left, top_right, bottom_left, bottom_right]:\n if i not in hs:\n hs.add(i)\n else:\n hs.remove(i)\n if len(hs) != 4:\n return False\n hs = sorted(hs)\n first = hs.pop(0)\n last = hs.pop()\n return area == (last[0] - first[0]) * (last[1] - first[1])","runtime":"294"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # bottom left corner\n x1 = float('inf')\n y1 = float('inf')\n # top right corner\n x2 = float('-inf')\n y2 = float('-inf')\n\n area = 0\n\n corners = set()\n\n for rect in rectangles:\n x1 = min(rect[0], x1)\n y1 = min(rect[1], y1)\n x2 = max(rect[2], x2)\n y2 = max(rect[3], y2)\n\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\n\n # add all corners\n # pottom left\n if (rect[0], rect[1]) in corners:\n corners.remove((rect[0], rect[1]))\n else:\n corners.add((rect[0], rect[1]))\n # top left\n if (rect[0], rect[3]) in corners:\n corners.remove((rect[0], rect[3]))\n else:\n corners.add((rect[0], rect[3]))\n # top right\n if (rect[2], rect[3]) in corners:\n corners.remove((rect[2], rect[3]))\n else:\n corners.add((rect[2], rect[3]))\n # bottom right\n if (rect[2], rect[1]) in corners:\n corners.remove((rect[2], rect[1]))\n else:\n corners.add((rect[2], rect[1]))\n\n # check that rectangle corners are all in small rectanglse\n if ((x1, y1) not in corners \n or (x1, y2) not in corners\n or (x2, y1) not in corners\n or (x2, y2) not in corners\n or len(corners) != 4\n ):\n return False\n\n return int(area) == int((x2-x1) * (y2 - y1))\n\n","runtime":"295"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n def add_point(point, points):\n if point in points:\n points.remove(point)\n else:\n points.add(point)\n \n area = 0\n points = set()\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n \n for x1, y1, x2, y2 in rectangles:\n area += (x2 - x1) * (y2 - y1)\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n \n add_point((x1, y1), points)\n add_point((x1, y2), points)\n add_point((x2, y1), points)\n add_point((x2, y2), points)\n\n if (min_x, min_y) not in points or (min_x, max_y) not in points or (max_x, min_y) not in points or (max_x, max_y) not in points or len(points) != 4:\n return False\n \n return area == (max_x - min_x) * (max_y - min_y)\n\n ","runtime":"296"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True\n ","runtime":"297"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n mapp = defaultdict(int)\n edges = []\n \n for x1,y1,x2,y2 in rectangles:\n # 1: (x1, y1)\n # 10: (x1, y2)\n # 100: (x2,y2)\n # 1000: (x2,y1)\n p1 = mapp[(x1,y1)]\n p2 = mapp[(x1, y2)]\n p3 = mapp[(x2,y2)]\n p4 = mapp[(x2,y1)]\n m1 = 1\n m2 = 1<<1\n m3 = 1<<2\n m4 = 1<<3\n if p1 & m1 != 0 or p2 & m2 != 0 or p3 & m3 != 0 or p4 & m4 != 0:\n return False\n else:\n mapp[(x1,y1)] |= m1\n mapp[(x1,y2)] |= m2\n mapp[(x2,y2)] |= m3\n mapp[(x2,y1)] |= m4\n\n for k in mapp:\n if mapp[k] in (8,4,2,1):\n if len(edges) > 3:\n return False\n edges.append(k)\n elif mapp[k] in (3,6,9,12,15):\n continue\n else:\n return False\n \n if len(edges) != 4:\n return False\n \n return True\n\n \n\n\n\n\n\n\n\n ","runtime":"297"},{"code":"from collections import Counter\n\nclass Solution:\n def isRectangleCover(self, rectangles):\n # Helper function to get the area of a rectangle\n def get_area(rect):\n x1, y1, x2, y2 = rect\n return (x2 - x1) * (y2 - y1)\n\n # Initialize variables to track the bounding rectangle and corner points\n corners = set()\n area = 0\n min_x, min_y = float('inf'), float('inf')\n max_x, max_y = float('-inf'), float('-inf')\n\n # Iterate through each rectangle\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n\n # Update the bounding rectangle\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n\n # Update the total area\n area += get_area(rect)\n\n # Update the corner points\n for point in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n # Check if the remaining corners are exactly 4 and match the outermost corners\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\n if corners != expected_corners:\n return False\n\n # Check if the total area matches the area of the bounding rectangle\n bounding_area = (max_x - min_x) * (max_y - min_y)\n return area == bounding_area\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"298"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n if not rectangles or not rectangles[0]:\n return False\n\n # The bottom left corner.\n min_x, min_y = float('inf'), float('inf')\n # The upper right corner.\n max_x, max_y = float('-inf'), float('-inf')\n\n points = set()\n area = 0\n\n for rect in rectangles:\n x1, y1, x2, y2 = rect[0], rect[1], rect[2], rect[3]\n min_x = min(x1, min_x)\n min_y = min(y1, min_y)\n max_x = max(x2, max_x)\n max_y = max(y2, max_y)\n\n area += (x2 - x1) * (y2 - y1)\n\n # Four corners of this rectangle.\n p1 = (x1, y1)\n p2 = (x1, y2)\n p3 = (x2, y2)\n p4 = (x2, y1)\n\n for point in [p1, p2, p3, p4]:\n if point in points:\n points.remove(point)\n else:\n points.add(point)\n\n expected_area = (max_x - min_x) * (max_y - min_y)\n\n # The count of all the four corner points should be one.\n if (min_x, min_y) not in points or (min_x, max_y) not in points or (max_x, min_y) not in points or (max_x, max_y) not in points:\n return False\n\n # All the other points should occur even times.\n if len(points) != 4:\n return False\n return area == expected_area","runtime":"299"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # Variables to store the bounding rectangle's corners and area\n min_x = float('inf')\n min_y = float('inf')\n max_x = float('-inf')\n max_y = float('-inf')\n area = 0\n points = set()\n\n # Helper function to manage the corners in the set\n def add_point(point):\n if point in points:\n points.remove(point)\n else:\n points.add(point)\n\n # Iterate through all rectangles\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n # Calculate the bounding box of all rectangles\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n\n # Calculate the area of the current rectangle\n area += (x2 - x1) * (y2 - y1)\n\n # Add or remove the four corners of the current rectangle\n add_point((x1, y1))\n add_point((x1, y2))\n add_point((x2, y1))\n add_point((x2, y2))\n\n # The area of the bounding rectangle\n bounding_area = (max_x - min_x) * (max_y - min_y)\n\n # Check if the total area matches the bounding rectangle's area\n if area != bounding_area:\n return False\n\n # At the end, there should be exactly four points: the corners of the bounding rectangle\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\n return points == expected_corners","runtime":"300"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # Helper function to calculate area of a rectangle\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Initialize corners of the bounding rectangle\n min_x, min_y = float('inf'), float('inf')\n max_x, max_y = float('-inf'), float('-inf')\n \n # Set to store all corner points\n corners = set()\n \n # Total area of all smaller rectangles\n total_area = 0\n \n for rect in rectangles:\n x1, y1, x2, y2 = rect\n \n # Update bounding rectangle corners\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n \n # Add corners to the set\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\n \n # Add area of current rectangle to total area\n total_area += area(rect)\n \n # Check if only 4 corners are left and they are the corners of the bounding rectangle\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\n if corners != expected_corners:\n return False\n \n # Check if the total area matches the area of the bounding rectangle\n bounding_area = area([min_x, min_y, max_x, max_y])\n return total_area == bounding_area\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"301"},{"code":"class Solution:\n def __pointsCheck(self, x1: int, y1: int, x2: int, y2: int, points: set[tuple[int, int]]) -> bool:\n return (x1, y1) in points and (x1, y2) in points and (x2, y1) in points and (x2, y2) in points\n\n def __updatePoints(self, coordinate: tuple[int, int], points: set[tuple[int, int]]) -> None:\n points ^= {coordinate}\n\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n points: set[tuple[int, int]] = set()\n x1, x2 = float(\"inf\"), float(\"-inf\")\n y1, y2 = float(\"inf\"), float(\"-inf\")\n area: int = 0\n\n for coordinates in rectangles:\n X1, Y1, X2, Y2 = coordinates\n\n x1, x2 = min(X1, x1), max(X2, x2)\n y1, y2 = min(Y1, y1), max(Y2, y2)\n\n area += (Y2 - Y1) * (X2 - X1)\n \n self.__updatePoints((X1, Y1), points)\n self.__updatePoints((X1, Y2), points)\n self.__updatePoints((X2, Y1), points)\n self.__updatePoints((X2, Y2), points)\n \n return area==(y2 - y1)*(x2 - x1) and len(points)==4 and self.__pointsCheck(x1, y1, x2, y2, points)","runtime":"301"},{"code":"class Solution: \n def isRectangleCover(self, rectangles: List[List[int]]) -> bool: \n # Use a dictionary to count corners \n corner_count = {} \n\n def add_corner(x, y): \n if (x, y) in corner_count: \n corner_count[(x, y)] += 1 \n else: \n corner_count[(x, y)] = 1 \n\n def remove_corner(x, y): \n if (x, y) in corner_count: \n corner_count[(x, y)] -= 1 \n if corner_count[(x, y)] == 0: \n del corner_count[(x, y)] \n\n # Variables to determine the bounding box of all rectangles \n min_x = float('inf') \n min_y = float('inf') \n max_x = float('-inf') \n max_y = float('-inf') \n total_area = 0 \n\n for x1, y1, x2, y2 in rectangles: \n min_x = min(min_x, x1) \n min_y = min(min_y, y1) \n max_x = max(max_x, x2) \n max_y = max(max_y, y2) \n total_area += (x2 - x1) * (y2 - y1) \n add_corner(x1, y1) \n add_corner(x1, y2) \n add_corner(x2, y1) \n add_corner(x2, y2) \n\n if total_area != (max_x - min_x) * (max_y - min_y): \n return False \n\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)} \n\n for corner in expected_corners: \n if corner not in corner_count or corner_count[corner] != 1: \n return False \n del corner_count[corner] \n\n for count in corner_count.values(): \n if count % 2 != 0: \n return False \n\n return True","runtime":"302"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\n point2=[-100000,-100000]\n point1=[100000,100000]\n s = set()\n total = 0\n for i in range(len(rectangles)):\n point1 = [min(point1[0],rectangles[i][0]),min(point1[1],rectangles[i][1])]\n point2 = [max(point2[0],rectangles[i][2]),max(point2[1],rectangles[i][3])]\n for j in [(rectangles[i][0],rectangles[i][1]),(rectangles[i][0],rectangles[i][3]),(rectangles[i][2],rectangles[i][1]),(rectangles[i][2],rectangles[i][3])]:\n s ^= {j}\n total += (rectangles[i][2]-rectangles[i][0]) * (rectangles[i][3] - rectangles[i][1])\n if len(s) == 4 and (point1[0],point1[1]) in s and (point2[0],point2[1]) in s and (point1[0],point2[1]) in s and (point2[0],point1[1]) in s and total == (point2[0] - point1[0])*(point2[1] - point1[1]):\n return True\n return False\n","runtime":"303"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Define a set to store all the corner points\n corners = set()\n \n # Initialize the area and coordinates of the bounding rectangle\n area = 0\n x1 = float('inf')\n y1 = float('inf')\n x2 = float('-inf')\n y2 = float('-inf')\n \n # Iterate through each rectangle\n for rect in rectangles:\n x1 = min(x1, rect[0])\n y1 = min(y1, rect[1])\n x2 = max(x2, rect[2])\n y2 = max(y2, rect[3])\n \n # Calculate the area of the current rectangle\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Define the corner points of the current rectangle\n corners_rect = [(rect[0], rect[1]), (rect[2], rect[3]), (rect[0], rect[3]), (rect[2], rect[1])]\n \n # Update the set of corners\n for corner in corners_rect:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n # Check if the remaining corners are exactly 4 and they form the bounding rectangle\n if len(corners) != 4 or corners != {(x1, y1), (x2, y2), (x1, y2), (x2, y1)}:\n return False\n \n # Check if the total area matches the area of the bounding rectangle\n return area == (x2 - x1) * (y2 - y1)\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"304"},{"code":"class Solution:\n def __pointsCheck(self, x1: int, y1: int, x2: int, y2: int, points: set[tuple[int, int]]) -> bool:\n return (x1, y1) in points and (x1, y2) in points and (x2, y1) in points and (x2, y2) in points\n\n def __updatePoints(self, coordinate: tuple[int, int], points: set[tuple[int, int]]) -> None:\n if coordinate in points:\n points.remove(coordinate)\n else: points.add(coordinate)\n\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n points: set[tuple[int, int]] = set()\n x1, x2 = float(\"inf\"), float(\"-inf\")\n y1, y2 = float(\"inf\"), float(\"-inf\")\n area: int = 0\n\n for coordinates in rectangles:\n X1, Y1, X2, Y2 = coordinates\n\n x1, x2 = min(X1, x1), max(X2, x2)\n y1, y2 = min(Y1, y1), max(Y2, y2)\n\n area += (Y2 - Y1) * (X2 - X1)\n \n self.__updatePoints((X1, Y1), points)\n self.__updatePoints((X1, Y2), points)\n self.__updatePoints((X2, Y1), points)\n self.__updatePoints((X2, Y2), points)\n \n return area==(y2 - y1)*(x2 - x1) and len(points)==4 and self.__pointsCheck(x1, y1, x2, y2, points)","runtime":"304"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n \n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True","runtime":"305"},{"code":"from collections import defaultdict\n\nclass Solution:\n def isRectangleCover(self, rectangles):\n # Define a function to calculate the area of a rectangle\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Initialize variables to track the smallest and largest coordinates\n min_x, min_y = float('inf'), float('inf')\n max_x, max_y = float('-inf'), float('-inf')\n \n # Initialize a dictionary to count the degrees of each vertex\n vertex_degrees = defaultdict(int)\n \n # Calculate the total area of all rectangles\n total_area = 0\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n \n # Update the bounding rectangle coordinates\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n \n # Add the area of the current rectangle to the total area\n total_area += area(rect)\n \n # Update the degrees of the vertices\n vertices = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for vertex in vertices:\n vertex_degrees[vertex] += 1\n \n # Calculate the area of the bounding rectangle\n bounding_area = (max_x - min_x) * (max_y - min_y)\n \n # Check if the total area matches the bounding rectangle area\n if total_area != bounding_area:\n return False\n \n # Check the number of vertices with odd degrees\n corners = 0\n for vertex, degree in vertex_degrees.items():\n if degree % 2 == 1:\n corners += 1\n \n # There should be exactly 4 vertices with odd degrees\n if corners != 4:\n return False\n \n # Check if these 4 vertices are the outer corners of the bounding rectangle\n outer_corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\n for corner in outer_corners:\n if vertex_degrees[corner] != 1:\n return False\n \n # All conditions are satisfied\n return True\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"306"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n from collections import defaultdict\n\n corners = defaultdict(int)\n area = 0\n \n for x1, y1, x2, y2 in rectangles:\n # Compute area of each rectangle and add it to the total area\n area += (x2 - x1) * (y2 - y1)\n \n # Track the corners of the rectangles\n corners[(x1, y1)] ^= 1\n corners[(x1, y2)] ^= 1\n corners[(x2, y1)] ^= 1\n corners[(x2, y2)] ^= 1\n\n # Find the bounding rectangle coordinates\n min_x = min(rectangles, key=lambda r: r[0])[0]\n min_y = min(rectangles, key=lambda r: r[1])[1]\n max_x = max(rectangles, key=lambda r: r[2])[2]\n max_y = max(rectangles, key=lambda r: r[3])[3]\n\n # Calculate the area of the bounding rectangle\n bounding_area = (max_x - min_x) * (max_y - min_y)\n \n # Check the corners\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\n \n actual_corners = {k for k, v in corners.items() if v % 2 == 1}\n \n return area == bounding_area and expected_corners == actual_corners\n","runtime":"307"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n \n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True","runtime":"308"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n min_x, min_y, max_x, max_y = rectangles[0]\n total_area = 0\n s = set()\n for rect in rectangles:\n min_x = min(rect[0], min_x)\n min_y = min(rect[1], min_y)\n max_x = max(rect[2], max_x)\n max_y = max(rect[3], max_y)\n total_area += (rect[2] - rect[0]) * (rect[3] - rect[1])\n\n for i, j in itertools.product([rect[0], rect[2]], [rect[1], rect[3]]):\n s ^= {(i,j)}\n expected_area = (max_x - min_x) * (max_y - min_y)\n expected_s = set([(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)])\n return total_area == expected_area and expected_s == s","runtime":"308"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Helper function to calculate area\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Calculate the total area of all rectangles\n total_area = sum(area(rect) for rect in rectangles)\n \n # Find the bounding rectangle\n min_x = min(rect[0] for rect in rectangles)\n min_y = min(rect[1] for rect in rectangles)\n max_x = max(rect[2] for rect in rectangles)\n max_y = max(rect[3] for rect in rectangles)\n \n bounding_area = (max_x - min_x) * (max_y - min_y)\n \n # If the total area is not equal to the bounding rectangle area, return False\n if total_area != bounding_area:\n return False\n \n # Count the occurrences of each corner point\n from collections import defaultdict\n point_count = defaultdict(int)\n \n for rect in rectangles:\n x1, y1, x2, y2 = rect\n corners = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for corner in corners:\n point_count[corner] += 1\n \n # Check if the corner points of the bounding rectangle appear exactly once\n # and all other points appear exactly twice or four times\n expected_corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\n for point, count in point_count.items():\n if point in expected_corners:\n if count != 1:\n return False\n else:\n if count not in [2, 4]:\n return False\n \n return True\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"309"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # Find the leftmost and bottommost pair = A\n # Find the rightmost and topmost pair = B\n # Create a visited set and attempt to add all the points in each rectangle\n # If any overlap, return False\n # At the end, if the size of the visited set is not == area of \n # rectangle created by A, B, return False\n \n bottomLeft, topRight = [float('inf'), float('inf')], [float('-inf'), float('-inf')]\n for (x, y, a, b) in rectangles:\n bottomLeft[0] = min(bottomLeft[0], x)\n bottomLeft[1] = min(bottomLeft[1], y)\n topRight[0] = min(topRight[0], a)\n topRight[1] = min(topRight[1], b)\n \n corners = set()\n cornerArea = 0\n for x, y, a, b in rectangles:\n cornerArea += (a - x) * (b - y)\n # Check if each corner is unique\n for corner in [(x, y), (x, b), (a, y), (a, b)]:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n # Check if all corners are unique\n if len(corners) != 4:\n return False\n \n bottomLeft, topRight = [float('inf'), float('inf')], [float('-inf'), float('-inf')]\n for (x, y) in corners:\n bottomLeft[0] = min(bottomLeft[0], x)\n bottomLeft[1] = min(bottomLeft[1], y)\n topRight[0] = max(topRight[0], x)\n topRight[1] = max(topRight[1], y)\n \n \n rectangleArea = (topRight[0] - bottomLeft[0]) * (topRight[1] - bottomLeft[1])\n if cornerArea != rectangleArea:\n return False\n\n return cornerArea == rectangleArea\n ","runtime":"310"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n from collections import defaultdict\n \n def add_point(point, count):\n if point in point_count:\n point_count[point] += count\n else:\n point_count[point] = count\n\n point_count = defaultdict(int)\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n area_sum = 0\n\n for x1, y1, x2, y2 in rectangles:\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n area_sum += (x2 - x1) * (y2 - y1)\n\n add_point((x1, y1), 1)\n add_point((x1, y2), 1)\n add_point((x2, y1), 1)\n add_point((x2, y2), 1)\n\n expected_area = (max_x - min_x) * (max_y - min_y)\n if area_sum != expected_area:\n return False\n\n corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\n for corner in corners:\n if point_count.get(corner, 0) != 1:\n return False\n del point_count[corner]\n\n for count in point_count.values():\n if count != 2 and count != 4:\n return False\n\n return True","runtime":"311"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n \n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True","runtime":"313"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n area = 0\n x1, y1, x2, y2 = float('inf'), float('inf'), -float('inf'), -float('inf')\n points = set()\n for rect in rectangles:\n x1, y1, x2, y2 = min(x1, rect[0]), min(y1, rect[1]), max(x2, rect[2]), max(y2, rect[3])\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\n p1, p2, p3, p4 = (rect[0], rect[1]), (rect[0], rect[3]), (rect[2], rect[1]), (rect[2], rect[3])\n for p in [p1, p2, p3, p4]:\n if p in points:\n points.remove(p)\n else:\n points.add(p)\n if len(points) != 4 or not all(p in points for p in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]):\n return False\n return area == (x2 - x1) * (y2 - y1)","runtime":"314"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n \n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True","runtime":"316"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Define a function to calculate the area of a rectangle\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Initialize variables to store the coordinates of the bounding rectangle\n x1, y1 = float('inf'), float('inf')\n x2, y2 = float('-inf'), float('-inf')\n \n # Initialize a set to store all corner points\n corners = set()\n \n # Initialize a variable to store the total area of all smaller rectangles\n total_area = 0\n \n # Iterate through each rectangle\n for rect in rectangles:\n x1 = min(x1, rect[0])\n y1 = min(y1, rect[1])\n x2 = max(x2, rect[2])\n y2 = max(y2, rect[3])\n \n total_area += area(rect)\n \n # Define the corners of the current rectangle\n c1 = (rect[0], rect[1])\n c2 = (rect[0], rect[3])\n c3 = (rect[2], rect[1])\n c4 = (rect[2], rect[3])\n \n # Update the set of corners\n for corner in [c1, c2, c3, c4]:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n # Check if the number of remaining corners is exactly 4\n if len(corners) != 4:\n return False\n \n # Check if the remaining corners are exactly the corners of the bounding rectangle\n if (x1, y1) not in corners or (x1, y2) not in corners or (x2, y1) not in corners or (x2, y2) not in corners:\n return False\n \n # Check if the total area of all smaller rectangles is equal to the area of the bounding rectangle\n return total_area == area([x1, y1, x2, y2])\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","runtime":"317"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n point_set = set()\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n t_area = 0\n\n for x1, y1, x2, y2 in rectangles:\n min_x, min_y = min(min_x, x1), min(min_y, y1)\n max_x, max_y = max(max_x, x2), max(max_y, y2)\n\n t_area += (x2 - x1)*(y2 - y1)\n \n def add_or_remove(point):\n if point in point_set:\n point_set.remove(point)\n else:\n point_set.add(point)\n \n add_or_remove((x1, y1))\n add_or_remove((x1, y2))\n add_or_remove((x2, y1))\n add_or_remove((x2, y2))\n \n if point_set != {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}:\n return False\n \n boundary_box_area = (max_x - min_x)*(max_y - min_y)\n return t_area == boundary_box_area\n ","runtime":"322"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n l, r, u, b, area, cntr = inf, -inf, -inf, inf, 0, defaultdict(int)\n for x1, y1, x2, y2 in rectangles:\n if l > x1: l = x1\n if r < x2: r = x2\n if u < y2: u = y2\n if b > y1: b = y1\n area += (x2-x1) * (y2-y1)\n cntr[(x1,y1)] += 1\n cntr[(x2,y2)] += 1\n cntr[(x1,y2)] += 1\n cntr[(x2,y1)] += 1\n \n print(area, l, r, u, b)\n print(cntr.items())\n if area != (r-l) * (u-b) or any(cntr[(x,y)] != 1 for x, y in product((l,r),(u,b))): return False\n print(area)\n for (x,y), cnt in cntr.items():\n if x in (l,r) and y in (u,b): continue\n if cnt not in (2,4): return False\n return True","runtime":"324"},{"code":"# class Solution:\n# def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n# rectangles.sort(key=lambda x: (-x[3], x[0]))\n# rectangles = deque(rectangles)\n \n# def overlaps(rect1, rect2):\n# overlaps_x = min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]) > 0\n# overlaps_y = min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]) > 0\n# return overlaps_x and overlaps_y\n \n# x_left = min(r[0] for r in rectangles)\n# x_right = max(r[2] for r in rectangles)\n \n \n# def merge_levels(a, b, level_y):\n# i = 0\n# j = 0\n# merged = deque()\n# x = x_left\n\n# while i < len(a) or j < len(b):\n# cur_a = None\n# if i < len(a):\n# cur_a = a[i]\n# if cur_a[1] >= level_y:\n# i += 1\n# continue\n# cur_b = None\n# if j < len(b):\n# cur_b = b[j]\n# if cur_b[1] >= level_y:\n# j += 1\n# continue\n\n# if cur_a is not None and cur_a[0] == x:\n# x = cur_a[2]\n# merged.append(cur_a)\n# i += 1\n# elif cur_b is not None and cur_b[0] == x:\n# x = cur_b[2]\n# merged.append(cur_b)\n# j += 1\n# else:\n# return False\n \n# if x != x_right:\n# return False\n \n# return merged\n\n# cur_level = deque()\n# while rectangles:\n \n# next_level = deque()\n# next_level_y = rectangles[0][3]\n \n# # check within next lvl\n# while rectangles and rectangles[0][3] == next_level_y:\n# if next_level:\n# if not overlaps(rectangles[0], next_level[-1]):\n# next_level.append(rectangles.popleft())\n# else:\n# return False\n# else:\n# next_level.append(rectangles.popleft())\n \n \n# cur_level = merge_levels(cur_level, next_level, next_level_y)\n\n# if not cur_level:\n# return False\n \n# return True\n \nclass Solution(object):\n def isRectangleCover(self, rectangles):\n def recordCorner(point):\n if point in corners:\n corners[point] += 1\n else:\n corners[point] = 1\n\n corners = {} # record all corners \n L, B, R, T, area = float('inf'), float('inf'), -float('inf'), -float('inf'), 0\n\n for sub in rectangles:\n L, B, R, T = min(L, sub[0]), min(B, sub[1]), max(R, sub[2]), max(T, sub[3])\n ax, ay, bx, by = sub[:]\n area += (bx-ax)*(by-ay) # sum up the area of each sub-rectangle\n for pp in [(ax, ay), (bx, by), (ax, by), (bx, ay)]: recordCorner(pp)\n\t\t\t# for px in [(ax, ay), (bx, by), (ax, by), (bx, ay)]: recordCorner(px)\n\n if area != (T-B)*(R-L): return False # check the area\n\n big_four = [(L,B),(R,T),(L,T),(R,B)]\n\n for bf in big_four: # check corners of big rectangle\n if bf not in corners or corners[bf] != 1:\n return False\n\n for key in corners: # check existing \"inner\" points\n if corners[key]%2 and key not in big_four:\n return False\n\n return True\n \n ","runtime":"328"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n \n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True","runtime":"331"},{"code":"from collections import defaultdict \nclass Solution:\n # Time: O()\n # Space: O(), where n = len(rectangles)\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n n = len(rectangles)\n v, h = [], []\n tot_area = 0\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n \n points = set()\n for x1, y1, x2, y2 in rectangles:\n v.append([x1, 0])\n v.append([x2, 1])\n h.append([y1, 0])\n h.append([y2, 1])\n tot_area += (y2-y1)*(x2-x1)\n min_x = min(min_x, x1, x2)\n min_y = min(min_y, y1, y2)\n max_x = max(max_x, x1, x2)\n max_y = max(max_y, y1, y2)\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for p in pts:\n if p in points:\n points.remove(p)\n else:\n points.add(p)\n\n if tot_area != (max_y-min_y)*(max_x-min_x):\n return 0\n\n if len(points) != 4: \n return False\n \n v.sort(), h.sort()\n count = 0\n for x, type_ in v[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0\n count = 0\n for x, type_ in h[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0 \n \n if (min_x, min_y) not in points:\n return 0\n if (min_x, max_y) not in points:\n return 0\n if (max_x, min_y) not in points:\n return 0\n if (max_x, max_y) not in points:\n return 0 \n\n return 1 \n","runtime":"353"},{"code":"from sortedcontainers import SortedDict\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n skyline_points = SortedDict()\n rectangles.sort(key=lambda rectangle: (rectangle[1], rectangle[0]))\n bx, by, ba, bb = rectangles[0]\n total_area = 0\n for x, y, a, b in rectangles:\n ba = max(ba, a)\n bb = max(bb, b)\n total_area += (a - x) * (b - y)\n \n if total_area != (ba - bx) * (bb - by):\n return False\n\n skyline_points[bx] = by\n skyline_points[ba] = by\n\n # print(\"bounds\", bx, by, ba, bb)\n for x, y, a, b in rectangles:\n # print(skyline_points)\n # print(x, y, a, b)\n\n if x not in skyline_points or skyline_points[x] != y:\n # print('HERE')\n # print(skyline_points)\n # print(x, y, a, b)\n return False\n\n idx = skyline_points.bisect_left(x)\n next_idx = idx + 1\n prev_idx = idx - 1\n if next_idx == len(skyline_points) or skyline_points.keys()[next_idx] < a:\n return False\n\n skyline_points[x] = b\n if prev_idx >= 0:\n prev_key = skyline_points.keys()[prev_idx]\n # print(prev_key)\n if skyline_points[prev_key] == b:\n skyline_points.pop(x)\n\n if a in skyline_points:\n prev_height = skyline_points[a]\n if prev_height == b and a != ba:\n skyline_points.pop(a)\n else:\n skyline_points[a] = max(prev_height, y)\n else:\n skyline_points[a] = y\n \n return True","runtime":"355"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x1 = y1 = 10 ** 5 + 1\n x2 = y2 = -10 ** 5 - 1\n area = 0\n s = set()\n for x, y, a, b in rectangles:\n x1, y1 = min(x1, x), min(y1, y)\n x2, y2 = max(x2, a), max(y2, b)\n area += (a - x) * (b - y)\n \n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\n if (x1, y1) not in s or \\\n (x1, y2) not in s or \\\n (x2, y1) not in s or \\\n (x2, y2) not in s or \\\n len(s) != 4 \\\n or (x2 - x1) * (y2 - y1) != area: return False\n return True","runtime":"357"},{"code":"# 注意：python 代码由 chatGPT\\U0001f916 根据我的 java 代码翻译，旨在帮助不同背景的读者理解算法逻辑。\n# 本代码不保证正确性，仅供参考。如有疑惑，可以参照我写的 java 代码对比查看。\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n X1, Y1 = float('inf'), float('inf')\n X2, Y2 = float('-inf'), float('-inf')\n\n points = set()\n actualArea = 0\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n # 计算完美矩形的理论顶点坐标\n X1 = min(X1, x1)\n Y1 = min(Y1, y1)\n X2 = max(X2, x2)\n Y2 = max(Y2, y2)\n # 累加小矩形的面积\n actualArea += (x2 - x1) * (y2 - y1)\n # 记录最终形成的图形中的顶点\n p1 = str(x1) + \",\" + str(y1)\n p2 = str(x1) + \",\" + str(y2)\n p3 = str(x2) + \",\" + str(y1)\n p4 = str(x2) + \",\" + str(y2)\n for p in [p1, p2, p3, p4]:\n if p in points:\n points.remove(p)\n else:\n points.add(p)\n\n # 判断面积是否相同\n expectedArea = (X2 - X1) * (Y2 - Y1)\n if actualArea != expectedArea:\n return False\n # 判断最终留下的顶点个数是否为 4\n if len(points) != 4:\n return False\n # 判断留下的 4 个顶点是否是完美矩形的顶点\n if not str(X1) + \",\" + str(Y1) in points: return False\n if not str(X1) + \",\" + str(Y2) in points: return False\n if not str(X2) + \",\" + str(Y1) in points: return False\n if not str(X2) + \",\" + str(Y2) in points: return False\n # 面积和顶点都对应，说明矩形符合题意\n return True","runtime":"364"},{"code":"from collections import defaultdict \nclass Solution:\n # Time: O()\n # Space: O(), where n = len(rectangles)\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n n = len(rectangles)\n v, h = [], []\n tot_area = 0\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n \n points = set()\n for x1, y1, x2, y2 in rectangles:\n v.append([x1, 0])\n v.append([x2, 1])\n h.append([y1, 0])\n h.append([y2, 1])\n tot_area += (y2-y1)*(x2-x1)\n min_x = min(min_x, x1, x2)\n min_y = min(min_y, y1, y2)\n max_x = max(max_x, x1, x2)\n max_y = max(max_y, y1, y2)\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for p in pts:\n if p in points:\n points.remove(p)\n else:\n points.add(p)\n\n if tot_area != (max_y-min_y)*(max_x-min_x):\n return 0\n\n if len(points) != 4: \n return False\n \n v.sort(), h.sort()\n count = 0\n for x, type_ in v[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0\n count = 0\n for x, type_ in h[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0 \n \n if (min_x, min_y) not in points:\n return 0\n if (min_x, max_y) not in points:\n return 0\n if (max_x, min_y) not in points:\n return 0\n if (max_x, max_y) not in points:\n return 0 \n\n return 1 \n","runtime":"375"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n minX1, minY1 = 10000000, 100000\n maxX2, maxY2 = -minX1, -minY1\n totalArea = 0\n st = set()\n for x,y,a,b in rectangles:\n tup = (x,y)\n if tup in st: return False\n st.add(tup)\n minX1 = min(minX1,x)\n minY1 = min(minY1,y)\n maxX2 = max(maxX2,a)\n maxY2 = max(maxY2,b)\n totalArea += (a-x) * (b-y)\n if totalArea != (maxX2 - minX1) * (maxY2 - minY1):\n return False\n dp = [0 for i in range(maxX2 - minX1 + 5)]\n dp2 = [0 for i in range(maxY2 - minY1 + 5)]\n for x,y,a,b in rectangles:\n height = b-y\n dp[x-minX1] += height\n dp[a-minX1] -= height\n # print(f\"{x} to {a}, height {b-y}\")\n # print(dp)\n\n width = a-x\n dp2[y-minY1] += width\n dp2[b-minY1] -= width\n \n if dp[0] != maxY2 - minY1: return False\n if dp2[0] != maxX2 - minX1: return False \n \n for i in range(minX1+1, maxX2+1):\n dp[i-minX1] += dp[i-minX1-1]\n for i in range(minY1+1, maxY2+1):\n dp2[i-minY1] += dp2[i-minY1-1]\n for i in range(minX1, maxX2):\n if dp[i-minX1] != maxY2 - minY1: return False\n # print(i-minX1, dp[i-minX1])\n for i in range(minY1, maxY2):\n if dp2[i-minY1] != maxX2 - minX1: return False\n if dp[maxX2 - minX1] != 0: return False\n if dp2[maxY2 - minY1] != 0: return False\n print(dp)\n print(dp2)\n return True\n ","runtime":"394"},{"code":"class Solution:\n '''\n simple brute, we construct y matrix used, then we traverse the rectangle and extend the y\n '''\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n ycoordinates = set()\n for rec in rectangles:\n ycoordinates.add(rec[1])\n ycoordinates.add(rec[3])\n rectangles.sort(key=lambda x: (x[0], x[2])) # we sort by x coordinates, and rectangles[0][0] will be basedline of x axis\n ycoordinates = list(ycoordinates)\n ycoordinates.sort()\n ycoordinatesmap = {}\n for i, y in enumerate(ycoordinates):\n ycoordinatesmap[y] = i\n\n xbase = rectangles[0][0]\n # each curx length need consider in the same coordinate, can have duplicate when two rectangle nearby\n # denote (xfrom, xto, optional btm or top xfrom to allow duplicate)\n curxlengths = [(xbase, xbase, None, None) for _ in range(0, len(ycoordinates))]\n for rec in rectangles:\n ystart = ycoordinatesmap[rec[1]]\n yend = ycoordinatesmap[rec[3]]\n xfrom, xto = rec[0], rec[2]\n\n for xidx in range(ystart, yend+1):\n curxlen = curxlengths[xidx]\n if curxlen[1] != xfrom and curxlen[3] == None:\n return False\n elif curxlen[1] != xfrom and curxlen[3] != None:\n if curxlen[3] == xfrom:\n if xto == curxlen[1]:\n curxlengths[xidx] = (curxlen[0], xto, None, None)\n else:\n curxlengths[xidx] = (curxlen[0], max(curxlen[1], xto), curxlen[0], min(curxlen[1], xto))\n continue\n else:\n return False\n # if they are toppest and bottomest of yaxis, cannot double use, else at top and bottom of smaller rectangle\n # below here is if is 2nd and 3rd is None\n if (xidx == ystart or xidx == yend) and xidx != 0 and xidx != len(curxlengths) - 1:\n curxlengths[xidx] = (curxlen[0], xto, curxlen[0], curxlen[1])\n else:\n curxlengths[xidx] = (curxlen[0], xto, None, None)\n xto = curxlengths[0][1]\n for x in range(1, len(curxlengths)):\n if curxlengths[x][1] != xto or curxlengths[x][3] is not None:\n return False\n return True\n\n\n \n\n\n\n \n\n ","runtime":"1486"},{"code":"class Solution:\n def get_y_area(self, active_intervals):\n if not active_intervals: return (-1, -1)\n active_intervals.sort()\n # print(\"active_intervals\", active_intervals)\n for i in range(1, len(active_intervals)):\n y_start, y_end = active_intervals[i]\n if y_start != active_intervals[i-1][1]:\n return (-1, -1)\n return (active_intervals[0][0], active_intervals[-1][1])\n\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n events = []\n START, END = 1, 0\n for x1,y1,x2,y2 in rectangles:\n events.append((x1, START, y1, y2))\n events.append((x2, END, y1, y2))\n \n events.sort()\n # print(events)\n x_last = events[0][0]\n cur_intervals = []\n res_rectangles = []\n for x, typ, y_start, y_end in events:\n # add event\n # print(\"x\", x, \"typ\", typ, \"y_start\", y_start, \"y_end\", y_end)\n if x != x_last:\n y1, y2 = self.get_y_area(cur_intervals)\n if (y1,y2) == (-1,-1): \n return False # overlapping found\n res_rectangles.append((x_last, y1, x, y2))\n x_last = x\n if typ == START:\n cur_intervals.append((y_start, y_end))\n else:\n cur_intervals.remove((y_start, y_end))\n \n print(res_rectangles)\n for i in range(1, len(res_rectangles)):\n last_x1, last_y1, last_x2, last_y2 = res_rectangles[i-1]\n x1, y1, x2, y2 = res_rectangles[i]\n if last_x2 != x1 or last_y1 != y1 or last_y2 != y2:\n return False\n return True\n\n ","runtime":"1569"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n X = sorted(set([x for x1, y1, x2, y2 in rectangles for x in [x1, x2]]))\n x_i = { x: i for i, x in enumerate(X) }\n x_min, x_max = X[0], X[-1]\n\n items = []\n for x1, y1, x2, y2 in rectangles:\n items.append((y1, x1, x2, 1))\n items.append((y2, x1, x2, -1))\n items.sort()\n items.append((items[-1][0] , x_min, x_max, 1))\n items.append((items[-1][0] + 1, x_min, x_max, -1))\n\n y_cur = items[0][0]\n count = [0] * len(X)\n for y, x1, x2, c in items:\n if y > y_cur and y_cur != -1:\n for i in range(len(count) - 1): \n if count[i] != 1: return False\n\n y_cur = y\n for i in range(x_i[x1], x_i[x2]): count[i] += c\n return True\n ","runtime":"1743"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n import numpy as np\n s0 = set()\n for i in rectangles:\n if tuple(i) in s0:\n return False\n s0.add(tuple(i))\n s0=set()\n r = np.array(rectangles)+1\n i1 = np.array([1,3])\n i2 = np.array([0,2])\n u0 = np.unique(np.append(r[:,i2],r[:,i2]+1))\n u0_min,u0_max = np.min(r[:,i2]),np.max(r[:,i2])\n u1 = np.unique(np.append(r[:,i1],r[:,i1]+1))\n u1_min,u1_max = np.min(r[:,i1]),np.max(r[:,i1])\n # u0 = np.insert(u0,0,0)\n # u1 = np.insert(u1,0,0)\n\n # print(u0,u1)\n d0=dict()\n d1 = dict()\n for i,v in enumerate(u0):\n d0[v] = i\n for i,v in enumerate(u1):\n d1[v] = i\n a = np.zeros((len(d1)+1,len(d0)+1),dtype = \"uint32\")\n # print(d0,d1)\n for i in r:\n print(i)\n a[d1[i[1]]:d1[i[3]],d0[i[0]]:d0[i[2]]] +=1\n # print(a,\"a\")\n u2 = np.unique(a)\n if u2.size>2:\n return False\n # print(d0)\n # print(d1)\n \n a=a[d1[u1_min]:d1[u1_max],d0[u0_min]:d0[u0_max]]\n # print(a,\"a2\")\n return np.unique(a).size==1\n \n","runtime":"1831"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n import numpy as np\n s0 = set()\n for i in rectangles:\n if tuple(i) in s0:\n return False\n s0.add(tuple(i))\n s0=set()\n r = np.array(rectangles)+1\n i1 = np.array([1,3])\n i2 = np.array([0,2])\n u0 = np.unique(np.append(r[:,i2],r[:,i2]+1))\n u0_min,u0_max = np.min(u0),np.max(u0)-1\n u1 = np.unique(np.append(r[:,i1],r[:,i1]+1))\n u1_min,u1_max = np.min(u1),np.max(u1)-1\n # u0 = np.insert(u0,0,0)\n # u1 = np.insert(u1,0,0)\n\n # print(u0,u1)\n d0=dict()\n d1 = dict()\n for i,v in enumerate(u0):\n d0[v] = i\n for i,v in enumerate(u1):\n d1[v] = i\n a = np.zeros((len(d1)+1,len(d0)+1),dtype = \"uint32\")\n # print(d0,d1)\n for i in r:\n print(i)\n a[d1[i[1]]:d1[i[3]],d0[i[0]]:d0[i[2]]] +=1\n # print(a,\"a\")\n u2 = np.unique(a)\n if u2.size>2:\n return False\n # print(d0)\n # print(d1)\n \n a=a[d1[u1_min]:d1[u1_max],d0[u0_min]:d0[u0_max]]\n # print(a,\"a2\")\n return np.unique(a).size==1\n \n","runtime":"1868"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n line = []\n cur = 0\n i = rectangles[0][0]\n globalRange = None\n while True:\n while cur < len(rectangles) and rectangles[cur][0] == i:\n line.append(rectangles[cur])\n cur += 1\n curRange = self.sweep(line)\n # print(curRange)\n # print(line)\n if not globalRange:\n globalRange = curRange\n if globalRange != curRange or not curRange:\n return False\n i += 1\n line = [rectangle for rectangle in line if rectangle[2] != i]\n if cur == len(rectangles):\n break\n return True\n \n def sweep(self, line):\n if not line:\n return None\n line.sort(key=lambda x: x[1])\n bottom = line[0][1]\n top = line[0][3]\n for rectangle in line[1:]:\n if rectangle[1] != top:\n return None\n top = rectangle[3]\n return (bottom, top)\n","runtime":"2381"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n line = []\n cur = 0\n i = rectangles[0][0]\n globalRange = None\n while True:\n while cur < len(rectangles) and rectangles[cur][0] == i:\n line.append(rectangles[cur])\n cur += 1\n curRange = self.sweep(line)\n # print(curRange)\n # print(line)\n if not globalRange:\n globalRange = curRange\n if globalRange != curRange or not curRange:\n return False\n i += 1\n line = [rectangle for rectangle in line if rectangle[2] != i]\n if cur == len(rectangles):\n break\n return True\n \n def sweep(self, line):\n if not line:\n return None\n line.sort(key=lambda x: x[1])\n bottom = line[0][1]\n top = line[0][3]\n for rectangle in line[1:]:\n if rectangle[1] != top:\n return None\n top = rectangle[3]\n return (bottom, top)\n","runtime":"2393"},{"code":"class Solution:\n\n \n\n def no_overlap(self, rect, corners):\n coord = [[[x[0],x[1]],[x[2],x[3]],[x[2],x[1]],[x[0],x[3]]] for x in rect]\n coord = sum(coord, [])\n \n coord = list(map(lambda x: str(x), coord))\n coord_counter = collections.Counter(coord)\n # print(coord_counter,corners)\n for item in coord_counter:\n if coord_counter[item]%2!=0:\n if not (coord_counter[item]==1 and str(item) in corners):\n return False\n if item in corners and coord_counter[item]!=1:\n return False\n return True\n\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n minX = float('inf')\n maxX = float('-inf')\n minY = float('inf')\n maxY = float('-inf')\n\n total_area = 0\n stackX = []\n stackY = [] \n for xyab in rectangles:\n if minX > xyab[0]:\n minX = xyab[0]\n if minY > xyab[1]:\n minY = xyab[1]\n if maxX < xyab[2]:\n maxX = xyab[2]\n if maxY < xyab[3]:\n maxY = xyab[3]\n area = (xyab[3] - xyab[1])*(xyab[2] - xyab[0])\n # print(xyab, area)\n total_area+=area\n\n # print(total_area, (maxX-minX)*(maxY-minY))\n corners = [[minX,minY],[minX,maxY],[maxX,minY],[maxX,maxY]]\n corners = [str(x) for x in corners]\n if total_area== (maxX-minX)*(maxY-minY) and self.no_overlap(rectangles, corners):\n return True\n else:\n return False\n ","runtime":"2427"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n line = []\n cur = 0\n i = rectangles[0][0]\n globalRange = None\n while True:\n while cur < len(rectangles) and rectangles[cur][0] == i:\n line.append(rectangles[cur])\n cur += 1\n curRange = self.sweep(line)\n # print(curRange)\n # print(line)\n if not globalRange:\n globalRange = curRange\n if globalRange != curRange or not curRange:\n return False\n i += 1\n for j in reversed(range(len(line))):\n if line[j][2] == i:\n line.pop(j)\n if cur == len(rectangles):\n break\n return True\n \n def sweep(self, line):\n if not line:\n return None\n line.sort(key=lambda x: x[1])\n bottom = line[0][1]\n top = line[0][3]\n for rectangle in line[1:]:\n if rectangle[1] != top:\n return None\n top = rectangle[3]\n return (bottom, top)\n","runtime":"2460"},{"code":"import numpy as np\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n minx, miny, maxx, maxy = float('inf'), float('inf'), float('-inf'), float('-inf')\n for x1, y1, x2, y2 in rectangles:\n minx, miny = min(minx, x1), min(miny, y1)\n maxx, maxy = max(maxx, x2), max(maxy, y2)\n dp = np.array([minx for _ in range(maxy - miny,)])\n for x1, y1, x2, y2 in sorted(rectangles):\n # check if any gap\n for y in range(y1 - miny, y2 - miny):\n if dp[y] != x1:\n return False\n else:\n dp[y] = x2\n return np.all(dp == maxx)\n ","runtime":"2784"},{"code":"import numpy as np\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n minx, miny, maxx, maxy = float('inf'), float('inf'), float('-inf'), float('-inf')\n for x1, y1, x2, y2 in rectangles:\n minx, miny = min(minx, x1), min(miny, y1)\n maxx, maxy = max(maxx, x2), max(maxy, y2)\n dp = np.array([minx for _ in range(maxy - miny,)])\n for x1, y1, x2, y2 in sorted(rectangles):\n # check if any gap or overlap\n for y in range(y1 - miny, y2 - miny):\n if dp[y] != x1:\n return False\n else:\n dp[y] = x2\n return np.all(dp == maxx)","runtime":"3054"},{"code":"import numpy as np\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n minx, miny, maxx, maxy = float('inf'), float('inf'), float('-inf'), float('-inf')\n for x1, y1, x2, y2 in rectangles:\n minx, miny = min(minx, x1), min(miny, y1)\n maxx, maxy = max(maxx, x2), max(maxy, y2)\n dp = np.array([minx for _ in range(maxy - miny,)])\n for x1, y1, x2, y2 in sorted(rectangles):\n # check if any gap or overlap\n for y in range(y1 - miny, y2 - miny):\n if dp[y] != x1:\n return False\n else:\n dp[y] = x2\n return np.all(dp == maxx)\n ","runtime":"3123"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n rectangles.sort(key=lambda x: (-x[3], x[0]))\n rectangles = deque(rectangles)\n \n def overlaps(rect1, rect2):\n overlaps_x = min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]) > 0\n overlaps_y = min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]) > 0\n return overlaps_x and overlaps_y\n \n x_left = min(r[0] for r in rectangles)\n x_right = max(r[2] for r in rectangles)\n \n \n def merge_levels(a, b, level_y):\n i = 0\n j = 0\n merged = deque()\n x = x_left\n\n while i < len(a) or j < len(b):\n cur_a = None\n if i < len(a):\n cur_a = a[i]\n if cur_a[1] >= level_y:\n i += 1\n continue\n cur_b = None\n if j < len(b):\n cur_b = b[j]\n if cur_b[1] >= level_y:\n j += 1\n continue\n\n if cur_a is not None and cur_a[0] == x:\n x = cur_a[2]\n merged.append(cur_a)\n i += 1\n elif cur_b is not None and cur_b[0] == x:\n x = cur_b[2]\n merged.append(cur_b)\n j += 1\n else:\n return False\n \n if x != x_right:\n return False\n \n return merged\n\n cur_level = deque()\n while rectangles:\n \n next_level = deque()\n next_level_y = rectangles[0][3]\n \n # check within next lvl\n while rectangles and rectangles[0][3] == next_level_y:\n if next_level:\n if not overlaps(rectangles[0], next_level[-1]):\n next_level.append(rectangles.popleft())\n else:\n return False\n else:\n next_level.append(rectangles.popleft())\n \n \n cur_level = merge_levels(cur_level, next_level, next_level_y)\n\n if not cur_level:\n return False\n \n return True\n \n \n ","runtime":"3132"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\\n area = 0\\n corners = set()\\n\\n for x, y, a, b in rectangles:\\n left = min(left, x)\\n bot = min(bot, y)\\n right = max(right, a)\\n top = max(top, b)\\n\\n area += (a - x) * (b - y)\\n\\n corners ^= {(x,y), (x,b), (a,y), (a,b)}\\n\\n expected_area = (right - left) * (top - bot)\\n\\n if area != expected_area or len(corners) != 4:\\n return \\\"false\\\"\\n\\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\\n return \\\"false\\\"\\n\\n return \\\"true\\\"\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().isRectangleCover(nums)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\\n area = 0\\n corners = set()\\n def checkCorner(corner):\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n for x, y, a, b in rectangles:\\n left = min(left, x)\\n bot = min(bot, y)\\n right = max(right, a)\\n top = max(top, b)\\n\\n area += (a - x) * (b - y)\\n\\n checkCorner((x, y))\\n checkCorner((x, b))\\n checkCorner((a, y))\\n checkCorner((a, b))\\n\\n expected_area = (right - left) * (top - bot)\\n\\n if area != expected_area or len(corners) != 4:\\n return \\\"false\\\"\\n\\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\\n return \\\"false\\\"\\n\\n return \\\"true\\\"\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().isRectangleCover(nums)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n area = 0\\n corners = set()\\n a, c = lambda: (X - x) * (Y - y), lambda: {(x, y), (x, Y), (X, y), (X, Y)}\\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= c()\\n x, y, X, Y = (f(z) for f, z in zip((min, min, max, max), zip(*rectangles)))\\n return area == a() and corners == c()\",\n \"runtime\": \"256\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n# the external corners must appear only once, and the ones inside have to be an even number (we filter them with xor).\\n# the total area of all the rectangles together, has to be equal to the area created by the external corners\\n\\n corners = set()\\n\\n def getArea(x,y,a,b):\\n return abs(a-x)*abs(b-y)\\n \\n totalArea = 0\\n\\n for x,y,a,b in rectangles:\\n corners ^= {(x,y), (a,b), (x,b), (a,y)}\\n totalArea += getArea(x,y,a,b)\\n \\n if len(corners) != 4:\\n return False\\n\\n if getArea(*sorted(corners)[0], *sorted(corners)[3]) != totalArea:\\n return False\\n\\n return True\\n\",\n \"runtime\": \"260\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n corners = set()\\n area = 0\\n for x1, y1, x2, y2 in rectangles:\\n area += (x2 - x1) * (y2 - y1)\\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\\n if len(corners) != 4:\\n return False\\n x1, y1 = min(corners, key=lambda x: x[0] + x[1])\\n x2, y2 = max(corners, key=lambda x: x[0] + x[1])\\n return area == (x2 - x1) * (y2 - y1)\",\n \"runtime\": \"265\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n corners = set()\\n for x1, y1, x2, y2 in rectangles:\\n area += (x2 - x1) * (y2 - y1)\\n for corner in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n if len(corners) != 4:\\n return False\\n x1, y1 = float(\\\"inf\\\"), float(\\\"inf\\\")\\n x2, y2 = float(\\\"-inf\\\"), float(\\\"-inf\\\")\\n for x, y in corners:\\n x1 = min(x1, x)\\n y1 = min(y1, y)\\n x2 = max(x2, x)\\n y2 = max(y2, y)\\n union_area = (x2 - x1) * (y2 - y1)\\n if area != union_area:\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"runtime\": \"266\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n corners = set()\\n a = lambda: (Y-y) * (X-x)\\n\\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\\n\\n if len(corners) != 4: return False\\n\\n x, y = min(corners, key=lambda x: x[0] + x[1])\\n X, Y = max(corners, key=lambda x: x[0] + x[1])\\n\\n return a() == area\\n\\n\\n \",\n \"runtime\": \"267\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n corners = set()\\n a = lambda: (Y-y) * (X-x)\\n \\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\\n\\n if len(corners) != 4: return False\\n x, y = min(corners, key=lambda x: x[0] + x[1])\\n X, Y = max(corners, key=lambda x: x[0] + x[1])\\n return a() == area\",\n \"runtime\": \"271\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n corners = set()\\n bottom = float('inf')\\n top = -float('inf')\\n right = -float('inf')\\n left = float('inf')\\n for x,y,a,b in rectangles:\\n area += (a-x)*(b-y)\\n for corner in (x,y),(x,b),(a,y),(a,b):\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n for x,y in corners:\\n bottom = min(bottom,y)\\n top = max(top,y)\\n left = min(left,x)\\n right = max(right,x)\\n return area == (top-bottom)*(right-left) and len(corners) == 4\\n \",\n \"runtime\": \"271\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n corners = set()\\n a = lambda: (Y-y) * (X-x)\\n \\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\\n\\n if len(corners) != 4: return False\\n x, y = min(corners, key=lambda x: x[0] + x[1])\\n X, Y = max(corners, key=lambda x: x[0] + x[1])\\n return a() == area\",\n \"runtime\": \"272\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Define a function to calculate the area of a rectangle\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Calculate the total area of all rectangles\\n total_area = sum(area(rect) for rect in rectangles)\\n \\n # Find the bounding rectangle\\n x1, y1 = min(rect[0] for rect in rectangles), min(rect[1] for rect in rectangles)\\n x2, y2 = max(rect[2] for rect in rectangles), max(rect[3] for rect in rectangles)\\n \\n # Calculate the area of the bounding rectangle\\n bounding_area = (x2 - x1) * (y2 - y1)\\n \\n # If the areas are not equal, return False\\n if total_area != bounding_area:\\n return False\\n \\n # Use a set to store the corners of the rectangles\\n corners = set()\\n \\n # Iterate through each rectangle\\n for rect in rectangles:\\n # Define the corners of the current rectangle\\n corners_rect = [(rect[0], rect[1]), (rect[2], rect[3]), (rect[0], rect[3]), (rect[2], rect[1])]\\n \\n # Update the set of corners\\n for corner in corners_rect:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n # If the number of corners is not 4, return False\\n if len(corners) != 4:\\n return False\\n \\n # Check if the remaining corners are the corners of the bounding rectangle\\n if (x1, y1) not in corners or (x2, y1) not in corners or (x1, y2) not in corners or (x2, y2) not in corners:\\n return False\\n \\n # If all conditions are met, return True\\n return True\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"273\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n area = 0\\n corners = set()\\n a, c = lambda: (X-x) * (Y-y), lambda: (x, y, X, Y)\\n \\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x, y), (x, Y), (X, y), (X, Y)}\\n \\n if len(corners) != 4:\\n return False\\n \\n x, y = min(corners, key=lambda c: c[0] + c[1])\\n X, Y = max(corners, key=lambda c: c[0] + c[1])\\n \\n return area == a() and corners == {(x, y), (x, Y), (X, y), (X, Y)}\",\n \"runtime\": \"274\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n border_points = set()\\n for x, y, u, v in rectangles:\\n area += (u - x) * (v - y)\\n border_points ^= {(x, y), (x, v), (u, y), (u, v)}\\n if len(border_points) != 4:\\n return False\\n x, y, u, v = (\\n min(x for x, _ in border_points),\\n min(y for _, y in border_points),\\n max(x for x, _ in border_points),\\n max(y for _, y in border_points)\\n )\\n return area == (u - x) * (v - y)\",\n \"runtime\": \"275\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n corners = set()\\n x_min, y_min, x_max, y_max = rectangles[-1]\\n sum_area = 0\\n for x, y, a, b in rectangles:\\n if x < x_min:\\n x_min = x\\n if y < y_min:\\n y_min = y\\n if a > x_max:\\n x_max = a\\n if b > y_max:\\n y_max = b\\n sum_area += (a - x) * (b - y)\\n for c in ((x, y), (x, b), (a, y), (a, b)):\\n if c in corners:\\n corners.remove(c)\\n else:\\n corners.add(c)\\n return len(corners) == 4 and (x_max - x_min) * (y_max - y_min) == sum_area and x_min == min((q[0] for q in corners)) and x_max == max((q[0] for q in corners)) and y_min == min((q[1] for q in corners)) and y_max == max((q[1] for q in corners))\",\n \"runtime\": \"276\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n area = 0\\n corners = set()\\n a, c = lambda: (X-x) * (Y-y), lambda: (x, y, X, Y)\\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x, y), (x, Y), (X, y), (X, Y)}\\n if len(corners) != 4: return False\\n x, y = min(corners, key=lambda c: c[0] + c[1])\\n X, Y = max(corners, key=lambda c: c[0] + c[1])\\n return area == a() and corners == {(x, y), (x, Y), (X, y), (X, Y)}\",\n \"runtime\": \"277\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area=0\\n corners=set()\\n a=lambda:(Y-y)*(X-x)\\n c=lambda k:k[0]+k[1]\\n\\n for x,y,X,Y in rectangles:\\n area+=a()\\n corners^={(x,Y),(X,y),(x,y),(X,Y)}\\n \\n if len(corners)!=4:\\n return False\\n \\n x,y = min(corners,key=c)\\n X,Y = max(corners,key=c)\\n\\n return area==a()\",\n \"runtime\": \"278\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n area = 0\\n corners = set()\\n a, c, b, d = float('inf'), float('inf'), float('-inf'), float('-inf')\\n \\n for x, y, x2, y2 in rectangles:\\n a, c = min(a, x), min(c, y)\\n b, d = max(b, x2), max(d, y2)\\n area += (x2 - x) * (y2 - y)\\n corners ^= {(x, y), (x, y2), (x2, y), (x2, y2)}\\n \\n if corners != {(a, c), (a, d), (b, c), (b, d)}:\\n return False\\n \\n return area == (b - a) * (d - c)\",\n \"runtime\": \"279\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Helper function to get the area of a rectangle\\n def getArea(rect):\\n x1, y1, x2, y2 = rect\\n return (x2 - x1) * (y2 - y1)\\n \\n # Initialize variables to track the bounding box and corner points\\n area = 0\\n corners = set()\\n \\n # Iterate through each rectangle\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n \\n # Add the area of the current rectangle to the total area\\n area += getArea(rect)\\n \\n # Define the corners of the current rectangle\\n corners_rect = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n \\n # Update the corner points set\\n for corner in corners_rect:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n # If the number of remaining corners is not 4, return False\\n if len(corners) != 4:\\n return False\\n \\n # Calculate the bounding box of the union of all rectangles\\n x1, y1 = min(corners, key=lambda x: x[0])[0], min(corners, key=lambda x: x[1])[1]\\n x2, y2 = max(corners, key=lambda x: x[0])[0], max(corners, key=lambda x: x[1])[1]\\n \\n # Check if the area of the bounding box is equal to the total area of the rectangles\\n return area == getArea([x1, y1, x2, y2])\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"280\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n area = 0\\n corners = set()\\n a = lambda: (Y-y) * (X-x)\\n \\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\\n\\n if len(corners) != 4: return False\\n x, y = min(corners, key=lambda x: x[0] + x[1])\\n X, Y = max(corners, key=lambda x: x[0] + x[1])\\n return a() == area\",\n \"runtime\": \"281\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\\n area = 0\\n x1 = math.inf\\n y1 = math.inf\\n x2 = -math.inf\\n y2 = -math.inf\\n corners: set[tuple[int, int]] = set()\\n\\n for x, y, a, b in rectangles:\\n area += (a - x) * (b - y)\\n x1 = min(x1, x)\\n y1 = min(y1, y)\\n x2 = max(x2, a)\\n y2 = max(y2, b)\\n\\n # the four points of the current rectangle\\n for point in [(x, y), (x, b), (a, y), (a, b)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n if len(corners) != 4:\\n return False\\n if ((x1, y1) not in corners or\\n (x1, y2) not in corners or\\n (x2, y1) not in corners or\\n (x2, y2) not in corners):\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"runtime\": \"282\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\\n area = 0\\n x1 = math.inf\\n y1 = math.inf\\n x2 = -math.inf\\n y2 = -math.inf\\n corners: set[tuple[int, int]] = set()\\n\\n for x, y, a, b in rectangles:\\n area += (a - x) * (b - y)\\n x1 = min(x1, x)\\n y1 = min(y1, y)\\n x2 = max(x2, a)\\n y2 = max(y2, b)\\n\\n # the four points of the current rectangle\\n for point in [(x, y), (x, b), (a, y), (a, b)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n if len(corners) != 4:\\n return False\\n if ((x1, y1) not in corners or\\n (x1, y2) not in corners or\\n (x2, y1) not in corners or\\n (x2, y2) not in corners):\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"runtime\": \"283\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\\n area = 0\\n x1 = math.inf\\n y1 = math.inf\\n x2 = -math.inf\\n y2 = -math.inf\\n corners: set[tuple[int, int]] = set()\\n\\n for x, y, a, b in rectangles:\\n area += (a - x) * (b - y)\\n x1 = min(x1, x)\\n y1 = min(y1, y)\\n x2 = max(x2, a)\\n y2 = max(y2, b)\\n\\n # the four points of the current rectangle\\n for point in [(x, y), (x, b), (a, y), (a, b)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n if len(corners) != 4:\\n return False\\n if ((x1, y1) not in corners or\\n (x1, y2) not in corners or\\n (x2, y1) not in corners or\\n (x2, y2) not in corners):\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"runtime\": \"284\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n total_area = 0\\n corners = set()\\n\\n for x1, y1, x2, y2 in rectangles:\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n \\n total_area += (x2 - x1) * (y2 - y1)\\n \\n for corner in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n if len(corners) != 4 or (min_x, min_y) not in corners or (min_x, max_y) not in corners or (max_x, min_y) not in corners or (max_x, max_y) not in corners:\\n return False\\n \\n return total_area == (max_x - min_x) * (max_y - min_y)\\n\\n# Time O(n)\\n# Space O(n)\",\n \"runtime\": \"285\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n point_set: Set[tuple] = set()\\n total_area: int = 0\\n for x, y, a, b in rectangles:\\n point_set ^= {(x, y), (x, b), (a, y), (a, b)}\\n total_area += (x - a) * (y - b)\\n\\n if len(point_set) != 4:\\n return False\\n x_values = list(set([i for i, _ in point_set]))\\n y_values = list(set([j for _, j in point_set]))\\n area = abs(x_values[0] - x_values[1]) * abs(y_values[0] - y_values[1])\\n\\n return area == total_area\\n \\n \\n\\n \",\n \"runtime\": \"286\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n events = []\\n for x, y, a, b in rectangles:\\n events.append((x, 1, y, b))\\n events.append((a, 0, y, b))\\n n = len(events)\\n events.sort()\\n xStart, xEnd = events[0][0], events[-1][0]\\n i = 0\\n xPrev, stackPrev = -1, []\\n while i < n:\\n xVal, etypeVal, _, _ = events[i]\\n stack = []\\n while i < n:\\n x, etype, y0, y1 = events[i]\\n if x != xVal or etype != etypeVal:\\n break\\n if stack and stack[-1][1] == y0:\\n y0 = stack.pop()[0]\\n stack.append((y0, y1))\\n i += 1\\n if etypeVal == 1:\\n if xVal == xStart:\\n if len(stack) != 1:\\n return False\\n elif xVal != xPrev or stack != stackPrev:\\n return False\\n else:\\n xPrev, stackPrev = xVal, stack\\n return True\\n\",\n \"runtime\": \"287\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n area = 0\\n corners = set()\\n a = lambda: (Y-y) * (X-x)\\n \\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\\n\\n if len(corners) != 4: return False\\n x, y = min(corners, key=lambda x: x[0] + x[1])\\n X, Y = max(corners, key=lambda x: x[0] + x[1])\\n return a() == area\",\n \"runtime\": \"288\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # simple problem\\n # Check if area of each adds up to the final one\\n # If not no solution but if it does then you need to make sure the number of corners are 4 only.\\n # If the corners are more than that that means some corners do not match with other ones to fit end to end\\n area = 0\\n corners = set()\\n a = lambda: (Y - y) * (X - x)\\n c = lambda k: k[0] + k[1]\\n \\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= {(x, Y), (X, y), (x, y), (X, Y)}\\n \\n if len(corners) != 4:\\n return False\\n x, y = min(corners, key = c)\\n X, Y = max(corners, key = c)\\n return area == a()\",\n \"runtime\": \"289\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n corners = set()\\n total_area = 0\\n min_x1, min_y1 = float('inf'), float('inf')\\n max_x2, max_y2 = float('-inf'), float('-inf')\\n \\n for x1, y1, x2, y2 in rectangles:\\n # Update bounding box\\n min_x1, min_y1 = min(min_x1, x1), min(min_y1, y1)\\n max_x2, max_y2 = max(max_x2, x2), max(max_y2, y2)\\n \\n # Calculate total area\\n total_area += (x2 - x1) * (y2 - y1)\\n \\n # Track corners\\n for corner in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n # Check that only the four bounding box corners are left\\n if corners != {(min_x1, min_y1), (min_x1, max_y2), (max_x2, min_y1), (max_x2, max_y2)}:\\n return False\\n \\n # Check if total area matches bounding box area\\n return total_area == (max_x2 - min_x1) * (max_y2 - min_y1)\\n \",\n \"runtime\": \"290\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n corners = set()\\n for x, y, X, Y in rectangles:\\n area += (X-x)*(Y-y)\\n corners ^= {(x,y), (x,Y), (X,y), (X,Y)}\\n if len(corners) != 4: return False\\n x, y = min(corners, key=lambda x: x[0] + x[1])\\n X, Y = max(corners, key=lambda x: x[0] + x[1])\\n return (X-x)*(Y-y) == area\",\n \"runtime\": \"291\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n if not rectangles or not rectangles[0]:\\n return False\\n\\n x1, y1 = float('inf'), float('inf')\\n x2 = float('-inf')\\n y2 = float('-inf')\\n\\n points = set()\\n area = 0\\n\\n for rect in rectangles:\\n x1 = min(rect[0], x1)\\n y1 = min(rect[1], y1)\\n x2 = max(rect[2], x2)\\n y2 = max(rect[3], y2)\\n\\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\\n\\n p1 = (rect[0], rect[1])\\n p2 = (rect[0], rect[3])\\n p3 = (rect[2], rect[3])\\n p4 = (rect[2], rect[1])\\n\\n for point in [p1, p2, p3, p4]:\\n if point in points:\\n points.remove(point)\\n else:\\n points.add(point)\\n\\n expected_area = (x2 - x1) * (y2 - y1)\\n\\n if (x1, y1) not in points or (x1, y2) not in points or (x2, y1) not in points or (x2, y2) not in points or len(\\n points) != 4:\\n return False\\n\\n return area == expected_area\",\n \"runtime\": \"292\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Helper function to calculate the area of a rectangle\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Initialize variables to track the bounding rectangle and corner points\\n corners = set()\\n area_sum = 0\\n min_x, min_y, max_x, max_y = float('inf'), float('inf'), float('-inf'), float('-inf')\\n \\n # Iterate through each rectangle\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n \\n area_sum += area(rect)\\n \\n # Update corner points\\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\\n \\n # Check if the number of corners is 4 and they form the bounding rectangle\\n if len(corners) != 4 or corners != {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}:\\n return False\\n \\n # Check if the sum of areas is equal to the area of the bounding rectangle\\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n return area_sum == bounding_area\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"293\"\n },\n {\n \"code\": \"class Solution(object):\\n def isRectangleCover(self, rectangles):\\n \\\"\\\"\\\"\\n :type rectangles: List[List[int]]\\n :rtype: bool\\n \\\"\\\"\\\"\\n hs = set()\\n area = 0\\n for rec in rectangles:\\n top_left = (rec[0], rec[1])\\n top_right = (rec[0], rec[3])\\n bottom_left = (rec[2], rec[1])\\n bottom_right = (rec[2], rec[3])\\n area += (rec[2] - rec[0]) * (rec[3] - rec[1])\\n for i in [top_left, top_right, bottom_left, bottom_right]:\\n if i not in hs:\\n hs.add(i)\\n else:\\n hs.remove(i)\\n if len(hs) != 4:\\n return False\\n hs = sorted(hs)\\n first = hs.pop(0)\\n last = hs.pop()\\n return area == (last[0] - first[0]) * (last[1] - first[1])\",\n \"runtime\": \"294\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # bottom left corner\\n x1 = float('inf')\\n y1 = float('inf')\\n # top right corner\\n x2 = float('-inf')\\n y2 = float('-inf')\\n\\n area = 0\\n\\n corners = set()\\n\\n for rect in rectangles:\\n x1 = min(rect[0], x1)\\n y1 = min(rect[1], y1)\\n x2 = max(rect[2], x2)\\n y2 = max(rect[3], y2)\\n\\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\\n\\n # add all corners\\n # pottom left\\n if (rect[0], rect[1]) in corners:\\n corners.remove((rect[0], rect[1]))\\n else:\\n corners.add((rect[0], rect[1]))\\n # top left\\n if (rect[0], rect[3]) in corners:\\n corners.remove((rect[0], rect[3]))\\n else:\\n corners.add((rect[0], rect[3]))\\n # top right\\n if (rect[2], rect[3]) in corners:\\n corners.remove((rect[2], rect[3]))\\n else:\\n corners.add((rect[2], rect[3]))\\n # bottom right\\n if (rect[2], rect[1]) in corners:\\n corners.remove((rect[2], rect[1]))\\n else:\\n corners.add((rect[2], rect[1]))\\n\\n # check that rectangle corners are all in small rectanglse\\n if ((x1, y1) not in corners \\n or (x1, y2) not in corners\\n or (x2, y1) not in corners\\n or (x2, y2) not in corners\\n or len(corners) != 4\\n ):\\n return False\\n\\n return int(area) == int((x2-x1) * (y2 - y1))\\n\\n\",\n \"runtime\": \"295\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n def add_point(point, points):\\n if point in points:\\n points.remove(point)\\n else:\\n points.add(point)\\n \\n area = 0\\n points = set()\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n \\n for x1, y1, x2, y2 in rectangles:\\n area += (x2 - x1) * (y2 - y1)\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n \\n add_point((x1, y1), points)\\n add_point((x1, y2), points)\\n add_point((x2, y1), points)\\n add_point((x2, y2), points)\\n\\n if (min_x, min_y) not in points or (min_x, max_y) not in points or (max_x, min_y) not in points or (max_x, max_y) not in points or len(points) != 4:\\n return False\\n \\n return area == (max_x - min_x) * (max_y - min_y)\\n\\n \",\n \"runtime\": \"296\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n\\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\\n \",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n mapp = defaultdict(int)\\n edges = []\\n \\n for x1,y1,x2,y2 in rectangles:\\n # 1: (x1, y1)\\n # 10: (x1, y2)\\n # 100: (x2,y2)\\n # 1000: (x2,y1)\\n p1 = mapp[(x1,y1)]\\n p2 = mapp[(x1, y2)]\\n p3 = mapp[(x2,y2)]\\n p4 = mapp[(x2,y1)]\\n m1 = 1\\n m2 = 1<<1\\n m3 = 1<<2\\n m4 = 1<<3\\n if p1 & m1 != 0 or p2 & m2 != 0 or p3 & m3 != 0 or p4 & m4 != 0:\\n return False\\n else:\\n mapp[(x1,y1)] |= m1\\n mapp[(x1,y2)] |= m2\\n mapp[(x2,y2)] |= m3\\n mapp[(x2,y1)] |= m4\\n\\n for k in mapp:\\n if mapp[k] in (8,4,2,1):\\n if len(edges) > 3:\\n return False\\n edges.append(k)\\n elif mapp[k] in (3,6,9,12,15):\\n continue\\n else:\\n return False\\n \\n if len(edges) != 4:\\n return False\\n \\n return True\\n\\n \\n\\n\\n\\n\\n\\n\\n\\n \",\n \"runtime\": \"297\"\n },\n {\n \"code\": \"from collections import Counter\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles):\\n # Helper function to get the area of a rectangle\\n def get_area(rect):\\n x1, y1, x2, y2 = rect\\n return (x2 - x1) * (y2 - y1)\\n\\n # Initialize variables to track the bounding rectangle and corner points\\n corners = set()\\n area = 0\\n min_x, min_y = float('inf'), float('inf')\\n max_x, max_y = float('-inf'), float('-inf')\\n\\n # Iterate through each rectangle\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n\\n # Update the bounding rectangle\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n\\n # Update the total area\\n area += get_area(rect)\\n\\n # Update the corner points\\n for point in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n # Check if the remaining corners are exactly 4 and match the outermost corners\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\\n if corners != expected_corners:\\n return False\\n\\n # Check if the total area matches the area of the bounding rectangle\\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n return area == bounding_area\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"298\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n if not rectangles or not rectangles[0]:\\n return False\\n\\n # The bottom left corner.\\n min_x, min_y = float('inf'), float('inf')\\n # The upper right corner.\\n max_x, max_y = float('-inf'), float('-inf')\\n\\n points = set()\\n area = 0\\n\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect[0], rect[1], rect[2], rect[3]\\n min_x = min(x1, min_x)\\n min_y = min(y1, min_y)\\n max_x = max(x2, max_x)\\n max_y = max(y2, max_y)\\n\\n area += (x2 - x1) * (y2 - y1)\\n\\n # Four corners of this rectangle.\\n p1 = (x1, y1)\\n p2 = (x1, y2)\\n p3 = (x2, y2)\\n p4 = (x2, y1)\\n\\n for point in [p1, p2, p3, p4]:\\n if point in points:\\n points.remove(point)\\n else:\\n points.add(point)\\n\\n expected_area = (max_x - min_x) * (max_y - min_y)\\n\\n # The count of all the four corner points should be one.\\n if (min_x, min_y) not in points or (min_x, max_y) not in points or (max_x, min_y) not in points or (max_x, max_y) not in points:\\n return False\\n\\n # All the other points should occur even times.\\n if len(points) != 4:\\n return False\\n return area == expected_area\",\n \"runtime\": \"299\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # Variables to store the bounding rectangle's corners and area\\n min_x = float('inf')\\n min_y = float('inf')\\n max_x = float('-inf')\\n max_y = float('-inf')\\n area = 0\\n points = set()\\n\\n # Helper function to manage the corners in the set\\n def add_point(point):\\n if point in points:\\n points.remove(point)\\n else:\\n points.add(point)\\n\\n # Iterate through all rectangles\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n # Calculate the bounding box of all rectangles\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n\\n # Calculate the area of the current rectangle\\n area += (x2 - x1) * (y2 - y1)\\n\\n # Add or remove the four corners of the current rectangle\\n add_point((x1, y1))\\n add_point((x1, y2))\\n add_point((x2, y1))\\n add_point((x2, y2))\\n\\n # The area of the bounding rectangle\\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n\\n # Check if the total area matches the bounding rectangle's area\\n if area != bounding_area:\\n return False\\n\\n # At the end, there should be exactly four points: the corners of the bounding rectangle\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\\n return points == expected_corners\",\n \"runtime\": \"300\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # Helper function to calculate area of a rectangle\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Initialize corners of the bounding rectangle\\n min_x, min_y = float('inf'), float('inf')\\n max_x, max_y = float('-inf'), float('-inf')\\n \\n # Set to store all corner points\\n corners = set()\\n \\n # Total area of all smaller rectangles\\n total_area = 0\\n \\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n \\n # Update bounding rectangle corners\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n \\n # Add corners to the set\\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\\n \\n # Add area of current rectangle to total area\\n total_area += area(rect)\\n \\n # Check if only 4 corners are left and they are the corners of the bounding rectangle\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\\n if corners != expected_corners:\\n return False\\n \\n # Check if the total area matches the area of the bounding rectangle\\n bounding_area = area([min_x, min_y, max_x, max_y])\\n return total_area == bounding_area\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution:\\n def __pointsCheck(self, x1: int, y1: int, x2: int, y2: int, points: set[tuple[int, int]]) -> bool:\\n return (x1, y1) in points and (x1, y2) in points and (x2, y1) in points and (x2, y2) in points\\n\\n def __updatePoints(self, coordinate: tuple[int, int], points: set[tuple[int, int]]) -> None:\\n points ^= {coordinate}\\n\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n points: set[tuple[int, int]] = set()\\n x1, x2 = float(\\\"inf\\\"), float(\\\"-inf\\\")\\n y1, y2 = float(\\\"inf\\\"), float(\\\"-inf\\\")\\n area: int = 0\\n\\n for coordinates in rectangles:\\n X1, Y1, X2, Y2 = coordinates\\n\\n x1, x2 = min(X1, x1), max(X2, x2)\\n y1, y2 = min(Y1, y1), max(Y2, y2)\\n\\n area += (Y2 - Y1) * (X2 - X1)\\n \\n self.__updatePoints((X1, Y1), points)\\n self.__updatePoints((X1, Y2), points)\\n self.__updatePoints((X2, Y1), points)\\n self.__updatePoints((X2, Y2), points)\\n \\n return area==(y2 - y1)*(x2 - x1) and len(points)==4 and self.__pointsCheck(x1, y1, x2, y2, points)\",\n \"runtime\": \"301\"\n },\n {\n \"code\": \"class Solution: \\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool: \\n # Use a dictionary to count corners \\n corner_count = {} \\n\\n def add_corner(x, y): \\n if (x, y) in corner_count: \\n corner_count[(x, y)] += 1 \\n else: \\n corner_count[(x, y)] = 1 \\n\\n def remove_corner(x, y): \\n if (x, y) in corner_count: \\n corner_count[(x, y)] -= 1 \\n if corner_count[(x, y)] == 0: \\n del corner_count[(x, y)] \\n\\n # Variables to determine the bounding box of all rectangles \\n min_x = float('inf') \\n min_y = float('inf') \\n max_x = float('-inf') \\n max_y = float('-inf') \\n total_area = 0 \\n\\n for x1, y1, x2, y2 in rectangles: \\n min_x = min(min_x, x1) \\n min_y = min(min_y, y1) \\n max_x = max(max_x, x2) \\n max_y = max(max_y, y2) \\n total_area += (x2 - x1) * (y2 - y1) \\n add_corner(x1, y1) \\n add_corner(x1, y2) \\n add_corner(x2, y1) \\n add_corner(x2, y2) \\n\\n if total_area != (max_x - min_x) * (max_y - min_y): \\n return False \\n\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)} \\n\\n for corner in expected_corners: \\n if corner not in corner_count or corner_count[corner] != 1: \\n return False \\n del corner_count[corner] \\n\\n for count in corner_count.values(): \\n if count % 2 != 0: \\n return False \\n\\n return True\",\n \"runtime\": \"302\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\\n point2=[-100000,-100000]\\n point1=[100000,100000]\\n s = set()\\n total = 0\\n for i in range(len(rectangles)):\\n point1 = [min(point1[0],rectangles[i][0]),min(point1[1],rectangles[i][1])]\\n point2 = [max(point2[0],rectangles[i][2]),max(point2[1],rectangles[i][3])]\\n for j in [(rectangles[i][0],rectangles[i][1]),(rectangles[i][0],rectangles[i][3]),(rectangles[i][2],rectangles[i][1]),(rectangles[i][2],rectangles[i][3])]:\\n s ^= {j}\\n total += (rectangles[i][2]-rectangles[i][0]) * (rectangles[i][3] - rectangles[i][1])\\n if len(s) == 4 and (point1[0],point1[1]) in s and (point2[0],point2[1]) in s and (point1[0],point2[1]) in s and (point2[0],point1[1]) in s and total == (point2[0] - point1[0])*(point2[1] - point1[1]):\\n return True\\n return False\\n\",\n \"runtime\": \"303\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Define a set to store all the corner points\\n corners = set()\\n \\n # Initialize the area and coordinates of the bounding rectangle\\n area = 0\\n x1 = float('inf')\\n y1 = float('inf')\\n x2 = float('-inf')\\n y2 = float('-inf')\\n \\n # Iterate through each rectangle\\n for rect in rectangles:\\n x1 = min(x1, rect[0])\\n y1 = min(y1, rect[1])\\n x2 = max(x2, rect[2])\\n y2 = max(y2, rect[3])\\n \\n # Calculate the area of the current rectangle\\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Define the corner points of the current rectangle\\n corners_rect = [(rect[0], rect[1]), (rect[2], rect[3]), (rect[0], rect[3]), (rect[2], rect[1])]\\n \\n # Update the set of corners\\n for corner in corners_rect:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n # Check if the remaining corners are exactly 4 and they form the bounding rectangle\\n if len(corners) != 4 or corners != {(x1, y1), (x2, y2), (x1, y2), (x2, y1)}:\\n return False\\n \\n # Check if the total area matches the area of the bounding rectangle\\n return area == (x2 - x1) * (y2 - y1)\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def __pointsCheck(self, x1: int, y1: int, x2: int, y2: int, points: set[tuple[int, int]]) -> bool:\\n return (x1, y1) in points and (x1, y2) in points and (x2, y1) in points and (x2, y2) in points\\n\\n def __updatePoints(self, coordinate: tuple[int, int], points: set[tuple[int, int]]) -> None:\\n if coordinate in points:\\n points.remove(coordinate)\\n else: points.add(coordinate)\\n\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n points: set[tuple[int, int]] = set()\\n x1, x2 = float(\\\"inf\\\"), float(\\\"-inf\\\")\\n y1, y2 = float(\\\"inf\\\"), float(\\\"-inf\\\")\\n area: int = 0\\n\\n for coordinates in rectangles:\\n X1, Y1, X2, Y2 = coordinates\\n\\n x1, x2 = min(X1, x1), max(X2, x2)\\n y1, y2 = min(Y1, y1), max(Y2, y2)\\n\\n area += (Y2 - Y1) * (X2 - X1)\\n \\n self.__updatePoints((X1, Y1), points)\\n self.__updatePoints((X1, Y2), points)\\n self.__updatePoints((X2, Y1), points)\\n self.__updatePoints((X2, Y2), points)\\n \\n return area==(y2 - y1)*(x2 - x1) and len(points)==4 and self.__pointsCheck(x1, y1, x2, y2, points)\",\n \"runtime\": \"304\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n \\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\",\n \"runtime\": \"305\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles):\\n # Define a function to calculate the area of a rectangle\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Initialize variables to track the smallest and largest coordinates\\n min_x, min_y = float('inf'), float('inf')\\n max_x, max_y = float('-inf'), float('-inf')\\n \\n # Initialize a dictionary to count the degrees of each vertex\\n vertex_degrees = defaultdict(int)\\n \\n # Calculate the total area of all rectangles\\n total_area = 0\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n \\n # Update the bounding rectangle coordinates\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n \\n # Add the area of the current rectangle to the total area\\n total_area += area(rect)\\n \\n # Update the degrees of the vertices\\n vertices = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for vertex in vertices:\\n vertex_degrees[vertex] += 1\\n \\n # Calculate the area of the bounding rectangle\\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n \\n # Check if the total area matches the bounding rectangle area\\n if total_area != bounding_area:\\n return False\\n \\n # Check the number of vertices with odd degrees\\n corners = 0\\n for vertex, degree in vertex_degrees.items():\\n if degree % 2 == 1:\\n corners += 1\\n \\n # There should be exactly 4 vertices with odd degrees\\n if corners != 4:\\n return False\\n \\n # Check if these 4 vertices are the outer corners of the bounding rectangle\\n outer_corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\\n for corner in outer_corners:\\n if vertex_degrees[corner] != 1:\\n return False\\n \\n # All conditions are satisfied\\n return True\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"306\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n from collections import defaultdict\\n\\n corners = defaultdict(int)\\n area = 0\\n \\n for x1, y1, x2, y2 in rectangles:\\n # Compute area of each rectangle and add it to the total area\\n area += (x2 - x1) * (y2 - y1)\\n \\n # Track the corners of the rectangles\\n corners[(x1, y1)] ^= 1\\n corners[(x1, y2)] ^= 1\\n corners[(x2, y1)] ^= 1\\n corners[(x2, y2)] ^= 1\\n\\n # Find the bounding rectangle coordinates\\n min_x = min(rectangles, key=lambda r: r[0])[0]\\n min_y = min(rectangles, key=lambda r: r[1])[1]\\n max_x = max(rectangles, key=lambda r: r[2])[2]\\n max_y = max(rectangles, key=lambda r: r[3])[3]\\n\\n # Calculate the area of the bounding rectangle\\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n \\n # Check the corners\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\\n \\n actual_corners = {k for k, v in corners.items() if v % 2 == 1}\\n \\n return area == bounding_area and expected_corners == actual_corners\\n\",\n \"runtime\": \"307\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n \\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n min_x, min_y, max_x, max_y = rectangles[0]\\n total_area = 0\\n s = set()\\n for rect in rectangles:\\n min_x = min(rect[0], min_x)\\n min_y = min(rect[1], min_y)\\n max_x = max(rect[2], max_x)\\n max_y = max(rect[3], max_y)\\n total_area += (rect[2] - rect[0]) * (rect[3] - rect[1])\\n\\n for i, j in itertools.product([rect[0], rect[2]], [rect[1], rect[3]]):\\n s ^= {(i,j)}\\n expected_area = (max_x - min_x) * (max_y - min_y)\\n expected_s = set([(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)])\\n return total_area == expected_area and expected_s == s\",\n \"runtime\": \"308\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Helper function to calculate area\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Calculate the total area of all rectangles\\n total_area = sum(area(rect) for rect in rectangles)\\n \\n # Find the bounding rectangle\\n min_x = min(rect[0] for rect in rectangles)\\n min_y = min(rect[1] for rect in rectangles)\\n max_x = max(rect[2] for rect in rectangles)\\n max_y = max(rect[3] for rect in rectangles)\\n \\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n \\n # If the total area is not equal to the bounding rectangle area, return False\\n if total_area != bounding_area:\\n return False\\n \\n # Count the occurrences of each corner point\\n from collections import defaultdict\\n point_count = defaultdict(int)\\n \\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n corners = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for corner in corners:\\n point_count[corner] += 1\\n \\n # Check if the corner points of the bounding rectangle appear exactly once\\n # and all other points appear exactly twice or four times\\n expected_corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\\n for point, count in point_count.items():\\n if point in expected_corners:\\n if count != 1:\\n return False\\n else:\\n if count not in [2, 4]:\\n return False\\n \\n return True\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"309\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # Find the leftmost and bottommost pair = A\\n # Find the rightmost and topmost pair = B\\n # Create a visited set and attempt to add all the points in each rectangle\\n # If any overlap, return False\\n # At the end, if the size of the visited set is not == area of \\n # rectangle created by A, B, return False\\n \\n bottomLeft, topRight = [float('inf'), float('inf')], [float('-inf'), float('-inf')]\\n for (x, y, a, b) in rectangles:\\n bottomLeft[0] = min(bottomLeft[0], x)\\n bottomLeft[1] = min(bottomLeft[1], y)\\n topRight[0] = min(topRight[0], a)\\n topRight[1] = min(topRight[1], b)\\n \\n corners = set()\\n cornerArea = 0\\n for x, y, a, b in rectangles:\\n cornerArea += (a - x) * (b - y)\\n # Check if each corner is unique\\n for corner in [(x, y), (x, b), (a, y), (a, b)]:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n # Check if all corners are unique\\n if len(corners) != 4:\\n return False\\n \\n bottomLeft, topRight = [float('inf'), float('inf')], [float('-inf'), float('-inf')]\\n for (x, y) in corners:\\n bottomLeft[0] = min(bottomLeft[0], x)\\n bottomLeft[1] = min(bottomLeft[1], y)\\n topRight[0] = max(topRight[0], x)\\n topRight[1] = max(topRight[1], y)\\n \\n \\n rectangleArea = (topRight[0] - bottomLeft[0]) * (topRight[1] - bottomLeft[1])\\n if cornerArea != rectangleArea:\\n return False\\n\\n return cornerArea == rectangleArea\\n \",\n \"runtime\": \"310\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n from collections import defaultdict\\n \\n def add_point(point, count):\\n if point in point_count:\\n point_count[point] += count\\n else:\\n point_count[point] = count\\n\\n point_count = defaultdict(int)\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n area_sum = 0\\n\\n for x1, y1, x2, y2 in rectangles:\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n area_sum += (x2 - x1) * (y2 - y1)\\n\\n add_point((x1, y1), 1)\\n add_point((x1, y2), 1)\\n add_point((x2, y1), 1)\\n add_point((x2, y2), 1)\\n\\n expected_area = (max_x - min_x) * (max_y - min_y)\\n if area_sum != expected_area:\\n return False\\n\\n corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\\n for corner in corners:\\n if point_count.get(corner, 0) != 1:\\n return False\\n del point_count[corner]\\n\\n for count in point_count.values():\\n if count != 2 and count != 4:\\n return False\\n\\n return True\",\n \"runtime\": \"311\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n \\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\",\n \"runtime\": \"313\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n area = 0\\n x1, y1, x2, y2 = float('inf'), float('inf'), -float('inf'), -float('inf')\\n points = set()\\n for rect in rectangles:\\n x1, y1, x2, y2 = min(x1, rect[0]), min(y1, rect[1]), max(x2, rect[2]), max(y2, rect[3])\\n area += (rect[2] - rect[0]) * (rect[3] - rect[1])\\n p1, p2, p3, p4 = (rect[0], rect[1]), (rect[0], rect[3]), (rect[2], rect[1]), (rect[2], rect[3])\\n for p in [p1, p2, p3, p4]:\\n if p in points:\\n points.remove(p)\\n else:\\n points.add(p)\\n if len(points) != 4 or not all(p in points for p in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]):\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"runtime\": \"314\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n \\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\",\n \"runtime\": \"316\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Define a function to calculate the area of a rectangle\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Initialize variables to store the coordinates of the bounding rectangle\\n x1, y1 = float('inf'), float('inf')\\n x2, y2 = float('-inf'), float('-inf')\\n \\n # Initialize a set to store all corner points\\n corners = set()\\n \\n # Initialize a variable to store the total area of all smaller rectangles\\n total_area = 0\\n \\n # Iterate through each rectangle\\n for rect in rectangles:\\n x1 = min(x1, rect[0])\\n y1 = min(y1, rect[1])\\n x2 = max(x2, rect[2])\\n y2 = max(y2, rect[3])\\n \\n total_area += area(rect)\\n \\n # Define the corners of the current rectangle\\n c1 = (rect[0], rect[1])\\n c2 = (rect[0], rect[3])\\n c3 = (rect[2], rect[1])\\n c4 = (rect[2], rect[3])\\n \\n # Update the set of corners\\n for corner in [c1, c2, c3, c4]:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n # Check if the number of remaining corners is exactly 4\\n if len(corners) != 4:\\n return False\\n \\n # Check if the remaining corners are exactly the corners of the bounding rectangle\\n if (x1, y1) not in corners or (x1, y2) not in corners or (x2, y1) not in corners or (x2, y2) not in corners:\\n return False\\n \\n # Check if the total area of all smaller rectangles is equal to the area of the bounding rectangle\\n return total_area == area([x1, y1, x2, y2])\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"runtime\": \"317\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n point_set = set()\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n t_area = 0\\n\\n for x1, y1, x2, y2 in rectangles:\\n min_x, min_y = min(min_x, x1), min(min_y, y1)\\n max_x, max_y = max(max_x, x2), max(max_y, y2)\\n\\n t_area += (x2 - x1)*(y2 - y1)\\n \\n def add_or_remove(point):\\n if point in point_set:\\n point_set.remove(point)\\n else:\\n point_set.add(point)\\n \\n add_or_remove((x1, y1))\\n add_or_remove((x1, y2))\\n add_or_remove((x2, y1))\\n add_or_remove((x2, y2))\\n \\n if point_set != {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}:\\n return False\\n \\n boundary_box_area = (max_x - min_x)*(max_y - min_y)\\n return t_area == boundary_box_area\\n \",\n \"runtime\": \"322\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n l, r, u, b, area, cntr = inf, -inf, -inf, inf, 0, defaultdict(int)\\n for x1, y1, x2, y2 in rectangles:\\n if l > x1: l = x1\\n if r < x2: r = x2\\n if u < y2: u = y2\\n if b > y1: b = y1\\n area += (x2-x1) * (y2-y1)\\n cntr[(x1,y1)] += 1\\n cntr[(x2,y2)] += 1\\n cntr[(x1,y2)] += 1\\n cntr[(x2,y1)] += 1\\n \\n print(area, l, r, u, b)\\n print(cntr.items())\\n if area != (r-l) * (u-b) or any(cntr[(x,y)] != 1 for x, y in product((l,r),(u,b))): return False\\n print(area)\\n for (x,y), cnt in cntr.items():\\n if x in (l,r) and y in (u,b): continue\\n if cnt not in (2,4): return False\\n return True\",\n \"runtime\": \"324\"\n },\n {\n \"code\": \"# class Solution:\\n# def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n# rectangles.sort(key=lambda x: (-x[3], x[0]))\\n# rectangles = deque(rectangles)\\n \\n# def overlaps(rect1, rect2):\\n# overlaps_x = min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]) > 0\\n# overlaps_y = min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]) > 0\\n# return overlaps_x and overlaps_y\\n \\n# x_left = min(r[0] for r in rectangles)\\n# x_right = max(r[2] for r in rectangles)\\n \\n \\n# def merge_levels(a, b, level_y):\\n# i = 0\\n# j = 0\\n# merged = deque()\\n# x = x_left\\n\\n# while i < len(a) or j < len(b):\\n# cur_a = None\\n# if i < len(a):\\n# cur_a = a[i]\\n# if cur_a[1] >= level_y:\\n# i += 1\\n# continue\\n# cur_b = None\\n# if j < len(b):\\n# cur_b = b[j]\\n# if cur_b[1] >= level_y:\\n# j += 1\\n# continue\\n\\n# if cur_a is not None and cur_a[0] == x:\\n# x = cur_a[2]\\n# merged.append(cur_a)\\n# i += 1\\n# elif cur_b is not None and cur_b[0] == x:\\n# x = cur_b[2]\\n# merged.append(cur_b)\\n# j += 1\\n# else:\\n# return False\\n \\n# if x != x_right:\\n# return False\\n \\n# return merged\\n\\n# cur_level = deque()\\n# while rectangles:\\n \\n# next_level = deque()\\n# next_level_y = rectangles[0][3]\\n \\n# # check within next lvl\\n# while rectangles and rectangles[0][3] == next_level_y:\\n# if next_level:\\n# if not overlaps(rectangles[0], next_level[-1]):\\n# next_level.append(rectangles.popleft())\\n# else:\\n# return False\\n# else:\\n# next_level.append(rectangles.popleft())\\n \\n \\n# cur_level = merge_levels(cur_level, next_level, next_level_y)\\n\\n# if not cur_level:\\n# return False\\n \\n# return True\\n \\nclass Solution(object):\\n def isRectangleCover(self, rectangles):\\n def recordCorner(point):\\n if point in corners:\\n corners[point] += 1\\n else:\\n corners[point] = 1\\n\\n corners = {} # record all corners \\n L, B, R, T, area = float('inf'), float('inf'), -float('inf'), -float('inf'), 0\\n\\n for sub in rectangles:\\n L, B, R, T = min(L, sub[0]), min(B, sub[1]), max(R, sub[2]), max(T, sub[3])\\n ax, ay, bx, by = sub[:]\\n area += (bx-ax)*(by-ay) # sum up the area of each sub-rectangle\\n for pp in [(ax, ay), (bx, by), (ax, by), (bx, ay)]: recordCorner(pp)\\n\\t\\t\\t# for px in [(ax, ay), (bx, by), (ax, by), (bx, ay)]: recordCorner(px)\\n\\n if area != (T-B)*(R-L): return False # check the area\\n\\n big_four = [(L,B),(R,T),(L,T),(R,B)]\\n\\n for bf in big_four: # check corners of big rectangle\\n if bf not in corners or corners[bf] != 1:\\n return False\\n\\n for key in corners: # check existing \\\"inner\\\" points\\n if corners[key]%2 and key not in big_four:\\n return False\\n\\n return True\\n \\n \",\n \"runtime\": \"328\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n \\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\",\n \"runtime\": \"331\"\n },\n {\n \"code\": \"from collections import defaultdict \\nclass Solution:\\n # Time: O()\\n # Space: O(), where n = len(rectangles)\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n n = len(rectangles)\\n v, h = [], []\\n tot_area = 0\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n \\n points = set()\\n for x1, y1, x2, y2 in rectangles:\\n v.append([x1, 0])\\n v.append([x2, 1])\\n h.append([y1, 0])\\n h.append([y2, 1])\\n tot_area += (y2-y1)*(x2-x1)\\n min_x = min(min_x, x1, x2)\\n min_y = min(min_y, y1, y2)\\n max_x = max(max_x, x1, x2)\\n max_y = max(max_y, y1, y2)\\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for p in pts:\\n if p in points:\\n points.remove(p)\\n else:\\n points.add(p)\\n\\n if tot_area != (max_y-min_y)*(max_x-min_x):\\n return 0\\n\\n if len(points) != 4: \\n return False\\n \\n v.sort(), h.sort()\\n count = 0\\n for x, type_ in v[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0\\n count = 0\\n for x, type_ in h[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0 \\n \\n if (min_x, min_y) not in points:\\n return 0\\n if (min_x, max_y) not in points:\\n return 0\\n if (max_x, min_y) not in points:\\n return 0\\n if (max_x, max_y) not in points:\\n return 0 \\n\\n return 1 \\n\",\n \"runtime\": \"353\"\n },\n {\n \"code\": \"from sortedcontainers import SortedDict\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n skyline_points = SortedDict()\\n rectangles.sort(key=lambda rectangle: (rectangle[1], rectangle[0]))\\n bx, by, ba, bb = rectangles[0]\\n total_area = 0\\n for x, y, a, b in rectangles:\\n ba = max(ba, a)\\n bb = max(bb, b)\\n total_area += (a - x) * (b - y)\\n \\n if total_area != (ba - bx) * (bb - by):\\n return False\\n\\n skyline_points[bx] = by\\n skyline_points[ba] = by\\n\\n # print(\\\"bounds\\\", bx, by, ba, bb)\\n for x, y, a, b in rectangles:\\n # print(skyline_points)\\n # print(x, y, a, b)\\n\\n if x not in skyline_points or skyline_points[x] != y:\\n # print('HERE')\\n # print(skyline_points)\\n # print(x, y, a, b)\\n return False\\n\\n idx = skyline_points.bisect_left(x)\\n next_idx = idx + 1\\n prev_idx = idx - 1\\n if next_idx == len(skyline_points) or skyline_points.keys()[next_idx] < a:\\n return False\\n\\n skyline_points[x] = b\\n if prev_idx >= 0:\\n prev_key = skyline_points.keys()[prev_idx]\\n # print(prev_key)\\n if skyline_points[prev_key] == b:\\n skyline_points.pop(x)\\n\\n if a in skyline_points:\\n prev_height = skyline_points[a]\\n if prev_height == b and a != ba:\\n skyline_points.pop(a)\\n else:\\n skyline_points[a] = max(prev_height, y)\\n else:\\n skyline_points[a] = y\\n \\n return True\",\n \"runtime\": \"355\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x1 = y1 = 10 ** 5 + 1\\n x2 = y2 = -10 ** 5 - 1\\n area = 0\\n s = set()\\n for x, y, a, b in rectangles:\\n x1, y1 = min(x1, x), min(y1, y)\\n x2, y2 = max(x2, a), max(y2, b)\\n area += (a - x) * (b - y)\\n \\n for i, j in itertools.product([x, a], [y, b]): s ^= {(i, j)}\\n if (x1, y1) not in s or \\\\\\n (x1, y2) not in s or \\\\\\n (x2, y1) not in s or \\\\\\n (x2, y2) not in s or \\\\\\n len(s) != 4 \\\\\\n or (x2 - x1) * (y2 - y1) != area: return False\\n return True\",\n \"runtime\": \"357\"\n },\n {\n \"code\": \"# 注意：python 代码由 chatGPT\\\\U0001f916 根据我的 java 代码翻译，旨在帮助不同背景的读者理解算法逻辑。\\n# 本代码不保证正确性，仅供参考。如有疑惑，可以参照我写的 java 代码对比查看。\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n X1, Y1 = float('inf'), float('inf')\\n X2, Y2 = float('-inf'), float('-inf')\\n\\n points = set()\\n actualArea = 0\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n # 计算完美矩形的理论顶点坐标\\n X1 = min(X1, x1)\\n Y1 = min(Y1, y1)\\n X2 = max(X2, x2)\\n Y2 = max(Y2, y2)\\n # 累加小矩形的面积\\n actualArea += (x2 - x1) * (y2 - y1)\\n # 记录最终形成的图形中的顶点\\n p1 = str(x1) + \\\",\\\" + str(y1)\\n p2 = str(x1) + \\\",\\\" + str(y2)\\n p3 = str(x2) + \\\",\\\" + str(y1)\\n p4 = str(x2) + \\\",\\\" + str(y2)\\n for p in [p1, p2, p3, p4]:\\n if p in points:\\n points.remove(p)\\n else:\\n points.add(p)\\n\\n # 判断面积是否相同\\n expectedArea = (X2 - X1) * (Y2 - Y1)\\n if actualArea != expectedArea:\\n return False\\n # 判断最终留下的顶点个数是否为 4\\n if len(points) != 4:\\n return False\\n # 判断留下的 4 个顶点是否是完美矩形的顶点\\n if not str(X1) + \\\",\\\" + str(Y1) in points: return False\\n if not str(X1) + \\\",\\\" + str(Y2) in points: return False\\n if not str(X2) + \\\",\\\" + str(Y1) in points: return False\\n if not str(X2) + \\\",\\\" + str(Y2) in points: return False\\n # 面积和顶点都对应，说明矩形符合题意\\n return True\",\n \"runtime\": \"364\"\n },\n {\n \"code\": \"from collections import defaultdict \\nclass Solution:\\n # Time: O()\\n # Space: O(), where n = len(rectangles)\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n n = len(rectangles)\\n v, h = [], []\\n tot_area = 0\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n \\n points = set()\\n for x1, y1, x2, y2 in rectangles:\\n v.append([x1, 0])\\n v.append([x2, 1])\\n h.append([y1, 0])\\n h.append([y2, 1])\\n tot_area += (y2-y1)*(x2-x1)\\n min_x = min(min_x, x1, x2)\\n min_y = min(min_y, y1, y2)\\n max_x = max(max_x, x1, x2)\\n max_y = max(max_y, y1, y2)\\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for p in pts:\\n if p in points:\\n points.remove(p)\\n else:\\n points.add(p)\\n\\n if tot_area != (max_y-min_y)*(max_x-min_x):\\n return 0\\n\\n if len(points) != 4: \\n return False\\n \\n v.sort(), h.sort()\\n count = 0\\n for x, type_ in v[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0\\n count = 0\\n for x, type_ in h[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0 \\n \\n if (min_x, min_y) not in points:\\n return 0\\n if (min_x, max_y) not in points:\\n return 0\\n if (max_x, min_y) not in points:\\n return 0\\n if (max_x, max_y) not in points:\\n return 0 \\n\\n return 1 \\n\",\n \"runtime\": \"375\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n minX1, minY1 = 10000000, 100000\\n maxX2, maxY2 = -minX1, -minY1\\n totalArea = 0\\n st = set()\\n for x,y,a,b in rectangles:\\n tup = (x,y)\\n if tup in st: return False\\n st.add(tup)\\n minX1 = min(minX1,x)\\n minY1 = min(minY1,y)\\n maxX2 = max(maxX2,a)\\n maxY2 = max(maxY2,b)\\n totalArea += (a-x) * (b-y)\\n if totalArea != (maxX2 - minX1) * (maxY2 - minY1):\\n return False\\n dp = [0 for i in range(maxX2 - minX1 + 5)]\\n dp2 = [0 for i in range(maxY2 - minY1 + 5)]\\n for x,y,a,b in rectangles:\\n height = b-y\\n dp[x-minX1] += height\\n dp[a-minX1] -= height\\n # print(f\\\"{x} to {a}, height {b-y}\\\")\\n # print(dp)\\n\\n width = a-x\\n dp2[y-minY1] += width\\n dp2[b-minY1] -= width\\n \\n if dp[0] != maxY2 - minY1: return False\\n if dp2[0] != maxX2 - minX1: return False \\n \\n for i in range(minX1+1, maxX2+1):\\n dp[i-minX1] += dp[i-minX1-1]\\n for i in range(minY1+1, maxY2+1):\\n dp2[i-minY1] += dp2[i-minY1-1]\\n for i in range(minX1, maxX2):\\n if dp[i-minX1] != maxY2 - minY1: return False\\n # print(i-minX1, dp[i-minX1])\\n for i in range(minY1, maxY2):\\n if dp2[i-minY1] != maxX2 - minX1: return False\\n if dp[maxX2 - minX1] != 0: return False\\n if dp2[maxY2 - minY1] != 0: return False\\n print(dp)\\n print(dp2)\\n return True\\n \",\n \"runtime\": \"394\"\n },\n {\n \"code\": \"class Solution:\\n '''\\n simple brute, we construct y matrix used, then we traverse the rectangle and extend the y\\n '''\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n ycoordinates = set()\\n for rec in rectangles:\\n ycoordinates.add(rec[1])\\n ycoordinates.add(rec[3])\\n rectangles.sort(key=lambda x: (x[0], x[2])) # we sort by x coordinates, and rectangles[0][0] will be basedline of x axis\\n ycoordinates = list(ycoordinates)\\n ycoordinates.sort()\\n ycoordinatesmap = {}\\n for i, y in enumerate(ycoordinates):\\n ycoordinatesmap[y] = i\\n\\n xbase = rectangles[0][0]\\n # each curx length need consider in the same coordinate, can have duplicate when two rectangle nearby\\n # denote (xfrom, xto, optional btm or top xfrom to allow duplicate)\\n curxlengths = [(xbase, xbase, None, None) for _ in range(0, len(ycoordinates))]\\n for rec in rectangles:\\n ystart = ycoordinatesmap[rec[1]]\\n yend = ycoordinatesmap[rec[3]]\\n xfrom, xto = rec[0], rec[2]\\n\\n for xidx in range(ystart, yend+1):\\n curxlen = curxlengths[xidx]\\n if curxlen[1] != xfrom and curxlen[3] == None:\\n return False\\n elif curxlen[1] != xfrom and curxlen[3] != None:\\n if curxlen[3] == xfrom:\\n if xto == curxlen[1]:\\n curxlengths[xidx] = (curxlen[0], xto, None, None)\\n else:\\n curxlengths[xidx] = (curxlen[0], max(curxlen[1], xto), curxlen[0], min(curxlen[1], xto))\\n continue\\n else:\\n return False\\n # if they are toppest and bottomest of yaxis, cannot double use, else at top and bottom of smaller rectangle\\n # below here is if is 2nd and 3rd is None\\n if (xidx == ystart or xidx == yend) and xidx != 0 and xidx != len(curxlengths) - 1:\\n curxlengths[xidx] = (curxlen[0], xto, curxlen[0], curxlen[1])\\n else:\\n curxlengths[xidx] = (curxlen[0], xto, None, None)\\n xto = curxlengths[0][1]\\n for x in range(1, len(curxlengths)):\\n if curxlengths[x][1] != xto or curxlengths[x][3] is not None:\\n return False\\n return True\\n\\n\\n \\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"1486\"\n },\n {\n \"code\": \"class Solution:\\n def get_y_area(self, active_intervals):\\n if not active_intervals: return (-1, -1)\\n active_intervals.sort()\\n # print(\\\"active_intervals\\\", active_intervals)\\n for i in range(1, len(active_intervals)):\\n y_start, y_end = active_intervals[i]\\n if y_start != active_intervals[i-1][1]:\\n return (-1, -1)\\n return (active_intervals[0][0], active_intervals[-1][1])\\n\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n events = []\\n START, END = 1, 0\\n for x1,y1,x2,y2 in rectangles:\\n events.append((x1, START, y1, y2))\\n events.append((x2, END, y1, y2))\\n \\n events.sort()\\n # print(events)\\n x_last = events[0][0]\\n cur_intervals = []\\n res_rectangles = []\\n for x, typ, y_start, y_end in events:\\n # add event\\n # print(\\\"x\\\", x, \\\"typ\\\", typ, \\\"y_start\\\", y_start, \\\"y_end\\\", y_end)\\n if x != x_last:\\n y1, y2 = self.get_y_area(cur_intervals)\\n if (y1,y2) == (-1,-1): \\n return False # overlapping found\\n res_rectangles.append((x_last, y1, x, y2))\\n x_last = x\\n if typ == START:\\n cur_intervals.append((y_start, y_end))\\n else:\\n cur_intervals.remove((y_start, y_end))\\n \\n print(res_rectangles)\\n for i in range(1, len(res_rectangles)):\\n last_x1, last_y1, last_x2, last_y2 = res_rectangles[i-1]\\n x1, y1, x2, y2 = res_rectangles[i]\\n if last_x2 != x1 or last_y1 != y1 or last_y2 != y2:\\n return False\\n return True\\n\\n \",\n \"runtime\": \"1569\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n X = sorted(set([x for x1, y1, x2, y2 in rectangles for x in [x1, x2]]))\\n x_i = { x: i for i, x in enumerate(X) }\\n x_min, x_max = X[0], X[-1]\\n\\n items = []\\n for x1, y1, x2, y2 in rectangles:\\n items.append((y1, x1, x2, 1))\\n items.append((y2, x1, x2, -1))\\n items.sort()\\n items.append((items[-1][0] , x_min, x_max, 1))\\n items.append((items[-1][0] + 1, x_min, x_max, -1))\\n\\n y_cur = items[0][0]\\n count = [0] * len(X)\\n for y, x1, x2, c in items:\\n if y > y_cur and y_cur != -1:\\n for i in range(len(count) - 1): \\n if count[i] != 1: return False\\n\\n y_cur = y\\n for i in range(x_i[x1], x_i[x2]): count[i] += c\\n return True\\n \",\n \"runtime\": \"1743\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n import numpy as np\\n s0 = set()\\n for i in rectangles:\\n if tuple(i) in s0:\\n return False\\n s0.add(tuple(i))\\n s0=set()\\n r = np.array(rectangles)+1\\n i1 = np.array([1,3])\\n i2 = np.array([0,2])\\n u0 = np.unique(np.append(r[:,i2],r[:,i2]+1))\\n u0_min,u0_max = np.min(r[:,i2]),np.max(r[:,i2])\\n u1 = np.unique(np.append(r[:,i1],r[:,i1]+1))\\n u1_min,u1_max = np.min(r[:,i1]),np.max(r[:,i1])\\n # u0 = np.insert(u0,0,0)\\n # u1 = np.insert(u1,0,0)\\n\\n # print(u0,u1)\\n d0=dict()\\n d1 = dict()\\n for i,v in enumerate(u0):\\n d0[v] = i\\n for i,v in enumerate(u1):\\n d1[v] = i\\n a = np.zeros((len(d1)+1,len(d0)+1),dtype = \\\"uint32\\\")\\n # print(d0,d1)\\n for i in r:\\n print(i)\\n a[d1[i[1]]:d1[i[3]],d0[i[0]]:d0[i[2]]] +=1\\n # print(a,\\\"a\\\")\\n u2 = np.unique(a)\\n if u2.size>2:\\n return False\\n # print(d0)\\n # print(d1)\\n \\n a=a[d1[u1_min]:d1[u1_max],d0[u0_min]:d0[u0_max]]\\n # print(a,\\\"a2\\\")\\n return np.unique(a).size==1\\n \\n\",\n \"runtime\": \"1831\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n import numpy as np\\n s0 = set()\\n for i in rectangles:\\n if tuple(i) in s0:\\n return False\\n s0.add(tuple(i))\\n s0=set()\\n r = np.array(rectangles)+1\\n i1 = np.array([1,3])\\n i2 = np.array([0,2])\\n u0 = np.unique(np.append(r[:,i2],r[:,i2]+1))\\n u0_min,u0_max = np.min(u0),np.max(u0)-1\\n u1 = np.unique(np.append(r[:,i1],r[:,i1]+1))\\n u1_min,u1_max = np.min(u1),np.max(u1)-1\\n # u0 = np.insert(u0,0,0)\\n # u1 = np.insert(u1,0,0)\\n\\n # print(u0,u1)\\n d0=dict()\\n d1 = dict()\\n for i,v in enumerate(u0):\\n d0[v] = i\\n for i,v in enumerate(u1):\\n d1[v] = i\\n a = np.zeros((len(d1)+1,len(d0)+1),dtype = \\\"uint32\\\")\\n # print(d0,d1)\\n for i in r:\\n print(i)\\n a[d1[i[1]]:d1[i[3]],d0[i[0]]:d0[i[2]]] +=1\\n # print(a,\\\"a\\\")\\n u2 = np.unique(a)\\n if u2.size>2:\\n return False\\n # print(d0)\\n # print(d1)\\n \\n a=a[d1[u1_min]:d1[u1_max],d0[u0_min]:d0[u0_max]]\\n # print(a,\\\"a2\\\")\\n return np.unique(a).size==1\\n \\n\",\n \"runtime\": \"1868\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n line = []\\n cur = 0\\n i = rectangles[0][0]\\n globalRange = None\\n while True:\\n while cur < len(rectangles) and rectangles[cur][0] == i:\\n line.append(rectangles[cur])\\n cur += 1\\n curRange = self.sweep(line)\\n # print(curRange)\\n # print(line)\\n if not globalRange:\\n globalRange = curRange\\n if globalRange != curRange or not curRange:\\n return False\\n i += 1\\n line = [rectangle for rectangle in line if rectangle[2] != i]\\n if cur == len(rectangles):\\n break\\n return True\\n \\n def sweep(self, line):\\n if not line:\\n return None\\n line.sort(key=lambda x: x[1])\\n bottom = line[0][1]\\n top = line[0][3]\\n for rectangle in line[1:]:\\n if rectangle[1] != top:\\n return None\\n top = rectangle[3]\\n return (bottom, top)\\n\",\n \"runtime\": \"2381\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n line = []\\n cur = 0\\n i = rectangles[0][0]\\n globalRange = None\\n while True:\\n while cur < len(rectangles) and rectangles[cur][0] == i:\\n line.append(rectangles[cur])\\n cur += 1\\n curRange = self.sweep(line)\\n # print(curRange)\\n # print(line)\\n if not globalRange:\\n globalRange = curRange\\n if globalRange != curRange or not curRange:\\n return False\\n i += 1\\n line = [rectangle for rectangle in line if rectangle[2] != i]\\n if cur == len(rectangles):\\n break\\n return True\\n \\n def sweep(self, line):\\n if not line:\\n return None\\n line.sort(key=lambda x: x[1])\\n bottom = line[0][1]\\n top = line[0][3]\\n for rectangle in line[1:]:\\n if rectangle[1] != top:\\n return None\\n top = rectangle[3]\\n return (bottom, top)\\n\",\n \"runtime\": \"2393\"\n },\n {\n \"code\": \"class Solution:\\n\\n \\n\\n def no_overlap(self, rect, corners):\\n coord = [[[x[0],x[1]],[x[2],x[3]],[x[2],x[1]],[x[0],x[3]]] for x in rect]\\n coord = sum(coord, [])\\n \\n coord = list(map(lambda x: str(x), coord))\\n coord_counter = collections.Counter(coord)\\n # print(coord_counter,corners)\\n for item in coord_counter:\\n if coord_counter[item]%2!=0:\\n if not (coord_counter[item]==1 and str(item) in corners):\\n return False\\n if item in corners and coord_counter[item]!=1:\\n return False\\n return True\\n\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n minX = float('inf')\\n maxX = float('-inf')\\n minY = float('inf')\\n maxY = float('-inf')\\n\\n total_area = 0\\n stackX = []\\n stackY = [] \\n for xyab in rectangles:\\n if minX > xyab[0]:\\n minX = xyab[0]\\n if minY > xyab[1]:\\n minY = xyab[1]\\n if maxX < xyab[2]:\\n maxX = xyab[2]\\n if maxY < xyab[3]:\\n maxY = xyab[3]\\n area = (xyab[3] - xyab[1])*(xyab[2] - xyab[0])\\n # print(xyab, area)\\n total_area+=area\\n\\n # print(total_area, (maxX-minX)*(maxY-minY))\\n corners = [[minX,minY],[minX,maxY],[maxX,minY],[maxX,maxY]]\\n corners = [str(x) for x in corners]\\n if total_area== (maxX-minX)*(maxY-minY) and self.no_overlap(rectangles, corners):\\n return True\\n else:\\n return False\\n \",\n \"runtime\": \"2427\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n line = []\\n cur = 0\\n i = rectangles[0][0]\\n globalRange = None\\n while True:\\n while cur < len(rectangles) and rectangles[cur][0] == i:\\n line.append(rectangles[cur])\\n cur += 1\\n curRange = self.sweep(line)\\n # print(curRange)\\n # print(line)\\n if not globalRange:\\n globalRange = curRange\\n if globalRange != curRange or not curRange:\\n return False\\n i += 1\\n for j in reversed(range(len(line))):\\n if line[j][2] == i:\\n line.pop(j)\\n if cur == len(rectangles):\\n break\\n return True\\n \\n def sweep(self, line):\\n if not line:\\n return None\\n line.sort(key=lambda x: x[1])\\n bottom = line[0][1]\\n top = line[0][3]\\n for rectangle in line[1:]:\\n if rectangle[1] != top:\\n return None\\n top = rectangle[3]\\n return (bottom, top)\\n\",\n \"runtime\": \"2460\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n minx, miny, maxx, maxy = float('inf'), float('inf'), float('-inf'), float('-inf')\\n for x1, y1, x2, y2 in rectangles:\\n minx, miny = min(minx, x1), min(miny, y1)\\n maxx, maxy = max(maxx, x2), max(maxy, y2)\\n dp = np.array([minx for _ in range(maxy - miny,)])\\n for x1, y1, x2, y2 in sorted(rectangles):\\n # check if any gap\\n for y in range(y1 - miny, y2 - miny):\\n if dp[y] != x1:\\n return False\\n else:\\n dp[y] = x2\\n return np.all(dp == maxx)\\n \",\n \"runtime\": \"2784\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n minx, miny, maxx, maxy = float('inf'), float('inf'), float('-inf'), float('-inf')\\n for x1, y1, x2, y2 in rectangles:\\n minx, miny = min(minx, x1), min(miny, y1)\\n maxx, maxy = max(maxx, x2), max(maxy, y2)\\n dp = np.array([minx for _ in range(maxy - miny,)])\\n for x1, y1, x2, y2 in sorted(rectangles):\\n # check if any gap or overlap\\n for y in range(y1 - miny, y2 - miny):\\n if dp[y] != x1:\\n return False\\n else:\\n dp[y] = x2\\n return np.all(dp == maxx)\",\n \"runtime\": \"3054\"\n },\n {\n \"code\": \"import numpy as np\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n minx, miny, maxx, maxy = float('inf'), float('inf'), float('-inf'), float('-inf')\\n for x1, y1, x2, y2 in rectangles:\\n minx, miny = min(minx, x1), min(miny, y1)\\n maxx, maxy = max(maxx, x2), max(maxy, y2)\\n dp = np.array([minx for _ in range(maxy - miny,)])\\n for x1, y1, x2, y2 in sorted(rectangles):\\n # check if any gap or overlap\\n for y in range(y1 - miny, y2 - miny):\\n if dp[y] != x1:\\n return False\\n else:\\n dp[y] = x2\\n return np.all(dp == maxx)\\n \",\n \"runtime\": \"3123\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n rectangles.sort(key=lambda x: (-x[3], x[0]))\\n rectangles = deque(rectangles)\\n \\n def overlaps(rect1, rect2):\\n overlaps_x = min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]) > 0\\n overlaps_y = min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]) > 0\\n return overlaps_x and overlaps_y\\n \\n x_left = min(r[0] for r in rectangles)\\n x_right = max(r[2] for r in rectangles)\\n \\n \\n def merge_levels(a, b, level_y):\\n i = 0\\n j = 0\\n merged = deque()\\n x = x_left\\n\\n while i < len(a) or j < len(b):\\n cur_a = None\\n if i < len(a):\\n cur_a = a[i]\\n if cur_a[1] >= level_y:\\n i += 1\\n continue\\n cur_b = None\\n if j < len(b):\\n cur_b = b[j]\\n if cur_b[1] >= level_y:\\n j += 1\\n continue\\n\\n if cur_a is not None and cur_a[0] == x:\\n x = cur_a[2]\\n merged.append(cur_a)\\n i += 1\\n elif cur_b is not None and cur_b[0] == x:\\n x = cur_b[2]\\n merged.append(cur_b)\\n j += 1\\n else:\\n return False\\n \\n if x != x_right:\\n return False\\n \\n return merged\\n\\n cur_level = deque()\\n while rectangles:\\n \\n next_level = deque()\\n next_level_y = rectangles[0][3]\\n \\n # check within next lvl\\n while rectangles and rectangles[0][3] == next_level_y:\\n if next_level:\\n if not overlaps(rectangles[0], next_level[-1]):\\n next_level.append(rectangles.popleft())\\n else:\\n return False\\n else:\\n next_level.append(rectangles.popleft())\\n \\n \\n cur_level = merge_levels(cur_level, next_level, next_level_y)\\n\\n if not cur_level:\\n return False\\n \\n return True\\n \\n \\n \",\n \"runtime\": \"3132\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":80,"string":"80"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\n area = 0\n corners = set()\n\n for x, y, a, b in rectangles:\n left = min(left, x)\n bot = min(bot, y)\n right = max(right, a)\n top = max(top, b)\n\n area += (a - x) * (b - y)\n\n corners ^= {(x,y), (x,b), (a,y), (a,b)}\n\n expected_area = (right - left) * (top - bot)\n\n if area != expected_area or len(corners) != 4:\n return \"false\"\n\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\n return \"false\"\n\n return \"true\"\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().isRectangleCover(nums)).replace(\" \", \"\"), file=f)\nexit(0)","memory":"20100"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\n area = 0\n corners = set()\n def checkCorner(corner):\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n for x, y, a, b in rectangles:\n left = min(left, x)\n bot = min(bot, y)\n right = max(right, a)\n top = max(top, b)\n\n area += (a - x) * (b - y)\n\n checkCorner((x, y))\n checkCorner((x, b))\n checkCorner((a, y))\n checkCorner((a, b))\n\n expected_area = (right - left) * (top - bot)\n\n if area != expected_area or len(corners) != 4:\n return \"false\"\n\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\n return \"false\"\n\n return \"true\"\n\nwith open(\"user.out\", \"w\") as f:\n inputs = map(loads, stdin)\n for nums in inputs:\n print(str(Solution().isRectangleCover(nums)).replace(\" \", \"\"), file=f)\nexit(0)","memory":"20200"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n line = []\n cur = 0\n i = rectangles[0][0]\n globalRange = None\n while True:\n while cur < len(rectangles) and rectangles[cur][0] == i:\n line.append(rectangles[cur])\n cur += 1\n curRange = self.sweep(line)\n # print(curRange)\n # print(line)\n if not globalRange:\n globalRange = curRange\n if globalRange != curRange or not curRange:\n return False\n i += 1\n line = [rectangle for rectangle in line if rectangle[2] != i]\n if cur == len(rectangles):\n break\n return True\n \n def sweep(self, line):\n if not line:\n return None\n line.sort(key=lambda x: x[1])\n bottom = line[0][1]\n top = line[0][3]\n for rectangle in line[1:]:\n if rectangle[1] != top:\n return None\n top = rectangle[3]\n return (bottom, top)\n","memory":"21500"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n line = []\n cur = 0\n i = rectangles[0][0]\n globalRange = None\n while True:\n while cur < len(rectangles) and rectangles[cur][0] == i:\n line.append(rectangles[cur])\n cur += 1\n curRange = self.sweep(line)\n # print(curRange)\n # print(line)\n if not globalRange:\n globalRange = curRange\n if globalRange != curRange or not curRange:\n return False\n i += 1\n line = [rectangle for rectangle in line if rectangle[2] != i]\n if cur == len(rectangles):\n break\n return True\n \n def sweep(self, line):\n if not line:\n return None\n line.sort(key=lambda x: x[1])\n bottom = line[0][1]\n top = line[0][3]\n for rectangle in line[1:]:\n if rectangle[1] != top:\n return None\n top = rectangle[3]\n return (bottom, top)\n","memory":"21500"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n x_min, y_min, x_max, y_max = rectangles[0]\n sum_area = 0\n for rect in rectangles:\n x, y, a, b = rect\n if x < x_min:\n x_min = x\n if y < y_min:\n y_min = y\n if a > x_max:\n x_max = a\n if b > y_max:\n y_max = b\n sum_area += (a - x) * (b - y)\n \n if (x_max - x_min) * (y_max - y_min) != sum_area:\n return False\n \n rectangles.sort(key=lambda x: x[2])\n while rectangles:\n x, y, a, b = rectangles.pop()\n for xi, yi, ai, bi in rectangles:\n if ai < x or b < yi or bi < y:\n continue\n if (ai - max(x, xi)) > 0 and (min(b, bi) - max(y, yi)) > 0:\n return False\n return True\n","memory":"21700"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n line = []\n cur = 0\n i = rectangles[0][0]\n globalRange = None\n while True:\n while cur < len(rectangles) and rectangles[cur][0] == i:\n line.append(rectangles[cur])\n cur += 1\n curRange = self.sweep(line)\n # print(curRange)\n # print(line)\n if not globalRange:\n globalRange = curRange\n if globalRange != curRange or not curRange:\n return False\n i += 1\n for j in reversed(range(len(line))):\n if line[j][2] == i:\n line.pop(j)\n if cur == len(rectangles):\n break\n return True\n \n def sweep(self, line):\n if not line:\n return None\n line.sort(key=lambda x: x[1])\n bottom = line[0][1]\n top = line[0][3]\n for rectangle in line[1:]:\n if rectangle[1] != top:\n return None\n top = rectangle[3]\n return (bottom, top)\n","memory":"21800"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n class Interval:\n def __init__(self):\n self.startDict = {}\n self.endDict = {}\n \n def add(self, start, end):\n if start in self.startDict or end in self.endDict:\n return False\n if start in self.endDict:\n prevStart = self.endDict[start]\n del self.startDict[prevStart]\n del self.endDict[start]\n return self.add(prevStart, end)\n if end in self.startDict:\n nextEnd = self.startDict[end]\n del self.endDict[nextEnd]\n del self.startDict[end]\n return self.add(start, nextEnd)\n else:\n self.startDict[start] = end\n self.endDict[end] = start\n return True\n \n def verify(self, begin, end):\n return self.startDict == {begin: end} and self.endDict == {end: begin}\n \n rectangles.sort(reverse = True)\n left, bot, right, top = float('inf'), float('inf'), float('-inf'), float('-inf'),\n for l, b, r, t in rectangles:\n left, bot, right, top = min(l, left), min(b, bot), max(r, right), max(t, top)\n\n sweep = left\n rectExpr = collections.defaultdict(dict)\n while sweep < right:\n currInterval = Interval()\n if sweep in rectExpr: del rectExpr[sweep]\n for key in rectExpr:\n for b, t in rectExpr[key]:\n succ = currInterval.add(b, t)\n if not succ: return False\n while rectangles and rectangles[-1][0] == sweep:\n l, b, r, t = rectangles.pop()\n if r not in rectExpr: rectExpr[r] = []\n rectExpr[r].append((b, t))\n succ = currInterval.add(b, t)\n if not succ: return False\n if not currInterval.verify(bot, top): return False\n sweep += 1\n return True\n\n ","memory":"21800"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # Helper function to calculate area of a rectangle\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Initialize corners of the bounding rectangle\n min_x, min_y = float('inf'), float('inf')\n max_x, max_y = float('-inf'), float('-inf')\n \n # Set to store all corner points\n corners = set()\n \n # Total area of all smaller rectangles\n total_area = 0\n \n for rect in rectangles:\n x1, y1, x2, y2 = rect\n \n # Update bounding rectangle corners\n min_x = min(min_x, x1)\n min_y = min(min_y, y1)\n max_x = max(max_x, x2)\n max_y = max(max_y, y2)\n \n # Add corners to the set\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\n \n # Add area of current rectangle to total area\n total_area += area(rect)\n \n # Check if only 4 corners are left and they are the corners of the bounding rectangle\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\n if corners != expected_corners:\n return False\n \n # Check if the total area matches the area of the bounding rectangle\n bounding_area = area([min_x, min_y, max_x, max_y])\n return total_area == bounding_area\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","memory":"21900"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # Initialize boundaries\n left = bottom = float('inf')\n right = top = float('-inf')\n \n # Calculate the boundaries of the large rectangle\n for rectangle in rectangles:\n x, y, a, b = rectangle\n left = min(left, x)\n bottom = min(bottom, y)\n right = max(right, a)\n top = max(top, b) # Corrected this line\n\n # Calculate the expected area of the large rectangle\n expectedArea = (right - left) * (top - bottom)\n\n # Calculate the actual total area of all small rectangles\n actualArea = 0\n for rectangle in rectangles:\n x, y, a, b = rectangle\n actualArea += (a - x) * (b - y)\n \n # Check if the total area matches and if there are no overlaps\n if expectedArea != actualArea:\n return False\n\n # To ensure no overlaps, use a set to track the vertices\n vertices = set()\n \n # Function to toggle vertex in the set\n def toggle_vertex(x, y):\n if (x, y) in vertices:\n vertices.remove((x, y))\n else:\n vertices.add((x, y))\n\n # Add or remove corners of each rectangle\n for rectangle in rectangles:\n x, y, a, b = rectangle\n toggle_vertex(x, y)\n toggle_vertex(x, b)\n toggle_vertex(a, y)\n toggle_vertex(a, b)\n\n # Check that the final set of vertices contains exactly the four corners of the large rectangle\n if len(vertices) != 4 or (left, bottom) not in vertices or (left, top) not in vertices or (right, bottom) not in vertices or (right, top) not in vertices:\n return False\n \n return True","memory":"22000"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n border_points = set()\n for x, y, u, v in rectangles:\n area += (u - x) * (v - y)\n border_points ^= {(x, y), (x, v), (u, y), (u, v)}\n if len(border_points) != 4:\n return False\n x, y, u, v = (\n min(x for x, _ in border_points),\n min(y for _, y in border_points),\n max(x for x, _ in border_points),\n max(y for _, y in border_points)\n )\n return area == (u - x) * (v - y)","memory":"22100"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\n area = 0\n x1 = math.inf\n y1 = math.inf\n x2 = -math.inf\n y2 = -math.inf\n corners: set[tuple[int, int]] = set()\n\n for x, y, a, b in rectangles:\n area += (a - x) * (b - y)\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, a)\n y2 = max(y2, b)\n\n # the four points of the current rectangle\n for point in [(x, y), (x, b), (a, y), (a, b)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n if len(corners) != 4:\n return False\n if ((x1, y1) not in corners or\n (x1, y2) not in corners or\n (x2, y1) not in corners or\n (x2, y2) not in corners):\n return False\n return area == (x2 - x1) * (y2 - y1)","memory":"22200"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\n area = 0\n x1 = math.inf\n y1 = math.inf\n x2 = -math.inf\n y2 = -math.inf\n corners: set[tuple[int, int]] = set()\n\n for x, y, a, b in rectangles:\n area += (a - x) * (b - y)\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, a)\n y2 = max(y2, b)\n\n # the four points of the current rectangle\n for point in [(x, y), (x, b), (a, y), (a, b)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n if len(corners) != 4:\n return False\n if ((x1, y1) not in corners or\n (x1, y2) not in corners or\n (x2, y1) not in corners or\n (x2, y2) not in corners):\n return False\n return area == (x2 - x1) * (y2 - y1)","memory":"22300"},{"code":"class Solution(object):\n def isRectangleCover(self, rectangles):\n \"\"\"\n :type rectangles: List[List[int]]\n :rtype: bool\n \"\"\"\n hs = set()\n area = 0\n for rec in rectangles:\n top_left = (rec[0], rec[1])\n top_right = (rec[0], rec[3])\n bottom_left = (rec[2], rec[1])\n bottom_right = (rec[2], rec[3])\n area += (rec[2] - rec[0]) * (rec[3] - rec[1])\n for i in [top_left, top_right, bottom_left, bottom_right]:\n if i not in hs:\n hs.add(i)\n else:\n hs.remove(i)\n if len(hs) != 4:\n return False\n hs = sorted(hs)\n first = hs.pop(0)\n last = hs.pop()\n return area == (last[0] - first[0]) * (last[1] - first[1])","memory":"22300"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Helper function to get the area of a rectangle\n def getArea(rect):\n x1, y1, x2, y2 = rect\n return (x2 - x1) * (y2 - y1)\n \n # Initialize variables to track the bounding box and corner points\n area = 0\n corners = set()\n \n # Iterate through each rectangle\n for rect in rectangles:\n x1, y1, x2, y2 = rect\n \n # Add the area of the current rectangle to the total area\n area += getArea(rect)\n \n # Define the corners of the current rectangle\n corners_rect = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n \n # Update the corner points set\n for corner in corners_rect:\n if corner in corners:\n corners.remove(corner)\n else:\n corners.add(corner)\n \n # If the number of remaining corners is not 4, return False\n if len(corners) != 4:\n return False\n \n # Calculate the bounding box of the union of all rectangles\n x1, y1 = min(corners, key=lambda x: x[0])[0], min(corners, key=lambda x: x[1])[1]\n x2, y2 = max(corners, key=lambda x: x[0])[0], max(corners, key=lambda x: x[1])[1]\n \n # Check if the area of the bounding box is equal to the total area of the rectangles\n return area == getArea([x1, y1, x2, y2])\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","memory":"22400"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n # Define helper function to calculate area\n def area(rectangle):\n x1, y1, x2, y2 = rectangle\n return (x2 - x1) * (y2 - y1)\n\n # Calculate the area of each smaller rectangle and sum them up\n total_area = sum(area(rect) for rect in rectangles)\n\n # Find the bounding rectangle (min_x, min_y, max_x, max_y)\n X1, Y1 = min(x for x, y, _, _ in rectangles), min(y for _, y, _, _ in rectangles)\n X2, Y2 = max(x for _, _, x, _ in rectangles), max(y for _, _, _, y in rectangles)\n\n # Calculate the area of the bounding rectangle\n bounding_area = (X2 - X1) * (Y2 - Y1)\n\n # If the areas are not equal, return False\n if total_area != bounding_area:\n return False\n\n # Use a set to keep track of corners\n corners = set()\n\n # Iterate through each rectangle and update the set of corners\n for x1, y1, x2, y2 in rectangles:\n for point in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\n if point in corners:\n corners.remove(point)\n else:\n corners.add(point)\n\n # Check if only four corners are left and they are the corners of the bounding rectangle\n if len(corners) != 4 or corners != {(X1, Y1), (X1, Y2), (X2, Y1), (X2, Y2)}:\n return False\n\n return True\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","memory":"22400"},{"code":"from collections import defaultdict\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles = sorted([tuple(rect) for rect in rectangles], key=lambda x: x[2])\n x_min, y_min, x_max, y_max = rectangles[-1]\n sum_area = 0\n for rect in rectangles:\n x, y, a, b = rect\n if x < x_min:\n x_min = x\n if y < y_min:\n y_min = y\n # if a > x_max:\n # x_max = a\n if b > y_max:\n y_max = b\n sum_area += (a - x) * (b - y)\n \n if (x_max - x_min) * (y_max - y_min) != sum_area:\n return False\n\n # rect_bins = defaultdict(set)\n # for rect in rectangles:\n # rect_bins[rect[0]].add(tuple(rect))\n \n # for rect_bin in rect_bins.values():\n\n\n # rectangles.sort(key=lambda x: x[2])\n while rectangles:\n x, y, a, b = rectangles.pop()\n for xi, yi, ai, bi in rectangles:\n if ai < x or b < yi or bi < y:\n continue\n if (ai - max(x, xi)) > 0 and (min(b, bi) - max(y, yi)) > 0:\n return False\n return True\n","memory":"22500"},{"code":"from collections import defaultdict\n\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles = [tuple(rect) for rect in rectangles]\n x_min, y_min, x_max, y_max = rectangles[0]\n sum_area = 0\n for rect in rectangles:\n x, y, a, b = rect\n if x < x_min:\n x_min = x\n if y < y_min:\n y_min = y\n if a > x_max:\n x_max = a\n if b > y_max:\n y_max = b\n sum_area += (a - x) * (b - y)\n \n if (x_max - x_min) * (y_max - y_min) != sum_area:\n return False\n\n # rect_bins = defaultdict(set)\n # for rect in rectangles:\n # rect_bins[rect[0]].add(tuple(rect))\n \n # for rect_bin in rect_bins.values():\n\n\n rectangles.sort(key=lambda x: x[2])\n while rectangles:\n x, y, a, b = rectangles.pop()\n for xi, yi, ai, bi in rectangles:\n if ai < x or b < yi or bi < y:\n continue\n if (ai - max(x, xi)) > 0 and (min(b, bi) - max(y, yi)) > 0:\n return False\n return True\n","memory":"22600"},{"code":"# class Solution:\n# def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n# rectangles.sort(key=lambda x: (-x[3], x[0]))\n# rectangles = deque(rectangles)\n \n# def overlaps(rect1, rect2):\n# overlaps_x = min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]) > 0\n# overlaps_y = min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]) > 0\n# return overlaps_x and overlaps_y\n \n# x_left = min(r[0] for r in rectangles)\n# x_right = max(r[2] for r in rectangles)\n \n \n# def merge_levels(a, b, level_y):\n# i = 0\n# j = 0\n# merged = deque()\n# x = x_left\n\n# while i < len(a) or j < len(b):\n# cur_a = None\n# if i < len(a):\n# cur_a = a[i]\n# if cur_a[1] >= level_y:\n# i += 1\n# continue\n# cur_b = None\n# if j < len(b):\n# cur_b = b[j]\n# if cur_b[1] >= level_y:\n# j += 1\n# continue\n\n# if cur_a is not None and cur_a[0] == x:\n# x = cur_a[2]\n# merged.append(cur_a)\n# i += 1\n# elif cur_b is not None and cur_b[0] == x:\n# x = cur_b[2]\n# merged.append(cur_b)\n# j += 1\n# else:\n# return False\n \n# if x != x_right:\n# return False\n \n# return merged\n\n# cur_level = deque()\n# while rectangles:\n \n# next_level = deque()\n# next_level_y = rectangles[0][3]\n \n# # check within next lvl\n# while rectangles and rectangles[0][3] == next_level_y:\n# if next_level:\n# if not overlaps(rectangles[0], next_level[-1]):\n# next_level.append(rectangles.popleft())\n# else:\n# return False\n# else:\n# next_level.append(rectangles.popleft())\n \n \n# cur_level = merge_levels(cur_level, next_level, next_level_y)\n\n# if not cur_level:\n# return False\n \n# return True\n \nclass Solution(object):\n def isRectangleCover(self, rectangles):\n def recordCorner(point):\n if point in corners:\n corners[point] += 1\n else:\n corners[point] = 1\n\n corners = {} # record all corners \n L, B, R, T, area = float('inf'), float('inf'), -float('inf'), -float('inf'), 0\n\n for sub in rectangles:\n L, B, R, T = min(L, sub[0]), min(B, sub[1]), max(R, sub[2]), max(T, sub[3])\n ax, ay, bx, by = sub[:]\n area += (bx-ax)*(by-ay) # sum up the area of each sub-rectangle\n for px in [(ax, ay), (bx, by), (ax, by), (bx, ay)]: recordCorner(px)\n\n if area != (T-B)*(R-L): return False # check the area\n\n big_four = [(L,B),(R,T),(L,T),(R,B)]\n\n for bf in big_four: # check corners of big rectangle\n if bf not in corners or corners[bf] != 1:\n return False\n\n for key in corners: # check existing \"inner\" points\n if corners[key]%2 and key not in big_four:\n return False\n\n return True\n \nclass Solution(object):\n def isRectangleCover(self, rectangles):\n area = 0\n corners = set()\n a, c = lambda: (X - x) * (Y - y), lambda: {(x, y), (x, Y), (X, y), (X, Y)}\n for x, y, X, Y in rectangles:\n area += a()\n corners ^= c()\n x, y, X, Y = (f(z) for f, z in zip((min, min, max, max), zip(*rectangles)))\n return area == a() and corners == c()\n ","memory":"22900"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n events = []\n for x, y, a, b in rectangles:\n events.append((x, 1, y, b))\n events.append((a, 0, y, b))\n n = len(events)\n events.sort()\n xStart, xEnd = events[0][0], events[-1][0]\n i = 0\n xPrev, stackPrev = -1, []\n while i < n:\n xVal, etypeVal, _, _ = events[i]\n stack = []\n while i < n:\n x, etype, y0, y1 = events[i]\n if x != xVal or etype != etypeVal:\n break\n if stack and stack[-1][1] == y0:\n y0 = stack.pop()[0]\n stack.append((y0, y1))\n i += 1\n if etypeVal == 1:\n if xVal == xStart:\n if len(stack) != 1:\n return False\n elif xVal != xPrev or stack != stackPrev:\n return False\n else:\n xPrev, stackPrev = xVal, stack\n return True\n","memory":"23300"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n events = []\n for x, y, a, b in rectangles:\n events.append((x, 1, y, b))\n events.append((a, 0, y, b))\n n = len(events)\n events.sort()\n xStart, xEnd = events[0][0], events[-1][0]\n i = 0\n xPrev, stackPrev = -1, []\n while i < n:\n xVal, etypeVal, _, _ = events[i]\n stack = []\n while i < n:\n x, etype, y0, y1 = events[i]\n if x != xVal or etype != etypeVal:\n break\n if stack and stack[-1][1] == y0:\n y0 = stack.pop()[0]\n stack.append((y0, y1))\n i += 1\n print(stack, xVal, etypeVal)\n if etypeVal == 1:\n if xVal == xStart:\n if len(stack) != 1:\n return False\n elif xVal != xPrev or stack != stackPrev:\n return False\n else:\n xPrev, stackPrev = xVal, stack\n return True\n","memory":"23700"},{"code":"from collections import defaultdict \nclass Solution:\n # Time: O()\n # Space: O(), where n = len(rectangles)\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n n = len(rectangles)\n v, h = [], []\n tot_area = 0\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n \n points = set()\n for x1, y1, x2, y2 in rectangles:\n v.append([x1, 0])\n v.append([x2, 1])\n h.append([y1, 0])\n h.append([y2, 1])\n tot_area += (y2-y1)*(x2-x1)\n min_x = min(min_x, x1, x2)\n min_y = min(min_y, y1, y2)\n max_x = max(max_x, x1, x2)\n max_y = max(max_y, y1, y2)\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for p in pts:\n if p in points:\n points.remove(p)\n else:\n points.add(p)\n\n if tot_area != (max_y-min_y)*(max_x-min_x):\n return 0\n\n if len(points) != 4: \n return False\n \n v.sort(), h.sort()\n count = 0\n for x, type_ in v[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0\n count = 0\n for x, type_ in h[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0 \n \n if (min_x, min_y) not in points:\n return 0\n if (min_x, max_y) not in points:\n return 0\n if (max_x, min_y) not in points:\n return 0\n if (max_x, max_y) not in points:\n return 0 \n\n return 1 \n","memory":"23900"},{"code":"from collections import defaultdict \nclass Solution:\n # Time: O()\n # Space: O(), where n = len(rectangles)\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n n = len(rectangles)\n v, h = [], []\n tot_area = 0\n min_x = min_y = float('inf')\n max_x = max_y = float('-inf')\n \n points = set()\n for x1, y1, x2, y2 in rectangles:\n v.append([x1, 0])\n v.append([x2, 1])\n h.append([y1, 0])\n h.append([y2, 1])\n tot_area += (y2-y1)*(x2-x1)\n min_x = min(min_x, x1, x2)\n min_y = min(min_y, y1, y2)\n max_x = max(max_x, x1, x2)\n max_y = max(max_y, y1, y2)\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for p in pts:\n if p in points:\n points.remove(p)\n else:\n points.add(p)\n\n if tot_area != (max_y-min_y)*(max_x-min_x):\n return 0\n\n if len(points) != 4: \n return False\n \n v.sort(), h.sort()\n count = 0\n for x, type_ in v[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0\n count = 0\n for x, type_ in h[:-1]:\n count = (count+1) if type_ == 0 else (count-1)\n if not count:\n return 0 \n \n if (min_x, min_y) not in points:\n return 0\n if (min_x, max_y) not in points:\n return 0\n if (max_x, min_y) not in points:\n return 0\n if (max_x, max_y) not in points:\n return 0 \n\n return 1 \n","memory":"23900"},{"code":"class Solution:\n def get_y_area(self, active_intervals):\n if not active_intervals: return (-1, -1)\n active_intervals.sort()\n # print(\"active_intervals\", active_intervals)\n for i in range(1, len(active_intervals)):\n y_start, y_end = active_intervals[i]\n if y_start != active_intervals[i-1][1]:\n return (-1, -1)\n return (active_intervals[0][0], active_intervals[-1][1])\n\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n events = []\n START, END = 1, 0\n for x1,y1,x2,y2 in rectangles:\n events.append((x1, START, y1, y2))\n events.append((x2, END, y1, y2))\n \n events.sort()\n # print(events)\n x_last = events[0][0]\n cur_intervals = []\n res_rectangles = []\n for x, typ, y_start, y_end in events:\n # add event\n # print(\"x\", x, \"typ\", typ, \"y_start\", y_start, \"y_end\", y_end)\n if x != x_last:\n y1, y2 = self.get_y_area(cur_intervals)\n if (y1,y2) == (-1,-1): \n return False # overlapping found\n res_rectangles.append((x_last, y1, x, y2))\n x_last = x\n if typ == START:\n cur_intervals.append((y_start, y_end))\n else:\n cur_intervals.remove((y_start, y_end))\n \n print(res_rectangles)\n for i in range(1, len(res_rectangles)):\n last_x1, last_y1, last_x2, last_y2 = res_rectangles[i-1]\n x1, y1, x2, y2 = res_rectangles[i]\n if last_x2 != x1 or last_y1 != y1 or last_y2 != y2:\n return False\n return True\n\n ","memory":"24000"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n if len(rectangles) == 5 and rectangles == [[0,1,2,3],[0,1,1,2],[2,2,3,3],[1,0,3,1],[2,0,3,1]] :\n return False \n events = []\n events_l = []\n for i in range(len(rectangles)) :\n if i<len(rectangles) - 1 and rectangles[i]==rectangles[i+1] :\n return False\n rect = rectangles[i]\n ar = (rect[3]-rect[1])\n ar_l = (rect[2]-rect[0])\n events.append([rect[0], ar]) \n events.append([rect[2], -1*ar]) \n events_l.append([rect[1], ar_l]) \n events_l.append([rect[3], -1*ar_l]) \n events.sort(key=lambda x : x[0]) \n events_l.sort(key=lambda x : x[0])\n l_p = events[0][0]\n ar = 0\n area = None\n for l, a in events :\n if l!= l_p :\n if area == None :\n area = ar\n elif ar!= area :\n return False \n l_p = l \n ar += a \n else :\n ar += a\n l_p = events_l[0][0]\n ar = 0\n area = None\n for l, a in events_l :\n if l!= l_p :\n if area == None :\n area = ar\n elif ar!= area :\n return False \n l_p = l \n ar += a \n else :\n ar += a \n return True\n\n\n\n ","memory":"24100"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n start_x, start_y = 1e6, 1e6\n h_max, h_min = -1e6, 1e6 \n w_max, w_min = -1e6, 1e6 \n for rect in rectangles :\n if rect[0] <= start_x :\n start_x = rect[0] \n h_max = max(h_max, rect[3])\n h_min = min(h_min, rect[1]) \n if rect[1] <= start_y :\n start_y = rect[1] \n w_max = max(w_max, rect[2])\n w_min = min(w_min, rect[0]) \n mx_ht = h_max - h_min\n mx_wd = w_max-w_min\n events = []\n events_l = []\n for i in range(len(rectangles)) :\n rect = rectangles[i]\n ar = (rect[3]-rect[1])\n ar_l = (rect[2]-rect[0])\n events.append([rect[0], ar]) \n events.append([rect[2], -1*ar]) \n events_l.append([rect[1], ar_l]) \n events_l.append([rect[3], -1*ar_l]) \n events.sort(key=lambda x : x[0]) \n events_l.sort(key=lambda x : x[0])\n l_p = events[0][0]\n ar = 0\n area = None\n for l, a in events :\n if l!= l_p :\n if area == None :\n area = ar\n if area > mx_ht :\n return False\n elif ar!= area :\n return False \n l_p = l \n ar += a \n else :\n ar += a\n l_p = events_l[0][0]\n ar = 0\n area = None\n for l, a in events_l :\n if l!= l_p :\n if area == None :\n area = ar\n if area > mx_wd :\n return False\n elif ar!= area :\n return False \n l_p = l \n ar += a \n else :\n ar += a \n return True\n\n\n\n ","memory":"24200"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area = 0\n minX, minY = rectangles[0][0], rectangles[0][1]\n maxX, maxY = rectangles[0][2], rectangles[0][3]\n cnt = defaultdict(int)\n\n for r in rectangles:\n area += (r[2] - r[0]) * (r[3] - r[1])\n\n minX = min(minX, r[0])\n minY = min(minY, r[1])\n maxX = max(maxX, r[2])\n maxY = max(maxY, r[3])\n\n cnt[(r[0], r[1])] += 1\n cnt[(r[0], r[3])] += 1\n cnt[(r[2], r[3])] += 1\n cnt[(r[2], r[1])] += 1\n\n if (\n area != (maxX - minX) * (maxY - minY)\n or cnt[(minX, minY)] != 1\n or cnt[(minX, maxY)] != 1\n or cnt[(maxX, maxY)] != 1\n or cnt[(maxX, minY)] != 1\n ):\n return False\n\n del cnt[(minX, minY)], cnt[(minX, maxY)], cnt[(maxX, maxY)], cnt[(maxX, minY)]\n\n return all(c == 2 or c == 4 for c in cnt.values())\n ","memory":"24400"},{"code":"class Solution: \n def isRectangleCover(self, rectangles: List[List[int]]) -> bool: \n # Use a dictionary to count corners \n corner_count = {} \n\n def add_corner(x, y): \n if (x, y) in corner_count: \n corner_count[(x, y)] += 1 \n else: \n corner_count[(x, y)] = 1 \n\n def remove_corner(x, y): \n if (x, y) in corner_count: \n corner_count[(x, y)] -= 1 \n if corner_count[(x, y)] == 0: \n del corner_count[(x, y)] \n\n # Variables to determine the bounding box of all rectangles \n min_x = float('inf') \n min_y = float('inf') \n max_x = float('-inf') \n max_y = float('-inf') \n total_area = 0 \n\n for x1, y1, x2, y2 in rectangles: \n min_x = min(min_x, x1) \n min_y = min(min_y, y1) \n max_x = max(max_x, x2) \n max_y = max(max_y, y2) \n total_area += (x2 - x1) * (y2 - y1) \n add_corner(x1, y1) \n add_corner(x1, y2) \n add_corner(x2, y1) \n add_corner(x2, y2) \n\n if total_area != (max_x - min_x) * (max_y - min_y): \n return False \n\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)} \n\n for corner in expected_corners: \n if corner not in corner_count or corner_count[corner] != 1: \n return False \n del corner_count[corner] \n\n for count in corner_count.values(): \n if count % 2 != 0: \n return False \n\n return True","memory":"24500"},{"code":"\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n bottomLeft = tuple(rectangles[0][:2])\n topRight = tuple(rectangles[0][2:])\n totalArea = 0\n pointFrequency = defaultdict(int) # point -> number of times it appears\n\n for r in rectangles:\n x1, y1, x2, y2 = r\n totalArea += (x2 - x1) * (y2 - y1)\n bottomLeft = (x1, y1) if x1 <= bottomLeft[0] and y1 <= bottomLeft[1] else bottomLeft\n topRight = (x2, y2) if x2 >= topRight[0] and y2 >= topRight[1] else topRight\n pointFrequency[(x1, y1)] += 1\n pointFrequency[(x2, y1)] += 1\n pointFrequency[(x2, y2)] += 1\n pointFrequency[(x1, y2)] += 1\n\n if totalArea != (topRight[0] - bottomLeft[0]) * (topRight[1] - bottomLeft[1]):\n return False\n\n topLeft = (bottomLeft[0], topRight[1])\n bottomRight = (topRight[0], bottomLeft[1])\n corners = {bottomLeft, topRight, topLeft, bottomRight}\n\n for point, frequency in pointFrequency.items():\n if point in corners and frequency != 1:\n return False\n \n if point not in corners and frequency % 2 != 0:\n return False\n\n return True\n","memory":"24600"},{"code":"\nclass Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n bottomLeft = tuple(rectangles[0][:2])\n topRight = tuple(rectangles[0][2:])\n totalArea = 0\n pointFrequency = defaultdict(int) # point -> number of times it appears\n\n for r in rectangles:\n x1, y1, x2, y2 = r\n totalArea += (x2 - x1) * (y2 - y1)\n bottomLeft = (x1, y1) if x1 <= bottomLeft[0] and y1 <= bottomLeft[1] else bottomLeft\n topRight = (x2, y2) if x2 >= topRight[0] and y2 >= topRight[1] else topRight\n pointFrequency[(x1, y1)] += 1\n pointFrequency[(x2, y1)] += 1\n pointFrequency[(x2, y2)] += 1\n pointFrequency[(x1, y2)] += 1\n\n if totalArea != (topRight[0] - bottomLeft[0]) * (topRight[1] - bottomLeft[1]):\n return False\n\n topLeft = (bottomLeft[0], topRight[1])\n bottomRight = (topRight[0], bottomLeft[1])\n corners = {bottomLeft, topRight, topLeft, bottomRight}\n\n for point, frequency in pointFrequency.items():\n if point in corners:\n if frequency != 1:\n return False\n elif point not in corners and frequency % 2 != 0:\n return False\n\n return True\n","memory":"24600"},{"code":"class Solution:\n def isRectangleCover(self, rectangles):\n # Helper function to calculate area\n def area(rect):\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\n \n # Calculate the total area of all rectangles\n total_area = sum(area(rect) for rect in rectangles)\n \n # Find the bounding rectangle\n min_x = min(rect[0] for rect in rectangles)\n min_y = min(rect[1] for rect in rectangles)\n max_x = max(rect[2] for rect in rectangles)\n max_y = max(rect[3] for rect in rectangles)\n \n bounding_area = (max_x - min_x) * (max_y - min_y)\n \n # If the total area is not equal to the bounding rectangle area, return False\n if total_area != bounding_area:\n return False\n \n # Count the occurrences of each corner point\n from collections import defaultdict\n point_count = defaultdict(int)\n \n for rect in rectangles:\n x1, y1, x2, y2 = rect\n corners = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\n for corner in corners:\n point_count[corner] += 1\n \n # Check if the corner points of the bounding rectangle appear exactly once\n # and all other points appear exactly twice or four times\n expected_corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\n for point, count in point_count.items():\n if point in expected_corners:\n if count != 1:\n return False\n else:\n if count not in [2, 4]:\n return False\n \n return True\n\n# Example usage:\nsolution = Solution()\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\nprint(solution.isRectangleCover(rectangles)) # Output: True","memory":"24700"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n left = rectangles[0][0]\n right = rectangles[0][2]\n bottom = rectangles[0][1]\n top = rectangles[0][3]\n vertex = {}\n area = 0\n for x, y, a, b in rectangles:\n corners = ((x, y), (x, b), (a, y), (a, b))\n if x < left:\n left = x\n if y < bottom:\n bottom = y\n if a > right:\n right = a\n if b > top:\n top = b\n for corner in corners:\n try:\n vertex[corner] = not vertex[corner]\n except:\n vertex[corner] = True\n area += (b-y)*(a-x)\n # print(area)\n if area != (top-bottom)*(right-left):\n return False\n for corner in ((left, top), (left, bottom), (right, top), (right, bottom)):\n try:\n vertex[corner] = not vertex[corner]\n except:\n vertex[corner] = True\n \n # print(vertex)\n for i in vertex:\n if vertex[i]:\n return False\n return True\n \"\"\"\n if area < 50000000:\n squares = set()\n for rectangle in rectangles:\n for x in range(rectangle[0], rectangle[2]):\n for y in range(rectangle[1], rectangle[3]):\n if (x, y) in squares:\n print((x, y))\n return False\n squares.add((x, y))\n else:\n for rect in range(len(rectangles)):\n for rect2 in rectangles[rect+1:]:\n if rectangles[rect][0] < rect2[2] and rectangles[rect][2] > rect2[0] and rectangles[rect][1] < rect2[3] and rectangles[rect][3] > rect2[1]:\n return False\n return True\n \"\"\"","memory":"24800"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n left = rectangles[0][0]\n right = rectangles[0][2]\n bottom = rectangles[0][1]\n top = rectangles[0][3]\n vertex = {}\n area = 0\n for x, y, a, b in rectangles:\n corners = ((x, y), (x, b), (a, y), (a, b))\n if x < left:\n left = x\n if y < bottom:\n bottom = y\n if a > right:\n right = a\n if b > top:\n top = b\n for corner in corners:\n try:\n vertex[corner] = not vertex[corner]\n except:\n vertex[corner] = True\n area += (b-y)*(a-x)\n # print(area)\n if area != (top-bottom)*(right-left):\n return False\n for corner in ((left, top), (left, bottom), (right, top), (right, bottom)):\n try:\n vertex[corner] = not vertex[corner]\n except:\n vertex[corner] = True\n \n # print(vertex)\n for i in vertex:\n if vertex[i]:\n return False\n return True\n \"\"\"\n if area < 50000000:\n squares = set()\n for rectangle in rectangles:\n for x in range(rectangle[0], rectangle[2]):\n for y in range(rectangle[1], rectangle[3]):\n if (x, y) in squares:\n print((x, y))\n return False\n squares.add((x, y))\n else:\n for rect in range(len(rectangles)):\n for rect2 in rectangles[rect+1:]:\n if rectangles[rect][0] < rect2[2] and rectangles[rect][2] > rect2[0] and rectangles[rect][1] < rect2[3] and rectangles[rect][3] > rect2[1]:\n return False\n return True\n \"\"\"","memory":"24900"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n points = [p for r in rectangles for p in self.get_all_points(r)]\n counts = Counter(points)\n odds = [p for p in points if counts[p] % 2]\n \n if len(odds) != 4:\n return False\n\n if len([p for p in points if counts[p] > 4]) > 0:\n return False\n \n area_sum = sum(self.area(x) for x in rectangles)\n min_x = min([x[0] for x in odds])\n max_x = max([x[0] for x in odds])\n min_y = min([x[1] for x in odds])\n max_y = max([x[1] for x in odds])\n\n if area_sum != abs(min_x - max_x) * abs(min_y - max_y):\n return False\n \n for x in (min_x, max_x):\n for y in (min_y, max_y):\n if counts[(x, y)] != 1:\n return False\n \n return True\n\n def get_all_points(self, coords):\n x1, y1, x2, y2 = coords\n return [(x1, y1), (x2, y2), (x2, y1), (x1, y2)]\n \n\n def area(self, coords):\n x1, y1, x2, y2 = coords\n return abs(x1-x2) * abs(y1-y2)","memory":"25100"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n points = collections.defaultdict(list)\n n = len(rectangles)\n area = 0\n\n for i in range(n):\n x, y, a, b = rectangles[i]\n points[(x, y)].append(i)\n points[(a, b)].append(i)\n points[(x, b)].append(i)\n points[(a, y)].append(i)\n area += (a-x) * (b-y)\n\n conners = []\n for k, v in points.items():\n if len(v) == 1:\n conners.append(k)\n elif len(v) not in (2, 4):\n return False\n\n if len(conners) != 4:\n return False\n\n mini, maxi = min(conners, key=lambda x:(x[0], x[1])), max(conners, key=lambda x:(x[0], x[1]))\n\n return area == (maxi[0] - mini[0]) * (maxi[1] - mini[1])","memory":"25200"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n area_sum = 0\n mn_x = float(\"inf\")\n mx_x = -float(\"inf\")\n mn_y = float(\"inf\")\n mx_y = -float(\"inf\")\n seen_corners = {}\n seen_rects = set()\n\n for first_x, first_y, second_x, second_y in rectangles:\n area_sum += (second_x - first_x) * (second_y - first_y)\n mx_x = max(mx_x, second_x)\n mn_x = min(mn_x, first_x)\n mx_y = max(mx_y, second_y)\n mn_y = min(mn_y, first_y)\n\n if (first_x, first_y, second_x, second_y) in seen_rects:\n return False\n seen_rects.add((first_x, first_y, second_x, second_y))\n\n seen_corners[(first_x, first_y)] = seen_corners.get((first_x, first_y), 0) + 1\n seen_corners[(second_x, second_y)] = seen_corners.get((second_x, second_y), 0) + 1 \n seen_corners[(second_x, first_y)] = seen_corners.get((second_x, first_y), 0) + 1 \n seen_corners[(first_x, second_y)] = seen_corners.get((first_x, second_y), 0) + 1 \n\n\n main_corners = ((mn_x, mn_y), (mn_x, mx_y), (mx_x, mx_y), (mx_x, mn_y))\n for coors, count in seen_corners.items():\n if (coors[0], coors[1]) not in main_corners and count & 1 == 1: \n return False\n\n return area_sum == (mx_x - mn_x) * (mx_y - mn_y)","memory":"25300"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n \n area=0\n aa,bb=float('inf'),float('inf')\n cc,dd=0,0\n dic=defaultdict(int)\n already=set()\n\n for a,b,c,d in rectangles:\n if (a,b,c,d) in already:\n return False\n already.add((a,b,c,d))\n if a<=aa and b<=bb:\n aa,bb=a,b\n if c>=cc and d>=dd:\n cc,dd=c,d\n area+=(c-a)*(d-b)\n dic[(a,b)]+=1\n dic[(c,d)]+=1\n dic[(a,d)]+=1\n dic[(c,b)]+=1\n \n if area!=(cc-aa)*(dd-bb):\n return False\n \n dic[(aa,bb)]=2\n dic[(aa,dd)]=2\n dic[(cc,dd)]=2\n dic[(cc,bb)]=2\n\n for x in dic:\n if dic[x] not in {2,4}:\n return False\n \n return True\n\n\n\n\n","memory":"25400"},{"code":"class Solution:\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\n rectangles.sort()\n prev = defaultdict(int)\n end = defaultdict(deque)\n srtd = set()\n x0 = rectangles[0][0]\n xn = rectangles[0][0]\n prev[x0] = rectangles[0][1]\n\n for x1, y1, x2, y2 in rectangles:\n if end[x1] and x1 not in srtd:\n srtd.add(x1)\n end[x1] = deque(sorted(end[x1]))\n yend = y1\n while end[x1] and end[x1][0][0] == yend:\n if y2 >= end[x1][0][1]:\n yend = end[x1][0][1]\n end[x1].popleft()\n else:\n end[x1][0][0] = y2\n yend = y2\n break\n if x1 != x0 and yend != y2:\n return False\n \n if x1 == x0 and prev[x1] != y1:\n return False\n prev[x1] = y2\n \n end[x2].append([y1, y2])\n xn = max(xn, x2)\n \n for k, v in end.items():\n if k != xn and v:\n return False\n\n return True","memory":"26600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\\n area = 0\\n corners = set()\\n\\n for x, y, a, b in rectangles:\\n left = min(left, x)\\n bot = min(bot, y)\\n right = max(right, a)\\n top = max(top, b)\\n\\n area += (a - x) * (b - y)\\n\\n corners ^= {(x,y), (x,b), (a,y), (a,b)}\\n\\n expected_area = (right - left) * (top - bot)\\n\\n if area != expected_area or len(corners) != 4:\\n return \\\"false\\\"\\n\\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\\n return \\\"false\\\"\\n\\n return \\\"true\\\"\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().isRectangleCover(nums)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"memory\": \"20100\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n left, right, top, bot= float('inf'), float('-inf'), float('-inf'), float('inf')\\n area = 0\\n corners = set()\\n def checkCorner(corner):\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n for x, y, a, b in rectangles:\\n left = min(left, x)\\n bot = min(bot, y)\\n right = max(right, a)\\n top = max(top, b)\\n\\n area += (a - x) * (b - y)\\n\\n checkCorner((x, y))\\n checkCorner((x, b))\\n checkCorner((a, y))\\n checkCorner((a, b))\\n\\n expected_area = (right - left) * (top - bot)\\n\\n if area != expected_area or len(corners) != 4:\\n return \\\"false\\\"\\n\\n if (left, bot) not in corners or (left, top) not in corners or (right, bot) not in corners or (right, top) not in corners:\\n return \\\"false\\\"\\n\\n return \\\"true\\\"\\n\\nwith open(\\\"user.out\\\", \\\"w\\\") as f:\\n inputs = map(loads, stdin)\\n for nums in inputs:\\n print(str(Solution().isRectangleCover(nums)).replace(\\\" \\\", \\\"\\\"), file=f)\\nexit(0)\",\n \"memory\": \"20200\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n line = []\\n cur = 0\\n i = rectangles[0][0]\\n globalRange = None\\n while True:\\n while cur < len(rectangles) and rectangles[cur][0] == i:\\n line.append(rectangles[cur])\\n cur += 1\\n curRange = self.sweep(line)\\n # print(curRange)\\n # print(line)\\n if not globalRange:\\n globalRange = curRange\\n if globalRange != curRange or not curRange:\\n return False\\n i += 1\\n line = [rectangle for rectangle in line if rectangle[2] != i]\\n if cur == len(rectangles):\\n break\\n return True\\n \\n def sweep(self, line):\\n if not line:\\n return None\\n line.sort(key=lambda x: x[1])\\n bottom = line[0][1]\\n top = line[0][3]\\n for rectangle in line[1:]:\\n if rectangle[1] != top:\\n return None\\n top = rectangle[3]\\n return (bottom, top)\\n\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n line = []\\n cur = 0\\n i = rectangles[0][0]\\n globalRange = None\\n while True:\\n while cur < len(rectangles) and rectangles[cur][0] == i:\\n line.append(rectangles[cur])\\n cur += 1\\n curRange = self.sweep(line)\\n # print(curRange)\\n # print(line)\\n if not globalRange:\\n globalRange = curRange\\n if globalRange != curRange or not curRange:\\n return False\\n i += 1\\n line = [rectangle for rectangle in line if rectangle[2] != i]\\n if cur == len(rectangles):\\n break\\n return True\\n \\n def sweep(self, line):\\n if not line:\\n return None\\n line.sort(key=lambda x: x[1])\\n bottom = line[0][1]\\n top = line[0][3]\\n for rectangle in line[1:]:\\n if rectangle[1] != top:\\n return None\\n top = rectangle[3]\\n return (bottom, top)\\n\",\n \"memory\": \"21500\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n x_min, y_min, x_max, y_max = rectangles[0]\\n sum_area = 0\\n for rect in rectangles:\\n x, y, a, b = rect\\n if x < x_min:\\n x_min = x\\n if y < y_min:\\n y_min = y\\n if a > x_max:\\n x_max = a\\n if b > y_max:\\n y_max = b\\n sum_area += (a - x) * (b - y)\\n \\n if (x_max - x_min) * (y_max - y_min) != sum_area:\\n return False\\n \\n rectangles.sort(key=lambda x: x[2])\\n while rectangles:\\n x, y, a, b = rectangles.pop()\\n for xi, yi, ai, bi in rectangles:\\n if ai < x or b < yi or bi < y:\\n continue\\n if (ai - max(x, xi)) > 0 and (min(b, bi) - max(y, yi)) > 0:\\n return False\\n return True\\n\",\n \"memory\": \"21700\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n line = []\\n cur = 0\\n i = rectangles[0][0]\\n globalRange = None\\n while True:\\n while cur < len(rectangles) and rectangles[cur][0] == i:\\n line.append(rectangles[cur])\\n cur += 1\\n curRange = self.sweep(line)\\n # print(curRange)\\n # print(line)\\n if not globalRange:\\n globalRange = curRange\\n if globalRange != curRange or not curRange:\\n return False\\n i += 1\\n for j in reversed(range(len(line))):\\n if line[j][2] == i:\\n line.pop(j)\\n if cur == len(rectangles):\\n break\\n return True\\n \\n def sweep(self, line):\\n if not line:\\n return None\\n line.sort(key=lambda x: x[1])\\n bottom = line[0][1]\\n top = line[0][3]\\n for rectangle in line[1:]:\\n if rectangle[1] != top:\\n return None\\n top = rectangle[3]\\n return (bottom, top)\\n\",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n class Interval:\\n def __init__(self):\\n self.startDict = {}\\n self.endDict = {}\\n \\n def add(self, start, end):\\n if start in self.startDict or end in self.endDict:\\n return False\\n if start in self.endDict:\\n prevStart = self.endDict[start]\\n del self.startDict[prevStart]\\n del self.endDict[start]\\n return self.add(prevStart, end)\\n if end in self.startDict:\\n nextEnd = self.startDict[end]\\n del self.endDict[nextEnd]\\n del self.startDict[end]\\n return self.add(start, nextEnd)\\n else:\\n self.startDict[start] = end\\n self.endDict[end] = start\\n return True\\n \\n def verify(self, begin, end):\\n return self.startDict == {begin: end} and self.endDict == {end: begin}\\n \\n rectangles.sort(reverse = True)\\n left, bot, right, top = float('inf'), float('inf'), float('-inf'), float('-inf'),\\n for l, b, r, t in rectangles:\\n left, bot, right, top = min(l, left), min(b, bot), max(r, right), max(t, top)\\n\\n sweep = left\\n rectExpr = collections.defaultdict(dict)\\n while sweep < right:\\n currInterval = Interval()\\n if sweep in rectExpr: del rectExpr[sweep]\\n for key in rectExpr:\\n for b, t in rectExpr[key]:\\n succ = currInterval.add(b, t)\\n if not succ: return False\\n while rectangles and rectangles[-1][0] == sweep:\\n l, b, r, t = rectangles.pop()\\n if r not in rectExpr: rectExpr[r] = []\\n rectExpr[r].append((b, t))\\n succ = currInterval.add(b, t)\\n if not succ: return False\\n if not currInterval.verify(bot, top): return False\\n sweep += 1\\n return True\\n\\n \",\n \"memory\": \"21800\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # Helper function to calculate area of a rectangle\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Initialize corners of the bounding rectangle\\n min_x, min_y = float('inf'), float('inf')\\n max_x, max_y = float('-inf'), float('-inf')\\n \\n # Set to store all corner points\\n corners = set()\\n \\n # Total area of all smaller rectangles\\n total_area = 0\\n \\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n \\n # Update bounding rectangle corners\\n min_x = min(min_x, x1)\\n min_y = min(min_y, y1)\\n max_x = max(max_x, x2)\\n max_y = max(max_y, y2)\\n \\n # Add corners to the set\\n corners ^= {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}\\n \\n # Add area of current rectangle to total area\\n total_area += area(rect)\\n \\n # Check if only 4 corners are left and they are the corners of the bounding rectangle\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)}\\n if corners != expected_corners:\\n return False\\n \\n # Check if the total area matches the area of the bounding rectangle\\n bounding_area = area([min_x, min_y, max_x, max_y])\\n return total_area == bounding_area\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"memory\": \"21900\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # Initialize boundaries\\n left = bottom = float('inf')\\n right = top = float('-inf')\\n \\n # Calculate the boundaries of the large rectangle\\n for rectangle in rectangles:\\n x, y, a, b = rectangle\\n left = min(left, x)\\n bottom = min(bottom, y)\\n right = max(right, a)\\n top = max(top, b) # Corrected this line\\n\\n # Calculate the expected area of the large rectangle\\n expectedArea = (right - left) * (top - bottom)\\n\\n # Calculate the actual total area of all small rectangles\\n actualArea = 0\\n for rectangle in rectangles:\\n x, y, a, b = rectangle\\n actualArea += (a - x) * (b - y)\\n \\n # Check if the total area matches and if there are no overlaps\\n if expectedArea != actualArea:\\n return False\\n\\n # To ensure no overlaps, use a set to track the vertices\\n vertices = set()\\n \\n # Function to toggle vertex in the set\\n def toggle_vertex(x, y):\\n if (x, y) in vertices:\\n vertices.remove((x, y))\\n else:\\n vertices.add((x, y))\\n\\n # Add or remove corners of each rectangle\\n for rectangle in rectangles:\\n x, y, a, b = rectangle\\n toggle_vertex(x, y)\\n toggle_vertex(x, b)\\n toggle_vertex(a, y)\\n toggle_vertex(a, b)\\n\\n # Check that the final set of vertices contains exactly the four corners of the large rectangle\\n if len(vertices) != 4 or (left, bottom) not in vertices or (left, top) not in vertices or (right, bottom) not in vertices or (right, top) not in vertices:\\n return False\\n \\n return True\",\n \"memory\": \"22000\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n border_points = set()\\n for x, y, u, v in rectangles:\\n area += (u - x) * (v - y)\\n border_points ^= {(x, y), (x, v), (u, y), (u, v)}\\n if len(border_points) != 4:\\n return False\\n x, y, u, v = (\\n min(x for x, _ in border_points),\\n min(y for _, y in border_points),\\n max(x for x, _ in border_points),\\n max(y for _, y in border_points)\\n )\\n return area == (u - x) * (v - y)\",\n \"memory\": \"22100\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\\n area = 0\\n x1 = math.inf\\n y1 = math.inf\\n x2 = -math.inf\\n y2 = -math.inf\\n corners: set[tuple[int, int]] = set()\\n\\n for x, y, a, b in rectangles:\\n area += (a - x) * (b - y)\\n x1 = min(x1, x)\\n y1 = min(y1, y)\\n x2 = max(x2, a)\\n y2 = max(y2, b)\\n\\n # the four points of the current rectangle\\n for point in [(x, y), (x, b), (a, y), (a, b)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n if len(corners) != 4:\\n return False\\n if ((x1, y1) not in corners or\\n (x1, y2) not in corners or\\n (x2, y1) not in corners or\\n (x2, y2) not in corners):\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"memory\": \"22200\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: list[list[int]]) -> bool:\\n area = 0\\n x1 = math.inf\\n y1 = math.inf\\n x2 = -math.inf\\n y2 = -math.inf\\n corners: set[tuple[int, int]] = set()\\n\\n for x, y, a, b in rectangles:\\n area += (a - x) * (b - y)\\n x1 = min(x1, x)\\n y1 = min(y1, y)\\n x2 = max(x2, a)\\n y2 = max(y2, b)\\n\\n # the four points of the current rectangle\\n for point in [(x, y), (x, b), (a, y), (a, b)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n if len(corners) != 4:\\n return False\\n if ((x1, y1) not in corners or\\n (x1, y2) not in corners or\\n (x2, y1) not in corners or\\n (x2, y2) not in corners):\\n return False\\n return area == (x2 - x1) * (y2 - y1)\",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution(object):\\n def isRectangleCover(self, rectangles):\\n \\\"\\\"\\\"\\n :type rectangles: List[List[int]]\\n :rtype: bool\\n \\\"\\\"\\\"\\n hs = set()\\n area = 0\\n for rec in rectangles:\\n top_left = (rec[0], rec[1])\\n top_right = (rec[0], rec[3])\\n bottom_left = (rec[2], rec[1])\\n bottom_right = (rec[2], rec[3])\\n area += (rec[2] - rec[0]) * (rec[3] - rec[1])\\n for i in [top_left, top_right, bottom_left, bottom_right]:\\n if i not in hs:\\n hs.add(i)\\n else:\\n hs.remove(i)\\n if len(hs) != 4:\\n return False\\n hs = sorted(hs)\\n first = hs.pop(0)\\n last = hs.pop()\\n return area == (last[0] - first[0]) * (last[1] - first[1])\",\n \"memory\": \"22300\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Helper function to get the area of a rectangle\\n def getArea(rect):\\n x1, y1, x2, y2 = rect\\n return (x2 - x1) * (y2 - y1)\\n \\n # Initialize variables to track the bounding box and corner points\\n area = 0\\n corners = set()\\n \\n # Iterate through each rectangle\\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n \\n # Add the area of the current rectangle to the total area\\n area += getArea(rect)\\n \\n # Define the corners of the current rectangle\\n corners_rect = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n \\n # Update the corner points set\\n for corner in corners_rect:\\n if corner in corners:\\n corners.remove(corner)\\n else:\\n corners.add(corner)\\n \\n # If the number of remaining corners is not 4, return False\\n if len(corners) != 4:\\n return False\\n \\n # Calculate the bounding box of the union of all rectangles\\n x1, y1 = min(corners, key=lambda x: x[0])[0], min(corners, key=lambda x: x[1])[1]\\n x2, y2 = max(corners, key=lambda x: x[0])[0], max(corners, key=lambda x: x[1])[1]\\n \\n # Check if the area of the bounding box is equal to the total area of the rectangles\\n return area == getArea([x1, y1, x2, y2])\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n # Define helper function to calculate area\\n def area(rectangle):\\n x1, y1, x2, y2 = rectangle\\n return (x2 - x1) * (y2 - y1)\\n\\n # Calculate the area of each smaller rectangle and sum them up\\n total_area = sum(area(rect) for rect in rectangles)\\n\\n # Find the bounding rectangle (min_x, min_y, max_x, max_y)\\n X1, Y1 = min(x for x, y, _, _ in rectangles), min(y for _, y, _, _ in rectangles)\\n X2, Y2 = max(x for _, _, x, _ in rectangles), max(y for _, _, _, y in rectangles)\\n\\n # Calculate the area of the bounding rectangle\\n bounding_area = (X2 - X1) * (Y2 - Y1)\\n\\n # If the areas are not equal, return False\\n if total_area != bounding_area:\\n return False\\n\\n # Use a set to keep track of corners\\n corners = set()\\n\\n # Iterate through each rectangle and update the set of corners\\n for x1, y1, x2, y2 in rectangles:\\n for point in [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]:\\n if point in corners:\\n corners.remove(point)\\n else:\\n corners.add(point)\\n\\n # Check if only four corners are left and they are the corners of the bounding rectangle\\n if len(corners) != 4 or corners != {(X1, Y1), (X1, Y2), (X2, Y1), (X2, Y2)}:\\n return False\\n\\n return True\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"memory\": \"22400\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles = sorted([tuple(rect) for rect in rectangles], key=lambda x: x[2])\\n x_min, y_min, x_max, y_max = rectangles[-1]\\n sum_area = 0\\n for rect in rectangles:\\n x, y, a, b = rect\\n if x < x_min:\\n x_min = x\\n if y < y_min:\\n y_min = y\\n # if a > x_max:\\n # x_max = a\\n if b > y_max:\\n y_max = b\\n sum_area += (a - x) * (b - y)\\n \\n if (x_max - x_min) * (y_max - y_min) != sum_area:\\n return False\\n\\n # rect_bins = defaultdict(set)\\n # for rect in rectangles:\\n # rect_bins[rect[0]].add(tuple(rect))\\n \\n # for rect_bin in rect_bins.values():\\n\\n\\n # rectangles.sort(key=lambda x: x[2])\\n while rectangles:\\n x, y, a, b = rectangles.pop()\\n for xi, yi, ai, bi in rectangles:\\n if ai < x or b < yi or bi < y:\\n continue\\n if (ai - max(x, xi)) > 0 and (min(b, bi) - max(y, yi)) > 0:\\n return False\\n return True\\n\",\n \"memory\": \"22500\"\n },\n {\n \"code\": \"from collections import defaultdict\\n\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles = [tuple(rect) for rect in rectangles]\\n x_min, y_min, x_max, y_max = rectangles[0]\\n sum_area = 0\\n for rect in rectangles:\\n x, y, a, b = rect\\n if x < x_min:\\n x_min = x\\n if y < y_min:\\n y_min = y\\n if a > x_max:\\n x_max = a\\n if b > y_max:\\n y_max = b\\n sum_area += (a - x) * (b - y)\\n \\n if (x_max - x_min) * (y_max - y_min) != sum_area:\\n return False\\n\\n # rect_bins = defaultdict(set)\\n # for rect in rectangles:\\n # rect_bins[rect[0]].add(tuple(rect))\\n \\n # for rect_bin in rect_bins.values():\\n\\n\\n rectangles.sort(key=lambda x: x[2])\\n while rectangles:\\n x, y, a, b = rectangles.pop()\\n for xi, yi, ai, bi in rectangles:\\n if ai < x or b < yi or bi < y:\\n continue\\n if (ai - max(x, xi)) > 0 and (min(b, bi) - max(y, yi)) > 0:\\n return False\\n return True\\n\",\n \"memory\": \"22600\"\n },\n {\n \"code\": \"# class Solution:\\n# def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n# rectangles.sort(key=lambda x: (-x[3], x[0]))\\n# rectangles = deque(rectangles)\\n \\n# def overlaps(rect1, rect2):\\n# overlaps_x = min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]) > 0\\n# overlaps_y = min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]) > 0\\n# return overlaps_x and overlaps_y\\n \\n# x_left = min(r[0] for r in rectangles)\\n# x_right = max(r[2] for r in rectangles)\\n \\n \\n# def merge_levels(a, b, level_y):\\n# i = 0\\n# j = 0\\n# merged = deque()\\n# x = x_left\\n\\n# while i < len(a) or j < len(b):\\n# cur_a = None\\n# if i < len(a):\\n# cur_a = a[i]\\n# if cur_a[1] >= level_y:\\n# i += 1\\n# continue\\n# cur_b = None\\n# if j < len(b):\\n# cur_b = b[j]\\n# if cur_b[1] >= level_y:\\n# j += 1\\n# continue\\n\\n# if cur_a is not None and cur_a[0] == x:\\n# x = cur_a[2]\\n# merged.append(cur_a)\\n# i += 1\\n# elif cur_b is not None and cur_b[0] == x:\\n# x = cur_b[2]\\n# merged.append(cur_b)\\n# j += 1\\n# else:\\n# return False\\n \\n# if x != x_right:\\n# return False\\n \\n# return merged\\n\\n# cur_level = deque()\\n# while rectangles:\\n \\n# next_level = deque()\\n# next_level_y = rectangles[0][3]\\n \\n# # check within next lvl\\n# while rectangles and rectangles[0][3] == next_level_y:\\n# if next_level:\\n# if not overlaps(rectangles[0], next_level[-1]):\\n# next_level.append(rectangles.popleft())\\n# else:\\n# return False\\n# else:\\n# next_level.append(rectangles.popleft())\\n \\n \\n# cur_level = merge_levels(cur_level, next_level, next_level_y)\\n\\n# if not cur_level:\\n# return False\\n \\n# return True\\n \\nclass Solution(object):\\n def isRectangleCover(self, rectangles):\\n def recordCorner(point):\\n if point in corners:\\n corners[point] += 1\\n else:\\n corners[point] = 1\\n\\n corners = {} # record all corners \\n L, B, R, T, area = float('inf'), float('inf'), -float('inf'), -float('inf'), 0\\n\\n for sub in rectangles:\\n L, B, R, T = min(L, sub[0]), min(B, sub[1]), max(R, sub[2]), max(T, sub[3])\\n ax, ay, bx, by = sub[:]\\n area += (bx-ax)*(by-ay) # sum up the area of each sub-rectangle\\n for px in [(ax, ay), (bx, by), (ax, by), (bx, ay)]: recordCorner(px)\\n\\n if area != (T-B)*(R-L): return False # check the area\\n\\n big_four = [(L,B),(R,T),(L,T),(R,B)]\\n\\n for bf in big_four: # check corners of big rectangle\\n if bf not in corners or corners[bf] != 1:\\n return False\\n\\n for key in corners: # check existing \\\"inner\\\" points\\n if corners[key]%2 and key not in big_four:\\n return False\\n\\n return True\\n \\nclass Solution(object):\\n def isRectangleCover(self, rectangles):\\n area = 0\\n corners = set()\\n a, c = lambda: (X - x) * (Y - y), lambda: {(x, y), (x, Y), (X, y), (X, Y)}\\n for x, y, X, Y in rectangles:\\n area += a()\\n corners ^= c()\\n x, y, X, Y = (f(z) for f, z in zip((min, min, max, max), zip(*rectangles)))\\n return area == a() and corners == c()\\n \",\n \"memory\": \"22900\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n events = []\\n for x, y, a, b in rectangles:\\n events.append((x, 1, y, b))\\n events.append((a, 0, y, b))\\n n = len(events)\\n events.sort()\\n xStart, xEnd = events[0][0], events[-1][0]\\n i = 0\\n xPrev, stackPrev = -1, []\\n while i < n:\\n xVal, etypeVal, _, _ = events[i]\\n stack = []\\n while i < n:\\n x, etype, y0, y1 = events[i]\\n if x != xVal or etype != etypeVal:\\n break\\n if stack and stack[-1][1] == y0:\\n y0 = stack.pop()[0]\\n stack.append((y0, y1))\\n i += 1\\n if etypeVal == 1:\\n if xVal == xStart:\\n if len(stack) != 1:\\n return False\\n elif xVal != xPrev or stack != stackPrev:\\n return False\\n else:\\n xPrev, stackPrev = xVal, stack\\n return True\\n\",\n \"memory\": \"23300\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n events = []\\n for x, y, a, b in rectangles:\\n events.append((x, 1, y, b))\\n events.append((a, 0, y, b))\\n n = len(events)\\n events.sort()\\n xStart, xEnd = events[0][0], events[-1][0]\\n i = 0\\n xPrev, stackPrev = -1, []\\n while i < n:\\n xVal, etypeVal, _, _ = events[i]\\n stack = []\\n while i < n:\\n x, etype, y0, y1 = events[i]\\n if x != xVal or etype != etypeVal:\\n break\\n if stack and stack[-1][1] == y0:\\n y0 = stack.pop()[0]\\n stack.append((y0, y1))\\n i += 1\\n print(stack, xVal, etypeVal)\\n if etypeVal == 1:\\n if xVal == xStart:\\n if len(stack) != 1:\\n return False\\n elif xVal != xPrev or stack != stackPrev:\\n return False\\n else:\\n xPrev, stackPrev = xVal, stack\\n return True\\n\",\n \"memory\": \"23700\"\n },\n {\n \"code\": \"from collections import defaultdict \\nclass Solution:\\n # Time: O()\\n # Space: O(), where n = len(rectangles)\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n n = len(rectangles)\\n v, h = [], []\\n tot_area = 0\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n \\n points = set()\\n for x1, y1, x2, y2 in rectangles:\\n v.append([x1, 0])\\n v.append([x2, 1])\\n h.append([y1, 0])\\n h.append([y2, 1])\\n tot_area += (y2-y1)*(x2-x1)\\n min_x = min(min_x, x1, x2)\\n min_y = min(min_y, y1, y2)\\n max_x = max(max_x, x1, x2)\\n max_y = max(max_y, y1, y2)\\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for p in pts:\\n if p in points:\\n points.remove(p)\\n else:\\n points.add(p)\\n\\n if tot_area != (max_y-min_y)*(max_x-min_x):\\n return 0\\n\\n if len(points) != 4: \\n return False\\n \\n v.sort(), h.sort()\\n count = 0\\n for x, type_ in v[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0\\n count = 0\\n for x, type_ in h[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0 \\n \\n if (min_x, min_y) not in points:\\n return 0\\n if (min_x, max_y) not in points:\\n return 0\\n if (max_x, min_y) not in points:\\n return 0\\n if (max_x, max_y) not in points:\\n return 0 \\n\\n return 1 \\n\",\n \"memory\": \"23900\"\n },\n {\n \"code\": \"from collections import defaultdict \\nclass Solution:\\n # Time: O()\\n # Space: O(), where n = len(rectangles)\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n n = len(rectangles)\\n v, h = [], []\\n tot_area = 0\\n min_x = min_y = float('inf')\\n max_x = max_y = float('-inf')\\n \\n points = set()\\n for x1, y1, x2, y2 in rectangles:\\n v.append([x1, 0])\\n v.append([x2, 1])\\n h.append([y1, 0])\\n h.append([y2, 1])\\n tot_area += (y2-y1)*(x2-x1)\\n min_x = min(min_x, x1, x2)\\n min_y = min(min_y, y1, y2)\\n max_x = max(max_x, x1, x2)\\n max_y = max(max_y, y1, y2)\\n pts = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for p in pts:\\n if p in points:\\n points.remove(p)\\n else:\\n points.add(p)\\n\\n if tot_area != (max_y-min_y)*(max_x-min_x):\\n return 0\\n\\n if len(points) != 4: \\n return False\\n \\n v.sort(), h.sort()\\n count = 0\\n for x, type_ in v[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0\\n count = 0\\n for x, type_ in h[:-1]:\\n count = (count+1) if type_ == 0 else (count-1)\\n if not count:\\n return 0 \\n \\n if (min_x, min_y) not in points:\\n return 0\\n if (min_x, max_y) not in points:\\n return 0\\n if (max_x, min_y) not in points:\\n return 0\\n if (max_x, max_y) not in points:\\n return 0 \\n\\n return 1 \\n\",\n \"memory\": \"23900\"\n },\n {\n \"code\": \"class Solution:\\n def get_y_area(self, active_intervals):\\n if not active_intervals: return (-1, -1)\\n active_intervals.sort()\\n # print(\\\"active_intervals\\\", active_intervals)\\n for i in range(1, len(active_intervals)):\\n y_start, y_end = active_intervals[i]\\n if y_start != active_intervals[i-1][1]:\\n return (-1, -1)\\n return (active_intervals[0][0], active_intervals[-1][1])\\n\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n events = []\\n START, END = 1, 0\\n for x1,y1,x2,y2 in rectangles:\\n events.append((x1, START, y1, y2))\\n events.append((x2, END, y1, y2))\\n \\n events.sort()\\n # print(events)\\n x_last = events[0][0]\\n cur_intervals = []\\n res_rectangles = []\\n for x, typ, y_start, y_end in events:\\n # add event\\n # print(\\\"x\\\", x, \\\"typ\\\", typ, \\\"y_start\\\", y_start, \\\"y_end\\\", y_end)\\n if x != x_last:\\n y1, y2 = self.get_y_area(cur_intervals)\\n if (y1,y2) == (-1,-1): \\n return False # overlapping found\\n res_rectangles.append((x_last, y1, x, y2))\\n x_last = x\\n if typ == START:\\n cur_intervals.append((y_start, y_end))\\n else:\\n cur_intervals.remove((y_start, y_end))\\n \\n print(res_rectangles)\\n for i in range(1, len(res_rectangles)):\\n last_x1, last_y1, last_x2, last_y2 = res_rectangles[i-1]\\n x1, y1, x2, y2 = res_rectangles[i]\\n if last_x2 != x1 or last_y1 != y1 or last_y2 != y2:\\n return False\\n return True\\n\\n \",\n \"memory\": \"24000\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n if len(rectangles) == 5 and rectangles == [[0,1,2,3],[0,1,1,2],[2,2,3,3],[1,0,3,1],[2,0,3,1]] :\\n return False \\n events = []\\n events_l = []\\n for i in range(len(rectangles)) :\\n if i<len(rectangles) - 1 and rectangles[i]==rectangles[i+1] :\\n return False\\n rect = rectangles[i]\\n ar = (rect[3]-rect[1])\\n ar_l = (rect[2]-rect[0])\\n events.append([rect[0], ar]) \\n events.append([rect[2], -1*ar]) \\n events_l.append([rect[1], ar_l]) \\n events_l.append([rect[3], -1*ar_l]) \\n events.sort(key=lambda x : x[0]) \\n events_l.sort(key=lambda x : x[0])\\n l_p = events[0][0]\\n ar = 0\\n area = None\\n for l, a in events :\\n if l!= l_p :\\n if area == None :\\n area = ar\\n elif ar!= area :\\n return False \\n l_p = l \\n ar += a \\n else :\\n ar += a\\n l_p = events_l[0][0]\\n ar = 0\\n area = None\\n for l, a in events_l :\\n if l!= l_p :\\n if area == None :\\n area = ar\\n elif ar!= area :\\n return False \\n l_p = l \\n ar += a \\n else :\\n ar += a \\n return True\\n\\n\\n\\n \",\n \"memory\": \"24100\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n start_x, start_y = 1e6, 1e6\\n h_max, h_min = -1e6, 1e6 \\n w_max, w_min = -1e6, 1e6 \\n for rect in rectangles :\\n if rect[0] <= start_x :\\n start_x = rect[0] \\n h_max = max(h_max, rect[3])\\n h_min = min(h_min, rect[1]) \\n if rect[1] <= start_y :\\n start_y = rect[1] \\n w_max = max(w_max, rect[2])\\n w_min = min(w_min, rect[0]) \\n mx_ht = h_max - h_min\\n mx_wd = w_max-w_min\\n events = []\\n events_l = []\\n for i in range(len(rectangles)) :\\n rect = rectangles[i]\\n ar = (rect[3]-rect[1])\\n ar_l = (rect[2]-rect[0])\\n events.append([rect[0], ar]) \\n events.append([rect[2], -1*ar]) \\n events_l.append([rect[1], ar_l]) \\n events_l.append([rect[3], -1*ar_l]) \\n events.sort(key=lambda x : x[0]) \\n events_l.sort(key=lambda x : x[0])\\n l_p = events[0][0]\\n ar = 0\\n area = None\\n for l, a in events :\\n if l!= l_p :\\n if area == None :\\n area = ar\\n if area > mx_ht :\\n return False\\n elif ar!= area :\\n return False \\n l_p = l \\n ar += a \\n else :\\n ar += a\\n l_p = events_l[0][0]\\n ar = 0\\n area = None\\n for l, a in events_l :\\n if l!= l_p :\\n if area == None :\\n area = ar\\n if area > mx_wd :\\n return False\\n elif ar!= area :\\n return False \\n l_p = l \\n ar += a \\n else :\\n ar += a \\n return True\\n\\n\\n\\n \",\n \"memory\": \"24200\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area = 0\\n minX, minY = rectangles[0][0], rectangles[0][1]\\n maxX, maxY = rectangles[0][2], rectangles[0][3]\\n cnt = defaultdict(int)\\n\\n for r in rectangles:\\n area += (r[2] - r[0]) * (r[3] - r[1])\\n\\n minX = min(minX, r[0])\\n minY = min(minY, r[1])\\n maxX = max(maxX, r[2])\\n maxY = max(maxY, r[3])\\n\\n cnt[(r[0], r[1])] += 1\\n cnt[(r[0], r[3])] += 1\\n cnt[(r[2], r[3])] += 1\\n cnt[(r[2], r[1])] += 1\\n\\n if (\\n area != (maxX - minX) * (maxY - minY)\\n or cnt[(minX, minY)] != 1\\n or cnt[(minX, maxY)] != 1\\n or cnt[(maxX, maxY)] != 1\\n or cnt[(maxX, minY)] != 1\\n ):\\n return False\\n\\n del cnt[(minX, minY)], cnt[(minX, maxY)], cnt[(maxX, maxY)], cnt[(maxX, minY)]\\n\\n return all(c == 2 or c == 4 for c in cnt.values())\\n \",\n \"memory\": \"24400\"\n },\n {\n \"code\": \"class Solution: \\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool: \\n # Use a dictionary to count corners \\n corner_count = {} \\n\\n def add_corner(x, y): \\n if (x, y) in corner_count: \\n corner_count[(x, y)] += 1 \\n else: \\n corner_count[(x, y)] = 1 \\n\\n def remove_corner(x, y): \\n if (x, y) in corner_count: \\n corner_count[(x, y)] -= 1 \\n if corner_count[(x, y)] == 0: \\n del corner_count[(x, y)] \\n\\n # Variables to determine the bounding box of all rectangles \\n min_x = float('inf') \\n min_y = float('inf') \\n max_x = float('-inf') \\n max_y = float('-inf') \\n total_area = 0 \\n\\n for x1, y1, x2, y2 in rectangles: \\n min_x = min(min_x, x1) \\n min_y = min(min_y, y1) \\n max_x = max(max_x, x2) \\n max_y = max(max_y, y2) \\n total_area += (x2 - x1) * (y2 - y1) \\n add_corner(x1, y1) \\n add_corner(x1, y2) \\n add_corner(x2, y1) \\n add_corner(x2, y2) \\n\\n if total_area != (max_x - min_x) * (max_y - min_y): \\n return False \\n\\n expected_corners = {(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)} \\n\\n for corner in expected_corners: \\n if corner not in corner_count or corner_count[corner] != 1: \\n return False \\n del corner_count[corner] \\n\\n for count in corner_count.values(): \\n if count % 2 != 0: \\n return False \\n\\n return True\",\n \"memory\": \"24500\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n bottomLeft = tuple(rectangles[0][:2])\\n topRight = tuple(rectangles[0][2:])\\n totalArea = 0\\n pointFrequency = defaultdict(int) # point -> number of times it appears\\n\\n for r in rectangles:\\n x1, y1, x2, y2 = r\\n totalArea += (x2 - x1) * (y2 - y1)\\n bottomLeft = (x1, y1) if x1 <= bottomLeft[0] and y1 <= bottomLeft[1] else bottomLeft\\n topRight = (x2, y2) if x2 >= topRight[0] and y2 >= topRight[1] else topRight\\n pointFrequency[(x1, y1)] += 1\\n pointFrequency[(x2, y1)] += 1\\n pointFrequency[(x2, y2)] += 1\\n pointFrequency[(x1, y2)] += 1\\n\\n if totalArea != (topRight[0] - bottomLeft[0]) * (topRight[1] - bottomLeft[1]):\\n return False\\n\\n topLeft = (bottomLeft[0], topRight[1])\\n bottomRight = (topRight[0], bottomLeft[1])\\n corners = {bottomLeft, topRight, topLeft, bottomRight}\\n\\n for point, frequency in pointFrequency.items():\\n if point in corners and frequency != 1:\\n return False\\n \\n if point not in corners and frequency % 2 != 0:\\n return False\\n\\n return True\\n\",\n \"memory\": \"24600\"\n },\n {\n \"code\": \"\\nclass Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n bottomLeft = tuple(rectangles[0][:2])\\n topRight = tuple(rectangles[0][2:])\\n totalArea = 0\\n pointFrequency = defaultdict(int) # point -> number of times it appears\\n\\n for r in rectangles:\\n x1, y1, x2, y2 = r\\n totalArea += (x2 - x1) * (y2 - y1)\\n bottomLeft = (x1, y1) if x1 <= bottomLeft[0] and y1 <= bottomLeft[1] else bottomLeft\\n topRight = (x2, y2) if x2 >= topRight[0] and y2 >= topRight[1] else topRight\\n pointFrequency[(x1, y1)] += 1\\n pointFrequency[(x2, y1)] += 1\\n pointFrequency[(x2, y2)] += 1\\n pointFrequency[(x1, y2)] += 1\\n\\n if totalArea != (topRight[0] - bottomLeft[0]) * (topRight[1] - bottomLeft[1]):\\n return False\\n\\n topLeft = (bottomLeft[0], topRight[1])\\n bottomRight = (topRight[0], bottomLeft[1])\\n corners = {bottomLeft, topRight, topLeft, bottomRight}\\n\\n for point, frequency in pointFrequency.items():\\n if point in corners:\\n if frequency != 1:\\n return False\\n elif point not in corners and frequency % 2 != 0:\\n return False\\n\\n return True\\n\",\n \"memory\": \"24600\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles):\\n # Helper function to calculate area\\n def area(rect):\\n return (rect[2] - rect[0]) * (rect[3] - rect[1])\\n \\n # Calculate the total area of all rectangles\\n total_area = sum(area(rect) for rect in rectangles)\\n \\n # Find the bounding rectangle\\n min_x = min(rect[0] for rect in rectangles)\\n min_y = min(rect[1] for rect in rectangles)\\n max_x = max(rect[2] for rect in rectangles)\\n max_y = max(rect[3] for rect in rectangles)\\n \\n bounding_area = (max_x - min_x) * (max_y - min_y)\\n \\n # If the total area is not equal to the bounding rectangle area, return False\\n if total_area != bounding_area:\\n return False\\n \\n # Count the occurrences of each corner point\\n from collections import defaultdict\\n point_count = defaultdict(int)\\n \\n for rect in rectangles:\\n x1, y1, x2, y2 = rect\\n corners = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]\\n for corner in corners:\\n point_count[corner] += 1\\n \\n # Check if the corner points of the bounding rectangle appear exactly once\\n # and all other points appear exactly twice or four times\\n expected_corners = [(min_x, min_y), (min_x, max_y), (max_x, min_y), (max_x, max_y)]\\n for point, count in point_count.items():\\n if point in expected_corners:\\n if count != 1:\\n return False\\n else:\\n if count not in [2, 4]:\\n return False\\n \\n return True\\n\\n# Example usage:\\nsolution = Solution()\\nrectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]\\nprint(solution.isRectangleCover(rectangles)) # Output: True\",\n \"memory\": \"24700\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n left = rectangles[0][0]\\n right = rectangles[0][2]\\n bottom = rectangles[0][1]\\n top = rectangles[0][3]\\n vertex = {}\\n area = 0\\n for x, y, a, b in rectangles:\\n corners = ((x, y), (x, b), (a, y), (a, b))\\n if x < left:\\n left = x\\n if y < bottom:\\n bottom = y\\n if a > right:\\n right = a\\n if b > top:\\n top = b\\n for corner in corners:\\n try:\\n vertex[corner] = not vertex[corner]\\n except:\\n vertex[corner] = True\\n area += (b-y)*(a-x)\\n # print(area)\\n if area != (top-bottom)*(right-left):\\n return False\\n for corner in ((left, top), (left, bottom), (right, top), (right, bottom)):\\n try:\\n vertex[corner] = not vertex[corner]\\n except:\\n vertex[corner] = True\\n \\n # print(vertex)\\n for i in vertex:\\n if vertex[i]:\\n return False\\n return True\\n \\\"\\\"\\\"\\n if area < 50000000:\\n squares = set()\\n for rectangle in rectangles:\\n for x in range(rectangle[0], rectangle[2]):\\n for y in range(rectangle[1], rectangle[3]):\\n if (x, y) in squares:\\n print((x, y))\\n return False\\n squares.add((x, y))\\n else:\\n for rect in range(len(rectangles)):\\n for rect2 in rectangles[rect+1:]:\\n if rectangles[rect][0] < rect2[2] and rectangles[rect][2] > rect2[0] and rectangles[rect][1] < rect2[3] and rectangles[rect][3] > rect2[1]:\\n return False\\n return True\\n \\\"\\\"\\\"\",\n \"memory\": \"24800\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n left = rectangles[0][0]\\n right = rectangles[0][2]\\n bottom = rectangles[0][1]\\n top = rectangles[0][3]\\n vertex = {}\\n area = 0\\n for x, y, a, b in rectangles:\\n corners = ((x, y), (x, b), (a, y), (a, b))\\n if x < left:\\n left = x\\n if y < bottom:\\n bottom = y\\n if a > right:\\n right = a\\n if b > top:\\n top = b\\n for corner in corners:\\n try:\\n vertex[corner] = not vertex[corner]\\n except:\\n vertex[corner] = True\\n area += (b-y)*(a-x)\\n # print(area)\\n if area != (top-bottom)*(right-left):\\n return False\\n for corner in ((left, top), (left, bottom), (right, top), (right, bottom)):\\n try:\\n vertex[corner] = not vertex[corner]\\n except:\\n vertex[corner] = True\\n \\n # print(vertex)\\n for i in vertex:\\n if vertex[i]:\\n return False\\n return True\\n \\\"\\\"\\\"\\n if area < 50000000:\\n squares = set()\\n for rectangle in rectangles:\\n for x in range(rectangle[0], rectangle[2]):\\n for y in range(rectangle[1], rectangle[3]):\\n if (x, y) in squares:\\n print((x, y))\\n return False\\n squares.add((x, y))\\n else:\\n for rect in range(len(rectangles)):\\n for rect2 in rectangles[rect+1:]:\\n if rectangles[rect][0] < rect2[2] and rectangles[rect][2] > rect2[0] and rectangles[rect][1] < rect2[3] and rectangles[rect][3] > rect2[1]:\\n return False\\n return True\\n \\\"\\\"\\\"\",\n \"memory\": \"24900\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n points = [p for r in rectangles for p in self.get_all_points(r)]\\n counts = Counter(points)\\n odds = [p for p in points if counts[p] % 2]\\n \\n if len(odds) != 4:\\n return False\\n\\n if len([p for p in points if counts[p] > 4]) > 0:\\n return False\\n \\n area_sum = sum(self.area(x) for x in rectangles)\\n min_x = min([x[0] for x in odds])\\n max_x = max([x[0] for x in odds])\\n min_y = min([x[1] for x in odds])\\n max_y = max([x[1] for x in odds])\\n\\n if area_sum != abs(min_x - max_x) * abs(min_y - max_y):\\n return False\\n \\n for x in (min_x, max_x):\\n for y in (min_y, max_y):\\n if counts[(x, y)] != 1:\\n return False\\n \\n return True\\n\\n def get_all_points(self, coords):\\n x1, y1, x2, y2 = coords\\n return [(x1, y1), (x2, y2), (x2, y1), (x1, y2)]\\n \\n\\n def area(self, coords):\\n x1, y1, x2, y2 = coords\\n return abs(x1-x2) * abs(y1-y2)\",\n \"memory\": \"25100\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n points = collections.defaultdict(list)\\n n = len(rectangles)\\n area = 0\\n\\n for i in range(n):\\n x, y, a, b = rectangles[i]\\n points[(x, y)].append(i)\\n points[(a, b)].append(i)\\n points[(x, b)].append(i)\\n points[(a, y)].append(i)\\n area += (a-x) * (b-y)\\n\\n conners = []\\n for k, v in points.items():\\n if len(v) == 1:\\n conners.append(k)\\n elif len(v) not in (2, 4):\\n return False\\n\\n if len(conners) != 4:\\n return False\\n\\n mini, maxi = min(conners, key=lambda x:(x[0], x[1])), max(conners, key=lambda x:(x[0], x[1]))\\n\\n return area == (maxi[0] - mini[0]) * (maxi[1] - mini[1])\",\n \"memory\": \"25200\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n area_sum = 0\\n mn_x = float(\\\"inf\\\")\\n mx_x = -float(\\\"inf\\\")\\n mn_y = float(\\\"inf\\\")\\n mx_y = -float(\\\"inf\\\")\\n seen_corners = {}\\n seen_rects = set()\\n\\n for first_x, first_y, second_x, second_y in rectangles:\\n area_sum += (second_x - first_x) * (second_y - first_y)\\n mx_x = max(mx_x, second_x)\\n mn_x = min(mn_x, first_x)\\n mx_y = max(mx_y, second_y)\\n mn_y = min(mn_y, first_y)\\n\\n if (first_x, first_y, second_x, second_y) in seen_rects:\\n return False\\n seen_rects.add((first_x, first_y, second_x, second_y))\\n\\n seen_corners[(first_x, first_y)] = seen_corners.get((first_x, first_y), 0) + 1\\n seen_corners[(second_x, second_y)] = seen_corners.get((second_x, second_y), 0) + 1 \\n seen_corners[(second_x, first_y)] = seen_corners.get((second_x, first_y), 0) + 1 \\n seen_corners[(first_x, second_y)] = seen_corners.get((first_x, second_y), 0) + 1 \\n\\n\\n main_corners = ((mn_x, mn_y), (mn_x, mx_y), (mx_x, mx_y), (mx_x, mn_y))\\n for coors, count in seen_corners.items():\\n if (coors[0], coors[1]) not in main_corners and count & 1 == 1: \\n return False\\n\\n return area_sum == (mx_x - mn_x) * (mx_y - mn_y)\",\n \"memory\": \"25300\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n \\n area=0\\n aa,bb=float('inf'),float('inf')\\n cc,dd=0,0\\n dic=defaultdict(int)\\n already=set()\\n\\n for a,b,c,d in rectangles:\\n if (a,b,c,d) in already:\\n return False\\n already.add((a,b,c,d))\\n if a<=aa and b<=bb:\\n aa,bb=a,b\\n if c>=cc and d>=dd:\\n cc,dd=c,d\\n area+=(c-a)*(d-b)\\n dic[(a,b)]+=1\\n dic[(c,d)]+=1\\n dic[(a,d)]+=1\\n dic[(c,b)]+=1\\n \\n if area!=(cc-aa)*(dd-bb):\\n return False\\n \\n dic[(aa,bb)]=2\\n dic[(aa,dd)]=2\\n dic[(cc,dd)]=2\\n dic[(cc,bb)]=2\\n\\n for x in dic:\\n if dic[x] not in {2,4}:\\n return False\\n \\n return True\\n\\n\\n\\n\\n\",\n \"memory\": \"25400\"\n },\n {\n \"code\": \"class Solution:\\n def isRectangleCover(self, rectangles: List[List[int]]) -> bool:\\n rectangles.sort()\\n prev = defaultdict(int)\\n end = defaultdict(deque)\\n srtd = set()\\n x0 = rectangles[0][0]\\n xn = rectangles[0][0]\\n prev[x0] = rectangles[0][1]\\n\\n for x1, y1, x2, y2 in rectangles:\\n if end[x1] and x1 not in srtd:\\n srtd.add(x1)\\n end[x1] = deque(sorted(end[x1]))\\n yend = y1\\n while end[x1] and end[x1][0][0] == yend:\\n if y2 >= end[x1][0][1]:\\n yend = end[x1][0][1]\\n end[x1].popleft()\\n else:\\n end[x1][0][0] = y2\\n yend = y2\\n break\\n if x1 != x0 and yend != y2:\\n return False\\n \\n if x1 == x0 and prev[x1] != y1:\\n return False\\n prev[x1] = y2\\n \\n end[x2].append([y1, y2])\\n xn = max(xn, x2)\\n \\n for k, v in end.items():\\n if k != xn and v:\\n return False\\n\\n return True\",\n \"memory\": \"26600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":37,"string":"37"}}},{"rowIdx":294,"cells":{"question_id":{"kind":"number","value":392,"string":"392"},"name":{"kind":"string","value":"is-subsequence"},"content":{"kind":"string","value":"<p>Given two strings <code>s</code> and <code>t</code>, return <code>true</code><em> if </em><code>s</code><em> is a <strong>subsequence</strong> of </em><code>t</code><em>, or </em><code>false</code><em> otherwise</em>.</p>\n\n<p>A <strong>subsequence</strong> of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., <code>"ace"</code> is a subsequence of <code>"<u>a</u>b<u>c</u>d<u>e</u>"</code> while <code>"aec"</code> is not).</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n<pre><strong>Input:</strong> s = \"abc\", t = \"ahbgdc\"\n<strong>Output:</strong> true\n</pre><p><strong class=\"example\">Example 2:</strong></p>\n<pre><strong>Input:</strong> s = \"axc\", t = \"ahbgdc\"\n<strong>Output:</strong> false\n</pre>\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>0 <= s.length <= 100</code></li>\n\t<li><code>0 <= t.length <= 10<sup>4</sup></code></li>\n\t<li><code>s</code> and <code>t</code> consist only of lowercase English letters.</li>\n</ul>\n\n<p> </p>\n<strong>Follow up:</strong> Suppose there are lots of incoming <code>s</code>, say <code>s<sub>1</sub>, s<sub>2</sub>, ..., s<sub>k</sub></code> where <code>k >= 10<sup>9</sup></code>, and you want to check one by one to see if <code>t</code> has its subsequence. In this scenario, how would you change your code?"},"acRate":{"kind":"number","value":48.08894848599504,"string":"48.088948"},"difficulty":{"kind":"string","value":"Easy"},"topics":{"kind":"list like","value":["two-pointers","string","dynamic-programming"],"string":"[\n \"two-pointers\",\n \"string\",\n \"dynamic-programming\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"12\", 0.0026], [\"14\", 0.0026], [\"15\", 0.0158], [\"16\", 0.0185], [\"17\", 0.0079], [\"18\", 0.0343], [\"19\", 0.211], [\"20\", 0.1266], [\"21\", 0.124], [\"22\", 0.4958], [\"23\", 0.6937], [\"24\", 0.4774], [\"25\", 0.7622], [\"26\", 1.7645], [\"27\", 2.2788], [\"28\", 1.4453], [\"29\", 2.4713], [\"30\", 5.1642], [\"31\", 5.1721], [\"32\", 3.8718], [\"33\", 4.9136], [\"34\", 8.9964], [\"35\", 7.7357], [\"36\", 5.6679], [\"37\", 6.4803], [\"38\", 8.7643], [\"39\", 7.4113], [\"40\", 5.0086], [\"41\", 4.5259], [\"42\", 4.4336], [\"43\", 3.6081], [\"44\", 2.2181]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16000\", 0.0026], [\"16100\", 0.0105], [\"16200\", 0.0185], [\"16300\", 0.4616], [\"16400\", 8.2738], [\"16500\", 26.3299], [\"16600\", 46.657]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n counter = len(s)\n j = 0\n for i in range(len(s)):\n if j == len(t):\n break\n while j < len(t):\n if s[i] == t[j]:\n counter -= 1\n j+=1\n break\n j+=1\n return counter == 0\n \n \n\n ","runtime":"12"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n p1, p2= 0, 0\n while p2< len(t) and p1 < len(s):\n # print(t[p2], s[p1], p1, i)\n if t[p2] == s[p1]:\n p1 += 1\n p2 += 1\n # print(p1)\n return p1 == len(s)\n ","runtime":"14"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i = 0\n\n while s and i < len(t):\n if s and t[i] == s[0]:\n s = s[1:]\n i += 1\n \n if not s:\n return True\n","runtime":"15"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n p1 = 0\n for c in t:\n if p1 >= len(s):\n return True\n if s[p1] == c:\n p1 += 1\n return p1 == len(s)","runtime":"16"},{"code":"import string\n\nclass Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n # trans_map = str.maketrans('', '', \"\".join([c for c in string.ascii_lowercase if c not in s]))\n # translated = t.translate(trans_map)\n\n tr_idx = 0\n ss_idx = 0\n\n # while tr_idx < len(translated) and ss_idx < len(s):\n while tr_idx < len(t) and ss_idx < len(s):\n # if translated[tr_idx] == s[ss_idx]:\n if t[tr_idx] == s[ss_idx]:\n ss_idx += 1\n tr_idx += 1\n\n return ss_idx == len(s)\n ","runtime":"17"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) == 0:\n return True\n idx = 0\n for i in t:\n if s[idx] == i:\n idx += 1\n if idx == len(s):\n return True\n return False\n ","runtime":"18"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n first = 0\n if len(s)==0:\n return True\n for second in range(len(t)):\n if first<len(s) and s[first] == t[second]:\n first += 1\n return first==len(s)","runtime":"19"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_index = t_index = 0\n\n while t_index < len(t) and s_index < len(s):\n if s[s_index] == t[t_index]:\n s_index += 1\n t_index += 1\n\n return s_index == len(s)\n ","runtime":"19"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if not s:\n return True\n i = 0\n for c in t:\n if c == s[i]:\n i+=1\n if i >= len(s):\n return True\n return False","runtime":"20"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i = 0\n j = 0\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1\n j += 1\n return i == len(s)\n","runtime":"23"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n pointer1 = 0\n pointer2 = 0\n while(pointer1<len(s) and pointer2<len(t)):\n if s[pointer1]==t[pointer2]:\n pointer1+=1\n pointer2+=1\n else:\n pointer2+=1\n if(pointer1==len(s)):\n return True\n return False","runtime":"23"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n for char in t:\n if not s:\n return True\n \n if s[0] == char:\n s = s[1:]\n\n return True if not s else False","runtime":"24"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i, j = 0, 0\n m = len(s)\n n = len(t)\n while i < m and j < n:\n if s[i] == t[j]:\n i += 1\n j += 1\n else:\n j += 1\n\n return True if i == m else False\n","runtime":"24"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if s in t:\n return True\n c=0\n a=-1\n for i in s:\n if i in t:\n a=t.index(i)\n t=t[a+1:]\n c=c+1\n \n if c==len(s):\n return True\n else:\n return False","runtime":"25"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n left = right = 0\n\n while left < len(s) and right<len(t):\n if s[left] == t[right]:\n left +=1\n right +=1\n\n return left == len(s)\n","runtime":"25"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if(len(s)==0):\n return True\n j=0\n for i in t:\n if(i==s[j]):\n j+=1\n if(j==len(s)):\n return True\n return False","runtime":"26"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_len = len(s)\n t_len = len(t)\n\n s_index = 0 \n t_index = 0 \n \n while t_index < t_len:\n if s_index < s_len and s[s_index] == t[t_index]:\n s_index += 1\n t_index += 1\n \n return s_index == s_len","runtime":"26"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i, j = 0, 0\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1\n j += 1\n return i == len(s)","runtime":"27"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s=list(s)\n t=list(t)\n p=0\n k=[]\n if s==[]:\n return True\n for i in t:\n if p<len(s) and i==s[p]:\n p+=1\n k.append(i)\n if p==len(s):\n break\n return k==s","runtime":"27"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n sp = tp = 0\n\n while sp<len(s) and tp<len(t):\n if s[sp] == t[tp]:\n sp += 1\n tp += 1\n return sp == len(s)\n\n ","runtime":"28"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n pt = 0\n end = len(s)\n\n if end == 0:\n return True\n\n for i in range(len(t)):\n if t[i] == s[pt]:\n pt += 1\n if pt == end:\n return True\n return False\n \n\n","runtime":"28"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if not s:\n return True\n i = 0\n for j in range(len(t)):\n if t[j] == s[i]:\n i += 1\n if i == len(s):\n return True\n \n return False","runtime":"29"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n # if len(s) > 0:\n # stack = list(s)\n # else:\n # return True\n\n # for char in t[::-1]:\n # if char == stack[-1]:\n # # print(char, stack[-1] )\n # stack.pop()\n # if len(stack) == 0:\n # return True\n \n # return False\n \n\n # s_c, t_c = 0, 0\n # while s_c < len(s) and t_c < len(t):\n # if s[s_c] == t[t_c]:\n # s_c += 1\n \n # t_c += 1\n # return s_c == len(s)\n\n\n\n # stack = []\n # if len(s) > 0:\n # stack = list(s[::-1])\n\n # i =0\n # while stack and i < len(t):\n # if stack[-1] == t[i]:\n # stack.pop()\n # i += 1\n \n # return len(stack) == 0\n\n if len(s) == 0:\n return True \n\n i = 0\n for char in t:\n if char == s[i]:\n i+= 1\n if i == len(s):\n return True\n \n \n \n return False\n\n\n\n\n\n \n\n ","runtime":"29"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i, j = 0, 0\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1\n j += 1\n return i == len(s)","runtime":"30"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) > len(t):\n return False\n \n i = 0\n for c in t:\n if i >= len(s):\n break\n\n # If match, check next char\n if c == s[i]:\n i += 1\n \n return i >= len(s)\n \n\n","runtime":"30"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) == len(t): \n if s == t: \n return True \n else: \n return False \n \n if len(s) > len(t): \n return False\n s = list(s)\n for char in t: \n if len(s) == 0: \n return True\n if s[0] == char: \n s.pop(0)\n if len(s) == 0: \n return True\n \n return False\n ","runtime":"31"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n m, n = len(s), len(t)\n i, j = 0, 0\n \n while i < m and j < n:\n if s[i] == t[j]:\n i += 1 # Move pointer in s\n j += 1 # Always move pointer in t\n \n return i == m # Check if we successfully went through all of s\n","runtime":"31"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_position = 0\n if len(s) == 0:\n return True\n for i in range(len(t)):\n if t[i] == s[s_position]:\n s_position += 1\n if s_position == len(s):\n return True\n return False","runtime":"32"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_pointer, t_pointer = 0, 0\n while s_pointer < len(s) and t_pointer < len(t):\n if s[s_pointer] == t[t_pointer]:\n s_pointer += 1\n t_pointer += 1\n return s_pointer == len(s)\n \n ","runtime":"32"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n # if len(s) > 0:\n # stack = list(s)\n # else:\n # return True\n\n # for char in t[::-1]:\n # if char == stack[-1]:\n # # print(char, stack[-1] )\n # stack.pop()\n # if len(stack) == 0:\n # return True\n \n # return False\n\n # s_c, t_c = 0, 0\n # while s_c < len(s) and t_c < len(t):\n # if s[s_c] == t[t_c]:\n # s_c += 1\n \n # t_c += 1\n # return s_c == len(s)\n stack = []\n if len(s) > 0:\n stack = list(s[::-1])\n\n i =0\n while stack and i < len(t):\n if stack[-1] == t[i]:\n stack.pop()\n i += 1\n \n return len(stack) == 0\n\n\n\n\n\n \n\n ","runtime":"33"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n \n if not s:\n return True\n\n\n counter = 0\n for char in t:\n if char == s[counter]:\n counter+= 1\n if counter == len(s):\n return True\n\n return False","runtime":"33"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n m=len(s)\n n=len(t)\n i,j=0,0\n while i<m and j<n:\n if s[i]==t[j]:\n i+=1\n j+=1\n if i==m:\n return True\n else:\n return False\n","runtime":"34"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(t) < len(s):\n return False\n \n p1, p2 = 0, 0\n while p1 < len(s) and p2 < len(t):\n if s[p1] == t[p2]:\n p1 += 1\n p2 += 1\n \n return p1 == len(s)","runtime":"34"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n\n i, j = 0, 0\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1\n j += 1\n\n return i == len(s)\n \n ","runtime":"35"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if s==\"\":\n return True\n if len(s) >= len(t) and s != t: \n return False\n i_s = 0\n i_t = 0 \n while i_t < len(t):\n if t[i_t] == s[i_s]:\n i_s+=1\n if i_s == len(s):\n return True\n i_t+= 1\n return False","runtime":"35"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) > 0:\n stack = list(s)\n else:\n return True\n\n for char in t[::-1]:\n if char == stack[-1]:\n # print(char, stack[-1] )\n stack.pop()\n if len(stack) == 0:\n return True\n \n return False\n ","runtime":"36"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n j=0\n i=0\n while(i<len(s) and j<len(t)):\n if(s[i]==t[j]):\n i+=1\n j+=1\n return i == len(s)","runtime":"36"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_position = 0\n if len(s) == 0:\n return True\n for i in range(len(t)):\n if t[i] == s[s_position]:\n s_position += 1\n if s_position == len(s):\n return True\n return False","runtime":"37"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) < 1:\n return True\n # Create a stack\n s_stack = [x for x in s[::-1]]\n for word in t:\n if word==s_stack[-1]:\n s_stack.pop()\n \n if len(s_stack)==0:\n return True\n\n return len(s_stack)==0\n \n ","runtime":"37"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_pointer = t_pointer = 0\n while s_pointer < len(s) and t_pointer < len(t):\n if s[s_pointer] == t[t_pointer]:\n s_pointer += 1\n t_pointer += 1\n return s_pointer == len(s)","runtime":"38"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if s == \"\":\n return True\n if t == \"\" and s != \"\":\n return False\n scurlet = 0\n tcurlet = 0\n slen = len(s)\n while tcurlet < len(t):\n if s[scurlet] == t[tcurlet]:\n scurlet += 1\n if scurlet == slen:\n return True\n tcurlet += 1\n return False\n \n\n ","runtime":"38"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i = 0 \n j = 0 \n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1 \n j += 1 \n return i == len(s)\n\n\n\n ","runtime":"39"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n nt, ns = len(t), len(s)\n if s=='': return True\n if ns > nt: return False\n i, j = 0, 0\n while i<nt and j<ns:\n if t[i] == s[j]:\n if j == ns - 1:\n return True\n j+=1\n i+=1\n return False","runtime":"39"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if s == \"\":\n return True\n if t == \"\" and s != \"\":\n return False\n scurlet = 0\n tcurlet = 0\n slen = len(s)\n while tcurlet < len(t):\n if s[scurlet] == t[tcurlet]:\n scurlet += 1\n if scurlet == slen:\n return True\n tcurlet += 1\n return False\n \n\n ","runtime":"40"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if not s: \n return True\n\n\n if len(s) > len(t): \n return False \n \n i = 0\n j = 0 \n\n for j in range(len(t)): \n if t[j] == s[i]: \n i += 1\n if i == len(s): \n return True\n j += 1\n\n return False","runtime":"40"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) > 0:\n stack = list(s)\n else:\n return True\n\n # print(stack)\n # print(t[::-1])\n\n for char in t[::-1]:\n if char == stack[-1]:\n # print(char, stack[-1] )\n stack.pop()\n if len(stack) == 0:\n return True\n \n return False\n ","runtime":"41"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n indexS = 0\n indexT = 0\n\n if len(t) == 0:\n if len(s) == 0:\n return True\n else:\n return False\n if len(s) == 0:\n return True\n\n while indexT < len(t):\n if indexS < len(s) and s[indexS] == t[indexT]:\n indexS += 1\n if indexS == len(s):\n return True\n indexT += 1\n\n return False\n \n","runtime":"41"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n count = 0\n index = 0\n if s == \"\":\n return True\n for i in range(len(t)):\n if index < len(s) and s[index] == t[i]:\n count += 1\n index += 1\n if count == len(s):\n return True\n\n return False","runtime":"42"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n j=0\n i=0\n n=0\n while(i<len(s) and j<len(t)):\n if(s[i]==t[j]):\n i+=1\n j+=1\n return i == len(s)","runtime":"42"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i, j = 0, 0 # Initialize pointers for s and t\n\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n i += 1 # Move to the next character in s\n j += 1 # Always move to the next character in t\n\n return i == len(s) # Check if all characters in s were matched","runtime":"43"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n s_pointer=0\n t_pointer=0\n while(t_pointer<len(t) and s_pointer<len(s)):\n if(s[s_pointer]==t[t_pointer]):\n s_pointer+=1\n t_pointer+=1\n else:\n t_pointer+=1\n if(s_pointer==len(s)):\n return True\n else:\n return False\n\n ","runtime":"43"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n # if len(s) > 0:\n # stack = list(s)\n # else:\n # return True\n\n # for char in t[::-1]:\n # if char == stack[-1]:\n # # print(char, stack[-1] )\n # stack.pop()\n # if len(stack) == 0:\n # return True\n \n # return False\n\n # s_c, t_c = 0, 0\n # while s_c < len(s) and t_c < len(t):\n # if s[s_c] == t[t_c]:\n # s_c += 1\n \n # t_c += 1\n # return s_c == len(s)\n\n if len(s) > 0:\n stack = list(s[::-1])\n else:\n return True\n\n i =0\n while stack and i < len(t):\n print(stack)\n if stack[-1] == t[i]:\n stack.pop()\n \n i += 1\n \n return len(stack) == 0\n\n\n\n\n\n \n\n ","runtime":"44"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) == 0:\n return True\n elif len(t) == 0:\n return False\n j = 0\n for i in range(len(t)):\n if s[j] == t[i]:\n j += 1\n if j == len(s):\n return True\n return False\n ","runtime":"44"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n counter = len(s)\\n j = 0\\n for i in range(len(s)):\\n if j == len(t):\\n break\\n while j < len(t):\\n if s[i] == t[j]:\\n counter -= 1\\n j+=1\\n break\\n j+=1\\n return counter == 0\\n \\n \\n\\n \",\n \"runtime\": \"12\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n p1, p2= 0, 0\\n while p2< len(t) and p1 < len(s):\\n # print(t[p2], s[p1], p1, i)\\n if t[p2] == s[p1]:\\n p1 += 1\\n p2 += 1\\n # print(p1)\\n return p1 == len(s)\\n \",\n \"runtime\": \"14\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i = 0\\n\\n while s and i < len(t):\\n if s and t[i] == s[0]:\\n s = s[1:]\\n i += 1\\n \\n if not s:\\n return True\\n\",\n \"runtime\": \"15\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n p1 = 0\\n for c in t:\\n if p1 >= len(s):\\n return True\\n if s[p1] == c:\\n p1 += 1\\n return p1 == len(s)\",\n \"runtime\": \"16\"\n },\n {\n \"code\": \"import string\\n\\nclass Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n # trans_map = str.maketrans('', '', \\\"\\\".join([c for c in string.ascii_lowercase if c not in s]))\\n # translated = t.translate(trans_map)\\n\\n tr_idx = 0\\n ss_idx = 0\\n\\n # while tr_idx < len(translated) and ss_idx < len(s):\\n while tr_idx < len(t) and ss_idx < len(s):\\n # if translated[tr_idx] == s[ss_idx]:\\n if t[tr_idx] == s[ss_idx]:\\n ss_idx += 1\\n tr_idx += 1\\n\\n return ss_idx == len(s)\\n \",\n \"runtime\": \"17\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) == 0:\\n return True\\n idx = 0\\n for i in t:\\n if s[idx] == i:\\n idx += 1\\n if idx == len(s):\\n return True\\n return False\\n \",\n \"runtime\": \"18\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n first = 0\\n if len(s)==0:\\n return True\\n for second in range(len(t)):\\n if first<len(s) and s[first] == t[second]:\\n first += 1\\n return first==len(s)\",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_index = t_index = 0\\n\\n while t_index < len(t) and s_index < len(s):\\n if s[s_index] == t[t_index]:\\n s_index += 1\\n t_index += 1\\n\\n return s_index == len(s)\\n \",\n \"runtime\": \"19\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if not s:\\n return True\\n i = 0\\n for c in t:\\n if c == s[i]:\\n i+=1\\n if i >= len(s):\\n return True\\n return False\",\n \"runtime\": \"20\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i = 0\\n j = 0\\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n return i == len(s)\\n\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n pointer1 = 0\\n pointer2 = 0\\n while(pointer1<len(s) and pointer2<len(t)):\\n if s[pointer1]==t[pointer2]:\\n pointer1+=1\\n pointer2+=1\\n else:\\n pointer2+=1\\n if(pointer1==len(s)):\\n return True\\n return False\",\n \"runtime\": \"23\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n for char in t:\\n if not s:\\n return True\\n \\n if s[0] == char:\\n s = s[1:]\\n\\n return True if not s else False\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i, j = 0, 0\\n m = len(s)\\n n = len(t)\\n while i < m and j < n:\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n else:\\n j += 1\\n\\n return True if i == m else False\\n\",\n \"runtime\": \"24\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if s in t:\\n return True\\n c=0\\n a=-1\\n for i in s:\\n if i in t:\\n a=t.index(i)\\n t=t[a+1:]\\n c=c+1\\n \\n if c==len(s):\\n return True\\n else:\\n return False\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n left = right = 0\\n\\n while left < len(s) and right<len(t):\\n if s[left] == t[right]:\\n left +=1\\n right +=1\\n\\n return left == len(s)\\n\",\n \"runtime\": \"25\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if(len(s)==0):\\n return True\\n j=0\\n for i in t:\\n if(i==s[j]):\\n j+=1\\n if(j==len(s)):\\n return True\\n return False\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_len = len(s)\\n t_len = len(t)\\n\\n s_index = 0 \\n t_index = 0 \\n \\n while t_index < t_len:\\n if s_index < s_len and s[s_index] == t[t_index]:\\n s_index += 1\\n t_index += 1\\n \\n return s_index == s_len\",\n \"runtime\": \"26\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i, j = 0, 0\\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n return i == len(s)\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s=list(s)\\n t=list(t)\\n p=0\\n k=[]\\n if s==[]:\\n return True\\n for i in t:\\n if p<len(s) and i==s[p]:\\n p+=1\\n k.append(i)\\n if p==len(s):\\n break\\n return k==s\",\n \"runtime\": \"27\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n sp = tp = 0\\n\\n while sp<len(s) and tp<len(t):\\n if s[sp] == t[tp]:\\n sp += 1\\n tp += 1\\n return sp == len(s)\\n\\n \",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n pt = 0\\n end = len(s)\\n\\n if end == 0:\\n return True\\n\\n for i in range(len(t)):\\n if t[i] == s[pt]:\\n pt += 1\\n if pt == end:\\n return True\\n return False\\n \\n\\n\",\n \"runtime\": \"28\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if not s:\\n return True\\n i = 0\\n for j in range(len(t)):\\n if t[j] == s[i]:\\n i += 1\\n if i == len(s):\\n return True\\n \\n return False\",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n # if len(s) > 0:\\n # stack = list(s)\\n # else:\\n # return True\\n\\n # for char in t[::-1]:\\n # if char == stack[-1]:\\n # # print(char, stack[-1] )\\n # stack.pop()\\n # if len(stack) == 0:\\n # return True\\n \\n # return False\\n \\n\\n # s_c, t_c = 0, 0\\n # while s_c < len(s) and t_c < len(t):\\n # if s[s_c] == t[t_c]:\\n # s_c += 1\\n \\n # t_c += 1\\n # return s_c == len(s)\\n\\n\\n\\n # stack = []\\n # if len(s) > 0:\\n # stack = list(s[::-1])\\n\\n # i =0\\n # while stack and i < len(t):\\n # if stack[-1] == t[i]:\\n # stack.pop()\\n # i += 1\\n \\n # return len(stack) == 0\\n\\n if len(s) == 0:\\n return True \\n\\n i = 0\\n for char in t:\\n if char == s[i]:\\n i+= 1\\n if i == len(s):\\n return True\\n \\n \\n \\n return False\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"29\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i, j = 0, 0\\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n return i == len(s)\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) > len(t):\\n return False\\n \\n i = 0\\n for c in t:\\n if i >= len(s):\\n break\\n\\n # If match, check next char\\n if c == s[i]:\\n i += 1\\n \\n return i >= len(s)\\n \\n\\n\",\n \"runtime\": \"30\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) == len(t): \\n if s == t: \\n return True \\n else: \\n return False \\n \\n if len(s) > len(t): \\n return False\\n s = list(s)\\n for char in t: \\n if len(s) == 0: \\n return True\\n if s[0] == char: \\n s.pop(0)\\n if len(s) == 0: \\n return True\\n \\n return False\\n \",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n m, n = len(s), len(t)\\n i, j = 0, 0\\n \\n while i < m and j < n:\\n if s[i] == t[j]:\\n i += 1 # Move pointer in s\\n j += 1 # Always move pointer in t\\n \\n return i == m # Check if we successfully went through all of s\\n\",\n \"runtime\": \"31\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_position = 0\\n if len(s) == 0:\\n return True\\n for i in range(len(t)):\\n if t[i] == s[s_position]:\\n s_position += 1\\n if s_position == len(s):\\n return True\\n return False\",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_pointer, t_pointer = 0, 0\\n while s_pointer < len(s) and t_pointer < len(t):\\n if s[s_pointer] == t[t_pointer]:\\n s_pointer += 1\\n t_pointer += 1\\n return s_pointer == len(s)\\n \\n \",\n \"runtime\": \"32\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n # if len(s) > 0:\\n # stack = list(s)\\n # else:\\n # return True\\n\\n # for char in t[::-1]:\\n # if char == stack[-1]:\\n # # print(char, stack[-1] )\\n # stack.pop()\\n # if len(stack) == 0:\\n # return True\\n \\n # return False\\n\\n # s_c, t_c = 0, 0\\n # while s_c < len(s) and t_c < len(t):\\n # if s[s_c] == t[t_c]:\\n # s_c += 1\\n \\n # t_c += 1\\n # return s_c == len(s)\\n stack = []\\n if len(s) > 0:\\n stack = list(s[::-1])\\n\\n i =0\\n while stack and i < len(t):\\n if stack[-1] == t[i]:\\n stack.pop()\\n i += 1\\n \\n return len(stack) == 0\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n \\n if not s:\\n return True\\n\\n\\n counter = 0\\n for char in t:\\n if char == s[counter]:\\n counter+= 1\\n if counter == len(s):\\n return True\\n\\n return False\",\n \"runtime\": \"33\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n m=len(s)\\n n=len(t)\\n i,j=0,0\\n while i<m and j<n:\\n if s[i]==t[j]:\\n i+=1\\n j+=1\\n if i==m:\\n return True\\n else:\\n return False\\n\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(t) < len(s):\\n return False\\n \\n p1, p2 = 0, 0\\n while p1 < len(s) and p2 < len(t):\\n if s[p1] == t[p2]:\\n p1 += 1\\n p2 += 1\\n \\n return p1 == len(s)\",\n \"runtime\": \"34\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n\\n i, j = 0, 0\\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1\\n j += 1\\n\\n return i == len(s)\\n \\n \",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if s==\\\"\\\":\\n return True\\n if len(s) >= len(t) and s != t: \\n return False\\n i_s = 0\\n i_t = 0 \\n while i_t < len(t):\\n if t[i_t] == s[i_s]:\\n i_s+=1\\n if i_s == len(s):\\n return True\\n i_t+= 1\\n return False\",\n \"runtime\": \"35\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) > 0:\\n stack = list(s)\\n else:\\n return True\\n\\n for char in t[::-1]:\\n if char == stack[-1]:\\n # print(char, stack[-1] )\\n stack.pop()\\n if len(stack) == 0:\\n return True\\n \\n return False\\n \",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n j=0\\n i=0\\n while(i<len(s) and j<len(t)):\\n if(s[i]==t[j]):\\n i+=1\\n j+=1\\n return i == len(s)\",\n \"runtime\": \"36\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_position = 0\\n if len(s) == 0:\\n return True\\n for i in range(len(t)):\\n if t[i] == s[s_position]:\\n s_position += 1\\n if s_position == len(s):\\n return True\\n return False\",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) < 1:\\n return True\\n # Create a stack\\n s_stack = [x for x in s[::-1]]\\n for word in t:\\n if word==s_stack[-1]:\\n s_stack.pop()\\n \\n if len(s_stack)==0:\\n return True\\n\\n return len(s_stack)==0\\n \\n \",\n \"runtime\": \"37\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_pointer = t_pointer = 0\\n while s_pointer < len(s) and t_pointer < len(t):\\n if s[s_pointer] == t[t_pointer]:\\n s_pointer += 1\\n t_pointer += 1\\n return s_pointer == len(s)\",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if s == \\\"\\\":\\n return True\\n if t == \\\"\\\" and s != \\\"\\\":\\n return False\\n scurlet = 0\\n tcurlet = 0\\n slen = len(s)\\n while tcurlet < len(t):\\n if s[scurlet] == t[tcurlet]:\\n scurlet += 1\\n if scurlet == slen:\\n return True\\n tcurlet += 1\\n return False\\n \\n\\n \",\n \"runtime\": \"38\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i = 0 \\n j = 0 \\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1 \\n j += 1 \\n return i == len(s)\\n\\n\\n\\n \",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n nt, ns = len(t), len(s)\\n if s=='': return True\\n if ns > nt: return False\\n i, j = 0, 0\\n while i<nt and j<ns:\\n if t[i] == s[j]:\\n if j == ns - 1:\\n return True\\n j+=1\\n i+=1\\n return False\",\n \"runtime\": \"39\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if s == \\\"\\\":\\n return True\\n if t == \\\"\\\" and s != \\\"\\\":\\n return False\\n scurlet = 0\\n tcurlet = 0\\n slen = len(s)\\n while tcurlet < len(t):\\n if s[scurlet] == t[tcurlet]:\\n scurlet += 1\\n if scurlet == slen:\\n return True\\n tcurlet += 1\\n return False\\n \\n\\n \",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if not s: \\n return True\\n\\n\\n if len(s) > len(t): \\n return False \\n \\n i = 0\\n j = 0 \\n\\n for j in range(len(t)): \\n if t[j] == s[i]: \\n i += 1\\n if i == len(s): \\n return True\\n j += 1\\n\\n return False\",\n \"runtime\": \"40\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) > 0:\\n stack = list(s)\\n else:\\n return True\\n\\n # print(stack)\\n # print(t[::-1])\\n\\n for char in t[::-1]:\\n if char == stack[-1]:\\n # print(char, stack[-1] )\\n stack.pop()\\n if len(stack) == 0:\\n return True\\n \\n return False\\n \",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n indexS = 0\\n indexT = 0\\n\\n if len(t) == 0:\\n if len(s) == 0:\\n return True\\n else:\\n return False\\n if len(s) == 0:\\n return True\\n\\n while indexT < len(t):\\n if indexS < len(s) and s[indexS] == t[indexT]:\\n indexS += 1\\n if indexS == len(s):\\n return True\\n indexT += 1\\n\\n return False\\n \\n\",\n \"runtime\": \"41\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n count = 0\\n index = 0\\n if s == \\\"\\\":\\n return True\\n for i in range(len(t)):\\n if index < len(s) and s[index] == t[i]:\\n count += 1\\n index += 1\\n if count == len(s):\\n return True\\n\\n return False\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n j=0\\n i=0\\n n=0\\n while(i<len(s) and j<len(t)):\\n if(s[i]==t[j]):\\n i+=1\\n j+=1\\n return i == len(s)\",\n \"runtime\": \"42\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i, j = 0, 0 # Initialize pointers for s and t\\n\\n while i < len(s) and j < len(t):\\n if s[i] == t[j]:\\n i += 1 # Move to the next character in s\\n j += 1 # Always move to the next character in t\\n\\n return i == len(s) # Check if all characters in s were matched\",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n s_pointer=0\\n t_pointer=0\\n while(t_pointer<len(t) and s_pointer<len(s)):\\n if(s[s_pointer]==t[t_pointer]):\\n s_pointer+=1\\n t_pointer+=1\\n else:\\n t_pointer+=1\\n if(s_pointer==len(s)):\\n return True\\n else:\\n return False\\n\\n \",\n \"runtime\": \"43\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n # if len(s) > 0:\\n # stack = list(s)\\n # else:\\n # return True\\n\\n # for char in t[::-1]:\\n # if char == stack[-1]:\\n # # print(char, stack[-1] )\\n # stack.pop()\\n # if len(stack) == 0:\\n # return True\\n \\n # return False\\n\\n # s_c, t_c = 0, 0\\n # while s_c < len(s) and t_c < len(t):\\n # if s[s_c] == t[t_c]:\\n # s_c += 1\\n \\n # t_c += 1\\n # return s_c == len(s)\\n\\n if len(s) > 0:\\n stack = list(s[::-1])\\n else:\\n return True\\n\\n i =0\\n while stack and i < len(t):\\n print(stack)\\n if stack[-1] == t[i]:\\n stack.pop()\\n \\n i += 1\\n \\n return len(stack) == 0\\n\\n\\n\\n\\n\\n \\n\\n \",\n \"runtime\": \"44\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) == 0:\\n return True\\n elif len(t) == 0:\\n return False\\n j = 0\\n for i in range(len(t)):\\n if s[j] == t[i]:\\n j += 1\\n if j == len(s):\\n return True\\n return False\\n \",\n \"runtime\": \"44\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":53,"string":"53"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) == 0:\n return True\n if len(s) > len(t):\n return False\n sind = 0; tind = 0;\n while tind < len(t):\n if s[sind] == t[tind]:\n sind = sind + 1;\n tind = tind + 1;\n if sind == len(s):\n return True;\n return False;","memory":"16000"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n queue = list(s)\n \n arr = list(t)\n for ele in arr:\n if queue and ele == queue[0]:\n queue.pop(0)\n \n return True if len(queue)==0 else False\n ","memory":"16100"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n index = 0\n if len(s) == 0:\n return True\n if len(s) > len(t):\n return False\n for c in t:\n if c == s[index]:\n index += 1\n if index >= len(s):\n return True\n return False","memory":"16200"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i,j = 0 , 0 \n num = len(s)\n sub = list(s)\n main = list(t)\n for i in range(len(t)):\n if num == 0 :\n continue\n if sub[j] == main[i]:\n j += 1\n num -= 1\n\n if num == 0:\n return True\n else:\n return False\n\n\n ","memory":"16300"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if not s:\n return True\n i = 0\n for j in range(len(t)):\n if t[j] == s[i]:\n i += 1\n if i == len(s):\n return True\n \n return False","memory":"16400"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n j=0\n i=0\n while(i<len(s) and j<len(t)):\n if(s[i]==t[j]):\n i+=1\n j+=1\n return i == len(s)","memory":"16400"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n i = 0\n if len(s) == 0:\n return True\n if len(t) >= len(s):\n for j in range(len(t)):\n if t[j] == s[i]:\n i += 1\n if i >= len(s):\n break\n if i == len(s):\n return True\n return False","memory":"16500"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n sp = 0\n for i, c in enumerate(t):\n if sp >= len(s):\n return True\n if c == s[sp]:\n sp += 1\n return sp >= len(s)","memory":"16500"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n \n i, j= 0, 0\n while(i < len(s) and j< len(t)): \n if s[i] == t[j]: \n i += 1 \n j += 1 \n else: \n j += 1 \n return True if i == len(s) else False \n \n\n# Input: s = \"abc\", t = \"ahbgdc\"\n\n\n\n# abc \n","memory":"16600"},{"code":"class Solution:\n def isSubsequence(self, s: str, t: str) -> bool:\n if len(s) == 0:\n return True\n \n if len(t) < len(s):\n return False\n \n idx_s = 0\n for t_char in t:\n if s[idx_s] == t_char:\n idx_s += 1\n if idx_s >= len(s):\n return True\n return False\n ","memory":"16600"}],"string":"[\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) == 0:\\n return True\\n if len(s) > len(t):\\n return False\\n sind = 0; tind = 0;\\n while tind < len(t):\\n if s[sind] == t[tind]:\\n sind = sind + 1;\\n tind = tind + 1;\\n if sind == len(s):\\n return True;\\n return False;\",\n \"memory\": \"16000\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n queue = list(s)\\n \\n arr = list(t)\\n for ele in arr:\\n if queue and ele == queue[0]:\\n queue.pop(0)\\n \\n return True if len(queue)==0 else False\\n \",\n \"memory\": \"16100\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n index = 0\\n if len(s) == 0:\\n return True\\n if len(s) > len(t):\\n return False\\n for c in t:\\n if c == s[index]:\\n index += 1\\n if index >= len(s):\\n return True\\n return False\",\n \"memory\": \"16200\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i,j = 0 , 0 \\n num = len(s)\\n sub = list(s)\\n main = list(t)\\n for i in range(len(t)):\\n if num == 0 :\\n continue\\n if sub[j] == main[i]:\\n j += 1\\n num -= 1\\n\\n if num == 0:\\n return True\\n else:\\n return False\\n\\n\\n \",\n \"memory\": \"16300\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if not s:\\n return True\\n i = 0\\n for j in range(len(t)):\\n if t[j] == s[i]:\\n i += 1\\n if i == len(s):\\n return True\\n \\n return False\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n j=0\\n i=0\\n while(i<len(s) and j<len(t)):\\n if(s[i]==t[j]):\\n i+=1\\n j+=1\\n return i == len(s)\",\n \"memory\": \"16400\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n i = 0\\n if len(s) == 0:\\n return True\\n if len(t) >= len(s):\\n for j in range(len(t)):\\n if t[j] == s[i]:\\n i += 1\\n if i >= len(s):\\n break\\n if i == len(s):\\n return True\\n return False\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n sp = 0\\n for i, c in enumerate(t):\\n if sp >= len(s):\\n return True\\n if c == s[sp]:\\n sp += 1\\n return sp >= len(s)\",\n \"memory\": \"16500\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n \\n i, j= 0, 0\\n while(i < len(s) and j< len(t)): \\n if s[i] == t[j]: \\n i += 1 \\n j += 1 \\n else: \\n j += 1 \\n return True if i == len(s) else False \\n \\n\\n# Input: s = \\\"abc\\\", t = \\\"ahbgdc\\\"\\n\\n\\n\\n# abc \\n\",\n \"memory\": \"16600\"\n },\n {\n \"code\": \"class Solution:\\n def isSubsequence(self, s: str, t: str) -> bool:\\n if len(s) == 0:\\n return True\\n \\n if len(t) < len(s):\\n return False\\n \\n idx_s = 0\\n for t_char in t:\\n if s[idx_s] == t_char:\\n idx_s += 1\\n if idx_s >= len(s):\\n return True\\n return False\\n \",\n \"memory\": \"16600\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":10,"string":"10"}}},{"rowIdx":295,"cells":{"question_id":{"kind":"number","value":393,"string":"393"},"name":{"kind":"string","value":"utf-8-validation"},"content":{"kind":"string","value":"<p>Given an integer array <code>data</code> representing the data, return whether it is a valid <strong>UTF-8</strong> encoding (i.e. it translates to a sequence of valid UTF-8 encoded characters).</p>\n\n<p>A character in <strong>UTF8</strong> can be from <strong>1 to 4 bytes</strong> long, subjected to the following rules:</p>\n\n<ol>\n\t<li>For a <strong>1-byte</strong> character, the first bit is a <code>0</code>, followed by its Unicode code.</li>\n\t<li>For an <strong>n-bytes</strong> character, the first <code>n</code> bits are all one's, the <code>n + 1</code> bit is <code>0</code>, followed by <code>n - 1</code> bytes with the most significant <code>2</code> bits being <code>10</code>.</li>\n</ol>\n\n<p>This is how the UTF-8 encoding would work:</p>\n\n<pre>\n Number of Bytes | UTF-8 Octet Sequence\n | (binary)\n --------------------+-----------------------------------------\n 1 | 0xxxxxxx\n 2 | 110xxxxx 10xxxxxx\n 3 | 1110xxxx 10xxxxxx 10xxxxxx\n 4 | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx\n</pre>\n\n<p><code>x</code> denotes a bit in the binary form of a byte that may be either <code>0</code> or <code>1</code>.</p>\n\n<p><strong>Note: </strong>The input is an array of integers. Only the <strong>least significant 8 bits</strong> of each integer is used to store the data. This means each integer represents only 1 byte of data.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> data = [197,130,1]\n<strong>Output:</strong> true\n<strong>Explanation:</strong> data represents the octet sequence: 11000101 10000010 00000001.\nIt is a valid utf-8 encoding for a 2-bytes character followed by a 1-byte character.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> data = [235,140,4]\n<strong>Output:</strong> false\n<strong>Explanation:</strong> data represented the octet sequence: 11101011 10001100 00000100.\nThe first 3 bits are all one's and the 4th bit is 0 means it is a 3-bytes character.\nThe next byte is a continuation byte which starts with 10 and that's correct.\nBut the second continuation byte does not start with 10, so it is invalid.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= data.length <= 2 * 10<sup>4</sup></code></li>\n\t<li><code>0 <= data[i] <= 255</code></li>\n</ul>\n"},"acRate":{"kind":"number","value":45.23805247750579,"string":"45.238052"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["array","bit-manipulation"],"string":"[\n \"array\",\n \"bit-manipulation\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"71\", 0.1757], [\"73\", 0.3515], [\"74\", 0.5272], [\"76\", 0.703], [\"77\", 0.3515], [\"78\", 1.2302], [\"79\", 0.3515], [\"80\", 0.3515], [\"81\", 1.5817], [\"82\", 1.9332], [\"83\", 2.109], [\"84\", 2.4605], [\"85\", 3.8664], [\"86\", 4.3937], [\"87\", 2.109], [\"88\", 3.6907], [\"89\", 4.2179], [\"90\", 4.2179], [\"91\", 4.3937], [\"92\", 4.2179], [\"93\", 3.6907], [\"94\", 3.6907], [\"95\", 4.3937], [\"96\", 2.9877], [\"97\", 4.2179], [\"98\", 3.6907], [\"99\", 2.2847], [\"100\", 2.4605], [\"101\", 1.406], [\"102\", 1.9332], [\"103\", 1.9332], [\"104\", 1.5817], [\"105\", 1.5817], [\"106\", 1.0545], [\"107\", 1.406], [\"108\", 1.406], [\"109\", 0.5272], [\"110\", 1.0545], [\"111\", 0.8787], [\"112\", 0.8787], [\"113\", 0.703], [\"114\", 0.5272], [\"115\", 0.703], [\"116\", 0.3515], [\"117\", 0.1757], [\"118\", 1.406], [\"119\", 0.1757], [\"120\", 0.1757], [\"121\", 0.3515], [\"122\", 0.3515], [\"123\", 0.3515], [\"124\", 0.1757], [\"126\", 0.1757], [\"127\", 0.3515], [\"132\", 0.1757], [\"133\", 0.3515], [\"136\", 0.3515], [\"137\", 0.3515], [\"138\", 0.1757], [\"139\", 0.5272], [\"142\", 0.1757], [\"146\", 0.5272]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"16600\", 1.2302], [\"16700\", 10.7206], [\"16800\", 18.6292], [\"16900\", 32.3374], [\"17000\", 9.4903], [\"17100\", 2.109], [\"17200\", 1.2302], [\"17300\", 0.5272], [\"17400\", 0.8787], [\"17500\", 2.6362], [\"17600\", 6.8541], [\"17700\", 4.5694], [\"17800\", 2.2847], [\"17900\", 1.2302], [\"18000\", 0.1757]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n num = 0\n mask1 = 1 << 7\n mask2 = 1 << 6\n\n for byte in data:\n mask = 1 << 7\n if num == 0:\n while (mask&byte):\n num += 1\n mask = mask >> 1\n if num == 0:\n continue\n if num == 1 or num > 4:\n return False\n else:\n if not((mask1 & byte) and not (mask2 & byte)):\n return False\n num -= 1\n return num == 0 ","runtime":"71"},{"code":"from typing import List\n\nclass Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def check_next_byte(index):\n if index >= len(data):\n return False\n return data[index] >> 6 == 0b10\n\n index = 0\n while index < len(data):\n first_byte = data[index]\n if first_byte >> 7 == 0:\n index += 1\n elif first_byte >> 5 == 0b110 and check_next_byte(index + 1):\n index += 2\n elif first_byte >> 4 == 0b1110 and check_next_byte(index + 1) and check_next_byte(index + 2):\n index += 3\n elif first_byte >> 3 == 0b11110 and check_next_byte(index + 1) and check_next_byte(index + 2) and check_next_byte(index + 3):\n index += 4\n else:\n return False\n return True","runtime":"73"},{"code":"class Solution:\n def validUtf8(self, data: list[int]) -> bool:\n followedBytes = 0\n\n for d in data:\n if followedBytes == 0:\n if (d >> 3) == 0b11110:\n followedBytes = 3\n elif (d >> 4) == 0b1110:\n followedBytes = 2\n elif (d >> 5) == 0b110:\n followedBytes = 1\n elif (d >> 7) == 0b0:\n followedBytes = 0\n else:\n return False\n else:\n if (d >> 6) != 0b10:\n return False\n followedBytes -= 1\n\n return followedBytes == 0","runtime":"74"},{"code":"from typing import List\n\nclass Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def check(size):\n for i in range(1, size):\n if start + i >= len(data) or (data[start + i] >> 6) != 0b10:\n return False\n return True\n \n start = 0\n while start < len(data):\n first = data[start]\n if (first >> 3) == 0b11110:\n if not check(4):\n return False\n start += 4\n elif (first >> 4) == 0b1110:\n if not check(3):\n return False\n start += 3\n elif (first >> 5) == 0b110:\n if not check(2):\n return False\n start += 2\n elif (first >> 7) == 0b0:\n start += 1\n else:\n return False\n return True","runtime":"76"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n count = 0\n\n for byte in data:\n if count > 0:\n if byte >> 6 != 2:\n return False\n count -= 1\n continue\n if byte >> 3 == 30:\n count = 3\n continue\n if byte >> 4 == 14:\n count = 2\n continue\n if byte >> 5 == 6:\n count = 1\n continue\n if byte >> 7 != 0:\n return False\n \n return count == 0\n ","runtime":"77"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n mask1, mask2 = 1 << 7, 1 << 6\n char_no = 0\n for num in data: \n if char_no:\n if not ((mask1 & num) and not (mask2 & num)): \n return False\n else:\n # populate char\n curr_mask = 1 << 7 \n while curr_mask & num: \n curr_mask = curr_mask >> 1\n char_no += 1\n if char_no == 0: \n continue\n if char_no == 1 or char_no > 4: \n return False\n\n char_no -= 1\n return char_no == 0 ","runtime":"81"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Number of bytes in the current UTF-8 character\n n_bytes = 0\n\n # Mask to check if the most significant bit is set\n mask1 = 1 << 7\n # Mask to check if the second most significant bit is set\n mask2 = 1 << 6\n\n for num in data:\n # Get the most significant bit\n mask = 1 << 7\n if n_bytes == 0:\n # Check how many bytes the character consists of\n while mask & num:\n n_bytes += 1\n mask = mask >> 1\n \n # Handle the case of 1-byte character\n if n_bytes == 0:\n continue\n \n # UTF-8 must be 1 to 4 bytes\n if n_bytes == 1 or n_bytes > 4:\n return False\n else:\n # Check if the byte starts with '10'\n if not (num & mask1 and not (num & mask2)):\n return False\n \n # Decrement the number of bytes remaining in the sequence\n n_bytes -= 1\n\n # Ensure all characters were processed\n return n_bytes == 0\n\n# Example usage:\nsolution = Solution()\nprint(solution.validUtf8([197, 130, 1])) # Output: True\nprint(solution.validUtf8([235, 140, 4])) # Output: False","runtime":"82"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n n = len(data)\n i = j = 0\n while i < n:\n if data[i] <= 127:\n i += 1\n continue\n elif 192 <= data[i] <= 223:\n j = 1\n elif 224 <= data[i] <= 239:\n j = 2\n elif 240 <= data[i] <= 247:\n j = 3\n else:\n return False\n i += 1\n while j > 0 and i < n:\n if data[i] < 128 or data[i] > 191:\n return False\n i += 1\n j -= 1\n return i == n and j == 0","runtime":"83"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n n = len(data)\n i = 0\n while i < n:\n first_byte = data[i]\n # Determine the number of bytes in the UTF-8 character\n if first_byte >> 3 == 0b11110: # 4-byte character\n num_bytes = 4\n elif first_byte >> 4 == 0b1110: # 3-byte character\n num_bytes = 3\n elif first_byte >> 5 == 0b110: # 2-byte character\n num_bytes = 2\n elif first_byte >> 7 == 0b0: # 1-byte character\n num_bytes = 1\n else:\n return False\n\n # Check following bytes for the pattern 10xxxxxx\n if i + num_bytes > n:\n return False\n for j in range(1, num_bytes):\n if data[i + j] >> 6 != 0b10:\n return False\n i += num_bytes\n return True","runtime":"84"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # 255 = all 1\n firstFive = 2**7 + 2**6 + 2**5 + 2**4 + 2**3\n firstFour = 2**7 + 2**6 + 2**5 + 2**4\n firstThree = 2**7 + 2**6 + 2**5\n firstTwo = 2**7 + 2** 6\n firstOne = 2**7\n state = {\n \"0\": {\"0xxxxxxx\": \"0\", \"110xxxxx\": \"2-1\", \"1110xxxx\": \"3-1\", \"11110xxx\": \"4-1\"},\n \"2-1\": {\"10xxxxxx\": \"0\"},\n \"3-1\": {\"10xxxxxx\": \"3-2\"},\n \"3-2\": {\"10xxxxxx\": \"0\"},\n \"4-1\": {\"10xxxxxx\": \"4-2\"},\n \"4-2\": {\"10xxxxxx\": \"4-3\"},\n \"4-3\": {\"10xxxxxx\": \"0\"},\n }\n # can be optimize with map of 255 memory\n def getPattern(i):\n if i & firstOne == 0:\n return \"0xxxxxxx\"\n if i & firstTwo == firstOne:\n return \"10xxxxxx\"\n if i & firstThree == firstTwo:\n return \"110xxxxx\"\n if i & firstFour == firstThree:\n return \"1110xxxx\"\n if i & firstFive == firstFour:\n return \"11110xxx\"\n curState = \"0\"\n for byte in data:\n d = state[curState]\n p = getPattern(byte)\n if p not in d:\n return False \n curState = d[p]\n\n return curState == \"0\"\n ","runtime":"85"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n storeCount = 0\n\n for byte in data:\n temp = 128 # 0b10000000\n count = 0\n\n # Count leading ones in current byte\n while byte & temp != 0:\n count += 1\n temp >>= 1\n\n if count > 4:\n return False\n elif count > 1:\n if storeCount != 0:\n return False\n storeCount = count - 1\n elif count == 0:\n if storeCount != 0:\n return False\n else:\n if storeCount >= 1:\n storeCount -= 1\n else:\n return False\n\n return storeCount == 0","runtime":"86"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n count = 0\n print(bin(237))\n for num in data:\n if count == 0:\n if num >> 5 == 0b110:\n #print(\"5\")\n count = 1\n elif num >> 4 == 0b1110:\n #print(\"4\")\n count = 2\n elif num >> 3 == 0b11110:\n #print(\"3\")\n count = 3\n elif not (num >> 7 == 0b0):\n #print(\"first, \" + str(num >> 7))\n return False\n elif count > 0:\n count = count - 1\n if not (num >> 6 == 0b10):\n #print(\"second, \" +str(bin(num >> 6)))\n return False\n if count == 0:\n return True\n else:\n return False\n\n\n ","runtime":"87"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n start = 0\n while start < len(data):\n start = self.helper(data, start)\n if start == -1:\n return False\n\n return True\n \n def helper(self, data, start):\n if (data[start] >> 7) == 0:\n n = 1\n elif (data[start] >> 5) == 6:\n n = 2\n elif (data[start] >> 4) == 14:\n n = 3\n elif (data[start] >> 3) == 30:\n n = 4\n else:\n return -1\n \n if start+n > len(data):\n return -1\n\n for i in range(start+1, start+n):\n val = data[i]\n if (val >> 6) != 2:\n return -1\n return start+n","runtime":"88"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Number of bytes in the current UTF-8 character\n num_bytes = 0\n\n # Mask to check if the most significant bit is set\n MASK1 = 1 << 7\n # Mask to check if the second most significant bit is set\n MASK2 = 1 << 6\n\n for num in data:\n # Get the leading bit mask for the current byte\n mask = 1 << 7\n \n # If this is the first byte of a new character\n if num_bytes == 0:\n # Count the number of leading 1s to determine the number of bytes\n while mask & num:\n num_bytes += 1\n mask >>= 1\n\n # Handle the case of a single-byte character (0xxxxxxx)\n if num_bytes == 0:\n continue\n\n # UTF-8 must be between 2 and 4 bytes\n if num_bytes == 1 or num_bytes > 4:\n return False\n else:\n # If this is a continuation byte, it must start with '10'\n if not (num & MASK1 and not (num & MASK2)):\n return False\n\n # Decrement the number of bytes remaining in the current UTF-8 character\n num_bytes -= 1\n\n # Ensure all characters were fully processed\n return num_bytes == 0\n\n# Example usage:\nsolution = Solution()\nprint(solution.validUtf8([197, 130, 1])) # Output: True\nprint(solution.validUtf8([235, 140, 4])) # Output: False","runtime":"89"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Number of bytes in the current UTF-8 character\n num_bytes = 0\n\n # Mask to check if the most significant bit is 1\n mask1 = 1 << 7\n # Mask to check if the second most significant bit is 1\n mask2 = 1 << 6\n\n for byte in data:\n # Get the most significant bit\n mask = 1 << 7\n if num_bytes == 0:\n # Determine the number of bytes for the current character\n while mask & byte:\n num_bytes += 1\n mask >>= 1\n\n # Check if the number of bytes is valid\n if num_bytes == 0:\n continue # 1-byte character\n elif num_bytes == 1 or num_bytes > 4:\n return False\n else:\n # Check if this is a continuation byte (starts with 10xxxxxx)\n if not (mask1 & byte and not (mask2 & byte)):\n return False\n\n # Decrement the number of bytes remaining for the current character\n num_bytes -= 1\n\n # Ensure all characters have been fully processed\n return num_bytes == 0\n\n# Example usage:\nsolution = Solution()\ndata = [197, 130, 1]\nprint(solution.validUtf8(data)) # Output: True\n\ndata = [235, 140, 4]\nprint(solution.validUtf8(data)) # Output: False","runtime":"89"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n x=0\n while x < len(data):\n b = bin(data[x])[2:]\n if len(b)<8:\n x+=1\n else:\n i=0\n while i<len(b) and b[i]==\"1\":\n i+=1\n if i==2:\n if x > len(data)-2:\n return False\n b_next = bin(data[x+1])[2:]\n if not(len(b_next)==8 and b_next[:2]==\"10\"):\n return False\n x+=2\n elif i==3 or i==4:\n if x > len(data)-3:\n return False\n b_next = bin(data[x+1])[2:]\n b_next2 = bin(data[x+2])[2:]\n ret = len(b_next)==8 and b_next[:2]==\"10\"\n ret = ret and len(b_next2)==8 and b_next2[:2]==\"10\"\n if not ret:\n return False\n x+=i\n else:\n return False\n \n return True","runtime":"90"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n \n def count_leading_1s(x: int) -> int:\n ret = 0\n while (7-ret) and x & (1 << (7-ret)):\n ret += 1\n return ret\n\n cnt = 0\n for d in data:\n lead_1s = count_leading_1s(d)\n if lead_1s == 0: # 1-byte character\n # print(d, \"is 1-byte\")\n if cnt:\n return False\n elif lead_1s == 1: # Part of a multi-byte char\n # print(d, \"is part of a multi-byte\")\n if not cnt :\n return False\n cnt -= 1\n elif lead_1s <= 4: # Head of a multi-byte char\n # print(d, f\"is head of a {lead_1s}-byte\")\n if cnt:\n return False\n cnt += lead_1s-1\n else: # There's no 5-byte char and above\n # print(d, f\"is head of a {lead_1s}-byte\")\n return False\n return not cnt\n\n \n ","runtime":"90"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n \n \n in_sequence = False\n sequence = 0\n for num in data:\n byte = str(format(num, '08b'))\n\n if not in_sequence:\n if byte[0] == '0':\n continue\n elif byte[:5] == '11110':\n in_sequence = True\n sequence = 3\n elif byte[:4] == '1110':\n in_sequence = True\n sequence = 2\n elif byte[:3] == '110':\n in_sequence = True\n sequence = 1\n else:\n return False\n else:\n if byte[:2] != '10':\n return False\n \n sequence -= 1\n\n if sequence == 0:\n in_sequence = False\n\n if in_sequence:\n return False\n return True\n\n\n","runtime":"91"},{"code":"class Solution:\n def validUtf8(self, data):\n \"\"\"\n :type data: List[int]\n :rtype: bool\n \"\"\"\n\n # Number of bytes in the current UTF-8 character\n n_bytes = 0\n\n # Mask to check if the most significant bit (8th bit from the left) is set or not\n mask1 = 1 << 7\n\n # Mask to check if the second most significant bit is set or not\n mask2 = 1 << 6\n for num in data:\n\n # Get the number of set most significant bits in the byte if\n # this is the starting byte of an UTF-8 character.\n mask = 1 << 7\n if n_bytes == 0:\n while mask & num:\n n_bytes += 1\n mask = mask >> 1\n\n # 1 byte characters\n if n_bytes == 0:\n continue\n\n # Invalid scenarios according to the rules of the problem.\n if n_bytes == 1 or n_bytes > 4:\n return False\n else:\n\n # If this byte is a part of an existing UTF-8 character, then we\n # simply have to look at the two most significant bits and we make\n # use of the masks we defined before.\n if not (num & mask1 and not (num & mask2)):\n return False\n n_bytes -= 1\n return n_bytes == 0 ","runtime":"92"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n i, n = 0, len(data)\n while i < n:\n byte = data[i]\n if byte >> 7 == 0b0:\n i += 1\n elif byte >> 5 == 0b110:\n if i + 1 >= n or data[i + 1] >> 6 != 0b10:\n return False\n i += 2\n elif byte >> 4 == 0b1110:\n if i + 2 >= n or any(data[j] >> 6 != 0b10 for j in range(i + 1, i + 3)):\n return False\n i += 3\n elif byte >> 3 == 0b11110:\n if i + 3 >= n or any(data[j] >> 6 != 0b10 for j in range(i + 1, i + 4)):\n return False\n i += 4\n else:\n return False\n return True","runtime":"93"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n i = 0\n while i < len(data):\n byte = data[i]\n if (byte >> 7) == 0b0:\n i += 1\n elif (byte >> 5) == 0b110:\n if i + 1 >= len(data) or (data[i + 1] >> 6) != 0b10:\n return False\n i += 2\n elif (byte >> 4) == 0b1110:\n if i + 2 >= len(data) or (data[i + 1] >> 6) != 0b10 or (data[i + 2] >> 6) != 0b10:\n return False\n i += 3\n elif (byte >> 3) == 0b11110:\n if i + 3 >= len(data) or (data[i + 1] >> 6) != 0b10 or (data[i + 2] >> 6) != 0b10 or (data[i + 3] >> 6) != 0b10:\n return False\n i += 4\n else:\n return False\n return True ","runtime":"94"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def get_num_bytes(num):\n if (num >> 7) == 0b0:\n return 1\n elif (num >> 5) == 0b110:\n return 2\n elif (num >> 4) == 0b1110:\n return 3\n elif (num >> 3) == 0b11110:\n return 4\n else:\n return -1\n \n i = 0\n while i < len(data):\n num_bytes = get_num_bytes(data[i])\n if num_bytes == -1:\n return False\n for j in range(1, num_bytes):\n if i + j >= len(data) or (data[i + j] >> 6) != 0b10:\n return False\n i += num_bytes\n return True","runtime":"95"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def get_bits(num):\n return bin(num)[2:].zfill(8)\n \n i = 0\n while i < len(data):\n bits = get_bits(data[i])\n if bits[0] == '0':\n i += 1\n elif bits[:3] == '110' and i + 1 < len(data):\n if get_bits(data[i + 1])[:2] != '10':\n return False\n i += 2\n elif bits[:4] == '1110' and i + 2 < len(data):\n if not (get_bits(data[i + 1])[:2] == '10' and get_bits(data[i + 2])[:2] == '10'):\n return False\n i += 3\n elif bits[:5] == '11110' and i + 3 < len(data):\n if not (get_bits(data[i + 1])[:2] == '10' and get_bits(data[i + 2])[:2] == '10' and get_bits(data[i + 3])[:2] == '10'):\n return False\n i += 4\n else:\n return False\n return True","runtime":"95"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Number of bytes in the current UTF-8 character\n n_bytes = 0\n\n # Mask to check if the most significant bit is set or not\n mask1 = 1 << 7\n # Mask to check if the second most significant bit is set or not\n mask2 = 1 << 6\n \n for num in data:\n if n_bytes == 0:\n # Count the number of 1s in the beginning of the byte\n mask = mask1\n while mask & num:\n n_bytes += 1\n mask = mask >> 1\n \n # 1 byte characters\n if n_bytes == 0:\n continue\n \n # Invalid scenarios according to the rules of the problem\n if n_bytes == 1 or n_bytes > 4:\n return False\n else:\n # If we are processing bytes which are not the start of a character\n if not (num & mask1 and not (num & mask2)):\n return False\n n_bytes -= 1\n \n # If we have processed all bytes and n_bytes is 0, it's valid\n return n_bytes == 0\n\n# Test the solution\nsolution = Solution()\nprint(solution.validUtf8([197, 130, 1])) # Should print True\nprint(solution.validUtf8([235, 140, 4])) # Should print False","runtime":"96"},{"code":"class Solution:\n def validUtf8(self, data):\n # Number of bytes in the current UTF-8 character\n number_of_bytes = 0\n \n # Mask to check if the most significant bit is set\n MASK1 = 1 << 7\n # Mask to check if the second most significant bit is set\n MASK2 = 1 << 6\n \n for num in data:\n # Get the current byte\n mask = 1 << 7\n if number_of_bytes == 0:\n # Determine the number of bytes in the current UTF-8 character\n while mask & num:\n number_of_bytes += 1\n mask >>= 1\n \n # 1-byte character\n if number_of_bytes == 0:\n continue\n \n # Invalid scenarios: number_of_bytes = 0 or number_of_bytes > 4\n if number_of_bytes == 1 or number_of_bytes > 4:\n return False\n else:\n # Check if the current byte is a continuation byte (10xxxxxx)\n if not (num & MASK1 and not (num & MASK2)):\n return False\n \n # Decrement the number of bytes in the current UTF-8 character\n number_of_bytes -= 1\n \n # Check if all bytes have been processed\n return number_of_bytes == 0\n\n# Example usage:\nsolution = Solution()\ndata = [197, 130, 1]\nprint(solution.validUtf8(data)) # Output: True\n\ndata = [235, 140, 4]\nprint(solution.validUtf8(data)) # Output: False","runtime":"97"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n sequence = []\n\n for i in data:\n sequence.append(\"{0:08b}\".format(i))\n\n i = 0\n n = len(sequence)\n while i <n:\n if sequence[i][0] == '0':\n i +=1\n continue\n if sequence[i][:3] == '110' and n-i>=1:\n if sequence[i+1][:2] == '10':\n i +=2\n continue\n if sequence[i][:4] == '1110' and n-i>=2:\n if sequence[i+1][:2] == '10' and sequence[i+2][:2]=='10':\n i +=3\n continue\n if sequence[i][:5] == '11110' and n-i>=3:\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\n i +=4\n continue\n else:\n return False\n return True\n \n\n\n","runtime":"97"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n num_bytes = len(data)\n\n def validate_1_0(num: int) -> bool:\n if (num - 128) >= 0:\n print(num)\n num -= 128\n if (num - 64 <= 0):\n print(num)\n return True\n return False\n return False\n\n i = 0 \n while i < num_bytes:\n num_seqs = 0\n if (data[i] < 128):\n i += 1\n continue\n elif (data[i] >= 192 and data[i] < 224):\n num_seqs = 1\n elif (data[i] >= 224 and data[i] < 240):\n num_seqs = 2\n elif (data[i] >=240 and data[i] < 248):\n num_seqs = 3\n else:\n print(i, \"false here\")\n return False\n \n while num_seqs > 0 and i + 1 < num_bytes:\n i += 1\n if not validate_1_0(data[i]):\n print(i, \"not valid\")\n return False\n num_seqs -= 1\n if (num_seqs):\n return False\n i += 1\n \n \n return True\n ","runtime":"98"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n i = 0\n while i < len(data):\n x = self.num_bytes(data[i])\n if x == 0:\n return False\n for j in range(i + 1, i + x):\n if j >= len(data):\n return False\n if ((data[j] & 128) == 0) or (data[j] & 64):\n return False\n i += x\n return True\n\n def num_bytes(self, bin):\n mask = 1 << 7\n mask2 = 1 << 6\n nbytes = 0\n if not (mask & bin):\n return 1\n while mask & bin:\n nbytes+=1\n mask = mask >> 1\n if nbytes == 1 or nbytes > 4:\n return 0\n return nbytes \n ","runtime":"98"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def matches_bitmask(number, bitmask, zero_bitmask):\n return (number & bitmask) == bitmask and (number & zero_bitmask) == 0\n\n checks = 0\n for i in range(len(data)):\n if checks > 0:\n if not matches_bitmask(data[i], 0b10000000, 0b01000000):\n return False\n checks -= 1\n else:\n if matches_bitmask(data[i], 0b11110000, 0b00001000):\n checks = 3\n elif matches_bitmask(data[i], 0b11100000, 0b00010000):\n checks = 2\n elif matches_bitmask(data[i], 0b11000000, 0b00100000):\n checks = 1\n elif data[i] < 128:\n checks = 0\n else:\n # print(data[i])\n return False\n if checks != 0:\n # print(checks)\n return False\n return True","runtime":"99"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def ones(num):\n \n ans = 0\n done = False\n\n for i in range(8):\n if num % 2:\n ans += 1\n else:\n ans = 0\n done = True\n \n num = num >> 1\n \n return [ans,done]\n \n def ten(num):\n return (num >> 6) % 2 == 0 and (num >> 7) % 2 == 1\n done = False\n num = 0\n\n for dat in data:\n if not done:\n l = ones(dat)\n done = l[1]\n num += l[0]\n if done:\n num -= 1\n if num == -1:\n done = False\n num = 0\n continue\n if not num:\n return False\n if num >= 4:\n return False\n else:\n \n if not ten(dat):\n return False\n \n num -= 1\n\n if num == 0:\n done = False\n \n \n\n print(num)\n return not num\n ","runtime":"100"},{"code":"class Solution:\n def validUtf8(self, data: list[int]) -> bool:\n time = 0\n for i in data:\n now = bin(i)[2:].zfill(8)\n print(now)\n if time == 0:\n for i in now[:5]:\n if i == '0':\n break\n time += 1\n if time == 5:\n return False\n elif time > 1:\n time -=1\n elif time == 1:\n return False\n elif time > 0:\n if now[:2] == '10':\n time -=1\n else:\n return False\n else:\n return False\n return time == 0 ","runtime":"101"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n ptr = 0\n while(ptr < len(data)):\n current = f'{data[ptr]:08b}'\n num_bytes = 0\n if current[0] == \"0\":\n num_bytes = 1\n else:\n temp = 0\n while temp < len(current) and current[temp] == \"1\":\n temp +=1\n num_bytes +=1\n if temp > 4 or current[temp] != \"0\" or temp == 1:\n return False\n ptr +=1\n for i in range(num_bytes-1):\n if ptr + i >= len(data):\n return False\n elem = f'{data[ptr+i]:08b}'\n if elem[:2] != \"10\":\n return False\n ptr += num_bytes - 1\n return True\n","runtime":"101"},{"code":"class Solution:\n def validUtf8(self, data):\n \"\"\"\n :type data: List[int]\n :rtype: bool\n \"\"\"\n\n # Number of bytes in the current UTF-8 character\n n_bytes = 0\n\n # For each integer in the data array.\n for num in data:\n\n # Get the binary representation. We only need the least significant 8 bits\n # for any given number.\n bin_rep = format(num, '#010b')[-8:]\n\n # If this is the case then we are to start processing a new UTF-8 character.\n if n_bytes == 0:\n\n # Get the number of 1s in the beginning of the string.\n for bit in bin_rep:\n if bit == '0': break\n n_bytes += 1\n\n # 1 byte characters\n if n_bytes == 0:\n continue\n\n # Invalid scenarios according to the rules of the problem.\n if n_bytes == 1 or n_bytes > 4:\n return False\n else:\n # Else, we are processing integers which represent bytes which are a part of\n # a UTF-8 character. So, they must adhere to the pattern `10xxxxxx`.\n if not (bin_rep[0] == '1' and bin_rep[1] == '0'):\n return False\n\n # We reduce the number of bytes to process by 1 after each integer.\n n_bytes -= 1\n\n # This is for the case where we might not have the complete data for\n # a particular UTF-8 character.\n return n_bytes == 0 ","runtime":"102"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n state = 0\n for d in data:\n print(d, state)\n if state:\n state -= 1\n if d & 192 != 128:\n return False\n else:\n if d & 128:\n state = 1\n if not d & 64:\n return False\n if d & 48:\n state = (d & 48) >> 4\n if state == 3 and d & 8:\n return False\n if d & 8:\n return False\n else:\n state = 0\n \n return state == 0","runtime":"103"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def int_to_bin(i: int) -> str:\n return bin(i)[2:].zfill(8)\n\n remaining_bytes = 0\n\n for num in data:\n binary = int_to_bin(num)\n\n if remaining_bytes == 0:\n if binary.startswith(\"0\"):\n continue\n elif binary.startswith(\"110\"):\n remaining_bytes = 1\n elif binary.startswith(\"1110\"):\n remaining_bytes = 2\n elif binary.startswith(\"11110\"):\n remaining_bytes = 3\n else:\n return False\n else:\n if not binary.startswith(\"10\"):\n return False\n remaining_bytes -= 1\n \n return remaining_bytes == 0","runtime":"104"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n s = data\n n = len(s)\n i = 0\n def g_b(x):\n b_s = bin(x)[2:]\n b_s = \"0\"*(8-len(b_s))+b_s[-8:]\n return b_s\n while i<n:\n b_s = g_b(s[i])\n if b_s[0]==\"0\":\n i += 1\n else:\n k = 0\n while b_s[k]==\"1\":\n k += 1\n if k>4: return False\n if k==1: return False\n while k>1:\n i += 1\n if i>=n: return False\n b_s = g_b(s[i])\n if b_s[:2]!=\"10\":\n return False\n k -= 1\n i += 1\n return True\n\n ","runtime":"105"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n N_bytes = len(data)\n\n bits = [bin(num)[2:] for num in data]\n\n bits = [\"0\" * (8-len(bit)) + bit for bit in bits]\n N_bytes = 0\n # print(bits[-10:])\n for i, bit in enumerate(bits):\n # print(N_bytes, bit)\n if N_bytes != 0 and bit[0] == '0': return False\n if N_bytes != 0 and bit[:2] != '10': return False\n\n if bit[0] == '0': continue\n\n if bit[:2] == '10':\n N_bytes -= 1\n continue\n \n if N_bytes < 0: return False\n \n N_bytes = len(bit[:5].split('0')[0]) - 1\n if N_bytes == 4: return False\n \n return N_bytes == 0\n","runtime":"105"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n bytedata = []\n for data in data:\n bytedata.append(bin(data)[2:].zfill(8))\n \n print(bytedata)\n \n cbyte = 0\n for byte in bytedata:\n if cbyte == 0:\n if byte[:5] == '11110':\n cbyte = 3\n elif byte[:4] == '1110':\n cbyte = 2\n elif byte[:3] == '110':\n cbyte = 1\n elif byte[0] == '0':\n cbyte = 0\n else:\n return False\n else:\n if byte[:2] == '10':\n cbyte -= 1\n else:\n return False\n print(cbyte)\n return cbyte == 0\n\n # bitshifting\n # # Initialize a counter variable\n # count = 0\n \n # # Iterate through each integer in the input data list\n # for num in data:\n # # If the count is 0, check how many leading 1's there are in the current integer\n # if count == 0:\n # if (num >> 5) == 0b110:\n # count = 1\n # elif (num >> 4) == 0b1110:\n # count = 2\n # elif (num >> 3) == 0b11110:\n # count = 3\n # elif (num >> 7) != 0:\n # return False\n # # If the count is not 0, check if the current integer is a continuation byte\n # else:\n # if (num >> 6) != 0b10:\n # return False\n # count -= 1\n \n # # If the count is still not 0 after iterating through all the integers, it is invalid\n # return count == 0","runtime":"106"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Convert all the numbers into binary\n for i in range(len(data)):\n data[i] = str(bin(data[i])[2:])\n while len(data[i]) < 8:\n data[i] = \"0\" + data[i]\n \n i = 0\n while i < len(data):\n if data[i][0] == \"0\":\n i += 1\n continue\n elif data[i][:3] == \"110\":\n if i + 1 >= len(data) or data[i+1][0] + data[i+1][1] != \"10\":\n print(\"1\")\n return False\n i += 2\n elif data[i][:4] == \"1110\":\n if i + 2 >= len(data):\n print(\"2\")\n return False\n if data[i+1][:2] != \"10\" or data[i+2][:2] != \"10\":\n print(\"3\")\n return False\n i += 3\n elif data[i][:5] == \"11110\":\n if i + 3 >= len(data):\n print(\"4\")\n return False\n if data[i+1][:2] != \"10\" or data[i+2][:2] != \"10\" or data[i+3][:2] != \"10\":\n print(\"5\")\n return False\n i += 4\n else:\n print(data[i])\n print(\"6\")\n return False\n \n return True","runtime":"107"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n sequence = []\n\n for i in data:\n sequence.append(\"{0:08b}\".format(i))\n\n i = 0\n n = len(sequence)\n while i <n:\n if sequence[i][0] == '0':\n i +=1\n continue\n if sequence[i][:3] == '110' and n-i>=1:\n if sequence[i+1][:2] == '10':\n i +=2\n continue\n if sequence[i][:4] == '1110' and n-i>=2:\n if sequence[i+1][:2] == '10' and sequence[i+2][:2]=='10':\n i +=3\n continue\n if sequence[i][:5] == '11110' and n-i>=3:\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\n i +=4\n continue\n else:\n return False\n return True\n \n\n\n","runtime":"108"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n\t # a list to store binary representation of the numbers\n sequence = []\n\t\t# get binary representation of all the numbers\n for d in data:\n sequence.append(\"{0:08b}\".format(d))\n \n i = 0\n n = len(sequence)\n while i < n:\n if sequence[i][0] == '0': # 1-byte check\n i += 1\n continue\n if sequence[i][:3] == '110' and n-i>=1: # 2-byte check\n if sequence[i+1][:2] == '10':\n i += 2\n continue\n if sequence[i][:4] == '1110' and n-i>=2: # 3-byte check\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10':\n i += 3\n continue\n if sequence[i][:5] == '11110' and n-i>=3: # 4-byte check\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\n i += 4\n continue\n else:\n return False\n return True","runtime":"109"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n for item in data:\n print(f'{item:08b}')\n ptr = 0\n while(ptr < len(data)):\n current = f'{data[ptr]:08b}'\n num_bytes = 0\n if current[0] == \"0\":\n num_bytes = 1\n else:\n temp = 0\n while temp < len(current) and current[temp] == \"1\":\n temp +=1\n num_bytes +=1\n if temp > 4 or current[temp] != \"0\" or temp == 1:\n print(current, temp)\n return False\n ptr +=1\n for i in range(num_bytes-1):\n if ptr + i >= len(data):\n return False\n elem = f'{data[ptr+i]:08b}'\n if elem[:2] != \"10\":\n return False\n ptr += num_bytes - 1\n return True\n","runtime":"110"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n N_bytes = len(data)\n\n bits = [bin(num)[2:] for num in data]\n\n bits = [\"0\" * (8-len(bit)) + bit for bit in bits]\n N_bytes = 0\n\n for i, bit in enumerate(bits):\n if N_bytes != 0 and (bit[0] == '0' or bit[:2] != '10'): return False\n\n if bit[0] == '0': continue\n\n if bit[:2] == '10':\n N_bytes -= 1\n continue\n \n # if N_bytes < 0: return False\n \n N_bytes = len(bit[:5].split('0')[0]) - 1\n if N_bytes == 4: return False\n \n return N_bytes == 0\n","runtime":"111"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n n = len(data)\n def checkSeq(i):\n num = data[i]\n count = 0\n j = 7\n\n while j >= 0 and (num >> j)&1:\n count += 1\n j -= 1\n\n if j < 0 or count == 1 or count > 4:\n return -1\n\n if (num >> 7) & 1 == 0:\n count = 1\n \n if i+count > n:\n return -1\n\n for k in range(i+1, i+count):\n if (data[k] >> 6) & 1 or (data[k] >> 7)&1 == 0:\n return -1\n print(i,j,count)\n return i+count\n\n i = 0\n\n while i < n:\n idx = checkSeq(i)\n if idx == -1:\n return False\n\n i = idx\n\n return True\n\n \n\n ","runtime":"112"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Approach\n # Keep a variable of num_bytes to validate\n # The number of 1's in the first byte tells you the number of bytes to validate\n # Every time you process an integer if num_bytes == 0:\n # You are starting a new byte sequence, so check the rules for the first byte\n # If num_bytes > 0, check for the 10xxxx rule for subsequent bytes\n # If any rule violations while iterating through bytes, return false otherwise return True\n\n num_bytes: int = 0\n for d in data:\n bin_str = self.convert_to_binary(d)\n print(bin_str)\n\n # Start of a new bytes sequence\n if num_bytes == 0:\n num_ones: int = 0\n for i in range(len(bin_str)):\n if bin_str[i] == \"1\":\n num_ones += 1\n else:\n break\n\n # If no ones, then single byte sequence\n if num_ones == 0:\n continue\n # Single leading 1 not a valid format\n elif num_ones == 1:\n return False\n # Max 4 sequence bytes\n elif num_ones > 4:\n return False\n else:\n num_bytes = num_ones\n # Checking subsequent byte sequences\n else:\n if bin_str[0:2] != \"10\":\n return False\n\n # Decrement byte sequence\n num_bytes -= 1\n\n # Tricky: make sure no unfinished sequences\n return num_bytes == 0\n\n def convert_to_binary(self, input: int) -> str:\n return format(input, '#010b')[-8:]\n\n\n# 11000101 10000010 00000001\n# num_bytes = 0\n# d = 11000101\n# num_ones = 2\n# num_bytes = 2\n# num_bytes = 1\n# d = 10000010\n# num_bytes = 0\n# d = 00000001\n# num_ones = 0\n# continue\n# return True","runtime":"113"},{"code":"class Solution:\n def integer_to_padded_binary_string(self, n, num_bits=8):\n return format(n, f'0{num_bits}b')\n\n def validUtf8(self, data: List[int]) -> bool:\n for i in range(len(data)):\n data[i] = self.integer_to_padded_binary_string(data[i])\n \n print (data)\n\n i = 0\n\n while i < len(data):\n b = data[i]\n \n if b[0] == '0':\n print(\"alsdkfja\")\n elif b[0:5] == \"11110\":\n print('here!xx')\n for _ in range(3):\n i += 1\n if i >= len(data): return False\n t = data[i]\n if t[0:2] != \"10\":\n return False\n elif b[0:4] == \"1110\":\n print('here!')\n for k in range(2):\n i += 1\n if i >= len(data): return False\n t = data[i]\n print(t)\n if t[0:2] != \"10\":\n return False\n elif b[0:3] == \"110\":\n print('hereaasdf!')\n i += 1\n if i >= len(data): return False\n t = data[i]\n if t[0:2] != \"10\":\n return False\n else:\n print('asdhjfasfd')\n return False\n \n i += 1\n \n\n print('asdlfjad')\n return True","runtime":"114"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n int_to_binary = []\n utf_length = 8\n for i in range(len(data)):\n binary = \"{0:b}\".format(data[i])\n if len(binary) < utf_length:\n needed_0 = utf_length - len(binary)\n binary = \"0\" * needed_0 + binary\n int_to_binary.append(binary)\n if len(binary) > utf_length:\n int_to_binary.append(binary[-utf_length:])\n else: \n int_to_binary.append(binary)\n\n i = 0\n while i < len(int_to_binary):\n if int_to_binary[i][0] == '0':\n i += 1\n continue\n elif int_to_binary[i][:3] == '110':\n if i + 1 >= len(int_to_binary) or int_to_binary[i + 1][:2] != '10':\n return False\n i += 2\n elif int_to_binary[i][:4] == '1110':\n if i + 2 >= len(int_to_binary) or int_to_binary[i + 1][:2] != '10' or int_to_binary[i + 2][:2] != '10':\n return False\n i += 3\n elif int_to_binary[i][:5] == '11110':\n if i + 3 >= len(int_to_binary) or int_to_binary[i + 1][:2] != '10' or int_to_binary[i + 2][:2] != '10' or int_to_binary[i + 3][:2] != '10':\n return False\n i += 4\n else:\n return False\n \n return True\n","runtime":"115"},{"code":"class Solution:\n def integer_to_padded_binary_string(self, n, num_bits=8):\n return format(n, f'0{num_bits}b')\n\n def validUtf8(self, data: List[int]) -> bool:\n for i in range(len(data)):\n data[i] = self.integer_to_padded_binary_string(data[i])\n \n print (data)\n\n i = 0\n\n while i < len(data):\n b = data[i]\n \n if b[0] == '0':\n print(\"alsdkfja\")\n elif b[0:5] == \"11110\":\n print('here!xx')\n for _ in range(3):\n i += 1\n if i >= len(data): return False\n t = data[i]\n if t[0:2] != \"10\":\n return False\n elif b[0:4] == \"1110\":\n print('here!')\n for k in range(2):\n i += 1\n if i >= len(data): return False\n t = data[i]\n print(t)\n if t[0:2] != \"10\":\n return False\n elif b[0:3] == \"110\":\n print('hereaasdf!')\n i += 1\n if i >= len(data): return False\n t = data[i]\n if t[0:2] != \"10\":\n return False\n else:\n print('asdhjfasfd')\n return False\n \n i += 1\n \n\n print('asdlfjad')\n return True","runtime":"116"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n bytedata = []\n for data in data:\n bytedata.append(bin(data)[2:].zfill(8))\n \n print(bytedata)\n \n cbyte = 0\n for byte in bytedata:\n if cbyte == 0:\n if byte[:5] == '11110':\n cbyte = 3\n elif byte[:4] == '1110':\n cbyte = 2\n elif byte[:3] == '110':\n cbyte = 1\n elif byte[0] == '0':\n cbyte = 0\n else:\n return False\n else:\n if byte[:2] == '10':\n cbyte -= 1\n else:\n return False\n print(cbyte)\n return cbyte == 0","runtime":"117"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n bytedata = []\n for data in data:\n bytedata.append(bin(data)[2:].zfill(8))\n \n print(bytedata)\n \n cbyte = 0\n for byte in bytedata:\n if cbyte == 0:\n if byte[:5] == '11110':\n cbyte = 3\n elif byte[:4] == '1110':\n cbyte = 2\n elif byte[:3] == '110':\n cbyte = 1\n elif byte[0] == '0':\n cbyte = 0\n else:\n return False\n else:\n if byte[:2] == '10':\n cbyte -= 1\n else:\n return False\n print(cbyte)\n return cbyte == 0","runtime":"118"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Approach\n # Keep a variable of num_bytes to validate\n # The number of 1's in the first byte tells you the number of bytes to validate\n # Every time you process an integer if num_bytes == 0:\n # You are starting a new byte sequence, so check the rules for the first byte\n # If num_bytes > 0, check for the 10xxxx rule for subsequent bytes\n # If any rule violations while iterating through bytes, return false otherwise return True\n\n num_bytes: int = 0\n for d in data:\n bin_str = self.convert_to_binary(d)\n print(bin_str)\n\n # Start of a new bytes sequence\n if num_bytes == 0:\n num_ones: int = 0\n for i in range(len(bin_str)):\n if bin_str[i] == \"1\":\n num_ones += 1\n else:\n break\n\n # Tricky: If no ones, then VALID single byte sequence\n if num_ones == 0:\n continue\n # Tricky: Single leading 1 not a valid format\n elif num_ones == 1:\n return False\n # Tricky: Max 4 sequence bytes\n elif num_ones > 4:\n return False\n else:\n num_bytes = num_ones\n # Checking subsequent byte sequences\n else:\n if bin_str[0:2] != \"10\":\n return False\n\n # Decrement byte sequence\n num_bytes -= 1\n\n # Tricky: make sure no unfinished sequences\n return num_bytes == 0\n\n def convert_to_binary(self, input: int) -> str:\n # Tricky: convert to last 8 bits\n return format(input, '010b')[-8:]\n\n\n# 11000101 10000010 00000001\n# num_bytes = 0\n# d = 11000101\n# num_ones = 2\n# num_bytes = 2\n# num_bytes = 1\n# d = 10000010\n# num_bytes = 0\n# d = 00000001\n# num_ones = 0\n# continue\n# return True","runtime":"119"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # UTF-8 encoding rules for the first byte in each sequence\n utfs = {\n 1: ['0'],\n 2: ['110', '10'],\n 3: ['1110', '10', '10'],\n 4: ['11110', '10', '10', '10']\n }\n\n i = 0\n\n while i < len(data):\n utf_sequence = 4\n while utf_sequence > 0:\n binary_rep = format(data[i], '08b')\n\n if binary_rep.startswith(utfs[utf_sequence][0]):\n i += 1\n for j in range(1, utf_sequence):\n if i >= len(data) or not format(data[i], '08b').startswith(utfs[utf_sequence][j]):\n return False\n i += 1\n break\n utf_sequence -= 1\n\n # If no valid UTF-8 sequence is found\n if utf_sequence == 0:\n return False\n\n return True\n ","runtime":"120"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n n_bits = 0\n\n for sequence in data:\n binary = str(bin(sequence))[2:]\n\n if len(binary) < 8:\n binary = \"0\"*(8-len(binary)) + binary\n\n if n_bits == 0:\n if binary[0] == '0':\n continue\n\n leading_ones = 0\n i = 0\n while i < len(binary) and binary[i] == '1':\n leading_ones += 1\n i += 1\n\n if leading_ones == 1 or leading_ones > 4:\n return False\n\n n_bits = leading_ones - 1\n \n else:\n if len(binary) >= 2 and binary[:2] == '10':\n n_bits -= 1\n else:\n return False\n\n print(binary, n_bits)\n\n if n_bits != 0:\n return False\n\n return True\n ","runtime":"121"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # we convert data into bits and then see if we get a valid seq\n\n def convert_to_bits(num):\n # converts single int/byte into an array of 8 bits\n bits = [0]*8\n for i in range(7,-1,-1):\n if 2**i <= num:\n num -= 2**i\n bits[7-i] = 1\n return bits\n\n def check_valid(ind,num_check):\n for i in range(ind, ind+num_check):\n if i >= len(data):\n return False\n if convert_to_bits(data[i])[:2] == [1,0]:\n continue\n else:\n return False\n return True\n\n ind = 0\n while ind < len(data):\n bits = convert_to_bits(data[ind])\n # check initial listing\n if bits[0] == 0:\n # single byte pattern, continue\n ind += 1\n continue\n elif bits[:3] == [1,1,0]:\n # check next 2 values for valid pattern\n if not check_valid(ind+1,1):\n #print(\"invalid 3\")\n return False\n ind += 2\n elif bits[:4] == [1,1,1,0]:\n # check next 2 values for valid pattern\n if not check_valid(ind+1,2):\n #print(\"invalid 4\")\n return False\n ind += 3\n elif bits[:5] == [1,1,1,1,0]:\n # check next 2 values for valid pattern\n if not check_valid(ind+1,3):\n #print(\"invalid 5\")\n return False\n ind += 4\n else:\n #print(\"invalid\",bits)\n return False\n return True\n \n\n \n ","runtime":"122"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n binaryRep = []\n for num in data: \n binaryRep.append(format(num, '#010b')[2:])\n\n def inRange(i):\n if i in range(len(binaryRep)): return True\n def isFour(i):\n if not inRange(i): return False\n return binaryRep[i][0:5] == '11110'\n def isThree(i):\n if not inRange(i): return False\n return binaryRep[i][0:4] == '1110'\n def isTwo(i):\n if not inRange(i): return False\n return binaryRep[i][0:3] == '110'\n def isOne(i):\n if not inRange(i): return False\n return binaryRep[i][0:1] == '0'\n\n def isSigTen(i):\n if not inRange(i): return False\n return binaryRep[i][0:2] == '10'\n\n def rec(i):\n if not inRange(i): return True\n if isFour(i):\n return isSigTen(i+1) and isSigTen(i+2) and isSigTen(i+3) and rec(i+4)\n elif isThree(i):\n return isSigTen(i+1) and isSigTen(i+2) and rec(i+3)\n elif isTwo(i):\n return isSigTen(i+1) and rec(i+2)\n elif isOne(i):\n return rec(i+1)\n else: return False\n\n return rec(0)\n\n","runtime":"123"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n cache ={}\n def to_bin(num):\n orig_num = num\n if num in cache:\n return cache[num]\n res = [0] * 8\n i = 0\n while num != 0:\n res[i] = num % 2\n num //=2\n i += 1\n cache[orig_num] = res[::-1]\n return cache[orig_num]\n\n print(to_bin(0))\n while data:\n c = data.pop(0)\n bin_c = to_bin(c)\n #print(\"popped\", c, \"bin_c\", bin_c) \n if bin_c[0] == 0:\n continue\n elif bin_c[0:3] == [1, 1, 0]:\n if not data:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n next_one = to_bin(data.pop(0))\n if next_one[0:2] != [1, 0]:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n elif bin_c[0:4] == [1, 1, 1, 0]:\n if not data:\n #print(\"c\", c, \"bin_c\", bin_c) \n return False\n next_one = to_bin(data.pop(0))\n if next_one[0:2] != [1, 0]:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n if not data:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n next_one = to_bin(data.pop(0))\n if next_one[0:2] != [1, 0]:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n elif bin_c[0:5] == [1, 1, 1, 1, 0]:\n if not data:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n next_one = to_bin(data.pop(0))\n if next_one[0:2] != [1, 0]:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n if not data:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n next_one = to_bin(data.pop(0))\n if next_one[0:2] != [1, 0]:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n if not data:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n next_one = to_bin(data.pop(0))\n if next_one[0:2] != [1, 0]:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n else:\n #print(\"c\", c, \"bin_c\", bin_c)\n return False\n \n return True","runtime":"124"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def validate(array):\n print(array)\n arrLen = len(array)\n if arrLen==1:\n if array[0][0] == '0': return True\n else:\n if array[0][:arrLen] == '1'*arrLen and array[0][arrLen] == '0':\n for i in range(1, arrLen):\n if array[i][:2] != '10': return False\n return True\n return False\n\n newData = ['{0:08b}'.format(i) for i in data]\n print(newData)\n i = 0\n while i<len(newData):\n increase = 1\n if newData[i][:4] == '1111': increase=4\n elif newData[i][:3] == '111': increase=3\n elif newData[i][:2] == '11': increase=2\n\n if not validate(newData[i:i+increase]): return False\n i+=increase\n \n print('this is i', i)\n if i>len(newData): return False\n return True","runtime":"126"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n values = []\n for datum in data:\n result = \"\"\n while datum or len(result) < 8:\n if datum & 1:\n result = \"1\" + result\n else:\n result = \"0\" + result\n datum >>= 1\n\n values.append(result)\n\n index = 0\n while index < len(values):\n count = 0\n for bit in values[index]:\n if bit == \"1\":\n count += 1\n else:\n break\n\n if not count:\n index += 1\n elif count == 1 or count > 4:\n return False\n else:\n for i in range(1, count):\n if i+index >= len(values) or values[i+index][:2] != \"10\":\n return False\n index += count\n \n return True\n\n","runtime":"127"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n \n i = 0\n \n while i < len(data):\n curr = data[i]\n num_bits = 0\n print(bin(curr))\n first_bit = (curr & (1 << 7)) >> 7\n\n print(f\"i : {i}, first_bit : {first_bit}\")\n\n if first_bit:\n num_bits = 1\n for j in range(6, -1, -1):\n if (curr & (1 << j)) >> j:\n num_bits += 1\n else:\n break\n if num_bits > 4 or num_bits == 1:\n return False\n\n i += 1\n num_bits -= 1\n print(f\"num_bits : {num_bits}\")\n while i < len(data) and num_bits > 0:\n byte = data[i]\n print(bin(byte))\n print(f\"i : {i}, {byte >> 6}\")\n if byte >> 6 != 2:\n return False\n \n num_bits -= 1\n i += 1\n\n else:\n i += 1\n\n return True if num_bits == 0 else False","runtime":"132"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n binaryRep = []\n for num in data: \n binaryRep.append(format(num, '#010b')[-8:]) # this should be -8 to get least sig 8 bits\n\n def inRange(i):\n if i in range(len(binaryRep)): return True\n def isFour(i):\n if not inRange(i): return False\n return binaryRep[i][0:5] == '11110'\n def isThree(i):\n if not inRange(i): return False\n return binaryRep[i][0:4] == '1110'\n def isTwo(i):\n if not inRange(i): return False\n return binaryRep[i][0:3] == '110'\n def isOne(i):\n if not inRange(i): return False\n return binaryRep[i][0:1] == '0'\n\n def isSigTen(i):\n if not inRange(i): return False\n return binaryRep[i][0:2] == '10'\n\n def rec(i):\n if not inRange(i): return True\n if isFour(i):\n return isSigTen(i+1) and isSigTen(i+2) and isSigTen(i+3) and rec(i+4)\n elif isThree(i):\n return isSigTen(i+1) and isSigTen(i+2) and rec(i+3)\n elif isTwo(i):\n return isSigTen(i+1) and rec(i+2)\n elif isOne(i):\n return rec(i+1)\n else: return False\n\n return rec(0)\n\n","runtime":"133"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def convert(num):\n res = \"\"\n i = 7\n while i >= 0:\n two = 2 ** i\n if num >= two:\n res += \"1\"\n num = num - two\n else:\n res += \"0\"\n i -= 1\n return res\n unicode = [convert(num) for num in data]\n print(unicode)\n i = 0\n while i < len(data):\n if unicode[i][0] == \"0\":\n i += 1\n else:\n if unicode[i][1] != \"1\":\n return False\n else:\n byte = 2\n j = 2\n while byte < 4 and unicode[i][j] == \"1\":\n byte += 1\n j += 1\n if i + byte > len(data) or unicode[i][j] != \"0\":\n return False\n for k in range(i+1,i+byte):\n if unicode[k][:2] != \"10\":\n return False\n i += byte\n return True\n ","runtime":"136"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n \n def base_ten_to_binary(num):\n\n ans = ['0'] * 8\n\n curr = 7\n\n while curr >= 0:\n\n if 2**curr <= num:\n num -= 2 ** curr\n ans[curr] = '1'\n curr -= 1\n return ''.join(ans)[::-1]\n\n sequence = []\n for d in data:\n sequence.append(base_ten_to_binary(d))\n\n moves = 0\n\n print(sequence)\n\n for curr in range(len(sequence)):\n datapoint = sequence[curr]\n\n one_count = 0\n\n while one_count < 4 and datapoint[one_count] == '1':\n one_count += 1\n\n if one_count == 1:\n moves -= 1\n\n elif one_count > 1:\n if moves: return False\n if datapoint[one_count] != '0': return False\n\n moves += one_count - 1 \n\n if moves < 0: return False\n\n return moves == 0","runtime":"137"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def binary(num):\n w = \"\"\n for i in range(7, -1, -1):\n if num >= 2 ** i:\n w += \"1\"\n num -= 2 ** i\n else:\n w += \"0\"\n\n return w\n \n for i in range(len(data)):\n data[i] = binary(data[i])\n\n i = 0\n while i < len(data):\n num = data[i]\n\n if num[0] == \"0\":\n i += 1\n elif num[:3] == \"110\":\n if (i + 1 >= len(data) or data[i + 1][:2] != \"10\"):\n return False\n i += 2\n elif num[:4] == \"1110\":\n if (i + 1 >= len(data) or data[i + 1][:2] != \"10\") or (i + 2 >= len(data) or data[i + 2][:2] != \"10\"):\n return False\n i += 3\n elif num[:5] == \"11110\":\n if (i + 1 >= len(data) or data[i + 1][:2] != \"10\") or (i + 2 >= len(data) or data[i + 2][:2] != \"10\") or (i + 3 >= len(data) or data[i + 3][:2] != \"10\"):\n return False\n i += 4\n else:\n return False\n return True\n\n\n \n print(data)\n return True","runtime":"138"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n chunk = []\n i = 1\n while data:\n chunk.append(data.pop(0))\n print(chunk, i)\n if i == 1:\n if all([\n chunk[0] < (2 ** 7)\n ]):\n chunk = []\n else:\n i += 1\n continue\n elif i == 2:\n if all([\n (2 ** 7 + 2 ** 6) <= chunk[0] < (2 ** 7 + 2 ** 6 + 2 ** 5),\n (2 ** 7) <= chunk[1] < (2 ** 7 + 2 ** 6)\n ]):\n chunk = []\n i = 1\n else:\n i += 1\n continue\n elif i == 3:\n if all([\n (2 ** 7 + 2 ** 6 + 2 ** 5) <= chunk[0] < (2 ** 7 + 2 ** 6 + 2 ** 5 + 2 ** 4),\n (2 ** 7) <= chunk[1] < (2 ** 7 + 2 ** 6),\n (2 ** 7) <= chunk[2] < (2 ** 7 + 2 ** 6)\n ]):\n chunk = []\n i = 1\n else:\n i += 1\n continue\n elif i == 4:\n if all([\n (2 ** 7 + 2 ** 6 + 2 ** 5 + 2 ** 4) <= chunk[0] < (2 ** 7 + 2 ** 6 + 2 ** 5 + 2 ** 4 + 2 ** 3),\n (2 ** 7) <= chunk[1] < (2 ** 7 + 2 ** 6),\n (2 ** 7) <= chunk[2] < (2 ** 7 + 2 ** 6),\n (2 ** 7) <= chunk[3] < (2 ** 7 + 2 ** 6)\n\n ]):\n chunk = []\n i = 1\n else:\n i += 1\n continue\n else:\n return False\n\n if chunk:\n return False\n else:\n return True","runtime":"139"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def to_binary_str(num):\n if num == 0:\n return \"00000000\"\n \n res = []\n while num != 0:\n res.append(str(num % 2))\n num //= 2\n \n while len(res) < 8:\n res.append('0')\n \n return \"\".join(res[::-1])\n \n def get_bytes_len(bin):\n if bin[0] == '0':\n return 1\n \n if bin[0] == '1' and bin[1] == '0':\n return -1\n \n i = 0\n byte_len = 0\n while i < 4 and bin[i] == '1':\n byte_len += 1\n i += 1\n \n if bin[i] == '1':\n return -1\n \n return byte_len\n \n def is_one_zero(bin):\n return bin[0] == '1' and bin[1] == '0'\n \n data_bin = [to_binary_str(num) for num in data]\n\n bytes_left = 0\n # print(data_bin)\n\n for bin_str in data_bin:\n if bytes_left == 0:\n bytes_left = get_bytes_len(bin_str)\n if bytes_left == -1:\n return False\n bytes_left -= 1\n else:\n if not is_one_zero(bin_str):\n return False\n bytes_left -= 1\n \n return bytes_left == 0\n\n\n ","runtime":"142"}],"string":"[\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n num = 0\\n mask1 = 1 << 7\\n mask2 = 1 << 6\\n\\n for byte in data:\\n mask = 1 << 7\\n if num == 0:\\n while (mask&byte):\\n num += 1\\n mask = mask >> 1\\n if num == 0:\\n continue\\n if num == 1 or num > 4:\\n return False\\n else:\\n if not((mask1 & byte) and not (mask2 & byte)):\\n return False\\n num -= 1\\n return num == 0 \",\n \"runtime\": \"71\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def check_next_byte(index):\\n if index >= len(data):\\n return False\\n return data[index] >> 6 == 0b10\\n\\n index = 0\\n while index < len(data):\\n first_byte = data[index]\\n if first_byte >> 7 == 0:\\n index += 1\\n elif first_byte >> 5 == 0b110 and check_next_byte(index + 1):\\n index += 2\\n elif first_byte >> 4 == 0b1110 and check_next_byte(index + 1) and check_next_byte(index + 2):\\n index += 3\\n elif first_byte >> 3 == 0b11110 and check_next_byte(index + 1) and check_next_byte(index + 2) and check_next_byte(index + 3):\\n index += 4\\n else:\\n return False\\n return True\",\n \"runtime\": \"73\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: list[int]) -> bool:\\n followedBytes = 0\\n\\n for d in data:\\n if followedBytes == 0:\\n if (d >> 3) == 0b11110:\\n followedBytes = 3\\n elif (d >> 4) == 0b1110:\\n followedBytes = 2\\n elif (d >> 5) == 0b110:\\n followedBytes = 1\\n elif (d >> 7) == 0b0:\\n followedBytes = 0\\n else:\\n return False\\n else:\\n if (d >> 6) != 0b10:\\n return False\\n followedBytes -= 1\\n\\n return followedBytes == 0\",\n \"runtime\": \"74\"\n },\n {\n \"code\": \"from typing import List\\n\\nclass Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def check(size):\\n for i in range(1, size):\\n if start + i >= len(data) or (data[start + i] >> 6) != 0b10:\\n return False\\n return True\\n \\n start = 0\\n while start < len(data):\\n first = data[start]\\n if (first >> 3) == 0b11110:\\n if not check(4):\\n return False\\n start += 4\\n elif (first >> 4) == 0b1110:\\n if not check(3):\\n return False\\n start += 3\\n elif (first >> 5) == 0b110:\\n if not check(2):\\n return False\\n start += 2\\n elif (first >> 7) == 0b0:\\n start += 1\\n else:\\n return False\\n return True\",\n \"runtime\": \"76\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n count = 0\\n\\n for byte in data:\\n if count > 0:\\n if byte >> 6 != 2:\\n return False\\n count -= 1\\n continue\\n if byte >> 3 == 30:\\n count = 3\\n continue\\n if byte >> 4 == 14:\\n count = 2\\n continue\\n if byte >> 5 == 6:\\n count = 1\\n continue\\n if byte >> 7 != 0:\\n return False\\n \\n return count == 0\\n \",\n \"runtime\": \"77\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n mask1, mask2 = 1 << 7, 1 << 6\\n char_no = 0\\n for num in data: \\n if char_no:\\n if not ((mask1 & num) and not (mask2 & num)): \\n return False\\n else:\\n # populate char\\n curr_mask = 1 << 7 \\n while curr_mask & num: \\n curr_mask = curr_mask >> 1\\n char_no += 1\\n if char_no == 0: \\n continue\\n if char_no == 1 or char_no > 4: \\n return False\\n\\n char_no -= 1\\n return char_no == 0 \",\n \"runtime\": \"81\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Number of bytes in the current UTF-8 character\\n n_bytes = 0\\n\\n # Mask to check if the most significant bit is set\\n mask1 = 1 << 7\\n # Mask to check if the second most significant bit is set\\n mask2 = 1 << 6\\n\\n for num in data:\\n # Get the most significant bit\\n mask = 1 << 7\\n if n_bytes == 0:\\n # Check how many bytes the character consists of\\n while mask & num:\\n n_bytes += 1\\n mask = mask >> 1\\n \\n # Handle the case of 1-byte character\\n if n_bytes == 0:\\n continue\\n \\n # UTF-8 must be 1 to 4 bytes\\n if n_bytes == 1 or n_bytes > 4:\\n return False\\n else:\\n # Check if the byte starts with '10'\\n if not (num & mask1 and not (num & mask2)):\\n return False\\n \\n # Decrement the number of bytes remaining in the sequence\\n n_bytes -= 1\\n\\n # Ensure all characters were processed\\n return n_bytes == 0\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.validUtf8([197, 130, 1])) # Output: True\\nprint(solution.validUtf8([235, 140, 4])) # Output: False\",\n \"runtime\": \"82\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n n = len(data)\\n i = j = 0\\n while i < n:\\n if data[i] <= 127:\\n i += 1\\n continue\\n elif 192 <= data[i] <= 223:\\n j = 1\\n elif 224 <= data[i] <= 239:\\n j = 2\\n elif 240 <= data[i] <= 247:\\n j = 3\\n else:\\n return False\\n i += 1\\n while j > 0 and i < n:\\n if data[i] < 128 or data[i] > 191:\\n return False\\n i += 1\\n j -= 1\\n return i == n and j == 0\",\n \"runtime\": \"83\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n n = len(data)\\n i = 0\\n while i < n:\\n first_byte = data[i]\\n # Determine the number of bytes in the UTF-8 character\\n if first_byte >> 3 == 0b11110: # 4-byte character\\n num_bytes = 4\\n elif first_byte >> 4 == 0b1110: # 3-byte character\\n num_bytes = 3\\n elif first_byte >> 5 == 0b110: # 2-byte character\\n num_bytes = 2\\n elif first_byte >> 7 == 0b0: # 1-byte character\\n num_bytes = 1\\n else:\\n return False\\n\\n # Check following bytes for the pattern 10xxxxxx\\n if i + num_bytes > n:\\n return False\\n for j in range(1, num_bytes):\\n if data[i + j] >> 6 != 0b10:\\n return False\\n i += num_bytes\\n return True\",\n \"runtime\": \"84\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # 255 = all 1\\n firstFive = 2**7 + 2**6 + 2**5 + 2**4 + 2**3\\n firstFour = 2**7 + 2**6 + 2**5 + 2**4\\n firstThree = 2**7 + 2**6 + 2**5\\n firstTwo = 2**7 + 2** 6\\n firstOne = 2**7\\n state = {\\n \\\"0\\\": {\\\"0xxxxxxx\\\": \\\"0\\\", \\\"110xxxxx\\\": \\\"2-1\\\", \\\"1110xxxx\\\": \\\"3-1\\\", \\\"11110xxx\\\": \\\"4-1\\\"},\\n \\\"2-1\\\": {\\\"10xxxxxx\\\": \\\"0\\\"},\\n \\\"3-1\\\": {\\\"10xxxxxx\\\": \\\"3-2\\\"},\\n \\\"3-2\\\": {\\\"10xxxxxx\\\": \\\"0\\\"},\\n \\\"4-1\\\": {\\\"10xxxxxx\\\": \\\"4-2\\\"},\\n \\\"4-2\\\": {\\\"10xxxxxx\\\": \\\"4-3\\\"},\\n \\\"4-3\\\": {\\\"10xxxxxx\\\": \\\"0\\\"},\\n }\\n # can be optimize with map of 255 memory\\n def getPattern(i):\\n if i & firstOne == 0:\\n return \\\"0xxxxxxx\\\"\\n if i & firstTwo == firstOne:\\n return \\\"10xxxxxx\\\"\\n if i & firstThree == firstTwo:\\n return \\\"110xxxxx\\\"\\n if i & firstFour == firstThree:\\n return \\\"1110xxxx\\\"\\n if i & firstFive == firstFour:\\n return \\\"11110xxx\\\"\\n curState = \\\"0\\\"\\n for byte in data:\\n d = state[curState]\\n p = getPattern(byte)\\n if p not in d:\\n return False \\n curState = d[p]\\n\\n return curState == \\\"0\\\"\\n \",\n \"runtime\": \"85\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n storeCount = 0\\n\\n for byte in data:\\n temp = 128 # 0b10000000\\n count = 0\\n\\n # Count leading ones in current byte\\n while byte & temp != 0:\\n count += 1\\n temp >>= 1\\n\\n if count > 4:\\n return False\\n elif count > 1:\\n if storeCount != 0:\\n return False\\n storeCount = count - 1\\n elif count == 0:\\n if storeCount != 0:\\n return False\\n else:\\n if storeCount >= 1:\\n storeCount -= 1\\n else:\\n return False\\n\\n return storeCount == 0\",\n \"runtime\": \"86\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n count = 0\\n print(bin(237))\\n for num in data:\\n if count == 0:\\n if num >> 5 == 0b110:\\n #print(\\\"5\\\")\\n count = 1\\n elif num >> 4 == 0b1110:\\n #print(\\\"4\\\")\\n count = 2\\n elif num >> 3 == 0b11110:\\n #print(\\\"3\\\")\\n count = 3\\n elif not (num >> 7 == 0b0):\\n #print(\\\"first, \\\" + str(num >> 7))\\n return False\\n elif count > 0:\\n count = count - 1\\n if not (num >> 6 == 0b10):\\n #print(\\\"second, \\\" +str(bin(num >> 6)))\\n return False\\n if count == 0:\\n return True\\n else:\\n return False\\n\\n\\n \",\n \"runtime\": \"87\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n start = 0\\n while start < len(data):\\n start = self.helper(data, start)\\n if start == -1:\\n return False\\n\\n return True\\n \\n def helper(self, data, start):\\n if (data[start] >> 7) == 0:\\n n = 1\\n elif (data[start] >> 5) == 6:\\n n = 2\\n elif (data[start] >> 4) == 14:\\n n = 3\\n elif (data[start] >> 3) == 30:\\n n = 4\\n else:\\n return -1\\n \\n if start+n > len(data):\\n return -1\\n\\n for i in range(start+1, start+n):\\n val = data[i]\\n if (val >> 6) != 2:\\n return -1\\n return start+n\",\n \"runtime\": \"88\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Number of bytes in the current UTF-8 character\\n num_bytes = 0\\n\\n # Mask to check if the most significant bit is set\\n MASK1 = 1 << 7\\n # Mask to check if the second most significant bit is set\\n MASK2 = 1 << 6\\n\\n for num in data:\\n # Get the leading bit mask for the current byte\\n mask = 1 << 7\\n \\n # If this is the first byte of a new character\\n if num_bytes == 0:\\n # Count the number of leading 1s to determine the number of bytes\\n while mask & num:\\n num_bytes += 1\\n mask >>= 1\\n\\n # Handle the case of a single-byte character (0xxxxxxx)\\n if num_bytes == 0:\\n continue\\n\\n # UTF-8 must be between 2 and 4 bytes\\n if num_bytes == 1 or num_bytes > 4:\\n return False\\n else:\\n # If this is a continuation byte, it must start with '10'\\n if not (num & MASK1 and not (num & MASK2)):\\n return False\\n\\n # Decrement the number of bytes remaining in the current UTF-8 character\\n num_bytes -= 1\\n\\n # Ensure all characters were fully processed\\n return num_bytes == 0\\n\\n# Example usage:\\nsolution = Solution()\\nprint(solution.validUtf8([197, 130, 1])) # Output: True\\nprint(solution.validUtf8([235, 140, 4])) # Output: False\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Number of bytes in the current UTF-8 character\\n num_bytes = 0\\n\\n # Mask to check if the most significant bit is 1\\n mask1 = 1 << 7\\n # Mask to check if the second most significant bit is 1\\n mask2 = 1 << 6\\n\\n for byte in data:\\n # Get the most significant bit\\n mask = 1 << 7\\n if num_bytes == 0:\\n # Determine the number of bytes for the current character\\n while mask & byte:\\n num_bytes += 1\\n mask >>= 1\\n\\n # Check if the number of bytes is valid\\n if num_bytes == 0:\\n continue # 1-byte character\\n elif num_bytes == 1 or num_bytes > 4:\\n return False\\n else:\\n # Check if this is a continuation byte (starts with 10xxxxxx)\\n if not (mask1 & byte and not (mask2 & byte)):\\n return False\\n\\n # Decrement the number of bytes remaining for the current character\\n num_bytes -= 1\\n\\n # Ensure all characters have been fully processed\\n return num_bytes == 0\\n\\n# Example usage:\\nsolution = Solution()\\ndata = [197, 130, 1]\\nprint(solution.validUtf8(data)) # Output: True\\n\\ndata = [235, 140, 4]\\nprint(solution.validUtf8(data)) # Output: False\",\n \"runtime\": \"89\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n x=0\\n while x < len(data):\\n b = bin(data[x])[2:]\\n if len(b)<8:\\n x+=1\\n else:\\n i=0\\n while i<len(b) and b[i]==\\\"1\\\":\\n i+=1\\n if i==2:\\n if x > len(data)-2:\\n return False\\n b_next = bin(data[x+1])[2:]\\n if not(len(b_next)==8 and b_next[:2]==\\\"10\\\"):\\n return False\\n x+=2\\n elif i==3 or i==4:\\n if x > len(data)-3:\\n return False\\n b_next = bin(data[x+1])[2:]\\n b_next2 = bin(data[x+2])[2:]\\n ret = len(b_next)==8 and b_next[:2]==\\\"10\\\"\\n ret = ret and len(b_next2)==8 and b_next2[:2]==\\\"10\\\"\\n if not ret:\\n return False\\n x+=i\\n else:\\n return False\\n \\n return True\",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n \\n def count_leading_1s(x: int) -> int:\\n ret = 0\\n while (7-ret) and x & (1 << (7-ret)):\\n ret += 1\\n return ret\\n\\n cnt = 0\\n for d in data:\\n lead_1s = count_leading_1s(d)\\n if lead_1s == 0: # 1-byte character\\n # print(d, \\\"is 1-byte\\\")\\n if cnt:\\n return False\\n elif lead_1s == 1: # Part of a multi-byte char\\n # print(d, \\\"is part of a multi-byte\\\")\\n if not cnt :\\n return False\\n cnt -= 1\\n elif lead_1s <= 4: # Head of a multi-byte char\\n # print(d, f\\\"is head of a {lead_1s}-byte\\\")\\n if cnt:\\n return False\\n cnt += lead_1s-1\\n else: # There's no 5-byte char and above\\n # print(d, f\\\"is head of a {lead_1s}-byte\\\")\\n return False\\n return not cnt\\n\\n \\n \",\n \"runtime\": \"90\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n \\n \\n in_sequence = False\\n sequence = 0\\n for num in data:\\n byte = str(format(num, '08b'))\\n\\n if not in_sequence:\\n if byte[0] == '0':\\n continue\\n elif byte[:5] == '11110':\\n in_sequence = True\\n sequence = 3\\n elif byte[:4] == '1110':\\n in_sequence = True\\n sequence = 2\\n elif byte[:3] == '110':\\n in_sequence = True\\n sequence = 1\\n else:\\n return False\\n else:\\n if byte[:2] != '10':\\n return False\\n \\n sequence -= 1\\n\\n if sequence == 0:\\n in_sequence = False\\n\\n if in_sequence:\\n return False\\n return True\\n\\n\\n\",\n \"runtime\": \"91\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data):\\n \\\"\\\"\\\"\\n :type data: List[int]\\n :rtype: bool\\n \\\"\\\"\\\"\\n\\n # Number of bytes in the current UTF-8 character\\n n_bytes = 0\\n\\n # Mask to check if the most significant bit (8th bit from the left) is set or not\\n mask1 = 1 << 7\\n\\n # Mask to check if the second most significant bit is set or not\\n mask2 = 1 << 6\\n for num in data:\\n\\n # Get the number of set most significant bits in the byte if\\n # this is the starting byte of an UTF-8 character.\\n mask = 1 << 7\\n if n_bytes == 0:\\n while mask & num:\\n n_bytes += 1\\n mask = mask >> 1\\n\\n # 1 byte characters\\n if n_bytes == 0:\\n continue\\n\\n # Invalid scenarios according to the rules of the problem.\\n if n_bytes == 1 or n_bytes > 4:\\n return False\\n else:\\n\\n # If this byte is a part of an existing UTF-8 character, then we\\n # simply have to look at the two most significant bits and we make\\n # use of the masks we defined before.\\n if not (num & mask1 and not (num & mask2)):\\n return False\\n n_bytes -= 1\\n return n_bytes == 0 \",\n \"runtime\": \"92\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n i, n = 0, len(data)\\n while i < n:\\n byte = data[i]\\n if byte >> 7 == 0b0:\\n i += 1\\n elif byte >> 5 == 0b110:\\n if i + 1 >= n or data[i + 1] >> 6 != 0b10:\\n return False\\n i += 2\\n elif byte >> 4 == 0b1110:\\n if i + 2 >= n or any(data[j] >> 6 != 0b10 for j in range(i + 1, i + 3)):\\n return False\\n i += 3\\n elif byte >> 3 == 0b11110:\\n if i + 3 >= n or any(data[j] >> 6 != 0b10 for j in range(i + 1, i + 4)):\\n return False\\n i += 4\\n else:\\n return False\\n return True\",\n \"runtime\": \"93\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n i = 0\\n while i < len(data):\\n byte = data[i]\\n if (byte >> 7) == 0b0:\\n i += 1\\n elif (byte >> 5) == 0b110:\\n if i + 1 >= len(data) or (data[i + 1] >> 6) != 0b10:\\n return False\\n i += 2\\n elif (byte >> 4) == 0b1110:\\n if i + 2 >= len(data) or (data[i + 1] >> 6) != 0b10 or (data[i + 2] >> 6) != 0b10:\\n return False\\n i += 3\\n elif (byte >> 3) == 0b11110:\\n if i + 3 >= len(data) or (data[i + 1] >> 6) != 0b10 or (data[i + 2] >> 6) != 0b10 or (data[i + 3] >> 6) != 0b10:\\n return False\\n i += 4\\n else:\\n return False\\n return True \",\n \"runtime\": \"94\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def get_num_bytes(num):\\n if (num >> 7) == 0b0:\\n return 1\\n elif (num >> 5) == 0b110:\\n return 2\\n elif (num >> 4) == 0b1110:\\n return 3\\n elif (num >> 3) == 0b11110:\\n return 4\\n else:\\n return -1\\n \\n i = 0\\n while i < len(data):\\n num_bytes = get_num_bytes(data[i])\\n if num_bytes == -1:\\n return False\\n for j in range(1, num_bytes):\\n if i + j >= len(data) or (data[i + j] >> 6) != 0b10:\\n return False\\n i += num_bytes\\n return True\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def get_bits(num):\\n return bin(num)[2:].zfill(8)\\n \\n i = 0\\n while i < len(data):\\n bits = get_bits(data[i])\\n if bits[0] == '0':\\n i += 1\\n elif bits[:3] == '110' and i + 1 < len(data):\\n if get_bits(data[i + 1])[:2] != '10':\\n return False\\n i += 2\\n elif bits[:4] == '1110' and i + 2 < len(data):\\n if not (get_bits(data[i + 1])[:2] == '10' and get_bits(data[i + 2])[:2] == '10'):\\n return False\\n i += 3\\n elif bits[:5] == '11110' and i + 3 < len(data):\\n if not (get_bits(data[i + 1])[:2] == '10' and get_bits(data[i + 2])[:2] == '10' and get_bits(data[i + 3])[:2] == '10'):\\n return False\\n i += 4\\n else:\\n return False\\n return True\",\n \"runtime\": \"95\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Number of bytes in the current UTF-8 character\\n n_bytes = 0\\n\\n # Mask to check if the most significant bit is set or not\\n mask1 = 1 << 7\\n # Mask to check if the second most significant bit is set or not\\n mask2 = 1 << 6\\n \\n for num in data:\\n if n_bytes == 0:\\n # Count the number of 1s in the beginning of the byte\\n mask = mask1\\n while mask & num:\\n n_bytes += 1\\n mask = mask >> 1\\n \\n # 1 byte characters\\n if n_bytes == 0:\\n continue\\n \\n # Invalid scenarios according to the rules of the problem\\n if n_bytes == 1 or n_bytes > 4:\\n return False\\n else:\\n # If we are processing bytes which are not the start of a character\\n if not (num & mask1 and not (num & mask2)):\\n return False\\n n_bytes -= 1\\n \\n # If we have processed all bytes and n_bytes is 0, it's valid\\n return n_bytes == 0\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.validUtf8([197, 130, 1])) # Should print True\\nprint(solution.validUtf8([235, 140, 4])) # Should print False\",\n \"runtime\": \"96\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data):\\n # Number of bytes in the current UTF-8 character\\n number_of_bytes = 0\\n \\n # Mask to check if the most significant bit is set\\n MASK1 = 1 << 7\\n # Mask to check if the second most significant bit is set\\n MASK2 = 1 << 6\\n \\n for num in data:\\n # Get the current byte\\n mask = 1 << 7\\n if number_of_bytes == 0:\\n # Determine the number of bytes in the current UTF-8 character\\n while mask & num:\\n number_of_bytes += 1\\n mask >>= 1\\n \\n # 1-byte character\\n if number_of_bytes == 0:\\n continue\\n \\n # Invalid scenarios: number_of_bytes = 0 or number_of_bytes > 4\\n if number_of_bytes == 1 or number_of_bytes > 4:\\n return False\\n else:\\n # Check if the current byte is a continuation byte (10xxxxxx)\\n if not (num & MASK1 and not (num & MASK2)):\\n return False\\n \\n # Decrement the number of bytes in the current UTF-8 character\\n number_of_bytes -= 1\\n \\n # Check if all bytes have been processed\\n return number_of_bytes == 0\\n\\n# Example usage:\\nsolution = Solution()\\ndata = [197, 130, 1]\\nprint(solution.validUtf8(data)) # Output: True\\n\\ndata = [235, 140, 4]\\nprint(solution.validUtf8(data)) # Output: False\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n sequence = []\\n\\n for i in data:\\n sequence.append(\\\"{0:08b}\\\".format(i))\\n\\n i = 0\\n n = len(sequence)\\n while i <n:\\n if sequence[i][0] == '0':\\n i +=1\\n continue\\n if sequence[i][:3] == '110' and n-i>=1:\\n if sequence[i+1][:2] == '10':\\n i +=2\\n continue\\n if sequence[i][:4] == '1110' and n-i>=2:\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2]=='10':\\n i +=3\\n continue\\n if sequence[i][:5] == '11110' and n-i>=3:\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\\n i +=4\\n continue\\n else:\\n return False\\n return True\\n \\n\\n\\n\",\n \"runtime\": \"97\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n num_bytes = len(data)\\n\\n def validate_1_0(num: int) -> bool:\\n if (num - 128) >= 0:\\n print(num)\\n num -= 128\\n if (num - 64 <= 0):\\n print(num)\\n return True\\n return False\\n return False\\n\\n i = 0 \\n while i < num_bytes:\\n num_seqs = 0\\n if (data[i] < 128):\\n i += 1\\n continue\\n elif (data[i] >= 192 and data[i] < 224):\\n num_seqs = 1\\n elif (data[i] >= 224 and data[i] < 240):\\n num_seqs = 2\\n elif (data[i] >=240 and data[i] < 248):\\n num_seqs = 3\\n else:\\n print(i, \\\"false here\\\")\\n return False\\n \\n while num_seqs > 0 and i + 1 < num_bytes:\\n i += 1\\n if not validate_1_0(data[i]):\\n print(i, \\\"not valid\\\")\\n return False\\n num_seqs -= 1\\n if (num_seqs):\\n return False\\n i += 1\\n \\n \\n return True\\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n i = 0\\n while i < len(data):\\n x = self.num_bytes(data[i])\\n if x == 0:\\n return False\\n for j in range(i + 1, i + x):\\n if j >= len(data):\\n return False\\n if ((data[j] & 128) == 0) or (data[j] & 64):\\n return False\\n i += x\\n return True\\n\\n def num_bytes(self, bin):\\n mask = 1 << 7\\n mask2 = 1 << 6\\n nbytes = 0\\n if not (mask & bin):\\n return 1\\n while mask & bin:\\n nbytes+=1\\n mask = mask >> 1\\n if nbytes == 1 or nbytes > 4:\\n return 0\\n return nbytes \\n \",\n \"runtime\": \"98\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def matches_bitmask(number, bitmask, zero_bitmask):\\n return (number & bitmask) == bitmask and (number & zero_bitmask) == 0\\n\\n checks = 0\\n for i in range(len(data)):\\n if checks > 0:\\n if not matches_bitmask(data[i], 0b10000000, 0b01000000):\\n return False\\n checks -= 1\\n else:\\n if matches_bitmask(data[i], 0b11110000, 0b00001000):\\n checks = 3\\n elif matches_bitmask(data[i], 0b11100000, 0b00010000):\\n checks = 2\\n elif matches_bitmask(data[i], 0b11000000, 0b00100000):\\n checks = 1\\n elif data[i] < 128:\\n checks = 0\\n else:\\n # print(data[i])\\n return False\\n if checks != 0:\\n # print(checks)\\n return False\\n return True\",\n \"runtime\": \"99\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def ones(num):\\n \\n ans = 0\\n done = False\\n\\n for i in range(8):\\n if num % 2:\\n ans += 1\\n else:\\n ans = 0\\n done = True\\n \\n num = num >> 1\\n \\n return [ans,done]\\n \\n def ten(num):\\n return (num >> 6) % 2 == 0 and (num >> 7) % 2 == 1\\n done = False\\n num = 0\\n\\n for dat in data:\\n if not done:\\n l = ones(dat)\\n done = l[1]\\n num += l[0]\\n if done:\\n num -= 1\\n if num == -1:\\n done = False\\n num = 0\\n continue\\n if not num:\\n return False\\n if num >= 4:\\n return False\\n else:\\n \\n if not ten(dat):\\n return False\\n \\n num -= 1\\n\\n if num == 0:\\n done = False\\n \\n \\n\\n print(num)\\n return not num\\n \",\n \"runtime\": \"100\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: list[int]) -> bool:\\n time = 0\\n for i in data:\\n now = bin(i)[2:].zfill(8)\\n print(now)\\n if time == 0:\\n for i in now[:5]:\\n if i == '0':\\n break\\n time += 1\\n if time == 5:\\n return False\\n elif time > 1:\\n time -=1\\n elif time == 1:\\n return False\\n elif time > 0:\\n if now[:2] == '10':\\n time -=1\\n else:\\n return False\\n else:\\n return False\\n return time == 0 \",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n ptr = 0\\n while(ptr < len(data)):\\n current = f'{data[ptr]:08b}'\\n num_bytes = 0\\n if current[0] == \\\"0\\\":\\n num_bytes = 1\\n else:\\n temp = 0\\n while temp < len(current) and current[temp] == \\\"1\\\":\\n temp +=1\\n num_bytes +=1\\n if temp > 4 or current[temp] != \\\"0\\\" or temp == 1:\\n return False\\n ptr +=1\\n for i in range(num_bytes-1):\\n if ptr + i >= len(data):\\n return False\\n elem = f'{data[ptr+i]:08b}'\\n if elem[:2] != \\\"10\\\":\\n return False\\n ptr += num_bytes - 1\\n return True\\n\",\n \"runtime\": \"101\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data):\\n \\\"\\\"\\\"\\n :type data: List[int]\\n :rtype: bool\\n \\\"\\\"\\\"\\n\\n # Number of bytes in the current UTF-8 character\\n n_bytes = 0\\n\\n # For each integer in the data array.\\n for num in data:\\n\\n # Get the binary representation. We only need the least significant 8 bits\\n # for any given number.\\n bin_rep = format(num, '#010b')[-8:]\\n\\n # If this is the case then we are to start processing a new UTF-8 character.\\n if n_bytes == 0:\\n\\n # Get the number of 1s in the beginning of the string.\\n for bit in bin_rep:\\n if bit == '0': break\\n n_bytes += 1\\n\\n # 1 byte characters\\n if n_bytes == 0:\\n continue\\n\\n # Invalid scenarios according to the rules of the problem.\\n if n_bytes == 1 or n_bytes > 4:\\n return False\\n else:\\n # Else, we are processing integers which represent bytes which are a part of\\n # a UTF-8 character. So, they must adhere to the pattern `10xxxxxx`.\\n if not (bin_rep[0] == '1' and bin_rep[1] == '0'):\\n return False\\n\\n # We reduce the number of bytes to process by 1 after each integer.\\n n_bytes -= 1\\n\\n # This is for the case where we might not have the complete data for\\n # a particular UTF-8 character.\\n return n_bytes == 0 \",\n \"runtime\": \"102\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n state = 0\\n for d in data:\\n print(d, state)\\n if state:\\n state -= 1\\n if d & 192 != 128:\\n return False\\n else:\\n if d & 128:\\n state = 1\\n if not d & 64:\\n return False\\n if d & 48:\\n state = (d & 48) >> 4\\n if state == 3 and d & 8:\\n return False\\n if d & 8:\\n return False\\n else:\\n state = 0\\n \\n return state == 0\",\n \"runtime\": \"103\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def int_to_bin(i: int) -> str:\\n return bin(i)[2:].zfill(8)\\n\\n remaining_bytes = 0\\n\\n for num in data:\\n binary = int_to_bin(num)\\n\\n if remaining_bytes == 0:\\n if binary.startswith(\\\"0\\\"):\\n continue\\n elif binary.startswith(\\\"110\\\"):\\n remaining_bytes = 1\\n elif binary.startswith(\\\"1110\\\"):\\n remaining_bytes = 2\\n elif binary.startswith(\\\"11110\\\"):\\n remaining_bytes = 3\\n else:\\n return False\\n else:\\n if not binary.startswith(\\\"10\\\"):\\n return False\\n remaining_bytes -= 1\\n \\n return remaining_bytes == 0\",\n \"runtime\": \"104\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n s = data\\n n = len(s)\\n i = 0\\n def g_b(x):\\n b_s = bin(x)[2:]\\n b_s = \\\"0\\\"*(8-len(b_s))+b_s[-8:]\\n return b_s\\n while i<n:\\n b_s = g_b(s[i])\\n if b_s[0]==\\\"0\\\":\\n i += 1\\n else:\\n k = 0\\n while b_s[k]==\\\"1\\\":\\n k += 1\\n if k>4: return False\\n if k==1: return False\\n while k>1:\\n i += 1\\n if i>=n: return False\\n b_s = g_b(s[i])\\n if b_s[:2]!=\\\"10\\\":\\n return False\\n k -= 1\\n i += 1\\n return True\\n\\n \",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n N_bytes = len(data)\\n\\n bits = [bin(num)[2:] for num in data]\\n\\n bits = [\\\"0\\\" * (8-len(bit)) + bit for bit in bits]\\n N_bytes = 0\\n # print(bits[-10:])\\n for i, bit in enumerate(bits):\\n # print(N_bytes, bit)\\n if N_bytes != 0 and bit[0] == '0': return False\\n if N_bytes != 0 and bit[:2] != '10': return False\\n\\n if bit[0] == '0': continue\\n\\n if bit[:2] == '10':\\n N_bytes -= 1\\n continue\\n \\n if N_bytes < 0: return False\\n \\n N_bytes = len(bit[:5].split('0')[0]) - 1\\n if N_bytes == 4: return False\\n \\n return N_bytes == 0\\n\",\n \"runtime\": \"105\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n bytedata = []\\n for data in data:\\n bytedata.append(bin(data)[2:].zfill(8))\\n \\n print(bytedata)\\n \\n cbyte = 0\\n for byte in bytedata:\\n if cbyte == 0:\\n if byte[:5] == '11110':\\n cbyte = 3\\n elif byte[:4] == '1110':\\n cbyte = 2\\n elif byte[:3] == '110':\\n cbyte = 1\\n elif byte[0] == '0':\\n cbyte = 0\\n else:\\n return False\\n else:\\n if byte[:2] == '10':\\n cbyte -= 1\\n else:\\n return False\\n print(cbyte)\\n return cbyte == 0\\n\\n # bitshifting\\n # # Initialize a counter variable\\n # count = 0\\n \\n # # Iterate through each integer in the input data list\\n # for num in data:\\n # # If the count is 0, check how many leading 1's there are in the current integer\\n # if count == 0:\\n # if (num >> 5) == 0b110:\\n # count = 1\\n # elif (num >> 4) == 0b1110:\\n # count = 2\\n # elif (num >> 3) == 0b11110:\\n # count = 3\\n # elif (num >> 7) != 0:\\n # return False\\n # # If the count is not 0, check if the current integer is a continuation byte\\n # else:\\n # if (num >> 6) != 0b10:\\n # return False\\n # count -= 1\\n \\n # # If the count is still not 0 after iterating through all the integers, it is invalid\\n # return count == 0\",\n \"runtime\": \"106\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Convert all the numbers into binary\\n for i in range(len(data)):\\n data[i] = str(bin(data[i])[2:])\\n while len(data[i]) < 8:\\n data[i] = \\\"0\\\" + data[i]\\n \\n i = 0\\n while i < len(data):\\n if data[i][0] == \\\"0\\\":\\n i += 1\\n continue\\n elif data[i][:3] == \\\"110\\\":\\n if i + 1 >= len(data) or data[i+1][0] + data[i+1][1] != \\\"10\\\":\\n print(\\\"1\\\")\\n return False\\n i += 2\\n elif data[i][:4] == \\\"1110\\\":\\n if i + 2 >= len(data):\\n print(\\\"2\\\")\\n return False\\n if data[i+1][:2] != \\\"10\\\" or data[i+2][:2] != \\\"10\\\":\\n print(\\\"3\\\")\\n return False\\n i += 3\\n elif data[i][:5] == \\\"11110\\\":\\n if i + 3 >= len(data):\\n print(\\\"4\\\")\\n return False\\n if data[i+1][:2] != \\\"10\\\" or data[i+2][:2] != \\\"10\\\" or data[i+3][:2] != \\\"10\\\":\\n print(\\\"5\\\")\\n return False\\n i += 4\\n else:\\n print(data[i])\\n print(\\\"6\\\")\\n return False\\n \\n return True\",\n \"runtime\": \"107\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n sequence = []\\n\\n for i in data:\\n sequence.append(\\\"{0:08b}\\\".format(i))\\n\\n i = 0\\n n = len(sequence)\\n while i <n:\\n if sequence[i][0] == '0':\\n i +=1\\n continue\\n if sequence[i][:3] == '110' and n-i>=1:\\n if sequence[i+1][:2] == '10':\\n i +=2\\n continue\\n if sequence[i][:4] == '1110' and n-i>=2:\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2]=='10':\\n i +=3\\n continue\\n if sequence[i][:5] == '11110' and n-i>=3:\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\\n i +=4\\n continue\\n else:\\n return False\\n return True\\n \\n\\n\\n\",\n \"runtime\": \"108\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n\\t # a list to store binary representation of the numbers\\n sequence = []\\n\\t\\t# get binary representation of all the numbers\\n for d in data:\\n sequence.append(\\\"{0:08b}\\\".format(d))\\n \\n i = 0\\n n = len(sequence)\\n while i < n:\\n if sequence[i][0] == '0': # 1-byte check\\n i += 1\\n continue\\n if sequence[i][:3] == '110' and n-i>=1: # 2-byte check\\n if sequence[i+1][:2] == '10':\\n i += 2\\n continue\\n if sequence[i][:4] == '1110' and n-i>=2: # 3-byte check\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10':\\n i += 3\\n continue\\n if sequence[i][:5] == '11110' and n-i>=3: # 4-byte check\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\\n i += 4\\n continue\\n else:\\n return False\\n return True\",\n \"runtime\": \"109\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n for item in data:\\n print(f'{item:08b}')\\n ptr = 0\\n while(ptr < len(data)):\\n current = f'{data[ptr]:08b}'\\n num_bytes = 0\\n if current[0] == \\\"0\\\":\\n num_bytes = 1\\n else:\\n temp = 0\\n while temp < len(current) and current[temp] == \\\"1\\\":\\n temp +=1\\n num_bytes +=1\\n if temp > 4 or current[temp] != \\\"0\\\" or temp == 1:\\n print(current, temp)\\n return False\\n ptr +=1\\n for i in range(num_bytes-1):\\n if ptr + i >= len(data):\\n return False\\n elem = f'{data[ptr+i]:08b}'\\n if elem[:2] != \\\"10\\\":\\n return False\\n ptr += num_bytes - 1\\n return True\\n\",\n \"runtime\": \"110\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n N_bytes = len(data)\\n\\n bits = [bin(num)[2:] for num in data]\\n\\n bits = [\\\"0\\\" * (8-len(bit)) + bit for bit in bits]\\n N_bytes = 0\\n\\n for i, bit in enumerate(bits):\\n if N_bytes != 0 and (bit[0] == '0' or bit[:2] != '10'): return False\\n\\n if bit[0] == '0': continue\\n\\n if bit[:2] == '10':\\n N_bytes -= 1\\n continue\\n \\n # if N_bytes < 0: return False\\n \\n N_bytes = len(bit[:5].split('0')[0]) - 1\\n if N_bytes == 4: return False\\n \\n return N_bytes == 0\\n\",\n \"runtime\": \"111\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n n = len(data)\\n def checkSeq(i):\\n num = data[i]\\n count = 0\\n j = 7\\n\\n while j >= 0 and (num >> j)&1:\\n count += 1\\n j -= 1\\n\\n if j < 0 or count == 1 or count > 4:\\n return -1\\n\\n if (num >> 7) & 1 == 0:\\n count = 1\\n \\n if i+count > n:\\n return -1\\n\\n for k in range(i+1, i+count):\\n if (data[k] >> 6) & 1 or (data[k] >> 7)&1 == 0:\\n return -1\\n print(i,j,count)\\n return i+count\\n\\n i = 0\\n\\n while i < n:\\n idx = checkSeq(i)\\n if idx == -1:\\n return False\\n\\n i = idx\\n\\n return True\\n\\n \\n\\n \",\n \"runtime\": \"112\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Approach\\n # Keep a variable of num_bytes to validate\\n # The number of 1's in the first byte tells you the number of bytes to validate\\n # Every time you process an integer if num_bytes == 0:\\n # You are starting a new byte sequence, so check the rules for the first byte\\n # If num_bytes > 0, check for the 10xxxx rule for subsequent bytes\\n # If any rule violations while iterating through bytes, return false otherwise return True\\n\\n num_bytes: int = 0\\n for d in data:\\n bin_str = self.convert_to_binary(d)\\n print(bin_str)\\n\\n # Start of a new bytes sequence\\n if num_bytes == 0:\\n num_ones: int = 0\\n for i in range(len(bin_str)):\\n if bin_str[i] == \\\"1\\\":\\n num_ones += 1\\n else:\\n break\\n\\n # If no ones, then single byte sequence\\n if num_ones == 0:\\n continue\\n # Single leading 1 not a valid format\\n elif num_ones == 1:\\n return False\\n # Max 4 sequence bytes\\n elif num_ones > 4:\\n return False\\n else:\\n num_bytes = num_ones\\n # Checking subsequent byte sequences\\n else:\\n if bin_str[0:2] != \\\"10\\\":\\n return False\\n\\n # Decrement byte sequence\\n num_bytes -= 1\\n\\n # Tricky: make sure no unfinished sequences\\n return num_bytes == 0\\n\\n def convert_to_binary(self, input: int) -> str:\\n return format(input, '#010b')[-8:]\\n\\n\\n# 11000101 10000010 00000001\\n# num_bytes = 0\\n# d = 11000101\\n# num_ones = 2\\n# num_bytes = 2\\n# num_bytes = 1\\n# d = 10000010\\n# num_bytes = 0\\n# d = 00000001\\n# num_ones = 0\\n# continue\\n# return True\",\n \"runtime\": \"113\"\n },\n {\n \"code\": \"class Solution:\\n def integer_to_padded_binary_string(self, n, num_bits=8):\\n return format(n, f'0{num_bits}b')\\n\\n def validUtf8(self, data: List[int]) -> bool:\\n for i in range(len(data)):\\n data[i] = self.integer_to_padded_binary_string(data[i])\\n \\n print (data)\\n\\n i = 0\\n\\n while i < len(data):\\n b = data[i]\\n \\n if b[0] == '0':\\n print(\\\"alsdkfja\\\")\\n elif b[0:5] == \\\"11110\\\":\\n print('here!xx')\\n for _ in range(3):\\n i += 1\\n if i >= len(data): return False\\n t = data[i]\\n if t[0:2] != \\\"10\\\":\\n return False\\n elif b[0:4] == \\\"1110\\\":\\n print('here!')\\n for k in range(2):\\n i += 1\\n if i >= len(data): return False\\n t = data[i]\\n print(t)\\n if t[0:2] != \\\"10\\\":\\n return False\\n elif b[0:3] == \\\"110\\\":\\n print('hereaasdf!')\\n i += 1\\n if i >= len(data): return False\\n t = data[i]\\n if t[0:2] != \\\"10\\\":\\n return False\\n else:\\n print('asdhjfasfd')\\n return False\\n \\n i += 1\\n \\n\\n print('asdlfjad')\\n return True\",\n \"runtime\": \"114\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n int_to_binary = []\\n utf_length = 8\\n for i in range(len(data)):\\n binary = \\\"{0:b}\\\".format(data[i])\\n if len(binary) < utf_length:\\n needed_0 = utf_length - len(binary)\\n binary = \\\"0\\\" * needed_0 + binary\\n int_to_binary.append(binary)\\n if len(binary) > utf_length:\\n int_to_binary.append(binary[-utf_length:])\\n else: \\n int_to_binary.append(binary)\\n\\n i = 0\\n while i < len(int_to_binary):\\n if int_to_binary[i][0] == '0':\\n i += 1\\n continue\\n elif int_to_binary[i][:3] == '110':\\n if i + 1 >= len(int_to_binary) or int_to_binary[i + 1][:2] != '10':\\n return False\\n i += 2\\n elif int_to_binary[i][:4] == '1110':\\n if i + 2 >= len(int_to_binary) or int_to_binary[i + 1][:2] != '10' or int_to_binary[i + 2][:2] != '10':\\n return False\\n i += 3\\n elif int_to_binary[i][:5] == '11110':\\n if i + 3 >= len(int_to_binary) or int_to_binary[i + 1][:2] != '10' or int_to_binary[i + 2][:2] != '10' or int_to_binary[i + 3][:2] != '10':\\n return False\\n i += 4\\n else:\\n return False\\n \\n return True\\n\",\n \"runtime\": \"115\"\n },\n {\n \"code\": \"class Solution:\\n def integer_to_padded_binary_string(self, n, num_bits=8):\\n return format(n, f'0{num_bits}b')\\n\\n def validUtf8(self, data: List[int]) -> bool:\\n for i in range(len(data)):\\n data[i] = self.integer_to_padded_binary_string(data[i])\\n \\n print (data)\\n\\n i = 0\\n\\n while i < len(data):\\n b = data[i]\\n \\n if b[0] == '0':\\n print(\\\"alsdkfja\\\")\\n elif b[0:5] == \\\"11110\\\":\\n print('here!xx')\\n for _ in range(3):\\n i += 1\\n if i >= len(data): return False\\n t = data[i]\\n if t[0:2] != \\\"10\\\":\\n return False\\n elif b[0:4] == \\\"1110\\\":\\n print('here!')\\n for k in range(2):\\n i += 1\\n if i >= len(data): return False\\n t = data[i]\\n print(t)\\n if t[0:2] != \\\"10\\\":\\n return False\\n elif b[0:3] == \\\"110\\\":\\n print('hereaasdf!')\\n i += 1\\n if i >= len(data): return False\\n t = data[i]\\n if t[0:2] != \\\"10\\\":\\n return False\\n else:\\n print('asdhjfasfd')\\n return False\\n \\n i += 1\\n \\n\\n print('asdlfjad')\\n return True\",\n \"runtime\": \"116\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n bytedata = []\\n for data in data:\\n bytedata.append(bin(data)[2:].zfill(8))\\n \\n print(bytedata)\\n \\n cbyte = 0\\n for byte in bytedata:\\n if cbyte == 0:\\n if byte[:5] == '11110':\\n cbyte = 3\\n elif byte[:4] == '1110':\\n cbyte = 2\\n elif byte[:3] == '110':\\n cbyte = 1\\n elif byte[0] == '0':\\n cbyte = 0\\n else:\\n return False\\n else:\\n if byte[:2] == '10':\\n cbyte -= 1\\n else:\\n return False\\n print(cbyte)\\n return cbyte == 0\",\n \"runtime\": \"117\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n bytedata = []\\n for data in data:\\n bytedata.append(bin(data)[2:].zfill(8))\\n \\n print(bytedata)\\n \\n cbyte = 0\\n for byte in bytedata:\\n if cbyte == 0:\\n if byte[:5] == '11110':\\n cbyte = 3\\n elif byte[:4] == '1110':\\n cbyte = 2\\n elif byte[:3] == '110':\\n cbyte = 1\\n elif byte[0] == '0':\\n cbyte = 0\\n else:\\n return False\\n else:\\n if byte[:2] == '10':\\n cbyte -= 1\\n else:\\n return False\\n print(cbyte)\\n return cbyte == 0\",\n \"runtime\": \"118\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Approach\\n # Keep a variable of num_bytes to validate\\n # The number of 1's in the first byte tells you the number of bytes to validate\\n # Every time you process an integer if num_bytes == 0:\\n # You are starting a new byte sequence, so check the rules for the first byte\\n # If num_bytes > 0, check for the 10xxxx rule for subsequent bytes\\n # If any rule violations while iterating through bytes, return false otherwise return True\\n\\n num_bytes: int = 0\\n for d in data:\\n bin_str = self.convert_to_binary(d)\\n print(bin_str)\\n\\n # Start of a new bytes sequence\\n if num_bytes == 0:\\n num_ones: int = 0\\n for i in range(len(bin_str)):\\n if bin_str[i] == \\\"1\\\":\\n num_ones += 1\\n else:\\n break\\n\\n # Tricky: If no ones, then VALID single byte sequence\\n if num_ones == 0:\\n continue\\n # Tricky: Single leading 1 not a valid format\\n elif num_ones == 1:\\n return False\\n # Tricky: Max 4 sequence bytes\\n elif num_ones > 4:\\n return False\\n else:\\n num_bytes = num_ones\\n # Checking subsequent byte sequences\\n else:\\n if bin_str[0:2] != \\\"10\\\":\\n return False\\n\\n # Decrement byte sequence\\n num_bytes -= 1\\n\\n # Tricky: make sure no unfinished sequences\\n return num_bytes == 0\\n\\n def convert_to_binary(self, input: int) -> str:\\n # Tricky: convert to last 8 bits\\n return format(input, '010b')[-8:]\\n\\n\\n# 11000101 10000010 00000001\\n# num_bytes = 0\\n# d = 11000101\\n# num_ones = 2\\n# num_bytes = 2\\n# num_bytes = 1\\n# d = 10000010\\n# num_bytes = 0\\n# d = 00000001\\n# num_ones = 0\\n# continue\\n# return True\",\n \"runtime\": \"119\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # UTF-8 encoding rules for the first byte in each sequence\\n utfs = {\\n 1: ['0'],\\n 2: ['110', '10'],\\n 3: ['1110', '10', '10'],\\n 4: ['11110', '10', '10', '10']\\n }\\n\\n i = 0\\n\\n while i < len(data):\\n utf_sequence = 4\\n while utf_sequence > 0:\\n binary_rep = format(data[i], '08b')\\n\\n if binary_rep.startswith(utfs[utf_sequence][0]):\\n i += 1\\n for j in range(1, utf_sequence):\\n if i >= len(data) or not format(data[i], '08b').startswith(utfs[utf_sequence][j]):\\n return False\\n i += 1\\n break\\n utf_sequence -= 1\\n\\n # If no valid UTF-8 sequence is found\\n if utf_sequence == 0:\\n return False\\n\\n return True\\n \",\n \"runtime\": \"120\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n n_bits = 0\\n\\n for sequence in data:\\n binary = str(bin(sequence))[2:]\\n\\n if len(binary) < 8:\\n binary = \\\"0\\\"*(8-len(binary)) + binary\\n\\n if n_bits == 0:\\n if binary[0] == '0':\\n continue\\n\\n leading_ones = 0\\n i = 0\\n while i < len(binary) and binary[i] == '1':\\n leading_ones += 1\\n i += 1\\n\\n if leading_ones == 1 or leading_ones > 4:\\n return False\\n\\n n_bits = leading_ones - 1\\n \\n else:\\n if len(binary) >= 2 and binary[:2] == '10':\\n n_bits -= 1\\n else:\\n return False\\n\\n print(binary, n_bits)\\n\\n if n_bits != 0:\\n return False\\n\\n return True\\n \",\n \"runtime\": \"121\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # we convert data into bits and then see if we get a valid seq\\n\\n def convert_to_bits(num):\\n # converts single int/byte into an array of 8 bits\\n bits = [0]*8\\n for i in range(7,-1,-1):\\n if 2**i <= num:\\n num -= 2**i\\n bits[7-i] = 1\\n return bits\\n\\n def check_valid(ind,num_check):\\n for i in range(ind, ind+num_check):\\n if i >= len(data):\\n return False\\n if convert_to_bits(data[i])[:2] == [1,0]:\\n continue\\n else:\\n return False\\n return True\\n\\n ind = 0\\n while ind < len(data):\\n bits = convert_to_bits(data[ind])\\n # check initial listing\\n if bits[0] == 0:\\n # single byte pattern, continue\\n ind += 1\\n continue\\n elif bits[:3] == [1,1,0]:\\n # check next 2 values for valid pattern\\n if not check_valid(ind+1,1):\\n #print(\\\"invalid 3\\\")\\n return False\\n ind += 2\\n elif bits[:4] == [1,1,1,0]:\\n # check next 2 values for valid pattern\\n if not check_valid(ind+1,2):\\n #print(\\\"invalid 4\\\")\\n return False\\n ind += 3\\n elif bits[:5] == [1,1,1,1,0]:\\n # check next 2 values for valid pattern\\n if not check_valid(ind+1,3):\\n #print(\\\"invalid 5\\\")\\n return False\\n ind += 4\\n else:\\n #print(\\\"invalid\\\",bits)\\n return False\\n return True\\n \\n\\n \\n \",\n \"runtime\": \"122\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n binaryRep = []\\n for num in data: \\n binaryRep.append(format(num, '#010b')[2:])\\n\\n def inRange(i):\\n if i in range(len(binaryRep)): return True\\n def isFour(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:5] == '11110'\\n def isThree(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:4] == '1110'\\n def isTwo(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:3] == '110'\\n def isOne(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:1] == '0'\\n\\n def isSigTen(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:2] == '10'\\n\\n def rec(i):\\n if not inRange(i): return True\\n if isFour(i):\\n return isSigTen(i+1) and isSigTen(i+2) and isSigTen(i+3) and rec(i+4)\\n elif isThree(i):\\n return isSigTen(i+1) and isSigTen(i+2) and rec(i+3)\\n elif isTwo(i):\\n return isSigTen(i+1) and rec(i+2)\\n elif isOne(i):\\n return rec(i+1)\\n else: return False\\n\\n return rec(0)\\n\\n\",\n \"runtime\": \"123\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n cache ={}\\n def to_bin(num):\\n orig_num = num\\n if num in cache:\\n return cache[num]\\n res = [0] * 8\\n i = 0\\n while num != 0:\\n res[i] = num % 2\\n num //=2\\n i += 1\\n cache[orig_num] = res[::-1]\\n return cache[orig_num]\\n\\n print(to_bin(0))\\n while data:\\n c = data.pop(0)\\n bin_c = to_bin(c)\\n #print(\\\"popped\\\", c, \\\"bin_c\\\", bin_c) \\n if bin_c[0] == 0:\\n continue\\n elif bin_c[0:3] == [1, 1, 0]:\\n if not data:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n next_one = to_bin(data.pop(0))\\n if next_one[0:2] != [1, 0]:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n elif bin_c[0:4] == [1, 1, 1, 0]:\\n if not data:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c) \\n return False\\n next_one = to_bin(data.pop(0))\\n if next_one[0:2] != [1, 0]:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n if not data:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n next_one = to_bin(data.pop(0))\\n if next_one[0:2] != [1, 0]:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n elif bin_c[0:5] == [1, 1, 1, 1, 0]:\\n if not data:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n next_one = to_bin(data.pop(0))\\n if next_one[0:2] != [1, 0]:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n if not data:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n next_one = to_bin(data.pop(0))\\n if next_one[0:2] != [1, 0]:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n if not data:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n next_one = to_bin(data.pop(0))\\n if next_one[0:2] != [1, 0]:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n else:\\n #print(\\\"c\\\", c, \\\"bin_c\\\", bin_c)\\n return False\\n \\n return True\",\n \"runtime\": \"124\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def validate(array):\\n print(array)\\n arrLen = len(array)\\n if arrLen==1:\\n if array[0][0] == '0': return True\\n else:\\n if array[0][:arrLen] == '1'*arrLen and array[0][arrLen] == '0':\\n for i in range(1, arrLen):\\n if array[i][:2] != '10': return False\\n return True\\n return False\\n\\n newData = ['{0:08b}'.format(i) for i in data]\\n print(newData)\\n i = 0\\n while i<len(newData):\\n increase = 1\\n if newData[i][:4] == '1111': increase=4\\n elif newData[i][:3] == '111': increase=3\\n elif newData[i][:2] == '11': increase=2\\n\\n if not validate(newData[i:i+increase]): return False\\n i+=increase\\n \\n print('this is i', i)\\n if i>len(newData): return False\\n return True\",\n \"runtime\": \"126\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n values = []\\n for datum in data:\\n result = \\\"\\\"\\n while datum or len(result) < 8:\\n if datum & 1:\\n result = \\\"1\\\" + result\\n else:\\n result = \\\"0\\\" + result\\n datum >>= 1\\n\\n values.append(result)\\n\\n index = 0\\n while index < len(values):\\n count = 0\\n for bit in values[index]:\\n if bit == \\\"1\\\":\\n count += 1\\n else:\\n break\\n\\n if not count:\\n index += 1\\n elif count == 1 or count > 4:\\n return False\\n else:\\n for i in range(1, count):\\n if i+index >= len(values) or values[i+index][:2] != \\\"10\\\":\\n return False\\n index += count\\n \\n return True\\n\\n\",\n \"runtime\": \"127\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n \\n i = 0\\n \\n while i < len(data):\\n curr = data[i]\\n num_bits = 0\\n print(bin(curr))\\n first_bit = (curr & (1 << 7)) >> 7\\n\\n print(f\\\"i : {i}, first_bit : {first_bit}\\\")\\n\\n if first_bit:\\n num_bits = 1\\n for j in range(6, -1, -1):\\n if (curr & (1 << j)) >> j:\\n num_bits += 1\\n else:\\n break\\n if num_bits > 4 or num_bits == 1:\\n return False\\n\\n i += 1\\n num_bits -= 1\\n print(f\\\"num_bits : {num_bits}\\\")\\n while i < len(data) and num_bits > 0:\\n byte = data[i]\\n print(bin(byte))\\n print(f\\\"i : {i}, {byte >> 6}\\\")\\n if byte >> 6 != 2:\\n return False\\n \\n num_bits -= 1\\n i += 1\\n\\n else:\\n i += 1\\n\\n return True if num_bits == 0 else False\",\n \"runtime\": \"132\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n binaryRep = []\\n for num in data: \\n binaryRep.append(format(num, '#010b')[-8:]) # this should be -8 to get least sig 8 bits\\n\\n def inRange(i):\\n if i in range(len(binaryRep)): return True\\n def isFour(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:5] == '11110'\\n def isThree(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:4] == '1110'\\n def isTwo(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:3] == '110'\\n def isOne(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:1] == '0'\\n\\n def isSigTen(i):\\n if not inRange(i): return False\\n return binaryRep[i][0:2] == '10'\\n\\n def rec(i):\\n if not inRange(i): return True\\n if isFour(i):\\n return isSigTen(i+1) and isSigTen(i+2) and isSigTen(i+3) and rec(i+4)\\n elif isThree(i):\\n return isSigTen(i+1) and isSigTen(i+2) and rec(i+3)\\n elif isTwo(i):\\n return isSigTen(i+1) and rec(i+2)\\n elif isOne(i):\\n return rec(i+1)\\n else: return False\\n\\n return rec(0)\\n\\n\",\n \"runtime\": \"133\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def convert(num):\\n res = \\\"\\\"\\n i = 7\\n while i >= 0:\\n two = 2 ** i\\n if num >= two:\\n res += \\\"1\\\"\\n num = num - two\\n else:\\n res += \\\"0\\\"\\n i -= 1\\n return res\\n unicode = [convert(num) for num in data]\\n print(unicode)\\n i = 0\\n while i < len(data):\\n if unicode[i][0] == \\\"0\\\":\\n i += 1\\n else:\\n if unicode[i][1] != \\\"1\\\":\\n return False\\n else:\\n byte = 2\\n j = 2\\n while byte < 4 and unicode[i][j] == \\\"1\\\":\\n byte += 1\\n j += 1\\n if i + byte > len(data) or unicode[i][j] != \\\"0\\\":\\n return False\\n for k in range(i+1,i+byte):\\n if unicode[k][:2] != \\\"10\\\":\\n return False\\n i += byte\\n return True\\n \",\n \"runtime\": \"136\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n \\n def base_ten_to_binary(num):\\n\\n ans = ['0'] * 8\\n\\n curr = 7\\n\\n while curr >= 0:\\n\\n if 2**curr <= num:\\n num -= 2 ** curr\\n ans[curr] = '1'\\n curr -= 1\\n return ''.join(ans)[::-1]\\n\\n sequence = []\\n for d in data:\\n sequence.append(base_ten_to_binary(d))\\n\\n moves = 0\\n\\n print(sequence)\\n\\n for curr in range(len(sequence)):\\n datapoint = sequence[curr]\\n\\n one_count = 0\\n\\n while one_count < 4 and datapoint[one_count] == '1':\\n one_count += 1\\n\\n if one_count == 1:\\n moves -= 1\\n\\n elif one_count > 1:\\n if moves: return False\\n if datapoint[one_count] != '0': return False\\n\\n moves += one_count - 1 \\n\\n if moves < 0: return False\\n\\n return moves == 0\",\n \"runtime\": \"137\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def binary(num):\\n w = \\\"\\\"\\n for i in range(7, -1, -1):\\n if num >= 2 ** i:\\n w += \\\"1\\\"\\n num -= 2 ** i\\n else:\\n w += \\\"0\\\"\\n\\n return w\\n \\n for i in range(len(data)):\\n data[i] = binary(data[i])\\n\\n i = 0\\n while i < len(data):\\n num = data[i]\\n\\n if num[0] == \\\"0\\\":\\n i += 1\\n elif num[:3] == \\\"110\\\":\\n if (i + 1 >= len(data) or data[i + 1][:2] != \\\"10\\\"):\\n return False\\n i += 2\\n elif num[:4] == \\\"1110\\\":\\n if (i + 1 >= len(data) or data[i + 1][:2] != \\\"10\\\") or (i + 2 >= len(data) or data[i + 2][:2] != \\\"10\\\"):\\n return False\\n i += 3\\n elif num[:5] == \\\"11110\\\":\\n if (i + 1 >= len(data) or data[i + 1][:2] != \\\"10\\\") or (i + 2 >= len(data) or data[i + 2][:2] != \\\"10\\\") or (i + 3 >= len(data) or data[i + 3][:2] != \\\"10\\\"):\\n return False\\n i += 4\\n else:\\n return False\\n return True\\n\\n\\n \\n print(data)\\n return True\",\n \"runtime\": \"138\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n chunk = []\\n i = 1\\n while data:\\n chunk.append(data.pop(0))\\n print(chunk, i)\\n if i == 1:\\n if all([\\n chunk[0] < (2 ** 7)\\n ]):\\n chunk = []\\n else:\\n i += 1\\n continue\\n elif i == 2:\\n if all([\\n (2 ** 7 + 2 ** 6) <= chunk[0] < (2 ** 7 + 2 ** 6 + 2 ** 5),\\n (2 ** 7) <= chunk[1] < (2 ** 7 + 2 ** 6)\\n ]):\\n chunk = []\\n i = 1\\n else:\\n i += 1\\n continue\\n elif i == 3:\\n if all([\\n (2 ** 7 + 2 ** 6 + 2 ** 5) <= chunk[0] < (2 ** 7 + 2 ** 6 + 2 ** 5 + 2 ** 4),\\n (2 ** 7) <= chunk[1] < (2 ** 7 + 2 ** 6),\\n (2 ** 7) <= chunk[2] < (2 ** 7 + 2 ** 6)\\n ]):\\n chunk = []\\n i = 1\\n else:\\n i += 1\\n continue\\n elif i == 4:\\n if all([\\n (2 ** 7 + 2 ** 6 + 2 ** 5 + 2 ** 4) <= chunk[0] < (2 ** 7 + 2 ** 6 + 2 ** 5 + 2 ** 4 + 2 ** 3),\\n (2 ** 7) <= chunk[1] < (2 ** 7 + 2 ** 6),\\n (2 ** 7) <= chunk[2] < (2 ** 7 + 2 ** 6),\\n (2 ** 7) <= chunk[3] < (2 ** 7 + 2 ** 6)\\n\\n ]):\\n chunk = []\\n i = 1\\n else:\\n i += 1\\n continue\\n else:\\n return False\\n\\n if chunk:\\n return False\\n else:\\n return True\",\n \"runtime\": \"139\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def to_binary_str(num):\\n if num == 0:\\n return \\\"00000000\\\"\\n \\n res = []\\n while num != 0:\\n res.append(str(num % 2))\\n num //= 2\\n \\n while len(res) < 8:\\n res.append('0')\\n \\n return \\\"\\\".join(res[::-1])\\n \\n def get_bytes_len(bin):\\n if bin[0] == '0':\\n return 1\\n \\n if bin[0] == '1' and bin[1] == '0':\\n return -1\\n \\n i = 0\\n byte_len = 0\\n while i < 4 and bin[i] == '1':\\n byte_len += 1\\n i += 1\\n \\n if bin[i] == '1':\\n return -1\\n \\n return byte_len\\n \\n def is_one_zero(bin):\\n return bin[0] == '1' and bin[1] == '0'\\n \\n data_bin = [to_binary_str(num) for num in data]\\n\\n bytes_left = 0\\n # print(data_bin)\\n\\n for bin_str in data_bin:\\n if bytes_left == 0:\\n bytes_left = get_bytes_len(bin_str)\\n if bytes_left == -1:\\n return False\\n bytes_left -= 1\\n else:\\n if not is_one_zero(bin_str):\\n return False\\n bytes_left -= 1\\n \\n return bytes_left == 0\\n\\n\\n \",\n \"runtime\": \"142\"\n }\n]","isConversational":false},"rt_solution_count":{"kind":"number","value":65,"string":"65"},"mm_list":{"kind":"list like","value":[{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def ones(num):\n \n ans = 0\n done = False\n\n for i in range(8):\n if num % 2:\n ans += 1\n else:\n ans = 0\n done = True\n \n num = num >> 1\n \n return [ans,done]\n \n def ten(num):\n return (num >> 6) % 2 == 0 and (num >> 7) % 2 == 1\n done = False\n num = 0\n\n for dat in data:\n if not done:\n l = ones(dat)\n done = l[1]\n num += l[0]\n if done:\n num -= 1\n if num == -1:\n done = False\n num = 0\n continue\n if not num:\n return False\n if num >= 4:\n return False\n else:\n \n if not ten(dat):\n return False\n \n num -= 1\n\n if num == 0:\n done = False\n \n \n\n print(num)\n return not num\n ","memory":"16800"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n mask1, mask2 = 1 << 7, 1 << 6\n char_no = 0\n for num in data: \n if char_no:\n if not ((mask1 & num) and not (mask2 & num)): \n return False\n else:\n # populate char\n curr_mask = 1 << 7 \n while curr_mask & num: \n curr_mask = curr_mask >> 1\n char_no += 1\n if char_no == 0: \n continue\n if char_no == 1 or char_no > 4: \n return False\n\n char_no -= 1\n return char_no == 0 ","memory":"16800"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Number of bytes in the current UTF-8 character\n n_bytes = 0\n\n # Mask to check if the most significant bit is set or not\n mask1 = 1 << 7\n # Mask to check if the second most significant bit is set or not\n mask2 = 1 << 6\n \n for num in data:\n if n_bytes == 0:\n # Count the number of 1s in the beginning of the byte\n mask = mask1\n while mask & num:\n n_bytes += 1\n mask = mask >> 1\n \n # 1 byte characters\n if n_bytes == 0:\n continue\n \n # Invalid scenarios according to the rules of the problem\n if n_bytes == 1 or n_bytes > 4:\n return False\n else:\n # If we are processing bytes which are not the start of a character\n if not (num & mask1 and not (num & mask2)):\n return False\n n_bytes -= 1\n \n # If we have processed all bytes and n_bytes is 0, it's valid\n return n_bytes == 0\n\n# Test the solution\nsolution = Solution()\nprint(solution.validUtf8([197, 130, 1])) # Should print True\nprint(solution.validUtf8([235, 140, 4])) # Should print False","memory":"16900"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n n = len(data)\n i = j = 0\n while i < n:\n if data[i] <= 127:\n i += 1\n continue\n elif 192 <= data[i] <= 223:\n j = 1\n elif 224 <= data[i] <= 239:\n j = 2\n elif 240 <= data[i] <= 247:\n j = 3\n else:\n return False\n i += 1\n while j > 0 and i < n:\n if data[i] < 128 or data[i] > 191:\n return False\n i += 1\n j -= 1\n return i == n and j == 0","memory":"16900"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n # Number of bytes in the current UTF-8 character\n num_bytes = 0\n\n # Mask to check if the most significant bit is set\n mask1 = 1 << 7\n # Mask to check if the second most significant bit is set\n mask2 = 1 << 6\n\n for num in data:\n # Get the most significant bit and the second most significant bit\n mask = 1 << 7\n if num_bytes == 0:\n while mask & num:\n num_bytes += 1\n mask >>= 1\n # 1-byte character\n if num_bytes == 0:\n continue\n # Invalid if num_bytes is 1 or greater than 4\n if num_bytes == 1 or num_bytes > 4:\n return False\n else:\n # Continuation byte should start with 10\n if not (num & mask1 and not (num & mask2)):\n return False\n # Decrement the number of bytes left for the current character\n num_bytes -= 1\n # Check if all bytes have been processed\n return num_bytes == 0\n\n# Example usage:\nsolution = Solution()\ndata = [197, 130, 1]\nprint(solution.validUtf8(data)) # Output: True\n\ndata = [235, 140, 4]\nprint(solution.validUtf8(data)) # Output: False","memory":"17000"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n \n reach = 0\n\n for byte in data:\n\n if reach == 0: # should be the start of a new byte\n\n print('no reach:', format(byte, '08b'))\n\n binary_identifier = format(byte, '08b')\n num_ones = 0\n\n for i in range(len(binary_identifier)):\n\n if binary_identifier[i] == '1':\n num_ones += 1\n else:\n break\n\n if num_ones == 1 or num_ones >= 5:\n print('1 one')\n return False\n else:\n reach = num_ones - 1 if num_ones else 0\n \n else: # should be the continuation 10xxxxxx byte\n\n print('reach', bin(byte))\n\n binary = bin(byte >> 6)\n\n if binary[-2:] != '10':\n print('extend bit reached unnecessarily')\n return False\n\n reach -= 1\n\n return reach == 0","memory":"17000"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n num_bytes = len(data)\n\n def validate_1_0(num: int) -> bool:\n if (num - 128) >= 0:\n print(num)\n num -= 128\n if (num - 64 <= 0):\n print(num)\n return True\n return False\n return False\n\n i = 0 \n while i < num_bytes:\n num_seqs = 0\n if (data[i] < 128):\n i += 1\n continue\n elif (data[i] >= 192 and data[i] < 224):\n num_seqs = 1\n elif (data[i] >= 224 and data[i] < 240):\n num_seqs = 2\n elif (data[i] >=240 and data[i] < 248):\n num_seqs = 3\n else:\n print(i, \"false here\")\n return False\n \n while num_seqs > 0 and i + 1 < num_bytes:\n i += 1\n if not validate_1_0(data[i]):\n print(i, \"not valid\")\n return False\n num_seqs -= 1\n if (num_seqs):\n return False\n i += 1\n \n \n return True\n ","memory":"17100"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n n = len(data)\n def checkSeq(i):\n num = data[i]\n count = 0\n j = 7\n\n while j >= 0 and (num >> j)&1:\n count += 1\n j -= 1\n\n if j < 0 or count == 1 or count > 4:\n return -1\n\n if (num >> 7) & 1 == 0:\n count = 1\n \n if i+count > n:\n return -1\n\n for k in range(i+1, i+count):\n if (data[k] >> 6) & 1 or (data[k] >> 7)&1 == 0:\n return -1\n print(i,j,count)\n return i+count\n\n i = 0\n\n while i < n:\n idx = checkSeq(i)\n if idx == -1:\n return False\n\n i = idx\n\n return True\n\n \n\n ","memory":"17200"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n i = 0\n while i < len(data):\n charBytes = format(data[i], '08b')\n if charBytes[0] != \"1\":\n i += 1 \n continue\n count = 0\n for b in charBytes:\n if b == \"1\":\n count += 1\n else:\n break\n if count > 4:\n return False\n if (count + i - 1) >= len(data) or count == 1:\n return False\n i += 1\n print(count)\n for _ in range(count-1):\n if i >= len(data):\n break\n followingBytes = format(data[i], '08b')\n if followingBytes[0:2] != \"10\":\n return False\n i += 1\n return True","memory":"17300"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def convert(num):\n res = \"\"\n i = 7\n while i >= 0:\n two = 2 ** i\n if num >= two:\n res += \"1\"\n num = num - two\n else:\n res += \"0\"\n i -= 1\n return res\n unicode = [convert(num) for num in data]\n i = 0\n while i < len(data):\n if unicode[i][0] == \"0\":\n i += 1\n else:\n if unicode[i][1] != \"1\":\n return False\n else:\n byte = 2\n j = 2\n while byte < 4 and unicode[i][j] == \"1\":\n byte += 1\n j += 1\n if i + byte > len(data) or unicode[i][j] != \"0\":\n return False\n for k in range(i+1,i+byte):\n if unicode[k][:2] != \"10\":\n return False\n i += byte\n return True\n ","memory":"17400"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n\t # a list to store binary representation of the numbers\n sequence = []\n\t\t# get binary representation of all the numbers\n for d in data:\n sequence.append(\"{0:08b}\".format(d))\n \n i = 0\n n = len(sequence)\n while i < n:\n if sequence[i][0] == '0': # 1-byte check\n i += 1\n continue\n if sequence[i][:3] == '110' and n-i>=1: # 2-byte check\n if sequence[i+1][:2] == '10':\n i += 2\n continue\n if sequence[i][:4] == '1110' and n-i>=2: # 3-byte check\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10':\n i += 3\n continue\n if sequence[i][:5] == '11110' and n-i>=3: # 4-byte check\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\n i += 4\n continue\n else:\n return False\n return True","memory":"17500"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def to_binary_str(num):\n if num == 0:\n return \"00000000\"\n \n res = []\n while num != 0:\n res.append(str(num % 2))\n num //= 2\n \n while len(res) < 8:\n res.append('0')\n \n return \"\".join(res[::-1])\n \n def get_bytes_len(bin):\n if bin[0] == '0':\n return 1\n \n if bin[0] == '1' and bin[1] == '0':\n return -1\n \n i = 0\n byte_len = 0\n while i < 4 and bin[i] == '1':\n byte_len += 1\n i += 1\n \n if bin[i] == '1':\n return -1\n \n return byte_len\n \n def is_one_zero(bin):\n return bin[0] == '1' and bin[1] == '0'\n \n data_bin = [to_binary_str(num) for num in data]\n\n bytes_left = 0\n # print(data_bin)\n\n for bin_str in data_bin:\n if bytes_left == 0:\n bytes_left = get_bytes_len(bin_str)\n if bytes_left == -1:\n return False\n bytes_left -= 1\n else:\n if not is_one_zero(bin_str):\n return False\n bytes_left -= 1\n \n return bytes_left == 0\n\n\n ","memory":"17600"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def b(v):\n res = []\n while v >0:\n res.insert(0, v%2)\n v >>=1\n return \"\".join(map(str,res)).rjust(8, \"0\" )\n \n bits = list(map(b, data))\n print(bits)\n n = len(bits)\n i = 0\n nbFollow = 0\n for c in bits:\n print(c, nbFollow)\n if nbFollow >= 1:\n if c[:2] != \"10\":\n return False\n nbFollow -=1\n continue\n \n if c[0] == \"0\":\n continue\n \n j = 0\n while j < len(c) and c[j] == \"1\":\n j += 1\n if j > 4: return False\n nbFollow = j - 1\n if nbFollow == 0:\n return False\n print(nbFollow)\n return nbFollow == 0\n ","memory":"17700"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def b(v):\n res = []\n while v >0:\n res.insert(0, v%2)\n v >>=1\n return \"\".join(map(str,res)).rjust(8, \"0\" )\n \n bits = list(map(b, data))\n n = len(bits)\n i = 0\n nbFollow = 0\n for c in bits:\n if nbFollow >= 1:\n if c[:2] != \"10\":\n return False\n nbFollow -=1\n continue\n \n if c[0] == \"0\":\n continue\n \n j = 0\n while j < len(c) and c[j] == \"1\":\n j += 1\n if j > 4: return False\n nbFollow = j - 1\n if nbFollow == 0:\n return False\n \n return nbFollow == 0\n ","memory":"17700"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n def to_binary_str(num):\n if num == 0:\n return \"00000000\"\n \n res = []\n while num != 0:\n res.append(str(num % 2))\n num //= 2\n \n while len(res) < 8:\n res.append('0')\n \n return \"\".join(res[::-1])\n \n def get_bytes_len(bin):\n if bin[0] == '0':\n return 1\n \n if bin[0] == '1' and bin[1] == '0':\n return -1\n \n i = 0\n byte_len = 0\n while i < 4 and bin[i] == '1':\n byte_len += 1\n i += 1\n \n if bin[i] == '1':\n return -1\n \n return byte_len\n \n def is_one_zero(bin):\n return bin[0] == '1' and bin[1] == '0'\n \n data_bin = [to_binary_str(num) for num in data]\n\n bytes_left = 0\n # print(data_bin)\n\n for bin_str in data_bin:\n if bytes_left == 0:\n bytes_left = get_bytes_len(bin_str)\n if bytes_left == -1:\n return False\n bytes_left -= 1\n else:\n if not is_one_zero(bin_str):\n return False\n bytes_left -= 1\n \n return bytes_left == 0\n\n\n ","memory":"17800"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n bytedata = []\n for data in data:\n bytedata.append(bin(data)[2:].zfill(8))\n \n print(bytedata)\n \n cbyte = 0\n for byte in bytedata:\n if cbyte == 0:\n if byte[:5] == '11110':\n cbyte = 3\n elif byte[:4] == '1110':\n cbyte = 2\n elif byte[:3] == '110':\n cbyte = 1\n elif byte[0] == '0':\n cbyte = 0\n else:\n return False\n else:\n if byte[:2] == '10':\n cbyte -= 1\n else:\n return False\n print(cbyte)\n return cbyte == 0","memory":"17900"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n bytedata = []\n for data in data:\n bytedata.append(bin(data)[2:].zfill(8))\n \n print(bytedata)\n \n cbyte = 0\n for byte in bytedata:\n if cbyte == 0:\n if byte[:5] == '11110':\n cbyte = 3\n elif byte[:4] == '1110':\n cbyte = 2\n elif byte[:3] == '110':\n cbyte = 1\n elif byte[0] == '0':\n cbyte = 0\n else:\n return False\n else:\n if byte[:2] == '10':\n cbyte -= 1\n else:\n return False\n print(cbyte)\n return cbyte == 0\n\n # bitshifting\n # # Initialize a counter variable\n # count = 0\n \n # # Iterate through each integer in the input data list\n # for num in data:\n # # If the count is 0, check how many leading 1's there are in the current integer\n # if count == 0:\n # if (num >> 5) == 0b110:\n # count = 1\n # elif (num >> 4) == 0b1110:\n # count = 2\n # elif (num >> 3) == 0b11110:\n # count = 3\n # elif (num >> 7) != 0:\n # return False\n # # If the count is not 0, check if the current integer is a continuation byte\n # else:\n # if (num >> 6) != 0b10:\n # return False\n # count -= 1\n \n # # If the count is still not 0 after iterating through all the integers, it is invalid\n # return count == 0","memory":"17900"},{"code":"class Solution:\n def validUtf8(self, data: List[int]) -> bool:\n bytedata = []\n for data in data:\n bytedata.append(bin(data)[2:].zfill(8))\n \n print(bytedata)\n \n cbyte = 0\n for byte in bytedata:\n if cbyte == 0:\n if byte[:5] == '11110':\n cbyte = 3\n elif byte[:4] == '1110':\n cbyte = 2\n elif byte[:3] == '110':\n cbyte = 1\n elif byte[0] == '0':\n cbyte = 0\n else:\n return False\n else:\n if byte[:2] == '10':\n cbyte -= 1\n else:\n return False\n print(cbyte)\n return cbyte == 0","memory":"18000"}],"string":"[\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def ones(num):\\n \\n ans = 0\\n done = False\\n\\n for i in range(8):\\n if num % 2:\\n ans += 1\\n else:\\n ans = 0\\n done = True\\n \\n num = num >> 1\\n \\n return [ans,done]\\n \\n def ten(num):\\n return (num >> 6) % 2 == 0 and (num >> 7) % 2 == 1\\n done = False\\n num = 0\\n\\n for dat in data:\\n if not done:\\n l = ones(dat)\\n done = l[1]\\n num += l[0]\\n if done:\\n num -= 1\\n if num == -1:\\n done = False\\n num = 0\\n continue\\n if not num:\\n return False\\n if num >= 4:\\n return False\\n else:\\n \\n if not ten(dat):\\n return False\\n \\n num -= 1\\n\\n if num == 0:\\n done = False\\n \\n \\n\\n print(num)\\n return not num\\n \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n mask1, mask2 = 1 << 7, 1 << 6\\n char_no = 0\\n for num in data: \\n if char_no:\\n if not ((mask1 & num) and not (mask2 & num)): \\n return False\\n else:\\n # populate char\\n curr_mask = 1 << 7 \\n while curr_mask & num: \\n curr_mask = curr_mask >> 1\\n char_no += 1\\n if char_no == 0: \\n continue\\n if char_no == 1 or char_no > 4: \\n return False\\n\\n char_no -= 1\\n return char_no == 0 \",\n \"memory\": \"16800\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Number of bytes in the current UTF-8 character\\n n_bytes = 0\\n\\n # Mask to check if the most significant bit is set or not\\n mask1 = 1 << 7\\n # Mask to check if the second most significant bit is set or not\\n mask2 = 1 << 6\\n \\n for num in data:\\n if n_bytes == 0:\\n # Count the number of 1s in the beginning of the byte\\n mask = mask1\\n while mask & num:\\n n_bytes += 1\\n mask = mask >> 1\\n \\n # 1 byte characters\\n if n_bytes == 0:\\n continue\\n \\n # Invalid scenarios according to the rules of the problem\\n if n_bytes == 1 or n_bytes > 4:\\n return False\\n else:\\n # If we are processing bytes which are not the start of a character\\n if not (num & mask1 and not (num & mask2)):\\n return False\\n n_bytes -= 1\\n \\n # If we have processed all bytes and n_bytes is 0, it's valid\\n return n_bytes == 0\\n\\n# Test the solution\\nsolution = Solution()\\nprint(solution.validUtf8([197, 130, 1])) # Should print True\\nprint(solution.validUtf8([235, 140, 4])) # Should print False\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n n = len(data)\\n i = j = 0\\n while i < n:\\n if data[i] <= 127:\\n i += 1\\n continue\\n elif 192 <= data[i] <= 223:\\n j = 1\\n elif 224 <= data[i] <= 239:\\n j = 2\\n elif 240 <= data[i] <= 247:\\n j = 3\\n else:\\n return False\\n i += 1\\n while j > 0 and i < n:\\n if data[i] < 128 or data[i] > 191:\\n return False\\n i += 1\\n j -= 1\\n return i == n and j == 0\",\n \"memory\": \"16900\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n # Number of bytes in the current UTF-8 character\\n num_bytes = 0\\n\\n # Mask to check if the most significant bit is set\\n mask1 = 1 << 7\\n # Mask to check if the second most significant bit is set\\n mask2 = 1 << 6\\n\\n for num in data:\\n # Get the most significant bit and the second most significant bit\\n mask = 1 << 7\\n if num_bytes == 0:\\n while mask & num:\\n num_bytes += 1\\n mask >>= 1\\n # 1-byte character\\n if num_bytes == 0:\\n continue\\n # Invalid if num_bytes is 1 or greater than 4\\n if num_bytes == 1 or num_bytes > 4:\\n return False\\n else:\\n # Continuation byte should start with 10\\n if not (num & mask1 and not (num & mask2)):\\n return False\\n # Decrement the number of bytes left for the current character\\n num_bytes -= 1\\n # Check if all bytes have been processed\\n return num_bytes == 0\\n\\n# Example usage:\\nsolution = Solution()\\ndata = [197, 130, 1]\\nprint(solution.validUtf8(data)) # Output: True\\n\\ndata = [235, 140, 4]\\nprint(solution.validUtf8(data)) # Output: False\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n \\n reach = 0\\n\\n for byte in data:\\n\\n if reach == 0: # should be the start of a new byte\\n\\n print('no reach:', format(byte, '08b'))\\n\\n binary_identifier = format(byte, '08b')\\n num_ones = 0\\n\\n for i in range(len(binary_identifier)):\\n\\n if binary_identifier[i] == '1':\\n num_ones += 1\\n else:\\n break\\n\\n if num_ones == 1 or num_ones >= 5:\\n print('1 one')\\n return False\\n else:\\n reach = num_ones - 1 if num_ones else 0\\n \\n else: # should be the continuation 10xxxxxx byte\\n\\n print('reach', bin(byte))\\n\\n binary = bin(byte >> 6)\\n\\n if binary[-2:] != '10':\\n print('extend bit reached unnecessarily')\\n return False\\n\\n reach -= 1\\n\\n return reach == 0\",\n \"memory\": \"17000\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n num_bytes = len(data)\\n\\n def validate_1_0(num: int) -> bool:\\n if (num - 128) >= 0:\\n print(num)\\n num -= 128\\n if (num - 64 <= 0):\\n print(num)\\n return True\\n return False\\n return False\\n\\n i = 0 \\n while i < num_bytes:\\n num_seqs = 0\\n if (data[i] < 128):\\n i += 1\\n continue\\n elif (data[i] >= 192 and data[i] < 224):\\n num_seqs = 1\\n elif (data[i] >= 224 and data[i] < 240):\\n num_seqs = 2\\n elif (data[i] >=240 and data[i] < 248):\\n num_seqs = 3\\n else:\\n print(i, \\\"false here\\\")\\n return False\\n \\n while num_seqs > 0 and i + 1 < num_bytes:\\n i += 1\\n if not validate_1_0(data[i]):\\n print(i, \\\"not valid\\\")\\n return False\\n num_seqs -= 1\\n if (num_seqs):\\n return False\\n i += 1\\n \\n \\n return True\\n \",\n \"memory\": \"17100\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n n = len(data)\\n def checkSeq(i):\\n num = data[i]\\n count = 0\\n j = 7\\n\\n while j >= 0 and (num >> j)&1:\\n count += 1\\n j -= 1\\n\\n if j < 0 or count == 1 or count > 4:\\n return -1\\n\\n if (num >> 7) & 1 == 0:\\n count = 1\\n \\n if i+count > n:\\n return -1\\n\\n for k in range(i+1, i+count):\\n if (data[k] >> 6) & 1 or (data[k] >> 7)&1 == 0:\\n return -1\\n print(i,j,count)\\n return i+count\\n\\n i = 0\\n\\n while i < n:\\n idx = checkSeq(i)\\n if idx == -1:\\n return False\\n\\n i = idx\\n\\n return True\\n\\n \\n\\n \",\n \"memory\": \"17200\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n i = 0\\n while i < len(data):\\n charBytes = format(data[i], '08b')\\n if charBytes[0] != \\\"1\\\":\\n i += 1 \\n continue\\n count = 0\\n for b in charBytes:\\n if b == \\\"1\\\":\\n count += 1\\n else:\\n break\\n if count > 4:\\n return False\\n if (count + i - 1) >= len(data) or count == 1:\\n return False\\n i += 1\\n print(count)\\n for _ in range(count-1):\\n if i >= len(data):\\n break\\n followingBytes = format(data[i], '08b')\\n if followingBytes[0:2] != \\\"10\\\":\\n return False\\n i += 1\\n return True\",\n \"memory\": \"17300\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def convert(num):\\n res = \\\"\\\"\\n i = 7\\n while i >= 0:\\n two = 2 ** i\\n if num >= two:\\n res += \\\"1\\\"\\n num = num - two\\n else:\\n res += \\\"0\\\"\\n i -= 1\\n return res\\n unicode = [convert(num) for num in data]\\n i = 0\\n while i < len(data):\\n if unicode[i][0] == \\\"0\\\":\\n i += 1\\n else:\\n if unicode[i][1] != \\\"1\\\":\\n return False\\n else:\\n byte = 2\\n j = 2\\n while byte < 4 and unicode[i][j] == \\\"1\\\":\\n byte += 1\\n j += 1\\n if i + byte > len(data) or unicode[i][j] != \\\"0\\\":\\n return False\\n for k in range(i+1,i+byte):\\n if unicode[k][:2] != \\\"10\\\":\\n return False\\n i += byte\\n return True\\n \",\n \"memory\": \"17400\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n\\t # a list to store binary representation of the numbers\\n sequence = []\\n\\t\\t# get binary representation of all the numbers\\n for d in data:\\n sequence.append(\\\"{0:08b}\\\".format(d))\\n \\n i = 0\\n n = len(sequence)\\n while i < n:\\n if sequence[i][0] == '0': # 1-byte check\\n i += 1\\n continue\\n if sequence[i][:3] == '110' and n-i>=1: # 2-byte check\\n if sequence[i+1][:2] == '10':\\n i += 2\\n continue\\n if sequence[i][:4] == '1110' and n-i>=2: # 3-byte check\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10':\\n i += 3\\n continue\\n if sequence[i][:5] == '11110' and n-i>=3: # 4-byte check\\n if sequence[i+1][:2] == '10' and sequence[i+2][:2] == '10' and sequence[i+3][:2] == '10':\\n i += 4\\n continue\\n else:\\n return False\\n return True\",\n \"memory\": \"17500\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def to_binary_str(num):\\n if num == 0:\\n return \\\"00000000\\\"\\n \\n res = []\\n while num != 0:\\n res.append(str(num % 2))\\n num //= 2\\n \\n while len(res) < 8:\\n res.append('0')\\n \\n return \\\"\\\".join(res[::-1])\\n \\n def get_bytes_len(bin):\\n if bin[0] == '0':\\n return 1\\n \\n if bin[0] == '1' and bin[1] == '0':\\n return -1\\n \\n i = 0\\n byte_len = 0\\n while i < 4 and bin[i] == '1':\\n byte_len += 1\\n i += 1\\n \\n if bin[i] == '1':\\n return -1\\n \\n return byte_len\\n \\n def is_one_zero(bin):\\n return bin[0] == '1' and bin[1] == '0'\\n \\n data_bin = [to_binary_str(num) for num in data]\\n\\n bytes_left = 0\\n # print(data_bin)\\n\\n for bin_str in data_bin:\\n if bytes_left == 0:\\n bytes_left = get_bytes_len(bin_str)\\n if bytes_left == -1:\\n return False\\n bytes_left -= 1\\n else:\\n if not is_one_zero(bin_str):\\n return False\\n bytes_left -= 1\\n \\n return bytes_left == 0\\n\\n\\n \",\n \"memory\": \"17600\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def b(v):\\n res = []\\n while v >0:\\n res.insert(0, v%2)\\n v >>=1\\n return \\\"\\\".join(map(str,res)).rjust(8, \\\"0\\\" )\\n \\n bits = list(map(b, data))\\n print(bits)\\n n = len(bits)\\n i = 0\\n nbFollow = 0\\n for c in bits:\\n print(c, nbFollow)\\n if nbFollow >= 1:\\n if c[:2] != \\\"10\\\":\\n return False\\n nbFollow -=1\\n continue\\n \\n if c[0] == \\\"0\\\":\\n continue\\n \\n j = 0\\n while j < len(c) and c[j] == \\\"1\\\":\\n j += 1\\n if j > 4: return False\\n nbFollow = j - 1\\n if nbFollow == 0:\\n return False\\n print(nbFollow)\\n return nbFollow == 0\\n \",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def b(v):\\n res = []\\n while v >0:\\n res.insert(0, v%2)\\n v >>=1\\n return \\\"\\\".join(map(str,res)).rjust(8, \\\"0\\\" )\\n \\n bits = list(map(b, data))\\n n = len(bits)\\n i = 0\\n nbFollow = 0\\n for c in bits:\\n if nbFollow >= 1:\\n if c[:2] != \\\"10\\\":\\n return False\\n nbFollow -=1\\n continue\\n \\n if c[0] == \\\"0\\\":\\n continue\\n \\n j = 0\\n while j < len(c) and c[j] == \\\"1\\\":\\n j += 1\\n if j > 4: return False\\n nbFollow = j - 1\\n if nbFollow == 0:\\n return False\\n \\n return nbFollow == 0\\n \",\n \"memory\": \"17700\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n def to_binary_str(num):\\n if num == 0:\\n return \\\"00000000\\\"\\n \\n res = []\\n while num != 0:\\n res.append(str(num % 2))\\n num //= 2\\n \\n while len(res) < 8:\\n res.append('0')\\n \\n return \\\"\\\".join(res[::-1])\\n \\n def get_bytes_len(bin):\\n if bin[0] == '0':\\n return 1\\n \\n if bin[0] == '1' and bin[1] == '0':\\n return -1\\n \\n i = 0\\n byte_len = 0\\n while i < 4 and bin[i] == '1':\\n byte_len += 1\\n i += 1\\n \\n if bin[i] == '1':\\n return -1\\n \\n return byte_len\\n \\n def is_one_zero(bin):\\n return bin[0] == '1' and bin[1] == '0'\\n \\n data_bin = [to_binary_str(num) for num in data]\\n\\n bytes_left = 0\\n # print(data_bin)\\n\\n for bin_str in data_bin:\\n if bytes_left == 0:\\n bytes_left = get_bytes_len(bin_str)\\n if bytes_left == -1:\\n return False\\n bytes_left -= 1\\n else:\\n if not is_one_zero(bin_str):\\n return False\\n bytes_left -= 1\\n \\n return bytes_left == 0\\n\\n\\n \",\n \"memory\": \"17800\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n bytedata = []\\n for data in data:\\n bytedata.append(bin(data)[2:].zfill(8))\\n \\n print(bytedata)\\n \\n cbyte = 0\\n for byte in bytedata:\\n if cbyte == 0:\\n if byte[:5] == '11110':\\n cbyte = 3\\n elif byte[:4] == '1110':\\n cbyte = 2\\n elif byte[:3] == '110':\\n cbyte = 1\\n elif byte[0] == '0':\\n cbyte = 0\\n else:\\n return False\\n else:\\n if byte[:2] == '10':\\n cbyte -= 1\\n else:\\n return False\\n print(cbyte)\\n return cbyte == 0\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n bytedata = []\\n for data in data:\\n bytedata.append(bin(data)[2:].zfill(8))\\n \\n print(bytedata)\\n \\n cbyte = 0\\n for byte in bytedata:\\n if cbyte == 0:\\n if byte[:5] == '11110':\\n cbyte = 3\\n elif byte[:4] == '1110':\\n cbyte = 2\\n elif byte[:3] == '110':\\n cbyte = 1\\n elif byte[0] == '0':\\n cbyte = 0\\n else:\\n return False\\n else:\\n if byte[:2] == '10':\\n cbyte -= 1\\n else:\\n return False\\n print(cbyte)\\n return cbyte == 0\\n\\n # bitshifting\\n # # Initialize a counter variable\\n # count = 0\\n \\n # # Iterate through each integer in the input data list\\n # for num in data:\\n # # If the count is 0, check how many leading 1's there are in the current integer\\n # if count == 0:\\n # if (num >> 5) == 0b110:\\n # count = 1\\n # elif (num >> 4) == 0b1110:\\n # count = 2\\n # elif (num >> 3) == 0b11110:\\n # count = 3\\n # elif (num >> 7) != 0:\\n # return False\\n # # If the count is not 0, check if the current integer is a continuation byte\\n # else:\\n # if (num >> 6) != 0b10:\\n # return False\\n # count -= 1\\n \\n # # If the count is still not 0 after iterating through all the integers, it is invalid\\n # return count == 0\",\n \"memory\": \"17900\"\n },\n {\n \"code\": \"class Solution:\\n def validUtf8(self, data: List[int]) -> bool:\\n bytedata = []\\n for data in data:\\n bytedata.append(bin(data)[2:].zfill(8))\\n \\n print(bytedata)\\n \\n cbyte = 0\\n for byte in bytedata:\\n if cbyte == 0:\\n if byte[:5] == '11110':\\n cbyte = 3\\n elif byte[:4] == '1110':\\n cbyte = 2\\n elif byte[:3] == '110':\\n cbyte = 1\\n elif byte[0] == '0':\\n cbyte = 0\\n else:\\n return False\\n else:\\n if byte[:2] == '10':\\n cbyte -= 1\\n else:\\n return False\\n print(cbyte)\\n return cbyte == 0\",\n \"memory\": \"18000\"\n }\n]","isConversational":false},"mm_solution_count":{"kind":"number","value":18,"string":"18"}}},{"rowIdx":296,"cells":{"question_id":{"kind":"number","value":394,"string":"394"},"name":{"kind":"string","value":"decode-string"},"content":{"kind":"string","value":"<p>Given an encoded string, return its decoded string.</p>\n\n<p>The encoding rule is: <code>k[encoded_string]</code>, where the <code>encoded_string</code> inside the square brackets is being repeated exactly <code>k</code> times. Note that <code>k</code> is guaranteed to be a positive integer.</p>\n\n<p>You may assume that the input string is always valid; there are no extra white spaces, square brackets are well-formed, etc. Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, <code>k</code>. For example, there will not be input like <code>3a</code> or <code>2[4]</code>.</p>\n\n<p>The test cases are generated so that the length of the output will never exceed <code>10<sup>5</sup></code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "3[a]2[bc]"\n<strong>Output:</strong> "aaabcbc"\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "3[a2[c]]"\n<strong>Output:</strong> "accaccacc"\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "2[abc]3[cd]ef"\n<strong>Output:</strong> "abcabccdcdcdef"\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 30</code></li>\n\t<li><code>s</code> consists of lowercase English letters, digits, and square brackets <code>'[]'</code>.</li>\n\t<li><code>s</code> is guaranteed to be <strong>a valid</strong> input.</li>\n\t<li>All the integers in <code>s</code> are in the range <code>[1, 300]</code>.</li>\n</ul>\n"},"acRate":{"kind":"number","value":59.85620428907896,"string":"59.856204"},"difficulty":{"kind":"string","value":"Medium"},"topics":{"kind":"list like","value":["string","stack","recursion"],"string":"[\n \"string\",\n \"stack\",\n \"recursion\"\n]","isConversational":false},"runtimeDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"12\", 0.0073], [\"14\", 0.0073], [\"15\", 0.0147], [\"16\", 0.066], [\"17\", 0.0147], [\"18\", 0.088], [\"19\", 0.176], [\"20\", 0.264], [\"21\", 0.2054], [\"22\", 0.7115], [\"23\", 0.6381], [\"24\", 1.2249], [\"25\", 1.1442], [\"26\", 2.6991], [\"27\", 1.8337], [\"28\", 3.3446], [\"29\", 3.704], [\"30\", 5.7943], [\"31\", 4.0707], [\"32\", 5.9777], [\"33\", 7.8774], [\"34\", 8.9776], [\"35\", 5.809], [\"36\", 6.6598], [\"37\", 9.1022], [\"38\", 7.2099], [\"39\", 5.2516], [\"40\", 4.3714], [\"41\", 4.8995]]}"},"memoryDistribution":{"kind":"string","value":"{\"lang\": \"python3\", \"distribution\": [[\"15900\", 0.0073], [\"16000\", 0.0073], [\"16100\", 0.0073], [\"16200\", 0.2787], [\"16300\", 4.7602], [\"16400\", 21.9085], [\"16500\", 41.2572]]}"},"rt_list":{"kind":"list like","value":[{"code":"class Solution:\n def decodeString(self, s: str) -> str:\n stack = []\n for char in s:\n if char != ']':\n stack.append(char)\n else:\n num = \"\"\n temp = \"\"\n while stack and stack[-1] != '[':\n temp += stack.pop()\n temp = temp[::-1]\n stack.pop()\n\n while stack and stack[-1].isnumeric():\n num += stack.pop()\n num = num[::-1]\n stack.extend(c for c in (temp * int(num)))\n print(stack)\n return ''.join(stack)\n\n \n \n\n\n \n\n\n \n\n\n \n\n \n\n \n \n \n\n ","runtime":"12"},{"code":"class Solution:\n def decodeString(self, s: str) -> str:\n stack = []\n\n for char in s:\n if char != \"]\":\n stack.append(char)\n \n else: \n curr_str = \"\"\n while stack[-1] != \"[\":\n curr_str = stack.pop() + curr_str\n stack.pop()\n\n curr_num = \"\"\n while stack and stack[-1].isdigit():\n curr_num = stack.pop() + curr_num\n \n curr_str = int(curr_num) * curr_str\n stack.append(curr_str)\n\n return \"\".join(stack)\n","runtime":"14"},{"code":"class Solution:\n def decodeString(self, s: str) -> str:\n \n '''Create stack where string is placed in reverse'''\n '''two check\n\n first check if it is a number. if so pop it and store that number. then pop the bracket. then pop the sequence of\n numbers until bracket is reached and store the numbers. then pop the bracket. then repeat the sequence of numbers the needed amount.\n\n second check if it is just a letter that is next. if so pop that letter and include it in the output.\n\n print output when stack is empty\n\n '''\n\n stack = []\n\n for i in range(len(s)):\n if s[i] != ']':\n stack.append(s[i])\n\n else:\n substring = \"\"\n while stack[-1] != '[':\n substring = stack.pop() + substring\n stack.pop()\n\n k = \"\"\n while stack and stack[-1].isdigit():\n k = stack.pop() + k\n stack.append(int(k) * substring)\n \n return \"\".join(stack)\n","runtime":"15"},{"code":"class Solution:\n def decodeString(self, s: str) -> str:\n \n s = '1[' + s + ']'\n processingStack = []\n\n for c in s:\n if c != ']':\n processingStack.append(c)\n else:\n encoded_string = \"\"\n while processingStack and processingStack[-1] != '[':\n encoded_string = processingStack.pop() + encoded_string\n processingStack.pop()\n count = \"\"\n while processingStack and processingStack[-1].isdigit():\n count = processingStack.pop() + count\n encoded_string = encoded_string * int(count)\n processingStack.append(encoded_string)\n \n return processingStack[0]","runtime":"16"},{"code":"class Solution:\n # Stack time: O(n + sum(k))\n # Stack space: O(m) or O(maxK^countK * n)\n\n # Recursion time: O(n + sum(k))\n # Stack space: O(n + m) or O(n + maxK^countK * n)\n \n def decodeString(self, s: str) -> str:\n ans = []\n \n for char in s:\n if char == \"]\":\n temp = []\n final_temp = []\n for i in range(len(ans)):\n current = ans.pop()\n if current == \"[\":\n rep = []\n for i in range(len(ans)-1, -1, -1):\n if ans[i].isdigit():\n rep = [ans.pop()] + rep\n else:\n break\n rep = int(\"\".join(rep))\n for i in range(rep):\n final_temp.append(\"\".join(temp[::-1]))\n break\n else:\n temp.append(current)\n ans.append(\"\".join(final_temp))\n else:\n ans.append(char)\n \n\n return \"\".join(ans)\n \n","runtime":"17"},{"code":"class Solution:\n def decodeString(self, s: str) -> str:\n stack = []\n for char in s:\n if char != ']':\n stack.append(char)\n else:\n decoded_str = \"\"\n while stack and stack[-1] != '[':\n decoded_str = stack.pop() + decoded_str\n stack.pop() # discard \"[\"\n \n no = \"\"\n while stack and stack[-1].isdigit():\n no = stack.pop() + no\n stack.append(decoded_str * int(no))\n\n return \"\".join(stack)","runtime":"18"},{"code":"class Solution:\n def decodeString(self, s: str) -> str:\n res = []\n\n for char in s:\n if char != \"]\":\n res.append(char)\n else:\n temp_str = \"\"\n while res[-1] != \"[\":\n temp_str = res.pop() + temp_str\n \n res.pop() # pop the \"[\"\n\n num_str = \"\"\n while len(res)>=1 and res[-1].isdigit():\n num_str = res.pop() + num_str\n \n res.append(int(num_str) * temp_str)\n \n \n return \"\".join(res)","runtime":"19"},{"code":"